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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s173208007 | p03605 | u518042385 | 1557947061 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 221 | n=int(input())
l=[]
for i in range(n):
m=int(input())
l.append(m)
c=0
d=1
e=l[0]
l=sorted(l)
for i in range(1,n):
if l[i]!=e:
if d%2==1:
c+=1
e=l[i]
d=1
else:
d+=1
if d%2==1:
c+=1
print(c)
|
s384617898 | p03605 | u961916328 | 1557862213 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 77 | a = int(input())
if a%9==0 or int(a/10)=9:
print("YES")
else:
print("NO") |
s511438358 | p03605 | u367130284 | 1556937743 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38640 | 847 | #じゅっぴーフロイド
from collections import*
from itertools import*
def warshall_floyd(d):
#d[i][j]: iからjへの最短距離
for k in range(1,n+1):
for i in range(1,n+1):
for j in range(1,n+1):
d[(i,j)] = min(d[(i,j)],d[(i,k)] + d[(k,j)])
return d
##############################
n,w,r = map(in... |
s957120464 | p03605 | u549497563 | 1556749706 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 243 | n = int(input())
a = [int(input()) for i in range(n)]
dict = {}
for i in a:
if i in dict:
dict[i] += 1
else:
dict[i] = 1
ans = 0
for i in dict:
if dict[i]%2==0:
continue
else:
ans += 1
print(ans) |
s710503813 | p03605 | u975676823 | 1556458234 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 165 | n = input()
found = 0
for i in n:
if i == "9":
print("Yes")
found = 1
break
if(!found):
print("No")
|
s066508534 | p03605 | u739721456 | 1556382187 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 134 | n=int(input())
if n>=90 or n=9 or n=19 or n=29 or n=39 or n=49 or n=59 or n=69 or n=79 or n=89:
print("Yes")
else:
print("No") |
s271941939 | p03605 | u788856752 | 1556217388 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 90 | a, b = input().split('')
if a == "9" or b == "9":
print("Yes")
else:
print("No")
|
s420467621 | p03605 | u788856752 | 1556217301 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 96 | a, b = map(int, input().split(''))
if a == 9 or b == 9:
print("Yes")
else:
print("No")
|
s688342672 | p03605 | u481026841 | 1556057174 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | n = input()
for 9 in n:
print('Yes')
else:
print('No') |
s164276708 | p03605 | u481026841 | 1556057086 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | n = input()
if 9 in n:
print('Yes')
else:
print('No') |
s057048146 | p03605 | u481026841 | 1556057062 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 66 | n = int(input())
if 9 in n:
print('Yes')
else:
print('No') |
s759290547 | p03605 | u617525345 | 1555997681 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 89 | N = int(input())
a = N/10
b = N%10
if a == 9 b == 9:
print('Yes')
else:
print('No')
|
s074936939 | p03605 | u331464808 | 1555448627 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 57 | a = input()
if 9 in a:
print("Yes")
else:
print("No") |
s932975127 | p03605 | u894694822 | 1554944115 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 69 | a, b=int(input())
if a==9 or b==9:
print("Yes")
else:
print("No") |
s072515702 | p03605 | u969190727 | 1554829483 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | n=input()
if "9" in n:
print("Yes")
elif:
print("No") |
s078790261 | p03605 | u969190727 | 1554829446 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 59 | n=input()
if 9 in n:
print("Yes")
elif:
print("No") |
s002950458 | p03605 | u969190727 | 1554829385 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 58 | n=input()
if 9 in n:
print("Yes")
elif
print("No") |
s362382066 | p03605 | u310678820 | 1554588832 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 628 | from itertools import permutations
inf=10**9
n, m, r1 = map(int, input().split())
r=list(map(int, input().split()))
abc=[list(map(int, input().split())) for _ in range(m)]
d=[[inf]*n for i in range(n)]
for ai, bi, ci in abc:
d[ai-1][bi-1]=ci
d[bi-1][ai-1]=ci
for k in range(n):
for i in range(n-1):
... |
s686953621 | p03605 | u310678820 | 1554588502 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 651 | from itertools import permutations
N, M, R = map(int, input().split())
r = list(map(int, input().split()))
E = [list(map(int, input().split())) for _ in range(M)]
INF = 10 ** 9
d = [[INF for j in range(N)] for i in range(N)]
for i, j, c in E:
d[i - 1][j - 1] = c
d[j - 1][i - 1] = c
for k in range(N):
for i ... |
s212209535 | p03605 | u310678820 | 1554588414 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 651 | from itertools import permutations
N, M, R = map(int, input().split())
r = list(map(int, input().split()))
E = [list(map(int, input().split())) for _ in range(M)]
INF = 10 ** 9
d = [[INF for j in range(V)] for i in range(V)]
for i, j, c in E:
d[i - 1][j - 1] = c
d[j - 1][i - 1] = c
for k in range(V):
for i ... |
s632898531 | p03605 | u310678820 | 1554587481 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 573 | from itertools import permutations
inf=10**10
n, m, r = map(int, input().split())
r=list(map(int, input().split()))
abc=[list(map(int, input().split())) for _ in range(m)]
d=[[inf]*n for i in range(n)]
for i in range(n):
d[i][i]=0
for ai, bi, ci in abc:
d[ai-1][bi-1]=ci
d[bi-1][ai-1]=ci
for k in range(n):
... |
s299514843 | p03605 | u310678820 | 1554587203 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 573 | from itertools import permutations
inf=10**10
n, m, r = map(int, input().split())
r=list(map(int, input().split()))
abc=[list(map(int, input().split())) for _ in range(m)]
d=[[inf]*n for i in range(n)]
for i in range(n):
d[i][i]=0
for ai, bi, ci in abc:
d[ai-1][bi-1]=ci
d[bi-1][ai-1]=ci
for k in range(n):
... |
s192163880 | p03605 | u310678820 | 1554587123 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 574 | from itertools import permutations
inf=10**10
n, m, r = map(int, input().split())
r=list(map(int, input().split()))
abc=[list(map(int, input().split())) for _ in range(m)]
d=[[inf]*n for i in range(n)]
for i in range(n):
d[i][i]=0
for ai, bi, ci in abc:
d[ai-1][bi-1]=ci
d[bi-1][ai-1]=ci
for k in range(n):
... |
s632633173 | p03605 | u121732701 | 1554584001 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 89 | N = input()
count = N.count(9)
if count >= 1:
print("Yes")
else:
print("No")
|
s236190529 | p03605 | u777394984 | 1554561306 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 170 | n = Input()
ht = false
for char in n:
if char == ‘9’:
ht = true
break
if ht :
print(“Yes”)
else :
print(“No”) |
s037061840 | p03605 | u777394984 | 1554561238 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 150 | n = Input()
ht = false
for char in 'n':
if char == ‘9’:
ht = true
if ht :
print(“Yes”)
else :
print(“No”) |
s109347653 | p03605 | u597374218 | 1554261815 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 64 | n=int(input())
if n in 9:
print("Yes")
else:
print("No") |
s283883985 | p03605 | u597374218 | 1554261714 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 66 | n=int(input())
if n in "9":
print("Yes")
else:
print("No") |
s172720150 | p03605 | u225415456 | 1553648298 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 109 | n = input()
b = [int(x) for x in list(str(n))]
for i in b:
if i in 9:
print("Yes")
break |
s055557416 | p03605 | u366959492 | 1553222712 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 73 | n=input()
if n%10==9 or n//10==9:
print("Yes")
else:
print("No")
|
s167758667 | p03605 | u864900001 | 1553034958 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | #ABC73
n = input()
if(n[0]=="9" or n[1]=="9"):
print(Yes)
else:
print(No)
|
s486643716 | p03605 | u305965165 | 1552941516 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 80 | n = input()
if n[0] == "9" or n[1] == "9"
print("Yes")
else:
print("No") |
s883366376 | p03605 | u859897687 | 1552852790 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 53 | if '9'.in input():
print("Yes")
else:
print("No") |
s078439860 | p03605 | u859897687 | 1552852120 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 54 | if '9'.in(input()):
print("Yes")
else:
print("No") |
s444505647 | p03605 | u859897687 | 1552852080 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 54 | if input().in('9'):
print("Yes")
else:
print("No") |
s294760673 | p03605 | u878138257 | 1552686193 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 83 | a = input()
if a.count(9)==1 or a.count(9)==2:
print("Yes")
else:
print("No")
|
s305068220 | p03605 | u403984573 | 1552097449 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 63 | N=input()
if N.count(9)>=1:
print("Yes")
else:
print("No")
|
s707218517 | p03605 | u170324846 | 1551821508 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 76 | N=int(input())
if N[0]=="9" or N[1]=="9":
print("Yes")
else:
print("No") |
s967739257 | p03605 | u865413330 | 1551597655 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 129 | n = int(input())
l = set()
for i in range(n):
tmp = int(input())
l.remove(tmp) if tmp in l else l.add(tmp)
print(len(l))
|
s464162898 | p03605 | u865413330 | 1551597363 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 219 | n = int(input())
l = []
#l = [l.remove(int(input())) if int(input()) in l else int(input()) for i in range(n)]
for i in range(n):
l.remove(int(input())) if int(input()) in l else l.append(int(input()))
print(len(l)) |
s600486195 | p03605 | u865413330 | 1551596271 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 59 | l = list(input())
print("Yes") if l in "9" else print("No") |
s436470616 | p03605 | u865413330 | 1551596251 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 67 | l = list(input().split())
print("Yes") if l in "9" else print("No") |
s715301562 | p03605 | u973663980 | 1551201411 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 64 | if input().find("9")>-1:
print("Yes")
else:
print("No")
|
s211231206 | p03605 | u973663980 | 1551201377 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 64 | if input().find('9')>-1:
print("Yes")
else:
print("No")
|
s883780319 | p03605 | u973663980 | 1551201337 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 63 | if input().find("9")>-1:
print("Yes")
else:
print("No")
|
s520346373 | p03605 | u973663980 | 1551201124 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 63 | if input().find("9")>-1:
print("Yes")
else:
print("No") |
s145516722 | p03605 | u721316601 | 1550873682 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 64 | N = int(input())
if '9' in N:
print('Yes')
else:
print('No') |
s157526187 | p03605 | u020604402 | 1549454252 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 348 | #include <stdio.h>
#include <string.h>
#include <math.h>
int main(void){
char s[1000000];
scanf("%s", s);
for (int i = 0; i < strlen(s); i++) {
if (s[i]=='9') {
printf("Yes\n");
return 0;
}
}
printf(... |
s190279589 | p03605 | u375616706 | 1548128208 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 665 | from itertools import permutations
import sys
input = sys.stdin.readline
N, M, R = (list)(map(int, input().split()))
#dest = (list)(map(lambda x: (int)(x)-1, input().split()))
dest = [x-1 for x in map(int, input().split())]
inf = float('inf')
mat = [[inf]*N for _ in range(N)]
for _ in range(M):
a, b, c = (li... |
s745040480 | p03605 | u694370915 | 1546897751 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 147 | def main():
x, a = map(int, input().split())
if (x-a) <= 0:
print(0)
return
print(x-a)
return
if __name__ == '__main__':
main() |
s630378133 | p03605 | u363407238 | 1546649214 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 157 | n=int(input())
paper=list()
for _ in range(n):
a = input()
if a in paper:
paper.remove(a)
else:
paper.append(a)
print(len(paper)) |
s667143228 | p03605 | u620480037 | 1546110552 | Python | PyPy3 (2.4.0) | py | Runtime Error | 191 | 38384 | 645 | from itertools import permutations
N,M,R=map(int,input().split())
r=list(map(int,input().split()))
for i in range(len(r)):
r[i]-=1
A=[]
a=[]
for i in range(N):
for j in range(N):
a.append(1000000)
A.append(a)
a=[]
#print(A)
for i in range(M):
a,b,c=map(int,input().split())
A[a-1... |
s244040797 | p03605 | u371467115 | 1545293658 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 93 | N=map(int,input().replace("",",").split())
if 9 in N:
print("Yes")
else:
print("No")
|
s643850207 | p03605 | u216631280 | 1544846406 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 81 | n = list(map(str, input().split()))
if n in '9':
print('Yes')
else:
print('No') |
s527331375 | p03605 | u216631280 | 1544846368 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 81 | n = list(map(int, input().split()))
if n in '9':
print('Yes')
else:
print('No') |
s982036869 | p03605 | u216631280 | 1544846324 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 71 | n = list(input().split())
if n in '9':
print('Yes')
else:
print('No') |
s668600599 | p03605 | u920299620 | 1542823664 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 728 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
typedef int64_t llong;
char moji[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z... |
s615397239 | p03605 | u869728296 | 1541810189 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 90 | a=int(input())
b=list(a)
if(b[0]==9 or b[1]==9):
print("Yes")
else:
print("No")
|
s693527423 | p03605 | u199347185 | 1540264592 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3056 | 439 | def main():
N = int(input())
paper = []
for i in range(N):
# Aのi番目
ai = int(input())
for p in range(len(paper)):
if paper[p] < ai:
continue
elif paper[p] == ai:
paper.remove(ai)
break
else:
... |
s037494625 | p03605 | u940102677 | 1538372634 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 82 | a = list(input())
if a[0] == "9" or a[1] == "9":
print(Yes)
else:
print(No)
|
s950029372 | p03605 | u940102677 | 1538372566 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 80 | a = list(input())
if a[0] = "9" or a[1] = "9":
print(Yes)
else:
print(No)
|
s552242812 | p03605 | u940102677 | 1538372537 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 76 | a = list(input())
if a[0] = 9 or a[1] = 9:
print(Yes)
else:
print(No)
|
s213394372 | p03605 | u536113865 | 1536022211 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 504 | from itertools import permutations
N,M,R = map(int,input().split())
r = list(map(int,input().split()))
d = [[float('inf') for _ in range(N)] for _ in range(N)]
for _ in range(M):
a,b,c = map(int,input().split())
d[a-1][b-1] = c
d[b-1][a-1] = c
for i in range(N):
d[i][i]=0
from scipy.sparse import csgra... |
s860123302 | p03605 | u525423408 | 1535585947 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 137 | N=int(input())
b=set()
for i in range(N):
a=int(input())
if a in b:
b.remove(a)
else:
b.add(a)
print(len(b)) |
s529308127 | p03605 | u525423408 | 1535585871 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 132 | N=int(input())
b=set()
for i in range(N):
a=input()
if a in b:
b.remove(a)
else:
b.add(a)
print(len(b)) |
s314659472 | p03605 | u048945791 | 1534204090 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 65 | n = int(input())
if "9" in n:
print("Yes")
else:
print("No") |
s966967370 | p03605 | u140251125 | 1529171357 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 121 | # input
N_lst = [int(x) for x in list(input()]
if N_lst[0] == 9 or N_lst[1] == 9:
print('Yes')
else:
print('No') |
s380483142 | p03605 | u258647915 | 1526537079 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 940 | from itertools import permutations
def read(): return list(map(int, input().split()))
INF = 114514810
def wf(d):
N = len(d[0])
for k in range(N):
for i in range(N):
for j in range(N):
if d[i][j] > d[i][k] + d[k][j]:
d[i][j] = d[i][k] + d[k][j]
... |
s097516901 | p03605 | u613028067 | 1525536767 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 120 | a=""
a=raw_input()
ans=0
for i in range(len(a)-1):
if a[i]=='9':
ans=1
if ans==1:
print 'Yes'
if ans==0:
print 'No' |
s792640090 | p03605 | u613028067 | 1525536713 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 114 | a=""
a=input()
ans=0
for i in range(len(a)):
if a[i]=='9':
ans=1
if ans==1:
print 'Yes'
if ans==0:
print 'No' |
s571614073 | p03605 | u937889033 | 1524097113 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 581 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, init, n) for(int i = init; i < (n); i++)
using namespace std;
using ll = long long int;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using edge = struct
{
int to, cost;
};
const int MOD = 1e9 + 7;
const int iINF ... |
s394340892 | p03605 | u591295155 | 1524072304 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | a = int(input())
print(["No", "Yes"][a//10 == 9 or a%10 == 9] |
s863207965 | p03605 | u192903163 | 1522381893 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 80 | a = str(input())
if a[0] == '9' || a[1] == '9':
print("Yes")
else:
print("No") |
s638318217 | p03605 | u192903163 | 1522381409 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 77 |
a = str(input())
if a[0] == 9 || a[1] == 9:
print("Yes")
else:
print("No") |
s870294278 | p03605 | u127856129 | 1521405082 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 81 | a=list(input().split())
if a[0]==9 or a[1]==9:
print("Yes")
else:
print("No") |
s355005798 | p03605 | u571972389 | 1521076421 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 156 | n = int(input())
a = []
x = 0
for i in range(n):
a.append(list(map(int,input().split())))
for b in range(n):
x += a[b][-1] - a[b][0] + 1
print(x) |
s461652435 | p03605 | u565380863 | 1520812256 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 64 | #-*- coding: utf-8 -*-
print(['No', 'Yes'][input().count('9')])
|
s153182220 | p03605 | u813098295 | 1520194494 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 191 | #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
if ( (N % 10 == 9) || (N / 10 == 9) ) {
puts("Yes");
}
else {
puts("No");
}
return 0;
} |
s456619052 | p03605 | u957089771 | 1520130843 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 64 | N = input()
if "9" in n:
print("Yes")
else:
printI("No") |
s533084566 | p03605 | u748135969 | 1519085724 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 65 | n = int(input())
if n in '9':
print("Yes")
else:
print("No") |
s362966446 | p03605 | u612721349 | 1517030868 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 72 | print("YNeos"["9"not in input()::2])
print("Yes"if"9"in input()else"No") |
s726921237 | p03605 | u916743460 | 1515547766 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 306 | import collections
num = int(input())
inps = []
for x in range(0,num):
# inp[x] = int(input())
inp = int(input())
inps.append(inp)
# print(inps)
count = collections.Counter(inps)
# print(count.keys())
ans = 1
for x in range(0,int(len(count))):
if int(count[x]) % 2 == 1:
ans += 1
print(ans) |
s599468722 | p03605 | u403355272 | 1515544574 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 65 | a = int(input())
if "9" in a:
print("Yes")
else :
print("NO") |
s801988299 | p03605 | u667084803 | 1513807935 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 585 | def Warshall_Floyd(edges,N):
for k in range(N):
for i in range(N):
for j in range(N):
edges[i][j]=min(edges[i][j],edges[i][k]+edges[k][j])
return edges
import itertools
N, M, R = map(int,input().split())
r = list(map(int,input().split()))
A=[[float("inf") for i in range(N)] for j in range(N)]
for... |
s509508982 | p03605 | u814166125 | 1513695659 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 265 | # -*- coding: utf-8 -*-
"""
Created on Tue Dec 19 09:36:44 2017
@author: kotania
"""
N = int(input())
lrList = [""]*N
for n in range(0,N):
lrList[n] = input()
sum = 0
for lr in lrList:
sum += (int(lr.split()[1]) - int(lr.split()[0]) + 1)
print(sum)
|
s124207266 | p03605 | u158419894 | 1513688708 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 201 | N = int(input())
nums = []
sum = 0
for i in range(0,N):
num = input()
if num in nums:
nums.remove(num)
sum -= 1
else:
nums.append(num)
sum += 1
print(sum) |
s866039121 | p03605 | u158419894 | 1513688576 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 187 | N = int(input())
nums = []
sum = 0
for i in range(0,N):
num = input()
if num in nums:
nums.remove(num)
else:
nums.append(num)
sum = sum + 1
print(sum) |
s772891022 | p03605 | u158419894 | 1513652328 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 96 | N = int(input())
if N >= 90 or (N+1)%10 is 0:
print("Yes")
else:
print("No") |
s215114225 | p03605 | u158419894 | 1513652211 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 99 | N = input()
if N >= 90:
print("Yes")
elif (N+1)%10 is 0:
print("Yes")
else:
print("No") |
s147163240 | p03605 | u158419894 | 1513651984 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 87 | if N >= 90:
print("Yes")
elif (N+1)%10 is 0:
print("Yes")
else:
print("No") |
s023954630 | p03605 | u108377418 | 1513649102 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 490 | # 今日、日本は9月9日である。
# 2桁の整数Nが与えられる。
# Nに9が含まれるか調べ、含まれていればYes、そうでなければNoを出力する
def September9(num):
if (num // 10) == 9:
print("Yes")
elif (num % 10) == 9:
print("Yes")
else:
print("No")
if __name__ == "__main__":
N = int( input())
September9(N) # September9()の実行
... |
s483529298 | p03605 | u108377418 | 1513648078 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1885 | """
N×N のマス目があります。
このマス目の各マスを白色または黒色に塗ることにしました (すべてのマスをどちらか片方の色に塗ります)。
ちょうど A マスを白色に塗るとき、黒色に塗ることになるマスはいくつあるでしょうか。
"""
"""
標準入力は以下の形式で与えられる
-------------------------------
N
A
"""
"""
N,Aの条件
------------------
1 <= N & N <= 100
0 <= A & A <= N**2
"""
"""
出力
-------... |
s282448791 | p03605 | u587084850 | 1511798050 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 148 |
n = raw_input()
n_dec = int(n) / 10
n_one = int(n) % 10
if(n_one ==9):
print("Yes")
elif(n_dec == 9):
print("Yes")
else:
print("No")
|
s350561775 | p03605 | u019584841 | 1511570552 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | n=int(input())
if n[0]==9 or n[1]==9:
print("Yes")
else:
print("No") |
s628952158 | p03605 | u593227551 | 1511369399 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 94 | n = int(input())
l = list(n)
if l[0] == 9 or l[1] == 9:
print("Yes")
else:
print("No") |
s918960144 | p03605 | u825528847 | 1509580411 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 115 | N = int(input())
ans = 0
for _ in range(N):
l, r = map(int, input().split())
ans += (r - l) + 1
print(ans)
|
s316857781 | p03605 | u363981555 | 1509052462 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 67 | a=input()
if a.find('9')>0:
print('Yes')
else:
print('No')
|
s377246460 | p03605 | u363981555 | 1509052379 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 67 | a=input()
if a.find('9')>0:
print('Yes')
else:
print('No')
|
s735045678 | p03605 | u149580849 | 1508831854 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 94 | a = map(int,list(input()))
if (a[0] == 9 or a[1] == 9):
print("Yes")
else:
print("No") |
s915325067 | p03605 | u149580849 | 1508831552 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 94 | a = map(int,list(input()))
if (a[0] == 9 or a[1] == 9):
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.