Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)
来源:互联网 发布:淘宝客服售后工作内容 编辑:程序博客网 时间:2024/05/16 02:28
后续 一直更新
A一道更新一次
A 题
题意:
给你一个数n 让你乘一个数 然后尾部要有>=k个0
关键n在1e9范围 k<=8;
解:
开始只想到2*5 ,好来wa,直接就1e6暴力吧,竟然31ms抖过
#include<bits/stdc++.h>using namespace std;typedef long long ll;int main(){ ll n,k,i,j; while(cin>>n>>k) { ll ans=0,s_cnt=0,ans_2=0; for(i=1; i<=1000000; i++) { ll tmp=i*n,cnt=0; while(tmp) { if(tmp%10==0) { cnt++; tmp/=10; } else { goto loop; } }loop : if(cnt>s_cnt) { s_cnt=cnt; ans_2=i; } if(cnt>=k) { ans=i*n; break; } } if(ans) cout<<ans<<endl; else { // ans=ans_2*pow(10,k-s_cnt); if(!ans_2) cout<<n; else cout<<ans_2*n; for(i=0; i<k-s_cnt; i++) cout<<"0"; puts(""); } /*ll cnt=0,tmp=n; while(tmp) { if(tmp%10==0) { cnt++; tmp/=10; } else break; } if(cnt>=k) cout<<n<<endl; else { cout<<n; for(i=0; i<k-cnt; i++) cout<<"0"; puts(""); } /* ´ó±í for(i=1;i<=(ll)1e8;i++) { ll tmp=i*n,cnt=0; while(tmp) { if(tmp%10==0) { cnt++; tmp/=10; } else { goto loop; } } loop : if(cnt>=k) { puts("******"); cout<<i*n<<" "<<i<<endl; puts(""); break; } }*/ } return 0;}//375
阅读全文
0 0
- Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)
- Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)
- Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1) C
- Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1) D
- Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1) ABCDF
- Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1) A-C题解
- Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)
- Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)
- Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)
- Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2) A-C题解
- Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2) 总结
- Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)
- Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)
- Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)
- Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4) A
- Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4) B
- Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4) C
- Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4) E
- 读书计划
- 3DSlicer29:Debug or Dev-170918
- jquery resize于某个指定容器,而非浏览器窗口
- 帆软中使用replace函数的注意事项
- VMware虚拟机的CentOS无法上网的解决方法
- Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)
- 自媒体平台运营的感悟
- Vue----运行常见问题
- varint---数值压缩存储
- java基础知识整合
- 获取运行当前进程的用户名
- php curl post raw json参数
- 旅游项目(二)初涉Bootstrap
- Python3 基本数据类型