更新不易，麻烦多多点赞，欢迎你的提问，感谢你的转发，
最后的最后，关注我，关注我，关注我，你会看到更多有趣的博客哦！！！
喵喵喵，你对我真的很重要。
目录
BC98 序列中删除指定数字
https://www.nowcoder.com/practice/7bbcdd2177a445a9b66da79512b32dd7?tpId=107&&tqId=33379&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-ranking
https://www.nowcoder.com/practice/7bbcdd2177a445a9b66da79512b32dd7?tpId=107&&tqId=33379&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-ranking
#include <stdio.h>
int main()
{
int n = 0;
scanf("%d", &n);
int arr[10] = {0};
int i = 0;
for (i = 0; i < n; i++)
{
scanf("%d ", &arr[i]);
}
int m = 0;
scanf("%d", &m);
//1 2 3 4 5 9
i = 0;
for (i = 0; i < n; i++)
{
if (arr[i] != m)
{
printf("%d ", arr[i]);
}
}
return 0;
}BC107 矩阵转置
https://www.nowcoder.com/practice/351b3d03e410496ab5a407b7ca3fd841?tpId=107&&tqId=33388&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-rankinghttps://www.nowcoder.com/practice/351b3d03e410496ab5a407b7ca3fd841?tpId=107&&tqId=33388&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-ranking
#include<stdio.h>
int main()
{
int n,m;
int i,j;
int a[10][10];
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
scanf("%d",&a[i][j]);
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
printf("%d ",a[j][i]);
printf("\n");
}
return 0;
}BC111 小乐乐与进制转换
https://www.nowcoder.com/practice/242eafef2a704c0ca130d563b7b3ee2d?tpId=107&&tqId=33392&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-rankinghttps://www.nowcoder.com/practice/242eafef2a704c0ca130d563b7b3ee2d?tpId=107&&tqId=33392&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-ranking
#include <stdio.h>
int main()
{
int arr[40]={0};
int i=0;
int n=0;
scanf("%d",&n);
while(n)
{
arr[i++]=n%6;
n/=6;
}
for(i--;i>=0;i--)
{
printf("%d",arr[i]);
}
return 0;
}BC90 矩阵计算
https://www.nowcoder.com/practice/0c83231923c541d2aa15861571831ee5?tpId=107&&tqId=33371&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-rankinghttps://www.nowcoder.com/practice/0c83231923c541d2aa15861571831ee5?tpId=107&&tqId=33371&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-ranking
#include <stdio.h>
int main()
{
int m,n;
scanf("%d %d",&m,&n);
int arr1[m][n];
int arr2[m][n];
int i,j;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&arr1[i][j]);
}
}
int flag=1;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&arr2[i][j]);
if(arr1[i][j]!=arr2[i][j])
{
flag=0;
break;
}
}
}
if(flag==1)
printf("Yes\n");
else
printf("No\n");
return 0;
}BC106 上三角矩阵判https://www.nowcoder.com/practice/f5a29bacfc514e5a935723857e1245e4?tpId=107&&tqId=33387&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-rankinghttps://www.nowcoder.com/practice/f5a29bacfc514e5a935723857e1245e4?tpId=107&&tqId=33387&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-ranking
#include <stdio.h>
int main()
{
int n;
scanf("%d",&n);
int arr[n][n];
int i,j;
int flag=1;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&arr[i][j]);
if(i>j)
{
if(arr[i][j]!=0)
flag =0;
}
}
}
printf("%s",(flag?"YES":"NO"));
return 0;
}BC105 矩阵相等判定
https://www.nowcoder.com/practice/2f058b1e89ae43f7ab650c0fd0b71fa8?tpId=107&&tqId=33386&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-rankinghttps://www.nowcoder.com/practice/2f058b1e89ae43f7ab650c0fd0b71fa8?tpId=107&&tqId=33386&rp=1&ru=/ta/beginner-programmers&qru=/ta/beginner-programmers/question-ranking
#include <stdio.h>
int main()
{
int m,n;
scanf("%d %d",&m,&n);
int arr1[m][n];
int arr2[m][n];
int i,j;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&arr1[i][j]);
}
}
int flag=1;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&arr2[i][j]);
if(arr1[i][j]!=arr2[i][j])
{
flag=0;
break;
}
}
}
if(flag==1)
printf("Yes\n");
else
printf("No\n");
return 0;
}更新不易，麻烦多多点赞，欢迎你的提问，感谢你的转发，
最后的最后，关注我，关注我，关注我，你会看到更多有趣的博客哦！！！
喵喵喵，你对我真的很重要。
