message stringlengths 2 65.1k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.
You are given user's friends' opinions about a list of items. You are also given a threshold T — the minimal number of "likes" necessary for an item to be recommended to the user.
Output the number of items in the list liked by at least T of user's friends.
Input
The first line of the input will contain three space-separated integers: the number of friends F (1 ≤ F ≤ 10), the number of items I (1 ≤ I ≤ 10) and the threshold T (1 ≤ T ≤ F).
The following F lines of input contain user's friends' opinions. j-th character of i-th line is 'Y' if i-th friend likes j-th item, and 'N' otherwise.
Output
Output an integer — the number of items liked by at least T of user's friends.
Examples
Input
3 3 2
YYY
NNN
YNY
Output
2
Input
4 4 1
NNNY
NNYN
NYNN
YNNN
Output
4 | instruction | 0 | 92,193 | 14 | 184,386 |
Tags: *special
Correct Solution:
```
f, i, t = [int(x) for x in input().split()]
s = [0] * i
for kitten in range(f):
l = input()
for o in range(i):
if l[o] == 'Y':
s[o]+=1
print(sum([1 for x in s if x >= t]))
``` | output | 1 | 92,193 | 14 | 184,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.
You are given user's friends' opinions about a list of items. You are also given a threshold T — the minimal number of "likes" necessary for an item to be recommended to the user.
Output the number of items in the list liked by at least T of user's friends.
Input
The first line of the input will contain three space-separated integers: the number of friends F (1 ≤ F ≤ 10), the number of items I (1 ≤ I ≤ 10) and the threshold T (1 ≤ T ≤ F).
The following F lines of input contain user's friends' opinions. j-th character of i-th line is 'Y' if i-th friend likes j-th item, and 'N' otherwise.
Output
Output an integer — the number of items liked by at least T of user's friends.
Examples
Input
3 3 2
YYY
NNN
YNY
Output
2
Input
4 4 1
NNNY
NNYN
NYNN
YNNN
Output
4 | instruction | 0 | 92,194 | 14 | 184,388 |
Tags: *special
Correct Solution:
```
f,i,t = map(int,input().split())
a = [0] * i
for b in range(f):
u = input().strip()
for q in range(i):
if u[q] == 'Y': a[q] += 1
print(len([_ for _ in a if _ >= t]))
# kitten
# meow~~
``` | output | 1 | 92,194 | 14 | 184,389 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.
You are given user's friends' opinions about a list of items. You are also given a threshold T — the minimal number of "likes" necessary for an item to be recommended to the user.
Output the number of items in the list liked by at least T of user's friends.
Input
The first line of the input will contain three space-separated integers: the number of friends F (1 ≤ F ≤ 10), the number of items I (1 ≤ I ≤ 10) and the threshold T (1 ≤ T ≤ F).
The following F lines of input contain user's friends' opinions. j-th character of i-th line is 'Y' if i-th friend likes j-th item, and 'N' otherwise.
Output
Output an integer — the number of items liked by at least T of user's friends.
Examples
Input
3 3 2
YYY
NNN
YNY
Output
2
Input
4 4 1
NNNY
NNYN
NYNN
YNNN
Output
4
Submitted Solution:
```
f, i, t = map(int, input().split())
q = [0 for x in range(i)]
for g in range(f):
s = input()
for j in range(i):
q[j] += s[j] == 'Y'
kitten = sum([x >= t for x in q])
print(kitten)
``` | instruction | 0 | 92,195 | 14 | 184,390 |
Yes | output | 1 | 92,195 | 14 | 184,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.
You are given user's friends' opinions about a list of items. You are also given a threshold T — the minimal number of "likes" necessary for an item to be recommended to the user.
Output the number of items in the list liked by at least T of user's friends.
Input
The first line of the input will contain three space-separated integers: the number of friends F (1 ≤ F ≤ 10), the number of items I (1 ≤ I ≤ 10) and the threshold T (1 ≤ T ≤ F).
The following F lines of input contain user's friends' opinions. j-th character of i-th line is 'Y' if i-th friend likes j-th item, and 'N' otherwise.
Output
Output an integer — the number of items liked by at least T of user's friends.
Examples
Input
3 3 2
YYY
NNN
YNY
Output
2
Input
4 4 1
NNNY
NNYN
NYNN
YNNN
Output
4
Submitted Solution:
```
#kitten
f,i,t=map(int,input().split())
c=[0]*i
for x in range(f):
s=input()
for y in range(i):
if s[y]=='Y':
c[y]+=1
a = 0
for x in range(i):
if c[x]>=t:
a+=1
print(a)
``` | instruction | 0 | 92,196 | 14 | 184,392 |
Yes | output | 1 | 92,196 | 14 | 184,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.
You are given user's friends' opinions about a list of items. You are also given a threshold T — the minimal number of "likes" necessary for an item to be recommended to the user.
Output the number of items in the list liked by at least T of user's friends.
Input
The first line of the input will contain three space-separated integers: the number of friends F (1 ≤ F ≤ 10), the number of items I (1 ≤ I ≤ 10) and the threshold T (1 ≤ T ≤ F).
The following F lines of input contain user's friends' opinions. j-th character of i-th line is 'Y' if i-th friend likes j-th item, and 'N' otherwise.
Output
Output an integer — the number of items liked by at least T of user's friends.
Examples
Input
3 3 2
YYY
NNN
YNY
Output
2
Input
4 4 1
NNNY
NNYN
NYNN
YNNN
Output
4
Submitted Solution:
```
#kitten
n,k,t=map(int,input().split())
r=range(n)
c=[]
for i in r:
c.append([])
c[-1]=input()
a=0
for j in range(k):
x=0
for i in r:x+=int(c[i][j] == 'Y')
if (x>=t):a+=1
print(a)
``` | instruction | 0 | 92,197 | 14 | 184,394 |
Yes | output | 1 | 92,197 | 14 | 184,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.
You are given user's friends' opinions about a list of items. You are also given a threshold T — the minimal number of "likes" necessary for an item to be recommended to the user.
Output the number of items in the list liked by at least T of user's friends.
Input
The first line of the input will contain three space-separated integers: the number of friends F (1 ≤ F ≤ 10), the number of items I (1 ≤ I ≤ 10) and the threshold T (1 ≤ T ≤ F).
The following F lines of input contain user's friends' opinions. j-th character of i-th line is 'Y' if i-th friend likes j-th item, and 'N' otherwise.
Output
Output an integer — the number of items liked by at least T of user's friends.
Examples
Input
3 3 2
YYY
NNN
YNY
Output
2
Input
4 4 1
NNNY
NNYN
NYNN
YNNN
Output
4
Submitted Solution:
```
n,m,t=map(int,input().split())
k=[1 for i in range(m)]
for i in range(n):
S=input()
for j in range(m):
if S[j]=='Y':
k[j]+=1
x=0
for j in range(m):
if k[j]>t:
x+=1
print(x)
kitten=0
``` | instruction | 0 | 92,198 | 14 | 184,396 |
Yes | output | 1 | 92,198 | 14 | 184,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.
You are given user's friends' opinions about a list of items. You are also given a threshold T — the minimal number of "likes" necessary for an item to be recommended to the user.
Output the number of items in the list liked by at least T of user's friends.
Input
The first line of the input will contain three space-separated integers: the number of friends F (1 ≤ F ≤ 10), the number of items I (1 ≤ I ≤ 10) and the threshold T (1 ≤ T ≤ F).
The following F lines of input contain user's friends' opinions. j-th character of i-th line is 'Y' if i-th friend likes j-th item, and 'N' otherwise.
Output
Output an integer — the number of items liked by at least T of user's friends.
Examples
Input
3 3 2
YYY
NNN
YNY
Output
2
Input
4 4 1
NNNY
NNYN
NYNN
YNNN
Output
4
Submitted Solution:
```
n, m, e = map(int, input().split())
k = [0] * 10
for i in range(n) :
a = input()
for j in range(m) :
if(a[j] == 'Y') : k[j] += 1
ans = 0
for i in range(m) :
if(k[i] >= e) : ans += 1
print(ans)
``` | instruction | 0 | 92,199 | 14 | 184,398 |
No | output | 1 | 92,199 | 14 | 184,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.
You are given user's friends' opinions about a list of items. You are also given a threshold T — the minimal number of "likes" necessary for an item to be recommended to the user.
Output the number of items in the list liked by at least T of user's friends.
Input
The first line of the input will contain three space-separated integers: the number of friends F (1 ≤ F ≤ 10), the number of items I (1 ≤ I ≤ 10) and the threshold T (1 ≤ T ≤ F).
The following F lines of input contain user's friends' opinions. j-th character of i-th line is 'Y' if i-th friend likes j-th item, and 'N' otherwise.
Output
Output an integer — the number of items liked by at least T of user's friends.
Examples
Input
3 3 2
YYY
NNN
YNY
Output
2
Input
4 4 1
NNNY
NNYN
NYNN
YNNN
Output
4
Submitted Solution:
```
s=input().split()
F, I, T = (int(s[i]) for i in range(3))
a=[""]*F
for i in range(F):
a[i]=input()
ans=0
for i in range(I):
cnt= 0
for j in range(F):
if a[j][i]=='Y':
cnt+=1
if cnt>=T:
ans+= 1
print(ans)
``` | instruction | 0 | 92,200 | 14 | 184,400 |
No | output | 1 | 92,200 | 14 | 184,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.
You are given user's friends' opinions about a list of items. You are also given a threshold T — the minimal number of "likes" necessary for an item to be recommended to the user.
Output the number of items in the list liked by at least T of user's friends.
Input
The first line of the input will contain three space-separated integers: the number of friends F (1 ≤ F ≤ 10), the number of items I (1 ≤ I ≤ 10) and the threshold T (1 ≤ T ≤ F).
The following F lines of input contain user's friends' opinions. j-th character of i-th line is 'Y' if i-th friend likes j-th item, and 'N' otherwise.
Output
Output an integer — the number of items liked by at least T of user's friends.
Examples
Input
3 3 2
YYY
NNN
YNY
Output
2
Input
4 4 1
NNNY
NNYN
NYNN
YNNN
Output
4
Submitted Solution:
```
f,i,t = (int(i) for i in input().split())
a = [0]*i
for l in range(f):
s = input()
for m in range(i):
if s[m] =='Y':
a[m]+=1
ans = 0
for j in range(i):
if a[j] >= t:
ans+=1
print(ans)
``` | instruction | 0 | 92,201 | 14 | 184,402 |
No | output | 1 | 92,201 | 14 | 184,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A simple recommendation system would recommend a user things liked by a certain number of their friends. In this problem you will implement part of such a system.
You are given user's friends' opinions about a list of items. You are also given a threshold T — the minimal number of "likes" necessary for an item to be recommended to the user.
Output the number of items in the list liked by at least T of user's friends.
Input
The first line of the input will contain three space-separated integers: the number of friends F (1 ≤ F ≤ 10), the number of items I (1 ≤ I ≤ 10) and the threshold T (1 ≤ T ≤ F).
The following F lines of input contain user's friends' opinions. j-th character of i-th line is 'Y' if i-th friend likes j-th item, and 'N' otherwise.
Output
Output an integer — the number of items liked by at least T of user's friends.
Examples
Input
3 3 2
YYY
NNN
YNY
Output
2
Input
4 4 1
NNNY
NNYN
NYNN
YNNN
Output
4
Submitted Solution:
```
def main():
f, i, t = map(int, input().split())
total = [0] * i
for _ in range(f):
likes = input()
for j in range(i):
if likes[j] == 'Y':
total[j] += 1
# print(total)
print(sum(1 for tot in total if tot >= t))
main()
``` | instruction | 0 | 92,202 | 14 | 184,404 |
No | output | 1 | 92,202 | 14 | 184,405 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value to lower the error.
Kirill has already made his measurements, and has got the following integer values: x1, x2, ..., xn. It is important that the values are close to each other, namely, the difference between the maximum value and the minimum value is at most 2.
Anya does not want to make the measurements, however, she can't just copy the values from Kirill's work, because the error of each measurement is a random value, and this coincidence will be noted by the teacher. Anya wants to write such integer values y1, y2, ..., yn in her work, that the following conditions are met:
* the average value of x1, x2, ..., xn is equal to the average value of y1, y2, ..., yn;
* all Anya's measurements are in the same bounds as all Kirill's measurements, that is, the maximum value among Anya's values is not greater than the maximum value among Kirill's values, and the minimum value among Anya's values is not less than the minimum value among Kirill's values;
* the number of equal measurements in Anya's work and Kirill's work is as small as possible among options with the previous conditions met. Formally, the teacher goes through all Anya's values one by one, if there is equal value in Kirill's work and it is not strike off yet, he strikes off this Anya's value and one of equal values in Kirill's work. The number of equal measurements is then the total number of strike off values in Anya's work.
Help Anya to write such a set of measurements that the conditions above are met.
Input
The first line contains a single integer n (1 ≤ n ≤ 100 000) — the numeber of measurements made by Kirill.
The second line contains a sequence of integers x1, x2, ..., xn ( - 100 000 ≤ xi ≤ 100 000) — the measurements made by Kirill. It is guaranteed that the difference between the maximum and minimum values among values x1, x2, ..., xn does not exceed 2.
Output
In the first line print the minimum possible number of equal measurements.
In the second line print n integers y1, y2, ..., yn — the values Anya should write. You can print the integers in arbitrary order. Keep in mind that the minimum value among Anya's values should be not less that the minimum among Kirill's values, and the maximum among Anya's values should be not greater than the maximum among Kirill's values.
If there are multiple answers, print any of them.
Examples
Input
6
-1 1 1 0 0 -1
Output
2
0 0 0 0 0 0
Input
3
100 100 101
Output
3
101 100 100
Input
7
-10 -9 -10 -8 -10 -9 -9
Output
5
-10 -10 -9 -9 -9 -9 -9
Note
In the first example Anya can write zeros as here measurements results. The average value is then equal to the average value of Kirill's values, and there are only two equal measurements.
In the second example Anya should write two values 100 and one value 101 (in any order), because it is the only possibility to make the average be the equal to the average of Kirill's values. Thus, all three measurements are equal.
In the third example the number of equal measurements is 5. | instruction | 0 | 92,337 | 14 | 184,674 |
Tags: implementation, math
Correct Solution:
```
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
def get_mm(a):
mmin = 1000000
mmax = -1000000
for el in a:
if el> mmax:
mmax = el
if el< mmin:
mmin = el
if mmax - mmin == 2:
break
return mmin, mmax
def sol(a):
b = []
mmin, mmax = get_mm(a)
if mmax - mmin != 2:
return len(a), a
'''if mmax - mmin == 1:
counter = Counter(a)
if counter.get(mmax) > counter.get(mmin):
k = counter.get(mmax)//2
b.extend([mmin] * counter.get(mmin))
b.extend([mmax+1] * k)
b.extend([mmax-1] * k)
b.extend([mmax] * (counter.get(mmax) - 2*k))
else:
k = counter.get(mmin) // 2
b.extend([mmax] * counter.get(mmax))
b.extend([mmin + 1] * k)
b.extend([mmin - 1] * k)
b.extend([mmin] * (counter.get(mmin) - 2 * k))
return len(a) - 2 * k, b
'''
mid_v = mmin + 1
counter = Counter(a)
if not counter.get(mmin+1):
counter[mmin+1] = 0
one = min(counter.get(mmin), counter.get(mmax))
two = counter.get(mmin+1)//2
if one > two:
b.extend([mmin+1] * ((one*2) + counter.get(mmin+1)))
b.extend([mmax] * (counter.get(mmax) - one))
b.extend([mmin] * (counter.get(mmin) - one))
else:
b.extend([mmin+1] * (counter.get(mmin+1) - two*2))
b.extend([mmax] * (counter.get(mmax) + two))
b.extend([mmin] * (counter.get(mmin) + two ))
return len(a)- 2* max(one, two) , b
ans, mas = sol(a)
print(ans)
print(' '.join(list(map(str, mas))))
``` | output | 1 | 92,337 | 14 | 184,675 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value to lower the error.
Kirill has already made his measurements, and has got the following integer values: x1, x2, ..., xn. It is important that the values are close to each other, namely, the difference between the maximum value and the minimum value is at most 2.
Anya does not want to make the measurements, however, she can't just copy the values from Kirill's work, because the error of each measurement is a random value, and this coincidence will be noted by the teacher. Anya wants to write such integer values y1, y2, ..., yn in her work, that the following conditions are met:
* the average value of x1, x2, ..., xn is equal to the average value of y1, y2, ..., yn;
* all Anya's measurements are in the same bounds as all Kirill's measurements, that is, the maximum value among Anya's values is not greater than the maximum value among Kirill's values, and the minimum value among Anya's values is not less than the minimum value among Kirill's values;
* the number of equal measurements in Anya's work and Kirill's work is as small as possible among options with the previous conditions met. Formally, the teacher goes through all Anya's values one by one, if there is equal value in Kirill's work and it is not strike off yet, he strikes off this Anya's value and one of equal values in Kirill's work. The number of equal measurements is then the total number of strike off values in Anya's work.
Help Anya to write such a set of measurements that the conditions above are met.
Input
The first line contains a single integer n (1 ≤ n ≤ 100 000) — the numeber of measurements made by Kirill.
The second line contains a sequence of integers x1, x2, ..., xn ( - 100 000 ≤ xi ≤ 100 000) — the measurements made by Kirill. It is guaranteed that the difference between the maximum and minimum values among values x1, x2, ..., xn does not exceed 2.
Output
In the first line print the minimum possible number of equal measurements.
In the second line print n integers y1, y2, ..., yn — the values Anya should write. You can print the integers in arbitrary order. Keep in mind that the minimum value among Anya's values should be not less that the minimum among Kirill's values, and the maximum among Anya's values should be not greater than the maximum among Kirill's values.
If there are multiple answers, print any of them.
Examples
Input
6
-1 1 1 0 0 -1
Output
2
0 0 0 0 0 0
Input
3
100 100 101
Output
3
101 100 100
Input
7
-10 -9 -10 -8 -10 -9 -9
Output
5
-10 -10 -9 -9 -9 -9 -9
Note
In the first example Anya can write zeros as here measurements results. The average value is then equal to the average value of Kirill's values, and there are only two equal measurements.
In the second example Anya should write two values 100 and one value 101 (in any order), because it is the only possibility to make the average be the equal to the average of Kirill's values. Thus, all three measurements are equal.
In the third example the number of equal measurements is 5. | instruction | 0 | 92,338 | 14 | 184,676 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
d=dict()
l.sort()
d.update({l[0]+1:0})
for i in range(n):
if l[i] not in d:
d.update({l[i]:1})
else:
d[l[i]]+=1
if l[0]+1>=l[-1]:
print(n)
print(*l,sep=" ")
else:
a=d[l[0]]
c=d[l[-1]]
b=d[l[0]+1]
b+=2*min(a,c)
r=min(a,c)
a-=min(a,c)
c-=r
ans=[0]*n
for i in range(a):
ans[i]=l[0]
for i in range(b):
ans[i+a]=l[0]+1
for i in range(c):
ans[i+a+b]=l[-1]
#print(a,b,c)
dw=min(d[l[0]],a)+min(d[l[0]+1],b)+min(d[l[-1]],c)
#print(dw)
a=d[l[0]]+(d[l[0]+1]//2)
c=d[l[-1]]+(d[l[0]+1]//2)
b=d[l[0]+1]%2
ans1=[0]*n
tre=0
for i in range(a):
ans1[tre]=l[0]
tre+=1
for i in range(b):
ans1[tre]=l[0]+1
tre+=1
for i in range(c):
ans1[tre]=l[-1]
tre+=1
#print(a,b,c)
dw1=min(d[l[0]],a)+min(d[l[0]+1],b)+min(d[l[-1]],c)
if dw<dw1:
print(dw)
print(*ans,sep=" ")
else:
print(dw1)
print(*ans1,sep=" ")
``` | output | 1 | 92,338 | 14 | 184,677 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value to lower the error.
Kirill has already made his measurements, and has got the following integer values: x1, x2, ..., xn. It is important that the values are close to each other, namely, the difference between the maximum value and the minimum value is at most 2.
Anya does not want to make the measurements, however, she can't just copy the values from Kirill's work, because the error of each measurement is a random value, and this coincidence will be noted by the teacher. Anya wants to write such integer values y1, y2, ..., yn in her work, that the following conditions are met:
* the average value of x1, x2, ..., xn is equal to the average value of y1, y2, ..., yn;
* all Anya's measurements are in the same bounds as all Kirill's measurements, that is, the maximum value among Anya's values is not greater than the maximum value among Kirill's values, and the minimum value among Anya's values is not less than the minimum value among Kirill's values;
* the number of equal measurements in Anya's work and Kirill's work is as small as possible among options with the previous conditions met. Formally, the teacher goes through all Anya's values one by one, if there is equal value in Kirill's work and it is not strike off yet, he strikes off this Anya's value and one of equal values in Kirill's work. The number of equal measurements is then the total number of strike off values in Anya's work.
Help Anya to write such a set of measurements that the conditions above are met.
Input
The first line contains a single integer n (1 ≤ n ≤ 100 000) — the numeber of measurements made by Kirill.
The second line contains a sequence of integers x1, x2, ..., xn ( - 100 000 ≤ xi ≤ 100 000) — the measurements made by Kirill. It is guaranteed that the difference between the maximum and minimum values among values x1, x2, ..., xn does not exceed 2.
Output
In the first line print the minimum possible number of equal measurements.
In the second line print n integers y1, y2, ..., yn — the values Anya should write. You can print the integers in arbitrary order. Keep in mind that the minimum value among Anya's values should be not less that the minimum among Kirill's values, and the maximum among Anya's values should be not greater than the maximum among Kirill's values.
If there are multiple answers, print any of them.
Examples
Input
6
-1 1 1 0 0 -1
Output
2
0 0 0 0 0 0
Input
3
100 100 101
Output
3
101 100 100
Input
7
-10 -9 -10 -8 -10 -9 -9
Output
5
-10 -10 -9 -9 -9 -9 -9
Note
In the first example Anya can write zeros as here measurements results. The average value is then equal to the average value of Kirill's values, and there are only two equal measurements.
In the second example Anya should write two values 100 and one value 101 (in any order), because it is the only possibility to make the average be the equal to the average of Kirill's values. Thus, all three measurements are equal.
In the third example the number of equal measurements is 5. | instruction | 0 | 92,339 | 14 | 184,678 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
a.sort()
sr = sum(a) / n
x = []
min1 = min(a)
max1 = max(a)
targ = False
if min1 + 2 != max1:
print(n)
print(*a)
min1 = int(sr) - 1
max1 = int(sr) + 1
else:
sred = (min1 + max1) // 2
i = 0
k = 0
u = [0, 0, 0]
for j in a:
if j == min1:
u[0] += 1
elif j == max1:
u[1] += 1
else:
u[2] += 1
if (min(u[0], u[1]) * 2 > u[2]):
while min1 == a[k] and max1 == a[-1-k]:
x += [sred, sred]
a[k] = -200001
a[-1-k] = -200001
i += 2
k += 1
print(n - i)
for j in a:
if j != -200001:
x += [j]
print(*x)
else:
k = u[2] - u[2] % 2
while u[2] > 1:
u[2] -= 2
x += [min1, max1]
if u[2] > 0:
x += [sred]
print(n - k)
for i in range(u[0]):
x += [min1]
for i in range(u[1]):
x += [max1]
print(*x)
``` | output | 1 | 92,339 | 14 | 184,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value to lower the error.
Kirill has already made his measurements, and has got the following integer values: x1, x2, ..., xn. It is important that the values are close to each other, namely, the difference between the maximum value and the minimum value is at most 2.
Anya does not want to make the measurements, however, she can't just copy the values from Kirill's work, because the error of each measurement is a random value, and this coincidence will be noted by the teacher. Anya wants to write such integer values y1, y2, ..., yn in her work, that the following conditions are met:
* the average value of x1, x2, ..., xn is equal to the average value of y1, y2, ..., yn;
* all Anya's measurements are in the same bounds as all Kirill's measurements, that is, the maximum value among Anya's values is not greater than the maximum value among Kirill's values, and the minimum value among Anya's values is not less than the minimum value among Kirill's values;
* the number of equal measurements in Anya's work and Kirill's work is as small as possible among options with the previous conditions met. Formally, the teacher goes through all Anya's values one by one, if there is equal value in Kirill's work and it is not strike off yet, he strikes off this Anya's value and one of equal values in Kirill's work. The number of equal measurements is then the total number of strike off values in Anya's work.
Help Anya to write such a set of measurements that the conditions above are met.
Input
The first line contains a single integer n (1 ≤ n ≤ 100 000) — the numeber of measurements made by Kirill.
The second line contains a sequence of integers x1, x2, ..., xn ( - 100 000 ≤ xi ≤ 100 000) — the measurements made by Kirill. It is guaranteed that the difference between the maximum and minimum values among values x1, x2, ..., xn does not exceed 2.
Output
In the first line print the minimum possible number of equal measurements.
In the second line print n integers y1, y2, ..., yn — the values Anya should write. You can print the integers in arbitrary order. Keep in mind that the minimum value among Anya's values should be not less that the minimum among Kirill's values, and the maximum among Anya's values should be not greater than the maximum among Kirill's values.
If there are multiple answers, print any of them.
Examples
Input
6
-1 1 1 0 0 -1
Output
2
0 0 0 0 0 0
Input
3
100 100 101
Output
3
101 100 100
Input
7
-10 -9 -10 -8 -10 -9 -9
Output
5
-10 -10 -9 -9 -9 -9 -9
Note
In the first example Anya can write zeros as here measurements results. The average value is then equal to the average value of Kirill's values, and there are only two equal measurements.
In the second example Anya should write two values 100 and one value 101 (in any order), because it is the only possibility to make the average be the equal to the average of Kirill's values. Thus, all three measurements are equal.
In the third example the number of equal measurements is 5. | instruction | 0 | 92,340 | 14 | 184,680 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
x=input().split()
x=[int(k) for k in x]
rem=[]
x.sort()
mn = x[0]
mx = x[-1]
if (mx-mn<=1):
print(len(x))
for k in x:
print(k, end=' ')
print()
else:
avg=mn+1
expsum = avg*len(x)
sm=0
countmn=0
countavg=0
countmx=0
for k in x:
sm+=k
if (sm-expsum)>0:
rem=x[len(x)-(sm-expsum):len(x)]
x=x[0:len(x)-(sm-expsum)]
if (sm-expsum)<0:
rem=x[0:(expsum-sm)]
x=x[(expsum-sm):len(x)]
if len(x)%2==1:
rem.append(avg)
for i in range(len(x)):
if (x[i]==avg):
x=x[0:i]+x[i+1:len(x)]
break
for k in x:
if k==mn:
countmn+=1
if k==avg:
countavg+=1
if k==mx:
countmx+=1
if countmn+countmx<countavg:
print(countmn+countmx+len(rem))
for i in range(int(len(x)/2)):
rem.append(mn)
rem.append(mx)
else:
print(countavg+len(rem))
for i in range(len(x)):
rem.append(avg)
for k in rem:
print(k, end=' ')
print()
``` | output | 1 | 92,340 | 14 | 184,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value to lower the error.
Kirill has already made his measurements, and has got the following integer values: x1, x2, ..., xn. It is important that the values are close to each other, namely, the difference between the maximum value and the minimum value is at most 2.
Anya does not want to make the measurements, however, she can't just copy the values from Kirill's work, because the error of each measurement is a random value, and this coincidence will be noted by the teacher. Anya wants to write such integer values y1, y2, ..., yn in her work, that the following conditions are met:
* the average value of x1, x2, ..., xn is equal to the average value of y1, y2, ..., yn;
* all Anya's measurements are in the same bounds as all Kirill's measurements, that is, the maximum value among Anya's values is not greater than the maximum value among Kirill's values, and the minimum value among Anya's values is not less than the minimum value among Kirill's values;
* the number of equal measurements in Anya's work and Kirill's work is as small as possible among options with the previous conditions met. Formally, the teacher goes through all Anya's values one by one, if there is equal value in Kirill's work and it is not strike off yet, he strikes off this Anya's value and one of equal values in Kirill's work. The number of equal measurements is then the total number of strike off values in Anya's work.
Help Anya to write such a set of measurements that the conditions above are met.
Input
The first line contains a single integer n (1 ≤ n ≤ 100 000) — the numeber of measurements made by Kirill.
The second line contains a sequence of integers x1, x2, ..., xn ( - 100 000 ≤ xi ≤ 100 000) — the measurements made by Kirill. It is guaranteed that the difference between the maximum and minimum values among values x1, x2, ..., xn does not exceed 2.
Output
In the first line print the minimum possible number of equal measurements.
In the second line print n integers y1, y2, ..., yn — the values Anya should write. You can print the integers in arbitrary order. Keep in mind that the minimum value among Anya's values should be not less that the minimum among Kirill's values, and the maximum among Anya's values should be not greater than the maximum among Kirill's values.
If there are multiple answers, print any of them.
Examples
Input
6
-1 1 1 0 0 -1
Output
2
0 0 0 0 0 0
Input
3
100 100 101
Output
3
101 100 100
Input
7
-10 -9 -10 -8 -10 -9 -9
Output
5
-10 -10 -9 -9 -9 -9 -9
Note
In the first example Anya can write zeros as here measurements results. The average value is then equal to the average value of Kirill's values, and there are only two equal measurements.
In the second example Anya should write two values 100 and one value 101 (in any order), because it is the only possibility to make the average be the equal to the average of Kirill's values. Thus, all three measurements are equal.
In the third example the number of equal measurements is 5. | instruction | 0 | 92,341 | 14 | 184,682 |
Tags: implementation, math
Correct Solution:
```
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
if count[2] == 0:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
print(n - max(2*pairsOfZerosToSwap, 2*pairsOfOnesToSwap))
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = [x+y for x, y in zip(count, [-pairsOfOnesToSwap, 2*pairsOfOnesToSwap, -pairsOfOnesToSwap])]
else:
count = [x+y for x, y in zip(count, [pairsOfZerosToSwap, -2*pairsOfZerosToSwap, pairsOfZerosToSwap])]
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main()
``` | output | 1 | 92,341 | 14 | 184,683 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value to lower the error.
Kirill has already made his measurements, and has got the following integer values: x1, x2, ..., xn. It is important that the values are close to each other, namely, the difference between the maximum value and the minimum value is at most 2.
Anya does not want to make the measurements, however, she can't just copy the values from Kirill's work, because the error of each measurement is a random value, and this coincidence will be noted by the teacher. Anya wants to write such integer values y1, y2, ..., yn in her work, that the following conditions are met:
* the average value of x1, x2, ..., xn is equal to the average value of y1, y2, ..., yn;
* all Anya's measurements are in the same bounds as all Kirill's measurements, that is, the maximum value among Anya's values is not greater than the maximum value among Kirill's values, and the minimum value among Anya's values is not less than the minimum value among Kirill's values;
* the number of equal measurements in Anya's work and Kirill's work is as small as possible among options with the previous conditions met. Formally, the teacher goes through all Anya's values one by one, if there is equal value in Kirill's work and it is not strike off yet, he strikes off this Anya's value and one of equal values in Kirill's work. The number of equal measurements is then the total number of strike off values in Anya's work.
Help Anya to write such a set of measurements that the conditions above are met.
Input
The first line contains a single integer n (1 ≤ n ≤ 100 000) — the numeber of measurements made by Kirill.
The second line contains a sequence of integers x1, x2, ..., xn ( - 100 000 ≤ xi ≤ 100 000) — the measurements made by Kirill. It is guaranteed that the difference between the maximum and minimum values among values x1, x2, ..., xn does not exceed 2.
Output
In the first line print the minimum possible number of equal measurements.
In the second line print n integers y1, y2, ..., yn — the values Anya should write. You can print the integers in arbitrary order. Keep in mind that the minimum value among Anya's values should be not less that the minimum among Kirill's values, and the maximum among Anya's values should be not greater than the maximum among Kirill's values.
If there are multiple answers, print any of them.
Examples
Input
6
-1 1 1 0 0 -1
Output
2
0 0 0 0 0 0
Input
3
100 100 101
Output
3
101 100 100
Input
7
-10 -9 -10 -8 -10 -9 -9
Output
5
-10 -10 -9 -9 -9 -9 -9
Note
In the first example Anya can write zeros as here measurements results. The average value is then equal to the average value of Kirill's values, and there are only two equal measurements.
In the second example Anya should write two values 100 and one value 101 (in any order), because it is the only possibility to make the average be the equal to the average of Kirill's values. Thus, all three measurements are equal.
In the third example the number of equal measurements is 5. | instruction | 0 | 92,342 | 14 | 184,684 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
x=input()
a=list(map(int,x.split()))
if max(a)-min(a)<2:
print(n)
print(x)
exit()
s=set(a)
q=min(a)
s=max(a)
r=q+1
m={}
m[q]=m[s]=m[r]=0
for i in a:m[i]+=1
if n-2*min(m[q],m[s])<n-m[r]//2*2:
print(n-2*min(m[q],m[s]))
e=min(m[q],m[s])
m[r]+=e+e
m[q]-=e
m[s]-=e
else:
print(n-m[r]//2*2)
e=m[r]//2
m[r]-=e+e
m[q]+=e
m[s]+=e
b=[r for i in range(m[r])]
b=b+[q for i in range(m[q])]
b=b+[s for i in range(m[s])]
print(*b)
# Made By Mostafa_Khaled
``` | output | 1 | 92,342 | 14 | 184,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value to lower the error.
Kirill has already made his measurements, and has got the following integer values: x1, x2, ..., xn. It is important that the values are close to each other, namely, the difference between the maximum value and the minimum value is at most 2.
Anya does not want to make the measurements, however, she can't just copy the values from Kirill's work, because the error of each measurement is a random value, and this coincidence will be noted by the teacher. Anya wants to write such integer values y1, y2, ..., yn in her work, that the following conditions are met:
* the average value of x1, x2, ..., xn is equal to the average value of y1, y2, ..., yn;
* all Anya's measurements are in the same bounds as all Kirill's measurements, that is, the maximum value among Anya's values is not greater than the maximum value among Kirill's values, and the minimum value among Anya's values is not less than the minimum value among Kirill's values;
* the number of equal measurements in Anya's work and Kirill's work is as small as possible among options with the previous conditions met. Formally, the teacher goes through all Anya's values one by one, if there is equal value in Kirill's work and it is not strike off yet, he strikes off this Anya's value and one of equal values in Kirill's work. The number of equal measurements is then the total number of strike off values in Anya's work.
Help Anya to write such a set of measurements that the conditions above are met.
Input
The first line contains a single integer n (1 ≤ n ≤ 100 000) — the numeber of measurements made by Kirill.
The second line contains a sequence of integers x1, x2, ..., xn ( - 100 000 ≤ xi ≤ 100 000) — the measurements made by Kirill. It is guaranteed that the difference between the maximum and minimum values among values x1, x2, ..., xn does not exceed 2.
Output
In the first line print the minimum possible number of equal measurements.
In the second line print n integers y1, y2, ..., yn — the values Anya should write. You can print the integers in arbitrary order. Keep in mind that the minimum value among Anya's values should be not less that the minimum among Kirill's values, and the maximum among Anya's values should be not greater than the maximum among Kirill's values.
If there are multiple answers, print any of them.
Examples
Input
6
-1 1 1 0 0 -1
Output
2
0 0 0 0 0 0
Input
3
100 100 101
Output
3
101 100 100
Input
7
-10 -9 -10 -8 -10 -9 -9
Output
5
-10 -10 -9 -9 -9 -9 -9
Note
In the first example Anya can write zeros as here measurements results. The average value is then equal to the average value of Kirill's values, and there are only two equal measurements.
In the second example Anya should write two values 100 and one value 101 (in any order), because it is the only possibility to make the average be the equal to the average of Kirill's values. Thus, all three measurements are equal.
In the third example the number of equal measurements is 5. | instruction | 0 | 92,343 | 14 | 184,686 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
l = list(map(int, input().split(' ')))
s = sum(l) // len(l)
mn, mx = min(l), max(l)
if mx - mn <= 1:
print(n)
for i in l:
print(i, end=' ')
else:
a, b, c = l.count(mn), l.count(mn + 1), l.count(mx)
a1, b1, c1 = a - min(a, c), b + 2 * min(a, c), c - min(a, c)
a2, b2, c2 = a + b // 2, b % 2, c + b // 2
diff1 = min(a, a1) + min(b, b1) + min(c, c1)
diff2 = min(a, a2) + min(b, b2) + min(c, c2)
if diff1 <= diff2:
print(diff1)
s = (str(mn) + ' ') * a1 + (str(mn + 1) + ' ') * b1 + (str(mx) + ' ') * c1
s = s[:-1]
print(s)
else:
print(diff2)
s = (str(mn) + ' ') * a2 + (str(mn + 1) + ' ') * b2 + (str(mx) + ' ') * c2
s = s[:-1]
print(s)
``` | output | 1 | 92,343 | 14 | 184,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value to lower the error.
Kirill has already made his measurements, and has got the following integer values: x1, x2, ..., xn. It is important that the values are close to each other, namely, the difference between the maximum value and the minimum value is at most 2.
Anya does not want to make the measurements, however, she can't just copy the values from Kirill's work, because the error of each measurement is a random value, and this coincidence will be noted by the teacher. Anya wants to write such integer values y1, y2, ..., yn in her work, that the following conditions are met:
* the average value of x1, x2, ..., xn is equal to the average value of y1, y2, ..., yn;
* all Anya's measurements are in the same bounds as all Kirill's measurements, that is, the maximum value among Anya's values is not greater than the maximum value among Kirill's values, and the minimum value among Anya's values is not less than the minimum value among Kirill's values;
* the number of equal measurements in Anya's work and Kirill's work is as small as possible among options with the previous conditions met. Formally, the teacher goes through all Anya's values one by one, if there is equal value in Kirill's work and it is not strike off yet, he strikes off this Anya's value and one of equal values in Kirill's work. The number of equal measurements is then the total number of strike off values in Anya's work.
Help Anya to write such a set of measurements that the conditions above are met.
Input
The first line contains a single integer n (1 ≤ n ≤ 100 000) — the numeber of measurements made by Kirill.
The second line contains a sequence of integers x1, x2, ..., xn ( - 100 000 ≤ xi ≤ 100 000) — the measurements made by Kirill. It is guaranteed that the difference between the maximum and minimum values among values x1, x2, ..., xn does not exceed 2.
Output
In the first line print the minimum possible number of equal measurements.
In the second line print n integers y1, y2, ..., yn — the values Anya should write. You can print the integers in arbitrary order. Keep in mind that the minimum value among Anya's values should be not less that the minimum among Kirill's values, and the maximum among Anya's values should be not greater than the maximum among Kirill's values.
If there are multiple answers, print any of them.
Examples
Input
6
-1 1 1 0 0 -1
Output
2
0 0 0 0 0 0
Input
3
100 100 101
Output
3
101 100 100
Input
7
-10 -9 -10 -8 -10 -9 -9
Output
5
-10 -10 -9 -9 -9 -9 -9
Note
In the first example Anya can write zeros as here measurements results. The average value is then equal to the average value of Kirill's values, and there are only two equal measurements.
In the second example Anya should write two values 100 and one value 101 (in any order), because it is the only possibility to make the average be the equal to the average of Kirill's values. Thus, all three measurements are equal.
In the third example the number of equal measurements is 5. | instruction | 0 | 92,344 | 14 | 184,688 |
Tags: implementation, math
Correct Solution:
```
# -*- coding: utf-8 -*-
from collections import defaultdict
def problem():
def count_collisions(lows, mids, his):
return min(xs_low, lows) + min(xs_mid, mids) + min(xs_hi, his)
in1 = int(input())
in2 = input()
# in1 = 2
# in2 = '2 0'
#
# in1 = 6
# in2 = '-1 1 1 0 0 -1'
#
# in1 = 3
# in2 = '100 100 101'
#
# in1 = 7
# in2 = '-10 -9 -10 -8 -10 -9 -9'
n = in1
xs = list(map(int, in2.split()));
d = defaultdict(int)
for x in xs:
d[x] += 1
keys = sorted(list(d.keys()))
if len(keys) == 1:
return '{0}\n{1}'.format(n, in2)
diff = keys[1] - keys[0]
if len(keys) == 2 and diff == 1:
return '{0}\n{1}'.format(n, in2)
if len(keys) == 2 and diff == 2:
keys.append(keys[0] + 1)
keys.sort()
d[keys[1]] = 0
xs_low = d[keys[0]]
xs_mid = d[keys[1]]
xs_hi = d[keys[2]]
total = -xs_low + xs_hi
if total < 0:
lows = abs(total)
mids = n - lows
his = 0
if total > 0:
lows = 0
his = total
mids = n - total
if total == 0:
lows = 0
mids = n
his = 0
min_collisions = count_collisions(lows, mids, his)
lo = lows
md = mids
hi = his
while mids >= 2:
lows = lows + 1
mids = mids - 2
his = his + 1
collisions = count_collisions(lows, mids, his)
if (collisions < min_collisions):
min_collisions = collisions
lo = lows
md = mids
hi = his
return '{0}\n{1} {2} {3}'.format(
min_collisions,
' '.join(map(str, lo * [keys[0]])),
' '.join(map(str, md * [keys[1]])),
' '.join(map(str, hi * [keys[2]])))
print(problem())
#problem()
``` | output | 1 | 92,344 | 14 | 184,689 |
Provide a correct Python 3 solution for this coding contest problem.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0 | instruction | 0 | 92,401 | 14 | 184,802 |
"Correct Solution:
```
a = int(input())
b = list(map(int,input().split()))
c = [0]*a
for i in b:
c[i-1] += 1
for i in c:
print(i)
``` | output | 1 | 92,401 | 14 | 184,803 |
Provide a correct Python 3 solution for this coding contest problem.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0 | instruction | 0 | 92,402 | 14 | 184,804 |
"Correct Solution:
```
n=int(input())
buka = [0]*n
for joushi in input().split():
buka[int(joushi)-1] += 1
print(*buka,sep='\n')
``` | output | 1 | 92,402 | 14 | 184,805 |
Provide a correct Python 3 solution for this coding contest problem.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0 | instruction | 0 | 92,403 | 14 | 184,806 |
"Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
rank=[0]*n
for i in a:
rank[i-1]+=1
for i in rank:
print(i)
``` | output | 1 | 92,403 | 14 | 184,807 |
Provide a correct Python 3 solution for this coding contest problem.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0 | instruction | 0 | 92,404 | 14 | 184,808 |
"Correct Solution:
```
N = int(input())
B = [0] * N
for a in input().split():
B[int(a)-1] += 1
for b in B:
print(b)
``` | output | 1 | 92,404 | 14 | 184,809 |
Provide a correct Python 3 solution for this coding contest problem.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0 | instruction | 0 | 92,405 | 14 | 184,810 |
"Correct Solution:
```
N=int(input())
A=list(map(int,input().split()))
B=[0]*N
for i in A:
B[i-1]+=1
for i in B:
print(i)
``` | output | 1 | 92,405 | 14 | 184,811 |
Provide a correct Python 3 solution for this coding contest problem.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0 | instruction | 0 | 92,406 | 14 | 184,812 |
"Correct Solution:
```
N=int(input())
A=list(map(int,input().split()))
x=[0]*N
for i in A:
x[i-1]+=1
for j in x:
print(j)
``` | output | 1 | 92,406 | 14 | 184,813 |
Provide a correct Python 3 solution for this coding contest problem.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0 | instruction | 0 | 92,407 | 14 | 184,814 |
"Correct Solution:
```
n=int(input())
r=[0]*n
j=list(map(int, input().split()))
for i in j:
r[i-1]+=1
for i in r:
print(i)
``` | output | 1 | 92,407 | 14 | 184,815 |
Provide a correct Python 3 solution for this coding contest problem.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0 | instruction | 0 | 92,408 | 14 | 184,816 |
"Correct Solution:
```
n=int(input())
j=[0]*n
*a,=map(int,input().split())
for i in a:
j[i-1]+=1
for i in range(n):
print(j[i])
``` | output | 1 | 92,408 | 14 | 184,817 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0
Submitted Solution:
```
n,*a=map(int,open(0).read().split())
l=[0 for i in range(n)]
for i in a:
l[i-1]+=1
print('\n'.join(map(str,l)))
``` | instruction | 0 | 92,409 | 14 | 184,818 |
Yes | output | 1 | 92,409 | 14 | 184,819 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0
Submitted Solution:
```
n=int(input())
l=list(map(int,input().split()))
a=[0]*n
for i in l:
a[i-1]+=1
for i in a:
print(i)
``` | instruction | 0 | 92,410 | 14 | 184,820 |
Yes | output | 1 | 92,410 | 14 | 184,821 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0
Submitted Solution:
```
n = int(input())
a = list(map(int, input().split()))
d = [0]*n
for i in a:
d[i-1] += 1
for i in d:
print(i)
``` | instruction | 0 | 92,411 | 14 | 184,822 |
Yes | output | 1 | 92,411 | 14 | 184,823 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0
Submitted Solution:
```
N=int(input())
A=[int(v) for v in input().split()]
B = [0]*(N+1)
for a in A:
B[a]+=1
for b in B[1:]:
print(b)
``` | instruction | 0 | 92,412 | 14 | 184,824 |
Yes | output | 1 | 92,412 | 14 | 184,825 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0
Submitted Solution:
```
N = int(input())
A = list(input().split())
B = [0 for i in range(N)]
for i in range (N-1):
for j in range (1,N+1):
if int(A[i])==j:
B[j-1]=B[j-1]+1
[print(i) for i in B]
``` | instruction | 0 | 92,413 | 14 | 184,826 |
No | output | 1 | 92,413 | 14 | 184,827 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0
Submitted Solution:
```
I = [input() for i in range(2)]
N = int(I[0])
A = list(map(int,I[1].split()))
for i in range(N+1) :
c = A.count(i)
if i > 0 :
print(c)
``` | instruction | 0 | 92,414 | 14 | 184,828 |
No | output | 1 | 92,414 | 14 | 184,829 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0
Submitted Solution:
```
N = int(input())
D = {i: [] for i in range(N)}
A = list(map(int, input().split()))
for i in range(N-1):
D[i].append(A[i]-1)
for i in range(N):
print(len(D[i]))
``` | instruction | 0 | 92,415 | 14 | 184,830 |
No | output | 1 | 92,415 | 14 | 184,831 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A company has N members, who are assigned ID numbers 1, ..., N.
Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.
When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.
You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i < i
Input
Input is given from Standard Input in the following format:
N
A_2 ... A_N
Output
For each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.
Examples
Input
5
1 1 2 2
Output
2
2
0
0
0
Input
10
1 1 1 1 1 1 1 1 1
Output
9
0
0
0
0
0
0
0
0
0
Input
7
1 2 3 4 5 6
Output
1
1
1
1
1
1
0
Submitted Solution:
```
n=int(input())
p=list(map(int,input().split()))
li=[]
for i in range(1,n):
q=p.count(i)
li.append(q)
nl=li.split("\n")
print(nl)
``` | instruction | 0 | 92,416 | 14 | 184,832 |
No | output | 1 | 92,416 | 14 | 184,833 |
Provide a correct Python 3 solution for this coding contest problem.
Saying that it is not surprising that people want to know about their love, she has checked up his address, name, age, phone number, hometown, medical history, political party and even his sleeping position, every piece of his personal information. The word "privacy" is not in her dictionary. A person like her is called "stoker" or "yandere", but it doesn't mean much to her.
To know about him, she set up spyware to his PC. This spyware can record his mouse operations while he is browsing websites. After a while, she could successfully obtain the record from the spyware in absolute secrecy.
Well, we want you to write a program which extracts web pages he visited from the records.
All pages have the same size H × W where upper-left corner is (0, 0) and lower right corner is (W, H). A page includes several (or many) rectangular buttons (parallel to the page). Each button has a link to another page, and when a button is clicked the browser leads you to the corresponding page.
His browser manages history and the current page in the following way:
The browser has a buffer of 1-dimensional array with enough capacity to store pages, and a pointer to indicate a page in the buffer. A page indicated by the pointer is shown on the browser. At first, a predetermined page is stored and the pointer indicates that page. When the link button is clicked, all pages recorded in the right side from the pointer are removed from the buffer. Then, the page indicated by the link button is stored into the right-most position of the buffer, and the pointer moves to right. As a result, the user browse the page indicated by the button.
The browser also has special buttons 'back to the previous page' (back button) and 'forward to the next page' (forward button). When the user clicks the back button, the pointer moves to left, and the user clicks the forward button, the pointer moves to right. But in both cases, if there are no such pages in the buffer, nothing happen.
The record consists of the following operations:
click x y
It means to click (x, y). If there is a button on the point (x, y), he moved to the corresponding page. If there is nothing in the point, nothing happen. The button is clicked if x1 ≤ x ≤ x2 and y1 ≤ y ≤ y2 where x1, x2 means the leftmost and rightmost coordinate and y1, y2 means the topmost and bottommost coordinate of the corresponding button respectively.
back
It means to click the Back button.
forward
It means to click the Forward button.
In addition, there is a special operation show. Your program should print the name of current page for each show operation.
By the way, setting spyware into computers of others may conflict with the law. Do not attempt, or you will be reprimanded by great men.
Constraints
* 1 ≤ n ≤ 100
* b[i] ≤ 100
* 1 ≤ the number of characters in the name ≤ 20
* Buttons are not touch, overlapped nor run over from the browser.
Input
Input consists of several datasets.
Each dataset starts with an integer n which represents the number of pages in the dataset.
Next line contains two integers W and H.
Next, information of each page are given. Each page starts with a string of characters and b[i], the number of buttons the page has. Following b[i] lines give information of buttons. Each button consists of four integers representing the coordinate (x1, y1) of upper left corner and the coordinate (x2, y2) of lower right corner of the button and a string of characters, which represents the name of page that the link of the button represents.
Next, the number of operation m is given. Following m lines represent the record of operations. Please see the above description for the operation.
The first page is stored in the buffer at first.
Input ends when n = 0.
Output
For each dataset, output the name of current page for each show operation.
Example
Input
3
800 600
index 1
500 100 700 200 profile
profile 2
100 100 400 200 index
100 400 400 500 link
link 1
100 100 300 200 index
9
click 600 150
show
click 200 450
show
back
back
show
forward
show
0
Output
profile
link
index
profile | instruction | 0 | 92,556 | 14 | 185,112 |
"Correct Solution:
```
# AOJ 1054: Distorted Love
# Python3 2018.7.7 bal4u
while True:
n = int(input())
if n == 0: break
input() # w, h
pag, dic = [], {}
for i in range(n):
nm, k = input().split()
dic[nm] = i
btn = []
for j in range(int(k)):
x1, y1, x2, y2, bnm = input().split()
btn.append((int(x1), int(y1), int(x2), int(y2), bnm))
pag.append((nm, btn))
buf = [0]*2000
now, sz = 0, 1
m = int(input())
for i in range(m):
a = input().split()
if a[0] == "back":
if now > 0: now -= 1
elif a[0] == "forward":
if now < sz-1: now += 1
elif a[0] == "show": print(pag[buf[now]][0])
else: # click
x, y = int(a[1]), int(a[2])
btn = pag[buf[now]][1]
for x1, y1, x2, y2, nm in btn:
if x1 <= x and x <= x2 and y1 <= y and y <= y2:
now += 1
buf[now] = dic[nm]
sz = now+1
break
``` | output | 1 | 92,556 | 14 | 185,113 |
Provide a correct Python 3 solution for this coding contest problem.
Saying that it is not surprising that people want to know about their love, she has checked up his address, name, age, phone number, hometown, medical history, political party and even his sleeping position, every piece of his personal information. The word "privacy" is not in her dictionary. A person like her is called "stoker" or "yandere", but it doesn't mean much to her.
To know about him, she set up spyware to his PC. This spyware can record his mouse operations while he is browsing websites. After a while, she could successfully obtain the record from the spyware in absolute secrecy.
Well, we want you to write a program which extracts web pages he visited from the records.
All pages have the same size H × W where upper-left corner is (0, 0) and lower right corner is (W, H). A page includes several (or many) rectangular buttons (parallel to the page). Each button has a link to another page, and when a button is clicked the browser leads you to the corresponding page.
His browser manages history and the current page in the following way:
The browser has a buffer of 1-dimensional array with enough capacity to store pages, and a pointer to indicate a page in the buffer. A page indicated by the pointer is shown on the browser. At first, a predetermined page is stored and the pointer indicates that page. When the link button is clicked, all pages recorded in the right side from the pointer are removed from the buffer. Then, the page indicated by the link button is stored into the right-most position of the buffer, and the pointer moves to right. As a result, the user browse the page indicated by the button.
The browser also has special buttons 'back to the previous page' (back button) and 'forward to the next page' (forward button). When the user clicks the back button, the pointer moves to left, and the user clicks the forward button, the pointer moves to right. But in both cases, if there are no such pages in the buffer, nothing happen.
The record consists of the following operations:
click x y
It means to click (x, y). If there is a button on the point (x, y), he moved to the corresponding page. If there is nothing in the point, nothing happen. The button is clicked if x1 ≤ x ≤ x2 and y1 ≤ y ≤ y2 where x1, x2 means the leftmost and rightmost coordinate and y1, y2 means the topmost and bottommost coordinate of the corresponding button respectively.
back
It means to click the Back button.
forward
It means to click the Forward button.
In addition, there is a special operation show. Your program should print the name of current page for each show operation.
By the way, setting spyware into computers of others may conflict with the law. Do not attempt, or you will be reprimanded by great men.
Constraints
* 1 ≤ n ≤ 100
* b[i] ≤ 100
* 1 ≤ the number of characters in the name ≤ 20
* Buttons are not touch, overlapped nor run over from the browser.
Input
Input consists of several datasets.
Each dataset starts with an integer n which represents the number of pages in the dataset.
Next line contains two integers W and H.
Next, information of each page are given. Each page starts with a string of characters and b[i], the number of buttons the page has. Following b[i] lines give information of buttons. Each button consists of four integers representing the coordinate (x1, y1) of upper left corner and the coordinate (x2, y2) of lower right corner of the button and a string of characters, which represents the name of page that the link of the button represents.
Next, the number of operation m is given. Following m lines represent the record of operations. Please see the above description for the operation.
The first page is stored in the buffer at first.
Input ends when n = 0.
Output
For each dataset, output the name of current page for each show operation.
Example
Input
3
800 600
index 1
500 100 700 200 profile
profile 2
100 100 400 200 index
100 400 400 500 link
link 1
100 100 300 200 index
9
click 600 150
show
click 200 450
show
back
back
show
forward
show
0
Output
profile
link
index
profile | instruction | 0 | 92,557 | 14 | 185,114 |
"Correct Solution:
```
class Page:
def __init__(self, name, buttons):
self.name = name
self.buttons = buttons
class Button:
def __init__(self, line):
self.x1 = int(line[0])
self.y1 = int(line[1])
self.x2 = int(line[2])
self.y2 = int(line[3])
self.link = line[4]
class Buffer:
def __init__(self, page):
self.pointer = 0
self.length = 0
self.contents = [page]
self.pages = {}
def click(self, x, y):
page = self.contents[self.pointer]
for button in page.buttons:
if button.x1 <= x <= button.x2 and button.y1 <= y <= button.y2:
link = button.link
self.contents = self.contents[:self.pointer+1]
self.contents.append(self.pages[link])
self.pointer += 1
self.length = self.pointer
def back(self):
self.pointer = max(0, self.pointer - 1)
def forward(self):
self.pointer = min(self.length, self.pointer + 1)
def show(self):
print(self.contents[self.pointer].name)
def page_detail():
name, bi = input().split()
buttons = []
for _ in range(int(bi)):
buttons.append(Button(input().split()))
page = Page(name, buttons)
return page, name
while True:
n = int(input())
if n == 0:
break
input()
pages = {}
for i in range(n):
page, name = page_detail()
pages[name] = page
if i == 0:
buffer = Buffer(page)
buffer.pages = pages
m = int(input())
for _ in range(m):
s = input()
if s == "show":
buffer.show()
elif s == "back":
buffer.back()
elif s == "forward":
buffer.forward()
else:
_, x, y = s.split()
buffer.click(int(x), int(y))
``` | output | 1 | 92,557 | 14 | 185,115 |
Provide a correct Python 3 solution for this coding contest problem.
problem
In Ikatta, the SNS used by AOR Ika-chan, posts are called tweets.
And in squid, there is a concern that visibility will deteriorate if there are many replies to tweets, so when a tweet meets any of the following rules, the tweet will be displayed on the screen. ing.
* Rule 1. No reply to any tweet
* Rule 2. No reply from any tweet
* Rule 3. When you follow the reply destinations in order from the tweet to which Rule 2 is applied, you can reach it in less than $ K $ times.
The same tweet will not be displayed more than once.
Now, when there are $ N $ tweets and $ A_i $ is $ 0 $, the $ i $ th tweet is a non-reply tweet, and when $ A_i $ is not $ 0 $, the $ i $ th tweet is the $ A_i $ th tweet. It is a tweet of the reply to the tweet of.
Answer the number of tweets displayed on the screen.
output
Output the number of tweets displayed on the screen. Also, output a line break at the end.
Example
Input
6 3
0
0
2
3
4
5
Output
5 | instruction | 0 | 92,583 | 14 | 185,166 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
N, K = map(int, readline().split())
a = [int(readline())-1 for _ in [0]*N]
result = a.count(-1)
nodes = set()
node_add = nodes.add
hoge = set()
hoge_add = hoge.add
for i in range(N):
if a[i] in hoge:
node_add(a[i])
hoge_add(a[i])
visited = set()
add = visited.add
startnode = {v: K-1 for v in {i for i in range(N) if a[i] > -1} - set(a)}
while startnode:
nextnode = dict()
for v, l in startnode.items():
#print("start:", v, "length:", l)
result += (v not in visited)
add(v)
v = a[v]
while a[v] > -1 and v not in nodes and l > 0:
#print(v)
if v not in visited:
result += 1
add(v)
l -= 1
v = a[v]
if a[v] > -1 and v in nodes and l > 0:
#print("->", v)
nextnode[v] = max(nextnode.get(v, 0), l-1)
startnode = nextnode
print(result)
``` | output | 1 | 92,583 | 14 | 185,167 |
Provide a correct Python 3 solution for this coding contest problem.
problem
In Ikatta, the SNS used by AOR Ika-chan, posts are called tweets.
And in squid, there is a concern that visibility will deteriorate if there are many replies to tweets, so when a tweet meets any of the following rules, the tweet will be displayed on the screen. ing.
* Rule 1. No reply to any tweet
* Rule 2. No reply from any tweet
* Rule 3. When you follow the reply destinations in order from the tweet to which Rule 2 is applied, you can reach it in less than $ K $ times.
The same tweet will not be displayed more than once.
Now, when there are $ N $ tweets and $ A_i $ is $ 0 $, the $ i $ th tweet is a non-reply tweet, and when $ A_i $ is not $ 0 $, the $ i $ th tweet is the $ A_i $ th tweet. It is a tweet of the reply to the tweet of.
Answer the number of tweets displayed on the screen.
output
Output the number of tweets displayed on the screen. Also, output a line break at the end.
Example
Input
6 3
0
0
2
3
4
5
Output
5 | instruction | 0 | 92,584 | 14 | 185,168 |
"Correct Solution:
```
# AOJ 2833: Displayed tweets
# Python3 2018.7.12 bal4u
INF = 0x7ffffff
N, K = map(int, input().split())
k, f = [INF]*(N+1), [0]*(N+1)
a = [0]+[int(input()) for i in range(N)]
ans = 0
for i in range(N, 0, -1):
re = a[i]
if re:
if f[i] == 0: v = 0; ans += 1
else:
v = k[i]
if v < K: ans += 1
v += 1
if v < K and k[re] > v: k[re] = v
f[re] = 1;
else: ans += 1
print(ans)
``` | output | 1 | 92,584 | 14 | 185,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
In Ikatta, the SNS used by AOR Ika-chan, posts are called tweets.
And in squid, there is a concern that visibility will deteriorate if there are many replies to tweets, so when a tweet meets any of the following rules, the tweet will be displayed on the screen. ing.
* Rule 1. No reply to any tweet
* Rule 2. No reply from any tweet
* Rule 3. When you follow the reply destinations in order from the tweet to which Rule 2 is applied, you can reach it in less than $ K $ times.
The same tweet will not be displayed more than once.
Now, when there are $ N $ tweets and $ A_i $ is $ 0 $, the $ i $ th tweet is a non-reply tweet, and when $ A_i $ is not $ 0 $, the $ i $ th tweet is the $ A_i $ th tweet. It is a tweet of the reply to the tweet of.
Answer the number of tweets displayed on the screen.
output
Output the number of tweets displayed on the screen. Also, output a line break at the end.
Example
Input
6 3
0
0
2
3
4
5
Output
5
Submitted Solution:
```
import sys
readline = sys.stdin.readline
N, K = map(int, readline().split())
a = [int(readline())-1 for _ in [0]*N]
result = a.count(-1)
nodes = set()
node_add = nodes.add
hoge = set()
hoge_add = hoge.add
for i in range(N):
if a[i] in hoge:
node_add(a[i])
hoge_add(a[i])
visited = set()
add = visited.add
startnode = {v: K-1 for v in {i for i in range(N) if a[i] > -1} - set(a)}
while startnode:
nextnode = dict()
for v, l in startnode.items():
#print("start:", v, "length:", l)
result += (v not in visited)
v = a[v]
while a[v] > -1 and v not in nodes and l > 0:
#print(v)
if v not in visited:
result += 1
add(v)
l -= 1
v = a[v]
if a[v] > -1 and v in nodes and l > 0:
#print("->", v)
nextnode[v] = max(nextnode.get(v, 0), l-1)
startnode = nextnode
print(result)
``` | instruction | 0 | 92,586 | 14 | 185,172 |
No | output | 1 | 92,586 | 14 | 185,173 |
Provide tags and a correct Python 3 solution for this coding contest problem.
What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until...
Today Petya opened the cupboard and found a scary note there. His parents had left him with duties: he should water their favourite flower all year, each day, in the morning, in the afternoon and in the evening. "Wait a second!" — thought Petya. He know for a fact that if he fulfills the parents' task in the i-th (1 ≤ i ≤ 12) month of the year, then the flower will grow by ai centimeters, and if he doesn't water the flower in the i-th month, then the flower won't grow this month. Petya also knows that try as he might, his parents won't believe that he has been watering the flower if it grows strictly less than by k centimeters.
Help Petya choose the minimum number of months when he will water the flower, given that the flower should grow no less than by k centimeters.
Input
The first line contains exactly one integer k (0 ≤ k ≤ 100). The next line contains twelve space-separated integers: the i-th (1 ≤ i ≤ 12) number in the line represents ai (0 ≤ ai ≤ 100).
Output
Print the only integer — the minimum number of months when Petya has to water the flower so that the flower grows no less than by k centimeters. If the flower can't grow by k centimeters in a year, print -1.
Examples
Input
5
1 1 1 1 2 2 3 2 2 1 1 1
Output
2
Input
0
0 0 0 0 0 0 0 1 1 2 3 0
Output
0
Input
11
1 1 4 1 1 5 1 1 4 1 1 1
Output
3
Note
Let's consider the first sample test. There it is enough to water the flower during the seventh and the ninth month. Then the flower grows by exactly five centimeters.
In the second sample Petya's parents will believe him even if the flower doesn't grow at all (k = 0). So, it is possible for Petya not to water the flower at all. | instruction | 0 | 92,865 | 14 | 185,730 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
k=0
s=0
while s<n:
if len(l)==0:
k=-1
break
h=max(l)
s=s+h
l.remove(h)
k=k+1
print(k)
``` | output | 1 | 92,865 | 14 | 185,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until...
Today Petya opened the cupboard and found a scary note there. His parents had left him with duties: he should water their favourite flower all year, each day, in the morning, in the afternoon and in the evening. "Wait a second!" — thought Petya. He know for a fact that if he fulfills the parents' task in the i-th (1 ≤ i ≤ 12) month of the year, then the flower will grow by ai centimeters, and if he doesn't water the flower in the i-th month, then the flower won't grow this month. Petya also knows that try as he might, his parents won't believe that he has been watering the flower if it grows strictly less than by k centimeters.
Help Petya choose the minimum number of months when he will water the flower, given that the flower should grow no less than by k centimeters.
Input
The first line contains exactly one integer k (0 ≤ k ≤ 100). The next line contains twelve space-separated integers: the i-th (1 ≤ i ≤ 12) number in the line represents ai (0 ≤ ai ≤ 100).
Output
Print the only integer — the minimum number of months when Petya has to water the flower so that the flower grows no less than by k centimeters. If the flower can't grow by k centimeters in a year, print -1.
Examples
Input
5
1 1 1 1 2 2 3 2 2 1 1 1
Output
2
Input
0
0 0 0 0 0 0 0 1 1 2 3 0
Output
0
Input
11
1 1 4 1 1 5 1 1 4 1 1 1
Output
3
Note
Let's consider the first sample test. There it is enough to water the flower during the seventh and the ninth month. Then the flower grows by exactly five centimeters.
In the second sample Petya's parents will believe him even if the flower doesn't grow at all (k = 0). So, it is possible for Petya not to water the flower at all. | instruction | 0 | 92,867 | 14 | 185,734 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
s=0
a=0
flag=0
if n > 0:
for i in range(len(l)):
s+=l[i]
a+=1
if n<=s:
flag=1
break
if flag == 1:
print(a)
else:
print(-1)
else:
print(0)
``` | output | 1 | 92,867 | 14 | 185,735 |
Provide tags and a correct Python 3 solution for this coding contest problem.
What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until...
Today Petya opened the cupboard and found a scary note there. His parents had left him with duties: he should water their favourite flower all year, each day, in the morning, in the afternoon and in the evening. "Wait a second!" — thought Petya. He know for a fact that if he fulfills the parents' task in the i-th (1 ≤ i ≤ 12) month of the year, then the flower will grow by ai centimeters, and if he doesn't water the flower in the i-th month, then the flower won't grow this month. Petya also knows that try as he might, his parents won't believe that he has been watering the flower if it grows strictly less than by k centimeters.
Help Petya choose the minimum number of months when he will water the flower, given that the flower should grow no less than by k centimeters.
Input
The first line contains exactly one integer k (0 ≤ k ≤ 100). The next line contains twelve space-separated integers: the i-th (1 ≤ i ≤ 12) number in the line represents ai (0 ≤ ai ≤ 100).
Output
Print the only integer — the minimum number of months when Petya has to water the flower so that the flower grows no less than by k centimeters. If the flower can't grow by k centimeters in a year, print -1.
Examples
Input
5
1 1 1 1 2 2 3 2 2 1 1 1
Output
2
Input
0
0 0 0 0 0 0 0 1 1 2 3 0
Output
0
Input
11
1 1 4 1 1 5 1 1 4 1 1 1
Output
3
Note
Let's consider the first sample test. There it is enough to water the flower during the seventh and the ninth month. Then the flower grows by exactly five centimeters.
In the second sample Petya's parents will believe him even if the flower doesn't grow at all (k = 0). So, it is possible for Petya not to water the flower at all. | instruction | 0 | 92,868 | 14 | 185,736 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n = int(input())
a = map(int, input().split())
if n is 0:
print('0')
exit()
c = 0
for i, v in enumerate(reversed(sorted(a))):
c += v
if c >= n:
print(i + 1)
exit()
print('-1')
``` | output | 1 | 92,868 | 14 | 185,737 |
Provide tags and a correct Python 3 solution for this coding contest problem.
What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until...
Today Petya opened the cupboard and found a scary note there. His parents had left him with duties: he should water their favourite flower all year, each day, in the morning, in the afternoon and in the evening. "Wait a second!" — thought Petya. He know for a fact that if he fulfills the parents' task in the i-th (1 ≤ i ≤ 12) month of the year, then the flower will grow by ai centimeters, and if he doesn't water the flower in the i-th month, then the flower won't grow this month. Petya also knows that try as he might, his parents won't believe that he has been watering the flower if it grows strictly less than by k centimeters.
Help Petya choose the minimum number of months when he will water the flower, given that the flower should grow no less than by k centimeters.
Input
The first line contains exactly one integer k (0 ≤ k ≤ 100). The next line contains twelve space-separated integers: the i-th (1 ≤ i ≤ 12) number in the line represents ai (0 ≤ ai ≤ 100).
Output
Print the only integer — the minimum number of months when Petya has to water the flower so that the flower grows no less than by k centimeters. If the flower can't grow by k centimeters in a year, print -1.
Examples
Input
5
1 1 1 1 2 2 3 2 2 1 1 1
Output
2
Input
0
0 0 0 0 0 0 0 1 1 2 3 0
Output
0
Input
11
1 1 4 1 1 5 1 1 4 1 1 1
Output
3
Note
Let's consider the first sample test. There it is enough to water the flower during the seventh and the ninth month. Then the flower grows by exactly five centimeters.
In the second sample Petya's parents will believe him even if the flower doesn't grow at all (k = 0). So, it is possible for Petya not to water the flower at all. | instruction | 0 | 92,869 | 14 | 185,738 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n=int(input())
l1=list(map(int,input().split()))
l1=sorted(l1,reverse=True)
a=sum(l1)
if a<n:
print("-1")
else:
i=0
b=0
while b<n:
b+=l1[i]
i+=1
print(i)
``` | output | 1 | 92,869 | 14 | 185,739 |
Provide tags and a correct Python 3 solution for this coding contest problem.
What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until...
Today Petya opened the cupboard and found a scary note there. His parents had left him with duties: he should water their favourite flower all year, each day, in the morning, in the afternoon and in the evening. "Wait a second!" — thought Petya. He know for a fact that if he fulfills the parents' task in the i-th (1 ≤ i ≤ 12) month of the year, then the flower will grow by ai centimeters, and if he doesn't water the flower in the i-th month, then the flower won't grow this month. Petya also knows that try as he might, his parents won't believe that he has been watering the flower if it grows strictly less than by k centimeters.
Help Petya choose the minimum number of months when he will water the flower, given that the flower should grow no less than by k centimeters.
Input
The first line contains exactly one integer k (0 ≤ k ≤ 100). The next line contains twelve space-separated integers: the i-th (1 ≤ i ≤ 12) number in the line represents ai (0 ≤ ai ≤ 100).
Output
Print the only integer — the minimum number of months when Petya has to water the flower so that the flower grows no less than by k centimeters. If the flower can't grow by k centimeters in a year, print -1.
Examples
Input
5
1 1 1 1 2 2 3 2 2 1 1 1
Output
2
Input
0
0 0 0 0 0 0 0 1 1 2 3 0
Output
0
Input
11
1 1 4 1 1 5 1 1 4 1 1 1
Output
3
Note
Let's consider the first sample test. There it is enough to water the flower during the seventh and the ninth month. Then the flower grows by exactly five centimeters.
In the second sample Petya's parents will believe him even if the flower doesn't grow at all (k = 0). So, it is possible for Petya not to water the flower at all. | instruction | 0 | 92,870 | 14 | 185,740 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n=int(input())
num=[int(x) for x in input().split()]
list.sort(num,reverse=True)
a=0
b=0
for i in range(len(num)):
a=a+int(num[i])
if a>=n:
b=i+1
break
if n==0:
print(0)
else:
if b==0:
print(-1)
else:
print(b)
``` | output | 1 | 92,870 | 14 | 185,741 |
Provide tags and a correct Python 3 solution for this coding contest problem.
What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until...
Today Petya opened the cupboard and found a scary note there. His parents had left him with duties: he should water their favourite flower all year, each day, in the morning, in the afternoon and in the evening. "Wait a second!" — thought Petya. He know for a fact that if he fulfills the parents' task in the i-th (1 ≤ i ≤ 12) month of the year, then the flower will grow by ai centimeters, and if he doesn't water the flower in the i-th month, then the flower won't grow this month. Petya also knows that try as he might, his parents won't believe that he has been watering the flower if it grows strictly less than by k centimeters.
Help Petya choose the minimum number of months when he will water the flower, given that the flower should grow no less than by k centimeters.
Input
The first line contains exactly one integer k (0 ≤ k ≤ 100). The next line contains twelve space-separated integers: the i-th (1 ≤ i ≤ 12) number in the line represents ai (0 ≤ ai ≤ 100).
Output
Print the only integer — the minimum number of months when Petya has to water the flower so that the flower grows no less than by k centimeters. If the flower can't grow by k centimeters in a year, print -1.
Examples
Input
5
1 1 1 1 2 2 3 2 2 1 1 1
Output
2
Input
0
0 0 0 0 0 0 0 1 1 2 3 0
Output
0
Input
11
1 1 4 1 1 5 1 1 4 1 1 1
Output
3
Note
Let's consider the first sample test. There it is enough to water the flower during the seventh and the ninth month. Then the flower grows by exactly five centimeters.
In the second sample Petya's parents will believe him even if the flower doesn't grow at all (k = 0). So, it is possible for Petya not to water the flower at all. | instruction | 0 | 92,871 | 14 | 185,742 |
Tags: greedy, implementation, sortings
Correct Solution:
```
k= int(input())
a = list(map(int, input().split()))
if sum(a)<k:
print(-1)
exit()
if k<=0:
print(0)
exit()
else:
a.sort(reverse = True)
sum = 0
i = 0
while(sum<k):
sum +=a[i]
i+=1
print(i)
``` | output | 1 | 92,871 | 14 | 185,743 |
Provide tags and a correct Python 3 solution for this coding contest problem.
What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until...
Today Petya opened the cupboard and found a scary note there. His parents had left him with duties: he should water their favourite flower all year, each day, in the morning, in the afternoon and in the evening. "Wait a second!" — thought Petya. He know for a fact that if he fulfills the parents' task in the i-th (1 ≤ i ≤ 12) month of the year, then the flower will grow by ai centimeters, and if he doesn't water the flower in the i-th month, then the flower won't grow this month. Petya also knows that try as he might, his parents won't believe that he has been watering the flower if it grows strictly less than by k centimeters.
Help Petya choose the minimum number of months when he will water the flower, given that the flower should grow no less than by k centimeters.
Input
The first line contains exactly one integer k (0 ≤ k ≤ 100). The next line contains twelve space-separated integers: the i-th (1 ≤ i ≤ 12) number in the line represents ai (0 ≤ ai ≤ 100).
Output
Print the only integer — the minimum number of months when Petya has to water the flower so that the flower grows no less than by k centimeters. If the flower can't grow by k centimeters in a year, print -1.
Examples
Input
5
1 1 1 1 2 2 3 2 2 1 1 1
Output
2
Input
0
0 0 0 0 0 0 0 1 1 2 3 0
Output
0
Input
11
1 1 4 1 1 5 1 1 4 1 1 1
Output
3
Note
Let's consider the first sample test. There it is enough to water the flower during the seventh and the ninth month. Then the flower grows by exactly five centimeters.
In the second sample Petya's parents will believe him even if the flower doesn't grow at all (k = 0). So, it is possible for Petya not to water the flower at all. | instruction | 0 | 92,872 | 14 | 185,744 |
Tags: greedy, implementation, sortings
Correct Solution:
```
def business(n, ls):
s = 0
count = 0
if(n == 0):
return 0
s1 = sum(ls)
while(s < n):
m = max(ls)
s = s + m
i = ls.index(max(ls))
ls[i] = 0
count = count + 1
if(s == s1 and s < n):
return -1
return count
n = int(input())
ls = [int(i) for i in input().split()]
print(business(n, ls))
``` | output | 1 | 92,872 | 14 | 185,745 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pashmak decided to give Parmida a pair of flowers from the garden. There are n flowers in the garden and the i-th of them has a beauty number bi. Parmida is a very strange girl so she doesn't want to have the two most beautiful flowers necessarily. She wants to have those pairs of flowers that their beauty difference is maximal possible!
Your task is to write a program which calculates two things:
1. The maximum beauty difference of flowers that Pashmak can give to Parmida.
2. The number of ways that Pashmak can pick the flowers. Two ways are considered different if and only if there is at least one flower that is chosen in the first way and not chosen in the second way.
Input
The first line of the input contains n (2 ≤ n ≤ 2·105). In the next line there are n space-separated integers b1, b2, ..., bn (1 ≤ bi ≤ 109).
Output
The only line of output should contain two integers. The maximum beauty difference and the number of ways this may happen, respectively.
Examples
Input
2
1 2
Output
1 1
Input
3
1 4 5
Output
4 1
Input
5
3 1 2 3 1
Output
2 4
Note
In the third sample the maximum beauty difference is 2 and there are 4 ways to do this:
1. choosing the first and the second flowers;
2. choosing the first and the fifth flowers;
3. choosing the fourth and the second flowers;
4. choosing the fourth and the fifth flowers. | instruction | 0 | 93,035 | 14 | 186,070 |
Tags: combinatorics, implementation, sortings
Correct Solution:
```
n=int(input())
l=list(map(int, input().split()))
max=max(l)
min=min(l)
m=l.count(max)
if min==max:
print(str(abs(max-min))+" "+str(m*(m-1)//2))
else:
print(str(abs(max-min))+" "+str(m*l.count(min)))
``` | output | 1 | 93,035 | 14 | 186,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pashmak decided to give Parmida a pair of flowers from the garden. There are n flowers in the garden and the i-th of them has a beauty number bi. Parmida is a very strange girl so she doesn't want to have the two most beautiful flowers necessarily. She wants to have those pairs of flowers that their beauty difference is maximal possible!
Your task is to write a program which calculates two things:
1. The maximum beauty difference of flowers that Pashmak can give to Parmida.
2. The number of ways that Pashmak can pick the flowers. Two ways are considered different if and only if there is at least one flower that is chosen in the first way and not chosen in the second way.
Input
The first line of the input contains n (2 ≤ n ≤ 2·105). In the next line there are n space-separated integers b1, b2, ..., bn (1 ≤ bi ≤ 109).
Output
The only line of output should contain two integers. The maximum beauty difference and the number of ways this may happen, respectively.
Examples
Input
2
1 2
Output
1 1
Input
3
1 4 5
Output
4 1
Input
5
3 1 2 3 1
Output
2 4
Note
In the third sample the maximum beauty difference is 2 and there are 4 ways to do this:
1. choosing the first and the second flowers;
2. choosing the first and the fifth flowers;
3. choosing the fourth and the second flowers;
4. choosing the fourth and the fifth flowers. | instruction | 0 | 93,036 | 14 | 186,072 |
Tags: combinatorics, implementation, sortings
Correct Solution:
```
n=int(input())
a = list(map(int, input().split()))
maximum=max(a)
minimum=min(a)
if minimum==maximum:
print(0,int(n/2*(n-1)))
else:
print(maximum-minimum,a.count(maximum)*a.count(minimum))
``` | output | 1 | 93,036 | 14 | 186,073 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pashmak decided to give Parmida a pair of flowers from the garden. There are n flowers in the garden and the i-th of them has a beauty number bi. Parmida is a very strange girl so she doesn't want to have the two most beautiful flowers necessarily. She wants to have those pairs of flowers that their beauty difference is maximal possible!
Your task is to write a program which calculates two things:
1. The maximum beauty difference of flowers that Pashmak can give to Parmida.
2. The number of ways that Pashmak can pick the flowers. Two ways are considered different if and only if there is at least one flower that is chosen in the first way and not chosen in the second way.
Input
The first line of the input contains n (2 ≤ n ≤ 2·105). In the next line there are n space-separated integers b1, b2, ..., bn (1 ≤ bi ≤ 109).
Output
The only line of output should contain two integers. The maximum beauty difference and the number of ways this may happen, respectively.
Examples
Input
2
1 2
Output
1 1
Input
3
1 4 5
Output
4 1
Input
5
3 1 2 3 1
Output
2 4
Note
In the third sample the maximum beauty difference is 2 and there are 4 ways to do this:
1. choosing the first and the second flowers;
2. choosing the first and the fifth flowers;
3. choosing the fourth and the second flowers;
4. choosing the fourth and the fifth flowers. | instruction | 0 | 93,037 | 14 | 186,074 |
Tags: combinatorics, implementation, sortings
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
id1=0
id2=0
mi=l[0]
ma=l[0]
for i in l:
if(i>ma):
ma=i
if(i<mi):
mi=i
for i in l:
if(i==mi):
id1+=1
if(i==ma):
id2+=1
if(mi!=ma):
print("{0} {1}".format(ma-mi,id1*id2))
else:
print("{0} {1}".format(ma-mi,(id1*(id2-1))//2))
``` | output | 1 | 93,037 | 14 | 186,075 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pashmak decided to give Parmida a pair of flowers from the garden. There are n flowers in the garden and the i-th of them has a beauty number bi. Parmida is a very strange girl so she doesn't want to have the two most beautiful flowers necessarily. She wants to have those pairs of flowers that their beauty difference is maximal possible!
Your task is to write a program which calculates two things:
1. The maximum beauty difference of flowers that Pashmak can give to Parmida.
2. The number of ways that Pashmak can pick the flowers. Two ways are considered different if and only if there is at least one flower that is chosen in the first way and not chosen in the second way.
Input
The first line of the input contains n (2 ≤ n ≤ 2·105). In the next line there are n space-separated integers b1, b2, ..., bn (1 ≤ bi ≤ 109).
Output
The only line of output should contain two integers. The maximum beauty difference and the number of ways this may happen, respectively.
Examples
Input
2
1 2
Output
1 1
Input
3
1 4 5
Output
4 1
Input
5
3 1 2 3 1
Output
2 4
Note
In the third sample the maximum beauty difference is 2 and there are 4 ways to do this:
1. choosing the first and the second flowers;
2. choosing the first and the fifth flowers;
3. choosing the fourth and the second flowers;
4. choosing the fourth and the fifth flowers. | instruction | 0 | 93,038 | 14 | 186,076 |
Tags: combinatorics, implementation, sortings
Correct Solution:
```
#!/usr/bin/env python3
import math
if __name__ == "__main__":
n = int(input())
bis = list(map(int, input().split()))
i, j= max(bis), min(bis)
print(i-j, n*(n-1)//2 if i == j else bis.count(i)*bis.count(j))
``` | output | 1 | 93,038 | 14 | 186,077 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.