C语言算法16-26
tainqing
|
来自：广东 茂名
|
浏览46次
|
提问时间：11-16 21:17
|
回答数量：1
16
m
zhlei81 2005-1-22 11:30
--------------------------------------------------------------------------------
4
1.
2.
main()
{
int a,b,num1,num2,temp;
printf(please input two numbers:
);
scanf(%d,%d,&num1,&num2);
if(num1 { temp=num1;
num1=num2;
num2=temp;
}
a=num1;b=num2;
while(b!=0)/*
{
temp=a%b;
a=b;
b=temp;
}
printf(gongyueshu:%d
,a);
printf(gongbeishu:%d
,num1*num2/a);
}
==============================================================
17
1.
2.
#include stdio.h
main()
{char c;
int letters=0,space=0,digit=0,others=0;
printf(please input some characters
);
while((c=getchar())!="
")
{
if(c>="a"&&c<="z"||c>="A"&&c<="Z")
letters++;
else if(c==" ")
space++;
else if(c>="0"&&c<="9")
digit++;
else
others++;
}
printf(all in all:char=%d space=%d digit=%d others=%d
,letters,
space,digit,others);
}
==============================================================
18
s=a+aa+aaa+aaaa+aa...a
5
1.
2.
main()
{
int a,n,count=1;
long int sn=0,tn=0;
printf(please input a and n
);
scanf(%d,%d,&a,&n);
printf(a=%d,n=%d
,a,n);
while(count<=n)
{
tn=tn+a;
sn=sn+tn;
a=a*10;
++count;
}
printf(a+aa+...=%ld
,sn);
}
==============================================================
19
“
1000
1.
2.
main()
{
static int k[10];
int i,j,n,s;
for(j=2;j<1000;j++)
{
n=-1;
s=j;
for(i=1;i {
if((j%i)==0)
{ n++;
s=s-i;
k[n]=i;
}
}
if(s==0)
{
printf(%d is a wanshu,j);
for(i=0;i printf(%d,,k);
printf(%d
,k[n]);
}
}
}
==============================================================
20
100
10
1.
2.
main()
{
float sn=100.0,hn=sn/2;
int n;
for(n=2;n<=10;n++)
{
sn=sn+2*hn;/*
hn=hn/2; /*
}
printf(the total of road is %f
,sn);
printf(the tenth is %f meter
,hn);
} 21
10
1.
2.
main()
{
int day,x1,x2;
day=9;
x2=1;
while(day>0)
{x1=(x2+1)*2;/*
x2=x1;
day--;
}
printf(the total is %d
,x1);
}
==============================================================
22
a,b,c
a
1.
2.
main()
{
char i,j,k;/*i
for(i="x";i<="z";i++)
for(j="x";j<="z";j++)
{
if(i!=j)
for(k="x";k<="z";k++)
{ if(i!=k&&j!=k)
{ if(i!="x"&&k!="x"&&k!="z")
printf(order is a--%c b--%c c--%c
,i,j,k);
}
}
}
}
==============================================================
23
*
***
******
********
******
***
*
1.
for
2.
main()
{
int i,j,k;
for(i=0;i<=3;i++)
{
for(j=0;j<=2-i;j++)
printf( );
for(k=0;k<=2*i;k++)
printf(*);
printf(
);
}
for(i=0;i<=2;i++)
{
for(j=0;j<=i;j++)
printf( );
for(k=0;k<=4-2*i;k++)
printf(*);
printf(
);
}
}
==============================================================
24
2/1
1.
2.
main()
{
int n,t,number=20;
float a=2,b=1,s=0;
for(n=1;n<=number;n++)
{
s=s+a/b;
t=a;a=a+b;b=t;/*
}
printf(sum is %9.6f
,s);
}
==============================================================
25嵌入式学习企鹅要妖气呜呜吧久零就要
1+2!+3!+...+20!
1.
2.
main()
{
float n,s=0,t=1;
for(n=1;n<=20;n++)
{
t*=n;
s+=t;
}
printf(1+2!+3!...+20!=%e
,s);
}
==============================================================
26
5!
1.
2.
#include stdio.h
main()
{
int i;
int fact();
for(i=0;i<5;i++)
printf(40:%d!=%d
,i,fact(i));
}
int fact(j)
int j;
{
int sum;
if(j==0)
sum=1;
else
sum=j*fact(j-1);
return sum;
}
==============================================================
工艺分类
