| 377597 |
234 |
Factorization |
B08902127
|
Wrong Answer (score: 0) |
C
|
810 B |
2021/01/23 10:14:46 |
|
| 377596 |
234 |
Factorization |
B08902127
|
Compilation Error |
C
|
780 B |
2021/01/23 10:14:15 |
|
| 356750 |
47 |
Play with Words, Too. |
B08902127
|
Runtime Error (score: 95) |
C
|
3 KB |
2020/02/24 12:54:42 |
|
| 355695 |
20006 |
2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) |
B08902127
|
Time Limit Exceeded (score: 90) |
*
|
3 KB |
2020/02/11 22:12:51 |
|
| 355594 |
20006 |
2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) |
B08902127
|
Time Limit Exceeded (score: 60) |
*
|
3 KB |
2020/02/11 01:18:46 |
|
| 355593 |
20006 |
2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) |
B08902127
|
Time Limit Exceeded (score: 60) |
*
|
2 KB |
2020/02/11 01:04:30 |
|
| 355592 |
20006 |
2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) |
B08902127
|
Time Limit Exceeded (score: 0) |
*
|
737 B |
2020/02/11 01:04:16 |
|
| 355591 |
20006 |
2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) |
B08902127
|
Time Limit Exceeded (score: 0) |
*
|
737 B |
2020/02/11 01:00:14 |
|
| 355589 |
20006 |
2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) |
B08902127
|
Time Limit Exceeded (score: 0) |
*
|
737 B |
2020/02/11 00:57:10 |
|
| 355588 |
20006 |
2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) |
B08902127
|
Wrong Answer (score: 60) |
*
|
3 KB |
2020/02/11 00:44:41 |
|
| 355587 |
20006 |
2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) |
B08902127
|
Wrong Answer (score: 40) |
*
|
3 KB |
2020/02/11 00:23:21 |
|
| 355474 |
20008 |
Fast Multiple Knapsack Problem |
B08902127
|
Time Limit Exceeded (score: 50) |
*
|
737 B |
2020/02/09 18:57:15 |
|
| 355473 |
20008 |
Fast Multiple Knapsack Problem |
B08902127
|
Runtime Error (score: 20) |
*
|
696 B |
2020/02/09 18:52:20 |
|
| 355472 |
20008 |
Fast Multiple Knapsack Problem |
B08902127
|
Time Limit Exceeded (score: 50) |
*
|
705 B |
2020/02/09 18:42:34 |
|
| 355471 |
20008 |
Fast Multiple Knapsack Problem |
B08902127
|
Compilation Error |
*
|
685 B |
2020/02/09 18:40:56 |
|
| 355346 |
20011 |
Fast the Length of the Longest Common Subsequence |
B08902127
|
Accepted (42.3 s, 888 KB) |
C
|
694 B |
2020/02/08 17:19:38 |
|
| 355345 |
20011 |
Fast the Length of the Longest Common Subsequence |
B08902127
|
Wrong Answer (score: 1) |
C
|
660 B |
2020/02/08 17:12:03 |
|
| 355343 |
20011 |
Fast the Length of the Longest Common Subsequence |
B08902127
|
Wrong Answer (score: 1) |
C
|
659 B |
2020/02/08 17:04:52 |
|
| 355341 |
20011 |
Fast the Length of the Longest Common Subsequence |
B08902127
|
Compilation Error |
C
|
633 B |
2020/02/08 16:58:29 |
|
| 355339 |
20011 |
Fast the Length of the Longest Common Subsequence |
B08902127
|
Runtime Error (score: 1) |
C
|
2 KB |
2020/02/08 16:40:32 |
|
| 355331 |
20011 |
Fast the Length of the Longest Common Subsequence |
B08902127
|
Wrong Answer (score: 1) |
C
|
394 B |
2020/02/08 15:46:34 |
|
| 355330 |
20011 |
Fast the Length of the Longest Common Subsequence |
B08902127
|
Wrong Answer (score: 0) |
C
|
392 B |
2020/02/08 15:45:58 |
|
| 355269 |
3 |
Print Two Numbers |
B08902127
|
Compilation Error |
C
|
191 B |
2020/02/07 19:16:55 |
|
| 355268 |
3 |
Print Two Numbers |
B08902127
|
Compilation Error |
C
|
178 B |
2020/02/07 19:15:29 |
|
| 355267 |
3 |
Print Two Numbers |
B08902127
|
Compilation Error |
C
|
136 B |
2020/02/07 19:14:40 |
|