int main(void)
{
/* Declare and initialize variables. */
int v,z,k,j,n,action,function=0;
double a[5],b[5],c[5],scale=0.25,x,y,u;
char graph[21][61];
/* Infinite Loop So can Support Multi Task */
for(z=1;;z++)
{
/* Create An Initial Graph */
for(k=0;k<21;k++) j="0;j<61;j++)" k="0;k<21;k++)" j="0;j<61;j++)" k="0;k<21;k++)" j="0;j<61;j++)" action="4;" n="1;;n++)" action="=" action="=" action="3" action="=" function="0;" scale="0.25;" action="=">5)
action=5;
else
action=6;
}
/* If Over Function,Print Message*/
if(action==5)
{
printf("Maximum formulas exceeded.\n");
action=4;
}
/* Else Take The Coeefficient */
if(action==6)
{
printf("Coefficients (a b c): ");
scanf("%lf %lf "
"%lf",&a[function-1],&b[function-1],&c[function-1]);
action=7;
}
/* Continue to Generate The Graph */
if(action==7)
{
for(j=0;j<61;j++) x="scale*(j-30);" y="a[function-1]*x*x+b[function-1]*x+c[function-1];" u="(1/scale)*y;">=0.5)
u=(int)u+1;
k=10-(int)u;
if(k<0||k>20)
continue;
else
graph[k][j]='*';
}
action=8;
}
/* Print Out the Graph */
if(action==8)
{
for(k=0;k<21;k++) j="0;j<61;j++)" action="4;" action="=" k="0;k<21;k++)" j="0;j<61;j++)" k="0;k<21;k++)" j="0;j<61;j++)" function="=" v="0;v
u=(int)u+1;
k=10-(int)u;
if(k<0||k>20)
continue;
else
graph[k][j]='*';
}
/* Print It Out in Second Loop*/
action=8;
}
}
}
}
return 0;
}
No comments:
Post a Comment