message stringlengths 2 59.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 37 108k | cluster float64 20 20 | __index_level_0__ int64 74 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Natsuki and her friends were taken to the space by an alien and made friends with a lot of aliens. During the space travel, she discovered that aliens’ hands were often very different from humans’. Generally speaking, in a kind of aliens, there are N... | instruction | 0 | 32,449 | 20 | 64,898 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int... | output | 1 | 32,449 | 20 | 64,899 |
Provide a correct Python 3 solution for this coding contest problem.
Natsuki and her friends were taken to the space by an alien and made friends with a lot of aliens. During the space travel, she discovered that aliens’ hands were often very different from humans’. Generally speaking, in a kind of aliens, there are N... | instruction | 0 | 32,450 | 20 | 64,900 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
sys.setrecursionlimit(10**6)
def scc(N, G, RG):
order = []
used = [0]*N
group = [None]*N
def dfs(s):
used[s] = 1
for t in G[s]:
if not used[t]:
dfs(t)
order.append... | output | 1 | 32,450 | 20 | 64,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Natsuki and her friends were taken to the space by an alien and made friends with a lot of aliens. During the space travel, she discovered that aliens’ hands were often very different from human... | instruction | 0 | 32,451 | 20 | 64,902 |
No | output | 1 | 32,451 | 20 | 64,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Natsuki and her friends were taken to the space by an alien and made friends with a lot of aliens. During the space travel, she discovered that aliens’ hands were often very different from human... | instruction | 0 | 32,452 | 20 | 64,904 |
No | output | 1 | 32,452 | 20 | 64,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Natsuki and her friends were taken to the space by an alien and made friends with a lot of aliens. During the space travel, she discovered that aliens’ hands were often very different from human... | instruction | 0 | 32,453 | 20 | 64,906 |
No | output | 1 | 32,453 | 20 | 64,907 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the pr... | instruction | 0 | 32,546 | 20 | 65,092 |
Tags: math, number theory
Correct Solution:
```
def binNumber(n,size):
return bin(n)[2:].zfill(size)
def gcd(a,b):
if a == 0:
return b
return gcd(b%a,a)
# ========= /\ /| |====/|
# | / \ | | / |
# | /____\ | | / |
# | / \ ... | output | 1 | 32,546 | 20 | 65,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the pr... | instruction | 0 | 32,547 | 20 | 65,094 |
Tags: math, number theory
Correct Solution:
```
t=int(input())
for i in range(t):
k,i=list(map(int,input().split()))
print(i+9*(k-1))
``` | output | 1 | 32,547 | 20 | 65,095 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the pr... | instruction | 0 | 32,548 | 20 | 65,096 |
Tags: math, number theory
Correct Solution:
```
for i in range(int(input())):
a,b=map(int,input().split())
print(b+(a-1)*9)
``` | output | 1 | 32,548 | 20 | 65,097 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the pr... | instruction | 0 | 32,549 | 20 | 65,098 |
Tags: math, number theory
Correct Solution:
```
n = int(input())
for i in range(n):
k, x = map(int, input().split(' '))
print((k-1)*9 + x)
``` | output | 1 | 32,549 | 20 | 65,099 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the pr... | instruction | 0 | 32,550 | 20 | 65,100 |
Tags: math, number theory
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
from collections import defaultdict
from itertools import permutations
BUFSIZE = 81... | output | 1 | 32,550 | 20 | 65,101 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the pr... | instruction | 0 | 32,551 | 20 | 65,102 |
Tags: math, number theory
Correct Solution:
```
n = int(input())
for i in range(0, n):
l, r = map(int, input().split())
if l == 1:
print(r)
continue
print(9 * (l - 1) + r)
``` | output | 1 | 32,551 | 20 | 65,103 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the pr... | instruction | 0 | 32,552 | 20 | 65,104 |
Tags: math, number theory
Correct Solution:
```
# from functools import lru_cache
t = int(input())
for _ in range(t):
k, x = map(int, input().split())
print(x + 9 * (k - 1))
``` | output | 1 | 32,552 | 20 | 65,105 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the pr... | instruction | 0 | 32,553 | 20 | 65,106 |
Tags: math, number theory
Correct Solution:
```
t = int(input())
for i in range(t):
li = [int(x) for x in input().split()]
print(li[1]+(li[0]-1)*9)
``` | output | 1 | 32,553 | 20 | 65,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits,... | instruction | 0 | 32,554 | 20 | 65,108 |
Yes | output | 1 | 32,554 | 20 | 65,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits,... | instruction | 0 | 32,555 | 20 | 65,110 |
Yes | output | 1 | 32,555 | 20 | 65,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits,... | instruction | 0 | 32,556 | 20 | 65,112 |
Yes | output | 1 | 32,556 | 20 | 65,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits,... | instruction | 0 | 32,557 | 20 | 65,114 |
Yes | output | 1 | 32,557 | 20 | 65,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits,... | instruction | 0 | 32,558 | 20 | 65,116 |
No | output | 1 | 32,558 | 20 | 65,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits,... | instruction | 0 | 32,559 | 20 | 65,118 |
No | output | 1 | 32,559 | 20 | 65,119 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits,... | instruction | 0 | 32,560 | 20 | 65,120 |
No | output | 1 | 32,560 | 20 | 65,121 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today at the lesson of mathematics, Petya learns about the digital root.
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits,... | instruction | 0 | 32,561 | 20 | 65,122 |
No | output | 1 | 32,561 | 20 | 65,123 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Unary is a minimalistic Brainfuck dialect in which programs are written using only one token.
Brainfuck programs use 8 commands: "+", "-", "[", "]", "<", ">", "." and "," (their meaning is not important for the purposes of this problem). U... | instruction | 0 | 32,673 | 20 | 65,346 |
Tags: implementation
Correct Solution:
```
conv = {'>' : 8, '<' : 9, '+' : 10, '-' : 11, '.' : 12, ',' : 13, '[' : 14, ']' : 15}
s = 0
for c in input():
s *= 16
s += conv[c]
s %= 1000003
print(s)
``` | output | 1 | 32,673 | 20 | 65,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Unary is a minimalistic Brainfuck dialect in which programs are written using only one token.
Brainfuck programs use 8 commands: "+", "-", "[", "]", "<", ">", "." and "," (their meaning is not important for the purposes of this problem). U... | instruction | 0 | 32,676 | 20 | 65,352 |
Tags: implementation
Correct Solution:
```
def solve(a):
x=0
y=len(a)
for i in a:
x=x+int(i)*(2**(y-1))
y=y-1
return x%(1000003)
p=input()
x=""
#11011100
for i in p:
if i=='>':
x=x+'1000'
elif i=='<':
x=x+'1001'
elif i=='+':
x=x+'1010'
elif i=='-':... | output | 1 | 32,676 | 20 | 65,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Unary is a minimalistic Brainfuck dialect in which programs are written using only one token.
Brainfuck programs use 8 commands: "+", "-", "[", "]", "<", ">", "." and "," (their meaning is not important for the purposes of this problem). U... | instruction | 0 | 32,677 | 20 | 65,354 |
Tags: implementation
Correct Solution:
```
def Decimal(s):
n=len(s)
x=0
for i in range(n):
x+=int(s[n-1-i])*(2**i)
return x
s=input()
K={}
K[">"]="1000"
K["<"]="1001"
K["+"]="1010"
K["-"]="1011"
K["."]="1100"
K[","]="1101"
K["["]="1110"
K["]"]="1111"
for item in K:
s=s.replace(item,K[ite... | output | 1 | 32,677 | 20 | 65,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Unary is a minimalistic Brainfuck dialect in which programs are written using only one token.
Brainfuck programs use 8 commands: "+", "-", "[", "]", "<", ">", "." and "," (their meaning is not important for the purposes of this problem). U... | instruction | 0 | 32,678 | 20 | 65,356 |
Tags: implementation
Correct Solution:
```
d={">":'1000',
"<":'1001',
"+":'1010',
"-":'1011',
".":'1100',
",":'1101',
"[":'1110',
"]":'1111'}
s=input()
l=[]
for i in s:
l.append(d[i])
a="".join(l)
ans=int(a,2)
print(ans%1000003)
``` | output | 1 | 32,678 | 20 | 65,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Unary is a minimalistic Brainfuck dialect in which programs are written using only one token.
Brainfuck programs use 8 commands: "+", "-", "[", "]", "<", ">", "." and "," (their meaning is not important for the purposes of this problem). U... | instruction | 0 | 32,679 | 20 | 65,358 |
Tags: implementation
Correct Solution:
```
s,z,k=input(),0,0
for x in s[::-1]:
if x==">":
z+=8<<k
elif x=="<":
z+=9<<k
elif x=="+":
z+=10<<k
elif x=="-":
z+=11<<k
elif x==".":
z+=12<<k
elif x==",":
z+=13<<k
elif x=="[":
z+=14<<k
els... | output | 1 | 32,679 | 20 | 65,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Unary is a minimalistic Brainfuck dialect in which programs are written using only one token.
Brainfuck programs use 8 commands: "+", "-", "[", "]", "<", ">", "." and "," (their meaning is not important for the purposes of this problem). U... | instruction | 0 | 32,680 | 20 | 65,360 |
Tags: implementation
Correct Solution:
```
ch=input()
d={">":'1000',"<":'1001',"+":'1010',"-":'1011',"." :'1100',"," :'1101',"[":'1110',"]":'1111'}
c=''
for i in range(len(ch)):
c+=d[ch[i]]
m=len(c)
s=0
for i in range (m):
s+=2**(m-i-1)*int(c[i])
print(s%((10**6)+3))
``` | output | 1 | 32,680 | 20 | 65,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Unary is a minimalistic Brainfuck dialect in which programs are written using only one token.
Brainfuck programs use 8 commands: "+", "-", "[", "]", "<", ">", "." and "," (their meaning is not... | instruction | 0 | 32,687 | 20 | 65,374 |
No | output | 1 | 32,687 | 20 | 65,375 |
Provide tags and a correct Python 3 solution for this coding contest problem.
<image>
Input
The input contains two integers a1, a2 (0 ≤ ai ≤ 32), separated by a single space.
Output
Output a single integer.
Examples
Input
1 1
Output
0
Input
3 7
Output
0
Input
13 10
Output
1 | instruction | 0 | 32,814 | 20 | 65,628 |
Tags: *special, implementation
Correct Solution:
```
"""111111101010101111100101001111111
100000100000000001010110001000001
101110100110110000011010001011101
101110101011001001111101001011101
101110101100011000111100101011101
100000101010101011010000101000001
111111101010101010101010101111111
00000000111110111110011110... | output | 1 | 32,814 | 20 | 65,629 |
Provide tags and a correct Python 3 solution for this coding contest problem.
<image>
Input
The input contains two integers a1, a2 (0 ≤ ai ≤ 32), separated by a single space.
Output
Output a single integer.
Examples
Input
1 1
Output
0
Input
3 7
Output
0
Input
13 10
Output
1 | instruction | 0 | 32,816 | 20 | 65,632 |
Tags: *special, implementation
Correct Solution:
```
nums = ["111111101010101111100101001111111",
"100000100000000001010110001000001",
"101110100110110000011010001011101",
"101110101011001001111101001011101",
"101110101100011000111100101011101",
"100000101010101011010000101000001",
"111111101010101010101010101111111",
... | output | 1 | 32,816 | 20 | 65,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
<image>
Input
The input contains two integers a1, a2 (0 ≤ ai ≤ 32), separated by a single space.
Output
Output a single integer.
Examples
Input
1 1
Output
0
Input
3 7
Output
0
Input
13 10
Output
1 | instruction | 0 | 32,818 | 20 | 65,636 |
Tags: *special, implementation
Correct Solution:
```
lol = ['111111101010101111100101001111111\n', '100000100000000001010110001000001\n', '101110100110110000011010001011101\n', '101110101011001001111101001011101\n', '101110101100011000111100101011101\n', '100000101010101011010000101000001\n', '1111111010101010101010101... | output | 1 | 32,818 | 20 | 65,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaura... | instruction | 0 | 32,838 | 20 | 65,676 |
Yes | output | 1 | 32,838 | 20 | 65,677 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaura... | instruction | 0 | 32,839 | 20 | 65,678 |
Yes | output | 1 | 32,839 | 20 | 65,679 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaura... | instruction | 0 | 32,840 | 20 | 65,680 |
Yes | output | 1 | 32,840 | 20 | 65,681 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaura... | instruction | 0 | 32,841 | 20 | 65,682 |
Yes | output | 1 | 32,841 | 20 | 65,683 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaura... | instruction | 0 | 32,842 | 20 | 65,684 |
No | output | 1 | 32,842 | 20 | 65,685 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaura... | instruction | 0 | 32,843 | 20 | 65,686 |
No | output | 1 | 32,843 | 20 | 65,687 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaura... | instruction | 0 | 32,844 | 20 | 65,688 |
No | output | 1 | 32,844 | 20 | 65,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaura... | instruction | 0 | 32,845 | 20 | 65,690 |
No | output | 1 | 32,845 | 20 | 65,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k.
Unfortunately, he doesn't know any s... | instruction | 0 | 32,861 | 20 | 65,722 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n,k = input().split()
n,k = int(n), int(k)
for i in range(n):
for j in range(n):
if i==j:
print(k, end=' ')
else:
print(0, end=' ')
print('')
``` | output | 1 | 32,861 | 20 | 65,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k.
Unfortunately, he doesn't know any s... | instruction | 0 | 32,862 | 20 | 65,724 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n,k=map(int,input().split())
for i in range(n):
b=[]
for j in range(n):
if j==i:
b.append(k)
else:
b.append(0)
print(*b)
``` | output | 1 | 32,862 | 20 | 65,725 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k.
Unfortunately, he doesn't know any s... | instruction | 0 | 32,863 | 20 | 65,726 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n, k = map(int,input().split())
for i in range(n):
for j in range(i,n-1):
print(0,end = ' ')
print(k,end = ' ')
for j in range(n-i,n):
print(0,end = ' ')
print()
``` | output | 1 | 32,863 | 20 | 65,727 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k.
Unfortunately, he doesn't know any s... | instruction | 0 | 32,864 | 20 | 65,728 |
Tags: constructive algorithms, implementation
Correct Solution:
```
string = input()
numbers = string.split()
a, b = int(numbers[0]), int(numbers[1])
row = [0 for x in range(a - 1)]
row.append(b)
for x in range(a):
print(" ".join(map(str, row[x:] + row[:x])))
``` | output | 1 | 32,864 | 20 | 65,729 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k.
Unfortunately, he doesn't know any s... | instruction | 0 | 32,865 | 20 | 65,730 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n,k=map(int,input().split())
for i in range(n):
l=[]
for j in range(n):
if(i==j):
l.append(k)
else:
l.append(0)
print(*l)
``` | output | 1 | 32,865 | 20 | 65,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k.
Unfortunately, he doesn't know any s... | instruction | 0 | 32,866 | 20 | 65,732 |
Tags: constructive algorithms, implementation
Correct Solution:
```
a = input().split()
n = int(a[0])
x = int(a[1]) - n + 1
for i in range(n):
for j in range(n):
if i == j:
print(x , end = " ")
else:
print(1 , end = " ")
print()
``` | output | 1 | 32,866 | 20 | 65,733 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k.
Unfortunately, he doesn't know any s... | instruction | 0 | 32,867 | 20 | 65,734 |
Tags: constructive algorithms, implementation
Correct Solution:
```
a, b = map(int, input().split())
c = [1 for i in range(a)]
for j in range(a):
if c[j] == 1:
c[j] = b - (a-1)
print(*c, sep=' ')
c = [1 for i in range(a)]
``` | output | 1 | 32,867 | 20 | 65,735 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k.
Unfortunately, he doesn't know any s... | instruction | 0 | 32,868 | 20 | 65,736 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n,temp = map(int,input().split())
val = 0
arr = [[val for i in range(n)] for j in range(n)]
for i in range(n):
arr[i][i]=temp
for i in range(n):
for j in range(n):
print(arr[i][j],end=' ')
print("")
``` | output | 1 | 32,868 | 20 | 65,737 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke received a positive integer N from Takahashi. A positive integer m is called a favorite number when the following condition is satisfied:
* The quotient and remainder of N divided by m are equal, that is, \lfloor \frac{N}{m} \rfloor = N \bmod ... | instruction | 0 | 33,165 | 20 | 66,330 |
"Correct Solution:
```
n = int(input())
ans = 0
for i in range(1,n):
if (n-i)/i > i:
if (n-i)%i == 0:
ans += (n-i)/i
else:
break
print(int(ans))
``` | output | 1 | 33,165 | 20 | 66,331 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke received a positive integer N from Takahashi. A positive integer m is called a favorite number when the following condition is satisfied:
* The quotient and remainder of N divided by m are equal, that is, \lfloor \frac{N}{m} \rfloor = N \bmod ... | instruction | 0 | 33,166 | 20 | 66,332 |
"Correct Solution:
```
N=int(input())
ans=0
i=1
while i*(i+1)+i<=N:
if N%i==0:
ans+=(N-i)//i
i+=1
print(ans)
``` | output | 1 | 33,166 | 20 | 66,333 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke received a positive integer N from Takahashi. A positive integer m is called a favorite number when the following condition is satisfied:
* The quotient and remainder of N divided by m are equal, that is, \lfloor \frac{N}{m} \rfloor = N \bmod ... | instruction | 0 | 33,167 | 20 | 66,334 |
"Correct Solution:
```
N = int(input())
ans = 0
for a in range(1,int(N**0.5)+1):
if N%a == 0:
m = N//a - 1
if a < m:
ans += m
print(ans)
``` | output | 1 | 33,167 | 20 | 66,335 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.