Pagini recente » Borderou de evaluare (job #207646) | Borderou de evaluare (job #1676723) | Borderou de evaluare (job #2295923) | Borderou de evaluare (job #63024) | Borderou de evaluare (job #1588165)
Borderou de evaluare (job #1588165)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:23:21: warning: format ‘%s’ expects argument of type ‘char*’, but argument 3 has type ‘char (*)[10010]’ [-Wformat=]
fscanf(f,"%s",&s);
^
user.cpp:52:35: warning: format ‘%d’ expects argument of type ‘int’, but argument 3 has type ‘long int’ [-Wformat=]
fprintf(g,"%d.%d\n",sol1,sol2);
^
user.cpp:52:35: warning: format ‘%d’ expects argument of type ‘int’, but argument 4 has type ‘long int’ [-Wformat=]
user.cpp:12:35: warning: unused variable ‘q’ [-Wunused-variable]
int i,j,m,n,sum=0,o=0,l,pl,pc,q=1,pi=1,ps=1,h=0,qq; long sol1,sol2;
^
user.cpp:12:53: warning: unused variable ‘qq’ [-Wunused-variable]
int i,j,m,n,sum=0,o=0,l,pl,pc,q=1,pi=1,ps=1,h=0,qq; long sol1,sol2;
^
user.cpp:15:30: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(f,"%d %d\n",&n,&m); for(i=0;i<=m+1;i++) a[0][i]='1',a[n+1][i]='1'; for(i=0;i<=n+1;i++) a[i][0]='1',a[i][m+1]='1';
^
user.cpp:20:35: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(f,"%c",&a[i][j]); if(a[i][j]=='.') sum++; else if(a[i][j]=='*') coada[pi].l=i,coada[pi].c=j;
^
user.cpp:21:25: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
} fscanf(f,"\n");
^
user.cpp:23:22: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(f,"%s",&s);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 292kb | Ok! | 5 |
2 | 0ms | 292kb | Ok! | 5 |
3 | 32ms | 12508kb | Wrong answer! | 0 |
4 | 44ms | 12616kb | Wrong answer! | 0 |
5 | 32ms | 13924kb | Wrong answer! | 0 |
6 | 36ms | 14204kb | Wrong answer! | 0 |
7 | 36ms | 14716kb | Wrong answer! | 0 |
8 | 36ms | 13184kb | Wrong answer! | 0 |
9 | 32ms | 13152kb | Wrong answer! | 0 |
10 | 36ms | 14392kb | Wrong answer! | 0 |
11 | 32ms | 12340kb | Wrong answer! | 0 |
12 | 24ms | 14096kb | Killed by signal 11(SIGSEGV). | 0 |
13 | 32ms | 13684kb | Wrong answer! | 0 |
14 | 32ms | 12320kb | Wrong answer! | 0 |
15 | 36ms | 14792kb | Wrong answer! | 0 |
16 | 32ms | 13072kb | Wrong answer! | 0 |
17 | 32ms | 12092kb | Wrong answer! | 0 |
18 | 36ms | 14376kb | Wrong answer! | 0 |
19 | 32ms | 12052kb | Wrong answer! | 0 |
20 | 28ms | 12080kb | Killed by signal 11(SIGSEGV). | 0 |
Punctaj total | 10 |