1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T448,#include #include using namespace std; #define MAX_VAL 4000000 int N; vector isPrime; void sieve(vector &isPrime); int twoPointer(); int nextPrimeNum(int n); int main(){ ios::sync_with_stdio(0); cin.tie(NULL); isPrime = vector(MAX_VAL + 1, true); sieve(isPrime); cin >> N; cout << twoPointer() << '\n'; return 0; } void sieve(vector &arr){ arr[0] = arr[1] = false; for(int i = 2; i * i <= MAX_VAL; i++){ if(arr[i]){ for(int j = i * i; j <= MAX_VAL; j += i){ arr[j] = false; } } } } int twoPointer(){ int i = 2, j = 2, sum = 2, cnt = 0; while(i > 0 && j > 0){ if(sum > N){ sum -= isPrime[i]; i = nextPrimeNum(i); } else{ j = nextPrimeNum(j); if(j > 0) sum += isPrime[j]; if(sum == N) cnt++; } } return

제출 #118594

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: