text stringlengths 198 433k | conversation_id int64 0 109k |
|---|---|
Provide tags and a correct Python 2 solution for this coding contest problem.
Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from 1 to n and then 3n times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements 7n+1 times instead of 3n times. Because it is more random, OK?!
You somehow get a test from one of these problems and now you want to know from which one.
Input
In the first line of input there is one integer n (10^{3} ≤ n ≤ 10^{6}).
In the second line there are n distinct integers between 1 and n — the permutation of size n from the test.
It is guaranteed that all tests except for sample are generated this way: First we choose n — the size of the permutation. Then we randomly choose a method to generate a permutation — the one of Petr or the one of Alex. Then we generate a permutation using chosen method.
Output
If the test is generated via Petr's method print "Petr" (without quotes). If the test is generated via Alex's method print "Um_nik" (without quotes).
Example
Input
5
2 4 5 1 3
Output
Petr
Note
Please note that the sample is not a valid test (because of limitations for n) and is given only to illustrate input/output format. Your program still has to print correct answer to this test to get AC.
Due to randomness of input hacks in this problem are forbidden.
Tags: combinatorics, math
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write
def in_num():
return int(raw_input())
def in_arr():
return map(int,raw_input().split())
def pr_num(n):
stdout.write(str(n)+'\n')
def pr_arr(arr):
pr(' '.join(map(str,arr))+'\n')
# fast read function for total integer input
def inp():
# this function returns whole input of
# space/line seperated integers
# Use Ctrl+D to flush stdin.
return map(int,stdin.read().split())
range = xrange # not for python 3.0+
n=in_num()
l=in_arr()
c=0
for i in range(n):
if not l[i]:
continue
temp=i+1
c+=1
while temp:
#print i,temp,l
x=l[temp-1]
l[temp-1]=0
temp=x
#temp,l[temp-1]=l[temp-1],0
if c%2:
pr('Um_nik')
else:
pr('Petr')
```
| 4,800 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from 1 to n and then 3n times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements 7n+1 times instead of 3n times. Because it is more random, OK?!
You somehow get a test from one of these problems and now you want to know from which one.
Input
In the first line of input there is one integer n (10^{3} ≤ n ≤ 10^{6}).
In the second line there are n distinct integers between 1 and n — the permutation of size n from the test.
It is guaranteed that all tests except for sample are generated this way: First we choose n — the size of the permutation. Then we randomly choose a method to generate a permutation — the one of Petr or the one of Alex. Then we generate a permutation using chosen method.
Output
If the test is generated via Petr's method print "Petr" (without quotes). If the test is generated via Alex's method print "Um_nik" (without quotes).
Example
Input
5
2 4 5 1 3
Output
Petr
Note
Please note that the sample is not a valid test (because of limitations for n) and is given only to illustrate input/output format. Your program still has to print correct answer to this test to get AC.
Due to randomness of input hacks in this problem are forbidden.
Submitted Solution:
```
def getIntList():
return list(map(int, input().split()));
n= int(input());
s=getIntList();
s=[0]+s;
seen=[False]*(n+1);
sign=1;
for i in range(1, n+1):
length=1;
if seen[i]:
continue;
seen[i]=True;
j=s[i];
while j!=i:
seen[j]=True;
j=s[j];
length+=1;
if length%2==0:
sign*=-1;
if n%2==0:
signPetr=1;
else:
signPetr=-1;
if signPetr==sign:
print("Petr");
else:
print("Um_nik");
```
Yes
| 4,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from 1 to n and then 3n times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements 7n+1 times instead of 3n times. Because it is more random, OK?!
You somehow get a test from one of these problems and now you want to know from which one.
Input
In the first line of input there is one integer n (10^{3} ≤ n ≤ 10^{6}).
In the second line there are n distinct integers between 1 and n — the permutation of size n from the test.
It is guaranteed that all tests except for sample are generated this way: First we choose n — the size of the permutation. Then we randomly choose a method to generate a permutation — the one of Petr or the one of Alex. Then we generate a permutation using chosen method.
Output
If the test is generated via Petr's method print "Petr" (without quotes). If the test is generated via Alex's method print "Um_nik" (without quotes).
Example
Input
5
2 4 5 1 3
Output
Petr
Note
Please note that the sample is not a valid test (because of limitations for n) and is given only to illustrate input/output format. Your program still has to print correct answer to this test to get AC.
Due to randomness of input hacks in this problem are forbidden.
Submitted Solution:
```
def read():
return int(input())
def readmap():
return map(int, input().split())
def readlist():
return list(map(int, input().split()))
N = read()
P = readlist()
def is_even(P):
checked = [False] * (N+1)
# numset = {}
# for n in range(1, N+1):
# numset[n] = n
num_of_even_cycles = 0
for n in range(1, N+1):
if checked[n]:
continue
checked[n] = True
len_cyc = 1
nxt = P[n-1]
while not checked[nxt]:
checked[nxt] = True
nxt = P[nxt-1]
len_cyc += 1
if len_cyc % 2 == 0:
num_of_even_cycles += 1
# while numset:
# flag = False
# for n in numset.keys():
# if flag:
# break
# flag = True
# length_of_cycle = 1
# while P[n-1] in numset:
# length_of_cycle += 1
# del numset[n]
# n = P[n-1]
#
# if length_of_cycle % 2 == 0:
# num_of_even_cycles += 1
if num_of_even_cycles % 2 == 0:
return True
else:
return False
if N % 2 == 0:
if is_even(P):
print("Petr")
else:
print("Um_nik")
else:
if not is_even(P):
print("Petr")
else:
print("Um_nik")
```
Yes
| 4,802 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from 1 to n and then 3n times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements 7n+1 times instead of 3n times. Because it is more random, OK?!
You somehow get a test from one of these problems and now you want to know from which one.
Input
In the first line of input there is one integer n (10^{3} ≤ n ≤ 10^{6}).
In the second line there are n distinct integers between 1 and n — the permutation of size n from the test.
It is guaranteed that all tests except for sample are generated this way: First we choose n — the size of the permutation. Then we randomly choose a method to generate a permutation — the one of Petr or the one of Alex. Then we generate a permutation using chosen method.
Output
If the test is generated via Petr's method print "Petr" (without quotes). If the test is generated via Alex's method print "Um_nik" (without quotes).
Example
Input
5
2 4 5 1 3
Output
Petr
Note
Please note that the sample is not a valid test (because of limitations for n) and is given only to illustrate input/output format. Your program still has to print correct answer to this test to get AC.
Due to randomness of input hacks in this problem are forbidden.
Submitted Solution:
```
n=int(input())
a=list(map(int,input().split()))
pos={}
for i in range(n):
pos[a[i]]=i
ct=0
curr=1
for i in range(n):
if pos[curr]==i:
curr+=1
continue
ct+=1
j=pos[curr]
pos[curr]=i
pos[a[i]]=j
curr+=1
a[i],a[j]=a[j],a[i]
if (3*n<ct) or (3*n-ct)&1:
print("Um_nik")
else:
print("Petr")
```
Yes
| 4,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from 1 to n and then 3n times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements 7n+1 times instead of 3n times. Because it is more random, OK?!
You somehow get a test from one of these problems and now you want to know from which one.
Input
In the first line of input there is one integer n (10^{3} ≤ n ≤ 10^{6}).
In the second line there are n distinct integers between 1 and n — the permutation of size n from the test.
It is guaranteed that all tests except for sample are generated this way: First we choose n — the size of the permutation. Then we randomly choose a method to generate a permutation — the one of Petr or the one of Alex. Then we generate a permutation using chosen method.
Output
If the test is generated via Petr's method print "Petr" (without quotes). If the test is generated via Alex's method print "Um_nik" (without quotes).
Example
Input
5
2 4 5 1 3
Output
Petr
Note
Please note that the sample is not a valid test (because of limitations for n) and is given only to illustrate input/output format. Your program still has to print correct answer to this test to get AC.
Due to randomness of input hacks in this problem are forbidden.
Submitted Solution:
```
import random
astr=input()
N=int(astr)
s=input()
sk=s.split(' ')
ml=[int(i) for i in sk]
kl=[0 for i in ml]
#for i in range(0, 7*N+2):
# A=random.randint(0,N-1)
# B=A
# while(A==B):
# B=random.randint(0,N-1)
# swap=ml[A]
# ml[A]=ml[B]
# ml[B]=swap
#print(ml)
k=0
for i in range(0,N):
if kl[i]==0:
kl[i]=1
j=ml[i]
k=k+1
while(kl[j-1]==0):
kl[j-1]=1
j=ml[j-1]
if k%2==0: print("Petr")
else: print("Um_nik")
```
Yes
| 4,804 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from 1 to n and then 3n times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements 7n+1 times instead of 3n times. Because it is more random, OK?!
You somehow get a test from one of these problems and now you want to know from which one.
Input
In the first line of input there is one integer n (10^{3} ≤ n ≤ 10^{6}).
In the second line there are n distinct integers between 1 and n — the permutation of size n from the test.
It is guaranteed that all tests except for sample are generated this way: First we choose n — the size of the permutation. Then we randomly choose a method to generate a permutation — the one of Petr or the one of Alex. Then we generate a permutation using chosen method.
Output
If the test is generated via Petr's method print "Petr" (without quotes). If the test is generated via Alex's method print "Um_nik" (without quotes).
Example
Input
5
2 4 5 1 3
Output
Petr
Note
Please note that the sample is not a valid test (because of limitations for n) and is given only to illustrate input/output format. Your program still has to print correct answer to this test to get AC.
Due to randomness of input hacks in this problem are forbidden.
Submitted Solution:
```
from random import randint
a = randint(1, 2)
if a == 1:
print("Petr")
else:
print("Um_nik")
ps = 0
```
No
| 4,805 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from 1 to n and then 3n times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements 7n+1 times instead of 3n times. Because it is more random, OK?!
You somehow get a test from one of these problems and now you want to know from which one.
Input
In the first line of input there is one integer n (10^{3} ≤ n ≤ 10^{6}).
In the second line there are n distinct integers between 1 and n — the permutation of size n from the test.
It is guaranteed that all tests except for sample are generated this way: First we choose n — the size of the permutation. Then we randomly choose a method to generate a permutation — the one of Petr or the one of Alex. Then we generate a permutation using chosen method.
Output
If the test is generated via Petr's method print "Petr" (without quotes). If the test is generated via Alex's method print "Um_nik" (without quotes).
Example
Input
5
2 4 5 1 3
Output
Petr
Note
Please note that the sample is not a valid test (because of limitations for n) and is given only to illustrate input/output format. Your program still has to print correct answer to this test to get AC.
Due to randomness of input hacks in this problem are forbidden.
Submitted Solution:
```
import random
n=int(input())
l = input().split()
if(random.random() > 0.52):
print('Petr')
else:
print('Um_nik')
```
No
| 4,806 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from 1 to n and then 3n times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements 7n+1 times instead of 3n times. Because it is more random, OK?!
You somehow get a test from one of these problems and now you want to know from which one.
Input
In the first line of input there is one integer n (10^{3} ≤ n ≤ 10^{6}).
In the second line there are n distinct integers between 1 and n — the permutation of size n from the test.
It is guaranteed that all tests except for sample are generated this way: First we choose n — the size of the permutation. Then we randomly choose a method to generate a permutation — the one of Petr or the one of Alex. Then we generate a permutation using chosen method.
Output
If the test is generated via Petr's method print "Petr" (without quotes). If the test is generated via Alex's method print "Um_nik" (without quotes).
Example
Input
5
2 4 5 1 3
Output
Petr
Note
Please note that the sample is not a valid test (because of limitations for n) and is given only to illustrate input/output format. Your program still has to print correct answer to this test to get AC.
Due to randomness of input hacks in this problem are forbidden.
Submitted Solution:
```
n = int(input())
num = list(map(int, input().split()))
res = 0
for i in range(len(num)):
res += (num[i] != (i - 1))
if not (res < 2):
print('Petr')
else:
print('Um_nik')
```
No
| 4,807 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from 1 to n and then 3n times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements 7n+1 times instead of 3n times. Because it is more random, OK?!
You somehow get a test from one of these problems and now you want to know from which one.
Input
In the first line of input there is one integer n (10^{3} ≤ n ≤ 10^{6}).
In the second line there are n distinct integers between 1 and n — the permutation of size n from the test.
It is guaranteed that all tests except for sample are generated this way: First we choose n — the size of the permutation. Then we randomly choose a method to generate a permutation — the one of Petr or the one of Alex. Then we generate a permutation using chosen method.
Output
If the test is generated via Petr's method print "Petr" (without quotes). If the test is generated via Alex's method print "Um_nik" (without quotes).
Example
Input
5
2 4 5 1 3
Output
Petr
Note
Please note that the sample is not a valid test (because of limitations for n) and is given only to illustrate input/output format. Your program still has to print correct answer to this test to get AC.
Due to randomness of input hacks in this problem are forbidden.
Submitted Solution:
```
from random import randint
a = randint(1, 2)
if a == 1:
print("Petr")
else:
print("Um_nik")
q = 0
```
No
| 4,808 |
Provide a correct Python 3 solution for this coding contest problem.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
"Correct Solution:
```
print(max(map(len, input().split('S'))))
```
| 4,809 |
Provide a correct Python 3 solution for this coding contest problem.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
"Correct Solution:
```
def main():
s = input().split('S')
x = max(map(len,s))
print(x)
main()
```
| 4,810 |
Provide a correct Python 3 solution for this coding contest problem.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
"Correct Solution:
```
s = input()
if s == 'RSR':
print(1)
else:
print(s.count(('R')))
```
| 4,811 |
Provide a correct Python 3 solution for this coding contest problem.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
"Correct Solution:
```
S = input()
if S == "RSR":
print(1)
else:
print(S.count('R'))
```
| 4,812 |
Provide a correct Python 3 solution for this coding contest problem.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
"Correct Solution:
```
S = input()
l = S.split('S')
print(max([len(i) for i in l]))
```
| 4,813 |
Provide a correct Python 3 solution for this coding contest problem.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
"Correct Solution:
```
s=input()
print(3 if 'RRR' in s else 2 if 'RR' in s else 1 if'R' in s else 0)
```
| 4,814 |
Provide a correct Python 3 solution for this coding contest problem.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
"Correct Solution:
```
s=input()
ans=0
if 'R' in s:ans=1
if 'RR' in s:ans=2
if 'RRR' in s:ans=3
print(ans)
```
| 4,815 |
Provide a correct Python 3 solution for this coding contest problem.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
"Correct Solution:
```
s=input()
if s[1]=="R":
print(s.count("R"))
else:
print(min(1,s.count("R")))
```
| 4,816 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
Submitted Solution:
```
N = input()
ans = 0
for i in range(1,4):
p = "R"*i
if p in N:
ans = i
print(ans)
```
Yes
| 4,817 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
Submitted Solution:
```
s=input()
p=0
for i in s:
if i=="R":
p+=1
if i=="S" and p>0:
break
print(p)
```
Yes
| 4,818 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
Submitted Solution:
```
S = input()
arr = S.split("S")
brr = [len(arr[i]) for i in range(len(arr))]
print(max(brr))
```
Yes
| 4,819 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
Submitted Solution:
```
s = input().split('S')
a = map(len,s)
print(max(a))
```
Yes
| 4,820 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
Submitted Solution:
```
user = str(input())
if(user == "RRS"):
print("2")
elif(user == "SSS"):
print("0")
else:
print("1")
```
No
| 4,821 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
Submitted Solution:
```
s = str(input())
if s == "RRR":
print(3)
elif s == "SRR" or s == "RRS":
print(2)
elif s == "SSS":
print(1)
else:
print(0)
```
No
| 4,822 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
Submitted Solution:
```
s=input()
c=0
ma=0
for i in s:
if i=="R":
c+=1
else:
ma=max(ma,c)
c=0
print(ma)
```
No
| 4,823 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is `S`, it means it was sunny on the i-th day; if that character is `R`, it means it was rainy on that day.
Find the maximum number of consecutive rainy days in this period.
Constraints
* |S| = 3
* Each character of S is `S` or `R`.
Input
Input is given from Standard Input in the following format:
S
Output
Print the maximum number of consecutive rainy days in the period.
Examples
Input
RRS
Output
2
Input
SSS
Output
0
Input
RSR
Output
1
Submitted Solution:
```
S = input()
if S[1] == "R":
if S[0] == "R" and S[2] == "R":
print("2")
elif S[0] or S[2] == "R":
print("1")
else:
print("0")
```
No
| 4,824 |
Provide a correct Python 3 solution for this coding contest problem.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
"Correct Solution:
```
import math
a = int(input())
b = 0
for i in range(1,a+1):
for j in range(1,a+1):
for k in range(1,a+1):
b+=math.gcd(math.gcd(i,j),k)
print(b)
```
| 4,825 |
Provide a correct Python 3 solution for this coding contest problem.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
"Correct Solution:
```
from math import gcd
r = range(1, int(input()) + 1)
print(sum(gcd(gcd(a, b), c) for a in r for b in r for c in r))
```
| 4,826 |
Provide a correct Python 3 solution for this coding contest problem.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
"Correct Solution:
```
import math
K = int(input())
ans = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
ans += math.gcd(math.gcd(a,b),c)
print(ans)
```
| 4,827 |
Provide a correct Python 3 solution for this coding contest problem.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
"Correct Solution:
```
from math import gcd
n = int(input())
sum = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
sum += gcd(gcd(i,j),k)
print(sum)
```
| 4,828 |
Provide a correct Python 3 solution for this coding contest problem.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
"Correct Solution:
```
from math import gcd
K = int(input())
print(sum(gcd(gcd(a, b), c) for c in range(1, K + 1) for b in range(1, K + 1) for a in range(1, K + 1)))
```
| 4,829 |
Provide a correct Python 3 solution for this coding contest problem.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
"Correct Solution:
```
from math import gcd
s=int(input())
a=0
for i in range(1,s+1):
for j in range(1,s+1):
for k in range(1,s+1):
a+=gcd(gcd(i,j),k)
print(a)
```
| 4,830 |
Provide a correct Python 3 solution for this coding contest problem.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
"Correct Solution:
```
n = int(input())
l = 0
import math
for a in range(1,n+1):
for b in range(1,n+1):
for c in range(1,n+1):
l+=math.gcd(a,math.gcd(b,c))
print(l)
```
| 4,831 |
Provide a correct Python 3 solution for this coding contest problem.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
"Correct Solution:
```
from math import gcd
a = 0
K = int(input())
for i in range(1, K+1):
for j in range(1, K+1):
for l in range(1, K+1):
a += gcd(i, gcd(j, l))
print(a)
```
| 4,832 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
Submitted Solution:
```
import math
x=0;y=0
K=int(input())
for i in range(1,K+1):
for j in range(1,K+1):
y=math.gcd(i,j)
for h in range(1,K+1):
x=x+math.gcd(y,h)
print(x)
```
Yes
| 4,833 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
Submitted Solution:
```
from math import gcd
K=int(input())
S=0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
S+=gcd(a,gcd(b,c))
print(S)
```
Yes
| 4,834 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
Submitted Solution:
```
import math
K=int(input())
ans=0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans+=math.gcd(i,math.gcd(j,k))
print(ans)
```
Yes
| 4,835 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
Submitted Solution:
```
import math as mt
import itertools as iters
K = int(input())
A = 0
for a,b,c in iters.product(range(1,K+1),repeat=3):
A += mt.gcd(a,mt.gcd(b,c))
print(A)
```
Yes
| 4,836 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
Submitted Solution:
```
import math
from functools import reduce
#入力:N(int:整数)
def input1():
return int(input())
#入力:N,M(int:整数)
def input2():
return map(int,input().split())
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
k=input1()
result=0
for i in range(1,k+1):
for j in range(1,k+1):
for k in range(1,k+1):
result+=gcd(i,j,k)
print(result)
```
No
| 4,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
Submitted Solution:
```
import math
from functools import reduce
K = int(input())
summ = 0
# 組み合わせの数
# a, b, cが同じは1pattern
# a, b, cのうち、２つが同じパターンは３
# a, b, cのうち、全て異なるパターンは6
# つまり、３つの数の組み合わせの数を求め、各パターン倍すればよい
# タプルで集合を作成する
st = set()
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
sort_abc = sorted([a, b, c])
st.add(tuple(sort_abc))
# print(st)
for s in st:
if s[0] == s[1] == s[2]:
summ += reduce(math.gcd, s)
# print(0, s)
elif s[0] == s[1] or s[0] == s[2] or s[1] == s[2]:
summ += 3*reduce(math.gcd, s)
# print(1, s)
else:
summ += 6*reduce(math.gcd, s)
# print(2, s)
print(summ)
```
No
| 4,838 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
Submitted Solution:
```
import math
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(input())
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
for c in range(1, K+1):
ans += math.gcd(math.gcd(a, b), c)
print(ans)
```
No
| 4,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Here \gcd(a,b,c) denotes the greatest common divisor of a, b, and c.
Constraints
* 1 \leq K \leq 200
* K is an integer.
Input
Input is given from Standard Input in the following format:
K
Output
Print the value of \displaystyle{\sum_{a=1}^{K}\sum_{b=1}^{K}\sum_{c=1}^{K} \gcd(a,b,c)}.
Examples
Input
2
Output
9
Input
200
Output
10813692
Submitted Solution:
```
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd,numbers)
K=int(input())
s=0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
s+=gcd(a,b,c)
print(s)
```
No
| 4,840 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
"Correct Solution:
```
n = int(input())
for i in range(50001):
if n == int(i*1.08):
print (i)
exit()
print (":(")
```
| 4,841 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
"Correct Solution:
```
n=int(input())
for i in range(1,n+1):
if int(i*1.08)==n:
print(i)
exit()
print(":(")
```
| 4,842 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
"Correct Solution:
```
import math
price = int(input())
if price%1.08<0.1:
print(":(")
else:
print(math.ceil(price/1.08))
```
| 4,843 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
"Correct Solution:
```
n=int(input())
if n%27==13 or n%27==26:
print(":(")
else:
print(int(float(n+1)//1.08))
```
| 4,844 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
"Correct Solution:
```
n = int(input())
for i in range(1, 50000):
if i * 108 // 100 == n:
print(i)
exit()
print(':(')
```
| 4,845 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
"Correct Solution:
```
a=int(input())
b=0
for i in range(a+1):
c=i
c+=(i*8)//100
if c==a:
b=i
print(":("if b==0 else b)
```
| 4,846 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
"Correct Solution:
```
N = int(input())
ans = ":("
for i in range(N+1):
if int(i*1.08) == N:
ans = i
print(ans)
```
| 4,847 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
"Correct Solution:
```
ng=":("
n=int(input())
for i in range(50000):
if int(i*1.08)==n:
ans=i
print(ans);exit()
print(ng)
```
| 4,848 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
Submitted Solution:
```
n=int(input())
if (n+1)//1.08 != n//1.08:
res = int((n+1.08)//1.08)
print(res)
else:
print(':(')
```
Yes
| 4,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
Submitted Solution:
```
N = int(input())
for i in range(N+1):
if int(i*1.08)==N:
print(i)
break
else:
print(":(")
```
Yes
| 4,850 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
Submitted Solution:
```
n=int(input())
for x in range(n+1):
if int(x*1.08)==n:
print(x)
exit()
print(":(")
```
Yes
| 4,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
Submitted Solution:
```
n=int(input())
for i in range(n+1):
if int(i*1.08)==n:
print(i)
exit()
print(':(')
```
Yes
| 4,852 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
Submitted Solution:
```
from math import floor
N = int(input())
n = round(N / 1.08)
if floor(n*1.08) == N:
print(n)
else:
print(':(')
```
No
| 4,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
Submitted Solution:
```
N = int(input())
if N%1.08 == 0:
print(N//1.08)
else:
print(":(")
```
No
| 4,854 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
Submitted Solution:
```
n=int(input())
if (n*100)%108==0:
print(n*100//108)
else:
print(n*100//108+1)
```
No
| 4,855 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).
Takahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.
If there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.
Constraints
* 1 \leq N \leq 50000
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
If there are values that could be X, the price of the apple pie before tax, print any one of them.
If there are multiple such values, printing any one of them will be accepted.
If no value could be X, print `:(`.
Examples
Input
432
Output
400
Input
1079
Output
:(
Input
1001
Output
927
Submitted Solution:
```
N = int(input())
N_ = round((N/1.08//1)*1.08//1)
if N == N_:
print(round((N/1.08//1)))
else:
print(":(")
```
No
| 4,856 |
Provide a correct Python 3 solution for this coding contest problem.
There is a blackboard on which all integers from -10^{18} through 10^{18} are written, each of them appearing once. Takahashi will repeat the following sequence of operations any number of times he likes, possibly zero:
* Choose an integer between 1 and N (inclusive) that is written on the blackboard. Let x be the chosen integer, and erase x.
* If x-2 is not written on the blackboard, write x-2 on the blackboard.
* If x+K is not written on the blackboard, write x+K on the blackboard.
Find the number of possible sets of integers written on the blackboard after some number of operations, modulo M. We consider two sets different when there exists an integer contained in only one of the sets.
Constraints
* 1 \leq K\leq N \leq 150
* 10^8\leq M\leq 10^9
* N, K, and M are integers.
Input
Input is given from Standard Input in the following format:
N K M
Output
Print the number of possible sets of integers written on the blackboard after some number of operations, modulo M.
Examples
Input
3 1 998244353
Output
7
Input
6 3 998244353
Output
61
Input
9 4 702443618
Output
312
Input
17 7 208992811
Output
128832
Input
123 45 678901234
Output
256109226
"Correct Solution:
```
N, K, M = map(int, input().split())
# limitの最大値（limitなし）
L = (N+1)//2+1
def even(n, k) :
# dp[iまでみた][前のj個が連続]
dp = [[0] * (k+1) for _ in range(n+1)]
dp[0][0] = 1
for i in range(n) :
for j in range(k + 1) :
dp[i+1][0] = (dp[i+1][0] + dp[i][j]) % M
# 直前にK個連続しているときは追加できない
if j != k :
dp[i+1][j+1] = (dp[i+1][j+1] + dp[i][j]) % M
return sum(dp[n]) % M
def loop(x, y) :
return (2*x >= K+1 and 2*y >= K+3)
if K % 2 == 0 :
print(even(N//2, K//2) * even((N+1)//2, K//2) % M)
else :
# dp[x][y][z]
# iとパリティが異なる列がx個連続、iとパリティが同じ列がy個連続でかつxとyのどちらかをzまで伸ばせる組み合わせ
dp0 = [[[0]*(L+1) for _ in range(L+1)] for _ in range(L+1)]
dp0[0][0][L] = 1
for i in range(N) :
dp1 = [[[0]*(L+1) for _ in range(L+1)] for _ in range(L+1)]
for x in range(L+1) :
for y in range(L+1) :
if loop(x, y) : continue
for z in range(max(x, y)+1, L+1) :
if dp0[x][y][z] == 0 :
continue
dp1[y][x+1][z] += dp0[x][y][z]
dp1[y][x+1][z] %= M
# zの更新
# (1) y > x のときはzを引き継ぎ y <= x のときはLにリセット
# (2) ↖ みたいな矢印が引ける時 つまり 2*y >= K+3 and x > 0の時
# y - x + K//2 + 1 と (1)との最小値に更新
if y > x :
zz = z
else :
zz = L
if 2*y >= K+3 and x > 0 :
zz = min(zz, 1+y-x+K//2)
dp1[y][0][zz] += dp0[x][y][z]
dp1[y][0][zz] %= M
dp0 = dp1
ret = 0
for x in range(L+1) :
for y in range(L+1) :
if loop(x, y) : continue
for z in range(max(x, y)+1, L+1) :
ret += dp0[x][y][z]
ret %= M
print(ret)
```
| 4,857 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a blackboard on which all integers from -10^{18} through 10^{18} are written, each of them appearing once. Takahashi will repeat the following sequence of operations any number of times he likes, possibly zero:
* Choose an integer between 1 and N (inclusive) that is written on the blackboard. Let x be the chosen integer, and erase x.
* If x-2 is not written on the blackboard, write x-2 on the blackboard.
* If x+K is not written on the blackboard, write x+K on the blackboard.
Find the number of possible sets of integers written on the blackboard after some number of operations, modulo M. We consider two sets different when there exists an integer contained in only one of the sets.
Constraints
* 1 \leq K\leq N \leq 150
* 10^8\leq M\leq 10^9
* N, K, and M are integers.
Input
Input is given from Standard Input in the following format:
N K M
Output
Print the number of possible sets of integers written on the blackboard after some number of operations, modulo M.
Examples
Input
3 1 998244353
Output
7
Input
6 3 998244353
Output
61
Input
9 4 702443618
Output
312
Input
17 7 208992811
Output
128832
Input
123 45 678901234
Output
256109226
Submitted Solution:
```
import itertools
N, K, M = map(int, input().split(" "))
all_set = set()
seq = [i for i in range(1, N+1)]
all_set.add(tuple(seq))
for i in range(1, N+1):
l_ls = list(itertools.permutations(seq,i))
for l_tp in l_ls:
t = set([i for i in range(-1, N+K+1)])
for l in l_tp:
t.remove(l)
t.add(l-2)
t.add(l+K)
all_set.add(tuple(sorted(list(t))))
print(len(all_set) % M)
```
No
| 4,858 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
"Correct Solution:
```
import fractions
n,x=map(int,input().split())
l=list(map(int,input().split()))
m=[];
for i in l:
m.append(abs(i-x))
n=m.pop(0)
for j in m:
n=fractions.gcd(n,j)
print(n)
```
| 4,859 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
"Correct Solution:
```
import fractions
N, X = map(int, input().split())
x = list(map(int, input().split()))
t = abs(x[0] - X)
for a in x:
t = fractions.gcd(t, abs(a - X))
print(t)
```
| 4,860 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
"Correct Solution:
```
from math import gcd
from functools import reduce
_, X = map(int, input().split())
print(reduce(gcd, (abs(i - X) for i in set(map(int, input().split())))))
```
| 4,861 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
"Correct Solution:
```
#!/usr/bin/env python3
from functools import reduce
from math import gcd
n, X, *x = map(int, open(0).read().split())
x = [abs(i - X) for i in x]
print(reduce(gcd, x))
```
| 4,862 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
"Correct Solution:
```
n,x,*l=map(int,open(0).read().split())
from math import *
a=0
for i in l: a=gcd(a,abs(i-x))
print(a)
```
| 4,863 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
"Correct Solution:
```
from fractions import gcd
N, X = map(int, input().split())
x = map(int, input().split())
ans = 0
for i in x:
ans = gcd(ans, abs(X-i))
print(ans)
```
| 4,864 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
"Correct Solution:
```
from fractions import gcd
from functools import reduce
_, X = map(int, input().split())
print(reduce(gcd, (abs(X - i) for i in map(int, input().split()))))
```
| 4,865 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
"Correct Solution:
```
from math import gcd
n, X = map(int, input().split())
xlst = list(map(int, input().split()))
ans = X - xlst[0]
for x in xlst:
ans = gcd(ans, X - x)
print(ans)
```
| 4,866 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
Submitted Solution:
```
import fractions
from functools import reduce
N,X = map(int,input().split())
l = list(map(lambda x: abs(int(x)-X),input().split()))
print(reduce(fractions.gcd,l))
```
Yes
| 4,867 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
Submitted Solution:
```
from fractions import*
n,x,*l=map(int,open(0).read().split())
g=abs(l[0]-x)
for a,b in zip([x]+l,l):
g=gcd(g,abs(b-a))
print(g)
```
Yes
| 4,868 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
Submitted Solution:
```
N, X = map(int, input().split())
x = list(map(int, input().split()))
ans = abs(x[0]-X)
import fractions
for i in range(1,N):
ans = fractions.gcd(abs(x[i]-X),ans)
print(ans)
```
Yes
| 4,869 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
Submitted Solution:
```
import math
N,X=map(int,input().split())
L=list(map(int,input().split()))
L.append(X)
L=sorted(L)
m=L[1]-L[0]
for i in range(N):
m=math.gcd(m,L[i+1]-L[i])
print(m)
```
Yes
| 4,870 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
Submitted Solution:
```
from math import gcd
N, O = map(int, input().split())
X = list(map(int, input().split()))
X.append(O)
X.sort()
diff = [x-y for x, y in zip(X[1:], X[:-1])]
# print(diff)
for i in range(N-1):
diff[i+1] = gcd(diff[i], diff[i+1])
print(diff[N-1])
```
No
| 4,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
Submitted Solution:
```
def gcd(a,b):
if b == 0:
return a
return gcd(b, a%b)
def gcd_list(l):
# print(l)
if len(l) == 1:
return l[0]
temp = [gcd(l[0],l[1])]
n = 0
while(n<len(l)-2):
# print(temp)
temp.append( gcd(temp[n], l[n+2]) )
n = n+1
# print(temp)
return(temp[len(temp)-1])
n, start = map(int, input().split(" "))
li = list(map(int, input().split(" ")))
diff = min(li) - start
if(len(li) == 1):
print(diff)
else:
li.append(start)
diff = min(li) - start
for i in range(len(li)):
li[i] = li[i] - start - diff
# print(li)
print(gcd_list(li))
```
No
| 4,872 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
Submitted Solution:
```
N, X = map(int, input().split())
L = [int(i) for i in input().split()]
def gcd(x, y):
while(y > 0):
x, y = y, x%y
return int(x)
l = X - L[0]
L.sort()
if N > 1:
D = [L[i] - L[i-1] for i in range(1, N)]
for i in range(N-1):
l = gcd(l, D[i])
print(l)
```
No
| 4,873 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cities on a number line. The i-th city is located at coordinate x_i.
Your objective is to visit all these cities at least once.
In order to do so, you will first set a positive integer D.
Then, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:
* Move 1: travel from coordinate y to coordinate y + D.
* Move 2: travel from coordinate y to coordinate y - D.
Find the maximum value of D that enables you to visit all the cities.
Here, to visit a city is to travel to the coordinate where that city is located.
Constraints
* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq X \leq 10^9
* 1 \leq x_i \leq 10^9
* x_i are all different.
* x_1, x_2, ..., x_N \neq X
Input
Input is given from Standard Input in the following format:
N X
x_1 x_2 ... x_N
Output
Print the maximum value of D that enables you to visit all the cities.
Examples
Input
3 3
1 7 11
Output
2
Input
3 81
33 105 57
Output
24
Input
1 1
1000000000
Output
999999999
Submitted Solution:
```
n,X = map(int,input().split())
x = list(map(int,input().split()))
x.append(X)
x.sort()
a=[]
for i in range(n-1):
a.append(x[i+1]-x[i])
def gcd(m,n):
while n!=0:
s = m%n
m = n
n = s
return m
ans=min(a)
for j in a:
if j%min(a) != 0:
ans = gcd(j,ans)
print(ans)
```
No
| 4,874 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
"Correct Solution:
```
n,k=map(int,input().split())
ans=0
if k==0:
print(n*n)
exit()
for i in range(k+1,n+1):
ans+=(i-k)*(n//i)
if n-i*(n//i)-k+1>0:
ans+=n-i*(n//i)-k+1
# print(ans,i)
print(ans)
```
| 4,875 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
"Correct Solution:
```
n,k=map(int,input().split())
ans=0
for b in range(1,n+1):
p=n//b
r=n-p*b
ans+=p*max(b-k,0)+max(0,r-k+1)
if k==0:
ans-=n
print(ans)
```
| 4,876 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
"Correct Solution:
```
N,K=map(int,input().split())
if K==0:
print(N**2)
exit(0)
ans=0
for i in range(K+1,N+1):
base=i-(K-1)-1
ans+=(N//i)*base
rest=N%i
ans+=max(rest-(K-1),0)
print(ans)
```
| 4,877 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
"Correct Solution:
```
n, k = map(int,input().split())
num = 0
for b in range(k+1,n+1):
c = n%b
num += (n//b)*(b-k) + max(0,c-k+1)
if k == 0:
num -= 1
print(num)
```
| 4,878 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
"Correct Solution:
```
def main():
n,k = map(int,input().split())
ans = 0
for b in range(k+1,n+1):
ans += ((n//b)*max(0,b-k)+max(0,(n%b)-k+1))
if k == 0:
ans -= n
print(ans)
main()
```
| 4,879 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
"Correct Solution:
```
N,K=map(int,input().split())
def f(b):
d=max(b-K,0)*(N//b)+max(N%b-K+1,0)
return d
ans=0
if K==0:
print(N**2)
exit()
for i in range(1,N+1):
ans+=(f(i))
print(ans)
```
| 4,880 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
"Correct Solution:
```
N,K=map(int, input().split())
ans=0
for b in range(K+1,N+1):
ans += (b-K)*(N//b)
ans += max(0, N%b + (1 - K if K!=0 else 0))
print(ans)
```
| 4,881 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
"Correct Solution:
```
n,k = map(int,input().split())
if(k==0):
print(n*n)
exit()
ans = 0
for i in range(k+1,n+1):
ans += (n//i) * (i-k)
ans += max(0, n%i-k+1)
print(ans)
```
| 4,882 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
Submitted Solution:
```
import sys
N, K = map(int, input().split())
if K == 0:
print(N**2)
sys.exit()
ans = 0
for b in range(K+1,N+1):
peri, res = divmod(N,b)
ans += (b-K)*peri + max(0,res-K+1)
print(ans)
```
Yes
| 4,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
Submitted Solution:
```
N,K = map(int,input().split())
if K==0:
print(N*N)
exit()
ans = 0
for b in range(K+1,N+1):
d,m = divmod(N+1,b)
ans += (b-K)*d
ans += max(0, (m-1)-K+1)
print(ans)
```
Yes
| 4,884 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
Submitted Solution:
```
N, K = map(int, input().split())
if K == 0:
print(N**2)
exit()
ans = 0
for b in range(1, N+1):
if b <= K:
continue
ans += (N // b) * (b - K)
ans += max(0, N % b - K + 1)
print(ans)
```
Yes
| 4,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
Submitted Solution:
```
n,k=map(int,input().split())
ans=0
for i in range(n):
ans+=(n//(i+1))*max(0,i+1-k)+max(0,n%(i+1)-k+1)
if k>0:
print(ans)
else:
print(ans-n)
```
Yes
| 4,886 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
Submitted Solution:
```
n,k = map(int,input().split())
ans = 0
for i in range(k+1,n+1):
for j in range(1,n+1):
if j % i >= k:
ans +=1
print(ans)
```
No
| 4,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
Submitted Solution:
```
N, K = map(int, input().split())
ans = 0
for b in range(1, N+1):
block_K = max(0, b-K)
#print("b", b, "block_num", N//b, "block_K", block_K, "remain", (N+1)%b)
ans += block_K * ((N+1)//b) + max(0, (N+1)%b - K)
print(ans)
```
No
| 4,888 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
Submitted Solution:
```
n, k = map(int, input().split())
ans = 0
for i in range(1,n+1):
ans += max(0, (i-k) * (n // i)) + max(0, (n-(n//i)*i-1)-k+1)
print(ans)
```
No
| 4,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten. He remembers that the remainder of a divided by b was greater than or equal to K. Find the number of possible pairs that he may have had.
Constraints
* 1 \leq N \leq 10^5
* 0 \leq K \leq N-1
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the number of possible pairs that he may have had.
Examples
Input
5 2
Output
7
Input
10 0
Output
100
Input
31415 9265
Output
287927211
Submitted Solution:
```
N,K = map(int,input().split())
ans = 0
if K == 0:
print(N**2)
exit()
for b in range(K+1,N+1): #bを一個ずつチェックK+1からNまで
amari = b-K
loop = N//b
nokori = max(N%b+1-K,0)
temp = loop*amari + nokori
print(b,amari,loop,nokori,temp)
ans += temp
print(ans)
```
No
| 4,890 |
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
"Correct Solution:
```
import sys
from collections import Counter
n=int(input())
d=Counter(list(map(int,input().split())))
m=int(input())
t=Counter(list(map(int,input().split())))
k=list(t.keys())
for i in range(len(k)):
if d[k[i]]<t[k[i]]:
print('NO')
sys.exit()
print('YES')
```
| 4,891 |
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
"Correct Solution:
```
import collections
N = int(input())
D = collections.Counter(map(int,input().split()))
M = int(input())
T = collections.Counter(list(map(int,input().split())))
for key in T.keys():
if T[key] > D[key]:
print('NO')
exit()
print('YES')
```
| 4,892 |
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
"Correct Solution:
```
n = int(input())
d = list(map(int, input().split()))
m = int(input())
t = list(map(int, input().split()))
from collections import Counter
dc = Counter(d)
dt = Counter(t)
for k, v in dt.items():
if dc[k] < v:
print('NO')
exit()
print('YES')
```
| 4,893 |
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
"Correct Solution:
```
N = int(input())
D = list(map(int,input().split()))
D.sort()
M = int(input())
T = list(map(int,input().split()))
T.sort()
dindex = 0
for i in range(M):
while 1:
dindex += 1
if T[i] == D[dindex-1]:
break
elif dindex == N:
print('NO')
exit()
print('YES')
```
| 4,894 |
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
"Correct Solution:
```
N=int(input());D=sorted(map(int,input().split()))[::-1]
M=int(input());T=sorted(map(int,input().split()))
for t in T:
d=0
while D and d!=t:d=D.pop()
if d!=t:print("NO");quit()
print("YES")
```
| 4,895 |
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
"Correct Solution:
```
from collections import Counter
N = int(input())
D = Counter(list(map(int, input().split())))
M = int(input())
T = Counter(list(map(int, input().split())))
res = "YES"
for i in T:
if i not in D or T[i] > D[i]:
res = "NO"
break
print(res)
```
| 4,896 |
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
"Correct Solution:
```
N=int(input())
D=list(map(int, input().split()))
M=int(input())
T=list(map(int, input().split()))
import bisect
D=sorted(D)
T=sorted(T)
idx=0
for i in range(M):
t=T[i]
while D[idx]<t:
idx+=1
if D[idx]!=t:
print("NO")
exit()
idx+=1
print("YES")
```
| 4,897 |
Provide a correct Python 3 solution for this coding contest problem.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
"Correct Solution:
```
from collections import Counter
N = int(input())
D = list(map(int,input().split()))
M = int(input())
T = list(map(int,input().split()))
c1 = Counter(D)
c2 = Counter(T)
for k,v in c2.items():
if c1[k] < v:
print('NO')
exit()
print('YES')
```
| 4,898 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
He has N candidates of problems. The difficulty of the i-th candidate is D_i.
There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.
Determine whether Rng can complete the problem set without creating new candidates of problems.
Constraints
* 1 \leq N \leq 200,000
* 1 \leq D_i \leq 10^9
* 1 \leq M \leq 200,000
* 1 \leq T_i \leq 10^9
* All numbers in the input are integers.
Input
Input is given from Standard Input in the following format:
N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M
Output
Print `YES` if Rng can complete the problem set without creating new candidates of problems; print `NO` if he cannot.
Examples
Input
5
3 1 4 1 5
3
5 4 3
Output
YES
Input
7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600
Output
NO
Input
1
800
5
100 100 100 100 100
Output
NO
Input
15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5
Output
YES
Submitted Solution:
```
from collections import*
n=int(input())
d=Counter(map(int,input().split()))
m=int(input())
t=Counter(map(int,input().split()))
#print(d,t)
for k,v in t.items():
if d[k]<v:
print("NO")
exit()
print("YES")
```
Yes
| 4,899 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.