Pagini recente » Borderou de evaluare (job #1975653) | Borderou de evaluare (job #533928) | Borderou de evaluare (job #759403) | Borderou de evaluare (job #1579912) | Borderou de evaluare (job #2017067)
Borderou de evaluare (job #2017067)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:3:97: 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[u],v2[u],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:3:133: 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[u],v2[u],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:3:148: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int n,v1[u],v2[u],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:3:185: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int n,v1[u],v2[u],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 |
1 | 0ms | 272kb | Corect! | 10 |
2 | 0ms | 272kb | Corect! | 10 |
3 | 0ms | 276kb | Corect! | 10 |
4 | 4ms | 396kb | Corect! | 10 |
5 | 24ms | 900kb | Corect! | 10 |
6 | 80ms | 1916kb | Corect! | 10 |
7 | 204ms | 4180kb | Corect! | 10 |
8 | 320ms | 5740kb | Corect! | 10 |
9 | 480ms | 8076kb | Corect! | 10 |
10 | 468ms | 8072kb | Corect! | 10 |
Punctaj total | 100 |