在写代码的贝贝很幸福

分类

/ 注册

全部文章（共35篇）

题解 | #[NOIP1999]回文数#

有点难度，借鉴了其他同学的，感觉写得很好，略作修改 #include <stdio.h> #include <math.h> long long huiwen(long long M, int N) { long long out = 0; while (M ...

2024-11-25

1 18

题解 | #素数回文#

#include <stdio.h> int main() { unsigned long long n = 0; scanf("%llu", &n); unsigned long long a = n; while (a) {...

2024-11-25

1 7

题解 | #牛牛的素数和#

#include<stdio.h> #include<string.h> int main() { int a, b; scanf("%d%d", &a, &b); int sum = 0; for (int...

2024-11-25

1 10

题解 | #[NOIP2010]数字统计#

#include<stdio.h> #include<string.h> int main() { int a, b; scanf("%d%d", &a, &b); int count = 0; for (i...

2024-11-25

1 15

The Biggest Water Problem

#include<stdio.h> #include<string.h> int main() { int n = 0; scanf("%d", &n); int i = n; int sum = 0; wh...

2024-11-25

1 10

题解 | #添加逗号#

#include<stdio.h> #include<string.h> int main() { char str[10]; scanf("%s", str); int n = strlen(str); for (int ...

2024-11-24

1 11

题解 | #登录验证#

#include<stdio.h> #include<string.h> int main() { char name[20] = {0}; char passage[20] = {0}; while (scanf("%s %s",...

2024-11-24

1 12

题解 | #矩阵计算#

#include <stdio.h> int main() { int n, m, sum = 0; scanf("%d%d", &n, &m); int arr[n][m]; for (int i = 0; i &l...

2024-11-24

1 8

题解 | #矩阵相等判定#

#include <stdio.h> int main() { int n = 0; int m = 0; scanf("%d %d", &n, &m); int arr1[n][m]; int arr2[n][...

2024-11-24

1 10

题解 | #最高身高#

#include <stdio.h> int main() { int n = 0; int m = 0; scanf("%d%d",&n,&m); int arr[n][m]; int max = 0; ...

2024-11-24

1 7