input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys,math,collections,itertools
input = sys.stdin.readline
N,M=list(map(int,input().split()))
road = [0]*(N-1)
for _ in range(M):
l,r=list(map(int,input().split()))
for i in range(l-1,r-1):
road[i]+=1
if sum(road)%2==0:
print('YES')
else:
print('NO')
| import sys,math,collections,itertools
input = sys.stdin.readline
N,M=list(map(int,input().split()))
road = [0]*(N)
for _ in range(M):
l,r=list(map(int,input().split()))
road[l-1]+=1
road[r-1]-=1
road = list(itertools.accumulate(road))[:-1]
flag=0
for ro in road:
if ro%2==1:
print... | p03724 |
l=[0]*2**17
for i in open(0).read().split()[2:]:l[int(i)]+=1
print(('YNEOS'[any(i%2for i in l)::2])) | from collections import*;print(('YNEOS'[any(i%2for i in list(Counter(open(0).read().split()[2:]).values()))::2])) | p03724 |
n,m=list(map(int,input().split()))
lists=[0 for i in range(m)]
for i in range(m):
x,y=list(map(int,input().split()))
lists[i]=(x,y)
anslist=[0 for i in range(n+1)]
#anslist[1] からanslist[n]まででこれらが全て偶数となるような時を考えればいい
#そうでないならばそれはNoである
for j in lists:
if j[0]==1:
anslist[j[1]]+=1
... | n,m=list(map(int,input().split()))
lists=[0 for i in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
lists[a-1]+=1
lists[b-1]+=1
flag=True
for i in range(n):
if lists[i]%2!=0:
flag=False
break
if flag:
print("YES")
else:
print("NO") | p03724 |
import collections
N, M = list(map(int, input().split()))
a = [0]*M
b = [0]*M
for i in range(M):
a[i], b[i] = list(map(int, input().split()))
table = collections.defaultdict(int)
for i in range(M):
table[a[i]] += 1
table[b[i]] += 1
odd = []
for x in table:
if table[x] % 2 == 1:
... | N,M=list(map(int,input().split()))
import collections
table=collections.defaultdict(int)
for i in range(M):
a,b=list(map(int,input().split()))
table[a]+=1
table[b]+=1
flag=True
for x in table:
if table[x]%2==1:
flag = False
break
if flag:
print("YES")
else:
print("NO") | p03724 |
from collections import defaultdict
n,m=list(map(int,input().split()))
ab=[list(map(int,input().split())) for i in range(m)]
cnt=defaultdict(lambda :0)
for i in range(m):
for j in range(2):
cnt[ab[i][j]]+=1
for i in list(cnt.values()):
if i%2!=0:
print('NO')
exit()
print('... | from collections import defaultdict
n,m=list(map(int,input().split()))
ab=[list(map(int,input().split())) for i in range(m)]
cnt=defaultdict(lambda :0)
for i in range(m):
cnt[ab[i][0]]+=1
cnt[ab[i][1]]+=1
for i in list(cnt.values()):
if i%2!=0:
print('NO')
exit()
print('YES') | p03724 |
from itertools import accumulate
N, M = map(int, input().split())
acc = [0] * N
for _ in range(M):
a, b = map(int, input().split())
if a > b:
a, b = b, a
acc[a - 1] += 1
acc[b - 1] -= 1
print("NO") if any(a % 2 for a in accumulate(acc)) else print("YES")
| from itertools import accumulate
N, M, *ab = map(int, open(0).read().split())
acc = [0] * (N + 1)
for a, b in zip(*[iter(ab)] * 2):
if a > b:
a, b = b, a
acc[a - 1] += 1
acc[b - 1] -= 1
acc = list(accumulate(acc, initial=0))
print("NO") if any(a % 2 for a in acc) else print("YES")
| p03724 |
from itertools import accumulate
N, M, *ab = map(int, open(0).read().split())
acc = [0] * (N + 1)
for a, b in zip(*[iter(ab)] * 2):
if a > b:
a, b = b, a
acc[a - 1] += 1
acc[b - 1] -= 1
acc = list(accumulate(acc, initial=0))
print("NO") if any(a % 2 for a in acc) else print("YES")
| N, M, *ab = map(int, open(0).read().split())
ans = [0] * N
for a, b in zip(*[iter(ab)] * 2):
ans[a - 1] += 1
ans[b - 1] -= 1
print("NO") if any(a % 2 for a in ans) else print("YES")
| p03724 |
n,m=list(map(int,input().split()))
c=sum([list(map(int,input().split())) for i in range(m)],[])
from collections import Counter as co
for i in list(co(c).values()):
if i%2:print("NO");exit()
print("YES") | n,m=list(map(int,input().split()))
l=[0]*(n+1)
for i in range(m):
a,s=list(map(int,input().split()))
l[a]+=1
l[s]+=1
for i in l:
if i%2:print("NO");exit()
print("YES") | p03724 |
# すべての頂点が入力に現れる回数が偶数であればOK 奇数回の頂点が一つでもあればNO
from collections import defaultdict as d
N,M = list(map(int,input().split()))
E = d(int)
for i in range(M):
a,b = list(map(int,input().split()))
E[a] ^= 1
E[b] ^= 1
print((("YES","NO")[sorted(E.values())[-1]]))
| from collections import defaultdict as d
N,M=list(map(int,input().split()))
E=d(int)
for i in range(M):
a,b=list(map(int,input().split()))
E[a]^=1
E[b]^=1
print((("YES","NO")[max(E.values())])) | p03724 |
from collections import Counter
N, M = list(map(int, input().split()))
Q = [list(map(int, input().split())) for _ in range(M)]
cnt = Counter()
for q in Q:
cnt += Counter(q)
for k in cnt:
if cnt[k] % 2 != 0:
print("NO")
exit()
print("YES")
| N, M = list(map(int, input().split()))
Q = [list(map(int, input().split())) for _ in range(M)]
cnt = [0 for _ in range(N)]
for a, b in Q:
cnt[a-1] += 1
cnt[b-1] += 1
for k in range(N):
if cnt[k] % 2 != 0:
print("NO")
exit()
print("YES") | p03724 |
def solve():
n,m = (int(i) for i in input().split())
a = []
b = []
for i in range(m):
a1,b1 = (int(i) for i in input().split())
a.append(a1)
b.append(b1)
ans = 'YES'
for i in range(1,n+1):
if (a.count(i)+b.count(i))%2 == 1:
ans ='NO'
return ans
if _... | def solve():
n,m = (int(i) for i in input().split())
a = [0]*n
for i in range(m):
a1,b1 = (int(i) for i in input().split())
a[a1-1]+=1
a[b1-1]+=1
ans = 'YES'
for i in range(n):
if a[i]%2 == 1:
ans ='NO'
return ans
if __name__ == '__main__':
print((s... | p03724 |
N, M = list(map(int, input().split()))
# 木だったらなんでもOK?
# いもす法
edge = [0] * (N + 1)
for _ in range(M):
a, b = list(map(int, input().split()))
edge[a] += 1
edge[b] -= 1
ans = "YES"
for i in range(N):
edge[i + 1] += edge[i]
if edge[i + 1] % 2 == 1:
ans = "NO"
break
pr... | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N, M = list(map(int, input().split()))
cnt = [0] * (N + 1)
for _ in range(M):
a, b = list(map(int, input().split()))
cnt[a] ^= 1
cnt[b] ^= 1
if all(x == 0 for x in cnt):
print("YES")
else:
print("NO") | p03724 |
#!/usr/bin/env python3
import sys
def solve(s: str, K: int):
index_dict = {}
for i in range(len(s)):
if index_dict.get(s[i]) == None:
index_dict[s[i]] = [i]
else:
index_dict[s[i]].append(i)
value_list = sorted(set(list(s)))
candidate = set()
... | #!/usr/bin/env python3
import sys
def solve(s: str, K: int):
index_dict = {}
for i in range(len(s)):
if index_dict.get(s[i]) == None:
index_dict[s[i]] = [i]
else:
index_dict[s[i]].append(i)
value_list = sorted(set(list(s)))
candidate = set()
... | p03353 |
s = input()
k = int(input())
l = len(s)
ls = []
for a in range(l):
for b in range(a+1,l+1):
if ls.count(s[a:b]) == 0:
ls.append(s[a:b])
ls.sort()
print(ls[k-1]) | s = input()
k = int(input())
l = len(s)
ls = []
for a in range(l):
for b in range(a+1,min(a+k+1,l+1)):
if ls.count(s[a:b]) == 0:
ls.append(s[a:b])
ls.sort()
print(ls[k-1]) | p03353 |
s=input().strip()
K=int(eval(input()))
sorteds=sorted(set(s))
ct=0
subsset=set()
for c in sorteds:
ct+=1
ixs=[]
ss=s
ix=0
while len(ss):
ii=ss.find(c)
if ii==-1:break
ixs.append(ix+ii)
ix=ix+ii
ss=ss[ii:]
for i in range(len(ss)):
... | s=input().strip()
K=int(eval(input()))
sorteds=sorted(set(s))
ct=0
subsset=set()
for c in sorteds:
ct+=1
ixs=[]
ss=s
ix=0
while len(ss):
ii=ss.find(c)
if ii==-1:break
ixs.append(ix+ii)
ix=ix+ii
ss=ss[ii:]
for i in range(min(len(ss),K)):... | p03353 |
def main():
s = input().strip()
k = int(input().strip())
ss = []
for i in range(0, len(s)):
for j in range(i, len(s)+1):
if i == j:
continue
if len(ss) == 8:
if ss[-1] > s[i:j]:
ss[-1] = s[i:j]
... |
def main():
s = input().strip()
k = int(input().strip())
ss = []
for i in range(0, len(s)):
for j in range(i, i + k + 1):
if i == j:
continue
if len(ss) == 6:
if ss[-1] > s[i:j]:
ss[-1] = s[i:j]
... | p03353 |
str = input()
K = int(input())
#print str, K, len(str)
dic = []
i = 1
while i <= len(str):
idx = 0
while True:
head = idx
tail = i + idx
if tail > len(str):
break
else:
dic.append(str[head:tail])
idx = idx + 1
i = ... | str = input()
K = int(input())
#print str, K, len(str)
#dic = []
dic = set()
i = 1
while i <= len(str):
idx = 0
while True:
head = idx
tail = i + idx
if tail > len(str):
break
else:
# dic.append(str[head:tail])
dic.add(st... | p03353 |
#!/usr/bin/env python3
from collections import Counter
import sys
try:
from typing import Set
except ImportError:
pass
def f(s: "Set[str]", p: int, i: int):
bins = Counter(sj[p:p + 1] for sj in s)
cum = 0
key = ""
cnt = 0
for key, cnt in sorted(bins.items()):
cum +... | #!/usr/bin/env python3
import sys
def solve(s: str, K: int):
n = len(s)
ss = {
s[i:j]
for i in range(n)
for j in range(i + 1, min(n + 1, i + K + 1))
}
print((sorted(ss)[K - 1]))
def main():
def iterate_tokens():
for line in sys.stdin:
... | p03353 |
# author: kagemeka
# created: 2019-11-07 13:42:36(JST)
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
def main():
s = sys.stdin.read... | # author: kagemeka
# created: 2019-11-07 13:42:36(JST)
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
def main():
s = sys.stdin.read... | p03353 |
import sys
s = sys.stdin.readline().rstrip()
k = int(sys.stdin.readline().rstrip())
n = len(s)
def main():
res = set()
for i in range(n):
for j in range(i, n):
res.add(s[i:j+1])
return sorted(res)[k-1]
if __name__ == '__main__':
ans = main()
print(ans) | import sys
s = sys.stdin.readline().rstrip()
k = int(sys.stdin.readline().rstrip())
n = len(s)
def main():
res = set()
for l in range(n):
for r in range(l, min(l+k, n)):
res.add(s[l:r+1])
return sorted(res)[k-1]
if __name__ == '__main__':
ans = main()
print(an... | p03353 |
#!/usr/bin/env python3
import sys
def solve(s: str, K: int):
sl = set()
for i in range(len(s)):
for j in range(i,len(s)):
sl.add(s[i:j+1])
sl = list(sorted(sl))
# print(sl)
print((sl[K-1]))
return
# Generated by 1.1.5 https://github.com/kyuridenami... | #!/usr/bin/env python3
import sys
def solve(s: str, K: int):
sl = set()
for i in range(len(s)):
for j in range(i,min(i+K,len(s))):
sl.add(s[i:j+1])
sl = list(sorted(sl))
# print(sl)
print((sl[K-1]))
return
# Generated by 1.1.5 https://github.com/ky... | p03353 |
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
import heapq
def main():
s = input().strip()
n = len(s)
stq = set()
k = int(input().strip())
for i in range(n):
for j in range(i+1, max(i+1+k+1, n+1)):
... | import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
import heapq
def main():
s = input().strip()
n = len(s)
stq = set()
k = int(input().strip())
for i in range(n):
for j in range(i+1, min(i+1+k+1, n+1)):
... | p03353 |
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
import heapq
def main():
s = input().strip()
n = len(s)
stq = set()
k = int(input().strip())
for i in range(n):
for j in range(i+1, min(i+1+k+1, n+1)):
... | import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
def main():
s = input().strip()
k = int(input().strip())
n = len(s)
strs = set()
for i in range(n):
for j in range(1, k+1):
strs.add(s[i:min(i+j, n)])
... | p03353 |
import sys
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
##############################
S = input().rstrip()
K = int(eval(input()))
N = len(S)
ret = []
for nums in range(1, N+1):
for i in range(N):
s = S[i:i+nums]
ret.append(s)
ret = sorted(set(ret))
print((ret[K... |
import sys
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
##############################
S = input().rstrip()
K = int(eval(input()))
N = len(S)
ret = []
for nums in range(1, K+1):
for i in range(N):
s = S[i:i+nums]
ret.append(s)
ret = sorted(set(ret))
print((ret[K-1... | p03353 |
#!/usr/bin/env python3
import sys
import string
import itertools
def solve(s: str, K: int):
part_set = set()
for c in string.ascii_lowercase:
for i in range(len(s)):
if c == s[i]:
part_set |= set(itertools.accumulate(s[i:]))
if len(part_set) >= K:
... | #!/usr/bin/env python3
import sys
import string
import itertools
def solve(s: str, K: int):
part_set = set()
for c in string.ascii_lowercase:
for i in range(len(s)):
if c == s[i]:
part_set |= set(itertools.accumulate(s[i:min(i+K,len(s))]))
if len(part_... | p03353 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
... | p03353 |
S = input().strip()
K = int(input().strip())
unigram = sorted(set(S))
for u in unigram:
now_subset = set()
for i,c in enumerate(S):
if c != u: continue
for j in range(1,len(S)-i+1):
now_subset.add(S[i:i+j])
if len(now_subset) < K:
K -= len(now_subset)
else:
print((sorted(no... | S = input().strip()
K = int(input().strip())
unigram = sorted(set(S))
for u in unigram:
now_subset = set()
for i,c in enumerate(S):
if c != u: continue
for j in range(1,min(K,len(S)-i)+1):
now_subset.add(S[i:i+j])
if len(now_subset) < K:
K -= len(now_subset)
else:
print((so... | p03353 |
s = input()
k = int(input())
arr =[]
for i in range(len(s)):
for j in range(i,len(s)):
if s[i:j+1] != '' and s[i:j+1] not in arr:
arr.append(s[i:j+1])
def print_arr(arr):
for i in range(len(arr)):
print(arr[i],sep=" ",end="/")
print()
arr = sorted(arr)
print(arr[... | s = input()
k = int(input())
arr =[]
for i in range(len(s)):
for j in range(i,i+5):
if s[i:j+1] != '' and s[i:j+1] not in arr:
arr.append(s[i:j+1])
arr = sorted(arr)
def print_arr(arr):
for i in range(len(arr)):
print(arr[i],sep="",end="/")
print()
print(arr[k-1])
| p03353 |
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()
s = ns()
k = ni()
ans = []
for j in range(len(s)):
ans.append(s[j])
if j < len(s)-1:
t = j+2
while True:
ans.append(s[j... | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()
s = ns()
k = ni()
ans = []
for i in range(len(s)):
ans.append(s[i])
if i < len(s)-1:
t = i+2
while True:
ans.append(s[i... | p03353 |
from sys import stdin
from string import ascii_lowercase
def myfind(s, c):
result = []
for i, x in enumerate(s):
if x == c:
result.append(i)
return result
def main():
s = stdin.readline().rstrip()
K = int(stdin.readline().rstrip())
result = []
for x in... | from sys import stdin
from string import ascii_lowercase
def main():
s = stdin.readline().rstrip()
K = int(stdin.readline().rstrip())
result = []
for c in ascii_lowercase:
for text in sorted([s[i:] for i, x in enumerate(s) if x == c]):
for i in range(len(text)):
... | p03353 |
from sys import stdin
from string import ascii_lowercase
def main():
s = stdin.readline().rstrip()
K = int(stdin.readline().rstrip())
result = []
for c in ascii_lowercase:
for text in sorted([s[i:] for i, x in enumerate(s) if x == c]):
for i in range(len(text)):
... | from sys import stdin
def main():
s = stdin.readline().rstrip()
K = int(stdin.readline().rstrip())
result = set()
for c in sorted(list(set(s))):
for x in sorted([s[i:] for i, x in enumerate(s) if x == c]):
for y in [x[:j + 1] for j in range(len(x))]:
resul... | p03353 |
s=input()
K=eval(input())
l=len(s)
a=set()
for diff in range(1,l+1):
for i in range(l):
a.add(s[i:i+diff])
b=list(a)
b.sort()
print(b[K-1]) | s=input()
K=eval(input())
l=len(s)
a=set()
for diff in range(1,5+1):
for i in range(l):
a.add(s[i:i+diff])
b=list(a)
b.sort()
print(b[K-1])
| p03353 |
s = input().strip()
k = int(eval(input()))
subset = set()
for i in range(len(s)):
for j in range(i+1,len(s)+1):
subset.add(s[i:j])
subset = list(subset)
subset.sort()
print((subset[k-1])) | from bisect import insort
s = input().strip()
k = int(eval(input()))
sublist = []
for i in range(len(s)):
if len(sublist)>k:
sublist = sublist[:k]
for j in range(i+1,len(s)+1):
if s[i:j] not in sublist and (len(sublist)<k or sublist[k-1]>s[i:j]):
insort(sublist,s[i:j])
... | p03353 |
# -*- coding: utf-8 -*-
"""
C - K-th Substring
https://beta.atcoder.jp/contests/abc097/tasks/arc097_a
"""
import sys
from sys import stdin
input = stdin.readline
def solve(s, K):
l = len(s)
substrings = set()
pre_check = set()
for ch in s:
pre_check.add(ch)
pre_check = ... | # -*- coding: utf-8 -*-
"""
C - K-th Substring
https://beta.atcoder.jp/contests/abc097/tasks/arc097_a
"""
import sys
from sys import stdin
input = stdin.readline
def solve(s, K):
l = len(s)
substrings = []
for i in range(l):
for j in range(l+1):
t = s[i:j]
... | p03353 |
# -*- coding: utf-8 -*-
"""
C - K-th Substring
https://beta.atcoder.jp/contests/abc097/tasks/arc097_a
"""
import sys
from sys import stdin
input = stdin.readline
def solve(s, K):
l = len(s)
substrings = []
for i in range(l):
for j in range(l+1):
t = s[i:j]
... | # -*- coding: utf-8 -*-
"""
C - K-th Substring
https://beta.atcoder.jp/contests/abc097/tasks/arc097_a
"""
import sys
from sys import stdin
input = stdin.readline
def solve(s, K):
l = len(s)
substrings = set()
for i in range(l):
for j in range(i+K+1):
t = s[i:j]
... | p03353 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(1000000)
def main():
s = readline().rstrip().decode()
K = int(readline())
#sに含まれる文字を一文字ずつ抽出する.
#ここで抽出した文字を組み合わせて辞書順に文字列を構成していく
#K<=5だから高々26^5個の文字列を構成す... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(1000000)
def main():
s = readline().rstrip().decode()
K = int(readline())
#sに含まれる文字を一文字ずつ抽出する.
#ここで抽出した文字を組み合わせて辞書順に文字列を構成していく
#K<=5だから高々26^5個の文字列を構成す... | p03353 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(1000000)
def main():
s = readline().rstrip().decode()
K = int(readline())
#sに含まれる文字を一文字ずつ抽出する.
#ここで抽出した文字を組み合わせて辞書順に文字列を構成していく
#K<=5だから高々26^5個の文字列を構成す... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(1000000)
def main():
s = readline().rstrip().decode()
K = int(readline())
#sに含まれる文字を一文字ずつ抽出する.
#ここで抽出した文字を組み合わせて辞書順に文字列を構成していく
#K<=5だから高々26^5個の文字列を構成す... | p03353 |
s = list(input().rstrip())
k = int(eval(input()))
ans_list = []
for i in range(len(s)):
for j in range(i,len(s)+1):
a = s[i:j]
a = "".join(a)
ans_list.append(a)
ans_list = list(set(ans_list))
ans_list.sort()
print((ans_list[k]))
| s = list(input().rstrip())
k = int(eval(input()))
ans_list = []
for i in range(len(s)):
for j in range(i,len(s)+1):
a = s[i:j]
if len(a) > k:
break
a = "".join(a)
ans_list.append(a)
ans_list = list(set(ans_list))
ans_list.sort()
print((ans_list[k... | p03353 |
import sys
sys.setrecursionlimit(10**6)
if sys.platform in (['ios','darwin','win32']):
sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return [int(s) for s in input().split()]
S = input().rstrip()
N = len(S)
K = INT()
min_s = min(S)
B = [s for s ... | import sys
sys.setrecursionlimit(10**6)
if sys.platform in (['ios','darwin','win32']):
sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return [int(s) for s in input().split()]
S = input().rstrip()
N = len(S)
K = INT()
min_s = min(S)
B = [s for s ... | p03353 |
s= str(input().strip())
K= int(input().strip())
parts = []
for i in range(len(s)+1):
for j in range(i+1,len(s)+1):
flg = 0
if j-i > K:
break
for k in parts:
if s[i:j] == k:
flg = 1
if flg == 0:
parts.append(s[i:j])
... | s= str(input().strip())
K= int(input().strip())
parts = []
for i in range(len(s)+1):
for j in range(i+1,len(s)+1):
flg = 0
if j-i > K:
break
parts.append(s[i:j])
v = sorted(parts)
vv = [v[0]]
tmp = v[0]
for k in range(1,len(v)):
if v[k]!=tmp:
vv.append(v... | p03353 |
def 解():
sS = input().rstrip()
dsS = set()
for s in sS:
if s not in dsS:
dsS.add(s)
iK = int(eval(input()))
iL = len(sS)
iC = 0
for s in sorted(list(dsS)):
sDic = set()
indexes = []
for i in range(iL):
if sS[i] == s :
... | def 解():
sS = input().rstrip()
# dsS = set()
# for s in sS:
# if s not in dsS:
# dsS.add(s)
iK = int(eval(input()))
iL = len(sS)
iC = 0
# for s in sorted(list(dsS)):
for s in sorted(set(sS)):
d = set()
indexes = []
for i in range(iL):
... | p03353 |
s = input().strip()
k = int(eval(input()))
ss = []
for i in range(1, len(s) + 1):
for j in range(len(s) + 1 - i):
ss.append(s[j:j + i])
ss = list(set(ss))
ss.sort()
print((ss[k - 1])) | s = input().strip()
k = int(eval(input()))
ss = []
n = len(s)
for i in range(n):
for j in range(1, 6):
if i + j <= n:
ss.append(s[i:i + j])
ss = list(set(ss))
ss.sort()
print((ss[k - 1])) | p03353 |
s = input().strip()
k = int(eval(input()))
ss = []
n = len(s)
for i in range(n):
for j in range(1, 6):
if i + j <= n:
ss.append(s[i:i + j])
ss = list(set(ss))
ss.sort()
print((ss[k - 1])) | import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)... | p03353 |
s = input().strip()
K = int(eval(input()))
S = set()
for i in range(len(s)):
for w in range(1, K+1):
S.add(s[i:i+w])
print((sorted(S)[K-1]))
| s = input().strip()
K = int(eval(input()))
substr = set()
for i in range(len(s)):
for j in range(1, K+1):
substr.add(s[i:i+j])
print((sorted(substr)[K-1]))
| p03353 |
s = input()
K = int(input())
subs = set()
for i in range(len(s)):
for j in range(i, len(s)):
subs.add(s[i:j+1])
subs = list(subs)
subs.sort()
print(subs[K-1])
| s = input()
K = int(input())
subs = set()
for i in range(len(s)):
for j in range(i, i+K+1):
subs.add(s[i:j+1])
subs = list(subs)
subs.sort()
print(subs[K-1])
| p03353 |
from sys import stdin
s = stdin.readline().rstrip()
n = int(stdin.readline().rstrip())
li = []
for i in range(1,len(s)+1):
for j in range(len(s)-i+1):
li.append(s[j:j+i])
li = list(set(li))
li.sort()
print((li[n-1])) | from sys import stdin
s = stdin.readline().rstrip()
n = int(stdin.readline().rstrip())
li = []
for i in range(1,6):
for j in range(len(s)-i+1):
li.append(s[j:j+i])
li = list(set(li))
li.sort()
print((li[n-1])) | p03353 |
n=1000000
p=[1]*(n+1)
pr=[]
p[0],p[1]=0,0
for i in range(2,int(n**0.5)+1):
if p[i]:
for j in range(i*i,n,i):
p[j]=0
for i in range(2,n):
if p[i]:
pr.append(int(i))
while 1:
l=int(eval(input()))
if l==0:break
ans=-l
while l:
l-=1
... | import bisect
n=1000000
p=[1]*(n+1)
p[0],p[1]=0,0
for i in range(2,int(n**0.5)+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=0
p=[i for i in range(n+1) if p[i]==1]
while 1:
n=int(eval(input()))
ans=-n
if n==0:break
while n:
n-=1
a,m=list(map(... | p00165 |
import math
N=1000000
prime=[1]*(N+1)
prime[0]=0
prime[1]=0
for i in range(2,int(math.sqrt(N))):
if prime[i]==1:
j=i
while i*j<=N:
prime[i*j]=0
j+=1
prime=[i for i in range(N+1) if prime[i]==1]
while True:
n=eval(input())
if n==0:break
cnt=0
... | import math
import bisect
N=1000000
prime=[1]*(N+1)
prime[0]=0
prime[1]=0
for i in range(2,int(math.sqrt(N))):
if prime[i]==1:
j=i
while i*j<=N:
prime[i*j]=0
j+=1
prime=[i for i in range(N+1) if prime[i]==1]
while True:
n=eval(input())
if n==0:break
... | p00165 |
def prepare(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f = f * m % MOD
factorials.append(f)
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv = inv * m % MOD
invs[m - 1] = inv
return fa... | def prepare(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f = f * m % MOD
factorials.append(f)
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv = inv * m % MOD
invs[m - 1] = inv
return fa... | p03832 |
def main():
mod = 10**9+7
inv_n = [0]*1001
nCr = [[1]*(i+1) for i in range(1001)]
for i in range(1001):
inv_n[i] = pow(i, mod-2, mod)
for i in range(2, 1001):
for j in range(1, i):
nCr[i][j] = (nCr[i-1][j-1]+nCr[i-1][j]) % mod
n, a, b, c, d = list(map(int, in... | def main():
mod = 10**9+7
inv_n = [0]*1001
nCr = [[1]*(i+1) for i in range(1001)]
for i in range(1001):
inv_n[i] = pow(i, mod-2, mod)
for i in range(2, 1001):
for j in range(1, i):
nCr[i][j] = (nCr[i-1][j-1]+nCr[i-1][j]) % mod
n, a, b, c, d = list(map(int, in... | p03832 |
def main():
a, b = list(map(int, input().split()))
l = []
for i in range(2, 1001):
h = 0
for j in range(1, i):
h = h + j
l.append(h)
for i in range(len(l) - 1):
if l[i] - a == l[i + 1] - b:
print((l[i] - a))
break
if... | def main():
a, b = list(map(int, input().split()))
l = []
for i in range(2, 1001):
h = 0
for j in range(1, i):
h = h + j
l.append(h)
for i in range(len(l) - 1):
if l[i] - a == l[i + 1] - b:
print((l[i] - a))
break
de... | p03328 |
a, b = list(map(int, input().split()))
l = 0
for i in range(1, 999):
l += i
r = l + i + 1
if r - l == b - a:
print((l - a))
| a, b = list(map(int, input().split()))
l = 0
for i in range(1, 999):
l += i
if i + 1 == b - a:
print((l - a))
break | p03328 |
a,b=list(map(int,input().split()))
lis=[1]
for i in range(2,1000):
lis.append(lis[-1]+i)
i=0
while True:
if a in lis and lis[lis.index(a)+1]==b:
print(i)
break
a+=1
b+=1
i+=1 | a,b=list(map(int,input().split()))
print(((b-a)*(b-a+1)//2-b)) | p03328 |
import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(10000)
# Debug output
def chkprint(*args):
names = {id(v):k for k,v in list(inspect.currentframe().f_back.f_locals.items())}
print((', '.join(names.get(id(arg),'?... | import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(10000)
# Debug output
def chkprint(*args):
names = {id(v):k for k,v in list(inspect.currentframe().f_back.f_locals.items())}
print((', '.join(names.get(id(arg),'?... | p03328 |
a,b = list(map(int,input().split()))
tower_list = [[1,3]]
for i in range(3,999):
tower_list.append([tower_list[i-3][1],tower_list[i-3][1]+i])
i=0
while(True):
ab_list = [a+i,b+i]
if(ab_list in tower_list):
print(i)
exit()
i += 1
| a,b = list(map(int,input().split()))
print((int((b-a)*(b-a+1)/2-b)))
| p03328 |
a, b = list(map(int, input().split()))
y = []
p = 0
for i in range(1, 1000):
p += i
y.append(p)
for x in range(1, 499501):
for i in range(1, 999):
if y[i] == b + x and y[i - 1] == a + x:
print(x)
break
else: # 内側のforのelse節は内側ループが全部まわり切ったら実行される、つまり前の行のbreak... | a, b = list(map(int, input().split()))
y = []
p = 0
for i in range(1, 1000):
p += i
y.append(p)
c = b - a
for i in range(1, 999):
if y[i] - y[i - 1] == c:
print((y[i] - b))
break | p03328 |
a,b = list(map(int,input().split()))
print((((a-b)**2 -a-b)//2)) | a,b = list(map(int,input().split()))
print(((b-a)*(b-a-1)//2-a)) | p03328 |
a,b = list(map(int, input().split()))
print(((b-a)*(b-a+1)//2-b)) | a,b = list(map(int ,input().split()))
ans = 0
for i in range(1,b-a):
ans += i
print((ans-a)) | p03328 |
a, b = (int(i) for i in input().split())
print((sum(range(b-a))-a)) | a, b = (int(i) for i in input().split())
c = b - a
d = c*(c+1)//2
print((d - b))
| p03328 |
a,b=list(map(int,input().split()));print((sum(range(b-a))-a)) | a,b=list(map(int,input().split()));k=b-a;print((-~k*k//2-b)) | p03328 |
a,b = list(map(int,input().split()))
n = b - a
tmp = int(1/2*n*(n+1))
print((tmp - b))
| a,b = list(map(int,input().split()))
n = b-a
tmp = n*(n+1)//2
ans = tmp - b
print(ans) | p03328 |
a, b = [int(x) for x in input().split()]
n = b-a-1
An = n*(n+1)//2
print((An-a)) | a, b = [int(x) for x in input().split()]
s = ss = 0
for i in range(1000):
s += i
if s-ss == b-a:
break
ss = s
print((s-b)) | p03328 |
a, b = list(map(int, input().split()))
dif = b - a
sum = int(dif / 2 * (1 + dif))
print((sum - b)) | a, b = list(map(int, input().split()))
x = int((b - a) * (b - a + 1) / 2 - b)
print(x) | p03328 |
a, b = list(map(int, input().split()))
for n in range(1, 1000):
h1 = n*(n+1)//2
h2 = (n+1)*(n+2)//2
for x in range(1, h2+1):
if h1 - x == a and h2 - x == b:
print(x)
exit(0) | a, b = list(map(int, input().split()))
for n in range(1, 1000):
h1 = n*(n+1)//2
h2 = (n+1)*(n+2)//2
if h1 - a == h2 - b:
print((h1-a))
break | p03328 |
a,b = (int(i) for i in input().split())
tower = [sum(range(1, i+1)) for i in range(1,1000)]
print((tower[b-a-1]-b)) | a,b = (int(i) for i in input().split())
print(([sum(range(1, i+1)) for i in range(1,1000)][b-a-1]-b)) | p03328 |
a,b=[int(x) for x in input().split()]
temp=b-a
print((temp*(temp+1)//2-b)) | a,b=list(map(int,input().split()))
n=abs(b-a)
val=int(n*(n+1)/2)
print((val-b)) | p03328 |
icase=0
if icase==0:
import sys
a,b=list(map(int,input().split()))
for i in range(1,999):
isum=(i*(i+1))//2-a
for j in range(i,1000):
jsum=(j*(j+1))//2-b
if jsum==isum and 1<=jsum and j==i+1:
print(jsum)
sys.exit()
| icase=0
if icase==0:
a,b=list(map(int,input().split()))
n=b-a-1
print((n*(n+1)//2-a))
| p03328 |
# -*- coding: utf-8 -*-
a, b = list(map(int, input().split()))
# 本来の各柱の高さリスト
columns = [(i ** 2 + i) // 2 for i in range(1, 1000)]
for i in range(998):
ab = columns[i+1] - columns[i]
# 本来の柱と今見えている柱で差が一致する所を探す
if ab == b - a:
print((columns[i] - a))
exit() | # -*- coding: utf-8 -*-
a, b = list(map(int, input().split()))
# 計算で全部出せるとfor文回さなくて済む
ans = (b - a - 1) * (b - a) // 2 - a
print(ans) | p03328 |
a,b = list(map(int,input().split()))
c = b-a
for i in range(1,999):
x= (i+1)*i//2
y= (i+2)*(i+1)//2
if y-x == c:
print((x-a))
break | a,b = list(map(int,input().split()))
c = b-a
print(((c+1)*c//2-b)) | p03328 |
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: li... | import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: li... | p03328 |
a,b = list(map(int, input().split()))
polls = []
for i in range(1,1000):
polls.append(sum(list(range(1,1000))[:i]))
d = {}
for i in range(1, len(polls)):
d[polls[i]-polls[i-1]] = [polls[i-1],polls[i]]
print((d[b-a][0] - a))
| a,b = list(map(int, input().split()))
print(((b-a)*(b-a+1)//2 - b)) | p03328 |
#Stone Monument
a,b = list(map(int, input().split()))
M = []
ans = []
for i in range(1,1000,1):
n = 1/2*i*(i+1)
M.append(n)
for i in range(0,999,1):
n = int(i*(i+1)/2)
for j in range(0,n,1):
if (a + j == M[i]) and (b + j == M[i+1]):
print(j)
exit()
| #Stone Monument
a,b = list(map(int, input().split()))
M = []
for i in range(1,1000,1):
n = 1/2*i*(i+1)
M.append(n)
n = b-a-1
print((int(M[n-1]-a))) | p03328 |
a,b = list(map(int,input().split()))
d = b-a
b_len = d*(d+1)//2
print((b_len - b)) | a,b = list(map(int,input().split()))
s = 0
for n in range(1000):
if b-a == n:
print((s-a))
break
s += n | p03328 |
a, b = list(map(int, input().split()))
l = []
t = 0
i = 1
while i <= 999:
t += i
l.append(t)
i += 1
def f():
for i in range(1, 499500):
for j in range(len(l)-1):
if a + i == l[j] and b + i == l[j+1]:
return i
print((f())) | a, b = list(map(int, input().split()))
diff = b - a
b_2 = (diff + 1) * diff // 2
print((b_2 - b)) | p03328 |
a,b = list(map(int, input().split()))
t = [1,]
flag = 0
for i in range(1000):
t.append((i+2)+ t[i])
for j in range(len(t)):
for k in range(499500):
if t[j] - k == a and t[j+1] - k == b:
print(k)
flag = 1
if flag == 1:break
if flag == 1: break | a,b = list(map(int, input().split()))
t = [1,]
for i in range(1000):
t.append((i+2)+ t[i])
for j in range(len(t)):
if t[j] - a == t[j+1] - b:
print((t[j] - a))
break | p03328 |
a,b = list(map(int,input().split( )))
ans = 0
ans2 = 0
i = 1
while a > ans:
ans = ans + i
i += 1
ans2 = ans + (i)
while True:
if (ans-a) == (ans2-b):
print((ans-a))
break
else:
ans = ans-(i-1)
ans2 = ans-i | a,b = list(map(int,input().split( )))
c = b-a
d = 0
i = 1
ans = 0
while c > i:
d = d+i
i += 1
ans = d-a
print(ans)
| p03328 |
a, b = list(map(int, input().split()))
out = 0
for i in range(b-a):
out += i+1
print((out-b)) | a, b = list(map(int, input().split()))
num = b - a
print((((1+num)*num)//2 - b)) | p03328 |
a,b=list(map(int,input().split()))
s=0
for i in range(b-a+1):
s=s+i
print((s-b)) | a,b=list(map(int,input().split()))
n=b-a
print((n*(n+1)//2-b))
| p03328 |
# -*- coding: utf-8 -*-
a, b = list(map(int, input().split()))
def tower(i):
h = 0
for i in range(1, i+1):
h += i
return h
notFound = True
i = 0
while(notFound):
i += 1
for j in range(1,1000):
if (tower(j)-i==a )and(tower(j+1)-i==b):
# print("Found")
... | # -*- coding: utf-8 -*-
a, b = list(map(int, input().split()))
def tower(i):
h = 0
for i in range(1, i+1):
h += i
return h
delta = b - a
print((tower(delta) - b))
| p03328 |
def anotherpair(x, y):
l = []
c=1
for i in range(x, y+1):
if c==0:
l.append([i, i-1])
c=0
return l
n, a, b = list(map(int, input().split()))
if n==1:
if a==b:
ans = 1
else:
ans = 0
else:
if a>b:
ans = 0
... | n, a, b = list(map(int, input().split()))
if n==1:
if a==b:
ans = 1
else:
ans = 0
else:
if a>b:
ans = 0
else:
ans = ((n-2)*b-(n-2)*a)+1
print(ans) | p03705 |
import sys
input = sys.stdin.readline
from collections import *
N, A, B = list(map(int, input().split()))
if A>B:
print((0))
exit()
if N==1 and A!=B:
print((0))
exit()
low = A+B+(N-2)*A
high = A+B+(N-2)*B
print((high-low+1)) | import sys
input = sys.stdin.readline
from collections import *
N, A, B = list(map(int, input().split()))
if A>B:
print((0))
exit()
m = B+A*(N-1)
M = A+B*(N-1)
print((max(0, M-m+1))) | p03705 |
n, a, b = list(map(int, input().split()))
M = b*(n-1)+a
m = b+a*(n-1)
print((max(M-m+1, 0)))
| n, a, b = list(map(int, input().split()))
m = a*(n-1)+b
M = a+(n-1)*b
ans = max(M-m+1, 0)
print(ans)
| p03705 |
N, A, B = list(map(int, input().split()))
if N == 1:
if A == B:
ans = 1
else:
ans = 0
elif A > B:
ans = 0
else:
ans = (B - A) * (N - 2) + 1
print(ans) | N, A, B = list(map(int, input().split()))
ans = (N - 2) * B - (N - 2) * A + 1
ans = max(ans, 0)
print(ans) | p03705 |
import itertools
n,a,b = [int(x) for x in input().split()]
r = list(range(a,b+1))
tmp = []
ans = 0
if a == b:
print((1))
elif n == 1:
print((0))
else:
for v in itertools.combinations_with_replacement(r, n-2):
if not sum(v) in tmp:
ans += 1
tmp.append(sum(v))
... | n,a,b = [int(x) for x in input().split()]
if a > b:
print((0))
elif n == 1:
if a != b:
print((0))
else:
print((1))
else:
print(((b-a)*(n-2)+1)) | p03705 |
def main():
N, A, B = (int(i) for i in input().split())
if (N == 1 and A != B) or (B - A < 0):
print((0))
elif N == 1:
print((1))
elif N == 2:
print((1))
else:
print(((N-2)*B - (N-2)*A + 1))
if __name__ == '__main__':
main()
| def main():
N, A, B = (int(i) for i in input().split())
if (N == 1 and A != B) or (B - A < 0):
print((0))
elif N == 1:
print((1))
else:
print(((N-2)*B - (N-2)*A + 1))
if __name__ == '__main__':
main()
| p03705 |
N,A,B = list(map(int,input().split()))
if A>B or (N==1 and A!=B): print((0))
elif A==B or N==2: print((1))
else:
N-=2
print((B*N-A*N+1)) | N,A,B = list(map(int,input().split()))
if (N==1 and A!=B) or B-A<0:print((0))
else: print(((A-B)*(2-N)+1)) | p03705 |
n, a, b = list(map(int, input().split()))
if a > b:
print((0))
exit()
elif a == b:
print((1))
exit()
elif n == 1 and b - a > 0:
print((0))
exit()
elif n == 2:
print((1))
exit()
else:
mid_num = n - 2
num_num = b - a + 1
ans = 0
for i in range(mid_num-1):
... | n, a, b = list(map(int, input().split()))
if a > b:
print((0))
exit()
elif a == b:
print((1))
exit()
elif n == 1 and b - a > 0:
print((0))
exit()
elif n == 2:
print((1))
exit()
else:
mid_num = n - 2
num_num = b - a + 1
ans = 0
ans += (num_num-1) * (mid_nu... | p03705 |
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, a, b = list(map(int, input().split()))
mi = a * (n - 1) + b
ma = a + b * (n - 1)
print((max(0, ma - mi + 1)))
if __name__ == '__main__':
resolve()
| import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, a, b = list(map(int, input().split()))
mi = a * (n - 1) + b
ma = b * (n - 1) + a
print((max(0, ma - mi + 1)))
if __name__ == '__main__':
resolve()
| p03705 |
N, A, B = list(map(int,input().split()))
min = 0
max = 0
for i in range(0, N - 1):
min += A
max += B
if (max + A) - (min + B) + 1 < 0:
print("0")
else:
print(((max + A) - (min + B) + 1)) | N, A, B = list(map(int,input().split()))
min = A * (N - 1) + B
max = B * (N - 1) + A
if (max - min) + 1 < 0:
print("0")
else:
print(((max - min) + 1)) | p03705 |
N, A, B = list(map(int,input().split()))
if N == 1:
print((1 if A==B else 0))
else:
if A > B:
print((0))
else:
m = A*(N-1)+B
M = B*(N-1)+A
print((M-m+1))
| N, A, B = list(map(int,input().split()))
if A > B:
print((0))
exit(0)
if N == 1:
if A != B:
print((0))
else:
print((1))
else:
print(((N-1)*B+A-(N-1)*A-B+1))
| p03705 |
n,a,b=list(map(int,input().split()))
if a>b:
print((0))
elif n==1:
if a==b:
print((1))
else:
print((0))
else:
print((b*(n-1)+a - a*(n-1) - b + 1)) | n,a,b=list(map(int,input().split()))
print((max(0,(n-2)*(b-a)+1))) | p03705 |
n,a,b=list(map(int,input().split()))
print((max(0,(n-2)*(b-a)+1))) | n,a,b=list(map(int,input().split()))
n-=2;print((max(b*n-a*n+1,0))) | p03705 |
n, a, b = list(map(int, input().split()))
if n == 0 or b < a or (n == 1 and a != b):
print((0))
elif n == 1 and a == b:
print((1))
else:
print((1+(b-a)*(n-2))) | n, a, b = list(map(int, input().split()))
print((max(1+(b-a)*(n-2),0))) | p03705 |
N,A,B = list(map(int,input().split()))
print((max((N-1)*B+A-(N-1)*A-B+1,0))) | N,A,B = list(map(int,input().split()))
if A>B:
ans = 0
elif N==1 and A!=B:
ans = 0
elif N==1 and A==B:
ans = 1
else:
ans = (N-2)*(B-A)+1
print(ans) | p03705 |
n,a,b=list(map(int, input().split()))
pot = b-a+1
if(b<a):
print((0))
exit()
if n==0:
print((0))
elif n==1:
if a==b:
print((1))
else:print((0))
elif n==2:
if a==b:print((1))
print((1))
else:
k = n-2
ans=0
for i in range(k):
ans+=pot
po... | n,a,b=list(map(int, input().split()))
pot = b-a+1
if(b<a):
print((0))
exit()
if n==0:
print((0))
elif n==1:
if a==b:
print((1))
else:print((0))
elif n==2:
if a==b:print((1))
print((1))
else:
k = n-1
m = k*b
high = m+a
low = a*k + b
print((high-l... | p03705 |
n,a,b=list(map(int,input().split()))
if a>b or n<2and a<b:
print((0))
else:
print(((n-2)*(b-a)+1)) | n,a,b=list(map(int,input().split()));print((max((n-2)*(b-a)+1,0))) | p03705 |
N, A, B = list(map(int, input().split()))
if A > B:
print((0))
elif A == B:
print((1))
else:
if N == 1:
if A != B:
print((0))
else:
print((1))
else:
print(((N - 2) * (B - A) + 1)) | n, a, b = list(map(int, input().split()))
ans = max(0, b * (n - 1) + a - (b + a * (n - 1)) + 1)
print(ans) | p03705 |
n,a,b = list(map(int,input().split()))
if n == 1 and a == b:
print((1))
elif (n == 1 and a != b) or a > b:
print((0))
else:
print(((n-1)*b+a-((n-1)*a+b)+1)) | n,a,b = list(map(int, input().split()))
if n == 1 and a==b:
print((1))
elif n == 1 or a > b:
print((0))
else:
print(((n-2)*(b-a)+1)) | p03705 |
N, A, B = list(map(int, input().split()))
if N == 1:
if A == B:
print((1))
else:
print((0))
elif A > B:
print((0))
else:
c = 0
for _ in range(N-2):
c += (B-A)
print((c+1))
| N, A, B = list(map(int, input().split()))
if N == 1:
if A == B:
print((1))
else:
print((0))
elif A > B:
print((0))
else:
print(((B-A)*(N-2)+1)) | p03705 |
def main():
n, a, b = list(map(int, input().split()))
if (n == 1 and a != b) or (b < a):
print((0))
exit()
mini = a * (n - 1) + b
maxi = a + b * (n - 1)
print((maxi - mini + 1))
if __name__ == '__main__':
main()
| def main():
n, a, b = list(map(int, input().split()))
print((0 if (n == 1 and a != b) or a > b else (b - a) * (n - 1) + a - b + 1))
if __name__ == '__main__':
main()
| p03705 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.