message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the serve... | instruction | 0 | 81,212 | 14 | 162,424 |
Yes | output | 1 | 81,212 | 14 | 162,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the serve... | instruction | 0 | 81,213 | 14 | 162,426 |
No | output | 1 | 81,213 | 14 | 162,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the serve... | instruction | 0 | 81,214 | 14 | 162,428 |
No | output | 1 | 81,214 | 14 | 162,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the serve... | instruction | 0 | 81,215 | 14 | 162,430 |
No | output | 1 | 81,215 | 14 | 162,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A social network for dogs called DH (DogHouse) has k special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the serve... | instruction | 0 | 81,216 | 14 | 162,432 |
No | output | 1 | 81,216 | 14 | 162,433 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Allen doesn't like the ordering. Allen prefers if... | instruction | 0 | 81,426 | 14 | 162,852 |
Tags: greedy, implementation, math
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
q, q1 = 0, 0
while q < 2*n-1:
if a[q] == a[q+1]:
q += 2
else:
for q2 in range(a[q+1:].index(a[q])+q+1, q+1, -1):
a[q2], a[q2-1] = a[q2-1], a[q2]
q1 += 1
q... | output | 1 | 81,426 | 14 | 162,853 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Allen doesn't like the ordering. Allen prefers if... | instruction | 0 | 81,427 | 14 | 162,854 |
Tags: greedy, implementation, math
Correct Solution:
```
n = int(input())
arr = list(map(int,input().split()))
i=0
moves = 0
for i in range(0,len(arr)-1,2):
if arr[i]==arr[i+1]:
# i+=2
pass
else:
n_ind = arr[i+1:].index(arr[i])
arr.pop(n_ind+i+1)
arr.insert(i+1,arr[i])
... | output | 1 | 81,427 | 14 | 162,855 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Allen doesn't like the ordering. Allen prefers if... | instruction | 0 | 81,428 | 14 | 162,856 |
Tags: greedy, implementation, math
Correct Solution:
```
def swap(x1, x2, a):
temp = a[x1]
a[x1] = a[x2]
a[x2] = temp
def shift(fr, to, a):
for i in range(fr, to - 1, -1):
swap(i, i-1, a)
n = int(input())
a = [int(x) for x in input().split(' ')]
answer = 0
for i in range(n):
pos1 = 2*i
... | output | 1 | 81,428 | 14 | 162,857 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Allen doesn't like the ordering. Allen prefers if... | instruction | 0 | 81,429 | 14 | 162,858 |
Tags: greedy, implementation, math
Correct Solution:
```
n = int(input())
ckn = list(map(int, input().split()))
res = 0
# print(ckn)
for p in range(n):
f = ckn.pop(0)
# print(f, ckn)
g_ind = ckn.index(f)
# print(g_ind)
res += g_ind
ckn.pop(g_ind)
# print(g_ind, ckn)
print(res)
``` | output | 1 | 81,429 | 14 | 162,859 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Allen doesn't like the ordering. Allen prefers if... | instruction | 0 | 81,430 | 14 | 162,860 |
Tags: greedy, implementation, math
Correct Solution:
```
#Have copied from eugalt
f = lambda: list(map(int, input().split()))
n = int(input())
a = f()
k = 0
while a:
i = a.index(a.pop(0))
k += i
del a[i]
print(k)
``` | output | 1 | 81,430 | 14 | 162,861 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Allen doesn't like the ordering. Allen prefers if... | instruction | 0 | 81,431 | 14 | 162,862 |
Tags: greedy, implementation, math
Correct Solution:
```
n = int(input())
a = [*map(lambda x: int(x) - 1, input().split())]
"""count = [1] * n
real_position = [[] for i in range(n)]
position = [0] * (2 * n)
for i in range(2*n):
position[i] = count[a[i]]
count[a[i]] = -1
real_position[a[i]].append(i)
#print(position... | output | 1 | 81,431 | 14 | 162,863 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Allen doesn't like the ordering. Allen prefers if... | instruction | 0 | 81,432 | 14 | 162,864 |
Tags: greedy, implementation, math
Correct Solution:
```
n = int(input())*2
a = list(map(int, input().split()))
ans = 0
i = 0
while(i<n-1):
if a[i]!=a[i+1]:
j=i+1
flag=False
while(j<n):
if a[i]==a[j]:
flag=True
break
j+=1
if flag:
temp = a[j]
ans+=(j-(i+1))
a.insert(i+1, temp)
a.pop(... | output | 1 | 81,432 | 14 | 162,865 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Allen doesn't like the ordering. Allen prefers if... | instruction | 0 | 81,433 | 14 | 162,866 |
Tags: greedy, implementation, math
Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
c = 0
while len(a) > 0:
x = a[0]
a.remove(x)
c+=a.index(x)
a.remove(x)
print(c)
``` | output | 1 | 81,433 | 14 | 162,867 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Al... | instruction | 0 | 81,434 | 14 | 162,868 |
Yes | output | 1 | 81,434 | 14 | 162,869 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Al... | instruction | 0 | 81,435 | 14 | 162,870 |
Yes | output | 1 | 81,435 | 14 | 162,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Al... | instruction | 0 | 81,436 | 14 | 162,872 |
Yes | output | 1 | 81,436 | 14 | 162,873 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Al... | instruction | 0 | 81,437 | 14 | 162,874 |
Yes | output | 1 | 81,437 | 14 | 162,875 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Al... | instruction | 0 | 81,438 | 14 | 162,876 |
No | output | 1 | 81,438 | 14 | 162,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Al... | instruction | 0 | 81,439 | 14 | 162,878 |
No | output | 1 | 81,439 | 14 | 162,879 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Al... | instruction | 0 | 81,440 | 14 | 162,880 |
No | output | 1 | 81,440 | 14 | 162,881 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen is hosting a formal dinner party. 2n people come to the event in n pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n people line up, but Al... | instruction | 0 | 81,441 | 14 | 162,882 |
No | output | 1 | 81,441 | 14 | 162,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At the first holiday in spring, the town Shortriver traditionally conducts a flower festival. Townsfolk wear traditional wreaths during these festivals. Each wreath contains exactly k flowers.
The work material for the wreaths for all n cit... | instruction | 0 | 81,769 | 14 | 163,538 |
Tags: greedy, implementation, two pointers
Correct Solution:
```
from sys import stdin, stdout, setrecursionlimit
input = stdin.readline
# import string
# characters = string.ascii_lowercase
# digits = string.digits
# setrecursionlimit(int(1e6))
# dir = [-1,0,1,0,-1]
# moves = 'NESW'
inf = float('inf')
from functools i... | output | 1 | 81,769 | 14 | 163,539 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At the first holiday in spring, the town Shortriver traditionally conducts a flower festival. Townsfolk wear traditional wreaths during these festivals. Each wreath contains exactly k flowers.
The work material for the wreaths for all n cit... | instruction | 0 | 81,770 | 14 | 163,540 |
Tags: greedy, implementation, two pointers
Correct Solution:
```
import sys
from collections import Counter
input = sys.stdin.buffer.readline
m,k,n,s = map(int,input().split())
a = list(map(int,input().split()))
b = Counter(map(int,input().split()))
counts = Counter()
unsatisfied = len(b)
to_remove = m+1
mn_len = m+1... | output | 1 | 81,770 | 14 | 163,541 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At the first holiday in spring, the town Shortriver traditionally conducts a flower festival. Townsfolk wear traditional wreaths during these festivals. Each wreath contains exactly k flowers.
... | instruction | 0 | 81,771 | 14 | 163,542 |
No | output | 1 | 81,771 | 14 | 163,543 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At the first holiday in spring, the town Shortriver traditionally conducts a flower festival. Townsfolk wear traditional wreaths during these festivals. Each wreath contains exactly k flowers.
... | instruction | 0 | 81,772 | 14 | 163,544 |
No | output | 1 | 81,772 | 14 | 163,545 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
At the first holiday in spring, the town Shortriver traditionally conducts a flower festival. Townsfolk wear traditional wreaths during these festivals. Each wreath contains exactly k flowers.
... | instruction | 0 | 81,773 | 14 | 163,546 |
No | output | 1 | 81,773 | 14 | 163,547 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently a serious bug has been found in the FOS code. The head of the F company wants to find the culprit and punish him. For that, he set up an organizational meeting, the issue is: who's bugged the code? Each of the n coders on the meetin... | instruction | 0 | 82,063 | 14 | 164,126 |
Tags: data structures, graphs, implementation, two pointers
Correct Solution:
```
from collections import defaultdict
from bisect import bisect_left as lower
import sys
input = sys.stdin.readline
def put():
return map(int, input().split())
try:
n,m = put()
cnt, mp, ans = [0]*n, defaultdict(), [0]*n
for... | output | 1 | 82,063 | 14 | 164,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls among his friends. Let's number them from 0 to ... | instruction | 0 | 82,113 | 14 | 164,226 |
Tags: brute force, dsu, meet-in-the-middle, number theory
Correct Solution:
```
import math
inp = input()
mas = [int(s) for s in inp.strip().split(' ')]
b = mas[0]
g = mas[1]
mas = [int(s) for s in input().strip().split(' ')]
hb = {}
if mas[0] != 0:
for i in mas[1::]:
hb[i] = True
mas = [int(s) for s in ... | output | 1 | 82,113 | 14 | 164,227 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls among his friends. Let's number them from 0 to ... | instruction | 0 | 82,114 | 14 | 164,228 |
Tags: brute force, dsu, meet-in-the-middle, number theory
Correct Solution:
```
n, m = map(int, input().split())
boy_funny = list(map(int, input().split()))
girl_funny = list(map(int, input().split()))
boy = [0]*n
girl = [0]*m
i = 1
while boy_funny[0] > 0:
boy[boy_funny[i]] = 1
i += 1
boy_funny[0] -= 1
i = ... | output | 1 | 82,114 | 14 | 164,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls among his friends. Let's number them from 0 to ... | instruction | 0 | 82,115 | 14 | 164,230 |
Tags: brute force, dsu, meet-in-the-middle, number theory
Correct Solution:
```
n,m=(int(i) for i in input().split())
k=max(n,m)
l=[0]*n
l1=[0]*m
l2=[int(i) for i in input().split()]
l3=[int(i) for i in input().split()]
for i in l2[1:]:
l[i]=-1
for i in l3[1:]:
l1[i]=-1
for i in range(n*m):
if(l[i%n]==-1 o... | output | 1 | 82,115 | 14 | 164,231 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls among his friends. Let's number them from 0 to ... | instruction | 0 | 82,116 | 14 | 164,232 |
Tags: brute force, dsu, meet-in-the-middle, number theory
Correct Solution:
```
total_boys, total_girls = map(int, input().split())
happy_boys = list(map(int, input().split()))
happy_girls = list(map(int, input().split()))
result_boy = [False] * total_boys
result_girl = [False] * total_girls
if happy_boys[0] > 0:
... | output | 1 | 82,116 | 14 | 164,233 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls among his friends. Let's number them from 0 to ... | instruction | 0 | 82,117 | 14 | 164,234 |
Tags: brute force, dsu, meet-in-the-middle, number theory
Correct Solution:
```
def main():
n, m = map(int, input().split())
bb = [False] * n
gg = [False] * m
l = list(map(int, input().split()))
for i in l[1:]:
bb[i] = True
l = list(map(int, input().split()))
for i in l[1:]:
... | output | 1 | 82,117 | 14 | 164,235 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls among his friends. Let's number them from 0 to ... | instruction | 0 | 82,118 | 14 | 164,236 |
Tags: brute force, dsu, meet-in-the-middle, number theory
Correct Solution:
```
n, m = map(int, input().split())
x = list(map(int, input().split()))[1:]
y = list(map(int, input().split()))[1:]
boys = [False for i in range(n)]
girls = [False for i in range(m)]
for el in x:
boys[el] = True
for el in y:
girls[el] ... | output | 1 | 82,118 | 14 | 164,237 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls among his friends. Let's number them from 0 to ... | instruction | 0 | 82,119 | 14 | 164,238 |
Tags: brute force, dsu, meet-in-the-middle, number theory
Correct Solution:
```
x=input().split()
l_1=input().split()
l_2=input().split()
del l_1[0]
del l_2[0]
list_1=[]
list_2=[]
lst_1=[int(value) for value in l_1]
lst_2=[int(value) for value in l_2]
n=int(x[0])
m=int(x[1])
def judge(a,b):
if a<b:
c=b
... | output | 1 | 82,119 | 14 | 164,239 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls among his friends. Let's number them from 0 to ... | instruction | 0 | 82,120 | 14 | 164,240 |
Tags: brute force, dsu, meet-in-the-middle, number theory
Correct Solution:
```
from math import gcd
n,m = list(map(int,input().split()))
x = 10**5
boys = list(map(int,input().split()))
girls = list(map(int,input().split()))
v1 = [False for i in range(n)]
v2 = [False for i in range(m)]
for i in boys[1::]:
v1[i] = T... | output | 1 | 82,120 | 14 | 164,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls ... | instruction | 0 | 82,121 | 14 | 164,242 |
Yes | output | 1 | 82,121 | 14 | 164,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls ... | instruction | 0 | 82,122 | 14 | 164,244 |
Yes | output | 1 | 82,122 | 14 | 164,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls ... | instruction | 0 | 82,123 | 14 | 164,246 |
Yes | output | 1 | 82,123 | 14 | 164,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls ... | instruction | 0 | 82,124 | 14 | 164,248 |
Yes | output | 1 | 82,124 | 14 | 164,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls ... | instruction | 0 | 82,125 | 14 | 164,250 |
No | output | 1 | 82,125 | 14 | 164,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls ... | instruction | 0 | 82,126 | 14 | 164,252 |
No | output | 1 | 82,126 | 14 | 164,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls ... | instruction | 0 | 82,127 | 14 | 164,254 |
No | output | 1 | 82,127 | 14 | 164,255 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.
There are n boys and m girls ... | instruction | 0 | 82,128 | 14 | 164,256 |
No | output | 1 | 82,128 | 14 | 164,257 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fafa owns a company that works on huge projects. There are n employees in Fafa's company. Whenever the company has a new project to start working on, Fafa has to divide the tasks of this project among all the employees.
Fafa finds doing thi... | instruction | 0 | 82,315 | 14 | 164,630 |
Tags: brute force, implementation
Correct Solution:
```
ans = 0
k = int(input())
for i in range(1, k):
if k % i == 0:
ans += 1
print(ans)
``` | output | 1 | 82,315 | 14 | 164,631 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fafa owns a company that works on huge projects. There are n employees in Fafa's company. Whenever the company has a new project to start working on, Fafa has to divide the tasks of this project among all the employees.
Fafa finds doing thi... | instruction | 0 | 82,316 | 14 | 164,632 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
yes = 0
for i in range(1, n + 1):
j=n-i
if j % i == 0 and j>0:
yes += 1
print(yes)
``` | output | 1 | 82,316 | 14 | 164,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fafa owns a company that works on huge projects. There are n employees in Fafa's company. Whenever the company has a new project to start working on, Fafa has to divide the tasks of this project among all the employees.
Fafa finds doing thi... | instruction | 0 | 82,317 | 14 | 164,634 |
Tags: brute force, implementation
Correct Solution:
```
n_employee = int(input())
counter = 0
for index in range(n_employee):
if (n_employee - index) != 0 and index != 0:
if (n_employee - index) % index == 0:
counter = counter + 1
print(int(counter))
``` | output | 1 | 82,317 | 14 | 164,635 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fafa owns a company that works on huge projects. There are n employees in Fafa's company. Whenever the company has a new project to start working on, Fafa has to divide the tasks of this project among all the employees.
Fafa finds doing thi... | instruction | 0 | 82,318 | 14 | 164,636 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
cnt = 0
m = 0
while m < n // 2:
m += 1
if n % m == 0:
cnt += 1
print(cnt)
``` | output | 1 | 82,318 | 14 | 164,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fafa owns a company that works on huge projects. There are n employees in Fafa's company. Whenever the company has a new project to start working on, Fafa has to divide the tasks of this project among all the employees.
Fafa finds doing thi... | instruction | 0 | 82,319 | 14 | 164,638 |
Tags: brute force, implementation
Correct Solution:
```
import sys
n = int(sys.stdin.readline().rstrip())
count = 0
for l in range(1, n):
if (n - l) % l == 0:
count += 1
print(str(count) + "\n")
``` | output | 1 | 82,319 | 14 | 164,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fafa owns a company that works on huge projects. There are n employees in Fafa's company. Whenever the company has a new project to start working on, Fafa has to divide the tasks of this project among all the employees.
Fafa finds doing thi... | instruction | 0 | 82,320 | 14 | 164,640 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
x=0
for i in range(1,n):
if n%i==0:
x+=1
print(x)
``` | output | 1 | 82,320 | 14 | 164,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fafa owns a company that works on huge projects. There are n employees in Fafa's company. Whenever the company has a new project to start working on, Fafa has to divide the tasks of this project among all the employees.
Fafa finds doing thi... | instruction | 0 | 82,321 | 14 | 164,642 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
count=0
i=1
while i<=int(n//2):
l=i
r=n-l
if r%l==0:
count=count+1
i=i+1
print(count)
``` | output | 1 | 82,321 | 14 | 164,643 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.