Codeforces Round #434 k-rounding
来源:互联网 发布:分级基金 知乎 编辑:程序博客网 时间:2024/05/18 06:18
水题
#include <bits\stdc++.h>using namespace std;#define pb() push_back()long long gcd(long long a,long long b){ if(b==0)return a; else return gcd(b,a%b);}const int maxn=10;int main(){// freopen("test.in","r",stdin);long long n;int k;long long tmp=1;cin>>n>>k;for(int i=1;i<=k;i++) tmp*=10;cout<<n*tmp/gcd(n,tmp); return 0;}
阅读全文
0 0
- Codeforces Round #434 k-rounding
- codeforces 861A k-rounding
- Codeforces 858A k-rounding
- (贪心)Codeforces Round #402 B. Weird Rounding
- Codeforces Round #451 (Div. 2) A. Rounding
- codeforces 858 A k-rounding(数学)
- Codeforces 858A. k-rounding 数论
- Codeforces Round #204 (Div. 1) A. Jeff and Rounding
- Codeforces Round #204 (Div. 2) C. Jeff and Rounding
- Codeforces Round #204 (Div. 2) C Jeff and Rounding
- Codeforces Round #402 (Div. 2) B. Weird Rounding
- Codeforces Round #402 (Div. 2) B. Weird Rounding
- Codeforces Round #402 (Div. 2)B. Weird Rounding【暴力枚举】
- Codeforces Round #402 (Div. 2) B. Weird Rounding(爆搜)
- Codeforces Round #402 (Div. 2) B. Weird Rounding
- Codeforces 898A. Rounding
- Codeforces 898 A Rounding
- codeforces 204 Jeff and Rounding
- (运输层)TCP的拥塞控制
- Android/ios 网页中跳转到 app
- myeclipse安装及破解
- 大数据学习14:Hive中Join的原理和机制
- angular2向组件中传值的问题
- Codeforces Round #434 k-rounding
- iOS银行卡验证
- 测试入门之缺陷管理
- HDU 6214 Smallest Minimum Cut 最小割(isap)
- C语言
- 9月18日云栖精选夜读:「阿里巴巴编码规范(Java版)」认证考试出炉!你考过了吗?
- 数据结构Java实现01----算法概述
- 用邻接矩阵创建无向网
- JAVA IO流最详解(一)