Pagini recente » Borderou de evaluare (job #1659136) | Borderou de evaluare (job #514894) | Borderou de evaluare (job #1547884) | Borderou de evaluare (job #1225362) | Borderou de evaluare (job #2292398)
Borderou de evaluare (job #2292398)
Raport evaluator
Compilare:
main.cpp: In function 'long long int factorial(int)':
main.cpp:14:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
main.cpp: In function 'int main()':
main.cpp:46:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for (int i=0 ; i<nr ; i++)
^~~
main.cpp:50:2: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'for'
if (o==1)
^~
main.cpp:58:44: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
printf("%d", (factoriale[nr]*nr1*nr2)%MOD);
^
main.cpp:40:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("spion.in","r",stdin);
^
main.cpp:41:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("spion.out","w",stdout);
^
main.cpp:43:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%s", &o, a);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 131kb | OK | 5 |
2 | 3ms | 131kb | OK | 5 |
3 | 4ms | 262kb | OK | 5 |
4 | 4ms | 262kb | OK | 5 |
5 | 2ms | 131kb | OK | 5 |
6 | 2ms | 131kb | OK | 5 |
7 | 2ms | 131kb | OK | 5 |
8 | 2ms | 131kb | OK | 5 |
9 | 2ms | 131kb | OK | 5 |
10 | 3ms | 131kb | OK | 5 |
11 | 3ms | 262kb | OK | 5 |
12 | 4ms | 393kb | OK | 5 |
13 | 4ms | 524kb | OK | 5 |
14 | 5ms | 655kb | OK | 5 |
15 | 6ms | 655kb | OK | 5 |
16 | 6ms | 786kb | OK | 5 |
17 | 7ms | 917kb | OK | 5 |
18 | 7ms | 917kb | OK | 5 |
19 | 8ms | 1048kb | OK | 5 |
20 | 8ms | 1048kb | OK | 5 |
Punctaj total | 100 |