You are on page 1of 4

''''

n=int(input())
l=[]
count=0
for i in range(n):
x=int(input())
l.append(x)

f=int(input())
for i in range(n):
if l[i]%f==0:
count+=1
if count>0:
print(count)
else:
print('no multiple found')
'''
''''
class Team:
def __init__(self,team_r,team_c,team_n):
self.team_r=team_r
self.team_c=team_c
self.team_n=team_n
class Tournament:
def __init__(self,team_list,tour):
self.team_list=team_list
self.tour=tour
def count_team(self):
dic={}
for i in self.team_list:
if i.team_c in dic:
dic[team_c]+=1
else:
dic[team_c] = 1
return dic
def tcount(nt,tour):
match=[]
for i in tour:
if nt==i.detail["time"]:
match.append(i)
finalTeamDict = {}
for i in match:
for o in i.team_list:
finalTeamDict[o.team_r] = o.team_n
ansList = []
ansDict = dict(sorted(finalTeamDict.items()))
for i in ansDict.keys():
ansList.append(ansDict[i])
if (ansList == []):
return None
else:
return ansList

if __name__ == "__main__":
m=int(input())
tour=[]
for i in range(m):
team_list=[]
n=int(input())
for j in range(n):
team_r=int(input())
team_c=input()
team_n=input()
team_list.append(Team(team_r,team_c,team_n))

name=input()
host=input()
edition=input()
year=int(input())
parti=int(input())
time=int(input())

detail={'name':name,'host':host,'edition':edition,'year':year,'parti':parti,'time':
time}
tour.append(Tournament(team_list,detail))
nt=int(input())
ans1 = tour[0].count_team()
for i in ans1.keys():
print(i, "-", ans1[i])
ans2 = tcount(nt, tour)
if ans2 == None:
print("No Team Found")
else:
for i in ans2:
print(i)
'''
'''''
def rotate(nums, k):
n = len(nums)
# reduce k to its equivalent value in the range [0, n)
k = k % n
# reverse the first n-k elements
nums[:n-k] = reversed(nums[:n-k])
# reverse the last k elements
nums[n-k:] = reversed(nums[n-k:])
# reverse the whole array
nums[:] = reversed(nums)
return nums
if __name__ == "__main__":
nums = [1, 2, 3, 4, 5]
k = 2
print("Original array:", nums)
rotated_nums = rotate(nums, k)
print("Rotated array:", rotated_nums)
'''
'''''
# replace 12345 with 87654
n=int(input())
f=[]
while(n>0):
x=n%10
a=9-x
f.append(str(a))
n=int(n/10)
f= "".join(reversed(f))
# f=reversed(f)
print(int(f))
'''
'''''
def count_numbers_with_no_repeated_digits(n1, n2):
count = 0
for i in range(n1, n2+1):
digits = set(str(i))
print(digits)
if len(digits) == len(str(i)):
count += 1
return count
if __name__=="__main__":
n1 = int(input())
n2 = int(input())
count = count_numbers_with_no_repeated_digits(n1, n2)
print(count)
'''
from itertools import permutations
inp=input()
l=inp.split()
x=permutations(l[0])
z=''.join(l[1])
f=[]
for i in x:
y=''.join(i)
if int(y)>int(z):
f.append(int(y))
if len(f)>0:
ans=min(f)
print(ans)
else:
print("-1")

class Movie:
def __init__(self,movie,year,award,nomination,country):
self.movie=movie
self.year=year
self.award=award
self.nomination=nomination
self.country=country
class Award:
def __init__(self,movielst):
self.movielst=movielst
def awardmovie(self,y):
lst=[]
for i in self.movielst:
if i.year == y and i.country.lower() != "america":
lst.append(i)
return lst
def success_rate(self):
dic={}
for i in self.movielst:
sr=(i.award/i.nomination)*100
dic[i.movie]=int(sr)
return sorted(dic.items(),key=lambda x:x[1],reverse=True)
if __name__=="__main__":
n=int(input())
movielst=[]
for i in range(n):
movie=input()
year=int(input())
award=int(input())
nomination=int(input())
country=input()
movielst.append(Movie(movie,year,award,nomination,country))
y=int(input())
obj=Award(movielst)
result1=obj.awardmovie(y)
if len(result1)== 0:
print("no movies found")
else:
for i in result1:
print(i.movie)
print(i.year)
print(i.award)
print(i.nomination)
print(i.country)

result2=obj.success_rate()
for i in result2:
print(i[0],i[1])

#include<bits/stdc++.h>
using namespace std;

int find(int n1, int n2) {


int count = 0;
for (int i = n1 ; i <= n2 ; i++) {
int num = i;

vector<bool> visited;
visited.assign(10, false);

while (num > 0) {


if (visited[num % 10] == true)
break;
visited[num % 10] = true;
num /= 10;
}

if (num == 0)
count++;
}
return count;
}

int main()
{
int n1 = 101, n2 = 200;
cout << find(n1, n2);
}

You might also like