s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s899827372 | p03641 | u218843509 | 1559964021 | Python | Python (3.4.3) | py | Runtime Error | 123 | 27440 | 1060 | import sys
sys.setrecursionlimit(10**6)
def input():
return sys.stdin.readline()[:-1]
n = int(input())
a = list(map(int, input().split()))
adj = [[] for _ in range(n)]
for _ in range(n-1):
s, t = map(int, input().split())
adj[s-1].append(t-1)
adj[t-1].append(s-1)
par = [-1 for _ in range(n)]
aff = [0 for _ in rang... |
s468236339 | p03641 | u315485238 | 1559614493 | Python | Python (3.4.3) | py | Runtime Error | 2109 | 34948 | 806 | import numpy as np
N = int(input())
P = np.array(list(map(int, input().split())))
def smallest_list(l,r): #P[l:r] r:exclusive
if l == r or l+1 == r:
return []
if l+2 == r:
return [(P[l],P[l+1])]
i = l + 2*np.argmin(P[l:r:2])
j = i+1 + 2*np.argmin(P[i+1:r:2])
ans = [(P[i],P[j])]
l1 = small... |
s924633015 | p03641 | u315485238 | 1557940535 | Python | Python (3.4.3) | py | Runtime Error | 2109 | 34920 | 635 | import numpy as np
N = int(input())
P = np.array(list(map(int, input().split())))
def smallest_list(Q):
if len(Q) ==0:
return []
if len(Q) == 2:
return [tuple(list(Q))]
i = 2*np.argmin(Q[::2])
#print(i, Q[::2])
ans = [(Q[i],Q[-1])]
f = smallest_list(Q[:i]) + [(1e9,1e9)]
#print(f)
s = ... |
s563973640 | p03641 | u226155577 | 1519809653 | Python | PyPy3 (2.4.0) | py | Runtime Error | 281 | 88260 | 1510 | # seishin.py
N = int(input())
*P, = map(int, input().split())
M = [0]*(N+1)
for i, p in enumerate(P):
M[p] = i
INF = 10**9
def init(P, n):
n0 = 2 ** (n-1).bit_length()
data = [INF]*(n0*2)
data[n0-1:n0-1+n] = P
for i in range(n0-2, -1, -1):
data[i] = min(data[2*i+1], data[2*i+2])
return ... |
s080435240 | p03641 | u876770991 | 1507726165 | Python | Python (2.7.6) | py | Runtime Error | 2106 | 31712 | 1001 | raw_input()
l = map(int, raw_input().split())
memo = {}
def get_min(l):
if (l[0], l[-1]) in memo:
return memo[(l[0], l[-1])]
r = [(_, idx) for idx, _ in enumerate(l) if idx % 2 == 0]
first_val, first_idx = min(r)
r = [(_, idx) for idx, _ in enumerate(l) if idx % 2 != 0 and idx > first_idx]
... |
s735519394 | p03641 | u637175065 | 1504473647 | Python | PyPy3 (2.4.0) | py | Runtime Error | 365 | 106824 | 2816 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**10
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(... |
s858550490 | p03641 | u327466606 | 1502128431 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3320 | 2155 |
from itertools import count,chain
from collections import deque
import heapq as hq
class MinSegTree:
def __init__(self, inf, data=None, size=None):
if data is None and size is None:
raise Exception('data and size both cannot be None simultaneously')
self.size = len(data) if size is None else size
... |
s258595894 | p03641 | u327466606 | 1502119276 | Python | Python (3.4.3) | py | Runtime Error | 2106 | 52508 | 2225 |
from itertools import count,chain
from collections import deque
import heapq as hq
import sys
sys.setrecursionlimit(10**6)
class MinSegTree:
def __init__(self, inf, data=None, size=None):
if data is None and size is None:
raise Exception('data and size both cannot be None simultaneously')
self.size ... |
s899241146 | p03641 | u327466606 | 1502072756 | Python | Python (3.4.3) | py | Runtime Error | 2106 | 45496 | 1913 |
from itertools import count,chain
from collections import deque
class MinSegTree:
def __init__(self, constant, size):
self.size = size
self.depth = (size-1).bit_length()
self.capacity = 1 << self.depth
self.data = [constant]*(2*self.capacity)
self.inf = constant
def _min_interval(self, a, b... |
s496570569 | p03641 | u768980163 | 1502072416 | Python | Python (2.7.6) | py | Runtime Error | 2105 | 20532 | 549 | n = input()
arr = map(int, raw_input().split())
idx = [0 for i in range(n)]
sec = [0 for i in range(n)]
for i in range(n):
idx[arr[i] - 1] = i
result = []
while n > 0:
i = 0
while 1:
if (idx[i] - sec[idx[i]]) % 2 == 0:
target = idx.pop(i);
break
i += 1
i = 0
while 1:
if sec[idx[i]] == sec[target] and ... |
s748277128 | p03641 | u809038097 | 1502072053 | Python | Python (2.7.6) | py | Runtime Error | 2104 | 20008 | 414 | N=int(raw_input())
p=map(int,raw_input().split())
l=N/2
ps=[-1,N]
q=[]
while l:
#1
mm=N+1
for i in range(len(ps)-1):
m=min(p[ps[i]+1:ps[i+1]-1:2]+[N+1])
if m<mm:
mm=m
j=i
q.append(mm)
i=p.index(mm)
p[i]=N+1
#2
mm=min(p[i+1:ps[j+1]:2])
q.append(... |
s502589309 | p03642 | u409373192 | 1574279788 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 2814 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1000100;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
i... |
s185239032 | p03642 | u102461423 | 1568075336 | Python | Python (3.4.3) | py | Runtime Error | 178 | 22144 | 1912 | import sys
input = sys.stdin.readline
import itertools
from collections import defaultdict
import numpy as np
N = int(input())
X = set(int(x) for x in input().split())
# 2は素数でないとして扱って
U = 10**7 + 100
is_prime = np.zeros(U,dtype=np.bool)
is_prime[3::2] = 1
for p in range(3,U,2):
if p*p > U:
break
if i... |
s173013646 | p03642 | u102461423 | 1568075259 | Python | Python (3.4.3) | py | Runtime Error | 178 | 24008 | 1894 | import sys
input = sys.stdin.readline
import itertools
from collections import defaultdict
import numpy as np
N = int(input())
X = set(int(x) for x in input().split())
# 2は素数でないとして扱って
U = 10**7 + 100
is_prime = np.zeros(U,dtype=np.bool)
is_prime[3::2] = 1
for p in range(3,U,2):
if p*p > U:
break
if i... |
s647839144 | p03643 | u955691979 | 1600006228 | Python | PyPy3 (7.3.0) | py | Runtime Error | 94 | 74752 | 59 | n = int(input())
ans = "{1}{2}".format("ABC",n)
print(ans) |
s705306145 | p03643 | u011872685 | 1599868742 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9072 | 192 | N=int(input())
import ita
data=ita.array.make1d(N)
for i in range(0,N):
c=0
while i%2==0:
c=c+1
data[i]=c
for k in range(0,N):
if data[k]==max(data):
print(k+1) |
s612880204 | p03643 | u648315264 | 1599593797 | Python | PyPy3 (7.3.0) | py | Runtime Error | 179 | 74160 | 1065 | import math
from math import gcd,pi,sqrt
INF = float("inf")
import sys
sys.setrecursionlimit(10**6)
import itertools
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N... |
s581497349 | p03643 | u708211626 | 1599362485 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8848 | 18 | print(ABC+input()) |
s596716506 | p03643 | u904945034 | 1599228038 | Python | Python (3.8.2) | py | Runtime Error | 20 | 8856 | 36 | n = input().split()
print("ABC" + n) |
s283421929 | p03643 | u620846115 | 1598899863 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8816 | 34 | n=int(input())
print("ABC"+int(n)) |
s358704593 | p03643 | u620846115 | 1598899814 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9044 | 31 | n = int(input())
print("ABC"+n) |
s281834547 | p03643 | u957275485 | 1598725842 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9188 | 155 | N=int(input())
a=[]
for n in range(1,N,1):
count=0
while n%2 == 0:
count+=1
n/=2
a.append(count)
print(a.index(max(a))+1)
print(Tmax=max(a)) |
s806871841 | p03643 | u197956883 | 1598493749 | Python | PyPy3 (7.3.0) | py | Runtime Error | 98 | 74720 | 1140 | import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
... |
s764956859 | p03643 | u546853743 | 1598448884 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9076 | 28 | n=int,input()
print('ABC'+n) |
s253373545 | p03643 | u265118937 | 1596766093 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8904 | 34 | print("ABC{}".format(int(input())) |
s640500345 | p03643 | u569776981 | 1595293215 | Python | Python (3.8.2) | py | Runtime Error | 21 | 8956 | 170 | N = int(input())
x = 0
a = []
for i in range(2:N:2):
while i % 2 == 0:
i //= 2
x += 1
a.append(x)
x = 0
a = sorted(a)
a = a[::-1]
print(a[0])
|
s487119594 | p03643 | u163421511 | 1593312716 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9148 | 55 | N = int(input())
while a*2 <= N:
a = a*2
print(a) |
s560707801 | p03643 | u399973890 | 1592187579 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 28 | N = input()
print(f'ABC{N}') |
s753634210 | p03643 | u213580455 | 1591288464 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38256 | 386 | n, m = map(int, input().split())
P, M = ("POSSIBLE", "IMPOSSIBLE")
dic = {}
for _ in range(m):
a, b = map(int, input().split())
if dic.get(a) is None: dic[a] = [b]
else: dic[a] = dic[a] + [b]
if dic.get(b) is None: dic[b] = [a]
else: dic[b] = dic[b] + [a]
if dic.get(n) is None: print(M) return
arr =... |
s337129532 | p03643 | u559346857 | 1590331960 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 29 | n=int(input())
print("ABC"+n) |
s633189905 | p03643 | u247211039 | 1590124170 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 28 | N = input()
print(ABC + "N") |
s927342778 | p03643 | u641804918 | 1589597153 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 332 | N,M = map(int,input().split())
one = []
goal = []
for i in range(M):
A,B = map(int,input().split())
if A == 1 :
one.append(B)
elif B == 1:
one.append(A)
if A == N or B == N:
goal.append(A)
goal.append(B)
if set(goal) & set(one):
print("POSSIBLE")
else:
print("I... |
s669304640 | p03643 | u970737570 | 1589497275 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3444 | 188 | import sys
from collections import deque
from collections import defaultdict
import math
import copy
#input = sys.stdin.readline
sys.setrecursionlimit(20000000)
s = input()
print("ABC"+s1) |
s347420833 | p03643 | u144029820 | 1588724121 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 32 | n=input()
print(n[3]+n[4]+n[5])
|
s480579584 | p03643 | u857673087 | 1588717175 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 34 | N = int(input())
print('ABC'+ N)
|
s828336802 | p03643 | u857673087 | 1588717135 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 41 | N = int(input())
print('ABC'+ N, end='') |
s489374681 | p03643 | u973108807 | 1588641882 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 26 | n = input()
ptint('ABC'+n) |
s671245828 | p03643 | u755180064 | 1588532559 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 88 |
def main():
n = input()
print(f'ABC{n}')
if __name__ == '__main__':
main() |
s486084190 | p03643 | u755180064 | 1588532520 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 |
def main():
print(f'ABC{input()}')
if __name__ == '__main__':
main() |
s483519828 | p03643 | u755180064 | 1588532475 | Python | PyPy3 (2.4.0) | py | Runtime Error | 165 | 38384 | 78 |
def main():
print(f'ABC{input()}')
if __name__ == '__main__':
main() |
s613548840 | p03643 | u235066013 | 1587692799 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 29 | N=int(input())
print('ABC'+N) |
s693392920 | p03643 | u900848560 | 1587582780 | Python | PyPy3 (2.4.0) | py | Runtime Error | 178 | 38256 | 29 | a=input()
print("ABC"+int(a)) |
s277139422 | p03643 | u133583235 | 1587338279 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 51 | n, m = map(int, input().split())
print((n-1)*(m-1)) |
s061434760 | p03643 | u652656291 | 1586811349 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 31 | n = int(input())
print('ABC'+n) |
s305952259 | p03643 | u884601206 | 1586046583 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 30 | s=int(input())
print('ABC'+s)
|
s256154753 | p03643 | u246809151 | 1584128825 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 213 | N = int(input())
if n==1:
print('1')
else:
for i in N:
if 2**i <= N and 2**(i+1) > N:
print(2**i)
break
#プログラム終了
#import sys
#sys.exit()
#a**b aのb乗
|
s794338539 | p03643 | u699944218 | 1583713598 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 66 | N = input(int())
ans = 64
if ans > N:
ans /= 2
print(int(ans)) |
s100510422 | p03643 | u346677493 | 1583683859 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 27 | n=raw_input()
print [ABC+n] |
s249989075 | p03643 | u975719989 | 1583615103 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 34 | n = int(input())
print("ABC" + n) |
s759813084 | p03643 | u572142121 | 1582776214 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 29 | N=int(input())
print('ABC'+N) |
s080632902 | p03643 | u992910889 | 1582576307 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 45 | N=str(inputN=input()
print('ABC{}'.format(N)) |
s149639817 | p03643 | u846652026 | 1577400540 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 20 | print("ABC"+inpit()) |
s661041921 | p03643 | u987170100 | 1576377020 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 126 | fn main() {
let mut s = String::new();
std::io::stdin().read_line(&mut s).unwrap();
println!("ABC{}", s.trim())
}
|
s402254579 | p03643 | u469700628 | 1574834413 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 319 | N = int(input())
# res = [x for x in range(1, N + 1)]
result = {}
# for i in res:
for i in range(1, N + 1):
result[i] = 0
tmp = i
while True:
if tmp % 2 == 0:
tmp = tmp / 2
result[i] += 1
else:
break
print(sorted(result.items(), key=lambda x: -x[1])[0][0] |
s942732753 | p03643 | u965436898 | 1574735589 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 28 | n = input()
print(f"ABC{n}") |
s158901625 | p03643 | u600402037 | 1574511701 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 156 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
print('ABC' + N)
|
s639720463 | p03643 | u148551245 | 1572547628 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 34 | n = int(input())
print('ABC' + n) |
s331311675 | p03643 | u148551245 | 1572547387 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 34 | N = int(input())
print('ABC' + N) |
s934215739 | p03643 | u785470389 | 1569819158 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | number = int(input)
print("ABC" + str(number)) |
s419448409 | p03643 | u802963389 | 1568472724 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38384 | 277 | N, M = map(int, input().split())
ab = [sorted(list(map(int, input().split()))) for _ in range(M)]
fst = []
for i in ab:
if i[0]==1:
fst.append(i[1])
for i in ab:
for j in fst:
if set(i) == set([j, N]):
print("POSSIBLE")
exit()
print("IMPOSSIBLE")
|
s590827557 | p03643 | u636822224 | 1567620278 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 113 | a=int(input())
cnt=0
for i in range(math.inf):
if a%2==0:
cnt+=1
a=a/2
else:
print(cnt)
break |
s119628424 | p03643 | u665038048 | 1565213250 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 27 | n = (input()
print('ABC'+n) |
s522441131 | p03643 | u480887263 | 1564790695 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 30 | NN=str(input())
print("ABC"+N) |
s299767778 | p03643 | u144980750 | 1562358780 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38256 | 372 | n,m=map(int,input().split())
a=[[int(i) for i in input().split()] for j in range(m)]
a.sort(key=lambda x:x[1])
a.sort(key=lambda x:x[0])
cc=0
for i in range(m):
if a[i][0]==1:
for j in range(i,m):
if a[i][1]==a[j][0] and a[j][1]==n:
cc=1
break
if cc==1:
... |
s988562948 | p03643 | u353652911 | 1558730481 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 24 | print("ABC"+str(input()) |
s407654084 | p03643 | u442030035 | 1556075164 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 44 | print('ABC' + input())print('ABC' + input()) |
s039913279 | p03643 | u331464808 | 1555446607 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 28 | print("ABC" + int(input()) ) |
s256064300 | p03643 | u185464141 | 1554774775 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38416 | 83 | # , = map(int, input.split())
# = int(input())
n = input()
print(ABC{}.format(n)) |
s548681311 | p03643 | u299730702 | 1554682977 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 117 | N, K = map(int, input().split())
L = list(map(int, input().split()))
L = sorted(L, reverse=True)
print(sum(L[:K]))
|
s925858000 | p03643 | u565204025 | 1554235687 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 158 | import sys
import os
f = open("C:/Users/user/Documents/atCoderProblem/import.txt","r")
sys.stdin = f
# -*- coding: utf-8 -*-
n = input()
print("ABC" + n)
|
s991138255 | p03643 | u115994101 | 1553045126 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 41 | n = (int)raw_input()
print "ABC" + (str)n |
s935123973 | p03643 | u373529207 | 1552953857 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 34 | N = int(input())
print(f"ABC{N}")
|
s273116628 | p03643 | u074445770 | 1551761360 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 26 | n=input()
print('ABC'+n) |
s186335225 | p03643 | u516272298 | 1550366783 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 24 | print("ABC"+str(input()) |
s375604439 | p03643 | u951601135 | 1549397168 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 14 | print('ABC'+N) |
s409539904 | p03643 | u500297289 | 1548988638 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 27 | print("ABC" + int(input())) |
s346802835 | p03643 | u740284863 | 1547159626 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 179 | ソースコード 拡げる
Copy
Copy
N = int(input())
count = 0
for i in range(N):
c = 2**count
if c > N:
print(c//2)
exit()
else:
count +=1 |
s995988047 | p03643 | u785578220 | 1546144671 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 28 | a =input()
b =ABC+a
print(b) |
s771162894 | p03643 | u726439578 | 1546131410 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 29 | n=int(input())
print("ABC"+n) |
s890218588 | p03643 | u785989355 | 1544172785 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 607 |
N,M = list(map(int,input().split()))
path = [[False,False] for i in range(N)]
flag=False
for i in range(M):
a,b = list(map(int,input().split()))
if a=N-1:
if path[b-1][0]:
flag=True
path[b-1][1]=True
if a=0:
if path[b-1][1]:
flag=True
... |
s817517647 | p03643 | u785989355 | 1544170449 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 27 | N=readline()
print("ABC"*N) |
s004777259 | p03643 | u426108351 | 1541621892 | Python | PyPy3 (2.4.0) | py | Runtime Error | 194 | 38640 | 826 | import bisect
N, M = map(int, input().split())
a = [None for i in range(2 * M)]
number = [None for i in range(2 * M)]
flag = 0
for i in range(M):
A, B = map(int, input().split())
a[2*i] = [A, B]
a[2*i+1] = [B, A]
number[2*i]
number[2*i+1]
a.sort()
b = a[:]
b.reverse()
one = []
two = []
for i in rang... |
s491669126 | p03643 | u137667583 | 1540228412 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 32 | print("ABC{0}".format(intput())) |
s061455891 | p03643 | u328755070 | 1540166300 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 101 | N = int(iput())
if N < 100:
ans = '0' + str(N) + 'ABC'
else:
ans = str(N) + 'ABC'
print(ans)
|
s295475268 | p03643 | u342051078 | 1539011733 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 34 | N = int(input())
print("ABC" + N) |
s946545323 | p03643 | u732285858 | 1534453903 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 30 | s=input()
print("ABC"+f"{s}")
|
s252536861 | p03643 | u820351940 | 1534444833 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 |
a, b, c = map(int, input().split())
print("YES" if b - a == c - b else "NO")
|
s679092933 | p03643 | u277802731 | 1534439678 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 29 | #68a
n=input()
pritn('ABC'+n) |
s963834140 | p03643 | u446687234 | 1532556057 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 23 | print("ABC" ++ input()) |
s713308567 | p03643 | u807772568 | 1526339234 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 30 | i = int(input())
print("ABC"i) |
s542050098 | p03643 | u807772568 | 1526339192 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 31 | i = int(input())
print("ABC"+i) |
s944105074 | p03643 | u635974378 | 1522985749 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38640 | 20 | print('ABC' input()) |
s236213679 | p03643 | u306142032 | 1522878449 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 35 | n = int(input())
print("ABC" + n)
|
s161939310 | p03643 | u866107333 | 1522077684 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 126 | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int inp; cin >> inp;
cout << "ABC"<< inp << endl;
} |
s244998608 | p03643 | u866107333 | 1522077579 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 30 | S = raw_input()
print "ABC",S
|
s803249987 | p03643 | u096628314 | 1519078232 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 164 | a = raw_input()
people = 0
for i in range(int(a)):
number_list = raw_input().split()
people += int(number_list[1])-int(number_list[0]) +1
print(str(people)) |
s952464423 | p03643 | u096628314 | 1519078192 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 159 | a = raw_input()
people = 0
for i in range(int(a)):
number_list = raw_input().split()
people += int(number_list[1])-int(number_list[0]) +1
print(people) |
s243143553 | p03643 | u096628314 | 1519076069 | Python | Python (2.7.6) | py | Runtime Error | 17 | 2572 | 65 | N = raw_input("Please enter something: ")
return("ABC" + str(N)) |
s663554762 | p03643 | u562016607 | 1517614590 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 30 | print("ABC{0}".format(input()) |
s001621180 | p03643 | u667024514 | 1511110962 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 31 | a = int(input())
print("ABC"+a) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.