Borderou de evaluare (job #1037348)

Utilizator cioionutFMI Ionut Ciocoiu cioionut Data 20 noiembrie 2013 01:51:55
Problema Cele mai apropiate puncte din plan Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Compilare: user.cpp: In function ‘void qsort(int, int)’: user.cpp:8:19: warning: unused variable ‘n’ [-Wunused-variable] int i=p,j=u,m,n; ^ user.cpp: In function ‘int main()’: user.cpp:42:13: warning: unused variable ‘k’ [-Wunused-variable] int i,n,k;double r; ^ user.cpp: In function ‘void qsort(int, int)’: user.cpp:17:21: warning: array subscript is above array bounds [-Warray-bounds] swap(v[2][i],v[2][j]); ^ user.cpp:17:29: warning: array subscript is above array bounds [-Warray-bounds] swap(v[2][i],v[2][j]); ^ user.cpp:17:21: warning: array subscript is above array bounds [-Warray-bounds] swap(v[2][i],v[2][j]); ^ user.cpp:17:29: warning: array subscript is above array bounds [-Warray-bounds] swap(v[2][i],v[2][j]); ^ user.cpp: In function ‘void divide(int, int, double&)’: user.cpp:27:56: warning: array subscript is above array bounds [-Warray-bounds] if(u-p==1) r=sqrt(pow((v[1][p]-v[1][u]),2)+pow((v[2][p]-v[2][u]),2)); ^ user.cpp:27:64: warning: array subscript is above array bounds [-Warray-bounds] if(u-p==1) r=sqrt(pow((v[1][p]-v[1][u]),2)+pow((v[2][p]-v[2][u]),2)); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
14ms448kbKilled by signal 11(SIGSEGV).0
24ms448kbKilled by signal 11(SIGSEGV).0
34ms388kbKilled by signal 11(SIGSEGV).0
44ms396kbKilled by signal 11(SIGSEGV).0
54ms392kbKilled by signal 11(SIGSEGV).0
64ms388kbKilled by signal 11(SIGSEGV).0
74ms388kbKilled by signal 11(SIGSEGV).0
88ms384kbKilled by signal 11(SIGSEGV).0
98ms384kbKilled by signal 11(SIGSEGV).0
108ms388kbKilled by signal 11(SIGSEGV).0
Punctaj total0

Ceva nu functioneaza?