Pagini recente » Borderou de evaluare (job #1123968) | Borderou de evaluare (job #2086733) | Borderou de evaluare (job #2326071) | Borderou de evaluare (job #1236259) | Borderou de evaluare (job #1820804)
Borderou de evaluare (job #1820804)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:13:39: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen ("paranteze.in","r",stdin);
^
user.cpp:14:41: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen ("paranteze.out","w",stdout);
^
user.cpp:15:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%i",&n);
^
user.cpp:16:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%c",&k);
^
user.cpp:27:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%c",&k);
^
user.cpp:23:9: warning: array subscript is above array bounds [-Warray-bounds]
pr[5]='}';
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 264kb | Incorect | 0 |
2 | 0ms | 272kb | Incorect | 0 |
3 | 0ms | 272kb | Incorect | 0 |
4 | 0ms | 268kb | Incorect | 0 |
5 | 0ms | 272kb | Incorect | 0 |
6 | 0ms | 276kb | OK | 5 |
7 | 0ms | 272kb | OK | 5 |
8 | 0ms | 276kb | OK | 5 |
9 | 0ms | 272kb | Incorect | 0 |
10 | 0ms | 268kb | OK | 5 |
11 | 0ms | 296kb | Incorect | 0 |
12 | 4ms | 332kb | Incorect | 0 |
13 | 12ms | 456kb | Incorect | 0 |
14 | 24ms | 656kb | Incorect | 0 |
15 | 68ms | 1444kb | Incorect | 0 |
16 | 80ms | 1516kb | OK | 5 |
17 | 96ms | 1756kb | OK | 5 |
18 | Depăşit | 1992kb | Time limit exceeded. | 0 |
19 | Depăşit | 2088kb | Time limit exceeded. | 0 |
20 | Depăşit | 2356kb | Time limit exceeded. | 0 |
Punctaj total | 30 |