[恢]hdu 2074

2011-12-17 07:47:56

地址：http://acm.hdu.edu.cn/showproblem.php?pid=2074

题意：中文。模拟。

代码：

# include <stdio.h># include <string.h>

char out[110][110] ;

void gao(int n, char a[2]){    memset (out, 0, sizeof(out)) ;if (n == 1){        putchar (a[0]) ;        puts ("") ;return ;    }

int s = 0, t = n-1, tm, i, j ;int flag = ((n+1)/2 + 1) % 2 ;for (tm = 0 ; tm < (n+1)/2 ; tm++)    {for (i = s ; i <= t ; i++)for(j = s; j <= t ; j++)out[i][j] = a[flag] ;        flag = !flag ;        s++, t-- ;    }out[0][0] = out[0][n-1] = out[n-1][0] = out[n-1][n-1] = ' ' ;for (i = 0 ; i < n ; i++)        puts (out[i]) ;}

int main (){int num, nCase = 1 ;char ch[2];while (~scanf ("%d %c %c%*c", &num, &ch[0], &ch[1]))    {if (nCase++ != 1) printf ("\n") ;        gao(num, ch) ;    }return 0 ;}

转载于:https://www.cnblogs.com/lzsz1212/archive/2012/01/06/2315219.html

[恢]hdu 2074相关推荐

hdu 2074 叠框
http://acm.hdu.edu.cn/showproblem.php?pid=2074 这道题目以前做过的,用调用函数将map一圈一圈的画,我觉得这个很容易理解先画最外面的一圈,直到x>y ...
[恢]hdu 2015
2011-12-14 05:49:09 地址:http://acm.hdu.edu.cn/showproblem.php?pid=2015 题意:中文,忒麻烦了. 代码: # include < ...
[恢]hdu 2014
2011-12-12 05:46:08 地址:http://acm.hdu.edu.cn/showproblem.php?pid=2014 题意:中文题. mark:wa了3次!!!因为敲错变量!!! ...
[恢]hdu 1412
2011-12-20 14:46:51 地址:http://acm.hdu.edu.cn/showproblem.php?pid=1412 题意:中文. 代码: # include <stdio ...
[恢]hdu 2098
2011-12-16 04:54:26 地址:http://acm.hdu.edu.cn/showproblem.php?pid=2098 题意:中文,水.直接爆. 代码: # include < ...
[恢]hdu 1259
2011-12-17 06:39:22 地址:http://acm.hdu.edu.cn/showproblem.php?pid=1259 题意:中文.水题,直接模拟. 代码: # include & ...
[恢]hdu 2524
2011-12-14 05:20:24 地址:http://acm.hdu.edu.cn/showproblem.php?pid=2524 题意:中文. mark:有意思.2个维度分开考虑,结果相乘, ...
[恢]hdu 1028
2011-12-16 08:28:00 地址:http://acm.hdu.edu.cn/showproblem.php?pid=1028 题意:一个整数n,可以表示为多少种和的形式. mark:dp ...
[恢]hdu 1279
2011-12-20 05:17:41 地址:http://acm.hdu.edu.cn/showproblem.php?pid=1279 题意:中文.没啥好说的. 代码: # include < ...

[恢]hdu 2074

[恢]hdu 2074相关推荐

最新文章

热门文章