input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
def main():
N, K = list(map(int, readline().rstrip().split()))
ans = 0
for k in range(K, N+2):
mi = ((k-1) * k) // 2
ma = (N * (N + 1)) // 2 - ((N-k) * (N-k+1)) // 2
ans += (ma - mi + 1) % MOD
print((ans % M... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
def main():
N, K = list(map(int, readline().rstrip().split()))
ans = 0
m = (N * (N + 1)) // 2
for k in range(K, N+2):
mi = ((k-1) * k) // 2
ma = m - ((N-k) * (N-k+1)) // 2
ans += (ma - mi + 1) % MOD
pri... | p02708 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
def main():
N, K = list(map(int, readline().rstrip().split()))
ans = 0
m = (N * (N + 1)) // 2
for k in range(K, N+2):
mi = ((k-1) * k) // 2
ma = m - ((N-k) * (N-k+1)) // 2
ans += (ma - mi + 1) % MOD
pri... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
def main():
N, K = list(map(int, readline().rstrip().split()))
ans = 0
m = (N * (N + 1)) // 2
for k in range(K, N+2):
mi = ((k-1) * k) // 2
ma = m - ((N-k) * (N-k+1)) // 2
ans += (ma - mi + 1)
print((an... | p02708 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
def main():
N, K = list(map(int, readline().rstrip().split()))
ans = 0
m = (N * (N + 1)) // 2
for k in range(K, N+2):
mi = ((k-1) * k) // 2
ma = m - ((N-k) * (N-k+1)) // 2
ans += (ma - mi + 1)
print((an... | import sys
readline = sys.stdin.buffer.readline
MOD = 10 ** 9 + 7
def main():
N, K = list(map(int, readline().rstrip().split()))
ans = 0
m = (N * (N + 1)) // 2
for k in range(K, N+2):
mi = ((k-1) * k) // 2
ma = m - ((N-k) * (N-k+1)) // 2
ans += (ma - mi + 1)
pr... | p02708 |
N, K = list(map(int, input().split()))
mod = int(1e9) + 7
S = 0
for i in range(K, N+2):
S += (N - i + 1) * i + 1
S %= mod
print(S) | N, K = list(map(int, input().split()))
mod = int(1e9) + 7
S = (N * (N + 1) * (N + 2) - (3 * N - 2 * K + 4) * K * (K - 1)) // 6 + N - K + 2
print((S % mod)) | p02708 |
n, k = list(map(int, input().split()))
ans = 0
for i in range(k - 1, n + 1):
ans += ((i + 1)*(n + n - i)//2)
for i in range(k - 1, n + 1):
ans -= (i + 1)*i//2
ans += n + 2 - k
print((ans%(10**9 + 7))) | n, k = list(map(int, input().split()))
ans = 0
for i in range(k - 1, n + 1):
ans += (i + 1)*(n - i) + 1
print((ans%(10**9 + 7))) | p02708 |
import itertools
import math
from functools import reduce
n, k = list(map(int, input().split()))
pattern = 0
for i in range(k, n + 2):
min = i * (0 + i - 1) // 2
max = i * (n + n - i + 1) // 2
pattern += max - min + 1
pattern %= 10 ** 9 + 7
print(pattern) | n, k = list(map(int, input().split()))
pattern = 0
for i in range(k, n + 2):
min = (0 + i - 1) // 2 * i
max = ((n - i) + (1 + n)) // 2 * i
pattern += max - min + 1
pattern %= 10 ** 9 + 7
print(pattern) | p02708 |
from functools import reduce
while 1:
n = input()
if n == '0': break;
print(reduce(lambda x,y: x+int(y), n, 0)) | while 1:
x = input()
if x == '0': break;
print(sum([int(d) for d in x])) | p02416 |
import sys
for line in sys.stdin:
if int(line) == 0: break
s = 0
for c in line.strip('\n'):
s += '0123456789'.index(c)
print(s) | while True:
x = input()
if x == '0':break
print(sum(['0123456789'.index(c) for c in x])) | p02416 |
xin = []
while True:
x = int(input())
if x == 0:
break
xin += [x]
for i in xin:
print(sum(map(int , list(str(i))))) | xin = []
while True:
x = input()
if x == '0':
break
xin += [x]
for i in xin:
print(sum(map(int , list(i)))) | p02416 |
# -*- coding: utf-8 -*-
while True:
s = input()
if s=="0": break
t = 0
for n in s:
t += int(n)
print(t) | while True:
s = input()
if s!="0": print(sum(map(int, s)))
else: break | p02416 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
9
0 1 4
1 2 3
2 -1 -1
3 -1 -1
4 5 8
5 6 7
6 -1 -1
7 -1 -1
8 -1 -1
output:
node 0: parent = -1, sibling = -1, degree = 2, depth = 0, height = 3, root
node 1: parent = 0, sibling = 4, degree = 2, depth = 1, height = 1, internal node
node 2: par... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
9
0 1 4
1 2 3
2 -1 -1
3 -1 -1
4 5 8
5 6 7
6 -1 -1
7 -1 -1
8 -1 -1
output:
node 0: parent = -1, sibling = -1, degree = 2, depth = 0, height = 3, root
node 1: parent = 0, sibling = 4, degree = 2, depth = 1, height = 1, internal node
node 2: par... | p02280 |
def con(m,n):
ln = len(str(n))
return m * 10 ** ln + n
n = int(eval(input()))
lst = [int(eval(input())) for i in range(n)]
lst.sort()
lst = lst[0:4]
save = []
for i in lst:
for j in lst:
if i != j:
save.append(con(i, j))
save.sort()
print((save[2]))
| def main():
def con(m,n):
ln = len(str(n))
return m * 10 ** ln + n
n = int(eval(input()))
lst = [int(eval(input())) for i in range(n)]
lst.sort()
lst = lst[0:4]
save = []
for i in lst:
for j in lst:
if i != j:
save.append(con(i, j))
save.sort()
print((save[2]))
... | p00507 |
n=int(input())
a=[int(input()) for _ in range(n)]
a.sort()
ans=[]
for i in range(3):
for j in range(i+1,n):
ans.append(int(str(a[i])+str(a[j])))
ans.append(int(str(a[j])+str(a[i])))
ans.sort()
print((ans[2])) | n=int(input())
a=[int(input()) for _ in range(n)]
a.sort()
ans=[]
for i in range(3):
for j in range(i+1,n):
ans.append(int(str(a[i])+str(a[j])))
ans.append(int(str(a[j])+str(a[i])))
ans.sort()
print((ans[2])) | p00507 |
import sys
sys.setrecursionlimit(10 ** 9)
n,m,q = list(map(int,input().split()))
abcd = []
for i in range(q):
abcd.append(tuple(map(int,input().split())))
ans = 0
def dfs(l):
global ans
if len(l) == n:
ans = max(check(l),ans)
else:
if len(l) == 0:
mx = 1
else:
mx = l[-... | import itertools
n,m,q = list(map(int,input().split()))
abcd = []
for i in range(q):
abcd.append(tuple(map(int,input().split())))
def check(l):
res = 0
for a,b,c,d in abcd:
a -= 1
b -= 1
if l[b]-l[a] == c:
res += d
return res
l = itertools.combinations_with_replacement(list(... | p02695 |
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
N, M, Q = list(map(int, readline().split()))
kumi = []
for _ in range(Q):
tmp = list(map(int, readline().split()))
kumi.append(tmp... | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
N, M, Q = list(map(int, readline().split()))
kumi = []
for _ in range(Q):
tmp = list(map(int, readline().split()))
kumi.append(tmp... | p02695 |
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
# print(N, M, Q)
# print(abcd)
def calculate(A):
total = 0
for abcdi in abcd:
a = abcdi[0] - 1
b = abcdi[1] - 1
c = abcdi[2]
d = abcdi[3]
if A[b] - A[a] == c:... | N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
# print(N, M, Q)
# print(abcd)
def calculate(A, abcd):
total = 0
for abcdi in abcd:
a = abcdi[0] - 1
b = abcdi[1] - 1
c = abcdi[2]
d = abcdi[3]
if A[b] - A[a]... | p02695 |
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
# print(N, M, Q)
# print(abcd)
def calculate(A, abcd):
total = 0
for abcdi in abcd:
a = abcdi[0] - 1
b = abcdi[1] - 1
c = abcdi[2]
d = abcdi[3]
if A[b] - A[a]... | import itertools
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
# print(N, M, Q)
# print(abcd)
def calculate(A, abcd):
total = 0
for abcdi in abcd:
a = abcdi[0] - 1
b = abcdi[1] - 1
c = abcdi[2]
d = abcdi[3]
... | p02695 |
n,m,q=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(q)]
L=[]
for i in range(1,m+1):
if n==1:
L.append((i))
else:
for i2 in range(i,m+1):
if n==2:
L.append((i,i2))
else:
for i3 in range(i2,m+1):
if n==3:
L.append... | import itertools
n,m,q=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(q)]
M=[i+1 for i in range(m)]
L=[]
for i in itertools.combinations_with_replacement(M,n):
L.append(i)
ans=[]
for i in range(len(L)):
ct=0
for j in range(q):
if L[i][l[j][1]-1]-L[i][l[j][0]-1]==l[j... | p02695 |
import itertools
n,m,q = list(map(int,input().split()))
ch = list(itertools.combinations_with_replacement(list(range(1,m+1)),n))
lch = len(ch)
rel = [0]*lch
l = [list(map(int,input().split())) for _ in range(q)]
for k in range(lch):
for i in range(q):
a = l[i][0]
b = l[i][1]
c = l[... | import itertools
n,m,q = list(map(int,input().split()))
ch = list(itertools.combinations_with_replacement(list(range(1,m+1)),n))
lch = len(ch)
rel = [0]*lch
l = [list(map(int,input().split())) for _ in range(q)]
for k in range(lch):
for i in range(q):
if ch[k][l[i][1]-1]-ch[k][l[i][0]-1]==l[i][2]:
... | p02695 |
from collections import deque
N, M, Q = list(map(int, input().split(" ")))
abcd = []
for i in range(Q):
abcd.append(list(map(int, input().split(" "))))
q = deque([[i] for i in range(1, M + 1)])
A = []
while q:
tmp = q.pop()
if len(tmp) == N:
A.append(tmp)
else:
for i in range... | import itertools
N, M, Q = list(map(int, input().split(" ")))
abcd = []
for i in range(Q):
abcd.append(list(map(int, input().split(" "))))
A = list(itertools.combinations_with_replacement(list(range(1, M + 1)), N))
ans = 0
for a in A:
score = 0
for i in abcd:
if a[i[1] - 1] == ... | p02695 |
import itertools
N,M,Q = list(map(int,input().split()))
list1 = [None for i in range(Q)]
for i in range(Q):
list1[i] = list(map(int,input().split()))
ans = 0
for x in itertools.combinations_with_replacement(list(range(1,M+1)),N):
score = 0
x1 = sorted(x)
score = sum(y[3] for y in list1 if x1[y[1]-1]-... | N,M,Q = list(map(int,input().split()))
list1 = [None for i in range(Q)]
for i in range(Q):
list1[i] = list(map(int,input().split()))
ans = [0]
def dfs(x,n2,m1):
if len(x) == n2:
score = sum(x1[3] for x1 in list1 if x[x1[1]-1]-x[x1[0]-1] == x1[2])
if score > ans[0]:
ans[0] = score
else:... | p02695 |
N,M,Q = list(map(int,input().split()))
list1 = [None for i in range(Q)]
for i in range(Q):
list1[i] = list(map(int,input().split()))
ans = [0]
def dfs(x,n2,m1):
if len(x) == n2:
score = sum(x1[3] for x1 in list1 if x[x1[1]-1]-x[x1[0]-1] == x1[2])
if score > ans[0]:
ans[0] = score
else:... | import itertools
N,M,Q = list(map(int,input().split()))
list1 = [list(map(int,input().split())) for i in range(Q)]
ans = [0]
def dfs(x,n2,m1):
if len(x) == n2:
score = sum(x1[3] for x1 in list1 if x[x1[1]-1]-x[x1[0]-1] == x1[2])
if score > ans[0]:
ans[0] = score
else:
for i in range... | p02695 |
def solve(string):
from itertools import combinations_with_replacement
n, m, q, *abcd = list(map(int, string.split()))
ans = 0
for v in combinations_with_replacement(list(range(1, m + 1)), n):
v = sorted(list(v))
ans = max(
ans,
sum(d if v[b - 1] - v[a - 1... | def solve(string):
from itertools import combinations_with_replacement
n, m, q, *abcd = list(map(int, string.split()))
ans = 0
for v in combinations_with_replacement(list(range(1, m + 1)), n):
ans = max(
ans,
sum(d if v[b - 1] - v[a - 1] == c else 0 for a, b, c, d ... | p02695 |
from collections import *
def dfs(now):
global ans
if len(now)==N:
ans_cand = 0
for a, b, c, d in abcd:
if now[b-1]-now[a-1]==c:
ans_cand += d
ans = max(ans, ans_cand)
return
last = now[-1]
for... | import sys
sys.setrecursionlimit(100)
from collections import *
def dfs(now):
global ans
if len(now)==N:
cnt = 0
for a, b, c, d in abcd:
if now[b-1]-now[a-1]==c:
cnt += d
ans = max(ans, cnt)
return
for ... | p02695 |
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
from itertools import combinations_with_replacement
l = [i for i in range(1, M+1)]
lis = list(combinations_with_replacement(l, N))
for l in lis:
tmp = 0
for j in range(Q):
a, b, c, d =... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, M, Q = mapint()
abcd = [list(mapint()) for _ in range(Q)]
from itertools import combinations_with_replacement
lis = list(range(1, M+1))
ans = 0
for l in combina... | p02695 |
import sys
import copy
from collections import deque
def main():
N, M, Q = list(map(int, input().split()))
ABCD = [[int(_) for _ in input().split()] for i in range(Q)]
seq_list = make_sequence(N, M)
max_score = 0
for i_seq in seq_list:
score = 0
for a, b, c, d i... | import sys
import itertools
def main():
N, M, Q = list(map(int, input().split()))
ABCD = [[int(_) for _ in input().split()] for i in range(Q)]
value_range = list(range(1, M+1))
seq_list = list(itertools.combinations_with_replacement(value_range, N))
max_score = 0
for i_seq in seq_lis... | p02695 |
N, M, Q = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(Q)]
def dfs(x):
if len(x) == N + 1:
tmp = 0
for i in range(Q):
if x[X[i][1]] - x[X[i][0]] == X[i][2]:
tmp += X[i][3]
return tmp
x.append(x[-1])
re... | from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for x in combinations_with_replacement(list(range(1, M + 1)), N):
tmp = 0
for i in range(Q):
if x[X[i][1] - 1] - x[X[i][0] - 1] == X[i]... | p02695 |
N, M, Q = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(Q)]
def dfs(x):
if len(x) == N + 1:
res = 0
for a, b, c, d in X:
if x[b] - x[a] == c:
res += d
return res
res = 0
for i in range(max(1, x[-1]), ... |
N, M, Q = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(Q)]
def dfs(x):
if len(x) == N + 1:
res = 0
for a, b, c, d in X:
if x[b] - x[a] == c:
res += d
return res
res = 0
for n in range(x[-1], M + 1):
... | p02695 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()... | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import itertools
import collections
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.... | p02695 |
from itertools import combinations_with_replacement
def main():
n, m, q = list(map(int, input().split()))
qlist = []
for _ in range(q):
qlist.append(tuple(map(int, input().split())))
nums = [i for i in range(1, m + 1)]
alist = tuple(combinations_with_replacement(nums, n))
r =... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from itertools import combinations_with_replacement
def main():
n, m, q = list(map(int, input().split()))
abcd = []
for _ in range(q):
q = tuple(map(int, input().split()))
abcd.append(q)
c1 = tuple(combinations_wi... | p02695 |
# C - Many Requirements
from collections import deque
from typing import Tuple
N: int
M: int
conditions: Tuple[Tuple[int, int, int, int]]
def dfs():
queue = deque([[1]])
highest = 0
while queue:
seq = queue.popleft()
if len(seq) == N + 1:
highest = max(
... | # C - Many Requirements
from itertools import combinations_with_replacement
def main():
N, M, Q, *ABCD = list(map(int, open(0).read().split()))
conditions = tuple(zip(*[iter(ABCD)] * 4))
ans = max(
sum(d for a, b, c, d in conditions if comb[b - 1] - comb[a - 1] == c)
for comb in c... | p02695 |
N, M, Q = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(Q)]
l = []
def dfs(lis, y):
if len(lis) == N:
l.append(lis)
return
else:
for i in range(y, M+1):
z = list(lis)
z.append(i)
dfs(z, i)
return
dfs([], 1)
ans =... | from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for A in combinations_with_replacement(list(range(1, M+1)), N):
tmp = 0
for a, b, c, d in query:
if A[b-1] - A[a-1] == c:
tmp += d
... | p02695 |
from sys import stdin
from collections import deque
def main():
#入力
readline=stdin.readline
N,M,Q=list(map(int,readline().split()))
a=[]
b=[]
c=[]
d=[]
for i in range(Q):
li=list(map(int,readline().split()))
a.append(li[0])
b.append(li[1])
c.... | from sys import stdin
import itertools
def main():
#入力
readline=stdin.readline
N,M,Q=list(map(int,readline().split()))
a=[0]*Q
b=[0]*Q
c=[0]*Q
d=[0]*Q
for i in range(Q):
a[i],b[i],c[i],d[i]=list(map(int,readline().split()))
arrays=list(itertools.combinations_wit... | p02695 |
import itertools
N, M, Q = list(map(int,input().split()))
s = [tuple(map(int, input().split())) for i in range(Q)]
l = list(range(1,M+1))
ans = []
for v in itertools.combinations_with_replacement(l, N):
count = 0
for i in range(Q):
a, b, c, d = s[i]
if v[b-1] - v[a-1] == c:
... | import itertools
N, M, Q = list(map(int,input().split()))
s = [tuple(map(int, input().split())) for i in range(Q)]
l = list(range(1,M+1))
ans = [0]
for v in itertools.combinations_with_replacement(l, N):
count = 0
for i in range(Q):
a, b, c, d = s[i]
if v[b-1] - v[a-1] == c:
... | p02695 |
#!/usr/bin/env python3
# スペース区切りの整数の入力
from collections import deque
def calc(seq):
score = 0
for a, b, c, d in data:
if seq[b-1] - seq[a-1] == c:
score += d
return score
# スペース区切りの整数の入力
N, M, Q = list(map(int, input().split()))
#配列の入力
data = [list(map(int, input().spli... | #!/usr/bin/env python3
# スペース区切りの整数の入力
def dfs(seq):
ans = 0
if len(seq) == N:
score_ret = 0
for a, b, c, d in data:
if seq[b-1] - seq[a-1] == c:
score_ret += d
return score_ret
else:
for i in range(seq[-1], M+1):
seq_next... | p02695 |
N,M,Q = list(map(int,input().split()))
ls_rq = [list(map(int, input().split())) for i in range(Q)]
#深さ優先探索により各数列を生成する
As=[]
from queue import LifoQueue as lq
S=lq()
S.put([])
while not S.empty():
a=S.get()
if len(a)==N:
As.append(a)
else:
if len(a)==0:
b=1
else:
b=a[-1]
... | N,M,Q = list(map(int,input().split()))
ls_rq = [list(map(int, input().split())) for i in range(Q)]
#深さ優先探索により各数列を生成する
As=[]
from queue import LifoQueue as lq
S=lq()
S.put([])
while not S.empty():
a=S.get()
if len(a)==N:
As.append(a)
else:
if len(a)==0:
b=1
else:
b=a[-1]
... | p02695 |
import itertools
n, m, q = list(map(int, input().split()))
a,b,c,d = [],[],[],[]
for i in range(q):
A,B,C,D = list(map(int, input().split()))
a.append(A)
b.append(B)
c.append(C)
d.append(D)
e = [i+1 for i in range(m)]
ans = 0
for i in itertools.combinations_with_replacement(e,n-1):
f = list(i)
f.app... | n, m, q = list(map(int, input().split()))
query = []
for i in range(q):
query.append(list(map(int, input().split())))
v = []
def dfs(u,ary):
if len(ary) == n:
ary.sort()
cnt = 0
for j in range(q):
a,b,c,d = query[j]
if ary[b-1] - ary[a-1] == c:
cnt += d
v.append(cnt)
else:
for j ... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
ans = 0
for A in itertools.combinations_with_replacement(list(range(1, M+1)), N):
score = 0
for i in range(Q):
a = abcd[i][0]
b = abcd[i][1]
c = abcd[i][2]
d = abcd[i][3]
... | import itertools
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for i in range(Q)]
total = []
for A in itertools.combinations_with_replacement(list(range(1, M+1)), N):
score = 0
for a,b,c,d in abcd:
if A[b-1]-A[a-1] == c:
score += d
total.append(score)
prin... | p02695 |
import itertools
def LI():return list(map(int,input().split()))
n,m,q=LI()
abcd=[]
for _ in range(q):
a,b,c,d=LI()
a-=1
b-=1
abcd.append((a,b,c,d))
# 数列Aの生成
Alist=itertools.combinations_with_replacement(list(range(m)),n)
ans=0
for A in Alist:
cnt=0
for a,b,c,d in abcd:
... | # coding: utf-8
# Your code here!
import itertools
def LI():return list(map(int,input().split()))
n,m,q=LI()
abcd=[]
for _ in range(q):
a,b,c,d=LI()
a-=1
b-=1
abcd.append((a,b,c,d))
# 数列Aの生成
Alist=itertools.combinations_with_replacement(list(range(m)),n)
ans=0
for A in Alist:
cnt=... | p02695 |
# coding: utf-8
# Your code here!
import itertools
def LI():return list(map(int,input().split()))
n,m,q=LI()
abcd=[]
for _ in range(q):
a,b,c,d=LI()
a-=1
b-=1
abcd.append((a,b,c,d))
# 数列Aの生成
Alist=itertools.combinations_with_replacement(list(range(m)),n)
ans=0
for A in Alist:
cnt=... | import itertools
def LI():return list(map(int,input().split()))
n,m,q=LI()
abcd=[]
for _ in range(q):
a,b,c,d=LI()
a-=1
b-=1
abcd.append((a,b,c,d))
As=itertools.combinations_with_replacement(list(range(m)),n)
ans=0
for A in As:
cnt=0
for a,b,c,d in abcd:
if A[b]-A[a]==c:cnt+=d
ans=max... | p02695 |
f=lambda:list(map(int,input().split()))
n,m,q=f()
lq=[tuple(f()) for _ in range(q)]
ans=0
from itertools import *
for t in combinations_with_replacement(list(range(m)),n):
s=0
for a,b,c,d in lq:
if t[b-1]-t[a-1]==c: s+=d
ans=max(ans,s)
print(ans) | f=lambda:list(map(int,input().split()))
n,m,q=f()
Q=[list(f())for _ in range(q)]
from itertools import*
print((max(sum(d for a,b,c,d in Q if l[b-1]-l[a-1]==c)for l in combinations_with_replacement(list(range(m)),n)))) | p02695 |
n,m,q = list(map(int, input().split()))
import itertools
a = []
for i in range(q):
a.append(input().split())
suma = sum([int(aa[3]) for aa in a])
ans = 0
l = [i for i in range(m)]
for v in itertools.combinations_with_replacement(l, n):
ans_ = 0
for j in range(q):
if v[int(a[j][1])-1... | n,m,q = list(map(int, input().split()))
import itertools
a = []
for i in range(q):
a.append(input().split())
suma = sum([int(aa[3]) for aa in a])
ans = 0
l = [i for i in range(m)]
for v in itertools.combinations_with_replacement(l, n-1):
ans_ = 0
v = [0]+list(v)
for j in range(q):
... | p02695 |
from itertools import combinations_with_replacement
# n個の数列、1~mの中で数列を作る
n, m, q = list(map(int, input().split()))
comb = combinations_with_replacement(list(range(1, m + 1)), n)
abcd = [list(map(int, input().split())) for _ in [0] * q]
ans = 0
for A in comb:
cnt = 0
for i in range(q):
a, b, ... | from itertools import combinations_with_replacement
# n個の数列、1~mの中で数列を作る
# 2<=n<=10
# 1<=m<=10
n, m, q = list(map(int, input().split()))
comb = combinations_with_replacement(list(range(1, m + 1)), n)
abcd = [list(map(int, input().split())) for _ in [0] * q]
ans = 0
for A in comb:
cnt = 0
for a,b,c,... | p02695 |
N, M, Q = list(map(int, input().strip().split()))
pattern_list = []
for _ in range(Q):
pattern = tuple(map(int, input().strip().split()))
pattern_list.append(pattern)
def create(N,M):
S = [[] for _ in range(N+1)]
for m in range(1,M+1):
S[1].append([m])
for n in range(1,N):
for s in S[n]:
Max = ... | N, M, Q = list(map(int, input().strip().split()))
pattern_list = []
for _ in range(Q):
pattern = tuple(map(int, input().strip().split()))
pattern_list.append(pattern)
def create(N,M):
S = [[] for _ in range(N+1)]
for m in range(1,M+1):
S[1].append([m])
for n in range(1,N):
... | p02695 |
import math
#X=int(input())
N,M,Q=list(map(int,input().split()))
S=[[]for i in range(Q)]
for i in range(Q):
a=list(map(int,input().split()))
S[i]=a
ans=0
T=0
for a in range(1,M+1):
for b in range(a, M+1):
for c in range(b, M+1):
for d in range(c, M+1):
for e ... | import math
import sys
sys.setrecursionlimit(10**7)
#X=int(input())
N,M,Q=list(map(int,input().split()))
S=[[]for i in range(Q)]
for i in range(Q):
a=list(map(int,input().split()))
S[i]=a
ans=0
T=0
def solve(l):
global ans
if len(l)>=N:
tmp=0
for k in range(Q):
... | p02695 |
import itertools
n, m, q = list(map(int, input().split()))
lst = [list(map(int, input().split())) for i in range(q)]
ans = 0
for A in itertools.combinations_with_replacement(list(range(1, m + 1)), n):
flag = 0
for k in range(n - 1):
if A[k + 1] < A[k]:
flag = 1
if flag == 0:
... | import sys
sys.setrecursionlimit(1000000)
n, m, q = list(map(int, input().split()))
lst = [list(map(int, input().split())) for i in range(q)]
ans = 0
def dfs(A):
global ans
if len(A) == n + 1:
point = 0
for i in range(q):
if A[lst[i][1]] - A[lst[i][0]] == lst[i][2]:
... | p02695 |
from itertools import combinations_with_replacement
n,m,q = list(map(int, input().split()))
abcd = []
for _ in range(q):
a,b,c,d = list(map(int, input().split()))
abcd.append([a,b,c,d])
nums = list(range(1,m+1))
l = list(combinations_with_replacement(nums, n))
ans = 0
for i in l:
p = 0
for j in a... | from itertools import combinations_with_replacement
n,m,q = list(map(int, input().split()))
abcd = []
for _ in range(q):
a,b,c,d = list(map(int, input().split()))
abcd.append([a,b,c,d])
nums = list(range(1,m+1))
l = list(combinations_with_replacement(nums, n))
ans = 0
for i in l:
p = 0
for j in a... | p02695 |
from itertools import combinations_with_replacement
n,m,q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
nums = list(combinations_with_replacement(list(range(1,m+1)), n))
ans = 0
for i in nums:
t = 0
for j in abcd:
s = i[j[1]-1] - i[j[0]-1]
if s == ... | from itertools import combinations_with_replacement
n,m,q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
nums = list(range(1, m+1))
ans = 0
for i in combinations_with_replacement(nums, n):
t = 0
for j in abcd:
if i[j[1]-1] - i[j[0]-1] == j[2]:
t += ... | p02695 |
from itertools import combinations_with_replacement
n,m,q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
num = list(combinations_with_replacement(list(range(1,m+1)), n))
ans = 0
for i in num:
t = 0
for j in abcd:
if i[j[1]-1] - i[j[0]-1] == j[2]:
... | from itertools import combinations_with_replacement
n,m,q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
ans = 0
for i in combinations_with_replacement(list(range(1,m+1)),n):
t = 0
for j in abcd:
if i[j[1]-1] - i[j[0]-1] == j[2]:
t += j[3]
ans = m... | p02695 |
from itertools import combinations_with_replacement
n,m,q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
nums = combinations_with_replacement(list(range(1,m+1)), n)
ans = 0
for a in nums:
t = 0
for i in abcd:
if a[i[1]-1] - a[i[0]-1] == i[2]: t += i[3]
... | from itertools import combinations_with_replacement
n,m,q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
ans = 0
for a in combinations_with_replacement(list(range(1,m+1)), n):
t = 0
for i in abcd:
if a[i[1]-1] - a[i[0]-1] == i[2]: t += i[3]
if ans < t: a... | p02695 |
def solve(arr, abcd, Q):
ans = 0
for i in range(Q):
if arr[abcd[i][1]-1]-arr[abcd[i][0]-1] == abcd[i][2]:
ans += abcd[i][3]
return ans
N, M, Q = list(map(int, input().split()))
abcd = []
for _ in range(Q):
tmp = list(map(int, input().split()))
abcd.append(tmp)
an... | import itertools
N, M, Q = list(map(int, input().split()))
As = list(itertools.combinations_with_replacement(list(range(1, M + 1)), N))
ans = [0]*len(As)
for _ in range(Q):
a, b, c, d = list(map(int, input().split()))
for i, A in enumerate(As):
if A[b-1]-A[a-1] == c:
ans[i] += d
... | p02695 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p02695 |
import itertools
n,m,q = list(map(int,input().split()))
num_ls = [[0,0,0,0] for _ in range(q)]
for i in range(q):
num_ls[i] = list(map(int,input().split()))
a_base = [i for i in range(1,m+1)]
a_ls = []
for A in itertools.combinations_with_replacement(a_base, n):
istarget = True
for i in range(n-1... | N,M,Q = list(map(int,input().split()))
req_ls = []
l_ind_ls = [0] * Q
r_ind_ls = [0] * Q
diff_ls = [0] * Q
point_ls = [0] * Q
for i in range(Q):
l_ind_ls[i], r_ind_ls[i], diff_ls[i], point_ls[i] = list(map(int, input().split()))
l_ind_ls[i] -= 1
r_ind_ls[i] -= 1
def score(ls):
tmp = 0
... | p02695 |
N,M,Q = list(map(int,input().split()))
req_ls = []
l_ind_ls = [0] * Q
r_ind_ls = [0] * Q
diff_ls = [0] * Q
point_ls = [0] * Q
for i in range(Q):
l_ind_ls[i], r_ind_ls[i], diff_ls[i], point_ls[i] = list(map(int, input().split()))
l_ind_ls[i] -= 1
r_ind_ls[i] -= 1
def score(ls):
tmp = 0
... | length, Max, q = list(map(int,input().split()))
query = [[0]*4 for _ in range(q)]
for i in range(q):
a,b,c,d = list(map(int,input().split()))
query[i] = [a-1,b-1,c,d]
ans = 0
def dfs(A):
if len(A) == length:
global ans
score = 0
for i in range(q):
a,b,c,d = que... | p02695 |
import itertools
n,m,q=list(map(int,input().split()))
Se=[]
for i in range(q):
Se.append(list(map(int,input().split())))
#print(Se)
integerset={i for i in range(1,m+1)}
#print(integerset)
everyset=itertools.combinations_with_replacement(integerset,n)
max=0
for v in everyset:
# print(v)
# print(len... | import itertools
n,m,q=list(map(int,input().split()))
Se=[]
for i in range(q):
Se.append(tuple(map(int,input().split())))
#print(Se)
integerset={i for i in range(1,m+1)}
#print(integerset)
everyset=itertools.combinations_with_replacement(integerset,n)
max=0
for v in everyset:
# print(v)
# print(le... | p02695 |
import itertools
n,m,q=list(map(int,input().split()))
Se=[]
for i in range(q):
Se.append(tuple(map(int,input().split())))
#print(Se)
integerset={i for i in range(1,m+1)}
#print(integerset)
everyset=itertools.combinations_with_replacement(integerset,n)
max=0
for v in everyset:
# print(v)
# print(le... | import itertools
def main():
n,m,q=list(map(int,input().split()))
Se=[]
for i in range(q):
Se.append(tuple(map(int,input().split())))
#print(Se)
integerset={i for i in range(1,m+1)}
#print(integerset)
everyset=itertools.combinations_with_replacement(integerset,n)
max=0
... | p02695 |
#n=int(input())
n,m,q=list(map(int,input().split()))
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
al=[]
bl=[]
cl=[]
dl=[]
l=[]
ansl=[0 for i in range(n+1)]
for i in range(q):
a,b,c,d=list(map(int,input().split()))
al.append(a)
bl.append(b)
cl.ap... | #n=int(input())
n,m,q=list(map(int,input().split()))
#hl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
al=[0]*q
bl=[0]*q
cl=[0]*q
dl=[0]*q
for i in range(q):
al[i],bl[i],cl[i],dl[i]=list(map(int,input().split()))
def score_calc(seq):
res=0
for a,b,c,d... | p02695 |
n, m, q = list(map(int, input().split()))
plist = []
for _ in range(q):
plist.append(list(map(int, input().split())))
alist = []
def bfs(depth: int, l: list):
global n, m, alist
if depth == n:
alist.append(l[1:])
return
c = l[depth]
cl = l.copy()
cl.append(c)
... | n, m, q = list(map(int, input().split()))
plist = []
for _ in range(q):
plist.append(list(map(int, input().split())))
alist = []
def bfs(depth: int, l: list):
global n, m, alist
if depth == n:
alist.append(l[1:])
return
c = l[depth]
cl = l.copy()
cl.append(c)
... | p02695 |
import itertools
n,m,q=list(map(int,input().split()))
lis=[]
ans=0
for _ in range(q):
a,b,c,d = list(map(int, input().split()))
lis.append([a-1,b-1,c,d])
for i in itertools.combinations_with_replacement(list(range(1,m+1)),n):
tmp=0
for j in range(q):
if i[lis[j][1]] - i[lis[j][0]] ... | import itertools
n,m,q=list(map(int,input().split()))
a=[0 for i in range(q)]
b=[0 for i in range(q)]
c=[0 for i in range(q)]
d=[0 for i in range(q)]
for i in range(q):
a[i],b[i],c[i],d[i]=list(map(int,input().split()))
a[i]-=1
b[i]-=1
ans=0
for i in itertools.combinations_with_replacement(list... | p02695 |
#!/usr/bin/env python3
def main():
import sys
def calc(A: list):
score = 0
for a, b, c, d in lst:
if A[b - 1] - A[a - 1] == c:
score += d
return score
def dfs(A: list):
nonlocal ans
if len(A) == N:
ans = max(an... | #!/usr/bin/env python3
def main():
import sys
from itertools import combinations_with_replacement
input = sys.stdin.readline
N, M, Q = list(map(int, input().split()))
lst = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for pattern in combinations_with_replacement(... | p02695 |
from itertools import combinations_with_replacement
n, m, q = list(map(int, input().split()))
abcd = [[int(i) for i in input().split()] for _ in range(q)]
s = 0
for p in combinations_with_replacement(list(range(1, m + 1)), n):
t = 0
for a, b, c, d in abcd:
t += d * (p[b - 1] - p[a - 1] == c)
... | from itertools import combinations_with_replacement
def main():
n, m, q = list(map(int, input().split()))
abcd = [[int(i) for i in input().split()] for _ in range(q)]
s = 0
for p in combinations_with_replacement(list(range(1, m + 1)), n):
t = 0
for a, b, c, d in abcd:
... | p02695 |
import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
n,m,q=list(map(int,input().split()))
x=[list(map(int,input().split())) for i in range(q)]
for i in range(q):
for j in range(2):
x[i][j]-=1
a=[]
def dfs(v):
if len(v)>n:
return
if len(v)==n:
a.append(... | from itertools import combinations_with_replacement
n,m,q=list(map(int,input().split()))
a,b,c,d=[0]*q,[0]*q,[0]*q,[0]*q
for i in range(q):
x,y,z,w=list(map(int,input().split()))
x-=1
y-=1
a[i],b[i],c[i],d[i]=x,y,z,w
ans=0
for v in combinations_with_replacement(list(range(1,m+1)),n):
res=0... | p02695 |
# C - Many Requirements
n, m, q = list(map(int, input().split()))
lst = []
for i in range(q):
a, b, c, d = list(map(int, input().split()))
lst.append((a, b, c, d)) # 得点を先頭に
def allseq(n, m):
if n == 0:
yield []
else:
for rest in allseq(n - 1, m):
for i in rang... | # C - Many Requirements
from itertools import combinations_with_replacement
n, m, q = list(map(int, input().split()))
lst = []
for i in range(q):
a, b, c, d = list(map(int, input().split()))
lst.append((a, b, c, d))
x = max(sum(d for a, b, c, d in lst if seq[b-1] - seq[a-1] == c)
for seq i... | p02695 |
import itertools
n,m,q=list(map(int,input().split()))
abcd=[list(map(int,input().split()))for _ in range(q)]
ans=0
for i in itertools.combinations_with_replacement(list(range(m)),n):
anss=0
for a,b,c,d in abcd:
if i[b-1]-i[a-1]==c:anss+=d
ans=max(ans,anss)
print(ans) | import itertools
n,m,q=list(map(int,input().split()))
abcd=[list(map(int,input().split()))for _ in range(q)]
print((max(sum(d for a,b,c,d in abcd if i[b-1]-i[a-1]==c)for i in itertools.combinations_with_replacement(list(range(m)),n)))) | p02695 |
import itertools;n,m,q,*l=list(map(int,open(0).read().split()));print((max(sum(d for a,b,c,d in[l[j*4:j*4+4]for j in range(q)]if i[b-1]-i[a-1]==c)for i in itertools.combinations_with_replacement(list(range(m)),n)))) | n,m,q=list(map(int,input().split()))
abcd=[list(map(int,input().split()))for _ in range(q)]
ans=0
import itertools
for i in itertools.combinations_with_replacement(list(range(m)),n):
anss=0
for a,b,c,d in abcd:
if i[b-1]-i[a-1]==c:anss+=d
ans=max(ans,anss)
print(ans) | p02695 |
N,M,Q = list(map(int,input().split()))
a=[0]*Q
b=[0]*Q
c=[0]*Q
d=[0]*Q
for i in range(Q):
a[i],b[i],c[i],d[i] = list(map(int,input().split()))
a[i] -=1
b[i] -=1
def score(A):
tmp=0
for ai,bi,ci,di in zip(a,b,c,d):
if A[bi]-A[ai] == ci:
tmp+=di
return tmp
def ... | n,m,q=list(map(int,input().split()))
a=[0]*q
b=[0]*q
c=[0]*q
d=[0]*q
for i in range(q):
a[i],b[i],c[i],d[i] = list(map(int,input().split()))
a[i]-=1
b[i]-=1
def score(A):
tmp=0
for ai,bi,ci,di in zip(a,b,c,d):
if A[bi]-A[ai] == ci:
tmp+=di
return tmp
def df... | p02695 |
from pprint import pprint
n,m,q = list(map(int, input().split()))
ql = [list(map(int,input().split())) for _ in range(q)]
#print(n)
#print(m)
#print(q)
#pprint(ls)
masterlist = []
minilist = [0] * n
i = 0
def saiki(before_a,i,minilist):
if i > n-1:
masterlist.append([minilist[j... | from pprint import pprint
import itertools
n,m,q = list(map(int, input().split()))
ql = [list(map(int,input().split())) for _ in range(q)]
a_lists = list(itertools.combinations_with_replacement(list(range(m)), n))
#print(a_lists)
dmax = 0
for a_mini in a_lists:
dtemp = 0
for ql_mini i... | p02695 |
import itertools
n,m,q = list(map(int, input().split()))
abc = []
d = []
for _ in range(q):
A,B,C,D = list(map(int, input().split()))
abc.append([A,B,C])
d.append(D)
l = list(range(1,m+1))
point = 0
for v in itertools.combinations_with_replacement(l,n):
p = 0
for i in range(n-1):
... | import itertools
n,m,q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
l = list(range(1,m+1))
point = 0
for v in itertools.combinations_with_replacement(l,n):
p = 0
for a,b,c,d in abcd:
if v[b-1] - v[a-1] == c:
p += d
if p > point:... | p02695 |
n,m,q = list(map(int,input().split()))
from itertools import combinations_with_replacement
a,b,c,d = [],[],[],[]
for i in range(q):
e,f,g,h = list(map(int,input().split()))
a.append(e-1)
b.append(f-1)
c.append(g)
d.append(h)
ans = 0
N = [i+1 for i in range(m)]
for v in combinations_... | from itertools import combinations_with_replacement
n,m,q = list(map(int,input().split()))
L = [i+1 for i in range(m)]
li = [input().split() for i in range(q)]
for i in range(q):
li[i] = [int(x) for x in li[i]]
ans = 0
for v in combinations_with_replacement(L,n):
sum1 = 0
for i in li:
... | p02695 |
from collections import deque
def calc(nums):
ret = 0
for a, b, c, d in req:
if nums[b - 1] - nums[a - 1] == c:
ret += d
return ret
n, m, q = list(map(int, input().split()))
req = [list(map(int, input().split())) for _ in range(q)]
ans = 0
que = deque()
# [1]～[... |
def calc(nums):
ret = 0
for a, b, c, d in req:
if nums[b - 1] - nums[a - 1] == c:
ret += d
return ret
n, m, q = list(map(int, input().split()))
req = [list(map(int, input().split())) for _ in range(q)]
ans = 0
stack = []
# [1]～[m]までキューに追加します。実は[1]だけでもいいです。考え... | p02695 |
from collections import deque
# 数列の点数を計算する関数
def calc(seq):
score = 0
for a, b, c, d in req:
if seq[b - 1] - seq[a - 1] == c:
score += d
return score
n, m, q = list(map(int, input().split()))
req = [list(map(int, input().split())) for _ in range(q)]
ans = 0
que =... | def dfs(seq):
# 返り値は、すべての数列の得点の最大値 ans です。
ans = 0
if len(seq) == n:
# 数列が完成したので、得点を計算します
score_ret = 0
for a, b, c, d in req:
if seq[b-1] - seq[a-1] == c:
score_ret += d
return score_ret # この数列の得点を返します
else:
# まだ数列が完成していません... | p02695 |
from _collections import deque
def cacl(seq):
score = 0
for a, b, c, d in req:
if seq[b-1] - seq[a-1] == c:
score += d
return score
n, m, q = list(map(int, input().split()))
req = [list(map(int, input().split())) for _ in range(q)]
ans = 0
que = deque()
for i in range(... | def dfs(seq):
ans = 0
if len(seq) == n:
score = 0
for a, b, c, d in req:
if seq[b-1] - seq[a-1] == c:
score += d
return score
else:
for i in range(seq[-1], m+1):
next_seq = seq + (i,)
score = dfs(next_seq)
... | p02695 |
n, m, q = list(map(int, input().split()))
l = [[int(i) for i in input().split()] for _ in range(q)]
m -= 1
As = []
def gen_A(x, y, A, c):
global As
if x == n and y == m:
As.append(A)
return
if x < n:
nA = A+str(c)
gen_A(x+1, y, nA, c)
if y < m:
nc = c+1
gen_A(x, y+1, A,... | n, m, q = list(map(int, input().split()))
l = [[int(i) for i in input().split()] for _ in range(q)]
m -= 1
mx = 0
def gen_A(x, y, A, c):
global mx
if x == n and y == m:
pts = 0
for i in l:
if int(A[i[1]-1])-int(A[i[0]-1]) == i[2]:
pts += i[3]
mx = max(mx, pts)
return
... | p02695 |
n, m, q = list(map(int, input().split()))
req = [list(map(int, input().split())) for i in range(q)]
lst = []
if n == 2:
for a in range(1,m+1):
for b in range(a, m+1):
lst.append([a, b])
if n == 3:
for a in range(1,m+1):
for b in range(a, m+1):
for c in range(b, m+1):
... | N, M, Q = list(map(int, input().split()))
req = [list(map(int, input().split())) for i in range(Q)]
maxi = 0
def dfs(A):
global maxi
if len(A) == N: # 終端条件 --- 10 重ループまで回したら処理して打ち切り
ans = 0
for i in range(Q):
if A[req[i][1]-1] - A[req[i][0]-1] == req[i][2]:
ans += req[i][3]
... | p02695 |
import sys
input = sys.stdin.buffer.readline
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict
from itertools import combinations, permutations
from itertools import accumulate
from math import ceil, sqrt, pi
MOD = 10 ** 9 + 7
INF = ... | import sys
input = sys.stdin.buffer.readline
from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(Q)]
lst = list(combinations_with_replacement(list(range(1, M + 1)), N))
ans = 0
for l in lst:
tmp = 0
... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(Q)]
# 1 ~ Mまでの数を用いたN項の重複数列を作成する
arrs = []
for arr in itertools.combinations_with_replacement(list(range(1, M + 1)), N):
arrs.append(list(arr))
answer = - float("inf")
for arr in arrs:
... | import itertools
N, M, Q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(Q)]
# 1 ~ Mまでの数を用いたN項の重複組合せを作成する
arrs = []
for arr in itertools.combinations_with_replacement(list(range(1, M + 1)), N):
arrs.append(list(arr))
#print(len(arrs))
# 各組合せに対し、全クエリを実行して最大値を求める... | p02695 |
import math
import itertools
import sys
import collections
def solve(N,M,Q,ABCD):
ans = 0
A = [i for i in range(1,M+1)]
for p in itertools.combinations_with_replacement(A,N):
tmp = 0
for a,b,c,d in ABCD:
if(p[b-1] - p [a-1] == c):
tmp+=d
an... |
import math
import itertools
def solve(N:int,M:int,Q:int,ABCD:list) -> int:
ans = 0
elements = [i for i in range(1,M+1)] # 数列Aにあり得る要素
# 条件を満たす数列Aを作成
for A in itertools.combinations_with_replacement(elements,N):
total = 0 # 現在の数列の得点を格納する変数
for a,b,c,d in ABCD:
if(... | p02695 |
def main():
import sys
input = sys.stdin.buffer.readline
N, M, Q = (int(i) for i in input().split())
T = [[int(i) for i in input().split()] for j in range(Q)]
def dfs(A):
cur = 0
if len(A) == N:
for a, b, c, d in T:
if A[b-1] - A[a-1] == c:
... | def main():
from itertools import combinations_with_replacement
import sys
input = sys.stdin.buffer.readline
N, M, Q = (int(i) for i in input().split())
T = [[int(i) for i in input().split()] for j in range(Q)]
ans = 0
for C in combinations_with_replacement(list(range(1, M+1)), N):
... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
a = []
b = []
c = []
d = []
for i in range(Q):
ai, bi, ci, di = list(map(int, input().split()))
a.append(ai)
b.append(bi)
c.append(ci)
d.append(di)
ans = 0
for A in list(itertools.combinations_with_replacement(list(range(1... | import itertools
def main():
N, M, Q = list(map(int, input().split()))
a = []
b = []
c = []
d = []
for i in range(Q):
ai, bi, ci, di = list(map(int, input().split()))
a.append(ai)
b.append(bi)
c.append(ci)
d.append(di)
ans = 0
f... | p02695 |
import sys
sys.setrecursionlimit(10**9)
N, M ,Q = list(map(int, input().split()))
abcd = [0 for _ in range(Q)]
for i in range(Q):
abcd[i] = list(map(int, input().split()))
ans = 0
def dfs(A):
global ans
if len(A) == N:
score = 0
for i in range(Q):
if A[abcd[i][1]-1]... | import sys
sys.setrecursionlimit(10**9)
N, M ,Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
def dfs(A):
global ans
if len(A) == N:
score = 0
for a,b,c,d in abcd:
if A[b-1] - A[a-1] == c:
score += d
... | p02695 |
import sys
sys.setrecursionlimit(10**7)
N, M, Q = list(map(int, input().split()))
arr = [list(map(int, input().split())) for _ in range(Q)]
ans = set()
def generate_arr(target):
if len(target) == N:
tmp = 0
for item in arr:
if target[item[1]-1] - target[item[0]-1] == item[2]... | target = []
def dfs(A):
if len(A) == N:
tmp = 0
for a, b, c, d in arr:
if A[b-1] - A[a-1] == c:
tmp += d
target.append(tmp)
return
start = 1
if len(A) != 0:
start = A[-1]
for v in range(start,M+1):
A.append(v)
... | p02695 |
import itertools
N, M, Q = list(map(int, input().split()))
A = list(itertools.combinations_with_replacement(list(range(1, M + 1)), N))
B = []
# print(len(list(A)))
for a in A:
for j in range(N - 1):
flag = True
if a[j] > a[j + 1]:
flag = False
break
if flag:
... | N, M, Q = list(map(int, input().split()))
a = []
b = []
c = []
d = []
ans = 0
def dfs(A):
global ans
if len(A) == N:
now = 0
for i in range(Q):
if A[b[i]] - A[a[i]] == c[i]:
now += d[i]
ans = max(now, ans)
return
if not A: ... | p02695 |
# -*- coding: utf-8 -*-
# sys.setrecursionlimit(100000)
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_... | # -*- coding: utf-8 -*-
from itertools import combinations_with_replacement
def read_int_n():
return list(map(int, input().split()))
def slv(N, M, Q, ABCD):
ans = 0
for a in combinations_with_replacement(list(range(1, M+1)), r=N):
t = 0
for abcd in ABCD:
A, B, C,... | p02695 |
nmq=list(map(int, input().split()))
N=nmq[0]
M=nmq[1]
Q=nmq[2]
ablist=[]
for i in range(Q):
tp=tuple(map(int, input().split()))
ablist.append(tp)
sumlist=[]
alist=[i for i in range(1,M+1)]
import itertools as ite
case=list(ite.combinations_with_replacement(alist,N))
for nowcase in case:
sumd=0
... | nmq=list(map(int, input().split()))
N=nmq[0]
M=nmq[1]
Q=nmq[2]
ablist=[]
for i in range(Q):
tp=tuple(map(int, input().split()))
ablist.append(tp)
sumlist=[]
alist=[i for i in range(1,M+1)]
import itertools
case=list(itertools.combinations_with_replacement(alist,N))
for nowcase in case:
sumd=0
... | p02695 |
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
m = M - 1
def f(s):
if len(s) == N:
return [s]
result = []
if s == '':
r = 0
else:
r = int(s[-1])
for i in range(r, m + 1):
result.extend(f(s + str(i))... | from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
result = 0
for A in combinations_with_replacement(list(range(1, M + 1)), N):
t = 0
for a, b, c, d in abcd:
if A[b - 1] - A[a - 1] == c:
... | p02695 |
import itertools
n,m,q=list(map(int,input().split()))
lis=[]
for i in range(q):
lis.append(list(map(int,input().split())))
M=0
for l in map(list,itertools.combinations(list(range(1,n+m)),n)):
s=0
for j in range(q):
aj=lis[j][0]
bj=lis[j][1]
cj=lis[j][2]
dj=l... | import itertools
n,m,q=list(map(int,input().split()))
lis=[]
for i in range(q):
lis.append(list(map(int,input().split())))
M=0
for l in map(list,itertools.combinations(list(range(1,n+m)),n)):
s=0
for j in range(q):
aj=lis[j][0]
bj=lis[j][1]
cj=lis[j][2]
dj=l... | p02695 |
import itertools
N,M,Q = list(map(int,input().split()))
num_all = [i+1 for i in range(M)]
#print(num_all)
Comb = list(itertools.combinations_with_replacement(num_all,N))
num_l = []
for i in range(Q):
a,b,c,d = list(map(int,input().split()))
num_l.append([a,b,c,d])
#print(num_l)
#print(l... | import itertools
N,M,Q = list(map(int,input().split()))
num_all = [i+1 for i in range(M)]
#print(num_all)
Comb = list(itertools.combinations_with_replacement(num_all,N))
num_l = []
for i in range(Q):
a,b,c,d = list(map(int,input().split()))
num_l.append([a,b,c,d])
#print(num_l)
#print(l... | p02695 |
from functools import lru_cache
N, M, Q = list(map(int, input().split()))
BCD = [[] for _ in range(N)]
for _ in range(Q):
a, b, c, d = list(map(int, input().split()))
BCD[a - 1].append((b - a, c, d))
@lru_cache(maxsize=None)
def search(mi, A):
if len(A) > N:
return 0
ret = 0
... | N, M, Q = list(map(int, input().split()))
BCD = [[] for _ in range(N)]
for _ in range(Q):
a, b, c, d = list(map(int, input().split()))
BCD[a - 1].append((b - a, c, d))
def search(mi, A):
if len(A) > N:
return 0
ret = 0
for i in range(1, A[-1] + 1):
ret = max(ret, sear... | p02695 |
N,M,Q = list(map(int,(input().split())))
a = [0]*Q
b = [0]*Q
c = [0]*Q
d = [0]*Q
for i in range(Q):
a[i],b[i],c[i],d[i] = list(map(int,(input().split())))
lun = [0]*N
l = []
def make(n):
if len(n) > N:
return 0
if int(n) > 3234566667:
return 0
else:
p = []
... | import itertools
N,M,Q = list(map(int,(input().split())))
a = [0]*Q
b = [0]*Q
c = [0]*Q
d = [0]*Q
for i in range(Q):
a[i],b[i],c[i],d[i] = list(map(int,(input().split())))
l = list(itertools.combinations_with_replacement(list(range(1,M+1)), N))
nax = 0
for x in l:
score = 0
for i in range(... | p02695 |
# -*- coding: utf-8 -*-
# モジュールのインポート
import itertools
# 標準入力の取得
N,M,Q = list(map(int, input().split()))
a,b,c,d = [],[],[],[]
for q in range(Q):
a_q,b_q,c_q,d_q = list(map(int, input().split()))
a.append(a_q)
b.append(b_q)
c.append(c_q)
d.append(d_q)
# 求解処理
l = list(range(1, M+1))
... | # -*- coding: utf-8 -*-
# モジュールのインポート
import itertools
# 標準入力の取得
N, M, Q = list(map(int, input().split()))
a, b, c, d = [], [], [], []
for q in range(Q):
a_q, b_q, c_q, d_q = list(map(int, input().split()))
a.append(a_q)
b.append(b_q)
c.append(c_q)
d.append(d_q)
def get_score(A: tu... | p02695 |
import itertools
n,m,q = list(map(int,input().split()))
abcd = [list(map(int,input().split())) for i in range(q)]
ans = 0
for iter in itertools.combinations_with_replacement(list(range(1,m+1)),n):
result = 0
for i in range(q):
a,b,c,d = abcd[i][0],abcd[i][1],abcd[i][2],abcd[i][3]
if it... | import itertools
n,m,q = list(map(int,input().split()))
abcd = [list(map(int,input().split())) for i in range(q)]
ans = 0
for A in itertools.combinations_with_replacement(list(range(1,m+1)),n):
tmp = 0
for i in range(q):
a,b,c,d = abcd[i]
if A[b-1] - A[a-1] == c:
tmp += ... | p02695 |
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(10**5)
def search(seq, min_n, max_n, n, req):
ans = 0
if len(seq) == n:
for a, b, c, d in req:
if seq[b-1] - seq[a-1] == c:
ans += d
return ans
else:
for i in range(min_n, max_n+1):
new_seq = seq + [i]
ans =... | def search(v, n, m, seq, scs):
if len(seq) == n:
ans = 0
for r in scs:
if seq[r[1]-1] - seq[r[0]-1] == r[2]:
ans += r[3]
return ans
ans = 0
for i in range(v, m+1):
tmp = search(i, n, m, seq + [i], scs)
ans = max(ans, tmp)
ret... | p02695 |
N, M, Q = list(map(int, input().split()))
#N: 正整数列の長さ, M:正整数列の最大値, Q: 4つの整数の組みの数
Q_li = [list(map(int, input().split())) for _ in range(Q)]
def dfs(now, n, num): #nowはこれから生成するもの
if n == 0:
make_group.append(now)
else:
for i in range(num, M+1):
dfs(now+[i], n-1, i)
make... | N, M, Q = list(map(int, input().split()))
#N: 正整数列の長さ, M:正整数列の最大値, Q: 4つの整数の組みの数
a_l = [0]*Q
b_l = [0]*Q
c_l = [0]*Q
d_l = [0]*Q
for i in range(Q):
a_l[i], b_l[i], c_l[i], d_l[i] = list(map(int, input().split()))
def calc_score(now):
score = 0
for a, b, c, d in zip(a_l, b_l, c_l, d_l):
... | p02695 |
N,M,Q=list(map(int,input().split()))
a=[0]*Q
b=[0]*Q
c=[0]*Q
d=[0]*Q
for i in range(Q):
a[i],b[i],c[i],d[i]=list(map(int,input().split()))
import itertools
ans=0
for A in itertools.combinations_with_replacement(list(range(1,M+1)),N):
A_=list(A)
s=0
for i in range(Q):
if A_[b[i]-1]-A_[a[i]-1... | def dfs(seq):
ans = 0
if len(seq) == n:
kou = 0
for u in data:
if seq[u[1]-1] - seq[u[0]-1] == u[2]:
kou+=u[3]
return kou
else:#len(seq)==N-1からの遷都を考えると良い
for i in range(seq[-1], m+1):
seq_next=seq+[i]
ans = max(an... | p02695 |
def dfs(seq):
ans = 0
if len(seq) == n:
kou = 0
for u in data:
if seq[u[1]-1] - seq[u[0]-1] == u[2]:
kou+=u[3]
return kou
else:#len(seq)==N-1からの遷都を考えると良い
for i in range(seq[-1], m+1):
seq_next=seq+[i]
ans = max(an... | n,m,q=list(map(int,input().split()))
def dfs(seq):
u=0
if len(seq)==n:
ans=0
for a,b,c,d in data:
if seq[b-1]-seq[a-1]==c:
ans+=d
return ans
else:
for i in range(seq[-1],m+1):
seq_next=seq+[i]
u=max(u,dfs(seq_nex... | p02695 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n, m, q = list(map(int,input().split()))
ABCD = [None] * q
for i in range(q):
a, b, c, d = list(map(int,input().split()))
ABCD[i] = (a, b,... | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from itertools import combinations_with_replacement
def resolve():
n, m, q = list(map(int, input().split()))
ABCD = [tuple(map(int, input().split())) for _ in range(q)]
... | p02695 |
from operator import itemgetter
n,m,q=list(map(int,input().split()))
l=[]
fa=[m]*n
def check_list(la: list):
for i in range(len(la)-1):
if la[i+1]<la[i] or la[i]>m or la[i]<1:
return False
return True
def dfs(i,a):
if not check_list(a):
return -1
eli... | import itertools
n,m,q=list(map(int,input().split()))
ql=[]
for _ in range(q):
ql.append(tuple(map(int,input().split())))
def check(t):
ret=0
for q in ql:
if t[q[1]-1]-t[q[0]-1]==q[2]:
ret+=q[3]
return ret
print((max(list(map(check,itertools.combinations_with_repla... | p02695 |
from itertools import combinations_with_replacement
n,m,q=list(map(int,input().split()))
l=[list(map(int,input().split())) for _ in range(q)]
# n,m,q=3,4,3
# l=[[1,3,3,100], [1,2,2,10], [2,3,2,10]]
A=list(combinations_with_replacement(list(range(1,m+1)),n))
res=0
for i in range(len(A)):
tmp=0
... | from itertools import combinations_with_replacement
n,m,q=list(map(int,input().split()))
l=[list(map(int,input().split())) for _ in range(q)]
A=list(combinations_with_replacement(list(range(1,m+1)),n))
res=0
for i in range(len(A)):
tmp=0
for j in range(len(l)):
if A[i][l[j][1]-1]-A[i][l[... | p02695 |
from sys import stdin
import itertools
N,M,Q=list(map(int, (stdin.readline().strip().split())))
q=[]
num_list=[]
number=[]
score=[0]
for i in range(1,M+1):number.append(i)
for _ in range(Q):
a,b,c,d=list(map(int, (stdin.readline().strip().split())))
q.append([a,b,c,d])
def dfs(num_list,i):
if i=... | from sys import stdin
import itertools
N,M,Q=list(map(int, (stdin.readline().strip().split())))
q=[]
num_list=[]
number=[]
score=[0]
daburi=[]
for i in range(1,M+1):number.append(i)
for _ in range(Q):
a,b,c,d=list(map(int, (stdin.readline().strip().split())))
q.append([a,b,c,d])
def dfs(num_list,i):... | p02695 |
N, M, Q = list(map(int, input().split()))
S=[[0 for i in range(4)] for j in range(Q)]
for i in range(Q):
inputS=list(map(int,input().split()))
S[i][0]=inputS[0]
S[i][1]=inputS[1]
S[i][2]=inputS[2]
S[i][3]=inputS[3]
S2=[]
maxNum=0
for a in range(11):
for b in range(a,11):
for ... | N, M, Q = list(map(int, input().split()))
S=[[0 for i in range(4)] for j in range(Q)]
for i in range(Q):
inputS=list(map(int,input().split()))
S[i][0]=inputS[0]
S[i][1]=inputS[1]
S[i][2]=inputS[2]
S[i][3]=inputS[3]
S2=[]
maxNum=0
for a in range(1,M+1):
for b in range(a,M+1):
... | p02695 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.