Zerone·

分类

题解(113)

/ 注册

全部文章（共113篇）

题解 | #牛牛逆序输出#

">int main() { int n; scanf("%d", &n); while (n) { printf("%d", n % 10); n /= 10; } return 0; }

C

2022-05-29

2 502

题解 | #牛牛的排列数#

">int main() { int n, m; scanf("%d %d", &n, &m); int sum = 1; for (int i = 1; i <= m; i++) { sum *= n - i + 1; ...

C

2022-05-29

1 457

题解 | #牛牛的Hermite多项式#

">int output(int n, int x) { if (n == 0) return 1; else if (n == 1) return 2 * n; else return 2 * x * output(n - 1...

C

2022-05-29

4 415

题解 | #牛牛的digit#

">#include<math.h> int main() { int x, i; scanf("%d %d", &x, &i); printf("%d", x % (int)pow(10, i)); return 0; }

C

2022-05-29

3 441

题解 | #牛牛的西格玛#

">long long output(int n) { return n == 1 ? n : n + output(n - 1); } int main() { int n; scanf("%d", &n); printf("%lld", output(n)...

C

2022-05-29

4 391

题解 | #函数实现计算一个数的阶乘#

">long long output(int n) { return n == 1 ? n : n * output(n - 1); } int main() { int n; scanf("%d", &n); printf("%lld", output(n)...

C

2022-05-29

6 644

题解 | #牛牛的10类人#

int main() { int n; scanf("%d", &n); int m[n]; for (int i = 0; i < n; i++) { int o = 0, l = 0; scanf(...

C

2022-05-29

3 470

题解 | #牛牛的四叶玫瑰数#

">#include<math.h> int main() { int l, r; scanf("%d %d", &l, &r); for (int i = l; i <= r; i++) { int val = i, tem...

C

2022-05-29

9 358

题解 | #牛牛的替换#

">int main() { int n; char a1, a2, a3, a4; scanf("%d %c %c %c %c\n", &n, &a1, &a2, &a3, &a4); char s[n]; for (...

C

2022-05-29

3 402

题解 | #牛牛的素数判断#

">int main() { int n, m = 0; while (scanf("%d", &n) != EOF) { m++; if (m != 1) { int count = 0; fo...

C

2022-05-29

2 371