//输出表格
void biaoge(int year, int month)
{
printf("日\t一\t二\t三\t四\t五\t六\t\n\n");
int day = juli(year, month + 1) - (juli(year, month));
int i;
int xingqishu;
xingqishu = xingqi(year, month);
int count = 0;
int j;
for(j = 0; j < xingqishu; j++)
{
printf(" \t");
count++;
if(count % 7 == 0)
printf("\n");
}
// i = j; 不能用i继承j的值。
int num = 0; //不能从1开始。
for(i = 0; i < day; i++)
{
printf("%d\t", ++num);
count++;
if(count % 7 == 0)
printf("\n");
}
printf("\n\n");
// printf("\n%d月份有%d天。\n", month, day);
}
void julia(t_env *en)
{
int i;
double tmp;
en->x = 0;
while (en->x++ < en->image_x)
{
en->y = 0;
while (en->y++ < en->image_y)
{
i = juli(en);
while (i++ < en->iter && en->zr * en->zr + en->zi * en->zi < 4)
{
tmp = en->zr;
en->zr = (en->zr * en->zr) - (en->zi * en->zi) + en->cr;
en->zi = 2 * (en->zi * tmp) + en->ci;
}
if (i == en->iter)
output(en, 0, 0, 0);
else
output(en, i * 200 / en->iter - en->blue - 200, i * 200 /
en->iter - en->green - 200, i * 200 / en->iter -
en->red - 240);
}
}
}
//判断这一年该月的第一天是星期几
int xingqi(int year, int month)
{
int a[7] = {0, 1, 2, 3, 4, 5, 6};
int num;
num = juli(year, month);
int i = num % 7;
return a[i + 1];
}
