Borderou de evaluare (job #2007022)

Utilizator PopoviciRobertPopovici Robert PopoviciRobert Data 1 august 2017 17:35:14
Problema Subsir Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 90

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:35:24: warning: array subscript has type ‘char’ [-Wchar-subscripts] nxta[ch][i] = i - 1; ^ user.cpp:37:24: warning: array subscript has type ‘char’ [-Wchar-subscripts] nxta[ch][i] = nxta[ch][i - 1]; ^ user.cpp:37:38: warning: array subscript has type ‘char’ [-Wchar-subscripts] nxta[ch][i] = nxta[ch][i - 1]; ^ user.cpp:44:24: warning: array subscript has type ‘char’ [-Wchar-subscripts] nxtb[ch][i] = i - 1; ^ user.cpp:46:24: warning: array subscript has type ‘char’ [-Wchar-subscripts] nxtb[ch][i] = nxtb[ch][i - 1]; ^ user.cpp:46:38: warning: array subscript has type ‘char’ [-Wchar-subscripts] nxtb[ch][i] = nxtb[ch][i - 1]; ^ user.cpp:54:64: warning: array subscript has type ‘char’ [-Wchar-subscripts] len[i][j] = std::max(len[i][j], len[nxta[ch][i]][nxtb[ch][j]] + 1); ^ user.cpp:54:77: warning: array subscript has type ‘char’ [-Wchar-subscripts] len[i][j] = std::max(len[i][j], len[nxta[ch][i]][nxtb[ch][j]] + 1); ^ user.cpp:56:48: warning: array subscript has type ‘char’ [-Wchar-subscripts] if(len[i][j] == len[nxta[ch][i]][nxtb[ch][j]] + 1) { ^ user.cpp:56:61: warning: array subscript has type ‘char’ [-Wchar-subscripts] if(len[i][j] == len[nxta[ch][i]][nxtb[ch][j]] + 1) { ^ user.cpp:57:49: warning: array subscript has type ‘char’ [-Wchar-subscripts] dp[i][j] += dp[nxta[ch][i]][nxtb[ch][j]]; ^ user.cpp:57:62: warning: array subscript has type ‘char’ [-Wchar-subscripts] dp[i][j] += dp[nxta[ch][i]][nxtb[ch][j]]; ^ user.cpp:25:39: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] fscanf(fi,"%s %s " , a + 1, b + 1); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms796kbOk!10
20ms704kbOk!10
30ms680kbOk!10
40ms836kbOk!10
50ms608kbOk!10
64ms1664kbOk!10
70ms1344kbOk!10
88ms2476kbOk!10
94ms1536kbOk!10
104ms2456kbWrong answer!0
Punctaj total90

Ceva nu functioneaza?