message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 276 109k | cluster float64 23 23 | __index_level_0__ int64 552 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that we are given a matrix b of size x × y, let's determine the operation of mirroring matrix b. The mirroring of matrix b is a 2x × y matrix c which has the following properties:
... | instruction | 0 | 38,030 | 23 | 76,060 |
No | output | 1 | 38,030 | 23 | 76,061 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that we are given a matrix b of size x × y, let's determine the operation of mirroring matrix b. The mirroring of matrix b is a 2x × y matrix c which has the following properties:
... | instruction | 0 | 38,031 | 23 | 76,062 |
No | output | 1 | 38,031 | 23 | 76,063 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that we are given a matrix b of size x × y, let's determine the operation of mirroring matrix b. The mirroring of matrix b is a 2x × y matrix c which has the following properties:
... | instruction | 0 | 38,032 | 23 | 76,064 |
No | output | 1 | 38,032 | 23 | 76,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three sticks with positive integer lengths of a, b, and c centimeters. You can increase length of some of them by some positive integer number of centimeters (different sticks can be increased by a different length), but in tot... | instruction | 0 | 38,102 | 23 | 76,204 |
Tags: combinatorics, implementation, math
Correct Solution:
```
def f(a, b, c, l):
k = min(l, a - b - c)
return 0 if a < b + c else (k + 1) * (k + 2) // 2
solve = lambda i: f(a + i, b, c, l - i) + f(b + i, c, a, l - i) + f(c + i, a, b, l - i)
a, b, c, l = map(int, input().split())
ans = (l + 1) * (l + 2) * (l ... | output | 1 | 38,102 | 23 | 76,205 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three sticks with positive integer lengths of a, b, and c centimeters. You can increase length of some of them by some positive integer number of centimeters (different sticks can be increased by a different length), but in tot... | instruction | 0 | 38,103 | 23 | 76,206 |
Tags: combinatorics, implementation, math
Correct Solution:
```
a, b, c, l = map(int, input().split())
ans = (l + 3) * (l + 2) * (l + 1) // 3
for z in (a, b, c):
s = 2 * z - a - b - c
for x in range(max(0, -s), l + 1):
m = min(s + x, l - x)
ans -= (m + 1) * (m + 2)
print(ans // 2)
# Ma... | output | 1 | 38,103 | 23 | 76,207 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three sticks with positive integer lengths of a, b, and c centimeters. You can increase length of some of them by some positive integer number of centimeters (different sticks can be increased by a different length), but in tot... | instruction | 0 | 38,104 | 23 | 76,208 |
Tags: combinatorics, implementation, math
Correct Solution:
```
def f(a,b,c,l):
if a<b+c:
return 0
else:
c=min(l,a-b-c)
return (c+1)*(c+2)/2
a,b,c,l = map(int,input().split())
z=(l+1)*(l+2)*(l+3)/6
i=0
while i<=l:
z-=f(a+i,b,c,l-i)+f(b+i,c,a,l-i)+f(c+i,a,b,l-i)
i+=1
print(int(z)... | output | 1 | 38,104 | 23 | 76,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three sticks with positive integer lengths of a, b, and c centimeters. You can increase length of some of them by some positive integer number of centimeters (different sticks can ... | instruction | 0 | 38,105 | 23 | 76,210 |
No | output | 1 | 38,105 | 23 | 76,211 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are integers and 0 ≤ x, y. There is a tree in such a... | instruction | 0 | 38,232 | 23 | 76,464 |
Tags: brute force, math
Correct Solution:
```
m, b = map(int, input().split())
x, y = m*b, b
s = 0
for j in range(y+1):
i = m * (b - j)
a1 = i * (1 + i) >> 1
d = i + 1
n = j + 1
s = max(s, n * (2 * a1 + (n - 1) * d) >> 1)
print(s)
``` | output | 1 | 38,232 | 23 | 76,465 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are integers and 0 ≤ x, y. There is a tree in such a... | instruction | 0 | 38,233 | 23 | 76,466 |
Tags: brute force, math
Correct Solution:
```
def sigma(n):
return n * (n + 1) // 2
def banans(p, q):
return (p + 1) * sigma(q) + (q + 1) * sigma(p)
m, b = [int(x) for x in input().split()]
r = 0
for i in range(m * b + 1):
if i % m == 0:
p, q = i, b - i // m
r = max(r, banans(p, q))
prin... | output | 1 | 38,233 | 23 | 76,467 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are integers and 0 ≤ x, y. There is a tree in such a... | instruction | 0 | 38,234 | 23 | 76,468 |
Tags: brute force, math
Correct Solution:
```
import math as mt
import sys,string
input=sys.stdin.readline
import random
from collections import deque,defaultdict
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split())
I=lambda :int(input())
def x(s,e):
retur... | output | 1 | 38,234 | 23 | 76,469 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are integers and 0 ≤ x, y. There is a tree in such a... | instruction | 0 | 38,235 | 23 | 76,470 |
Tags: brute force, math
Correct Solution:
```
import math,sys,bisect,heapq
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate
#sys.setrecursionlimit(200000000)
int1 = lambda x: int(x) - 1
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda: map(int... | output | 1 | 38,235 | 23 | 76,471 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are integers and 0 ≤ x, y. There is a tree in such a... | instruction | 0 | 38,236 | 23 | 76,472 |
Tags: brute force, math
Correct Solution:
```
# Time : 2017-6-26 13:30
# Auther : Anjone
# URL : http://codeforces.com/contest/821/problem/B
from math import floor;
getsum = lambda x,y : int((int(y)+1) * (int(x)+int(y)) * (int(x)+1) // 2)
m,b = map(int,input().split())
ans = 0
for i in range(b+1):
x = (b-i)*m
a... | output | 1 | 38,236 | 23 | 76,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are integers and 0 ≤ x, y. There is a tree in such a... | instruction | 0 | 38,237 | 23 | 76,474 |
Tags: brute force, math
Correct Solution:
```
def series(x):
return x*(x+1)//2
def max(a,b):
# print(type(a))
return a if a>b else b
m,b=map(int,input().split())
mymax=0
for y in range(0,b+1):
x = m*(b-y)
# t = 0
t=(x+1)*series(y)+(y+1)*series(x)
mymax = int(max(mymax, t))
print((mymax))
``` | output | 1 | 38,237 | 23 | 76,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are integers and 0 ≤ x, y. There is a tree in such a... | instruction | 0 | 38,238 | 23 | 76,476 |
Tags: brute force, math
Correct Solution:
```
ans = []
m,b = map(int,input().split())
for x in range(m*b + 1):
y = -x/m + b
if y.is_integer():
y = -x//m + b
start = (0 + x)*(x+1)//2
end = (start + y*(x+1))
ans.append(int((start+end)*(y+1)//2))
print(max(ans))
``` | output | 1 | 38,238 | 23 | 76,477 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are integers and 0 ≤ x, y. There is a tree in such a... | instruction | 0 | 38,239 | 23 | 76,478 |
Tags: brute force, math
Correct Solution:
```
m, b = [int(i) for i in input().split()]
res = 0
for i in range(b + 1):
j = (b - i) * m
res = max(res, (i + 1) * (j + 1) * (i + j) // 2)
print(res)
``` | output | 1 | 38,239 | 23 | 76,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are i... | instruction | 0 | 38,240 | 23 | 76,480 |
Yes | output | 1 | 38,240 | 23 | 76,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are i... | instruction | 0 | 38,242 | 23 | 76,484 |
Yes | output | 1 | 38,242 | 23 | 76,485 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are i... | instruction | 0 | 38,243 | 23 | 76,486 |
Yes | output | 1 | 38,243 | 23 | 76,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are i... | instruction | 0 | 38,244 | 23 | 76,488 |
No | output | 1 | 38,244 | 23 | 76,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are i... | instruction | 0 | 38,245 | 23 | 76,490 |
No | output | 1 | 38,245 | 23 | 76,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are i... | instruction | 0 | 38,246 | 23 | 76,492 |
No | output | 1 | 38,246 | 23 | 76,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs bananas for one of his experiments for some strange reason. So he decides to go to the forest and cut banana trees.
Consider the point (x, y) in the 2D plane such that x and y are i... | instruction | 0 | 38,247 | 23 | 76,494 |
No | output | 1 | 38,247 | 23 | 76,495 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
We will pour x~\mathrm{cm}^3 of water into the bottle, a... | instruction | 0 | 38,360 | 23 | 76,720 |
"Correct Solution:
```
from math import*
a,b,x=map(int,input().split())
print(atan(2*(b/a-x/a**3)if x>a*a*b/2else a*b*b/2/x)/pi*180)
``` | output | 1 | 38,360 | 23 | 76,721 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
We will pour x~\mathrm{cm}^3 of water into the bottle, a... | instruction | 0 | 38,361 | 23 | 76,722 |
"Correct Solution:
```
from math import atan, degrees
a, b, x = map(int, input().split())
rad = atan(2*(b/a-x/(a**3))) if x>=(a**2)*b/2 else atan(a*(b**2)/2/x)
print(degrees(rad))
``` | output | 1 | 38,361 | 23 | 76,723 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
We will pour x~\mathrm{cm}^3 of water into the bottle, a... | instruction | 0 | 38,362 | 23 | 76,724 |
"Correct Solution:
```
from math import atan,degrees
a,b,x = map(int,input().split())
if x <= a*a*b/2:
ans = atan(a*b*b/(2*x))
else:
ans = atan(2*b/a-2*x/a**3)
print(degrees(ans))
``` | output | 1 | 38,362 | 23 | 76,725 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
We will pour x~\mathrm{cm}^3 of water into the bottle, a... | instruction | 0 | 38,363 | 23 | 76,726 |
"Correct Solution:
```
from math import atan,pi
a,b,x=map(int,input().split())
if b-x/a**2 <= x/a**2:print(atan((b-x/a**2)/(a/2))*(180/pi))
else:
y = x/a*2/b
print(atan(b/y)*(180/pi))
``` | output | 1 | 38,363 | 23 | 76,727 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
We will pour x~\mathrm{cm}^3 of water into the bottle, a... | instruction | 0 | 38,364 | 23 | 76,728 |
"Correct Solution:
```
import math
a, b, x = map(int, input().split())
if (x/a**2)*2 < b:
print (math.degrees(math.atan((a*b*b)/(2*x))))
else:
print (math.degrees(math.atan((b-x/a**2)*2/a)))
``` | output | 1 | 38,364 | 23 | 76,729 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
We will pour x~\mathrm{cm}^3 of water into the bottle, a... | instruction | 0 | 38,365 | 23 | 76,730 |
"Correct Solution:
```
from math import *
a,b,x=map(int,input().split())
if 2*x<a*a*b:
print(atan(a*b*b/2/x)/pi*180)
else:
print(atan(-2/a/a/a*(x-a*a*b))/pi*180)
``` | output | 1 | 38,365 | 23 | 76,731 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
We will pour x~\mathrm{cm}^3 of water into the bottle, a... | instruction | 0 | 38,366 | 23 | 76,732 |
"Correct Solution:
```
a,b,x=map(int,input().split())
x/=a
import math
if x<=a*b/2:
print(math.degrees(math.atan(b*b/2/x)))
else:
print(math.degrees(math.atan(2*(a*b-x)/a/a)))
``` | output | 1 | 38,366 | 23 | 76,733 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
We will pour x~\mathrm{cm}^3 of water into the bottle, a... | instruction | 0 | 38,367 | 23 | 76,734 |
"Correct Solution:
```
import math
a,b,x=map(int,input().split())
v=a*a*b
if x>v/2:
print(math.degrees(math.atan(2*(b-x/(a**2))/a)))
else:
print(math.degrees(math.atan(a*b*b/(2*x))))
``` | output | 1 | 38,367 | 23 | 76,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
... | instruction | 0 | 38,368 | 23 | 76,736 |
Yes | output | 1 | 38,368 | 23 | 76,737 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
... | instruction | 0 | 38,369 | 23 | 76,738 |
Yes | output | 1 | 38,369 | 23 | 76,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
... | instruction | 0 | 38,370 | 23 | 76,740 |
Yes | output | 1 | 38,370 | 23 | 76,741 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
... | instruction | 0 | 38,371 | 23 | 76,742 |
Yes | output | 1 | 38,371 | 23 | 76,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
... | instruction | 0 | 38,372 | 23 | 76,744 |
No | output | 1 | 38,372 | 23 | 76,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
... | instruction | 0 | 38,373 | 23 | 76,746 |
No | output | 1 | 38,373 | 23 | 76,747 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
... | instruction | 0 | 38,374 | 23 | 76,748 |
No | output | 1 | 38,374 | 23 | 76,749 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\mathrm{cm} and whose height is b~\mathrm{cm}. (The thickness of the bottle can be ignored.)
... | instruction | 0 | 38,375 | 23 | 76,750 |
No | output | 1 | 38,375 | 23 | 76,751 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤ N ≤ 100 000) — the number of points. Each of t... | instruction | 0 | 39,212 | 23 | 78,424 |
Tags: implementation, math
Correct Solution:
```
import sys
import os
from io import BytesIO, IOBase
#########################
# imgur.com/Pkt7iIf.png #
#########################
# returns the list of prime numbers less than or equal to n:
'''def sieve(n):
if n < 2: return list()
prime = [True for _ in range(... | output | 1 | 39,212 | 23 | 78,425 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤ N ≤ 100 000) — the number of points. Each of t... | instruction | 0 | 39,213 | 23 | 78,426 |
Tags: implementation, math
Correct Solution:
```
ab = int(input())
lst1=[]
lst = []
lst2 =[]
lst3 = []
for i in range(ab):
m,n = map(int,input().split())
lst.append(m)
lst1.append(n)
for i in lst:
lst2.append(i**2)
for x in lst1:
lst3.append(x**2)
print(ab*sum(lst2)+sum(lst)*(-(sum(lst)))+ab*sum... | output | 1 | 39,213 | 23 | 78,427 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤ N ≤ 100 000) — the number of points. Each of t... | instruction | 0 | 39,214 | 23 | 78,428 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
total_sum = 0
distance_x, distance_y = 0, 0
for _ in range(n):
x, y = map(int, input().split())
total_sum += x ** 2 + y ** 2
distance_x += x
distance_y += y
distance_x *= distance_x
distance_y *= distance_y
print( n * total_sum - ( dist... | output | 1 | 39,214 | 23 | 78,429 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤ N ≤ 100 000) — the number of points. Each of t... | instruction | 0 | 39,215 | 23 | 78,430 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
ans= 0
xp=[]
yp=[]
for i in range(n):
x,y=map(int,input().split())
ans+=(x**2)*(n-1)
ans+=(y**2)*(n-1)
xp.append(x)
yp.append(y)
sqrx=sum(i*i for i in xp)
sqry=sum(i*i for i in yp)
minusx=sum(xp)*sum(xp)-sqrx
minusy=sum(yp)*sum(yp)-sq... | output | 1 | 39,215 | 23 | 78,431 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤ N ≤ 100 000) — the number of points. Each of t... | instruction | 0 | 39,216 | 23 | 78,432 |
Tags: implementation, math
Correct Solution:
```
import sys
input = sys.stdin.readline
n = int(input())
x = []
y = []
out = 0
for _ in range(n):
a, b = map(int, input().split())
x.append(a)
y.append(b)
for l in (x,y):
sos = 0
tot = 0
count = 0
for v in l:
out += count * v * v + so... | output | 1 | 39,216 | 23 | 78,433 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤ N ≤ 100 000) — the number of points. Each of t... | instruction | 0 | 39,217 | 23 | 78,434 |
Tags: implementation, math
Correct Solution:
```
import math
t = int(input())
x_sum = 0
y_sum = 0
x2_sum = 0
y2_sum = 0
for i in range(t):
x,y = map(int, input().split())
x_sum += x
y_sum += y
x2_sum += x**2
y2_sum += y**2
x_sum *= x_sum
y_sum *= y_sum
ans = (t)*x2_sum + (t)*y2_sum - x_sum - y_s... | output | 1 | 39,217 | 23 | 78,435 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤ N ≤ 100 000) — the number of points. Each of t... | instruction | 0 | 39,218 | 23 | 78,436 |
Tags: implementation, math
Correct Solution:
```
import math
if __name__== '__main__':
n = int(input())
n_1= n- 1
totalDistance= 0
Xs= []
Ys= []
xs= []
ys= []
xAddition= 0
yAddition= 0
for _ in range(n):
x, y= [int(x) for x in input().split()]
Xs.append(n_1* x* ... | output | 1 | 39,218 | 23 | 78,437 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤ N ≤ 100 000) — the number of points. Each of t... | instruction | 0 | 39,219 | 23 | 78,438 |
Tags: implementation, math
Correct Solution:
```
import math
def solve():
n, = map(int, input().split())
a = [(0, 0) for _ in range(n)]
sum_x = 0
sum_y = 0
for i in range(n):
x, y = map(int, input().split())
a[i] = x, y
sum_x += a[i][0]
sum_y += a[i][1]
ans = 0... | output | 1 | 39,219 | 23 | 78,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤... | instruction | 0 | 39,220 | 23 | 78,440 |
Yes | output | 1 | 39,220 | 23 | 78,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤... | instruction | 0 | 39,221 | 23 | 78,442 |
Yes | output | 1 | 39,221 | 23 | 78,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤... | instruction | 0 | 39,222 | 23 | 78,444 |
Yes | output | 1 | 39,222 | 23 | 78,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.
Input
The first line of input contains one integer number N (1 ≤... | instruction | 0 | 39,223 | 23 | 78,446 |
No | output | 1 | 39,223 | 23 | 78,447 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.