Dec.07.2025 at 05:11:01 PM
|
Problem "Variant 4" (0)
| 0 posts |
BLG-Zhanysh.Teshebaev
Dec.01.2025 at 10:00:46 PM
|
Problem "Variant 17" (1)
| 1 post |
| def HowMuch(s):
if len(s) == 0:
return 0
first = s[0]
count = 0
for ch in s:
if ch == first:
count += 1
return count
while True:
s = input()
if s == "":
break
if HowMuch(s) >= 3:
print(s)
|
Dec.01.2025 at 04:23:33 PM
|
Problem "Find the Missing number" (0)
| 0 posts |
Dec.01.2025 at 12:54:51 AM
|
Problem "Variant 20" (0)
| 0 posts |
Nov.29.2025 at 06:16:13 PM
|
Problem "Variant 9" (0)
| 0 posts |
Nov.14.2025 at 12:55:48 AM
|
Problem "Variant 20" (0)
| 0 posts |
Nov.03.2025 at 01:45:53 AM
|
Problem "Variant 21" (0)
| 0 posts |
Oct.28.2025 at 01:42:42 AM
|
Problem "Variant 5" (0)
| 0 posts |
EEM-Umar.Sabyrov
Nov.19.2023 at 10:32:45 PM
|
Problem "Variant 1" (2)
| 2 posts |
| Input дегенде берилген ыраттуулуктун максималдуусун эле береби же болбосо бардыгын бир бирден киргизеби?
|
EEM-Altynai.Amangeldi kizi
Oct.12.2025 at 04:28:55 PM
|
Problem "Variant 16" (1)
| 1 post |
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
bool result = false;
for (int a = 1; a <= N; a++) {
for (int b = a + 1; b <= N; b++) {
int c = b + 1;
if (a * b * c == N) {
result = true;
break;
}
if (a * b * c > N) {
break;
}
}
if (result) {
break;
}
}
|
Oct.03.2025 at 11:25:03 AM
|
Problem "Variant 26" (0)
| 0 posts |
Oct.02.2025 at 10:35:50 PM
|
Problem "Variant 16" (0)
| 0 posts |
Oct.02.2025 at 01:41:28 PM
|
Problem "Variant 4" (0)
| 0 posts |
Sep.18.2025 at 03:18:21 PM
|
Problem "Variant 3" (0)
| 0 posts |
Sep.18.2025 at 02:32:29 PM
|
Problem "Variant 10" (0)
| 0 posts |
Dec.15.2024 at 01:50:49 PM
|
Problem "Variant 6" (0)
| 0 posts |
Dec.12.2024 at 02:28:42 PM
|
Problem "Variant 6" (0)
| 0 posts |
Dec.06.2024 at 05:11:43 PM
|
Problem "Элис менен Бобдун конфеттери" (0)
| 0 posts |
Dec.01.2024 at 08:15:35 PM
|
Problem "Variant 24" (0)
| 0 posts |
Dec.01.2024 at 08:15:28 PM
|
Problem "Variant 14" (0)
| 0 posts |