Pagini recente » Borderou de evaluare (job #308718) | Borderou de evaluare (job #2574148) | Borderou de evaluare (job #695415) | Borderou de evaluare (job #151319) | Borderou de evaluare (job #2574651)
Borderou de evaluare (job #2574651)
Raport evaluator
Compilare:
main.cpp:55:35: warning: multi-character character constant [-Wmultichar]
if(!stergere) g<<cuv[i]<<'/n';}
^~~~
main.cpp: In function 'bool cauta(std::__cxx11::string, std::__cxx11::string)':
main.cpp:12:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(k<s1.length()&&j<s2.length())
~^~~~~~~~~~~~
main.cpp:12:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(k<s1.length()&&j<s2.length())
~^~~~~~~~~~~~
main.cpp:17:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(j==s2.length())
~^~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:35:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
{if(cuv[i].length()>max)
~~~~~~~~~~~~~~~^~~~
main.cpp:39:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(cuv[i].length()==max)
~~~~~~~~~~~~~~~^~~~~
main.cpp:46:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for(i=1;i<n;i++)
^~~
main.cpp:49:6: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'for'
{if(s.length()>s.length()&&cauta(cuv[j],s)==true)
^
main.cpp:55:13: warning: the address of 'void stergere(std::__cxx11::string*, int&, int)' will always evaluate as 'true' [-Waddress]
if(!stergere) g<<cuv[i]<<'/n';}
^~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 4ms | 655kb | OK. | 5 | 0 |
2 | 10ms | 786kb | Killed by Signal 11 | 0 |
3 | 2ms | 131kb | OK. | 5 |
4 | 3ms | 262kb | OK. | 5 |
5 | 2ms | 131kb | Numar de siruri incorect. | 0 | 0 |
6 | 4ms | 393kb | Numar de siruri incorect. | 0 | 0 |
7 | 2ms | 131kb | Numar de siruri incorect. | 0 | 0 |
8 | 4ms | 393kb | Numar de siruri incorect. | 0 | 0 |
9 | 10ms | 1310kb | Numar de siruri incorect. | 0 | 0 |
10 | 6ms | 655kb | Numar de siruri incorect. | 0 | 0 |
11 | 9ms | 1179kb | Numar de siruri incorect. | 0 | 0 |
12 | 7ms | 917kb | Numar de siruri incorect. | 0 | 0 |
13 | 7ms | 917kb | Numar de siruri incorect. | 0 | 0 |
14 | 7ms | 786kb | Numar de siruri incorect. | 0 | 0 |
15 | 7ms | 917kb | Numar de siruri incorect. | 0 | 0 |
16 | 7ms | 917kb | Numar de siruri incorect. | 0 | 0 |
17 | 7ms | 917kb | Numar de siruri incorect. | 0 | 0 |
18 | 10ms | 1310kb | Numar de siruri incorect. | 0 | 0 |
19 | 10ms | 1310kb | Numar de siruri incorect. | 0 | 0 |
20 | 9ms | 1310kb | Numar de siruri incorect. | 0 | 0 |
21 | 9ms | 1310kb | Numar de siruri incorect. | 0 | 0 |
22 | 9ms | 1310kb | Numar de siruri incorect. | 0 | 0 |
Punctaj total | 0 |