![](https://i-blog.csdnimg.cn/blog_migrate/17f8dedd3860bdd0ee127502a5a160c1.png)
#include <stdio.h>
int main(int argc, const char *argv[])
{
// 作业1:
int i;
float j=0;
printf("请输入当月利润:");
scanf("%d",&i);
if(i<=100000)
{
j = i * 0.1;
}
else if(i <= 200000)
{
j = (i-100000)*0.75 + 100000*0.1;
}
else if(i <= 400000)
{
j = (i-200000)*0.5 + 100000*0.75 + 100000*0.1;
}
else if(i <= 600000)
{
j = (i-400000)*0.3 + 200000*0.5 + 100000*0.75 + 100000 * 0.1;
}
else if(i <= 1000000)
{
j = (i-600000)*1.5 + 200000*0.3 + 200000*0.5 + 100000*0.75 + 100000 * 0.1;
}
else
{
j = (i-1000000)*1 + 400000*1.5 + 200000*0.3 + 200000*0.5 + 100000*0.75 + 100000 * 0.1;
}
printf("应发的奖金总数为:%.2f\n",j);
float a,b,sum;
char fa;
printf("请输入算式:");
scanf("%f %c %f",&a,&fa,&b);
switch(fa)
{
case '+':
sum = a + b;
printf("%.2f %c %.2f = %.2f\n",a,fa,b,sum);
break;
case '-':
sum = a - b;
printf("%.2f %c %.2f = %.2f\n",a,fa,b,sum);
break;
case '*':
sum = a * b;
printf("%.2f %c %.2f = %.2f\n",a,fa,b,sum);
break;
case '/':
sum = a / b;
printf("%.2f %c %.2f = %.2f\n",a,fa,b,sum);
break;
}
return 0;
}
![](https://i-blog.csdnimg.cn/blog_migrate/b1685d0945119c2ad4e55c1783b9aea6.jpeg)
#include <stdio.h>
int main(int argc, const char *argv[])
{
// 作业1
int i,j;
for(i=0;i<4;i++)
{
for(j=0;j<(2*i)+1;j++)
{
printf("*");
}
printf("\n");
}
// 作业2
int i,j,k;
for(i=0;i<4;i++)
{
for(k=0;k<3-i;k++)
{
printf(" ");
}
for(j=0;j<(2*i)+1;j++)
{
printf("*");
}
printf("\n");
}
//作业3
int i,j,k,n=0;
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
for(k=0;k<5;k++)
{
if(i != j && i != k && j != k)
{
printf("%d%d%d\n",i,j,k);
n++;
}
}
}
}
printf("能组成%d组\n",n);
return 0;
}
![](https://i-blog.csdnimg.cn/blog_migrate/2df0617568645cde44602373bd5649a7.jpeg)
#include <stdio.h>
int main(int argc, const char *argv[])
{
//作业4
int i;
double fz=2,fm=1,next_fz,next_fm,sum=2/1;
for(i=0;i<19;i++)
{
next_fz = fz + fm;
next_fm = fz;
sum = sum + next_fz/next_fm;
fz = next_fz;
fm = next_fm;
}
printf("sum=%lf\n",sum);
//作业5
int sum=1,q,i;
for(i=0;i<9;i++)
{
q = (sum+1) * 2;
sum = q;
}
printf("共有%d个\n",sum);
return 0;
}