Gym 100733C

题目：

  

Even though he is the head of the Shitalian Mafia, Shi doesn't like bloodshed and punishes his subordinates if they kill innocent people. That is why the death report is always written in the following way: "We killed x% of the innocent people".

Shi wants to know the smallest number of innocent people that must have been in that place so that exactlyx% of the innocent people have died.

For instance, if we have x = 35%. In this case we had 20 people, and 7 were victims, because 35% of 20 is 7. That is the minimum possible.

Input

There is a single number 0 ≤ x ≤ 100 with at most 15 decimal places.

Output

Print the number sought by Shi.

Sample Input

Input

35

Output

20

Input

50.0

Output

2

Input

7.500

Output

40

Input

35.123456789

Output

100000000000
题意：
   给你一个百分数，让你求一个最小数，使得这个最小的整数乘以这个百分数后可以得到一个整数
分析：
  把给定的数存为字符串，使得可以计算出移动小数点多少位后（k），可以使的给的实数变为整数，然后分子分母通扩大k倍，然后乱搞。。。。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long LL;
char num[20];
LL a[20];
LL gcd(LL a,LL b)
{
    return b==0? a:gcd(b,a%b);
}
int main()
{
    scanf("%s",num);
    int n=strlen(num);
    //printf("n==%d\n",n);
    int k=0;
    for(int i=0;i<n;i++)
    {
        if(num[i]=='.')
        {
            k=n-i-1;
            break;
        }
    }
    //printf("%d\n",k);
    LL cnt=0;
    for(int i=0;i<n;i++)
    {
        if(num[i]=='.') continue;
        else
        cnt=cnt*10+(num[i]-'0');
        //printf("cnt==%lld\n",cnt);
    }
    //printf("%lld\n",cnt);
    LL m=100;
    for(int i=1;i<=k;i++)
    {
        m=m*10;
    }
    //printf("m=%lld\n",m);
    LL ans=gcd(cnt,m);
    //printf("%lld\n",ans);
    printf("%lld\n",m/ans);
    return 0;
}