1.交换两个数组的内容(数组一样大)
#include<stdio.h>
#include<stdlib.h>
int main()
{
int a[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
int b[10] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
for (int i = 0; i < 10; i++)
{
int change = a[i];
a[i] = b[i];
b[i] = change;
}
printf("交换后的数组a为:");
for (int i = 0; i < 10; i++)
{
printf("%d ",a[i]);
}
printf("\n");
printf("交换后的数组b为:");
for (int i = 0; i < 10; i++)
{
printf("%d ", b[i]);
}
printf("\n");
system("pause");
return 0;
}
2.计算1/1-1/2+1/3-1/4+1/5-......+1/99-1/100的值
基础篇
#include<stdio.h>
#include<stdlib.h>
int main()
{
int i = 1;
float sum = 0.0;
for (; i <= 100; i++)
{
if (i % 2 != 0)
{
sum += 1.0 / i;
}
else
{
sum -= 1.0 / i;
}
}
printf("经计算:1/1-1/2+1/3-1/4+1/5-......+1/99-1/100=%f\n", sum);
system("pause");
return 0;
}
进阶篇
int flage = 1;
for (; i <= 100; i++)
{
sum += 1.0 / (i*flage);
flage = -flage;
}
3.计算1到 100 的所有整数中出现多少次数字9
基础篇
#include<stdio.h>
#include<stdlib.h>
int main()
{
int count = 0;
int shiWei = 0;
int geWei = 0;
for (int i = 1; i <= 100; i++)
{
//1~100之间不是个位有9就是十位有9
shiWei = i / 10;
if (9 == shiWei)
{
count++;
geWei = i - 90;
if (9 == geWei)
{
count++;
}
}//90~100之间数字9的个数
else if (0 == shiWei)
{
if (9 == i)
{
count++;
}
}//1~9之间数字9的个数
else
{
geWei = i - shiWei * 10;
if (9 == geWei)
{
count++;
}
}//10~89之间数字9的个数
}
printf("1~100之间所有整数中出现:%d次数字9\n",count);
system("pause");
return 0;
}
进阶篇
//100里面肯定是没有9的
for (int i = 1; i < 100; i++)
{
geWei = i % 10;
if (9 == geWei)
{
count++;
}
shiWei = i / 10;
if (9 == shiWei)
{
count++;
}
}