Pagini recente » Borderou de evaluare (job #2023366) | Borderou de evaluare (job #1157018) | Borderou de evaluare (job #1409883) | Borderou de evaluare (job #498062) | Borderou de evaluare (job #1888454)
Borderou de evaluare (job #1888454)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:3:77: warning: array subscript has type ‘char’ [-Wchar-subscripts]
int v[256],d[3],n,t,i,o;char c;int main(){ifstream f("cristale.in");f>>c;v[c]=0;f>>c;v[c]=1;f>>c;v[c]=2;f>>t;ofstream g("cristale.out");while(t--){f>>n;o=0;for(i=0;i<n;++i){f>>c;++d[v[c]];if(d[v[c]]==n)o=1;}if((d[0]%2==d[1]%2)&&(d[1]%2==d[2]%2)&&!o)g<<"2\n";else if(o)g<<n<<'\n'; else g<<"1\n";d[0]=0;d[1]=0;d[2]=0;}return 0;}
^
user.cpp:3:89: warning: array subscript has type ‘char’ [-Wchar-subscripts]
int v[256],d[3],n,t,i,o;char c;int main(){ifstream f("cristale.in");f>>c;v[c]=0;f>>c;v[c]=1;f>>c;v[c]=2;f>>t;ofstream g("cristale.out");while(t--){f>>n;o=0;for(i=0;i<n;++i){f>>c;++d[v[c]];if(d[v[c]]==n)o=1;}if((d[0]%2==d[1]%2)&&(d[1]%2==d[2]%2)&&!o)g<<"2\n";else if(o)g<<n<<'\n'; else g<<"1\n";d[0]=0;d[1]=0;d[2]=0;}return 0;}
^
user.cpp:3:101: warning: array subscript has type ‘char’ [-Wchar-subscripts]
int v[256],d[3],n,t,i,o;char c;int main(){ifstream f("cristale.in");f>>c;v[c]=0;f>>c;v[c]=1;f>>c;v[c]=2;f>>t;ofstream g("cristale.out");while(t--){f>>n;o=0;for(i=0;i<n;++i){f>>c;++d[v[c]];if(d[v[c]]==n)o=1;}if((d[0]%2==d[1]%2)&&(d[1]%2==d[2]%2)&&!o)g<<"2\n";else if(o)g<<n<<'\n'; else g<<"1\n";d[0]=0;d[1]=0;d[2]=0;}return 0;}
^
user.cpp:3:186: warning: array subscript has type ‘char’ [-Wchar-subscripts]
int v[256],d[3],n,t,i,o;char c;int main(){ifstream f("cristale.in");f>>c;v[c]=0;f>>c;v[c]=1;f>>c;v[c]=2;f>>t;ofstream g("cristale.out");while(t--){f>>n;o=0;for(i=0;i<n;++i){f>>c;++d[v[c]];if(d[v[c]]==n)o=1;}if((d[0]%2==d[1]%2)&&(d[1]%2==d[2]%2)&&!o)g<<"2\n";else if(o)g<<n<<'\n'; else g<<"1\n";d[0]=0;d[1]=0;d[2]=0;}return 0;}
^
user.cpp:3:197: warning: array subscript has type ‘char’ [-Wchar-subscripts]
int v[256],d[3],n,t,i,o;char c;int main(){ifstream f("cristale.in");f>>c;v[c]=0;f>>c;v[c]=1;f>>c;v[c]=2;f>>t;ofstream g("cristale.out");while(t--){f>>n;o=0;for(i=0;i<n;++i){f>>c;++d[v[c]];if(d[v[c]]==n)o=1;}if((d[0]%2==d[1]%2)&&(d[1]%2==d[2]%2)&&!o)g<<"2\n";else if(o)g<<n<<'\n'; else g<<"1\n";d[0]=0;d[1]=0;d[2]=0;}return 0;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 416kb | OK | 10 |
2 | 0ms | 408kb | OK | 10 |
3 | 0ms | 408kb | OK | 10 |
4 | 0ms | 424kb | OK | 10 |
5 | 0ms | 416kb | OK | 10 |
6 | 0ms | 420kb | OK | 10 |
7 | 0ms | 416kb | OK | 10 |
8 | 0ms | 412kb | OK | 10 |
9 | 0ms | 420kb | OK | 10 |
10 | 0ms | 424kb | OK | 10 |
Punctaj total | 100 |