“Harry, my dream is a code waiting to be>
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.
Sample Input
3
120
210
10000000
Sample Output
Case #1: 120 = 12 * 10 = 6 * 20
Case #2: 210 = 7 * 30 = 70 * 3
Case #3: 10000000 = 10 * 1000000 = 100 * 100000
问题链接：UVA10879 Code Refactoring
问题简述：
给定若干个数，计算数的非1和自身的2对因子并按格式输出结果。
问题分析：
从2开始暴力一下就好。
程序说明：（略）
参考链接：（略）
题记：（略）
AC的C++语言程序如下：
/* UVA10879 Code Refactoring */
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, caseno = 0, k, a[2];
scanf("%d", &n);
while(n--) {
scanf("%d", &k);
for(int i = 2, j = 0; j < 2; i++)
if(k % i == 0)
a[j++] = i;
printf("Case #%d: %d = %d * %d = %d * %d\n", ++caseno, k, a[0], k / a[0], a[1], k / a[1]);
}
return 0;
}