UVa 10879 Code Refactoring (因数分解)
来源:互联网 发布:playclubsaber捏脸数据 编辑:程序博客网 时间:2024/04/27 23:53
10879 - Code Refactoring
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=100&page=show_problem&problem=1820
broken. Break the code, solve the crime."Agent Cooper
Several algorithms in modern cryptography are based on the fact that factoring large numbers is difficult. Alicia and Bobby know this, so they have decided to design their own encryption scheme based on factoring. Their algorithm depends on a secret code, K, that Alicia sends to Bobby before sending him an encrypted message. After listening carefully to Alicia's description, Yvette says, "But if I can intercept K and factor it into two positive integers, A and B, I would break your encryption scheme! And the K values you use are at most 10,000,000. Hey, this is so easy; I can even factor it twice, into two different pairs of integers!"
Input
The first line of input gives the number of cases, N (at most 25000). N test cases follow. Each one contains the code, K, on a line by itself.
Output
For each test case, output one line containing "Case #x: K = A * B = C * D", where A, B, C and D are different positive integers larger than 1. A solution will always exist.
312021010000000
Case #1: 120 = 12 * 10 = 6 * 20Case #2: 210 = 7 * 30 = 70 * 3Case #3: 10000000 = 10 * 1000000 = 100 * 100000
water.
完整代码:
/*0.038s*/#include <cstdio>#include <cmath>int main(){int n, k, cnt, i, j;scanf("%d", &n);for (j = 1; j <= n; ++j){scanf("%d", &k);printf("Case #%d: %d", j, k);cnt = 0;for (i = 2;; ++i){if (k % i == 0){printf(" = %d * %d", i, k / i);if (++cnt == 2) break;}}putchar('\n');}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-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
- 二叉树学习笔记
- InterlockedIncrement函数详解
- java抽象类和接口
- 数据结构.栈(C语言实现)
- 【XE5-IndyDB -2】 IndyDB 服务器
- UVa 10879 Code Refactoring (因数分解)
- C语言存储类总结
- 数据结构.循环队列(C语言实现)
- hibernate之session实例的创建
- 华为销售服务--面试经验(长沙地区)
- 数据结构.队列(C语言实现)
- java内部类
- 编程之美2:精确表达浮点数
- 每日一题(96) - 线段最多覆盖的点数