input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
X, A = list(map(int, input().split()))
if X < A:
print((0))
else:
print((10))
| X, A = list(map(int, input().split()))
if X < A:
print('0')
else:
print('10')
| p02999 |
import sys
from math import ceil
def input():
return sys.stdin.readline().strip()
def iinput():
return int(eval(input()))
def finput():
return float(eval(input()))
def tinput():
return input().split()
def rinput():
return list(map(int, tinput()))
def rlinput():
return li... | from sys import stdin
n=input().split(' ')
if(int(n[0])>=int(n[1])):
print('10')
else:
print('0') | p02999 |
x,a = list(map(int, input().split()))
if x <a:
print('0')
elif x >= a:
print('10') | x,a = list(map(int, input().split()))
print(('0' if x<a else '10')) | p02999 |
X,A = list(map(int, input().split()))
if X<A:
print((0))
if X>=A:
print((10))
| x,a = list(map(int, input().split()))
if x<a:
print((0))
else:
print((10)) | p02999 |
X,A=list(map(int,input().split()))
print((10*(X>=A))) | X,A=list(map(int,input().split()))
print(("0" if X<A else "10")) | p02999 |
X, A = list(map(int,input().split()))
print((0 if X < A else 10)) | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
X, A = lr()
print((0 if X < A else 10))
# | p02999 |
x, a = list(map(int, input().split()))
print((0 if x < a else 10)) | x, a = list(map(int, input().split()))
print((10 if x >= a else 0)) | p02999 |
x,a = list(map(int,input().split()))
if x <a:
print((0))
else:
print((10)) | x,a = list(map(int,input().split()))
if x < a:
print('0')
else:
print('10') | p02999 |
x, a = map(int, input().split())
print('0') if x < a else print('10')
cons = 10 ** 7
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
... | x, a = list(map(int, input().split()))
if x < a:
print((0))
else:
print((10)) | p02999 |
n=input().split()
if n[0]<n[1]:
print('0')
else:
print('10') | x,a=list(map(int,input().split()))
if x < a:
print((0))
else:
print((10))
| p02999 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
5 4
0 1
1 2
2 3
3 4
output:
1
2
3
"""
import sys
sys.setrecursionlimit(int(3e6))
UNVISITED, VISITED_IN_STACK, POPPED_OUT = 0, 1, 2
def generate_adj_table(_v_info):
for v_detail in _v_info:
v_from, v_to = map(int, v_det... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
5 4
0 1
1 2
2 3
3 4
output:
1
2
3
"""
import sys
sys.setrecursionlimit(int(3e6))
UNVISITED, VISITED_IN_STACK, POPPED_OUT = 0, 1, 2
def generate_adj_table(_v_info):
for v_detail in _v_info:
v_from, v_to = map(int, v_det... | p02366 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
5 4
0 1
1 2
2 3
3 4
output:
1
2
3
"""
import sys
sys.setrecursionlimit(int(1e6))
def generate_adj_table(_v_info):
for v_detail in _v_info:
source, target = map(int, v_detail)
init_adj_table[source].append(targe... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
5 4
0 1
1 2
2 3
3 4
output:
1
2
3
"""
import sys
sys.setrecursionlimit(int(1e6))
def generate_adj_table(_v_info):
for v_detail in _v_info:
source, target = map(int, v_detail)
init_adj_table[source].append(targe... | p02366 |
import sys
sys.setrecursionlimit(100000)
def dfs(v, tm):
dts[v] = est[v] = tm + 1
child = 0
for i in adj[v]:
if est[i] == float('inf'):
child += 1
parents[i] = v
dfs(i, tm + 1)
est[v] = min(est[v], est[i])
if parents[v] i... | from sys import stdin
import sys
from math import isinf
INF = float("inf")
sys.setrecursionlimit(100000)
def dfs(v, tm):
dts[v] = est[v] = tm + 1
child = 0
for i in adj[v]:
if isinf(est[i]):
child += 1
parents[i] = v
dfs(i, tm + 1)
est[v] ... | p02366 |
a = int(eval(input()))
print((48 - a)) | m = int(eval(input()))
print((48-m)) | p03473 |
print((48-int(eval(input())))) | m=int(eval(input()))
print((48-m)) | p03473 |
m = int(eval(input()))
print((24 - m + 24))
| m = int(eval(input()));print((48 - m))
| p03473 |
print((24*2-int(eval(input())))) | print((48-int(eval(input()))))
| p03473 |
print((48-int(eval(input())))) | m=int(eval(input()))
print((48-m)) | p03473 |
M = int(eval(input()))
ans = 48-M
print(ans) | def solve():
M = int(eval(input()))
ans = 48-M
return ans
print((solve())) | p03473 |
print(((24-int(eval(input())))+24)) | print((48-int(eval(input())))) | p03473 |
print(-eval(input())+48) | print((48-int(eval(input())))) | p03473 |
print((48 - int(eval(input())))) | m = int(eval(input()))
print((24 + 24 - m)) | p03473 |
a=int(eval(input()))
print((48-a)) | print((48-int(eval(input())))) | p03473 |
M = int(eval(input()))
print((48-M)) | print((48 - int(eval(input())))) | p03473 |
#coding: utf-8
a = int(eval(input()))
print((24 - a + 24)) | #coding: utf-8
a = int(eval(input()))
print(((24 - a) + 24)) | p03473 |
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), (0, -1), (-1, -1)]
d... | p03087 |
N, Q = list(map(int, input().split()))
string = input()
a = []
for i in range(Q):
a.append(list(map(int, input().split())))
test_dict = {}
for j, temp in enumerate(a):
#print(temp)
str_sub = string[temp[0]-1:temp[1]]
#print('j',j)
if j == 0:
test_dict[str_sub] = str_sub.count('AC'... | N, Q = list(map(int, input().split()))
string = input()
cnt = [0]
for i in range(N):
# print(i)
# print(string[i-2:i])
# if i == 0:
# cnt.append(0)
# continue
if string[i-1:i+1] == 'AC':
cnt.append(cnt[i]+1)
continue
cnt.append(cnt[i])
for j in range(Q):
... | p03087 |
from sys import stdin
import math
import itertools
import re
import sys
sys.setrecursionlimit(10**8)
def makeIntMatrix(lines):
intMatrix = []
for a in makeStringMatrix(lines):
intMatrix.append([int(b) for b in a])
return intMatrix
def makeStringMatrix(lines):
stringMatrix... | from sys import stdin
import math
import itertools
import re
import sys
sys.setrecursionlimit(10**8)
def makeIntMatrix(lines):
intMatrix = []
for a in makeStringMatrix(lines):
intMatrix.append([int(b) for b in a])
return intMatrix
def makeStringMatrix(lines):
stringMatrix... | p03087 |
N, Q = [int(i) for i in input().strip().split()]
S = input().strip()
pre = ''
hit = []
for i, s in enumerate(S):
if pre=='A' and s=='C':
hit.append(i)
pre = s
for _ in range(Q):
l, r = [int(i) for i in input().strip().split()]
print((sum([1 for h in hit if l<=h<r])))
| N, Q = [int(i) for i in input().strip().split()]
S = input().strip()
hit = [0]*(N+1)
for i in range(N):
hit[i+1] = hit[i] + (1 if S[i:i+2]=='AC' else 0)
for _ in range(Q):
l, r = [int(i) for i in input().strip().split()]
print((hit[r-1]-hit[l-1])) | p03087 |
# ABC122C - GeT AC
import sys
input = sys.stdin.readline
n, q = list(map(int, input().rstrip().split()))
s = input().rstrip()
arr = [list(map(int, input().rstrip().split())) for _ in range(q)]
cnt = [0] * (n - 1)
for i in range(n - 1):
if s[i : i + 2] == "AC":
cnt[i] += 1
for i, j in arr:
p... | # ABC122C - GeT AC
import sys
input = sys.stdin.readline
n, q = list(map(int, input().rstrip().split()))
s = input().rstrip()
arr = [list(map(int, input().rstrip().split())) for _ in range(q)]
cnt = [0] * (n + 1)
for i in range(n):
if s[i : i + 2] == "AC":
cnt[i + 1] = cnt[i] + 1
else:
... | p03087 |
# ABC122C - GeT AC
n, q = list(map(int, input().rstrip().split()))
s = input().rstrip()
arr = [list(map(int, input().rstrip().split())) for _ in range(q)]
cnt = [0] * (n + 1)
for i in range(n):
if s[i : i + 2] == "AC":
cnt[i + 1] = cnt[i] + 1
else:
cnt[i + 1] = cnt[i]
for i, j in arr:
... | # ABC122C - GeT AC
import sys
input = sys.stdin.readline
def main():
n, q = list(map(int, input().rstrip().split()))
s = input().rstrip()
arr = tuple(tuple(map(int, input().split())) for _ in range(q))
cnt = [0] * (n + 1)
for i in range(n):
if s[i : i + 2] == "AC":
... | p03087 |
# coding: utf-8
list1 = input().split()
String = input()
lr_list = []
q = int(list1[1])
for x in range(q):
item_list = input().split()
lr_list.append(item_list)
str_list = []
for x in range(q):
l = int(lr_list[x][0]) -1
r = int(lr_list[x][1])
l = int(l)
r = int(r)
... | # coding: utf-8
list1 = input().split()
String = input()
lr_list = []
q = int(list1[1])
for x in range(q):
item_list = input().split()
lr_list.append(item_list)
str_list = []
l = int(lr_list[x][0]) -1
r = int(lr_list[x][1])
string_item = String[l:r]
print(string_ite... | p03087 |
N,Q = map(int,input().split())
S = input()
ansLis = [0]
line = ""
for i in range(N):
line += S[i]
ansLis.append(line.count("AC"))
# print(ansLis)
ans = []
for _ in range(Q):
l,r = map(int,input().split())
num = ansLis[r] - ansLis[l]
# if S[l-2] == "A" and S[l-1] == "C":
# nu... | N,Q = map(int,input().split())
S = input()
ansLis = [0]
tmp = 0
flgA = False
for i in range(N):
if flgA and S[i]=="C":
tmp += 1
ansLis.append(tmp)
flgA = (S[i] == "A")
# print(ansLis)
ans = []
for _ in range(Q):
l,r = map(int,input().split())
num = ansLis[r] - ansLis[l]
... | p03087 |
import sys
from collections import deque
def resolve():
input=sys.stdin.readline
N,Q=list(map(int,input().rstrip().split()))
S=list(input().rstrip())
R=[list(map(int,input().rstrip().split())) for _ in range(Q)]
cumsum=[0 for i in range(N)]
_S=deque(S)
T=""
for i in range(N... | import sys
from collections import deque
def resolve():
input=sys.stdin.readline
N,Q=list(map(int,input().rstrip().split()))
S=list(input().rstrip())
R=[list(map(int,input().rstrip().split())) for _ in range(Q)]
cumsum=[0 for i in range(N)]
_S=deque(S)
prevT=_S.popleft()
fo... | p03087 |
n,q = map(int,input().split())
s = list(input())
ans = []
for i in range(q):
l,r = map(int,input().split())
a = ''.join(s[l-1:r])
ans.append(a.count('AC'))
[print(i) for i in ans]
| n,q = map(int,input().split())
s = input()
dp = [0]*(n+1)
ans = []
for i in range(n):
dp[i+1] = dp[i]+(1 if s[i:i+2]=='AC' else 0)
for i in range(q):
l,r = map(int,input().split())
ans.append(dp[r-1]-dp[l-1])
[print(i) for i in ans]
| p03087 |
N, Q = map(int, input().split())
S = input()
LR = [list(map(int, input().split())) for _ in range(Q)]
ans = [S[LR[i][0]-1:LR[i][1]].count('AC') for i in range(Q)]
print(*ans, sep='\n')
| N, Q = map(int, input().split())
S = input()
LR = [list(map(int, input().split())) for _ in range(Q)]
t = [0] * (N+1)
for i in range(N):
t[i+1] = t[i] + (1 if S[i: i+2] == 'AC' else 0)
ans = [t[LR[i][1] - 1] - t[LR[i][0] - 1] for i in range(Q)]
print(*ans, sep='\n')
| p03087 |
import sys
input = sys.stdin.readline
def ii(): return int(eval(input()))
def mi(): return list(map(int, input().rstrip().split()))
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template
N, Q = mi()
# print(N, Q)
S = li()
Alist = []
for i in range(N ... | import sys
input = sys.stdin.readline
def ii(): return int(eval(input()))
def mi(): return list(map(int, input().rstrip().split()))
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template
N, Q = mi()
# print(N, Q)
S = li()
Alist = []
for i in range(N ... | p03087 |
def solve():
n, q = map(int, input().split())
s = input()
lrs = list(list(map(int, input().split())) for _ in range(q))
ans = [s[l - 1:r].count("AC") for l, r in lrs]
print(*ans, sep="\n")
if __name__ == "__main__":
solve()
| def solve():
n, q = map(int, input().split())
s = input()
lrs = list(list(map(int, input().split())) for _ in range(q))
# ans = [s[l - 1:r].count("AC") for l, r in lrs]
c = [0] * n
for i in range(1, n):
c[i] = c[i - 1]
if s[i - 1] == "A" and s[i] == "C":
c[i]... | p03087 |
import sys
N,Q = list(map(int,sys.stdin.readline().rstrip().split()))
S = sys.stdin.readline().rstrip()
lr = [list(map(int,sys.stdin.readline().rstrip().split())) for _ in range(Q)]
for i in lr:
print((S[i[0]-1:i[1]].count("AC")))
| import sys
N,Q = list(map(int,sys.stdin.readline().rstrip().split()))
S = sys.stdin.readline().rstrip()
D = [0]
DD = 0
for i in range(1,len(S)):
if S[i-1] + S[i] == "AC":
DD += 1
D.append(DD)
for _ in range(Q):
l,r = list(map(int,sys.stdin.readline().rstrip().split()))
print((D[r-1]- D[l-1]))
... | p03087 |
import sys
def inp():
return sys.stdin.readline().strip()
n, q = list(map(int, inp().split()))
s = inp()
a = []
for i in range(n - 1):
if s[i:i+2] == 'AC':
a.append(1)
else:
a.append(0)
for _ in range(q):
l, r = list(map(int, inp().split()))
print((sum(a[l-1:... | import sys
def inp():
return sys.stdin.readline().strip()
n, q = list(map(int, inp().split()))
s = inp()
a = [0] * n
for i in range(1, n):
if s[i-1] == 'A' and s[i] == 'C':
a[i] = a[i-1] + 1
else:
a[i] = a[i-1]
for _ in range(q):
l, r = list(map(int, inp().split()... | p03087 |
N, Q = input().strip().split(' ')
S = input().strip()
for i in range(int(Q)):
l, r = tuple(map(int, input().strip().split(' ')))
print((S[l-1:r].count('AC')))
| dd = input().strip().split(' ')
N, Q = tuple(map(int, dd))
S = input().strip()
ac_indicies = []
cp = S.find('AC')
while cp != -1:
ac_indicies.append(cp)
cp = S.find('AC', cp + 1)
min_i = 0
ac = ac_indicies + [N]
l_index = []
for i in range(N):
if i > ac[min_i]:
min_i += 1
l_ind... | p03087 |
def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]
n, q = read_line(int, int)
s, = read_line(str)
m = [0 for _ in range(len(s) + 1)]
c = 0
for i in range(len(s)):
if s[i:i+2] == 'AC':
c += 1
m[i + 1] = c
for i in range(q):
l, r = read_line(int, int)
l... | def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]
n, q = read_line(int, int)
s, = read_line(str)
m = [0 for _ in range(len(s) + 1)]
c = 0
for i in range(len(s)):
if s[i:i+2] == 'AC':
c += 1
m[i + 1] = c
for i in range(q):
l, r = read_line(int, int)
... | p03087 |
n, q = map(int, input().split())
s = input()
ans = [0] * q
for i in range(q):
l, r = map(int, input().split())
substr = str(s[l - 1:r])
ans[i] = substr.count("AC")
print(*ans, sep='\n')
| n, q = map(int, input().split())
s = input()
cum = [0] * (n + 1)
for i in range(2, n + 1):
cum[i] = cum[i - 1]
if s[i - 2:i] == "AC":
cum[i] += 1
ans = [0] * q
for i in range(q):
l, r = map(int, input().split())
ans[i] = cum[r] - cum[l]
print(*ans, sep='\n')
| p03087 |
import bisect
import re
import sys
N, Q = list(map(int, input().split()))
S = sys.stdin.readline()
P = [list(map(int, sys.stdin.readline().split())) for _ in range(Q)]
r = re.compile('AC')
a = [x.start() for x in r.finditer(S)]
if a:
for q in P:
p1 = bisect.bisect_left(a, q[0] - 1)
... | import sys
N, Q = list(map(int, input().split()))
S = sys.stdin.readline()
P = [list(map(int, sys.stdin.readline().split())) for _ in range(Q)]
a = [0] * N
for i in range(N - 1):
a[i + 1] = a[i] + int(S[i] == 'A' and S[i + 1] == 'C')
for q in P:
print((a[q[1] - 1] - a[q[0] - 1])) | p03087 |
# C - GeT AC
# https://atcoder.jp/contests/abc122/tasks/abc122_c
import sys
n, q = list(map(int, sys.stdin.readline().split()))
s = sys.stdin.readline()
separators = [list(map(int, sys.stdin.readline().split())) for _ in range(q)]
# n = 8
# q = 3
# s = 'ACACTACG'
# separators = [[3, 7],[2, 3],[1, 8]]
... | # C - GeT AC
# https://abc122.contest.atcoder.jp/tasks/abc122_c
"""
累積和を用いて実装しないと時間が足りない
"""
import sys
n, q = list(map(int, sys.stdin.readline().split()))
s = list(sys.stdin.readline())
cnt = [0] * (len(s)+1)
"""
ACを数えるために受けた文字列ｓを展開して数えていく
"""
for i in range(1, len(s)):
"""
s = ACACTACG... | p03087 |
#!/usr/bin/env python3
import sys
def solve(N: int, Q: int, S: str, l: "List[int]", r: "List[int]"):
ans = []
carray = [0] * N
for i in range(1,N):
if(S[i-1:i+1] == 'AC'):
carray[i] = carray[i-1]+1
# carray[i:] = map(lambda x:x+1, carray[i:])
else:
... | #!/usr/bin/env python3
import sys
def solve(N: int, Q: int, S: str, l: "List[int]", r: "List[int]"):
ac = [0]*N
for i in range(1,N):
if(S[i-1:i+1] == 'AC'):
ac[i] = ac[i-1]+1
else:
ac[i] = ac[i-1]
ans = [0]*Q
for i in range(Q):
ans[i] = ac... | p03087 |
import itertools
N,Q = [int(i) for i in input().split()]
S = list(input())
li = [0]*N
for i in range(N-1):
if S[i] == 'A' and S[i+1] == 'C':
li[i+1] = 1
ans = list(itertools.accumulate(li))
k = []
for j in range(Q):
a,b = [int(i) for i in input().split()]
k.append(ans[b-1]-ans[a-1])
... | N,Q = [int(zz) for zz in input().split()]
S = input()
li = [0]*N
Aflag = 0
AC = 0
for i in range(N):
if S[i] == 'A':
Aflag = 1
elif S[i] == 'C' and Aflag:
AC += 1
Aflag = 0
else:
Aflag = 0
li[i] = AC
ans = []
for _ in range(Q):
l,r = [int(zz)-1 for... | p03087 |
from sys import stdin
N,Q=[int(x) for x in stdin.readline().rstrip().split()]
S=(stdin.readline().rstrip())
for i in range(Q):
n1,n2=[int(x) for x in stdin.readline().rstrip().split()]
print((S[n1-1:n2].count("AC"))) | from sys import stdin
N,Q=[int(x) for x in stdin.readline().rstrip().split()]
S=(stdin.readline().rstrip())
acc=[0]*N
cnt=0
flag=0
for index,i in enumerate(list(S)):
if i == "C" and flag == 1:
cnt+=1
flag=0
if i != "C":
flag=0
if i == "A":
flag=1
acc[index]=... | p03087 |
from sys import stdin
n, q = list(map(int, stdin.readline().split()))
s = stdin.readline().strip()
count = 0
for i in range(q):
l, r = list(map(int, stdin.readline().split()))
for j in range(l - 1, r - 1):
if s[j] + s[j + 1] == 'AC':
count += 1
print(count)
count = 0
| from sys import stdin
n, q = list(map(int, stdin.readline().split()))
s = stdin.readline().strip()
counts = [0 for i in range(n)]
count = 0
for i in range(1, n):
if s[i-1:i+1] == 'AC':
count += 1
counts[i] = count
for i in range(q):
l, r = list(map(int, stdin.readline().split()))
... | p03087 |
N, Q = list(map(int, input().split(" ")))
S = input().strip()
check = [0 for i in range(N+2)]
for i in range(N):
if S[i:i+2] == "AC":
check[i+1] = 1
ans = [0 for i in range(Q)]
for i in range(Q):
l, r = list(map(int, input().split()))
ans[i] = sum(check[l:r])
for i in range(Q):
... | N, Q = list(map(int, input().split(" ")))
S = input().strip()
check = [0 for i in range(N+1)]
tmp = 0
for i in range(N):
check[i+1] = tmp
if S[i:i+2] == "AC":
tmp += 1
ans = [0 for i in range(Q)]
for i in range(Q):
l, r = list(map(int, input().split()))
ans[i] = check[r] - che... | p03087 |
import sys
stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()
n,q = read_int()
S = read_str()
lr = [read_int() for _ in range(q)]
def solve():
for i in range(q):
l,r = lr[i]
res = 0
for j in range(l,r):... | import sys
stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()
n,q = read_int()
S = read_str()
lr = [read_int() for _ in range(q)]
dp = [0 for i in range(n+1)]
def solve():
for i in range(1, n):
dp[i+1] = dp[i]
if... | p03087 |
import sys
input = sys.stdin.readline
def print_ans(N, Q, S, arr):
"""Test Case
>>> print_ans(8, 3, "ACACTACG", [[3, 7], [2, 3], [1, 8]])
2
0
3
"""
ans_list = [S[ar[0]-1:ar[1]].count("AC") for ar in arr]
for ans in ans_list:
print(ans)
if __name__ == '__main__':
... | import sys
input = sys.stdin.readline
def print_ans(N, Q, S, arr):
"""Test Case
>>> print_ans(8, 3, "ACACTACG", [[3, 7], [2, 3], [1, 8]])
2
0
3
"""
t = [0] * (N+1)
for i in range(N):
t[i+1] = t[i] + (1 if S[i:i+2] == "AC" else 0)
for ar in arr:
print((t[a... | p03087 |
# https://atcoder.jp/contests/abc122/tasks/abc122_c
N, Q = [int(x) for x in input().split()]
S = input().strip()
idx = [i for i in range(N - 1) if S[i:i+2] == 'AC']
for i in range(Q):
l, r = [int(x) for x in input().split()]
print((sum([i >= l - 1 and i <= r - 2 for i in idx])))
| # https://atcoder.jp/contests/abc122/tasks/abc122_c
N, Q = [int(x) for x in input().split()]
S = input().strip()
m = [0] * N
for i in range(1, N):
if S[i-1:i+1] == 'AC':
m[i] = m[i-1] + 1
else:
m[i] = m[i-1]
for i in range(Q):
l, r = [int(x) for x in input().split()]
print... | p03087 |
from sys import stdin
sN, sQ = stdin.readline().split()
N, Q = int(sN), int(sQ)
# print(N,Q)
S = stdin.readline().rstrip()
data = [stdin.readline().split() for itr in range(Q)]
# print(data)
for itr in range(Q):
l = int(data[itr][0]) - 1
r = int(data[itr][1])
s = S[l:r]
# print(s)
p... | from sys import stdin
sN, sQ = stdin.readline().split()
N, Q = int(sN), int(sQ)
# print(N,Q)
S = stdin.readline().rstrip()
data = [stdin.readline().split() for itr in range(Q)]
# print(data)
grid = [None] * N
# print(grid)
count = 0
for num in range(N):
if num == 0:
grid[num] = count
... | p03087 |
N, Q = map(int, input().split())
S = input()
ans = []
for i in range(Q):
l, r = map(int, input().split())
T = S[l-1:r]
ans.append(T.count('AC'))
print(*ans, sep='\n')
| N, Q = map(int, input().split())
S = input()
T = [0]*(N+1)
for i in range(1, N):
T[i+1] = T[i] + (1 if S[i-1:i+1]=='AC' else 0)
ans = []
for _ in range(Q):
l, r = map(int, input().split())
ans.append(T[r] - T[l])
print(*ans, sep='\n')
| p03087 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on 2019/3/24
@author: shinjisu
"""
# ABC 122
# import math
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
# def getIntList(): return np.array(input().split(), dtype=np.longlong)
def getIntLines(n): re... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on 2019/3/24
@author: shinjisu
"""
# ABC 122
# import math
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
# def getIntList(): return np.array(input().split(), dtype=np.longlong)
def getIntLines(n): re... | p03087 |
def get_ac(n,q,s,l,r):
pos = []
for j in range(0,n-1):
if s[j] == 'A' and s[j+1] == 'C':
pos.append(j+1)
p_len = len(pos)
for i in range(q):
left = l[i]
right = r[i]
count = 0
for j in range(p_len):
if left <= pos[j] and pos[... | def get_ac(n,q,s,l,r):
pos = [0]*n
for j in range(0,n-1):
if s[j] == 'A' and s[j+1] == 'C':
pos[j+1] = pos[j] + 1
else:
pos[j+1] = pos[j]
for i in range(q):
left = l[i]
right = r[i]
count = pos[right - 1] - pos[left - 1]
... | p03087 |
tmp = [int(i) for i in input().split()]
N,Q = tmp[0],tmp[1]
S = [str(i) for i in input().split()][0]
for i in range(Q):
L = [int(i) for i in input().split()]
s = S[L[0]-1:L[1]]
cnt = 0
for i in range(0,len(s)):
if s[i]=='A':
if i+1!=len(s) and s[i+1]=='C':
cnt+=1
print(cnt)
| tmp = [int(i) for i in input().split()]
N,Q = tmp[0],tmp[1]
S = [str(i) for i in input().split()][0]
cnt=0
num=[0]
for i in range(len(S)):
if S[i-1]=='A':
if S[i]=='C':
cnt+=1
num.append(cnt)
for i in range(Q):
L = [int(i) for i in input().split()]
print((num[L[1]]-num[L[0]])) | p03087 |
#!/usr/bin/env python3
import sys
def solve(N: int, Q: int, S: str, l: "List[int]", r: "List[int]"):
dp = [[None for j in range(N)] for i in range(N)]
for i in range(0, N-1):
if S[i] == 'A' and S[i+1] == 'C':
dp[i][i+1] = 1
else:
dp[i][i+1] = 0
def count(... | #!/usr/bin/env python3
import sys
def solve(N: int, Q: int, S: str, l: "List[int]", r: "List[int]"):
c = [0 for i in range(N+1)]
for i in range(N):
c[i+1] = c[i] + (1 if S[i:i+2] == "AC" else 0)
for q in range(Q):
print((c[r[q]-1] - c[l[q] - 1]))
return
def main():
... | p03087 |
import sys
from itertools import accumulate
def main():
input = sys.stdin.readline
n, q = [int(i) for i in input().split()]
s = input().strip()
qs = [[int(i) for i in input().split()] for _ in range(q)]
hoges = [0] + [1 if s[i : i + 2] == "AC" else 0 for i in range(n - 1)]
hoges = li... | # -*- coding: utf-8 -*-
#!/usr/bin/env python3
import sys
from itertools import accumulate
def main():
input = sys.stdin.readline
n, q = [int(i) for i in input().split()]
s = input().strip()
qs = [[int(i) for i in input().split()] for _ in range(q)]
hoges = [0] + [1 if s[i : i + 2] ==... | p03087 |
N,Q = list(map(int, input().split()))
s = input()
import re
pos = [m.end() for m in re.finditer(r'AC', s)]
def cnt(at):
ret=0
for p in pos:
if p>at:
break
ret+=1
return ret
ans=[]
for _ in range(Q):
l,r = list(map(int, input().split()))
ans.append(... | import re
import itertools
N,Q = list(map(int, input().split()))
s = input()
pos = [m.end() for m in re.finditer(r'AC', s)]
dp = [0] * (N+1)
for p in pos:
dp[p] = 1
dp = list(itertools.accumulate(dp))
ans=[]
for _ in range(Q):
l,r = list(map(int, input().split()))
ans.append(dp[r]-dp... | p03087 |
import sys
n, q = list(map(int, sys.stdin.readline().split()))
s = sys.stdin.readline()
mlist = [0] * q
for i in range(q):
mlist[i] = list([int(i) for i in sys.stdin.readline().split()])
elist = [0] * (n+1)
for i in range(n - 1):
tmp = s[i:i+2]
if 'AC' in tmp:
elist[i + 2] = elist[... | import sys
n, q = list(map(int, sys.stdin.readline().split()))
s = sys.stdin.readline()
elist = [0] * (n+1)
for i in range(n - 1):
elist[i + 2] = elist[i + 1] + (1 if 'AC' == s[i:i+2] else 0)
for i in range(q):
l, r = list(map(int, sys.stdin.readline().split()))
print((elist[r] - elist[l]))
| p03087 |
import re
n,q=map(int,input().split())
s=input()
ans=[0]*q
for i in range(q):
l,r=map(int,input().split())
ans[i]=len(re.findall('(AC)',s[l-1:r]))
print(*ans,sep='\n')
| n,q=map(int,input().split())
s=input()
l=[0]*(len(s)+1)
for i in range(1,len(s)):
l[i+1]=l[i]
if s[i-1]=='A' and s[i]=='C':
l[i+1]+=1
ans=[0]*q
for i in range(q):
a,b=map(int,input().split())
ans[i]=l[b]-l[a]
print(*ans,sep='\n')
| p03087 |
def slove():
import sys
input = sys.stdin.readline
n, q = list(map(int, input().rstrip('\n').split()))
s = str(input().rstrip('\n'))
lr = [list(map(int, input().rstrip('\n').split())) for _ in range(q)]
l = [0] * n
cnt = 0
for i in range(1, n):
if s[i] == "C" and s[i-1] ... | def slove():
import sys
input = sys.stdin.readline
n, q = list(map(int, input().rstrip('\n').split()))
s = str(input().rstrip('\n'))
ls = [0] * n
cnt = 0
for i in range(1, n):
if s[i] == "C" and s[i-1] == "A":
cnt += 1
ls[i] = cnt
for i in range(q):... | p03087 |
import sys
sy = sys.stdin.readlines()
_,Q = list(map(int, sy[0].split()))
S = sy[1]
for i in range(Q):
l, r = list(map(int, sy[2+i].split()))
s = S[l-1:r]
print((s.count('AC')))
| import sys
sy = sys.stdin.readlines()
N,Q = list(map(int, sy[0].split()))
S = sy[1]
ACindex = [0 for _ in range(N+1)]
count = 0
for n in range(1, N):
if S[n-1]=="A" and S[n]=="C":
count += 1
ACindex[n+1] = count
for i in range(Q):
l, r = list(map(int, sy[2+i].split()))
print((ACindex[r]-ACinde... | p03087 |
print(("".join([ [ "{0}\n".format(NQ_S[1][0][LR[0]-1:LR[1]].count('AC')) for LR in [list(map(int, input().split())) for i in range(NQ_S[0][1])] ] for NQ_S in [[[int(x) for x in input().split()],[str(x) for x in input().split()]]] ][0])[:-1])) | print(("".join([ [ [ "{0}\n".format(NQ_S[2][LR[1]-1]-NQ_S[2][LR[0]-1]) for LR in [list(map(int, input().split())) for i in range(NQ_S[0][1])]] for x in [[NQ_S[2].append(NQ_S[2][i-1]+1) if NQ_S[1][0][i-1]=='A' and NQ_S[1][0][i]=='C' else NQ_S[2].append(NQ_S[2][i-1]) for i in range(1,len(NQ_S[1][0]))]]] for NQ_S in [[[i... | p03087 |
from sys import stdin
def main():
lines = stdin.readlines()
N = int(lines[0].split()[0])
S = lines[1]
lr = [[int(j) - 1 for j in i.split()] for i in lines[2:]]
AC = [0] * N
pre = 0
for i, c1, c2 in zip(list(range(1, N)), S[:], S[1:]):
AC[i] += pre
if c1 == "A" a... | from sys import stdin
def main():
lines = stdin.readlines()
N = int(lines[0].split()[0])
S = lines[1]
lr = [[int(j) - 1 for j in i.split()] for i in lines[2:]]
AC = [0] * N
pre = 0
for i, c1, c2 in zip(list(range(1, N)), S[:], S[1:]):
if c1 == "A" and c2 == "C":
... | p03087 |
from sys import stdin
def main():
lines = stdin.readlines()
S = lines[1]
lr = [[int(j) - 1 for j in i.split()] for i in lines[2:]]
AC = [0]
pre = 0
for c1, c2 in zip(S[:], S[1:]):
if c1 == "A" and c2 == "C":
pre += 1
AC.append(pre)
for l, r in lr:
... | from sys import stdin
def main():
lines = stdin.readlines()
S = lines[1]
lr = [[int(j) - 1 for j in i.split()] for i in lines[2:]]
AC = []
pre = None
cnt = 0
for c in S:
if c == "A":
pre = "A"
elif pre == "A" and c == "C":
cnt += 1
... | p03087 |
from sys import stdin
def main():
readline = stdin.readline
read = stdin.read
N, Q = list(map(int, readline().split()))
S = readline().strip()
* LR, = [int(x) - 1 for x in read().split()]
AC = []
pre = None
cnt = 0
for c in S:
if c == "A":
pre = "A... | from sys import stdin
def main():
readline = stdin.readline
read = stdin.read
N, Q = list(map(int, readline().split()))
S = readline().strip()
LR = [int(x) - 1 for x in read().split()]
AC = []
pre = None
cnt = 0
for c in S:
if c == "A":
pre = "A"
... | p03087 |
from sys import stdin
def main():
read = stdin.read
N, Q = list(map(int, input().split()))
S = input().strip()
LR = [int(x) - 1 for x in read().split()]
AC = []
pre = None
cnt = 0
for c in S:
if c == "A":
pre = "A"
elif pre == "A" and c == "C"... | from sys import stdin
def main():
N, Q = list(map(int, input().split()))
S = input().strip()
LR = [int(x) - 1 for x in stdin.read().split()]
AC = []
pre = None
cnt = 0
for c in S:
if c == "A":
pre = "A"
elif pre == "A" and c == "C":
cn... | p03087 |
import sys
l = input().split()
N = int(l[0])
Q = int(l[1])
l = input().split()
S = l[0]
L = [0]*Q
R = [0]*Q
ac = 'AC'
for i in range(Q):
l = input().split()
L[i] = int(l[0])
R[i] = int(l[1])
#print(N,Q,S,L,R)
def count(S):
length = len(S)
c = 0
for i in range(length ... | import sys
l = input().split()
N = int(l[0])
Q = int(l[1])
l = input().split()
S = l[0]
L = [0]*Q
R = [0]*Q
ac = 'AC'
for i in range(Q):
l = input().split()
L[i] = int(l[0])
R[i] = int(l[1])
#print(N,Q,S,L,R)
def count(S, table):
length = len(S)
c = 0
for i in range(... | p03087 |
import sys
import time
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()]
N, Q = MAP()
S = input().rstrip()
LR = [MAP() for _ in range(... | import sys
import time
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()]
N, Q = MAP()
S = input().rstrip()
LR = [MAP() for _ in range(... | p03087 |
# coding: utf-8
import sys
import itertools
def sr():
return sys.stdin.readline().rstrip()
def ir():
return int(sr())
def lr():
return list(map(int, sr().split()))
N, Q = lr()
S = sr()
ac = [0] * (N - 1)
for i, x in enumerate(zip(S[:], S[1:])):
if x[0] == 'A' and x[1] == '... | # coding: utf-8
import sys
import itertools
def sr():
return sys.stdin.readline().rstrip()
def ir():
return int(sr())
def lr():
return list(map(int, sr().split()))
N, Q = lr()
S = sr()
ac = [0] * (N - 1)
for i, x in enumerate(zip(S[:], S[1:])):
if x[0] == 'A' and x[1] == '... | p03087 |
import bisect
n, q = list(map(int, input().split()))
s = input().strip()
lrs = [list(map(int, input().split())) for _ in range(q)]
indices = []
for i, (c0, c1) in enumerate(zip(s, s[1:])):
if c0 == 'A' and c1 == 'C':
indices.append(i)
indices_c = [i + 1 for i in indices]
for (l, r) in lrs:
... | 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)... | p03087 |
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)... | 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)... | p03087 |
n,q=[int(i) for i in input().split()]
s=input().replace("AC","10")
f=[1 if s[i]=="1" else 0 for i in range(n)]
for i in range(q):
l,r=[int(i)-1 for i in input().split()]
print((sum(f[l:r])))
| n,q=list(map(int,input().split()))
l=[0 for i in range(n)]
for i,v in enumerate(list(input().replace("AC","X!"))):
l[i]=l[i-1]+(v=="!")
for c in range(q):
h,m=list(map(int,input().split()))
print((l[m-1]-l[h-1])) | p03087 |
#!/usr/bin/env python3
import sys
def solve(N: int, Q: int, S: str, l: "List[int]", r: "List[int]"):
for (li, ri) in zip(l, r):
print((S[li - 1 : ri].count("AC")))
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this l... | #!/usr/bin/env python3
import sys
def solve(N: int, Q: int, S: str, l: "List[int]", r: "List[int]"):
table = [0] * (N + 1)
for i in range(N):
table[i + 1] = table[i] + (1 if S[i : i + 2] == "AC" else 0)
for i in range(Q):
print((table[r[i] - 1] - table[l[i] - 1]))
# Generat... | p03087 |
import sys
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
S = list(readline())
lr = []
for i in range(Q):
l, r = list(map(int, readline().split()))
lr.append([l-1, r])
ac = 0
acs = [0 for i in range(N)]
for i in range(N):
if S[i] == 'A' and ac == 0:
ac += 1
... | import sys
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
S = readline()
t = [0] * (N + 1)
for i in range(N):
t[i + 1] = t[i] + (1 if S[i : i + 2] == 'AC' else 0)
for i in range(Q):
l, r = list(map(int, readline().split()))
print((t[r-1] - t[l-1])) | p03087 |
import re
N, Q = list(map(int, input().split()))
S = input().rstrip()
for i in range(Q):
l, r = list(map(int, input().split()))
s = S[l-1:r]
print((len(re.findall('AC', s))))
| N, Q = list(map(int, input().split()))
S = input().rstrip()
cs = [0]
cnt = 0
for i in range(N-1):
if S[i:i+2] == 'AC':
cnt += 1
cs.append(cnt)
for i in range(Q):
l, r = list(map(int, input().split()))
print((cs[r-1]-cs[l-1]))
| p03087 |
# AOJ 1030 Cubes Without Holes
# Python3 2018.7.6 bal4u
import sys
from sys import stdin
input = stdin.readline
while True:
n, h = list(map(int, input().split()))
if n == 0: break
f = [[[0 for k in range(3)] for c in range(500)] for r in range(500)]
ans = n**3
for i in range(h):
c, a, b = input().... | # AOJ 1030 Cubes Without Holes
# Python3 2018.7.6 bal4u
import sys
from sys import stdin
input = stdin.readline
while True:
n, h = list(map(int, input().split()))
if n == 0: break
ans = []
for i in range(h):
c, a, b = input().split()
a, b = int(a)-1, int(b)-1
if c == "xy":
ans += [a+b*n+z*... | p00616 |
# AOJ 1030 Cubes Without Holes
# Python3 2018.7.6 bal4u
import sys
from sys import stdin
input = stdin.readline
while True:
n, h = list(map(int, input().split()))
if n == 0: break
ans = []
for i in range(h):
c, a, b = input().split()
a, b = int(a)-1, int(b)-1
if c == "xy":
ans += [a+b*n+z*... | # AOJ 1030 Cubes Without Holes
# Python3 2018.7.6 bal4u
import sys
from sys import stdin
input = stdin.readline
# n <= 500, 2^9 = 512
while True:
n, h = list(map(int, input().split()))
if n == 0: break
ans = []
for i in range(h):
c, a, b = input().split()
a, b = int(a)-1, int(b)-1
if c == "x... | p00616 |
N = int(eval(input()))
dp = [[0] * 3 for i in range(100)]
MOD = int(1e9+7)
maxBit = 70
while not (N >> maxBit):
maxBit -= 1
dp[maxBit][0] = 1
dp[maxBit][1] = 1
for i in range(maxBit-1, -1, -1):
for j in range(3):
bit = (N >> i) & 1
for k in range(3):
nj = 2 * j + bit ... | N = int(eval(input()))
s = bin(N)[2:]
n = len(s)
dp = [[0] * 4 for i in range(len(s)+1)]
dp[0][0] = 1
MOD = int(1e9) + 7
for i in range(n):
b = 1 if s[i] == '1' else 0
for j in range(4):
for k in range(3):
nj = min(((j << 1) + b - k, 3))
if 0 <= nj:
dp... | p03847 |
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | p03847 |
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | p03847 |
N = int(eval(input()))
d = {0: 1, 1: 2}
def f(n):
if n in d:
return d[n]
d[n] = (f(n // 2) + f((n - 1) // 2) + f((n - 2) // 2)) % (10**9 + 7)
return d[n]
print((f(N))) | def f(n):
if n in d:return d[n]
d[n]=f(n//2)+f((n-1)//2)+f((n-2)//2);return d[n]
d={0:1,1:2};print((f(int(eval(input())))%(10**9+7))) | p03847 |
MOD = 10**9 + 7
n = int(eval(input()))
ans = set()
def dfs(a:int, b:int, digit:int, memo:set):
u = a^b
v = a+b
if u > n or v > n:
return 0
else:
if digit == 0:
memo.add((u,v))
return 0
else:
dfs(... | import sys
stdin = sys.stdin
def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): re... | p03847 |
N=int(eval(input()))
mod=10**9+7
ANSLIST=[1]
for i in range(61):
ANSLIST.append((ANSLIST[-1]*3-1)%mod)
ANS=[1, 2, 4, 5]
ANSDICT=dict()
def ans(k):
if 0<=k<=3:
return ANS[k]
if ANSDICT.get(k)!=None:
return ANSDICT[k]
for i in range(61):
if k==2**i-2:
... | import sys
sys.setrecursionlimit(10**9)
N=int(eval(input()))
mod=10**9+7
DP=dict()
DP[(0,0)]=1#a+b,a^b
DP[(1,0)]=1
DP[(1,1)]=2
def ans(S,X):
#print(S,X)
if DP.get((S,X))!=None:
return DP[(S,X)]
if S==0:
return 1
#if X>S:
# return ans(S,S)
DP[(S,X)]=... | p03847 |
N = int(eval(input()))
d = []
for i in range(N):
h, p = list(map(int, input().split()))
d.append((h, p))
d = sorted(d, key=lambda x: x[0] + x[1])
INF = float('inf')
dp = [[INF] * (N + 1) for i in range(N + 1)]
dp[0][0] = 0
for i in range(1, N + 1):
for j in range(N + 1):
dp[i][j] = dp[i... | N = int(eval(input()))
d = []
for i in range(N):
h, p = list(map(int, input().split()))
d.append((h, p))
d = sorted(d, key=lambda x: x[0] + x[1])
INF = float('inf')
dp1 = [INF] * (N + 1)
dp2 = [INF] * (N + 1)
dp1[0] = 0
for i in range(1, N + 1):
for j in range(N + 1):
dp2[j] = dp1[j]
... | p03536 |
N = int(eval(input()))
HPs = [tuple(map(int, input().split())) for i in range(N)]
HPs.sort(key=lambda x: x[0] + x[1])
INF = float('inf')
dp = [0]
for H, P in HPs:
if dp[-1] != INF:
dp += [INF]
dp = list(map(min, list(zip([0] + [hgt + P if hgt <= H else INF for hgt in dp], dp))))
dp += [IN... | N = int(eval(input()))
HPs = [tuple(map(int, input().split())) for i in range(N)]
HPs.sort(key=lambda x: x[0] + x[1])
dp = {0: 0}
for H, P in HPs:
for num, minH in list(dp.items()):
if H >= minH:
if num + 1 in dp:
dp[num + 1] = min(dp[num + 1], minH + P)
... | p03536 |
N = int(eval(input()))
HP = sorted([list(map(int,input().split())) for i in range(N)],key = lambda x: x[0]+x[1])
dp = [[float('inf') for i in range(N+1)] for j in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
for j in range(N+1):
if dp[i-1][j-1] <= HP[i-1][0]:
dp[i][j] = min(dp[i-1][j],... | N = int(eval(input()))
HP = sorted([list(map(int,input().split())) for i in range(N)],key = lambda x: x[0]+x[1])
dp1 = [float('inf') for i in range(N+1)]
dp2 = [float('inf') for i in range(N+1)]
dp1[0] = 0
dp2[0] = 0
for i in range(1,N+1):
for j in range(N+1):
if dp1[j-1] <= HP[i-1][0]:
... | p03536 |
import sys
n, m = list(map(int,input().split()))
if n >= m:
print((0))
sys.exit()
x = list(map(int,input().split()))
x.sort()
between = [x[i+1]-x[i] for i in range(len(x)-1)]
between.sort(reverse = True)
print((sum(between[n-1:]))) | import sys
n, m = list(map(int,input().split()))
if n >= m:
print((0))
sys.exit()
x = sorted(list(map(int,input().split())))
print((sum(sorted([x[i+1]-x[i] for i in range(m-1)],reverse = True)[n-1:])))
| p03137 |
import sys
import heapq
inf = 10**6
n, m = list(map(int, input().split()))
if n >= m:
print((0))
sys.exit()
a = [int(x) for x in input().split()]
a.sort()
count = []
heapq.heapify(count)
for i in range(m-1):
heapq.heappush(count, -a[i+1]+a[i])
ans = 0
for j in range(n-1):
ans -= heapq.hea... | m, n = list(map(int, input().split()))
a = [int(x) for x in input().split()]
a.sort()
b = [a[i+1]-a[i] for i in range(n-1)]
b.sort(reverse=True)
print((a[-1]-a[0]-sum(b[:min([m-1, n-1])]))) | p03137 |
N,M=[int(x) for x in input().split()]
X = [int(x) for x in input().split()]
X.sort();
dif = [X[i+1]-X[i] for i in range(M-1)]
if M==1:
dif = [0]
ans = sum(dif)
for i in range(N-1):
ans -= max(dif)
dif[dif.index(max(dif))] = 0
print(ans)
| import sys
N,M=[int(x) for x in input().split()]
X = [int(x) for x in input().split()]
if N>=M:
print((0))
sys.exit()
X.sort();
dif = [X[i+1]-X[i] for i in range(M-1)]
dif.sort()
dif.reverse()
if M==1:
dif = [0]
ans = sum(dif)
for i in range(N-1):
ans -= dif[i]
print(ans)
| p03137 |
n,m=list(map(int,input().split()))
x=input().split()
for i in range(m):
a=int(x[i])
x[i]=a
if n==1:
print((max(x)-min(x)))
elif m==1 or n>=m:
print((0))
else:
goukei=0
l=[0]
i=0
x.sort()
a=0
b=0
if m>1:
while i<m-1:
a=x[i]
b=... | n,m=list(map(int,input().split()))
x=list(map(int,input().split()))
x.sort()
if n==1:
print((max(x)-min(x)))
elif m==1 or n>=m:
print((0))
else:
x.sort()
goukei=0
l=[0]
for i in range(m-1):
goukei+=x[i+1]-x[i]
l.append(x[i+1]-x[i])
i=0
l.sort()
for i i... | p03137 |
import sys
n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
x.sort()
if n>=m:
print((0))
sys.exit()
dis = [x[i+1]-x[i] for i in range(m-1)]
dis.sort()
print((sum(dis[:m-n]))) | n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
x.sort()
if n>=m:
print((0))
exit()
dis = [x[i+1]-x[i] for i in range(m-1)]
dis.sort()
if n>1:
del dis[-(n-1):]
print((sum(dis))) | p03137 |
N,M = list(map(int, input().split(" ")))
XList = list(map(int,input().split()))
XList = sorted(XList)
deltaList = [0]
for i in range(M-1) :
deltaList.append(XList[i+1] - XList[i])
deltaList = sorted(deltaList, reverse=True)
for i in range(N-1) :
deltaList[i] = 0
if i == len(deltaList)-1 :
... | n,m = list(map(int, input().split(" ")))
xList = [int(i) for i in input().split(" ")]
xList = sorted(xList)
dList = [0]
for i in range(len(xList) -1) :
dList.append(xList[i+1] - xList[i])
dList = sorted(dList, reverse=True)
for i in range(n-1) :
dList[i] = 0
if(i == len(dList) -1) :
... | p03137 |
N,M = list(map(int,input().split()))
Xs = list(map(int,input().split()))
Xs.sort()
diffs = []
for i in range(1,M):
diffs.append(Xs[i]-Xs[i-1])
if len(diffs) != 0:
for i in range(N-1):
diffs[diffs.index(max(diffs))] = 0
print((sum(diffs))) | N,M = list(map(int,input().split()))
Xs = list(map(int,input().split()))
Xs.sort()
diffs = []
for i in range(1,M):
diffs.append(Xs[i]-Xs[i-1])
if len(diffs) > 0 and M > N:
diffs.sort()
print((sum(diffs[:M-N])))
else:
print((0)) | p03137 |
n,m=list(map(int,input().split()))
x=list(map(int,input().split()))
x.sort()
y=[]
for i in range(1,len(x)):
y.append(x[i]-x[i-1])
print((sum(sorted(y,reverse=True)[n-1:])))
| n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
x.sort()
diff = []
for i in range(m-1):
diff.append(x[i+1]-x[i])
fin_diff=sorted(diff, reverse=True)
print((sum(fin_diff[n-1:]))) | p03137 |
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
dist = [j - i for i, j in zip(x, x[1:])]
dist.sort(reverse=1)
print((sum(dist[n-1:]))) | n, m = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
l = sorted([a[i-1] - a[i] for i in range(1, m)], reverse=True)
print((sum(l[n-1:])))
| p03137 |
N, M = list(map(int, input().split()))
lst_X = sorted(list(map(int, input().split())))
if N>=M:
print((0))
else:
lst_diff = []
for i in range(M-1):
diff = abs(lst_X[i] - lst_X[i+1])
lst_diff.append(diff)
lst_diff.sort(reverse=True)
print((sum(lst_diff[N-1:])))
| N, M = list(map(int, input().split()))
lst_X = sorted(list(map(int, input().split())))
if N>=M:
print((0))
else:
lst_diff = sorted([lst_X[i+1]-lst_X[i] for i in range(M-1)])[:M-N]
print((sum(lst_diff)))
| p03137 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.