uva 725Division
来源:互联网 发布:软件业务需求分析 编辑:程序博客网 时间:2024/06/06 11:10
Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0through 9 once each, such that the first number divided by the second is equal to an integer N, 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 integer N. 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 of N by a blank line.
Sample Input
61620
Sample Output
There are no solutions for 61.79546 / 01283 = 6294736 / 01528 = 62
根据 除数暴力,第一次写的很乱,看了别人的题解感觉很简洁。
#include <iostream>#include<cstdio>#include<cstring>using namespace std;int a[10];int judge(int x){ int y; while(x) { y=x%10; x=x/10; a[y]++; } return 0;}int main(){ int n,m; int num=0; while(scanf("%d",&n)!=EOF && n) { if(num) printf("\n"); num++; m=0; int flag=0; for(int i=0;i<10;i++) for(int j=0;j<10;j++) if(i!=j) for(int k=0;k<10;k++) if(i!=k && j!=k) for(int x=0;x<10;x++) if(i!=x && j!=x && k!=x) for(int y=0;y<10;y++) if(i!=y && j!=y && k!=y && x!=y) { int cnt=0; memset(a,0,sizeof(a)); a[i]=1; a[j]=1; a[k]=1; a[x]=1; a[y]=1; m=y+x*10+k*100+j*1000+i*10000; int s=m*n; judge(s); for(int i=0;i<10;i++) if(a[i]==1) cnt++; if(cnt==10) { flag=1; printf("%05d / %05d = %d\n",s,m,n); } } if(!flag) printf("There are no solutions for %d.\n",n); } return 0;}
#include<cstdio>#include<iostream>#include<cstring>using namespace std;int a[10];int judge(int x,int y){ if(y>98765) return 0; memset(a,0,sizeof(a)); if(x<10000) a[0]=1; while(x) { a[x%10]++; x=x/10; } while(y) { a[y%10]++; y=y/10; } int cnt=0; for(int i=0;i<10;i++) if(a[i]==1) cnt++; if(cnt == 10) return 1; else return 0;}int main(){ int n; int num=0; while(scanf("%d",&n)!=EOF && n) { if(num) printf("\n"); num++; int flag=0; for(int i=1234;i<=98765;i++) { if(judge(i,i*n)) { flag=1; printf("%05d / %05d = %d\n",i*n,i,n); } } if(!flag) printf("There are no solutions for %d.\n",n); }}
0 0
- 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
- uva 725 - Division
- Uva - 725 - Division
- UVA - 725 Division
- uva 725 Division
- 除法(Division, UVa 725)
- UVA 725 Division
- UVA 725 - Division
- UVa 725----Division(枚举)
- linux定时任务的设置
- js的表达式,运算符,与优先级
- PAT 1017 A除以B (大数相除)
- Linux命令(7)
- Access restriction: The method createJPEGEncoder(OutputStream) from the type JPEGCodec is not access
- uva 725Division
- 找出字符串中第一个只出现一次的字符
- java 遍历MAP
- C++: std::string 与 Unicode 如何结合?
- Zoj3201 Tree of Tree 树形DP
- 欢迎使用CSDN-markdown编辑器
- Java中的动态绑定和静态绑定
- 将一个或多个OC对象写入文件/从文件读出
- 在Windows上编译V8 javascript引擎