Largest prime factor（最大素數因子）

阿新 • • 發佈：2019-01-04

Largest prime factor

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 6106 Accepted Submission(s): 1876

Problem Description Everybody knows any number can be combined by the prime number.
Now, your task is telling me what position of the largest prime factor.
The position of prime 2 is 1, prime 3 is 2, and prime 5 is 3, etc.
Specially, LPF(1) = 0.

Input Each line will contain one integer n(0 < n < 1000000).

Output Output the LPF(n).

Sample Input

Sample Output

給出一個數，求其最大質因數所在全體素數的第幾位

#include<stdio.h>
int a[1000010],b[1000001];
int main()
{a[0]=1;
a[1]=1;
int k=1;
for(int i=2;i<1000010;i++)
{if(a[i]==0)
{b[i]=k++;//定位
	for(int j=i;j<1000010;j=j+i)
	a[j]=i;//最大素數因子
}
}
b[1]=0;
int n,sum;
while(~scanf("%d",&n))
{
	printf("%d\n",b[a[n]]);
}
	
}

Largest prime factor（最大素數因子）

Largest prime factor Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others

POJ 1811 Prime Test（判斷大素數&求最小質因子）

題意：給你一個n(2<=n<=54)，問你它是不是一個素數，如果不是輸出其最小質因子。思路：板子。用Miller_Rabin演算法進行素數判斷。在用Pollard_rho分解因子。程式碼： #include<iostream> #includ

HDU Largest prime factor（埃拉托色尼篩選法求素數模板法改動）

題意：給你一個數，求它這個數的最大素因子在素數表的第幾位思路：剛開始思路有一點錯誤，看錯誤程式碼錯誤程式碼： #include <iostream>0 #include <cs

c++訓練題（求某個數的最大質數因子）兼自己寫的一個列印一定範圍內質數方法

題目：Largest prime factor The prime factors of 13195 are 5 7 13 29, what is the largest prime factor of the number 600851475143? 大概意思是，數131

[C++]LeetCode: 133 Largest Rectangle in Histogram（最大矩形面積）

題目： Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rec

485. Max Consecutive Ones （最大連續數） by Python

大連 put int statistic inpu one emp bin 簡單 485. Max Consecutive Ones 題目： Given a binary array, find the maximum number of consecutive 1s in

HNU 13411 Reverse a Road II（最大流+BFS）經典

ret ring connect 我們 users directly void whether take Reverse a Road II Time Limit: 10000ms, Special Time Limit:25000ms,

POJ2689:Prime Distance（大數區間素數篩）

possible lib ios rop sel poj art eve led The branch of mathematics called number theory is about properties of numbers. One of the areas

POJ 3692 Kindergarten（最大團問題）

nta class 怎麽 pro HP 思路 color 如何 online 題目鏈接：http://poj.org/problem?id=3692 Description In a kindergarten, there are a lot of kids. All

SPOJ：One piece（最大匹配問題）（Gut Problem！）

這一 bit 估值 clu 排除 DC multipl contain any One of DB and TN common interests is traveling. One day, they went to Grand Line and found One Pi

Bad Cowtractors（最大生成樹）

found ins -m 普裏姆算法卡爾 eal following void HR Description Bessie has been hired to build a cheap internet network among Farmer John

poj Drainage Ditches（最大流入門）

minute ostream 代碼 gin ted pat 當前 earch http Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions:

K - Treasure Exploration （最大路徑覆蓋）

K - Treasure Exploration Have you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you eve

HDU3829：Cat VS Dog（最大獨立集）

Cat VS Dog Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 4751 &n

Newcoder 111 D.托米去購物（最大流-dinic）

Description 由於這裡什麼都沒有，於是他去超市選了很多生活用品，更多的是吃的，然後推著堆滿零食的購物車到櫃檯等待結賬。當然，我們都知道他的錢包裡有很多錢。但是，作為一名為生活精打細算的男孩子，他更願意使用其他支付方式如：飯券，禮券，不同型別的優惠券等。但是飯券只能用於

HDU 3829 - Cat VS Dog（最大獨立集）

The zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the child's like-an

HDU 1068 - Girls and Boys （最大獨立集）

the second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is def

poj1469（最大二分匹配）

題目大意：一共有N個學生跟P門課程,一個學生可以任意選一門或多門課,問是否達成: 1.每個學生選的都是不同的課(即不能有兩個學生選同一門課) 2.每門課都有一個代表(即P門課都被成功選過) 輸入為: P N(課程數跟學生數) 接著有P行,格式為Cou

[POI2005]KOS-Dicing （最大流+二分）lg3425

題面https://www.luogu.org/problemnew/show/P3425 題面說贏的最多的人最少贏幾場，肯定是向二分的方向思考建立源點向每一場比賽連容量為1的邊，從每場比賽向參賽兩個人各連一條容量為1的邊，表示一場比賽有一個人贏二分一個最多的人贏的場數，從每個人向匯點連

Leetcode：300. Longest Increasing Subsequence（最大增長序列）

Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18] Output: 4 Explanati

Largest prime factor（最大素數因子）

Largest prime factor

相關推薦