QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#507336	#5255. Greedy Drawers	ucup-team1525^#	AC ✓	16ms	10764kb	Python3	948b	2024-08-06 16:24:48	2024-08-06 16:24:48

Judging History

你现在查看的是最新测评结果

[2024-08-06 16:24:48]
评测

测评结果：AC
用时：16ms
内存：10764kb

查看

[2024-08-06 16:24:48]
提交

answer

n = int(input())

# for i in range(n-4):
#     if (i==0 or i==n-5):
#         print(300-i,699+i)
#         print(300-i,699+i)
#     print(300-i,699+i)

# print()
# for i in range(n-4):
#     if (i==0 or i==n-5):
#         print(300-i,700+i)
#         print(300-i,700+i)
#     print(300-i,700+i)
    
pyl = 0
for i in range(n//7):
    print(300-pyl,699+pyl)
    print(300-pyl,699+pyl)
    print(300-pyl,699+pyl)
    
    print(299-pyl,700+pyl)
    
    print(298-pyl,701+pyl)
    
    print(298-pyl,702+pyl)
    print(298-pyl,702+pyl)
    
    pyl += 5

for i in range(n%7):
    print(1,1000)
    
print()

pyl = 0
for i in range(n//7):
    print(300-pyl,699+pyl)
    print(300-pyl,699+pyl)
    
    print(300-pyl,700+pyl)
    
    print(299-pyl,701+pyl)
    
    print(298-pyl,702+pyl)
    print(298-pyl,702+pyl)
    print(298-pyl,702+pyl)
    
    pyl += 5

for i in range(n%7):
    print(1,1000)

Source code, Language: Python3

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 14ms

memory: 10600kb

input:

output:

result:

ok you killed Janko's strategy

Test #2:

score: 0

Accepted

time: 16ms

memory: 10740kb

input:

output:

result:

ok you killed Janko's strategy

Test #3:

score: 0

Accepted

time: 11ms

memory: 10632kb

input:

output:

result:

ok you killed Janko's strategy

Test #4:

score: 0

Accepted

time: 15ms

memory: 10604kb

input:

output:

result:

ok you killed Janko's strategy

Test #5:

score: 0

Accepted

time: 15ms

memory: 10732kb

input:

output:

result:

ok you killed Janko's strategy

Test #6:

score: 0

Accepted

time: 15ms

memory: 10732kb

input:

output:

result:

ok you killed Janko's strategy

Test #7:

score: 0

Accepted

time: 12ms

memory: 10680kb

input:

output:

result:

ok you killed Janko's strategy

Test #8:

score: 0

Accepted

time: 9ms

memory: 10740kb

input:

output:

result:

ok you killed Janko's strategy

Test #9:

score: 0

Accepted

time: 9ms

memory: 10640kb

input:

output:

result:

ok you killed Janko's strategy

Test #10:

score: 0

Accepted

time: 15ms

memory: 10648kb

input:

output:

result:

ok you killed Janko's strategy

Test #11:

score: 0

Accepted

time: 9ms

memory: 10648kb

input:

output:

result:

ok you killed Janko's strategy

Test #12:

score: 0

Accepted

time: 14ms

memory: 10648kb

input:

output:

result:

ok you killed Janko's strategy

Test #13:

score: 0

Accepted

time: 12ms

memory: 10756kb

input:

output:

result:

ok you killed Janko's strategy

Test #14:

score: 0

Accepted

time: 7ms

memory: 10740kb

input:

output:

result:

ok you killed Janko's strategy

Test #15:

score: 0

Accepted

time: 14ms

memory: 10756kb

input:

output:

result:

ok you killed Janko's strategy

Test #16:

score: 0

Accepted

time: 7ms

memory: 10740kb

input:

output:

result:

ok you killed Janko's strategy

Test #17:

score: 0

Accepted

time: 11ms

memory: 10644kb

input:

output:

result:

ok you killed Janko's strategy

Test #18:

score: 0

Accepted

time: 11ms

memory: 10752kb

input:

output:

result:

ok you killed Janko's strategy

Test #19:

score: 0

Accepted

time: 15ms

memory: 10648kb

input:

output:

result:

ok you killed Janko's strategy

Test #20:

score: 0

Accepted

time: 15ms

memory: 10764kb

input:

output:

result:

ok you killed Janko's strategy