UVA - 725 Division (暴力枚举)
来源:互联网 发布:vb简易计算器代码 编辑:程序博客网 时间:2024/05/09 15:50
Division
Write a program that finds and displays all pairs of 5-digit numbers thatbetween them use the digits0 through 9 once each, such that thefirst number divided by the second is equal to an integerN, where .That is,
abcde / fghij = N
where each letter represents a different digit. The first digit of one ofthe numerals is allowed to be zero.
Input
Each line of the input file consists of a valid integer N. An input of zero is to terminatethe program.Output
Your program have to display ALL qualifying pairs of numerals, sorted byincreasing numerator (and, of course, denominator).Your output should be in the following general form:
xxxxx / xxxxx = N
xxxxx / xxxxx = N
.
.
In case there are no pairs of numerals satisfying the condition, you mustwrite ``There are no solutions forN.". Separate the output for twodifferent values of N by a blank line.
Sample Input
61620
Sample Output
There are no solutions for 61.79546 / 01283 = 6294736 / 01528 = 62
题目大意:
输入正整数n,按照从小到大的顺序输出所有形如abcde/fghij = n 的表达式,其中a~j恰好为数组0~9的一个排列(可以有前导0),2<= n <= 79
解析:
不需要枚举0~9所有的排列。只要枚举fghij就可以算出abcde,然后判断所有的数字都不相同即可。
#include <stdio.h>#include <string.h>bool judge(int ans1,int ans2) {char str[11];bool vis[10];int num;memset(vis,false,sizeof(vis));sprintf(str,"%05d%05d",ans1,ans2);for(int i = 0; i < 10; i++) {num = str[i] - '0';if(vis[num]) {return false;}vis[num] = true;}return true;}int main() {int n;int ans1,ans2;int cas = 0;while(scanf("%d",&n) != EOF && n) {if(cas++) {printf("\n");}bool flag = false;for(int i = 1234; i <= 100000; i++) {if(i % n == 0) {ans2 = i / n;if( judge(i,ans2) ) {flag = true;printf("%05d / %05d = %d\n",i,ans2,n);}}}if(!flag) {printf("There are no solutions for %d.\n",n);}}return 0;}
- UVA - 725 Division (暴力枚举)
- uva 725 Division(暴力枚举)
- UVa - 725 - Division(暴力枚举)
- UVA 725 Division(暴力枚举 简单)
- [容易] UVa OJ 725 Division 暴力枚举
- Uva 725 Division(暴力)
- UVa 725 Division(枚举)
- UVa--725 Division(枚举)
- UVA.725 Division (暴力)
- Uva 725 Division (技巧暴力)
- UVa 725----Division(枚举)
- Uva 725 Division(简单枚举)
- UVa 725 Division 【暴力入门】
- UVa 725 Division(暴力求解)
- uva 725 Division 简单枚举
- UVA725 Division【暴力枚举】
- UVA 725 Division ( 找出 abcde / fghij = N的形式—— 暴力枚举 )
- uva 725 Division 暴力求解入门
- 音频 PCM音频编码格式详解
- GOF 23种设计模式 创建类模式 (2) 工厂方法模式
- Spring MVC防止XSS攻击
- 问题:子进程父进程哪个先执行:【转】关于 fork 和父子进程的理解 + 【转】
- 机房收费系统——子窗体最小化
- UVA - 725 Division (暴力枚举)
- POJ 3083 Children of the Candy Corn
- CF problem-56-E. Domino Principle 维护栈
- ZOJ-1257
- C++ Primer 【第四版】第八章 标准IO库
- Spring Aop实例
- 模板方法模式
- awk学习笔记
- 黑马程序员——网络编程