hdu4706!【模拟】

/*Children's Day
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 846    Accepted Submission(s): 543


Problem Description
Today is Children's Day. Some children ask you to output a big letter 'N'. 'N' is constituted by two vertical linesand one diagonal.
 Each pixel of this letter is a character orderly. No tail blank is allowed.
For example, this is a big 'N' start with 'a' and it's size is 3.

a ebdfc g

Your task is to write different 'N' from size 3 to size 10. The pixel character used is from 'a' to 'z' continuously and periodic
('a' is reused after 'z').

Input
This problem has no input.
 

Output
Output different 'N' from size 3 to size 10. There is no blank line among output.

Sample Output
[pre]
a e
bdf
c g
h  n
i mo
jl p
k  q
.........
r        j
[/pre]

Hint
Not all the resultsare listed in the sample. There are just some lines. The ellipsis expresseswhat you should write.
 
 

Source
2013 ACM/ICPC Asia Regional Online —— Warmup 
*/
#include<stdio.h>
#include<string.h>
int main()
{
	int i, j, k;
	char s[11][11], ch[26], num = 0;
	ch[0] = 'a';
	for(i = 1; i < 26; i++)
	ch[i] = ch[i-1] + 1;
	for( i = 3; i < 11;  i++)
	{
		memset(s,' ',sizeof(s));
		k = 0;
		for(j = 0; j <i; j++)
		{
			s[j][k] = ch[num++];
			if(num == 26) 
			num = 0;
		}
		k++;
		for(j = i-2; j >= 0; j--, k++)
		{
			s[j][k] = ch[num++];
			if(num == 26)
			num = 0;
		}
		for(j = 1; j < i; j++)
		{
			s[j][k-1] = ch[num++];
			if(num == 26)
			num = 0;
		}
		for( j = 0; j < i; j++)
		{
			for(k = 0; k <= i-1; k++)
			printf("%c",s[j][k]);
			printf("\n");
		}
	}
	return 0;
}

题意:用26个小写字母排列成‘N'字形,尺寸由3*3 ~10*10,字母顺序由小到大循环使用。

思路:开一个数组模拟即可。

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
根据提供的引用内容,HDU1622是一道关于二叉树的题目,要求读入一系列二叉树的节点信息,输出它们的层序遍历结果。如果输入的二叉树不完整或存在重复节点,则输出"not complete"。下面是Java的实现代码: ```java import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { static class Node { int val; Node left, right; public Node(int val) { this.val = val; } } public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { String s = sc.nextLine(); if (s.isEmpty()) { continue; } String[] nodes = s.split("\\s+"); Node root = new Node(Integer.parseInt(nodes[0].substring(1))); Queue<Node> queue = new LinkedList<>(); queue.offer(root); boolean isComplete = true; for (int i = 1; i < nodes.length - 1; i += 2) { Node cur = queue.poll(); if (!nodes[i].equals("()")) { cur.left = new Node(Integer.parseInt(nodes[i].substring(1))); queue.offer(cur.left); } else { isComplete = false; } if (!nodes[i + 1].equals("()")) { cur.right = new Node(Integer.parseInt(nodes[i + 1].substring(0, nodes[i + 1].length() - 1))); queue.offer(cur.right); } else { isComplete = false; } } if (!isComplete) { System.out.println("not complete"); continue; } StringBuilder sb = new StringBuilder(); queue.offer(root); while (!queue.isEmpty()) { Node cur = queue.poll(); sb.append(cur.val).append(" "); if (cur.left != null) { queue.offer(cur.left); } if (cur.right != null) { queue.offer(cur.right); } } System.out.println(sb.toString().trim()); } } } ```

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值