Borderou de evaluare (job #1472556)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 17 august 2015 12:43:29
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator c | Vezi sursa
Scor 0

Raport evaluator

Compilare: user.c: In function ‘M’: user.c:36:58: warning: operation on ‘h[l]’ may be undefined [-Wsequence-point] void M(int l,int k) { for(d[h[l]]=k;l>1&&d[h[l/2]]>k;h[l]^=h[l/2]^=h[l]^=h[l/2],w[h[l]]=l,w[h[l/2]]=l/2,l/=2); } ^ user.c: In function ‘main’: user.c:38:9: warning: ignoring return value of ‘freopen’, declared with attribute warn_unused_result [-Wunused-result] freopen("apm.in","r",stdin),freopen("apm.out","w",stdout),scanf("%d%d",&n,&m); ^ user.c:38:37: warning: ignoring return value of ‘freopen’, declared with attribute warn_unused_result [-Wunused-result] freopen("apm.in","r",stdin),freopen("apm.out","w",stdout),scanf("%d%d",&n,&m); ^ user.c:38:65: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] freopen("apm.in","r",stdin),freopen("apm.out","w",stdout),scanf("%d%d",&n,&m); ^ user.c:40:11: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d",&i,&j,&k),P(g[i],j,k),P(g[j],i,k); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms248kbKilled by signal 11(SIGSEGV).0
20ms256kbKilled by signal 11(SIGSEGV).0
30ms252kbKilled by signal 11(SIGSEGV).0
40ms252kbKilled by signal 11(SIGSEGV).0
50ms248kbKilled by signal 11(SIGSEGV).0
60ms252kbKilled by signal 11(SIGSEGV).0
70ms248kbKilled by signal 11(SIGSEGV).0
80ms252kbKilled by signal 11(SIGSEGV).0
90ms252kbKilled by signal 11(SIGSEGV).0
100ms248kbKilled by signal 11(SIGSEGV).0
Punctaj total0

Ceva nu functioneaza?