Project Euler__problem 7
2017-11-08 21:50
337 查看
Problem 7
10001st prime
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.What is the 10 001st prime number?
第10001个素数
列出前6个素数,它们分别是2、3、5、7、11和13。我们可以看出,第6个素数是13。第10,001个素数是多少?
最近这段时间都很忙,一直没什么机会去做PE了
趁着有空的时间,临急临忙刷了第7题
感觉上还是有点复杂,不会简单的算法。
#include<iostream> int zhishu(int num) { int i; for (i = num / 2; i > 1; i--) if (num%i != 0) continue; else break; if (i == 1) return true; else return false; } void main() { int number=2,cout=0; for (;; number++) if (zhishu(number)) { cout++; if (cout == 10001) break; } std::cout <<"第10001个质数是"<< number << std::endl; system("pause"); }
最后得出的结果是104743
相关文章推荐
- 【Project Euler】【Problem 10】Summation of primes
- Project Euler:Problem 18 Maximum path sum I
- Project Euler:Problem 26 Reciprocal cycles
- Project Euler:Problem 49 Prime permutations
- [Project Euler]加入欧拉 Problem 10
- Project Euler:Problem 53 Combinatoric selections
- Project Euler:Problem 61 Cyclical figurate numbers
- Project Euler:Problem 67 Maximum path sum II
- Project Euler:Problem 69 Totient maximum
- Project Euler:Problem 81 Path sum: two ways
- Project Euler:Problem 84 Monopoly odds
- Project Euler__problem 5
- [Project Euler] Problem 18 & Problem 67
- Project Euler - Problem 5
- Project Euler – Problem 21
- [Project Euler]Problem 28
- Project Euler:Problem 19 Counting Sundays
- Project Euler:Problem 27 Quadratic primes
- Project Euler:Problem 36 Double-base palindromes
- Project Euler:Problem 44 Pentagon numbers