Codeforces 858A k-rounding
来源:互联网 发布:淘宝宝贝编辑用什么 编辑:程序博客网 时间:2024/05/17 08:12
A. k-rounding
time limit per test1 second
memory limit per test256 megabytes
For a given positive integer n denote its k-rounding as the minimum positive integer x, such that x ends with k or more zeros in base 10 and is divisible by n.
For example, 4-rounding of 375 is 375·80 = 30000. 30000 is the minimum integer such that it ends with 4 or more zeros and is divisible by 375.
Write a program that will perform the k-rounding of n.
Input
The only line contains two integers n and k (1 ≤ n ≤ 109, 0 ≤ k ≤ 8).
Output
Print the k-rounding of n.
Examples
input
375 4
output
30000input
10000 1
output
10000input
38101 0
output
38101input
123456789 8
output
12345678900000000
题意:
规定k-rounding数是以k个0结尾的正整数。
给定n和k,求最小的是n的倍数的k-rounding数。
思路:
智障选手从1枚举到了
代码:
#include<bits/stdc++.h>#define ll long longusing namespace std;int main(){ ll n,k,x; while(cin>>n>>k) { x=1; while(k--) x*=10; ll i; for(i=1;i<=x;i++) { if((n*i)%x==0) { printf("%lld\n",n*i); break; } } } return 0;}
看了人家的代码后发现自己真的是智障了。
其实就是要求n和
代码如下
#include<bits/stdc++.h>#define ll long longusing namespace std;int main(){ ll n,k; while(cin>>n>>k) { ll m=1; while(k--) m*=10; cout<<n*m/__gcd(n,m)<<endl; }}
- Codeforces 858A k-rounding
- codeforces 858 A k-rounding(数学)
- Codeforces 858A. k-rounding 数论
- codeforces 861A k-rounding
- Codeforces 898A. Rounding
- Codeforces 898 A Rounding
- Codeforces Round #434 k-rounding
- cf434 div.2 A. k-rounding
- CodeForces 351A Jeff and Rounding
- Codeforces Round #451 (Div. 2) A. Rounding
- A. Rounding
- codeforces 351A A. Jeff and Rounding(智商题+枚举)
- codeforces 351A A. Jeff and Rounding(★)
- Codeforces Round #204 (Div. 1) A. Jeff and Rounding
- codeforces 351A Jeff and Rounding(区间枚举)
- 【CodeForces 351A】Jeff and Rounding(思维)
- codeforces A. k-Factorization
- codeforces 204 Jeff and Rounding
- C++基础(五)-struct
- poj 2528Mayor's posters(离散化+线段树)
- 简介oracle oerr工具使用
- bash中与时间相关的处理
- java之8大排序(一)---冒泡排序,自然排序
- Codeforces 858A k-rounding
- C++基础(六)-三目运算符
- android 常用类和接口
- Java之8大排序(二)--直接插入排序,希尔排序(java实现)
- java.util.concurrent.locks源码剖析
- 343E
- 算法——快速排序
- C++基础(七)-const
- Java8_Lambda学习(1)——关于Comparator接口