| 1321769 |
1132 |
PUBG~Where is Safe? (Function - C Multiple File Combination)
P
|
B1****011
|
Accepted
(53 ms, 128 KB) |
*
|
2 KB |
2025/11/02 16:12:08 |
| 1321768 |
3062 |
List-append pop practice I
P
|
PY****112
|
Accepted
(65 ms, 2 MB) |
Python 3
|
110 B |
2025/11/02 16:12:04 |
| 1321767 |
1078 |
Pokémon Encyclopedia II - Filter Specific Level Pokémon
P
|
B1****011
|
Accepted
(62 ms, 128 KB) |
C
|
866 B |
2025/11/02 16:11:09 |
| 1321766 |
1075 |
Tribal Union
P
|
B1****011
|
Accepted
(62 ms, 128 KB) |
C
|
1 KB |
2025/11/02 16:08:53 |
| 1321765 |
1172 |
One-dimensional array/container practice III
P
|
PY****112
|
Accepted
(78 ms, 2 MB) |
Python 3
|
108 B |
2025/11/02 16:08:39 |
| 1321764 |
3079 |
List-append pop practice II
P
|
PY****112
|
Accepted
(62 ms, 2 MB) |
Python 3
|
122 B |
2025/11/02 16:07:43 |
| 1321763 |
1172 |
One-dimensional array/container practice III
P
|
PY****112
|
Wrong Answer
(score: 0) |
Python 3
|
99 B |
2025/11/02 16:04:58 |
| 1321762 |
3064 |
List manual/automatic sorting
P
|
PY****112
|
Accepted
(59 ms, 2 MB) |
Python 3
|
109 B |
2025/11/02 16:02:02 |
| 1321761 |
1074 |
Address Book Save and Read File I (Save and Read Text File)
P
|
B1****011
|
Accepted
(58 ms, 128 KB) |
C
|
2 KB |
2025/11/02 16:01:27 |
| 1321760 |
1063 |
Score Average and Highest Score (C Multiple File Combination)
P
|
B1****011
|
Accepted
(66 ms, 128 KB) |
*
|
1 KB |
2025/11/02 15:56:54 |
| 1321759 |
72 |
Fill the Array
P
|
B1****011
|
Accepted
(63 ms, 128 KB) |
*
|
2 KB |
2025/11/02 15:55:03 |
| 1321758 |
72 |
Fill the Array
P
|
B1****011
|
Compilation Error
|
*
|
2 KB |
2025/11/02 15:53:14 |
| 1321757 |
3074 |
System Built-in os Module Practice
P
|
B1****066
|
Wrong Answer
(score: 0) |
Python 3
|
809 B |
2025/11/02 14:29:40 |
| 1321756 |
3047 |
Square * print - nested loop
P
|
B1****095
|
Accepted
(62 ms, 128 KB) |
C
|
236 B |
2025/11/02 12:28:36 |
| 1321755 |
3017 |
Input until -1 ends I - find the maximum value
P
|
B1****095
|
Accepted
(58 ms, 128 KB) |
C
|
575 B |
2025/11/02 11:37:49 |
| 1321754 |
3017 |
Input until -1 ends I - find the maximum value
P
|
B1****095
|
Wrong Answer
(score: 50) |
C
|
569 B |
2025/11/02 11:37:00 |
| 1321753 |
3017 |
Input until -1 ends I - find the maximum value
P
|
B1****095
|
Wrong Answer
(score: 50) |
C
|
569 B |
2025/11/02 11:36:26 |
| 1321752 |
3017 |
Input until -1 ends I - find the maximum value
P
|
B1****095
|
Wrong Answer
(score: 50) |
C
|
483 B |
2025/11/02 11:33:11 |
| 1321751 |
3017 |
Input until -1 ends I - find the maximum value
P
|
B1****095
|
Wrong Answer
(score: 50) |
C
|
485 B |
2025/11/02 11:31:09 |
| 1321750 |
1075 |
Tribal Union
P
|
B1****108
|
Wrong Answer
(score: 0) |
C++
|
829 B |
2025/11/02 11:29:33 |
| 1321749 |
1075 |
Tribal Union
P
|
B1****108
|
Wrong Answer
(score: 0) |
C++
|
815 B |
2025/11/02 11:27:10 |
| 1321748 |
3017 |
Input until -1 ends I - find the maximum value
P
|
B1****095
|
Wrong Answer
(score: 50) |
C
|
501 B |
2025/11/02 11:25:36 |
| 1321747 |
1075 |
Tribal Union
P
|
B1****108
|
Wrong Answer
(score: 0) |
C++
|
832 B |
2025/11/02 11:21:09 |
| 1321746 |
3017 |
Input until -1 ends I - find the maximum value
P
|
B1****095
|
Wrong Answer
(score: 50) |
C
|
550 B |
2025/11/02 11:17:57 |
| 1321745 |
1303 |
Input until -1 ends 0
P
|
B1****095
|
Accepted
(68 ms, 128 KB) |
C
|
415 B |
2025/11/02 11:10:49 |
