青少年趣味编程

http://noi.openjudge.cn/english/26/ """ 简单英文题 26 The Nearest Number http://noi.openjudge.cn/english/26/ """ a,n=map(int,input().split()) x=list(map(int,input().split())) for i in range(a): if i==0: minabs=abs(x[

http://noi.openjudge.cn/english/25/ """ 简单英文题 25 Sequence Search http://noi.openjudge.cn/english/25/ """ a,n=map(int,input().split()) x=list(map(int,input().split())) for i in range(a): if x[i]==n: print(i+1)

http://noi.openjudge.cn/english/24/ """ 简单英文题 24 Divisor and Multiple http://noi.openjudge.cn/english/24/ """ import sys a,b=map(int,input().split()) i=1 while i<=b: j=1 while j<=b: if i%a==0 and j%

http://noi.openjudge.cn/english/16/ """ 简单英文题 16 Maximum Sum Not Exceeding K(AC) http://noi.openjudge.cn/english/16/ """ maxa1=-1 maxa2=-1 n,k=map(int,input().split()) a = list(map(int,input().split())) i=0 while i<n: j=i w

http://noi.openjudge.cn/english/37/ """ 简单英文题 37 Prime http://noi.openjudge.cn/english/37/ """ import sys n=int(input()) for i in range(2,n): if n%i==0: print("0") sys.exit(0) print("1")

http://noi.openjudge.cn/english/15/ """ 简单英文题 15 Sum is K http://noi.openjudge.cn/english/15/ """ import sys n,k=map(int,input().split()) a = list(map(int,input().split())) for i in range(n): for j in range(i,n):