message stringlengths 2 67k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 463 109k | cluster float64 19 19 | __index_level_0__ int64 926 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
2N players are running a competitive table tennis training on N tables numbered from 1 to N.
The training consists of rounds. In each round, the players form N pairs, one pair per table. In each pair, competitors play a match against each other. As ... | instruction | 0 | 97,629 | 19 | 195,258 |
"Correct Solution:
```
n,a,b=map(int,input().split())
if (b-a)%2==0:
print((b-a)//2)
else:
c=b-a+1
print(c%2+c//2+min(a-1,n-b))
``` | output | 1 | 97,629 | 19 | 195,259 |
Provide a correct Python 3 solution for this coding contest problem.
2N players are running a competitive table tennis training on N tables numbered from 1 to N.
The training consists of rounds. In each round, the players form N pairs, one pair per table. In each pair, competitors play a match against each other. As ... | instruction | 0 | 97,630 | 19 | 195,260 |
"Correct Solution:
```
N, A, B = map(int, input().split())
dif = B-A
if dif%2 == 0:
print(dif//2)
else:
print(min(A-1, N-B)+1+dif//2)
``` | output | 1 | 97,630 | 19 | 195,261 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
2N players are running a competitive table tennis training on N tables numbered from 1 to N.
The training consists of rounds. In each round, the players form N pairs, one pair per table. In eac... | instruction | 0 | 97,631 | 19 | 195,262 |
Yes | output | 1 | 97,631 | 19 | 195,263 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
2N players are running a competitive table tennis training on N tables numbered from 1 to N.
The training consists of rounds. In each round, the players form N pairs, one pair per table. In eac... | instruction | 0 | 97,632 | 19 | 195,264 |
Yes | output | 1 | 97,632 | 19 | 195,265 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
2N players are running a competitive table tennis training on N tables numbered from 1 to N.
The training consists of rounds. In each round, the players form N pairs, one pair per table. In eac... | instruction | 0 | 97,633 | 19 | 195,266 |
Yes | output | 1 | 97,633 | 19 | 195,267 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
2N players are running a competitive table tennis training on N tables numbered from 1 to N.
The training consists of rounds. In each round, the players form N pairs, one pair per table. In eac... | instruction | 0 | 97,634 | 19 | 195,268 |
Yes | output | 1 | 97,634 | 19 | 195,269 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
2N players are running a competitive table tennis training on N tables numbered from 1 to N.
The training consists of rounds. In each round, the players form N pairs, one pair per table. In eac... | instruction | 0 | 97,635 | 19 | 195,270 |
No | output | 1 | 97,635 | 19 | 195,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
2N players are running a competitive table tennis training on N tables numbered from 1 to N.
The training consists of rounds. In each round, the players form N pairs, one pair per table. In eac... | instruction | 0 | 97,636 | 19 | 195,272 |
No | output | 1 | 97,636 | 19 | 195,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
2N players are running a competitive table tennis training on N tables numbered from 1 to N.
The training consists of rounds. In each round, the players form N pairs, one pair per table. In eac... | instruction | 0 | 97,637 | 19 | 195,274 |
No | output | 1 | 97,637 | 19 | 195,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
2N players are running a competitive table tennis training on N tables numbered from 1 to N.
The training consists of rounds. In each round, the players form N pairs, one pair per table. In eac... | instruction | 0 | 97,638 | 19 | 195,276 |
No | output | 1 | 97,638 | 19 | 195,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number a and Antisimon receives number b. They ... | instruction | 0 | 97,930 | 19 | 195,860 |
Yes | output | 1 | 97,930 | 19 | 195,861 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number a and Antisimon receives number b. They ... | instruction | 0 | 97,931 | 19 | 195,862 |
Yes | output | 1 | 97,931 | 19 | 195,863 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number a and Antisimon receives number b. They ... | instruction | 0 | 97,932 | 19 | 195,864 |
Yes | output | 1 | 97,932 | 19 | 195,865 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number a and Antisimon receives number b. They ... | instruction | 0 | 97,933 | 19 | 195,866 |
Yes | output | 1 | 97,933 | 19 | 195,867 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number a and Antisimon receives number b. They ... | instruction | 0 | 97,934 | 19 | 195,868 |
No | output | 1 | 97,934 | 19 | 195,869 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number a and Antisimon receives number b. They ... | instruction | 0 | 97,935 | 19 | 195,870 |
No | output | 1 | 97,935 | 19 | 195,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number a and Antisimon receives number b. They ... | instruction | 0 | 97,936 | 19 | 195,872 |
No | output | 1 | 97,936 | 19 | 195,873 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number a and Antisimon receives number b. They ... | instruction | 0 | 97,937 | 19 | 195,874 |
No | output | 1 | 97,937 | 19 | 195,875 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negative integers ai numbered from 1 to n. The goal ... | instruction | 0 | 98,142 | 19 | 196,284 |
Tags: greedy
Correct Solution:
```
import sys
def getMultiLineInput() -> []:
lines = []
while True:
try:
lines.append(input())
except EOFError:
break
return lines
def printResult(number: int, inputs: []):
#
result = 0
#
for i in range(0, number - ... | output | 1 | 98,142 | 19 | 196,285 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negative integers ai numbered from 1 to n. The goal ... | instruction | 0 | 98,143 | 19 | 196,286 |
Tags: greedy
Correct Solution:
```
__author__ = 'Esfandiar'
from math import log2
n = int(input())
a = list(map(int,input().split()))
res = 0
for i in range(n-1):
res+=a[i]
print(res)
y=n-(i+1)
a[i+(2**(int(log2(y))))]+=a[i]
``` | output | 1 | 98,143 | 19 | 196,287 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negative integers ai numbered from 1 to n. The goal ... | instruction | 0 | 98,144 | 19 | 196,288 |
Tags: greedy
Correct Solution:
```
from math import inf,sqrt,floor,ceil
from collections import Counter,defaultdict,deque
from heapq import heappush as hpush,heappop as hpop,heapify as h
from operator import itemgetter
from itertools import product
from bisect import bisect_left,bisect_right
#for _ in range(int(input... | output | 1 | 98,144 | 19 | 196,289 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negative integers ai numbered from 1 to n. The goal ... | instruction | 0 | 98,145 | 19 | 196,290 |
Tags: greedy
Correct Solution:
```
import sys
import math
#to read string
get_string = lambda: sys.stdin.readline().strip()
#to read list of integers
get_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )
#to read integers
get_int = lambda: int(sys.stdin.readline())
#----------------------------... | output | 1 | 98,145 | 19 | 196,291 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negative integers ai numbered from 1 to n. The goal ... | instruction | 0 | 98,146 | 19 | 196,292 |
Tags: greedy
Correct Solution:
```
mod = 1000000007
ii = lambda : int(input())
si = lambda : input()
dgl = lambda : list(map(int, input()))
f = lambda : map(int, input().split())
il = lambda : list(map(int, input().split()))
ls = lambda : list(input())
n=ii()
l=il()
i=0
while 2**i<=n-1:
i+=1
i-=1
sm=0
for j in rang... | output | 1 | 98,146 | 19 | 196,293 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negative integers ai numbered from 1 to n. The goal ... | instruction | 0 | 98,147 | 19 | 196,294 |
Tags: greedy
Correct Solution:
```
def findP2(n):
l = len(bin(n)) - 3
l = "1" + "0" * l
l = int(l, 2)
if l == n: l //= 2
return l
N = int(input())
L = list(map(int, input().split()))
last = 0
for i in range(N - 1):
tp2 = findP2(N - i)
last += L[i]
L[tp2 + i] += L[i]
L[i] = 0
... | output | 1 | 98,147 | 19 | 196,295 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negative integers ai numbered from 1 to n. The goal ... | instruction | 0 | 98,148 | 19 | 196,296 |
Tags: greedy
Correct Solution:
```
import math
n=int(input())
a=list(map(int,input().split()))
l=[]
c=0
for i in range(1,n):
p=(math.floor(math.log2(n-i)))
l.append(p)
c=c+a[i-1]
a[i+2**p-1]=a[i+2**p-1]+a[i-1]
print(c)
``` | output | 1 | 98,148 | 19 | 196,297 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negative integers ai numbered from 1 to n. The goal ... | instruction | 0 | 98,149 | 19 | 196,298 |
Tags: greedy
Correct Solution:
```
from collections import deque, defaultdict, Counter
from itertools import product, groupby, permutations, combinations, accumulate
from math import gcd, floor, inf, log2, sqrt, log10
from bisect import bisect_right, bisect_left
from statistics import mode
from string import ascii_uppe... | output | 1 | 98,149 | 19 | 196,299 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negat... | instruction | 0 | 98,150 | 19 | 196,300 |
Yes | output | 1 | 98,150 | 19 | 196,301 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negat... | instruction | 0 | 98,151 | 19 | 196,302 |
Yes | output | 1 | 98,151 | 19 | 196,303 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negat... | instruction | 0 | 98,152 | 19 | 196,304 |
Yes | output | 1 | 98,152 | 19 | 196,305 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negat... | instruction | 0 | 98,153 | 19 | 196,306 |
Yes | output | 1 | 98,153 | 19 | 196,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negat... | instruction | 0 | 98,154 | 19 | 196,308 |
No | output | 1 | 98,154 | 19 | 196,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below.
The playing field is a sequence of n non-negat... | instruction | 0 | 98,155 | 19 | 196,310 |
No | output | 1 | 98,155 | 19 | 196,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a number axis directed from the left rightwards, n marbles with coordinates x1, x2, ..., xn are situated. Let's assume that the sizes of the marbles are infinitely small, that is in this task... | instruction | 0 | 98,208 | 19 | 196,416 |
No | output | 1 | 98,208 | 19 | 196,417 |
Provide a correct Python 3 solution for this coding contest problem.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. To help him, determine whether such a way exists. If the ... | instruction | 0 | 98,415 | 19 | 196,830 |
"Correct Solution:
```
import sys
from itertools import permutations
readline = sys.stdin.readline
from itertools import accumulate
from collections import Counter
from bisect import bisect as br, bisect_left as bl
class PMS:
#1-indexed
def __init__(self, A, B, issum = False):
#Aに初期状態の要素をすべて入れる,Bは値域のリス... | output | 1 | 98,415 | 19 | 196,831 |
Provide a correct Python 3 solution for this coding contest problem.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. To help him, determine whether such a way exists. If the ... | instruction | 0 | 98,416 | 19 | 196,832 |
"Correct Solution:
```
import sys
from collections import defaultdict
from heapq import heappop, heappush
from itertools import permutations
from operator import itemgetter
# ある条件に当てはまらない限り、i番目に置く数字 xi は、
# それまで使ってない中で最も小さい数字か、
# またはその次に小さい数字（x[i-1]の右に最も小さい数字を置けない場合）
#
# ある条件: 以下の条件を満たす、未使用の数 k がある
# 残っているk以外の全ての数字が、... | output | 1 | 98,416 | 19 | 196,833 |
Provide a correct Python 3 solution for this coding contest problem.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. To help him, determine whether such a way exists. If the ... | instruction | 0 | 98,417 | 19 | 196,834 |
"Correct Solution:
```
import sys
from itertools import permutations
n = int(input())
a = [0] + list(map(int, input().split()))
if n == 2:
print(-1)
sys.exit()
used = [False for _ in range(n+1)]
hate = dict()
for x in a[1:]:
if x in hate:
hate[x] += 1
else:
hate[x] = 1
cur = 1
ng = 0
ans = []
while len(ans) < n... | output | 1 | 98,417 | 19 | 196,835 |
Provide a correct Python 3 solution for this coding contest problem.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. To help him, determine whether such a way exists. If the ... | instruction | 0 | 98,418 | 19 | 196,836 |
"Correct Solution:
```
"""
Writer: SPD_9X2
https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_d
左からおいていくことを考える
残ったカード全てから嫌われている場合、もう置くしかない
貪欲に置いていき、残りカード全てから嫌われてしまったら置く？
そうなるとただの実装難問題だが…
for i in range(N)
if 残りのカード全てから嫌われてしまっているカードがあったら置く。
elif 辞書順最小のカードが置けたら置く
elif 辞書順2番目のカードが存在したら置く。... | output | 1 | 98,418 | 19 | 196,837 |
Provide a correct Python 3 solution for this coding contest problem.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. To help him, determine whether such a way exists. If the ... | instruction | 0 | 98,419 | 19 | 196,838 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N=int(input())
A=[0]+list(map(int,input().split()))
if N==2 and A==[0,2,1]:
print(-1)
sys.exit()
C=[0]*(N+1)
for i in range(1,N+1):
if A[i]!=i:
C[A[i]]+=1
import heapq
H=[]
for i in range(1,N+1):
H.append((-C[i],i))
heapq.heapi... | output | 1 | 98,419 | 19 | 196,839 |
Provide a correct Python 3 solution for this coding contest problem.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. To help him, determine whether such a way exists. If the ... | instruction | 0 | 98,420 | 19 | 196,840 |
"Correct Solution:
```
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
f... | output | 1 | 98,420 | 19 | 196,841 |
Provide a correct Python 3 solution for this coding contest problem.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. To help him, determine whether such a way exists. If the ... | instruction | 0 | 98,421 | 19 | 196,842 |
"Correct Solution:
```
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import itertools
from collections import deque
from heapq import heappop, heappush, heapify
from collections import defaultdict
N = int(readline())
A = list(map(lambda x: int(x) -... | output | 1 | 98,421 | 19 | 196,843 |
Provide a correct Python 3 solution for this coding contest problem.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. To help him, determine whether such a way exists. If the ... | instruction | 0 | 98,422 | 19 | 196,844 |
"Correct Solution:
```
from itertools import permutations
from heapq import *
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.s... | output | 1 | 98,422 | 19 | 196,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. T... | instruction | 0 | 98,423 | 19 | 196,846 |
No | output | 1 | 98,423 | 19 | 196,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. T... | instruction | 0 | 98,424 | 19 | 196,848 |
No | output | 1 | 98,424 | 19 | 196,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. T... | instruction | 0 | 98,425 | 19 | 196,850 |
No | output | 1 | 98,425 | 19 | 196,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Niwango has N cards, numbered 1,2,\ldots,N. He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the N conditions below. T... | instruction | 0 | 98,426 | 19 | 196,852 |
No | output | 1 | 98,426 | 19 | 196,853 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n people sitting in a circle, numbered from 1 to n in the order in which they are seated. That is, for all i from 1 to n-1, the people with id i and i+1 are adjacent. People with id n and 1 are adjacent as well.
The person with id... | instruction | 0 | 98,625 | 19 | 197,250 |
Tags: math, number theory
Correct Solution:
```
import math
n = int(input())
def lcm(a, b):
while b > 0:
a, b = b, a % b
return a
def pfactors(n):
for i in range(2, math.floor(math.sqrt(n + 1) + 0.5)):
p = 0
while n % i == 0:
n //= i
p += 1
if p ... | output | 1 | 98,625 | 19 | 197,251 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n people sitting in a circle, numbered from 1 to n in the order in which they are seated. That is, for all i from 1 to n-1, the people with id i and i+1 are adjacent. People with id n and 1 are adjacent as well.
The person with id... | instruction | 0 | 98,626 | 19 | 197,252 |
Tags: math, number theory
Correct Solution:
```
class Solution:
def getList(self):
return list(map(int,input().split()))
def solve(self):
n = int(input())
funs = []
i = 1
while i*i <= n:
if n%i == 0:
funs.append(n*(i-1)//2+i)
if... | output | 1 | 98,626 | 19 | 197,253 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n people sitting in a circle, numbered from 1 to n in the order in which they are seated. That is, for all i from 1 to n-1, the people with id i and i+1 are adjacent. People with id n and 1 are adjacent as well.
The person with id... | instruction | 0 | 98,627 | 19 | 197,254 |
Tags: math, number theory
Correct Solution:
```
n=int(input())
b=[]
c=[]
for i in range(1,int(n**(0.5))+1):
if n%i==0:
b.append(i)
b.append(n//i)
for i in range(len(b)):
x=n//b[i]
c.append(x+1 +(x*(x+1)//2)*b[i] -(n+1))
q=list(set(c))
q.sort()
print(*q)
... | output | 1 | 98,627 | 19 | 197,255 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n people sitting in a circle, numbered from 1 to n in the order in which they are seated. That is, for all i from 1 to n-1, the people with id i and i+1 are adjacent. People with id n and 1 are adjacent as well.
The person with id... | instruction | 0 | 98,628 | 19 | 197,256 |
Tags: math, number theory
Correct Solution:
```
from math import sqrt
def apsum(a, r, n):
return n*a + r*n*(n-1)//2
n = int(input())
factors = []
answers = set()
answers.add(1)
for i in range(1, int(sqrt(n))+2):
if n % i == 0:
x, y = i, n//i
answers.add(apsum(1, x, y))
answers.add(a... | output | 1 | 98,628 | 19 | 197,257 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n people sitting in a circle, numbered from 1 to n in the order in which they are seated. That is, for all i from 1 to n-1, the people with id i and i+1 are adjacent. People with id n and 1 are adjacent as well.
The person with id... | instruction | 0 | 98,629 | 19 | 197,258 |
Tags: math, number theory
Correct Solution:
```
import math
n = int(input())
res = []
for i in range(1, int(math.sqrt(n))+1):
if n%i==0:
sm = (2+n-i)*(n//i)//2
res.append(sm)
if n//i!=i:
sm = (2+n-n//i)*i//2
res.append(sm)
print(*sorted(res))
``` | output | 1 | 98,629 | 19 | 197,259 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.