Графика на Си ++. Шестиугольник. Кораблик. Квадратики. Круги.


Шестиугольник.
# include
# include
# include
# include
# define PATH «d:\\work\\borlandc\\bin\\»

void xxx (int x, int y, int a)
{
setcolor (10) ;
line (x,y,x+a*sqrt(3)/2,y-a/2);
line (x+a*sqrt(3)/2,y-a/2,x+a*sqrt(3),y);
line (x+a*sqrt(3),y,x+a*sqrt(3),y+a);
line (x+a*sqrt(3),y+a,x+a*sqrt(3)/2,y+3*a/2);
line (x+a*sqrt(3)/2,y+3*a/2,x,y+a);
line (x,y+a,x,y);
}

void main(void)
{ int gdriver=DETECT;
int gmode;
int errorcode;
initgraph(&gdriver,&gmode,PATH);
errorcode=graphresult();
if(errorcode!=grOk)
{
printf(«Error%d\n»,errorcode);
puts(«Press for quit»);
getch();
return;
}

int a ;
printf («Vvedite dliny storoni \n») ;
scanf («%d», &a) ;
xxx (280,200, a) ;
getch () ;
closegraph() ;
}

Кораблик.

#include
#include
#include

#define PATH»d:\\work\\borlandc\\bin\\»
void korablik(int x,int y)
{ int k1[10];int k2[8];
k1[0]=x;k1[1]=y;
k1[2]=x+150;k1[3]=y;
k1[4]=x+120;k1[5]=y+30;
k1[6]=x+30;k1[7]=y+30;
k1[8]=x;k1[9]=y;
setfillstyle(HATCH_FILL,1);
setcolor(1);
fillpoly(5,k1);
k2[0]=x+70;k2[1]=y-60;
k2[2]=x+90;k2[3]=y-50;
k2[4]=x+70;k2[5]=y-40;
k2[6]=x+70;k2[7]=y-60;
setfillstyle(XHATCH_FILL,4);
setcolor(4);
fillpoly(4,k2);
line(x+40,y-10,x+70,y-40);
line(x+70,y-40,x+100,y-10);
line(x+100,y-10,x+40,y-10);
line(x+70,y-40,x+70,y);
}
void main(void)
{ int gdriver=DETECT;
int gmode;
int errorcode;
initgraph(&gdriver,&gmode,PATH);
errorcode=graphresult();
if(errorcode!=grOk)
{
printf(«ЋиЁЎЄ :%d\n»,errorcode);
puts(«„«п § ўҐа襭Ёп Їа®Ја ¬¬л ­ ¦¬ЁвҐ «);
getch();
return;
}
korablik(70,140);
getch();
closegraph();
}

Квадраты.
# include
# include
# include
# include
# define PATH «d:\\work\\borlandc\\bin\\»
void main(void)

{ int gdriver=DETECT;
int gmode;
int errorcode;
initgraph(&gdriver,&gmode,PATH);
errorcode=graphresult();
if(errorcode!=grOk)
{
printf(«Error%d\n»,errorcode);
puts(«Press for quit»);
getch();
return;
}

int d, k, z, x, y ;
printf («Vvedite koli4estvo kvadratov \n») ;
scanf («%d», &k) ;
z = k ;
printf («Vvedite rasstoyanie mezdy kvadratami \n») ;
scanf («%d», &d) ;
printf («Vvedite koordinati na4ala \n») ;
scanf («%d%d», &x, &y) ;
randomize () ;
for (k=0; k
# include
# include
# include
# define PATH «d:\\work\\borlandc\\bin\\»

void okr (int x, int y, int r, int c)

{
setcolor (c) ;
circle (x, y, r) ;
}
void main ()
{
int x, y ;
int r = 10 ;
# define dt 50
# define dx 5
int maxy ;
int maxx ;
int gdriver = DETECT ;
int gmode ;
int errorcode ;
initgraph (&gdriver, &gmode, PATH) ;
errorcode = graphresult () ;
if (errorcode==grOk)
{
x = 20 ;
y = 20 ;
maxy = getmaxy()-10 ;
maxx = getmaxx()-10 ;
while (y20 )
{
okr (x, y, r, RED) ;
delay(dt) ;
okr (x, y, r, BLACK) ;
x+=dx ;
y-=dx ;
}
closegraph() ;
}
else
{
printf («Error %d\n», errorcode) ;
puts («Press for quit») ;
getch () ;
}
}

Загрузка...