Borderou de evaluare (job #2017063)

Utilizator OlivianOlivian Dan Cretu Olivian Data 31 august 2017 10:53:43
Problema Mincinosi Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:2:109: 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,v1[1000007],v2[1000007],sol=-1,ct=0,i;int main(){freopen("mincinosi.in","r",stdin);freopen("mincinosi.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&v1[i]);v2[v1[i]]++;}for(i=0;i<=n;i++)if((i+v2[i])==n){sol=i;break;}printf("%d\n",v2[sol]);for(i=1;i<=n;i++)if(v1[i]==sol)printf("%d\n",i);} ^ user.cpp:2:145: 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,v1[1000007],v2[1000007],sol=-1,ct=0,i;int main(){freopen("mincinosi.in","r",stdin);freopen("mincinosi.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&v1[i]);v2[v1[i]]++;}for(i=0;i<=n;i++)if((i+v2[i])==n){sol=i;break;}printf("%d\n",v2[sol]);for(i=1;i<=n;i++)if(v1[i]==sol)printf("%d\n",i);} ^ user.cpp:2:160: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int n,v1[1000007],v2[1000007],sol=-1,ct=0,i;int main(){freopen("mincinosi.in","r",stdin);freopen("mincinosi.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&v1[i]);v2[v1[i]]++;}for(i=0;i<=n;i++)if((i+v2[i])==n){sol=i;break;}printf("%d\n",v2[sol]);for(i=1;i<=n;i++)if(v1[i]==sol)printf("%d\n",i);} ^ user.cpp:2:197: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;int n,v1[1000007],v2[1000007],sol=-1,ct=0,i;int main(){freopen("mincinosi.in","r",stdin);freopen("mincinosi.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&v1[i]);v2[v1[i]]++;}for(i=0;i<=n;i++)if((i+v2[i])==n){sol=i;break;}printf("%d\n",v2[sol]);for(i=1;i<=n;i++)if(v1[i]==sol)printf("%d\n",i);} ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms276kbCorect!10
20ms276kbCorect!10
30ms280kbCorect!10
44ms400kbCorect!10
528ms892kbCorect!10
680ms1912kbCorect!10
7200ms4180kbCorect!10
8292ms5744kbCorect!10
9500ms8076kbCorect!10
10480ms8076kbCorect!10
Punctaj total100

Ceva nu functioneaza?