목차
1.Source
2.result
2.result
본문내용
0,440,"1");
outtextxy(180,440,"2");
outtextxy(250,440,"3");
outtextxy(325,440,"4");
outtextxy(395,440,"5");
outtextxy(465,440,"6");
outtextxy(535,440,"7");
for(i=0; i<560; i++)
P[i]=0.0;
x_term = 70.0;
for(i=0; i<560; i++)
{
min = i / x_term;
max = 1 + i / x_term;
for(j=0; j
{
if( N[j] >= min )
if( N[j] < max )
P[i]++ ;
}
}
setcolor(YELLOW);
x_term = 0.0;
for(i=0; i<560; i++)
{
x_term = 50 + i;
P[i] = 430 - ( P[i] * 1600 / NUM );
circle( x_term, P[i], 1);
}
exponential_graphic();
getch();
closegraph();
}
void exponential_graphic()
{
int i;
double x, x_term, y[560];
x_term = 70.0;
setcolor(RED);
for(i=0; i<560; i++)
{
x = i / x_term;
y[i] = para * exp( -1.0 * para * x );
}
for(i=0; i<560; i++)
{
x_term = 50 + i;
y[i] = 430 - ( y[i] * 1600 );
circle( x_term, y[i], 1);
}
}
Result
outtextxy(180,440,"2");
outtextxy(250,440,"3");
outtextxy(325,440,"4");
outtextxy(395,440,"5");
outtextxy(465,440,"6");
outtextxy(535,440,"7");
for(i=0; i<560; i++)
P[i]=0.0;
x_term = 70.0;
for(i=0; i<560; i++)
{
min = i / x_term;
max = 1 + i / x_term;
for(j=0; j
if( N[j] >= min )
if( N[j] < max )
P[i]++ ;
}
}
setcolor(YELLOW);
x_term = 0.0;
for(i=0; i<560; i++)
{
x_term = 50 + i;
P[i] = 430 - ( P[i] * 1600 / NUM );
circle( x_term, P[i], 1);
}
exponential_graphic();
getch();
closegraph();
}
void exponential_graphic()
{
int i;
double x, x_term, y[560];
x_term = 70.0;
setcolor(RED);
for(i=0; i<560; i++)
{
x = i / x_term;
y[i] = para * exp( -1.0 * para * x );
}
for(i=0; i<560; i++)
{
x_term = 50 + i;
y[i] = 430 - ( y[i] * 1600 );
circle( x_term, y[i], 1);
}
}
Result
소개글