message stringlengths 2 59.7k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 37 108k | cluster float64 20 20 | __index_level_0__ int64 74 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's denote as <image> the number of bits set ('1' bits) in the binary representation of the non-negative integer x.
You are given multiple queries consisting of pairs of integers l and r. For each query, find the x, such that l ≤ x ≤ r, and <image> is maximum possible. If there are multiple such numbers find the smallest of them.
Input
The first line contains integer n — the number of queries (1 ≤ n ≤ 10000).
Each of the following n lines contain two integers li, ri — the arguments for the corresponding query (0 ≤ li ≤ ri ≤ 1018).
Output
For each query print the answer in a separate line.
Examples
Input
3
1 2
2 4
1 10
Output
1
3
7
Note
The binary representations of numbers from 1 to 10 are listed below:
110 = 12
210 = 102
310 = 112
410 = 1002
510 = 1012
610 = 1102
710 = 1112
810 = 10002
910 = 10012
1010 = 10102 | instruction | 0 | 17,190 | 20 | 34,380 |
Tags: bitmasks, constructive algorithms
Correct Solution:
```
import sys
L = lambda x : len(bin(x)) - 2
n = int(input())
while n > 0:
n -= 1
l, r = map(int, sys.stdin.readline().split())
a = 0
while L(l) == L(r) and r > 0:
u = 1 << (L(r) - 1)
l-= u
r-= u
a+= u
u = 1 << (L(r) - 1)
if u + u - 1 == r and r > 1:
u<<=1
print(a+u-1)
``` | output | 1 | 17,190 | 20 | 34,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's denote as <image> the number of bits set ('1' bits) in the binary representation of the non-negative integer x.
You are given multiple queries consisting of pairs of integers l and r. For each query, find the x, such that l ≤ x ≤ r, and <image> is maximum possible. If there are multiple such numbers find the smallest of them.
Input
The first line contains integer n — the number of queries (1 ≤ n ≤ 10000).
Each of the following n lines contain two integers li, ri — the arguments for the corresponding query (0 ≤ li ≤ ri ≤ 1018).
Output
For each query print the answer in a separate line.
Examples
Input
3
1 2
2 4
1 10
Output
1
3
7
Note
The binary representations of numbers from 1 to 10 are listed below:
110 = 12
210 = 102
310 = 112
410 = 1002
510 = 1012
610 = 1102
710 = 1112
810 = 10002
910 = 10012
1010 = 10102 | instruction | 0 | 17,191 | 20 | 34,382 |
Tags: bitmasks, constructive algorithms
Correct Solution:
```
x=int(input())
for i in range(x):
x1=str(input()).split()
left=int(x1[0])
right=int(x1[1])
while (left | (left + 1)) <= right:
left |= left + 1
print(left)
``` | output | 1 | 17,191 | 20 | 34,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's denote as <image> the number of bits set ('1' bits) in the binary representation of the non-negative integer x.
You are given multiple queries consisting of pairs of integers l and r. For each query, find the x, such that l ≤ x ≤ r, and <image> is maximum possible. If there are multiple such numbers find the smallest of them.
Input
The first line contains integer n — the number of queries (1 ≤ n ≤ 10000).
Each of the following n lines contain two integers li, ri — the arguments for the corresponding query (0 ≤ li ≤ ri ≤ 1018).
Output
For each query print the answer in a separate line.
Examples
Input
3
1 2
2 4
1 10
Output
1
3
7
Note
The binary representations of numbers from 1 to 10 are listed below:
110 = 12
210 = 102
310 = 112
410 = 1002
510 = 1012
610 = 1102
710 = 1112
810 = 10002
910 = 10012
1010 = 10102 | instruction | 0 | 17,192 | 20 | 34,384 |
Tags: bitmasks, constructive algorithms
Correct Solution:
```
def ones(n):
return bin(n).count("1")
def binary(n):
return bin(n)[2:]
for _ in range(int(input())):
l,r = map(int,input().split())
L = binary(l)
R = binary(r)
L = "0" * (len(R) - len(L)) + L
idx = len(R)
ans = ""
for i in range(len(R)):
if(L[i]!=R[i]):
ans += L[i]
idx = i
break
else:
ans += L[i]
ans += "1" * (len(R) - len(ans))
can = int(ans, 2)
if(ones(r)>ones(can)):
print(r)
else:
print(can)
``` | output | 1 | 17,192 | 20 | 34,385 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's denote as <image> the number of bits set ('1' bits) in the binary representation of the non-negative integer x.
You are given multiple queries consisting of pairs of integers l and r. For each query, find the x, such that l ≤ x ≤ r, and <image> is maximum possible. If there are multiple such numbers find the smallest of them.
Input
The first line contains integer n — the number of queries (1 ≤ n ≤ 10000).
Each of the following n lines contain two integers li, ri — the arguments for the corresponding query (0 ≤ li ≤ ri ≤ 1018).
Output
For each query print the answer in a separate line.
Examples
Input
3
1 2
2 4
1 10
Output
1
3
7
Note
The binary representations of numbers from 1 to 10 are listed below:
110 = 12
210 = 102
310 = 112
410 = 1002
510 = 1012
610 = 1102
710 = 1112
810 = 10002
910 = 10012
1010 = 10102 | instruction | 0 | 17,193 | 20 | 34,386 |
Tags: bitmasks, constructive algorithms
Correct Solution:
```
import sys
input=sys.stdin.readline
n=int(input())
for _ in range(n):
l,r=list(map(int,input().split()))
a=bin(l)[2:][::-1]+"0"*65
n=len(a)
for i in range(n):
if a[i]!="1":
b=a[:i]+"1"+a[i+1:]
if int(b[::-1],2)<=r:
a=b
else:
break
print(int(a[::-1],2))
``` | output | 1 | 17,193 | 20 | 34,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's denote as <image> the number of bits set ('1' bits) in the binary representation of the non-negative integer x.
You are given multiple queries consisting of pairs of integers l and r. For each query, find the x, such that l ≤ x ≤ r, and <image> is maximum possible. If there are multiple such numbers find the smallest of them.
Input
The first line contains integer n — the number of queries (1 ≤ n ≤ 10000).
Each of the following n lines contain two integers li, ri — the arguments for the corresponding query (0 ≤ li ≤ ri ≤ 1018).
Output
For each query print the answer in a separate line.
Examples
Input
3
1 2
2 4
1 10
Output
1
3
7
Note
The binary representations of numbers from 1 to 10 are listed below:
110 = 12
210 = 102
310 = 112
410 = 1002
510 = 1012
610 = 1102
710 = 1112
810 = 10002
910 = 10012
1010 = 10102 | instruction | 0 | 17,194 | 20 | 34,388 |
Tags: bitmasks, constructive algorithms
Correct Solution:
```
from sys import stdin
input = stdin.readline
def put():
return map(int, input().split())
def fail():
print(-1)
exit()
t = int(input())
for _ in range(t):
l,r = put()
while (l|(l+1))<=r:
l = l|(l+1)
print(l)
``` | output | 1 | 17,194 | 20 | 34,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's denote as <image> the number of bits set ('1' bits) in the binary representation of the non-negative integer x.
You are given multiple queries consisting of pairs of integers l and r. For each query, find the x, such that l ≤ x ≤ r, and <image> is maximum possible. If there are multiple such numbers find the smallest of them.
Input
The first line contains integer n — the number of queries (1 ≤ n ≤ 10000).
Each of the following n lines contain two integers li, ri — the arguments for the corresponding query (0 ≤ li ≤ ri ≤ 1018).
Output
For each query print the answer in a separate line.
Examples
Input
3
1 2
2 4
1 10
Output
1
3
7
Note
The binary representations of numbers from 1 to 10 are listed below:
110 = 12
210 = 102
310 = 112
410 = 1002
510 = 1012
610 = 1102
710 = 1112
810 = 10002
910 = 10012
1010 = 10102 | instruction | 0 | 17,195 | 20 | 34,390 |
Tags: bitmasks, constructive algorithms
Correct Solution:
```
for i in range(int(input())):
a,b=map(int,input().split())
n=a
while (n<=b):
an=n
n|=(n+1)
if n>b:
break
print(an)
``` | output | 1 | 17,195 | 20 | 34,391 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's denote as <image> the number of bits set ('1' bits) in the binary representation of the non-negative integer x.
You are given multiple queries consisting of pairs of integers l and r. For each query, find the x, such that l ≤ x ≤ r, and <image> is maximum possible. If there are multiple such numbers find the smallest of them.
Input
The first line contains integer n — the number of queries (1 ≤ n ≤ 10000).
Each of the following n lines contain two integers li, ri — the arguments for the corresponding query (0 ≤ li ≤ ri ≤ 1018).
Output
For each query print the answer in a separate line.
Examples
Input
3
1 2
2 4
1 10
Output
1
3
7
Note
The binary representations of numbers from 1 to 10 are listed below:
110 = 12
210 = 102
310 = 112
410 = 1002
510 = 1012
610 = 1102
710 = 1112
810 = 10002
910 = 10012
1010 = 10102 | instruction | 0 | 17,196 | 20 | 34,392 |
Tags: bitmasks, constructive algorithms
Correct Solution:
```
def GETBIT(x, bit):
return (x >> bit) & 1
test = int(input())
while test > 0:
test -= 1
l, r = map(int, input().split())
pos = 63
x = -1
cnt = 0
ans = 0
while pos >= 0:
if GETBIT(r, pos) == 1:
if GETBIT(l, pos) == 0:
x = pos
break
cnt += 1
ans += (1 << pos)
pos -= 1
if x == -1:
print(ans)
else:
rs = cnt
pre = ans
while pos >= 0:
if GETBIT(r, pos) == 1:
if rs < cnt + pos:
rs = cnt + pos
ans = pre + (1 << pos) - 1
cnt += 1
pre += (1 << pos)
if rs < cnt:
rs = cnt
ans = pre
pos -= 1
print(ans)
``` | output | 1 | 17,196 | 20 | 34,393 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6). | instruction | 0 | 17,690 | 20 | 35,380 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
a=str(input())
b=str(input())
a=list(a)
b=list(b)
for i in range(len(a)):
a[i]=int(a[i])
b[i]=int(b[i])
d0=0
d1=0
c0=a.count(0)
c1=a.count(1)
for i in range(len(b)):
if(b[i]==0):
if(a[i]==0):
d0+=1
else:
d1+=1
#print(c0)
#print(c1)
#print(d0)
#print(d1)
print((d0*c1)+(d1*c0)-(d0*d1))
``` | output | 1 | 17,690 | 20 | 35,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6). | instruction | 0 | 17,691 | 20 | 35,382 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
a = input()
b = input()
aa = "0011"
bb = "0101"
counts = [0,0,0,0]
for i in range(n):
for j in range(len(aa)):
if a[i]==aa[j] and b[i]==bb[j]:
counts[j]+=1
res = counts[0]*counts[2]+counts[0]*counts[3]+counts[1]*counts[2]
print(res)
``` | output | 1 | 17,691 | 20 | 35,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6). | instruction | 0 | 17,692 | 20 | 35,384 |
Tags: implementation, math
Correct Solution:
```
input()
a = input()
b = input()
if "0" not in a or "1" not in a or "0" not in b:
print(0)
else:
o,z, res = 0,0,0 #number of zeros,ones and result
for i in a:
if i=="0":
z+=1
else:
o+=1
for i in range(0, len(b)):
if b[i]=="0":
if a[i]=="0":
res+=o
z-=1
else:
res+=z
o-=1
print(res)
``` | output | 1 | 17,692 | 20 | 35,385 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6). | instruction | 0 | 17,693 | 20 | 35,386 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
a = input()
b = input()
zo = {(0, 0): 0, (0, 1): 0, (1, 0): 0, (1, 1): 0}
for c, d in zip(a, b):
zo[int(c), int(d)] += 1
print(zo[0, 0] * (zo[1, 0] + zo[1, 1]) + zo[1, 0] * zo[0, 1])
``` | output | 1 | 17,693 | 20 | 35,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6). | instruction | 0 | 17,694 | 20 | 35,388 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
a = list(map(int, list(input())))
b = list(map(int, list(input())))
a0 = 0
a1 = 0
ans = 0
b0 = 0
b1 = 0
for i in a:
if i == 0:
a0 += 1
else:
a1 += 1
for i in range(n):
if b[i] == 0:
if a[i] == 0:
ans += a1
b0 += 1
else:
ans += a0
b1 += 1
ans -= b0 * b1
print(ans)
``` | output | 1 | 17,694 | 20 | 35,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6). | instruction | 0 | 17,695 | 20 | 35,390 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
a=input()
b=input()
s=[0,0]
for i in range(n):
if a[i]=='1':
t=ord(b[i])-ord('0')
s[t]+=1
ans=0
for i in range(n):
if a[i]=='0':
if b[i]=='0':
ans+=s[0]+s[1]
else:
ans+=s[0]
print(ans)
``` | output | 1 | 17,695 | 20 | 35,391 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6). | instruction | 0 | 17,696 | 20 | 35,392 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
a = input()
b = input()
c00 = 0
c10 = 0
c0 = 0
for i in range(n):
if a[i] == '1' and b[i] == '0':
c10 += 1
elif a[i] == '0' and b[i] == '0':
c00 += 1
if a[i] == '0':
c0 += 1
c1 = n - c0
print(c00 * c1 + c10 * c0 - c00 * c10)
``` | output | 1 | 17,696 | 20 | 35,393 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6). | instruction | 0 | 17,697 | 20 | 35,394 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
a = input()
b = input()
x1 = 0
x2 = 0
x3 = 0
x4 = 0
for i in range (0,n):
a1 = a[i]
b1 = b[i]
if a1 == "0" and b1 == "0":
x1 = x1+1
if a1 == "1" and b1 == "0":
x2 = x2+1
if a1 == "0" and b1 == "1":
x3 = x3+1
if a1 == "1" and b1 == "1":
x4 = x4+1
out = x1 * x2 + x2 * x3 + x4 * x1
print(str(out))
``` | output | 1 | 17,697 | 20 | 35,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6).
Submitted Solution:
```
n=int(input())
a=input()
b=input()
zeroesB=0
ans=0
zeroesA=onesA=0
for x in range(n):
if(a[x]=='0'):
zeroesA+=1
else:
onesA+=1
zz=zo=0
for x in range(n):
if(b[x]=='0'):
if(a[x]=='0'):
zz+=1
ans+=onesA
else:
zo+=1
ans+=zeroesA
if(zeroesA==n or onesA==n):
print(0)
else:
print(ans-zz*zo)
``` | instruction | 0 | 17,698 | 20 | 35,396 |
Yes | output | 1 | 17,698 | 20 | 35,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6).
Submitted Solution:
```
n=int(input())
s=input()
a=[(s[i]=='1') for i in range(0,n)]
s=input()
b=[(s[i]=='1') for i in range(0,n)]
c00=0
c10=0
c1=0
c01=0
for i in range(0,n):
if a[i]:
c1+=1
if not b[i]:
c10+=1
else:
if b[i]:
c01+=1
else:
c00+=1
print(c00*c1+c10*c01)
``` | instruction | 0 | 17,699 | 20 | 35,398 |
Yes | output | 1 | 17,699 | 20 | 35,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6).
Submitted Solution:
```
n = int(input())
a = input()
b = input()
c = []
d = []
e = []
for i in range(0, 200) : e.append(0)
for i in range(0, n) :
c.append(int(a[i]))
d.append(int(b[i]))
e[c[i] * 2 + d[i]] += 1
print(e[0] * e[2] + e[0] * e[3] + e[1] * e[2])
``` | instruction | 0 | 17,700 | 20 | 35,400 |
Yes | output | 1 | 17,700 | 20 | 35,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6).
Submitted Solution:
```
N=int(input())
A=list(map(int,input()))
B=list(map(int,input()))
s=0
Z=A.count(0)
O=A.count(1)
L=set([])
for i in range(N-1,-1,-1):
if(B[i]==0):
if(A[i]==1):
s+=Z
O-=1
if(A[i]==0):
s+=O
Z-=1
print(s)
``` | instruction | 0 | 17,701 | 20 | 35,402 |
Yes | output | 1 | 17,701 | 20 | 35,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6).
Submitted Solution:
```
n=int(input())
s=input()
t=input()
ans=0
cnt=0
for i in range(len(t)):
if t[i]=='0':
if s[i]=='0':
ans+=s.count('1')-cnt
cnt+=1
else:
ans+=(s.count('0')-cnt)
print(ans)
``` | instruction | 0 | 17,702 | 20 | 35,404 |
No | output | 1 | 17,702 | 20 | 35,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6).
Submitted Solution:
```
n = int(input())
a = input()
b = input()
a0 = sum([v == '0' for v in a])
a1 = sum([v == '1' for v in a])
b0 = [v == '0' for v in b]
ans = 0
re = 0
c = set()
for i, v in enumerate(a):
if v == '0':
if b[i] == '0':
ans += a1
for v, h in enumerate(a):
if h == '1':
tmp1 = str(i) + '0' + str(v);
tmp2 = str(v) + '0' + str(i)
c.add(tmp1); c.add(tmp2)
else:
if b[i] == '0':
ans += a0
for v, h in enumerate(a):
if h == '0':
tmp1 = str(i) + '0' + str(v); tmp2 = str(v) + '0' + str(i)
c.add(tmp1); c.add(tmp2)
print(len(c) // 2)
``` | instruction | 0 | 17,703 | 20 | 35,406 |
No | output | 1 | 17,703 | 20 | 35,407 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6).
Submitted Solution:
```
n = int(input())
a = input()
b = input()
zerozero = 0
oneone = 0
onezero = 0
zeroone = 0
for i in range(n):
if a[i]=='0' and b[i] == '0':
zerozero+=1
continue
if a[i]=='1' and b[i] == '1':
oneone+=1
continue
if a[i]=='0':
zeroone+=1
continue
if a[i]=='1':
onezero+=1
continue
#print(zerozero)
#print(zeroone)
#print(onezero)
#print(oneone)
ans = 0
ans+=zerozero*(onezero)
ans+=oneone*(zeroone)+zeroone
print(ans)
``` | instruction | 0 | 17,704 | 20 | 35,408 |
No | output | 1 | 17,704 | 20 | 35,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Rudolf is on his way to the castle. Before getting into the castle, the security staff asked him a question:
Given two binary numbers a and b of length n. How many different ways of swapping two digits in a (only in a, not b) so that bitwise OR of these two numbers will be changed? In other words, let c be the bitwise OR of a and b, you need to find the number of ways of swapping two bits in a so that bitwise OR will not be equal to c.
Note that binary numbers can contain leading zeros so that length of each number is exactly n.
[Bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is a binary operation. A result is a binary number which contains a one in each digit if there is a one in at least one of the two numbers. For example, 01010_2 OR 10011_2 = 11011_2.
Well, to your surprise, you are not Rudolf, and you don't need to help him… You are the security staff! Please find the number of ways of swapping two bits in a so that bitwise OR will be changed.
Input
The first line contains one integer n (2≤ n≤ 10^5) — the number of bits in each number.
The second line contains a binary number a of length n.
The third line contains a binary number b of length n.
Output
Print the number of ways to swap two bits in a so that bitwise OR will be changed.
Examples
Input
5
01011
11001
Output
4
Input
6
011000
010011
Output
6
Note
In the first sample, you can swap bits that have indexes (1, 4), (2, 3), (3, 4), and (3, 5).
In the second example, you can swap bits that have indexes (1, 2), (1, 3), (2, 4), (3, 4), (3, 5), and (3, 6).
Submitted Solution:
```
from collections import Counter
n=int(input())
a=list(map(int,input()))
b=list(map(int,input()))
ways=0
l=Counter(a)
for i in range(n):
if b[i]==0:
if a[i]==0:
ways+=int(l[1])
if b[i]==1:
if a[i]==0:
ways+=1
print(ways)
``` | instruction | 0 | 17,705 | 20 | 35,410 |
No | output | 1 | 17,705 | 20 | 35,411 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 ≤ b < w, 0 < x < w) and Alexander took integer с. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b ≥ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c ≤ a.
Input
The first line contains integers a, b, w, x, c (1 ≤ a ≤ 2·109, 1 ≤ w ≤ 1000, 0 ≤ b < w, 0 < x < w, 1 ≤ c ≤ 2·109).
Output
Print a single integer — the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0 | instruction | 0 | 18,028 | 20 | 36,056 |
Tags: binary search, math
Correct Solution:
```
a, b, w, x, c = map(int, input().split())
def result(a, b, w, x, c, s):
na = a - (s * x - b) / w
nc = c - s
return (na, nc)
def solve(a, b, w, x, c):
left = 0
right = 10e15
if (c <= a):
return 0
while (left < right):
half = (left+right) // 2
ret = result(a, b, w, x, c, half)
if (ret[1] <= ret[0]):
right = half
else:
left = half + 1
return left
print(int(solve(a, b, w, x, c)))
# Made By Mostafa_Khaled
``` | output | 1 | 18,028 | 20 | 36,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 ≤ b < w, 0 < x < w) and Alexander took integer с. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b ≥ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c ≤ a.
Input
The first line contains integers a, b, w, x, c (1 ≤ a ≤ 2·109, 1 ≤ w ≤ 1000, 0 ≤ b < w, 0 < x < w, 1 ≤ c ≤ 2·109).
Output
Print a single integer — the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0 | instruction | 0 | 18,029 | 20 | 36,058 |
Tags: binary search, math
Correct Solution:
```
__author__ = 'asmn'
a, b, w, x, c = tuple(map(int, input().split()))
if c <= a:
print(0)
exit()
l, r = 0, (c - a) * 10000
while l + 1 < r:
m = (l + r) // 2
if c - m <= a - (w - b - 1 + m * x) // w:
r = m
else:
l = m
print(r)
``` | output | 1 | 18,029 | 20 | 36,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 ≤ b < w, 0 < x < w) and Alexander took integer с. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b ≥ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c ≤ a.
Input
The first line contains integers a, b, w, x, c (1 ≤ a ≤ 2·109, 1 ≤ w ≤ 1000, 0 ≤ b < w, 0 < x < w, 1 ≤ c ≤ 2·109).
Output
Print a single integer — the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0 | instruction | 0 | 18,030 | 20 | 36,060 |
Tags: binary search, math
Correct Solution:
```
a,b,w,x,c = map(int,input().split())
poc = 0
s = set()
s.add(b)
pa,pb,pc = a,b,c
while (c > a) :
c -= 1
if b >= x:
b = b-x
else:
a -= 1
b = w - (x-b)
if b in s:
kolko = len(s)
break
s.add(b)
dl = len(s)
kolko = max(pa-a,1)
if dl == kolko:
print(0)
else:
roz = (pc-pa)//(dl-kolko) - 1
poc = roz*dl
c = pc - poc
a = pa - roz*kolko
b = pb
#a,b,c,poc=pa,pb,pc,0
#print(a,b,w,x,c)
while (c > a) :
c -= 1
if b >= x:
b = b-x
else:
a -= 1
b = w - (x-b)
poc+=1
#print(a,b,w,x,c)
print(poc)
``` | output | 1 | 18,030 | 20 | 36,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 ≤ b < w, 0 < x < w) and Alexander took integer с. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b ≥ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c ≤ a.
Input
The first line contains integers a, b, w, x, c (1 ≤ a ≤ 2·109, 1 ≤ w ≤ 1000, 0 ≤ b < w, 0 < x < w, 1 ≤ c ≤ 2·109).
Output
Print a single integer — the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0 | instruction | 0 | 18,031 | 20 | 36,062 |
Tags: binary search, math
Correct Solution:
```
import sys
def solve():
a, b, w, x, c = map(int, input().split())
w -= x
small, large = 0, int(1e20)
while small < large:
avg = (small + large) // 2
if works(avg, a, b, c, w, x): large = avg
else: small = avg + 1
return small
def works(val, a, b, c, w, x):
cres = c - val
amin = cres
maxsubtract = a - amin
if maxsubtract < 0: return False
bsubtract = val - maxsubtract
bres = b + maxsubtract * w - x * bsubtract
return bres >= 0
if sys.hexversion == 50594544 : sys.stdin = open("test.txt")
print(solve())
``` | output | 1 | 18,031 | 20 | 36,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 ≤ b < w, 0 < x < w) and Alexander took integer с. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b ≥ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c ≤ a.
Input
The first line contains integers a, b, w, x, c (1 ≤ a ≤ 2·109, 1 ≤ w ≤ 1000, 0 ≤ b < w, 0 < x < w, 1 ≤ c ≤ 2·109).
Output
Print a single integer — the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0 | instruction | 0 | 18,034 | 20 | 36,068 |
Tags: binary search, math
Correct Solution:
```
a, b, w, x, c = map(int, input().split())
def result(a, b, w, x, c, s):
na = a - (s * x - b) / w
nc = c - s
return (na, nc)
def solve(a, b, w, x, c):
left = 0
right = 10e15
if (c <= a):
return 0
while (left < right):
half = (left+right) // 2
ret = result(a, b, w, x, c, half)
if (ret[1] <= ret[0]):
right = half
else:
left = half + 1
return left
print(int(solve(a, b, w, x, c)))
``` | output | 1 | 18,034 | 20 | 36,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arthur and Alexander are number busters. Today they've got a competition.
Arthur took a group of four integers a, b, w, x (0 ≤ b < w, 0 < x < w) and Alexander took integer с. Arthur and Alexander use distinct approaches to number bustings. Alexander is just a regular guy. Each second, he subtracts one from his number. In other words, he performs the assignment: c = c - 1. Arthur is a sophisticated guy. Each second Arthur performs a complex operation, described as follows: if b ≥ x, perform the assignment b = b - x, if b < x, then perform two consecutive assignments a = a - 1; b = w - (x - b).
You've got numbers a, b, w, x, c. Determine when Alexander gets ahead of Arthur if both guys start performing the operations at the same time. Assume that Alexander got ahead of Arthur if c ≤ a.
Input
The first line contains integers a, b, w, x, c (1 ≤ a ≤ 2·109, 1 ≤ w ≤ 1000, 0 ≤ b < w, 0 < x < w, 1 ≤ c ≤ 2·109).
Output
Print a single integer — the minimum time in seconds Alexander needs to get ahead of Arthur. You can prove that the described situation always occurs within the problem's limits.
Examples
Input
4 2 3 1 6
Output
2
Input
4 2 3 1 7
Output
4
Input
1 2 3 2 6
Output
13
Input
1 1 2 1 1
Output
0 | instruction | 0 | 18,035 | 20 | 36,070 |
Tags: binary search, math
Correct Solution:
```
def f(t, c, b, w):
a = b
s = l = 0
while True:
b += w
dt = b // x
b -= dt * x
s += dt
l += 1
if a == b: break
k = c // s
if c == k * s: k -= 1
c -= k * s
t += k * (s + l)
while True:
b += w
dt = b // x
b -= dt * x
if c <= dt: return t + c
c -= dt
t += dt + 1
a, b, w, x, c = map(int, input().split())
t = b // x
if a >= c - t: print(c - min(c, a))
else: print(f(t + 1, c - t - a, b - t * x, w - x))
``` | output | 1 | 18,035 | 20 | 36,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010 | instruction | 0 | 18,123 | 20 | 36,246 |
Tags: implementation
Correct Solution:
```
s = input()
t = input()
n = len(s)
st = ""
for i in range(n):
if s[i]==t[i]:
st+="0"
else:
st+="1"
print(st)
``` | output | 1 | 18,123 | 20 | 36,247 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010 | instruction | 0 | 18,124 | 20 | 36,248 |
Tags: implementation
Correct Solution:
```
s1 = input(); s2 = input(); r = ''
for i in range(len(s1)):
r += str(abs(int(s1[i]) - int(s2[i])))
print(r)
``` | output | 1 | 18,124 | 20 | 36,249 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010 | instruction | 0 | 18,125 | 20 | 36,250 |
Tags: implementation
Correct Solution:
```
l=list(input())
l1=list(input())
for i in range(0,len(l)):
if(l[i]==l1[i]):
print("0",end="")
else:
print("1",end="")
``` | output | 1 | 18,125 | 20 | 36,251 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010 | instruction | 0 | 18,126 | 20 | 36,252 |
Tags: implementation
Correct Solution:
```
l1 = list(input())
l2 = list(input())
l3 = ''
for i in range(len(l1)):
if l1[i] != l2[i]:
l3 += '1'
else:
l3 += '0'
print(l3)
``` | output | 1 | 18,126 | 20 | 36,253 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010 | instruction | 0 | 18,127 | 20 | 36,254 |
Tags: implementation
Correct Solution:
```
a,b = [list(input()) for i in range(2)]
for i in range(len(a)):
a[i] = str(abs(int(a[i])-int(b[i])))
print("".join(a))
``` | output | 1 | 18,127 | 20 | 36,255 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010 | instruction | 0 | 18,128 | 20 | 36,256 |
Tags: implementation
Correct Solution:
```
a=input()
b=input()
a=list(a)
b=list(b)
l=[]
for i in range(len(a)):
if a[i]==b[i]:
l.append(str(0))
else:
l.append(str(1))
print("".join(l))
``` | output | 1 | 18,128 | 20 | 36,257 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010 | instruction | 0 | 18,129 | 20 | 36,258 |
Tags: implementation
Correct Solution:
```
a = input()
b = input()
c = ""
for i in range(0,len(a)):
if(a[i]=='1' and b[i]=='1'):
c += '0'
elif (a[i]=='0' and b[i]=='0'):
c += '0'
else :
c+= '1'
print(c)
``` | output | 1 | 18,129 | 20 | 36,259 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010 | instruction | 0 | 18,130 | 20 | 36,260 |
Tags: implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Mon Oct 12 12:43:28 2020
@author: feibiaodi
"""
m=str(input())
n=str(input())
d=""
for i in range(0,len(m)):
if m[i]==n[i]=="0" or m[i]==n[i]=="1":
d=d+"0"
if (m[i]=="1" and n[i]=="0") or (m[i]=="0" and n[i]=="1"):
d=d+"1"
print(d)
``` | output | 1 | 18,130 | 20 | 36,261 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010
Submitted Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun Nov 1 01:38:21 2020
@author: Error
"""
n = list(input())
k = list(input())
result = ""
for i in range(len(n)):
if n[i] != k[i]:
result +='1'
else:
result +='0'
print(result)
``` | instruction | 0 | 18,131 | 20 | 36,262 |
Yes | output | 1 | 18,131 | 20 | 36,263 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010
Submitted Solution:
```
s0=str(input())
s1=str(input())
s=''
for i,j in zip(s0,s1):
if i!=j:
s+='1'
else:
s+='0'
print(s)
``` | instruction | 0 | 18,132 | 20 | 36,264 |
Yes | output | 1 | 18,132 | 20 | 36,265 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010
Submitted Solution:
```
l1 = list(input())
l2 = list(input())
n = len(l1)
for i in range(n):
if l1[i]==l2[i]:
print('0', end='')
else:
print('1', end='')
print()
``` | instruction | 0 | 18,133 | 20 | 36,266 |
Yes | output | 1 | 18,133 | 20 | 36,267 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010
Submitted Solution:
```
li1 = list(map(int, list(input())))
li2 = list(map(int, list(input())))
for i in range(len(li1)):
if li1[i] == li2[i]:
print('0', sep='', end='')
else:
print('1', sep='', end='')
``` | instruction | 0 | 18,134 | 20 | 36,268 |
Yes | output | 1 | 18,134 | 20 | 36,269 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010
Submitted Solution:
```
print(bin(int(input(), 2) ^ int(input(), 2)))
``` | instruction | 0 | 18,135 | 20 | 36,270 |
No | output | 1 | 18,135 | 20 | 36,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010
Submitted Solution:
```
a = input().strip()
b = input().strip()
res = bin(int(a, 2) ^ int(b, 2))[2:]
print('0' + res if a[0] == b[0] else res)
``` | instruction | 0 | 18,136 | 20 | 36,272 |
No | output | 1 | 18,136 | 20 | 36,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010
Submitted Solution:
```
n1=int(input())
n2=int(input())
n=n1+n2
n=list(str(n))
c=0
for _ in n:
if _ == '2':
n[c]='0'
c+=1
print(''.join(n))
``` | instruction | 0 | 18,137 | 20 | 36,274 |
No | output | 1 | 18,137 | 20 | 36,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.
One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.
In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.
Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length ∞ (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.
Now you are going to take part in Shapur's contest. See if you are faster and more accurate.
Input
There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.
Output
Write one line — the corresponding answer. Do not omit the leading 0s.
Examples
Input
1010100
0100101
Output
1110001
Input
000
111
Output
111
Input
1110
1010
Output
0100
Input
01110
01100
Output
00010
Submitted Solution:
```
#A7_musameh
num1 = str(input('enter the numbre component of 0 and(or) 1 :'))
num2 = str(input('enter the numbre component of 0 and(or) 1 :'))
if len(num1)==len(num2):
if '2' in num1 or '2' in num1 or '3' in num1 or '4' in num1 or '5' in num1 or '6' in num1 or '7' in num1 or '8' in num1 or '9' in num1:
if '2' in num2 or '2' in num2 or '3' in num2 or '4' in num2 or '5' in num2 or '6' in num2 or '7' in num2 or '8' in num2 or '9' in num2:
if len(num1)>=0 and len(num1)<=100:
if len(num2)>=0 and len(num2)<=100:
for i in range(len(num1)):
if num1[i]==num2[i]:
print('0', end='')
else:
print('1', end='')
else:
print('The num2 must be 0 or less or equal to 100')
else:
print('The num1 must be 0 or less or equal to 100')
else:
print('num2 must contain only the numbers 0 and or 1')
else:
print('num1 must contain only the numbers 0 and or 1')
else:
print('Please enter the same length for num1 and num2')
``` | instruction | 0 | 18,138 | 20 | 36,276 |
No | output | 1 | 18,138 | 20 | 36,277 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10. | instruction | 0 | 18,236 | 20 | 36,472 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
if n%10 < 5:
n -= n%10
else:
n += 10 - n%10
print(n)
``` | output | 1 | 18,236 | 20 | 36,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10. | instruction | 0 | 18,237 | 20 | 36,474 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
if(n>=0 and n<=5):
print('0')
elif(n>5 and n<10):
print(10)
elif(n%10==5):
print(str(n//10)+'0')
elif(n%10<5 and n%10!=0 and n>10):
print(str((n//10))+'0')
elif(n%10>5 and n%10!=0 and n>10):
print(str((n//10)+1)+'0')
elif(n%10==0):
print(n)
``` | output | 1 | 18,237 | 20 | 36,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10. | instruction | 0 | 18,238 | 20 | 36,476 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
if(n%10<=5):
print(n-n%10)
else:
print(n-n%10+10)
``` | output | 1 | 18,238 | 20 | 36,477 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10. | instruction | 0 | 18,239 | 20 | 36,478 |
Tags: implementation, math
Correct Solution:
```
a=int(input())
if (a%10==0):
print(a)
elif (a%10<=5):
a=int(a/10)
r=int(a*10)
print(r)
else:
a=a/10
q=int(a)
q=q+1
b=int(q*10)
print(b)
``` | output | 1 | 18,239 | 20 | 36,479 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10. | instruction | 0 | 18,240 | 20 | 36,480 |
Tags: implementation, math
Correct Solution:
```
import string
n = int(input())
s = str(n)
if int(s[len(s)-1]) <= 5:
n = n - int(s[len(s)-1])
else: n = n + 10 - int(s[len(s)-1])
print(n)
``` | output | 1 | 18,240 | 20 | 36,481 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.