| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 19758 | 陈路垚 | 连续非素数的最长度 | C++ | Accepted | 100 | 108 MS | 252 KB | 297 | 2021-05-22 14:37:55 |
#include<bits/stdc++.h> using namespace std; int isprime(int x){ int i; for(i=2;i*i<=x;++i) if(x%i==0) return 0; return 1; } int main() { int n,i,ans=0,sum=0; cin>>n; for(i=2;i<=n;++i){ if(isprime(i)) sum=0; else sum++; if(sum>ans) ans=sum; } cout<<ans; return 0; }