text stringlengths 1.02k 43.5k | conversation_id int64 853 107k | embedding list | cluster int64 24 24 |
|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wrote on the board a string s containing only lowercase Latin letters ('a'-'z'). This string is known for you and given in the input.
After that, he erased some letters from the string s, and he rewrote the remaining letters in any order. As a result, he got some new string t. You have to find it with some additional information.
Suppose that the string t has length m and the characters are numbered from left to right from 1 to m. You are given a sequence of m integers: b_1, b_2, …, b_m, where b_i is the sum of the distances |i-j| from the index i to all such indices j that t_j > t_i (consider that 'a'<'b'<...<'z'). In other words, to calculate b_i, Polycarp finds all such indices j that the index j contains a letter that is later in the alphabet than t_i and sums all the values |i-j|.
For example, if t = "abzb", then:
* since t_1='a', all other indices contain letters which are later in the alphabet, that is: b_1=|1-2|+|1-3|+|1-4|=1+2+3=6;
* since t_2='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_2=|2-3|=1;
* since t_3='z', then there are no indexes j such that t_j>t_i, thus b_3=0;
* since t_4='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_4=|4-3|=1.
Thus, if t = "abzb", then b=[6,1,0,1].
Given the string s and the array b, find any possible string t for which the following two requirements are fulfilled simultaneously:
* t is obtained from s by erasing some letters (possibly zero) and then writing the rest in any order;
* the array, constructed from the string t according to the rules above, equals to the array b specified in the input data.
Input
The first line contains an integer q (1 ≤ q ≤ 100) — the number of test cases in the test. Then q test cases follow.
Each test case consists of three lines:
* the first line contains string s, which has a length from 1 to 50 and consists of lowercase English letters;
* the second line contains positive integer m (1 ≤ m ≤ |s|), where |s| is the length of the string s, and m is the length of the array b;
* the third line contains the integers b_1, b_2, ..., b_m (0 ≤ b_i ≤ 1225).
It is guaranteed that in each test case an answer exists.
Output
Output q lines: the k-th of them should contain the answer (string t) to the k-th test case. It is guaranteed that an answer to each test case exists. If there are several answers, output any.
Example
Input
4
abac
3
2 1 0
abc
1
0
abba
3
1 0 1
ecoosdcefr
10
38 13 24 14 11 5 3 24 17 0
Output
aac
b
aba
codeforces
Note
In the first test case, such strings t are suitable: "aac', "aab".
In the second test case, such trings t are suitable: "a", "b", "c".
In the third test case, only the string t equals to "aba" is suitable, but the character 'b' can be from the second or third position.
Submitted Solution:
```
#A,B,C,D = map(int,input().split())
t = int(input())
for i in range(t):
D = list(input())
d = sorted(list(D), reverse=True)
#print(d)
l = int(input())
S = list(map(int,input().split()))
s = sorted(S)
#print(s)
#print(d)
out = ['x' for x in range(l)]
counter = 0
curl = 'x'
while max(S) > -1:
ind = []
while S.count(0) > d.count(d[counter]):
counter += 1
for j in range(len(S)):
if S[j] == 0:
out[j] = d[counter]
curl = d[counter]
S[j] -= 1
ind.append(j)
for indd in ind:
for j in range(len(S)):
S[j] -= abs(j - indd)
counter += len(ind)
try:
while curl == d[counter]:
counter += 1
except:
pass
print(''.join(out))
#print(S)
```
Yes
| 36,989 | [
0.296142578125,
0.2939453125,
0.365234375,
-0.1824951171875,
-0.537109375,
-0.2164306640625,
-0.4130859375,
-0.1075439453125,
0.060760498046875,
0.7998046875,
0.6650390625,
0.0975341796875,
-0.1231689453125,
-1.05078125,
-0.69384765625,
-0.1949462890625,
-0.45263671875,
-0.27099609... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wrote on the board a string s containing only lowercase Latin letters ('a'-'z'). This string is known for you and given in the input.
After that, he erased some letters from the string s, and he rewrote the remaining letters in any order. As a result, he got some new string t. You have to find it with some additional information.
Suppose that the string t has length m and the characters are numbered from left to right from 1 to m. You are given a sequence of m integers: b_1, b_2, …, b_m, where b_i is the sum of the distances |i-j| from the index i to all such indices j that t_j > t_i (consider that 'a'<'b'<...<'z'). In other words, to calculate b_i, Polycarp finds all such indices j that the index j contains a letter that is later in the alphabet than t_i and sums all the values |i-j|.
For example, if t = "abzb", then:
* since t_1='a', all other indices contain letters which are later in the alphabet, that is: b_1=|1-2|+|1-3|+|1-4|=1+2+3=6;
* since t_2='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_2=|2-3|=1;
* since t_3='z', then there are no indexes j such that t_j>t_i, thus b_3=0;
* since t_4='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_4=|4-3|=1.
Thus, if t = "abzb", then b=[6,1,0,1].
Given the string s and the array b, find any possible string t for which the following two requirements are fulfilled simultaneously:
* t is obtained from s by erasing some letters (possibly zero) and then writing the rest in any order;
* the array, constructed from the string t according to the rules above, equals to the array b specified in the input data.
Input
The first line contains an integer q (1 ≤ q ≤ 100) — the number of test cases in the test. Then q test cases follow.
Each test case consists of three lines:
* the first line contains string s, which has a length from 1 to 50 and consists of lowercase English letters;
* the second line contains positive integer m (1 ≤ m ≤ |s|), where |s| is the length of the string s, and m is the length of the array b;
* the third line contains the integers b_1, b_2, ..., b_m (0 ≤ b_i ≤ 1225).
It is guaranteed that in each test case an answer exists.
Output
Output q lines: the k-th of them should contain the answer (string t) to the k-th test case. It is guaranteed that an answer to each test case exists. If there are several answers, output any.
Example
Input
4
abac
3
2 1 0
abc
1
0
abba
3
1 0 1
ecoosdcefr
10
38 13 24 14 11 5 3 24 17 0
Output
aac
b
aba
codeforces
Note
In the first test case, such strings t are suitable: "aac', "aab".
In the second test case, such trings t are suitable: "a", "b", "c".
In the third test case, only the string t equals to "aba" is suitable, but the character 'b' can be from the second or third position.
Submitted Solution:
```
def solve(s,m,arr,ans):
t = [-1]*m
letters = [0]*26
for i in s:
letters[ord(i)-ord('a')] += 1
#print(letters)
limit = 25
indices = []
count = arr.count(0)
while True:
index = -1
for i in range(limit,-1,-1):
if letters[i] >= count:
limit = i-1
index = i
break
#print(index,count)
if not indices:
for i in range(m):
if arr[i] == 0:
t[i] = chr(ord('a')+index)
indices.append(i)
else:
for i in good:
t[i] = chr(ord('a')+index)
indices.extend(good)
good = []
for i in range(m):
if t[i] != -1:
continue
count = 0
for index in indices:
count += abs(index-i)
if count == arr[i]:
good.append(i)
if not good:
break
count = len(good)
t1 = ''
for i in t:
t1 += i
#print(t1)
ans.append(t1)
def main():
q = int(input())
ans = []
for i in range(q):
s = input()
m = int(input())
arr = list(map(int,input().split()))
solve(s,m,arr,ans)
for i in ans:
print(i)
main()
```
Yes
| 36,990 | [
0.296142578125,
0.2939453125,
0.365234375,
-0.1824951171875,
-0.537109375,
-0.2164306640625,
-0.4130859375,
-0.1075439453125,
0.060760498046875,
0.7998046875,
0.6650390625,
0.0975341796875,
-0.1231689453125,
-1.05078125,
-0.69384765625,
-0.1949462890625,
-0.45263671875,
-0.27099609... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wrote on the board a string s containing only lowercase Latin letters ('a'-'z'). This string is known for you and given in the input.
After that, he erased some letters from the string s, and he rewrote the remaining letters in any order. As a result, he got some new string t. You have to find it with some additional information.
Suppose that the string t has length m and the characters are numbered from left to right from 1 to m. You are given a sequence of m integers: b_1, b_2, …, b_m, where b_i is the sum of the distances |i-j| from the index i to all such indices j that t_j > t_i (consider that 'a'<'b'<...<'z'). In other words, to calculate b_i, Polycarp finds all such indices j that the index j contains a letter that is later in the alphabet than t_i and sums all the values |i-j|.
For example, if t = "abzb", then:
* since t_1='a', all other indices contain letters which are later in the alphabet, that is: b_1=|1-2|+|1-3|+|1-4|=1+2+3=6;
* since t_2='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_2=|2-3|=1;
* since t_3='z', then there are no indexes j such that t_j>t_i, thus b_3=0;
* since t_4='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_4=|4-3|=1.
Thus, if t = "abzb", then b=[6,1,0,1].
Given the string s and the array b, find any possible string t for which the following two requirements are fulfilled simultaneously:
* t is obtained from s by erasing some letters (possibly zero) and then writing the rest in any order;
* the array, constructed from the string t according to the rules above, equals to the array b specified in the input data.
Input
The first line contains an integer q (1 ≤ q ≤ 100) — the number of test cases in the test. Then q test cases follow.
Each test case consists of three lines:
* the first line contains string s, which has a length from 1 to 50 and consists of lowercase English letters;
* the second line contains positive integer m (1 ≤ m ≤ |s|), where |s| is the length of the string s, and m is the length of the array b;
* the third line contains the integers b_1, b_2, ..., b_m (0 ≤ b_i ≤ 1225).
It is guaranteed that in each test case an answer exists.
Output
Output q lines: the k-th of them should contain the answer (string t) to the k-th test case. It is guaranteed that an answer to each test case exists. If there are several answers, output any.
Example
Input
4
abac
3
2 1 0
abc
1
0
abba
3
1 0 1
ecoosdcefr
10
38 13 24 14 11 5 3 24 17 0
Output
aac
b
aba
codeforces
Note
In the first test case, such strings t are suitable: "aac', "aab".
In the second test case, such trings t are suitable: "a", "b", "c".
In the third test case, only the string t equals to "aba" is suitable, but the character 'b' can be from the second or third position.
Submitted Solution:
```
from collections import deque
q = int(input())
def find_zero_idx():
val ,no = [],0
for i in range(m):
if arr[i]==0:
val.append(i)
arr[i]=1e5
no+=1
return val,no
def find_char(count,freq):
for i in range(25,-1,-1):
if freq[i]>=count:
alphabet = chr(i+97)
freq[i]=-1
return alphabet
def solve():
freq = list(bytearray(26))
for c in s:
idx = ord(c)-97
freq[idx]+=1
for i in range(26):
if freq[i]==0:
freq[i]=-1
ans = [None for i in range(m)]
filled = 0
while True:
zero_idx,total_zero = find_zero_idx()
character = find_char(total_zero,freq)
if total_zero==0:
break
for idx in zero_idx:
ans[idx]=character
filled+=1
for i in range(m):
if ans[i]==None:
for idx in zero_idx:
arr[i]-=abs(i-idx)
return "".join(ans)
for _ in range(q):
s = list(input())
m = int(input())
arr = list(map(int,input().split()))
ans = solve()
print(ans)
```
No
| 36,991 | [
0.296142578125,
0.2939453125,
0.365234375,
-0.1824951171875,
-0.537109375,
-0.2164306640625,
-0.4130859375,
-0.1075439453125,
0.060760498046875,
0.7998046875,
0.6650390625,
0.0975341796875,
-0.1231689453125,
-1.05078125,
-0.69384765625,
-0.1949462890625,
-0.45263671875,
-0.27099609... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wrote on the board a string s containing only lowercase Latin letters ('a'-'z'). This string is known for you and given in the input.
After that, he erased some letters from the string s, and he rewrote the remaining letters in any order. As a result, he got some new string t. You have to find it with some additional information.
Suppose that the string t has length m and the characters are numbered from left to right from 1 to m. You are given a sequence of m integers: b_1, b_2, …, b_m, where b_i is the sum of the distances |i-j| from the index i to all such indices j that t_j > t_i (consider that 'a'<'b'<...<'z'). In other words, to calculate b_i, Polycarp finds all such indices j that the index j contains a letter that is later in the alphabet than t_i and sums all the values |i-j|.
For example, if t = "abzb", then:
* since t_1='a', all other indices contain letters which are later in the alphabet, that is: b_1=|1-2|+|1-3|+|1-4|=1+2+3=6;
* since t_2='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_2=|2-3|=1;
* since t_3='z', then there are no indexes j such that t_j>t_i, thus b_3=0;
* since t_4='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_4=|4-3|=1.
Thus, if t = "abzb", then b=[6,1,0,1].
Given the string s and the array b, find any possible string t for which the following two requirements are fulfilled simultaneously:
* t is obtained from s by erasing some letters (possibly zero) and then writing the rest in any order;
* the array, constructed from the string t according to the rules above, equals to the array b specified in the input data.
Input
The first line contains an integer q (1 ≤ q ≤ 100) — the number of test cases in the test. Then q test cases follow.
Each test case consists of three lines:
* the first line contains string s, which has a length from 1 to 50 and consists of lowercase English letters;
* the second line contains positive integer m (1 ≤ m ≤ |s|), where |s| is the length of the string s, and m is the length of the array b;
* the third line contains the integers b_1, b_2, ..., b_m (0 ≤ b_i ≤ 1225).
It is guaranteed that in each test case an answer exists.
Output
Output q lines: the k-th of them should contain the answer (string t) to the k-th test case. It is guaranteed that an answer to each test case exists. If there are several answers, output any.
Example
Input
4
abac
3
2 1 0
abc
1
0
abba
3
1 0 1
ecoosdcefr
10
38 13 24 14 11 5 3 24 17 0
Output
aac
b
aba
codeforces
Note
In the first test case, such strings t are suitable: "aac', "aab".
In the second test case, such trings t are suitable: "a", "b", "c".
In the third test case, only the string t equals to "aba" is suitable, but the character 'b' can be from the second or third position.
Submitted Solution:
```
#Imports
from collections import defaultdict as dc
from collections import Counter
from heapq import *
import math
from bisect import bisect_left,bisect
#bisect gives x and p[x] is element greater than it and out of bound for last one
#p[x-1] gives equal or smaller and no error for any element.
import sys
from collections import deque as dq
from heapq import heapify,heappush,heappop
mod=10**9 +7
# How to sort a list using two compare :
# instead of defining a function define class as a key
'''class key(str):
def __lt__(x,y):
return int(x+y)>int(y+x)'''
def sinp():
p=str(sys,stdin.readline())
return p
def seive(n):
p=[0]*(n+1)
for i in range(2,n):
if p[i]==0:
for j in range(2*i,n+1,i):
p[i]=1
return p
def lower_bound(a,i,n):
#Number of element is equal or lower than it
#return bisect(a,i)
#Number of elementt lower than it
return bisect_left(a,i)
def upper_bound(a,i,n):
#Number of element greater than it
#return n-bisect(a,i)
#Number of element greater than or equal to it
return n-bisect_left(a,i)
def inp():
p=int(sys.stdin.readline())
return p
def line():
p=list(map(int,sys.stdin.readline().split()))
return p
def read_mat():
n=inp()
a=[]
for i in range(n):
a.append(line())
return a
def ind(a):
return ord(a)-ord('A')
def digit(n):
s=str(n)
p=0
for i in s:
p+=(int(i))**2
return p
def solve(s,m,b):
t=list('#'*m)
p=[]
for i in range(m):
if b[i]==0:
p.append([i+1,'#'])
for i in range(len(p)):
z=s.pop()
t[p[i][0]-1]=z
p[i][1]=z
def position(b,m,p,x):
for i in range(1,m+1):
sm=0
for j in range(len(p)):
if p[j][1]!=x:
sm+=abs(i-p[j][0])
if sm==b[i-1] and t[i-1]=="#":
# print(x,i-1)
return i-1
return -1
n=len(s)
for i in range(n-1,-1,-1):
x=s[i]
l=position(b,m,p,x)
if l==-1:
return -1
t[l]=x
# print(p)
p.append([l+1,x])
return ''.join(t)
t=inp()
for _ in range(t):
s=str(input())
m=inp()
b=line()
n=len(s)
s=sorted(s)
if n>=m:
for i in range(n-m+1):
z=solve(s[i:i+m],m,b)
if z==-1:
continue
print(z)
break
```
No
| 36,992 | [
0.296142578125,
0.2939453125,
0.365234375,
-0.1824951171875,
-0.537109375,
-0.2164306640625,
-0.4130859375,
-0.1075439453125,
0.060760498046875,
0.7998046875,
0.6650390625,
0.0975341796875,
-0.1231689453125,
-1.05078125,
-0.69384765625,
-0.1949462890625,
-0.45263671875,
-0.27099609... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wrote on the board a string s containing only lowercase Latin letters ('a'-'z'). This string is known for you and given in the input.
After that, he erased some letters from the string s, and he rewrote the remaining letters in any order. As a result, he got some new string t. You have to find it with some additional information.
Suppose that the string t has length m and the characters are numbered from left to right from 1 to m. You are given a sequence of m integers: b_1, b_2, …, b_m, where b_i is the sum of the distances |i-j| from the index i to all such indices j that t_j > t_i (consider that 'a'<'b'<...<'z'). In other words, to calculate b_i, Polycarp finds all such indices j that the index j contains a letter that is later in the alphabet than t_i and sums all the values |i-j|.
For example, if t = "abzb", then:
* since t_1='a', all other indices contain letters which are later in the alphabet, that is: b_1=|1-2|+|1-3|+|1-4|=1+2+3=6;
* since t_2='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_2=|2-3|=1;
* since t_3='z', then there are no indexes j such that t_j>t_i, thus b_3=0;
* since t_4='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_4=|4-3|=1.
Thus, if t = "abzb", then b=[6,1,0,1].
Given the string s and the array b, find any possible string t for which the following two requirements are fulfilled simultaneously:
* t is obtained from s by erasing some letters (possibly zero) and then writing the rest in any order;
* the array, constructed from the string t according to the rules above, equals to the array b specified in the input data.
Input
The first line contains an integer q (1 ≤ q ≤ 100) — the number of test cases in the test. Then q test cases follow.
Each test case consists of three lines:
* the first line contains string s, which has a length from 1 to 50 and consists of lowercase English letters;
* the second line contains positive integer m (1 ≤ m ≤ |s|), where |s| is the length of the string s, and m is the length of the array b;
* the third line contains the integers b_1, b_2, ..., b_m (0 ≤ b_i ≤ 1225).
It is guaranteed that in each test case an answer exists.
Output
Output q lines: the k-th of them should contain the answer (string t) to the k-th test case. It is guaranteed that an answer to each test case exists. If there are several answers, output any.
Example
Input
4
abac
3
2 1 0
abc
1
0
abba
3
1 0 1
ecoosdcefr
10
38 13 24 14 11 5 3 24 17 0
Output
aac
b
aba
codeforces
Note
In the first test case, such strings t are suitable: "aac', "aab".
In the second test case, such trings t are suitable: "a", "b", "c".
In the third test case, only the string t equals to "aba" is suitable, but the character 'b' can be from the second or third position.
Submitted Solution:
```
from collections import deque
q = int(input())
def find_zero_idx():
val ,no = [],0
for i in range(m):
if arr[i]==0:
val.append(i)
arr[i]=1e5
no+=1
return val,no
def find_char(count,freq):
for i in range(25,-1,-1):
if freq[i]>=count:
alphabet = chr(i+97)
freq[i]=-1
return alphabet
def solve():
freq = list(bytearray(26))
for c in s:
idx = ord(c)-97
freq[idx]+=1
for i in range(26):
if freq[i]==0:
freq[i]=-1
ans = [None for i in range(m)]
filled = 0
while filled<m:
zero_idx,total_zero = find_zero_idx()
character = find_char(total_zero,freq)
for idx in zero_idx:
ans[idx]=character
filled+=1
for i in range(m):
if ans[i]==None:
for idx in zero_idx:
arr[i]-=abs(i-idx)
return "".join(ans)
for _ in range(q):
s = list(input())
m = int(input())
arr = list(map(int,input().split()))
ans = solve()
print(ans)
```
No
| 36,993 | [
0.296142578125,
0.2939453125,
0.365234375,
-0.1824951171875,
-0.537109375,
-0.2164306640625,
-0.4130859375,
-0.1075439453125,
0.060760498046875,
0.7998046875,
0.6650390625,
0.0975341796875,
-0.1231689453125,
-1.05078125,
-0.69384765625,
-0.1949462890625,
-0.45263671875,
-0.27099609... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp wrote on the board a string s containing only lowercase Latin letters ('a'-'z'). This string is known for you and given in the input.
After that, he erased some letters from the string s, and he rewrote the remaining letters in any order. As a result, he got some new string t. You have to find it with some additional information.
Suppose that the string t has length m and the characters are numbered from left to right from 1 to m. You are given a sequence of m integers: b_1, b_2, …, b_m, where b_i is the sum of the distances |i-j| from the index i to all such indices j that t_j > t_i (consider that 'a'<'b'<...<'z'). In other words, to calculate b_i, Polycarp finds all such indices j that the index j contains a letter that is later in the alphabet than t_i and sums all the values |i-j|.
For example, if t = "abzb", then:
* since t_1='a', all other indices contain letters which are later in the alphabet, that is: b_1=|1-2|+|1-3|+|1-4|=1+2+3=6;
* since t_2='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_2=|2-3|=1;
* since t_3='z', then there are no indexes j such that t_j>t_i, thus b_3=0;
* since t_4='b', only the index j=3 contains the letter, which is later in the alphabet, that is: b_4=|4-3|=1.
Thus, if t = "abzb", then b=[6,1,0,1].
Given the string s and the array b, find any possible string t for which the following two requirements are fulfilled simultaneously:
* t is obtained from s by erasing some letters (possibly zero) and then writing the rest in any order;
* the array, constructed from the string t according to the rules above, equals to the array b specified in the input data.
Input
The first line contains an integer q (1 ≤ q ≤ 100) — the number of test cases in the test. Then q test cases follow.
Each test case consists of three lines:
* the first line contains string s, which has a length from 1 to 50 and consists of lowercase English letters;
* the second line contains positive integer m (1 ≤ m ≤ |s|), where |s| is the length of the string s, and m is the length of the array b;
* the third line contains the integers b_1, b_2, ..., b_m (0 ≤ b_i ≤ 1225).
It is guaranteed that in each test case an answer exists.
Output
Output q lines: the k-th of them should contain the answer (string t) to the k-th test case. It is guaranteed that an answer to each test case exists. If there are several answers, output any.
Example
Input
4
abac
3
2 1 0
abc
1
0
abba
3
1 0 1
ecoosdcefr
10
38 13 24 14 11 5 3 24 17 0
Output
aac
b
aba
codeforces
Note
In the first test case, such strings t are suitable: "aac', "aab".
In the second test case, such trings t are suitable: "a", "b", "c".
In the third test case, only the string t equals to "aba" is suitable, but the character 'b' can be from the second or third position.
Submitted Solution:
```
def counter(l,a):
count=0
for i in range(len(l)):
if l[i]==a:
count+=1
return count
t=int(input())
for _ in range(t):
s=list(input())
n=len(s)
m=int(input())
b=list(map(int,input().split()))
t=['0']*m
while(True):
z=[]
for i in range(m):
if b[i]==0:
z.append(i)
maxx=max(s)
if counter(s,maxx)>=len(z):
for i in z:
t[i]=maxx
for j in range(m):
if j not in z:
b[j]-=abs(i-j)
b[i]=-1
for i in range(n):
if s[i]==maxx:
s[i]='0'
else:
for i in range(n):
if s[i]==maxx:
s[i]='0'
if b==[-1]*m or s==['0']*n:
break
print(*t)
```
No
| 36,994 | [
0.296142578125,
0.2939453125,
0.365234375,
-0.1824951171875,
-0.537109375,
-0.2164306640625,
-0.4130859375,
-0.1075439453125,
0.060760498046875,
0.7998046875,
0.6650390625,
0.0975341796875,
-0.1231689453125,
-1.05078125,
-0.69384765625,
-0.1949462890625,
-0.45263671875,
-0.27099609... | 24 |
Provide a correct Python 3 solution for this coding contest problem.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
"Correct Solution:
```
n = int(input())
a = []
for i in range(n):
m, h = input().split(':')
m = int(m)
h = int(h)
a.append(m * 60 + h)
a.sort()
ans = 0
for i in range(n):
ans = max(ans, a[i] - a[i - 1] - 1)
ans = max(ans, 1440 + a[0] - a[-1] - 1)
if n == 1:
print('23:59')
else:
hh = ans // 60
mm = ans % 60
hh = str(hh)
mm = str(mm)
if len(hh) == 1:
hh = '0' + hh
if len(mm) == 1:
mm = '0' + mm
print(hh + ':' + mm)
```
| 37,443 | [
0.42138671875,
0.6962890625,
-0.1849365234375,
-0.05523681640625,
-0.44775390625,
-0.21728515625,
-0.485107421875,
-0.0292510986328125,
0.2222900390625,
0.8056640625,
0.7109375,
0.07904052734375,
0.292236328125,
-0.9716796875,
-0.82861328125,
0.297119140625,
-0.626953125,
-0.727050... | 24 |
Provide a correct Python 3 solution for this coding contest problem.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
"Correct Solution:
```
n = int(input())
arr = []
for i in range(n):
h, m = map(int, input().split(':'));
cur = h * 60 + m;
arr.append(cur)
arr.sort()
arr.append(24 * 60 + arr[0])
maxx = 0
for i in range(1, len(arr)):
maxx = max(maxx, arr[i] - arr[i - 1] - 1)
m = maxx % 60
h = maxx // 60
if (h < 10):
print(0, end ='');
print(h, ':', sep = '', end = '')
if (m < 10):
print(0, end = '')
print(m)
```
| 37,444 | [
0.420166015625,
0.720703125,
-0.212158203125,
-0.0477294921875,
-0.43505859375,
-0.21484375,
-0.5,
-0.03759765625,
0.2210693359375,
0.828125,
0.71923828125,
0.08074951171875,
0.273681640625,
-0.96826171875,
-0.8408203125,
0.285888671875,
-0.64013671875,
-0.70654296875,
-0.2512207... | 24 |
Provide a correct Python 3 solution for this coding contest problem.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
"Correct Solution:
```
import sys
n = int(input())
lst = []
p = -1
mx = 0
while n > 0:
str = input()
x = 60 * (10 * int(str[0]) + int(str[1])) + 10 * int(str[3]) + int(str[4])
lst.append(x)
n -= 1
lst.sort()
for i in lst:
if p >= 0:
mx = max(mx, i - p)
p = i
x = lst[0]
y = lst[-1]
mx = max(mx, x + 1440 - y)
mx -= 1
if mx // 60 < 10:
print(0, end = '')
print(mx // 60, end = '')
print(':', end = '')
if mx % 60 < 10:
print(0, end = '')
print(mx % 60, end = '')
```
| 37,445 | [
0.437744140625,
0.70166015625,
-0.193603515625,
-0.029937744140625,
-0.43896484375,
-0.2022705078125,
-0.469970703125,
-0.039337158203125,
0.21923828125,
0.8291015625,
0.67724609375,
0.10113525390625,
0.291748046875,
-0.97607421875,
-0.85205078125,
0.271728515625,
-0.623046875,
-0.... | 24 |
Provide a correct Python 3 solution for this coding contest problem.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
"Correct Solution:
```
n = int(input())
a = []
for i in range(n):
h, m = map(int, input().split(":"))
a.append((h + 24) * 60 + m)
a.append(h * 60 + m)
a.sort()
j = 0
s = 0
ans = 0
for i in range(0, 48 * 60):
if (j < 2 * n and a[j] == i):
ans = max(ans, s)
s = 0
j += 1
continue
else:
s += 1
h = ans // 60
m = ans % 60
hans = ""
mans = ""
if h < 10:
hans = "0" + str(h)
else:
hans = str(h)
if m < 10:
mans = "0" + str(m)
else:
mans = str(m)
print(hans + ":" + mans)
```
| 37,446 | [
0.4150390625,
0.6962890625,
-0.190673828125,
-0.045928955078125,
-0.43994140625,
-0.216796875,
-0.50732421875,
-0.0307769775390625,
0.2119140625,
0.828125,
0.7099609375,
0.09112548828125,
0.305419921875,
-0.9765625,
-0.828125,
0.287841796875,
-0.64501953125,
-0.720703125,
-0.2493... | 24 |
Provide a correct Python 3 solution for this coding contest problem.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
"Correct Solution:
```
n = int(input())
A = []
for i in range(n):
s = input()
h = s[:2]
m = s[3:]
A.append((int(h), int(m)))
md = -12341234
A = sorted(A)
for i in range(n - 1):
a, b = A[i]
c, d = A[i + 1]
g = (c - a) * 60
if(b > d):
g += 60 - b + d
g -= 60
else:
g += d - b
if(g > md):
md = g
a, b = A[0]
c, d = A[n - 1]
g = (24 - c + a)*60
g += 60 - d + b
g -= 60
if(g > md):
md = g
md -= 1
if(md//60 < 10):
print('0', sep = '', end = '');
print(md//60, ':', sep ='', end = '')
if(md % 60 < 10):
print('0', sep = '', end = '');
print(md % 60)
```
| 37,447 | [
0.427978515625,
0.70068359375,
-0.1881103515625,
-0.053375244140625,
-0.450439453125,
-0.2054443359375,
-0.4921875,
-0.0217437744140625,
0.211669921875,
0.81494140625,
0.71240234375,
0.088623046875,
0.299560546875,
-0.970703125,
-0.8349609375,
0.296630859375,
-0.619140625,
-0.71142... | 24 |
Provide a correct Python 3 solution for this coding contest problem.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
"Correct Solution:
```
b = int(input())
times = []
line = ""
a = b
while a > 0:
a-=1
curr_time = input().split(":")
times.append(int(curr_time[0])*60+int(curr_time[1]))
times.sort()
times.append(times[0]+24*60)
max_delta = 0
if times[0] > max_delta:
max_delta = times[0]
for it in range(1,b+1):
if times[it] - times[it - 1] > max_delta:
max_delta = times[it] - times[it-1] - 1
if max_delta // 60 < 10:
first = "0"+str(max_delta // 60)
else:
first = str(max_delta // 60)
if max_delta - 60 * (max_delta // 60) < 10:
second = "0"+str(max_delta - 60 * (max_delta // 60))
else:
second = str(max_delta - 60 * (max_delta // 60))
print(first + ":" + second)
```
| 37,448 | [
0.41162109375,
0.71728515625,
-0.2073974609375,
-0.010650634765625,
-0.427978515625,
-0.1959228515625,
-0.492919921875,
-0.027557373046875,
0.2359619140625,
0.86767578125,
0.7109375,
0.094970703125,
0.28759765625,
-1.0009765625,
-0.84619140625,
0.30517578125,
-0.63427734375,
-0.745... | 24 |
Provide a correct Python 3 solution for this coding contest problem.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
"Correct Solution:
```
def f(x):
if x < 10:
return "0" + str(x)
return str(x)
n = int(input())
times = []
for i in range(0, n):
s = input()
times.append(60 * int(s[0:2]) + int(s[3:5]))
times.append(60 * 24 + 60 * int(s[0:2]) + int(s[3:5]))
times.sort()
ans = times[1] - times[0] - 1
for i in range(1, len(times)):
ans = max(ans , times[i] - times[i - 1] - 1)
print("{}:{}".format(f(ans // 60), f(ans % 60)))
```
| 37,449 | [
0.393798828125,
0.720703125,
-0.1947021484375,
-0.0133056640625,
-0.44384765625,
-0.183349609375,
-0.498046875,
-0.032012939453125,
0.2200927734375,
0.83154296875,
0.732421875,
0.0792236328125,
0.2939453125,
-0.97705078125,
-0.84765625,
0.3173828125,
-0.66015625,
-0.765625,
-0.24... | 24 |
Provide a correct Python 3 solution for this coding contest problem.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
"Correct Solution:
```
n = int(input())
a = []
def mem(kek):
return (int(kek[0])*10 + int(kek[1]))*60 + int(kek[3])*10 + int(kek[4])
def lol(kek):
h = str(kek//60)
m = str(kek%60)
ans = ""
if (len(h)<2): ans+="0"
ans+=h
ans+=":"
if (len(m)<2): ans+="0"
ans+=m
return ans
delt = 60*24
for i in range(n):
st = input()
a.append(mem(st))
a.append(mem(st)+delt )
a.append(mem(st)+2*delt)
a = sorted(a)
ans = 0
for i in range(1,len(a)):
ans = max(ans, a[i] - a[i-1] - 1)
print(lol(ans))
```
| 37,450 | [
0.437255859375,
0.67724609375,
-0.230224609375,
0.01416778564453125,
-0.490478515625,
-0.271240234375,
-0.47998046875,
-0.0147857666015625,
0.160400390625,
0.79833984375,
0.66748046875,
0.10400390625,
0.32177734375,
-0.95947265625,
-0.830078125,
0.28076171875,
-0.638671875,
-0.7421... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
Submitted Solution:
```
n = int(input())
times = []
for _ in range(n):
time = str(input())
times.append((int(time[:2]), int(time[3:])))
times.sort()
def to_minutes(a):
return 60*a[0] + a[1]
def to_hours(a):
return (a // 60, a % 60)
def pad(a):
return ('0' if a < 10 else '') + str(a)
longest = 0
for i in range(1, n):
longest = max(longest, to_minutes(times[i]) - to_minutes(times[i - 1]))
longest = max(longest, 60*24 + to_minutes(times[0]) - to_minutes(times[n - 1]))
longest -= 1
hours, minutes = to_hours(longest)
print(pad(hours), ':', pad(minutes), sep='')
```
Yes
| 37,451 | [
0.428955078125,
0.68603515625,
-0.207275390625,
0.015838623046875,
-0.403076171875,
-0.11407470703125,
-0.52392578125,
0.00865936279296875,
0.2344970703125,
0.8447265625,
0.67529296875,
0.0953369140625,
0.2861328125,
-0.99072265625,
-0.83154296875,
0.3076171875,
-0.556640625,
-0.74... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
Submitted Solution:
```
n = int(input())
times = [0] * 2880
for _ in range(n):
hh, mm = map(int, input().split(':'))
t = hh * 60 + mm
times[t] = 1
times[t + 1440] = 1
i = 0
res = -1
while i < 1440:
for j in range(i, i + 1440):
if times[j] == 1:
break
res = max(res, j - i)
i = j + 1
hh, mm = divmod(res, 60)
print('{:02d}:{:02d}'.format(hh, mm))
```
Yes
| 37,452 | [
0.434326171875,
0.67626953125,
-0.18994140625,
0.0305328369140625,
-0.396484375,
-0.136474609375,
-0.497314453125,
0.00010955333709716797,
0.236328125,
0.86767578125,
0.705078125,
0.11907958984375,
0.284912109375,
-0.998046875,
-0.82373046875,
0.321044921875,
-0.556640625,
-0.74560... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
Submitted Solution:
```
n = int(input())
alarms = []
for i in range(n):
h, m = map(int, input().split(':'))
t = h * 60 + m
alarms.append(t)
alarms.sort()
# print(alarms)
alarms.append(alarms[0] + 24 * 60)
mx = -1
for i in range(1, len(alarms)):
if (mx < alarms[i] - alarms[i - 1]):
mx = alarms[i] - alarms[i - 1]
mx -= 1
print('{:02d}:{:02d}'.format(mx // 60, mx % 60))
```
Yes
| 37,453 | [
0.42138671875,
0.70263671875,
-0.21533203125,
0.0178985595703125,
-0.39697265625,
-0.1402587890625,
-0.52392578125,
0.0335693359375,
0.2353515625,
0.84619140625,
0.6796875,
0.1163330078125,
0.3154296875,
-0.994140625,
-0.83203125,
0.281005859375,
-0.578125,
-0.7197265625,
-0.3193... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
Submitted Solution:
```
n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
for i in range(1, n):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k)
```
Yes
| 37,454 | [
0.4375,
0.6552734375,
-0.1961669921875,
0.035369873046875,
-0.412841796875,
-0.1451416015625,
-0.52490234375,
0.006511688232421875,
0.252197265625,
0.85498046875,
0.69091796875,
0.09576416015625,
0.28515625,
-0.9560546875,
-0.8203125,
0.284912109375,
-0.5556640625,
-0.72412109375,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
Submitted Solution:
```
def rs(t1, t2):
res = [0, 0]
if t1[1] - t2[1] < 0:
res[1] = t1[1] - t2[1] + 60 - 1
res[0] -= 1
else:
res[1] = t1[1] - t2[1] - 1
res[0] += t1[0] - t2[0]
return tuple(res)
def check(t1, t2, maxi):
tmp = rs(t1, t2)
if tmp[0] > maxi[0]:
return tmp
elif tmp[0] == maxi[0]:
if tmp[1] > maxi[1]:
return tmp
return maxi
def to_str(item):
if item < 10:
return '0' + str(item)
else:
return str(item)
n = int(input())
clocks = []
for i in range(n):
clocks.append(tuple(map(int, input().split(':'))))
clocks = sorted(clocks, key=lambda item: (item[0], item[1]))
if n == 1:
print('23:59')
maxi = rs((clocks[0][0] + 24, clocks[0][1]), clocks[-1])
i = 0
while i < len(clocks) - 1:
maxi = check(clocks[i + 1], clocks[i], maxi)
i += 1
print(":".join(map(to_str, maxi)))
```
No
| 37,455 | [
0.469482421875,
0.68359375,
-0.22216796875,
0.03973388671875,
-0.417236328125,
-0.1614990234375,
-0.509765625,
-0.0299072265625,
0.2366943359375,
0.85107421875,
0.69384765625,
0.1011962890625,
0.285400390625,
-0.93798828125,
-0.806640625,
0.2998046875,
-0.56494140625,
-0.7524414062... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
Submitted Solution:
```
n = int(input())
A = []
for i in range(n):
s = input()
h = s[:2]
m = s[3:]
A.append((int(h), int(m)))
md = -12341234
A = sorted(A)
for i in range(n - 1):
a, b = A[i]
c, d = A[i + 1]
g = (c - a) * 60
if(b > d):
g += 60 - b + d
g -= 60
else:
g += d - b
if(g > md):
md = g
a, b = A[0]
c, d = A[n - 1]
g = (24 - c + a)*60
g += 60 - d + b
if(g > md):
md = g
md -= 1
if(md//60 < 10):
print('0', sep = '', end = '');
print(md//60, ':', sep ='', end = '')
if(md % 60 < 10):
print('0', sep = '', end = '');
print(md % 60)
```
No
| 37,456 | [
0.4599609375,
0.65478515625,
-0.1966552734375,
0.03546142578125,
-0.414794921875,
-0.12103271484375,
-0.5126953125,
0.006862640380859375,
0.2318115234375,
0.8251953125,
0.71044921875,
0.10272216796875,
0.274169921875,
-0.96435546875,
-0.8115234375,
0.2958984375,
-0.52001953125,
-0.... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
Submitted Solution:
```
class Line:
def __init__(self, l, r):
self.l = l
self.r = r
self.left = None
self.right = None
def max(self):
if not self.left:
return self.r - self.l
else:
return max(self.left.max(), self.right.max())
def split(self, x):
if not self.left:
self.left = Line(self.l, x)
self.right = Line(x + 1, self.r)
else:
if self.left.l < x and self.left.r > x:
self.left.split(x)
elif self.right.l < x and self.right.r > x:
self.right.split(x)
n = int(input())
arr = []
for i in range(n):
s = input().split(':')
m = int(s[0]) * 60 + int(s[1])
arr.append(m)
arr.sort()
a = Line(1, 60*24 + arr[0])
for i in arr:
a.split(i)
m = a.max()
h = m // 60
m = m % 60
print(h, ':', m, sep='')
```
No
| 37,457 | [
0.440185546875,
0.65966796875,
-0.2198486328125,
0.051055908203125,
-0.38623046875,
-0.10321044921875,
-0.51708984375,
-0.01397705078125,
0.258544921875,
0.83056640625,
0.66943359375,
0.1065673828125,
0.288330078125,
-0.93994140625,
-0.828125,
0.26025390625,
-0.55078125,
-0.7290039... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a strict daily schedule. He has n alarms set for each day, and the i-th alarm rings each day at the same time during exactly one minute.
Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.
Input
The first line contains a single integer n (1 ≤ n ≤ 100) — the number of alarms.
Each of the next n lines contains a description of one alarm. Each description has a format "hh:mm", where hh is the hour when the alarm rings, and mm is the minute of that hour when the alarm rings. The number of hours is between 0 and 23, and the number of minutes is between 0 and 59. All alarm times are distinct. The order of the alarms is arbitrary.
Each alarm starts ringing in the beginning of the corresponding minute and rings for exactly one minute (i. e. stops ringing in the beginning of the next minute). Polycarp can start sleeping instantly when no alarm is ringing, and he wakes up at the moment when some alarm starts ringing.
Output
Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. hh denotes the number of hours, and mm denotes the number of minutes. The number of minutes should be between 0 and 59. Look through examples to understand the format better.
Examples
Input
1
05:43
Output
23:59
Input
4
22:00
03:21
16:03
09:59
Output
06:37
Note
In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, 23 hours and 59 minutes later. Polycarp can sleep all this time.
Submitted Solution:
```
from datetime import datetime
from datetime import timedelta
n = int(input())
time = sorted([input() for i in range(n)])
FMT = '%H:%M'
max_time = timedelta.min
for i in range(n - 1):
t1 = datetime.strptime(time[i], FMT)
t2 = datetime.strptime(time[i + 1], FMT)
max_time = max(max_time, t2 - t1 - timedelta(seconds=60))
first = datetime.strptime(time[0], FMT)
last = datetime.strptime(time[n-1], FMT)
max_time = max(max_time, first - last + timedelta(days=1) - timedelta(seconds=60))
print(':'.join(str(max_time).split(':')[:2]))
```
No
| 37,458 | [
0.47021484375,
0.6376953125,
-0.223876953125,
0.06451416015625,
-0.38525390625,
-0.124267578125,
-0.5341796875,
-0.03619384765625,
0.250732421875,
0.87158203125,
0.61083984375,
0.046661376953125,
0.33203125,
-0.9326171875,
-0.81640625,
0.3203125,
-0.51806640625,
-0.66943359375,
-... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Tags: brute force, geometry, implementation
Correct Solution:
```
#import math
n,m=map(int,input().split())
l=[]
for i in range(n):
s=list(input())
#print(s)
k=s.count('*')
c=0
for _ in range(k):
if '*' in s:
j=s.index('*')
l.append([i,j+c])
s=s[:j]+s[j+1:]
c=c+1
#print(l)
xl=[]
yl=[]
x=999
y=999
for i,j in l:
xl.append(i)
yl.append(j)
for i in (xl):
c=xl.count(i)
if(c==1):
x=i+1
break
#print('yl',yl)
for i in (yl):
c=yl.count(i)
if(c==1):
y=i+1
break
print(x,y)
```
| 38,933 | [
0.313232421875,
0.129638671875,
0.2032470703125,
0.1622314453125,
-0.398193359375,
-0.326171875,
-0.259521484375,
-0.08099365234375,
0.01531219482421875,
0.708984375,
1.0068359375,
-0.077392578125,
0.257568359375,
-0.537109375,
-0.38818359375,
0.12548828125,
-0.53857421875,
-0.6416... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Tags: brute force, geometry, implementation
Correct Solution:
```
nm = input().split()
n = int(nm[0])
m = int(nm[1])
k = 0
for j in range(n):
s = input()
for i in range(m):
if s[i] == '*':
k += 1
if k == 1:
pos1 = [i+1, j+1]
elif k == 2:
pos2 = [i+1, j+1]
else:
pos3 = [i+1, j+1]
if pos1[1] == pos2[1]:
pos4 = [pos1[0] + pos2[0] - pos3[0], pos3[1]]
else:
pos4 = [pos2[0]+pos3[0]-pos1[0], pos1[1]]
print(pos4[1], pos4[0])
```
| 38,934 | [
0.3447265625,
0.137939453125,
0.1767578125,
0.1634521484375,
-0.4072265625,
-0.332763671875,
-0.210693359375,
-0.10174560546875,
0.0160369873046875,
0.69189453125,
1.005859375,
-0.08294677734375,
0.203125,
-0.5615234375,
-0.41357421875,
0.10833740234375,
-0.53173828125,
-0.65429687... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Tags: brute force, geometry, implementation
Correct Solution:
```
n, m = map(int, input().split())
l = [input() for i in range(n)]
for i in range(n):
if l[i].count('*') == 2:
a1 = l[i]
if l[i].count('*') == 1:
a2 = l[i]
b2 = i
#print(a1.index('*'), a2.index('*'))
if a1.index('*') == a2.index('*'):
z = a1[::-1].index('*')
c2 = len(a1) - z - 1
else:
c2 = a1.index('*')
print(b2+1, c2+1)
```
| 38,935 | [
0.300048828125,
0.11859130859375,
0.2171630859375,
0.168212890625,
-0.387939453125,
-0.31689453125,
-0.251220703125,
-0.0792236328125,
0.037261962890625,
0.6845703125,
1.0068359375,
-0.08441162109375,
0.235107421875,
-0.564453125,
-0.38916015625,
0.1168212890625,
-0.54248046875,
-0... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Tags: brute force, geometry, implementation
Correct Solution:
```
a,d=map(int,input().split())
p=0
for b in range(a):
e=input()
if "*" in e:
for n in range(d):
if e[n]=='*':
if p==0:
x1=[b,n]
p+=1
elif p==1:
x2=[b,n]
p+=1
elif p==2:
x3=[b,n]
def f(x,y):
return (x[0]-y[0])**2+(x[1]-y[1])**2
g=f(x1,x2)
h=f(x1,x3)
i=f(x2,x3)
if g==(h+i):
x4=(x1[0]+x2[0])-x3[0]
y4=(x1[1]+x2[1])-x3[1]
elif h==(g+i):
x4=(x1[0]+x3[0])-x2[0]
y4=(x1[1]+x3[1])-x2[1]
else:
x4=(x2[0]+x3[0])-x1[0]
y4=(x2[1]+x3[1])-x1[1]
print(x4+1,y4+1)
```
| 38,936 | [
0.3349609375,
0.123779296875,
0.1993408203125,
0.1798095703125,
-0.391845703125,
-0.328369140625,
-0.2449951171875,
-0.07830810546875,
-0.0007085800170898438,
0.68505859375,
0.99267578125,
-0.07501220703125,
0.2607421875,
-0.5380859375,
-0.393310546875,
0.1124267578125,
-0.5249023437... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Tags: brute force, geometry, implementation
Correct Solution:
```
n,m=map(int,input().split()); l=[]
for i in range(n):
l.append(input())
for i in range(len(l)):
if l[i].count('*')==1:
r=i
for i in range(n):
if l[i].count('*')==2:
for j in range(m):
if (l[i][j]=='*' and l[r][j]!='*'):
c=j
print(r+1,c+1,sep=' ')
```
| 38,937 | [
0.317138671875,
0.10833740234375,
0.22412109375,
0.16162109375,
-0.392578125,
-0.315185546875,
-0.22412109375,
-0.10546875,
0.01403045654296875,
0.69677734375,
1.017578125,
-0.0765380859375,
0.234130859375,
-0.53076171875,
-0.394775390625,
0.132080078125,
-0.53759765625,
-0.6337890... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Tags: brute force, geometry, implementation
Correct Solution:
```
n,m=map(int,input().split())
x=[]
for i in range(n):
x.append(input())
l=[]
t=[]
for i in range(n):
for j in range(m):
if(x[i][j]=='*'):
l.append([i,j])
if(l[0][0]==l[1][0]):
t.append(l[2][0]+1)
elif(l[2][0]==l[1][0]):
t.append(l[0][0]+1)
elif(l[0][0]==l[2][0]):
t.append(l[1][0]+1)
if(l[0][1]==l[1][1]):
t.append(l[2][1]+1)
elif(l[2][1]==l[1][1]):
t.append(l[0][1]+1)
elif(l[0][1]==l[2][1]):
t.append(l[1][1]+1)
print(t[0],t[1])
```
| 38,938 | [
0.316162109375,
0.12176513671875,
0.2330322265625,
0.1690673828125,
-0.392578125,
-0.3291015625,
-0.2335205078125,
-0.10406494140625,
0.0275726318359375,
0.69775390625,
1.0126953125,
-0.08184814453125,
0.229248046875,
-0.53125,
-0.403076171875,
0.11981201171875,
-0.54052734375,
-0.... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Tags: brute force, geometry, implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Thu Apr 9 21:42:13 2020
@author: odraodE
"""
'''testo dell'esercizio https://codeforces.com/problemset/problem/181/A'''
M=[]
a=input().split()
n=int(a[0])
m=int(a[1])
for x in range(n):
l=[]
for y in range(m):
l.append('.')
M.append(l)
for x in range(n):
col=input()
for y in range(len(col)):
if col[y]=='*':
M[x][y]='*'
coord_1=0
coord_2=0
coordinate=[]
for x in range(n):
for y in range(m):
if M[x][y]=='*':
for k in range(n):
if M[k][y]=='*' and k!=x and coord_1==0:
coord_1=(k,y)
coord_2=(x,y)
for k in range(m):
if M[x][k]=='*' and k!=y:
coordinate.append((x,y))
coordinate.append((x,k))
lunghezza=coord_1[0]-coord_2[0]
a=(coordinate[0][0]+lunghezza,coordinate[0][1])
b=(coordinate[1][0]+lunghezza,coordinate[1][1])
if a[0] < n and b[0] < n:
if M[a[0]][a[1]]=='*':
ris=(b[0],b[1])
elif M[b[0]][b[1]]=='*':
ris=(a[0],a[1])
else:
a=(coordinate[0][0]-lunghezza,coordinate[0][1])
b=(coordinate[1][0]-lunghezza,coordinate[1][1])
if M[a[0]][a[1]]=='*':
ris=(b[0],b[1])
elif M[b[0]][b[1]]=='*':
ris=(a[0],a[1])
else:
a=(coordinate[0][0]-lunghezza,coordinate[0][1])
b=(coordinate[1][0]-lunghezza,coordinate[1][1])
if M[a[0]][a[1]]=='*':
ris=(b[0],b[1])
elif M[b[0]][b[1]]=='*':
ris=(a[0],a[1])
print(ris[0]+1,ris[1]+1)
```
| 38,939 | [
0.337646484375,
0.044158935546875,
0.1640625,
0.1767578125,
-0.33349609375,
-0.35595703125,
-0.183837890625,
-0.1097412109375,
0.003063201904296875,
0.67822265625,
0.994140625,
-0.06829833984375,
0.22119140625,
-0.491455078125,
-0.43310546875,
0.049591064453125,
-0.484375,
-0.60156... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Tags: brute force, geometry, implementation
Correct Solution:
```
x = list(map(int, input().split(" ")))
y = []
a = []
b = []
for i in range(x[0]):
y.append(input().split(" "))
for i in y:
for j in i:
b.append(list(j))
for i in range(len(b)):
for j in range(len(b[0])):
if b[i][j] == "*":
a.append([i, j])
else:
pass
if a[0][0] != a[1][0]:
if a[0][1] != a[1][1]:
print(*[a[0][0]+1, a[1][1]+1])
else:
print(*[a[0][0]+1, a[2][1]+1])
else:
if a[1][1] != a[2][1]:
print(*[a[2][0]+1, a[1][1]+1])
else:
print(*[a[2][0]+1, a[0][1]+1])
```
| 38,940 | [
0.31787109375,
0.12841796875,
0.2113037109375,
0.179443359375,
-0.418212890625,
-0.32470703125,
-0.2237548828125,
-0.0810546875,
0.05804443359375,
0.7001953125,
0.99755859375,
-0.0869140625,
0.2327880859375,
-0.5322265625,
-0.3916015625,
0.10101318359375,
-0.53662109375,
-0.6450195... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Submitted Solution:
```
n, m = list(map(int, input().split()))
mapa = []
x = -1
achou = 0
yPossivel = set()
for i in range(0, n):
linha = list(input())
mapa.append(linha)
nDistritosRoubados = linha.count('*')
if (nDistritosRoubados == 1):
achou += 1
x = i + 1
if (nDistritosRoubados == 2):
achou += 1
for j in range(0, m):
if (linha[j] == '*'):
yPossivel.add(j + 1)
if (achou == 2):
break
for y in yPossivel:
if (mapa[x - 1][y - 1] != '*'):
print(x, y)
```
Yes
| 38,941 | [
0.359130859375,
0.156494140625,
0.1031494140625,
0.09710693359375,
-0.45166015625,
-0.191162109375,
-0.272705078125,
-0.039337158203125,
0.068359375,
0.74365234375,
0.86572265625,
-0.0938720703125,
0.1864013671875,
-0.4609375,
-0.39453125,
0.102294921875,
-0.525390625,
-0.616699218... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Submitted Solution:
```
l = []
n, m = map(int, input().split())
for _ in range(n):
l1 = list(input())
l.append(l1)
lp = []
for i in range(n):
for j in range(m):
if l[i][j] == '*':
l1 = [i , j]
lp.append(l1)
if lp[1][0] == lp[2][0]:
x = lp[0][0]
elif lp[0][0] == lp[1][0]:
x = lp[2][0]
else:
x = lp[1][0]
if lp[1][1] == lp[2][1]:
y = lp[0][1]
elif lp[0][1] == lp[1][1]:
y = lp[2][1]
else:
y = lp[1][1]
print(x + 1, y + 1)
```
Yes
| 38,942 | [
0.3515625,
0.159423828125,
0.154052734375,
0.166748046875,
-0.47412109375,
-0.2340087890625,
-0.23291015625,
0.0212249755859375,
-0.01617431640625,
0.701171875,
0.86328125,
-0.1043701171875,
0.1829833984375,
-0.51171875,
-0.4248046875,
0.0679931640625,
-0.51513671875,
-0.6352539062... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Submitted Solution:
```
n,m=map(int,input().split())
city=[]
for i in range(n):
temp=input()
city.append(temp)
row={}
col={}
for i in range(n):
for j in range(m):
if city[i][j]=="*":
if i+1 in row:
row[i+1]+=1
else:
row[i+1]=1
if j+1 in col:
col[j+1]+=1
else:
col[j+1]=1
for i in row:
if row[i]==1:
x=i
break
for i in col:
if col[i]==1:
y=i
break
print(x,y)
```
Yes
| 38,943 | [
0.364013671875,
0.17919921875,
0.1507568359375,
0.1522216796875,
-0.4892578125,
-0.250244140625,
-0.240478515625,
-0.0198974609375,
0.0002206563949584961,
0.6923828125,
0.85595703125,
-0.1346435546875,
0.1654052734375,
-0.541015625,
-0.40966796875,
0.06427001953125,
-0.52587890625,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Submitted Solution:
```
T_ON = 0
DEBUG_ON = 1
MOD = 998244353
def solve():
n, m = read_ints()
A = []
for r in range(n):
s = input()
for c in range(m):
if s[c] == '*':
A.append((r + 1, c + 1))
assert(len(A) == 3)
r = c = 0
for x, y in A:
r ^= x
c ^= y
print(r, c)
def main():
T = read_int() if T_ON else 1
for i in range(T):
solve()
def debug(*xargs):
if DEBUG_ON:
print(*xargs)
from collections import *
import math
#---------------------------------FAST_IO---------------------------------------
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
#----------------------------------IO_WRAP--------------------------------------
def read_int():
return int(input())
def read_ints():
return list(map(int, input().split()))
def print_nums(nums):
print(" ".join(map(str, nums)))
def YES():
print("YES")
def Yes():
print("Yes")
def NO():
print("NO")
def No():
print("No")
def First():
print("First")
def Second():
print("Second")
#----------------------------------FIB--------------------------------------
def fib(n):
"""
the nth fib, start from zero
"""
a, b = 0, 1
for _ in range(n):
a, b = b, a + b
return a
def fib_ns(n):
"""
the first n fibs, start from zero
"""
assert n >= 1
f = [0 for _ in range(n + 1)]
f[0] = 0
f[1] = 1
for i in range(2, n + 1):
f[i] = f[i - 1] + f[i - 2]
return f
def fib_to_n(n):
"""
return fibs <= n, start from zero
n=8
f=[0,1,1,2,3,5,8]
"""
f = []
a, b = 0, 1
while a <= n:
f.append(a)
a, b = b, a + b
return f
#----------------------------------MOD--------------------------------------
def gcd(a, b):
if a == 0:
return b
return gcd(b % a, a)
def xgcd(a, b):
"""return (g, x, y) such that a*x + b*y = g = gcd(a, b)"""
x0, x1, y0, y1 = 0, 1, 1, 0
while a != 0:
(q, a), b = divmod(b, a), a
y0, y1 = y1, y0 - q * y1
x0, x1 = x1, x0 - q * x1
return b, x0, y0
def lcm(a, b):
d = gcd(a, b)
return a * b // d
def is_even(x):
return x % 2 == 0
def is_odd(x):
return x % 2 == 1
def modinv(a, m):
"""return x such that (a * x) % m == 1"""
g, x, _ = xgcd(a, m)
if g != 1:
raise Exception('gcd(a, m) != 1')
return x % m
def mod_add(x, y):
x += y
while x >= MOD:
x -= MOD
while x < 0:
x += MOD
return x
def mod_mul(x, y):
return (x * y) % MOD
def mod_pow(x, y):
if y == 0:
return 1
if y % 2:
return mod_mul(x, mod_pow(x, y - 1))
p = mod_pow(x, y // 2)
return mod_mul(p, p)
def mod_inv(y):
return mod_pow(y, MOD - 2)
def mod_div(x, y):
# y^(-1): Fermat little theorem, MOD is a prime
return mod_mul(x, mod_inv(y))
#---------------------------------PRIME---------------------------------------
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n ** 0.5) + 1):
if n % i:
return False
return True
def gen_primes(n):
"""
generate primes of [1..n] using sieve's method
"""
P = [True for _ in range(n + 1)]
P[0] = P[1] = False
for i in range(int(n ** 0.5) + 1):
if P[i]:
for j in range(2 * i, n + 1, i):
P[j] = False
return P
#---------------------------------MISC---------------------------------------
def is_lucky(n):
return set(list(str(n))).issubset({'4', '7'})
#---------------------------------MAIN---------------------------------------
main()
```
Yes
| 38,944 | [
0.374267578125,
0.166259765625,
0.132568359375,
0.176513671875,
-0.490234375,
-0.217529296875,
-0.234375,
0.036529541015625,
-0.01035308837890625,
0.705078125,
0.85986328125,
-0.126708984375,
0.2127685546875,
-0.5205078125,
-0.4150390625,
0.047821044921875,
-0.505859375,
-0.6430664... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Submitted Solution:
```
n,m=map(int,input().split())
co=[]
x,y=0,0
for i in range(n):
c=input()
for j in range(len(c)):
if c[j]=='*':
x^=j
y^=i
print(x+1,y+1)
```
No
| 38,945 | [
0.3720703125,
0.1529541015625,
0.1256103515625,
0.1639404296875,
-0.472412109375,
-0.233642578125,
-0.24169921875,
0.04052734375,
-0.01953125,
0.70068359375,
0.8583984375,
-0.10772705078125,
0.1925048828125,
-0.52587890625,
-0.42529296875,
0.026947021484375,
-0.513671875,
-0.652343... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Submitted Solution:
```
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()
def main():
h,w=LI()
field=[list(S()) for _ in range(h)]
f=''
for i in range(h):
for j in range(w):
if field[i][j]=='.':
continue
for dy,dx in dd:
ni=i+dy
nj=j+dx
if 0<=ni<h and 0<=nj<w:
if field[ni][nj]=='*':
if abs(dy)==1:
f='joge'
else:
f='sayu'
field[i][j]='.'
field[ni][nj]='.'
break
if f!='':
break
if f!='':
break
if f=='joge':
for i in range(h):
for j in range(w):
if field[i][j]=='.':
continue
for dy,dx in [(1,0),(-1,0)]:
ni=i+dy
nj=j+dx
if 0<=ni<h and 0<=nj<w:
return str(ni+1)+' '+str(nj+1)
else:
for i in range(h):
for j in range(w):
if field[i][j]=='.':
continue
for dy,dx in [(0,1),(0,-1)]:
ni=i+dy
nj=j+dx
if 0<=ni<h and 0<=nj<w:
return str(ni+1)+' '+str(nj+1)
# main()
print(main())
```
No
| 38,946 | [
0.33837890625,
0.1112060546875,
0.1484375,
0.220947265625,
-0.4755859375,
-0.2369384765625,
-0.22216796875,
-0.035797119140625,
-0.0217742919921875,
0.7998046875,
0.81884765625,
-0.1607666015625,
0.22216796875,
-0.50634765625,
-0.429443359375,
0.1328125,
-0.5107421875,
-0.710449218... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Submitted Solution:
```
x,y = map(int,input().split())
c = 0
z = []
for i in range(x):
z.append(input())
for j in range(x):
for k in range(y):
if z[j].count("*") == 2:
a = j+1
if c != 2:
break
c = c + 1
if c == 1:
t = k
if z[j].count("*") == 1:
a1 = j+1
print(a1,k+c+1)
```
No
| 38,947 | [
0.3583984375,
0.17236328125,
0.14794921875,
0.1795654296875,
-0.50390625,
-0.2322998046875,
-0.2481689453125,
0.027130126953125,
-0.035430908203125,
0.70947265625,
0.85791015625,
-0.11944580078125,
0.18701171875,
-0.5107421875,
-0.39697265625,
0.0667724609375,
-0.51220703125,
-0.65... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Berland capital is shaken with three bold crimes committed by the Pihsters, a notorious criminal gang.
The Berland capital's map is represented by an n × m rectangular table. Each cell of the table on the map represents some districts of the capital.
The capital's main detective Polycarpus took a map and marked there the districts where the first three robberies had been committed as asterisks. Deduction tells Polycarpus that the fourth robbery will be committed in such district, that all four robbed districts will form the vertices of some rectangle, parallel to the sides of the map.
Polycarpus is good at deduction but he's hopeless at math. So he asked you to find the district where the fourth robbery will be committed.
Input
The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 100) — the number of rows and columns in the table, correspondingly.
Each of the next n lines contains m characters — the description of the capital's map. Each character can either be a "." (dot), or an "*" (asterisk). A character equals "*" if the corresponding district has been robbed. Otherwise, it equals ".".
It is guaranteed that the map has exactly three characters "*" and we can always find the fourth district that meets the problem requirements.
Output
Print two integers — the number of the row and the number of the column of the city district that is the fourth one to be robbed. The rows are numbered starting from one from top to bottom and the columns are numbered starting from one from left to right.
Examples
Input
3 2
.*
..
**
Output
1 1
Input
3 3
*.*
*..
...
Output
2 3
Submitted Solution:
```
n,m=map(int,input().split())
b=0
c=''
d=[0,0]
for i in range(n):
a=input()
if '*' in a:
if a.find('*')==a.rfind('*'):
b=a.find('*')
d[0]=i+1
else:
if a.find('*')==b:
d[1]=a.rfind('*')+1
else:
d[1]=a.find('*')+1
print(*d,sep=' ')
```
No
| 38,948 | [
0.349853515625,
0.1741943359375,
0.1456298828125,
0.1605224609375,
-0.458251953125,
-0.209228515625,
-0.239013671875,
0.0244903564453125,
-0.01065826416015625,
0.68359375,
0.90478515625,
-0.1427001953125,
0.2132568359375,
-0.52880859375,
-0.405029296875,
0.055328369140625,
-0.4904785... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
n = int(input())
s, p = {}, [''] * n
for k in range(n):
p[k] = t = input()
for q in [t[i: j] for i in range(9) for j in range(i + 1, 10)]:
s[q] = -1 if q in s and s[q] != k else k
for q, k in s.items():
if k >= 0 and len(p[k]) > len(q): p[k] = q
print('\n'.join(p))
# Made By Mostafa_Khaled
```
| 39,275 | [
0.300048828125,
-0.0218505859375,
0.285888671875,
0.263671875,
-0.00910186767578125,
-0.309814453125,
-0.189697265625,
-0.1708984375,
0.474365234375,
0.8505859375,
0.783203125,
-0.07061767578125,
0.269287109375,
-0.6103515625,
-0.86376953125,
-0.056610107421875,
-0.66064453125,
-0.... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
def podstroki(s):
return sorted(set(s[i: i1] for i in range(9) for i1 in range (i+1, 10)), key=len)
res = {}
spisok = [podstroki(input()) for i in range (int(input()))]
for s in spisok:
for podstr in s:
if podstr in res:
res[podstr] += 1
else:
res[podstr] = 1
for s in spisok:
for podstr in s:
if res[podstr] == 1:
print(podstr)
break
```
| 39,276 | [
0.28759765625,
-0.07781982421875,
0.248046875,
0.291259765625,
0.034515380859375,
-0.39892578125,
-0.171630859375,
-0.1396484375,
0.490478515625,
0.8369140625,
0.775390625,
-0.178955078125,
0.284423828125,
-0.64794921875,
-0.826171875,
-0.0009937286376953125,
-0.66357421875,
-0.460... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
import math
from collections import *
a=int(input())
indx=defaultdict(list)
done=defaultdict(list)
for t in range(a):
s=input()
for i in range(len(s)):
for j in range(i,len(s)):
m=s[i:j+1]
if(len(done[m])==0):
done[m].append(t)
indx[t].append(m)
else:
if(len(done[m])==1 and done[m][0]!=math.inf and t!=done[m][0]):
indx[done[m][0]].remove(m)
done[m][0]=math.inf
for i in range(a):
af=indx[i]
mini=15
ss=''
for i in range(len(af)):
if(len(af[i])<mini):
mini=len(af[i])
ss=af[i]
print(ss)
```
| 39,277 | [
0.276123046875,
-0.0148468017578125,
0.272705078125,
0.2310791015625,
-0.004413604736328125,
-0.275146484375,
-0.16552734375,
-0.19384765625,
0.499755859375,
0.84814453125,
0.79052734375,
-0.08062744140625,
0.278564453125,
-0.60302734375,
-0.857421875,
-0.050445556640625,
-0.67041015... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
import sys
from collections import defaultdict
N = int(input())
S = []
Subs = defaultdict(int)
for i in range(N):
s = input()
S.append(s)
for ff in range(1,10):
for ss in range(10-ff):
Subs[s[ss:ss+ff]] += 1
for i in range(N):
flag = 0
At = S[i]
for ff in range(1,10):
curr = defaultdict(int)
for ss in range(10-ff):
curr[At[ss:ss+ff]] += 1
# Here we check
for key in curr.keys():
if(curr[key] == Subs[key]):
print(key)
flag = 1
break
if(flag):
break
```
| 39,278 | [
0.259521484375,
-0.026702880859375,
0.26904296875,
0.244873046875,
-0.00440216064453125,
-0.26123046875,
-0.1917724609375,
-0.1842041015625,
0.497802734375,
0.8564453125,
0.7626953125,
-0.1064453125,
0.27685546875,
-0.62646484375,
-0.88134765625,
-0.0556640625,
-0.669921875,
-0.514... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
n = int(input())
m = {}
a = []
for i in range(n):
s = input()
sub = set()
for i in range(len(s)):
for j in range(i, len(s)):
k = s[i:j + 1]
if k in sub:
continue
else:
sub.add(k)
if k in m:
m[k] += 1
else:
m[k] = 1
a.append(s)
for s in a:
ans = s
for i in range(len(s)):
for j in range(i, len(s)):
k = s[i:j + 1]
if m[k] == 1 and len(k) < len(ans):
ans = k
print(ans)
```
| 39,279 | [
0.298828125,
-0.038421630859375,
0.269775390625,
0.2464599609375,
-0.00855255126953125,
-0.291748046875,
-0.1903076171875,
-0.1885986328125,
0.48876953125,
0.83984375,
0.763671875,
-0.06707763671875,
0.282958984375,
-0.6025390625,
-0.8427734375,
-0.0513916015625,
-0.66455078125,
-0... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
n = int(input())
maps = {}
for i in range(n):
string = input()
for j in range(len(string)):
for a in range(0,j + 1):
substr = string[a:j+1]
if substr not in maps:
maps[substr] = {'index' : i, 'count': 1}
else:
if i != maps[substr]['index']:
maps[substr]['count'] += 1
maps = sorted(maps.items(), key = lambda i: i[1]['index'])
count = 0
min_v = ''
min_count = 10
for k, value in maps:
if count < value['index']:
count += 1
print(min_v)
min_v = 'idk'
min_count = 10
if value['count'] == 1:
if len(k) < min_count:
min_count = len(k)
min_v = k
print(min_v)
```
| 39,280 | [
0.265869140625,
-0.01300048828125,
0.245849609375,
0.22705078125,
-0.019866943359375,
-0.268798828125,
-0.1807861328125,
-0.166259765625,
0.45263671875,
0.85986328125,
0.78857421875,
-0.08441162109375,
0.31201171875,
-0.623046875,
-0.81201171875,
-0.05755615234375,
-0.6611328125,
-... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
cnt = {}
n = int(input())
ls = [input() for _ in range(n)]
for s in ls:
subs = set()
for end in range(10):
for start in range(end):
subs.add(s[start:end])
for sub in subs:
if sub not in cnt:
cnt[sub] = 1
else:
cnt[sub] += 1
for s in ls:
subs = set()
for end in range(10):
for start in range(end):
subs.add(s[start:end])
for sub in sorted(subs, key=len):
if cnt[sub] == 1:
print(sub)
break
```
| 39,281 | [
0.281982421875,
-0.04876708984375,
0.28955078125,
0.2332763671875,
0.0228118896484375,
-0.295166015625,
-0.1810302734375,
-0.17138671875,
0.4931640625,
0.84912109375,
0.7578125,
-0.051910400390625,
0.279541015625,
-0.6240234375,
-0.85693359375,
-0.07049560546875,
-0.68212890625,
-0... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
class CodeforcesTask860BSolution:
def __init__(self):
self.result = ''
self.n = 0
self.phones = []
def read_input(self):
self.n = int(input())
for x in range(self.n):
self.phones.append(input())
def process_task(self):
phone_book = {}
for phone in self.phones:
for x in range(1, len(phone) + 1):
for y in range(len(phone) - x + 1):
subnum = phone[y:y + x]
#print(phone, subnum, y, y + x, x)
if subnum in phone_book.keys():
if phone_book[subnum] != phone:
phone_book[subnum] = False
else:
phone_book[subnum] = phone
results = []
for phone in self.phones:
found = False
for x in range(1, len(phone) + 1):
for y in range(len(phone) - x + 1):
subnum = phone[y:y + x]
if subnum in phone_book.keys():
if phone_book[subnum]:
found = True
results.append(subnum)
break
if found:
break
self.result = "\n".join([str(x) for x in results])
def get_result(self):
return self.result
if __name__ == "__main__":
Solution = CodeforcesTask860BSolution()
Solution.read_input()
Solution.process_task()
print(Solution.get_result())
```
| 39,282 | [
0.31396484375,
-0.03912353515625,
0.282470703125,
0.26611328125,
-0.00238800048828125,
-0.329833984375,
-0.1873779296875,
-0.19775390625,
0.487548828125,
0.88671875,
0.77880859375,
-0.07708740234375,
0.295654296875,
-0.6416015625,
-0.82470703125,
-0.06982421875,
-0.64111328125,
-0.... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
n = int(input())
mass = []
for i in range(n):
a = input()
mass.append(a)
# for i in range(len(mass)):
# ans = '1' * 11
# for j in range(len(mass[i])):
# for k in range(j + 1, len(mass[i]) + 1):
# cnt = 0
# for l in range(len(mass)):
# if l != i:
# if mass[i][j:k] not in mass[l]:
# cnt += 1
# else:
# break
# if cnt == n - 1:
# if k - j < len(ans):
# ans = mass[i][j:k]
# print(ans)
a = dict()
for i in range(len(mass)):
for j in range(len(mass[i])):
for k in range(j + 1, len(mass[i]) + 1):
if mass[i][j:k] in a:
if a[mass[i][j:k]][1] != i:
a[mass[i][j:k]][0] += 1
a[mass[i][j:k]][1] = i
else:
a[mass[i][j:k]] = [1, i]
# print(a)
for i in range(len(mass)):
ans = '1' * 11
for j in range(len(mass[i])):
for k in range(j + 1, len(mass[i]) + 1):
if a[mass[i][j:k]][0] == 1:
if k - j < len(ans):
ans = mass[i][j:k]
print(ans)
```
Yes
| 39,283 | [
0.418212890625,
0.12237548828125,
0.1524658203125,
0.1934814453125,
-0.1732177734375,
-0.18017578125,
-0.29345703125,
-0.07354736328125,
0.3984375,
0.9033203125,
0.8251953125,
-0.0469970703125,
0.218505859375,
-0.61767578125,
-0.87939453125,
-0.077880859375,
-0.5810546875,
-0.56054... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
n = int(input())
a = []
d = {}
for b in range(n):
s = input()
g = set()
for i in range(len(s)):
for k in range(i, len(s)):
w = s[i:k + 1]
if w in g:
continue
else:
g.add(w)
if w in d:
d[w] += 1
else:
d[w] = 1
a.append(s)
for s in a:
ans = s
for i in range(len(s)):
for j in range(i, len(s)):
k = s[i:j + 1]
if d[k] == 1 and len(k) < len(ans):
ans = k
print(ans)
```
Yes
| 39,284 | [
0.4150390625,
0.11944580078125,
0.1527099609375,
0.1741943359375,
-0.1671142578125,
-0.178955078125,
-0.282958984375,
-0.0872802734375,
0.41796875,
0.88623046875,
0.830078125,
-0.05914306640625,
0.21533203125,
-0.62158203125,
-0.88134765625,
-0.09197998046875,
-0.59326171875,
-0.55... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
n = int(input())
l = []
for i in range(n):
l.append(input())
d = {}
for k in l:
for i in range(1, 9 + 1):
for j in range(9 - i + 1):
a = k[j:j + i]
z = d.keys()
if a in z:
if k != d.get(a)[1]:
w = d.get(a)
w[0] += 1
w[1] = k
d.update({a: w})
else:
d.update({a: [1, k]})
r = list(d.items())
ans = []
for i in r:
if i[1][0] == 1:
ans.append([i[0], i[1][1]])
d1 = {}
for i in ans:
z = d1.keys()
if i[1] in z:
if len(str(i[0])) < len(str(d1.get(i[1]))):
d1.update({i[1]: i[0]})
else:
d1.update({i[1]: i[0]})
for i in l:
print(d1.get(i))
```
Yes
| 39,285 | [
0.41015625,
0.1217041015625,
0.155029296875,
0.190185546875,
-0.17236328125,
-0.177734375,
-0.27880859375,
-0.0946044921875,
0.408935546875,
0.89306640625,
0.8359375,
-0.054046630859375,
0.2052001953125,
-0.623046875,
-0.876953125,
-0.0706787109375,
-0.5849609375,
-0.56689453125,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
n = int(input())
numbers = []
for i in range(0,n):
number = input()
numbers.append(number)
telep = {}
count = 1
for number in numbers:
for l in range(1, len(number)+1):
for i in range(0, len(number) - l + 1):
key = number[i:i + l]
if (key in telep) and (telep[key]!=count):
telep[key]=-1
else:
telep[key]=count
count += 1
reverse = {}
for key in telep:
if telep[key]==-1:
continue
elif (telep[key] not in reverse):
reverse[telep[key]] = key
elif ((len(key))<len(reverse[telep[key]])):
reverse[telep[key]]=key
for i in range(1, n+1):
print(reverse[i])
```
Yes
| 39,286 | [
0.413330078125,
0.120361328125,
0.1541748046875,
0.1817626953125,
-0.164794921875,
-0.200439453125,
-0.298095703125,
-0.1011962890625,
0.432373046875,
0.916015625,
0.82421875,
-0.056976318359375,
0.224609375,
-0.62451171875,
-0.88232421875,
-0.09088134765625,
-0.60791015625,
-0.574... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
n = int(input())
numbers = []
for i in range(0,n):
number = input()
numbers.append(number)
telep = {}
count = 1
for number in numbers:
for l in range(1, len(number)+1):
for i in range(0, len(number) - l + 1):
key = number[i:i + l]
if (key in telep) and (telep[key]!=count):
telep[key]=-1
else:
telep[key]=count
count += 1
for i in range(1, n+1):
mini = 10
for key in telep:
if telep[key]==n:
if len(key)<mini:
mini = telep[key]
print(mini)
```
No
| 39,287 | [
0.413330078125,
0.120361328125,
0.1541748046875,
0.1817626953125,
-0.164794921875,
-0.200439453125,
-0.298095703125,
-0.1011962890625,
0.432373046875,
0.916015625,
0.82421875,
-0.056976318359375,
0.224609375,
-0.62451171875,
-0.88232421875,
-0.09088134765625,
-0.60791015625,
-0.574... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
n = int(input())
a = [""] * n
for i in range(0, n):
a[i] = input()
st = 0
stt = ""
tt = ""
i = 0
hod = 0
while st < n:
b = False
for lon in range(1,10):
if b:
break
for i in range(0,10 - lon):
if b:
break
stt = a[st]
tt = stt[i:(lon + i)]
ver = 0
hod = 0
while hod < n:
if a[hod].find(str(tt)) == -1:
ver += 1
if ver + 1 == n:
print(tt)
b = True
hod += 1
st += 1
print(a)
```
No
| 39,288 | [
0.418212890625,
0.102294921875,
0.1646728515625,
0.1851806640625,
-0.1708984375,
-0.1910400390625,
-0.2783203125,
-0.0880126953125,
0.427490234375,
0.919921875,
0.828125,
-0.039276123046875,
0.2271728515625,
-0.62890625,
-0.8759765625,
-0.08807373046875,
-0.576171875,
-0.5625,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
h = [(i, j) for i in range(9) for j in range(i + 1, 9)]
n = int(input())
s, p = {}, [''] * n
for k in range(n):
t = input()
for q in [t[i: j] for i, j in h]:
s[q] = -1 if q in s and s[q] - k else k
for q, k in s.items():
if k >= 0:
if p[k]:
if len(p[k]) > len(q): p[k] = q
else:
p[k] = q
print('\n'.join(p))
```
No
| 39,289 | [
0.416259765625,
0.12200927734375,
0.150390625,
0.1666259765625,
-0.1820068359375,
-0.1844482421875,
-0.28662109375,
-0.0887451171875,
0.40771484375,
0.89501953125,
0.82275390625,
-0.04669189453125,
0.2010498046875,
-0.62646484375,
-0.88330078125,
-0.09185791015625,
-0.58544921875,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
indexs = []
for length in range(1, 10):
for start in range(0, 9 - length + 1):
indexs.append([start, start + length])
n = int(input())
used = {}
s = []
for i in range(n):
s.append(input())
for index in indexs:
used[s[-1][index[0]: index[1]]] = used.get(s[-1][index[0]: index[1]], 0) + 1
for num in s:
for index in indexs:
if used[num[index[0]: index[1]]] == 1:
print(num[index[0]: index[1]])
break
```
No
| 39,290 | [
0.397216796875,
0.11865234375,
0.1646728515625,
0.1890869140625,
-0.158203125,
-0.18701171875,
-0.284912109375,
-0.0831298828125,
0.434814453125,
0.91552734375,
0.8408203125,
-0.055389404296875,
0.218017578125,
-0.64794921875,
-0.87451171875,
-0.06976318359375,
-0.58251953125,
-0.5... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he considers a positive integer n interesting if its sum of digits is divisible by 4.
Help Polycarp find the nearest larger or equal interesting number for the given number a. That is, find the interesting number n such that n ≥ a and n is minimal.
Input
The only line in the input contains an integer a (1 ≤ a ≤ 1000).
Output
Print the nearest greater or equal interesting number for the given number a. In other words, print the interesting number n such that n ≥ a and n is minimal.
Examples
Input
432
Output
435
Input
99
Output
103
Input
237
Output
237
Input
42
Output
44
Tags: implementation
Correct Solution:
```
a = str(input().strip())
add = 0
for i in (a):
add += int(i)
# temp = add
while (add % 4) != 0:
a = str(int(a)+ 1)
add = 0
for i in a:
add += int(i)
print(a)
```
| 39,673 | [
0.69482421875,
0.12841796875,
-0.1474609375,
-0.165283203125,
-0.0849609375,
-0.2362060546875,
-0.31884765625,
-0.18115234375,
0.1915283203125,
0.8818359375,
0.74169921875,
-0.173583984375,
0.3017578125,
-0.61376953125,
-0.75732421875,
-0.1787109375,
-0.5458984375,
-0.55126953125,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he considers a positive integer n interesting if its sum of digits is divisible by 4.
Help Polycarp find the nearest larger or equal interesting number for the given number a. That is, find the interesting number n such that n ≥ a and n is minimal.
Input
The only line in the input contains an integer a (1 ≤ a ≤ 1000).
Output
Print the nearest greater or equal interesting number for the given number a. In other words, print the interesting number n such that n ≥ a and n is minimal.
Examples
Input
432
Output
435
Input
99
Output
103
Input
237
Output
237
Input
42
Output
44
Tags: implementation
Correct Solution:
```
# your code goes here
a=int(input())
res=0
while res==0:
l=list(map(int,list(str(a))))
if sum(l)%4==0:
res=a
break
a+=1
print(res)
```
| 39,676 | [
0.6728515625,
0.1280517578125,
-0.18603515625,
-0.17236328125,
-0.06329345703125,
-0.2215576171875,
-0.35205078125,
-0.171875,
0.1876220703125,
0.873046875,
0.73681640625,
-0.130615234375,
0.310302734375,
-0.634765625,
-0.77734375,
-0.1500244140625,
-0.5400390625,
-0.57666015625,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he considers a positive integer n interesting if its sum of digits is divisible by 4.
Help Polycarp find the nearest larger or equal interesting number for the given number a. That is, find the interesting number n such that n ≥ a and n is minimal.
Input
The only line in the input contains an integer a (1 ≤ a ≤ 1000).
Output
Print the nearest greater or equal interesting number for the given number a. In other words, print the interesting number n such that n ≥ a and n is minimal.
Examples
Input
432
Output
435
Input
99
Output
103
Input
237
Output
237
Input
42
Output
44
Tags: implementation
Correct Solution:
```
a=[int(i) for i in list(input())]
while(True):
if(sum(a)%4==0):
a=[str(i) for i in a]
a="".join(a)
print(a)
exit()
else:
a=[str(i) for i in a]
a="".join(a)
a=int(a)+1
a=[int(i) for i in str(a)]
```
| 39,679 | [
0.65234375,
0.096923828125,
-0.134033203125,
-0.1571044921875,
-0.07958984375,
-0.2352294921875,
-0.33056640625,
-0.1571044921875,
0.2088623046875,
0.830078125,
0.74365234375,
-0.1630859375,
0.3125,
-0.62109375,
-0.77001953125,
-0.140869140625,
-0.548828125,
-0.52587890625,
-0.60... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he considers a positive integer n interesting if its sum of digits is divisible by 4.
Help Polycarp find the nearest larger or equal interesting number for the given number a. That is, find the interesting number n such that n ≥ a and n is minimal.
Input
The only line in the input contains an integer a (1 ≤ a ≤ 1000).
Output
Print the nearest greater or equal interesting number for the given number a. In other words, print the interesting number n such that n ≥ a and n is minimal.
Examples
Input
432
Output
435
Input
99
Output
103
Input
237
Output
237
Input
42
Output
44
Submitted Solution:
```
a=int(input())
s=0
for i in str(a):
s+=int(i)
if s%4==0:
print(a)
else:
i=a
while(s%4!=0):
s=0
for j in str(i):
s+=int(j)
i+=1
print(i-1)
```
Yes
| 39,680 | [
0.71923828125,
0.14208984375,
-0.23291015625,
-0.03509521484375,
-0.2047119140625,
-0.1270751953125,
-0.317626953125,
-0.1256103515625,
0.0970458984375,
0.8623046875,
0.7529296875,
-0.11456298828125,
0.1839599609375,
-0.6669921875,
-0.69091796875,
-0.2489013671875,
-0.407470703125,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he considers a positive integer n interesting if its sum of digits is divisible by 4.
Help Polycarp find the nearest larger or equal interesting number for the given number a. That is, find the interesting number n such that n ≥ a and n is minimal.
Input
The only line in the input contains an integer a (1 ≤ a ≤ 1000).
Output
Print the nearest greater or equal interesting number for the given number a. In other words, print the interesting number n such that n ≥ a and n is minimal.
Examples
Input
432
Output
435
Input
99
Output
103
Input
237
Output
237
Input
42
Output
44
Submitted Solution:
```
n=input()
sum=0
for i in n:
m=int(i)
sum+=m
if sum%4==0:
print(n)
else:
while sum%4!=0:
sum=0
for i in n:
m=int(i)
sum+=m
x=int(n)+1
n=str(x)
print(int(n)-1)
```
Yes
| 39,681 | [
0.72509765625,
0.166015625,
-0.2203369140625,
-0.028228759765625,
-0.194580078125,
-0.11968994140625,
-0.32275390625,
-0.11865234375,
0.10552978515625,
0.888671875,
0.75830078125,
-0.089599609375,
0.16064453125,
-0.6767578125,
-0.73681640625,
-0.2139892578125,
-0.379150390625,
-0.6... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he considers a positive integer n interesting if its sum of digits is divisible by 4.
Help Polycarp find the nearest larger or equal interesting number for the given number a. That is, find the interesting number n such that n ≥ a and n is minimal.
Input
The only line in the input contains an integer a (1 ≤ a ≤ 1000).
Output
Print the nearest greater or equal interesting number for the given number a. In other words, print the interesting number n such that n ≥ a and n is minimal.
Examples
Input
432
Output
435
Input
99
Output
103
Input
237
Output
237
Input
42
Output
44
Submitted Solution:
```
import sys
import math
n = int(input())
def sumNum(n):
sum=0
while(n!=0):
sum+=n%10
n=int(n/10)
return sum
for i in range(1000):
if(sumNum(n+i)%4==0):
print(n+i)
break
```
Yes
| 39,682 | [
0.72216796875,
0.1676025390625,
-0.2276611328125,
-0.046844482421875,
-0.1766357421875,
-0.09039306640625,
-0.31689453125,
-0.08428955078125,
0.119384765625,
0.89453125,
0.73828125,
-0.11639404296875,
0.1697998046875,
-0.60400390625,
-0.75048828125,
-0.20556640625,
-0.38916015625,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he considers a positive integer n interesting if its sum of digits is divisible by 4.
Help Polycarp find the nearest larger or equal interesting number for the given number a. That is, find the interesting number n such that n ≥ a and n is minimal.
Input
The only line in the input contains an integer a (1 ≤ a ≤ 1000).
Output
Print the nearest greater or equal interesting number for the given number a. In other words, print the interesting number n such that n ≥ a and n is minimal.
Examples
Input
432
Output
435
Input
99
Output
103
Input
237
Output
237
Input
42
Output
44
Submitted Solution:
```
from sys import stdin,stdout
import bisect
import math
def st():
return list(stdin.readline().strip())
def inp():
return int(stdin.readline())
def li():
return list(map(int,stdin.readline().split()))
def mp():
return map(int,stdin.readline().split())
def pr(n):
stdout.write(str(n)+"\n")
def soe(limit):
l=[1]*(limit+1)
pp=[0]*(limit+1)
prime=[]
l[0]=0
l[1]=0
c=0
for i in range(2,limit+1):
if l[i]:
for j in range(i*i,limit+1,i):
l[j]=0
for i in range(2,limit+1):
if l[i]==1:
c+=1
if l[c]==1:
pp[i]=1
for i in range(1,limit+1):
pp[i]+=pp[i-1]
return pp
def segsoe(low,high):
limit=int(high**0.5)+1
prime=soe(limit)
n=high-low+1
l=[0]*(n+1)
for i in range(len(prime)):
lowlimit=(low//prime[i])*prime[i]
if lowlimit<low:
lowlimit+=prime[i]
if lowlimit==prime[i]:
lowlimit+=prime[i]
for j in range(lowlimit,high+1,prime[i]):
l[j-low]=1
for i in range(low,high+1):
if not l[i-low]:
if i!=1:
print(i)
def gcd(a,b):
while b:
a=a%b
b,a=a,b
return a
def power(a,n):
r=1
while n:
if n&1:
r=(r*a)
a*=a
n=n>>1
return r
def su(n):
s=0
while n:
s+=n%10
n//=10
return s
def solve():
n=inp()
while True:
if su(n)%4==0:
print(n)
return
n+=1
for _ in range(1):
solve()
```
Yes
| 39,683 | [
0.57080078125,
0.1046142578125,
-0.184326171875,
-0.0104522705078125,
-0.2161865234375,
-0.08416748046875,
-0.331787109375,
-0.14404296875,
0.12274169921875,
0.8564453125,
0.6865234375,
-0.16748046875,
0.250244140625,
-0.60791015625,
-0.67822265625,
-0.10296630859375,
-0.427734375,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he considers a positive integer n interesting if its sum of digits is divisible by 4.
Help Polycarp find the nearest larger or equal interesting number for the given number a. That is, find the interesting number n such that n ≥ a and n is minimal.
Input
The only line in the input contains an integer a (1 ≤ a ≤ 1000).
Output
Print the nearest greater or equal interesting number for the given number a. In other words, print the interesting number n such that n ≥ a and n is minimal.
Examples
Input
432
Output
435
Input
99
Output
103
Input
237
Output
237
Input
42
Output
44
Submitted Solution:
```
n = int(input())
for x in range(n, n ** 2):
if (x // 1000 + x % 1000 // 100 + x % 100 // 10 + x % 10) % 4 == 0:
print(x)
break
```
No
| 39,684 | [
0.73681640625,
0.1658935546875,
-0.2220458984375,
-0.0188446044921875,
-0.1839599609375,
-0.129638671875,
-0.337158203125,
-0.1031494140625,
0.09271240234375,
0.884765625,
0.78125,
-0.08160400390625,
0.1737060546875,
-0.68115234375,
-0.7216796875,
-0.23583984375,
-0.415771484375,
-... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he considers a positive integer n interesting if its sum of digits is divisible by 4.
Help Polycarp find the nearest larger or equal interesting number for the given number a. That is, find the interesting number n such that n ≥ a and n is minimal.
Input
The only line in the input contains an integer a (1 ≤ a ≤ 1000).
Output
Print the nearest greater or equal interesting number for the given number a. In other words, print the interesting number n such that n ≥ a and n is minimal.
Examples
Input
432
Output
435
Input
99
Output
103
Input
237
Output
237
Input
42
Output
44
Submitted Solution:
```
n = input()
def check(n):
s = list(n)
ans = 0
for i in range(len(s)):
ans += int(s[i])
return ans
while True:
n = int(n) + 1
ans = check(str(n))
if ans % 4 == 0:
break
print(n)
```
No
| 39,685 | [
0.732421875,
0.13916015625,
-0.2083740234375,
-0.045928955078125,
-0.2017822265625,
-0.1072998046875,
-0.338623046875,
-0.10003662109375,
0.1417236328125,
0.84814453125,
0.79931640625,
-0.15966796875,
0.176513671875,
-0.67431640625,
-0.7294921875,
-0.2476806640625,
-0.41943359375,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he considers a positive integer n interesting if its sum of digits is divisible by 4.
Help Polycarp find the nearest larger or equal interesting number for the given number a. That is, find the interesting number n such that n ≥ a and n is minimal.
Input
The only line in the input contains an integer a (1 ≤ a ≤ 1000).
Output
Print the nearest greater or equal interesting number for the given number a. In other words, print the interesting number n such that n ≥ a and n is minimal.
Examples
Input
432
Output
435
Input
99
Output
103
Input
237
Output
237
Input
42
Output
44
Submitted Solution:
```
def divBy4(n):
sint = 0
for s in str(n):
sint += int(s)
if sint % 4 == 0:
return True
else:
return False
def mainFunc(n):
if divBy4(n):
return n
for x in range(1, 5):
newNum = n + x
if divBy4(newNum):
return newNum
n = int(input())
print(mainFunc(n))
```
No
| 39,686 | [
0.73681640625,
0.06500244140625,
-0.28076171875,
-0.002002716064453125,
-0.1295166015625,
-0.125732421875,
-0.2156982421875,
-0.1279296875,
0.06781005859375,
0.8935546875,
0.83349609375,
-0.197509765625,
0.247314453125,
-0.5703125,
-0.80126953125,
-0.2205810546875,
-0.466796875,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he considers a positive integer n interesting if its sum of digits is divisible by 4.
Help Polycarp find the nearest larger or equal interesting number for the given number a. That is, find the interesting number n such that n ≥ a and n is minimal.
Input
The only line in the input contains an integer a (1 ≤ a ≤ 1000).
Output
Print the nearest greater or equal interesting number for the given number a. In other words, print the interesting number n such that n ≥ a and n is minimal.
Examples
Input
432
Output
435
Input
99
Output
103
Input
237
Output
237
Input
42
Output
44
Submitted Solution:
```
n = int(input())
plus = sum(map(int,str(n)))%4
print(n + (4-plus))
```
No
| 39,687 | [
0.75244140625,
0.1688232421875,
-0.287109375,
0.0098114013671875,
-0.1688232421875,
-0.1470947265625,
-0.340087890625,
-0.09088134765625,
0.100341796875,
0.8642578125,
0.78173828125,
-0.109130859375,
0.19970703125,
-0.654296875,
-0.68994140625,
-0.249755859375,
-0.37451171875,
-0.6... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
n = int(input())
numbers = []
for i in range(0,n):
number = input()
numbers.append(number)
telep = {}
count = 1
for number in numbers:
for l in range(1, len(number)+1):
for i in range(0, len(number) - l + 1):
key = number[i:i + l]
if (key in telep) and (telep[key]!=count):
telep[key]=-1
else:
telep[key]=count
count += 1
reverse = {}
for key in telep:
if telep[key]==-1:
continue
elif (telep[key] not in reverse):
reverse[telep[key]] = key
elif ((len(key))<len(reverse[telep[key]])):
reverse[telep[key]]=key
for i in range(1, n+1):
print(reverse[i])
```
| 40,119 | [
0.29052734375,
-0.01300048828125,
0.261474609375,
0.25,
-0.034210205078125,
-0.294677734375,
-0.209228515625,
-0.1685791015625,
0.484130859375,
0.8935546875,
0.77392578125,
-0.0650634765625,
0.296630859375,
-0.63818359375,
-0.85400390625,
-0.052215576171875,
-0.666015625,
-0.561523... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
import math
from collections import *
a=int(input())
indx=defaultdict(list)
done=defaultdict(list)
for t in range(a):
s=input()
for i in range(len(s)):
for j in range(i,len(s)):
m=s[i:j+1]
if(len(done[m])==0):
done[m].append(t)
indx[t].append(m)
else:
if(len(done[m])==1 and done[m][0]!=math.inf and t!=done[m][0]):
indx[done[m][0]].remove(m)
done[m][0]=math.inf
for i in range(a):
af=indx[i]
mini=15
ss=''
for i in range(len(af)):
if(len(af[i])<mini):
mini=len(af[i])
ss=af[i]
print(ss)
```
| 40,120 | [
0.276123046875,
-0.0148468017578125,
0.272705078125,
0.2310791015625,
-0.004413604736328125,
-0.275146484375,
-0.16552734375,
-0.19384765625,
0.499755859375,
0.84814453125,
0.79052734375,
-0.08062744140625,
0.278564453125,
-0.60302734375,
-0.857421875,
-0.050445556640625,
-0.67041015... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
#######################################
n=int(input())
l=[]
for i in range(n):
l.append(input())
from collections import defaultdict
d=defaultdict(int)
d1=defaultdict(list)
for i in range(n):
d2=defaultdict(int)
for j in range(9):
s=l[i][j]
if d2[s]==0:
d[s]+=1
d2[s]+=1
d1[i].append(s)
for k in range(j+1,9):
s+=l[i][k]
if d2[s]==0:
d[s]+=1
d2[s]+=1
if d[s]==1:
d1[i].append(s)
d1[i].sort(key=len)
for i in range(n):
for j in d1[i]:
if d[j]==1:
print(j)
break
```
| 40,121 | [
0.301513671875,
-0.050933837890625,
0.30615234375,
0.2548828125,
-0.044830322265625,
-0.26708984375,
-0.134765625,
-0.184326171875,
0.50048828125,
0.85986328125,
0.71337890625,
-0.053680419921875,
0.29736328125,
-0.615234375,
-0.80126953125,
-0.0117340087890625,
-0.61669921875,
-0.... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
"""
-----------------------------Pseudo---------------------------------
"""
import sys
from collections import defaultdict
def input(): return sys.stdin.readline()
def print(arg, *argv, end=None):
sys.stdout.write(str(arg))
for i in argv: sys.stdout.write(" "+str(i))
sys.stdout.write(end) if end or end=="" else sys.stdout.write("\n")
def mapi(): return map(int,input().split())
def maps(): return map(str,input().split())
#---------------------------------------------------------------#
def solve():
t = 1
#t = int(input())
for _ in range(t):
n = int(input())
ss = []
a = []
mem = defaultdict(int)
for __ in range(n):
x = input().strip()
a.append(x)
sett = set()
for i in range(9):
for j in range(i+1,10):
sett.add(x[i:j])
for it in sett:
mem[it]+=1
for id in range(n):
length = 1
flag = True
while length<10 and flag:
i = 0
j = length
while i<9 and j<10:
tmp = a[id][i:j]
if mem[tmp]==1:
print(tmp)
flag = False
break
i+=1
j+=1
length+=1
#---------------------------------------------------------------#
if __name__ == '__main__':
solve()
```
| 40,122 | [
0.282958984375,
-0.01045989990234375,
0.2666015625,
0.27880859375,
-0.0220947265625,
-0.278564453125,
-0.18701171875,
-0.161865234375,
0.52587890625,
0.87060546875,
0.7685546875,
-0.0633544921875,
0.273193359375,
-0.638671875,
-0.84912109375,
-0.0633544921875,
-0.6103515625,
-0.576... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
h = [(i, j) for i in range(9) for j in range(i + 1, 10)]
n = int(input())
s, p = {}, [''] * n
for k in range(n):
t = input()
for q in [t[i: j] for i, j in h]:
s[q] = -1 if q in s and s[q] != k else k
for q, k in s.items():
if k >= 0:
if p[k]:
if len(p[k]) > len(q): p[k] = q
else:
p[k] = q
print('\n'.join(p))
```
| 40,123 | [
0.29248046875,
-0.02825927734375,
0.281494140625,
0.265625,
-0.0257415771484375,
-0.300048828125,
-0.1871337890625,
-0.1800537109375,
0.476318359375,
0.84765625,
0.77490234375,
-0.063720703125,
0.26416015625,
-0.62060546875,
-0.857421875,
-0.0478515625,
-0.65576171875,
-0.532714843... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
def podstroki(s):
return sorted(set(s[i: i1] for i in range(9) for i1 in range (i+1, 10)), key=len)
res = {}
spisok = [podstroki(input()) for i in range (int(input()))]
for s in spisok:
for podstr in s:
if podstr in res:
res[podstr] += 1
else:
res[podstr] = 1
for s in spisok:
for podstr in s:
if res[podstr] == 1:
print(podstr)
break
```
| 40,124 | [
0.28759765625,
-0.07781982421875,
0.248046875,
0.291259765625,
0.034515380859375,
-0.39892578125,
-0.171630859375,
-0.1396484375,
0.490478515625,
0.8369140625,
0.775390625,
-0.178955078125,
0.284423828125,
-0.64794921875,
-0.826171875,
-0.0009937286376953125,
-0.66357421875,
-0.460... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
n=int(input())
a=[]
d={}
for _ in range(n):
s=input()
g=set()
for i in range(len(s)):
for k in range(i,len(s)):
st=s[i:k+1]
if st in g:
continue
else:
g.add(st)
if st in d:
d[st]+=1
else:
d[st]=1
a.append(s)
for s in a:
ans=s
for i in range(len(s)):
for j in range(i,len(s)):
k=s[i:j+1]
if d[k]==1 and len(k) < len(ans):
ans=k
print(ans)
```
| 40,125 | [
0.302001953125,
-0.04046630859375,
0.273193359375,
0.2484130859375,
-0.00939178466796875,
-0.29638671875,
-0.1861572265625,
-0.1822509765625,
0.48974609375,
0.84375,
0.7646484375,
-0.07275390625,
0.279541015625,
-0.6025390625,
-0.8369140625,
-0.057373046875,
-0.662109375,
-0.533691... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Tags: data structures, implementation, sortings
Correct Solution:
```
n = int(input())
l = []
for i in range(n):
l.append(input())
d = {}
for k in l:
for i in range(1, 9 + 1):
for j in range(9 - i + 1):
a = k[j:j + i]
z = d.keys()
if a in z:
if k != d.get(a)[1]:
w = d.get(a)
w[0] += 1
w[1] = k
d.update({a: w})
else:
d.update({a: [1, k]})
r = list(d.items())
ans = []
for i in r:
if i[1][0] == 1:
ans.append([i[0], i[1][1]])
d1 = {}
for i in ans:
z = d1.keys()
if i[1] in z:
if len(str(i[0])) < len(str(d1.get(i[1]))):
d1.update({i[1]: i[0]})
else:
d1.update({i[1]: i[0]})
for i in l:
print(d1.get(i))
```
| 40,126 | [
0.297607421875,
-0.025665283203125,
0.27197265625,
0.26220703125,
-0.0168609619140625,
-0.28662109375,
-0.1865234375,
-0.1654052734375,
0.4853515625,
0.861328125,
0.775390625,
-0.06787109375,
0.269287109375,
-0.6259765625,
-0.84521484375,
-0.044952392578125,
-0.64990234375,
-0.5332... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
def rec(i):
global a
return i
import sys
from collections import Counter
sys.setrecursionlimit(10**6)
n=int(input())
#n,m=list(map(int,input().split()))
a=[input() for i in range(n)]
b=[]
a0=set()
c0=set()
for i in a:
c=set()
for i0 in range(1,10):
for i1 in range(0,10-i0):
c.add(i[i1:i1+i0])
b.append(c)
c0.update(a0&c)
a0.update(c)
for i in b:
c=i-c0
z='0'*10
for i0 in c:
if len(i0)<len(z):
z=i0
print(z)
```
Yes
| 40,127 | [
0.388427734375,
0.14404296875,
0.15478515625,
0.2073974609375,
-0.15869140625,
-0.174072265625,
-0.294189453125,
-0.086181640625,
0.43798828125,
0.87451171875,
0.82958984375,
-0.08197021484375,
0.2353515625,
-0.65380859375,
-0.9228515625,
-0.069091796875,
-0.5986328125,
-0.56884765... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
n=int(input())
q={}
z=[input() for i in range(n)]
for s in z:
w=set()
for i in range(len(s)):
for j in range(i,len(s)):
k=s[i:j+1]
if k in w: continue
else: w.add(k)
if k in q: q[k]+=1
else: q[k]=1
for s in z:
r=s
for i in range(len(s)):
for j in range(i,len(s)):
k=s[i:j+1]
if q[k]==1 and len(k)<len(r): r=k
print(r)
```
Yes
| 40,128 | [
0.4072265625,
0.11602783203125,
0.14990234375,
0.1846923828125,
-0.1749267578125,
-0.1845703125,
-0.278076171875,
-0.08258056640625,
0.4140625,
0.884765625,
0.822265625,
-0.05615234375,
0.2095947265625,
-0.60986328125,
-0.880859375,
-0.07855224609375,
-0.60400390625,
-0.5498046875,... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
from collections import defaultdict
def subs(s):
for l in range(1, len(s) + 1):
for shift in range(0, len(s) - l + 1):
yield s[shift : shift + l]
n = int(input())
vs = [input() for _ in range(n)]
entries = defaultdict(set)
for i, s in enumerate(vs):
for sub in subs(s):
entries[sub].add(i)
for s in vs:
for sub in subs(s):
if len(entries[sub]) == 1:
print(sub)
break
```
Yes
| 40,129 | [
0.37353515625,
0.10601806640625,
0.124755859375,
0.18603515625,
-0.1197509765625,
-0.1776123046875,
-0.272216796875,
-0.0931396484375,
0.446044921875,
0.87548828125,
0.84033203125,
-0.1005859375,
0.2115478515625,
-0.67333984375,
-0.88427734375,
-0.086669921875,
-0.58740234375,
-0.5... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
n = int(input())
a = []
d = {}
for b in range(n):
s = input()
g = set()
for i in range(len(s)):
for k in range(i, len(s)):
w = s[i:k + 1]
if w in g:
continue
else:
g.add(w)
if w in d:
d[w] += 1
else:
d[w] = 1
a.append(s)
for s in a:
ans = s
for i in range(len(s)):
for j in range(i, len(s)):
k = s[i:j + 1]
if d[k] == 1 and len(k) < len(ans):
ans = k
print(ans)
```
Yes
| 40,130 | [
0.4150390625,
0.11944580078125,
0.1527099609375,
0.1741943359375,
-0.1671142578125,
-0.178955078125,
-0.282958984375,
-0.0872802734375,
0.41796875,
0.88623046875,
0.830078125,
-0.05914306640625,
0.21533203125,
-0.62158203125,
-0.88134765625,
-0.09197998046875,
-0.59326171875,
-0.55... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
n = int(input())
numbers = []
for i in range(0,n):
number = input()
numbers.append(number)
telep = {}
count = 1
for number in numbers:
for l in range(1, len(number)+1):
for i in range(0, len(number) - l + 1):
key = number[i:i + l]
if (key in telep) and (telep[key]!=count):
telep[key]=-1
else:
telep[key]=count
count += 1
for i in range(1, n+1):
mini = 10
for key in telep:
if telep[key]==n:
if len(key)<mini:
mini = telep[key]
print(mini)
```
No
| 40,131 | [
0.413330078125,
0.120361328125,
0.1541748046875,
0.1817626953125,
-0.164794921875,
-0.200439453125,
-0.298095703125,
-0.1011962890625,
0.432373046875,
0.916015625,
0.82421875,
-0.056976318359375,
0.224609375,
-0.62451171875,
-0.88232421875,
-0.09088134765625,
-0.60791015625,
-0.574... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
h = [(i, j) for i in range(9) for j in range(i + 1, 9)]
n = int(input())
s, p = {}, [''] * n
for k in range(n):
t = input()
for q in [t[i: j] for i, j in h]:
s[q] = -1 if q in s and s[q] - k else k
for q, k in s.items():
if k >= 0:
if p[k]:
if len(p[k]) > len(q): p[k] = q
else:
p[k] = q
print('\n'.join(p))
```
No
| 40,132 | [
0.416259765625,
0.12200927734375,
0.150390625,
0.1666259765625,
-0.1820068359375,
-0.1844482421875,
-0.28662109375,
-0.0887451171875,
0.40771484375,
0.89501953125,
0.82275390625,
-0.04669189453125,
0.2010498046875,
-0.62646484375,
-0.88330078125,
-0.09185791015625,
-0.58544921875,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
n = int(input())
numbers = []
for i in range(0,n):
number = input()
numbers.append(number)
telep = {}
count = 1
for number in numbers:
for l in range(1, len(number)+1):
for i in range(0, len(number) - l + 1):
key = number[i:i + l]
if (key in telep) and (telep[key]!=count):
telep[key]=-1
else:
telep[key]=count
count += 1
for i in range(1, n+1):
mini = '0000000000'
for key in telep:
if telep[key]==n:
if len(key)<len(mini):
mini = key
print(mini)
```
No
| 40,133 | [
0.413330078125,
0.120361328125,
0.1541748046875,
0.1817626953125,
-0.164794921875,
-0.200439453125,
-0.298095703125,
-0.1011962890625,
0.432373046875,
0.916015625,
0.82421875,
-0.056976318359375,
0.224609375,
-0.62451171875,
-0.88232421875,
-0.09088134765625,
-0.60791015625,
-0.574... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:
* if he enters 00 two numbers will show up: 100000000 and 100123456,
* if he enters 123 two numbers will show up 123456789 and 100123456,
* if he enters 01 there will be only one number 100123456.
For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.
Input
The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.
The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.
Output
Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.
Examples
Input
3
123456789
100000000
100123456
Output
9
000
01
Input
4
123456789
193456789
134567819
934567891
Output
2
193
81
91
Submitted Solution:
```
n = int(input())
maps = {}
for i in range(n):
string = input()
for j in range(len(string)):
for a in range(0,j + 1):
substr = string[a:j+1]
if substr not in maps.keys():
maps[substr] = {'index' : i, 'count': 1}
else:
if i != maps[substr]['index']:
maps[substr]['count'] += 1
maps = sorted(maps.items(), key = lambda i: i[1]['index'])
count = 0
min_v = 'idk'
min_count = 11
for k, value in maps:
if count < value['index']:
count += 1
print(min_v)
min_v = 'idk'
min_count = 10
else:
if value['count'] == 1:
if len(k) < min_count:
min_count = len(k)
min_v = k
print(min_v)
```
No
| 40,134 | [
0.40869140625,
0.1146240234375,
0.126708984375,
0.14599609375,
-0.1678466796875,
-0.1885986328125,
-0.289306640625,
-0.0804443359375,
0.404052734375,
0.8876953125,
0.8232421875,
-0.059539794921875,
0.23779296875,
-0.61962890625,
-0.8466796875,
-0.1009521484375,
-0.59619140625,
-0.5... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
import sys
input=sys.stdin.readline
from collections import defaultdict as dc
from collections import Counter
from bisect import bisect_right, bisect_left
import math
from operator import itemgetter
from heapq import heapify, heappop, heappush
from queue import PriorityQueue as pq
for _ in range(int(input())):
n=int(input())
l=sorted(list(map(int,input().split())))
x=dc(int)
for i in l:
x[i]+=1
p=list(sorted(x.values()))
x=dc(int)
n=0
for i in p:
x[i]+=1
n+=1
a=[0]*n
b=[0]*n
a[0],b[-1]=p[0],p[-1]
for i in range(1,n):
a[i]=a[i-1]+p[i]
for i in range(n-2,-1,-1):
b[i]=b[i+1]+p[i]
m=sys.maxsize
i=0
#print(p)
#print(a)
#print(b)
while(i<n):
c=0
if i!=n-1:
t=i+x[p[i]]
if t<n:
c+=b[t]-p[i]*(n-t)
#print(p[i],c)
if i!=0:
c+=a[i-1]
#print(p[i],c)
#print(p[i],c)
m=min(m,c)
i+=x[p[i]]
print(m)
```
| 40,643 | [
0.31298828125,
0.08538818359375,
0.310546875,
0.333740234375,
-0.580078125,
-0.491943359375,
-0.30224609375,
-0.03021240234375,
0.36962890625,
0.5576171875,
0.9453125,
-0.2069091796875,
-0.15576171875,
-0.96923828125,
-0.865234375,
-0.1822509765625,
-0.446533203125,
-0.389892578125... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline()
# ------------------------------
def RL(): return map(int, sys.stdin.readline().split())
def RLL(): return list(map(int, sys.stdin.readline().split()))
def N(): return int(input())
def S(): return input().strip()
def print_list(l):
print(' '.join(map(str, l)))
# sys.setrecursionlimit(100000)
# import random
# from functools import reduce
# from functools import lru_cache
# from heapq import *
# from collections import deque as dq
# import math
# import bisect as bs
from collections import Counter
# from collections import defaultdict as dc
for _ in range(N()):
n = N()
a = RLL()
count = Counter(Counter(a).values())
p = list(count.keys())
p.sort(reverse=True)
s = 0
ans = n
for k in p:
s += count[k]
ans = min(ans, n - k * s)
print(ans)
```
| 40,644 | [
0.3056640625,
0.0107574462890625,
0.372314453125,
0.318603515625,
-0.591796875,
-0.58447265625,
-0.263671875,
0.07489013671875,
0.42578125,
0.544921875,
0.92529296875,
-0.092041015625,
-0.058990478515625,
-0.95166015625,
-0.8017578125,
-0.12109375,
-0.437744140625,
-0.448974609375,... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
ctr = {}
for i in a:
ctr[i] = ctr.get(i, 0) + 1
borders = set([j for i, j in ctr.items()])
best = 10**9
for bord in borders:
cur = 0
for i, j in ctr.items():
if j < bord:
cur += j
else:
cur += j - bord
best = min(best, cur)
print(best)
```
| 40,645 | [
0.31982421875,
0.03466796875,
0.378173828125,
0.212890625,
-0.58154296875,
-0.5986328125,
-0.297607421875,
0.145751953125,
0.286865234375,
0.494873046875,
0.96923828125,
-0.1500244140625,
-0.1826171875,
-0.8720703125,
-0.80078125,
-0.1854248046875,
-0.4736328125,
-0.359130859375,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
import sys,math,itertools
from collections import Counter,deque,defaultdict
from bisect import bisect_left,bisect_right
from heapq import heappop,heappush,heapify, nlargest
from copy import deepcopy
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_1(): return list(map(lambda x:int(x)-1, sys.stdin.readline().split()))
def inps(): return sys.stdin.readline()
def inpsl(x): tmp = sys.stdin.readline(); return tmp[:x]
def err(x): print(x); exit()
for _ in range(inp()):
n = inp()
a = inpl()
c = Counter(a)
vas = sorted(list(c.values()))
acc = [0]
for x in vas: acc.append(acc[-1]+x)
res = INF
ln = len(vas)
for now in list(set(vas)):
cnt = 0
l = bisect_left(vas,now)
r = bisect_right(vas,now)
cnt = acc[l] + acc[-1]-acc[r]-now*(ln-r)
res = min(res, cnt)
print(res)
```
| 40,646 | [
0.322509765625,
0.06256103515625,
0.3232421875,
0.25537109375,
-0.60009765625,
-0.52099609375,
-0.326171875,
-0.049163818359375,
0.385498046875,
0.5595703125,
1,
-0.15185546875,
-0.06378173828125,
-0.99072265625,
-0.84521484375,
-0.1605224609375,
-0.46435546875,
-0.3759765625,
-0... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
from collections import Counter
from sys import stdin
def solve(arr, n):
c = Counter(arr)
s = sorted(c.values(), reverse=True)
#print(s)
res = n
d = Counter(s)
#print(d)
for i in range(s[0]+1):
tmp = 0
for e in d.keys():
if e >= i:
tmp += (e-i)*d[e]
else:
tmp += e*d[e]
res = min(res, tmp)
return res
def main():
t = int(stdin.readline())
for i in range(t):
n = int(stdin.readline())
print(solve(list(map(int, stdin.readline().split(" "))), n))
main()
```
| 40,647 | [
0.2958984375,
0.099609375,
0.392578125,
0.245849609375,
-0.615234375,
-0.57421875,
-0.3466796875,
0.1239013671875,
0.319091796875,
0.51123046875,
0.97705078125,
-0.1434326171875,
-0.115234375,
-0.96142578125,
-0.826171875,
-0.147216796875,
-0.4853515625,
-0.362548828125,
-0.89794... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
def solve(a):
li = get_counts(a)
solution = 0
for i in range(len(li)):
temp_solution = li[i] * (len(li) - i)
if temp_solution > solution:
solution = temp_solution
print(len(a) - solution)
def get_counts(li):
count_dict = {}
for a in li:
if a in count_dict:
count_dict[a] += 1
else:
count_dict[a] = 1
return sorted(count_dict.values())
def main():
x = input()
for _ in range(int(x)):
input()
a = input()
solve(list(map(int, a.split())))
main()
```
| 40,648 | [
0.325927734375,
0.051025390625,
0.342041015625,
0.262939453125,
-0.5478515625,
-0.57958984375,
-0.333740234375,
0.10650634765625,
0.394287109375,
0.5087890625,
0.921875,
-0.15966796875,
-0.1177978515625,
-0.869140625,
-0.8291015625,
-0.1435546875,
-0.45849609375,
-0.36767578125,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
def solve():
n = int(input())
arr = [int(i) for i in input().split()]
dic = {}
for i in range(n):
if arr[i] in dic:
dic[arr[i]] += 1
else:
dic[arr[i]] = 1
values = list(dic.values())
deleted = []
for s in set(values):
result = sum([a - s for a in values if a > s])
result += sum([a for a in values if a < s])
deleted.append(result)
print(min(deleted))
for _ in range(int(input())):
solve()
```
| 40,649 | [
0.297119140625,
0.06292724609375,
0.410888671875,
0.23828125,
-0.56494140625,
-0.59423828125,
-0.343994140625,
0.119873046875,
0.364501953125,
0.494384765625,
0.99072265625,
-0.121826171875,
-0.1278076171875,
-0.931640625,
-0.82568359375,
-0.153076171875,
-0.4951171875,
-0.33935546... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
from collections import*
for t in range(int(input())):
z=s=int(input())
c=0
for x,y in sorted(Counter(Counter(input().split()).values()).items())[::-1]:
c+=y
z=min(z,s-c*x)
print(z)
```
| 40,650 | [
0.32666015625,
0.059173583984375,
0.391845703125,
0.23974609375,
-0.60400390625,
-0.537109375,
-0.333740234375,
0.12127685546875,
0.302001953125,
0.493896484375,
0.99609375,
-0.15087890625,
-0.1732177734375,
-0.93359375,
-0.82470703125,
-0.1605224609375,
-0.439453125,
-0.3640136718... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Submitted Solution:
```
for _ in ' '*int(input()):
n,l,d,m=input(),input().split(),{},1e9
for i in l:
if i in d: d[i]+=1
else: d[i]=1
for i in set(d.values()):
x=0
for j in d.values():
if j<i: x+=j
elif j>i: x+=j-i
m=min(x,m)
print(m)
```
Yes
| 40,651 | [
0.418212890625,
0.13427734375,
0.345458984375,
0.17822265625,
-0.673828125,
-0.425048828125,
-0.36181640625,
0.1544189453125,
0.272216796875,
0.437255859375,
0.94775390625,
-0.0921630859375,
-0.1900634765625,
-0.9150390625,
-0.83642578125,
-0.1490478515625,
-0.42333984375,
-0.34521... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Submitted Solution:
```
from collections import defaultdict,Counter
from itertools import accumulate
import sys
input = sys.stdin.readline
'''
for CASES in range(int(input())):
n, m = map(int, input().split())
n = int(input())
A = list(map(int, input().split()))
S = input().strip()
sys.stdout.write(" ".join(map(str,ANS))+"\n")
'''
inf = 100000000000000000 # 1e17
mod = 998244353
for CASES in range(int(input())):
n = int(input())
A = list(map(int, input().split()))
C=Counter(A)
LIST=[0]*(n+2)
for c in C.values():
LIST[c]+=1
presum=0
forsum=sum(LIST)
LIST2=[0]*(n+2)
for i in range(len(LIST2)):
LIST2[i]=LIST[i]*i
allsum=sum(LIST2)
ans=1<<60
for i in range(1,len(LIST)):
presum+=LIST[i-1]*(i-1)
allsum-=forsum
forsum-=LIST[i]
# print(presum,allsum)
ans=min(ans,presum+allsum)
print(ans)
```
Yes
| 40,652 | [
0.3828125,
0.1363525390625,
0.334716796875,
0.1722412109375,
-0.69140625,
-0.408203125,
-0.452880859375,
0.11297607421875,
0.251953125,
0.469970703125,
0.89697265625,
-0.1466064453125,
-0.1453857421875,
-0.8662109375,
-0.80859375,
-0.1646728515625,
-0.4033203125,
-0.3720703125,
-... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Submitted Solution:
```
from collections import Counter
def get_min(times_dict):
final_ans = 2 * (10 ** 14)
for times in set(times_dict):
ans = 0
for t in times_dict:
if t >= times:
ans += (t - times) * times_dict[t]
else:
ans += t * times_dict[t]
final_ans = min(final_ans, ans)
return final_ans
t = int(input())
for _ in range(t):
n = int(input())
a_list = list(map(int, input().split()))
a_dict = Counter(a_list)
times_dict = Counter(a_dict.values())
get_ans = get_min(times_dict)
print(get_ans)
```
Yes
| 40,653 | [
0.3720703125,
0.167236328125,
0.2391357421875,
0.1854248046875,
-0.67236328125,
-0.418212890625,
-0.45068359375,
0.1044921875,
0.260986328125,
0.46875,
0.828125,
-0.1829833984375,
-0.180419921875,
-0.96630859375,
-0.86279296875,
-0.136962890625,
-0.4482421875,
-0.352783203125,
-0... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Submitted Solution:
```
import sys
import collections
input = sys.stdin.readline
def println(val):
sys.stdout.write(str(val) + '\n')
def solve(n, a):
cnts = collections.Counter(a)
occurences = collections.defaultdict(int)
for key in cnts:
occurences[cnts[key]] += 1
# println(occurences)
ans = 0
removed = 0
for C in range(1, n+10):
ans = max(ans, C * (len(cnts) - removed))
removed += occurences[C]
println(n - ans)
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
solve(n, a)
```
Yes
| 40,654 | [
0.35498046875,
0.1717529296875,
0.31982421875,
0.18359375,
-0.6455078125,
-0.476806640625,
-0.48583984375,
0.10845947265625,
0.27197265625,
0.466796875,
0.865234375,
-0.1767578125,
-0.1463623046875,
-0.90087890625,
-0.853515625,
-0.1875,
-0.461669921875,
-0.39794921875,
-0.801269... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Submitted Solution:
```
def equalizeTheArray(a):
d = dict()
for i in range(len(a)):
if(str(a[i]) in d.keys()):
d[str(a[i])] += 1
else:
d[str(a[i])] = 1
k = sorted(list(d.values()))
rm = 0
s = 1
for i in range(len(k) - 1):
if(k[i] < k[i+1]):
if(s*k[i] <= (k[i + 1] - k[i])):
rm += s*k[i]
s = 1
else:
rm += (k[i+1] - k[i])
s += 1
k[i + 1] =k[i]
elif(k[i] == k[i+1]):
s+=1
return rm
if(__name__=="__main__"):
for _ in range(int(input())):
n = int(input())
a = list(map(int,input().split()))
print(equalizeTheArray(a))
```
No
| 40,655 | [
0.369873046875,
0.14697265625,
0.2802734375,
0.186279296875,
-0.7158203125,
-0.44091796875,
-0.384765625,
0.1378173828125,
0.2445068359375,
0.41943359375,
0.9501953125,
-0.074951171875,
-0.1700439453125,
-0.8896484375,
-0.79736328125,
-0.1409912109375,
-0.485107421875,
-0.363037109... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Submitted Solution:
```
t=int(input())
for i in range(t):
listo=[]
n=int(input())
l=list(map(int,input().split()))
sumi=len(l)
dic={}
for x in set(l):
listo.append(l.count(x))
m=len(set(l))
for x in set(listo):
w=listo.count(x)
dic[x]=[]
dic[x].append(w)
dic[x].append(m-w)
m=m-w
dic[x].append(sumi-x*w)
sumi=sumi-x*w
dic[x].append(dic[x][2]-dic[x][1]*x)
tot=0
s=[]
for x in dic:
s.append(x)
for j in range(len(s)-1):
tot=tot+dic[s[j]][0]*s[j]
if dic[s[j]][1]*s[j]+dic[s[j+1]][3]>=dic[s[j]][3]:
tot=tot+dic[s[j]][2]
break
print(tot)
```
No
| 40,656 | [
0.37841796875,
0.1268310546875,
0.32275390625,
0.179443359375,
-0.67919921875,
-0.42529296875,
-0.406982421875,
0.1834716796875,
0.33642578125,
0.445068359375,
0.90234375,
-0.061004638671875,
-0.17724609375,
-0.89111328125,
-0.814453125,
-0.1253662109375,
-0.443359375,
-0.347900390... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Submitted Solution:
```
import sys
import math
from itertools import permutations
from bisect import bisect_left
def II():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def MI():
return map(int, sys.stdin.readline().split())
def SI():
return sys.stdin.readline().strip()
def FACT(n, mod):
s = 1
facts = [1]
for i in range(1,n+1):
s*=i
s%=mod
facts.append(s)
return facts[n]
def C(n, k, mod):
return (FACT(n,mod) * pow((FACT(k,mod)*FACT(n-k,mod))%mod,mod-2, mod))%mod
for _ in range(II()):
n = II()
a = LI()
d = {}
for i in range(n):
if d.get(a[i]):
d[a[i]]+=1
else:
d[a[i]] = 1
d = list(d.values())
d.sort()
rightSum = []
s = 0
for i in range(len(d)-1,-1,-1):
rightSum.append(s)
s+=d[i]
rightSum.reverse()
m = n
v = {}
for i in range(len(d)):
if not v.get(d[i]):
m = min(m,i+rightSum[i]-d[i]*(len(d)-i-1))
v[d[i]] = 1
print(m)
```
No
| 40,657 | [
0.380859375,
0.1353759765625,
0.272705078125,
0.2080078125,
-0.71923828125,
-0.4482421875,
-0.420654296875,
0.054931640625,
0.2373046875,
0.49658203125,
0.9140625,
-0.1287841796875,
-0.1319580078125,
-0.923828125,
-0.82275390625,
-0.1641845703125,
-0.421142578125,
-0.40673828125,
... | 24 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make it beautiful.
For example, if n=6 and a = [1, 3, 2, 1, 4, 2], then the following options are possible to make the array a array beautiful:
* Polycarp removes elements at positions 2 and 5, array a becomes equal to [1, 2, 1, 2];
* Polycarp removes elements at positions 1 and 6, array a becomes equal to [3, 2, 1, 4];
* Polycarp removes elements at positions 1, 2 and 6, array a becomes equal to [2, 1, 4];
Help Polycarp determine the minimum number of elements to remove from the array a to make it beautiful.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The first line of each test case consists of one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array a.
The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — array a.
It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.
Output
For each test case, output one integer — the minimum number of elements that Polycarp has to remove from the array a to make it beautiful.
Example
Input
3
6
1 3 2 1 4 2
4
100 100 4 100
8
1 2 3 3 3 2 6 6
Output
2
1
2
Submitted Solution:
```
from sys import stdin, stdout
from collections import defaultdict
import math
def main():
for _ in range(int(stdin.readline())):
n = int(stdin.readline())
arr = list(map(int, stdin.readline().split()))
counter = defaultdict(int)
for x in arr:
counter[x] += 1
cnts = defaultdict(int)
for k,v in counter.items():
cnts[v] += 1
p = []
total = 0
for k,v in cnts.items():
p.append(k)
total += (v * k)
p.sort()
burden = 0
mn = 10 ** 15
for x in reversed(p):
total -= (cnts[x] * x)
mn = min(mn, total + burden)
burden += cnts[x]
stdout.write(str(mn)+"\n")
main()
```
No
| 40,658 | [
0.359375,
0.1561279296875,
0.331787109375,
0.193359375,
-0.677734375,
-0.3974609375,
-0.41748046875,
0.11822509765625,
0.2469482421875,
0.490478515625,
0.9052734375,
-0.1668701171875,
-0.1788330078125,
-0.90380859375,
-0.8212890625,
-0.18115234375,
-0.425048828125,
-0.37841796875,
... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus has got n candies and m friends (n ≥ m). He wants to make a New Year present with candies to each friend. Polycarpus is planning to present all candies and he wants to do this in the fairest (that is, most equal) manner. He wants to choose such ai, where ai is the number of candies in the i-th friend's present, that the maximum ai differs from the least ai as little as possible.
For example, if n is divisible by m, then he is going to present the same number of candies to all his friends, that is, the maximum ai won't differ from the minimum one.
Input
The single line of the input contains a pair of space-separated positive integers n, m (1 ≤ n, m ≤ 100;n ≥ m) — the number of candies and the number of Polycarpus's friends.
Output
Print the required sequence a1, a2, ..., am, where ai is the number of candies in the i-th friend's present. All numbers ai must be positive integers, total up to n, the maximum one should differ from the minimum one by the smallest possible value.
Examples
Input
12 3
Output
4 4 4
Input
15 4
Output
3 4 4 4
Input
18 7
Output
2 2 2 3 3 3 3
Note
Print ai in any order, separate the numbers by spaces.
Tags: implementation
Correct Solution:
```
n, m = [int(i) for i in input().split()]
print(*[n // m + 1 if i < n % m else n // m for i in range(m)])
```
| 42,400 | [
0.385986328125,
0.412353515625,
0.10137939453125,
-0.01123809814453125,
-0.56884765625,
-0.755859375,
-0.2347412109375,
0.174072265625,
0.217529296875,
0.703125,
0.406982421875,
-0.1905517578125,
0.048126220703125,
-0.58642578125,
-0.496337890625,
-0.1168212890625,
-0.8828125,
-0.5... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus has got n candies and m friends (n ≥ m). He wants to make a New Year present with candies to each friend. Polycarpus is planning to present all candies and he wants to do this in the fairest (that is, most equal) manner. He wants to choose such ai, where ai is the number of candies in the i-th friend's present, that the maximum ai differs from the least ai as little as possible.
For example, if n is divisible by m, then he is going to present the same number of candies to all his friends, that is, the maximum ai won't differ from the minimum one.
Input
The single line of the input contains a pair of space-separated positive integers n, m (1 ≤ n, m ≤ 100;n ≥ m) — the number of candies and the number of Polycarpus's friends.
Output
Print the required sequence a1, a2, ..., am, where ai is the number of candies in the i-th friend's present. All numbers ai must be positive integers, total up to n, the maximum one should differ from the minimum one by the smallest possible value.
Examples
Input
12 3
Output
4 4 4
Input
15 4
Output
3 4 4 4
Input
18 7
Output
2 2 2 3 3 3 3
Note
Print ai in any order, separate the numbers by spaces.
Tags: implementation
Correct Solution:
```
m,n=input().split()
m=int(m)
n=int(n)
while(n!=0):
if m%n:
print(int(m/n))
m=m-int(m/n)
n -= 1
else:
for i in range(n):
print(int(m/n))
exit()
```
| 42,401 | [
0.38818359375,
0.44482421875,
0.061370849609375,
-0.045135498046875,
-0.5517578125,
-0.75,
-0.21337890625,
0.16015625,
0.2235107421875,
0.7138671875,
0.372802734375,
-0.153076171875,
0.0220794677734375,
-0.6162109375,
-0.475830078125,
-0.144287109375,
-0.86474609375,
-0.56884765625... | 24 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus has got n candies and m friends (n ≥ m). He wants to make a New Year present with candies to each friend. Polycarpus is planning to present all candies and he wants to do this in the fairest (that is, most equal) manner. He wants to choose such ai, where ai is the number of candies in the i-th friend's present, that the maximum ai differs from the least ai as little as possible.
For example, if n is divisible by m, then he is going to present the same number of candies to all his friends, that is, the maximum ai won't differ from the minimum one.
Input
The single line of the input contains a pair of space-separated positive integers n, m (1 ≤ n, m ≤ 100;n ≥ m) — the number of candies and the number of Polycarpus's friends.
Output
Print the required sequence a1, a2, ..., am, where ai is the number of candies in the i-th friend's present. All numbers ai must be positive integers, total up to n, the maximum one should differ from the minimum one by the smallest possible value.
Examples
Input
12 3
Output
4 4 4
Input
15 4
Output
3 4 4 4
Input
18 7
Output
2 2 2 3 3 3 3
Note
Print ai in any order, separate the numbers by spaces.
Tags: implementation
Correct Solution:
```
n,m=map(int,input().split( ))
a=[]
for i in range(0,m):
a.append(n//m)
n=n%m
for i in range(0,n):
a[i]+=1
for i in a:
print(i,end=' ')
```
| 42,402 | [
0.37255859375,
0.451904296875,
0.06488037109375,
-0.04144287109375,
-0.5625,
-0.73291015625,
-0.278076171875,
0.1651611328125,
0.2017822265625,
0.74072265625,
0.371337890625,
-0.159912109375,
0.1041259765625,
-0.5615234375,
-0.439453125,
-0.11346435546875,
-0.88232421875,
-0.494628... | 24 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.