message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vladimir wants to modernize partitions in his office. To make the office more comfortable he decided to remove a partition and plant several bamboos in a row. He thinks it would be nice if there are n bamboos in a row, and the i-th from the ... | instruction | 0 | 59,382 | 8 | 118,764 |
Tags: brute force, data structures, implementation, math, number theory, sortings, two pointers
Correct Solution:
```
import itertools
import time
unfold = itertools.chain.from_iterable
t = time.time() + 1900
def jumps(a):
d = speedup
if time.time() > t:
print(anss)
exit(0)
try:
wh... | output | 1 | 59,382 | 8 | 118,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vladimir wants to modernize partitions in his office. To make the office more comfortable he decided to remove a partition and plant several bamboos in a row. He thinks it would be nice if there are n bamboos in a row, and the i-th from the ... | instruction | 0 | 59,383 | 8 | 118,766 |
Tags: brute force, data structures, implementation, math, number theory, sortings, two pointers
Correct Solution:
```
import itertools
unfold = itertools.chain.from_iterable
speedup = 400000
def jumps(a):
d = speedup
while d < a - 1:
c = (a + d - 1) // d
d = (a + c - 2) // (c - 1)
yie... | output | 1 | 59,383 | 8 | 118,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vladimir wants to modernize partitions in his office. To make the office more comfortable he decided to remove a partition and plant several bamboos in a row. He thinks it would be nice if there are n bamboos in a row, and the i-th from the ... | instruction | 0 | 59,384 | 8 | 118,768 |
Tags: brute force, data structures, implementation, math, number theory, sortings, two pointers
Correct Solution:
```
import itertools
unfold = itertools.chain.from_iterable
speedup = 400000
def jumps(a):
d = speedup
while d < a - 1:
c = (a + d - 1) // d
d = (a + c - 2) // (c - 1)
yie... | output | 1 | 59,384 | 8 | 118,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vladimir wants to modernize partitions in his office. To make the office more comfortable he decided to remove a partition and plant several bamboos in a row. He thinks it would be nice if there... | instruction | 0 | 59,385 | 8 | 118,770 |
No | output | 1 | 59,385 | 8 | 118,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vladimir wants to modernize partitions in his office. To make the office more comfortable he decided to remove a partition and plant several bamboos in a row. He thinks it would be nice if there... | instruction | 0 | 59,386 | 8 | 118,772 |
No | output | 1 | 59,386 | 8 | 118,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vladimir wants to modernize partitions in his office. To make the office more comfortable he decided to remove a partition and plant several bamboos in a row. He thinks it would be nice if there... | instruction | 0 | 59,387 | 8 | 118,774 |
No | output | 1 | 59,387 | 8 | 118,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vladimir wants to modernize partitions in his office. To make the office more comfortable he decided to remove a partition and plant several bamboos in a row. He thinks it would be nice if there... | instruction | 0 | 59,388 | 8 | 118,776 |
No | output | 1 | 59,388 | 8 | 118,777 |
Provide a correct Python 3 solution for this coding contest problem.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9 are famous in Japan). However, the room numbers in this... | instruction | 0 | 59,593 | 8 | 119,186 |
"Correct Solution:
```
from sys import stdin
readline = stdin.readline
while True:
old_room_num = int(readline())
if old_room_num == 0:
break
octal = oct(old_room_num)[2:]
new_room_num = octal.translate(str.maketrans('4567', '5789'))
print(new_room_num)
``` | output | 1 | 59,593 | 8 | 119,187 |
Provide a correct Python 3 solution for this coding contest problem.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9 are famous in Japan). However, the room numbers in this... | instruction | 0 | 59,594 | 8 | 119,188 |
"Correct Solution:
```
# AOJ 0208 Room Numbers of a Hospital
# Python3 2018.6.23 bal4u
# 8進数に変換して、01234567を01235789に置き換える
dic = {'0':'0','1':'1','2':'2','3':'3','4':'5','5':'7','6':'8','7':'9'}
while 1:
n = int(input())
if n == 0: break
s = list(format(n, 'o'))
for i in range(len(s)): s[i] = dic[s[i]]
print(*s, s... | output | 1 | 59,594 | 8 | 119,189 |
Provide a correct Python 3 solution for this coding contest problem.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9 are famous in Japan). However, the room numbers in this... | instruction | 0 | 59,595 | 8 | 119,190 |
"Correct Solution:
```
while 1:
c=input()
if c=="0":break
print(format(int(c),'o').translate(str.maketrans({"4":"5","5":"7","6":"8","7":"9"})))
``` | output | 1 | 59,595 | 8 | 119,191 |
Provide a correct Python 3 solution for this coding contest problem.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9 are famous in Japan). However, the room numbers in this... | instruction | 0 | 59,596 | 8 | 119,192 |
"Correct Solution:
```
from sys import stdin
l=stdin.readlines()
for i in l[:-1]:print(oct(int(i))[2:].translate(str.maketrans("4567","5789")))
``` | output | 1 | 59,596 | 8 | 119,193 |
Provide a correct Python 3 solution for this coding contest problem.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9 are famous in Japan). However, the room numbers in this... | instruction | 0 | 59,597 | 8 | 119,194 |
"Correct Solution:
```
from sys import stdin
while(True):
n = int(stdin.readline())
if not n:
break
print(str(oct(n))[2:].translate(str.maketrans('4567','5789')))
``` | output | 1 | 59,597 | 8 | 119,195 |
Provide a correct Python 3 solution for this coding contest problem.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9 are famous in Japan). However, the room numbers in this... | instruction | 0 | 59,598 | 8 | 119,196 |
"Correct Solution:
```
while(1):
n = int(input())
if n == 0:
break
print(oct(n)[2:].translate(str.maketrans('4567', '5789')))
``` | output | 1 | 59,598 | 8 | 119,197 |
Provide a correct Python 3 solution for this coding contest problem.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9 are famous in Japan). However, the room numbers in this... | instruction | 0 | 59,599 | 8 | 119,198 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:
break
print(str(oct(n)[2:]).translate(str.maketrans("4567", "5789")))
``` | output | 1 | 59,599 | 8 | 119,199 |
Provide a correct Python 3 solution for this coding contest problem.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9 are famous in Japan). However, the room numbers in this... | instruction | 0 | 59,600 | 8 | 119,200 |
"Correct Solution:
```
while 4:
n=int(input())
if n==0:break
print(oct(n)[2:].translate(str.maketrans("4567","5789")))
``` | output | 1 | 59,600 | 8 | 119,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9... | instruction | 0 | 59,601 | 8 | 119,202 |
Yes | output | 1 | 59,601 | 8 | 119,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9... | instruction | 0 | 59,602 | 8 | 119,204 |
Yes | output | 1 | 59,602 | 8 | 119,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9... | instruction | 0 | 59,603 | 8 | 119,206 |
Yes | output | 1 | 59,603 | 8 | 119,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9... | instruction | 0 | 59,604 | 8 | 119,208 |
Yes | output | 1 | 59,604 | 8 | 119,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9... | instruction | 0 | 59,605 | 8 | 119,210 |
No | output | 1 | 59,605 | 8 | 119,211 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9... | instruction | 0 | 59,606 | 8 | 119,212 |
No | output | 1 | 59,606 | 8 | 119,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9... | instruction | 0 | 59,607 | 8 | 119,214 |
No | output | 1 | 59,607 | 8 | 119,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An architect, Devunky, who lives in Water Deven, has been asked to renovate an old large hospital.
In some countries, people don't want to use numbers that are disliked as numerophobia (4 and 9... | instruction | 0 | 59,608 | 8 | 119,216 |
No | output | 1 | 59,608 | 8 | 119,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and each of them has taken exactly z swords of some ... | instruction | 0 | 59,794 | 8 | 119,588 |
Tags: math
Correct Solution:
```
from math import gcd
def main():
n = int(input())
aa = [int(a) for a in input().split()]
x = max(aa)
z = x - aa[0]
if z == 0:
z = x - aa[1]
for a in aa:
if a != x:
z = gcd(z, x - a)
y = 0
for a in aa:
y = y + (x-a)//z
... | output | 1 | 59,794 | 8 | 119,589 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and each of them has taken exactly z swords of some ... | instruction | 0 | 59,795 | 8 | 119,590 |
Tags: math
Correct Solution:
```
#Problem H - Swords
def resto(a, b):
if (a == 0 ):
return b
else:
return resto (b % a, a)
n = int(input())
entrada = [int(i) for i in input().split(' ')]
x = 0
x = max(entrada)
z = 0
for i in entrada:
z = resto(z, x - i)
y = 0
for i in entrada:
y += (x ... | output | 1 | 59,795 | 8 | 119,591 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and each of them has taken exactly z swords of some ... | instruction | 0 | 59,796 | 8 | 119,592 |
Tags: math
Correct Solution:
```
from collections import deque
import sys
import math
def inp():
return sys.stdin.readline().strip()
n=int(inp())
a=list(map(int,inp().split()))
x=max(a)
b=[x-i for i in a]
b.sort()
b=b[1:]
gcd=b[0]
for i in range(1,len(b)):
gcd=math.gcd(b[i],gcd)
y=sum(i//gcd for i in b)
print(... | output | 1 | 59,796 | 8 | 119,593 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and each of them has taken exactly z swords of some ... | instruction | 0 | 59,797 | 8 | 119,594 |
Tags: math
Correct Solution:
```
n = int(input())
l1 = list(map(int, input().split()))
maxii = max(l1)
l2 = []
for i in range(len(l1)):
if maxii - l1[i] != 0:
l2.append(maxii - l1[i])
if len(l2) >1:
def find_gcd(x, y):
while (y):
x, y = y, x % y
return x
num1 = l2[0]
... | output | 1 | 59,797 | 8 | 119,595 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and each of them has taken exactly z swords of some ... | instruction | 0 | 59,798 | 8 | 119,596 |
Tags: math
Correct Solution:
```
def gcd(a,b):
if(b==0):
return a
return gcd(b,a%b)
n=int(input())
a=list(map(int,input().split()))
maxe=0
for e in a:
maxe=max(maxe,e)
a.sort()
z=maxe-a[0]
for e in a:
if(e!=maxe):
z=gcd(z,maxe-e)
y=0
for e in a:
y+=(maxe-e)/z
y=int(y)
print(y,z,end=... | output | 1 | 59,798 | 8 | 119,597 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and each of them has taken exactly z swords of some ... | instruction | 0 | 59,799 | 8 | 119,598 |
Tags: math
Correct Solution:
```
from math import gcd as gcd
n = int(input())
a = [int(i) for i in input().split()]
m = max(a)
y = 0
g = 0
for i in a:
g = gcd(g, m - i)
for i in a:
if i != m:
y += (m - i) // g
print(int(y), int(g))
``` | output | 1 | 59,799 | 8 | 119,599 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and each of them has taken exactly z swords of some ... | instruction | 0 | 59,800 | 8 | 119,600 |
Tags: math
Correct Solution:
```
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def MAP2():return map(float,input().split())
def LIST(): return list(map(int, input().split()))
def STRING(): return input()
import string
import sys
from heapq import heappop , h... | output | 1 | 59,800 | 8 | 119,601 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and each of them has taken exactly z swords of some ... | instruction | 0 | 59,801 | 8 | 119,602 |
Tags: math
Correct Solution:
```
import math
n=int(input())
ar=list(map(int,input().split()))
z=abs(ar[1]-ar[0])
ma=max(ar[0],ar[1])
su=ar[0]+ar[1]
for i in range(2,n):
z=math.gcd(z,abs(ar[i]-ar[i-1]))
su+=ar[i]
if(ar[i]>ma):
ma=ar[i]
print(abs(-(n*ma-su)//z),z)
``` | output | 1 | 59,801 | 8 | 119,603 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and e... | instruction | 0 | 59,802 | 8 | 119,604 |
Yes | output | 1 | 59,802 | 8 | 119,605 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and e... | instruction | 0 | 59,803 | 8 | 119,606 |
Yes | output | 1 | 59,803 | 8 | 119,607 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and e... | instruction | 0 | 59,804 | 8 | 119,608 |
Yes | output | 1 | 59,804 | 8 | 119,609 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and e... | instruction | 0 | 59,805 | 8 | 119,610 |
Yes | output | 1 | 59,805 | 8 | 119,611 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and e... | instruction | 0 | 59,806 | 8 | 119,612 |
No | output | 1 | 59,806 | 8 | 119,613 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and e... | instruction | 0 | 59,807 | 8 | 119,614 |
No | output | 1 | 59,807 | 8 | 119,615 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and e... | instruction | 0 | 59,808 | 8 | 119,616 |
No | output | 1 | 59,808 | 8 | 119,617 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and e... | instruction | 0 | 59,809 | 8 | 119,618 |
No | output | 1 | 59,809 | 8 | 119,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hote... | instruction | 0 | 59,875 | 8 | 119,750 |
Yes | output | 1 | 59,875 | 8 | 119,751 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hote... | instruction | 0 | 59,876 | 8 | 119,752 |
Yes | output | 1 | 59,876 | 8 | 119,753 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hote... | instruction | 0 | 59,877 | 8 | 119,754 |
Yes | output | 1 | 59,877 | 8 | 119,755 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hote... | instruction | 0 | 59,878 | 8 | 119,756 |
Yes | output | 1 | 59,878 | 8 | 119,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hote... | instruction | 0 | 59,879 | 8 | 119,758 |
No | output | 1 | 59,879 | 8 | 119,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hote... | instruction | 0 | 59,880 | 8 | 119,760 |
No | output | 1 | 59,880 | 8 | 119,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hote... | instruction | 0 | 59,881 | 8 | 119,762 |
No | output | 1 | 59,881 | 8 | 119,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hote... | instruction | 0 | 59,882 | 8 | 119,764 |
No | output | 1 | 59,882 | 8 | 119,765 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hote... | instruction | 0 | 59,883 | 8 | 119,766 |
No | output | 1 | 59,883 | 8 | 119,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decide... | instruction | 0 | 60,039 | 8 | 120,078 |
Tags: implementation
Correct Solution:
```
n = int(input())
m=[]
for _ in range(n):
l = [int(x) for x in input().split()[:2]]
m.append(l)
c=0
k=0
m1=[];m2=[]
for i in m:
m1.append(i[0])
m2.append(i[1])
if m1.count(0)>m1.count(1):
left = 0
else:
left = 1
if m2.count(0)>m2.count(1):
right = 0
... | output | 1 | 60,039 | 8 | 120,079 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decide... | instruction | 0 | 60,040 | 8 | 120,080 |
Tags: implementation
Correct Solution:
```
c=[]
d=[]
for i in range(int(input())):
a,b=[int(i) for i in input().split()]
c.append(a)
d.append(b)
if(c.count(0)>c.count(1)):
p=c.count(1)
else:
p=c.count(0)
if(d.count(0)>d.count(1)):
q=d.count(1)
else:
q=d.count(0)
print(p+q)
``` | output | 1 | 60,040 | 8 | 120,081 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.