Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits0through9once each, such that the first 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 of the numerals is allowed to be zero.
Input
Each line of the input file consists of a valid integerN. An input of zero is to terminate the program.
Output
Your program have to display ALL qualifying pairs of numerals, sorted by increasing 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 must write ``There are no solutions forN.". Separate the output for two different values ofNby a blank line.
Sample Input
61 62 0
Sample Output
There are no solutions for 61. 79546 / 01283 = 62 94736 / 01528 = 62
#define RUN #ifdef RUN #include <stdio.h> #include <stdlib.h> #include <string.h> #include <assert.h> #include <string> #include <iostream> #include <sstream> #include <map> #include <set> #include <vector> #include <list> #include <cctype> #include <algorithm> #include <utility> #include <math.h> using namespace std; #define MAXN 1000 bool check(int a, int b){ int repeat[11] = {0}; if(a < 10000){ repeat[0]++; } if(b < 10000){ repeat[0]++; } if(repeat[0] > 1){ return false; } while(a != 0){ int remain = a % 10; if(repeat[remain] != 0){ return false; } repeat[remain]++; a /= 10; } while(b != 0){ int remain = b % 10; if(repeat[remain] != 0){ return false; } repeat[remain]++; b /= 10; } return true; } void play(int n){ int fghij = 1234; int abcde = n * fghij; bool found = false; for(; abcde<100000; ++fghij){ abcde = n * fghij; if(check(abcde, fghij)){ found = true; //自动补零 printf("%05d / %05d = %d\n", abcde, fghij, n); } } if(!found){ printf("There are no solutions for %d.\n", n); } } int main(){ #ifndef ONLINE_JUDGE freopen("725.in", "r", stdin); freopen("725.out", "w", stdout); #endif int n; // 有用的技巧来避免结尾多输出一空行 bool blank = false; while(scanf("%d",&n)==1 && n){ if(blank){ printf("\n"); } play(n); blank = true; } } #endif
相关推荐
判断输入字符串是否为镜像或回文串。 来源于UVaOJ - 401. 水题。
开源项目-codingsince1985-UVa#uva-online-judge-solutions-in-golang.zip,两年来每天都在解决一个uva在线裁判问题,算起来…
uva705 Slash Maze 的代码,在UVaOJ上通过
PDF试题
uva532 Dungeon Master的源代码,并且AC了
Algorithm-UVA-Solutions-in-Python.zip,python 3中各种uva(acm)问题的解决方案。,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
这是UVA133 TheDoleQueue救济金发放问题,经典的算法问题。初学算法的人要对这种算法非常熟悉并且能熟练运用。
tpcw-nyu-uva-client 客户端
leetcode 2 算法-Java UVa Online Judge(ACM-ICPC Live ...使用:数组、哈希表、链表、二分搜索、动态规划、堆栈、堆、reedy、排序、树 DFS、BFS、图、二分搜索树、递归、记忆、队列、映射等。...Uva-ACM-ICPC