zoukankan      html  css  js  c++  java
  • 实验4-1-12 黑洞数

    #include <stdio.h>
    
    int max(int a, int b);
    int min(int a, int b);
    int main(void)
    {
        int num, a, b, c;
        int t, maxNum, midNum, minNum;
        int big, small, i;
    
        scanf("%d", &num);
    
        i = 1;
        do
        {
            //分离百十个
            a = num / 100;
            b = num % 100 / 10;
            c = num % 10;
            t = a + b + c;
    
            maxNum = max(max(a, b), c);
            minNum = min(min(a, b), c);
            midNum = t - maxNum - minNum;
    
            big = maxNum * 100 + midNum * 10 + minNum;
            small = minNum * 100 + midNum * 10 + maxNum;
            num = big - small;
    
            printf("%d: %d - %d = %d
    ", i, big, small, num);
    
            i++;
        } while (num != 495);
    
        return 0;
    }
    
    int max(int a, int b)
    {
        int ret = a;
        if (b > a)
        {
            ret = b;
        }
    
        return ret;
    }
    
    int min(int a, int b)
    {
        int ret = a;
        if (b < a)
        {
            ret = b;
        }
    
        return ret;
    }
    
  • 相关阅读:
    爬虫基础 2.1 http原理
    爬虫基础 2.1 http原理
    3.29上午
    3.28
    3.27下午
    3.27上午
    3.24上午
    3.23下午
    3.23上午
    3.22上午
  • 原文地址:https://www.cnblogs.com/2018jason/p/13061741.html
Copyright © 2011-2022 走看看