| Task: | Monikulmio |
| Sender: | Ninjaram |
| Submission time: | 2025-10-28 19:28:00 +0200 |
| Language: | Python3 (CPython3) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | score | |
|---|---|---|---|---|
| #1 | TIME LIMIT EXCEEDED | -- | 0 | details |
| #2 | TIME LIMIT EXCEEDED | -- | 0 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 0 | details |
| #4 | TIME LIMIT EXCEEDED | -- | 0 | details |
| #5 | TIME LIMIT EXCEEDED | -- | 0 | details |
| #6 | TIME LIMIT EXCEEDED | -- | 0 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 0 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 0 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 0 | details |
| #10 | TIME LIMIT EXCEEDED | -- | 0 | details |
Code
'''This task is about making ploygons
ok first thing I figiure out is how the input is parsed into the program.
then ill probably I have
ok so the input is going to be what
lets figure that out
we have a
'''
import sys
input = list(map(int,sys.stdin.read().split()))
pointerx=3
pointery=2
pc=0
for i in range(input[0]):
for j in range(input[1]):
while pc < input[2]:
if i==input[pointerx] and j == input[pointery]:
print('*')
pc+=1
if pc > input[2]:
print('.', end='')
print(end='\n')Test details
Test 1 (public)
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 8 9 5 5 2 2 5 5 8 7 8 ... |
| correct output |
|---|
| ......... ....*.... .../#\... ../###\.. .*#####*. ... |
| user output |
|---|
| (empty) |
Test 2 (public)
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 40 4 5 10 5 30 15 30 15 10 |
| correct output |
|---|
| ................................. |
| user output |
|---|
| (empty) |
Test 3 (public)
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 40 29 8 7 13 2 14 2 9 7 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| (empty) |
Test 4 (public)
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 40 14 5 12 5 25 8 28 13 28 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| (empty) |
Test 5 (public)
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 40 12 3 20 7 16 7 9 11 13 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| (empty) |
Test 6 (public)
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 9 35 33 2 3 2 8 4 8 4 5 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| (empty) |
Test 7 (public)
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 30 100 69 6 10 6 14 7 14 7 18 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| (empty) |
Test 8 (public)
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 40 60 192 11 3 11 5 10 6 11 7 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| (empty) |
Test 9 (public)
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 50 100 142 1 1 1 7 1 11 1 14 ... |
| correct output |
|---|
| *=====*===*==*................... |
| user output |
|---|
| (empty) |
Test 10 (public)
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 100 1000 10 1 4 7 1 4 1 9 ... |
| correct output |
|---|
| ...*====*........................ |
| user output |
|---|
| (empty) |
