http://projecteuler.net/problem=26 [Answer:983]
2011-11-27 22:50
627 查看
#include <iostream> #include <algorithm> using namespace std; int main() { const int N = 1000; int postion ; int d = 0; int longest = 0; for ( int i = 2; i < N; ++i ) { postion[1] = 0; fill( postion+1, postion+i, 0 ); int remainder = 1; for ( int pos = 1; ; ++pos ) { remainder = remainder * 10 % i; if ( remainder == 0 ) { break; } if ( postion[remainder] != 0 ) { int diff = pos - postion[remainder]; if ( diff > longest ) { longest = diff; d = i; } break; } postion[remainder] = pos; } } cout << d << endl; return 0; }
相关文章推荐
- http://projecteuler.net/problem=29 [Answer:9183]
- http://projecteuler.net/problem=14 [Answer:837799]
- http://projecteuler.net/problem=19 [Answer:171]
- http://projecteuler.net/problem=25 [Answer:4782]
- http://projecteuler.net/problem=20 [Answer:648]
- http://projecteuler.net/problem=40 [Answer:210]
- http://projecteuler.net/problem=5 [Answer:232792560]
- http://projecteuler.net/problem=13 [Answer:5537376230]
- http://projecteuler.net/problem=15 [Answer:137846528820]
- http://projecteuler.net/problem=21 [Answer:31626]
- http://projecteuler.net/problem=6 [Answer:25164150]
- http://projecteuler.net/problem=7 [Answer:104743]
- http://projecteuler.net/problem=32 [Answer:45228]
- http://projecteuler.net/problem=8 [Answer:40824]
- http://projecteuler.net/problem=38 [Answer:932718654]
- http://projecteuler.net/problem=16 [Answer:1366]
- http://projecteuler.net/problem=17 [Answer:21124]
- http://projecteuler.net/problem=27 [Answer:-59231]
- http://projecteuler.net/problem=18 [Answer:1074]
- http://projecteuler.net/problem=23 [Answer:4179871]