Pagini recente » Borderou de evaluare (job #1996616) | Borderou de evaluare (job #515143) | Borderou de evaluare (job #2974595) | Borderou de evaluare (job #356983) | Borderou de evaluare (job #2017073)
Borderou de evaluare (job #2017073)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:2:100: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int n,v[1000007],q[1000007],s=-1,i;int main(){freopen("mincinosi.in","r",stdin);freopen("mincinosi.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&v[i]);q[v[i]]++;}for(i=0;i<=n;i++)if((i+q[i])==n){s=i;break;}printf("%d\n",q[s]);for(i=1;i<=n;i++)if(v[i]==s)printf("%d\n",i);}
^
user.cpp:2:136: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int n,v[1000007],q[1000007],s=-1,i;int main(){freopen("mincinosi.in","r",stdin);freopen("mincinosi.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&v[i]);q[v[i]]++;}for(i=0;i<=n;i++)if((i+q[i])==n){s=i;break;}printf("%d\n",q[s]);for(i=1;i<=n;i++)if(v[i]==s)printf("%d\n",i);}
^
user.cpp:2:151: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int n,v[1000007],q[1000007],s=-1,i;int main(){freopen("mincinosi.in","r",stdin);freopen("mincinosi.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&v[i]);q[v[i]]++;}for(i=0;i<=n;i++)if((i+q[i])==n){s=i;break;}printf("%d\n",q[s]);for(i=1;i<=n;i++)if(v[i]==s)printf("%d\n",i);}
^
user.cpp:2:187: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int n,v[1000007],q[1000007],s=-1,i;int main(){freopen("mincinosi.in","r",stdin);freopen("mincinosi.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&v[i]);q[v[i]]++;}for(i=0;i<=n;i++)if((i+q[i])==n){s=i;break;}printf("%d\n",q[s]);for(i=1;i<=n;i++)if(v[i]==s)printf("%d\n",i);}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 276kb | Corect! | 10 |
2 | 0ms | 276kb | Corect! | 10 |
3 | 0ms | 272kb | Corect! | 10 |
4 | 4ms | 396kb | Corect! | 10 |
5 | 24ms | 896kb | Corect! | 10 |
6 | 76ms | 1912kb | Corect! | 10 |
7 | 208ms | 4184kb | Corect! | 10 |
8 | 320ms | 5748kb | Corect! | 10 |
9 | 488ms | 8080kb | Corect! | 10 |
10 | 492ms | 8076kb | Corect! | 10 |
Punctaj total | 100 |