zoukankan      html  css  js  c++  java
  • UVa 10879 Code Refactoring

    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 #xK = A * B = C * D", where ABC 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

    大水题一道,把一个数分解成两个数的乘积,要求出两种分法。

     1 #include<cstdio>
     2 #include<cmath>
     3 
     4 using namespace std;
     5 
     6 int main()
     7 {
     8     int kase;
     9 
    10     scanf("%d",&kase);
    11 
    12     for(int n=1;n<=kase;n++)
    13     {
    14         int k,a=-1,b=-1,c,d;
    15 
    16         scanf("%d",&k);
    17 
    18         int mid=sqrt(k)+0.5;
    19 
    20         for(int i=2;i<=mid;i++)
    21         {
    22             int j=k/i;
    23             if(i*j==k)
    24             {
    25                 if(a==-1&&b==-1)
    26                 {
    27                     a=i;
    28                     b=j;
    29                 }
    30                 else if(i!=a&&i!=b)
    31                 {
    32                     c=i;
    33                     d=j;
    34                     break;
    35                 }
    36             }
    37         }
    38 
    39         printf("Case #%d: %d = %d * %d = %d * %d
    ",n,k,a,b,c,d);
    40     }
    41 
    42     return 0;
    43 }
    [C++]
  • 相关阅读:
    10.23 JSTL
    10.22 EL执行表达式
    10.21 EL表达式(只能在jsp中使用)
    10.20 网站访问量统计(application)
    10.19 JSP内置对象作用域
    10.16 Session和Cookie的区别
    10.15 转发与重定向
    剑指Offer_26_二叉搜索树与双向链表
    剑指Offer_25_复杂链表的复制
    剑指Offer_24_二叉树中和为某一值的路径.md
  • 原文地址:https://www.cnblogs.com/lzj-0218/p/3536723.html
Copyright © 2011-2022 走看看