zoukankan      html  css  js  c++  java
  • 2014022101

    #include<stdio.h>//efg---wq*p=qefg----w
    void main()
    {
        int a, m, j, k, p, q, w[100];
        scanf("%d%d", &q, &p);
        w[1] = q;//211
        m = 0;
        k = 1;
        a = p*q;
        while (a != q)
        {
            a = w[k] * p + m;
            k++;
            w[k] = a % 10;
            m = a / 10;
        }
        for (j = k - 1; j >= 1; j--)
            printf("%d",w[j]);
        printf("
    ");
    }
    
    #include<stdio.h>//统计n阶乘中数字p的个数
    void main()
    {
        int n, p, a, m, i, j, k, w[2000], s;
        scanf("%d%d", &n, &p);
        w[0] = 1;
        k = 0;
        for (i = 1; i <= n; i++)
        {
            m = 0;
            for (j = 0; j <= k; j++)
            {
                a = w[j] * i + m;
                w[j] = a % 10;
                m = a / 10;
            }
            while (m > 0)
            {
                k++;
                w[k] = m % 10;
                m = m / 10;
            }
        }
        for (s = 0, i = k; i >= 0; i--)
        {
            printf("%d", w[i]);
            if (w[i] == p)
                s++;
        }
        printf("
    %d
    ", s);
    }
    
    #include<stdio.h>
    void main()
    {
        int a, b, p, c, n, t, f;
        scanf("%d", &t);
        while (t--)
        {
            scanf("%d", &p);
            c = 0;
            n = 0;
            f = 1;
            while (c != 0 || f != 0)
            {
                a = c * 10 + 1;
                c = a%p;
                b = a / p;
                n++;
                if (f == 1 && b == 0)
                    continue;
                printf("%d", b);
                f = 0;
            }
            printf("%d
    ", n);
        }
    }
    
    #include<stdio.h>
    #include<string.h>
    void main()
    {
        int a, b, p, c, len, m, k, f;
        char buff[10];
        scanf("%d", &p);
        c = 1;
        m = 1;
        f = 0;
        while (c != 0)
        {
            m++;
            sprintf(buff, "%d", m);
            len = strlen(buff);
            k = 0;
            while (k < len)
            {
                a = c * 10 + (buff[k] - '0');
                k++;
                c = a%p;
                b = a / p;
                if (f == 0 && b == 0)
                    continue;
                f = 1;
                printf("%d", b);
            }
        }
        printf("%d
    ", m);
    }
  • 相关阅读:
    1017.陶陶装苹果
    1084.爬楼梯加强版
    1056.A ^ B Problem 快速幂算法。
    1074.我们喜欢递归的斐波那契数列
    1073.我们喜欢递归的阶乘
    1046 没过
    python 基本常用数据类型
    yii2.0 数据库查询操作
    python 随便笔记
    搭建自己的koa+mysql后台模板
  • 原文地址:https://www.cnblogs.com/yuanqi/p/3560201.html
Copyright © 2011-2022 走看看