เฉลยภาษาซี แต่ละJob

เลขเรียง**

#include
#include
main()
{
int box[50],a,b,i,j;
for (i=1;;i++)
{
printf ("box [%d] = ",i);
scanf("%d",&box[i]);
if (box[i]<0) break;
}
i=i-1;
for (a=0;a {
if(box[a]>box[a+1])
b=0;
}
if(b==0)printf ("The elements in array a are not in sequence");
else printf("The elements in array a are in sequencen");

getch();
}

++++++++++++++++++++++++++++++++++++++++++++++++
บวกลบผลหาร
#include
#include
main()
{
float a,b,sum,n ;
a=0;
for(n=1;n<=97;n=n+2)
a=a+n/(n+1);
for(n=2;n<=96;n=n+2)
b=b+n/(n+1);
sum=a-b;
printf ("sum = %f",sum);

getch();
}

++++++++++++++++++++++++++++++++++++++++++++++++
สี่เหลี่ยมดาว#include
#include
main()
{
int x,y,row,colum;
printf(" input your row : ");
scanf ( "%d" ,&row),
printf(" input your colum : ");
scanf( "%d" ,&colum );
for( x=1;x<=row;x=x+1)
{
for( y=1;y<=colum;y=y+1)
{
if (x==1||x==row)
printf ("*" );
else if (y==1||y==colum)
printf("*");
else printf("+");
}
printf("n");
}
getch();
}

++++++++++++++++++++++++++++++++++++++++++++++++
แมททริค
#include
#include
main()
{
int matrix[20][20]={0},max[20]={0},maxest,n,i,j;

printf("Matrix nxn ; n= ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
{printf("Matrix[%d][%d]= ",i,j);
scanf("%d",&matrix[i][j]);}
max[i]=matrix[i][1];
}
for(i=1;i<=n;i++)
{for(j=2;j<=n;j++)
{if(max[i] max[i]=matrix[i][j];}
}
maxest=max[1];
for(i=2;i<=n;i++)
{if(maxest maxest=max[i];}

for(i=1;i<=n;i++)
{printf("The max element in row %d = %dn",i,max[i]);}

printf("The max of all elements is = %d",maxest);

getch();

}
+++++++++++++++++++++++++++++++++++++++++++++++
ป้อนข้อมูลคะแนน และ ปริ้นดาวออกแทนจำนวน
#include
#include
main()
{int box[100]={0},score[11]={0},i,j,n;
for(i=1;;i++)
{printf("score[%d]= ",i);
scanf("%d",&box[i]);
if(box[i]<0)break;}
for(j=1;j{for(n=0;n<=10;n++)
{if(box[j]==n)score[n]++;}
}

printf("----------------------------n");
printf("Score Frequencyn");
printf("----------------------------n");
for(i=0;i<=10;i++)
{printf(" n%-13d",i);
for(j=1;j<=score[i];j++)
{printf("*");}
}
printf("nn----------------------------n");
getch();
}

Create Date : 08 กรกฎาคม 2554		0 comments
Last Update : 8 กรกฎาคม 2554 12:21:07 น.
Counter : 1282 Pageviews.
Share Tweet