![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Project Euler
jsszwc
这个作者很懒,什么都没留下…
展开
-
project euler 21~25
Problem 21 Amicable numbers#include <iostream>#include <cstdio>#include <cmath>using namespace std;const int N = 10000 + 10;int work(int n) { int factorSum[N]; for(...原创 2019-12-08 20:56:57 · 128 阅读 · 0 评论 -
project euler 16~20
Problem 16 Power digit sum思路高精度乘法,这里用了万进制数,可以少一些循环#include <iostream>#include <cstdio>using namespace std;const int N = 1000 + 10;int work(int x, int n) { int dig[N]; in...原创 2019-12-05 21:56:08 · 232 阅读 · 0 评论 -
project euler 11~15
Problem 11#include <iostream>#include <cstdio>using namespace std;const int N = 20 + 10;int work(int n) { int arr[N][N]; for(int i = 0; i < n; ++i) { for(int j ...原创 2019-12-05 21:27:40 · 137 阅读 · 0 评论 -
project euler 6~10
Problem 6 Sum square difference#include <iostream>#include <cstdio>using namespace std;int work(int n) { int t1 = 0, t2 = 0; for(int i = 1; i <= n; i++) { t1 += i...原创 2019-12-03 22:40:20 · 115 阅读 · 0 评论 -
project euler 1~5
Problem 1 Multiples of 3 and 5#include <iostream>#include <cstdio>using namespace std;int work(int n) { int ans = 0; for(int i = 0; i < n; i++) { ans += (i%3 == 0...原创 2019-12-03 22:17:24 · 114 阅读 · 0 评论