spoj 16891 Character Patterns (Act 8)

Print a regular grid pattern with diamond-like base elements. Use the \ (backslash) and the / (slash) characters to print the borders and the * (asterisk) to print the inner part of the diamonds. Use . (dots) to fill the rest of the space.

Input

You are given t - the number of test cases and for each of the test cases three positive integers: r - the number of rows, c - the number of columns in the grid and s - the size of each diamond.

Output

For each of the test cases output the requested pattern (please have a look at the example). Use one line break in between successive patterns.

Example

Input:
3
3 1 2 
4 4 1 
2 5 2

Output:
./\.
/**\
\**/
.\/.
./\.
/**\
\**/
.\/.
./\.
/**\
\**/
.\/.

/\/\/\/\
\/\/\/\/
/\/\/\/\
\/\/\/\/
/\/\/\/\
\/\/\/\/
/\/\/\/\
\/\/\/\/

./\../\../\../\../\.
/**\/**\/**\/**\/**\
\**/\**/\**/\**/\**/
.\/..\/..\/..\/..\/.
./\../\../\../\../\.
/**\/**\/**\/**\/**\
\**/\**/\**/\**/\**/
.\/..\/..\/..\/..\/.
题意:给出输出菱形的行数及列数,及size,输出上面所示的图形

思路:关键就是判断在菱形内,可以使用在四条直线的上面或者下面来判断

代码如下:

<?php
	$debug = false;
	$file = STDIN;

	if ($debug)
	{
		$file = fopen("./spoj.txt", "r");
	}


	$t = trim(fgets($file));
	while ($t--)
	{
		$line = trim(fgets($file));
		$data = explode(' ', $line);
		$r = intval($data[0]);
		$c = intval($data[1]);
		$s = intval($data[2]);

		$tmp = 2 * $s;
		$mod1 = $s - 1;
		$mod2 = $s;
		$mod = 2 * $s;
		$row = $r * $tmp;
		$col = $c * $tmp;

		for ($i = 0; $i < $row; $i++)
		{
			for ($j = 0; $j < $col; $j++)
			{
				if ($mod1 == ($i + $j) % $tmp) echo '/';
				else if ($mod2 == abs($i - $j) % $tmp) echo '\\';
				else if (inner($i, $j, $s)) echo '*';
				else echo '.';	
			}
			echo PHP_EOL;
		}

		
		if (0 != $t) echo PHP_EOL; 
	}

	if ($debug) fclose($file);

	function inner($x, $y, $s)
	{
		$tmp = 2 * $s;
		while ($x > $tmp) $x -= $tmp;
		while ($y > $tmp) $y -= $tmp;

		if ($x + $y - $s + 1 <= 0)
		{
			 return false;
		}
		if ($y - $x - $s >= 0) 
		{
			return false;
		}
		if ($y + $x - 3 * $s + 1>= 0) 
		{
			return false;
		}
		if ($y - $x + $s <= 0) 
		{
			return false;
		}

		return true;
	}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

kgduu

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值