牛客网语法篇刷题(C语言) — 运算

秒速五厘米 2024-04-17 06:18 89阅读 0赞

> **作者主页：**paper jie的博客\_CSDN博客-C语言,算法详解领域博主
> 
> **本文作者：**大家好，我是paper jie，感谢你阅读本文，欢迎一建三连哦。
> 
> **本文录入于**《C语言-语法篇》专栏，本专栏是针对于大学生，编程小白精心打造的。笔者用重金(时间和精力)打造，将C语言基础知识一网打尽，希望可以帮到读者们哦。
> 
> **其他专栏：**《C语言》《算法详解》《C语言系统详解》
> 
> **内容分享：**本期将用C语言对牛客网的语法篇运算行进行具体讲解，各位看官姥爷快搬好小板凳坐好叭。
> 
>  \-------- 不要998，不要98，只要一键三连，三连买不了吃亏，买不了上当

**目录**

?题目链接

?第一题

?第二题

?第三题

?第四题

?第五题

✨第六题

?第七题

?第八题

?第九题

?第十题

?第十一题

⚽第十二题

?第十三题

⚾第十四题

?第十五题

?第十六题

?第十七题

?第十八题

?第十九题

?第二十题

?第二十一题

?第二十二题

?第二十三题

?第二十四题

?第二十五题

--------------------

## ?题目链接 ##

[牛牛买电影票\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com]

[计算带余除法\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 1]

[整数的个位\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 2]

[整数的十位\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 3]

[开学？\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 4]

[时间转换\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 5]

[2的n次方计算\_牛客题霸\_牛客网 (nowcoder.com)][2_n_ _nowcoder.com]

[你能活多少秒\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 6]

[统计成绩\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 7]

[计算三角形的周长和面积\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 8]

[KiKi和酸奶\_牛客题霸\_牛客网 (nowcoder.com)][KiKi_ _nowcoder.com]

[温度转换\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 9]

[牛牛的圆\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 10]

[牛牛的并联电路\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 11]

[牛牛的水杯\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 12]

[牛牛的等差数列\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 13]

[牛牛的球\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 14]

[小乐乐定闹钟\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 15]

[小乐乐排电梯\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 16]

[小乐乐与欧几里得\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 17]

[小乐乐改数字\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 18]

[KiKi算期末成绩\_牛客题霸\_牛客网 (nowcoder.com)][KiKi_ _nowcoder.com 1]

[(a+b-c)\*d的计算问题\_牛客题霸\_牛客网 (nowcoder.com)][a_b-c_d_ _nowcoder.com]

[牛牛的线段\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 19]

[kiki算数\_牛客题霸\_牛客网 (nowcoder.com)][kiki_ _nowcoder.com]

--------------------

## ?第一题 ##

![450b3e6208234086af3c8624b9e6e715.png][]

#include <stdio.h>
    
    int main()
    {
        int n = 0;
        //输入朋友的人数
        scanf("%d", &n);
        //计算总价钱
        int money = n * 100;
        //打印出来
        printf("%d\n", money);
        return 0;
    }

## ?第二题 ##

![955fe774eb96440588e95303eb2d2ae1.png][]

#include <stdio.h>
    
    int main()
    {
    	int a = 0;
    	int b = 0;
    	//输入两个整数 
    	scanf("%d%d", &a, &b);
    	//商 a/b   余数  a%b
    	printf("%d %d\n", a/b, a%b);
    	return 0;
    }

## ?第三题 ##

![b4c19f2267d64f93b45467097317f717.png][]

#include <stdio.h>
    
    int main()
    {
        int a = 0;
        scanf("%d", &a);
        //a除以10的余数就是a的个位数
        printf("%d", a%10);
        return 0;
    }

## ?第四题 ##

![af0d2df59d6242629bcfd2331449fb6f.png][]

#include <stdio.h>
    
    int main()
    {
        int a = 0;
        scanf("%d", &a);
        //a/10得到的商再除以10的余数就是十位
        printf("%d\n", (a/10)%10);
        return 0;
    }

## ?第五题 ##

![c355e899288a4dcaa11b8f38391f5225.png][]

#include <stdio.h>
    
    int main()
    {
        int a = 0;
        int b = 0;
        int c = 0;
        scanf("%d%d", &a, &b);
        //7天为一个循环
        c =(a+b)%7;
        //如果c==0 就是星期天，给c一个7
        if(c==0)
        c=7;
        printf("%d\n", c);
        return 0;
    }

## ✨第六题 ##

![ac2cb79a53704b8fbd23113f2a71d0a8.png][]

#include <stdio.h>
    
    int main()
    {
        int seconds = 0;
        scanf("%d", &seconds);
        //小时 除3600取整
        int t = seconds / 3600;
        //分钟 小时剩下的余数除60取整
        int m = (seconds%3600) / 60;
        //秒 直接对总秒数去60的模数
        int s = seconds % 60;
        printf("%d %d %d\n", t, m, s);
        return 0;
    }

## ?第七题 ##

![5012e159f62f421b85c07ec576e8dfe4.png][]

#include <stdio.h>
    
    int main()
    {
        int n = 0;
        scanf("%d", &n);
        int a = 2;
        //2的二进制00000010
        //因为2已经是2^1 所以是左移n-1
        printf("%d\n", a<<(n-1));
        return 0;
    }

## ?第八题 ##

![7e1eb80c417e42ea8d91449930a40149.png][]

#include <stdio.h>
    
    int main()
    {
        int age = 0;
        scanf("%d", &age);
        long long s = age*31560000;
        //因为age*一年的时间会特别特别大，int类型可能存不下所以换成long long类型
        printf("%lld\n", s);
        return 0;
    }

## ?第九题 ##

![42e4a6fb9bb44a98895b5c35a0c6d99f.png][]

#include <stdio.h>
    
    int main()
    {
        int n = 0;
        scanf("%d", &n);
        //用三个变量放最小数 最大数 和
        float max = 0.0f;
        //用数组放各科成绩 
        float min = 100.0f;
        float arr[100] = {0.0f};
        float sum = 0.0f;
        int i = 0;
        //循环输入成绩
        for(i=0; i<n; i++)
        {
            scanf("%f", &arr[i]);
        }
        for(i=0; i<n; i++)
        {
            //大于max 将值给max
            if(max<arr[i])
            max = arr[i];
            //小于min 将值给min
            if(min>arr[i])
            min = arr[i];
            sum+=arr[i];
        }
        //注意保留两位小数
        printf("%.2f %.2f %.2f\n", max, min, sum/n);
        return 0;
    }

## ?第十题 ##

![301e6dfd2a67499c908e5604e86fe710.png][]

#include <stdio.h>
    //要使用sqrt这个开平方的库函数，得用头文件 math.h
    #include <math.h>
    int main()
    {
        int a = 0;
        int b = 0;
        int c = 0;
        scanf("%d%d%d", &a, &b, &c);
        //求长度 因为要有小数 我们将它放在float中
        float len = a + b + c;
        float p = len/2;
        //求三角形的面积 海伦公式
        //s = p（p（p-a）(p-b)（p-c））
        float area = sqrt(p*(p-a)*(p-b)*(p-c));
        printf("circumference=%.2f area=%.2f\n", len, area);
        return 0;
    }

## ?第十一题 ##

![36d3382010bd400dbf0ba222ba52c405.png][]

#include <stdio.h>
    
    int main()
    {
        //酸奶总数
        int n = 0;
        //一瓶的时间
        int min = 0;
        //经历多少分钟
        int m = 0;
        scanf("%d%d%d", &n, &min, &m);
        int a = m/min + 1;
        //如果刚好时间到，手上的也刚好喝完 就要-1
        if(m%min==0)
        a-=1;
        printf("%d\n", n-a);
        return 0;
    }

## ⚽第十二题 ##

![b40025288e234d5481206849543abdd6.png][]

#include <stdio.h>
    
    int main()
    {
        float f = 0.0f;
        scanf("%f", &f);
        //这里要注意要保留小数的 就得加上 .0这样就是转化为浮点数计算
        float c = 5.0/9*(f-32);
        //保留两位小数
        printf("%.3f\n", c);
        return 0;
    }

## ?第十三题 ##

![bd6617f294bc4bb8adf43366baa28278.png][]

#include <stdio.h>
    
    int main()
    {
        int r = 0;
        scanf("%d", &r);
        //圆的面积 派 * R ^ 2
        float area = 3.14*r*r;
        printf("%f", area); 
        return 0;
    }

## ⚾第十四题 ##

![c8ab1de7fc6e4e9b87f376efa6b3f361.png][]

#include <stdio.h>
    
    int main()
    {
        int r1 = 0;
        int r2 = 0;
        scanf("%d%d", &r1, &r2);
        //注意类型转换 int->float
        float r = 1.0/((1.0/r1)+(1.0/r2));
        printf("%f\n", r);
        return 0;
    }

## ?第十五题 ##

![b97e164acbde4efb8a628afc9ae89793.png][]

#include <stdio.h>
    //方法一
    // int main()
    // {
    //     int h = 0;
    //     int r = 0;
    //     scanf("%d%d", &h, &r);
    //     //计算体积 因为有3.14 用float存放
    //     float v = 3.14 * h * r*r;
    //     //用t计多少杯
    //     int t = 0;
    //     //10升=10000毫升 因为c要-v 所以用float类型
    //     float c = 10000.0;
    //     //只要10升水还没喝完就进入循环
    //     while(c>0)
    //     {
    //         //喝一次剪掉一次水
    //         c=c-v;
    //         //一次循环加一次
    //         t++;
    //     }
    //     printf("%d\n", t);
    //     return 0;
    // }
    
    int main()
    {
        int h = 0;
        int r = 0;
        scanf("%d%d", &h, &r);
        float v = 3.14 * h * r*r;
        //int a是整型 保留了10000/v的整数
        int a = 10000/v;
        //要是10000/浮点数v 不等于a 就是有小数 就要加一
        if(10000/v!=a)
        a++;
        printf("%d\n", a);
        return 0;
    }

## ?第十六题 ##

![19041673a3c94c34a42bfb1c281f0eb7.png][]

#include <stdio.h>
    
    int main()
    {
        int a = 0;
        int b = 0;
        scanf("%d%d", &a, &b);
        //An = a1+（n-1）d
        int a3 = a+(3-1)*(b-a);
        printf("%d\n", a3);
        return 0;
    }

## ?第十七题 ##

![2e828247d7e74e779dfba983ac92f7dd.png][]

#include <stdio.h>
    
    int main()
    {
        int r = 0;
        scanf("%d", &r);
        //球的体积求法：4/3 * 3.14 * R^3
        float v = 4.0/3*3.14*r*r*r;
        //要注意是浮点数
        printf("%f\n", v);
        return 0;
    }

## ?第十八题 ##

![ce7d5a0a091f4f8c93abf788c07c7ad1.png][]

#include <stdio.h>
    
    int main()
    {
        int t = 0;
        int m = 0;
        int mine = 0;
        scanf("%d:%d %d", &t, &m, &mine);
        //超过24小时就要清零 所以我们要%24
        t = (t+(mine+m)/60)%24;
        m = (mine+m)%60;
        //位数不够要前导0补齐 我们就要用%02d 如果只有一位数第一个空格补零
        printf("%02d:%02d\n", t, m);
        return 0;
    }

## ?第十九题 ##

![9c8b149434924e908bec6c04ad73ca4f.png][]

#include <stdio.h>
    
    int main()
    {
        int n = 0;
        scanf("%d", &n);
        //用总人数除除12*4 多出的的人加上乐乐也只要2分钟
        int mine = (n/12)*4+2;
        printf("%d", mine);
        return 0;
    }

## ?第二十题 ##

![e3cfae22bc0649b2ae1f8506f0c3686f.png][]

#include <stdio.h>
    
    int main()
    {
        // n m可能很大，我们用long long类型
        long long  n = 0;
        long long  m = 0;
        scanf("%lld%lld", &n, &m);
        long long a = n;
        long long b = m;
        //转转相除法
        while (n % m)
        {
            int tmp = n;
            n = m;
            m = tmp % m;
        }
        long long max = m;
        //最小公倍数=两数相乘再除最大公因数
        long long  min = (a*b)/max;
        printf("%lld\n", max + min);
        return 0;
    }

## ?第二十一题 ##

![80414cf96dc9439ea2668c6a6102a3f1.png][]

#include <stdio.h>
    
    int main()
    {
        int n = 0;
        scanf("%d", &n);
        int sum = 0;
        int i = 1;
        while(n)//n除完最后一位数就跳出
        {
            if(n%10%2==0)//每一位数%2为0就是偶数
                sum+=0;//为0
            else //不然就是奇数
                sum+=1*i;//1*i i就是它的权重
            n=n/10;//通过这个可以让每一个数变成个位数
            i*=10;//每过一次循环，权重就*10
        }
        printf("%d\n", sum);
        return 0;
    }

## ?第二十二题 ##

![b116a453e84545f3a75c840febfd50a0.png][]

#include <stdio.h>
    
    int main()
    {
        int a = 0;
        int b = 0;
        int c = 0;
        int d = 0;
        scanf("%d%d%d%d", &a, &b, &c, &d);
        //将总成绩相加
        float score = a*0.2+b*0.1+c*0.2+d*0.5;
        //主要要求保留一位小数
        printf("%.1f\n", score);
    
        return 0;
    }

## ?第二十三题 ##

![ae6b05eb73d14a71bc9b908b298254b3.png][]

#include <stdio.h>
    
    int main()
    {
        int a = 0;
        int b = 0;
        int c = 0;
        int d = 0;
        scanf("%d%d%d%d", &a, &b, &c, &d);
        printf("%d\n", (a+b-c)*d);
        return 0;
    }

## ?第二十四题 ##

![5b799710c77c45bdb6c6c1483f38a87d.png][]

#include <stdio.h>
    #include <math.h>
    int main()
    {
        int x1 = 0;
        int x2 = 0;
        int y1 = 0;
        int y2 = 0;
        scanf("%d %d\n", &x1, &y1);
        scanf("%d %d\n", &x2, &y2);
        //pow是库函数 == n^m 参数1是n 参数2是m
        //要记得引用头文件
        int r1 = pow(x1-x2, 2);
        int r2 = pow(y1-y2, 2);
        printf("%d\n", r1+r2);
        return 0;
    }

## ?第二十五题 ##

![225a9af0830b4d14afcbd55df81a83f3.png][]

#include <stdio.h>
    
    int main()
    {
        int a = 0;
        int b = 0;
        scanf("%d%d", &a, &b);
        int c = a+b;
        //如果大于等于100就进去不然就不进去
        if(c>=100)
        {
            //>=100时取余数
            c=c%100;
        }
        printf("%d\n", c);
        return 0;
    }

--------------------

[_nowcoder.com]: https://www.nowcoder.com/practice/0ad8f1c0d7b84c6d8c560298f91d5e66?tpId=290&tqId=2367255&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 1]: https://www.nowcoder.com/practice/34d3911bf2fd48a285f6396e886a1259?tpId=290&tqId=292276&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 2]: https://www.nowcoder.com/practice/1c0ce3c9134f45edbcd4343f9d5e320a?tpId=290&tqId=308928&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 3]: https://www.nowcoder.com/practice/031db23916904f4fad72198fe491b47b?tpId=290&tqId=308929&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 4]: https://www.nowcoder.com/practice/9cc35bd0754f4feca18e10e57c672467?tpId=290&tqId=967208&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 5]: https://www.nowcoder.com/practice/c4ae7bcac7f9491b8be82ee516a94899?tpId=290&tqId=292281&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[2_n_ _nowcoder.com]: https://www.nowcoder.com/practice/35a1e8b18658411388bc1672439de1d9?tpId=290&tqId=292287&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 6]: https://www.nowcoder.com/practice/e1d1bd99fee34b66ae3c777b74d555c8?tpId=290&tqId=292280&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 7]: https://www.nowcoder.com/practice/cad8d946adf64ab3b17a555d68dc0bba?tpId=290&tqId=320955&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 8]: https://www.nowcoder.com/practice/109a44d649a142d483314e8a57e2c710?tpId=290&tqId=292284&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[KiKi_ _nowcoder.com]: https://www.nowcoder.com/practice/c7721f3a1b1a47a783974453e82cadbb?tpId=290&tqId=292288&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 9]: https://www.nowcoder.com/practice/ba83647087b7447783fa2384da6b3d44?tpId=290&tqId=308992&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 10]: https://www.nowcoder.com/practice/75a202e826d048a39824ec694b5ce7e3?tpId=290&tqId=2367298&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 11]: https://www.nowcoder.com/practice/6e13936b6fc54f52ac22efd6c8e7fef3?tpId=290&tqId=2367375&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 12]: https://www.nowcoder.com/practice/c196c47c23394bf3bdd4f82a838df6bf?tpId=290&tqId=2367414&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 13]: https://www.nowcoder.com/practice/fb9daba67b88437a9e501adf020d425e?tpId=290&tqId=2367495&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 14]: https://www.nowcoder.com/practice/203ca3114f8845a9bbd673bae6c5dd2b?tpId=290&tqId=2367592&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 15]: https://www.nowcoder.com/practice/0f7e422e12be4a7f9958ca2a82abc775?tpId=290&tqId=632014&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 16]: https://www.nowcoder.com/practice/0f855c7642b74cccb3c2366bb7732d2a?tpId=290&tqId=632015&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 17]: https://www.nowcoder.com/practice/da13e0cf321e4df9acd0fdf0a433cbb0?tpId=290&tqId=632016&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 18]: https://www.nowcoder.com/practice/fcd30aac9c4f4028b23919a0c649824d?tpId=290&tqId=632017&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[KiKi_ _nowcoder.com 1]: https://www.nowcoder.com/practice/4ef07b4f80fc4027a4b90e2245f8f637?tpId=290&tqId=828859&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[a_b-c_d_ _nowcoder.com]: https://www.nowcoder.com/practice/9df4b80fc3ab475288e5c26972440e1b?tpId=290&tqId=320950&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[_nowcoder.com 19]: https://www.nowcoder.com/practice/f72c56ed71664af082c921bf79861c85?tpId=290&tqId=2367473&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[kiki_ _nowcoder.com]: https://www.nowcoder.com/practice/bcaf710fb58a44e1b678a890e6e90d7c?tpId=290&tqId=292278&ru=/exam/oj&qru=/ta/beginner-programmers/question-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[450b3e6208234086af3c8624b9e6e715.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/2076823f035c47cf9c81a6691575741a.png
[955fe774eb96440588e95303eb2d2ae1.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/ce81358c147644be8830a801719a6de5.png
[b4c19f2267d64f93b45467097317f717.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/b04ad25891154e4791e49a687557b627.png
[af0d2df59d6242629bcfd2331449fb6f.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/3539291328c94ee1a66527415501a1dc.png
[c355e899288a4dcaa11b8f38391f5225.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/d2141a711b3c40d38560b24f953b2fa9.png
[ac2cb79a53704b8fbd23113f2a71d0a8.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/b7d7e9147949479287354cd67bd82807.png
[5012e159f62f421b85c07ec576e8dfe4.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/4bcf07e22e11416e80408717e816da3c.png
[7e1eb80c417e42ea8d91449930a40149.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/1c2140fb907a460eaf0e627bf1b0acee.png
[42e4a6fb9bb44a98895b5c35a0c6d99f.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/97508f79cb314d05a2f1a12366ee251c.png
[301e6dfd2a67499c908e5604e86fe710.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/5b98a6598629401db0c38769c27a46f0.png
[36d3382010bd400dbf0ba222ba52c405.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/39f6dc30622d4a6a8d0df9ad61ba04f8.png
[b40025288e234d5481206849543abdd6.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/90199bd371784a6c847c7dbd7d903dea.png
[bd6617f294bc4bb8adf43366baa28278.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/c669e085d9454b0cabe0537630cf70c7.png
[c8ab1de7fc6e4e9b87f376efa6b3f361.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/967ce4818e7e4318829ceabb520e684e.png
[b97e164acbde4efb8a628afc9ae89793.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/ab38fc496b634e54aa7908053ee4cf6e.png
[19041673a3c94c34a42bfb1c281f0eb7.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/95003aef4dd04705befabeffe5dd812b.png
[2e828247d7e74e779dfba983ac92f7dd.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/8d3834360fae45f2bb69d5c13f6d1a32.png
[ce7d5a0a091f4f8c93abf788c07c7ad1.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/b8ea5ffe8af64a79a8eeecbe5966d79c.png
[9c8b149434924e908bec6c04ad73ca4f.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/2a1cded0283448969d026ed59fb8db9c.png
[e3cfae22bc0649b2ae1f8506f0c3686f.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/520d6a01b1704f81a43d17005f321e55.png
[80414cf96dc9439ea2668c6a6102a3f1.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/8a40387854aa4064bdb5c4cbe600dff6.png
[b116a453e84545f3a75c840febfd50a0.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/5c67e313913e46989db466b01bf1a606.png
[ae6b05eb73d14a71bc9b908b298254b3.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/3e4fa2f63a994d6f89b025404f5685dd.png
[5b799710c77c45bdb6c6c1483f38a87d.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/bc8b695533774ae2b188f5270fc0e627.png
[225a9af0830b4d14afcbd55df81a83f3.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/15/ea8108ec902a4c4da79730331aeefc2b.png