def com_div(m,n):
if m >= n:
(large, small) = (m,n)
else:
(large, small) = (n,m)
large_divs = []
for i in range(1,101):
if large%i == 0:
large_divs.append(i)
for i in range(len(large_divs)):
a = large_divs[-i-1]
if small%a== 0:
return a
return 1
def potion(k):
s = 100 // com_div(k,100)
return s
def test_case(t):
input_list = []
for i in range(t):
input_list.append(int(input()))
for i in range(t):
print(potion(input_list[i]))
t = int(input())
test_case(t)
#include <iostream>
using namespace std;
void solve(){
int a;
cin>>a;
int b = 100-a;
while(a%2==0&&b%2==0){
a/=2;
b/=2;
}
while(a%5==0&&b%5==0){
a/=5;
b/=5;
}
cout<<a+b<<endl;
}
int main(){
int t;
cin>>t;
while(t--){
solve();
}
}1035. Uncrossed Lines | 328. Odd Even Linked List |
1219. Path with Maximum Gold | 1268. Search Suggestions System |
841. Keys and Rooms | 152. Maximum Product Subarray |
337. House Robber III | 869. Reordered Power of 2 |
1593C - Save More Mice | 1217. Minimum Cost to Move Chips to The Same Position |
347. Top K Frequent Elements | 1503. Last Moment Before All Ants Fall Out of a Plank |
430. Flatten a Multilevel Doubly Linked List | 1290. Convert Binary Number in a Linked List to Integer |
1525. Number of Good Ways to Split a String | 72. Edit Distance |
563. Binary Tree Tilt | 1306. Jump Game III |
236. Lowest Common Ancestor of a Binary Tree | 790. Domino and Tromino Tiling |
878. Nth Magical Number | 2099. Find Subsequence of Length K With the Largest Sum |
1608A - Find Array | 416. Partition Equal Subset Sum |
1446. Consecutive Characters | 1618A - Polycarp and Sums of Subsequences |
1618B - Missing Bigram | 938. Range Sum of BST |
147. Insertion Sort List | 310. Minimum Height Trees |