【Light-oj】-1138-Trailing Zeroes (III)(找到一个数使其阶乘后0的个数为n)
2016-07-18 20:35
513 查看
1138 - Trailing Zeroes (III)
You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*N. For example, 5! = 120, 120 contains one zero
on the trail.
Each case contains an integer Q (1 ≤ Q ≤ 108) in a line.
1:先写一个函数,计算一个数阶乘后会有几个0
2:left和right分别定义为最小的0和最大的正整数,然后两边逼近找到一个数阶乘后0的个数为n。
#include<cstdio>
#define MAX 0x3f3f3f3f //不会超出的最好用的最大正整数
int gs(int a) //写一个函数计算出一个数的阶乘有几个0
{
int ant=0;
while(a)
{
ant+=a/5;
a=a/5;
}
return ant;
}
int main()
{
int t,num=1;
scanf("%d",&t);
while(t--)
{
int n,l=0,r=MAX,mid; //把left定义为最小0,right定义为最大
scanf("%d",&n);
printf("Case %d: ",num);
num++;
while(l<=r)
{
mid=(l+r)>>1;
if(gs(mid)>=n) //个数多于n则right左移换为mid-1
r=mid-1;
else
l=mid+1;
}
if(gs(l)==n)
printf("%d\n",l);
else
printf("impossible\n");
}
return 0;
}
PDF (English) | Statistics | Forum |
Time Limit: 2 second(s) | Memory Limit: 32 MB |
on the trail.
Input
Input starts with an integer T (≤ 10000), denoting the number of test cases.Each case contains an integer Q (1 ≤ Q ≤ 108) in a line.
Output
For each case, print the case number and N. If no solution is found then print 'impossible'.Sample Input | Output for Sample Input |
3 1 2 5 | Case 1: 5 Case 2: 10 Case 3: impossible |
2:left和right分别定义为最小的0和最大的正整数,然后两边逼近找到一个数阶乘后0的个数为n。
#include<cstdio>
#define MAX 0x3f3f3f3f //不会超出的最好用的最大正整数
int gs(int a) //写一个函数计算出一个数的阶乘有几个0
{
int ant=0;
while(a)
{
ant+=a/5;
a=a/5;
}
return ant;
}
int main()
{
int t,num=1;
scanf("%d",&t);
while(t--)
{
int n,l=0,r=MAX,mid; //把left定义为最小0,right定义为最大
scanf("%d",&n);
printf("Case %d: ",num);
num++;
while(l<=r)
{
mid=(l+r)>>1;
if(gs(mid)>=n) //个数多于n则right左移换为mid-1
r=mid-1;
else
l=mid+1;
}
if(gs(l)==n)
printf("%d\n",l);
else
printf("impossible\n");
}
return 0;
}
相关文章推荐
- TensorFlow 官方API 中文版(一)
- HDU 2674 N!Again
- 2016微软探星夏令营:#1341 : Constraint Checker
- Codeforces 208B Solitaire
- maven install Failed to execute goal org.apache.maven.plugins:maven-war-plugin:2.1.1:war (default-wa
- jetbrains全家桶的配置
- Error XA5209: Unzipping failed. Please download https://dl-ssl.google.com/android/repository/android
- POJ 2305 Basic remains(进制转换)
- One or more constraints have not been satisfied.
- grails部署开发
- if (arry.Contains(str))
- 免费超大量邮件发送服务Amazon SES和Mailgun提供SMTP和API支持
- Debain安装字体,修改默认编码,命令行
- Debain源更新
- [Paper 学习笔记] Multi-Scale 3D Convolutional Neural Networks for Lesion Segmentation in Brain MRI
- DataInputStream api
- 分类算法之朴素贝叶斯分类(Naive Bayesian classification)
- weblogic Error [Management:141191]The prepare phase of the configuration update failed with an excep
- DataInputStream和DataOutputStream
- aidl通过回调共享数据