homework
YikZ__08-01
分享自己的学习经历
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
(3)D - 子矩阵求和
#include<stdio.h>int main(){ int i, j,m,n; int a[500][500]; scanf("%d%d", &m, &n);//输入m x n数组 for (i = 1; i <= m; i++) for (j = 1; j <= n; j++) scanf("%d", &a[i][j]); int q; scanf("%d", &q); while (q--) { int ..原创 2021-10-28 23:48:52 · 204 阅读 · 3 评论 -
(3)C - 上台阶 easy
#include<stdio.h>int main(){ int n; int i; int f1 = 2, f2 = 1,f3; scanf("%d", &n); if (n == 2) printf("1\n"); if (n == 3) printf("2\n"); if (n > 2 && n <= 25) { for (i = 2; i <n-1; i++) { f3 = f1 +..原创 2021-10-28 23:47:54 · 338 阅读 · 2 评论 -
(3)B - 启蒙练习-回文数
#include<stdio.h>#include<math.h>int main(){ int n, sum = 0; int t, i, j,y,q,e; //输入一个数 scanf("%d", &n); q = n; y = n; t = 0; //判断几位数 while (q) { q = q / 10; ++t; } e = t - 1; for (i=n,j=pow(10,e); n!=0 ; i=n%10,n=n/10..原创 2021-10-28 23:47:09 · 163 阅读 · 2 评论 -
(3)A - 阶乘后面0的数量
#include<stdio.h>int main(){ long long n; int sum = 0; while (~scanf("%lld", &n)) { while (n) { n /= 5; sum += n; } printf("%d", sum); } return 0;}原创 2021-10-28 23:46:01 · 147 阅读 · 2 评论 -
阶乘后0的个数
#include<stdio.h>int main(){ long long n; int sum = 0; while (~scanf("%lld", &n)) { while (n) { n /= 5; sum += n; } printf("%d", sum); } return 0;}原创 2021-10-24 22:07:50 · 128 阅读 · 0 评论 -
E - 求平均成绩
#include<stdio.h>int main(){ int i,q,j,n,m; while (~scanf("%d%d", &n, &m)) { float a[100][100]; float xs[100], kc[100]; float sum = 0; int nb = 0, nnb = 0; for (i = 0; i < n; i++) for (j = 0; j < m; j++) { sca.原创 2021-10-13 23:53:30 · 227 阅读 · 2 评论 -
水仙花数(作业附加)
#include<stdio.h>int main(){ int a[5] = { 153,370,371,407,1634}; int i,n; scanf("%d", &n); for (i = 0;; i++) if (a[i] >= n) { printf("%d\n", a[i]); break; } return 0;}原创 2021-10-08 17:15:54 · 144 阅读 · 4 评论 -
J - N的阶乘 mod P
#include <stdio.h>int main() { int n, p; while (~scanf("%d%d", &n, &p)) { int i; long long sum = 1; for (i = n; i > 0; i--) { sum = (sum * i) % p;//防止数据损失 } if (!n)//注意n等于0时 printf("0\n"); else printf("%lld\n", .原创 2021-10-08 17:12:48 · 162 阅读 · 2 评论 -
G - 查找最大元素
#include<stdio.h>#include<string.h>int main(){ int i,lon; char max,a[200]; while (~scanf("%s", &a)) { max = a[0]; lon = strlen(a); for (i = 1;i<lon; i++) { if (max<a[i]) max = a[i]; } for (i = 0; i < lon;.原创 2021-10-08 17:11:23 · 146 阅读 · 2 评论 -
F - C语言合法标识符
#include<stdio.h>#include<string.h>int main(){ int i, n; char a[110]; //先假设该标识符合法 scanf("%d", &n); getchar(); while (n--) { int flag = 1; gets(a); for (i = 0; a[i] != '\0'; i++) { if (a[i] >= 'a' &&am.原创 2021-10-08 17:09:46 · 299 阅读 · 2 评论 -
D - 绝对值排序
#include<stdio.h>#include<math.h>int main(){ int n, a[102]; int i, j, t; while (scanf("%d", &n) != EOF) { //输入数据到数组 if (n <= 0) return 0; for (i = 0; i < n; i++) scanf("%d", &a[i]); //冒泡法排序 for (j = 0; j < .原创 2021-10-07 16:29:22 · 110 阅读 · 2 评论 -
I - 最小公倍数LCM
#include<stdio.h>long long gcd(long long a, long long b){ while (b) { long long t = b; b = a % b; a = t; } return a;}int main(){ long long a, b; scanf("%lld%lld", &a, &b); if (a >= 1 && b <= 1e+9) { long lo.原创 2021-10-05 22:13:25 · 293 阅读 · 2 评论 -
H - 最大公约数GCD
#include<stdio.h>int gcd(int a, int b){ while (b) { int t = b; b = a % b; a = t; } return a;}int main(){ int a, b ; scanf("%d%d", &a, &b); if (a >= 1 && b <= 1e+9) { int gcd(int a, int b); printf("%d\n",.原创 2021-10-05 22:12:11 · 263 阅读 · 2 评论 -
C - 数列有序
#include<stdio.h>int main(){ int q[102],n, m; while (scanf("%d%d", &n, &m) != EOF && n||m) { int i,j,u=0,t,k=0; //录入数组 for (i = 0; i <n; i++) { scanf("%d", &q[i]); } //将所有数组向后移动,再将m赋值给第一个 for (i = n-1; i .原创 2021-10-05 22:10:49 · 487 阅读 · 2 评论 -
B - 母牛的故事
#include<stdio.h>int main(){ int f1, f2, f3,f4,n,t; while (scanf("%d", &n) != EOF) { int o = 4; f1 = 3; f2 = 2; f3 = 1; if (n == 1) printf("1\n"); if (n == 2) printf("2\n"); if (n == 3) printf("3\n"); if (n > .原创 2021-10-05 15:06:25 · 207 阅读 · 2 评论 -
(2)A - 偶数求和
#include <stdio.h>int main(void){ int n, m; while (scanf("%d%d", &n, &m) != EOF) { int sum = 0, ai = 2, count = 0, i; for (i = 1; i <= n; i++) { sum += ai; ai += 2; // 第1项为2,公差为2 // 求和项达到m项,则计算平均值并输出 if.原创 2021-10-05 15:04:15 · 179 阅读 · 2 评论 -
G - 成绩转换
#include<stdio.h>int main(){ int grade; while(scanf("%d",&grade) != EOF) { if(grade>100 || grade<0) { printf("无效成绩,请重新输入\n"); continue; } switch(grade/10) { case 10:printf("A\n");break; case 9:printf("A\n");break;.原创 2021-10-03 14:29:53 · 151 阅读 · 2 评论 -
F - 求绝对值
#include<stdio.h>#include<math.h>int main(){ double a; while(scanf("%lf",&a)!= EOF) { if(a>0) printf("%.2lf\n",a); else printf("%.2lf\n",fabs(a)); } return 0;}原创 2021-10-03 14:13:16 · 202 阅读 · 2 评论 -
E - 计算球体积
#include<stdio.h>#include<math.h>#define PI 3.1415927int main(){ double r,m; while(scanf("%lf",&r) != EOF) { m=4.0/3.0*PI*pow(r,3); printf("%.3lf\n",m); } return 0;}原创 2021-10-03 14:08:08 · 294 阅读 · 2 评论 -
D - 计算两点间的距离
#include<stdio.h>#include<math.h>int main(){ double x1,y1,x2,y2; double q; while(scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2) != EOF) { q=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2); printf("%.2lf\n",sqrt(q)); } return 0;}原创 2021-10-03 13:59:42 · 226 阅读 · 2 评论 -
C - A+B for Input-Output Practice (III)
#include<stdio.h>int main(){ int a,b; while(scanf("%d%d",&a,&b)!=EOF) { if(a==0 && b==0) { break; } printf("%d\n",a+b); } return 0;}原创 2021-10-03 13:48:34 · 230 阅读 · 2 评论 -
B - A+B for Input-Output Practice (II)
#include<stdio.h>int main(){ int a,b,n,i=1; scanf("%d",&n); while(i<=n) { scanf("%d%d",&a,&b); printf("%d\n",a+b); i++; } return 0;}原创 2021-10-03 13:18:12 · 246 阅读 · 2 评论 -
(1)A - A+B for Input-Output Practice (I)
#include<stdio.h> int main(){ int a, b,m; while (scanf("%d%d", &a, &b) != EOF) { printf("%d\n", a+b); } return 0;}原创 2021-10-03 13:17:32 · 215 阅读 · 2 评论
分享