Pagini recente » Borderou de evaluare (job #2669494) | Borderou de evaluare (job #257577) | Borderou de evaluare (job #1529760) | Borderou de evaluare (job #1654696) | Borderou de evaluare (job #1468976)
Borderou de evaluare (job #1468976)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:2:68: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
int v[50001];int main(){int n,k,i,p,u;freopen("secv2.in","r",stdin);freopen("secv2.out","w",stdout);scanf("%d%d",&n,&k);for(i=1;i<=n;++i){scanf("%d",&v[i]);v[i]+=v[i-1];}for(i=k,u=k;i<=n;++i)if(v[i]>v[u])u=i;for(i=u-k,p=u-k;i>=0;--i)if(v[i]<v[p])p=i;printf("%d %d %d\n",p+1,u,v[u]-v[p]);return 0;}
^
user.cpp:2:100: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
int v[50001];int main(){int n,k,i,p,u;freopen("secv2.in","r",stdin);freopen("secv2.out","w",stdout);scanf("%d%d",&n,&k);for(i=1;i<=n;++i){scanf("%d",&v[i]);v[i]+=v[i-1];}for(i=k,u=k;i<=n;++i)if(v[i]>v[u])u=i;for(i=u-k,p=u-k;i>=0;--i)if(v[i]<v[p])p=i;printf("%d %d %d\n",p+1,u,v[u]-v[p]);return 0;}
^
user.cpp:2:120: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int v[50001];int main(){int n,k,i,p,u;freopen("secv2.in","r",stdin);freopen("secv2.out","w",stdout);scanf("%d%d",&n,&k);for(i=1;i<=n;++i){scanf("%d",&v[i]);v[i]+=v[i-1];}for(i=k,u=k;i<=n;++i)if(v[i]>v[u])u=i;for(i=u-k,p=u-k;i>=0;--i)if(v[i]<v[p])p=i;printf("%d %d %d\n",p+1,u,v[u]-v[p]);return 0;}
^
user.cpp:2:156: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int v[50001];int main(){int n,k,i,p,u;freopen("secv2.in","r",stdin);freopen("secv2.out","w",stdout);scanf("%d%d",&n,&k);for(i=1;i<=n;++i){scanf("%d",&v[i]);v[i]+=v[i-1];}for(i=k,u=k;i<=n;++i)if(v[i]>v[u])u=i;for(i=u-k,p=u-k;i>=0;--i)if(v[i]<v[p])p=i;printf("%d %d %d\n",p+1,u,v[u]-v[p]);return 0;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 268kb | OK! | 10 |
2 | 0ms | 268kb | OK! | 10 |
3 | 0ms | 272kb | OK! | 10 |
4 | 0ms | 268kb | OK! | 10 |
5 | 0ms | 288kb | OK! | 10 |
6 | 0ms | 304kb | OK! | 10 |
7 | 4ms | 328kb | OK! | 10 |
8 | 8ms | 364kb | OK! | 10 |
9 | 8ms | 396kb | OK! | 10 |
10 | 12ms | 460kb | OK! | 10 |
Punctaj total | 100 |