input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
from collections import deque
# 整数の入力
N = int(eval(input()))
s = 0
while N//10 != 0 or N%10 !=0:
s += N%10
N //= 10
if s % 9 == 0:
print("Yes")
else:
print("No") | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
from collections import deque
# 整数の入力
N = int(eval(input()))
# s = 0
# while N//10 != 0 or N%10 !=0:
# s += N%10
# N //= 10
if N % 9 == 0:
print("Yes")
else:
print("No") | p02577 |
n = int(eval(input()))
print(('YNeos'[n%9>0::2])) | print(("YNeos"[int(eval(input()))%9>0::2])) | p02577 |
# Python profram to check if n is a multiple of 3
# Function to check if n is a multiple of 3
def isMultipleOf3(n):
odd_count = 0
even_count = 0
# Make no positive if + n is multiple of 3
# then is -n. We are doing this to avoid
# stack overflow in recursion
if(n < 0): ... | n=int(eval(input()))
if(n%9==0):
print("Yes")
else:
print("No") | p02577 |
def judge(n):
digits = []
while n != 0:
r = n % 10
digits.append(r)
n = n // 10
return digits
def main(n):
sum = 0
for i in judge(n):
sum += i
if sum % 9 == 0:
print("Yes")
else:
print("No")
if __name__=='__main__':
N = int(eval... | N = int(eval(input()))
if N % 9 == 0:
print("Yes")
else:
print("No") | p02577 |
n = int(eval(input()))
sum = 0
for i in range(len(str(n))):
sum += (n % 10)
n //= 10
if sum % 9 == 0:
print("Yes")
else:
print("No") | n = int(eval(input()))
if n % 9 == 0:
print("Yes")
else:
print("No") | p02577 |
n=int(eval(input()))
print(('YNeos'[(n%9!=0)::2]))
| print(('YNeos'[int(eval(input()))%9!=0::2]))
| p02577 |
N = int(eval(input()))
sum = 0
while N >= 1 :
sum += N % 10
N = N // 10
if(sum > 100) :
sum = sum % 9
if(sum % 9 == 0) :
print("Yes")
else :
print("No")
| N = int(eval(input()))
if N % 9 == 0 :
print("Yes")
else :
print("No")
| p02577 |
def main():
z = eval(input())
x = int(z)
sum = 0
while x > 0:
y = x % 10
sum = sum + y
x = x // 10
if sum%9==0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| def main():
z = eval(input())
x = int(z)
if x%9==0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | p02577 |
n=int(eval(input()))
print(('No' if n % 9 else 'Yes'))
| n=int(eval(input()))
print(('No' if n % 3 else 'Yes'))
| p02577 |
#!/usr/bin/env python3
n = str(eval(input()))
ans = 0
count = 1
for i in reversed(n):
ans += count*int(i)
ans = ans % 9
count *= 10
if ans == 0:
print("Yes")
else:
print("No")
| #!/usr/bin/env python3
n = str(eval(input()))
ans = 0
count = 1
for i in reversed(n):
ans += int(i)
ans = ans % 9
count *= 10
if ans == 0:
print("Yes")
else:
print("No")
| p02577 |
import math
N = int(eval(input()))
if N == 0:
N = 9
logN = math.log10(N)
keta = int(logN)
sum = 0
for i in range(keta,-1,-1):
tem =int(N/10**i)
sum += tem
N = N - tem*10**i
if sum % 9 == 0:
print("Yes")
else:
print("No")
| N = int(eval(input()))
if N % 9 == 0:
print("Yes")
else:
print("No") | p02577 |
import sys
cin = sys.stdin.readline
n = list(cin())
ans = 0
n.pop(-1)
for i in n:
ans += int(i)
if ans % 9 == 0:
print('Yes')
else:
print("No") | import sys
cin = sys.stdin.readline
n = cin()
total = 0
for i in range(10):
total += n.count(str(i)) * i
print(("Yes" if total%9 == 0 else "No")) | p02577 |
n = int(eval(input()))
def digitSum(n):
# 数値を文字列に変換
s = str(n)
# １文字ずつ数値化し配列にする。
array = list(map(int, s))
# 合計値を返す
return sum(array)
if digitSum(n)%9 == 0:
print("Yes")
else:
print("No") | n=int(eval(input()))
print(("Yes" if n%9==0 else "No")) | p02577 |
i = int(eval(input()))
list = []
while i > 0:
list.append(i%10)
i //= 10
list.reverse()
SUM = sum(list)
if SUM % 9 == 0:
print('Yes')
else:
print('No') | n = int(eval(input()))
if n % 9 == 0:
print('Yes')
else:
print('No') | p02577 |
N=int(eval(input()))
A=[]
while N>0:
A.append(N%10)
N//=10
a=(sum(A))
if a%9==0:
print('Yes')
else:
print('No') | N=int(eval(input()))
L=[int(x) for x in list(str(N))]
a=sum(L)
if a%9==0:
print('Yes')
else:
print('No') | p02577 |
n = int(eval(input()))
def digits_of(n):
digits = []
while n != 0:
r = n % 10
digits.append(r)
n = n // 10
return digits
def is_multiple_of_9(n):
sum = 0
for i in digits_of(n):
sum += i
return sum % 9 == 0
if is_multiple_of_9(n):
... | n = int(eval(input()))
def digitSum(n):
# 数値を文字列に変換
s = str(n)
# １文字ずつ数値化し配列にする。
array = list(map(int, s))
# 合計値を返す
return sum(array)
resu = digitSum(n) % 9
if resu == 0:
print("Yes")
else:
print("No")
| p02577 |
N = int(eval(input()))
sum=0
while N!=0:
sum=(sum+N%10)%9
N//=10
if sum%9==0:
print("Yes")
else:
print("No")
| N=list(str(eval(input())))
sum=0
for i in range(len(N)):
sum=(sum+int(N[i]))%9
if sum%9==0:
print("Yes")
else:
print("No")
| p02577 |
def digits (n):
digits = []
while n != 0:
r = n % 10
digits.append(r)
n = n // 10
return digits
def check (n):
sum = 0
for i in digits (n):
sum += i
return sum % 9 == 0
n = int(eval(input()))
result = check(n)
if result == True:
result = ... | n = int(eval(input()))
result = n % 9
if result == 0:
result = "Yes"
else:
result = "No"
print(result) | p02577 |
N = int(eval(input()))
s = 0
while N != 0:
s = s + N % 10
N = N // 10
if s % 9 == 0:
print("Yes")
else:
print("No")
| N = int(eval(input()))
s = 0
s = sum(list(map(int, str(N))))
if s % 9 == 0:
print("Yes")
else:
print("No") | p02577 |
N = int(eval(input()))
sum = 0
while(N > 0):
sum += N%10
sum %= 9
N //= 10
if(sum==0):
print("Yes")
else:
print("No")
| N = int(eval(input()))
result = sum(list(map(int, str(N))))
if(result%9==0):
print("Yes")
else:
print("No")
| p02577 |
n = int(eval(input()))
sum = 0
while(n >= 1):
sum += n % 10
n //= 10
if(sum % 9 == 0):
print("Yes")
else:
print("No") | n = int(eval(input()))
# sum = 0
# while(n >= 1):
# sum += n % 10
# n //= 10
if(n % 9 == 0):
print("Yes")
else:
print("No") | p02577 |
n = int(eval(input()))
def digit_sum(n):
# 各桁の和を求める
# 計算量: O(logN)
ans = 0
while n > 0:
ans += n % 10
n //= 10
return ans
if digit_sum(n)%9 ==0:
print('Yes')
else:
print('No') | n = int(eval(input()))
if n%9 ==0:
print('Yes')
else:
print('No') | p02577 |
n = int(eval(input()))
ans = 0
cnt = 0
while n>0:
ans += n%10
n //= 10
if ans%9 == 0:
print("Yes")
else:
print("No") | n = str(eval(input()))
ans = 0
for i in range(len(n)):
ans += int(n[i])
if ans%9 == 0:
print("Yes")
else:
print("No") | p02577 |
def findSumOfDigits(n):
sum = 0
while (n > 0):
sum += n % 10
n //= 10
return sum
n = int(eval(input()))
total = findSumOfDigits(n)
if total % 9 == 0:
print("Yes")
else:
print("No") | n = int(eval(input()))
if n % 9 == 0:
print("Yes")
else:
print("No") | p02577 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
def main():
N = int(eval(input()))
def calcSumOfDigit(x,acc=0):
if x == 0:
return acc
else:
return calcSumOfDigit(x//10,acc+x%10)
def judge(x):
return x % 9 == 0
print(("Yes" if... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
def main():
N = int(eval(input()))
def calcSumOfDigit(x):
str_x = str(x)
acc = 0
for s in str_x:
acc += int(s)
acc %= 9
return acc
print(("Yes" if calcSumOfDigit(N)==0... | p02577 |
N = int(eval(input()))
a = 0
while N > 0:
a += N % 10
N //= 10
if a % 9 == 0:
print("Yes")
else:
print("No")
| if int(eval(input())) % 9 == 0:
print("Yes")
else:
print("No") | p02577 |
n = int(eval(input()))
if(n % 9 == 0):
print("Yes")
else:
print("No")
| n = int(eval(input()))
print(("Yes" if n % 9 == 0 else "No"))
| p02577 |
def digits_of(n):
digits = []
while n != 0:
r = n % 10
digits.append(r)
n = n // 10
return digits
def is_multiple_of_9 (n):
sum = 0
for i in digits_of (n):
sum += i
if sum % 9 == 0:
print("Yes")
else:
print("No")
def main... | def main():
n = int(eval(input()))
if n == 0:
print("Yes")
elif n % 9 == 0:
print("Yes")
else:
print("No")
main() | p02577 |
print("YNeos"[int(eval(input()))%9!=0::2]) | print("YNeos"[int(eval(input()))%9>0::2]) | p02577 |
N = int(eval(input()))
sum_N = 0
while N >= 10:
sum_N += N % 10
N = N //10
if (sum_N+N) % 9 == 0:
print('Yes')
else:
print('No')
| N = int(eval(input()))
if N%9 ==0:
print('Yes')
else:
print('No')
| p02577 |
n=int(eval(input()))
sum=0
for i in range(len(str(n))):
sum+=int(list(str(n))[i])
if sum%9==0:
print('Yes')
else:
print('No') | n=int(eval(input()))
sum=0
s=list(str(n))
for i in range(len(str(n))):
sum+=int(s[i])
if sum%9==0:
print('Yes')
else:
print('No') | p02577 |
print("Yes") if int(input())%9 == 0 else print("No")
| N = input()
ans = 0
for i in range(len(N)):
ans += int(N[i])
print("Yes") if ans%9 == 0 else print("No")
| p02577 |
import sys
from math import sqrt, gcd, ceil, log, floor
from bisect import bisect, bisect_left
from collections import defaultdict, Counter, deque
from heapq import heapify, heappush, heappop
input = sys.stdin.readline
read = lambda: list(map(int, input().strip().split()))
MOD = 10**9 + 7
def main():
# ... | import sys
from math import sqrt, gcd, ceil, log, floor
from bisect import bisect, bisect_left
from collections import defaultdict, Counter, deque
from heapq import heapify, heappush, heappop
input = sys.stdin.readline
read = lambda: list(map(int, input().strip().split()))
MOD = 10**9 + 7
def main():
# ... | p02577 |
'''
Problem Link - https://atcoder.jp/contests/abc176/tasks/abc176_b
'''
from sys import stdin,stdout
from math import *
from collections import *
mod = 1000000007
def gcd(a,b):
while b:
a,b = b,a%b
return a
def lcm(a,b): return (a*b) // gcd(a,b)
def set_bits(X):
c = 0
while X:
X &= (X-1)... | '''
Problem Link - https://atcoder.jp/contests/abc176/tasks/abc176_b
'''
from sys import stdin,stdout
from math import *
from collections import *
mod = 1000000007
def gcd(a,b):
while b:
a,b = b,a%b
return a
def lcm(a,b): return (a*b) // gcd(a,b)
def set_bits(X):
c = 0
while X:
X &= (X-1)... | p02577 |
n = int(eval(input()))
s = 0
for i in range(len(str(n))):
s += n % 10
n //= 10
s %= 9
print(('Yes' if s == 0 else 'No'))
| n = int(eval(input()))
print(('Yes' if n % 9 == 0 else 'No')) | p02577 |
import math
n = int(eval(input()))
list1 = []
if n == 0:
print("Yes")
else:
for i in range(int(math.log10(n))+1):
num = n%10
n = n//10
list1.append(num)
if sum(list1)%9 == 0:
print("Yes")
else:
print("No") | n = int(eval(input()))
a = sum(list(map(int, str(n))))
if a%9 == 0:
print("Yes")
else:
print("No") | p02577 |
N=int(eval(input()))
sum=0
while N>=1:
sum+=N%10
N=N//10
sum=sum%9
if sum == 0:
print('Yes')
else:
print('No') | N=int(eval(input()))
if N%9 == 0:
print("Yes")
else:
print("No") | p02577 |
n = int(eval(input()))
s = 0
while n:
d = n%10
n = n//10
s += d
if s%9 == 0:
print("Yes")
else:
print("No")
#a = list(map(int,input().split()))
#n,k,t = map(int,input().split())
| n = int(eval(input()))
if n%9 == 0:
print("Yes")
else:
print("No") | p02577 |
n=int(eval(input()))
a=0
for i in range(len(str(n))):
a+=int(str(n)[i])
if a%9==0:
print("Yes")
else:
print("No") | n=int(eval(input()))
if n%9==0:
print("Yes")
else:
print("No")
| p02577 |
#from functools import lru_cache
import sys
def vfunc(f): return lambda *lst, **kwargs: list(map(lambda *x:f(*x,**kwargs),*lst))
def reader():return vfunc(lambda l:l.split())(sys.stdin.readlines())
n=int(reader()[0][0])
a=[]
for i in range(200001):
a.append(n%10)
n//=10
print(('Yes' if sum(a)%9==0 ... | #from functools import lru_cache
import sys
def vfunc(f): return lambda *lst, **kwargs: list(map(lambda *x:f(*x,**kwargs),*lst))
def reader():return vfunc(lambda l:l.split())(sys.stdin.readlines())
n=reader()[0][0]
i=vfunc(lambda n:int(n))(n)
print(('Yes' if sum(i)%9==0 else 'No')) | p02577 |
n = int(eval(input()))
ans = 0
while n > 0:
ans += n % 10
n //= 10
if ans % 9 == 0:
print('Yes')
else:
print('No') |
n = int(eval(input()))
ans = 0
l = [int(x) for x in list(str(n))]
ans = sum(l)
if ans % 9 == 0:
print('Yes')
else:
print('No') | p02577 |
n = int(eval(input()))
result = 0
while n != 0:
q = n // 10
mod = n % 10
result += mod
n = q
if (result % 9) == 0:
print('Yes')
else:
print('No')
| n = str(eval(input()))
count = 0
for v in list(n):
count += int(v)
if (count % 9) == 0:
print('Yes')
else:
print('No')
| p02577 |
N = str(eval(input()))
a = list(N)
result = 0
for x in a:
x = int(x)
result += x
if result%9 == 0:
print("Yes")
else:
print("No") | N = str(eval(input()))
a = sum([int(n) for n in list(N)])
if a%9 == 0:
print("Yes")
else:
print("No")
| p02577 |
N=int(eval(input()))
listN=[]
i=0
k=0
while N!=0:
k+=N%10
N=N//10
if k%9==0:
print ('Yes')
else:
print ('No') | N=int(eval(input()))
if N%9==0:
print ('Yes')
else:
print ('No') | p02577 |
import sys
readline = sys.stdin.buffer.readline
N = int(readline())
total = 0
while N >= 1:
total += N % 10
N //= 10
total %= 9
ans = 'Yes' if total == 0 else 'No'
print(ans) | import sys
readline = sys.stdin.buffer.readline
N = int(readline())
ans = 'Yes' if N%9 == 0 else 'No'
print(ans) | p02577 |
n=int(eval(input()))
count_=0
while(n!=0):
count_+=n%10
n=n//10
if count_%9==0:
print("Yes")
else:
print("No")
| n=int(eval(input()))
if n%9==0:
print("Yes")
else:
print("No") | p02577 |
N=int(eval(input()));tt=0
while(N):
tt+=(N%10);N//=10
print(("No" if tt%9 else "Yes")) | print(("No"if int(eval(input()))%9 else "Yes")) | p02577 |
if int(eval(input())) % 9 == 0:
print("Yes")
else:
print("No") | if (int(eval(input())))%9 == 0:
print("Yes")
else:
print("No")
| p02577 |
N = int(eval(input()))
S = 0
for i in range(2*10**5):
digit = N%10
S += digit
N = N//10
T = 0
while S > 0:
digit = S%10
T += digit
S = S//10
if T%9 == 0:
print('Yes')
else:
print('No')
| N = int(eval(input()))
if N%9 ==0:
print('Yes')
else:
print('No') | p02577 |
a=int(eval(input()))
ans=0
while a//10!=0:
ans+=a%10
a=a//10
ans+=a
if ans%9==0:
print("Yes")
else:
print("No") | a=int(eval(input()))
if a%9==0:
print("Yes")
else:
print("No") | p02577 |
def dsum(n):
wa = 0
while n > 0:
wa += n % 10
n //= 10
return wa
n = int(input())
print("Yes") if dsum(n) % 9 == 0 else print("No")
| n = int(input())
print("Yes") if n % 9 == 0 else print("No")
| p02577 |
a=int(eval(input()))
sum=0
while(a>0):
t=a%10
sum=sum+t
a=a//10
if(sum%9==0):
print("Yes")
else:
print("No")
| a=eval(input())
sum=0
for digit in str(a):
sum=sum+int(digit)
if(sum%9==0):
print("Yes")
else:
print("No")
| p02577 |
# B
N = int(eval(input()))
solve = []
while N > 0:
solve.append(N % 10)
N //= 10
ans = 0
for i in range(len(solve)):
ans += solve[i]
if ans % 9 == 0:
print('Yes')
if ans % 9 != 0:
print('No') | N = int(eval(input()))
k = N % 9
if k == 0:
print('Yes')
if k != 0:
print('No') | p02577 |
def main():
N = int(eval(input()))
sum = 0
while True:
amari = N % 10
sum += amari
N = N//10
if N == 0:
break
if (sum%9) == 0:
print('Yes')
else:
print('No')
main()
| def main():
N = int(eval(input()))
if (N%9) == 0:
print('Yes')
else:
print('No')
main()
| p02577 |
n = int(eval(input()))
cnt = 0
while n != 0:
cnt += n % 10
cnt %= 9
n //= 10
if cnt == 0:
print("Yes")
else:
print("No") | n = int(eval(input()))
cnt = n % 9
if cnt == 0:
print("Yes")
else:
print("No") | p02577 |
print(("Yes"if int(eval(input()))%9==0else"No")) | a = int(eval(input()))
if a % 9:
print("No")
else:
print("Yes") | p02577 |
a = int(eval(input()))
if a % 9:
print("No")
else:
print("Yes") | print(("No"if int(eval(input()))%9else"Yes")) | p02577 |
n = int(eval(input()))
n_copy = n
digit_sum = 0
while(n_copy != 0):
#print(digit_sum, n_copy%10, n_copy//10)
digit_sum += n_copy%10
n_copy //= 10
#print(digit_sum)
if digit_sum%9 == 0:
print("Yes")
else:
print("No") | num = int(input())
print("Yes") if num%9 == 0 else print("No")
| p02577 |
def main():
N = int(input())
sum = 0
for digit in str(N):
sum += int(digit)
print('Yes') if sum % 9 == 0 else print('No')
if __name__ == '__main__':
main()
| def main():
N = int(input())
print('Yes') if N % 9 == 0 else print('No')
if __name__ == '__main__':
main()
| p02577 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(eval(input()))
total = 0
while n:
total += (n % 10)
n //= 10
if total % 9 == 0:
print('Yes')
else:
print('No')
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(eval(input()))
if n % 9 == 0:
print('Yes')
else:
print('No')
| p02577 |
n=int(eval(input()))
s=0
while(n>0):
s=s+n%10;
n=n//10
if(s%9==0):
print("Yes")
else:
print("No") | n=int(eval(input()))
if(n%9==0):
print("Yes")
else:
print("No") | p02577 |
N = int(eval(input()))
summer = 0
while N > 0:
digit = N % 10
summer += digit
N = N // 10
if summer % 9 == 0:
print("Yes")
else:
print("No")
| N = int(eval(input()))
if N % 9 == 0:
print("Yes")
else:
print("No")
| p02577 |
N = int(eval(input()))
if N%9 == 0:
print('Yes')
else:
print('No') | from sys import stdin
test = list(stdin.readline().rstrip())
result=0
for i in test:
result = result + int(i)
if (result % 9) == 0:
print('Yes')
else:
print('No') | p02577 |
N = str(eval(input()))
lists = []
for x in N:
lists.append(int(x))
a = sum(lists)
if a % 9 == 0:
print('Yes')
else:
print('No') | N = str(eval(input()))
lists = [int(x) for x in N]
a = sum(lists)
if a % 9 == 0:
print('Yes')
else:
print('No') | p02577 |
#codinng:utf-8
N = int(eval(input()))
count = 0
while N > 0:
count += (N % 10000000) % 9
N = N // 10000000
if count % 9 == 0:
print("Yes")
else:
print("No") | #codinng:utf-8
N = int(eval(input()))
count = 0
while N > 0:
count += (N % (10 ** 100)) % 9
N = N // (10 ** 100)
if count % 9 == 0:
print("Yes")
else:
print("No") | p02577 |
n = int(eval(input()))
count = 0
while(n>0):
count += n%10
count = count%9
n = n//10
if(count%9 == 0):
print("Yes")
else:
print("No") | n = int(eval(input()))
if(n%9 == 0):
print("Yes")
else:
print("No") | p02577 |
n = int(eval(input()))
def total(n):
total = 0
for i in range(len(str(n))):
total += int(str(n)[i])
if i == len(str(n)):
if len(str(total)) > 10**5:
total(total)
return total
if total(n) %9 == 0:
print("Yes")
else:
print("No") | n = int(eval(input()))
total = 0
for i in str(n):
total += int(i)
if total %9 == 0:
print("Yes")
else:
print("No") | p02577 |
print((("No","Yes")[int(eval(input())) % 9 == 0])) | import sys
readline=sys.stdin.readline
N=readline().rstrip()
sums = 0
for i in range(len(N)):
sums += int(N[i])
sums %= 9
if sums % 9 == 0:
print("Yes")
else:
print("No")
| p02577 |
N = int( eval(input()) )
if N % 9 == 0 :
print('Yes')
if N % 9 != 0 :
print('No')
| n = eval(input( ))
result = sum(list(map(int, str(n))))
if result % 9 == 0 :
print('Yes')
else :
print('No')
| p02577 |
n = int(eval(input()))
sum1 = 0
for i in range(len(str(n))):
sum1 += int(str(n)[i])
if sum1 % 9 == 0:
print('Yes')
else:
print('No') | n = int(eval(input()))
s = str(n)
array = list(map(int, s))
if sum(array) % 9 == 0:
print('Yes')
else:
print('No') | p02577 |
import sys
class Unionfindtree:
def __init__(self, number):
self.par = [i for i in range(number)]
self.rank = [0] * (number)
def find(self, x): # 親を探す
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
ret... | import sys
class Unionfindtree:
def __init__(self, number):
self.par = [i for i in range(number)]
self.rank = [0] * (number)
def find(self, x): # 親を探す
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
ret... | p03921 |
import sys
sys.setrecursionlimit(10**7)
N, M = list(map(int, input().split()))
P = [[] for i in range(N)]
L = [[] for i in range(M)]
for i in range(N):
I = list(map(int, input().split()))
for l in I[1:]:
P[i].append(l-1)
L[l-1].append(i)
P_visited = [0] * N
L_visited = [0] * M
... | import sys
sys.setrecursionlimit(10 ** 9)
N, M = list(map(int, input().split()))
P_to_L = [[] for i in range(N)] # 人から言語へのグラフ
L_to_P = [[] for i in range(M)] # 言語から人へのグラフ
for i in range(N):
info = list(map(int, input().split()))
for l in info[1:]:
P_to_L[i].append(l - 1)
L_to_P[l ... | p03921 |
import sys
sys.setrecursionlimit(100000)
n, m = list(map(int, input().split()))
people = []
lang = [[] for _ in range(m)]
for i in range(n):
kl = list(map(int, input().split()))
k = kl[0]
people.append(kl[1:])
for l in kl[1:]:
lang[l-1].append(i)
visited = [False for _ in range(n)]
def... | import sys
sys.setrecursionlimit(10**9)
def dfs(v):
used[v] = True
for _v in adjl[v]:
if not used[_v]:
dfs(_v)
n, m = list(map(int, input().split()))
adjl = [[] for v in range(n + m)]
for i in range(n):
kl = list(map(int, input().split()))
k = kl[0]
llist = kl[1:]... | p03921 |
N,M=list(map(int,input().split()))
from collections import defaultdict
branch=defaultdict(set)
lang=defaultdict(set)
inp=[]
for i in range(N):
X=list(map(int,input().split()))
for k in range(X[0]):
lang[X[k+1]]|={i}
inp.append(X[1:])
for i in range(N):
for l in inp[i]:
branch... | N,M=list(map(int,input().split()))
from collections import defaultdict
root=[-1]*(N+M)
def find(i):
global root
if root[i]>=0:
root[i]=find(root[i])
return root[i]
return i
def make(a,b):
global root
ra=find(a)
rb=find(b)
if ra==rb:
return
elif root... | p03921 |
import sys
sys.setrecursionlimit(10**6)
n,m=list(map(int,input().split()))
a=[[]for i in range(n+m)]
for i in range(n):
s=list(map(int,input().split()))
for j in s[1:]:
a[i].append(j)
a[n+j-1].append(i)
t=[False]*n
def g(x):
if not t[x]:
t[x]=True
for i in a[x]:
... | import sys
sys.setrecursionlimit(10**9)
n,m=list(map(int,input().split()))
a=[[]for i in range(n+m)]
for i in range(n):
s=list(map(int,input().split()))
for j in s[1:]:
a[i].append(j+n-1)
a[n+j-1].append(i)
t=[False]*(n+m)
def g(x):
t[x]=True
for i in a[x]:
if no... | p03921 |
import sys
def input():
return sys.stdin.readline()[:-1]
N, M = list(map(int,input().split()))
H = []
L = [[] for k in range(M+1)]
for k in range(N):
P = list(map(int,input().split()))[1:]
H.append(P)
for e in P:
L[e].append(k+1)
G = [0 for k in range(N+1)]
G[1] = 1
Q = [H[0]]
... | N, M = list(map(int,input().split()))
H = []
L = [[] for k in range(M+1)]
for k in range(N):
P = list(map(int,input().split()))[1:]
H.append(P)
for e in P:
L[e].append(k+1)
G = [0 for k in range(N+1)]
G[1] = 1
Q = [H[0]]
while len(Q) > 0:
ima = Q.pop()
for tsugi in ima:
... | p03921 |
n, m = list(map(int, input().split()))
V = n + m
par = [i for i in range(0, V)]
sizes = [1] * V
def find(x):
if x == par[x]:
return x
par[x] = find(par[x])
return par[x]
def unite(x, y):
x = find(x)
y = find(y)
if x == y:
return
if sizes[x] < sizes[y]:
... | n, m = list(map(int, input().split()))
V = n + m
par = [i for i in range(0, V)]
sizes = [1] * V
def find(x):
if x == par[x]:
return x
par[x] = find(par[x])
return par[x]
def unite(x, y):
x = find(x)
y = find(y)
if x == y:
return
if sizes[x] < sizes[y]:
... | p03921 |
n, m = list(map(int, input().split()))
V = n + m
par = [i for i in range(0, V)]
sizes = [1] * V
def find(x):
if x == par[x]:
return x
par[x] = find(par[x])
return par[x]
def unite(x, y):
x = find(x)
y = find(y)
if x == y:
return
if sizes[x] < sizes[y]:
... | n, m = list(map(int, input().split()))
V = n + m
par = [i for i in range(V)]
sizes = [1] * V
def f(x):
if x == par[x]:
return x
par[x] = f(par[x])
return par[x]
def unite(x, y):
x, y = f(x), f(y)
if x == y:
return
if sizes[x] < sizes[y]:
x, y = y, x
... | p03921 |
q,w,e=input,range,int
n, m = list(map(e,q().split()))
V = n + m
par = [i for i in w(V)]
sizes = [1] * V
def f(x):
if x == par[x]:
return x
par[x] = f(par[x])
return par[x]
def u(x, y):
x, y = f(x), f(y)
if x == y:
return
if sizes[x] < sizes[y]:
x,... | q,w,e=input,range,int
n,m=list(map(e,q().split()))
V=n+m
par,sizes=[i for i in w(V)],[1]*V
def f(x):
if x == par[x]:
return x
par[x] = f(par[x])
return par[x]
def u(x, y):
x, y = f(x), f(y)
if x == y:
return
if sizes[x] < sizes[y]:
x, y = y, x
p... | p03921 |
def main():
N, K = (int(i) for i in input().split())
WD = [[int(i) for i in input().split()] for j in range(N)]
W = [w[0] for w in WD]
D = [d[1] for d in WD]
def is_ok(X):
need = 0
for i in range(N):
need += (X - W[i]) // D[i] + 1
if need >= K:
... | def main():
import sys
input = sys.stdin.buffer.readline
N, K = (int(i) for i in input().split())
WD = [[int(i) for i in input().split()] for j in range(N)]
ma_w = 0
ma_d = 0
for w, d in WD:
if ma_w < w:
ma_w = w
if ma_d < d:
ma_d = d
... | p03507 |
n, k = [int(x) for x in input().split()]
flowers = []
for _ in range(n):
tmp = [int(x) for x in input().split()]
flowers.append(tmp)
def aaa(p, l):
count = 0
for x in l:
w, d = x[0], x[1]
if p - w < 0:
pass
else:
count += (p - w) // d + 1... | n, k = [int(x) for x in input().split()]
flowers = []
for _ in range(n):
tmp = [int(x) for x in input().split()]
flowers.append(tmp)
def aaa(p, l):
count = 0
for x in l:
w, d = x[0], x[1]
if p - w < 0:
pass
else:
count += (p - w) // d + 1... | p03507 |
n , k = list(map(int, input().strip().split(' ')))
w = [0] * n
d = [0] * n
p = None
for i in range(n):
w[i], d[i] = list(map(int, input().strip().split(' ')))
p1 = w[i] + (k - 1) * d[i]
if p == None or p1 < p:
p = p1
p1 = 1
p2 = p
def getk(p):
kk = 0
for i in range(n):
... | n , k = list(map(int, input().strip().split(' ')))
w = [0] * n
d = [0] * n
p = None
for i in range(n):
w[i], d[i] = list(map(int, input().strip().split(' ')))
p1 = w[i] + (k - 1) * d[i]
if p == None or p1 < p:
p = p1
p1 = 1
p2 = p
def getk(p):
kk = 0
for i in range(n):
... | p03507 |
N,K=list(map(int,input().split()))
L=[]
for i in range(N):
s,d=list(map(int,input().split()))
L.append([s,d])
High=10**30
Low =0
for i in range(300):
Mid=(High + Low)/2
cnt=0
for j in range(N):
cnt+=max(0,1+(Mid - L[j][0])//L[j][1])
if cnt>=K:
High = Mid
elif ... | import sys
input=sys.stdin.readline
N,K=list(map(int,input().split()))
L=[]
for i in range(N):
s,d=list(map(int,input().split()))
L.append([s,d])
High=10**20
Low =0
while High - Low >1:
Mid=(High + Low)//2
cnt=0
for j in range(N):
if Mid-L[j][0]<0:
continue
... | p03507 |
def examA():
N = I()
T = LI()
A = LI()
S = [-1]*N
S[0] = T[0]; S[-1]=A[-1]
ans = 1
for i in range(1,N):
if T[i]==T[i-1]:
continue
S[i] = T[i]
flag = -1
for i in range(N):
if S[i]==A[i]:
flag = i
break
if ... | def examA():
N = I()
T = LI()
A = LI()
S = [-1]*N
S[0] = T[0]; S[-1]=A[-1]
ans = 1
for i in range(1,N):
if T[i]==T[i-1]:
continue
S[i] = T[i]
flag = -1
for i in range(N):
if S[i]==A[i]:
flag = i
break
if ... | p03507 |
def main():
n,k,*t=list(map(int,open(0).read().split()))
*z,=list(zip(*[iter(t)]*2))
ok=10**19
ng=-1
while ok-ng>1:
mid=(ok+ng)//2
if sum(max(0,0--(mid-w)//d)for w,d in z)<k:ng=mid
else:ok=mid
print(ng)
main() | def main():
n,k,*t=list(map(int,open(0).read().split()))
*z,=list(zip(*[iter(t)]*2))
ok=10**19
ng=-1
while ok-ng>1:
mid=(ok+ng)//2
if sum((mid-w)//d+1for w,d in z if w<=mid)<k:ng=mid
else:ok=mid
print(ok)
main() | p03507 |
N = eval(input())
H = list(map(int, input().split() ) )
step_max = 0
for i in H:
step = 0
for k in range(len(H)-1):
if H[k] >= H[k+1]:
step += 1
else:
break
if step > step_max:
step_max = step
del H[0]
print(step_max) | N = eval(input())
H = list(map(int, input().split() ) )
count = 0
step = [0]*len(H)
for i in range(len(H)-1):
if H[i]>=H[i+1]:
count += 1
else:
count = 0
step[i+1] = count
print((max(step))) | p02923 |
N = eval(input())
H = list(map(int, input().split() ) )
count = 0
step = [0]*len(H)
for i in range(len(H)-1):
if H[i]>=H[i+1]:
count += 1
else:
count = 0
step[i+1] = count
print((max(step))) | N = int(eval(input()))
H = list( map(int, input().split(" ")) )
count = 0
count_max = 0
for i in range(0, len(H)-1):
if H[i] >= H[i+1]:
count += 1
else:
if count_max < count:
count_max = count
count = 0
if count_max < count:
count_max = count
print(count_... | p02923 |
n = int (eval(input()))
h = list(map(int,input().split()))
count_list = []
count=0
for i in range(n):
if i == n-1:
break
if h[i] >= h[i+1]:
if count !=0:
count +=1
else:
count = 1
else:
count = 0
count_list.append(count)
if not count_list:
count_l... | n = int(eval(input()))
d= list(map(int,input().split()))
count=0
h=0
for i in range(n-1):
if d[i]>=d[i+1]:
count+=1
else:
count=0
if h<count:
h=count
print(h) | p02923 |
import sys
n = int(eval(input()))
a = []
b = input().split(" ")
for i in range(n):
a.append(int(b[i]))
if n == 1:
print((0))
sys.exit()
mx = 0
cnt = 0
for i in range(n-2, -1, -1):
if a[i] >= a[i+1]:
cnt += 1
mx = max(mx, cnt)
else:
cnt = 0
print(mx)
| n=int(eval(input()))
h=list(map(int,input().split()))
count=0
count_list=[0]
for i in range(n-1):
if h[i]>=h[i+1]:
count+=1
count_list.append(count)
else :
count=0
print((max(count_list))) | p02923 |
N = int(eval(input()))
H = list(map(int, input().split()))
sorted_H = sorted(H)
sorted_H.reverse()
ans = []
for h in sorted_H:
cnt = 0
flag = True
now = H.index(h)
while flag and (now + 1) < len(H):
if H[now] < H[now + 1]:
flag = False
else:
now += 1
cnt += 1
ans.appen... | N = int(eval(input()))
H = list(map(int, input().split()))
ans = []
cnt = 0
for i in range(N - 1):
if H[i] < H[i + 1]:
ans.append(cnt)
cnt = 0
else:
cnt += 1
ans.append(cnt)
print((max(ans))) | p02923 |
N = int(eval(input()))
H = list(map(int, input().split()))
movable = [0]*N
i = 0
while i < N-1-max(movable):
j = i
while j < N-1 and H[j] >= H[j+1]:
movable[i] += 1
j += 1
i = i + movable[i] + 1
print((max(movable))) | N = int(eval(input()))
H = list(map(int, input().split()))
movable = [0]*N
i = 0
while i < N-1:
j = i
while j < N-1 and H[j] >= H[j+1]:
movable[i] += 1
j += 1
i = i + movable[i] + 1
print((max(movable))) | p02923 |
N=int(eval(input()))
H=list(map(int, input().split()))
Max=0
count=0
for i in range(N):
count=0
for j in range(N - i - 1):
if H[i + j] >= H[i + j + 1]:
count+=1
else:
count=0
if Max < count:
Max = count
print(Max) | N=int(eval(input()))
H=list(map(int, input().split()))
Max=0
count=0
index=0
for i in range(1,N):
if H[index] >= H[i]:
count+=1
index+=1
else:
count=0;
index = i
if Max < count:
Max = count
print(Max) | p02923 |
N=int(eval(input()))
H = list(map(int, input().split()))
I=[H[i]-H[i+1] for i in range(N-1)]
K=[]
for j in range(N-1):
if I[j]>=0:
K.append("a")
else:
K.append("b")
S = ''.join(K)
i=0
while "a"*(i+1) in S:
i+=1
print(i) | N=int(eval(input()))
H = list(map(int, input().split()))
I=[H[i]-H[i+1] for i in range(N-1)]
a=0
n=0
j=0
while j<N-1:
if I[j]>=0:
j+=1
n+=1
else:
j+=1
a=max(n,a)
n=0
a=max(n,a)
print(a) | p02923 |
N, *H = list(map(int, open(0).read().split()))
diff = [H[i + 1] - H[i] <= 0 for i in range(N - 1)]
ans = 0
tmp = 0
for v in diff:
if v:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
print((max(ans, tmp)))
|
N = int(eval(input()))
X = list(map(int, input().split()))
ans = 0
cnt = 0
cur = X[0]
for i in range(1, N):
if cur < X[i]:
ans = max(ans, cnt)
cnt = 0
else:
cnt += 1
cur = X[i]
print((max(ans, cnt)))
| p02923 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
hl=list(map(int,input().split()))
cntmax=0
#スタート位置
for i in range(n):
#右に移動
cnt = 0
for j in range(i,n-1):
if hl[j] >= hl[j+1]:
cnt+=1
... | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
l=list(map(int,input().split()))
cnt=0
cntmax=0
for i in range(n-1):
if l[i]>=l[i+1]:
cnt+=1
cntmax=max(cnt,cntmax)
else:
cntmax=max(cnt,c... | p02923 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
l=list(map(int,input().split()))
cnt=0
cntmax=0
for i in range(n-1):
if l[i]>=l[i+1]:
cnt+=1
cntmax=max(cnt,cntmax)
else:
cntmax=max(cnt,c... | def resolve():
n=int(eval(input()))
l=list(map(int,input().split()))
# 「次のマス以上」が今何回続いているか
cnt=0
# 「次のマス以上」が最高で何回続いたか
cntmax=0
for i in range(n-1):
if l[i]>=l[i+1]:
# 「次のマス以上」だったらcntを増やして、次より大きいが何回続いているかを記録
cnt+=1
if i==n-2:
... | p02923 |
N = int(eval(input()))
H = [int(i) for i in input().split()]
can_move_nums = [0] * N
start = 0
for now in range(N-1):
if H[now+1] <= H[now]:
for j in range(start, now+1):
can_move_nums[j] += 1
else:
start = now
print((max(can_move_nums))) | N = int(eval(input()))
H = [int(i) for i in input().split()]
H = H[::-1]
can_move_nums = [0] * N
start = 0
for i in range(1, N):
if H[i] >= H[i-1]:
can_move_nums[i] = can_move_nums[i-1]+1
print((max(can_move_nums))) | p02923 |
n=int(eval(input()))
h=list(map(int,input().split()))
ans=0
right_is_max=True
for i in range(n-1,-1,-1):
if right_is_max==True and i!=n-1:
if h[i]<h[i+1]:
right_is_max=False
else:
sec+=1
else:
for j in range(i,n):
if j==i:... | n=int(eval(input()))
h=list(map(int,input().split()))
ans=0
for i in range(n):
if i==0:
rightsec=0
else:
if h[i-1]>=h[i]:
rightsec+=1
else:
ans=(max(rightsec,ans))
rightsec=0
print((max(ans,rightsec))) | p02923 |
n = int(eval(input()))
h = list(map(int,input().split()))
t = 0
result =0
for i in range(n-1):
if h[i] >= h[i+1]:
t += 1
else:
result = max(t,result)
t = 0
result = max(t, result)
print(result) | N = int(eval(input()))
Hlist = list(map(int,input().split()))
n = 0
A = 0
for i in range(N-1):
if Hlist[i] >= Hlist[i+1]:
n += 1
else:
A = max(A, n)
n = 0
A = max(A, n)
print(A) | p02923 |
N = int(eval(input()))
H = list(map(int,input().split()))
def lower(i, H):
cnt = 0
while H[i] >= H[i+1]:
cnt += 1; i += 1;
if i+1 > N-1:
break
return cnt
ans = 0
for i in range(N-1):
tmp = lower(i, H)
ans = max(ans, tmp)
i += tmp
print(ans) | N = int(eval(input()))
H = list(map(int,input().split()))
def lower(i, H):
cnt = 0
while H[i] >= H[i+1]:
cnt += 1; i += 1;
if i+1 > N-1:
break
return cnt
ans, i = 0, 0
while i < N - 1:
tmp = lower(i, H)
ans = max(ans, tmp)
i += tmp+1
print(ans) | p02923 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.