buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
from functools import reduce
from collections import deque
def operate(dq, op):
if op[0] == 'i':
dq.appendleft(int(op[7:]))
else:
k = op[6]
if k == 'F':
dq.popleft()
elif k == 'L':
dq.pop()
else:
dq.remove(int(op[7:]))
return dq
... | from functools import reduce
from collections import deque
def operate(dq, op):
if op[0] == 'i':
dq.appendleft(int(op[7:]))
else:
k = op[6]
if k == 'F':
dq.popleft()
elif k == 'L':
dq.pop()
else:
try:
dq.remove(int(op[... | [["+", 0, 57, 75, 76, 8, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 76, 8, 196, 0, 246, 0, 102], ["+", 75, 76, 8, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 76, 8, 196, 0, 246, 0, 671, 0, 22], ["+", 75, 76, 8, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 121 | 6 |
from collections import deque
n = int(input())
dl = deque()
for _ in range(n):
cmd = input()
if ' ' in cmd:
op,v = cmd.split()
else:
op = cmd
if op == 'insert' : dl.appendleft(v)
elif op == 'delete' : dl.remove(v)
elif op == 'deleteFirst': dl.popleft()
elif op ==... | from collections import deque
n = int(input())
dl = deque()
for _ in range(n):
cmd = input()
if ' ' in cmd:
op,v = cmd.split()
else:
op = cmd
if op == 'insert' : dl.appendleft(v)
elif op == 'delete' :
try: dl.remove(v)
except ValueError: pass
elif op ==... | [["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 102], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 22], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 106 | 6 |
n = eval(input())
lis = []
ans = 0
for i in range(n):
com = input()
if com[0] == 'i':
lis.append(com[7:])
elif com[6] == ' ':
try:
lis.pop(~lis[::-1].index(com[7:]))
except:
pass
elif com[6] == 'F':
lis.pop()
else:
bot += 1
print(' ... | n = eval(input())
lis = []
ans = 0
for i in range(n):
com = input()
if com[0] == 'i':
lis.append(com[7:])
elif com[6] == ' ':
try:
lis.pop(~lis[::-1].index(com[7:]))
except:
pass
elif com[6] == 'F':
lis.pop()
else:ans += 1
print(' '.join( m... | [["-", 75, 76, 8, 196, 0, 1, 0, 677, 31, 22], ["+", 75, 76, 8, 196, 0, 1, 0, 677, 31, 22]] | 5 | 128 | 2 |
from collections import deque
n = int(input())
d = deque()
for i in range(n):
line = input().split()
if len(line) == 2:
command, ele = line
else:
command = line[0]
if command == 'insert':
d.appendleft(ele)
elif command == 'delete':
d.remove(ele)
elif command == 'd... | from collections import deque
n = int(input())
d = deque()
for i in range(n):
line = input().split()
if len(line) == 2:
command, ele = line
else:
command = line[0]
if command == 'insert':
d.appendleft(ele)
elif command == 'delete':
if ele in d:
d.remove(... | [["+", 0, 57, 75, 665, 64, 196, 0, 57, 0, 121], ["+", 75, 665, 64, 196, 0, 57, 15, 666, 0, 22], ["+", 75, 665, 64, 196, 0, 57, 15, 666, 667, 267], ["+", 0, 57, 75, 665, 64, 196, 0, 57, 0, 102], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 500, 22]] | 5 | 119 | 5 |
from collections import deque
n = int(input())
q = deque()
for i in range(n):
command = input()
if command[0] == 'i':
q.appendleft(command[7])
elif command[6] == ' ':
try:
q.remove(command[7])
except Exception as e:
pass
elif command[6] == 'F':
q... | from collections import deque
n = int(input())
q = deque()
for i in range(n):
command = input()
if command[0] == 'i':
q.appendleft(command[7:])
elif command[6] == ' ':
try:
q.remove(command[7:])
except Exception as e:
pass
elif command[6] == 'F':
... | [["+", 0, 652, 3, 4, 0, 206, 206, 663, 0, 102]] | 5 | 109 | 21 |
from collections import deque
q = deque()
n = int(input().strip())
for _ in range(n):
cmd = input()
if cmd == "deleteFirst":
q.popleft()
elif cmd == "deleteLast":
q.pop()
elif cmd.startswith("insert "):
v = cmd[7:]
q.appendleft(v)
elif cmd.startswith("delete "):
... | from collections import deque
q = deque()
n = int(input().strip())
for _ in range(n):
cmd = input()
if cmd == "deleteFirst":
q.popleft()
elif cmd == "deleteLast":
q.pop()
elif cmd.startswith("insert "):
v = cmd[7:]
q.appendleft(v)
elif cmd.startswith("delete "):
... | [["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 102], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 22], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 115 | 6 |
from collections import deque
n = int(input())
d = deque()
cmd = ['com', 0]
for i in range(n):
cmd = input().split()
if cmd[0] == 'insert':
d.appendleft(int(cmd[1]))
elif cmd[0] == 'delete':
d.remove(int(cmd[1]))
elif cmd[0] == 'deleteFirst':
d.popleft()
elif cmd[0] == 'dele... | from collections import deque
n = int(input())
d = deque()
cmd = ['com', 0]
for i in range(n):
cmd = input().split()
if cmd[0] == 'insert':
d.appendleft(int(cmd[1]))
elif cmd[0] == 'delete':
try:
d.remove(int(cmd[1]))
except ValueError:
pass
elif cmd[0] =... | [["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 102], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 22], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 125 | 6 |
import sys
from collections import deque
d = deque()
n = int(input())
lines = sys.stdin.readlines()
for i in range(n):
ins = lines[i].split()
command = ins[0]
if command == "insert":
d.appendleft(ins[1])
elif command == "delete":
d.remove(ins[1])
elif command == "deleteFirst":
... | import sys
from collections import deque
d = deque()
n = int(input())
lines = sys.stdin.readlines()
for i in range(n):
ins = lines[i].split()
command = ins[0]
if command == "insert":
d.appendleft(ins[1])
elif command == "delete":
try:
d.remove(ins[1])
except:
... | [["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 102], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 119 | 5 |
#!/usr/bin/env python
#-*- coding:utf-8 -*-
from collections import deque
def parse_cmd(deque,input_cmd):
if input_cmd[0] == 'insert':
deque.appendleft(input_cmd[1])
elif input_cmd[0] == 'delete':
deque.remove(input_cmd[1])
elif input_cmd[0] == 'deleteFirst':
deque.popleft()
elif input_cmd[0] == 'deleteLast'... | #!/usr/bin/env python
#-*- coding:utf-8 -*-
from collections import deque
def parse_cmd(deque,input_cmd):
if input_cmd[0] == 'insert':
deque.appendleft(input_cmd[1])
elif input_cmd[0] == 'delete':
try:
deque.remove(input_cmd[1])
except:
pass
elif input_cmd[0] == 'deleteFirst':
deque.popleft()
elif in... | [["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 102], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 152 | 5 |
import sys
from collections import deque
n = int(sys.stdin.readline())
q = deque()
for i in range(n):
c = sys.stdin.readline()[:-1]
if c[0] == 'i':
q.appendleft(c[7:])
elif c[6] == ' ':
q.remove(c[7:])
elif c[6] == 'F':
q.popleft()
else:
q.pop()
print(*q) | import sys
from collections import deque
n = int(sys.stdin.readline())
q = deque()
for i in range(n):
c = sys.stdin.readline()[:-1]
if c[0] == 'i':
q.appendleft(c[7:])
elif c[6] == ' ':
try:
q.remove(c[7:])
except:
pass
elif c[6] == 'F':
q.popleft(... | [["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 102], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 112 | 5 |
import sys
from collections import deque
n = int(input())
q = deque()
for i in range(n):
c = sys.stdin.readline()
if c[0] == 'i':
q.appendleft(c[7:])
elif c[6] == ' ':
try:
q.remove(c[7:])
except:
pass
elif c[6] == 'F':
q.popleft()
else:
... | import sys
from collections import deque
n = int(input())
q = deque()
for i in range(n):
c = sys.stdin.readline()[:-1]
if c[0] == 'i':
q.appendleft(c[7:])
elif c[6] == ' ':
try:
q.remove(c[7:])
except:
pass
elif c[6] == 'F':
q.popleft()
else:
... | [["+", 8, 196, 0, 1, 0, 662, 12, 206, 0, 70], ["+", 0, 1, 0, 662, 12, 206, 206, 663, 0, 102], ["+", 0, 662, 12, 206, 206, 663, 0, 664, 17, 33], ["+", 0, 662, 12, 206, 206, 663, 0, 664, 28, 612], ["+", 8, 196, 0, 1, 0, 662, 12, 206, 0, 73]] | 5 | 108 | 8 |
from collections import deque
n = int(input())
Q = deque()
for i in range(n):
command = input().split()
if command[0] == "insert":
Q.appendleft(command[1])
elif command[0] == "deleteFirst":
Q.popleft()
elif command[0] == "deleteLast":
Q.popright()
elif command[0] == "delete"... | from collections import deque
n = int(input())
Q = deque()
for i in range(n):
command = input().split()
if command[0] == "insert":
Q.appendleft(command[1])
elif command[0] == "deleteFirst":
Q.popleft()
elif command[0] == "deleteLast":
Q.pop()
elif command[0] == "delete":
... | [["-", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22]] | 5 | 118 | 2 |
from collections import deque
query = int(input())
l = deque()
for _ in range(query):
command = input()
if command == "deleteFirst":
try:
l.popleft()
except:
pass
elif command == "deleteLast":
try:
l.pop()
except:
pass
else:... | from collections import deque
query = int(input())
l = deque()
for _ in range(query):
command = input().strip()
if command == "deleteFirst":
try:
l.popleft()
except:
pass
elif command == "deleteLast":
try:
l.pop()
except:
pass
... | [["+", 0, 1, 0, 662, 12, 652, 63, 319, 0, 131], ["+", 0, 1, 0, 662, 12, 652, 63, 319, 319, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["-", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22]] | 5 | 120 | 6 |
# -*- coding: utf-8 -*-
import sys
import os
from collections import deque
N = int(input())
q = deque()
for i in range(N):
lst = input().split()
command = lst[0]
if command == 'insert':
v = int(lst[1])
q.appendleft(v)
elif command == 'delete':
v = int(lst[1])
q.remove... | # -*- coding: utf-8 -*-
import sys
import os
from collections import deque
N = int(input())
q = deque()
for i in range(N):
lst = input().split()
command = lst[0]
if command == 'insert':
v = int(lst[1])
q.appendleft(v)
elif command == 'delete':
v = int(lst[1])
if v in ... | [["+", 0, 57, 75, 665, 64, 196, 0, 57, 0, 121], ["+", 75, 665, 64, 196, 0, 57, 15, 666, 0, 22], ["+", 75, 665, 64, 196, 0, 57, 15, 666, 667, 267], ["+", 0, 57, 75, 665, 64, 196, 0, 57, 0, 102], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 500, 22]] | 5 | 121 | 9 |
# coding: utf-8
# Here your code !
import collections
s=int(input())
deq =collections.deque()
for i in range(s):
n=input().split()
if n[0]=="insert":
deq.appendleft(n[1])
elif n[0]=="delete":
deq.remove(n[1])
elif n[0]=="deleteFirst":
deq.popleft()
elif n[0]=="deleteLast":
... | # coding: utf-8
# Here your code !
import collections
s=int(input())
deq =collections.deque()
for i in range(s):
n=input().split()
if n[0]=="insert":
deq.appendleft(n[1])
elif n[0]=="delete":
try:
deq.remove(n[1])
except ValueError:
pass
elif n[0]=="delet... | [["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 102], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 22], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 118 | 6 |
from collections import deque
n = int(input())
L = deque()
for i in range(n):
cmdline = input().split()
if cmdline[0] == "insert":
L.appendleft(cmdline[1])
elif cmdline[0] == "delete":
L.remove(cmdline[1])
elif cmdline[0] == "deleteFirst":
L.popleft()
elif cmdline[0] == "deleteLast":
L.pop()
print(" ".j... | from collections import deque
n = int(input())
L = deque()
for i in range(n):
cmdline = input().split()
if cmdline[0] == "insert":
L.appendleft(cmdline[1])
elif cmdline[0] == "delete":
try:
L.remove(cmdline[1])
except ValueError: pass
elif cmdline[0] == "deleteFirst... | [["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 102], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 22], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 113 | 6 |
from collections import deque
dq = deque()
for _ in [None]*int(input()):
s = input()
if s == "deleteFirst":
dq.popleft()
elif s == "deleteLast":
dq.pop()
else:
a, b = s.split()
if a == "insert":
dq.appendleft(b)
else:
dq.remove(b)
print(" "... | from collections import deque
dq = deque()
for _ in [None]*int(input()):
s = input()
if s == "deleteFirst":
dq.popleft()
elif s == "deleteLast":
dq.pop()
else:
a, b = s.split()
if a == "insert":
dq.appendleft(b)
else:
if b in dq:
... | [["+", 0, 57, 75, 76, 8, 196, 0, 57, 0, 121], ["+", 75, 76, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 75, 76, 8, 196, 0, 57, 15, 666, 667, 267], ["+", 0, 57, 75, 76, 8, 196, 0, 57, 0, 102], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 500, 22]] | 5 | 95 | 5 |
from collections import deque
n=int(input())
dq=deque()
for i in range(n):
cmd=input().split()
if cmd[0]=="insert":
dq.appendleft(cmd[1])
elif cmd[0]=="deleteFirst":
dq.popleft()
elif cmd[0]=="deleteLast":
dq.pop()
elif cmd[0]=="delete":
try:
dq.remove(cm... | from collections import deque
n=int(input())
dq=deque()
for i in range(n):
cmd=input().split()
if cmd[0]=="insert":
dq.appendleft(cmd[1])
elif cmd[0]=="deleteFirst":
dq.popleft()
elif cmd[0]=="deleteLast":
dq.pop()
elif cmd[0]=="delete":
try:
dq.remove(cm... | [["-", 0, 671, 0, 196, 0, 1, 0, 652, 63, 22], ["-", 0, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 654], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 655], ["-", 0, 196, 0, 1, 0, 652, 3, 4, 0, 25], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 117 | 7 |
from collections import deque
from sys import stdin
n = int(input())
ddl = deque()
for i in stdin:
inp = i.split()
if len(inp) == 2:
op, data = inp
data = int(data)
else: op, data = inp[0], None
if op == 'insert':
ddl.appendleft(data,)
elif op == 'delete':
ddl.remove(... | from collections import deque
from sys import stdin
n = int(input())
ddl = deque()
for i in stdin:
inp = i.split()
if len(inp) == 2:
op, data = inp
data = int(data)
else: op, data = inp[0], None
if op == 'insert':
ddl.appendleft(data,)
elif op == 'delete':
try:
... | [["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 102], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 22], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 135 | 6 |
dq = deque()
num = int(sys.stdin.readline())
line = sys.stdin.readlines()
for i in range(num):
order = line[i].split()
if order[0] == 'insert':
dq.appendleft(order[1])
elif order[0] == 'deleteFirst':
dq.popleft()
elif order[0] == 'deleteLast':
dq.pop()
else:
if ord... | from collections import deque
import sys
dq = deque()
num = int(sys.stdin.readline())
line = sys.stdin.readlines()
for i in range(num):
order = line[i].split()
if order[0] == 'insert':
dq.appendleft(order[1])
elif order[0] == 'deleteFirst':
dq.popleft()
elif order[0] == 'deleteLast':... | [["+", 36, 36, 36, 36, 0, 656, 0, 686, 0, 314], ["+", 36, 36, 0, 656, 0, 686, 687, 673, 0, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 686, 0, 487], ["+", 36, 36, 0, 656, 0, 686, 141, 673, 0, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 596, 0, 487], ["+", 36, 36, 0, 656, 0, 596, 141, 673, 0, 22]] | 5 | 123 | 6 |
from collections import deque
queue = deque([])
n = int(input())
for i in range(n):
commands = input().split(" ")
command = commands[0]
if command == "insert":
queue.appendleft(commands[1])
elif command == "delete":
queue.remove(commands[1])
elif command == "deleteFirst":
... | from collections import deque
queue = deque([])
n = int(input())
for i in range(n):
commands = input().split(" ")
command = commands[0]
if command == "insert":
queue.appendleft(commands[1])
elif command == "delete":
try:
queue.remove(commands[1])
except ValueError:... | [["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 102], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 22], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 127 | 6 |
from collections import deque
queue = deque()
for _ in range(int(input())):
commands = input().split(" ")
if command[0] == "insert":
queue.appendleft(commands[1])
elif command[0] == "delete":
try:
queue.remove(commands[1])
except ValueError:
pass
elif co... | from collections import deque
queue = deque()
for _ in range(int(input())):
commands = input().split(" ")
if commands[0] == "insert":
queue.appendleft(commands[1])
elif commands[0] == "delete":
try:
queue.remove(commands[1])
except ValueError:
pass
elif ... | [["-", 8, 196, 0, 57, 15, 666, 0, 206, 51, 22], ["+", 8, 196, 0, 57, 15, 666, 0, 206, 51, 22], ["-", 0, 57, 75, 665, 15, 666, 0, 206, 51, 22], ["+", 0, 57, 75, 665, 15, 666, 0, 206, 51, 22]] | 5 | 119 | 16 |
# -*- coding: utf-8 -*-
from collections import deque
if __name__ == '__main__':
n = int(input())
L = deque()
for _ in range(n):
command = input().split(" ")
if command[0] == "insert":
L.appendleft(command[1])
elif command[0] == "delete":
L.remove(command[1... | # -*- coding: utf-8 -*-
from collections import deque
if __name__ == '__main__':
n = int(input())
L = deque()
for _ in range(n):
command = input().split(" ")
if command[0] == "insert":
L.appendleft(command[1])
elif command[0] == "delete":
try:
... | [["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 247], ["+", 0, 57, 75, 665, 64, 196, 0, 246, 0, 102], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 672], ["+", 75, 665, 64, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 124 | 5 |
from collections import deque
dq = deque()
for _ in range(int(input())):
ss = input()
if ss == "deleteFirst":
del dq[0]
elif ss == "deleteLast":
del dq[-1]
else:
c, s = ss.split()
s = int(s)
if c == "insert":
dq.append(s)
elif c == "delete":
... | from collections import deque
dq = deque()
for _ in range(int(input())):
ss = input()
if ss == "deleteFirst":
del dq[0]
elif ss == "deleteLast":
del dq[-1]
else:
c, s = ss.split()
s = int(s)
if c == "insert":
dq.appendleft(s)
elif c == "delete"... | [["-", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 0, 656, 0, 1, 0, 652, 63, 319, 500, 22], ["-", 0, 656, 0, 1, 0, 652, 63, 319, 0, 131], ["-", 0, 656, 0, 1, 0, 652, 63, 319, 319, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24]... | 5 | 110 | 7 |
import collections,sys
d=collections.deque()
input()
for e in sys.stdin.readlines():
if'i'==e[0]:d.appendleft(e.split()[1])
else:
if' '==e[6]:
m=e.split()[1]
if m in d:d.remove(m)
elif len(e)%2:d.pop()
else:d.popleft()
print(*d)
| import collections,sys
d=collections.deque()
input()
for e in sys.stdin:
if'i'==e[0]:d.appendleft(e.split()[1])
else:
if' '==e[6]:
m=e.split()[1]
if m in d:d.remove(m)
elif len(e)%2:d.pop()
else:d.popleft()
print(*d)
| [["-", 0, 656, 0, 7, 12, 652, 63, 319, 0, 131], ["-", 0, 656, 0, 7, 12, 652, 63, 319, 319, 22], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 25]] | 5 | 106 | 19 |
import collections,sys
def s():
d=collections.deque()
input()
for e in sys.stdin:
if'i'==e[0]:d.appendleft(e[7:])
else:
if' '==e[6]:
m=e[7:]
if m in d:d.remove(m)
elif len(e)%2:d.pop()
else:d.popleft()
print(*d)
s()
| import collections,sys
def s():
d=collections.deque()
input()
for e in sys.stdin:
if'i'==e[0]:d.appendleft(e[7:-1])
else:
if' '==e[6]:
m=e[7:-1]
if m in d:d.remove(m)
elif len(e)%2:d.pop()
else:d.popleft()
print(*d)
s()
| [["+", 3, 4, 0, 206, 206, 663, 0, 664, 17, 33], ["+", 3, 4, 0, 206, 206, 663, 0, 664, 28, 612], ["+", 0, 662, 12, 206, 206, 663, 0, 664, 17, 33], ["+", 0, 662, 12, 206, 206, 663, 0, 664, 28, 612]] | 5 | 104 | 4 |
from collections import deque
d = deque()
for _ in range(int(input())):
a = input()
if "i" == a[0]: d.appendleft(int(a[7]))
elif "F" == a[6]: d.popleft()
elif "L" == a[6]: d.pop()
else:
try: d.remove(int(a[7]))
except: pass
print(*d)
| from collections import deque
d = deque()
for _ in range(int(input())):
a = input()
if "i" == a[0]: d.appendleft(int(a[7:]))
elif "F" == a[6]: d.popleft()
elif "L" == a[6]: d.pop()
else:
try: d.remove(int(a[7:]))
except: pass
print(*d)
| [["+", 0, 652, 3, 4, 0, 206, 206, 663, 0, 102]] | 5 | 103 | 2 |
from collections import deque
n = int(input())
a = deque()
for i in range(n):
c = input()
if c == "deleteFirst":
a.popleft()
elif c == "deleteLast":
a.pop()
else:
c, v = c.split()
if c == "insert":
a.extendleft(v)
else:
try:
... | from collections import deque
n = int(input())
a = deque()
for i in range(n):
c = input()
if c == "deleteFirst":
a.popleft()
elif c == "deleteLast":
a.pop()
else:
c, v = c.split()
if c == "insert":
a.appendleft(v)
else:
try:
... | [["-", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22]] | 5 | 102 | 2 |
from collections import deque
n=int(input())
que_r=deque()
data=deque()
for i in range(n):
s=input()
l=len(s)
if s[0]=="i":
que_r.appendleft(s[7:])
elif s[6]==" ":
try:
que_r.remove(s[7:])
except: pass
elif l>10:
que_r.popleft()
elif l>6:
que... | from collections import deque
n=int(input())
que_r=deque()
for i in range(n):
s=input()
l=len(s)
if s[0]=="i":
que_r.appendleft(s[7:])
elif s[6]==" ":
try:
que_r.remove(s[7:])
except: pass
elif l>10:
que_r.popleft()
elif l>6:
que_r.pop()
pr... | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22]] | 5 | 111 | 7 |
n = int(input())
ls = []
bp = 0
for i in range(n):
cmd = input()
if cmd[0] == "i":
ls.append(cmd[7:])
elif cmd[6] == " ":
try:
x = ls[::-1].index(cmd[7:])
if x!=-1:
del ls[-x-1]
except:
pass
elif cmd[6] == "F":
ls.pop()
else:
bp += 1
print(ls)
print(" ".join(map(str, ls[bp:][::-1]))) | n = int(input())
ls = []
bp = 0
for i in range(n):
cmd = input()
if cmd[0] == "i":
ls.append(cmd[7:])
elif cmd[6] == " ":
try:
x = ls[::-1].index(cmd[7:])
if x!=-1:
del ls[-x-1]
except:
pass
elif cmd[6] == "F":
ls.pop()
else:
bp += 1
print(" ".join(map(str, ls[bp:][::-1]))) | [["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24]] | 5 | 145 | 4 |
n = int(input())
S = set(int, input().split())
q = int(input())
T = set(int, input().split())
print(len(S&T)) | n = int(input())
S = set(input().split())
q = int(input())
T = set(input().split())
print(len(S&T)) | [["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 21]] | 5 | 53 | 4 |
n = int(input())
S = set(input().split())
q = int(input())
T = set(input().split())
print(S & T) | n = int(input())
S = set(input().split())
q = int(input())
T = set(input().split())
print(len(S & T)) | [["+", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 46 | 3 |
from collections import Counter
def main():
N = int(input())
S = tuple(map(int, input().split()))
Q = int(input())
T = tuple(map(int, input().split()))
counter = Counter(S)
cnt = 0
for i in T:
cnt += counter[i]
print(cnt)
main()
| from collections import Counter
def main():
N = int(input())
S = tuple(map(int, input().split()))
Q = int(input())
T = tuple(map(int, input().split()))
counter = Counter(S)
cnt = 0
for i in T:
cnt += any([counter[i]])
print(cnt)
main()
| [["+", 8, 196, 0, 1, 0, 677, 12, 652, 63, 22], ["+", 0, 1, 0, 677, 12, 652, 3, 4, 0, 24], ["+", 0, 677, 12, 652, 3, 4, 0, 634, 0, 70], ["+", 0, 677, 12, 652, 3, 4, 0, 634, 0, 73], ["+", 0, 1, 0, 677, 12, 652, 3, 4, 0, 25]] | 5 | 86 | 5 |
# -*- coding: utf-8 -*-
input()
s = set(input().split())
input()
t = set(input().split())
print(int(s & t))
| # -*- coding: utf-8 -*-
input()
s = set(input().split())
input()
t = set(input().split())
print(len(s & t))
| [["-", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22]] | 5 | 40 | 2 |
// ALDS1_4_A.cpp
// Linear Search
// ???????????§?°?
#include <iostream>
#include <set>
using namespace std;
int intersectionCnt(set<int> &S, set<int> &T) {
int C = 0;
set<int>::iterator it1 = S.begin();
set<int>::iterator it2 = T.begin();
while (it1 != S.end() && it2 != T.end()) {
if (*it2 == *it1) {
... | // ALDS1_4_A.cpp
// Linear Search
// ???????????§?°?
#include <iostream>
#include <set>
using namespace std;
int intersectionCnt(set<int> &S, set<int> &T) {
int C = 0;
set<int>::iterator it1 = S.begin();
set<int>::iterator it2 = T.begin();
while (it1 != S.end() && it2 != T.end()) {
if (*it2 == *it1) {
... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 229 | 4 |
#include <stdio.h>
#include <string.h>
#define k 1046527
char a[100];
char b[100];
char H[k][14];
int zhengshu(char a) {
if (a == 'A')
return 1;
else if (a == 'C')
return 2;
else if (a == 'G')
return 3;
else if (a == 'T')
return 4;
else
return 0;
}
long long zhuanhuan(char b[]) {
long lo... | #include <stdio.h>
#include <string.h>
#define k 1046527
char a[100];
char b[100];
char H[k][14];
int zhengshu(char a) {
if (a == 'A')
return 1;
else if (a == 'C')
return 2;
else if (a == 'G')
return 3;
else if (a == 'T')
return 4;
else
return 0;
}
long long zhuanhuan(char b[]) {
long lo... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 508 | 4 |
import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
HashSet<String> set = new HashSet<String>();
int n = sc.nextInt();
for (int i = 0; i < n; i++) {
String str = sc.next();
if (str.equals("ins... | import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
HashSet<String> set = new HashSet<String>();
int n = sc.nextInt();
for (int i = 0; i < n; i++) {
String str = sc.next();
if (str.equals("ins... | [["-", 15, 15, 0, 492, 3, 4, 0, 492, 141, 22], ["+", 15, 15, 0, 492, 3, 4, 0, 492, 141, 22]] | 3 | 151 | 2 |
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args) {
// TODO ?????????????????????????????????????????????
int n, i;
Scanner scan = new Scanner(System.in);
n = scan.nextInt();
Set<String> d = new HashSet<String>();... | import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args) {
// TODO ?????????????????????????????????????????????
int n, i;
Scanner scan = new Scanner(System.in);
n = scan.nextInt();
Set<String> d = new HashSet<String>();... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 47]] | 3 | 161 | 2 |
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import javax.swing.text.DefaultEditorKit.InsertBreakAction;
public class Main {
static final String INSERT = "insert";
static final String FIND = "find";
static Map<String, Boolean> dictMap = new HashMap<>(1000000);
public static void ... | import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import javax.swing.text.DefaultEditorKit.InsertBreakAction;
public class Main {
static final String INSERT = "insert";
static final String FIND = "find";
static Map<String, Boolean> dictMap = new HashMap<>(1000000);
public static void ... | [["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 79], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 215]] | 3 | 223 | 2 |
import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
HashSet<String> dic = new HashSet<>();
int n = scanner.nextInt();
for (int i = 0; i < n; i++) {
String command = scanner.next();
Strin... | import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
HashSet<String> dic = new HashSet<>();
int n = scanner.nextInt();
for (int i = 0; i < n; i++) {
String command = scanner.next();
Strin... | [["-", 8, 527, 0, 520, 0, 528, 0, 5, 0, 491], ["+", 8, 527, 0, 520, 0, 528, 0, 5, 0, 491]] | 3 | 175 | 2 |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(bf.readLine());
HashSet<String> hashS... | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(bf.readLine());
HashSet<String> hashS... | [["-", 0, 492, 3, 4, 0, 492, 3, 4, 0, 499], ["+", 0, 492, 3, 4, 0, 492, 3, 4, 0, 499]] | 3 | 162 | 2 |
#include <iostream>
#include <set>
#include <string>
using namespace std;
int n;
string S, T;
int main() {
cin >> n;
set<string> s;
for (int i = 1; i <= n; i++) {
cin >> S >> T;
if (S == "insert")
s.insert(T);
else {
decltype(s)::iterator it = s.find(T);
if (it != s.end())
c... | #include <iostream>
#include <set>
#include <string>
using namespace std;
int n;
string S, T;
int main() {
cin >> n;
set<string> s;
for (int i = 1; i <= n; i++) {
cin >> S >> T;
if (S == "insert")
s.insert(T);
else {
decltype(s)::iterator it = s.find(T);
if (it != s.end())
c... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 116 | 4 |
#include <iostream>
#include <set>
#include <string>
using namespace std;
// data
set<string> dict;
int main() {
// input
int n;
cin >> n;
string cmd, str;
while (n--) {
cin >> cmd >> str;
if (cmd == "insert") {
dict.insert(str);
} else if (cmd == "find") {
cout << ((dict.find(str... | #include <iostream>
#include <set>
#include <string>
using namespace std;
// data
set<string> dict;
int main() {
// input
int n;
cin >> n;
string cmd, str;
while (n--) {
cin >> cmd >> str;
if (cmd == "insert") {
dict.insert(str);
} else if (cmd == "find") {
cout << ((dict.find(str... | [["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 106 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool table[20000000];
int num(char c) {
if (c == 'A')
return 1;
if (c == 'C')
return 2;
if (c == 'G')
return 3;
if (c == 'T')
return 4;
}
ll hs(string str) {
ll n = 1;
for (int i = 0; i < str.size(); i++) {
if (i)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool table[20000000];
int num(char c) {
if (c == 'A')
return 1;
if (c == 'C')
return 2;
if (c == 'G')
return 3;
if (c == 'T')
return 4;
}
ll hs(string str) {
ll n = 0;
for (int i = 0; i < str.size(); i++) {
if (i)
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 108], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 253 | 4 |
#include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n = 0;
cin >> n;
set<string> dic;
for (int i = 0; i < n; i++) {
string buf1, buf2;
cin >> buf1 >> buf2;
if (buf2[0] == 'i') {
... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n = 0;
cin >> n;
set<string> dic;
for (int i = 0; i < n; i++) {
string buf1, buf2;
cin >> buf1 >> buf2;
if (buf1[0] == 'i') {
... | [["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22]] | 1 | 140 | 19 |
#include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n = 0;
cin >> n;
set<string> dic;
for (int i = 0; i < n; i++) {
string buf1, buf2;
cin >> buf1 >> buf2;
if (buf2[0] == 'i') {
... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n = 0;
cin >> n;
set<string> dic;
for (int i = 0; i < n; i++) {
string buf1, buf2;
cin >> buf1 >> buf2;
if (buf1 == "insert") {
... | [["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 13], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 104], ["-", 0, 57, 15, 339, 51, 16, 12... | 1 | 140 | 19 |
n = gets.to_i
moji = { }
n.times do |i|
command, arr = gets.split(" ")
if "insert" == command then
moji[arr] = true
elsif "find" == command then
puts moji ? 'yes' : 'no'
end
end
| n = gets.to_i
moji = { }
n.times do |i|
command, arr = gets.split(" ")
if "insert" == command then
moji[arr] = true
elsif "find" == command then
puts moji[arr] ? 'yes' : 'no'
end
end
| [["+", 0, 652, 3, 4, 0, 754, 15, 742, 0, 70], ["+", 0, 652, 3, 4, 0, 754, 15, 742, 0, 22], ["+", 0, 652, 3, 4, 0, 754, 15, 742, 0, 73]] | 4 | 60 | 3 |
n = gets.to_i
dic = []
(0..n-1).each do |i|
order, word = gets.chomp.split(" ")
if(order=="insert") then
dic[word] = true
end
if(order=="find")
if (dic[word] == true) then
puts "yes"
else
puts "no"
end
end
end | n = gets.to_i
dic = {}
(0..n-1).each do |i|
order, word = gets.chomp.split(" ")
if(order=="insert") then
dic[word] = true
end
if(order=="find")
if (dic[word] == true) then
puts "yes"
else
puts "no"
end
end
end | [["-", 36, 36, 0, 493, 0, 662, 12, 516, 0, 70], ["-", 36, 36, 0, 493, 0, 662, 12, 516, 0, 73], ["+", 36, 36, 0, 493, 0, 662, 12, 767, 0, 45], ["+", 36, 36, 0, 493, 0, 662, 12, 767, 0, 46]] | 4 | 82 | 4 |
def add word
@dic[hasF word] << word
end
def hashF word
temp = word.dup
temp.gsub!("A", "1")
temp.gsub!("C", "2")
temp.gsub!("G", "3")
temp.gsub!("T", "4")
return temp.to_i(5) % @dic.length
end
def find word
@dic[hashF word].each{|v| return true if v == word}
return false
end
n = gets.to_i
@dic ... | def add word
@dic[hashF word] << word
end
def hashF word
temp = word.dup
temp.gsub!("A", "1")
temp.gsub!("C", "2")
temp.gsub!("G", "3")
temp.gsub!("T", "4")
return temp.to_i(5) % @dic.length
end
def find word
@dic[hashF word].each{|v| return true if v == word}
return false
end
n = gets.to_i
@dic... | [["-", 8, 736, 0, 738, 31, 742, 0, 652, 735, 22], ["+", 8, 736, 0, 738, 31, 742, 0, 652, 735, 22]] | 4 | 159 | 18 |
#!/usr/bin/env ruby
n = gets.chomp.to_i
dict = {}
n.times do
action, str = gets.chomp.split
str = str.each_codepoint.join.to_i
case action
when 'insert'
dict[str] = 1
when 'find'
puts dict[str] ? 'yes' : 'no'
end
end | #!/usr/bin/env ruby
n = gets.chomp.to_i
dict = {}
n.times do
action, str = gets.chomp.split
str = str.each_codepoint.to_a.join.to_i
case action
when 'insert'
dict[str] = 1
when 'find'
puts dict[str] ? 'yes' : 'no'
end
end | [["+", 0, 662, 12, 652, 486, 652, 486, 652, 735, 22], ["+", 8, 736, 0, 662, 12, 652, 486, 652, 17, 131]] | 4 | 65 | 2 |
N = int(input())
A = [input() for i in range(N)]
D = {}
for row in A:
order, key = row.split()
if order[0] == "i":
D[value] = 1
else:
if key in D.keys():
print("yes")
else:
print("no")
| N = int(input())
A = [input() for i in range(N)]
D = {}
for row in A:
order, key = row.split()
if order[0] == "i":
D[key] = 1
else:
if key in D.keys():
print("yes")
else:
print("no")
| [["-", 64, 196, 0, 1, 0, 662, 31, 206, 206, 22], ["+", 64, 196, 0, 1, 0, 662, 31, 206, 206, 22]] | 5 | 81 | 2 |
n = int(input())
dic = ()
for i in range(n):
x = input()
if 'insert' in x:
dic.add(x.strip('insert '))
else :
if x.strip('find ') in dic:
print('yes')
else :
print('no')
| n = int(input())
dic = set()
for i in range(n):
x = input()
if 'insert' in x:
dic.add(x.strip('insert '))
else :
if x.strip('find ') in dic:
print('yes')
else :
print('no')
| [["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22]] | 5 | 73 | 1 |
n = int( input( ) )
dic = {}
output = []
for i in range( n ):
cmd, word = input( ).split( " " )
if "insert" == cmd:
dic[ word ] = True
elif "find" == cmd:
if not dic.get( word ):
output.append( "yes" )
else:
output.append( "no" )
print(( "\n".join( output ) )) | n = int( input( ) )
dic = {}
output = []
for i in range( n ):
cmd, word = input( ).split( " " )
if "insert" == cmd:
dic[ word ] = True
elif "find" == cmd:
if not dic.get( word ):
output.append( "no" )
else:
output.append( "yes" )
print(( "\n".join( output ) )) | [["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6]] | 5 | 98 | 4 |
gets
s = gets.split.map(&:to_i)
gets
t = gets.split.map(&:to_i)
puts (s && t).size | gets
s = gets.split.map(&:to_i)
gets
t = gets.split.map(&:to_i)
puts (s & t).size | [["-", 3, 4, 0, 652, 486, 739, 0, 738, 17, 98], ["+", 3, 4, 0, 652, 486, 739, 0, 738, 17, 67]] | 4 | 32 | 2 |
#MODE = "stdio"
#require 'matrix'
#include Math
line = Array.new
if(defined? MODE)
line = STDIN.read.split("\n")
else
tmp = '500
0 933 743 262 529 700 508 752 256 256 119 711 351 843 705 108 393 330 366 169 932 917 847 972 868 980 223 549 592 164 169 551 427 190 624 635 920 944 310 862 484 363 301 710 236 876 43... | MODE = "stdio"
#require 'matrix'
#include Math
line = Array.new
if(defined? MODE)
line = STDIN.read.split("\n")
else
tmp = '500
0 933 743 262 529 700 508 752 256 256 119 711 351 843 705 108 393 330 366 169 932 917 847 972 868 980 223 549 592 164 169 551 427 190 624 635 920 944 310 862 484 363 301 710 236 876 431... | [["+", 36, 36, 36, 36, 0, 493, 0, 662, 31, 743], ["+", 36, 36, 36, 36, 0, 493, 0, 662, 0, 32], ["+", 36, 36, 0, 493, 0, 662, 12, 557, 0, 62], ["+", 36, 36, 0, 493, 0, 662, 12, 557, 0, 6]] | 4 | 104 | 5 |
gets
array_1 = gets.chomp.split(" ").map(&:to_i).sort
gets
array_2 = gets.chomp.split(" ").map(&:to_i).sort
def binary_search(val, array)
left = 0
right = array.length
while left < right do
mid = (left+right) / 2
if array[mid] == val
return true
elsif val < array[mid]
right = mid
el... |
gets
array_1 = gets.chomp.split(" ").map(&:to_i).sort.uniq
gets
array_2 = gets.chomp.split(" ").map(&:to_i).sort.uniq
def binary_search(val, array)
left = 0
right = array.length
while left < right do
mid = (left+right) / 2
if array[mid] == val
return true
elsif val < array[mid]
right = ... | [["+", 36, 36, 0, 493, 0, 662, 12, 652, 17, 131], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22]] | 4 | 123 | 18 |
iipt=lambda:int(input())
miipt=lambda:list(map(int,input().split(" ")))
import bisect
N=iipt()
c=miipt()
M=iipt()
qu=miipt()
ans=0
for q in qu:
a=0
b=N-1
while b-a>1:
x=(a+b)//2
if c[a]==q or c[b]==q:
ans+=1
break
if c[x]<q:
a=x
else:
... | iipt=lambda:int(input())
miipt=lambda:list(map(int,input().split(" ")))
import bisect
N=iipt()
c=miipt()
M=iipt()
qu=miipt()
ans=0
for q in qu:
a=0
b=N-1
while b-a>1:
x=(a+b)//2
if c[a]==q or c[b]==q:
ans+=1
break
if c[x]<q:
a=x
else:
... | [["-", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94]] | 5 | 149 | 1 |
n, s, q, t = input(), list(set(map(int, input().split()))), input(), set(map(int, input().split()))
# print(sum(i in s for i in t))
def binary_search(i):
global s
l, r = 0, len(s)
while l < r:
m = (l + r) // 2
sm = s[m]
if sm == i:
return 1
elif i < sm:
... | n, s, q, t = input(), list(set(map(int, input().split()))), input(), set(map(int, input().split()))
# print(sum(i in s for i in t))
s.sort()
def binary_search(i):
global s
l, r = 0, len(s)
while l < r:
m = (l + r) // 2
sm = s[m]
if sm == i:
return 1
elif i < sm... | [["+", 0, 656, 0, 1, 0, 652, 63, 319, 500, 22], ["+", 0, 656, 0, 1, 0, 652, 63, 319, 0, 131], ["+", 0, 656, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 127 | 5 |
count_n = int(input())
N = []
n = input()
N = n.split()
N = list(map(lambda x: int(x), N))
count_p = int(input())
P = []
p = input()
P = p.split()
P = list(map(lambda x: int(x), P))
N.sort()
P.sort()
def b(i, l):
left = 0
right = len(l)
while left < right:
mid = int((left + right) / 2)
i... | count_n = int(input())
N = []
n = input()
N = n.split()
N = list(map(lambda x: int(x), N))
count_p = int(input())
P = []
p = input()
P = p.split()
P = list(map(lambda x: int(x), P))
N.sort()
P.sort()
def b(i, l):
left = 0
right = len(l)
while left < right:
mid = int((left + right) / 2)
... | [["-", 36, 36, 36, 36, 0, 656, 0, 7, 31, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 7, 31, 22], ["-", 36, 36, 36, 36, 0, 656, 0, 7, 12, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 7, 12, 22], ["-", 8, 196, 0, 57, 15, 652, 3, 4, 0, 22], ["+", 8, 196, 0, 57, 15, 652, 3, 4, 0, 22]] | 5 | 185 | 8 |
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_B&lang=jp
#????????¢?´¢
#???????????§???????????°????????????????????¢?????´????????????????????????????????¢?????´???????????¨????????????????????????
def binary_search(list_1, list_2):
count = 0
for b in list_2:
left_index = 0
... | #http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_B&lang=jp
#????????¢?´¢
#???????????§???????????°????????????????????¢?????´????????????????????????????????¢?????´???????????¨????????????????????????
def binary_search(list_1, list_2):
count = 0
for b in list_2:
left_index = 0
... | [["+", 64, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25]] | 5 | 145 | 6 |
#!/usr/bin/python
#coding: utf-8
import re
a=input()
s=set(input().split())
b=input()
t=set(input().split())
print(list(s&t) if list(s&t) else 0) | #!/usr/bin/python
#coding: utf-8
import re
a=input()
s=set(input().split())
b=input()
t=set(input().split())
print(len(list(s&t)) if list(s&t) else 0) | [["+", 0, 652, 3, 4, 0, 41, 0, 652, 63, 22], ["+", 3, 4, 0, 41, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 56 | 3 |
int(input())
s = set(input().split())
int(input())
t = set(input().split())
print(len(s and t)) | int(input())
s = set(input().split())
int(input())
t = set(input().split())
print(len(s & t)) | [["-", 3, 4, 0, 652, 3, 4, 0, 679, 17, 355], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 67]] | 5 | 45 | 2 |
n = input()
S = input().split()
q = input()
T = input().split()
print(len(S&T)) | n = input()
S = set(input().split())
q = input()
T = set(input().split())
print(len(S&T)) | [["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 37 | 6 |
def binary_search():
input()
s = set(input().split())
input()
t = set(input().split())
print(len(s & t))
if __name__ == '__main__':
linear_search() | def binary_search():
input()
s = set(input().split())
input()
t = set(input().split())
print(len(s & t))
if __name__ == '__main__':
binary_search() | [["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22]] | 5 | 54 | 2 |
s = input()
snum = set(map(int, input().split()))
q = input()
qnum = set(map(int, input().split()))
print(len(snum and qnum)) | s = input()
snum = set(map(int, input().split()))
q = input()
qnum = set(map(int, input().split()))
print(len(snum & qnum)) | [["-", 3, 4, 0, 652, 3, 4, 0, 679, 17, 355], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 67]] | 5 | 53 | 2 |
#include <stdio.h>
#include <string.h>
#define M 1046537
#define NIL (-1)
#define L 14
char H[M][L];
int getChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
else
return 0;
}
long long getKey(char str[]) {
... | #include <stdio.h>
#include <string.h>
#define M 1046537
#define NIL (-1)
#define L 14
char H[M][L];
int getChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
else
return 0;
}
long long getKey(char str[]) {
... | [["-", 0, 7, 8, 9, 0, 57, 64, 37, 0, 13], ["+", 0, 7, 8, 9, 0, 57, 64, 37, 0, 13]] | 0 | 480 | 2 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define HASH_M 97
#define HASH_A 128
#define STR_SIZE 16
typedef struct DATA {
struct DATA *next;
char str[STR_SIZE];
} Data;
Data dlist[HASH_M]; //?????????????´?????????????????????????
int getHashAddr(char str[STR_SIZE], int M, int a) {
int i = 0, ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define HASH_M 9973
#define HASH_A 128
#define STR_SIZE 16
typedef struct DATA {
struct DATA *next;
char str[STR_SIZE];
} Data;
Data dlist[HASH_M]; //?????????????´?????????????????????????
int getHashAddr(char str[STR_SIZE], int M, int a) {
int i = 0... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6]] | 0 | 641 | 4 |
#include <stdio.h>
#include <string.h>
#define M 45454545 /* your task*/
#define L 14
char H[M][L]; /* Hash Table */
int getChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
}
/* convert a string into an integer... | #include <stdio.h>
#include <string.h>
#define M 1046527 /* your task*/
#define L 14
char H[M][L]; /* Hash Table */
int getChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
}
/* convert a string into an integer ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 514 | 2 |
#include <stdio.h>
#include <string.h>
#define M 1046527
#define NIL (-1)
#define L 14
char H[M][L];
int getChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
else
return 0;
}
long long getKey(char str[]) {
l... | #include <stdio.h>
#include <string.h>
#define M 1046527
#define NIL (-1)
#define L 14
char H[M][L];
int getChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
else
return 0;
}
long long getKey(char str[]) {
l... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 621 | 4 |
#include <stdio.h>
#include <string.h>
#define M 100000000
#define L 14
char H[M][L];
int GetChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
else
return 0;
}
int h1(int key) { return key % M; }
int h2(int k... | #include <stdio.h>
#include <string.h>
#define M 1000000
#define L 14
char H[M][L];
int GetChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
else
return 0;
}
int h1(int key) { return key % M; }
int h2(int key... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 505 | 2 |
#include <stdio.h>
#include <string.h>
#define M 1000033 /* your task*/
#define L 14
char H[M][L]; /* Hash Table */
int getChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
}
/* convert a string into an integer ... | #include <stdio.h>
#include <string.h>
#define M 1000033 /* your task*/
#define L 14
char H[M][L]; /* Hash Table */
int getChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
}
/* convert a string into an integer ... | [["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]] | 0 | 493 | 2 |
#include <stdio.h>
#include <string.h>
#define Len 14
#define N 1000000
char H[N][Len];
int getChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
}
long long getKey(char str[]) {
long long sum = 0, p = 1, i;
... | #include <stdio.h>
#include <string.h>
#define Len 14
#define N 999997
char H[N][Len];
int getChar(char ch) {
if (ch == 'A')
return 1;
else if (ch == 'C')
return 2;
else if (ch == 'G')
return 3;
else if (ch == 'T')
return 4;
}
long long getKey(char str[]) {
long long sum = 0, p = 1, i;
f... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 15, 23, 0, 16, 31, 16, 12, 144, 0, 145], ["+", 15, 23, 0, 16, 31, 16, 12, 103, 0, 104], ["+", 15, 23, 0, 16, 31, 16, 12, 103, 0, 44], ["-", 0, 57, 15, 23, 0, 16, 31, 2, 63, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 2, 63, 22], [... | 0 | 491 | 12 |
def check c, n, k, list
i = 0
0.upto k-1 do
s = 0
while s + list[i] <= c
s += list[i]
i += 1
return n if i == n
end
end
return i
end
def solve n, k, list
left = 0
right = 100000 * 100000
while right - left > 1
mid = (left + right)/2
v = check mid n, k ,list
if v >= n
right = mid
else
... |
def check c, n, k, list
i = 0
0.upto k-1 do
s = 0
while s + list[i] <= c
s += list[i]
i += 1
return n if i == n
end
end
return i
end
def solve n, k, list
left = 0
right = 100000 * 100000
while right - left > 1
mid = (left + right)/2
v = check mid, n, k, list
if v >= n
right = mid
else... | [["+", 8, 170, 0, 662, 12, 652, 3, 4, 0, 21], ["-", 8, 170, 0, 121, 75, 95, 0, 662, 12, 22], ["+", 8, 170, 0, 121, 75, 95, 0, 662, 12, 22], ["-", 36, 36, 36, 36, 0, 493, 0, 652, 486, 612], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 486, 22]] | 4 | 143 | 5 |
def available?(ary, p, k)
sum = 0
tracks = 1
ary.each{ |w|
if sum + w <= p
sum += w
else
sum = w
tracks += 1
end
}
tracks <= k
end
def binary(ary, l, r, k)
if l == r
return l
else
c = ((r - l)/2).to_i + 1 + l
if available?(ary, c, k)
binary(ary, l, c-1, k)
... | def available?(ary, p, k)
sum = 0
tracks = 1
ary.each{ |w|
if sum + w <= p
sum += w
else
sum = w
tracks += 1
end
}
tracks <= k
end
def binary(ary, l, r, k)
if l == r
return l
else
c = ((r - l)/2).to_i + 1 + l
if available?(ary, c, k)
binary(ary, l, c-1, k)
... | [["-", 75, 95, 0, 652, 3, 4, 0, 738, 17, 72], ["-", 75, 95, 0, 652, 3, 4, 0, 738, 12, 612]] | 4 | 209 | 2 |
package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var s = bufio.NewScanner(os.Stdin)
var w = bufio.NewWriter(os.Stdout)
func main() {
s.Split(bufio.ScanWords)
n := 0
if s.Scan() {
n, _ = strconv.Atoi(s.Text())
}
T := make(map[string]int)
for i := 0; s.Scan() && i < n; i++ {
cmd := s.Text()
if cm... | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var s = bufio.NewScanner(os.Stdin)
var w = bufio.NewWriter(os.Stdout)
func main() {
s.Split(bufio.ScanWords)
n := 0
if s.Scan() {
n, _ = strconv.Atoi(s.Text())
}
T := make(map[string]int)
for i := 0; s.Scan() && i < n; i++ {
cmd := s.Text()
if cm... | [["+", 8, 196, 0, 57, 64, 196, 0, 116, 0, 117], ["+", 0, 7, 8, 196, 0, 57, 64, 196, 0, 165]] | 7 | 212 | 18 |
import java.util.Scanner;
// ALDS1_4_D
public class Main {
int check(int[] A, int k, int p) {
int sum = 0;
int n = 0;
int v = 0;
for (int i = 0; i < A.length; i++) {
if (A[i] > p)
break;
if (sum + A[i] <= p)
sum += A[i];
else {
sum = A[i];
n++;
... | import java.util.Scanner;
// ALDS1_4_D
public class Main {
int check(int[] A, int k, int p) {
int sum = 0;
int n = 0;
int v = 0;
for (int i = 0; i < A.length; i++) {
if (A[i] > p)
break;
if (sum + A[i] <= p)
sum += A[i];
else {
sum = A[i];
n++;
... | [["-", 0, 492, 3, 4, 0, 492, 3, 4, 0, 499], ["+", 0, 492, 3, 4, 0, 492, 3, 4, 0, 499]] | 3 | 325 | 2 |
import java.util.Scanner;
import java.util.stream.IntStream;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int k = scanner.nextInt();
int[] w = new int[n];
for (int i = 0; i < n; i++)
w[i] = scanner.nextIn... | import java.util.Scanner;
import java.util.stream.IntStream;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int k = scanner.nextInt();
int[] w = new int[n];
for (int i = 0; i < n; i++)
w[i] = scanner.nextIn... | [["+", 8, 196, 0, 503, 49, 200, 51, 16, 17, 72], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 12, 499]] | 3 | 262 | 2 |
import java.io.*;
class Main {
public static void main(String[] args) {
// BufferedReader br = new BufferedReader(new
// InputStreamReader(System.in));
try {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
// n:???????????°???k:?????... | import java.io.*;
class Main {
public static void main(String[] args) {
try {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
int n = Integer.parseInt(str.split(" ")[0]);
int k = Integer.parseInt(str.split(" ")[1]);
int[] nimotu =... | [["-", 0, 57, 15, 15, 0, 16, 31, 16, 17, 60], ["+", 0, 57, 15, 15, 0, 16, 31, 16, 17, 19]] | 3 | 316 | 14 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] inputs = br.readLine().split(" ");
int n = Integer... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] inputs = br.readLine().split(" ");
int n = Integer... | [["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 290 | 2 |
import java.io.BufferedReader;
// import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
// System.setIn(new FileInputStream("./ALDS1_4_D-i... | import java.io.BufferedReader;
// import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
// System.setIn(new FileInputStream("./ALDS1_4_D-i... | [["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 307 | 37 |
import java.util.*;
public class Main {
public static int check(long p, int[] T, int k, int n) {
int i = 0;
for (int j = 0; j < k; j++) {
long s = 0;
while (s + T[i] <= p) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
public static void... | import java.util.*;
public class Main {
public static int check(long p, int[] T, int k, int n) {
int i = 0;
for (int j = 0; j < k; j++) {
long s = 0;
while (s + T[i] <= p) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
public static void... | [["-", 0, 52, 15, 15, 0, 16, 31, 16, 12, 22], ["-", 8, 196, 0, 52, 15, 15, 0, 16, 17, 47], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 17, 47], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 12, 22], ["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 253 | 6 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String args[]) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] string = br.readLine().split(" ");
int n = Integer.pa... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String args[]) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] string = br.readLine().split(" ");
int n = Integer.pa... | [["-", 8, 196, 0, 52, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 17, 19], ["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 20], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47]] | 3 | 374 | 4 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = 0;
int k = 0;
int[] weights = null;
try {
String[] ... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = 0;
int k = 0;
int[] weights = null;
try {
String[] ... | [["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 342 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int items = sc.nextInt();
int trucks = sc.nextInt();
int[] weights = new int[items];
for (int i = 0; i < items; i++) {
int t = sc.nextInt();
weights[i] = t;
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int items = sc.nextInt();
int trucks = sc.nextInt();
int[] weights = new int[items];
for (int i = 0; i < items; i++) {
int t = sc.nextInt();
weights[i] = t;
... | [["-", 8, 498, 0, 195, 8, 196, 0, 37, 0, 22], ["+", 8, 498, 0, 195, 8, 196, 0, 37, 0, 22]] | 3 | 283 | 2 |
/* AOJ My Practice
* author: Leonardone @ NEETSDKASU
*/
#include <stdio.h>
int ws[100000] = {0};
int main(void) {
int n, k, w, i, mx = 0, sum = 0;
scanf("%d %d", &n, &k);
if (k > n) {
k = n;
}
for (i = 0; i < n; i++) {
scanf("%d", &w);
ws[i] = w;
sum += w;
if (w > mx) {
mx = w;
... | /* AOJ My Practice
* author: Leonardone @ NEETSDKASU
*/
#include <stdio.h>
int ws[100000] = {0};
int main(void) {
int n, k, w, i, mx = 0, sum = 0;
scanf("%d %d", &n, &k);
if (k > n) {
k = n;
}
for (i = 0; i < n; i++) {
scanf("%d", &w);
ws[i] = w;
sum += w;
if (w > mx) {
mx = w;
... | [["-", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["-", 0, 11, 12, 16, 12, 23, 0, 16, 31, 22], ["-", 0, 11, 12, 16, 12, 23, 0, 16, 17, 85], ["-", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25]] | 0 | 261 | 4 |
#include <stdio.h>
int N, K, W[200005], i, j, r, l, m;
int bs(int p) {
int i, t = 0, c = 1;
for (i = 0; i < N; i++) {
if (W[i] > p)
return 0;
if (t + W[i] > p) {
c++;
t = 0;
}
t += W[i];
}
return c <= K;
}
int main() {
scanf("%d%d", &N, &K);
for (i = 0; i < N; i++)
scan... | #include <stdio.h>
int N, K, W[200005], i, j, r, l, m;
int bs(int p) {
int i, t = 0, c = 1;
for (i = 0; i < N; i++) {
if (W[i] > p)
return 0;
if (t + W[i] > p) {
c++;
t = 0;
}
t += W[i];
}
return c <= K;
}
int main() {
scanf("%d%d", &N, &K);
for (i = 0; i < N; i++)
scan... | [["-", 8, 9, 0, 7, 10, 34, 12, 11, 12, 13], ["+", 8, 9, 0, 7, 10, 34, 12, 11, 12, 13], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 17, 33], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 205 | 6 |
#include <stdio.h>
int ch(int *w, int p, int n, int k) {
int i, t = 0, c = 1;
for (i = 0; i < n; i++) {
if (w[i] > p)
return 0;
if (w[i] + t > p) {
c += 1;
t = 0;
}
t += w[i];
}
return c <= k;
}
int main(void) {
int m, n, k, i, w[10000];
int l = 0, r = 1000000000;
scanf("... | #include <stdio.h>
int ch(int *w, int p, int n, int k) {
int i, t = 0, c = 1;
for (i = 0; i < n; i++) {
if (w[i] > p)
return 0;
if (w[i] + t > p) {
c += 1;
t = 0;
}
t += w[i];
}
return c <= k;
}
int main(void) {
int m, n, k, i, w[100000];
int l = 0, r = 1000000000;
scanf(... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 217 | 4 |
#include <stdio.h>
#include <string.h>
int check(int *A, int num, int min_w, int max_w, int truck_n) {
int i = 0;
int sum = 0;
int ans = 0;
int t_n = truck_n;
int left = min_w;
int right = max_w;
int mid;
while (left < right) {
mid = (left + right) / 2;
t_n = truck_n;
sum = 0;
for (i... | #include <stdio.h>
#include <string.h>
int check(int *A, int num, int min_w, int max_w, int truck_n) {
int i = 0;
int sum = 0;
int ans = 0;
int t_n = truck_n;
int left = min_w;
int right = max_w;
int mid;
while (left <= right) {
mid = (left + right) / 2;
t_n = truck_n;
sum = 0;
for (... | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 19]] | 0 | 303 | 2 |
#include <stdio.h>
int n, k, line[1000000];
int binarysearch(int bw) {
int i, temp, t = 1;
for (i = 0, temp = 0; i < n; i++) {
if (line[i] > bw)
return 0;
if (temp + line[i] > bw) {
t++;
temp = 0;
}
temp += line[i];
}
return t <= k;
}
int main(void) {
int left = 0, right = 1 ... | #include <stdio.h>
int n, k, line[1000000];
int binarysearch(int bw) {
int i, temp, t = 1;
for (i = 0, temp = 0; i < n; i++) {
if (line[i] > bw)
return 0;
if (temp + line[i] > bw) {
t++;
temp = 0;
}
temp += line[i];
}
return t <= k;
}
int main(void) {
int left = 0, right = 1 ... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 208 | 2 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, bus, i, muda, ans = 0, sum = 0, weight = 0, mudajougen;
int *W;
scanf("%d %d", &n, &bus);
W = malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &W[i]);
sum += W[i];
if (ans < W[i])
ans = W[i];
}
if (ans < sum / bus)... | #include <stdio.h>
#include <stdlib.h>
int main() {
int n, bus, i, muda, ans = 0, sum = 0, weight = 0, mudajougen;
int *W;
scanf("%d %d", &n, &bus);
W = malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &W[i]);
sum += W[i];
if (ans < W[i])
ans = W[i];
}
if (ans < sum / bus)... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 0 | 226 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, i = 0, j = 0;
cin >> n >> k;
vector<int> w(n, 0);
vector<int> track(k, 0);
vector<int> t_init(track);
int P;
int sum_w = 0;
for (int i = 0; i < n; i++) {
cin >> w[i];
sum_w += w[i];
}
P =... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, i = 0, j = 0;
cin >> n >> k;
vector<int> w(n, 0);
vector<int> track(k, 0);
vector<int> t_init(track);
int P;
int sum_w = 0;
for (int i = 0; i < n; i++) {
cin >> w[i];
sum_w += w[i];
}
P =... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 194 | 5 |
//
// main.cpp
// ALDS1_4_D
//
// Created by ptyuan on 2018/10/25.
// Copyright © 2018 Sy. All rights reserved.
//
#include <cstdio>
#include <iostream>
using namespace std;
int T[100000];
int n = 0;
int k = 0;
int check(int p) {
int count = 0;
for (int i = 0; i < k; i++) {
int s = 0;
while (s + T[i]... | //
// main.cpp
// ALDS1_4_D
//
// Created by ptyuan on 2018/10/25.
// Copyright © 2018 Sy. All rights reserved.
//
#include <cstdio>
#include <iostream>
using namespace std;
int T[100000];
int n = 0;
int k = 0;
int check(int p) {
int count = 0;
for (int i = 0; i < k; i++) {
int s = 0;
while (s + T[co... | [["-", 51, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22]] | 1 | 226 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<cmath>
using namespace std;
int w[100010];
int f(int P, int n, int k) {
int sum = 0, p = P, i;
for (i = 0; i < n;) {
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<cmath>
using namespace std;
int w[100010];
int f(int P, int n, int k) {
int sum = 0, p = P, i;
for (i = 0; i < n;) {
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 270 | 2 |
#include <iostream>
using namespace std;
int n, k;
int *w;
bool clear(int P) {
int cnt = 1;
int W = 0;
for (int i = 0; i < n; i++) {
if (w[i] > P) {
return false;
}
if (W + w[i] > P) {
cnt++;
if (cnt > k) {
return false;
}
W = w[i];
} else {
W += w[... | #include <iostream>
using namespace std;
int n, k;
int *w;
bool clear(int P) {
int cnt = 1;
int W = 0;
for (int i = 0; i < n; i++) {
if (w[i] > P) {
return false;
}
if (W + w[i] > P) {
cnt++;
if (cnt > k) {
return false;
}
W = w[i];
} else {
W += w[... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 212 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define iota(i, n, b, s) \
for (int i = int(b); i != int((b) + (s) * (n)); i += (s))
#define range(i, n, m) \
iota(i, (((n) > (m)) ? ((n) - (m)) : ((m) - (n)))... | #include <bits/stdc++.h>
using namespace std;
#define iota(i, n, b, s) \
for (int i = int(b); i != int((b) + (s) * (n)); i += (s))
#define range(i, n, m) \
iota(i, (((n) > (m)) ? ((n) - (m)) : ((m) - (n)))... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 508 | 2 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
typedef long long ll;
int n, k, w[100001];
bool check(int P) {
ll cnt = 1, sum = 0;
rep(i, n) {
if (w[i] > P)
return false;
if (sum + w[i] <= P)
sum += w[i];
else... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
typedef long long ll;
ll n, k, w[100001];
bool check(ll P) {
ll cnt = 1, sum = 0;
rep(i, n) {
if (w[i] > P)
return false;
if (sum + w[i] <= P)
sum += w[i];
else
... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 191 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
#define rep(x, to) for (int x = 0; x < (to); (x)++)
int main() {
int n, m;
cin >> n >> m;
int w[100000 + 10] = {};
int hi = 0;
rep(i, n) {
cin >> w[i];
hi += w[i];
}
int lo = 0;
while (hi - lo > 1) {
int mid = (lo + hi) / 2;
int... | #include <cstdio>
#include <iostream>
using namespace std;
#define rep(x, to) for (int x = 0; x < (to); (x)++)
int main() {
int n, m;
cin >> n >> m;
int w[100000 + 10] = {};
int hi = 0;
rep(i, n) {
cin >> w[i];
hi += w[i];
}
int lo = 0;
while (hi - lo > 1) {
int mid = (lo + hi) / 2;
int... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19]] | 1 | 201 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int check(int baggages[], int baggageAmount, int trackAmount, long maxWeight) {
int i = 0;
for (int j = 0; j < trackAmount; j++) {
int weight = 0;
while (baggages[i] + weight <= maxWeight) {
weight += baggages[i];
i++;
if (i ==... | #include <algorithm>
#include <iostream>
using namespace std;
int check(int baggages[], int baggageAmount, int trackAmount, long maxWeight) {
int i = 0;
for (int j = 0; j < trackAmount; j++) {
int weight = 0;
while (baggages[i] + weight <= maxWeight) {
weight += baggages[i];
i++;
if (i ==... | [["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]] | 1 | 209 | 2 |
#include <iostream>
using namespace std;
typedef long long ll;
ll n, k;
ll w[100001];
bool C(int p) {
ll sum = 0;
ll cnt = 0;
for (int i = 0; i < n; i++) {
sum += w[i];
while (sum > p) {
sum = w[i];
cnt++;
if (cnt == k)
return false;
}
}
return true;
}
int main() {
... | #include <iostream>
using namespace std;
typedef long long ll;
ll n, k;
ll w[100001];
bool C(int p) { //判定
ll sum = 0;
ll cnt = 0;
for (ll i = 0; i < n; i++) {
sum += w[i];
while (sum > p) {
sum = w[i];
cnt++;
if (cnt == k)
return false;
}
}
return true;
}
int main()... | [["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 39, 78], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 187 | 8 |
/*
????°??????????????£? = ??????????????????
while(?????? == false){
????°??????????????£?++;
}
?????????:1 2 3 4 5 6
??? ???:X X X O O O
X???1???????????????O???????°??????????
????°????O??¨?????§???X?????????????????????
??????????????????????????°??????
*/
//--- --- --- debug function --- --- ---
#define DEB... | /*
????°??????????????£? = ??????????????????
while(?????? == false){
????°??????????????£?++;
}
?????????:1 2 3 4 5 6
??? ???:X X X O O O
X???1???????????????O???????°??????????
????°????O??¨?????§???X?????????????????????
??????????????????????????°??????
*/
//--- --- --- debug function --- --- ---
// #define ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22]] | 1 | 373 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.