1uva10879(数论)

 http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=20&page=show_problem&problem=1820

10879 - Code Refactoring

Time limit: 3.000 seconds

Problem B
Code Refactoring
Time Limit: 2 seconds

 

"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	Sample Output
3 120 210 10000000	Case #1: 120 = 12 * 10 = 6 * 20 Case #2: 210 = 7 * 30 = 70 * 3 Case #3: 10000000 = 10 * 1000000 = 100 * 100000

---

Problemsetter: Igor Naverniouk

题意：把一个数拆分成不同的两组分别由两个数相乘。

简单题：1Y。

思路：直接枚举就是了。。

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn =10;
int a[maxn];
int main()
{
 int n;
 scanf("%d",&n);
 int cases=1;
 while(n--)
 {
  int k;
  scanf("%d",&k);
  int i,count=0;
  for(i=2;i<=k;i++)
  {
   if(k%i==0)
   {
    a[count++]=i;
    a[count++]=k/i;
   }
   if(count==4)
    break;
  }
  printf("Case #%d: %d = %d * %d = %d * %d\n",cases++,k,a[0],a[1],a[2],a[3]);
 }
 return 0;
}