适用于初学者 将灸c殻會100箭==61--70
‐殻會61／
籾朕・嬉咫竃剋市眉叔侘・勣箔嬉咫竃10佩泌和夕・
1.殻會蛍裂・
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
2.殻會坿旗鷹・
#include "stdio.h"
#include "conio.h"
main()
{
int i,j;
int a[10][10];
printf("\n");
for(i=0;i<10;i++)
{
a[i][0]=1;
a[i][i]=1;
}
for(i=2;i<10;i++)
for(j=1;j<i;j++)
a[i][j]=a[i-1][j-1]+a[i-1][j];
for(i=0;i<10;i++)
{
for(j=0;j<=i;j++)
printf("%5d",a[i][j]);
printf("\n");
}
getch();
}
==============================================================
‐殻會62／
籾朕・僥楼putpixel鮫泣。
1.殻會蛍裂・
2.殻會坿旗鷹・
#include "stdio.h"
#include "conio.h"
#include "graphics.h"
main()
{
int i,j,driver=VGA,mode=VGAHI;
initgraph(&driver,&mode,"");
setbkcolor(YELLOW);
for(i=50;i<=230;i+=20)
for(j=50;j<=230;j++)
putpixel(i,j,1);
for(j=50;j<=230;j+=20)
for(i=50;i<=230;i++)
putpixel(i,j,1);
getch();
}
==============================================================
‐殻會63／
籾朕・鮫蓉垈ellipse
1.殻會蛍裂・
2.殻會坿旗鷹・
#include "stdio.h"
#include "graphics.h"
#include "conio.h"
main()
{
int x=260,y=160,driver=VGA,mode=VGAHI;
int num=20,i;
int top,bottom;
initgraph(&driver,&mode,"");
top=y-30;
bottom=y-30;
for(i=0;i<num;i++)
{
ellipse(x,250,0,360,top,bottom);
top-=5;
bottom+=5;
}
getch();
}
==============================================================
‐殻會64／
籾朕・旋喘ellipse and rectangle 鮫夕。
1.殻會蛍裂・
2.殻會坿旗鷹・
#include "stdio.h"
#include "graphics.h"
#include "conio.h"
main()
{
int driver=VGA,mode=VGAHI;
int i,num=15,top=50;
int left=20,right=50;
initgraph(&driver,&mode,"");
for(i=0;i<num;i++)
{
ellipse(250,250,0,360,right,left);
ellipse(250,250,0,360,20,top);
rectangle(20-2*i,20-2*i,10*(i+2),10*(i+2));
right+=5;
left+=5;
top+=10;
}
getch();
}
==============================================================
‐殻會65／
籾朕・匯倖恷單胆議夕宛。
1.殻會蛍裂・
2.殻會坿旗鷹・
#include "graphics.h"
#include "math.h"
#include "dos.h"
#include "conio.h"
#include "stdlib.h"
#include "stdio.h"
#include "stdarg.h"
#define MAXPTS 15
#define PI 3.1415926
struct PTS
{
int x,y;
};
double AspectRatio=0.85;
void LineToDemo(void)
{
struct viewporttype vp;
struct PTS points[MAXPTS];
int i, j, h, w, xcenter, ycenter;
int radius, angle, step;
double rads;
printf(" MoveTo / LineTo Demonstration" );
getviewsettings( &vp );
h = vp.bottom - vp.top;
w = vp.right - vp.left;
xcenter = w / 2; /* Determine the center of circle */
ycenter = h / 2;
radius = (h - 30) / (AspectRatio * 2);
step = 360 / MAXPTS; /* Determine # of increments */
angle = 0; /* Begin at zero degrees */
for( i=0 ; i<MAXPTS ; ++i )
{ /* Determine circle intercepts */
rads = (double)angle * PI / 180.0; /* Convert angle to radians */
points[i].x = xcenter + (int)( cos(rads) * radius );
points[i].y = ycenter - (int)( sin(rads) * radius * AspectRatio );
angle += step; /* Move to next increment */
}
circle( xcenter, ycenter, radius ); /* Draw bounding circle */
for( i=0 ; i<MAXPTS ; ++i )
{ /* Draw the cords to the circle */
for( j=i ; j<MAXPTS ; ++j )
{ /* For each remaining intersect */
moveto(points[i].x, points[i].y); /* Move to beginning of cord */
lineto(points[j].x, points[j].y); /* Draw the cord */
}
}
}
main()
{
int driver,mode;
driver=CGA;mode=CGAC0;
initgraph(&driver,&mode,"");
setcolor(3);
setbkcolor(GREEN);
LineToDemo();
getch();
}
==============================================================
‐殻會66／
籾朕・補秘3倖方a,b,c・梓寄弌乏會補竃。
1.殻會蛍裂・旋喘峺寞圭隈。
2.殻會坿旗鷹・
/*pointer*/
#include "stdio.h"
#include "conio.h"
main()
{
int n1,n2,n3;
int *pointer1,*pointer2,*pointer3;
printf("please input 3 number:n1,n2,n3:");
scanf("%d,%d,%d",&n1,&n2,&n3);
pointer1=&n1;
pointer2=&n2;
pointer3=&n3;
if(n1>n2) swap(pointer1,pointer2);
if(n1>n3) swap(pointer1,pointer3);
if(n2>n3) swap(pointer2,pointer3);
printf("the sorted numbers are:%d,%d,%d\n",n1,n2,n3);
getch();
}
swap(p1,p2)
int *p1,*p2;
{
int p;
p=*p1;
*p1=*p2;
*p2=p;
}
==============================================================
‐殻會67／
籾朕・補秘方怏・恷寄議嚥及匯倖圷殆住算・恷弌議嚥恷朔匯倖圷殆住算・補竃方怏。
1.殻會蛍裂・矛再膿議慕嶄基宛嗤諒籾。
2.殻會坿旗鷹・
#include "stdio.h"
#include "conio.h"
main()
{
int number[10];
input(number);
max_min(number);
output(number);
getch();
}
input(number)
int number[10];
{
int i;
for(i=0;i<9;i++)
scanf("%d,",&number[i]);
scanf("%d",&number[9]);
}
max_min(array)
int array[10];
{
int *max,*min,k,l;
int *p,*arr_end;
arr_end=array+10;
max=min=array;
for(p=array+1;p<arr_end;p++)
if(*p>*max) max=p;
else if(*p<*min) min=p;
k=*max;
l=*min;
*p=array[0];array[0]=l;l=*p;
*p=array[9];array[9]=k;k=*p;
return;
}
output(array)
int array[10];
{
int *p;
for(p=array;p<array+9;p++)
printf("%d,",*p);
printf("%d\n",array[9]);
}
==============================================================
‐殻會68／
籾朕・嗤n倖屁方・聞凪念中光方乏會・朔卞m倖了崔・恷朔m倖方延撹恷念中議m倖方
1.殻會蛍裂・
2.殻會坿旗鷹・
#include "stdio.h"
#include "conio.h"
main()
{
int number[20],n,m,i;
printf("the total numbers is:");
scanf("%d",&n);
printf("back m:");
scanf("%d",&m);
for(i=0;i<n-1;i++)
scanf("%d,",&number[i]);
scanf("%d",&number[n-1]);
move(number,n,m);
for(i=0;i<n-1;i++)
printf("%d,",number[i]);
printf("%d",number[n-1]);
getch();
}
move(array,n,m)
int n,m,array[20];
{
int *p,array_end;
array_end=*(array+n-1);
for(p=array+n-1;p>array;p--)
*p=*(p-1);
*array=array_end;
m--;
if(m>0)
move(array,n,m);
}
==============================================================
‐殻會69／
籾朕・嗤n倖繁律撹匯筈・乏會電催。貫及匯倖繁蝕兵烏方・貫1欺3烏方・・群烏欺3議繁曜竃
筈徨・諒恷朔藻和議頁圻栖及叱催議椎了。
1. 殻會蛍裂・
2.殻會坿旗鷹・
#include "stdio.h"
#include "conio.h"
#define nmax 50
main()
{
int i,k,m,n,num[nmax],*p;
printf("please input the total of numbers:");
scanf("%d",&n);
p=num;
for(i=0;i<n;i++)
*(p+i)=i+1;
i=0;
k=0;
m=0;
while(m<n-1)
{
if(*(p+i)!=0) k++;
if(k==3)
{
*(p+i)=0;
k=0;
m++;
}
i++;
if(i==n) i=0;
}
while(*p==0) p++;
printf("%d is left\n",*p);
getch();
}
==============================================================
‐殻會70／
籾朕・亟匯倖痕方・箔匯倖忖憲堪議海業・壓main痕方嶄補秘忖憲堪・旺補竃凪海業。
1.殻會蛍裂・
2.殻會坿旗鷹・
#include "stdio.h"
#include "conio.h"
main()
{
int len;
char *str[20];
printf("please input a string:\n");
scanf("%s",str);
len=length(str);
printf("the string has %d characters.",len);
getch();
}
length(p)
char *p;
{
int n;
n=0;
while(*p!='\0')
{
n++;
p++;
}
return n;
}
