paul08colin

http://projecteuler.net/problem=10#include #include using namespace std;const int MAXN = 2000000;bool prime[MAXN + 10] = {1,1,0};int main(){ int i; int j; int ans = 0; long long lans =

#include #include using namespace std;const int MAXN = 100000000;bool prime[MAXN + 10] = {1,1,0};int allprime[MAXN/10 + 10];int main(){ int i,j; int sub = 0; for(i = 2; i <= MAXN; i++) {

//============================================================================// Name : pe25.cpp// Author : paul08colin// Version :// Copyright : Your copyright notice// Descrip

#include #include #include using namespace std;const long long MAXN = 1000000;long long dp[MAXN + 10];long long SumChain(long long n){ long long sum = 0;// cout<<endl; while(n != 1) { //c

http://projecteuler.net/problem=22#include #include #include #include using namespace std;int cmp(const void* e1,const void* e2){ char* a1; char* a2; a1 = (char*)e1; a2 = (char*)

http://projecteuler.net/problem=16#include #include #include using namespace std;int main(){ int ans[305]; memset(ans,0,sizeof(ans)); ans[0] = 1; int carry = 0; int i,j; for(i = 1; i

http://projecteuler.net/problem=15简单dp,话说腾讯12年笔试题，出了题类似这题的#include using namespace std;int main(){ long long map[21][21]; map[0][0] = 1; int i,j; for(i = 0; i < 21; i++) { map[0][i] =

projecteuler.net/problems#include #include #include using namespace std;long long SumFactor(long long n){ long long ans = 0; long long i; long long end = sqrt(n + 0.0) + 1;//可大大减少时间开销 f

http://projecteuler.net/problem=11暴力枚举#include #include using namespace std;int main(){ int matrix[410] ={ 8,02,22,97,38,15,00,40,00,75,04,05,07,78,52,12,50,77,91,8, 49,49,99,40,17,8

简单dp#include #include using namespace std;int main(){ int num[20][25] = {{75},{95, 64},{17,47,82},{18,35,87,10},{ 20,04,82,47,65},{ 19,01,23,75,03,34},{ 88,02,77,73,07,63,67},{ 99,65,04,28,06,1