message stringlengths 2 44.5k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 42 109k | cluster float64 5 5 | __index_level_0__ int64 84 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little C loves number «3» very much. He loves all things about it.
Now he is interested in the following problem:
There are two arrays of 2^n intergers a_0,a_1,...,a_{2^n-1} and b_0,b_1,...,b_{2^n-1}.
The task is for each i (0 ≤ i ≤ 2^n-1), to calculate c_i=∑ a_j ⋅ b_k (j|k=i and j\&k=0, where "|" denotes [bitwise or operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR) and "\&" denotes [bitwise and operation](https://en.wikipedia.org/wiki/Bitwise_operation#AND)).
It's amazing that it can be proved that there are exactly 3^n triples (i,j,k), such that j|k=i, j\&k=0 and 0 ≤ i,j,k ≤ 2^n-1. So Little C wants to solve this excellent problem (because it's well related to 3) excellently.
Help him calculate all c_i. Little C loves 3 very much, so he only want to know each c_i \& 3.
Input
The first line contains one integer n (0 ≤ n ≤ 21).
The second line contains 2^n integers in [0,3] without spaces — the i-th of them is a_{i-1}.
The third line contains 2^n integers in [0,3] without spaces — the i-th of them is b_{i-1}.
Output
Print one line contains 2^n integers in [0,3] without spaces — the i-th of them is c_{i-1}\&3. (It's obvious that c_{i}\&3 is in [0,3]).
Examples
Input
1
11
11
Output
12
Input
2
0123
3210
Output
0322
Submitted Solution:
```
print("ur mum gay")
``` | instruction | 0 | 101,195 | 5 | 202,390 |
No | output | 1 | 101,195 | 5 | 202,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little C loves number «3» very much. He loves all things about it.
Now he is interested in the following problem:
There are two arrays of 2^n intergers a_0,a_1,...,a_{2^n-1} and b_0,b_1,...,b_{2^n-1}.
The task is for each i (0 ≤ i ≤ 2^n-1), to calculate c_i=∑ a_j ⋅ b_k (j|k=i and j\&k=0, where "|" denotes [bitwise or operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR) and "\&" denotes [bitwise and operation](https://en.wikipedia.org/wiki/Bitwise_operation#AND)).
It's amazing that it can be proved that there are exactly 3^n triples (i,j,k), such that j|k=i, j\&k=0 and 0 ≤ i,j,k ≤ 2^n-1. So Little C wants to solve this excellent problem (because it's well related to 3) excellently.
Help him calculate all c_i. Little C loves 3 very much, so he only want to know each c_i \& 3.
Input
The first line contains one integer n (0 ≤ n ≤ 21).
The second line contains 2^n integers in [0,3] without spaces — the i-th of them is a_{i-1}.
The third line contains 2^n integers in [0,3] without spaces — the i-th of them is b_{i-1}.
Output
Print one line contains 2^n integers in [0,3] without spaces — the i-th of them is c_{i-1}\&3. (It's obvious that c_{i}\&3 is in [0,3]).
Examples
Input
1
11
11
Output
12
Input
2
0123
3210
Output
0322
Submitted Solution:
```
print("12")
#ur mum gay
``` | instruction | 0 | 101,196 | 5 | 202,392 |
No | output | 1 | 101,196 | 5 | 202,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and m. You have to construct the array a of length n consisting of non-negative integers (i.e. integers greater than or equal to zero) such that the sum of elements of this array is exactly m and the value ∑_{i=1}^{n-1} |a_i - a_{i+1}| is the maximum possible. Recall that |x| is the absolute value of x.
In other words, you have to maximize the sum of absolute differences between adjacent (consecutive) elements. For example, if the array a=[1, 3, 2, 5, 5, 0] then the value above for this array is |1-3| + |3-2| + |2-5| + |5-5| + |5-0| = 2 + 1 + 3 + 0 + 5 = 11. Note that this example doesn't show the optimal answer but it shows how the required value for some array is calculated.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of the test case contains two integers n and m (1 ≤ n, m ≤ 10^9) — the length of the array and its sum correspondingly.
Output
For each test case, print the answer — the maximum possible value of ∑_{i=1}^{n-1} |a_i - a_{i+1}| for the array a consisting of n non-negative integers with the sum m.
Example
Input
5
1 100
2 2
5 5
2 1000000000
1000000000 1000000000
Output
0
2
10
1000000000
2000000000
Note
In the first test case of the example, the only possible array is [100] and the answer is obviously 0.
In the second test case of the example, one of the possible arrays is [2, 0] and the answer is |2-0| = 2.
In the third test case of the example, one of the possible arrays is [0, 2, 0, 3, 0] and the answer is |0-2| + |2-0| + |0-3| + |3-0| = 10.
Submitted Solution:
```
T = int(input())
for _ in range(T):
n,m = map(int,input().split())
if n==1:
print(0)
continue
elif n==2:
print(m)
continue
else:
print(2*m)
continue
``` | instruction | 0 | 101,372 | 5 | 202,744 |
Yes | output | 1 | 101,372 | 5 | 202,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and m. You have to construct the array a of length n consisting of non-negative integers (i.e. integers greater than or equal to zero) such that the sum of elements of this array is exactly m and the value ∑_{i=1}^{n-1} |a_i - a_{i+1}| is the maximum possible. Recall that |x| is the absolute value of x.
In other words, you have to maximize the sum of absolute differences between adjacent (consecutive) elements. For example, if the array a=[1, 3, 2, 5, 5, 0] then the value above for this array is |1-3| + |3-2| + |2-5| + |5-5| + |5-0| = 2 + 1 + 3 + 0 + 5 = 11. Note that this example doesn't show the optimal answer but it shows how the required value for some array is calculated.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of the test case contains two integers n and m (1 ≤ n, m ≤ 10^9) — the length of the array and its sum correspondingly.
Output
For each test case, print the answer — the maximum possible value of ∑_{i=1}^{n-1} |a_i - a_{i+1}| for the array a consisting of n non-negative integers with the sum m.
Example
Input
5
1 100
2 2
5 5
2 1000000000
1000000000 1000000000
Output
0
2
10
1000000000
2000000000
Note
In the first test case of the example, the only possible array is [100] and the answer is obviously 0.
In the second test case of the example, one of the possible arrays is [2, 0] and the answer is |2-0| = 2.
In the third test case of the example, one of the possible arrays is [0, 2, 0, 3, 0] and the answer is |0-2| + |2-0| + |0-3| + |3-0| = 10.
Submitted Solution:
```
for _ in range(int(input())):
# n = int(input())
m,n = [int(s) for s in input().split()]
# for i in range(len(arr)):
if m==1:
print(0)
elif m==2:
print(n)
else:
print(2*n)
``` | instruction | 0 | 101,373 | 5 | 202,746 |
Yes | output | 1 | 101,373 | 5 | 202,747 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and m. You have to construct the array a of length n consisting of non-negative integers (i.e. integers greater than or equal to zero) such that the sum of elements of this array is exactly m and the value ∑_{i=1}^{n-1} |a_i - a_{i+1}| is the maximum possible. Recall that |x| is the absolute value of x.
In other words, you have to maximize the sum of absolute differences between adjacent (consecutive) elements. For example, if the array a=[1, 3, 2, 5, 5, 0] then the value above for this array is |1-3| + |3-2| + |2-5| + |5-5| + |5-0| = 2 + 1 + 3 + 0 + 5 = 11. Note that this example doesn't show the optimal answer but it shows how the required value for some array is calculated.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of the test case contains two integers n and m (1 ≤ n, m ≤ 10^9) — the length of the array and its sum correspondingly.
Output
For each test case, print the answer — the maximum possible value of ∑_{i=1}^{n-1} |a_i - a_{i+1}| for the array a consisting of n non-negative integers with the sum m.
Example
Input
5
1 100
2 2
5 5
2 1000000000
1000000000 1000000000
Output
0
2
10
1000000000
2000000000
Note
In the first test case of the example, the only possible array is [100] and the answer is obviously 0.
In the second test case of the example, one of the possible arrays is [2, 0] and the answer is |2-0| = 2.
In the third test case of the example, one of the possible arrays is [0, 2, 0, 3, 0] and the answer is |0-2| + |2-0| + |0-3| + |3-0| = 10.
Submitted Solution:
```
from sys import stdin
input = stdin.readline
def main():
test = int(input())
for t in range(test):
# n = int(input())
l = [int(i) for i in input().split(" ")]
#
n = l[0]
m = l[1]
#
# l = []
# l = [int(i) for i in input().split(" ")]
# for i in l:
# print(i, end=' ')
if n == 1:
print(0)
elif n == 2:
print(m)
else:
print(2 * m)
main()
``` | instruction | 0 | 101,374 | 5 | 202,748 |
Yes | output | 1 | 101,374 | 5 | 202,749 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and m. You have to construct the array a of length n consisting of non-negative integers (i.e. integers greater than or equal to zero) such that the sum of elements of this array is exactly m and the value ∑_{i=1}^{n-1} |a_i - a_{i+1}| is the maximum possible. Recall that |x| is the absolute value of x.
In other words, you have to maximize the sum of absolute differences between adjacent (consecutive) elements. For example, if the array a=[1, 3, 2, 5, 5, 0] then the value above for this array is |1-3| + |3-2| + |2-5| + |5-5| + |5-0| = 2 + 1 + 3 + 0 + 5 = 11. Note that this example doesn't show the optimal answer but it shows how the required value for some array is calculated.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of the test case contains two integers n and m (1 ≤ n, m ≤ 10^9) — the length of the array and its sum correspondingly.
Output
For each test case, print the answer — the maximum possible value of ∑_{i=1}^{n-1} |a_i - a_{i+1}| for the array a consisting of n non-negative integers with the sum m.
Example
Input
5
1 100
2 2
5 5
2 1000000000
1000000000 1000000000
Output
0
2
10
1000000000
2000000000
Note
In the first test case of the example, the only possible array is [100] and the answer is obviously 0.
In the second test case of the example, one of the possible arrays is [2, 0] and the answer is |2-0| = 2.
In the third test case of the example, one of the possible arrays is [0, 2, 0, 3, 0] and the answer is |0-2| + |2-0| + |0-3| + |3-0| = 10.
Submitted Solution:
```
t = int(input())
for _ in range(t):
n, m = map(int, input().split())
print(min(n-1, 2)*m)
``` | instruction | 0 | 101,375 | 5 | 202,750 |
Yes | output | 1 | 101,375 | 5 | 202,751 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and m. You have to construct the array a of length n consisting of non-negative integers (i.e. integers greater than or equal to zero) such that the sum of elements of this array is exactly m and the value ∑_{i=1}^{n-1} |a_i - a_{i+1}| is the maximum possible. Recall that |x| is the absolute value of x.
In other words, you have to maximize the sum of absolute differences between adjacent (consecutive) elements. For example, if the array a=[1, 3, 2, 5, 5, 0] then the value above for this array is |1-3| + |3-2| + |2-5| + |5-5| + |5-0| = 2 + 1 + 3 + 0 + 5 = 11. Note that this example doesn't show the optimal answer but it shows how the required value for some array is calculated.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of the test case contains two integers n and m (1 ≤ n, m ≤ 10^9) — the length of the array and its sum correspondingly.
Output
For each test case, print the answer — the maximum possible value of ∑_{i=1}^{n-1} |a_i - a_{i+1}| for the array a consisting of n non-negative integers with the sum m.
Example
Input
5
1 100
2 2
5 5
2 1000000000
1000000000 1000000000
Output
0
2
10
1000000000
2000000000
Note
In the first test case of the example, the only possible array is [100] and the answer is obviously 0.
In the second test case of the example, one of the possible arrays is [2, 0] and the answer is |2-0| = 2.
In the third test case of the example, one of the possible arrays is [0, 2, 0, 3, 0] and the answer is |0-2| + |2-0| + |0-3| + |3-0| = 10.
Submitted Solution:
```
for t in range(int(input())):
n, m = map(int, input().split())
if n == 1:
print(0)
elif n == 2:
print(m)
elif n == m:
print(n * 2)
elif n % 2 == 0:
print(m * 2 - (m // n * 2))
else:
print(m * 2)
``` | instruction | 0 | 101,376 | 5 | 202,752 |
No | output | 1 | 101,376 | 5 | 202,753 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and m. You have to construct the array a of length n consisting of non-negative integers (i.e. integers greater than or equal to zero) such that the sum of elements of this array is exactly m and the value ∑_{i=1}^{n-1} |a_i - a_{i+1}| is the maximum possible. Recall that |x| is the absolute value of x.
In other words, you have to maximize the sum of absolute differences between adjacent (consecutive) elements. For example, if the array a=[1, 3, 2, 5, 5, 0] then the value above for this array is |1-3| + |3-2| + |2-5| + |5-5| + |5-0| = 2 + 1 + 3 + 0 + 5 = 11. Note that this example doesn't show the optimal answer but it shows how the required value for some array is calculated.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of the test case contains two integers n and m (1 ≤ n, m ≤ 10^9) — the length of the array and its sum correspondingly.
Output
For each test case, print the answer — the maximum possible value of ∑_{i=1}^{n-1} |a_i - a_{i+1}| for the array a consisting of n non-negative integers with the sum m.
Example
Input
5
1 100
2 2
5 5
2 1000000000
1000000000 1000000000
Output
0
2
10
1000000000
2000000000
Note
In the first test case of the example, the only possible array is [100] and the answer is obviously 0.
In the second test case of the example, one of the possible arrays is [2, 0] and the answer is |2-0| = 2.
In the third test case of the example, one of the possible arrays is [0, 2, 0, 3, 0] and the answer is |0-2| + |2-0| + |0-3| + |3-0| = 10.
Submitted Solution:
```
for ad in range(int(input())):
n,m=list(map(int,input().split()))
if n==1:
print(0)
elif n==2:
print(m)
else:
print(2*n)
``` | instruction | 0 | 101,377 | 5 | 202,754 |
No | output | 1 | 101,377 | 5 | 202,755 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and m. You have to construct the array a of length n consisting of non-negative integers (i.e. integers greater than or equal to zero) such that the sum of elements of this array is exactly m and the value ∑_{i=1}^{n-1} |a_i - a_{i+1}| is the maximum possible. Recall that |x| is the absolute value of x.
In other words, you have to maximize the sum of absolute differences between adjacent (consecutive) elements. For example, if the array a=[1, 3, 2, 5, 5, 0] then the value above for this array is |1-3| + |3-2| + |2-5| + |5-5| + |5-0| = 2 + 1 + 3 + 0 + 5 = 11. Note that this example doesn't show the optimal answer but it shows how the required value for some array is calculated.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of the test case contains two integers n and m (1 ≤ n, m ≤ 10^9) — the length of the array and its sum correspondingly.
Output
For each test case, print the answer — the maximum possible value of ∑_{i=1}^{n-1} |a_i - a_{i+1}| for the array a consisting of n non-negative integers with the sum m.
Example
Input
5
1 100
2 2
5 5
2 1000000000
1000000000 1000000000
Output
0
2
10
1000000000
2000000000
Note
In the first test case of the example, the only possible array is [100] and the answer is obviously 0.
In the second test case of the example, one of the possible arrays is [2, 0] and the answer is |2-0| = 2.
In the third test case of the example, one of the possible arrays is [0, 2, 0, 3, 0] and the answer is |0-2| + |2-0| + |0-3| + |3-0| = 10.
Submitted Solution:
```
"""
arr = list(map(int, input().split()))
n,k=map(int, input().split())
"""
import math
import sys
input = sys.stdin.readline
############ ---- Input Functions ---- ############
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def insr():
s = input()
return(list(s[:len(s) - 1]))
def invr():
return(map(int,input().split()))
test_cases = inp()
for _ in range(test_cases):
length, sum = map(int, input().split())
if length == 1:
print(0)
elif length == 2 or length == 3:
print(sum)
elif length == 4:
print(int(1.5 * sum))
else:
print(int(2 * sum))
# #Calculates intersection of two lists
# seq1 = inlt()
# seq2 = inlt()
# seq1.sort()
# seq2.sort()
# i = 0
# j = 0
# while i <len(seq1) and j < len(seq2):
# if seq1[i] < seq2[j]:
# i += 1
# elif seq2[j] < seq1[i]:
# j += 1
# else:
# print(seq1[i])
# i += 1
# j += 1
# #Calculates sum of largest subsequence in array
# arr = inlt()
# sum = 0
# best = 0
# for i in range(len(arr)):
# sum = max(arr[i], arr[i] + sum)
# best = max(best, sum)
# print(best)
# #Find longest increasing subsequence
# arr = inlt()
# length = [0] * len(arr)
# for i in range(len(arr)):
# length[i] = 1
# for j in range(i):
# if arr[j] < arr[i]:
# length[i] = max(length[i], length[j] + 1)
# print(max(length))
``` | instruction | 0 | 101,378 | 5 | 202,756 |
No | output | 1 | 101,378 | 5 | 202,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two integers n and m. You have to construct the array a of length n consisting of non-negative integers (i.e. integers greater than or equal to zero) such that the sum of elements of this array is exactly m and the value ∑_{i=1}^{n-1} |a_i - a_{i+1}| is the maximum possible. Recall that |x| is the absolute value of x.
In other words, you have to maximize the sum of absolute differences between adjacent (consecutive) elements. For example, if the array a=[1, 3, 2, 5, 5, 0] then the value above for this array is |1-3| + |3-2| + |2-5| + |5-5| + |5-0| = 2 + 1 + 3 + 0 + 5 = 11. Note that this example doesn't show the optimal answer but it shows how the required value for some array is calculated.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
The only line of the test case contains two integers n and m (1 ≤ n, m ≤ 10^9) — the length of the array and its sum correspondingly.
Output
For each test case, print the answer — the maximum possible value of ∑_{i=1}^{n-1} |a_i - a_{i+1}| for the array a consisting of n non-negative integers with the sum m.
Example
Input
5
1 100
2 2
5 5
2 1000000000
1000000000 1000000000
Output
0
2
10
1000000000
2000000000
Note
In the first test case of the example, the only possible array is [100] and the answer is obviously 0.
In the second test case of the example, one of the possible arrays is [2, 0] and the answer is |2-0| = 2.
In the third test case of the example, one of the possible arrays is [0, 2, 0, 3, 0] and the answer is |0-2| + |2-0| + |0-3| + |3-0| = 10.
Submitted Solution:
```
ttt = int(input())
for tt in range(1, ttt + 1):
parts = input().strip().split(" ")
n, m = int(parts[0]), int(parts[1])
ans = m
if n > 2: ans = 2 * m
print("Case #{}: {}".format(tt, ans))
``` | instruction | 0 | 101,379 | 5 | 202,758 |
No | output | 1 | 101,379 | 5 | 202,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jeff got 2n real numbers a1, a2, ..., a2n as a birthday present. The boy hates non-integer numbers, so he decided to slightly "adjust" the numbers he's got. Namely, Jeff consecutively executes n operations, each of them goes as follows:
* choose indexes i and j (i ≠ j) that haven't been chosen yet;
* round element ai to the nearest integer that isn't more than ai (assign to ai: ⌊ ai ⌋);
* round element aj to the nearest integer that isn't less than aj (assign to aj: ⌈ aj ⌉).
Nevertheless, Jeff doesn't want to hurt the feelings of the person who gave him the sequence. That's why the boy wants to perform the operations so as to make the absolute value of the difference between the sum of elements before performing the operations and the sum of elements after performing the operations as small as possible. Help Jeff find the minimum absolute value of the difference.
Input
The first line contains integer n (1 ≤ n ≤ 2000). The next line contains 2n real numbers a1, a2, ..., a2n (0 ≤ ai ≤ 10000), given with exactly three digits after the decimal point. The numbers are separated by spaces.
Output
In a single line print a single real number — the required difference with exactly three digits after the decimal point.
Examples
Input
3
0.000 0.500 0.750 1.000 2.000 3.000
Output
0.250
Input
3
4469.000 6526.000 4864.000 9356.383 7490.000 995.896
Output
0.279
Note
In the first test case you need to perform the operations as follows: (i = 1, j = 4), (i = 2, j = 3), (i = 5, j = 6). In this case, the difference will equal |(0 + 0.5 + 0.75 + 1 + 2 + 3) - (0 + 0 + 1 + 1 + 2 + 3)| = 0.25.
Submitted Solution:
```
N=int(input())
n=N
A=list(map(float,input().strip().split(' ')))
z=0
for i in range(len(A)):
A[i]=round(A[i],3)-int(A[i])
if A[i]==0:
z+=1
#print(A)
ANS=sum(A)
#print(ANS)
ans=10**10
for j in range(n-z,n+1):
ans=min(ans,abs(ANS-j))
print("%.3f"%ans)
``` | instruction | 0 | 101,505 | 5 | 203,010 |
Yes | output | 1 | 101,505 | 5 | 203,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jeff got 2n real numbers a1, a2, ..., a2n as a birthday present. The boy hates non-integer numbers, so he decided to slightly "adjust" the numbers he's got. Namely, Jeff consecutively executes n operations, each of them goes as follows:
* choose indexes i and j (i ≠ j) that haven't been chosen yet;
* round element ai to the nearest integer that isn't more than ai (assign to ai: ⌊ ai ⌋);
* round element aj to the nearest integer that isn't less than aj (assign to aj: ⌈ aj ⌉).
Nevertheless, Jeff doesn't want to hurt the feelings of the person who gave him the sequence. That's why the boy wants to perform the operations so as to make the absolute value of the difference between the sum of elements before performing the operations and the sum of elements after performing the operations as small as possible. Help Jeff find the minimum absolute value of the difference.
Input
The first line contains integer n (1 ≤ n ≤ 2000). The next line contains 2n real numbers a1, a2, ..., a2n (0 ≤ ai ≤ 10000), given with exactly three digits after the decimal point. The numbers are separated by spaces.
Output
In a single line print a single real number — the required difference with exactly three digits after the decimal point.
Examples
Input
3
0.000 0.500 0.750 1.000 2.000 3.000
Output
0.250
Input
3
4469.000 6526.000 4864.000 9356.383 7490.000 995.896
Output
0.279
Note
In the first test case you need to perform the operations as follows: (i = 1, j = 4), (i = 2, j = 3), (i = 5, j = 6). In this case, the difference will equal |(0 + 0.5 + 0.75 + 1 + 2 + 3) - (0 + 0 + 1 + 1 + 2 + 3)| = 0.25.
Submitted Solution:
```
n = int(input())
l = list(map(float, input().split()))
l = sorted([x - int(x) for x in l if x - int(x) != 0])
o = 2*n - len(l)
su = sum(l)
ans = 0xFFFFFFFFFFFFFFF
for i in range(n + 1):
if i + o >= n:
ans = min(ans, abs(i-su))
print("%.3f" % ans)
``` | instruction | 0 | 101,506 | 5 | 203,012 |
Yes | output | 1 | 101,506 | 5 | 203,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jeff got 2n real numbers a1, a2, ..., a2n as a birthday present. The boy hates non-integer numbers, so he decided to slightly "adjust" the numbers he's got. Namely, Jeff consecutively executes n operations, each of them goes as follows:
* choose indexes i and j (i ≠ j) that haven't been chosen yet;
* round element ai to the nearest integer that isn't more than ai (assign to ai: ⌊ ai ⌋);
* round element aj to the nearest integer that isn't less than aj (assign to aj: ⌈ aj ⌉).
Nevertheless, Jeff doesn't want to hurt the feelings of the person who gave him the sequence. That's why the boy wants to perform the operations so as to make the absolute value of the difference between the sum of elements before performing the operations and the sum of elements after performing the operations as small as possible. Help Jeff find the minimum absolute value of the difference.
Input
The first line contains integer n (1 ≤ n ≤ 2000). The next line contains 2n real numbers a1, a2, ..., a2n (0 ≤ ai ≤ 10000), given with exactly three digits after the decimal point. The numbers are separated by spaces.
Output
In a single line print a single real number — the required difference with exactly three digits after the decimal point.
Examples
Input
3
0.000 0.500 0.750 1.000 2.000 3.000
Output
0.250
Input
3
4469.000 6526.000 4864.000 9356.383 7490.000 995.896
Output
0.279
Note
In the first test case you need to perform the operations as follows: (i = 1, j = 4), (i = 2, j = 3), (i = 5, j = 6). In this case, the difference will equal |(0 + 0.5 + 0.75 + 1 + 2 + 3) - (0 + 0 + 1 + 1 + 2 + 3)| = 0.25.
Submitted Solution:
```
from sys import *
s1=stdin.readline().strip()
n=int(s1)
s1=stdin.readline().strip()
a=list(map(float,s1.split()))
b=[]
for i in range (2*n):
if int(a[i])!=a[i]:
b.append(round(1000*(a[i]-int(a[i]))))
m=len(b)
r=0
for i in range (m):
r=r+b[i]
if m<=n:
if r>=1000*m:
r=r-1000*m
else:
r=min(r-1000*(r//1000),1000-r+1000*(r//1000))
else:
if r>=n*1000:
r=r-1000*n
else:
if r<=1000*(m-n):
r=1000*(m-n)-r
else:
r=min(r-1000*(r//1000),1000-r+1000*(r//1000))
r=r/1000
print("%.3f"%r)
``` | instruction | 0 | 101,507 | 5 | 203,014 |
Yes | output | 1 | 101,507 | 5 | 203,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jeff got 2n real numbers a1, a2, ..., a2n as a birthday present. The boy hates non-integer numbers, so he decided to slightly "adjust" the numbers he's got. Namely, Jeff consecutively executes n operations, each of them goes as follows:
* choose indexes i and j (i ≠ j) that haven't been chosen yet;
* round element ai to the nearest integer that isn't more than ai (assign to ai: ⌊ ai ⌋);
* round element aj to the nearest integer that isn't less than aj (assign to aj: ⌈ aj ⌉).
Nevertheless, Jeff doesn't want to hurt the feelings of the person who gave him the sequence. That's why the boy wants to perform the operations so as to make the absolute value of the difference between the sum of elements before performing the operations and the sum of elements after performing the operations as small as possible. Help Jeff find the minimum absolute value of the difference.
Input
The first line contains integer n (1 ≤ n ≤ 2000). The next line contains 2n real numbers a1, a2, ..., a2n (0 ≤ ai ≤ 10000), given with exactly three digits after the decimal point. The numbers are separated by spaces.
Output
In a single line print a single real number — the required difference with exactly three digits after the decimal point.
Examples
Input
3
0.000 0.500 0.750 1.000 2.000 3.000
Output
0.250
Input
3
4469.000 6526.000 4864.000 9356.383 7490.000 995.896
Output
0.279
Note
In the first test case you need to perform the operations as follows: (i = 1, j = 4), (i = 2, j = 3), (i = 5, j = 6). In this case, the difference will equal |(0 + 0.5 + 0.75 + 1 + 2 + 3) - (0 + 0 + 1 + 1 + 2 + 3)| = 0.25.
Submitted Solution:
```
n = int(input())
arr = list(map(float, input().split()))
arr = sorted([x - int(x) for x in arr if x - int(x) != 0])
o = 2 * n - len(arr)
arr_sum = sum(arr)
res = int(2e9)
for i in range(n + 1):
if i + o >= n:
res = min(res, abs(i - arr_sum))
print("%.3f" % res)
``` | instruction | 0 | 101,508 | 5 | 203,016 |
Yes | output | 1 | 101,508 | 5 | 203,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jeff got 2n real numbers a1, a2, ..., a2n as a birthday present. The boy hates non-integer numbers, so he decided to slightly "adjust" the numbers he's got. Namely, Jeff consecutively executes n operations, each of them goes as follows:
* choose indexes i and j (i ≠ j) that haven't been chosen yet;
* round element ai to the nearest integer that isn't more than ai (assign to ai: ⌊ ai ⌋);
* round element aj to the nearest integer that isn't less than aj (assign to aj: ⌈ aj ⌉).
Nevertheless, Jeff doesn't want to hurt the feelings of the person who gave him the sequence. That's why the boy wants to perform the operations so as to make the absolute value of the difference between the sum of elements before performing the operations and the sum of elements after performing the operations as small as possible. Help Jeff find the minimum absolute value of the difference.
Input
The first line contains integer n (1 ≤ n ≤ 2000). The next line contains 2n real numbers a1, a2, ..., a2n (0 ≤ ai ≤ 10000), given with exactly three digits after the decimal point. The numbers are separated by spaces.
Output
In a single line print a single real number — the required difference with exactly three digits after the decimal point.
Examples
Input
3
0.000 0.500 0.750 1.000 2.000 3.000
Output
0.250
Input
3
4469.000 6526.000 4864.000 9356.383 7490.000 995.896
Output
0.279
Note
In the first test case you need to perform the operations as follows: (i = 1, j = 4), (i = 2, j = 3), (i = 5, j = 6). In this case, the difference will equal |(0 + 0.5 + 0.75 + 1 + 2 + 3) - (0 + 0 + 1 + 1 + 2 + 3)| = 0.25.
Submitted Solution:
```
from sys import *
import math
def numline(f = int):
return map(f, input().split())
n = int(input())
a = list(filter(lambda x: x != 0, numline(lambda s: int(s.split('.')[1]))))
c0 = min(2 * n - len(a), len(a))
ans = sum(a) - 1000 * min(n, len(a))
while c0 > 0 and abs(ans) > 1000:
c0 -= 1
if ans > 0:
ans -= 1000
else:
ans += 1000
if c0 > 0:
if ans > 0:
ans = min(ans, abs(1000 - ans))
else:
ans = min(abs(ans), abs(ans + 1000))
ans = abs(ans)
print('{}.{:0>3}'.format(ans // 1000, ans % 1000))
``` | instruction | 0 | 101,509 | 5 | 203,018 |
No | output | 1 | 101,509 | 5 | 203,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jeff got 2n real numbers a1, a2, ..., a2n as a birthday present. The boy hates non-integer numbers, so he decided to slightly "adjust" the numbers he's got. Namely, Jeff consecutively executes n operations, each of them goes as follows:
* choose indexes i and j (i ≠ j) that haven't been chosen yet;
* round element ai to the nearest integer that isn't more than ai (assign to ai: ⌊ ai ⌋);
* round element aj to the nearest integer that isn't less than aj (assign to aj: ⌈ aj ⌉).
Nevertheless, Jeff doesn't want to hurt the feelings of the person who gave him the sequence. That's why the boy wants to perform the operations so as to make the absolute value of the difference between the sum of elements before performing the operations and the sum of elements after performing the operations as small as possible. Help Jeff find the minimum absolute value of the difference.
Input
The first line contains integer n (1 ≤ n ≤ 2000). The next line contains 2n real numbers a1, a2, ..., a2n (0 ≤ ai ≤ 10000), given with exactly three digits after the decimal point. The numbers are separated by spaces.
Output
In a single line print a single real number — the required difference with exactly three digits after the decimal point.
Examples
Input
3
0.000 0.500 0.750 1.000 2.000 3.000
Output
0.250
Input
3
4469.000 6526.000 4864.000 9356.383 7490.000 995.896
Output
0.279
Note
In the first test case you need to perform the operations as follows: (i = 1, j = 4), (i = 2, j = 3), (i = 5, j = 6). In this case, the difference will equal |(0 + 0.5 + 0.75 + 1 + 2 + 3) - (0 + 0 + 1 + 1 + 2 + 3)| = 0.25.
Submitted Solution:
```
n = int(input())
As = list(map(float, input().split()))
B = list(x - int(x) for x in As if x - int(x) > 0.000)
l = len(B)
if l == 0:
print('{:.3f}'.format(0))
exit(0)
S = sum(x for x in B)
ll = l if l % 2 == 0 else l + 1
print(B)
print(S)
ans = 1e10
for i in range(max(0,int(l - n)), min(n, int(ll/2)) + 1):
ans = min(ans, abs(i - S))
print('{:.3f}'.format(ans))
``` | instruction | 0 | 101,510 | 5 | 203,020 |
No | output | 1 | 101,510 | 5 | 203,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jeff got 2n real numbers a1, a2, ..., a2n as a birthday present. The boy hates non-integer numbers, so he decided to slightly "adjust" the numbers he's got. Namely, Jeff consecutively executes n operations, each of them goes as follows:
* choose indexes i and j (i ≠ j) that haven't been chosen yet;
* round element ai to the nearest integer that isn't more than ai (assign to ai: ⌊ ai ⌋);
* round element aj to the nearest integer that isn't less than aj (assign to aj: ⌈ aj ⌉).
Nevertheless, Jeff doesn't want to hurt the feelings of the person who gave him the sequence. That's why the boy wants to perform the operations so as to make the absolute value of the difference between the sum of elements before performing the operations and the sum of elements after performing the operations as small as possible. Help Jeff find the minimum absolute value of the difference.
Input
The first line contains integer n (1 ≤ n ≤ 2000). The next line contains 2n real numbers a1, a2, ..., a2n (0 ≤ ai ≤ 10000), given with exactly three digits after the decimal point. The numbers are separated by spaces.
Output
In a single line print a single real number — the required difference with exactly three digits after the decimal point.
Examples
Input
3
0.000 0.500 0.750 1.000 2.000 3.000
Output
0.250
Input
3
4469.000 6526.000 4864.000 9356.383 7490.000 995.896
Output
0.279
Note
In the first test case you need to perform the operations as follows: (i = 1, j = 4), (i = 2, j = 3), (i = 5, j = 6). In this case, the difference will equal |(0 + 0.5 + 0.75 + 1 + 2 + 3) - (0 + 0 + 1 + 1 + 2 + 3)| = 0.25.
Submitted Solution:
```
from fractions import Fraction
n = int(input())
a = [Fraction(int(x[-3:]), 1000) for x in input().split()]
a = list(sorted(a))
ans = sum(a) - len(a) // 2
while len(a) > 0 and a[1] == 0:
if (abs(ans) > abs(ans - sum(a[:2]) + 1)):
ans = ans - sum(a[:2]) + 1
del a[:2]
print("0.{:03d}".format(abs(ans.numerator * 1000 // ans.denominator)))
``` | instruction | 0 | 101,511 | 5 | 203,022 |
No | output | 1 | 101,511 | 5 | 203,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jeff got 2n real numbers a1, a2, ..., a2n as a birthday present. The boy hates non-integer numbers, so he decided to slightly "adjust" the numbers he's got. Namely, Jeff consecutively executes n operations, each of them goes as follows:
* choose indexes i and j (i ≠ j) that haven't been chosen yet;
* round element ai to the nearest integer that isn't more than ai (assign to ai: ⌊ ai ⌋);
* round element aj to the nearest integer that isn't less than aj (assign to aj: ⌈ aj ⌉).
Nevertheless, Jeff doesn't want to hurt the feelings of the person who gave him the sequence. That's why the boy wants to perform the operations so as to make the absolute value of the difference between the sum of elements before performing the operations and the sum of elements after performing the operations as small as possible. Help Jeff find the minimum absolute value of the difference.
Input
The first line contains integer n (1 ≤ n ≤ 2000). The next line contains 2n real numbers a1, a2, ..., a2n (0 ≤ ai ≤ 10000), given with exactly three digits after the decimal point. The numbers are separated by spaces.
Output
In a single line print a single real number — the required difference with exactly three digits after the decimal point.
Examples
Input
3
0.000 0.500 0.750 1.000 2.000 3.000
Output
0.250
Input
3
4469.000 6526.000 4864.000 9356.383 7490.000 995.896
Output
0.279
Note
In the first test case you need to perform the operations as follows: (i = 1, j = 4), (i = 2, j = 3), (i = 5, j = 6). In this case, the difference will equal |(0 + 0.5 + 0.75 + 1 + 2 + 3) - (0 + 0 + 1 + 1 + 2 + 3)| = 0.25.
Submitted Solution:
```
n = int(input())
a = [float(x) - int(float(x)) for x in input().split()]
a = list(sorted(a))
while len(a) > 0 and a[1] == 0:
del a[:2]
print(a)
print("{:.3f}".format(abs(sum(a[:len(a) // 2]) - (len(a) // 2) + sum(a[len(a) // 2:]))))
``` | instruction | 0 | 101,512 | 5 | 203,024 |
No | output | 1 | 101,512 | 5 | 203,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
User ainta is making a web site. This time he is going to make a navigation of the pages. In his site, there are n pages numbered by integers from 1 to n. Assume that somebody is on the p-th page now. The navigation will look like this:
<< p - k p - k + 1 ... p - 1 (p) p + 1 ... p + k - 1 p + k >>
When someone clicks the button "<<" he is redirected to page 1, and when someone clicks the button ">>" he is redirected to page n. Of course if someone clicks on a number, he is redirected to the corresponding page.
There are some conditions in the navigation:
* If page 1 is in the navigation, the button "<<" must not be printed.
* If page n is in the navigation, the button ">>" must not be printed.
* If the page number is smaller than 1 or greater than n, it must not be printed.
You can see some examples of the navigations. Make a program that prints the navigation.
Input
The first and the only line contains three integers n, p, k (3 ≤ n ≤ 100; 1 ≤ p ≤ n; 1 ≤ k ≤ n)
Output
Print the proper navigation. Follow the format of the output from the test samples.
Examples
Input
17 5 2
Output
<< 3 4 (5) 6 7 >>
Input
6 5 2
Output
<< 3 4 (5) 6
Input
6 1 2
Output
(1) 2 3 >>
Input
6 2 2
Output
1 (2) 3 4 >>
Input
9 6 3
Output
<< 3 4 5 (6) 7 8 9
Input
10 6 3
Output
<< 3 4 5 (6) 7 8 9 >>
Input
8 5 4
Output
1 2 3 4 (5) 6 7 8
Submitted Solution:
```
x,y,z=map(int,input().split())
ok=1
ko=1
if 1>=y-z :
ok=0
if x<=y+z :
ko=0
if ok==1 :
print("<<",end=' ')
for i in range(max(1,y-z),min(x,y+z)+1) :
if i == y :
print('(',end='')
print(i,end='')
print(')',end=' ')
else:
print(i,end=' ')
if ko == 1:
print(">>")
``` | instruction | 0 | 101,521 | 5 | 203,042 |
Yes | output | 1 | 101,521 | 5 | 203,043 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
User ainta is making a web site. This time he is going to make a navigation of the pages. In his site, there are n pages numbered by integers from 1 to n. Assume that somebody is on the p-th page now. The navigation will look like this:
<< p - k p - k + 1 ... p - 1 (p) p + 1 ... p + k - 1 p + k >>
When someone clicks the button "<<" he is redirected to page 1, and when someone clicks the button ">>" he is redirected to page n. Of course if someone clicks on a number, he is redirected to the corresponding page.
There are some conditions in the navigation:
* If page 1 is in the navigation, the button "<<" must not be printed.
* If page n is in the navigation, the button ">>" must not be printed.
* If the page number is smaller than 1 or greater than n, it must not be printed.
You can see some examples of the navigations. Make a program that prints the navigation.
Input
The first and the only line contains three integers n, p, k (3 ≤ n ≤ 100; 1 ≤ p ≤ n; 1 ≤ k ≤ n)
Output
Print the proper navigation. Follow the format of the output from the test samples.
Examples
Input
17 5 2
Output
<< 3 4 (5) 6 7 >>
Input
6 5 2
Output
<< 3 4 (5) 6
Input
6 1 2
Output
(1) 2 3 >>
Input
6 2 2
Output
1 (2) 3 4 >>
Input
9 6 3
Output
<< 3 4 5 (6) 7 8 9
Input
10 6 3
Output
<< 3 4 5 (6) 7 8 9 >>
Input
8 5 4
Output
1 2 3 4 (5) 6 7 8
Submitted Solution:
```
n = list(map(lambda x: int(x), input().split(' ')))
n, p, k = n[0], n[1], n[2]
pages = []
for i in range(-k, k+1):
if p + i == p:
pages.append(f'({p})')
elif p + i > 0 and p + i < n + 1:
pages.append(str(p+i))
if '1' not in pages and '(1)' not in pages:
pages.insert(0, '<<')
if str(n) not in pages and f'({n})' not in pages:
pages.append('>>')
print(str(' '.join(pages)))
``` | instruction | 0 | 101,522 | 5 | 203,044 |
Yes | output | 1 | 101,522 | 5 | 203,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
User ainta is making a web site. This time he is going to make a navigation of the pages. In his site, there are n pages numbered by integers from 1 to n. Assume that somebody is on the p-th page now. The navigation will look like this:
<< p - k p - k + 1 ... p - 1 (p) p + 1 ... p + k - 1 p + k >>
When someone clicks the button "<<" he is redirected to page 1, and when someone clicks the button ">>" he is redirected to page n. Of course if someone clicks on a number, he is redirected to the corresponding page.
There are some conditions in the navigation:
* If page 1 is in the navigation, the button "<<" must not be printed.
* If page n is in the navigation, the button ">>" must not be printed.
* If the page number is smaller than 1 or greater than n, it must not be printed.
You can see some examples of the navigations. Make a program that prints the navigation.
Input
The first and the only line contains three integers n, p, k (3 ≤ n ≤ 100; 1 ≤ p ≤ n; 1 ≤ k ≤ n)
Output
Print the proper navigation. Follow the format of the output from the test samples.
Examples
Input
17 5 2
Output
<< 3 4 (5) 6 7 >>
Input
6 5 2
Output
<< 3 4 (5) 6
Input
6 1 2
Output
(1) 2 3 >>
Input
6 2 2
Output
1 (2) 3 4 >>
Input
9 6 3
Output
<< 3 4 5 (6) 7 8 9
Input
10 6 3
Output
<< 3 4 5 (6) 7 8 9 >>
Input
8 5 4
Output
1 2 3 4 (5) 6 7 8
Submitted Solution:
```
a,b,k = map(int,input().split(" "))
flag1 = True
flag2 = True
if b-k > 1:
print("<<",end=" ")
for i in range(b-k,b+k+1):
if i > a:
break
if i > 0:
if i == b:
print("("+str(i)+")",end=" ")
else:
print(i,end=" ")
if b+k < a:
print(">>")
``` | instruction | 0 | 101,523 | 5 | 203,046 |
Yes | output | 1 | 101,523 | 5 | 203,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
User ainta is making a web site. This time he is going to make a navigation of the pages. In his site, there are n pages numbered by integers from 1 to n. Assume that somebody is on the p-th page now. The navigation will look like this:
<< p - k p - k + 1 ... p - 1 (p) p + 1 ... p + k - 1 p + k >>
When someone clicks the button "<<" he is redirected to page 1, and when someone clicks the button ">>" he is redirected to page n. Of course if someone clicks on a number, he is redirected to the corresponding page.
There are some conditions in the navigation:
* If page 1 is in the navigation, the button "<<" must not be printed.
* If page n is in the navigation, the button ">>" must not be printed.
* If the page number is smaller than 1 or greater than n, it must not be printed.
You can see some examples of the navigations. Make a program that prints the navigation.
Input
The first and the only line contains three integers n, p, k (3 ≤ n ≤ 100; 1 ≤ p ≤ n; 1 ≤ k ≤ n)
Output
Print the proper navigation. Follow the format of the output from the test samples.
Examples
Input
17 5 2
Output
<< 3 4 (5) 6 7 >>
Input
6 5 2
Output
<< 3 4 (5) 6
Input
6 1 2
Output
(1) 2 3 >>
Input
6 2 2
Output
1 (2) 3 4 >>
Input
9 6 3
Output
<< 3 4 5 (6) 7 8 9
Input
10 6 3
Output
<< 3 4 5 (6) 7 8 9 >>
Input
8 5 4
Output
1 2 3 4 (5) 6 7 8
Submitted Solution:
```
# cook your dish here
n,p,k = map(int,(input()).split())
result_list = ['({p})'.format(p=p)]
end=beg=p
if p<n:
for i in range(k):
if end>=n:
break
end+=1
result_list.append(end)
if end<n:
result_list.append('>>')
if p>1:
for i in range(k):
if beg<=1:
break
beg-=1
result_list.insert(0,beg)
if beg>1:
result_list.insert(0,'<<')
for i in result_list:
print(i,end=' ')
``` | instruction | 0 | 101,524 | 5 | 203,048 |
Yes | output | 1 | 101,524 | 5 | 203,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
User ainta is making a web site. This time he is going to make a navigation of the pages. In his site, there are n pages numbered by integers from 1 to n. Assume that somebody is on the p-th page now. The navigation will look like this:
<< p - k p - k + 1 ... p - 1 (p) p + 1 ... p + k - 1 p + k >>
When someone clicks the button "<<" he is redirected to page 1, and when someone clicks the button ">>" he is redirected to page n. Of course if someone clicks on a number, he is redirected to the corresponding page.
There are some conditions in the navigation:
* If page 1 is in the navigation, the button "<<" must not be printed.
* If page n is in the navigation, the button ">>" must not be printed.
* If the page number is smaller than 1 or greater than n, it must not be printed.
You can see some examples of the navigations. Make a program that prints the navigation.
Input
The first and the only line contains three integers n, p, k (3 ≤ n ≤ 100; 1 ≤ p ≤ n; 1 ≤ k ≤ n)
Output
Print the proper navigation. Follow the format of the output from the test samples.
Examples
Input
17 5 2
Output
<< 3 4 (5) 6 7 >>
Input
6 5 2
Output
<< 3 4 (5) 6
Input
6 1 2
Output
(1) 2 3 >>
Input
6 2 2
Output
1 (2) 3 4 >>
Input
9 6 3
Output
<< 3 4 5 (6) 7 8 9
Input
10 6 3
Output
<< 3 4 5 (6) 7 8 9 >>
Input
8 5 4
Output
1 2 3 4 (5) 6 7 8
Submitted Solution:
```
output=''
n, p , k = input().split()
n = int(n)
p=int(p)
k = int(k)
for i in range(p-k,p+k+1):
if i <=0:
pass
elif i == p:
output+= '(' + str(i) + ') '
elif i == n:
output+= str(i) + ' '
break
else:
output+= str(i) + ' '
if output[0:2]== '1 ' or output[0]== '(':
pass
else:
output = '<< ' + output
if output[-2] == str(n) or output[-2] == ')':
pass
else:
output = output + '>>'
print(output)
``` | instruction | 0 | 101,525 | 5 | 203,050 |
No | output | 1 | 101,525 | 5 | 203,051 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
User ainta is making a web site. This time he is going to make a navigation of the pages. In his site, there are n pages numbered by integers from 1 to n. Assume that somebody is on the p-th page now. The navigation will look like this:
<< p - k p - k + 1 ... p - 1 (p) p + 1 ... p + k - 1 p + k >>
When someone clicks the button "<<" he is redirected to page 1, and when someone clicks the button ">>" he is redirected to page n. Of course if someone clicks on a number, he is redirected to the corresponding page.
There are some conditions in the navigation:
* If page 1 is in the navigation, the button "<<" must not be printed.
* If page n is in the navigation, the button ">>" must not be printed.
* If the page number is smaller than 1 or greater than n, it must not be printed.
You can see some examples of the navigations. Make a program that prints the navigation.
Input
The first and the only line contains three integers n, p, k (3 ≤ n ≤ 100; 1 ≤ p ≤ n; 1 ≤ k ≤ n)
Output
Print the proper navigation. Follow the format of the output from the test samples.
Examples
Input
17 5 2
Output
<< 3 4 (5) 6 7 >>
Input
6 5 2
Output
<< 3 4 (5) 6
Input
6 1 2
Output
(1) 2 3 >>
Input
6 2 2
Output
1 (2) 3 4 >>
Input
9 6 3
Output
<< 3 4 5 (6) 7 8 9
Input
10 6 3
Output
<< 3 4 5 (6) 7 8 9 >>
Input
8 5 4
Output
1 2 3 4 (5) 6 7 8
Submitted Solution:
```
n, p, k = map(int, input().split())
if (p - k > 1) and (p + k < n):
print("<< ", end="")
for c in range(p - k, p + k + 1):
if c == p:
print('(' + str(p) + ')', end=" ")
else:
print(str(c) + " ", end="")
print(">>")
elif p - k <= 1:
for c in range(1, p + k + 1):
if c == p:
print('(' + str(p) + ')', end=" ")
else:
print(str(c) + " ", end="")
print(">>")
else:
print("<< ", end="")
for c in range(p - k, n + 1):
if c == p:
print('(' + str(p) + ')', end=" ")
else:
print(str(c) + " ", end="")
``` | instruction | 0 | 101,526 | 5 | 203,052 |
No | output | 1 | 101,526 | 5 | 203,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
User ainta is making a web site. This time he is going to make a navigation of the pages. In his site, there are n pages numbered by integers from 1 to n. Assume that somebody is on the p-th page now. The navigation will look like this:
<< p - k p - k + 1 ... p - 1 (p) p + 1 ... p + k - 1 p + k >>
When someone clicks the button "<<" he is redirected to page 1, and when someone clicks the button ">>" he is redirected to page n. Of course if someone clicks on a number, he is redirected to the corresponding page.
There are some conditions in the navigation:
* If page 1 is in the navigation, the button "<<" must not be printed.
* If page n is in the navigation, the button ">>" must not be printed.
* If the page number is smaller than 1 or greater than n, it must not be printed.
You can see some examples of the navigations. Make a program that prints the navigation.
Input
The first and the only line contains three integers n, p, k (3 ≤ n ≤ 100; 1 ≤ p ≤ n; 1 ≤ k ≤ n)
Output
Print the proper navigation. Follow the format of the output from the test samples.
Examples
Input
17 5 2
Output
<< 3 4 (5) 6 7 >>
Input
6 5 2
Output
<< 3 4 (5) 6
Input
6 1 2
Output
(1) 2 3 >>
Input
6 2 2
Output
1 (2) 3 4 >>
Input
9 6 3
Output
<< 3 4 5 (6) 7 8 9
Input
10 6 3
Output
<< 3 4 5 (6) 7 8 9 >>
Input
8 5 4
Output
1 2 3 4 (5) 6 7 8
Submitted Solution:
```
n, p, k = map(int, input().split())
mas = []
for i in range(p , p - k - 1,-1):
if i == 1:
mas.append(i)
break
else:
mas.append(i)
mas.reverse()
for i in range(p + 1, p + k + 1):
if i == n:
mas.append(i)
break
else:
mas.append(i)
if mas[0] != 1:
print("<<", end = " ")
for i in mas:
if i == p:
print("({})".format(i), end = " ")
else:
print(i, end = " ")
if mas[-1] != n:
print(">>")
``` | instruction | 0 | 101,527 | 5 | 203,054 |
No | output | 1 | 101,527 | 5 | 203,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
User ainta is making a web site. This time he is going to make a navigation of the pages. In his site, there are n pages numbered by integers from 1 to n. Assume that somebody is on the p-th page now. The navigation will look like this:
<< p - k p - k + 1 ... p - 1 (p) p + 1 ... p + k - 1 p + k >>
When someone clicks the button "<<" he is redirected to page 1, and when someone clicks the button ">>" he is redirected to page n. Of course if someone clicks on a number, he is redirected to the corresponding page.
There are some conditions in the navigation:
* If page 1 is in the navigation, the button "<<" must not be printed.
* If page n is in the navigation, the button ">>" must not be printed.
* If the page number is smaller than 1 or greater than n, it must not be printed.
You can see some examples of the navigations. Make a program that prints the navigation.
Input
The first and the only line contains three integers n, p, k (3 ≤ n ≤ 100; 1 ≤ p ≤ n; 1 ≤ k ≤ n)
Output
Print the proper navigation. Follow the format of the output from the test samples.
Examples
Input
17 5 2
Output
<< 3 4 (5) 6 7 >>
Input
6 5 2
Output
<< 3 4 (5) 6
Input
6 1 2
Output
(1) 2 3 >>
Input
6 2 2
Output
1 (2) 3 4 >>
Input
9 6 3
Output
<< 3 4 5 (6) 7 8 9
Input
10 6 3
Output
<< 3 4 5 (6) 7 8 9 >>
Input
8 5 4
Output
1 2 3 4 (5) 6 7 8
Submitted Solution:
```
def solve():
n, p, k = map(int, input().split())
pages = range(1, n + 1)
result = []
if p - 1 - k > 1:
result.append('<<')
left_side = p - 1 - k
left_side = left_side if left_side > 0 else 0
result.extend(pages[left_side:p - 1])
result.append('({})'.format(pages[p - 1]))
result.extend(pages[p:p + k])
if p + k < n:
result.append('>>')
print(' '.join(map(str, result)))
``` | instruction | 0 | 101,528 | 5 | 203,056 |
No | output | 1 | 101,528 | 5 | 203,057 |
Provide a correct Python 3 solution for this coding contest problem.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5 | instruction | 0 | 101,808 | 5 | 203,616 |
"Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
from collections import *
c=Counter(l)
a=sum(i*(i-1)//2 for i in c.values())
for i in l: print(a-c[i]+1)
``` | output | 1 | 101,808 | 5 | 203,617 |
Provide a correct Python 3 solution for this coding contest problem.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5 | instruction | 0 | 101,809 | 5 | 203,618 |
"Correct Solution:
```
from collections import Counter
N = int(input())
A = list(map(int, input().split()))
ans = 0
c = Counter(A)
for v in c.values():
ans += v*(v-1)//2
for i in A:
print(ans - (c[i] - 1))
``` | output | 1 | 101,809 | 5 | 203,619 |
Provide a correct Python 3 solution for this coding contest problem.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5 | instruction | 0 | 101,810 | 5 | 203,620 |
"Correct Solution:
```
import collections
N = int(input())
A = list(map(int,input().split()))
C = collections.Counter(A)
ans = 0
for i in C.values():
ans += int(0.5* i * (i-1))
for j in A:
print(ans-C[j]+1)
``` | output | 1 | 101,810 | 5 | 203,621 |
Provide a correct Python 3 solution for this coding contest problem.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5 | instruction | 0 | 101,811 | 5 | 203,622 |
"Correct Solution:
```
N = int(input())
A = list(map(int,input().split()))
C = [0] * (N + 1)
for i in A:
C[i] += 1
ans = 0
for i in C:
ans += i * (i - 1) // 2
for i in range(N):
print(ans - C[A[i]] + 1)
``` | output | 1 | 101,811 | 5 | 203,623 |
Provide a correct Python 3 solution for this coding contest problem.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5 | instruction | 0 | 101,812 | 5 | 203,624 |
"Correct Solution:
```
from collections import Counter
n=int(input())
a=list(map(int,input().split()))
c=Counter(a)
s=0
for key in c:
s+=c[key]*(c[key]-1)//2
for item in a:
print(s-c[item]+1)
``` | output | 1 | 101,812 | 5 | 203,625 |
Provide a correct Python 3 solution for this coding contest problem.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5 | instruction | 0 | 101,813 | 5 | 203,626 |
"Correct Solution:
```
n = int(input())
A = list(map(int, input().split()))
import collections
c = collections.Counter(A)
ans = sum([j*(j-1)//2 for j in c.values()])
for x in A:
print(ans-(c[x]-1))
``` | output | 1 | 101,813 | 5 | 203,627 |
Provide a correct Python 3 solution for this coding contest problem.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5 | instruction | 0 | 101,814 | 5 | 203,628 |
"Correct Solution:
```
N = int(input())
A = list(map(int, input().split()))
B = [0 for i in range(N)]
for a in A:
B[a-1] += 1
s = 0
for b in B:
s += b * (b-1) // 2
for a in A:
print(s - (B[a-1]-1))
``` | output | 1 | 101,814 | 5 | 203,629 |
Provide a correct Python 3 solution for this coding contest problem.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5 | instruction | 0 | 101,815 | 5 | 203,630 |
"Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
b = {}
for x in a:
b.setdefault(x, 0)
b[x] += 1
ans = 0
for x in b.values():
ans += x * (x - 1) // 2
for x in a:
print(ans - b[x] + 1)
``` | output | 1 | 101,815 | 5 | 203,631 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5
Submitted Solution:
```
import collections as cl
N = int(input())
A = list(map(int,input().split()))
cn = cl.Counter(A)
sumC = sum([n*(n-1)//2 for n in cn.values()])
for k in range(N):
print(sumC - cn[A[k]] +1)
``` | instruction | 0 | 101,816 | 5 | 203,632 |
Yes | output | 1 | 101,816 | 5 | 203,633 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5
Submitted Solution:
```
n = int(input())
a = list(map(int, input().split()))
b = [0]*n
for i in range(n):
b[a[i]-1] += 1
c = sum([(i*(i-1))//2 for i in b])
for i in a:
print(c-(b[i-1]-1))
``` | instruction | 0 | 101,817 | 5 | 203,634 |
Yes | output | 1 | 101,817 | 5 | 203,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5
Submitted Solution:
```
from collections import Counter
N = int(input())
A = list(map(int, input().split()))
C = Counter(A)
x = 0
for i in C:
x += C[i] * (C[i] - 1) // 2
for a in A:
print(x - (C[a] - 1))
``` | instruction | 0 | 101,818 | 5 | 203,636 |
Yes | output | 1 | 101,818 | 5 | 203,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5
Submitted Solution:
```
n = int(input())
lis = list(map(int, input().split()))
ban = [0] * n
tmp = 0
for i in lis:
ban[i-1] += 1
for i in ban:
tmp += i*(i-1)//2
for i in lis:
print(tmp+(1-ban[i-1]))
``` | instruction | 0 | 101,819 | 5 | 203,638 |
Yes | output | 1 | 101,819 | 5 | 203,639 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5
Submitted Solution:
```
def main():
import sys
input = sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
dic={}
for i in a:
if i in dic:
dic[i]+=1
else:
dic[i]=1
for i in list(dic):
if dic[i]==1:
dic.pop(i)
sum=0
for j in dic:
k=dic[j]
if k>1:
sum+=k*(k-1)//2
for i in range(n):
ans=0
if not dic:
ans=0
else:
k=dic[a[i]]
l=k-1
if k>1:
ans=sum-k*(k-1)//2+l*(l-1)//2
print(ans)
if __name__ == '__main__':
main()
``` | instruction | 0 | 101,820 | 5 | 203,640 |
No | output | 1 | 101,820 | 5 | 203,641 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5
Submitted Solution:
```
import math
import collections
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N = int(input())
A = list(map(int, input().split()))
for i in range(N):
result = 0
pop = A.pop(i)
c = collections.Counter(A)
for k, v in c.items():
if v > 1:
result = result + combinations_count(v, 2)
A.insert(i, pop)
print(result)
``` | instruction | 0 | 101,821 | 5 | 203,642 |
No | output | 1 | 101,821 | 5 | 203,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5
Submitted Solution:
```
import math
N = int(input())
A = list(map(int, input().split()))
ans = 0
C = list(set(A))
M = len(C)
t = []
anst = 0
for i in range(M):
t.append(A.count(C[i]))
temp = A.count(C[i])
if temp >=2:
anst += temp*(temp-1)/2
#print(t)
#print(anst)
#print(jisyo[1])
for i in range(N):
#print(t[C.index(A[i])])
print(int(anst-t[C.index(A[i])]+1))
``` | instruction | 0 | 101,822 | 5 | 203,644 |
No | output | 1 | 101,822 | 5 | 203,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.
* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.
Constraints
* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 A_2 ... A_N
Output
For each k=1,2,...,N, print a line containing the answer.
Examples
Input
5
1 1 2 1 2
Output
2
2
3
2
3
Input
4
1 2 3 4
Output
0
0
0
0
Input
5
3 3 3 3 3
Output
6
6
6
6
6
Input
8
1 2 1 4 2 1 4 1
Output
5
7
5
7
7
5
7
5
Submitted Solution:
```
import collections
n=int(input())
a=list(map(int,input().split()))
c = collections.Counter(a)
a1=len(list(set(a)))
total=0
for j in range(a1):
x=c.most_common()[j][1]
total+=x*(x-1)/2
print('total',total)
for i in range(n):
ans=total-a.count(a[i])+1
print(int(ans))
``` | instruction | 0 | 101,823 | 5 | 203,646 |
No | output | 1 | 101,823 | 5 | 203,647 |
Provide a correct Python 3 solution for this coding contest problem.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999 | instruction | 0 | 101,824 | 5 | 203,648 |
"Correct Solution:
```
N=int(input())
if N%2==0:
print((N-1)//2)
else:
print(N//2)
``` | output | 1 | 101,824 | 5 | 203,649 |
Provide a correct Python 3 solution for this coding contest problem.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999 | instruction | 0 | 101,825 | 5 | 203,650 |
"Correct Solution:
```
n=int(input())
from math import factorial
print((n-1)//2)
``` | output | 1 | 101,825 | 5 | 203,651 |
Provide a correct Python 3 solution for this coding contest problem.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999 | instruction | 0 | 101,826 | 5 | 203,652 |
"Correct Solution:
```
n=int(input())
if n%2==0:n=n/2-1
else:n=n//2
print(int(n))
``` | output | 1 | 101,826 | 5 | 203,653 |
Provide a correct Python 3 solution for this coding contest problem.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999 | instruction | 0 | 101,827 | 5 | 203,654 |
"Correct Solution:
```
n=int(input())
print(int(n/2)-1 if n%2==0 else int((n-1)/2))
``` | output | 1 | 101,827 | 5 | 203,655 |
Provide a correct Python 3 solution for this coding contest problem.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999 | instruction | 0 | 101,828 | 5 | 203,656 |
"Correct Solution:
```
n = int(input())
print(int(n / 2) - (1 - (n % 2)))
``` | output | 1 | 101,828 | 5 | 203,657 |
Provide a correct Python 3 solution for this coding contest problem.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999 | instruction | 0 | 101,829 | 5 | 203,658 |
"Correct Solution:
```
n = int(input())
print(max(0,((n-1)//2)))
``` | output | 1 | 101,829 | 5 | 203,659 |
Provide a correct Python 3 solution for this coding contest problem.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999 | instruction | 0 | 101,830 | 5 | 203,660 |
"Correct Solution:
```
N = int(input())
print(N // 2 - 1 + N % 2)
``` | output | 1 | 101,830 | 5 | 203,661 |
Provide a correct Python 3 solution for this coding contest problem.
How many ways are there to choose two distinct positive integers totaling N, disregarding the order?
Constraints
* 1 \leq N \leq 10^6
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
4
Output
1
Input
999999
Output
499999 | instruction | 0 | 101,831 | 5 | 203,662 |
"Correct Solution:
```
N=int(input());
print((N-1)//2);
``` | output | 1 | 101,831 | 5 | 203,663 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.