牛客网C语言语法篇练习之习题集（4）

￡神魔★判官ぃ 2023-09-29 13:13 24阅读 0赞

![b09299aa24f14dea8eb1bafa8a87103f.png][] ![19f311a312b3446687cc0cc306961304.png][]

**目录**

1.箭形图案（控住输出这个图案）

2.反斜线形图案(简单的输出一个斜线)

3.班级成绩输入输出(成绩输入，然后再输出成绩和成绩的和，两种方法来做一下）

4.矩阵元素定位(二维数组里面找数字)

5. 有序序列判断（数组排序）

6.有序序列插入一个整数（插入第三者）

7.序列中删除指定数字(删除第三者)

8. 序列中整数去重(找出真假，留真，去假)

9.筛选法求素数（就是加强版的找素数）

10. 最高身高（二维数组里面找最大的数）

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

**时隔一周时间，我又开始刷题了（没错，我其实是偷懒了一周时间），现在牛客网语法篇大概还有70道题，这块刷完后，就去力扣上用Java再刷一些题**

**我认为刷题这件事，是学习途中很有必要的一件事，也值得坚持下去，**

**既提升自己的算法水平，更提高自己写代码的能力。**

**所以看到这里的小伙伴，如果你还没有开始刷题，请赶快开始刷题吧，**

**如果你已经开始刷题了，请继续坚持下去。**

下面开始正文

## 1.箭形图案（控住输出这个图案） ##

链接 [箭形图案\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com]

![573bfc9a6d2b447b8c283dc0b6a13c0f.png][]

分析一下吧

![bfc618e0a9304b37906df5c39c105271.png][]

上代码，自己看一下，和你想的一样不

#include<stdio.h>
    
    int main()
    {
        int n = 0;
        while(~scanf("%d",&n))
        {
            int i=0,j=0;
            //上半部分
            for(i=0;i<=n;i++)
            {
                for(j=0;j<n-i;j++)
                {
                    printf("  ");
                }
                for(j=0;j<=i;j++)
                {
                    printf("*");
                }
                printf("\n");
            }
            //下半部分
           for(i=0;i<n;i++)
           {
               for(j=0;j<=i;j++)
               {
                   printf("  ");
               }
               for(j=0;j<n-i;j++)
               {
                   printf("*");
               }
               printf("\n");
           }  
        }
        return 0;
    }

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

## 2.反斜线形图案(简单的输出一个斜线) ##

链接 [反斜线形图案\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 1]

![9a1c09f2b8f64e40b531e6f09fefe9f9.png][]

这道题不难，但我把这道题放在这里的原因是，

我写的虽然是正确的跑过去了，但在我看了别人的代码后，发现我写的代码有点长，

所以是想提醒大家，有时候**做完题后可以看看别人代码，找找差距。**

好了简单的看一下解析和代码吧

![c9b019c72d3a4f4c91f247fe85d83baf.png][]

#include<stdio.h>
    
    int main()
    {
        int n = 0;
        while (~scanf("%d", &n))
        {
            int i = 0, j = 0;
            for (i = 1; i <= n; i++)
            {
                for (j = 1; j <= i; j++)
                {
                    if (j != 1)
                    {
                         printf(" ");
                    }
                    if (i == j)
                    {
                        printf("*\n");
                    }
                }
            }
        }
        return 0;
    }

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

## 3.班级成绩输入输出(成绩输入，然后再输出成绩和成绩的和，**两种方法来做一下**） ##

链接 [班级成绩输入输出\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 2]

![6d7c230059e6466e8c298197904d21d1.png][]

![aaf24d2e34454361973746b5e67f9606.png][]

下面先看第一个方法

![20bce7ac2d70430c9e5171c7151e1767.png][]![0a0f0e55a9544fb28d84cfed1107ac1c.png][]

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

## 4.矩阵元素定位(二维数组里面找数字) ##

链接 [矩阵元素定位\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 3]

![eec65fa6dc144de498339d0d0a78e511.png][]

![0325a3dbe3df4cdfacb7d54807d7f3c3.png][]

#include<stdio.h>
    
    int main()
    {
        int n,m,x,y;
        int arr[15][15]={0};
        scanf("%d %d\n",&n,&m);
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                scanf("%d ",&arr[i][j]);
            }
        }
        scanf("%d %d",&x,&y);
        printf("%d",arr[x-1][y-1]);
        return 0;
    }

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

## 5. 有序序列判断（数组排序） ##

链接 [有序序列判断\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 4]

![e33463a3d2cf4cbcbf1560f23403032b.png][]

分析一下

![4b9a6cc7a4ce4e9f920b053b2499aa43.png][]

#include<stdio.h>
    
    int main()
    {
        int n = 0,flag1=0,flag2=0;
        scanf("%d",&n);
        int a[50]={0};
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            if(i>0)
            {
                if(a[i-1]>a[i]){
                    flag1 = 1;
                }else if(a[i-1]<a[i]){
                    flag2 = 1;
                }
            }
        }
        if(flag1&&flag2){
            printf("unsorted\n");
        }else{
            printf("sorted\n");
        }
        return 0;
    }

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

## 6.有序序列插入一个整数（插入第三者） ##

链接 [有序序列插入一个整数\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 5]

![780ee6a2de834ec2953c54aa74ad7491.png][]

![05c493dbbfca4395a64b0168f0c858c5.png][]

#include<stdio.h>
    int main()
    {
        int n,i,a,j;
        int arr[50] = { 0 };
        scanf("%d", &n);
        for (i = 1; i <= n; i++)
        {
            scanf("%d", &arr[i]);
        }
        scanf("%d", &a);
        for (i = 1; i <= n + 1; i++)
        {
            if (a < arr[i]||i==n+1) {
                for (j = 0; j < i; j++) {
                    arr[j] = arr[j + 1];
                }
                arr[i-1] = a;
                break;
            }
        }
        for (i = 0; i <= n; i++) {
            printf("%d ", arr[i]);
        }
        return 0;
    }

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

## 7.序列中删除指定数字(删除第三者) ##

链接 [序列中删除指定数字\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 6]

![cdec66cf5dd54b3d865fa9c6356ed0c4.png][]

简单分析一下

![80b4789d2c9c42d78085c5acbee7fddc.png][]

看代码，和你想的一样不，哪里有区别

#include<stdio.h>
    int main()
    {
        int n,i,a,j;
        int arr[50] = { 0 };
        scanf("%d", &n);
        for (i = 0; i < n; i++)
        {
            scanf("%d", &arr[i]);
        }
        scanf("%d", &a);
        for (i = 0; i < n; i++)
        {
            if (arr[i] != a) {
               printf("%d ",arr[i]);
            }else{
                arr[i]=arr[i+1];
            }
        }
        return 0;
    }

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

## 8. 序列中整数去重(找出真假，留真，去假) ##

链接 [序列中整数去重\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 7]

![916a58bfd9444aecb2459a7769a8f9f8.png][]

分析一下

![613c7b6425584d38863771097d152159.png][]

上代码

#include<stdio.h>
    
    int main()
    {
        int n =0,i=0,j=0;
        //输出
        scanf("%d",&n);
        int arr[5000]={0};
        for(i=0;i<n;i++)
        {
            scanf("%d ",&arr[i]);
        }
        //去重
        for(i=0;i<n;i++)
        {
            for(j=i+1;j<n;j++)
            {
                if(arr[i]==arr[j])
                {//删除
                    for(int k=j;k<n-1;k++)
                    {
                        arr[k]=arr[k+1];
                    }
                    n--;
                    j--;
                }
            }
        }
         //输出
        for(i=0;i<n;i++)
        {
            printf("%d ",arr[i]);
        }
        
        return 0;
    }

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

## 9.筛选法求素数（就是加强版的找素数） ##

链接 [筛选法求素数\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 8]

![976c7d2a495a4914802a629d735d71f6.png][]

分析一下

![0e266d5df45c49daa616c2e1a45ce105.png][]

上代码

#include<stdio.h>
    
    int main()
    {
        int n = 0;
        int arr[100] = {0};
        //输入
        while(scanf("%d",&n) != EOF)
        {
            int i = 0,j = 0;
            for(i = 2 ; i <= n ; i++){
                arr[i]=i;
            }
            //筛选
            for(i=2 ; i<=n ; i++){
                for(j=2 ; j<i ; j++){
                    if(i%j == 0){
                        arr[i]=0;
                    }
                }
            }
                int ret =0;
                //输出
                for(i=2;i<=n;i++){
                if(arr[i] != 0){
                    printf("%d ",arr[i]);
                }else{
                    ret++;
                }
            }
                printf("\n%d",ret);      
        }
        return 0;
    }

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

## 10. 最高身高（二维数组里面找最大的数） ##

链接 [最高身高\_牛客题霸\_牛客网 (nowcoder.com)][_nowcoder.com 9]

![253d90c6c3e54bcea75926ab059ea24c.png][]

分析一下

![0373e169343c4268a0dbe93876937a24.png][]

上代码

#include<stdio.h>
    
    int main()
    {
        int n = 0,m = 0;
        scanf("%d %d",&n,&m);
        int arr[10][10]={0};
        int x=0,y=0,max=0;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                scanf("%d ",&arr[i][j]);
                if(max<arr[i][j])
                {
                    x=i+1;
                    y=j+1;
                    max = arr[i][j];
                }
            }    
        }
        printf("%d %d\n",x,y);
        return 0;
    }

[b09299aa24f14dea8eb1bafa8a87103f.png]: https://img-blog.csdnimg.cn/b09299aa24f14dea8eb1bafa8a87103f.png
[19f311a312b3446687cc0cc306961304.png]: https://img-blog.csdnimg.cn/19f311a312b3446687cc0cc306961304.png
[_nowcoder.com]: https://www.nowcoder.com/practice/a6d1081e0c9a42f19e42ed6cd91556c1?tpId=290&tqId=309113&ru=%2Fexam%2Foj&qru=%2Fta%2Fbeginner-programmers%2Fquestion-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[573bfc9a6d2b447b8c283dc0b6a13c0f.png]: https://img-blog.csdnimg.cn/573bfc9a6d2b447b8c283dc0b6a13c0f.png
[bfc618e0a9304b37906df5c39c105271.png]: https://img-blog.csdnimg.cn/bfc618e0a9304b37906df5c39c105271.png
[_nowcoder.com 1]: https://www.nowcoder.com/practice/7b066963c4eb4d188becd18c37dfe22d?tpId=290&tags=&title=&difficulty=0&judgeStatus=0&rp=0&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[9a1c09f2b8f64e40b531e6f09fefe9f9.png]: https://img-blog.csdnimg.cn/9a1c09f2b8f64e40b531e6f09fefe9f9.png
[c9b019c72d3a4f4c91f247fe85d83baf.png]: https://img-blog.csdnimg.cn/c9b019c72d3a4f4c91f247fe85d83baf.png
[_nowcoder.com 2]: https://www.nowcoder.com/practice/60d96b08e1cb42e38629d54e37eac008?tpId=290&tqId=618630&ru=%2Fpractice%2F3d3406f4a7eb4346b025cc592be5b875&qru=%2Fta%2Fbeginner-programmers%2Fquestion-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[6d7c230059e6466e8c298197904d21d1.png]: https://img-blog.csdnimg.cn/6d7c230059e6466e8c298197904d21d1.png
[aaf24d2e34454361973746b5e67f9606.png]: https://img-blog.csdnimg.cn/aaf24d2e34454361973746b5e67f9606.png
[20bce7ac2d70430c9e5171c7151e1767.png]: https://img-blog.csdnimg.cn/20bce7ac2d70430c9e5171c7151e1767.png
[0a0f0e55a9544fb28d84cfed1107ac1c.png]: https://img-blog.csdnimg.cn/0a0f0e55a9544fb28d84cfed1107ac1c.png
[_nowcoder.com 3]: https://www.nowcoder.com/practice/b8e6a46992fe4e11b2822b20561b6d94?tpId=290&tags=&title=&difficulty=0&judgeStatus=0&rp=0&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[eec65fa6dc144de498339d0d0a78e511.png]: https://img-blog.csdnimg.cn/eec65fa6dc144de498339d0d0a78e511.png
[0325a3dbe3df4cdfacb7d54807d7f3c3.png]: https://img-blog.csdnimg.cn/0325a3dbe3df4cdfacb7d54807d7f3c3.png
[_nowcoder.com 4]: https://www.nowcoder.com/practice/22e87f8a8d764a6582710f38d1b40c6e?tpId=290&tqId=352869&ru=%2Fpractice%2Fc9d9f9c60b4448eabc0569f80a3461bb&qru=%2Fta%2Fbeginner-programmers%2Fquestion-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[e33463a3d2cf4cbcbf1560f23403032b.png]: https://img-blog.csdnimg.cn/e33463a3d2cf4cbcbf1560f23403032b.png
[4b9a6cc7a4ce4e9f920b053b2499aa43.png]: https://img-blog.csdnimg.cn/4b9a6cc7a4ce4e9f920b053b2499aa43.png
[_nowcoder.com 5]: https://www.nowcoder.com/practice/444e87f938464906a1649cff236b102b?tpId=290&tags=&title=&difficulty=0&judgeStatus=0&rp=0&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[780ee6a2de834ec2953c54aa74ad7491.png]: https://img-blog.csdnimg.cn/780ee6a2de834ec2953c54aa74ad7491.png
[05c493dbbfca4395a64b0168f0c858c5.png]: https://img-blog.csdnimg.cn/05c493dbbfca4395a64b0168f0c858c5.png
[_nowcoder.com 6]: https://www.nowcoder.com/practice/7bbcdd2177a445a9b66da79512b32dd7?tpId=290&tags=&title=&difficulty=0&judgeStatus=0&rp=0&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[cdec66cf5dd54b3d865fa9c6356ed0c4.png]: https://img-blog.csdnimg.cn/cdec66cf5dd54b3d865fa9c6356ed0c4.png
[80b4789d2c9c42d78085c5acbee7fddc.png]: https://img-blog.csdnimg.cn/80b4789d2c9c42d78085c5acbee7fddc.png
[_nowcoder.com 7]: https://www.nowcoder.com/practice/6564a2f6e70f4153ad1ffd58b2b28490?tpId=290&tqId=352872&ru=%2Fpractice%2F7bbcdd2177a445a9b66da79512b32dd7&qru=%2Fta%2Fbeginner-programmers%2Fquestion-ranking&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[916a58bfd9444aecb2459a7769a8f9f8.png]: https://img-blog.csdnimg.cn/916a58bfd9444aecb2459a7769a8f9f8.png
[613c7b6425584d38863771097d152159.png]: https://img-blog.csdnimg.cn/613c7b6425584d38863771097d152159.png
[_nowcoder.com 8]: https://www.nowcoder.com/practice/06c3dcc303654ef4926654023eca1e5a?tpId=290&tags=&title=&difficulty=0&judgeStatus=0&rp=0&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[976c7d2a495a4914802a629d735d71f6.png]: https://img-blog.csdnimg.cn/976c7d2a495a4914802a629d735d71f6.png
[0e266d5df45c49daa616c2e1a45ce105.png]: https://img-blog.csdnimg.cn/0e266d5df45c49daa616c2e1a45ce105.png
[_nowcoder.com 9]: https://www.nowcoder.com/practice/258fe0c567ac493f9b7bc9d3669d158d?tpId=290&tags=&title=&difficulty=0&judgeStatus=0&rp=0&sourceUrl=%2Fexam%2Foj%3Fpage%3D1%26tab%3D%25E8%25AF%25AD%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D290
[253d90c6c3e54bcea75926ab059ea24c.png]: https://img-blog.csdnimg.cn/253d90c6c3e54bcea75926ab059ea24c.png
[0373e169343c4268a0dbe93876937a24.png]: https://img-blog.csdnimg.cn/0373e169343c4268a0dbe93876937a24.png