message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 42 109k | cluster float64 5 5 | __index_level_0__ int64 84 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each test case consists of two non-negative integers a and b whi... | instruction | 0 | 103,568 | 5 | 207,136 |
"Correct Solution:
```
import sys
from math import log10
for line in sys.stdin:
a, b = map(int, line.split())
print(int(log10(a+b)+1))
``` | output | 1 | 103,568 | 5 | 207,137 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each test case consists of two non-negative integers a and b whi... | instruction | 0 | 103,569 | 5 | 207,138 |
"Correct Solution:
```
while True:
try:
s = input()
a, b = [int(i) for i in s.split()]
print(len(str(a + b)))
except:
break
``` | output | 1 | 103,569 | 5 | 207,139 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each test case consists of two non-negative integers a and b whi... | instruction | 0 | 103,570 | 5 | 207,140 |
"Correct Solution:
```
import sys
lines = []
for line in sys.stdin:
num = line.split(" ")
print(len(str(int(num[0]) + int(num[1]))))
``` | output | 1 | 103,570 | 5 | 207,141 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each test case consists of two non-negative integers a and b whi... | instruction | 0 | 103,571 | 5 | 207,142 |
"Correct Solution:
```
import sys
su = 0
for line in sys.stdin:
for x in line.split():
su += int(x)
su = str(su)
size = len(su)
print(size)
su = 0
``` | output | 1 | 103,571 | 5 | 207,143 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each test case consists of two non-negative integers a and b whi... | instruction | 0 | 103,572 | 5 | 207,144 |
"Correct Solution:
```
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
for line in sys.stdin:
a,b = map(int,line.split())
print(len(str(a+b)))
``` | output | 1 | 103,572 | 5 | 207,145 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each test case consists of two non-negative integers a and b whi... | instruction | 0 | 103,573 | 5 | 207,146 |
"Correct Solution:
```
import sys
for line in sys.stdin:
x, y = map(int, line.split())
print(len(str(x+y)))
``` | output | 1 | 103,573 | 5 | 207,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each tes... | instruction | 0 | 103,574 | 5 | 207,148 |
Yes | output | 1 | 103,574 | 5 | 207,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each tes... | instruction | 0 | 103,575 | 5 | 207,150 |
Yes | output | 1 | 103,575 | 5 | 207,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each tes... | instruction | 0 | 103,576 | 5 | 207,152 |
Yes | output | 1 | 103,576 | 5 | 207,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each tes... | instruction | 0 | 103,577 | 5 | 207,154 |
Yes | output | 1 | 103,577 | 5 | 207,155 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each tes... | instruction | 0 | 103,578 | 5 | 207,156 |
No | output | 1 | 103,578 | 5 | 207,157 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each tes... | instruction | 0 | 103,579 | 5 | 207,158 |
No | output | 1 | 103,579 | 5 | 207,159 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each tes... | instruction | 0 | 103,580 | 5 | 207,160 |
No | output | 1 | 103,580 | 5 | 207,161 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which computes the digit number of sum of two integers a and b.
Constraints
* 0 ≤ a, b ≤ 1,000,000
* The number of datasets ≤ 200
Input
There are several test cases. Each tes... | instruction | 0 | 103,581 | 5 | 207,162 |
No | output | 1 | 103,581 | 5 | 207,163 |
Provide a correct Python 3 solution for this coding contest problem.
B: Ebi-chan and Integer Sequences-
problem
Ebi-chan likes sequences. I especially like arithmetic progressions. This time, I decided to create a sequence that meets the following conditions.
* Arithmetic progression of length n
* When the i-th ele... | instruction | 0 | 103,634 | 5 | 207,268 |
"Correct Solution:
```
n,m=map(int,input().split())
mod1,mod2=10**9+7,998244353
mod=mod1
ans=(m+1)%mod
if n!=1:
a=m//(n-1)
ans=((m+1)*(a+1)+(m+1)*a-(n-1)*a*(a+1))%mod
print(ans)
``` | output | 1 | 103,634 | 5 | 207,269 |
Provide a correct Python 3 solution for this coding contest problem.
B: Ebi-chan and Integer Sequences-
problem
Ebi-chan likes sequences. I especially like arithmetic progressions. This time, I decided to create a sequence that meets the following conditions.
* Arithmetic progression of length n
* When the i-th ele... | instruction | 0 | 103,635 | 5 | 207,270 |
"Correct Solution:
```
MOD = 10**9+7
def sum(a,d,n):
return n*(2*a+(n-1)*d)//2
def main():
n,m = map(int,input().split())
s = 0
if n == 1:
s = m+1
else:
s = sum(m+1,-n+1,1+m//(n-1))
s *= 2
s -= (m+1)
print(s%MOD)
if __name__ == '__main__':
main()
``` | output | 1 | 103,635 | 5 | 207,271 |
Provide a correct Python 3 solution for this coding contest problem.
B: Ebi-chan and Integer Sequences-
problem
Ebi-chan likes sequences. I especially like arithmetic progressions. This time, I decided to create a sequence that meets the following conditions.
* Arithmetic progression of length n
* When the i-th ele... | instruction | 0 | 103,636 | 5 | 207,272 |
"Correct Solution:
```
n, m = map(int, input().split())
MOD = 10**9 + 7
if n == 1:
print((m+1) % MOD)
else:
k = m//(n-1)
res = m+1 + 2*(m*k - k*(k+1)*(n-1)//2+k)
print(res % MOD)
``` | output | 1 | 103,636 | 5 | 207,273 |
Provide a correct Python 3 solution for this coding contest problem.
B: Ebi-chan and Integer Sequences-
problem
Ebi-chan likes sequences. I especially like arithmetic progressions. This time, I decided to create a sequence that meets the following conditions.
* Arithmetic progression of length n
* When the i-th ele... | instruction | 0 | 103,637 | 5 | 207,274 |
"Correct Solution:
```
n,m = map(int,input().split())
if(n == 1):
ans = (m+1)%1000000007
print(ans)
else:
d = int(m//(n-1))
ans = (m+1)*d - d*(d+1)//2*(n-1)
ans *= 2
ans += (m+1)
ans %= 1000000007
print(ans)
``` | output | 1 | 103,637 | 5 | 207,275 |
Provide a correct Python 3 solution for this coding contest problem.
B: Ebi-chan and Integer Sequences-
problem
Ebi-chan likes sequences. I especially like arithmetic progressions. This time, I decided to create a sequence that meets the following conditions.
* Arithmetic progression of length n
* When the i-th ele... | instruction | 0 | 103,638 | 5 | 207,276 |
"Correct Solution:
```
r = 1000000007
n, m = input().split()
n = int(n)
m = int(m)
if n==1:
output = (m+1)%r
print(output)
else:
l = (m+1) // (n-1) + 1
a = (m+1) - ((m+1) // (n-1)) * (n-1)
e = m+1
output = ((a+e)*l) // 2
output = 2*output - (m+1)
output = output % r
print(output)
``` | output | 1 | 103,638 | 5 | 207,277 |
Provide a correct Python 3 solution for this coding contest problem.
B: Ebi-chan and Integer Sequences-
problem
Ebi-chan likes sequences. I especially like arithmetic progressions. This time, I decided to create a sequence that meets the following conditions.
* Arithmetic progression of length n
* When the i-th ele... | instruction | 0 | 103,639 | 5 | 207,278 |
"Correct Solution:
```
s = input()
n, m = s.split()
n = int(n)
m = int(m)
if n==1:
print((m+1)%1000000007)
else:
d = m // (n - 1)
A = m - d * (n-1) + 1
B = m - (n-1) + 1
ans = (A+B)*d + (m+1)
# ans = 2*(d*m+d)-(n-1)*(d+1)*d+m+1
ans %= 1000000007
print(ans)
``` | output | 1 | 103,639 | 5 | 207,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
B: Ebi-chan and Integer Sequences-
problem
Ebi-chan likes sequences. I especially like arithmetic progressions. This time, I decided to create a sequence that meets the following conditions.
... | instruction | 0 | 103,640 | 5 | 207,280 |
No | output | 1 | 103,640 | 5 | 207,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
B: Ebi-chan and Integer Sequences-
problem
Ebi-chan likes sequences. I especially like arithmetic progressions. This time, I decided to create a sequence that meets the following conditions.
... | instruction | 0 | 103,641 | 5 | 207,282 |
No | output | 1 | 103,641 | 5 | 207,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
B: Ebi-chan and Integer Sequences-
problem
Ebi-chan likes sequences. I especially like arithmetic progressions. This time, I decided to create a sequence that meets the following conditions.
... | instruction | 0 | 103,642 | 5 | 207,284 |
No | output | 1 | 103,642 | 5 | 207,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
B: Ebi-chan and Integer Sequences-
problem
Ebi-chan likes sequences. I especially like arithmetic progressions. This time, I decided to create a sequence that meets the following conditions.
... | instruction | 0 | 103,643 | 5 | 207,286 |
No | output | 1 | 103,643 | 5 | 207,287 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this problem at each moment you have a set of intervals. You can move from interval (a, b) from our set to interval (c, d) from our set if and only if c < a < d or c < b < d. Also there is a path from interval I1 from our set to interval ... | instruction | 0 | 103,989 | 5 | 207,978 |
Tags: data structures
Correct Solution:
```
_set, h = [], []
def dfs(a, b, Len, h):
if a == b:
return True
Len[a] = True
for x in h[a]:
if not Len[x] and dfs(x, b, Len, h):
return True
return False
for i in range(int(input())):
q, x, y = map(int, input().split())
if q ==... | output | 1 | 103,989 | 5 | 207,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem at each moment you have a set of intervals. You can move from interval (a, b) from our set to interval (c, d) from our set if and only if c < a < d or c < b < d. Also there is a ... | instruction | 0 | 103,990 | 5 | 207,980 |
Yes | output | 1 | 103,990 | 5 | 207,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem at each moment you have a set of intervals. You can move from interval (a, b) from our set to interval (c, d) from our set if and only if c < a < d or c < b < d. Also there is a ... | instruction | 0 | 103,992 | 5 | 207,984 |
Yes | output | 1 | 103,992 | 5 | 207,985 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem at each moment you have a set of intervals. You can move from interval (a, b) from our set to interval (c, d) from our set if and only if c < a < d or c < b < d. Also there is a ... | instruction | 0 | 103,993 | 5 | 207,986 |
Yes | output | 1 | 103,993 | 5 | 207,987 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem at each moment you have a set of intervals. You can move from interval (a, b) from our set to interval (c, d) from our set if and only if c < a < d or c < b < d. Also there is a ... | instruction | 0 | 103,994 | 5 | 207,988 |
No | output | 1 | 103,994 | 5 | 207,989 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem at each moment you have a set of intervals. You can move from interval (a, b) from our set to interval (c, d) from our set if and only if c < a < d or c < b < d. Also there is a ... | instruction | 0 | 103,995 | 5 | 207,990 |
No | output | 1 | 103,995 | 5 | 207,991 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem at each moment you have a set of intervals. You can move from interval (a, b) from our set to interval (c, d) from our set if and only if c < a < d or c < b < d. Also there is a ... | instruction | 0 | 103,997 | 5 | 207,994 |
No | output | 1 | 103,997 | 5 | 207,995 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sereja has two sequences a and b and number p. Sequence a consists of n integers a1, a2, ..., an. Similarly, sequence b consists of m integers b1, b2, ..., bm. As usual, Sereja studies the seque... | instruction | 0 | 104,006 | 5 | 208,012 |
No | output | 1 | 104,006 | 5 | 208,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sereja has two sequences a and b and number p. Sequence a consists of n integers a1, a2, ..., an. Similarly, sequence b consists of m integers b1, b2, ..., bm. As usual, Sereja studies the seque... | instruction | 0 | 104,007 | 5 | 208,014 |
No | output | 1 | 104,007 | 5 | 208,015 |
Provide a correct Python 3 solution for this coding contest problem.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?
Constrain... | instruction | 0 | 104,203 | 5 | 208,406 |
"Correct Solution:
```
a,b,c,k = map(int,input().split())
ans = min(a,k)
if(k>a+b):
ans-=(k-(a+b))
print(ans)
``` | output | 1 | 104,203 | 5 | 208,407 |
Provide a correct Python 3 solution for this coding contest problem.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?
Constrain... | instruction | 0 | 104,204 | 5 | 208,408 |
"Correct Solution:
```
a,b,c,k = map(int,input().split())
ans=min(k,a)-max(min(k-a-b,c),0)
print(ans)
``` | output | 1 | 104,204 | 5 | 208,409 |
Provide a correct Python 3 solution for this coding contest problem.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?
Constrain... | instruction | 0 | 104,205 | 5 | 208,410 |
"Correct Solution:
```
a,b,c,k=map(int,input().split())
if k<=a+b:
print(min(a,k))
else:
print(a-(k-a-b))
``` | output | 1 | 104,205 | 5 | 208,411 |
Provide a correct Python 3 solution for this coding contest problem.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?
Constrain... | instruction | 0 | 104,206 | 5 | 208,412 |
"Correct Solution:
```
A, B, C, K = map(int, input().split())
print(min(A, K) - max(0, (K - A - B)))
``` | output | 1 | 104,206 | 5 | 208,413 |
Provide a correct Python 3 solution for this coding contest problem.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?
Constrain... | instruction | 0 | 104,207 | 5 | 208,414 |
"Correct Solution:
```
one, zero, neg_one, k = map(int, input().split())
print(min(one, k) - max(0, k-one-zero))
``` | output | 1 | 104,207 | 5 | 208,415 |
Provide a correct Python 3 solution for this coding contest problem.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?
Constrain... | instruction | 0 | 104,208 | 5 | 208,416 |
"Correct Solution:
```
a,b,c,k = map(int,input().split())
ax=min(a,k)
k=k-ax
bx=min(b,k)
k=k-bx
cx=k
print(ax-cx)
``` | output | 1 | 104,208 | 5 | 208,417 |
Provide a correct Python 3 solution for this coding contest problem.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?
Constrain... | instruction | 0 | 104,209 | 5 | 208,418 |
"Correct Solution:
```
A,B,C,K=map(int,input().split())
print(min(A,K)-max(0,K-A-B))
``` | output | 1 | 104,209 | 5 | 208,419 |
Provide a correct Python 3 solution for this coding contest problem.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?
Constrain... | instruction | 0 | 104,210 | 5 | 208,420 |
"Correct Solution:
```
A, B, C, K = [int(i) for i in input().split(' ')]
print(min(A, K) - max(K - B - A, 0))
``` | output | 1 | 104,210 | 5 | 208,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible su... | instruction | 0 | 104,211 | 5 | 208,422 |
Yes | output | 1 | 104,211 | 5 | 208,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible su... | instruction | 0 | 104,212 | 5 | 208,424 |
Yes | output | 1 | 104,212 | 5 | 208,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible su... | instruction | 0 | 104,213 | 5 | 208,426 |
Yes | output | 1 | 104,213 | 5 | 208,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible su... | instruction | 0 | 104,214 | 5 | 208,428 |
Yes | output | 1 | 104,214 | 5 | 208,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible su... | instruction | 0 | 104,215 | 5 | 208,430 |
No | output | 1 | 104,215 | 5 | 208,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible su... | instruction | 0 | 104,216 | 5 | 208,432 |
No | output | 1 | 104,216 | 5 | 208,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible su... | instruction | 0 | 104,217 | 5 | 208,434 |
No | output | 1 | 104,217 | 5 | 208,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.
We will pick up K among these cards. What is the maximum possible su... | instruction | 0 | 104,218 | 5 | 208,436 |
No | output | 1 | 104,218 | 5 | 208,437 |
Provide a correct Python 3 solution for this coding contest problem.
We call a 4-digit integer with three or more consecutive same digits, such as 1118, good.
You are given a 4-digit integer N. Answer the question: Is N good?
Constraints
* 1000 ≤ N ≤ 9999
* N is an integer.
Input
Input is given from Standard Inpu... | instruction | 0 | 104,277 | 5 | 208,554 |
"Correct Solution:
```
N = input()
print("Yes" if len(set(N[0:3])) == 1 or len(set(N[1:4]))==1 else "No")
``` | output | 1 | 104,277 | 5 | 208,555 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.