http://projecteuler.net/problem=15 [Answer:137846528820]
2011-11-26 16:01
465 查看
#include <iostream>
using namespace std;
int main()
{
__int64 routes = 1;
int n = 40;
int m = 1;
while ( n > m )
{
routes *= n;
routes /= m;
--n;
++m;
}
cout << routes << endl;
return 0;
}
using namespace std;
int main()
{
__int64 routes = 1;
int n = 40;
int m = 1;
while ( n > m )
{
routes *= n;
routes /= m;
--n;
++m;
}
cout << routes << endl;
return 0;
}
相关文章推荐
- http://projecteuler.net/problem=14 [Answer:837799]
- http://projecteuler.net/problem=13 [Answer:5537376230]
- http://projecteuler.net/problem=26 [Answer:983]
- http://projecteuler.net/problem=38 [Answer:932718654]
- http://projecteuler.net/problem=27 [Answer:-59231]
- http://projecteuler.net/problem=28 [Answer:669171001]
- http://projecteuler.net/problem=32 [Answer:45228]
- http://projecteuler.net/problem=16 [Answer:1366]
- http://projecteuler.net/problem=19 [Answer:171]
- http://projecteuler.net/problem=39 [Answer:840]
- http://projecteuler.net/problem=5 [Answer:232792560]
- http://projecteuler.net/problem=20 [Answer:648]
- http://projecteuler.net/problem=29 [Answer:9183]
- http://projecteuler.net/problem=6 [Answer:25164150]
- http://projecteuler.net/problem=21 [Answer:31626]
- http://projecteuler.net/problem=25 [Answer:4782]
- http://projecteuler.net/problem=30 [Answer:443839]
- http://projecteuler.net/problem=7 [Answer:104743]
- http://projecteuler.net/problem=8 [Answer:40824]
- http://projecteuler.net/problem=34 [Answer:40730]