UVa 10879: Code Refactoring
来源:互联网 发布:内蒙古艺术学院网络 编辑:程序博客网 时间:2024/04/29 15:28
这题只要用两种方式分解一个不超过10,000,000的数就可以了。很简单就能过了。
我的解题代码:
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>using namespace std;int main(){int N;int K;cin >> N;for(int k=0; k<N; k++){cin >> K;cout << "Case #" << k+1 << ": " << K << " = ";int times=0;for(int i=2; i*i<=K; i++) if(times<2){if(K%i==0) {if(times==0){cout << i << " * " << K/i << " = ";times++;}else if(times==1){cout << i << " * " << K/i << endl;times++;}}}else break;}return 0;}
- UVa 10879 Code Refactoring
- uva 10879 Code Refactoring
- uva 10879 - Code Refactoring
- uva 10879 - Code Refactoring
- uva-10879 - Code Refactoring
- UVa 10879 - Code Refactoring
- uva 10879Code Refactoring
- UVa 10879 - Code Refactoring
- UVA 10879 Code Refactoring
- UVa 10879: Code Refactoring
- uva 10879 - Code Refactoring
- uva 10879 Code Refactoring
- UVa 10879 - Code Refactoring
- UVa 10879 - Code Refactoring
- Uva 10879 Code Refactoring
- UVA - 10879 Code Refactoring
- UVA - 10879 Code Refactoring
- UVA - 10879 Code Refactoring
- VirtualBox 共享文件
- 执行 Robotium 测试脚本抛出 NullPointerException
- ubuntu12.04命令行下安装RabbitVCS
- BUILD CDH4.3.0
- iPhone/Mac Objective-C内存管理教程和原理剖析 【三、@property (retain)和@synthesize的默认实现】
- UVa 10879: Code Refactoring
- VK Cup 2012 Qualification Round 1--C. Cd and pwd commands
- iPhone/Mac Objective-C内存管理教程和原理剖析 【四、系统自动创建新的autorelease pool】
- 结构体的定义以及使用
- [LeetCode] Reverse Integer、Palindrome Number
- 多备份数据更新管理器模板设计(C++ Template)
- Run-time Power Management Framework
- java 序列化详解
- C语言--返回局部变量的地址