Chinaunix首页 | 论坛 | 博客
  • 博客访问: 89013
  • 博文数量: 29
  • 博客积分: 0
  • 博客等级: 民兵
  • 技术积分: 281
  • 用 户 组: 普通用户
  • 注册时间: 2014-01-02 18:00
文章分类
文章存档

2014年(29)

我的朋友

分类: C/C++

2014-04-01 10:05:09

  
/*
 *****************************************************
 *  输入名字及生日,即可看到精彩内容
 *  已在VC++6.0下编译通过
 *  Author: 啊杜
 *  email : ttl7626@126.com
 *****************************************************
 */
# include < stdio.h >
# include
# include
# include < math.h >
int main ( void )
{
    int t, add = 0;
    char n[17];
    double y;
    unsigned m, i, j;
    printf ("My love, enter you name and birthday\n");
    printf ("The format like: adu19940710");
    printf ("\n");
    scanf ("%s", n);
    for (t = 0; t < 17; t++)
        add += n[t];
    if (1391 == add)
    {
    //  printf ("OK!\n");
        for (y = 1; y >=0; y -= 0.1)
        {
           m = asin (y) * (n[15]/5);
           for (i = 0; i < m; i++)
           {
                putchar (' ');
           }
           putchar ('*');
           for (; i < (n[1]-66) - m; i++)
           {
               if((n[0]-89) == i || (n[2]-94) == i)
                   putchar('+');
               else
                   if (i > (n[3]-93) && i < (n[4]-78) && (n[5]-117) == m)
                       putchar('+');
                   else
                       putchar (' ');
           }
           putchar ('*');
                    
           for (; i < (n[6]-59); i++)
           {
                if ((n[7]-66) + m == i || (n[8]-48) - m == i)
                    putchar('*');
                else if ((n[9]-3) - sqrt(25-(5-m)*(5-m)) == i || (n[9]-3) + sqrt(25-(5-m)*(5-m)) == i || (n[9]-4) - sqrt(25-(5-m)*(5-m)) == i || (n[9]-4) + sqrt(25-(5-m)*(5-m)) == i)
                    putchar('o');
                else
                    putchar(' ');
           }
           putchar ('\n');
        }
        for ( y = 0, j = 0; y >= -2; y -= 0.1 )
        {
            int yy = fabs(y) * 10;
            m = (acos(y*0.5) * 20) - 31;
            if (!(yy % 6))
                j++;
            for (i = 0; i < (n[12] + 10); i++)
            {
                if (m + j == i || 63 - m - j == i)
                    putchar('*');
                else if (y >= -0.6 && ( 38 - yy == i || yy + 26  == i))
                    putchar('v');
                else if (y >= -1.6 && y < -0.7 && (31 - sqrt(25-(12-yy)*(12-yy)) == i || 32 + sqrt(25-(12-yy)*(12-yy)) == i))
                        putchar('e');
                else if (-1.2 == y && i > (n[13]-20) && i < (n[14]-17))
                    putchar('e');
                else if ((yy == (n[16]-39) && i == 31) || ((i == 26) && yy == 14) || ((i == 28 || i == 34) && yy == 16))
                    putchar('e');
                else
                        putchar(' ');
            }
                     
            printf("\n");
        }
    }
    else
        printf ("It's not write to you, you see ge j8 a!\n");
    return 0;
}
阅读(1968) | 评论(0) | 转发(0) |
给主人留下些什么吧!~~