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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A wavy number is such positive integer that for any digit of its decimal representation except for the first one and the last one following condition holds: the digit is either strictly larger t... | instruction | 0 | 84,573 | 20 | 169,146 |
No | output | 1 | 84,573 | 20 | 169,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A wavy number is such positive integer that for any digit of its decimal representation except for the first one and the last one following condition holds: the digit is either strictly larger t... | instruction | 0 | 84,574 | 20 | 169,148 |
No | output | 1 | 84,574 | 20 | 169,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John gave Jack a very hard problem. He wrote a very big positive integer A0 on a piece of paper. The number is less than 10200000 . In each step, Jack is allowed to put ' + ' signs in between so... | instruction | 0 | 84,714 | 20 | 169,428 |
No | output | 1 | 84,714 | 20 | 169,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John gave Jack a very hard problem. He wrote a very big positive integer A0 on a piece of paper. The number is less than 10200000 . In each step, Jack is allowed to put ' + ' signs in between so... | instruction | 0 | 84,715 | 20 | 169,430 |
No | output | 1 | 84,715 | 20 | 169,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John gave Jack a very hard problem. He wrote a very big positive integer A0 on a piece of paper. The number is less than 10200000 . In each step, Jack is allowed to put ' + ' signs in between so... | instruction | 0 | 84,716 | 20 | 169,432 |
No | output | 1 | 84,716 | 20 | 169,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John gave Jack a very hard problem. He wrote a very big positive integer A0 on a piece of paper. The number is less than 10200000 . In each step, Jack is allowed to put ' + ' signs in between so... | instruction | 0 | 84,717 | 20 | 169,434 |
No | output | 1 | 84,717 | 20 | 169,435 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 85,215 | 20 | 170,430 |
Tags: constructive algorithms
Correct Solution:
```
from math import *
from fractions import *
from sys import *
def li():
return list(map(int, input().split(" ")))
a = li()
if abs(a[2]-a[3]) > 1:
print(-1)
exit()
if a[2] == a[3]:
ans = "47"*a[2]+"4"
elif a[2] > a[3]:
ans = "47"*a[2]
else:
ans = "74"*a[3]
f... | output | 1 | 85,215 | 20 | 170,431 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 85,216 | 20 | 170,432 |
Tags: constructive algorithms
Correct Solution:
```
a1,a2,a3,a4=map(int,input().split())
L=[]
def Solve(a1,a2,a3,a4):
if(a3-a4<-1 or a3-a4>1 or a1<a3 or a1<a4 or a2<a3 or a2<a4):
return -1
elif(a3-a4==0):
Ans="47"*a3
Ans+="4"
if(a1-a3==0 and a2-a4==0):
return -1
... | output | 1 | 85,216 | 20 | 170,433 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 85,217 | 20 | 170,434 |
Tags: constructive algorithms
Correct Solution:
```
a1,a2,a3,a4=map(int,input().split())
if abs(a3-a4)>1:
print(-1)
elif min(a1,a2)<max(a3,a4):
print(-1)
elif a1==a2==a3==a4:
print(-1)
else:
if a3==a4:
if a1==a3:
print ('74'*a3+'7'*(a2-a3))
else:
print('4'*(a1-a3-... | output | 1 | 85,217 | 20 | 170,435 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 85,218 | 20 | 170,436 |
Tags: constructive algorithms
Correct Solution:
```
a, b, c, d = map(int, input().split(' '))
if (a+b) - (c+d) < 1:
print(-1)
quit()
if c == d:
if a == c:
if (b-a < 0):
print(-1)
quit()
print('74' * d + '7' * (b-a))
quit()
if ((b-c) < 0 or (a-c-1) < 0... | output | 1 | 85,218 | 20 | 170,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are luc... | instruction | 0 | 85,219 | 20 | 170,438 |
No | output | 1 | 85,219 | 20 | 170,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are luc... | instruction | 0 | 85,220 | 20 | 170,440 |
No | output | 1 | 85,220 | 20 | 170,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are luc... | instruction | 0 | 85,221 | 20 | 170,442 |
No | output | 1 | 85,221 | 20 | 170,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are luc... | instruction | 0 | 85,222 | 20 | 170,444 |
No | output | 1 | 85,222 | 20 | 170,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modulo 1013. That is, John's list is made from the F... | instruction | 0 | 85,255 | 20 | 170,510 |
Tags: brute force, math, matrices
Correct Solution:
```
t= int(input())
n, m, List = 10000, 15000, []
def function(input):
if input == 0:
return (0, 1)
a, b = function(input >> 1)
a, b = ((2 * a * b - a * a) % n, (b * b + a * a) % n)
if input & 1:
a, b = (b % n, (a + b) % n)
return... | output | 1 | 85,255 | 20 | 170,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modulo 1013. That is, John's list is made from the F... | instruction | 0 | 85,256 | 20 | 170,512 |
Tags: brute force, math, matrices
Correct Solution:
```
ak=int(10**13)
f=int(input())
n,m,List=10000,15000,[]
def Fun1(input):
if input==0:
return (0,1)
a,b=Fun1(input>>1)
a,b=((2*a*b-a*a)%n,(b*b+a*a)%n)
if input&1:
a,b=(b%n,(a+b)%n)
return (a,b)
for j in range(m):
if Fun1(j)[0]==f%n:
List.append(j)
whil... | output | 1 | 85,256 | 20 | 170,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modulo 1013. That is, John's list is made from the F... | instruction | 0 | 85,257 | 20 | 170,514 |
Tags: brute force, math, matrices
Correct Solution:
```
low_n = 1000
high_m = 15000
limit = int(10 ** 13)
f = int(input())
inputList = []
def customFunction(i):
if i == 0:
return (0, 1)
a, b = customFunction(i >> 1)
a, b = ((2 * a * b - a * a) % low_n, (b * b + a * a) % low_n)
if i & 1:
... | output | 1 | 85,257 | 20 | 170,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modulo 1013. That is, John's list is made from the F... | instruction | 0 | 85,258 | 20 | 170,516 |
Tags: brute force, math, matrices
Correct Solution:
```
n,m,limn,f,L=10000,15000,int(10**13),int(input()),[]
def F(i):
if i==0:
return (0,1)
a,b=F(i>>1)
a,b=((2*a*b-a*a)%n,(b*b+a*a)%n)
if i&1:
a,b=(b%n,(a+b)%n)
return (a,b)
for i in range(m):
if F(i)[0]==f%n:
L.append(i)
while n<limn:
n*=10;
T=[]
f... | output | 1 | 85,258 | 20 | 170,517 |
Provide tags and a correct Python 3 solution for this coding contest problem.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modulo 1013. That is, John's list is made from the F... | instruction | 0 | 85,259 | 20 | 170,518 |
Tags: brute force, math, matrices
Correct Solution:
```
n,m,l,f,L=10000,15000,int(10**13),int(input()),[]
def F(i):
if i==0:
return (0,1)
x,y=F(i>>1)
x,y=((2*x*y-x*x)%n,(y*y+x*x)%n)
if i&1:
x,y=(y%n,(x+y)%n)
return (x,y)
for i in range(m):
if F(i)[0]==f%n:
L.append(i)
while n<l:
n*=10;
T=[]
for i ... | output | 1 | 85,259 | 20 | 170,519 |
Provide tags and a correct Python 3 solution for this coding contest problem.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modulo 1013. That is, John's list is made from the F... | instruction | 0 | 85,260 | 20 | 170,520 |
Tags: brute force, math, matrices
Correct Solution:
```
p, q, li, s, l = 10000, 15000, int(10 ** 13), int(input()), []
def Fibo(i):
if i == 0:
return (0, 1)
a, b = Fibo(i >> 1)
a, b = ((2 * a * b - a * a) % p, (b * b + a * a) % p)
if i & 1:
a, b = (b % p, (a + b) % p)
return (a, b)... | output | 1 | 85,260 | 20 | 170,521 |
Provide tags and a correct Python 3 solution for this coding contest problem.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modulo 1013. That is, John's list is made from the F... | instruction | 0 | 85,261 | 20 | 170,522 |
Tags: brute force, math, matrices
Correct Solution:
```
n=1000
m=15000
limit=int(10**13)
x=int(input())
l=[]
def fun(i):
if i==0:
return(0,1)
a,b=fun(i>>1)
a,b=((2*a*b-a*a)%n,(b*b+a*a)%n)
if i & 1:
a,b=(b%n,(a+b)%n)
return (a,b)
i=0
while i<m:
if fun(i)[0]==x%n:
l.append(... | output | 1 | 85,261 | 20 | 170,523 |
Provide tags and a correct Python 3 solution for this coding contest problem.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modulo 1013. That is, John's list is made from the F... | instruction | 0 | 85,262 | 20 | 170,524 |
Tags: brute force, math, matrices
Correct Solution:
```
mo = 10 ** 13
p = [
1, 60, 300, 1500, 15000, 150000, 1500000, 15000000,
150000000, 1500000000, 15000000000, 150000000000,
1500000000000, 15000000000000
]
class mat(object):
def __init__(self, a, b, c, d):
self.a, self.b, self.c, self.d = a, b, c, d
def tim... | output | 1 | 85,262 | 20 | 170,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modul... | instruction | 0 | 85,263 | 20 | 170,526 |
Yes | output | 1 | 85,263 | 20 | 170,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modul... | instruction | 0 | 85,264 | 20 | 170,528 |
Yes | output | 1 | 85,264 | 20 | 170,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modul... | instruction | 0 | 85,265 | 20 | 170,530 |
Yes | output | 1 | 85,265 | 20 | 170,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modul... | instruction | 0 | 85,266 | 20 | 170,532 |
No | output | 1 | 85,266 | 20 | 170,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modul... | instruction | 0 | 85,267 | 20 | 170,534 |
No | output | 1 | 85,267 | 20 | 170,535 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modul... | instruction | 0 | 85,268 | 20 | 170,536 |
No | output | 1 | 85,268 | 20 | 170,537 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
John Doe has a list of all Fibonacci numbers modulo 1013. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of previous two modul... | instruction | 0 | 85,269 | 20 | 170,538 |
No | output | 1 | 85,269 | 20 | 170,539 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing... | instruction | 0 | 85,376 | 20 | 170,752 |
Tags: implementation, strings
Correct Solution:
```
# your code goes here
a=int(input(""))
if a<=127 :
print("byte")
else :
if a<=32767 :
print("short")
else :
if a<=2147483647 :
print("int")
else :
if a<=9223372036854775807 :
print("long")
... | output | 1 | 85,376 | 20 | 170,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing... | instruction | 0 | 85,377 | 20 | 170,754 |
Tags: implementation, strings
Correct Solution:
```
num = int(input());
long = len(str(abs(num)));
if(num<0): num = abs(num+1);
if(num<=127): print("byte");
else:
if(num<=32767):print("short");
else:
if( num<=2147483647):print("int");
else:
if(num<=9223372036854775807):print("long");
... | output | 1 | 85,377 | 20 | 170,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing... | instruction | 0 | 85,378 | 20 | 170,756 |
Tags: implementation, strings
Correct Solution:
```
x = int(input())
if(x >= -128 & x <= 127):
print ("byte")
elif(x >= -32768 & x <= 32767):
print("short")
elif(x >= -2147483648 & x <= 2147483647):
print("int")
elif(x >= -9223372036854775808 & x <= 9223372036854775807 ):
print("long")
else:
print... | output | 1 | 85,378 | 20 | 170,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing... | instruction | 0 | 85,379 | 20 | 170,758 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
if n >= -128 and n <= 127:
print("byte")
elif n >=-32768 and n <=32767:
print("short")
elif n >=-2147483648 and n <=2147483647:
print("int")
elif n >=-9223372036854775808 and n <=9223372036854775807:
print("long")
else :
print("BigInteger")
``` | output | 1 | 85,379 | 20 | 170,759 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing... | instruction | 0 | 85,380 | 20 | 170,760 |
Tags: implementation, strings
Correct Solution:
```
#easy in python
n = int(input())
if n <= 127:
print("byte")
elif n <= 32767:
print("short")
elif n <= 2147483647:
print("int")
elif n <= 9223372036854775807:
print("long")
else:
print("BigInteger")
``` | output | 1 | 85,380 | 20 | 170,761 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing... | instruction | 0 | 85,381 | 20 | 170,762 |
Tags: implementation, strings
Correct Solution:
```
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
# mod=10**9+7
# sys.setrecursionlimit(10**6)
# from functools import lru_cache
def main():
n=input()
if len(n)>20:
prin... | output | 1 | 85,381 | 20 | 170,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing... | instruction | 0 | 85,382 | 20 | 170,764 |
Tags: implementation, strings
Correct Solution:
```
b=127
s=32767
i=2147483647
l=9223372036854775807
inp=int(input())
if(inp<=b):
print('byte')
elif(inp<=s):
print('short')
elif(inp<=i):
print('int')
elif(inp<=l):
print('long')
else:
print('BigInteger')
``` | output | 1 | 85,382 | 20 | 170,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best choice. The main argument in favor of choosing... | instruction | 0 | 85,383 | 20 | 170,766 |
Tags: implementation, strings
Correct Solution:
```
s = int(input ())
if (s >= -128 ) and (s <= 127):
print ("byte")
elif (s >= -32768)and(s <= 32767):
print ("short")
elif (s >= -2147483648)and(s <= 2147483647):
print ("int")
elif (s >= -9223372036854775808)and(s <= 9223372036854775807):
print ("long")... | output | 1 | 85,383 | 20 | 170,767 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best... | instruction | 0 | 85,384 | 20 | 170,768 |
Yes | output | 1 | 85,384 | 20 | 170,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best... | instruction | 0 | 85,385 | 20 | 170,770 |
Yes | output | 1 | 85,385 | 20 | 170,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best... | instruction | 0 | 85,386 | 20 | 170,772 |
Yes | output | 1 | 85,386 | 20 | 170,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best... | instruction | 0 | 85,387 | 20 | 170,774 |
Yes | output | 1 | 85,387 | 20 | 170,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best... | instruction | 0 | 85,388 | 20 | 170,776 |
No | output | 1 | 85,388 | 20 | 170,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best... | instruction | 0 | 85,389 | 20 | 170,778 |
No | output | 1 | 85,389 | 20 | 170,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best... | instruction | 0 | 85,390 | 20 | 170,780 |
No | output | 1 | 85,390 | 20 | 170,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya has recently started attending a programming club. Naturally he is facing the problem of choosing a programming language. After long considerations he realized that Java is the best... | instruction | 0 | 85,391 | 20 | 170,782 |
No | output | 1 | 85,391 | 20 | 170,783 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has n integers: 1, 2, 3, ..., n. He wants to split these integers in two non-empty groups in such a way that the absolute difference of sums of integers in each group is as small as possible.
Help Petya to split the integers. Each of... | instruction | 0 | 85,461 | 20 | 170,922 |
Tags: constructive algorithms, graphs, math
Correct Solution:
```
if __name__ == '__main__':
n = int(input().strip())
l1, l2 = [], []
s1, s2 = 0, 0
for i in range(n, 0, -1):
if s1 < s2:
s1 += i
l1.append(i)
else:
s2 += i
l2.append(i)
pr... | output | 1 | 85,461 | 20 | 170,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has n integers: 1, 2, 3, ..., n. He wants to split these integers in two non-empty groups in such a way that the absolute difference of sums of integers in each group is as small as possible.
Help Petya to split the integers. Each of... | instruction | 0 | 85,462 | 20 | 170,924 |
Tags: constructive algorithms, graphs, math
Correct Solution:
```
n=int(input())
s=n
i=n-1
g=[n]
while i>0:
if s>0:
s-=i
else:
s+=i
g.append(i)
i-=1
print(s)
print(len(g),end=' ')
print(*g)
``` | output | 1 | 85,462 | 20 | 170,925 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has n integers: 1, 2, 3, ..., n. He wants to split these integers in two non-empty groups in such a way that the absolute difference of sums of integers in each group is as small as possible.
Help Petya to split the integers. Each of... | instruction | 0 | 85,463 | 20 | 170,926 |
Tags: constructive algorithms, graphs, math
Correct Solution:
```
n = int(input())
if n % 4 == 0:
print(0)
data = []
for i in range(1, n + 1, 4):
data.append(str(i) + ' ' + str(i + 3))
elif n % 4 == 3:
print(0)
data = []
for i in range(4, n + 1, 4):
data.append(str(i) + ' ' + st... | output | 1 | 85,463 | 20 | 170,927 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has n integers: 1, 2, 3, ..., n. He wants to split these integers in two non-empty groups in such a way that the absolute difference of sums of integers in each group is as small as possible.
Help Petya to split the integers. Each of... | instruction | 0 | 85,464 | 20 | 170,928 |
Tags: constructive algorithms, graphs, math
Correct Solution:
```
n = int(input())
if n % 4 == 0:
print(0)
print(n//2,end=" ")
step = 0
for i in range(1,n+1,2):
print(i+step,end=" ")
step = 1 - step
elif n % 4 == 3:
print(0)
print(n//2,end=" ")
step = 1
for i in range(2,n... | output | 1 | 85,464 | 20 | 170,929 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has n integers: 1, 2, 3, ..., n. He wants to split these integers in two non-empty groups in such a way that the absolute difference of sums of integers in each group is as small as possible.
Help Petya to split the integers. Each of... | instruction | 0 | 85,465 | 20 | 170,930 |
Tags: constructive algorithms, graphs, math
Correct Solution:
```
def chet(path):
n = len(path)
if n % 2 == 0:
if n == 2:
print(1)
print(1, 1)
if n > 2 and n % 4 != 0:
f_half = []
i = 0
while i + 1 < n // 2:
f_half.appen... | output | 1 | 85,465 | 20 | 170,931 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.