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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s434171001 | p03552 | u226155577 | 1510453571 | Python | PyPy3 (2.4.0) | py | Runtime Error | 885 | 45808 | 608 | N, Z, W = map(int, input().split())
*A, = map(int, input().split())
memo = {}
def dfs(i, turn):
if (i, turn) in memo:
return memo[i, turn]
if turn == 0:
# X
if i == 0:
res = abs(W - A[-1])
else:
res = abs(A[i-1] - A[-1])
for j in range(i+1, N):
... |
s234693486 | p03552 | u656721037 | 1510453556 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 9313 | /*
`-:://:::-
`//:-------:/:`
... |
s332409715 | p03553 | u952467214 | 1594511394 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9488 | 2019 | from collections import deque
class Dinic:
def __init__(self, N):
elf.N = N
self.G = [[] for i in range(N)]
def add_edge(self, fr, to, cap):
forward = [to, cap, None]
forward[2] = backward = [fr, 0, forward]
self.G[fr].append(forward)
self.G[to].append(backward)
... |
s180531973 | p03553 | u499381410 | 1587836878 | Python | PyPy3 (2.4.0) | py | Runtime Error | 177 | 38384 | 2961 | ¥from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fr... |
s288847311 | p03553 | u588093355 | 1568854718 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 3208 | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
#if defined(DEBUG)
#include <unistd.h>
#include <sys/fcntl.h>
#define DLOG(...) cerr << dbgFormat(__VA_ARGS__) << endl
#define DCALL(func, ...) func(__VA_ARGS__)
template <class... Args>
string dbgFormat(const char* fmt... |
s016250289 | p03553 | u241347678 | 1556072188 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 2124 | #include <stdio.h>
#include <queue>
#include <vector>
#include <utility>
using namespace std;
const int N=1e2+10;
const long long int INF=1e16+10;
const int MAX_V=800;
struct edge
{
long long int to,cap;
int rev;//终点、容量、反向边
};
vector<edge>G[MAX_V];//图的邻接表表示
int level[MAX_V];//顶点到源点的距离标号
int iter[MAX_V];//当前弧，在其之前的... |
s146323018 | p03553 | u297574184 | 1510636486 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3188 | 1130 | N = int(input())
As = list(map(int, input().split()))
def func(Bs):
for x in range(N):
if Bs[x] >= 0: continue
if max(Bs[x::x + 1]) <= 0:
Bs[x] = 0
func(As)
for x in range(34, 51):
if As[x - 1] + As[x * 2 - 1] < 0:
As[x - 1] = 0
As[x * 2 - 1] = 0
for x in [27, 29,... |
s205125133 | p03553 | u970348538 | 1510458580 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 436 | n = int(input())
a = list(map(int, input().split()))
a.insert(0, 0)
n = n + 1
p = n*[0]
for i in range(1,n):
for j in range(i,n,i):
p[i] += a[j]
#print(p[1:n])
for i in range(n-1,0,-1):
if p[i] < 0:
l = n // i * i
for j in range(l,0,-i):
if p[j] != 0:
for k ... |
s530042662 | p03553 | u340781749 | 1510457980 | Python | Python (3.4.3) | py | Runtime Error | 48 | 5224 | 681 | def check(iter, broken):
iter_ans=0
for j in iter:
tmp_sum=0
tmp_broken=set()
for t in range(j, n, j+1):
if t not in broken:
tmp_sum+=aa[t]
tmp_broken.add(t)
# print(ans, j, tmp_broken, broken)
if tmp_sum < 0:
iter_a... |
s298725459 | p03553 | u667084803 | 1510457644 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38416 | 382 | N=int(input())
A=list(map(int,input().split()))
B=A[:]
while True:
B=A[:]
for j in range(N):
for i in range(N,N-j-1,-1):
w=0
for k in range(N):
if (k+1)%i==0:w+=B[k]
if w=<0:#割ったほうがいい！
for k in range(N):
if (k+1)%i==0:B[k]=0
if A==B:break
else: A=B[:]
ans... |
s554581980 | p03553 | u667084803 | 1510457545 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 346 | N=int(input())
A=list(map(int,input().split()))
B=A[:]
while True:
B=A[:]
for i in range(N,N-j-1,-1):
w=0
for k in range(N):
if (k+1)%i==0:w+=B[k]
if w<0:#割ったほうがいい！
for k in range(N):
if (k+1)%i==0:B[k]=0
if A==B:break
else: A=B[:]
ans=0
for j in range(N):
ans+=A[j]
pr... |
s903536493 | p03553 | u016382081 | 1510456871 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 369 | #include<cstdio>
int main(){
int n;
scanf("%d",&n);
int a[n]={};
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(int i=n-1;i>=0;i--){
if(a[i]<0){
int k=0;
for(int j=i;j<n;j+=i+1){
k+=a[j];
}
if(k<0){
for(int j=i;j<n;j+=i+1){
a[j]=0;
}
}
}
}
int ans=0;
for(int i=0;i<n;i++){
... |
s086367994 | p03553 | u970348538 | 1510456857 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 338 | n = int(input())
a = list(map(int, input().split()))
a.insert(0, 0)
n = n + 1
p = n*[0]
for i in range(1,n):
for j in range(i,n,i):
p[i] += a[j]
#print(p[1:n])
for i in range(n-1,0,-1):
if p[i] < 0:
for j in range(1,i+1):
if i % j == 0:
p[j] -= p[i]
#print(p[1:n])
... |
s772385653 | p03554 | u054957956 | 1510457731 | Python | Python (3.4.3) | py | Runtime Error | 1368 | 225180 | 784 | import sys
sys.setrecursionlimit(3 * 10**5)
n = int(input())
b = list(map(int, input().split()))
op = [[] for i in range(n)]
q = int(input())
for i in range(q):
l, r = map(int, input().split())
op[l - 1].append(r)
nula = [0 for i in range(n + 1)]
for i in range(n):
nula[i + 1] = nula[i] + (b[i] == 0)
memo... |
s365395603 | p03555 | u738408150 | 1601134104 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8876 | 72 | x = input()
y = input()
if x[::-1] = y:
print('YES')
else:
print('NO') |
s788649357 | p03555 | u925353288 | 1601064743 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9020 | 110 |
C =str(input())
if C[0] == C[5] and C[1] == C[4] and C[2] == C[3]:
print('Yes')
else:
print('No')
|
s021781816 | p03555 | u783565479 | 1600732925 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8980 | 103 |
N = int(input())
for i in range(1,N):
if(i * i > N):
print((i -1) * (i - 1))
break |
s304743827 | p03555 | u656568465 | 1600720202 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8956 | 650 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<map>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } retu... |
s263460820 | p03555 | u849073847 | 1600218145 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9020 | 81 | s = input()
t = input()
s.reverse()
if s==t :
print("YES")
else:
print("NO") |
s482109922 | p03555 | u596536048 | 1599850393 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8884 | 113 | a, b = input().split()
if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:
print("YES")
else:
print("NO")
|
s091185555 | p03555 | u975300347 | 1599787082 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8996 | 129 | A = input().split()
B = input().split()
if A[0] == B[2] and A[1] == B[1] and A[2] == B[0]:
print('YES')
else:
print('NO') |
s158410534 | p03555 | u250944591 | 1599624142 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9120 | 85 | a,b=input()
if a[0]==b[2] and a[1]==b[1] and a[2]==b[0]:print('YES')
else:print('NO') |
s956474324 | p03555 | u053535689 | 1599611306 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9020 | 261 | # 077a
def atc_077a(input_value: str) -> str:
C1 = input_value[0]
C2 = input_value[1]
if C1[0] == C2[2] and C1[1] == C2[1] and C1[2] == C2[0]
return "YES"
else:
return "NO"
C1 = input()
C2 = input()
print(atc_077a([C1, C2]))
|
s965453936 | p03555 | u053535689 | 1599611045 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9092 | 239 | # 077a
def atc_077a(input_value: str) -> str:
C1 = input_value[0]
C2 = input_value[1]
if C1[0] == C2[2] and C1[1] == C2[1]:
return "YES"
else:
return "NO"
C1 = input()
C2 = input()
print(atc_077a(C1,C2))
|
s702559114 | p03555 | u960570220 | 1599604471 | Python | Python (3.8.2) | py | Runtime Error | 30 | 8932 | 132 | C1 = str(input())
C2 = str(input())
if C1[0] == C2[1] and C1[1] == C2[2] and C1[2] == C2[3]:
print('Yes')
else:
print('No') |
s045473275 | p03555 | u076363290 | 1599270689 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8996 | 122 | n ,s = map(str,input().split())
if n[0]== s[2]and n[1]==s[1] and n[2]== s[0]:
print('Yes')
else:
print('No')
|
s660395646 | p03555 | u620846115 | 1599044705 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9040 | 151 | x =[list(map(str,input().split())) for i in range(2)]
if x[0][0]==x[1][0] and x[0][1]==x[1][1] and x[0][2]==x[1][2]:
print("YES")
else:
print("NO") |
s401694284 | p03555 | u546853743 | 1598997107 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8968 | 149 | S=list(map(input().split()))
T=list(map(input().split()))
if S[0]==T[2] and S[1]==T[1] and S[2]==T[0]:
print('YES')
else:
print('NO') |
s866904526 | p03555 | u546853743 | 1598997028 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9108 | 147 |
S=list(map(input()))
T=list(map(input()))
if S[0]==T[2] and S[1]==T[1] and S[2]==T[0]:
print('YES')
else:
print('NO')
|
s852436579 | p03555 | u347397127 | 1598827425 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8900 | 81 | S1 = input()
S2 = input()
if S1.reverse == S2:
print("YES")
else:
print("NO") |
s448504876 | p03555 | u516554284 | 1597855782 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9248 | 676 | def bs_left(list, target):
low = 0
high = len(list)
while low < high:
mid = (low + high) // 2
if target > list[mid]:
low = mid + 1
else:
high = mid
return low
def bs_right(list, target):
low = 0
high = len(list)
while low < high:
mid ... |
s881151895 | p03555 | u798260206 | 1597701441 | Python | PyPy3 (7.3.0) | py | Runtime Error | 88 | 73920 | 162 | c1 = list(map(int,input().split()))
c2 = list(map(int,input().split()))
if c1[0] == c2[2] and c1[1]==c2[1] and c1[2] == c2[0]:
print("YES")
else:
print("NO") |
s194550854 | p03555 | u969708690 | 1597692787 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9164 | 145 | L=list(map(int,input().split()))
R=list(map(int,input().split()))
if L[0]==R[2] and L[1]==R[1] and L[2]==R[0]:
print("YES")
else:
print("NO") |
s447648379 | p03555 | u226779434 | 1596988601 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8888 | 65 | c1 = input()
c2 = input()
print("YES" if c1=c2[-1::-1] else "NO") |
s874901534 | p03555 | u174536291 | 1596820441 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9108 | 159 | x = [list(map(str, input().split())) for i in range(2)]
if x[0][0] == x[1][2] and x[0][1] == x[1][1] and x[1][0] == x[0][2]:
print('YES')
else:
print('NO') |
s345908551 | p03555 | u174536291 | 1596683837 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9116 | 157 | a = list(map(int, input().split()))
b = list(map(int, input().split()))
if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:
print('YES')
else:
print('NO') |
s566612319 | p03555 | u714104087 | 1596667188 | Python | PyPy3 (7.3.0) | py | Runtime Error | 109 | 68484 | 64 | c1 = input()
c2 = input()
print("YES" if c1=c2[::-1] else "NO") |
s567809244 | p03555 | u714104087 | 1596667156 | Python | PyPy3 (7.3.0) | py | Runtime Error | 488 | 92984 | 59 | c1 = input()
c2 = input()
print("YES" if c1=c2[::-1] "NO") |
s174157353 | p03555 | u174536291 | 1596466605 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9048 | 159 | a = [list(map(str, input().split())) for i in range(2)]
if a[0][0] == a[1][2] and a[0][1] == a[1][1] and a[0][2] == a[1][0]:
print('YES')
else:
print('NO') |
s125866027 | p03555 | u243159381 | 1596427088 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9156 | 189 | c11,c12,c13=map(int,input().split())
c21,c22,c23=map(int,input().split())
if c11==c23:
print('YES')
elif c12==c22:
print('YES')
elif c13==c31:
print('YES')
else:
print('NO') |
s111652607 | p03555 | u898058223 | 1596415223 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9056 | 99 | c=input()
d=input()
if c[0]==d[3] and c[1]==d[1] and c[2]==d[0]:
print("YES")
else:
print("NO") |
s837911331 | p03555 | u786020649 | 1596409057 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9032 | 99 | for x,y in zip(input(),reversed(input)):
if x!=y:
print('NO')
break
else:
print('YES')
|
s339871904 | p03555 | u328510800 | 1595956892 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9232 | 337 | from bisect import bisect_left, bisect_right
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort()
b.sort()
c.sort()
cnt = 0
for b_e in b:
a_cases = bisect_left(a, b_e)
c_cases = bisect_right(c, b_e)
cnt += a_cases * (n - c_... |
s682462464 | p03555 | u425762225 | 1595870853 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9076 | 134 | def isSquare(x):
return x == round(x**(1/2))**2
N = int(input())
l = (x if isSquare(x) else -1 for x in range(1,N+1))
print(max(l)) |
s735771996 | p03555 | u881192043 | 1594069757 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9164 | 689 | N=int(input())
A=sorted(list(map(int,input().split())))
B=sorted(list(map(int,input().split())))
C=sorted(list(map(int,input().split())))
def binary_search(list_a,item):
low=0
high=len(list_a)-1
flag=True
while low<=high:
mid=int((low+high)/2)
guss=list_a[mid]
if guss>item:
high=mid-1
eli... |
s000965280 | p03555 | u047931063 | 1593926729 | Python | PyPy3 (7.3.0) | py | Runtime Error | 93 | 74740 | 193 | C = []
C.append(list(map(int,input().split())))
C.append(list(map(int,input().split())))
if C[0][0] == C[1][2] and C[0][1] == C[1][1] and C[0][2] == C[1][0]:
print("YES")
else:
print("NO") |
s647012460 | p03555 | u762557532 | 1593830517 | Python | PyPy3 (7.3.0) | py | Runtime Error | 91 | 74768 | 1399 | ###==================================================
### import
#import bisect
#from collections import Counter, deque, defaultdict
#from copy import deepcopy
#from functools import reduce, lru_cache
#from heapq import heappush, heappop
#import itertools
#import math
#import string
import sys
### stdin
def input(): re... |
s860998463 | p03555 | u064881889 | 1593818459 | Python | PyPy2 (7.3.0) | py | Runtime Error | 535 | 85280 | 961 | import sys
def main():
n = sys.stdin.readline()
astr = sys.stdin.readline()
bstr = sys.stdin.readline()
cstr = sys.stdin.readline()
a = map(int, astr.strip().split(' '))
b = map(int, bstr.strip().split(' '))
c = map(int, cstr.strip().split(' '))
a.sor... |
s396474338 | p03555 | u858670323 | 1593546040 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9028 | 121 | x = str(input())
y = str(input())
z = x.reversed()
w = y.reversed()
if x==w and y==z:
print("YES")
else:
print("NO")
|
s053929841 | p03555 | u858670323 | 1593546021 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9100 | 116 | x = str(input())
y = str(input())
z = x.sorted()
w = y.sorted()
if x==w and y==z:
print("YES")
else:
print("NO") |
s022138109 | p03555 | u646989285 | 1593192531 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9128 | 190 | import math
N = int(input())
N_square_root = math.floor(math.sqrt(N))
result = 0
for i in range(N_square_root + 1):
if math.sqrt(i).is_integer() is True:
result = i
print(result) |
s900765275 | p03555 | u343490140 | 1592416030 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 130 | n = int(input())
for i in range(n):
if (i+1)**2 > n:
break
elif (i+1)**2 <= n:
ans = (i + 1)**2
print(ans) |
s434284712 | p03555 | u294385082 | 1592256442 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 100 | c1 = input()
c2 = input()
if ''.join(list(c1).reverse()) == c2:
print('YES')
else:
print('NO')
|
s593529733 | p03555 | u294385082 | 1592256404 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 | c1 = input()
c2 = input()
if c1.reverse() == c2:
print('YES')
else:
print('NO')
|
s124330735 | p03555 | u294385082 | 1592256380 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | c1 = input()
c2 = input()
if c1.reverse() == c2:
print('YES')
else:
print('NO) |
s818231473 | p03555 | u122428774 | 1592083822 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 31 | print(int(int(input())**.5)**2) |
s732102215 | p03555 | u392361133 | 1591962161 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 90 | a = list(input().split())
b = list(input().split())
print("YES if a == b[::-1] else "NO")
|
s069948046 | p03555 | u392361133 | 1591961972 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 99 | a = list(input().split())
b = list(input().split())
s = a + b
print("YES if s == s[::-1] else "NO") |
s093360364 | p03555 | u789565565 | 1591732296 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 240 | N =int(input())
lisA =sorted(list(map(int,input().split())))
lisB = sorted(list(map(int,input().split())))
lisC = sorted(list(map(int,input().split())))
print(sum(bisect.bisect_left(lisA,b)*(N-bisect.bisect_right(lisC,b))for b in lisB)) |
s017336092 | p03555 | u370852395 | 1590855646 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 64 | N=int(input())
i = 0
while N>=i*i :
i+=1
print((i-1)*(i-1))
|
s727751182 | p03555 | u730710086 | 1589938687 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 132 | # -*- coding: <encoding name> -*-
line_1 = input
line_2 = input
line = line_1 + line_2
print('YES' if line == line[::-1] else 'NO') |
s657836313 | p03555 | u934052933 | 1589603968 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1526 |
# index が条件をみたかどうか
def isLess(index, key, a):
if a[index] >= key:
return True
else:
return False
def isUpper(index, key, a):
if a[index] > key:
return True
else:
return False
def binary_search(key, a, upper=True):
left = -1 # index = 0 が条件を満たすこともあるので初期値は−１
right= len(a) # index = le... |
s526204387 | p03555 | u586639900 | 1589574218 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 375 | from bisect import bisect_left, bisect_right
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort()
C.sort()
count = 0
for b in B:
upper = bisect_left(A, b) # returns number of elements which satisfy a < b
lower = bisect_right(C,... |
s935136418 | p03555 | u600261652 | 1589487226 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 102 | c1 = map(int, input().split())
c2 = map(int, input().split())
print("YES" if c1 == c2[::-1] else "NO") |
s342060457 | p03555 | u600261652 | 1589487123 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 120 | a, b, c = map(int, input().split())
A, B, C = map(int, input().split())
print("YES" if a==C and b==B and c==A else "NO") |
s392211075 | p03555 | u115877451 | 1589422516 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 145 | a=list(map(int,input().split()))
b=list(map(int,input().split()))
if a[0]==b[2] and a[1]==b[1] and a[2]==b[0]:
print('YES')
else:
print('NO') |
s600258728 | p03555 | u493130708 | 1589357093 | Python | PyPy3 (2.4.0) | py | Runtime Error | 288 | 63980 | 2271 | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
from collections import deque
from fractions import gcd
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9+7
INF = float('inf')
#############
# Functions #
######... |
s077489481 | p03555 | u767821815 | 1589139804 | Python | PyPy3 (2.4.0) | py | Runtime Error | 165 | 38256 | 335 | import bisect
n = int(input())
A = sorted(list(map(int,input().split())))
B = sorted(list(map(int,input().split())))
C = sorted(list(map(int,input().split())))
cnt = 0
for a in A:
for b in B[bisect.bisect_left(B,a):]:
for c in C [bisect.bisect_left(C,b):]:
if a < b < c :
cnt +... |
s453176966 | p03555 | u604655161 | 1588966715 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3056 | 234 | def ABC_77_A():
A,B,C = map(str, input().split())
A2,B2,C2 = map(str, input().split())
if A == C2 and C == A2 and B == B2:
print('YES')
else:
print('NO')
if __name__ == '__main__':
ABC_77_A() |
s866250965 | p03555 | u947327691 | 1588814159 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 83 | s1=input()
s2=input()
s3=s2[::-1]
if s1=s3:
print("YES")
else:
print("NO") |
s358797768 | p03555 | u947327691 | 1588814038 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 182 | s1=input()
s2=input()
cnt=0
for i in range(len(l1)):
print(l1[i])
print(l2[-i-1])
if l1[i]==l2[-i-1]:
cnt+=1
if cnt == 3:
print("YES")
else:
print("NO") |
s704656105 | p03555 | u947327691 | 1588813461 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 189 | l1=list(map(str,input().split()))
l2=list(map(str,input().split()))
cnt=0
for i in range(len(l1)):
if l[i]==l[-i-1]:
cnt+=1
if cnt == 3:
print("YES")
else:
print("NO") |
s354273289 | p03555 | u947327691 | 1588813393 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 185 | l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
cnt=0
for i in range(len(l1)):
if l[i]==l[-i-1]:
cnt+=1
if cnt == 3:
print("YES")
else:
print("NO") |
s285812351 | p03555 | u947327691 | 1588813357 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 182 | l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
cnt=0
for i in range(len(l1)):
l[i]==l[-i-1]:
cnt+=1
if cnt == 3:
print("YES")
else:
print("NO") |
s873125499 | p03555 | u165268875 | 1588796813 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 75 |
c = input()
d = input()
print("YES" c==c[::-1] and d==d[::-1] else "NO")
|
s762451831 | p03555 | u579699847 | 1588503116 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 309 | import bisect
def I(): return int(input())
def LI(): return list(map(int,input().split()))
N = I()
A = sorted(LI())
B = sorted(LI())
C = sorted(LI())
ans = 0
for b in B:
ok_a = bisect.bisect_left(A,b)
ok_c = bisect.bisect_right(C,b)
if ok_a!=0 and ok_c!=N:
ans += ok_a*(N-ok_c)
print(ans)
|
s258152072 | p03555 | u830162518 | 1588042733 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 105 | a,b,c=input().split()
e,f,g=input().split()
if a==g and c==e and b==f:
print('YES')
else:
print('NO') |
s772786827 | p03555 | u830162518 | 1588042479 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 105 | a,b,c=input().split()
e,f,g=input().split()
if a==g and c==e and b==f:
print('YES')
else:
print('NO') |
s750983960 | p03555 | u852790844 | 1587604434 | Python | Python (3.4.3) | py | Runtime Error | 150 | 12488 | 329 | import sys
import numpy as np
readline = sys.stdin.readline
n = int(input())
a = np.array(readline().split(),dtype=np.int64)
b = np.array(readline().split(),dtype=np.int64)
c = np.array(readline().split(),dtype=np.int64)
ans = 0
for i in range(n):
ans += np.count_nonzero(a < b[i]) * np.count_nonzero(c > b[i])
pr... |
s368604398 | p03555 | u852790844 | 1587603245 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 87 | c1 = list(input())
c2 = list(input())
ans = "YES" if c2 = c2[::-1] else "NO"
print(ans) |
s317710676 | p03555 | u229518917 | 1587577783 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 38 | N=int(input())
print(int(N**(1/2))**2) |
s065870613 | p03555 | u424768586 | 1587439829 | Python | PyPy3 (2.4.0) | py | Runtime Error | 221 | 39404 | 1527 | import sys
import math
import queue
import copy
import bisect#2分探索
def input():
return sys.stdin.readline()[:-1]
def inputi():
return int(input())
def inputl():
return list(map(int, input().split()))
def printl(li):
print(*li, sep="\n")
def argsort(s):
return sorted(range(len(s)), key=lambda k: s[k... |
s477573886 | p03555 | u424768586 | 1587439789 | Python | PyPy3 (2.4.0) | py | Runtime Error | 191 | 39020 | 1356 | import sys
import math
import queue
import copy
import bisect#2分探索
def input():
return sys.stdin.readline()[:-1]
def inputi():
return int(input())
def inputl():
return list(map(int, input().split()))
def printl(li):
print(*li, sep="\n")
def argsort(s):
return sorted(range(len(s)), key=lambda k: s[k... |
s542100379 | p03555 | u424768586 | 1587439727 | Python | PyPy3 (2.4.0) | py | Runtime Error | 195 | 38892 | 1527 | import sys
import math
import queue
import copy
import bisect#2分探索
def input():
return sys.stdin.readline()[:-1]
def inputi():
return int(input())
def inputl():
return list(map(int, input().split()))
def printl(li):
print(*li, sep="\n")
def argsort(s):
return sorted(range(len(s)), key=lambda k: s[k... |
s358803358 | p03555 | u252964975 | 1587265289 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 94 | S1=int(input())
S2=int(input())
if S1 == S2[2]+S2[1]+S2[0]:
print('YES')
else:
print('NO') |
s214041526 | p03555 | u580920947 | 1587251038 | Python | PyPy3 (2.4.0) | py | Runtime Error | 275 | 64364 | 777 | #!/usr/bin/env python
import sys
from collections import Counter
from itertools import permutations, combinations
from fractions import gcd
from math import ceil, floor
import bisect
sys.setrecursionlimit(10 ** 6)
def input():
return sys.stdin.readline()[:-1]
def main():
n = int(input())
la = list(map(int... |
s399146425 | p03555 | u080986047 | 1586966302 | Python | PyPy3 (2.4.0) | py | Runtime Error | 165 | 38256 | 94 | a = list(input())
b = list(input())
if a == reverse(b):
print("YES")
else:
print("NO") |
s043072464 | p03555 | u080986047 | 1586966238 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38256 | 98 | a = input().split()
b = input().split()
if a == reverse(b):
print("YES")
else:
print("NO") |
s453595085 | p03555 | u964007550 | 1586865629 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 153 | c11, c12, c13 = map(int, input())
c21, c22, c23 = map(int, input())
if (c11 == c23) and (c12 == c22) and (c13 == c21):
print("YES")
else:
print("NO")
|
s771673150 | p03555 | u964007550 | 1586865471 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 151 | c11, c12, c13 = map(int, input())
c21, c22, c23 = map(int, input())
if (c11 == c23) and (c12 == c22) and (c13 == c21):
print("YES")
else:
print("NO") |
s559860327 | p03555 | u246820565 | 1586723677 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 680 | #二分探索...ソートした配列を二つに分けて、どちらに入るか調べることで高速化
import bisect
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
#リストを整列する
a.sort()
b.sort()
c.sort()
#二分探索で、それぞれのbについて、a<bになるaの個数を調べる
#二分探索で、それぞれのbについて、c>bになるcの個数を調べる
ans = 0
for i in range(n):
ab = bisec... |
s816600367 | p03555 | u870297120 | 1586706124 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 80 | a = input().split()
print('YES' if list(a[0]) == list(reversed(a[1])) else 'NO') |
s655220471 | p03555 | u125308199 | 1586642720 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 316 | moziretu1 = input()
change_type = list(moziretu1)
a1 = change_type[0]
a2 = change_type[2]
b1 = change_type[3]
b2 = change_type[5]
c1 = change_type[1]
c2 = change_type[4]
list1 = print(b2,moziretu1[1],b1)
list2 = print(a2,moziretu1[4],a1)
if a1 == b2 and a2 == b1 and c1 == c2:
print("YES")
else:
print("NO")
|
s059544275 | p03555 | u125308199 | 1586642406 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 365 | print("6文字の言葉を造ってください")
moziretu1 = input()
change_type = list(moziretu1)
a1 = change_type[0]
a2 = change_type[2]
b1 = change_type[3]
b2 = change_type[5]
c1 = change_type[1]
c2 = change_type[4]
list1 = print(b2,moziretu1[1],b1)
list2 = print(a2,moziretu1[4],a1)
if a1 == b2 and a2 == b1 and c1 == c2:
print("YES")
el... |
s071764655 | p03555 | u078349616 | 1586576263 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 155 | A = list(map(int,input().split()))
B = list(map(int,input().split()))
if A[0] == B[2] and A[1] == B[1] and A[2] == B[0]:
print("YES")
else:
print("NO") |
s162905241 | p03555 | u982591663 | 1586356544 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 151 | C1 = list(input().split())
C2 = list(input().split())
if C1[0] == C2[2] and C1[1] == C2[1] and C1[2] == C2[0]:
print("YES")
else:
print("NO")
|
s031261993 | p03555 | u772649753 | 1586291319 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | l = list(input().split())
if l[0] == l[1][::-1]:
print("YES")
else:
print("NO") |
s065211029 | p03555 | u772649753 | 1586290856 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 129 | l = list(input().split())
if l[0][0] == l[1][2] and l[0][1] == l[1][1] and l[0][2] == l[1][0]:
print("YES")
else:
print("NO") |
s904372985 | p03555 | u849151695 | 1585863516 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 513 | #二分探索
from bisect import bisect_left
#input
N = int(input())
#print(N)
A = sorted(list(map(int, input().split()))) #この表記について...
B = sorted(list(map(int, input().split())))
C = sorted(list(map(int, input().split())))
#print(A,B,C)
#sort 昇順に並び替え
#A.sort()
#B.sort()
#C.sort()
#3重を考えるとC<B<A
ans = 0
for i in range(N):
... |
s851478005 | p03555 | u450147945 | 1585712352 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 147 | C11, C12, C13 = map(str, input().split())
C21, C22, C23 = map(str, input().split())
if C11+C12+C13==C23+C22+C21:
print('YES')
else:
print('NO') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.