input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
def digitSum(X):
ds = 0
for x in str(X):
ds += int(x)
return ds
ans = N
for i in range(1, N):
dgtSum = digitSum(i) + digitSum(N - i)
if ans > dgtSum:
ans = dgtSum
print(ans)
| def sumDigit(x):
total = 0
while x > 0:
total += x % 10
x = x // 10
return total
N = int(eval(input()))
ans = []
for a in range(1, N):
sum_A = sumDigit(a)
sum_B = sumDigit(N - a)
ans.append(sum_A + sum_B)
print((min(ans))) | p03331 |
def digit_sum(x):
a = list(range(1, x))
min_n = x
for i in a:
b = x - i
p = sum(list(map(int, list(str(i)))))
q = sum(list(map(int, list(str(b)))))
if min_n > (p+q):
min_n = p+q
if a == b:
break
return min_n
N = int(eval(input()... | N = int(eval(input()))
p = N
sums = 0
if N == 10 or N == 100 or N == 1000 or N == 10000 or N == 100000:
print((10))
else:
while p >= 1:
sums += p%10
p //= 10
print(sums) | p03331 |
n = int(eval(input()))
def find(a):
global total
total = 0
while a > 0:
total += a % 10
a //= 10
return total
ans = float('inf')
for i in range(1,n):
tmp = find(i) + find(n-i)
ans = min(ans, tmp)
print(ans) | def findSumOfDigits(n):
sum = 0
while n > 0:
sum += n % 10
n //= 10
return sum
n = int(eval(input()))
minTotal = float('inf')
for i in range(1,n+1):
if 0 < n - i < n:
a = findSumOfDigits(i)
b = findSumOfDigits(n-i)
if a + b < minTotal:
m... | p03331 |
n=int(eval(input()))
res=100000
for i in range(1,n):
j=n-i
s=0
for c in str(i):
s+=int(c)
for c in str(j):
s+=int(c)
res=min(res,s)
print(res) | n=int(eval(input()))
s=0
while n>0:
s+=n%10
n//=10
if s==1:
print((10))
else:
print(s) | p03331 |
def sumDigits(i):
s = 0
while i > 0:
s += (i % 10)
i = int(i / 10)
return s
N = int(eval(input()))
m = 9*6
for i in range(1, N):
k = N - i
m = min(m, sumDigits(i) + sumDigits(k))
print(m) | def sumDigits(i):
s = 0
while i > 0:
s += (i % 10)
i = int(i / 10)
return s
def main():
N = int(eval(input()))
m2 = 9 * 6
for i in range(1, N + 1):
k = N - i
if k > 0:
m2 = min(m2, sumDigits(i) + sumDigits(k))
print(m2)
main() | p03331 |
def DigitsSum(n):
sum = 0
while (n != 0):
sum += (n % 10)
n = int(n / 10)
return sum
N = int(eval(input()))
min_sum = 10**5
for i in range(1, N):
sum = DigitsSum(i) + DigitsSum(N-i)
if (sum < min_sum):
min_sum = sum
print(min_sum)
| def Digitsum(n):
sum = 0
while(n > 0):
sum += (n % 10)
n = int(n / 10)
return sum
N = int(eval(input()))
n = N
ans = 0
while(True):
if (n % 10 >= 2):
#10のべき乗ではない
ans = Digitsum(N)
break
elif (n % 10 == 1 and n >= 10):
#10のべき乗ではない
... | p03331 |
N = int(eval(input()))
def sumof(N):
sum = 0
while(N>0):
sum += N % 10
N //= 10
return sum
minsum = 9*10
for i in range(1,N//2+1):
minsum = min(minsum,sumof(i) + sumof(N-i))
print(minsum)
| NL = [int(x) for x in str(eval(input()))]
if NL[0] == 1 and sum(NL) == 1:
print((10))
else:
print((sum(NL))) | p03331 |
n=int(eval(input()))
ans=10**6
for i in range(1,n):
a=list(map(int,list(str(i))))
b=list(map(int,list(str(n-i))))
c=sum(a)+sum(b)
ans=min(ans,c)
print(ans) | n=int(eval(input()))
ans=10**6
for i in range(1,n+1):
a=i
b=n-i
if a<=b:
asum=sum(map(int,str(a)))
bsum=sum(map(int,str(b)))
if ans>(asum+bsum):
ans=asum+bsum
print(ans) | p03331 |
N = int(eval(input()))
ans = N+1
for i in range(1,N):
stra = str(i)
strb = str(N-i)
a = ''
b = ''
for j in range(len(stra)):
a += stra[j]+'+'
a = a[:-1]
for j in range(len(strb)):
b += strb[j]+'+'
b = b[:-1]
ans = min(ans,eval(a)+eval(b))
print(ans) | N = int(eval(input()))
ans = N+1
for i in range(1,N//2+1):
stra = str(i)
strb = str(N-i)
a = ''
b = ''
for j in range(len(stra)):
a += stra[j]+'+'
a = a[:-1]
for j in range(len(strb)):
b += strb[j]+'+'
b = b[:-1]
ans = min(ans,eval(a)+eval(b))
print(ans)... | p03331 |
N = int(eval(input()))
def SumDigits(num):
sum = 0
while True:
sum += num % 10
num //= 10
if num == 0:
break
return sum
infinity = float('inf')
min = infinity
for x in range(1, N):
if SumDigits(x) + SumDigits(N - x) < min:
min = SumDigits(x)... | N = int(eval(input()))
def SumDigits(num):
sum = 0
while True:
sum += num % 10
num //= 10
if num == 0:
break
return sum
infinity = float('inf')
min = infinity
for x in range(1, N//2 + 1):
#print('============')
#print(x, N - x)
#print(SumDi... | p03331 |
N=int(eval(input()))
ans=100000000000
for A in range(1,N):
B=N-A
sa=0
sb=0
for i in range(len(str(A))):
sa+=A%10
A=(A-A%10)//10
for j in range(len(str(B))):
sb+=B%10
B=(B-B%10)//10
if sa+sb<ans:
ans=sa+sb
print(ans)
| N=int(eval(input()))
ans=100000000000
for a in range(1,N):
b=N-a
tempa=0
tempb=0
for i in range(len(str(a))):
tempa+=a%10
a=a//10
for j in range(len(str(b))):
tempb+=b%10
b=b//10
if tempa+tempb<ans:
ans=tempa+tempb
print(ans)
| p03331 |
n = int(eval(input()))
ans = float('inf')
for a in range(1, n):
b = n - a
dsum = 0
for i in range(len(str(a))):
x = int(str(a)[i])
dsum += x
for i in range(len(str(b))):
x = int(str(b)[i])
dsum += x
ans = min(ans, dsum)
print(ans) | n = int(eval(input()))
def d_sum(x):
return sum(int(y) for y in str(x))
ans = float('inf')
for a in range(1, n):
b = n - a
dsum = d_sum(a) + d_sum(b)
ans = min(ans, dsum)
print(ans) | p03331 |
def func(x):
if x // 10 == 0:
return x
else:
return x % 10 + func(x // 10)
n = int(eval(input()))
ans = float('inf')
for a in range(1, (n // 2) + 1):
ans = min(ans, func(a) + func(n - a))
print(ans) | def d_sum(x):
res = 0
while x > 0:
res += x % 10
x //= 10
return res
n = int(eval(input()))
ans = float('inf')
for a in range(1, n // 2 + 1):
b = n - a
ans = min(ans, d_sum(a) + d_sum(b))
print(ans) | p03331 |
def d_sum(x):
res = 0
while x > 0:
res += x % 10
x //= 10
return res
n = int(eval(input()))
ans = float('inf')
for a in range(1, n // 2 + 1):
b = n - a
ans = min(ans, d_sum(a) + d_sum(b))
print(ans) | from math import log
n = int(eval(input()))
if log(n, 10) % 1 == 0:
ans = 10
else:
ans = sum(map(int, list(str(n))))
print(ans) | p03331 |
x=int(eval(input()))
count=100000
suma=0
sumb=0
for a in range(1, x):
b = x-a
y = sum(map(int, str(a))) + sum(map(int, str(b)))
if y<count:
count=y
print(count) | x=int(eval(input()))
count=10000
for a in range(1, x):
suma=0
sumb=0
b=x-a
while (a > 0):
suma += a%10
a= a//10
while (b > 0):
sumb += b%10
b=b//10
count = min(count, suma+sumb)
print(count) | p03331 |
N = int(eval(input()))
result = 10 ** 10
for a in range(1, N):
b = N - a
A = 0
while a != 0:
A += a % 10
a = a // 10
B = 0
while b != 0:
B += b % 10
b = b // 10
result = min(result, A + B)
print(result) | def digit_sum(n):
result = 0
while n > 0:
result += n % 10
n = n // 10
return result
N = int(eval(input()))
mi = 1e10
for i in range(1, N):
mi = min(mi, digit_sum(i) + digit_sum(N - i))
print(mi)
| p03331 |
def digit_sum(n):
result = 0
while n > 0:
result += n % 10
n = n // 10
return result
N = int(eval(input()))
mi = 1e10
for i in range(1, N):
mi = min(mi, digit_sum(i) + digit_sum(N - i))
print(mi)
| N = int(eval(input()))
print((10 if N % 10 == 0 else sum(int(s) for s in str(N)))) | p03331 |
N = int(eval(input()))
factor_a = []
factor_b = []
ans = N
for a in range(1, N):
sum_a = sum([int(i) for i in str(a)])
sum_b = sum([int(i) for i in str(N-a)])
if sum_a + sum_b < ans:
ans = sum_a + sum_b
print(ans) | N = int(eval(input()))
ans = N
def simulate(m):
for a in range(1, m):
global ans
sum_a = sum([int(i) for i in str(a)])
sum_b = sum([int(i) for i in str(N-a)])
if sum_a + sum_b < ans:
ans = sum_a + sum_b
if N % 2 == 0:
simulate(N//2+1)
else:
sim... | p03331 |
N = int(eval(input()))
cmin = 10**5
for x in range(1,N):
y = str(N-x)
x = str(x)
cnt = 0
for i in range(len(x)):
cnt += int(x[i])
for j in range(len(y)):
cnt += int(y[j])
cmin = min(cmin,cnt)
print(cmin) | N = int(eval(input()))
cmin = 1000
for i in range(1,N):
a = str(i)
cnt = 0
for j in range(len(a)):
cnt += int(a[j])
b = str(N-i)
for j in range(len(b)):
cnt += int(b[j])
cmin = min(cmin,cnt)
print(cmin) | p03331 |
N = int(eval(input()))
cmin = 1000
for i in range(1,N):
a = str(i)
cnt = 0
for j in range(len(a)):
cnt += int(a[j])
b = str(N-i)
for j in range(len(b)):
cnt += int(b[j])
cmin = min(cmin,cnt)
print(cmin) | N = int(eval(input()))
cmin = N
for i in range(1,N//2):
j = N-i
a = str(i)
b = str(j)
cnt = 0
for k in range(len(a)):
cnt += int(a[k])
for k in range(len(b)):
cnt += int(b[k])
cmin = min(cmin,cnt)
print(cmin) | p03331 |
n = int(eval(input()))
m = n
sum = 0
for i in range(n):
sum = m % 10 + sum
m = m//10
if sum == 1:
print((10))
else:
print(sum) | n = int(eval(input()))
sum = 0
for i in str(n):
sum += int(i)
if sum == 1:
sum += 9
print(sum) | p03331 |
def digitsum(n):
s = str(n)
array = list(map(int, list(s)))
return sum(array)
N = int(eval(input()))
summin = 10**5
for i in range(1,int(N/2)+1) :
A = i
B = N - i
sumab = digitsum(A) + digitsum(B)
if (summin > sumab) :
summin = sumab
print(summin) | N = int(eval(input()))
ans = float('inf')
for i in range(N//2):
A = i+1
B = N-A
ans = min(ans, sum(list(map(int,str(A)))) + sum(list(map(int,str(B))) ))
print(ans) | p03331 |
ans=999999999
n = int(eval(input()))
for i in range(1,n//2+1):
x=str(i)
y=str(n-i)
ans=min(ans, sum(map(int, x))+sum(map(int, y)))
print(ans) | n=int(eval(input()))
if n%10==0:
print((10))
else:
print((sum(map(int,list(str(n)))))) | p03331 |
N = int(eval(input()))
summ = []
for i in range(1,N//2 + 1):
A = []
B = []
k = N-i
for __ in range(6):
A.append(int(i%10))
B.append(int(k%10))
i /= 10
k /= 10
summ.append(sum(A+B))
print((min(summ))) | N = int(eval(input()))
if N%10 == 0:
print((10))
else:
l = []
for i in range(6):
l.append(int(N%10))
N /= 10
print((sum(l))) | p03331 |
n = int(eval(input()))
mt = 10 ** 9
for i in range(1, n):
t = 0
for j in range(len(str(i))):
t += int(str(i)[j])
for j in range(len(str(n - i))):
t += int(str(n - i)[j])
mt = min(mt, t)
print(mt)
| def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
m_t = 10 ** 10
for i in range(1, n):
a = list(map(int, list(str(i))))
b = list(map(int, list(str(n-i))))
m_t = min(m_t, sum(a) + sum(b))
print(m_t)
if __name__ == '__main__':
... | p03331 |
def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
m_t = 10 ** 10
for i in range(1, n):
a = list(map(int, list(str(i))))
b = list(map(int, list(str(n-i))))
m_t = min(m_t, sum(a) + sum(b))
print(m_t)
if __name__ == '__main__':
... | def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
mt = 10 ** 20
for i in range(1, n // 2 + 1):
sa = str(i)
sb = str(n - i)
t = 0
for j in range(len(sa)):
t += int(sa[j])
for j in range(len(sb)):
... | p03331 |
N = int(eval(input()))
ans = 9999999
for a in range(1,N):
b = N-a
tmp = 0
for ac in str(a):
tmp += int(ac)
for bc in str(b):
tmp += int(bc)
ans = min(ans, tmp)
print(ans)
| N = int(eval(input()))
ans = 9999
for a in range(1,N):
b = N-a
x = sum(map(int,str(a)))
y = sum(map(int,str(b)))
ans = min(ans, x+y)
print(ans) | p03331 |
N = int(eval(input()))
a = 0
for i in str(N):
a += int(i)
if a == 1:
print((10))
else:
print(a) | N = int(eval(input()))
if N % 10 == 0:
print((10))
else:
print((sum(list(map(int, str(N)))))) | p03331 |
# AGC 025 A - Digits Sum
N = int(eval(input()))
def sum_of(num):
list_b = []
k = 0
while num > 0:
list_b.append(num%10)
num //= 10
for i in range(len(list_b)):
k += list_b[i]
return k
list_a =[]
if N <= 10:
print((str(N)))
if N > 10:
for i in rang... | # AGC 025 A - Digits Sum
N = int(eval(input()))
def sum_of(num):
list_b = []
k = 0
while num > 0:
list_b.append(num%10)
num //= 10
for i in range(len(list_b)):
k += list_b[i]
return k
list_a =[]
if N <= 10:
print((str(N)))
if N > 10:
for i in rang... | p03331 |
n = int(eval(input()))
ans = float('Inf')
for i in range(1, n):
if i > n//2:
break
if eval('+'.join(str(i))) + eval('+'.join(str(n - i))) < ans:
ans = eval('+'.join(str(i))) + eval('+'.join(str(n - i)))
print(ans) | n = int(eval(input()))
ans = float('Inf')
for i in range(1, n//2+1):
if sum(list(map(int, str(i)))) + sum(list(map(int, str(n - i)))) < ans:
ans = sum(list(map(int, str(i)))) + sum(list(map(int, str(n - i))))
print(ans) | p03331 |
n = int(eval(input()))
ans = 100000
for i in range(1, n):
a, b = str(i), str(n-i)
A, B = 0, 0
for x in a:
A += int(x)
for y in b:
B += int(y)
ans = min(ans, A+B)
print(ans) | n = int(eval(input()))
for i in range(1,6):
if n%(10*i) == 0:
print((10))
exit()
print((sum(list(map(int, str(n)))))) | p03331 |
n = int(eval(input()))
_list = []
for a in range(1, n):
b = n - a
_list.append(sum(list(map(int, str(a)[::]))) + sum(list(map(int, str(b)[::]))))
print((min(_list))) | N = int(eval(input()))
n = 10 ** (len(str(N-1)) - 1)
a = list(str(N - n))
print((sum(list(map(int, a)))+1))
| p03331 |
def digits_sum(n):
return sum(int(c) for c in str(n))
N = int(eval(input()))
ans = float("inf")
for i in range(1, N):
A = i
B = N - i
ans = min(ans, digits_sum(A) + digits_sum(B))
print(ans)
| def digit_sum(x):
res = 0
while x > 0:
res += x % 10
x //= 10
return res
N = int(eval(input()))
ans = N
for i in range(1, N):
A = i
B = N - i
ans = min(ans, digit_sum(A) + digit_sum(B))
print(ans)
| p03331 |
def wa(t):
sum=0
while t>0:
sum+=t%10
t//=10
return sum
n=int(eval(input()))
ans=[]
for i in range(1,n):
ans.append(wa(i)+wa(n-i))
if wa(i)+wa(n-i)==1:
print(i)
print((min(ans))) | def wa(t):
sum=0
while t>0:
sum+=t%10
t//=10
return sum
n=int(eval(input()))
ans=[]
for i in range(1,n):
ans.append(wa(i)+wa(n-i))
print((min(ans))) | p03331 |
import sys
def digits_sum(x):
return sum(list(map(int, str(x))))
def solve(n):
ans = sys.maxsize
for a in range(1, n):
b = n - a
ans = min(ans, digits_sum(a) + digits_sum(b))
return ans
if __name__ == '__main__':
n = int(eval(input()))
print((solve(n)))
| import sys
def digits_sum(x):
return sum(map(int, str(x)))
def solve(n):
ans = sys.maxsize
for a in range(1, n):
b = n - a
ans = min(ans, digits_sum(a) + digits_sum(b))
return ans
if __name__ == '__main__':
n = int(eval(input()))
print((solve(n)))
| p03331 |
N = int(eval(input()))
results = ''
for A in range(N + 1):
if A == 0:
continue
BBB = []
AAA = []
B = N - A
if B >= 1:
for b in range(len(str(B))):
BBB.append(int(str(B)[b]))
for a in range(len(str(A))):
AAA.append(int(str(A)[a]))
... | # 記録
N = int(eval(input()))
results = []
for i in range(1,N):
results.append(sum(map(int,str(i))) + sum(map(int,str(N-i))))
print((min(results))) | p03331 |
def a_digits_sum(N):
def digit_sum(n): # 非負整数nの各桁の和
str_n = str(n)
ret = 0
for c in str_n:
ret += int(c)
return ret
ans = float('inf')
for A in range(1, N):
B = N - A
ans = min(ans, digit_sum(A) + digit_sum(B))
return ans
N = i... | def a_digits_sum(N):
# A+B のk桁目を c_k、Nのk桁目をn_kとおくと、筆算の考え方より、
# c_k=n_k となるようにすればいい。つまり解はNの各桁の和に等しい。
# ただし、Nが10の冪乗のときは、上の考え方では片方がNに等しくなってしまう。
# この場合、 N=10^k とすると、 A=a*10^(k-1), B=b*10^(k-1) (ただし a+b=10)
# の形にするしかない。よってA+Bの各桁の和は常に10。
ans = 0
n = str(N)
for c in n:
ans += i... | p03331 |
#! /usr/bin/env python3
N = int(eval(input()))
ans = 10000000
for i in range(1, N):
s = sum(map(int, str(i))) + sum(map(int, str(N - i)))
ans = min(ans, s)
print(ans) | N=int(eval(input()));print((min(sum(map(int,str(i)+str(N-i)))for i in range(1,N)))) | p03331 |
N = int(eval(input()))
ans = N
for i in range(1,N):
A,B = 0,0
A_str = list(str(i))
B_str = list(str(N-i))
for e in A_str:
A += int(e)
for e in B_str:
B += int(e)
if A + B < ans:
ans = A + B
print(ans) | def degit_sum(n):
if len(str(n)) < 2:
return n
s = list(str(n))
s = [int(e) for e in s]
return sum(s)
N = int(eval(input()))
degit = len(str(N))
if N % pow(10,degit-1) == 0 and N >= 10:
degit -= 1
A = pow(10,degit-1)
B = N - A
ans = degit_sum(A) + degit_sum(B)
print(ans) | p03331 |
#!/usr/bin/env python
n = int(eval(input()))
def sumdigits(n):
ret = 0
s = list(str(n))
for i in range(len(s)):
ret += int(s[i])
return ret
a = 1
ans = 1000000
while n-a > 0:
tmp = sumdigits(a) + sumdigits(n-a)
if ans >= tmp:
ans = tmp
a += 1
print(... | #!/usr/bin/env python
import math
n = int(eval(input()))
m = math.log10(n)
if int(m) == m:
print((10))
exit()
ans = sum(map(int, list(str(n))))
print(ans)
| p03331 |
# ARC082C - Together (ABC072C)
n = int(eval(input()))
lst = list(map(int, input().rstrip().split()))
ans = [0] * 100001
for i in lst:
ans[i] += 1
print((max(list(map(sum, list(zip(ans, ans[1:], ans[2:]))))))) | # ARC082C - Together (ABC072C)
def main():
n = int(eval(input()))
lst = list(map(int, input().rstrip().split()))
ans = [0] * 100001
for i in lst:
ans[i] += 1
print((max(list(map(sum, list(zip(ans, ans[1:], ans[2:])))))))
if __name__ == "__main__":
main() | p03613 |
from collections import Counter
from operator import itemgetter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
def num(n):
if n in list(c.keys()):
return c[n]
else:
return 0
ans = 0
for i in range(99998):
candidate = num(i) + num(i+1) + num(i+2)
if candidate > a... | from collections import Counter
from operator import itemgetter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
def num(n):
if n in list(c.keys()):
return c[n]
else:
return 0
candidate = num(0) + num(1) + num(2)
ans = candidate
for i in range(1, 99998):
candidate ... | p03613 |
n = int(eval(input()))
dic = {}
for i in map(int, input().split()):
for j in range(i-1, i+1+1):
if j not in dic:
dic[j] = 0
dic[j] += 1
print((max(dic.values()))) | n = int(eval(input()))
dic = {}
for a in map(int, input().split()):
for i in range(a-1, a+2):
if i not in dic:
dic[i] = 0
dic[i] += 1
print((max(dic.values()))) | p03613 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
d = Counter(A)
ans = 0
for i in range(1, 10**5+1):
tmp = d[i-1] + d[i] + d[i+1]
ans = max(tmp, ans)
print(ans)
| from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
d = Counter(A)
ans = 0
for k in list(d.keys()):
tmp = d[k-1] + d[k] + d[k+1]
ans = max(ans, tmp)
print(ans)
| p03613 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun Feb 10 10:05:08 2019
@author: shinjisu
"""
# ARC 076 C
def getInt(): return int(eval(input()))
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n
def dmp(x):
global debug
if debug:
... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun Feb 10 10:05:08 2019
@author: shinjisu
"""
# ARC 076 C
def getInt(): return int(eval(input()))
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n
def dmp(x):
global debug
if debug:
... | p03613 |
import collections
n = int(eval(input()))
a = list(map(int, input().split()))
ac = collections.Counter(a)
ans = 0
for i in range(min(a) - 1, max(a) + 2):
total = 0
for j in ac:
if j == i or j + 1 == i or j - 1 == i:
total += ac[j]
ans = max(ans, total)
print(ans) | import collections
n = int(eval(input()))
a = list(map(int, input().split()))
ac = collections.Counter(a)
ans = 0
for i in range(min(a) - 1, max(a) + 2):
ans = max(ans, ac[i - 1] + ac[i] + ac[i + 1])
print(ans) | p03613 |
import sys
import bisect
def main():
n, *a = list(map(int, sys.stdin.read().split()))
lr = [[i - 1,i + 1] for i in a]
lr.sort(key=lambda x: x[0])
l = [i[0] for i in lr]
res = 0
for i in range(n):
right = bisect.bisect(l, lr[i][1])
left = bisect.bisect_left(l, l[i])
... | import sys
from itertools import accumulate
def main():
n, *A = list(map(int, sys.stdin.read().split()))
minA = min(A) - 1
lr = [[i - 1 - minA, i + 1 - minA] for i in A]
lst = [0] * (max(A) - minA + 3)
for i, j in lr:
lst[i] += 1
lst[j + 1] -= 1
lst = list(accumulat... | p03613 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = []
for i in A:
B.append(i - 1)
B.append(i)
B.append(i + 1)
Bset = set(B)
C = []
for i in Bset:
C.append(len(list([x for x in B if x == i])))
print((max(C)))
| N = int(eval(input()))
A = [int(i) for i in input().split()]
B = []
for i in A:
B.append(i - 1)
B.append(i)
B.append(i + 1)
B.sort()
C = []
count = 0
for i in range(len(B)):
if B[i] == B[i - 1]:
count += 1
else:
C.append(count + 1)
count = 0
print((max(C... | p03613 |
import collections
N = int(eval(input()))
a = list(map(int, input().split()))
c = collections.Counter(a)
ans = 0
for i in c:
t = c[i-1] + c[i] + c[i+1]
if ans < t:
ans = t
print(ans) | from collections import Counter
N = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
ans = 0
for i in c:
t = c[i-1] + c[i] + c[i+1]
if ans < t:
ans = t
print(ans) | p03613 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | # import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
# sys.setrecursionlimit(10**7)
# inf = 10 ** 20
# eps = 1.0 / 10**10
# mod = 10**9+7
# dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
# ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), ... | p03317 |
n,k,*_=list(map(int,open(0).read().split()))
print((0--~-n//~-k)) | n,k=list(map(int,input().split()))
print((0--~-n//~-k)) | p03317 |
N,K=(int(i) for i in input().split())
A = list(int(i) for i in input().split())
minNum=0
i=0
A2=[]
ans=0
A2.extend(A[i:i+K])
while i<N:
#print(A2)
minNum=int(min(A2))
# print(minNum)
j=i
#特定範囲の最小化
while j<i+K:
#途中でオーバーしたら逃げる
if len(A2)<=j:
break... | N,K=(int(i) for i in input().split())
A = list(int(i) for i in input().split())
minNum=0
i=0
A2=[]
ans=0
while i<N:
if i==0:
i=i+K
else:
i=i+K-1
ans+=1
print(ans)
| p03317 |
import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
print((math.ceil((N - 1) / (K - 1)))) | import math
N, K = list(map(int, input().split()))
print((math.ceil((N - 1) / (K - 1)))) | p03317 |
[N, K] = list(map(int, input().split()))
A = list(map(int, input().split()))
count = 0
while len(A) != 1:
A = A[K:] + [0]
count = count + 1
print(count)
| [N, K] = list(map(int, input().split()))
A = list(map(int, input().split()))
print((-(-(N - 1) // (K - 1))))
| p03317 |
import math
n, k = list(map(int, input().split()))
[int(i) for i in input().split()]
print((math.ceil((n-k) / (k - 1) + 1))) | import math
n, k = list(map(int, input().split()))
print((math.ceil((n-k) / (k - 1) + 1)))
| p03317 |
N, K = list(map(int, input().split()))
Ax = list(map(int, input().split()))
if N == K:
print((1))
exit()
N -= K
ans = 1
while N > 0:
N = N-(K-1)
ans += 1
print(ans)
| N, K = list(map(int, input().split()))
alist = list(map(int, input().split()))
ans = 1
N -= K
while N > 0:
N -= K-1
ans += 1
print(ans)
| p03317 |
N,K = list(map(int,input().split()))
A = [int(i) for i in input().split()]
ans = 0
minA = min(A)
for i in range(len(A)):
if A[i] == minA:
A[i] = 0
else:
A[i] = 1
while 1 in A:
if len(A) <= K:
ans += 1
break
... | N,K = list(map(int,input().split()))
A = [int(i) for i in input().split()]
print(((N-1)//(K-1)+((N-1)%(K-1)!=0))) | p03317 |
def main():
n, k, *a = list(map(int, open(0).read().split()))
ans = 1 + (n - k) // (k - 1) + ((n - k) % (k - 1) != 0)
print(ans)
if __name__ == '__main__':
main()
| def main():
n, k = list(map(int, input().split()))
ans = 1 + (n - k) // (k - 1) + ((n - k) % (k - 1) != 0)
print(ans)
if __name__ == '__main__':
main()
| p03317 |
#1にしなきゃいけない
from math import*
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
#b=a.index(1)
#print(n,k,b)
#l=b
#r=n-b-1
print(((n-1+k-1-1)//(k-1)))
| n,k=list(map(int,input().split()));print(((n-1+k-1-1)//(k-1)))
| p03317 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if n == k:
print((1))
exit()
a = (n-k)//(k-1)
if (n-k)%(k-1):
print((a+2))
else:
print((a+1))
| from math import ceil
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
print((ceil((n-k)/(k-1)) + 1))
| p03317 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(1,n):
if n<=k+(k-1)*(i-1):
print(i)
exit()
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for g in range(1,n+1):
if n<=g*(k-1)+1:
print(g)
exit()
| p03317 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
if n == k:
print((1))
exit()
n -= k
if n % (k-1) == 0:
n //= k-1
else:
n //= k-1
n += 1
print((n+1)) | import math
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
n -= k
print((math.ceil(n/(k-1)) + 1))
| p03317 |
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
print((1 + -( -(N-K)//(K-1) ) ))
| N,K = list(map(int, input().split()))
print((1 + -( -(N-K)//(K-1) ) ))
| p03317 |
import math
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
print((math.ceil((N-1)/(K-1)))) | import math
N, K = list(map(int,input().split()))
print((math.ceil((N-1)/(K-1)))) | p03317 |
import math
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = math.ceil((n-1)/(k-1))
print(ans) | n,k = list(map(int, input().split()))
if (n-1)%(k-1)==0:
print(((n-1)//(k-1)))
else:
print(((n-1)//(k-1)+1))
| p03317 |
M, N =list(map(int, input().split()))
A =list(map(int, input().split()))
print((-(-(M-1)//(N-1)))) | M, N =list(map(int, input().split()))
print((-(-(M-1)//(N-1)))) | p03317 |
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
def f():
for i in range(1, N+1):
if (K-1)*i + 1 >= N:
return i
print((f())) | N,K = list(map(int, input().split()))
def f():
for i in range(1, N+1):
if (K-1)*i + 1 >= N:
return i
print((f())) | p03317 |
# author: kagemeka
# created: 2019-11-08 13:38:56(JST)
## internal modules
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
## external modu... | import sys
n, k, *a = list(map(int, sys.stdin.read().split()))
def main():
return ((n - 1) + (k - 1) - 1) // (k - 1)
if __name__ == '__main__':
ans = main()
print(ans) | p03317 |
import sys
n, k, *a = list(map(int, sys.stdin.read().split()))
def main():
return ((n - 1) + (k - 1) - 1) // (k - 1)
if __name__ == '__main__':
ans = main()
print(ans) | import sys
n, k = list(map(int, sys.stdin.readline().split()))
def main():
print(((n + k - 3) // (k - 1)))
if __name__ == '__main__':
main() | p03317 |
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,cei... | from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,cei... | p03317 |
def solve(array, k):
ans = 0
length = len(array)
i = 0
while i < length - 1:
if array[i] == array[i + 1]:
i += 1
elif i + k >= length:
ans += 1
break
else:
ans += 1
i += k - 1
array[i] = min(arra... | def solve(n, k):
div, mod = divmod(n - 1, k - 1)
return div + (0 if mod == 0 else 1)
if __name__ == "__main__":
n, k = list(map(int, input().split()))
array = [int(s) for s in input().split()]
print((solve(n, k)))
| p03317 |
import math
N, K = list(map(int, input().split()))
a_list = list(map(int, input().split()))
print((math.ceil((N-1)/(K-1))))
| N, K = list(map(int, input().split()))
print(((N-1)//(K-1)+bool((N-1)%(K-1))))
| p03317 |
N,K = [int(i) for i in input().split()]
n = list(map(int, input().split()))
print(((N-K)//(K-1) + 1 if (N-K)%(K-1) ==0 else (N-K)//(K-1) + 2))
| N,K = [int(i) for i in input().split()]
print(((N-K)//(K-1) + 1 if (N-K)%(K-1) == 0 else (N-K)//(K-1) + 2))
| p03317 |
import math
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
tmp = a.index(min(a))
amri = ((tmp) % (K - 1))
if amri == 0:
ans = math.ceil(tmp / (K - 1)) + math.ceil((N - tmp - 1) / (K - 1))
else:
ans = math.floor(tmp / (K - 1)) + math.ceil((N - tmp - (K- amri)) / (K - 1)) + 1... | import math
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = math.ceil((N - 1)/ (K - 1))
print(ans) | p03317 |
def main():
N, K = (int(i) for i in input().split())
A = (int(i) for i in input().split())
from math import ceil
print((ceil((N-1)/(K-1))))
if __name__ == '__main__':
main() | def main():
N, K = (int(i) for i in input().split())
from math import ceil
print((ceil((N-1)/(K-1))))
if __name__ == '__main__':
main() | p03317 |
import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split())) #A[0]〜A[N-1]
m = min(A)
answer = N
for i in range(N-K+1): #A[i:i+K]〜A[N-K:N]
if not m in A[i:i+K]:
continue
answer = min(answer,
(1 + math.ceil(i/(K-1)) + math.ceil((N-K-i)/(K-1))))
print(answer) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
print(((N-1)//(K-1) + bool((N-1)%(K-1)))) | p03317 |
from sys import stdin
n, k, *a = list(map(int, stdin.read().split()))
print((((n - 1) + (k - 2)) // (k - 1)))
| n, k = list(map(int, input().split()))
print((((n - 1) + (k - 2)) // (k - 1)))
| p03317 |
N, K = list(map(int, input().strip().split()))
AList = list(map(int, input().strip().split()))
length = len(AList ) - 1
ans = 0
while(length > 0):
ans += 1
length = length - (K - 1)
print(ans) | N, K = list(map(int, input().strip().split()))
print((int((N- 1) / (K - 1)) + (0 if (N-1)%(K-1)==0 else 1))) | p03317 |
n,k = list(map(int,input().split()))
A = list(map(int, input().split()))
ans = (n-1)//(k-1) if (n-1)%(k-1) == 0 else (n-1)//(k-1) + 1
print(ans)
| n,k=list(map(int,input().split()))
a = list(map(int,input().split()))
if (n-1)%(k-1) != 0:
cnt = (n-1)//(k-1)+1
else:
cnt = (n-1)//(k-1)
print(cnt) | p03317 |
#!/usr/bin/env python3
import sys
import math
def solve(N: int, K: int, A: "List[int]"):
ix = A.index(1)
ans = math.ceil((N-1)/(K-1))
print(ans)
return
# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this li... | #!/usr/bin/env python3
import sys
import math
def solve(N: int, K: int, A: "List[int]"):
ans = math.ceil((N-1)/(K-1))
print(ans)
return
# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom... | p03317 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if k < n:
c = 1
n -= k
while n > 0:
n -= k-1
c += 1
print(c)
else:
print((1)) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if k < n:
c = 1
n -= k
c += -((-n)//(k-1))
print(c)
else:
print((1)) | p03317 |
# -*- coding: utf-8 -*-
# モジュールのインポート
import math
# 標準入力を取得
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# 求解処理
ans = math.ceil((N - 1) / (K - 1))
# 結果出力
print(ans) | # -*- coding: utf-8 -*-
# モジュールのインポート
import math
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
# 標準入力を取得
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
return N, K, A
def main(N: int, K: int) -> None:
... | p03317 |
import math
def resolve():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
i = a.index(min(a)) + 1
if k - 1 > i:
v = max(0, math.ceil((n - k - 2) / (k - 1))) + 1
else:
v = math.ceil(i / (k - 1)) + math.ceil((n - i - 1) / (k - 1))
print(v)
resolve() | import math
# def resolve():
# n, k = map(int, input().split())
# a = list(map(int, input().split()))
# i = a.index(min(a)) + 1
# if k - 1 > i:
# v = max(0, math.ceil((n - k - 2) / (k - 1))) + 1
# else:
# v = math.ceil(i / (k - 1)) + math.ceil((n - i - 1) / (k - 1))
# print(v)
def resolve():
n, ... | p03317 |
def solve():
n,k = list(map(int, input().split()))
A = list(map(int, input().split()))
if (n-1)%(k-1) != 0:
return (n-1)//(k-1) + 1
else:
return (n-1)//(k-1)
if __name__ == '__main__':
print((solve())) | def solve():
n,k = list(map(int, input().split()))
if (n-1)%(k-1) != 0:
return (n-1)//(k-1) + 1
else:
return (n-1)//(k-1)
if __name__ == '__main__':
print((solve())) | p03317 |
N, K = list(map(int, input().split(" ")))
lista = list(map(int, input().split(" ")))
num = 0
listlist = []
listlist.append(lista)
r = len(lista) - K + 1
while(True):
num += 1
newlistlist = []
for tmplist in listlist:
for i in range(r):
tmptmplist = tmplist.copy()
... | N, K = list(map(int, input().split(" ")))
lista = list(map(int, input().split(" ")))
num = 0
listlist = []
listlist.append(lista)
r = len(lista) - K + 1
m = min(lista)
while(True):
num += 1
newlistlist = []
for tmplist in listlist:
for i in range(r):
tmptmplist = tmplist.copy... | p03317 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i, v in enumerate(a):
if v == 1:
ind1 = i
break
ans = -((-n + 1) // (k - 1))
print(ans) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = -((-n + 1) // (k - 1))
print(ans) | p03317 |
A, B = list(map(int, input().split()))
target_list = input().split()
def check_list(lis):
# print(lis)
return len(list(set(target_list))) == 1
count = 0
while check_list(target_list) == False:
min_in_list = min(target_list)
tmp = A - 1
while((target_list[tmp] != min_in_list) or (target... | import math
i, j = list(map(int, input().split()))
target_list = list(map(int, input().split()))
print((math.ceil((i-1)/(j-1)))) | p03317 |
import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
n -= 1
k -= 1
ans = (n + k - 1) // k
print(ans)
| import math
n, k = list(map(int, input().split()))
# a = list(map(int, input().split()))
n -= 1
k -= 1
ans = (n + k - 1) // k
print(ans)
| p03317 |
import bisect
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
amin=min(a)
m=bisect.bisect(a,amin)
for i in range(n):
if a[i]==1:
m=i+1
k1=k-1
#print(m,k1)
if k1==1:
print((n-1))
else:
if m==0:
n2=(n-1)//k1+1
print(n2)
elif m... |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
print(((n-2)//(k-1)+1)) | p03317 |
N, K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
# print(N // (K - 1))
if (N - 1) % (K - 1) == 0:
print(((N - 1) // (K - 1)))
else:
print(((N - 1) // (K - 1) + 1))
| N, K, *A = list(map(int, open(0).read().split()))
print((-(-(N - 1) // (K - 1))))
| p03317 |
N, K, *A = list(map(int, open(0).read().split()))
print((-(-(N - 1) // (K - 1))))
| N, K = list(map(int, input().split()))
print((-(-(N - 1) // (K - 1))))
| p03317 |
import math
N, K = list(map(int, input().split()))
A_list = [int(i) for i in input().split()]
print((math.ceil((N-1)/(K-1)))) | import math
N, K = list(map(int, input().split()))
print((math.ceil((N-1)/(K-1)))) | p03317 |
N,K=list(map(int,input().strip().split()))
A=list(map(int,input().strip().split()))
i=A.index(1)+1
if i<=K or i>=N-K:
ans=(N-K)//(K-1)+1 if (N-K)%(K-1)==0 else (N-K)//(K-1)+2
else:
for a in range(K):
if (i-a)%(K-1)==0 and (N-(i+(K-a)))%(K-1)==0:
b=0
else:
b=1
... | N,K=list(map(int,input().strip().split()))
A=list(map(int,input().strip().split()))
i=A.index(1)+1
if i<=K or i>=N-K:
ans=(N-K)//(K-1)+1 if (N-K)%(K-1)==0 else (N-K)//(K-1)+2
else:
for a in range(K):
b=0 if (i-a)%(K-1)==0 and (N-(i+(K-a)))%(K-1)==0 else 1
front=i//(K-1)
back=(N-(i+K))... | p03317 |
from math import ceil
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
if N == K:
print((1))
elif (N-1)%(K-1) == 0:
print(((N-1)//(K-1)))
elif K == 2:
print((N-1))
else:
ans = ceil(N/(K-1))
print(ans)
| from math import ceil
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = ceil((N-1)/(K-1))
print(ans)
| p03317 |
# -*- coding:utf-8 -*-
n, k = list(map(int, input().split()))
nums = list(map(int, input().split()))
one_index = nums.index(1)
min = n
range_value = one_index if k > one_index else k
for i in range(range_value+1):
left = one_index - k + i + 1
right = len(nums[one_index+1:]) - i
if left + right > n-... | # -*- coding:utf-8 -*-
import math
n, k = list(map(int, input().split()))
nums = list(map(int, input().split()))
one_index = nums.index(1)
if k == len(nums):
print((1))
else:
print((math.ceil((n-1)/(k-1))))
| p03317 |
'''WA
N,K=map(int,input().split())
A=list(map(int,input().split()))
x=A.index(1)
K-=1
print((x-1)//K+(N-x-2)//K+2)
'''
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
cnt=0
while 1:
idx=A.index(1)
if idx==0:break
if idx+1<=K:
A[:K]=[1]*K
else:
A[idx-K+... | N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
idx=A.index(1)
cnt=0
if idx:
if idx+1<=K:
cnt=1
A[:K]=[1]*K
else:
cnt=(idx-1)//(K-1)+1
num=cnt*(K-1)+1
A[:num]=[1]*num
A=A[::-1]
idx=A.index(1)
if idx:
if idx+1<=K:
cnt+=1
... | p03317 |
N, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
minIndex = [i for i, x in enumerate(A) if x == min(A)]
print(((minIndex[0]+1)//K+(len(A)-max(minIndex[0], 1))//K+1))
| import math
N, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
minIndex = A.index(min(A))
if K == len(A):
print((1))
else:
print((math.ceil((N-1)/(K-1))))
| p03317 |
n,k = list(map(int, input().split()))
x=(n-k)//(k-1)
y=(n-k)%(k-1)
if y==0:
print((x+1))
else:
print((x+2)) | n,k = map(int, input().split())
x=(n-k)//(k-1)
y=(n-k)%(k-1)
print(x+1) if y==0 else print(x+2)
| p03317 |
n,k = list(map(int,input().split()))
lst = list(map(int,input().split()))
id = lst.index(1)
left = len(lst[0:id])
right = len(lst[id+1:])
mod = max(left%(k-1),right%(k-1))
total = left + right
counter = 0
while total > 0:
counter += 1
total -= k - 1
print(counter) | n,k = list(map(int,input().split()))
lst = list(map(int,input().split()))
id_of_one = lst.index(1) #リスト内の最小値1のインデックスを取得
left = len(lst[0:id_of_one]) #1より左側にある数列の長さ
right = len(lst[id_of_one+1:]) #1より右側にある数列の長さ
total = left + right
counter = 0
while total > 0:
counter += 1
total -= k - 1
... | p03317 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
now = k
res = 1
while now < n:
now += k-1
res += 1
print(res) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if (n + k - 1) // k == 1:
print((1))
else:
res = ((n - k) + (k - 2)) // (k - 1) + 1
print(res)
| p03317 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.