路十一
路十一
全部文章
分类
归档
标签
去牛客网
登录
/
注册
路十一的博客
全部文章
(共10篇)
题解 | #兔子的序列#
#include<stdio.h> #include<math.h> int is_unsqrt(int x) { int tmp = 0; tmp = sqrt(x); //开平方再取整数值 if (pow(tmp, 2) != x) //整数值的平方相等,若是实数...
2023-12-08
0
285
题解 | #兔子的序列#
#include<stdio.h> #include<math.h> int is_unsqrt(int x) { int tmp = 0; tmp = sqrt(x); //开平方再取整数值 if (pow(tmp, 2) != x) //整数值的平方相等,若是实数...
2023-12-08
0
279
题解 | #牛牛的素数和#
#include<stdio.h> int is_ss(int x) { int flag = 0; for (int i = 2; i < x; i++) { if (x % i == 0) //能被整除 flag++; } if (flag == 0) /...
2023-12-08
0
247
题解 | #[NOIP2010]数字统计#
#include<stdio.h> int count2(int i) { int count = 0; while (i!=0) { if (i % 10 == 2) count++; i = i / 10; } return count; } int...
2023-12-08
0
199
题解 | #有序序列判断#
#include<stdio.h> int main() { int n = 0,i=0,j=0,count=0; int a[50] = { 0 }; scanf("%d", &n); for (i = 0; i < n; i++) { ...
2023-11-30
0
255
题解 | #有序序列合并#
#include <stdio.h> int main() { int a[2000]; int i, j, tmp,n1,n2; scanf("%d %d", &n1, &n2); //先存n1个数到a数组中 下标为 0---n1-...
2023-11-30
1
214
题解 | #逆序输出#
#include<stdio.h> int main() { int a[10] = { 0 }; for (int i = 0; i < 10; i++) { scanf("%d", &a[i]); } for (int j = ...
2023-11-28
0
215
题解 | #小乐乐是否被叫家长#
#include<stdio.h> int main() { int m, c, e, average=0; while (scanf("%d %d %d", &m, &c, &e) != EOF) { average = (m + ...
2023-11-27
0
278
题解 | #牛牛的计划#
#include<stdio.h> int main() { int y, y1, m, m1, d, d1; scanf("%d %d %d\n", &y, &m, &d); scanf("%d %d %d", &...
2023-11-27
0
200
题解 | #空心三角形图案#
#include<stdio.h> int main() { int n = 0; while (scanf("%d", &n) != EOF) { for (int i = 1; i <= n; i++) { for (int j ...
2023-11-26
0
247