Borderou de evaluare (job #2139035)

Utilizator inquisitorAnders inquisitor Data 22 februarie 2018 00:37:23
Problema Radix Sort Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In function ‘void CountingSort(u32*, u32*, u32)’: user.cpp:19:73: warning: operation on ‘i’ may be undefined [-Wsequence-point] for(u32 i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]); ^ user.cpp:19:73: warning: operation on ‘i’ may be undefined [-Wsequence-point] user.cpp: In function ‘i32 main()’: user.cpp:121:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(i32 i = 0x1; i != N; ++i) ^ user.cpp:132:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(i32 i = 1; i != N; ++i) ^ user.cpp:143:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(i32 i = 0x1; i != N; ++i) ^ user.cpp: At global scope: user.cpp:26:37: warning: always_inline function might not be inlinable [-Wattributes] __attribute__((always_inline)) void itoa(u32 x) ^ user.cpp:13:37: warning: always_inline function might not be inlinable [-Wattributes] __attribute__((always_inline)) void CountingSort(u32 A[], u32 B[], u32 digit) ^ user.cpp: In function ‘void CountingSort(u32*, u32*, u32)’: user.cpp:19:5: warning: iteration 255u invokes undefined behavior [-Waggressive-loop-optimizations] for(u32 i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]); ^ user.cpp:19:24: note: containing loop for(u32 i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
10ms5588kbOK1030
28ms5592kbOK10
380ms13780kbOK10
480ms13784kbOK1040
5852ms87960kbOK10
6744ms87964kbOK10
792ms13784kbOK10
8920ms90012kbOK1030
9892ms90008kbOK10
10920ms90004kbOK10
Punctaj total100

Ceva nu functioneaza?