#ifdef __GNUC__ #pragma GCC optimize ("O3") #pragma GCC target ("avx") #endif #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include//assert(); #include ///////// #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define P(p) cout<<(p)< #define MAIN_INIT std::cin.tie(0); \ std::ios::sync_with_stdio(false);\ std::cout << std::fixed;//小数を10進数表示 ///////// #ifdef getchar_unlocked #define mygc(c) (c)=getchar_unlocked() #else #define mygc(c) (c)=getchar() #endif #ifdef putchar_unlocked #define mypc(c) putchar_unlocked(c) #else #define mypc(c) putchar(c) #endif ///////// typedef long long LL; typedef long double LD; typedef unsigned long long ULL; ///////// using namespace::std; ///////// #ifdef _DEBUG #define DEBUG_BOOL(b) assert(b) #else #define DEBUG_BOOL(b) #endif /////数値読み込み #define ENABLE_READER_ON(T) \ inline void reader(T &x){int k;x = 0;bool flag = true;\ while(true){mygc(k);\ if( k == '-'){flag = false;break;}if('0' <= k && k <= '9'){x = k - '0';break;}\ }\ if( flag ){while(true){mygc(k);if( k<'0' || '9' inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);} // 最小公倍数 template inline T lcm(T a, T b){return a * b / gcd(a, b);} //////////////////////////////// int primeMax; vector prime; vector flag; vector wa;//wa[i]までの素数の和 void makePrime(int N){ flag = vector(N+1,true); prime.push_back(2); for(int i=4;i<=N;i+=2){ flag[i] = false; } for(int i=3;i<=N;i+=2){ if( flag[i] == true ){ for(int j=i+i;j<=N;j+=i){ flag[j] = false; } prime.push_back( i ); } } primeMax = prime.size(); } //大きい素数から取る //num:残り,int val int dfs(int num,int val,int index){ if( num == 0 ){ return val; } int scoreMax = -1; int score; for(int i=index-1;i>=0;--i){ if( wa[i] < num ){//全て足しても足りない。 break; } score = dfs(num-prime[i],val+1,i); scoreMax = max(scoreMax,score); } return scoreMax; } inline void solve(){ int N; reader(N);//20000 makePrime(N); wa = vector(primeMax,0); wa[0] = prime[0]; for(int i=1;i