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:T47c,#include #include int main(int argc, char *argv[]) { std::ios::sync_with_stdio(false); std::cin.tie(0); std::vector isPrime(400001, true); std::vector prime; isPrime[1] = false; for (int i = 2; i < 400001; i++) { if (isPrime[i]) { int k = 2; prime.push_back(i); while (i * k <= 400000) { isPrime[i*k] = false; k += 1; } } } int firstIndex = 0, secondIndex = 0, n; std::cin >> n; int sum = 2; int ans = 0; while (firstIndex <= secondIndex && secondIndex < prime.size()) { // std::cout << sum << "\n"; if (firstIndex == secondIndex) { if (sum <= n) { if (sum == n) ans += 1; secondIndex += 1; if (secondIndex < prime.size()) sum += prime[secondIndex]; } else if (sum > n) { sum -= prime[firstIndex]; firstIndex += 1; } } else { // firstIndex < secondIndex if (sum <= n) { if (sum == n) ans += 1; secondIndex += 1;

제출 #62680

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: