Pagini recente » Borderou de evaluare (job #2246564) | Borderou de evaluare (job #2782594) | Borderou de evaluare (job #1758436) | Cod sursa (job #166348) | Borderou de evaluare (job #1188782)
Borderou de evaluare (job #1188782)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:89:36: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("secvmax.in","r",stdin);
^
user.cpp:90:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("secvmax.out","w",stdout);
^
user.cpp:91: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: In function ‘void read(int&)’:
user.cpp:16:35: warning: ignoring return value of ‘size_t fread(void*, size_t, size_t, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
fread(buff,1,MAXlen,stdin);
^
user.cpp:23:51: warning: ignoring return value of ‘size_t fread(void*, size_t, size_t, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
if(ind>=MAXlen){fread(buff,1,MAXlen,stdin);ind=0;}
^
user.cpp:29:51: warning: ignoring return value of ‘size_t fread(void*, size_t, size_t, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
if(ind>=MAXlen){fread(buff,1,MAXlen,stdin);ind=0;}
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
| 1 | 0ms | 268kb | OK | 10 | 10 |
| 2 | 4ms | 328kb | OK | 10 | 10 |
| 3 | 4ms | 332kb | OK | 10 | 10 |
| 4 | Depăşit | 1136kb | Time limit exceeded. | 0 | 0 |
| 5 | 48ms | 2672kb | OK | 10 | 0 |
| 6 | Depăşit | 3320kb | Time limit exceeded. | 0 |
| 7 | Depăşit | 4684kb | Time limit exceeded. | 0 | 0 |
| 8 | 100ms | 5204kb | OK | 10 | 0 |
| 9 | Depăşit | 5556kb | Time limit exceeded. | 0 |
| 10 | Depăşit | 5548kb | Time limit exceeded. | 0 | 0 |
| Punctaj total | 30 |