AtCoderなど過去問 AtCoder Beginner Contest 231 B – Election
B - Election
n = int(input())
s =
ss = set(s)
cnt = 0
maxi = 0
for i in ss:
cnt = 0
for j in s:
i...
AtCoderなど過去問 AtCoderなど過去問 AtCoder Beginner Contest 232 B – Caesar Cipher
B - Caesar Cipher
s = list(input())
t = list(input())
ok = False
for i in range(26):
if ok:
break
...
AtCoderなど過去問 AtCoder Beginner Contest 002 D – 派閥
AtCoder Beginner Contest 002 D - 派閥
import itertools
n , m = map(int,input().split())
r = []
for i in range(m):
...
AtCoderなど過去問 AtCoder Beginner Contest 128 C – Switches
AtCoder Beginner Contest 128 C - Switches
from itertools import product
n,m = map(int,input().split())
light = []
...
AtCoderなど過去問 ALDS_11_C – 幅優先探索
ALDS_11_C - 幅優先探索
import sys
n = int(input())
v = []
for i in range(n):
v.append(])
def bfs(s):
que = []
...
AtCoderなど過去問 ALDS_11_B – 深さ優先探索
ALDS_11_B - 深さ優先探索
import sys
n = int(input())
v = []
for i in range(n):
v.append(])
d = * n
f = * n
now = 0
d...
AtCoderなど過去問 DPL_1_B – 0,1ナップザック問題
DPL_1_B - 0,1ナップザック問題
N, W = map(int,input().split())
value = []
weight = []
for i in range(N):
va,we = map(int,...
AtCoderなど過去問 ALDS_10_A – フィボナッチ数
ALDS_10_A - フィボナッチ数
n = int(input())
fib = * (n + 1)
for i in range(n + 1):
if i > 1:
fib = fib + fi...
AtCoderなど過去問 全国統一プログラミング王決定戦本戦 A – Abundant Resources
全国統一プログラミング王決定戦本戦 A - Abundant Resources
n = int(input())
a = list(map(int,input().split()))
s = []
s.append(0)
fo...
AtCoderなど過去問 ALDS_5_A – 総当たり
ALDS_5_A - 総当たり
以下のように、単純な総当たりだとTLE
import sys
def solve(a,l,ans):
for i in range(2 ** l):
cnt = 0
...