input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
num = int(eval(input()))
p = list(map(int, input().split()))
pList = list(p)
aList = []
ret = "YES"
for i in range(num):
if pList[i] in aList:
ret = "NO"
break
aList.append(pList[i])
print(("{}".format(ret))) | # C - Distinct or Not
# https://atcoder.jp/contests/abc154/tasks/abc154_c
num = int(eval(input()))
p = list(map(int, input().split()))
list.sort(p)
ret = "YES"
for i in range(num-1):
if p[i] == p[i+1]:
ret = "NO"
break
print(("{}".format(ret))) | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
be_len = len(A)
A = list(set(A))
if len(A) == be_len:
print("YES")
else:
print("NO")
| N = int(input())
A = list(map(int, input().split()))
print("YES") if len(A) == len(list(set(A))) else print("NO")
| p02779 |
n = int(eval(input()))
lis = [x for x in input().split()]
lis.sort()
for i in range(1, n):
if lis[i-1] == lis[i]:
print("NO")
exit()
print("YES") | n = int(eval(input()))
lis = input().split()
dic = {}
for i in range(n):
if lis[i] not in dic:
dic[lis[i]] = 1
else:
dic[lis[i]] += 1
for x in list(dic.values()):
if x != 1:
print("NO")
exit()
print("YES") | p02779 |
n = int(eval(input()))
List = list(map(int, input().split()))
flag = True
for i in range(n):
if flag:
obj = List[i]
for j in range(i+1, n - i):
if obj == List[j]:
flag = False
if flag:
print('YES')
else:
print('NO') | n = int(eval(input()))
List = list(map(int, input().split()))
def ha(st):
return len(st) != len(set(st))
if ha(List):
print('NO')
else:
print('YES') | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
for i in range(N-1):
for j in range(N-i-1):
if A[i] == A[i+j+1]:
print("NO")
exit()
print("YES") | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
for i in range(N-1):
if A[i] == A[i+1]:
print("NO")
exit()
print("YES") | p02779 |
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return list(map(int,sys.stdin.readline().replace("\n","").split()))
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list([int(x)*-1 for x in sys.stdin.readline().replace("\n","").split()])
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))
if __name__ == "__main__":pass
n = i()
a = intl()
a = list(set(a))
if len(a) == n:
print("YES")
else:
print("NO") | n = int(eval(input()))
print(("YES" if len(set(input().split())) == n else "NO")) | p02779 |
#入力（後でいじる）
def pin(type=int):
return list(map(type,input().split()))
#どっかで最悪計算量の入力データを用意する関数を作ろう？
def worstdata():
a=0
return a
#solution:
def comp(x,y):
dp=[0,max(act[0])]*(N+1) #[i]日目のActivity で得られる最大幸福量
return 0
#input
n,=(pin())
S=list(pin())
c=[]
cond=0
for i in range(len(S)):
if S[i] in c:
cond=1
break
c.append(S[i])
#print(solution(H,N))
print((["NO","YES"][1-cond]))
| #入力（後でいじる）
def pin(type=int):
return list(map(type,input().split()))
#どっかで最悪計算量の入力データを用意する関数を作ろう？
def worstdata():
a=0
return a
#solution:
def comp(p):#期待値
return ((p+1)/2)
#input
n,=(pin())
S=sorted(list(pin()))
cond=1
for i in range(1,n):
if S[i]-S[i-1]==0:
cond=0
break
print((["NO","YES"][cond])) | p02779 |
n = int(eval(input()))
l = list(map(int, input().split()))
p = "YES"
for i in range(n):
if 1 < l.count(l[i]):
p = "NO"
break
print(p) | n = int(eval(input()))
l = list(map(int, input().split()))
if len(l) != len(set(l)):
print("NO")
else:
print("YES")
| p02779 |
n = int(eval(input()))
num = input().split()
def check():
for s in num:
if(num.count(s) >= 2):
print("NO")
return
print("YES")
check() | n = int(eval(input()))
num = input().split()
if len(set(num)) == n:
print("YES")
else:
print("NO")
| p02779 |
N = int(eval(input()))
A = list(input().split())
while A!=[]:
a = A.pop()
if a in A:
print('NO')
exit()
print('YES') | N = int(eval(input()))
A = list(input().split())
A.sort()
for i in range(N-1):
if A[i]==A[i+1]:
print('NO')
exit()
print('YES')
| p02779 |
import collections
s = int(eval(input()))
a = list(map(str, input().split()))
n = {}
for i in a:
n.setdefault(i, 0)
for i in a:
n[i] += 1
x = 0
for i in list(n.values()):
if x <= i:
x = i
if x == 1:
print("YES")
else:
print("NO") | s = int(eval(input()))
a = list(map(str, input().split()))
n = {}
for i in a:
n.setdefault(i, 0)
for i in a:
n[i] += 1
x = 0
for i in list(n.values()):
if x <= i:
x = i
if x == 1:
print("YES")
else:
print("NO") | p02779 |
s = int(eval(input()))
a = list(map(str, input().split()))
n = {}
for i in a:
n.setdefault(i, 0)
for i in a:
n[i] += 1
x = 0
for i in list(n.values()):
if x <= i:
x = i
if x == 1:
print("YES")
else:
print("NO") | n = eval(input())
a = list(map(int,input().split()))
if len(set(a)) == len(a):
print("YES")
elif len(set(a)) != len(a):
print("NO") | p02779 |
n = eval(input())
a = list(map(int,input().split()))
if len(set(a)) == len(a):
print("YES")
elif len(set(a)) != len(a):
print("NO") | n = eval(input())
a = list(map(int,input().split()))
if len(a)== len(set(a)):
print("YES")
else:
print("NO") | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
_A = set(A)
if len(A) == len(_A):
print('YES')
else:
print('NO')
| N = eval(input())
A = input().split()
_A = set(A)
if len(A) == len(_A):
print('YES')
else:
print('NO')
| p02779 |
import sys
n = int(eval(input()))
s = list(map(int, input().split()))
tmp = []
for i in s:
if i in tmp:
print('NO')
sys.exit()
tmp.append(i)
print('YES') | import sys
n = int(eval(input()))
s = list(map(int, input().split()))
s.sort()
k = 0
for i in s:
if i == k:
print('NO')
sys.exit()
k = i
print('YES') | p02779 |
N = int(eval(input()))
numList = list(map(int, input().split()))
numList.sort()
ans = "YES"
for z in range(N-1):
if numList[z] == numList[z+1]:
ans = "NO"
break
print(ans) | n = int(eval(input()))
a_list = [i for i in input().split()]
a_set = set(a_list)
if len(a_set) == n:
print('YES')
else:
print('NO')
| p02779 |
N = int(eval(input()))
seq = list(map(int,input().split()))
ans = "YES"
for i in range(N):
for j in range(i+1, N):
if seq[i] == seq[j]:
ans = "NO"
break
if ans == "NO":
break
print(ans) | N = int(eval(input()))
seq = list(map(int,input().split()))
ans = "YES"
seq.sort()
for i in range(N-1):
if seq[i] == seq[i+1]:
ans = "NO"
break
print(ans) | p02779 |
N = int(eval(input()))
A_list = list(map(int,input().split()))
sw = 0
for i in range(len(A_list)):
for j in range(i+1, len(A_list)):
if A_list[i] == A_list[j]:
sw = 1
break
if sw == 1:
print('NO')
else:
print('YES') | N = int(eval(input()))
A_list = list(map(int,input().split()))
A_list.sort()
sw = 0
for i in range(len(A_list)-1):
if A_list[i] == A_list[i+1]:
sw = 1
break
if sw == 0:
print('YES')
else:
print('NO')
| p02779 |
a=int(eval(input()))
li = list(map(int,input().split()))
c = 0
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
for i in range(a-1):
if len(list(set(li))) != len(li):
c = 1
break
for j in range(i+1,a):
x = make_divisors(li[j]*li[i])
if len(x) != len(set(x)):
c = 1
break
if c == 1:
break
if c > 0:
print('NO')
else:
print('YES') | a=int(eval(input()))
li = list(map(int,input().split()))
c = 0
if len(li) != len(set(li)):
print('NO')
else:
print('YES') | p02779 |
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in range(n):
for j in range(n):
if a[i] == a[j]:
cnt += 1
if cnt == n:
print("YES")
elif cnt > n:
print("NO") | n = int(eval(input()))
a = list(map(int, input().split()))
if len(set(a)) == len(a):
print("YES")
else:
print("NO") | p02779 |
N=int(eval(input()))
A=list(map(int,input().split()))
ans=[]
for i in range(len(A)):
if A[i] in ans:
print("NO")
break
else:
ans.append(A[i])
else:
print("YES") | N=int(eval(input()))
A=list(map(int,input().split()))
if len(set(A))==len(A):
print('YES')
else:
print('NO') | p02779 |
S = int(eval(input()))
A = list(map(int,input().split()))
def main():
flag = 0
for i in range(len(A)-1):
for j in range(i+1, len(A)):
if A[i] == A[j]:
flag = 1
break
else:
continue
if flag == 1:
break
else:
continue
if flag == 0:
print('YES')
else:
print('NO')
if __name__ == "__main__":
main()
| S = int(eval(input()))
A = list(map(int,input().split()))
def main():
flag = 0
new_A = sorted(A)
for i in range(S-1):
if new_A[i] == new_A[i+1]:
flag = 1
break
else:
continue
if flag == 0:
print('YES')
else:
print('NO')
if __name__ == "__main__":
main()
| p02779 |
a = int(eval(input()))
li = list(map(int,input().split()))
n_li = sorted(li)
dup = [x for x in set(li) if li.count(x) > 1]
if not dup:
print('YES')
else:
print('NO') | N = int(eval(input()))
A = list(map(int,input().split(' ')))
is_break = False
seen = set()
for a in A:
if a not in seen:
seen.add(a)
else:
is_break=True
break
if is_break:
print('NO')
else:
print('YES') | p02779 |
N= int(eval(input()))
A=list(input().split())
flag=1
for i in range(N-1):
if A.count(A[i])>1:
flag=0
if flag==1:
print('YES')
else:
print('NO')
| N= int(eval(input()))
A=sorted(list(input().split()))
flag=1
for i in range(N-1):
if A[i]==A[i+1]:
flag=0
break
if flag==1:
print('YES')
else:
print('NO')
| p02779 |
def buble_sort(list,ans):
i=len(list)
while(i>1):
for j in range(i-1):
if(list[j]<list[j+1]):
list[j],list[j+1]=list[j+1],list[j]
elif(list[j]==list[j+1]):
ans="NO"
return ans
else:
pass
i-=1
return ans
N=int(eval(input()))
A=list(map(int,input().split()))
ans="YES"
ans=buble_sort(A,ans)
print(ans) | def quick_sort(list):
stand=list[0]
over=[]
same=[]
under=[]
for i in list:
if(i>stand):
over.append(i)
elif(i<stand):
under.append(i)
else:
same.append(i)
if(len(over)>1):
over=quick_sort(over)
else:
pass
if(len(under)>1):
under=quick_sort(under)
else:
pass
return over+same+under
N=int(eval(input()))
A=list(map(int,input().split()))
A=quick_sort(A)
ans="YES"
if(len(A)>1):
for i in range(len(A)):
if(A[i-1]==A[i]):
ans="NO"
break
else:
pass
else:
pass
print(ans) | p02779 |
N = int(eval(input()))
An = list(map(int, input().split()))
duplicate_list = [x for x in set(An) if An.count(x) > 1]
if duplicate_list:
print('NO')
else:
print('YES') | N = int(eval(input()))
An = list(map(int, input().split()))
Bn = sorted(An)
y = -1
count = 0
for x in Bn:
if x == y:
count += 1
y = x
if count == 0:
print("YES")
else:
print("NO") | p02779 |
def main():
num = int(eval(input()))
list_num = list(map(int, input().split()))
flag = False
for i,v in enumerate(list_num):
if v in list_num[i+1:]:
flag = True
break
if flag:
print("NO")
else:
print("YES")
if __name__ == "__main__":
main()
| import os
def main():
num = int(eval(input()))
list_num = set(map(int, input().split()))
if len(list_num) != num:
print("NO")
else:
print("YES")
if __name__ == "__main__":
main()
| p02779 |
n=int(eval(input()))
a=list(map(int,input().split()))
for _ in range(2,n+1):
if a[_-1] in a[:_-1]:
print('NO')
exit()
print('YES') | n=int(eval(input()))
a=list(map(int,input().split()))
if len(a)==len(set(a)):
print('YES')
else:
print('NO') | p02779 |
n = int(eval(input()))
a = list(map(int,input().split()))
for idx, i in enumerate(a):
if i in a[idx+1:]:
print('NO')
break
if idx == n - 1:
print('YES') | n = int(eval(input()))
a = list(map(int,input().split()))
a = sorted(a)
flag = True
for idx, i in enumerate(a[:-1]):
if i == a[idx+1]:
print('NO')
flag= False
break
if flag:
print('YES') | p02779 |
set = int(eval(input()))
lis = list(map(int, input().split()))
v = 0
for i in range(set):
for k in range(1 + i, set):
#print()
if lis[i] == lis[k]:
v = 1
if v == 0:
print("YES")
else:
print("NO") | set = int(eval(input()))
lis = list(map(int, input().split()))
v = 0
lis.sort()
for i in range(set-1):
if lis[i] == lis[i + 1]:
v =1
if v == 0:
print("YES")
else:
print("NO") | p02779 |
count = int(eval(input()))
number_li = input().split(' ')
check_2 = 0
for i in range(count):
check = number_li[i]
for n in range(count):
if i == n:
continue
if check == number_li[n]:
check_2 = 1
break
if check_2 == 1:
break
if check_2 == 1:
print('NO')
else:
print('YES') | count = int(eval(input()))
number_li = input().split(' ')
number_set = set(number_li)
list_len = len(number_li)
set_len = len(number_set)
if list_len == set_len:
print('YES')
else:
print('NO') | p02779 |
n=int(eval(input()))
a=list(map(int,input().split()))
ans=True
for i in range(n):
for k in range(i+1,n):
if a[i]==a[k]:
ans=False
print(("YES" if ans else "NO")) | n=int(eval(input()))
a=list(map(int,input().split()))
setA=set(a)
print(("YES" if len(setA)==n else "NO")) | p02779 |
a = int(eval(input()))
s = input().split()
d = len(s)
for i in range(d-1):
for f in range(i+1, d):
if s[i] == s[f]:
print("NO")
break
else:
continue
break
else:
print("YES") | a = int(eval(input()))
s = input().split()
e = set(s)
if len(s) == len(e):
print("YES")
else:
print("NO") | p02779 |
n = int(eval(input()))
A = list(map(int, input().split()))
already = []
ans = 'YES'
for a in A:
if a in already:
ans = 'NO'
break
else:
already.append(a)
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
if len(a) == len(set(a)):
print('YES')
else:
print('NO') | p02779 |
N = int(eval(input()))
A = [int(i) for i in input().split(" ")]
flag = True
for i in A:
if A.count(i) != 1:
flag = False
break
if flag:
print("YES")
else:
print("NO") | N = int(eval(input()))
A = [int(i) for i in input().split(" ")]
flag = True
A.sort()
for i in range(1,len(A)):
if A[i-1] == A[i]:
flag =False
break
if flag:
print("YES")
else:
print("NO") | p02779 |
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
tmp = []
is_unique = True
for i in range(n):
for j in tmp:
if j == a[i]:
is_unique = False
break
if not is_unique:
break
tmp.append(a[i])
if is_unique:
print("YES")
else:
print("NO")
if __name__=="__main__":
main()
| def main():
n = int(eval(input()))
a = list(map(int, input().split()))
tmp = {}
is_unique = True
for i in range(n):
if a[i] in tmp:
is_unique = False
break
tmp[a[i]] = a[i]
if is_unique:
print("YES")
else:
print("NO")
if __name__=="__main__":
main()
| p02779 |
n = eval(input())
a = input().split()
b = [int(i) for i in a]
for i in range(0,int(n)):
if(b[i] in b[i+1:]):
print("NO")
exit()
print("YES")
| n = eval(input())
a = input().split()
b = [int(i) for i in a]
b.sort()
for i in range(0,int(n)-1):
if(b[i] == b[i+1]):
print("NO")
exit()
print("YES") | p02779 |
from collections import Counter
N=int(eval(input()))
A=list(map(int, input().split()))
B=Counter(A)
if N==len(B):
print('YES')
else:
print('NO') | from collections import Counter
N=int(eval(input()))
A=list(map(int, input().split()))
B=Counter(A)
if len(A)==len(B):
print('YES')
else:
print('NO') | p02779 |
count=0
mainasu=0
num=int(eval(input()))
An=[int(i) for i in input().split()]
for i in An[0:num]:
mainasu+=1
for w in An[mainasu:]:
if w==i:
count+=1
if count>=1:
break
if 0==count:
print("YES")
else :
print("NO") | def duplication(lis):
return len(lis) == len(set(lis))
num=int(eval(input()))
An=[int(i) for i in input().split()]
if duplication(An) == True:
print("YES")
else :
print("NO") | p02779 |
# coding: utf-8
import collections
n=int(eval(input()))
a_list=list(map(int,input().split()))
if len(collections.Counter(a_list))==len(a_list):
print("YES")
else:
print("NO") | # coding: utf-8
n=int(eval(input()))
a_list=list(map(int,input().split()))
if len(a_list)==len(set(a_list)):
print("YES")
else:
print("NO") | p02779 |
import sys
n=int(eval(input()))
a=input().split()
for i in range(n-1):
for j in range(i+1,n):
if a[i]==a[j]:
print("NO")
sys.exit()
print("YES") | import sys
n=int(eval(input()))
a=sorted([int(x) for x in input().split()])
for i in range(n-1):
if a[i]==a[i+1]:
print("NO")
sys.exit()
print("YES") | p02779 |
n = int(eval(input()))
a = list(map(int, input().split()))
lst = []
for x in a:
if x in lst:
print('NO')
break
lst.append(x)
else:
print('YES')
| n = int(eval(input()))
a = list(map(int, input().split()))
lst = []
if len(set(a)) != len(a):
print('NO')
else:
print('YES')
| p02779 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
a = [int(i) for i in input().split()]
"""
if len(set(a)) == len(a):
print("YES")
else:
print("NO")
"""
flag = True
a.sort()
for i in range(n - 1):
if a[i] == a[i + 1]:
flag = False
if flag:
print("YES")
else:
print("NO")
| # -*- coding: utf-8 -*-
n = int(eval(input()))
a = [int(i) for i in input().split()]
if len(set(a)) == n:
print("YES")
else:
print("NO")
| p02779 |
class Node:
def __init__(self):
self.label = None
self.left = None
self.right = None
def searchORinsert(self,num):
#もしなければ、新しいノードを作る
if self.label==None:
self.label=num
return 1
elif self.label>num:
if self.left!=None:
return((self.left).searchORinsert(num))
else :
self.left=Node()
return((self.left).searchORinsert(num))
elif self.label<num:
if self.right!=None:
return((self.right).searchORinsert(num))
else :
self.right=Node()
return((self.right).searchORinsert(num))
#あったら、警告する
else :
return 0
N =int(eval(input()))
l=list(map(int, input().split()))
No=Node()
f=1
for i in l:
if No.searchORinsert(i)!=1:
f=0
break
if f!=0:
print("YES")
else:
print("NO") |
N =int(eval(input()))
l=list(map(int, input().split()))
l.sort()
f=1
for i in range(0,N-1):
if l[i]==l[i+1]:
f=0
break
if f!=0:
print("YES")
else:
print("NO") | p02779 |
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(n -1):
for j in range(i + 1, n):
if a[i] == a[j]:
print("NO")
exit()
print("YES") | n = int(eval(input()))
a = list(map(int, input().split()))
if len(a) == len(set(a)):
print("YES")
else:
print("NO") | p02779 |
n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
for i in a:
if i in d:
print("NO")
exit()
d[i] = i
print("YES") | n = int(eval(input()))
a = list(map(int, input().split()))
print(('YES' if len(a) == len(set(a)) else 'NO')) | p02779 |
N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
for i in range(N):
for j in range(i+1, N):
if A[i] == A[j]:
count = count + 1
print("NO")
break
if count == 0:
print("YES")
| N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
count = 0
for i in range(1, N):
if A[i-1] == A[i]:
count += 1
break
if count == 0:
print("YES")
else:
print("NO")
| p02779 |
n = int(eval(input()))
A = list(map(int,input().split()))
s = 0
for i in range(n-1):
if A.count(A[i]) > 1:
print('NO')
s = 1
break
if s == 0:
print('YES') | n = int(eval(input()))
a = list(map(int,input().split()))
b = set(a)
if len(a) == len(b):
print('YES')
else:
print('NO') | p02779 |
from statistics import mean
while True:
n=int(eval(input()))
c=0
if n==0:
break
ns=list(map(int, input().split()))
for i in range(n):
if ns[i]<=mean(ns):
c+=1
print(c)
| while True:
n=int(eval(input()))
c=0
if n==0:
break
ns=list(map(int, input().split()))
for i in range(n):
if ns[i]<=sum(ns)/n:
c+=1
print(c)
| p01109 |
for i in range(eval(input())):
n=eval(input())
a=list(map(int,input().split()))
l=[a[i+1]-a[i] for i in range(n-1)]
print(max(0,max(l)),abs(min(0,min(l)))) | for j in [1]*eval(input()):
n=eval(input())
a=list(map(int,input().split()))
l=[a[i+1]-a[i] for i in range(n-1)]
print(max(0,max(l)),-min(-0,min(l))) | p01223 |
import math
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
for i in range(q):
k=int(eval(input()))
t=0
max=n-1
min=0
while max-min>1:
nn=math.floor((max-min)/2)
if a[nn]==k:
t=1
print("1")
break
elif a[nn]>k:
min=nn
else :
max=nn
if t==0:
print("0")
| import math
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
for i in range(q):
k=int(eval(input()))
t=0
max=n-1
min=0
while max-min>1:
nn=math.floor((max+min)/2)
if a[nn]==k:
t=1
print("1")
break
elif a[nn]<=k:
min=nn
elif a[nn]>=k:
max=nn
if t==0:
if a[max]==k or a[min]==k:
t=1
print("1")
else:
print("0")
| p02451 |
import copy
def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def is_stable():
for i in range(N-1):
if A[i][1] == A[i+1][1]:
small_idx, large_idx = 0, 0
for j in range(N):
if A[i] == orig_list[j]:
small_idx = j
elif A[i+1] == orig_list[j]:
large_idx = j
if small_idx > large_idx:
return False
return True
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
orig_list = copy.deepcopy(A)
quick_sort(0, N-1)
is_stable = is_stable()
if is_stable:
print("Stable")
else:
print("Not stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| import copy
def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def correct_same_num_suits(l, num):
suits = []
for card in l:
if num == card[1]:
suits.append(card[0])
return suits
def is_stable():
idx = 0
while idx < N-1:
idx_incr_flg = True
if A[idx][1] == A[idx+1][1]:
num = A[idx][1]
sorted_suits = correct_same_num_suits(A, num)
orig_suits = correct_same_num_suits(orig_list, num)
if sorted_suits != orig_suits:
return False
idx += len(sorted_suits)
idx_incr_flg = False
if idx_incr_flg:
idx += 1
return True
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
orig_list = copy.deepcopy(A)
quick_sort(0, N-1)
is_stable = is_stable()
if is_stable:
print("Stable")
else:
print("Not stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| p02277 |
import copy
def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def correct_same_num_suits(l, num):
suits = []
for card in l:
if num == card[1]:
suits.append(card[0])
return suits
def is_stable():
idx = 0
while idx < N-1:
idx_incr_flg = True
if A[idx][1] == A[idx+1][1]:
num = A[idx][1]
sorted_suits = correct_same_num_suits(A, num)
orig_suits = correct_same_num_suits(orig_list, num)
if sorted_suits != orig_suits:
return False
idx += len(sorted_suits)
idx_incr_flg = False
if idx_incr_flg:
idx += 1
return True
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
orig_list = copy.deepcopy(A)
quick_sort(0, N-1)
is_stable = is_stable()
if is_stable:
print("Stable")
else:
print("Not stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| import copy
def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def is_stable():
for i in range(N-1):
if A[i][1] == A[i+1][1]:
small_idx, large_idx = 0, 0
cnt = 0
for j in range(N):
if A[i] == orig_list[j]:
small_idx = j
cnt += 1
elif A[i+1] == orig_list[j]:
large_idx = j
cnt += 1
if cnt == 2:
break
if small_idx > large_idx:
return False
return True
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
orig_list = copy.deepcopy(A)
quick_sort(0, N-1)
is_stable = is_stable()
if is_stable:
print("Stable")
else:
print("Not stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| p02277 |
import copy
def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def correct_same_num_suits(l, num, first, ele_cnt):
suits = []
for i in range(first, N):
if num == l[i][1]:
suits.append(l[i][0])
if ele_cnt == len(suits):
break
return suits
def is_stable():
idx = 0
while idx < N-1:
idx_incr_flg = True
if A[idx][1] == A[idx+1][1]:
num = A[idx][1]
j = idx
ele_cnt = 0
while j < N and num == A[j][1]:
ele_cnt += 1
j += 1
sorted_suits = correct_same_num_suits(A, num, idx, ele_cnt)
orig_suits = correct_same_num_suits(orig_list, num, 0, ele_cnt)
if sorted_suits != orig_suits:
return False
idx += len(sorted_suits)
idx_incr_flg = False
if idx_incr_flg:
idx += 1
return True
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
orig_list = copy.deepcopy(A)
quick_sort(0, N-1)
is_stable = is_stable()
if is_stable:
print("Stable")
else:
print("Not stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| import copy
def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def correct_same_num_suits(l, num, first, ele_cnt):
suits = []
append_cnt = 0
for i in range(first, N):
if num == l[i][1]:
suits.append(l[i][0])
append_cnt += 1
if ele_cnt == append_cnt:
break
return suits
def is_stable():
idx = 0
while idx < N-1:
idx_incr_flg = True
if A[idx][1] == A[idx+1][1]:
num = A[idx][1]
j = idx
ele_cnt = 0
while j < N and num == A[j][1]:
ele_cnt += 1
j += 1
sorted_suits = correct_same_num_suits(A, num, idx, ele_cnt)
orig_suits = correct_same_num_suits(orig_list, num, 0, ele_cnt)
if sorted_suits != orig_suits:
return False
idx += len(sorted_suits)
idx_incr_flg = False
if idx_incr_flg:
idx += 1
return True
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
orig_list = copy.deepcopy(A)
quick_sort(0, N-1)
is_stable = is_stable()
if is_stable:
print("Stable")
else:
print("Not stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| p02277 |
import copy
def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def correct_same_num_suits(l, num, first):
suits = []
for i in range(first, N):
if num == l[i][1]:
suits.append(l[i][0])
return suits
def is_stable():
idx = 0
while idx < N-1:
idx_incr_flg = True
if A[idx][1] == A[idx+1][1]:
num = A[idx][1]
sorted_suits = correct_same_num_suits(A, num, idx)
orig_suits = correct_same_num_suits(orig_list, num, 0)
if sorted_suits != orig_suits:
return False
idx += len(sorted_suits)
idx_incr_flg = False
if idx_incr_flg:
idx += 1
return True
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
orig_list = copy.deepcopy(A)
quick_sort(0, N-1)
is_stable = is_stable()
if is_stable:
print("Stable")
else:
print("Not stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| import copy
def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def is_stable():
for i in range(N-1):
if A[i][1] == A[i+1][1]:
small_idx, large_idx = 0, 0
for j in range(N):
if A[i] == orig_list[j]:
small_idx = j
elif A[i+1] == orig_list[j]:
large_idx = j
if small_idx > large_idx:
return False
return True
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
orig_list = copy.copy(A)
quick_sort(0, N-1)
is_stable = is_stable()
if is_stable:
print("Stable")
else:
print("Not stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| p02277 |
import copy
def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def is_stable():
for i in range(N-1):
if A[i][1] == A[i+1][1]:
small_idx, large_idx = 0, 0
cnt = 0
for j in range(N):
if A[i] == orig_list[j]:
small_idx = j
cnt += 1
elif A[i+1] == orig_list[j]:
large_idx = j
cnt += 1
if cnt == 2:
break
if small_idx > large_idx:
return False
return True
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
orig_list = copy.copy(A)
quick_sort(0, N-1)
is_stable = is_stable()
if is_stable:
print("Stable")
else:
print("Not stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def is_stable():
for i in range(N-1):
if A[i][1] == A[i+1][1]:
small_idx, large_idx = 0, 0
cnt = 0
for j in range(N):
if A[i] == orig_list[j]:
small_idx = j
cnt += 1
elif A[i+1] == orig_list[j]:
large_idx = j
cnt += 1
if cnt == 2:
break
if small_idx > large_idx:
return False
return True
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
orig_list = A[:]
quick_sort(0, N-1)
is_stable = is_stable()
if is_stable:
print("Stable")
else:
print("Not stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| p02277 |
def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def merge(left, mid, right):
L = merge_list[left:mid]
R = merge_list[mid:right]
L.append(["", INFTY])
R.append(["", INFTY])
i, j = 0, 0
for k in range(left, right):
if L[i][1] <= R[j][1]:
merge_list[k] = L[i]
i += 1
else:
merge_list[k] = R[j]
j += 1
def merge_sort(left, right):
if left+1 < right:
mid = int( (left+right)/2 )
merge_sort(left, mid)
merge_sort(mid, right)
merge(left, mid, right)
INFTY = 1000000001
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
merge_list = A[:]
quick_sort(0, N-1)
merge_sort(0, N)
if A == merge_list:
print("Stable")
else:
print("Not stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| def partition(p, r):
i = p
for j in range(p, r):
if A[r][1] >= A[j][1]:
A[i], A[j] = A[j], A[i]
i += 1
A[r], A[i] = A[i], A[r]
return i
def quick_sort(p, r):
if p < r:
q = partition(p, r)
quick_sort(p, q-1)
quick_sort(q+1, r)
def merge(left, mid, right):
L = merge_list[left:mid]
R = merge_list[mid:right]
L.append(["", INFTY])
R.append(["", INFTY])
i, j = 0, 0
for k in range(left, right):
if L[i][1] <= R[j][1]:
merge_list[k] = L[i]
i += 1
else:
merge_list[k] = R[j]
j += 1
def merge_sort(left, right):
if left+1 < right:
mid = int( (left+right)/2 )
merge_sort(left, mid)
merge_sort(mid, right)
merge(left, mid, right)
INFTY = 1000000001
N = int(eval(input()))
A = []
for _ in range(N):
suit, num = input().split()
num = int(num)
A.append([suit, num])
merge_list = A[:]
quick_sort(0, N-1)
merge_sort(0, N)
is_stable = True
for i in range(N):
if A[i][0] != merge_list[i][0]:
print("Not stable")
is_stable = False
break
if is_stable:
print("Stable")
for card in A:
print(("%s %d" % (card[0], card[1])))
| p02277 |
class Quicksort:
def quicksort(self, a, p, r):
if p < r:
q = self.partion(a, p, r)
self.quicksort(a, p, q - 1)
self.quicksort(a, q + 1, r)
return(a)
def partion(self, a, p, r):
x = a[r][1]
i = p - 1
for j in range(p, r):
if a[j][1] <= x:
i += 1
a[i], a[j] = a[j], a[i]
a[i + 1], a[r] = a[r], a[i + 1]
return(i+1)
def bubbleSort(a, n):
flag = 1
while flag == 1:
flag = 0
for j in range(n-1, 0, -1):
if a[j][1] < a[j - 1][1]:
a[j], a[j-1] = a[j-1], a[j]
flag = 1
return(a)
if __name__ == '__main__':
n = int(input().rstrip())
cards = []
for i in range(n):
tmp = input().rstrip().split(" ")
tmp[1] = int(tmp[1])
cards.append(tmp)
a = cards[:]
b = cards[:]
x = Quicksort()
a = x.quicksort(a, 0, n-1)
b = bubbleSort(b, n)
if a == b:
print("Stable")
else:
print("Not stable")
for i in a:
i[1] = str(i[1])
print((" ".join(i))) | class Quicksort:
def quicksort(self, a, p, r):
if p < r:
q = self.partion(a, p, r)
self.quicksort(a, p, q - 1)
self.quicksort(a, q + 1, r)
return(a)
def partion(self, a, p, r):
x = a[r][1]
i = p - 1
for j in range(p, r):
if a[j][1] <= x:
i += 1
a[i], a[j] = a[j], a[i]
a[i + 1], a[r] = a[r], a[i + 1]
return(i+1)
def bubbleSort(a, n):
flag = 1
while flag == 1:
flag = 0
for j in range(n-1, 0, -1):
if a[j][1] < a[j - 1][1]:
a[j], a[j-1] = a[j-1], a[j]
flag = 1
return(a)
if __name__ == '__main__':
n = int(input().rstrip())
cards = []
for i in range(n):
tmp = input().rstrip().split(" ")
tmp[1] = int(tmp[1])
cards.append(tmp)
a = cards[:]
b = cards[:]
x = Quicksort()
a = x.quicksort(a, 0, n-1)
b = sorted(b, key=lambda i: i[1])
if a == b:
print("Stable")
else:
print("Not stable")
for i in a:
i[1] = str(i[1])
print((" ".join(i))) | p02277 |
n = int(input())
stable = 1
class Card():
__slots__ = ('suit', 'value')
#mergeSort
A = [Card() for _ in range(n)]
#quickSort
B = [Card() for _ in range(n)]
for i in range(n):
a = input().split()
A[i].suit = a[0]
B[i].suit = a[0]
A[i].value = int(a[1])
B[i].value = int(a[1])
def merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = [0] * (n1+1)
R = [0] * (n2+1)
L[:n1] = A[left:mid]
R[:n2] = A[mid:right]
#for i in xrange(n1):
# L[i] = A[left + i]
#for i in xrange(n2):
# R[i] = A[mid + i]
L[n1] = Card()
R[n2] = Card()
L[n1].value = float('inf')
R[n2].value = float('inf')
i = 0
j = 0
for k in range(left,right):
if L[i].value <= R[j].value:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
return 0
def mergeSort(A, left, right):
if right - left > 1:
mid = int((left + right) / 2)
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
return 0
def partition(A, p, r):
x = A[r].value
i = p-1
for j in range(p,r):
if A[j].value <= x:
i += 1
tmp = A[i]
A[i] = A[j]
A[j] = tmp
tmp = A[i+1]
A[i+1] = A[r]
A[r] = tmp
return i+1
def quickSort(A,p,r):
if p < r:
q = partition(A, p, r)
quickSort(A, p, q-1)
quickSort(A, q, r)
return 0
mergeSort(A, 0, n)
quickSort(B, 0, n-1)
for i in range(n):
if A[i].suit != B[i].suit:
stable = 0
if stable == 1:
print('Stable')
else:
print('Not stable')
for i in range(n):
print(B[i].suit, B[i].value) | n = int(input())
#stable = 1
class Card():
__slots__ = ('suit', 'value')
#mergeSort
A = [Card() for _ in range(n)]
#quickSort
B = [Card() for _ in range(n)]
s = set()
for i in range(n):
a = input().split()
A[i].suit = a[0]
B[i].suit = a[0]
A[i].value = int(a[1])
B[i].value = int(a[1])
s.add(int(a[1]))
'''
def merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = [0] * (n1+1)
R = [0] * (n2+1)
L[:n1] = A[left:mid]
R[:n2] = A[mid:right]
#for i in xrange(n1):
# L[i] = A[left + i]
#for i in xrange(n2):
# R[i] = A[mid + i]
L[n1] = Card()
R[n2] = Card()
L[n1].value = float('inf')
R[n2].value = float('inf')
i = 0
j = 0
for k in xrange(left,right):
if L[i].value <= R[j].value:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
return 0
def mergeSort(A, left, right):
if right - left > 1:
mid = int((left + right) / 2)
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
return 0
'''
def partition(A, p, r):
x = A[r].value
i = p-1
for j in range(p,r):
if A[j].value <= x:
i += 1
tmp = A[i]
A[i] = A[j]
A[j] = tmp
tmp = A[i+1]
A[i+1] = A[r]
A[r] = tmp
return i+1
def quickSort(A,p,r):
if p < r:
q = partition(A, p, r)
quickSort(A, p, q-1)
quickSort(A, q, r)
return 0
#mergeSort(A, 0, n)
quickSort(B, 0, n-1)
for i in s:
if [d.suit for d in A if d.value == i] != [d.suit for d in B if d.value == i]:
print('Not stable')
break
else:
print('Stable')
#for i in xrange(n):
# if A[i].suit != B[i].suit:
# stable = 0
for i in range(n):
print(B[i].suit, B[i].value) | p02277 |
INF = int(1e10)
def merge(A, left, mid, right):
L = A[left: mid] + [[0, INF]]
R = A[mid: right] + [[0, INF]]
i = j = 0
for k in range(left, right):
if L[i][1] <= R[j][1]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
def partition(A, p, r):
x = A[r][1]
i = p - 1
for j in range(p, r):
if A[j][1] <= x:
i += 1
A[i], A[j] = A[j], A[i]
A[i + 1], A[r] = A[r], A[i + 1]
return i + 1
def quicksort(A, p, r):
if p < r:
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r)
n = int(input())
f = lambda a: (a[0], int(a[1]))
A = [f(input().split()) for _ in range(n)]
B = A[:]
mergeSort(A, 0, n)
quicksort(B, 0, n - 1)
print("Stable" if A == B else "Not stable")
print(*(f"{a} {b}" for a, b in B), sep="\n")
| import sys
readline = sys.stdin.readline
INF = int(1e10)
def merge(A, left, mid, right):
L = A[left: mid] + [[0, INF]]
R = A[mid: right] + [[0, INF]]
i = j = 0
for k in range(left, right):
if L[i][1] <= R[j][1]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
def partition(A, p, r):
x = A[r][1]
i = p - 1
for j in range(p, r):
if A[j][1] <= x:
i += 1
A[i], A[j] = A[j], A[i]
A[i + 1], A[r] = A[r], A[i + 1]
return i + 1
def quicksort(A, p, r):
if p < r:
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r)
n = int(input())
f = lambda a: (a[0], int(a[1]))
A = [f(readline().split()) for _ in range(n)]
B = A[:]
mergeSort(A, 0, n)
quicksort(B, 0, n - 1)
print("Stable" if A == B else "Not stable")
print(*(f"{a} {b}" for a, b in B), sep="\n")
| p02277 |
import sys
readline = sys.stdin.readline
INF = int(1e10)
def merge(A, left, mid, right):
L = A[left: mid] + [[0, INF]]
R = A[mid: right] + [[0, INF]]
i = j = 0
for k in range(left, right):
if L[i][1] <= R[j][1]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
def partition(A, p, r):
x = A[r][1]
i = p - 1
for j in range(p, r):
if A[j][1] <= x:
i += 1
A[i], A[j] = A[j], A[i]
A[i + 1], A[r] = A[r], A[i + 1]
return i + 1
def quicksort(A, p, r):
if p < r:
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r)
n = int(input())
f = lambda a: (a[0], int(a[1]))
A = [f(readline().split()) for _ in range(n)]
B = A[:]
mergeSort(A, 0, n)
quicksort(B, 0, n - 1)
print("Stable" if A == B else "Not stable")
print(*(f"{a} {b}" for a, b in B), sep="\n")
| import sys
readline = sys.stdin.readline
import sys
readline = sys.stdin.readline
INF = int(1e10)
def partition(A, p, r):
x = A[r][1]
i = p - 1
for j in range(p, r):
if A[j][1] <= x:
i += 1
A[i], A[j] = A[j], A[i]
A[i + 1], A[r] = A[r], A[i + 1]
return i + 1
def quicksort(A, p, r):
if p < r:
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r)
def isStable(A):
for i in range(0, len(A) - 1):
if A[i][1] == A[i + 1][1]:
if A[i][2] > A[i + 1][2]:
return False
return True
n = int(input())
f = lambda a, i: (a[0], int(a[1]), i)
A = [f(readline().split(), i) for i in range(n)]
quicksort(A, 0, n - 1)
print("Stable" if isStable(A) else "Not stable")
print(*(f"{a} {b}" for a, b, c in A), sep="\n")
| p02277 |
import sys
readline = sys.stdin.readline
import sys
readline = sys.stdin.readline
INF = int(1e10)
def partition(A, p, r):
x = A[r][1]
i = p - 1
for j in range(p, r):
if A[j][1] <= x:
i += 1
A[i], A[j] = A[j], A[i]
A[i + 1], A[r] = A[r], A[i + 1]
return i + 1
def quicksort(A, p, r):
if p < r:
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r)
def isStable(A):
for i in range(0, len(A) - 1):
if A[i][1] == A[i + 1][1]:
if A[i][2] > A[i + 1][2]:
return False
return True
n = int(input())
f = lambda a, i: (a[0], int(a[1]), i)
A = [f(readline().split(), i) for i in range(n)]
quicksort(A, 0, n - 1)
print("Stable" if isStable(A) else "Not stable")
print(*(f"{a} {b}" for a, b, c in A), sep="\n")
| import sys
readline = sys.stdin.readline
def partition(A, p, r):
x = A[r][1]
i = p - 1
for j in range(p, r):
if A[j][1] <= x:
i += 1
A[i], A[j] = A[j], A[i]
A[i + 1], A[r] = A[r], A[i + 1]
return i + 1
def quicksort(A, p, r):
if p < r:
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r)
def isStable(A):
for i in range(0, len(A) - 1):
if A[i][1] == A[i + 1][1]:
if A[i][2] > A[i + 1][2]:
return False
return True
n = int(eval(input()))
f = lambda a, i: (a[0], int(a[1]), i)
A = [f(readline().split(), i) for i in range(n)]
quicksort(A, 0, n - 1)
print(("Stable" if isStable(A) else "Not stable"))
print(("\n".join(f"{a} {b}" for a, b, c in A)))
| p02277 |
import sys
readline = sys.stdin.readline
def partition(A, p, r):
x = A[r][1]
i = p - 1
for j in range(p, r):
if A[j][1] <= x:
i += 1
A[i], A[j] = A[j], A[i]
A[i + 1], A[r] = A[r], A[i + 1]
return i + 1
def quicksort(A, p, r):
if p < r:
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r)
def isStable(A):
for i in range(0, len(A) - 1):
if A[i][1] == A[i + 1][1]:
if A[i][2] > A[i + 1][2]:
return False
return True
n = int(eval(input()))
f = lambda a: (a[0], int(a[1]))
A = [f(readline().split()) + (i,) for i in range(n)]
quicksort(A, 0, n - 1)
print(("Stable" if isStable(A) else "Not stable"))
print(("\n".join(f"{a} {b}" for a, b, c in A)))
| import sys
readline = sys.stdin.readline
def partition(A, p, r):
x = A[r][1]
i = p - 1
for j in range(p, r):
if A[j][1] <= x:
i += 1
A[i], A[j] = A[j], A[i]
A[i + 1], A[r] = A[r], A[i + 1]
return i + 1
def quicksort(A, p, r):
if p < r:
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r)
def isStable(A):
for i in range(0, len(A) - 1):
if A[i][1] == A[i + 1][1]:
if A[i][2] > A[i + 1][2]:
return "Not stable"
return "Stable"
n = int(eval(input()))
f = lambda a, i: (a[0], int(a[1]), i)
A = [f(readline().split(), i) for i in range(n)]
quicksort(A, 0, n - 1)
print((isStable(A)))
print(("\n".join(f"{a} {b}" for a, b, c in A)))
| p02277 |
INF = 10**10
def partition(ary, p, r):
x = ary[r][1]
i = p - 1
for j in range(p, r):
if ary[j][1] <= x:
i += 1
ary[i], ary[j] = ary[j], ary[i]
ary[i + 1], ary[r] = ary[r], ary[i + 1]
return i + 1
def quick_sort(ary, p, r):
if p < r:
q = partition(ary, p, r)
quick_sort(ary, p, q - 1)
quick_sort(ary, q + 1, r)
def merge(ary, left, mid, right):
lry = ary[left:mid]
rry = ary[mid:right]
lry.append(('INF', INF))
rry.append(('INF', INF))
i = 0
j = 0
for k in range(left, right):
if lry[i][1] <= rry[j][1]:
ary[k] = lry[i]
i += 1
else:
ary[k] = rry[j]
j += 1
return right - left
def merge_sort(ary, left, right):
cnt = 0
if left + 1 < right:
mid = (left + right) // 2
cnt += merge_sort(ary, left, mid)
cnt += merge_sort(ary, mid, right)
cnt += merge(ary, left, mid, right)
return cnt
# if __name__ == '__main__':
import sys
from copy import deepcopy
n = int(input())
# ary = [(lambda x: (x[0], int(x[1])))(input().split()) for i in range(n)]
ary = [(lambda x: (x[0], int(x[1])))(line.strip().split()) for line in sys.stdin]
qary = deepcopy(ary)
mary = deepcopy(ary)
quick_sort(qary, 0, n - 1)
merge_sort(mary, 0, n)
if qary == mary:
print('Stable')
else:
print('Not stable')
[print(*_) for _ in qary]
| INF = 10**10
def partition(ary, p, r):
x = ary[r][1]
i = p - 1
for j in range(p, r):
if ary[j][1] <= x:
i += 1
ary[i], ary[j] = ary[j], ary[i]
ary[i + 1], ary[r] = ary[r], ary[i + 1]
return i + 1
def quick_sort(ary, p, r):
if p < r:
q = partition(ary, p, r)
quick_sort(ary, p, q - 1)
quick_sort(ary, q + 1, r)
def merge(ary, left, mid, right):
lry = ary[left:mid]
rry = ary[mid:right]
lry.append(('INF', INF))
rry.append(('INF', INF))
i = 0
j = 0
for k in range(left, right):
if lry[i][1] <= rry[j][1]:
ary[k] = lry[i]
i += 1
else:
ary[k] = rry[j]
j += 1
return right - left
def merge_sort(ary, left, right):
cnt = 0
if left + 1 < right:
mid = (left + right) // 2
cnt += merge_sort(ary, left, mid)
cnt += merge_sort(ary, mid, right)
cnt += merge(ary, left, mid, right)
return cnt
if __name__ == '__main__':
import sys
from copy import deepcopy
n = int(input())
ary = [(lambda x: (x[0], int(x[1])))(line.strip().split()) for line in sys.stdin]
qary = deepcopy(ary)
mary = deepcopy(ary)
quick_sort(qary, 0, n - 1)
merge_sort(mary, 0, n)
if qary == mary:
print('Stable')
else:
print('Not stable')
[print(*_) for _ in qary]
| p02277 |
def partition(A, p, r):
x = int(A[r-1][1])
i = p-1
for j in range(p,r-1):
if int(A[j][1]) <= x:
i = i + 1
A[i],A[j] = A[j],A[i]
A[i+1],A[r-1] = A[r-1],A[i+1]
return i + 1
def qsort(A,p,r):
if p < r:
q = partition(A,p,r)
qsort(A,p,q)
qsort(A,q+1,r)
return A
def isStable(a, b):
length = int(len(a))
for i in range(length):
for j in range(i+1,length-1) :
for x in range(length):
for y in range(x+1,length-1) :
if a[i][1]==a[j][1] and a[i] == b[y] and a[j] == b[x]:
return False
break
return True
if __name__ == '__main__':
cnt = int(eval(input()))
A = []
for i in range(cnt):
A.append(input().split())
A2 = A[:]
p = 0
r = len(A)
B = qsort(A,p,r)
if isStable(A2,B):
print("Stable")
else:
print("Not stable")
for i in B:
print(("{0} {1}".format(i[0],i[1]))) | def partition(A, p, r):
x = int(A[r-1][1])
i = p-1
for j in range(p,r-1):
if int(A[j][1]) <= x:
i = i + 1
A[i],A[j] = A[j],A[i]
A[i+1],A[r-1] = A[r-1],A[i+1]
return i + 1
def qsort(A,p,r):
if p < r:
q = partition(A,p,r)
qsort(A,p,q)
qsort(A,q+1,r)
return A
def isStable(a):
length = int(len(a))
for i in range(length):
for j in range(i+1,length-1) :
if a[i][1] == a[j][1] and a[i][2] > a[j][2]:
return False
break
return True
if __name__ == '__main__':
cnt = int(eval(input()))
A = []
for i in range(cnt):
N = input().split()
N.append(i)
A.append(N)
p = 0
r = len(A)
B = qsort(A,p,r)
if isStable(B):
print("Stable")
else:
print("Not stable")
for i in B:
print(("{0} {1}".format(i[0],i[1]))) | p02277 |
import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N = int(readline())
XY = [tuple(int(x) for x in line.split()) for line in readlines()]
graph = [[] for _ in range(N+1)]
for x,y in XY:
graph[x].append(y)
graph[y].append(x)
visited = [False] * (N+1)
visited[1] = True
q = [1]
ord = [1]
par = [0] * (N+1)
while q:
x = q.pop()
for y in graph[x]:
if visited[y]:
continue
ord.append(y)
par[y] = x
visited[y] = True
q.append(y)
G = [0] * (N+1)
for x in ord[::-1]:
p = par[x]
G[p] ^= (G[x]+1)
answer = 'Alice' if G[1] != 0 else 'Bob'
print(answer) | import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N = int(readline())
XY = (tuple(int(x)-1 for x in line.split()) for line in readlines())
graph = [[] for _ in range(N)]
for x,y in XY:
graph[x].append(y)
graph[y].append(x)
visited = [True] + [False] * (N-1)
q = [0]
ord = [0]
par = [0] * N
while q:
x = q.pop()
for y in graph[x]:
if visited[y]:
continue
ord.append(y)
par[y] = x
visited[y] = True
q.append(y)
G = [0] * (N+1)
for x in ord[:0:-1]:
p = par[x]
G[p] ^= (G[x]+1)
answer = 'Alice' if G[0] != 0 else 'Bob'
print(answer)
| p03668 |
import sys
def solve():
file_input = sys.stdin
N, W = list(map(int, file_input.readline().split()))
C = [0] * (W + 1)
for line in file_input:
item_v, item_w = list(map(int, line.split()))
for i, sv in enumerate(C[:-item_w]):
V = [v + item_v * j for j, v in enumerate(C[i + item_w::item_w], start=1)]
C[i] = max(V + [sv])
print((C[0]))
solve() | import sys
def solve():
file_input = sys.stdin
N, W = list(map(int, file_input.readline().split()))
C = [0] * (W + 1)
for line in file_input:
item_v, item_w = list(map(int, line.split()))
for i, vals in enumerate(zip(C, C[item_w:]), start=item_w):
v1, v2 = vals
C[i] = max(v1 + item_v, v2)
print((C[W]))
solve() | p02316 |
import sys
readline = sys.stdin.readline
N, W = list(map(int, readline().split()))
dp = [0] * (W+1)
for i in range(N):
item_v, item_w = list(map(int, readline().split()))
for w in range(W-item_w+1):
if dp[w+item_w] < dp[w] + item_v:
dp[w+item_w] = dp[w] + item_v
print((max(dp))) | N, W = list(map(int, input().split()))
dp = [0]*(W+1)
for i in range(N):
v, w = list(map(int, input().split()))
for j in range(0, W-w+1):
if dp[j+w] < dp[j] + v:
dp[j+w] = dp[j] + v
print((max(dp))) | p02316 |
INF = 10 ** 12
N, W = list(map(int, input().split()))
items =[] * N
for i in range(N):
v, w = list(map(int, input().split()))
items.append([v,w])
dp = [[INF for i in range(W+1)] for j in range(N+1)]
for i in range(W+1):
dp[0][i] = 0
for i in range(N+1):
dp[i][0] = 0
for i in range(1,N+1): #1<= i <= N
for j in range(1, W+1): # 1 <= j <= W
if j - items[i-1][1] >= 0:
dp[i][j] = max(dp[i-1][j], dp[i-1][j - items[i-1][1]] + items[i-1][0], dp[i][j - items[i-1][1]] + items[i-1][0])
else:
dp[i][j] = dp[i-1][j]
print((dp[N][W])) | def solve():
INF = 10 ** 12
N, W = list(map(int, input().split()))
items =[] * N
for i in range(N):
v, w = list(map(int, input().split()))
items.append([v,w])
dp = [[INF for i in range(W+1)] for j in range(N+1)]
for i in range(W+1):
dp[0][i] = 0
for i in range(N+1):
dp[i][0] = 0
for i in range(1,N+1): #1<= i <= N
for j in range(1, W+1): # 1 <= j <= W
if j - items[i-1][1] >= 0:
dp[i][j] = max(dp[i-1][j], dp[i-1][j - items[i-1][1]] + items[i-1][0], dp[i][j - items[i-1][1]] + items[i-1][0])
else:
dp[i][j] = dp[i-1][j]
print((dp[N][W]))
if __name__ == '__main__':
solve() | p02316 |
import copy
length, cap = list(map(int, input().split(" ")))
dp = [0] * (cap + 1)
items = []
for _ in range(length):
a, b = list(map(int, input().split(" ")))
items.append([a, b])
for item in items:
v, w = item
temp_dp = copy.copy(dp)
temp_dp[w] = max(temp_dp[w], v)
for j in range(cap):
if temp_dp[j] and w + j <= cap:
temp_dp[w + j] = max(temp_dp[w + j], v + temp_dp[j])
dp = temp_dp
answer = max(dp)
print(answer)
| length, weight = list(map(int, input().split(" ")))
dp = [0 for n in range(weight + 1)]
for i in range(length):
v, w = list(map(int, input().split(" ")))
dp[w] = max(v, dp[w])
for j in range(weight):
if dp[j] and j + w <= weight:
dp[j + w] = max(dp[j] + v, dp[j + w])
print((max(dp)))
| p02316 |
N,W=list(map(int,input().split()))
vw=[list(map(int,input().split())) for i in range(N)]
dp=[[0]*(W+1) for _ in range(N+1)]
for i in range(N):
for j in range(W+1):
if vw[i][1]>j:
dp[i+1][j]=dp[i][j]
else:
dp[i+1][j]=max(dp[i][j],dp[i+1][j-vw[i][1]]+vw[i][0])
print((dp[N][W])) | n,w=list(map(int,input().split()))
vw=[list(map(int,input().split())) for _ in range(n)]
dp=[0]*(w+1)
for i in range(n):
for j in range(vw[i][1],w+1):
dp[j]=max(dp[j],dp[j-vw[i][1]]+vw[i][0])
print((dp[w])) | p02316 |
n,w = list(map(int, input().split()))
values = [0]
weights = [0]
counter=0
for i in range(n):
v,weight = list(map(int, input().split()))
values.append(v)
weights.append(weight)
for i in range(1,n+1):
counter=2
while(w >= weights[i]*counter):
weights.append(weights[i]*counter)
values.append(values[i]*counter)
counter = counter+1
dp = [[0 for i in range(w+1)]for j in range(len(values))]
for i in range(1,len(values)):
for j in range(w+1):
if(weights[i] > j):
dp[i][j] = dp[i-1][j]
else:
dp[i][j] = max(dp[i-1][j], dp[i-1][j-weights[i]]+values[i])
print((dp[len(values)-1][-1]))
| n,w = list(map(int, input().split()))
values = []
weights = []
for i in range(n):
v,weight = list(map(int, input().split()))
values.append(v)
weights.append(weight)
dp = [0 for i in range(w+1)]
for i in range(n):
for j in range(weights[i], w+1):
dp[j] = max(dp[j], dp[j-weights[i]]+values[i])
print((dp[w]))
| p02316 |
# Knapsack Problem
N, W = [int(x) for x in input().split()]
items = []
for i in range(N):
items.append(tuple(int(x) for x in input().split()))
DP = [[0] * (W+1) for _ in range(N+1)]
for i in range(N):
for j in range(W+1):
v, w = items[i]
if w <= j:
DP[i+1][j] = max(DP[i][j], v + DP[i+1][j-w])
else:
DP[i+1][j] = DP[i][j]
print((DP[-1][-1])) | # Knapsack Problem
N, W = [int(x) for x in input().split()]
items = []
for i in range(N):
items.append(tuple(int(x) for x in input().split()))
DP = [0] * (W+1)
for i in range(N):
v, w = items[i]
for j in range(w, W+1):
DP[j] = max(DP[j], v + DP[j-w])
print((DP[-1])) | p02316 |
n = int(eval(input()))
for _ in range(n):
print((input().replace("Hoshino", "Hoshina"))) | n = int(input())
dataset = [input().replace("Hoshino", "Hoshina") for _ in range(n)]
print(*dataset, sep="\n")
| p00101 |
N, M = list(map(int, input().split()))
from math import sqrt
def divisor(num):
max_num = int(sqrt(num))
divisor_list = []
for i in range(1, max_num + 1):
if num % i == 0:
divisor_list.append(i)
divisor_list.append(num//i)
return divisor_list
g_list = divisor(M)
g_list.sort(reverse=True)
ans = 0
for g in g_list:
if M//g >= N:
ans = g
break
print(ans) | ### ABC112D Partition Diff:
N, M = list(map(int, input().split()))
from math import sqrt
def divisor(num):
max_num = int(sqrt(num))
divisor_list = []
for i in range(1, max_num + 1):
if num % i == 0:
divisor_list.append(i)
divisor_list.append(num//i)
return divisor_list
div = divisor(M)
div.sort(reverse=True)
ans = None
for g in div:
if N > M//g:
continue
ans = g
break
print(ans) | p03241 |
n,m=list(map(int,input().split()))
for i in range(n,m+1):
if m%i==0:
print((m//i))
exit() | n,m=list(map(int,input().split()))
for i in range(2,m):
if i*i>m:
print((1))
exit()
if m%i==0:
break
for i in range(n,m+1):
if m%i==0:
print((m//i))
exit() | p03241 |
n,m=list(map(int,input().split()))
L=[]
x=m/n
for i in range(1,int(x+1)):
if m%i==0:
if i<=x:
L.append(i)
if m//i<=x:
L.append(m//i)
print((max(L))) | n,m=list(map(int,input().split()))
L=[]
x=m/n
for i in range(1,min(int(x)+1,int(m**0.5)+1)):
if m%i==0:
if i<=x:
L.append(i)
if m//i<=x:
L.append(m//i)
print((max(L))) | p03241 |
# 解説AC．
def main():
N, M = list(map(int, input().split(" ")))
result = 1
for i in range(2, M // N + 1):
if M % i == 0:
result = i
print(result)
if __name__ == '__main__':
main() | def main():
N, M = list(map(int, input().split(" ")))
for i in range(M // N, 0, -1):
if M % i == 0 and i <= M / N:
print(i)
break
if __name__ == '__main__':
main() | p03241 |
lis = []
N,M = [int(i) for i in input().split()]
M_ = M
i = 2
while True:
if M % i == 0:
M = M // i
lis.append(i)
elif M == 1:
break
else:
i += 1
ans = M_
ret = 1
for n in range(2**len(lis)):
m = bin(n)[-1:1:-1]
ret = 1
for l in range(len(m)):
if int(m[l]):
ret *= lis[l]
if ret >= N:
continue
if ret >= N and ret <=ans:
ans = ret
print((M_//ans))
| import math
lis = []
N,M = [int(i) for i in input().split()]
for i in range(1,int(math.sqrt(M))):
if M % i == 0:
lis.append(i)
lis.append(M//i)
lis.sort()
i =1
for i in lis:
if i >= N:
break
print((M//i ))
| p03241 |
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
def main():
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort(reverse=True)
return divisors
n, m = nm()
for divisor in make_divisors(m):
if divisor <= m / n:
print(divisor)
exit()
if __name__ == '__main__':
main() | import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort(reverse=True)
return divisors
n, m = nm()
for divisor in make_divisors(m):
if divisor <= m / n:
print(divisor)
exit()
| p03241 |
import copy
def cd_generator(num):
ans=[]
for i in range(1,10000000):
if num%i==0:
ans.append(i)
temp=copy.deepcopy(ans)
temp.reverse()
for ele in temp:
ans.append(num//ele)
return ans
def main():
n,m=list(map(int,input().split()))
array=cd_generator(m)
ans=0
for ele in array:
if m//ele>=n:
ans=max(ans,ele)
print(ans)
main() | def make_divisors(n):
lower_divisors,upper_divisors=[],[]
i=1
while i*i<=n:
if n%i==0:
lower_divisors.append(i)
if i!=n//i:
upper_divisors.append(n//i)
i+=1
return lower_divisors+upper_divisors[::-1]
n,m=list(map(int,input().split()))
array=make_divisors(m)
array.reverse()
for ele in array:
if m//ele>=n:
print(ele)
exit()
| p03241 |
def make_divisors(n):
lower_divisors,upper_divisors=[],[]
i=1
while i*i<=n:
if n%i==0:
lower_divisors.append(i)
if i!=n//i:
upper_divisors.append(n//i)
i+=1
return lower_divisors+upper_divisors[::-1]
n,m=list(map(int,input().split()))
array=make_divisors(m)
array.reverse()
for ele in array:
if m//ele>=n:
print(ele)
exit()
| def cd_generator(num):
i=1
lower=[]
upper=[]
while i*i<=num:
if num%i==0:
lower.append(i)
if num!=i*i:
upper.append(num//i)
i+=1
return reversed(lower+upper[::-1])
n,m=list(map(int,input().split()))
for ele in cd_generator(m):
if m/ele>=n:
print(ele)
exit()
| p03241 |
# ANSHUL GAUTAM
# IIIT-D
from math import *
from string import *
from itertools import *
from copy import *
N,M = list(map(int, input().split()))
for i in range(M//N,0,-1):
if(M%i == 0):
print(i)
break | def solve():
n, m = list(map(int, input().split()))
for i in range(m//n,0,-1):
if m % i == 0:
break
print(i)
solve() | p03241 |
N, M = list(map(int, input().split()))
ans = 1
for n in range(1, M // N + 1):
res = M - n * N
if res % n == 0:
ans = n
print(ans)
|
N, M = list(map(int, input().split()))
if M % N == 0:
print((M // N))
else:
ans = 1
for n in range(1, M // N + 1):
res = M - n * N
if res % n == 0:
ans = n
print(ans)
| p03241 |
def make_divisors(n):
divisors = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
# divisors.sort()
return divisors
a,b = list(map(int, input().split()))
l = make_divisors(b)
l.sort(reverse=False)
res = 1
#print(l)
for x in l:
if x <= b//a:
res = max(x, res)
print(res)
| # 約数のリストを得る
def make_divisors(n):
divisors = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
return divisors
N, M = list(map(int, input().split()))
l = make_divisors(M)
# mの約数
res = 1
# 全ての約数において、kと仮定する
for k in l:
x = M // k
# この際、Mをkで除した数列bがN以上であるかを判定する
if x >= N:
res = max(res, k)
print(res) | p03241 |
N, M = list(map(int, input().split()))
ans = 1
for g in range(1, int(M ** 0.5) + 1):
if M % g == 0 and M / g >= N:
ans = max(ans, g)
if M % g == 0:
g2 = M // g
if M % g2 == 0 and M / g2 >= N:
ans = max(ans, g2)
print(ans)
| N, M = list(map(int, input().split()))
ans = 0
for x in range(1, int(M ** 0.5) + 1):
if M % x != 0:
continue
else:
x1, x2 = x, M // x
if M // x1 >= N:
ans = max(ans, x1)
if M // x2 >= N:
ans = max(ans, x2)
print(ans)
| p03241 |
N, M = list(map(int, input().strip().split()))
maxg = 1
if N == 1:
maxg = M
else:
for i in range(2, M//N+1):
if (M - N*i) % i == 0:
maxg = i
print(maxg)
| N, M = list(map(int, input().strip().split()))
i=1
while i <= M//N:
if M % i == 0:
maxg = i
if M//i <= M//N:
maxg = M // i
break
i += 1
print(maxg)
| p03241 |
def is_prime(n):
if n == 1:
return False
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return False
return True
n,m = list(map(int,input().split()))
if (is_prime(m)):
print((1))
exit(0)
a = int(m /n)
for i in range(a,0,-1):
if m % i == 0:
print(i)
break | n,m = list(map(int,input().split()))
a = int(m /n)
for i in range(a,0,-1):
if m % i == 0:
print(i)
break
| p03241 |
n, m = list(map(int, input().split(" ")))
max = 1
for i in range((int)(m/n), 1, -1):
if m % i == 0:
max = i
break
print(max) | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
n, m = list(map(int, input().split(" ")))
max = 1
#print(make_divisors(m))
for i in make_divisors(m):
if i > m/n:
break
else:
max = i
print(max) | p03241 |
N,M = list(map(int,input().split()))
l = M//N
if M+1-N < l:
for i in range(N,M+1):
if M%i == 0:
print((M//i))
break
else:
for i in range(l,-1,-1):
if M % i == 0:
print(i)
break | N,M = list(map(int,input().split()))
m = M
f = {}
while m%2 == 0:
f[2] = f.get(2,0) + 1
m = m//2
k = 3
l = int(m**0.5)+1
while m != 1:
if k > l:
f[m] = f.get(m,0)+1
break
while m%k == 0:
f[k] = f.get(k,0)+1
m = m//k
k += 2
C=[1]
for k in f:
C_tmp = []
for c in C:
for i in range(f[k]):
C_tmp.append(c*(k**(i+1)))
C.extend(C_tmp)
ans_r = M
for c in C:
if c>=N and c<ans_r:
ans_r = c
print((M//ans_r))
| p03241 |
def main():
n, m = list(map(int, input().split()))
ans = 1
v = m / n
for i in range(2, int(m / n) + 1):
if m % i == 0:
ans = max(i, ans)
print(ans)
if __name__ == '__main__':
main()
| def main():
n, m = list(map(int, input().split()))
for i in range(int(m / n), 0, -1):
if m % i == 0:
print(i)
break
if __name__ == '__main__':
main()
| p03241 |
# a1 + a2 + a3 ... + an = M
# ai の 最大公約数をDとする
# ai = xi * D のはず。 D * x0 + D * x1 ... + D * xn = M
# まとめて D(x1 + x2 + .... + xn) = M
# 変形し、D = M / (x1 + x2 + .... + xn)
# (x1 + ... xn) = K とすると、Kを最小化するとDが最大化する
# M / K が割り切れる必要があるので、KはMの約数のいずれか
# K >= N。なぜなら xi >= 1 なので、Kは最低でも数字の個数 N になる
# つまり、約数のうちで N 以上の最初の値が K になる
# ex: 3 14
# 14 の約数 {1, 2, 7}
# K >= N なので、 K >= 3
# K = 7 で確定。つまり D = M/K = 2 でAnswer
N, M = list(map(int, input().split()))
for i in range(1, M + 1):
if M % i == 0 and i >= N:
print((M // i))
break
| # a1 + a2 + a3 ... + an = M
# ai の 最大公約数をDとする
# ai = xi * D のはず。 D * x0 + D * x1 ... + D * xn = M
# まとめて D(x1 + x2 + .... + xn) = M
# 変形し、D = M / (x1 + x2 + .... + xn)
# (x1 + ... xn) = K とすると、Kを最小化するとDが最大化する
# M / K が割り切れる必要があるので、KはMの約数のいずれか
# K >= N。なぜなら xi >= 1 なので、Kは最低でも数字の個数 N になる
# つまり、約数のうちで N 以上の最初の値が K になる
# ex: 3 14
# 14 の約数 {1, 2, 7}
# K >= N なので、 K >= 3
# K = 7 で確定。つまり D = M/K = 2 でAnswer
N, M = list(map(int, input().split()))
M_ROOT = int(M ** 0.5)
k = M
for i in range(1, M_ROOT + 1):
if M % i == 0:
if i >= N:
print((M // i))
exit()
d = M // i
if d < k and d >= N:
k = d
print((M // k)) | p03241 |
n,m = list(map(int,input().split()))
ans = 1
for i in range(1,int(m**0.5)+1):
if m%i==0:
x = m//i
if x>=n:
ans = max(ans,i)
if i>=n:
ans = max(ans,x)
print(ans)
| n,m = list(map(int,input().split()))
ans = 1
for i in range(1,int(m**0.5)+1):
if m%i!=0:continue
if m//i>=n:
ans = max(i,ans)
if i>=n:
ans = max(m//i,ans)
print(ans) | p03241 |
N, M = list(map(int, input().split()))
output = 1
for i in range(M//N, 0, -1):
if M % i == 0 and output < i:
output = i
print(output)
| N, M = list(map(int, input().split()))
output = 1
for i in range(M//N, 0, -1):
if M % i == 0 and output < i:
output = i
break
print(output)
| p03241 |
def factorize(n):
nn = n
lst = []
for i in range(2, int(1 + n ** 0.5)):
k = 0
while nn % i == 0:
k += 1
nn = nn // i
if k > 0:
lst.append([i, k])
if nn != 1:
lst.append([nn, 1])
return lst
def gen_divisor(m):
# not sorted!
yield 1
factorized = factorize(m)
length = len(factorized)
if length == 0:
return
factor_nexps = [0] * length
while True:
# increment
factor_nexps[0] += 1
for idx in range(length - 1):
if factor_nexps[idx] > factorized[idx][1]:
factor_nexps[idx] = 0
factor_nexps[idx+1] += 1
if factor_nexps[-1] > factorized[-1][1]:
return
divisor = 1
for i, tup in enumerate(factorized):
divisor *= tup[0] ** factor_nexps[i]
yield divisor
N, M = list(map(int, input().split()))
def solve():
divisors = sorted([di for di in gen_divisor(M) if di >= N])
ans = M // divisors[0]
return ans
print((solve()))
| def gen_divisor(n):
ps = []
for i in range(1, int(1 + n ** 0.5)):
if n % i == 0:
yield i
ps.append(n // i)
if n // ps[-1] == ps[-1]:
del ps[-1]
for p in reversed(ps):
yield p
N, M = list(map(int, input().split()))
def solve():
for di in gen_divisor(M):
if di >= N:
ans = M // di
return ans
print((solve())) | p03241 |
n, m = list(map(int, input().split()))
count = 1
for i in range(1, (m//n)+1):
temp = m - (i*n)
if temp % i == 0:
count = i
print(count)
| n, m = list(map(int, input().split()))
count = 1
for i in range((m//n), 0, -1):
if m % i == 0:
count = i
break
print(count) | p03241 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy
from operator import itemgetter
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
N, M = na()
MAX = M // N + 1
ans = 1
for i in range(1, MAX):
res = M - i * N
if res % i == 0:
ans = max(ans, i)
print(ans) | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect
from operator import itemgetter
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy
from operator import itemgetter
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
N, M = na()
MAX = M // N
ans = 1
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
if M % N == 0:
print((M // N))
else:
tmp = make_divisors(M)
print((tmp[max(bisect.bisect_left(tmp, MAX) - 1, 0)])) | p03241 |
def run():
N, M = (int(x) for x in input().split())
i = 2
result = 1
while True:
if M % i == 0 and N * i <= M:
result = i
i += 1
if i * N > M:
break
print(result)
if __name__ == '__main__':
run() | def run():
N, M = (int(x) for x in input().split())
i = 2
result = 1
for i in range(M // N, 0, -1):
if M % i == 0:
print(i)
break
if __name__ == '__main__':
run() | p03241 |
from math import gcd
def solve():
n, m = list(map(int, input().split()))
d = m // n
p = m % n
res = max(1, gcd(d, d + p))
while d > 1:
d -= 1
q = m - n * d
res = max(res, gcd(d, d + q))
print(res)
solve() | from math import gcd
def solve():
n, m = list(map(int, input().split()))
d = m // n
p = m % n
res = max(1, gcd(d, d + p))
if p == 0:
print(res)
exit()
while d > res:
d -= 1
p += n
if p % d == 0:
res = max(res, d)
print(res)
solve()
| p03241 |
N, M = list(map(int, input().split()))
flag = True
for i in range(N, M//3 + 1):
if M%i == 0:
print((M//i))
flag = False
break
if flag:
if M%2 == 0 and M//2 >= N:
print((2))
else:
print((1)) | N, M = list(map(int, input().split()))
# また答えが見つかってなければTrue
flag = True
for i in range(N, M//10 + 1):
if M%i == 0:
print((M//i))
flag = False
break
for i in range(9):
if flag and M%(10 - i) == 0 and M//(10 - i) >= N:
print((10 - i))
flag = False
if flag:
print((1)) | p03241 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.