数组A和数组B内容互换(数组一样大)
#include <stdio.h>
#include <stdlib.h>
void PrintArr(int* arr, int count);
int main()
{
int A[5] = { 1, 2, 3, 4, 5 };
int B[5] = { 22,23,24,25,26 };
int N = sizeof(A) / sizeof(A[0]);
int temp = 0;
printf(“交换前:\n”);
printf(“A:”);
PrintArr(A, N);
printf(“B:”);
PrintArr(B, N);
for (int i = 0; i < N; i++)
{
temp = A[i];
A[i] = B[i];
B[i] = temp;
}
printf("\n交换后:\n");
printf(“A:”);
PrintArr(A, N);
printf(“B:”);
PrintArr(B, N);
system(“pause”);
return 0;
}
void PrintArr(int* arr, int count)
{
printf("[ “);
for (int i = 0; i < count; i++)
{
printf(”%d “, *(arr + i));
}
printf(”]\n");
}
计算1/1-1/2+1/3-1/4+1/5 ⋯⋯ + 1/99 - 1/100 的值
#include<stdio.h>
#include<stdlib.h>
int main()
{
double sum = 0;
int i = 1;
for (i = 1; i <= 100; ++i)
{
if (i % 2 == 0)
{
sum -= (1 / i);
}
else
{
sum += (1 / i);
}
}
printf("%f\n", sum);
system(“pause”);
return 0;
}
1到 100 的所有整数中出现多少次数字9
#include<stdio.h>
#include<stdlib.h>
int main()
{
int count = 0;
for (int i = 1; i <= 100; ++i)
{
if (i % 10 == 9)
{
count++;
}
int temp = i;
while ((temp / 10) > 0)
{
if (temp % 10 == 9)
count++;
}
}
printf("%d", count);
system(“pause”);
return 0;
}