UVA10879H Code Refactoring
来源:互联网 发布:2016年中日贸易数据 编辑:程序博客网 时间:2024/05/29 05:12
Code Refactoring
Time Limit: 2 seconds
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 interceptK and factor it into two positive integers, A andB, 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 andD 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
Problemsetter: Igor Naverniouk
题目的意思就是给你一个数,找出两种相乘等于这个数的情况(并需要是样例的那两种情况)。
如果用两个for找会超时。。
所以要用一个for,判断求余是不是0.。
AC代码:
#include<stdio.h>int main () {int T ;int t = 1;int num;int flag;int n1,n2,m1,m2;scanf("%d",&T);while (T--) {flag = 0;scanf("%d",&num);for (int i = 2 ;;i++) {if (flag == 0 && num % i == 0) {n1 = i;n2 = num / i;flag = 1;continue;}if (flag == 1 && num % i == 0 && i != n2) {m1 = i ;m2 = num / i;break;}}printf("Case #%d: %d = %d * %d = %d * %d\n", t++,num ,n1, n2, m1, m2);}return 0;}
- UVA10879H Code Refactoring
- Code Refactoring
- Code Refactoring
- UVa 10879 Code Refactoring
- uva 10879 Code Refactoring
- uva 10879 - Code Refactoring
- UvaOJ 10879 - Code Refactoring
- uva 10879 - Code Refactoring
- uva-10879 - Code Refactoring
- UVa 10879 - Code Refactoring
- 10879 - Code Refactoring
- uva 10879Code Refactoring
- 10879 - Code Refactoring
- UVa 10879 - Code Refactoring
- 10879 - Code Refactoring
- UVA 10879 Code Refactoring
- UVa 10879: Code Refactoring
- UVa10879 Code Refactoring
- 12864显示图片
- linux下允许外部ip访问mysql数据库
- 00_自制51单片机开发板开发日志
- 此博客不再更新,已转私人博客,欢迎收录
- 递归第一次
- UVA10879H Code Refactoring
- 二分查找
- 【hdu3238】Finding the Most Vital Node of a Shortest Path
- ubuntu下使用vsftpd搭建ftp服务器
- 自定义toggle button
- uva 11090 Going in Cycle!!
- java 学习笔记 栈内存与堆内存
- 3n+1问题
- PendingIntent与Intent的区别