目录
1. 1+2+3……+n的值
int main() {
int n;
printf("请输入需要加到的n的值\n");
scanf("%d", &n);
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += i;
}
printf("结果为:%d", sum);
return 0;
}
2. 斐波那契数列 1 1 2 3 5 8……到第n位
int main() {
int n;
int a = 1, b = 1, c = 0;
scanf("%d",&n);
if (n == 1||n ==2) {
printf("%d", 1);
}
else {
for (int i = 0; i < n; i++) {
c = a + b;
a = b;
b = c;
printf("%5d", c);
}
}
return 0;
}
3. 输入一串数,判断一共几位
int main() {
long long num;
scanf("%lld", &num);
int count = 0;
while (num != 0) {
num /= 10;
count++;
}
printf("%d", count);
return 0;
}
4. 输入一串数,将它逆序输出
int main() {
int sum;
int res = 0;
scanf("%d", &sum);
int temp = sum;
int count = 0;
while (sum != 0) {
sum /= 10;
count++;
}
while (temp !=0) {
res += temp % 10 * (int)pow(10, count-1);//可以将这的sum-1和后面的sum--和为--sum
temp /= 10;
count--;
}
printf("%d", res);
return 0;
}
5. 猴子吃桃问题
int main() {
int day = 9;
int n = 1;
for (; day >= 1; day--) {
n += (n + 1) * 2;
}
printf("%d", n);
return 0;
}
6. 输入两个正整数,求它们的最大公约数和最小公倍数
int main() {
int m, n;
scanf("%d%d", &m, &n);
int min = m > n ? n : m;
for (int i = min; i >= 1; i--) {
if (m % i == 0 && n % i == 0) {
printf("最大公约数是:%d\n", i);
break;
}
}
int max = m > n ? m : n;
for (int i = 1; i <= min; i++) {
if ((i*max) % min == 0) {
printf("最小公倍数是:%d\n",max*i);
break;
}
}
return 0;
}