message stringlengths 2 57.2k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 61 108k | cluster float64 22 22 | __index_level_0__ int64 122 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n.
You need to perform q queries of the following two types:
1. "MULTIPLY l r x" — for every i (l ≤ i ≤ r) multiply a_i by x.
2. "TOTIENT l r" — print... | instruction | 0 | 61 | 22 | 122 |
No | output | 1 | 61 | 22 | 123 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n.
You need to perform q queries of the following two types:
1. "MULTIPLY l r x" — for every i (l ≤ i ≤ r) multiply a_i by x.
2. "TOTIENT l r" — print... | instruction | 0 | 62 | 22 | 124 |
No | output | 1 | 62 | 22 | 125 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n.
You need to perform q queries of the following two types:
1. "MULTIPLY l r x" — for every i (l ≤ i ≤ r) multiply a_i by x.
2. "TOTIENT l r" — print... | instruction | 0 | 63 | 22 | 126 |
No | output | 1 | 63 | 22 | 127 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n.
You need to perform q queries of the following two types:
1. "MULTIPLY l r x" — for every i (l ≤ i ≤ r) multiply a_i by x.
2. "TOTIENT l r" — print... | instruction | 0 | 64 | 22 | 128 |
No | output | 1 | 64 | 22 | 129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little C loves number «3» very much. He loves all things about it.
Now he has a positive integer n. He wants to split n into 3 positive integers a,b,c, such that a+b+c=n and none of the 3 integers is a multiple of 3. Help him to find a solu... | instruction | 0 | 819 | 22 | 1,638 |
Tags: math
Correct Solution:
```
x=int(input())
y=x//3
if y%3==0:
if x%3==0:
print(y-2," ",y+1," ",y+1)
elif x%3==1:
print(y-2," ",y+1," ",y+2)
else:
print(y-2," ",y+2," ",y+2)
else:
if x%3==0:
print(y," ",y," ",y)
elif x%3==1 and y%3!=2:
print(y," ",y," ",y+1... | output | 1 | 819 | 22 | 1,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little C loves number «3» very much. He loves all things about it.
Now he has a positive integer n. He wants to split n into 3 positive integers a,b,c, such that a+b+c=n and none of the 3 integers is a multiple of 3. Help him to find a solu... | instruction | 0 | 821 | 22 | 1,642 |
Tags: math
Correct Solution:
```
n = int(input())
r = n%3
if (r == 0) or (r == 1):
print(str(n-2) + " 1 1")
else:
print(str(n-4) + " 2 2")
``` | output | 1 | 821 | 22 | 1,643 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little C loves number «3» very much. He loves all things about it.
Now he has a positive integer n. He wants to split n into 3 positive integers a,b,c, such that a+b+c=n and none of the 3 integers is a multiple of 3. Help him to find a solu... | instruction | 0 | 822 | 22 | 1,644 |
Tags: math
Correct Solution:
```
n = int(input())
if n == 3:
print("1 1 1")
else:
a,b = 1,1
while (n-a-b)%3==0 or a%3==0 or b%3==0:
a+=1
b+=1
c = n-a-b
print(a,b,c)
``` | output | 1 | 822 | 22 | 1,645 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little C loves number «3» very much. He loves all things about it.
Now he has a positive integer n. He wants to split n into 3 positive integers a,b,c, such that a+b+c=n and none of the 3 integers is a multiple of 3. Help him to find a solu... | instruction | 0 | 823 | 22 | 1,646 |
Tags: math
Correct Solution:
```
n=int(input())
# a=n%3
# b=n//3
if n==3:
print(1,1,1)
elif n%3==0:
print(1,1,n-2)#if n=9 7 1 1
else:#if n=8 5 2 1
print(n-3,2,1)
``` | output | 1 | 823 | 22 | 1,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little C loves number «3» very much. He loves all things about it.
Now he has a positive integer n. He wants to split n into 3 positive integers a,b,c, such that a+b+c=n and none of the 3 integers is a multiple of 3. Help him to find a solu... | instruction | 0 | 824 | 22 | 1,648 |
Tags: math
Correct Solution:
```
n = int(input())
x = 2 if (n+1) % 3 == 0 else 1
print(f'1 {x} {n-x-1}')
``` | output | 1 | 824 | 22 | 1,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little C loves number «3» very much. He loves all things about it.
Now he has a positive integer n. He wants to split n into 3 positive integers a,b,c, such that a+b+c=n and none of the 3 integers is a multiple of 3. Help him to find a solu... | instruction | 0 | 825 | 22 | 1,650 |
Tags: math
Correct Solution:
```
n = int(input())
if (n - 3) % 3 != 0:
print(1, 2, n - 3)
else:
print(1, 1, n - 2)
``` | output | 1 | 825 | 22 | 1,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little C loves number «3» very much. He loves all things about it.
Now he has a positive integer n. He wants to split n into 3 positive integers a,b,c, such that a+b+c=n and none of the 3 integers is a multiple of 3. Help him to find a solu... | instruction | 0 | 826 | 22 | 1,652 |
Tags: math
Correct Solution:
```
if __name__ == '__main__':
n = int(input().strip())
a, b = 1, 2
c = n - 3
if c % 3 == 0:
b -= 1
c += 1
print(a, b, c)
``` | output | 1 | 826 | 22 | 1,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes). A sailor is considered as worthy if he can sol... | instruction | 0 | 1,029 | 22 | 2,058 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
def nf(nn):
global fact
sim = True
for k in fact:
if nn % k == 0:
sim = False
break
if sim: fact.append(nn)
def rez(nn):
global df
k = [6, 10, 14]
j = 3
while nn - sum(k) > 0 and (nn - su... | output | 1 | 1,029 | 22 | 2,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes). A sailor is considered as worthy if he can sol... | instruction | 0 | 1,030 | 22 | 2,060 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
if n<31:
print("NO")
elif n==44:
print("YES")
print(6,7,10,21)
elif n==40:
print("YES")
print(6,10,21,3)
elif n==36:
print("YES")
... | output | 1 | 1,030 | 22 | 2,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes). A sailor is considered as worthy if he can sol... | instruction | 0 | 1,031 | 22 | 2,062 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
import bisect
import os
import gc
import sys
from io import BytesIO, IOBase
from collections import Counter
from collections import deque
import heapq
import math
import statistics
def sin():
return input()
def ain():
return list(map(int, sin(... | output | 1 | 1,031 | 22 | 2,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes). A sailor is considered as worthy if he can sol... | instruction | 0 | 1,032 | 22 | 2,064 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
if n<=30:
print('NO')
else:
print('YES')
if n==36:
print(5,6,10,15)
elif n==44:
print(6,7,10,21)
elif n==40:
print(6... | output | 1 | 1,032 | 22 | 2,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes). A sailor is considered as worthy if he can sol... | instruction | 0 | 1,033 | 22 | 2,066 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
ans=[6,10,14,15,21,22,26]
check=False
for i in ans:
for j in ans:
for k in ans:
if n>i+j+k and n-i-j-k!=i and n-i-j-k!=j and n-i-j-k!=k and i!=j and j!=... | output | 1 | 1,033 | 22 | 2,067 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes). A sailor is considered as worthy if he can sol... | instruction | 0 | 1,034 | 22 | 2,068 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
from sys import *
t = int(stdin.readline())
while t > 0:
n = int(stdin.readline())
if n >30:
print("YES")
if n-30 == 6:
print(6,10,15,n-31)
elif n-30 == 10:
print(6,10,15,n-31)
elif n-30 ... | output | 1 | 1,034 | 22 | 2,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes). A sailor is considered as worthy if he can sol... | instruction | 0 | 1,035 | 22 | 2,070 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
t = int(input())
for aSRD in range(t):
n = int(input())
if n > (6+10+14):
k = n - 6 - 10 - 14
print("YES")
if k == 6 or k == 10 or k == 14:
print(6, 10, 15, k-1)
else:
print(6, 10, ... | output | 1 | 1,035 | 22 | 2,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes). A sailor is considered as worthy if he can sol... | instruction | 0 | 1,036 | 22 | 2,072 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
t=int(input())
while(t>0):
t-=1
n=int(input())
if n<31:
print("NO")
else:
print("Yes")
if n==36:
print(15, 10, 6, 5)
elif n==40:
print(15, 10, 6, 9)
elif n==44:
... | output | 1 | 1,036 | 22 | 2,073 |
Provide tags and a correct Python 2 solution for this coding contest problem.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes). A sailor is considered as worthy if he can sol... | instruction | 0 | 1,037 | 22 | 2,074 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import combinations
pr=stdout.write
import heapq
raw_input = stdin.readline
def ni():
return int(raw_input())
def li():
return list(map(int,raw_input(... | output | 1 | 1,037 | 22 | 2,075 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes).... | instruction | 0 | 1,038 | 22 | 2,076 |
Yes | output | 1 | 1,038 | 22 | 2,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes).... | instruction | 0 | 1,039 | 22 | 2,078 |
Yes | output | 1 | 1,039 | 22 | 2,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes).... | instruction | 0 | 1,040 | 22 | 2,080 |
Yes | output | 1 | 1,040 | 22 | 2,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes).... | instruction | 0 | 1,041 | 22 | 2,082 |
Yes | output | 1 | 1,041 | 22 | 2,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes).... | instruction | 0 | 1,042 | 22 | 2,084 |
No | output | 1 | 1,042 | 22 | 2,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes).... | instruction | 0 | 1,043 | 22 | 2,086 |
No | output | 1 | 1,043 | 22 | 2,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes).... | instruction | 0 | 1,044 | 22 | 2,088 |
No | output | 1 | 1,044 | 22 | 2,089 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes).... | instruction | 0 | 1,045 | 22 | 2,090 |
No | output | 1 | 1,045 | 22 | 2,091 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes).... | instruction | 0 | 1,046 | 22 | 2,092 |
No | output | 1 | 1,046 | 22 | 2,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor ... | instruction | 0 | 1,269 | 22 | 2,538 |
Tags: constructive algorithms, greedy, number theory
Correct Solution:
```
import fractions
n = int(input())
ns = list(map(int, input().strip().split(' ')))
a = []
skip = {}
ns = sorted(ns, reverse=True)
for i, num in enumerate(ns):
if num in skip and skip[num] > 0:
skip[num] -= 1
continue
a... | output | 1 | 1,269 | 22 | 2,539 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor ... | instruction | 0 | 1,270 | 22 | 2,540 |
Tags: constructive algorithms, greedy, number theory
Correct Solution:
```
# ------------------
# rpy3cpp's solution
# ------------------
import collections
import math
def main():
n = int(input())
g = list(map(int, input().split()))
g_counter = collections.Counter(g)
n_list = []
g.sort()
whi... | output | 1 | 1,270 | 22 | 2,541 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor ... | instruction | 0 | 1,271 | 22 | 2,542 |
Tags: constructive algorithms, greedy, number theory
Correct Solution:
```
import fractions
import collections
n = int(input())
ns = sorted((int(i) for i in input().split()), reverse=True)
bs = []
cs = collections.Counter(ns)
r = []
tot = 0
for i in ns:
if not cs[i]:
continue
r.append(i)
cs[i] -= ... | output | 1 | 1,271 | 22 | 2,543 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor ... | instruction | 0 | 1,272 | 22 | 2,544 |
Tags: constructive algorithms, greedy, number theory
Correct Solution:
```
import sys
from math import gcd,sqrt,ceil,log2
from collections import defaultdict,Counter,deque
from bisect import bisect_left,bisect_right
import math
sys.setrecursionlimit(2*10**5+10)
import heapq
from itertools import permutations
# input=... | output | 1 | 1,272 | 22 | 2,545 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor ... | instruction | 0 | 1,273 | 22 | 2,546 |
Tags: constructive algorithms, greedy, number theory
Correct Solution:
```
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
import math
def binarySearch(num,l,r,x):
while l<=r:
mid=(l+r)//2
if num[mid]==x:
return mid
elif num[mid]<x:
l=mid+1
... | output | 1 | 1,273 | 22 | 2,547 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor ... | instruction | 0 | 1,274 | 22 | 2,548 |
Tags: constructive algorithms, greedy, number theory
Correct Solution:
```
def gcd(a,b):
if b==0: return a
return gcd(b,a%b)
n=int(input())
from collections import Counter
l=[int(i) for i in input().split()]
g=Counter(l)
ans=[]
while g:
m=max(g)
g[m]-=1
for i in ans:
g[gcd(m,i)]-=2
... | output | 1 | 1,274 | 22 | 2,549 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor ... | instruction | 0 | 1,275 | 22 | 2,550 |
Tags: constructive algorithms, greedy, number theory
Correct Solution:
```
n=int(input())
u=[int(i) for i in input().split()]
d=dict()
for i in u:
if i in d:d[i]=1+d[i]
else:d[i]=1
def gcd(a,b):
c=0
while a!=0:
c=a
a=b%a
b=c
return(b)
t=[]
for i in d:t+=[i]
t.sort()
v=[]
while(len(v)<n):
x=t[len(t)-1]
fo... | output | 1 | 1,275 | 22 | 2,551 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor ... | instruction | 0 | 1,276 | 22 | 2,552 |
Tags: constructive algorithms, greedy, number theory
Correct Solution:
```
from fractions import gcd
n = int(input())
a = sorted(list(map(int, input().split())))[::-1]
c = {}
l = []
for e in a:
if e not in c:
c[e] = 1
else:
c[e]+= 1
for e in a:
while n > 0 and c[e] > 0:
c[e]-= 1
... | output | 1 | 1,276 | 22 | 2,553 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x... | instruction | 0 | 1,277 | 22 | 2,554 |
Yes | output | 1 | 1,277 | 22 | 2,555 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x... | instruction | 0 | 1,278 | 22 | 2,556 |
Yes | output | 1 | 1,278 | 22 | 2,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x... | instruction | 0 | 1,279 | 22 | 2,558 |
Yes | output | 1 | 1,279 | 22 | 2,559 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x... | instruction | 0 | 1,280 | 22 | 2,560 |
Yes | output | 1 | 1,280 | 22 | 2,561 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x... | instruction | 0 | 1,281 | 22 | 2,562 |
No | output | 1 | 1,281 | 22 | 2,563 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x... | instruction | 0 | 1,282 | 22 | 2,564 |
No | output | 1 | 1,282 | 22 | 2,565 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x... | instruction | 0 | 1,283 | 22 | 2,566 |
No | output | 1 | 1,283 | 22 | 2,567 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The GCD table G of size n × n for an array of positive integers a of length n is defined by formula
<image>
Let us remind you that the greatest common divisor (GCD) of two positive integers x... | instruction | 0 | 1,284 | 22 | 2,568 |
No | output | 1 | 1,284 | 22 | 2,569 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a prime number p, n integers a_1, a_2, …, a_n, and an integer k.
Find the number of pairs of indexes (i, j) (1 ≤ i < j ≤ n) for which (a_i + a_j)(a_i^2 + a_j^2) ≡ k mod p.
Input
The first line contains integers n, p, k (2 ≤... | instruction | 0 | 1,726 | 22 | 3,452 |
Tags: math, matrices, number theory, two pointers
Correct Solution:
```
n, p, k = map(int, input().split())
A = list(map(int, input().split()))
step4 = {}
for i in A:
h = (i ** 4) - (k * i)
h %= p
if h not in step4:
step4[h] = 0
step4[h] += 1
ans = 0
for u in step4:
ans += (step4[u]) * (step... | output | 1 | 1,726 | 22 | 3,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a prime number p, n integers a_1, a_2, …, a_n, and an integer k.
Find the number of pairs of indexes (i, j) (1 ≤ i < j ≤ n) for which (a_i + a_j)(a_i^2 + a_j^2) ≡ k mod p.
Input
The first line contains integers n, p, k (2 ≤... | instruction | 0 | 1,727 | 22 | 3,454 |
Tags: math, matrices, number theory, two pointers
Correct Solution:
```
n, p, k = map(int, input().split())
a = list(map(int, input().split()))
a = [(i ** 4 - i * k) % p for i in a]
c = {i: 0 for i in a}
for i in a:
c[i] += 1
s = 0
for i in c:
i = c[i]
s += (i * (i - 1)) // 2
print(s)
``` | output | 1 | 1,727 | 22 | 3,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a prime number p, n integers a_1, a_2, …, a_n, and an integer k.
Find the number of pairs of indexes (i, j) (1 ≤ i < j ≤ n) for which (a_i + a_j)(a_i^2 + a_j^2) ≡ k mod p.
Input
The first line contains integers n, p, k (2 ≤... | instruction | 0 | 1,728 | 22 | 3,456 |
Tags: math, matrices, number theory, two pointers
Correct Solution:
```
n , p , k = map(int,input().split())
ar = list(map(int,input().split()))
ar = [(i**4 - k*i + p**4)%p for i in ar]
d = dict()
for i in ar:
if i in d:
d[i] += 1
else:
d[i] = 1
ans = 0
for key in d:
ans += (d[key]*(d[key] -... | output | 1 | 1,728 | 22 | 3,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a prime number p, n integers a_1, a_2, …, a_n, and an integer k.
Find the number of pairs of indexes (i, j) (1 ≤ i < j ≤ n) for which (a_i + a_j)(a_i^2 + a_j^2) ≡ k mod p.
Input
The first line contains integers n, p, k (2 ≤... | instruction | 0 | 1,729 | 22 | 3,458 |
Tags: math, matrices, number theory, two pointers
Correct Solution:
```
def Sum(n):
"""
Entrada:
n -> cantidad de elementos a asociar
Descripción:
Dada la cantidad de elementos a asociar, encontrar el número de combinaciones de tamaño 2 que
se pueden formar
Salida:
Número... | output | 1 | 1,729 | 22 | 3,459 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a prime number p, n integers a_1, a_2, …, a_n, and an integer k.
Find the number of pairs of indexes (i, j) (1 ≤ i < j ≤ n) for which (a_i + a_j)(a_i^2 + a_j^2) ≡ k mod p.
Input
The first line contains integers n, p, k (2 ≤... | instruction | 0 | 1,730 | 22 | 3,460 |
Tags: math, matrices, number theory, two pointers
Correct Solution:
```
n, p, k = map(int, input().split())
a = list(map(int, input().split()))
b = dict()
ans = 0
for i in a:
j = (i ** 4 - k * i) % p
c = b.get(j, 0)
ans += c
b[j] = c + 1
print(ans)
``` | output | 1 | 1,730 | 22 | 3,461 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.