#include<stdio.h>intmain(){printf("Practice makes perfect!\n");return0;}
BC2 我是大V
#include<stdio.h>intmain(){printf("v v\n v v \n v \n");return0;}
BC3 有容乃大
#include<stdio.h>intmain(){printf("The size of short is %d bytes.\n",sizeof(short));printf("The size of int is %d bytes.\n",sizeof(int));printf("The size of long is %d bytes.\n",sizeof(long));printf("The size of long long is %d bytes.\n",sizeof(longlong));}
#include<stdio.h>intmain(){long a;float C, M, E;scanf("%ld;%f,%f,%f",&a,&C,&M,&E);printf("The each subject score of No. %ld is %.2f, %.2f, %.2f.", a, C, M, E);return0;}
#include<stdio.h>voidJH(int*a,int*b);intmain(){int a;int b;scanf("a=%d,b=%d",&a,&b);JH(&a,&b);printf("a=%d,b=%d", a, b);}voidJH(int*a,int*b){int c =*a;*a =*b;*b = c;}
#include<stdio.h>intmain(){double a[3]={0};double sum =0, ave =0;scanf("%lf %lf %lf",&a[0],&a[1],&a[2]);printf("%.2f %.2f", a[0]+a[1]+a[2],(a[0]+a[1]+a[2])/3.0);return0;}
BC25 计算体重指数
#include<stdio.h>intmain(){int high =0, weight =0;scanf("%d %d",&weight,&high);printf("%.2f\n", weight /((high /100.0)*(high /100.0)));return0;}
BC26 计算三角形的周长和面积
#include<stdio.h>#include<math.h>intmain(){int a, b, c;scanf("%d %d %d",&a,&b,&c);float d, e, p;
d = a + b + c;
p = d /2;
e =sqrt(p *(p-a)*(p-b)*(p-c));printf("circumference=%.2f area=%.2f", d, e);return0;}
BC27 计算球体的体积
#include<stdio.h>#include<math.h>intmain(){//半径double r =0.0;//体积double v =0.0;double pi =3.1415926;//输入scanf("%lf",&r);//计算
v =4/3.0* pi *pow(r,3);//输出printf("%.3lf\n", v);return0;}
#include<stdio.h>intmain(){int a[4];int b[4];for(int i =10000; i <=99999; i++){
a[0]= i /10000;
b[0]= i %10000;
a[1]= i /1000;
b[1]= i %1000;
a[2]= i /100;
b[2]= i %100;
a[3]= i /10;
b[3]= i %10;if(i == a[0]* b[0]+ a[1]* b[1]+ a[2]* b[2]+ a[3]* b[3])printf("%d ", i);}return0;}
BC39 争夺前五名
#include<stdio.h>intmain(){int n;int a[50]={0};scanf("%d",&n);for(int i =0; i < n; i++){scanf("%d",&a[i]);}for(int i =0; i <5; i++){for(int j = i+1; j< n; j++){if(a[j]> a[i]){int tmp = a[i];
a[i]= a[j];
a[j]= tmp;}}printf("%d ", a[i]);}}
BC40 竞选社长
#include<stdio.h>intmain(){char ch;int A =0, B =0, E =0;while((ch =getchar())!='0'){if(ch =='A')
A++;if(ch =='B')
B++;}if(A == B){printf("E\n");return0;}int flag = A > B ?0:1;if(flag ==0)printf("A\n");elseprintf("B\n");return0;}
#include<stdio.h>intmain(){int a[3]={0};scanf("%d %d %d",&a[0],&a[1],&a[2]);int max = a[0];for(int i =1; i <=2; i++){if(a[i]> max)
max = a[i];}printf("%d", max);return0;}
BC46 判断是元音还是辅音
#include<stdio.h>intmain(){char a[10]={'A','a','E','e','I','i','O','o','U','u'};char ch;int flag =0;while(scanf("%c",&ch)!=EOF){getchar();for(int i =0; i <10; i++){if(ch == a[i])
flag =1;}if(flag ==1){
flag =0;printf("Vowel\n");}elseprintf("Consonant\n");}}
BC47 判断是不是字母
#include<stdio.h>intmain(){char ch;while((ch =getchar())!=EOF){getchar();if((ch >='a'&& ch <='z')||(ch >='A'&& ch <='Z'))printf("%c is an alphabet.\n", ch);elseprintf("%c is not an alphabet.\n", ch);}return0;}
#include<stdio.h>intmain(){int a =0, b =0;while(scanf("%d %d",&a,&b)!=EOF){if(a == b)printf("%d=%d\n", a, b);elseif(a > b)printf("%d>%d\n", a, b);elseprintf("%d<%d\n", a, b);}return0;}
#include<stdio.h>intmain(){int a =0, b =0, c =0;while(scanf("%d %d %d",&a,&b,&c)!=EOF){if(a + b > c && b + c > a && c + a > b){if(a == b && b == c)printf("Equilateral triangle!\n");elseif(a == b || b == c || c == a)printf("Isosceles triangle!\n");elseprintf("Ordinary triangle!\n");}elseprintf("Not a triangle!\n");}return0;}
#include<stdio.h>#include<math.h>intmain(){float a =0, b =0, c =0;float x1 =0, x2 =0;float s =0, x =0;while(scanf("%f %f %f",&a,&b,&c)!=EOF){if(a ==0)printf("Not quadratic equation\n");else{double delat =pow(b,2.0)-4* a * c;if(delat ==0){
x1 =(-b +sqrt(delat))/(2* a);printf("x1=x2=%.2f\n", x1);}elseif(delat >0){
x1 =(-b -sqrt(delat))/(2* a);
x2 =(-b +sqrt(delat))/(2* a);printf("x1=%.2f;x2=%.2f\n", x1, x2);}else{
s =-b /(2* a);
x =sqrt(-delat)/(2* a);printf("x1=%.2f-%.2fi;x2=%.2f+%.2fi\n", s, x, s, x);}}}return0;}
BC54 获得月份天数
#include<stdio.h>intmain(){int a[2][12]={{31,28,31,30,31,30,31,31,30,31,30,31},{31,29,31,30,31,30,31,31,30,31,30,31}};int flag =0;int year, month;while(scanf("%d %d",&year,&month)!=EOF){
flag =0;if(((year %4==0)&&(year %100!=0))||(year %400==0))
flag =1;printf("%d\n", a[flag][month -1]);}return0;}
BC55 简单计算器
#include<stdio.h>intmain(){double a, b;char ch;scanf("%lf%c%lf",&a,&ch,&b);switch(ch){case'+':printf("%.4f+%.4f=%.4f\n", a, b,(a+b));break;case'-':printf("%.4f-%.4f=%.4f\n", a, b,(a-b));break;case'*':printf("%.4f*%.4f=%.4f\n", a, b,(a*b));break;case'/':if(b ==0)printf("Wrong!Division by zero!\n");elseprintf("%.4f/%.4f=%.4f\n", a, b,(a/b));break;default:printf("Invalid operation!\n");break;}return0;}
BC56 线段图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){while(num--)printf("*");printf("\n");}return0;}
BC57 正方形图案
#include<stdio.h>intmain(){int num =0;while((scanf("%d",&num))!=EOF){int n = num;while(num--){for(int i =0; i < n; i++){printf("* ");}printf("\n");}}return0;}
BC58 直角三角形图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i =1; i <= num; i++){int j = i;while(j--)printf("* ");printf("\n");}}return0;}
BC59 翻转直角三角形图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i = num; i >=1; i--){int j = i;while(j--)printf("* ");printf("\n");}}return0;}
BC60 带空格直角三角形图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i = num -1; i >=0; i--){int j = i;while(j--)printf(" ");int n = num - i;while(n--)printf("* ");printf("\n");}}return0;}
BC61 金字塔图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i = num -1; i >=0; i--){int j = i;while(j--)printf(" ");int n = num - i;while(n--)printf("* ");printf("\n");}}return0;}
BC62 翻转金字塔图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i = num; i >0; i--){for(int j = i; j < num; j++)printf(" ");int n = i;while(n--)printf("* ");printf("\n");}}return0;}
BC63 菱形图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int p =1; p <= num; p++){int mmp = num - p +1;while(mmp--)printf(" ");int pp = p;while(pp--)printf("* ");printf("\n");}for(int i = num +1; i >0; i--){for(int j = i; j < num +1; j++)printf(" ");int n = i;while(n--)printf("* ");printf("\n");}}return0;}
BC64 K形图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i = num +1; i >1; i--){int mmp = i;while(mmp--)printf("* ");printf("\n");}for(int i =1; i <= num +1; i++){int n = i;while(n--)printf("* ");printf("\n");}}return0;}
BC65 箭形图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i =1; i <= num +1; i++){int mmp =(num - i +1)*2;for(int j = mmp; j >0; j--)printf(" ");int nmmp = i;while(nmmp--)printf("*");printf("\n");}for(int i = num; i >0; i--){int op =(num - i +1)*2;while(op--)printf(" ");int oo = i;while(oo--)printf("*");printf("\n");}}return0;}
BC66 反斜线形图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i =0; i < num; i++){int j = i;for(int j =0; j < i; j++)printf(" ");printf("* \n");}}return0;}
BC67 正斜线形图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i = num -1; i >=0; i--){int j = i;for(int j =0; j < i; j++)printf(" ");printf("* \n");}}return0;}
BC68 X形图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i =1; i <= num; i++){for(int j =1; j <= num; j++){if(i == j || j == num - i +1)printf("*");elseprintf(" ");}printf("\n");}}return0;}
BC69 空心正方形图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i =1; i <= num; i++){for(int j =1; j <= num; j++){if(i ==1|| i == num || j ==1|| j == num)printf("* ");elseprintf(" ");}printf("\n");}}return0;}
BC70 空心三角形图案
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i =1; i <= num; i++){for(int j =1; j <= num; j++){if(j == i || j ==1|| i == num)printf("* ");elseprintf(" ");}printf("\n");}}return0;}
BC71 新年快乐
#include<stdio.h>intmain(){printf("Happy New Year*2019*\n");return0;}
#include<stdio.h>intmain(){int n;while(scanf("%d",&n)!=EOF){switch(n){case200:printf("OK\n");break;case202:printf("Accepted\n");break;case400:printf("Bad Request\n");break;case403:printf("Forbidden\n");break;case404:printf("Not Found\n");break;case500:printf("Internal Server Error\n");break;case502:printf("Bad Gateway\n");break;}}return0;}
BC75 数字三角形
#include<stdio.h>intmain(){int num =0;while(scanf("%d",&num)!=EOF){for(int i =1; i <= num; i++){for(int j =1; j <= i; j++){printf("%d ", j);}printf("\n");}}return0;}
BC76 公务员面试
#include<stdio.h>voidsort(int a[],int length);intmain(){int a[7]={0};while(scanf("%d %d %d %d %d %d %d",&a[0],&a[1],&a[2],&a[3],&a[4],&a[5],&a[6])!=EOF){sort(a,7);printf("%.2f\n",(a[0]+a[1]+a[2]+a[3]+a[4]+a[5]+a[6])/5.0);}return0;}voidsort(int a[],int length){int max =0;int min =0;for(int i =1; i <7; i++){if(a[i]> a[max])
max = i;elseif(a[i]< a[min])
min = i;}
a[max]=0;
a[min]=0;}
BC77 有序序列插入一个数
#include<stdio.h>intmain(){int m =0, num =0, j =0;scanf("%d",&m);int*arr =(int*)malloc((m+1)*sizeof(int));for(int i =0; i < m; i++)scanf("%d",&arr[i]);scanf("%d",&num);for(j = m-1; arr[j]> num && j >=0; j--)
arr[j+1]= arr[j];
arr[j+1]= num;for(int k =0; k < m+1; k++)printf("%d ", arr[k]);free(arr);return0;}
BC78 筛选法求素数
#include<stdio.h>intmain(){int num =0, flag =0, cut =0;scanf("%d",&num);for(int i =2; i <= num; i++){for(int j =2; j < i; j++){
flag =0;if(i % j ==0){
flag =1;
cut++;break;}}if(flag ==0){printf("%d ", i);}}printf("\n%d\n", cut);return0;}
BC79 图像相似度
#include<stdio.h>doubleGet_similar(int a,int b){int*p;int*q;int i;int count =0;
p =(int*)malloc((a*b)*sizeof(int));//开辟第一个图片空间
q =(int*)malloc((a*b)*sizeof(int));//开辟第二个图片空间if(q !=NULL&& p !=NULL){for(i =0; i < a*b; i++)//输入第一个图片{scanf("%d ",&p[i]);}for(i =0; i < a*b; i++)//输入第二个图片{scanf("%d ",&q[i]);}for(i =0; i < a*b; i++)//如果像素点相同,count就+1{if(p[i]== q[i]){
count++;}}}free(p);//记得释放空间free(q);return count*100/(double)(a*b);}intmain(){int a,b;double similar;scanf("%d %d",&a,&b);
similar =Get_similar(a, b);printf("%.2f", similar);return0;}
#include<stdio.h>intmain(){printf("I will learn C++ well!");return0;}
BC82 (a+b-c)*d的计算问题
#include<stdio.h>intmain(){int a =0, b =0, c =0, d =0;scanf("%d %d %d %d",&a,&b,&c,&d);printf("%d",(a+b-c)*d);return0;}
BC83 被5整除问题
#include<stdio.h>intmain(){int n =0;scanf("%d",&n);if(n %5==0)printf("YES\n");elseprintf("NO\n");return0;}
BC84 计算y的值
#include<stdio.h>intmain(){int x =0;scanf("%d",&x);if(x ==0)printf("0\n");elseif(x <0)printf("1\n");elseprintf("-1\n");return0;}
BC85 包含数字9的数
#include<stdio.h>intmain(){int cnt =0;for(int i =1; i <=2019; i++){int m = i;while(m >0){if(m %10==9){
cnt++;break;}else{
m /=10;}}}//输出printf("%d\n", cnt);return0;}
BC86 奇偶统计
#include<stdio.h>intmain(){int n =0;int x =0, y =0;scanf("%d",&n);for(int i =1; i <= n; i++){if(i %2==0)
y++;else
x++;}printf("%d %d", x, y);return0;}
BC87 统计成绩
#include<stdio.h>intmain(){int n =0, max =0, min =0;float sum =0;scanf("%d",&n);float*arr =(float*)malloc(n *sizeof(float));if(arr !=NULL){for(int i =0; i < n; i++){scanf("%f ",&arr[i]);
sum += arr[i];if(arr[i]> arr[max])
max = i;if(arr[i]< arr[min])
min = i;}}printf("%.2f %.2f %.2f", arr[max], arr[min], sum / n);free(arr);return0;}
BC88 有序序列插入一个数
#include<stdio.h>intmain(){int m =0, num =0, j =0;scanf("%d",&m);int*arr =(int*)malloc((m+1)*sizeof(int));for(int i =0; i < m; i++)scanf("%d",&arr[i]);scanf("%d",&num);for(j = m-1; arr[j]> num && j >=0; j--)
arr[j+1]= arr[j];
arr[j+1]= num;for(int k =0; k < m+1; k++)printf("%d ", arr[k]);free(arr);return0;}
#include<stdio.h>intmain(){int N, M, sum =0;scanf("%d %d",&N,&M);int*arr =(int*)malloc(N*M*sizeof(int));for(int i =0; i < N*M; i++){scanf("%d ",&arr[i]);if(arr[i]>0)
sum += arr[i];}printf("%d", sum);return0;}
BC91 成绩输入输出问题
#include<stdio.h>#defineN10intmain(){int a[N]={0};for(int i =0; i <10; i++){scanf("%d ",&a[i]);printf("%d ", a[i]);}return0;}
BC92 逆序输出
#include<stdio.h>#defineN10intmain(){int a[N]={0};for(int i =0; i < N; i++){scanf("%d ",&a[i]);}for(int j = N -1; j >=0; j--)printf("%d ", a[j]);return0;}
BC93 统计数据正负个数
#include<stdio.h>intmain(){int pos =0, nav =0;int n =10;int num =0;while(n--){scanf("%d ",&num);if(num >0)
pos++;if(num <0)
nav++;}printf("positive:%d\n", pos);printf("negative:%d\n", nav);return0;}
BC94 N个数之和
#include<stdio.h>intmain(){int N =0, num =0, sum =0;scanf("%d",&N);while(N--){scanf("%d ",&num);
sum += num;}printf("%d\n", sum);return0;}
BC95 最高分与最低分之差
#include<stdio.h>intmain(){int N =0, num =0, max =0, min =100;scanf("%d",&N);while(N--){scanf("%d ",&num);if(num > max) max = num;if(num < min) min = num;}printf("%d\n", max - min);return0;}
BC96 有序序列判断
#include<stdio.h>intmain(){int n =0;int arr, num;int flag1 =0;int flag2 =0;//输入scanf("%d",&n);for(int i =0; i < n; i++){scanf("%d",&arr);if(i >0){if(arr > num){
flag1 =1;}elseif(arr < num){
flag2 =1;}}
num = arr;}//三目操作符打印//如果全相等,结果为0,为有序(flag1 + flag2 >1)?printf("unsorted\n"):printf("sorted\n");return0;}
BC97 有序序列插入一个整数
#include<stdio.h>intmain(){int m =0, num =0, j =0;scanf("%d",&m);int*arr =(int*)malloc((m+1)*sizeof(int));for(int i =0; i < m; i++)scanf("%d ",&arr[i]);scanf("%d",&num);for(j = m-1; arr[j]> num && j >=0; j--)
arr[j+1]= arr[j];
arr[j+1]= num;for(int k =0; k < m+1; k++)printf("%d ", arr[k]);free(arr);return0;}
BC98 序列中删除指定数字
#include<stdio.h>intmain(){int m =0, num =0, j =0;scanf("%d",&m);int*arr =(int*)malloc(m *sizeof(int));for(int i =0; i < m; i++)scanf("%d ",&arr[i]);scanf("%d",&num);for(j =0; j < m; j++){if(num != arr[j])printf("%d ", arr[j]);}printf("\n");free(arr);return0;}
BC99 序列中整数去重
#include<stdio.h>intmain(){int m =0, num =0, flag =0;scanf("%d",&m);int*arr =(int*)malloc(m *sizeof(int));for(int i =0; i < m; i++)scanf("%d ",&arr[i]);for(int j =0; j < m; j++){
flag =0;for(int k =0; k < j; k++){if(arr[j]== arr[k]) flag =1;}if(flag ==0)printf("%d ", arr[j]);}printf("\n");free(arr);return0;}
BC100 有序序列合并
#include<stdio.h>intmain(){int N =0, M =0, k =0, flag =0;scanf("%d %d",&N,&M);int*first =(int*)malloc((N+M)*sizeof(int));int*second =(int*)malloc(M*sizeof(int));for(int i =0; i < N; i++){scanf("%d ",&first[i]);}for(int j =0; j < M; j++){scanf("%d ",&second[j]);}for(int i =0; i < M; i++){
flag =0;for(k = N -1; k >=0; k--){if(first[k]> second[i]){
first[k+1]= first[k];if(k ==0)
flag =1;}else{
first[k+1]= second[i];break;}}if(flag ==1)
first[0]= second[i];
N++;}for(int x =0; x < N; x++){printf("%d ", first[x]);}free(first);free(second);return0;}
BC101 班级成绩输入输出
#include<stdio.h>intmain(){double arr[5][5];for(int i =0; i <5; i++){scanf("%lf %lf %lf %lf %lf",&arr[i][0],&arr[i][1],&arr[i][2],&arr[i][3],&arr[i][4]);}for(int i =0; i <5; i++){double sum =0;for(int j =0; j <5; j++){printf("%.1f ", arr[i][j]);
sum += arr[i][j];}printf("%.1f\n", sum);}return0;}
BC102 矩阵元素定位
#include<stdio.h>intmain(){int H =0, L =0;scanf("%d %d",&H,&L);int*arr =(int*)malloc(H*L*sizeof(int));for(int i =0; i < H*L; i++){scanf("%d ",&arr[i]);}int sH, sL;scanf("%d %d",&sH,&sL);printf("%d\n", arr[(sH-1)*L+sL-1]);free(arr);}
BC103 序列重组矩阵
#include<stdio.h>intmain(){int n =0, m =0;scanf("%d %d",&n,&m);int*arr =(int*)malloc(n*m*sizeof(int));for(int i =0; i < n*m; i++){scanf("%d ",&arr[i]);if(i !=0&& i % m ==0)printf("\n");printf("%d ", arr[i]);}free(arr);return0;}
BC104 最高身高
#include<stdio.h>intmain(){int N =0, M =0, max =0;scanf("%d %d",&N,&M);int*arr =(int*)malloc(N*M*sizeof(int));for(int i =0; i < N*M; i++){scanf("%d ",&arr[i]);if(arr[i]> arr[max])
max = i;}printf("%d %d", max/M +1, max +1-(max/M)*M);}
BC105 矩阵相等判定
#include<stdio.h>intmain(){int N =0, M =0, max =0;scanf("%d %d",&N,&M);int*arr =(int*)malloc(N*M*sizeof(int));int*prr =(int*)malloc(N*M*sizeof(int));for(int i =0; i < N*M; i++){scanf("%d ",&arr[i]);}for(int i =0; i < N*M; i++){scanf("%d ",&prr[i]);if(arr[i]!= prr[i]){printf("No\n");return0;}}printf("Yes\n");return0;}
BC106 上三角矩阵判定
#include<stdio.h>intmain(){int n =0, flag =0;scanf("%d",&n);int*arr =(int*)malloc(n*n*sizeof(int));for(int i =0; i < n*n; i++){scanf("%d ",&arr[i]);}for(int x =0; x < n; x++){for(int y =0; y < x; y++){if(*(arr+x*n+y)!=0)
flag =1;}}if(flag ==1)printf("NO\n");elseprintf("YES\n");free(arr);return0;}
BC107 矩阵转置
#include<stdio.h>intmain(){int n =0, m =0;scanf("%d %d",&n,&m);int*arr =(int*)malloc(n*m*sizeof(int));for(int i =0; i < n*m; i++){scanf("%d ",&arr[i]);}for(int i =0; i < m; i++){for(int j =0; j < n; j++){printf("%d ",*(arr+j*m+i));}printf("\n");}free(arr);return0;}
BC108 矩阵交换
#include<stdio.h>intmain(){int n =0, m =0;scanf("%d %d",&n,&m);int*arr =(int*)malloc(n*m*sizeof(int));for(int i =0; i < n*m; i++){scanf("%d ",&arr[i]);}int num =0;char ch;int h =0, l =0;scanf("%d",&num);while(num--){getchar();scanf("%c %d %d",&ch,&h,&l);switch(ch){case'r':for(int i =0; i < m; i++){int tmp =*(arr+(h-1)*m+i);*(arr+(h-1)*m+i)=*(arr+(l-1)*m+i);*(arr+(l-1)*m+i)= tmp;}break;case'c':for(int i =0; i < n; i++){int mmp =*(arr+i*m+h-1);*(arr+i*m+h-1)=*(arr+i*m+l-1);*(arr+i*m+l-1)= mmp;}break;default:break;}}for(int i =0; i < n; i++){for(int j =0; j < m; j++){printf("%d ",*(arr+i*m+j));}printf("\n");}free(arr);return0;}
BC109 杨辉三角
#include<stdio.h>intmain(){int n =0;int arr[30][30]={0};scanf("%d",&n);for(int i =0; i < n; i++){for(int j =0; j <= i; j++){if(0== j || i == j){
arr[i][j]=1;}else{
arr[i][j]= arr[i -1][j -1]+ arr[i -1][j];}printf("%5d", arr[i][j]);}printf("\n");}return0;}
BC110 井字棋
#include<stdio.h>intmain(){char arr[3][3]={0};int i =0;int j =0;char flag ='c';for(i =0; i <3; i++){for(j =0; j <3; j++){scanf("%c",&arr[i][j]);getchar();}}for(i =0; i <3; i++){if(arr[i][0]== arr[i][1]&& arr[i][1]== arr[i][2]){
flag = arr[i][1];break;}if(arr[0][i]== arr[1][i]&& arr[1][i]== arr[2][i]){
flag = arr[1][i];break;}}if(arr[0][0]== arr[1][1]&& arr[1][1]== arr[2][2])
flag = arr[1][1];if(arr[0][2]== arr[1][1]&& arr[1][1]== arr[2][0])
flag = arr[1][1];if(flag =='K')printf("KiKi wins!");elseif(flag =='B')printf("BoBo wins!");elseprintf("No winner!");return0;}
BC111 小乐乐与进制转换
#include<stdio.h>intmain(){int n =0;int m =0;int a[9]={0};int size =0;scanf("%d",&n);while(n){
m = n %6;
a[size++]= m;
n = n /6;}for(int j = size-1; j >=0; j--)printf("%d", a[j]);return0;}
BC112 小乐乐求和
#include<stdio.h>intmain(){int n =0;long sum =0;scanf("%d",&n);while(n){
sum += n;
n--;}printf("%ld",sum);return0;}
BC113 小乐乐定闹钟
#include<stdio.h>intmain(){int hour =0, min =0;long after =0;scanf("%d:%d %d",&hour,&min,&after);int all = hour *60+ min + after;printf("%02d:%02d", all/60%24, all%60);return0;}
BC114 小乐乐排电梯
#include<stdio.h>intmain(){int n =0;scanf("%d",&n);printf("%d",(n/12)*4+2);return0;}
BC115 小乐乐与欧几里得
#include<stdio.h>intmain(){longlong n =0;longlong m =0;scanf("%lld %lld",&n,&m);longlong a = n;longlong b = m;int t =0;while(t = a % b){
a = b;
b = t;}printf("%lld\n", b + m * n / b);return0;}
BC116 小乐乐改数字
#include<stdio.h>intmain(){int a[9];int n, size =0;int sum =0;scanf("%d",&n);while(n){int w = n %10;if((w %2)==0)
a[size++]=0;else
a[size++]=1;// sum += a[size] * pow(10, i++);
n = n /10;}for(int i = size -1; i >=0; i--){
sum = sum*10+ a[i];}printf("%d\n", sum);return0;}
BC117 小乐乐走台阶
#include<stdio.h>intfun(int n);intmain(){int n =0;int a[35]={0};scanf("%d",&n);// printf("%d\n", fun(n));
a[0]=0;
a[1]=1;
a[2]=2;for(int i =3; i <= n; i++)
a[i]= a[i-1]+ a[i-2];printf("%d\n", a[n]);return0;}intfun(int n){if(n ==1)return1;if(n ==2)return2;returnfun(n-1)+fun(n-2);}
#include<stdio.h>intmain(){int n =0;scanf("%d",&n);int*arr =(int*)malloc(n *sizeof(int));int max =0;for(int i =0; i < n; i++){scanf("%d ",&arr[i]);if(arr[i]> max)
max = arr[i];}printf("%d\n", max);free(arr);return0;}
BC128 小乐乐计算求和
#include<stdio.h>intFac(int n);intFac_All(int n);intmain(){int n =0;scanf("%d",&n);int m =Fac_All(n);printf("%d", m);return0;}intFac(int n){// if(n == 1) return 1;// return n * Fac(n-1);int sum =1;for(int i = n; i >0; i--){
sum *= i;}return sum;}intFac_All(int n){// if(n == 1) return 1;// return Fac(n) + Fac_All(n-1);int sum =0;for(int j = n; j >0; j--){
sum +=Fac(j);}return sum;}
BC129 小乐乐计算函数
#include<stdio.h>intmax3(int a,int b,int c){// int max = a;// if(b > max)// max = b;// if(c > max)// max = c;// return max;return(a > b ? a : b)> c ?(a > b ? a : b): c;}intmain(){int a =0;int b =0;int c =0;scanf("%d %d %d",&a,&b,&c);float m =((float)max3(a+b, b, c)/(max3(a, b+c, c)+max3(a, b, b+c)));printf("%.2f\n", m);return0;}
BC130 小乐乐查找数字
#include<stdio.h>intmain(){int n =0;scanf("%d",&n);int*arr =(int*)malloc(n *sizeof(int));for(int i =0; i < n; i++){scanf("%d ",&arr[i]);}int m =0, count =0;scanf("%d",&m);for(int j =0; j < n; j++){if(arr[j]== m)
count++;}printf("%d", count);free(arr);return0;}
#include<stdio.h>intmain(void){int a, b, c, d;scanf("%d %d %d %d",&a,&b,&c,&d);double result =0.2* a +0.1* b +0.2* c +0.5* d;printf("%.1f", result);return0;}
BC133 KiKi说祝福语
#include<stdio.h>intmain(){int n;scanf("%d",&n);while(n--){printf("Happy new year!Good luck!\n");}return0;}
BC134 KiKi的最高分
#include<stdio.h>intmain(){int a, b, c;scanf("%d %d %d",&a,&b,&c);printf("%d",(a > b ? a : b)> c ?(a > b ? a : b): c);return0;}
BC135 KiKi求质数个数
#include<stdio.h>intmain(){int count =0;int flag =0;for(int i =100; i <=999;i++){
flag =1;//默认是素数for(int j =2; j < i; j++){if(i % j ==0){//有能被整除的数
flag =0;break;}}if(flag){
count++;}}printf("%d", count);return0;}
BC136 KiKi去重整数并排序
#include<stdio.h>//直接桶排搞定intmain(){int arr[1001]={0};int n =0;int tmp =0;scanf("%d",&n);while(scanf("%d",&tmp)!=EOF){
arr[tmp]++;};for(int i =0; i <1001; i++){if(arr[i]!=0)printf("%d ", i);}return0;}
BC137 KiKi判断上三角矩阵
#include<stdio.h>intmain(){int n =0, flag =0;scanf("%d",&n);int*arr =(int*)malloc(n*n*sizeof(int));for(int i =0; i < n*n; i++){scanf("%d ",&arr[i]);}for(int x =0; x < n; x++){for(int y =0; y < x; y++){if(*(arr+x*n+y)!=0)
flag =1;}}if(flag ==1)printf("NO\n");elseprintf("YES\n");free(arr);return0;}