Pagini recente » Borderou de evaluare (job #2985800) | Borderou de evaluare (job #1863802) | Borderou de evaluare (job #276190) | Borderou de evaluare (job #788166) | Borderou de evaluare (job #1347439)
Borderou de evaluare (job #1347439)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:41:37: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("posta2.in", "r", stdin);
^
user.cpp:42:39: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("posta2.out", "w", stdout);
^
user.cpp:44:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
user.cpp:47:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&a,&b,&c);
^
user.cpp:51:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i=1;i<=n;i++) scanf("%d",&taxa[i]);
^
user.cpp:54:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&a);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 1460kb | OK | 5 |
2 | 0ms | 1464kb | OK | 5 |
3 | 0ms | 1476kb | OK | 5 |
4 | 0ms | 1484kb | OK | 5 |
5 | 0ms | 1496kb | OK | 5 |
6 | 0ms | 1500kb | OK | 5 |
7 | 8ms | 1688kb | OK | 5 |
8 | 8ms | 1688kb | OK | 5 |
9 | 12ms | 1908kb | OK | 5 |
10 | 12ms | 1908kb | OK | 5 |
11 | 28ms | 2336kb | OK | 5 |
12 | 40ms | 2628kb | OK | 5 |
13 | 56ms | 3212kb | OK | 5 |
14 | 72ms | 3656kb | OK | 5 |
15 | 112ms | 4904kb | OK | 5 |
16 | 124ms | 5168kb | OK | 5 |
17 | 136ms | 5336kb | OK | 5 |
18 | 144ms | 5744kb | OK | 5 |
19 | 160ms | 5704kb | OK | 5 |
20 | 164ms | 5872kb | OK | 5 |
Punctaj total | 100 |