目录
(1)1/1-1/2+1/3-1/4.......+1/99-1/100
乘法口诀表
//九九乘法口诀表
int main() {
int i = 0;
for (i = 1; i <= 9; i++) {
//打印一行
int j = 0;
for (j = 1; j <= i; j++) {
//一项
printf("%d*%d=%-2d ", i, j, i * j);
//printf("%d*%d=%2d ", i, j, i * j);
//对齐方式
}
printf("\n");
}
return 0;
}
//输入输出方式
int main() {
int i = 0;
int line = 0;
scanf("%d", &line);
for (i = 1; i <= line; i++) {
//打印一行
int j = 0;
for (j = 1; j <= i; j++) {
//一项
printf("%d*%d=%-2d ", i, j, i * j);
//printf("%d*%d=%2d ", i, j, i * j);
}
printf("\n");
}
return 0;
}
求10个数中最大数
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
//方法一:
int main() {
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int max = arr[0];
int i =0;
int sz = sizeof(arr) / sizeof(arr[0]);
for (i = 1; i < sz; i++) {
if (arr[i] > max)
max = arr[i];
}
printf("%d\n", max);
return 0;
}
//方法二:
int main() {
int arr[10] = { 0 };
int sz = sizeof(arr) / sizeof(arr[0]);
int i = 0;
for (i = 0; i < sz; i++) {
scanf("%d",&arr[i]);
}
int max = arr[0];
for (i = 1; i < sz; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
printf("最大值为:");
printf("%d\n", max);
return 0;
}
计算
(1)1/1-1/2+1/3-1/4.......+1/99-1/100
//方法一:
int main() {
int i = 0;
double sum = 0.0;
int flag = 1;
for (i = 1; i <= 100; i++) {
sum = sum + flag*(1.0 / i);
flag = -flag;
}
printf("%lf\n", sum);
return 0;
}
//方法二:
int main() {
int i = 0;
double sum = 0.0;
for (i = 1; i <= 100; i++) {
if (i % 2 == 1)
sum = sum + (1.0 / i);
else
sum = sum -(1.0/ i);
}
printf("%lf\n", sum);
return 0;
}
(2)1-100所有整数中出现9的次数
int main() {
int i = 0;
int count = 0;
for (i = 1; i <= 100; i++) {
if (i % 10 ==9)
count++;
if (i / 10 == 9)
count++;
}
printf("%d\n", count);
return 0;
}
(3)输入一个值,为求和结果
int main() {
long long n = 0;
scanf("%lld", &n);
int i = 0;
long long sum = 0;
/*for (i = 1; i <= n; i++) {
sum += i;
}*/
sum = (1 + n) * n / 2;//等差数列求和公式
printf("%lld\n", sum);
return 0;
}