zoukankan      html  css  js  c++  java
  • UVA 725 – Division

    Description

    Download as PDF
     

    Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 through 9 once each, such that the first number divided by the second is equal to an integer N, where $2
le N le 79$. 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 for N.". Separate the output for two different values of N by a blank line.

    Sample Input 

    61
    62
    0
    

    Sample Output 

    There are no solutions for 61.
    
    79546 / 01283 = 62
    94736 / 01528 = 62
    

    Miguel Revilla
    2000-08-31
    从1234到99999枚举一遍就行了。。
    #include<stdio.h>
    int number[15];
    int check(int a, int b){
        if(a > 98765)return 0;
        for(int i=0;i< 10;i++){
            number[i] = 0;
        }
        if(b<10000)number[0] = 1;
        while (a){
            number[a%10] = 1;
            a /= 10;
        }
        while (b){
            number[b%10] = 1;
            b /= 10;
        }
        int sum = 0;
        for (int i=0; i<10; i++)
            sum += number[i];
        return sum == 10;
    }
    int main() {
        int ans, cnt = 0;
        while (scanf("%d", &ans) == 1, ans) {
            if (cnt++) printf("
    ");
            int flag = 0;
            for (int i = 1234;i<99999;i++){
                if (check(i*ans,i)){
                    printf("%05d / %05d = %d
    ", i * ans, i, ans);
                    flag = 1;
                }
            }
            if (!flag) {
                printf("There are no solutions for %d.
    ",ans);
            }
        }
        return 0;
    }
    View Code
  • 相关阅读:
    python:HTML转义
    Python 安装 MySQLdb
    C# 获取当前路径方法
    配置 vim Python IDE 开发环境
    python:HTML转义
    Python list去重
    源码探秘
    加号的作用
    多态练习
    在web service用Cache要导入System.Web.HttpRuntime
  • 原文地址:https://www.cnblogs.com/demodemo/p/4690560.html
Copyright © 2011-2022 走看看