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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s781392549 | p02257 | u464859367 | 1522081165 | Python | Python3 | py | Runtime Error | 0 | 0 | 396 | import math
def is_prime(x):
if x == 2:
return True
if x < 2 or x % 2 == 0:
return False
i = 3
while i <= math.sqrt(x):
if x % i == 0:
return False
i = i + 2
return True
n = int(input())
numbers = [int(input()) for i in n]
count = 0
for i in range(n):
if is_prime(numbers[i]) is True:
count += 1
print(count)
|
s786075090 | p02257 | u566311709 | 1522475707 | Python | Python3 | py | Runtime Error | 0 | 0 | 165 | ef is_prime(n):
t = 2
while n > t:
if n % t == 0: return 0
t += 1
return 1
c = 0
for _ in range(int(input())):
c += is_prime(int(input()))
print(c)
|
s072239744 | p02257 | u269391636 | 1523292679 | Python | Python3 | py | Runtime Error | 0 | 0 | 238 | count = 0
n = int(input())
def ifprime(num):
for i in range(2,num ** 0.5 + 1):
if num % i:
continue
else:
return False
return True
for _ in range(n):
a = int(input())
if ifprime(a):
count += 1
print(count)
|
s679836840 | p02257 | u742505495 | 1524033475 | Python | Python3 | py | Runtime Error | 0 | 0 | 531 | import math
def Eratos(n):
primes = [2]
num = [2*i+1 for i in range(1,n//2)]
tmp = []
top = 1
while top < math.sqrt(n):
top = num[0]
for i in range(1,len(num)):
if num[i] % top != 0:
tmp.append(num[i])
num = tmp
tmp = []
primes.append(top)
for i in range(len(num)):
primes.append(num[i])
return primes
n = int(input())
cont = 0
nums = []
for i in range(n):
a = int(input())
nums.append(a)
nums.sort()
primes = Eratos(nums[n-1])
for i in range(n):
if primes.count(num[i])!=0:
cont += 1
print(cont)
|
s979354729 | p02257 | u684325232 | 1524107474 | Python | Python3 | py | Runtime Error | 0 | 0 | 357 | import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
for j in range(2,int(math.sqrt(A[i])+1)):
if A[i]%j==0:
B[i]=1 ##素数でないなら1を入力
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s988807825 | p02257 | u684325232 | 1524109825 | Python | Python3 | py | Runtime Error | 0 | 0 | 589 | ##Prime Numbers
##16D8101008G Kojima Masayoshi 小嶋真義 2018.4.18
import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
##print(B)検査
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]==1
elif A[i]%2==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1 ##素数でないなら1を入力
break
##print(B)
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s656245649 | p02257 | u684325232 | 1524110211 | Python | Python3 | py | Runtime Error | 0 | 0 | 657 | ##Prime Numbers
##16D8101008G Kojima Masayoshi 小嶋真義 2018.4.18
import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
##print(B)検査
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1 ##素数でないなら1を入力
break
##print(B)
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s224600547 | p02257 | u684325232 | 1524110424 | Python | Python3 | py | Runtime Error | 0 | 0 | 657 |
##Prime Numbers
##16D8101008G Kojima Masayoshi 小嶋真義 2018.4.18
import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
##print(B)検査
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1 ##素数でないなら1を入力
break
##print(B)
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s566671199 | p02257 | u684325232 | 1524111159 | Python | Python3 | py | Runtime Error | 0 | 0 | 725 | ##Prime Numbers
##16D8101008G Kojima Masayoshi 小嶋真義 2018.4.18
import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
##print(B)検査
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==3:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%3==0:
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1 ##素数でないなら1を入力
break
##print(B)
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s395545132 | p02257 | u684325232 | 1524111359 | Python | Python3 | py | Runtime Error | 0 | 0 | 590 |
import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==3:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%3==0:
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s735586794 | p02257 | u684325232 | 1524111385 | Python | Python3 | py | Runtime Error | 0 | 0 | 590 |
import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==3:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%3==0:
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s631691422 | p02257 | u684325232 | 1524111406 | Python | Python3 | py | Runtime Error | 0 | 0 | 589 | import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==3:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%3==0:
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s520280869 | p02257 | u684325232 | 1524111557 | Python | Python3 | py | Runtime Error | 0 | 0 | 589 | import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==3:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%3==0:
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s903800506 | p02257 | u684325232 | 1524111572 | Python | Python | py | Runtime Error | 0 | 0 | 589 | import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==3:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%3==0:
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s459842299 | p02257 | u684325232 | 1524111776 | Python | Python3 | py | Runtime Error | 0 | 0 | 589 | import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==3:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%3==0:
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s414520619 | p02257 | u684325232 | 1524112118 | Python | Python3 | py | Runtime Error | 0 | 0 | 584 | import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=input()
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==3:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%3==0:
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s004907758 | p02257 | u684325232 | 1524112433 | Python | Python3 | py | Runtime Error | 0 | 0 | 579 | import numpy as np
import math
n=input()
A=np.zeros((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=input()
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==3:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%3==0:
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s826126031 | p02257 | u684325232 | 1524112645 | Python | Python3 | py | Runtime Error | 0 | 0 | 579 | import numpy as np
import math
n=input()
A=np.zeros((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=input()
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]==3:
B[i]=0
elif A[i]==5:
B[i]=0
elif A[i]%2==0 :
B[i]=1
elif A[i]%3==0:
B[i]=1
elif A[i]%5==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s779493577 | p02257 | u684325232 | 1524113056 | Python | Python3 | py | Runtime Error | 0 | 0 | 531 | ##Prime Numbers
##16D8101008G Kojima Masayoshi 小嶋真義 2018.4.18
import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]%2==0 :
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s768219002 | p02257 | u684325232 | 1524113171 | Python | Python3 | py | Runtime Error | 0 | 0 | 531 | ##Prime Numbers
##16D8101008G Kojima Masayoshi 小嶋真義 2018.4.18
import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]%2==0 :
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s170895669 | p02257 | u684325232 | 1524113175 | Python | Python3 | py | Runtime Error | 0 | 0 | 531 | ##Prime Numbers
##16D8101008G Kojima Masayoshi 小嶋真義 2018.4.18
import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]==2:
B[i]=0
elif A[i]%2==0 :
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
break
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s241779076 | p02257 | u684325232 | 1524113908 | Python | Python3 | py | Runtime Error | 0 | 0 | 424 |
import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]!=2 and A[i]%2==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
for i in range(n):
print(i,":",count)
if B[i]==0:
count=count+1
|
s031324205 | p02257 | u684325232 | 1524113922 | Python | Python3 | py | Runtime Error | 0 | 0 | 422 | import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
for i in range(n):
if A[i]==1:
B[i]=1
elif A[i]!=2 and A[i]%2==0:
B[i]=1
else:
for j in range(2,int(math.sqrt(A[i]))):
if A[i]%j==0:
B[i]=1
for i in range(n):
print(i,":",count)
if B[i]==0:
count=count+1
|
s861961589 | p02257 | u684325232 | 1524114762 | Python | Python3 | py | Runtime Error | 0 | 0 | 572 |
import numpy as np
import math
n=int(input())
A=np.empty((n))
B=np.zeros((n))
count=0
for i in range(n):
A[i]=int(input())
##print(A)
for i in range(n):
if A[i]==1:
B[i]=1
##print("ifの1")
elif A[i]!=2 and A[i]%2==0:
B[i]=1
##print("ifの2")
else:
for j in range(2,int(math.sqrt(A[i]))+1):
##print("j",j)
if A[i]%j==0:
B[i]=1
break
##print("ifの3")
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s185615709 | p02257 | u684325232 | 1524115188 | Python | Python3 | py | Runtime Error | 0 | 0 | 578 | import numpy as np
import math
n=int(input())
A=np.empty((10000))
B=np.zeros((10000))
count=0
for i in range(n):
A[i]=int(input())
##print(A)
for i in range(n):
if A[i]==1:
B[i]=1
##print("ifの1")
elif A[i]!=2 and A[i]%2==0:
B[i]=1
##print("ifの2")
else:
for j in range(2,int(math.sqrt(A[i]))+1):
##print("j",j)
if A[i]%j==0:
B[i]=1
break
##print("ifの3")
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s450417670 | p02257 | u684325232 | 1524115212 | Python | Python | py | Runtime Error | 0 | 0 | 578 | import numpy as np
import math
n=int(input())
A=np.empty((10000))
B=np.zeros((10000))
count=0
for i in range(n):
A[i]=int(input())
##print(A)
for i in range(n):
if A[i]==1:
B[i]=1
##print("ifの1")
elif A[i]!=2 and A[i]%2==0:
B[i]=1
##print("ifの2")
else:
for j in range(2,int(math.sqrt(A[i]))+1):
##print("j",j)
if A[i]%j==0:
B[i]=1
break
##print("ifの3")
for i in range(n):
if B[i]==0:
count=count+1
print(count)
|
s763167162 | p02257 | u836567931 | 1524119712 | Python | Python3 | py | Runtime Error | 0 | 0 | 68 | n=int(input())
a[n]={0}
for i in range(1,n):
a[i]=int(input())
|
s803639213 | p02257 | u836567931 | 1524119726 | Python | Python3 | py | Runtime Error | 0 | 0 | 59 | n=int(input())
for i in range(1,n):
a[i]=int(input())
|
s106001053 | p02257 | u836567931 | 1524119800 | Python | Python3 | py | Runtime Error | 0 | 0 | 64 | n=int(input())
a=[]
for i in range(1,n):
a[i]=int(input())
|
s679025067 | p02257 | u836567931 | 1524119831 | Python | Python3 | py | Runtime Error | 0 | 0 | 66 | n=int(input())
a=[]
for i in range(1,n-1):
a[i]=int(input())
|
s113070441 | p02257 | u063056051 | 1524134283 | Python | Python3 | py | Runtime Error | 0 | 0 | 219 |
import math
a=int(input())
sum=0
for i in range(n):
ok=0
n=int(input())
if n==2 or n==3:
sum+=1
if n>3:
for j in range(2,int(math.sqrt(n))+1):
if n%j==0:
ok=1
if ok==1:
sum+=1
print(sum)
|
s372826192 | p02257 | u063056051 | 1524134375 | Python | Python3 | py | Runtime Error | 0 | 0 | 224 |
import math
a=int(input())
sum=0
ok=0
for i in range(n):
ok=0
n=int(input())
if n==2 or n==3:
sum+=1
if n>3:
for j in range(2,int(math.sqrt(n))+1):
if n%j==0:
ok=1
if ok==1:
sum+=1
print(sum)
|
s374483197 | p02257 | u063056051 | 1524134672 | Python | Python3 | py | Runtime Error | 0 | 0 | 181 |
import math
a=int(input())
sum=0
for i in range(n):
b=1
n=int(input())
for j in range(2,int(math.sqrt(n))+1):
if n%j==0:
b=0
break
sum+=b
print(sum)
|
s469189030 | p02257 | u481571686 | 1524585910 | Python | Python3 | py | Runtime Error | 0 | 0 | 274 | import math
def is_prime(n):
for i in range(2,math.floor(math.sqrt(n))+1):
if n!=2 or n%2==0:
return False
elif n%i==0:
return False
return True
cnt = 0
n=int(input())
for i in range(n):
k=int(input())
if is_prime(k):
cnt += 1
print(cnt)
|
s172314742 | p02257 | u573915636 | 1524627052 | Python | Python3 | py | Runtime Error | 0 | 0 | 200 | def sosu(int x):
for i in range(2,x):
if x%i=0:
c++
if c=0:
return true:
else:
return false:
cnt=0
n=input(int())
for i in range(n):
m[i]=input(int())
if sosu(m[i]):
cnt++
print(cnt)
|
s889539796 | p02257 | u573915636 | 1524627353 | Python | Python3 | py | Runtime Error | 0 | 0 | 199 | def sosu(int x):
for i in range(2,x):
if x%i=0:
c++
if c=0:
return true:
else:
return false:
cnt=0
n=input(int())
for i in range(n):
m[i]=input(int())
if sosu(m[i]):
cnt++
print(cnt)
|
s437755674 | p02257 | u573915636 | 1524627904 | Python | Python3 | py | Runtime Error | 0 | 0 | 206 | def sosu(x):
for i in range(2,x):
if x%i==0:
c=c+1
if c==0:
return true
else:
return false
cnt=0
m=[]
n=input(int())
for i in range(n):
m[i]=input(int())
if sosu(m[i]):
cnt=cnt+1
print(cnt)
|
s119085053 | p02257 | u126478680 | 1524632516 | Python | Python3 | py | Runtime Error | 0 | 0 | 455 | #! python3
# prime_number.py
import math
def is_prime_number(x):
if x < 2: return False
elif x == 2: return True
elif x%2 == 0: return False
sqrt_upper_bound = math.ceil(math.sqrt(x))
for i in range(3, sqrt_upper_bound, 2):
if num % i == 0:
return False
return True
n = int(input())
prime_num = 0
for i in range(n):
x = int(input())
if is_prime_number(x):
prime_num += 1
print(prime_num)
|
s011852180 | p02257 | u810922275 | 1527034540 | Python | Python3 | py | Runtime Error | 0 | 0 | 256 | N=int(input())
A=np.empty(N)
for i in range(N):
A[i]=int(input())
cnt=0
for i in range(N):
if A[i]%2==0 and A[i]!=2:
continue
x=int(np.sqrt(i))+1
for j in range(2,x):
if A[i]%j==0:
break
cnt=cnt+1
print(cnt)
|
s848850814 | p02257 | u158021138 | 1528101631 | Python | Python3 | py | Runtime Error | 0 | 0 | 282 |
def divisor(num):
for i in range(2, num):
if num % 2 == 0 and k != 2:
continue
if num % i == 0:
return True
return False
N = input()
cnt = 0
for num in int(input()):
if divisor(num):
cnt = cnt+1
print(cnt)
|
s870911623 | p02257 | u158021138 | 1528101677 | Python | Python3 | py | Runtime Error | 0 | 0 | 277 |
def divisor(num):
for i in range(2, num):
if num % 2 == 0 and num != 2:
continue
if num % i == 0:
return True
return False
N = input()
cnt = 0
for num in int(input()):
if divisor(num):
cnt = cnt+1
print(cnt)
|
s394840935 | p02257 | u158021138 | 1528104819 | Python | Python3 | py | Runtime Error | 0 | 0 | 353 |
def divisor(num):
for i in range(2, num):
if i %2 == 0 and i != 2:
continue
for j in range(2, num/2):
if num % j == 0:
return False
break
return True
N = int(input())
cnt = 0
for itr in range(N):
num = int(input())
if divisor(num):
cnt = cnt + 1
print(cnt)
|
s307297992 | p02257 | u327546577 | 1528573604 | Python | Python3 | py | Runtime Error | 30 | 5640 | 319 | def eratos(n):
is_prime = [True for i in range(n+1)]
for i in range(2, n):
if i * i > n:
break
for j in range(i*i, n, i):
is_prime[j] = False
return is_prime
is_prime = eratos(10000)
n = int(input())
ans = 0
for _ in range(n):
x = int(input())
if is_prime[x] is True:
ans += 1
print(ans)
|
s527199304 | p02257 | u298224238 | 1529095050 | Python | Python3 | py | Runtime Error | 0 | 0 | 305 | import math
def isPrime(n):
if n <= 2:
return n == 2
if (n % 2 == 0):
return False
for i in range(3, math.sqrt(n) + 1, 2):
if n % i == 0:
return False
return True
N = int(input())
print(len(list(filter(isPrime, [int(input()) for i in range(N)]))))
|
s202027375 | p02257 | u457728280 | 1529248994 | Python | Python3 | py | Runtime Error | 0 | 0 | 94 | intMax = -100000000
inputData = int(input())
inputList = list()
inputList.append(int(input())
|
s167925431 | p02257 | u269568674 | 1529381422 | Python | Python3 | py | Runtime Error | 0 | 0 | 305 | import math
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
N = input()
l = [input() for i in range(N)]
a = 0
for i in range(0,len(l)):
if ( is_prime(l[i]) == True
a += 1
print(a)
|
s873880174 | p02257 | u316584871 | 1529384508 | Python | Python3 | py | Runtime Error | 0 | 0 | 451 | def composite(d,n,s): for a in (2,3,5,7): p = False if pow(a,d,n) == 1: continue for i in range(s): if pow(a, 2**i * d, n) == n-1: p = True break if not p: return True return False def is_prime(n): if n in (2,3,5,7): return True elif 0 in (n%2,n%3,n%5,n%7): return False else: d,s = n-1, 0 while not d%2: d,s = d>>1,s+1 return not composite(d,n,s) r = [] n = int(input()) for i in range(n): n = int(input()) if is_prime(n): r.append(n) print(len(r))
|
s591214406 | p02257 | u418996726 | 1530226626 | Python | Python3 | py | Runtime Error | 0 | 0 | 331 | def isPrime(n):
if n == 1:
return False
elif n == 2 or n == 3:
return True
else:
for i in range(2, n//2+1):
if n % i == 0
return False
return True
N = int(input())
count = 0
for _ in range(N):
if isPrime(int(input())):
count += 1
print(count)
|
s174869433 | p02257 | u418996726 | 1530491527 | Python | Python3 | py | Runtime Error | 20 | 5596 | 693 | class PrimeChecker:
def __init__(self):
self.primes = [2,3,5]
def isPrime(self, n):
if n in self.primes:
return True
else:
for i in self.primes:
if n % i == 0:
return False
i = self.primes[-1]
w = 2 if i % 6 == 5 else 4
while i * i <= n:
if self.isPrime(i,n) and n % i == 0:
return False
i += w
w = 6 - w
self.primes.append(n)
return True
primeChecker = PrimeChecker()
count = 0
N = int(input())
for _ in range(N):
if primeChecker.isPrime((int(input()))):
count += 1
print(count)
|
s914579297 | p02257 | u418996726 | 1530574301 | Python | Python3 | py | Runtime Error | 0 | 0 | 160 | f = lambda x: 1 if (not x < 2 and not x&1 == 0) and (x == 2 or x == 3 or pow(2,x-1,x) == 1) else 0
print(count += f(int(input())) for _ in range(int(input())))
|
s994062956 | p02257 | u763301852 | 1363526297 | Python | Python | py | Runtime Error | 0 | 0 | 297 | import math
main()
def prime(n):
for i in range(2, int(math.sqrt(n))+1):
if n % i == 0:
return False
return True
def main():
N = input()
n = [input() for x in range(N)]
c = 0
for i in range(N):
if prime(n[i]):
c += 1
print(c) |
s498834354 | p02257 | u912237403 | 1371260422 | Python | Python | py | Runtime Error | 0 | 0 | 443 | def get_primes(n):
x = [0,0]+[i for i in range(2,n+1)]
for i in range(int(n**0.5+1)):
if x[i] !=0:
for j in range(e*2, n+1,e):
x[j] = 0
return filter(None, x)
PRIMES = get_primes(10000)
n = int(input())
c = 0
for i in range(n):
p = int(input())
f = 1
for e in PRIMES:
if e >= p:
break
if p % e == 0:
f = 0
break
c += f
print c |
s630212965 | p02257 | u912237403 | 1371260487 | Python | Python | py | Runtime Error | 0 | 0 | 456 | def get_primes(n):
x = [0,0]+[i for i in range(2,n+1)]
for i in range(int(n**0.5+1)):
e = x[]
if e !=0:
for j in range(e*2, n+1,e):
x[j] = 0
return filter(None, x)
PRIMES = get_primes(10000)
n = int(input())
c = 0
for i in range(n):
p = int(input())
f = 1
for e in PRIMES:
if e >= p:
break
if p % e == 0:
f = 0
break
c += f
print c |
s220385165 | p02257 | u912237403 | 1371260648 | Python | Python | py | Runtime Error | 0 | 0 | 342 | def get_primes(n):
x = [0,0]+[i for i in range(2,n+1)]
for i in range(int(n**0.5+1)):
e = x[i]
if e !=0:
for j in range(e*2, n+1,e):
x[j] = 0
return x
PRIMES = get_primes(100000000)
n = int(input())
c = 0
for i in range(n):
p = int(input())
if x[p] == 0:
c += 1
print c |
s931490253 | p02257 | u266872031 | 1385396887 | Python | Python | py | Runtime Error | 0 | 0 | 232 | import sys
count =0
for line in sys.stdin:
a=int(line.strip())
count =count + checkprime(a)
print count
def checkprime(a):
for t in range (a-1):
s=t+1
if a%s==0:
return 0
return 1
|
s799500429 | p02257 | u547057305 | 1390052693 | Python | Python | py | Runtime Error | 0 | 0 | 224 | n = gets.to_i
m = []
p_num = 0
n.times{
m += [gets.to_i]
}
for x in m
flag = 0
for y in 2..(x**0.5)+1
if x % y == 0
flag = 1
break
end
end
if flag == 0
p_num += 1
end
end
puts "", p_num |
s129216861 | p02257 | u904989881 | 1391602350 | Python | Python | py | Runtime Error | 0 | 0 | 212 | n = input()
count = 0
for i in xrange(n):
x = input()
if x == 2: count += 1
elif x % 2 != 0:
for j in xrange(3,x*0.5+1,2):
if x % j == 0: break
else: count += 1
print count |
s126898261 | p02257 | u904989881 | 1391602459 | Python | Python | py | Runtime Error | 0 | 0 | 240 | n = input()
count = 0
for i in xrange(n):
x = input()
if x == 2: count += 1
elif x == 3: count += 1
elif x % 2 != 0:
for j in xrange(3,x*0.5+1,2):
if x % j == 0: break
else: count += 1
print count |
s550229137 | p02257 | u633068244 | 1393743146 | Python | Python | py | Runtime Error | 0 | 0 | 295 | import math
n = int(raw_input())
a = []
for i in range(n):
a.append(int(raw_input))
r = max(a)+1
sqrt = math.sqrt(r)
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1,r,i+1] = [0 for i in range(2*i+1,r,i+1)]
count = 0
for i in a:
count += p[i-1]
print count |
s218660385 | p02257 | u633068244 | 1394704551 | Python | Python | py | Runtime Error | 0 | 0 | 289 | import math
r = 100000000
sqrt = math.sqrt(r)
p = [1 for i in range(r)]
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
count = 0
while True:
try:
n = int(raw_input())
if p[n-1]:
count += 1
print count |
s201594335 | p02257 | u633068244 | 1394704780 | Python | Python | py | Runtime Error | 0 | 0 | 315 | import math
r = 100000000
sqrt = math.sqrt(r)
p = [1 for i in range(r)]
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
count = 0
while True:
try:
n = int(raw_input())
if p[n-1]:
count += 1
except:
break
print count |
s851447651 | p02257 | u633068244 | 1394705131 | Python | Python | py | Runtime Error | 0 | 0 | 326 | import math
r = 10000000
sqrt = int(math.sqrt(r))
p = [1 for i in range(r)]
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
count = 0
n = int(raw_input())
for i in range(n):
m = int(raw_input())
if p[m-1]:
count += 1
except:
break
print count |
s324597831 | p02257 | u633068244 | 1394705164 | Python | Python | py | Runtime Error | 0 | 0 | 326 | import math
r = 50000000
sqrt = int(math.sqrt(r))
p = [1 for i in range(r)]
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
count = 0
n = int(raw_input())
for i in range(n):
m = int(raw_input())
if p[m-1]:
count += 1
except:
break
print count |
s706798672 | p02257 | u633068244 | 1394705969 | Python | Python | py | Runtime Error | 40 | 8584 | 324 | import math
n = int(raw_input())
a = []
for i in range(n):
a.append(int(raw_input()))
r = max(a)
sqrt = int(math.sqrt(r))
p = [1 for i in range(r)]
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
count = 0
for i in a:
if p[i-1]:
count += 1
print count |
s192056410 | p02257 | u633068244 | 1395994121 | Python | Python | py | Runtime Error | 0 | 0 | 225 | import math
r = max(n)+1
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
n = int(raw_input())
for i in range(n):
print sum(p[:n]) |
s410686376 | p02257 | u633068244 | 1395994278 | Python | Python | py | Runtime Error | 1990 | 281132 | 266 | import math
r = 10000001
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
n = int(raw_input())
ans = 0
for i in range(n):
m = int(raw_input())
ans += p[m-1]
print ans |
s531344353 | p02257 | u633068244 | 1395994388 | Python | Python | py | Runtime Error | 0 | 0 | 276 | import math
n = int(raw_input())
ls = [int(raw_inpu() for i in range(n)]
r = max(ls)+1
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
ans = 0
for i in ls:
ans += p[i-1]
print ans |
s265756256 | p02257 | u633068244 | 1395994388 | Python | Python | py | Runtime Error | 0 | 0 | 276 | import math
n = int(raw_input())
ls = [int(raw_inpu() for i in range(n)]
r = max(ls)+1
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
ans = 0
for i in ls:
ans += p[i-1]
print ans |
s462656911 | p02257 | u633068244 | 1395994398 | Python | Python | py | Runtime Error | 0 | 0 | 277 | import math
n = int(raw_input())
ls = [int(raw_input() for i in range(n)]
r = max(ls)+1
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
ans = 0
for i in ls:
ans += p[i-1]
print ans |
s366451029 | p02258 | u637322311 | 1531646792 | Python | Python3 | py | Runtime Error | 0 | 0 | 390 | n=int(input())
def read_n_lows_input(n):
Alist=[int(input()) for i in range(n)]
return Alist
A = read_multi_low_input_with_num(n)
def max_profit(A, n):
for i in range(0, n):
for j in range(i+1, n):
if i == 0 and j == 1:
maxA = A[j] - A[i]
if A[j]-A[i] > maxA:
maxA = A[j]-A[i]
print(maxA)
max_profit(A, n)
|
s291280169 | p02258 | u637322311 | 1531647197 | Python | Python3 | py | Runtime Error | 0 | 0 | 388 | def read_n_lows_input(n):
Alist=[int(input()) for i in range(n)]
return Alist
def max_profit(A, n):
for j in range(1, n):
for i in range(0, j):
if i == 0 and j == 1:
maxA = A[j] - A[i]
if A[j]-A[i] > maxA:
maxA = A[j]-A[i]
print(maxA)
n=int(input())
A = read_multi_low_input_with_num(n)
max_profit(A, n)
|
s224483487 | p02258 | u637322311 | 1531664291 | Python | Python3 | py | Runtime Error | 0 | 0 | 401 | def read_n_lows_input(n):
Alist=[int(input()) for i in range(n)]
return Alist
def max_profit(A, n):
minv = A[0]
for j in range(1, n):
if j == 1:
maxv = A[j] - A[j-1]
if maxv < A[j] - minv:
maxv = A[j] - minv
if minv > A[j]:
minv = A[j]
print(maxv)
n=int(input())
A = read_multi_low_input_with_num(n)
max_profit(A, n)
|
s155714051 | p02258 | u518159956 | 1535695750 | Python | Python3 | py | Runtime Error | 0 | 0 | 147 | n=int(input())
a=[input for i in range(n)]
maxv=a[0]
minv=a[0]
for j in range(n):
maxv=max(maxv,a[j])
minv=min(minv,a[j])
print(maxv-minv)
|
s073997341 | p02258 | u518159956 | 1535695822 | Python | Python3 | py | Runtime Error | 0 | 0 | 149 | n=int(input())
a=[input() for i in range(n)]
maxv=a[0]
minv=a[0]
for j in range(n):
maxv=max(maxv,a[j])
minv=min(minv,a[j])
print(maxv-minv)
|
s720696318 | p02258 | u518159956 | 1535695917 | Python | Python3 | py | Runtime Error | 0 | 0 | 165 | n=int(input())
a=[]
for i in range(n):
a.append(input())
maxv=a[0]
minv=a[0]
for j in range(n):
maxv=max(maxv,a[j])
minv=min(minv,a[j])
print(maxv-minv)
|
s533059484 | p02258 | u313089641 | 1535888443 | Python | Python3 | py | Runtime Error | 0 | 0 | 280 | n = int(input())
ls = [int(input()) for _ in range(n)]
#pp = [max(ls[i:])-x for i, x in enumerate(ls, 1) if i != len(ls)]
p = min(ls) - max(ls)
for i, x in enumerate(ls, 1):
if i == len(pp):
break
if max(ls[i:]) - x > p:
p = max(ls[i:]) - x
print(p)
|
s395287341 | p02258 | u635209856 | 1540937266 | Python | Python3 | py | Runtime Error | 0 | 0 | 218 | import math
n=int(input())
t=int(input())
mint=t
t1=int(input())
if t1<t: mint=t1
maxtt=t1-t
for i in range(2,n):
t=int(input())
if t-mint>maxtt: maxtt=t-mint
if t<mint: mint=# TEMP:
print(int(maxtt))
|
s161553509 | p02258 | u071810536 | 1546330393 | Python | Python3 | py | Runtime Error | 20 | 5660 | 434 | import math
n = int(input())
r_t = [int(input().strip()) for i in range(n)]
r_i = r_t[0]
r_i_index = 0
diff = -math.inf
for _ in range(1, n):
r_j = max(r_t[r_i_index+1:])
tmp_diff = r_j - r_i
if tmp_diff > diff:
diff = tmp_diff
for i in range(r_i_index, n):
tmp_r_i = r_t[i]
if tmp_r_i < r_i:
r_i = tmp_r_i
r_i_index = r_t.index(r_i)
break
print(diff)
|
s427196392 | p02258 | u709690138 | 1551446179 | Python | Python3 | py | Runtime Error | 0 | 0 | 813 | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
func main() {
scanner := bufio.NewScanner(os.Stdin)
scanner.Scan()
n, _ := strconv.Atoi(scanner.Text()) //競プロでは基本的にエラーを握りつぶす方針で｡
scanner.Scan()
pivot, _ := strconv.Atoi(scanner.Text())
scanner.Scan()
first, _ := strconv.Atoi(scanner.Text())
result := first - pivot
for i := 2; i < n; i++ {
ok := scanner.Scan()
if !ok {
break
}
current, _ := strconv.Atoi(scanner.Text())
if current-pivot > result {
result = current - pivot
}
}
fmt.Println(result)
}
|
s625842820 | p02258 | u456917014 | 1555660902 | Python | Python3 | py | Runtime Error | 0 | 0 | 110 | n=int(input())
m=int(input())
for i in range(n-1):
x=int(input())
d=max-m,d)
m=min(m,x)
print(d)
|
s095332060 | p02258 | u456917014 | 1555660927 | Python | Python3 | py | Runtime Error | 0 | 0 | 112 | n=int(input())
m=int(input())
for i in range(n-1):
x=int(input())
d=max(x-m,d)
m=min(m,x)
print(d)
|
s105668336 | p02258 | u088264506 | 1556414469 | Python | Python3 | py | Runtime Error | 0 | 0 | 194 | n = int(input())
r = list((map(int, input()) for i in range(n)))
max_abs = 0
for i in range(len(r)):
for j in range(i, len(r)):
max_abs = max(max_abs, abs(r[j]-r[i]))
print(max_abs)
|
s900209754 | p02258 | u438607000 | 1556755188 | Python | Python3 | py | Runtime Error | 0 | 0 | 184 | n = int(input())
rl = [int(input()) for i in range(n)]
#print(max(rl[:3]))
for i in range(len(rl)):
rmax = max(rl[:i])
rmin = min(rl[:i-1])
ans = max(ans, rmax-rmin)
print(ans)
|
s799519903 | p02258 | u438607000 | 1556755240 | Python | Python3 | py | Runtime Error | 0 | 0 | 184 | n = int(input())
rl = [int(input()) for i in range(n)]
#print(max(rl[:3]))
for i in range(len(rl)):
rmax = max(rl[:i])
rmin = min(rl[:i-1])
ans = max(ans, rmax-rmin)
print(ans)
|
s798484337 | p02258 | u928633434 | 1558945967 | Python | Python3 | py | Runtime Error | 0 | 0 | 506 |
def calcMax(i):
now = numbers[i]
future_max = max(numbers[i+1:])
#print(numbers[i+1:])
t = numbers[i+1:]
#print((max(t)))
return future_max - now
n = int(input())
numbers = []
for i in range(n):
numbers.append(int(input()))
m = -1000000001
for i in range(len(numbers) - 1):
if i == 0 or i == len(numbers) - 1 or (numbers[i-1] >= numbers[i] and numbers[i] =< numbers[i+1]):
temp = calcMax(i)
#print("temp: " + str(temp))
if temp > m:
m = temp
print (m)
|
s052850229 | p02258 | u928633434 | 1558946227 | Python | Python3 | py | Runtime Error | 0 | 0 | 542 | def calcMax(i):
now = numbers[i]
future_max = max(numbers[i+1:])
#print(numbers[i+1:])
t = numbers[i+1:]
#print((max(t)))
return future_max - now
n = int(input())
numbers = []
for i in range(n):
numbers.append(int(input()))
m = -1000000001
ti = 1000000001
for i in range(len(numbers) - 1):
if (i == 0 or i == len(numbers) - 1 or (numbers[i-1] >= numbers[i] and numbers[i] =< numbers[i+1])) and ti > numbers[i]:
temp = calcMax(i)
#print("temp: " + str(temp))
if temp > m:
m = temp
print (m)
|
s623450017 | p02258 | u928633434 | 1558946336 | Python | Python3 | py | Runtime Error | 0 | 0 | 583 | def calcMax(i):
now = numbers[i]
future_max = max(numbers[i+1:])
#print(numbers[i+1:])
t = numbers[i+1:]
#print((max(t)))
return future_max - now
n = int(input())
numbers = []
for i in range(n):
numbers.append(int(input()))
m = -1000000001
ti = 1000000001
for i in range(len(numbers) - 1):
if numbers[i] < ti:
if (i == 0 or i == len(numbers) - 1 or (numbers[i-1] >= numbers[i] and numbers[i] =< numbers[i+1])):
temp = calcMax(i)
#print("temp: " + str(temp))
if temp > m:
m = temp
ti = numbers[i]
print (m)
|
s546221478 | p02258 | u482227082 | 1559006556 | Python | Python3 | py | Runtime Error | 0 | 0 | 323 | def main():
n = int(input())
r = []
ans = 0
for i in range(n):
r.append(int(input()))
ans = min(r) - max(r)
for i in reversed(range(1, n)):
tmpr = r[:i]
tmp = r[i] - min(tmpr)
if tmp > ans:
ans = tmp
print(ans)
if __name__ == '__main__':
main(
|
s190291948 | p02258 | u135880652 | 1559352911 | Python | Python3 | py | Runtime Error | 0 | 0 | 305 | n = int(input())
t = []
for i in range(n):
t.append(int(input()))
buy = t[0]
prev_sell = max(t[1:])
val = sell - buy
for i in range(n-1):
if i == 0 or t[i - 1] < t[i]:
continue
prev_sell = max(t[i+1:])
val2 = prev_sell - t[i]
if val2 > val:
val = val2
print(val)
|
s512641326 | p02258 | u135880652 | 1559352967 | Python | Python3 | py | Runtime Error | 0 | 0 | 305 | n = int(input())
t = []
for i in range(n):
t.append(int(input()))
buy = t[0]
prev_sell = max(t[1:])
val = sell - buy
for i in range(n-1):
if i == 0 or t[i - 1] < t[i]:
continue
prev_sell = max(t[i+1:])
val2 = prev_sell - t[i]
if val2 > val:
val = val2
print(val)
|
s525065580 | p02258 | u535719732 | 1559403197 | Python | Python3 | py | Runtime Error | 0 | 0 | 103 | a,b = -1e11,1e11
for _ in int(input()):
data = int(input())
a,b = max(a,c-b),min(b,c)
print(a)
|
s188239251 | p02258 | u535719732 | 1559403210 | Python | Python3 | py | Runtime Error | 0 | 0 | 110 | a,b = -1e11,1e11
for _ in range(int(input())):
data = int(input())
a,b = max(a,c-b),min(b,c)
print(a)
|
s303428370 | p02258 | u319740114 | 1559466848 | Python | Python3 | py | Runtime Error | 20 | 5600 | 202 | n = int(input())
R = [0]*100
for i in range(n):
R[i] = int(input())
minv = R[0]
maxv = R[1] - R[0]
for i in range(1,n):
maxv = max(maxv, R[i] - minv)
minv = min(minv, R[i])
print(maxv)
|
s695231036 | p02258 | u481221703 | 1419600168 | Python | Python | py | Runtime Error | 20 | 4208 | 208 | n = int(raw_input())
rt = [int(raw_input()) for x in xrange(n)]
i_max = rt.index(max(rt))
i_min = rt.index(min(rt))
a = rt[i_max] - min(rt[1:i_max])
b = max(rt[i_min:]) - rt[i_min]
print a if a > b else b |
s132420813 | p02258 | u241133982 | 1423371333 | Python | Python | py | Runtime Error | 0 | 0 | 186 | n = input()
minSeq = input()
maxv = -float("inf")
for i in range(n):
R = input()
if R - minSeq > maxv:
maxv = R - minSeq
if R < minSeq:
minSeq = R
print(maxv) |
s935389131 | p02258 | u879226672 | 1424420675 | Python | Python | py | Runtime Error | 0 | 0 | 356 | while True:
try:
n = int(raw_input())
except EOFError:
break
ls = []
for i in range(n):
ls.append(int(raw_input()))
maxvalue = -999999999999999999999999999999
for k in range(len(ls)):
temp = ls[k] - min(ls[:k])
if temp > maxvalue:
maxvalue = temp
print maxvalue |
s879109554 | p02258 | u633068244 | 1433099446 | Python | Python | py | Runtime Error | 0 | 0 | 174 | cat ALDS1_1_d.py
n = int(raw_input())
R = [int(raw_input()) for i in xrange(n)]
mn = R[0]
ans = -1e10
for r in R[1:]:
ans = max(ans, r - mn)
mn = min(mn, r)
print ans |
s345586443 | p02258 | u729824721 | 1442206270 | Python | Python | py | Runtime Error | 0 | 0 | 280 | import sys
x = []
for line in sys.stdin.readline():
x.append(int(line))
length = int(x[0])
del x[0]
max = -(10 ** 9)
for i in range(0, length - 1):
for j in range(i + 1, length):
sa = int(x[j]) - int(x[i])
if max < sa:
max = sa
print max |
s933025267 | p02258 | u894381890 | 1442206283 | Python | Python | py | Runtime Error | 0 | 0 | 254 | import sys
x = []
max = -10**9
for line in sys.stdin.readline()
x.append(line)
length = int(x[0])
x.remove(x[0])
for i in range(0, length):
for j in range(i + 1, length):
sa = int(x[j]) - int(x[i])
if max < sa:
max = sa
print max |
s258071946 | p02258 | u729824721 | 1442206343 | Python | Python | py | Runtime Error | 0 | 0 | 271 | import sys
x = []
for line in raw_input():
x.append(int(line))
length = int(x[0])
del x[0]
max = -(10 ** 9)
for i in range(0, length - 1):
for j in range(i + 1, length):
sa = int(x[j]) - int(x[i])
if max < sa:
max = sa
print max |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.