CodeForces 118B Presentfrom Lena
来源:互联网 发布:里基戴维斯刷数据 编辑:程序博客网 时间:2024/05/18 01:22
[题目链接] (http://codeforces.com/problemset/problem/118/B)
Description
Vasya’s birthday is approaching and Lena decided to sew a patterned handkerchief to him as a present. Lena chose digits from 0 to n as the pattern. The digits will form a rhombus. The largest digit n should be located in the centre. The digits should decrease as they approach the edges. For example, for n = 5 the handkerchief pattern should look like that:
0 0 1 0 0 1 2 1 0 0 1 2 3 2 1 0 0 1 2 3 4 3 2 1 0 0 1 2 3 4 5 4 3 2 1 0 0 1 2 3 4 3 2 1 0 0 1 2 3 2 1 0 0 1 2 1 0 0 1 0 0
Your task is to determine the way the handkerchief will look like by the given n.
Iput
The first line contains the single integer n (2 ≤ n ≤ 9).
Output
Print a picture for the given n. You should strictly observe the number of spaces before the first digit on each line. Every two adjacent digits in the same line should be separated by exactly one space. There should be no spaces after the last digit at the end of each line.
Sample Input
input
2
output
0 0 1 0 0 1 2 1 0 0 1 0 0
input
3
output
0 0 1 0 0 1 2 1 0 0 1 2 3 2 1 0 0 1 2 1 0 0 1 0 0
题意:
额额,没什么好讲的啊,真心水的一逼,不过有一点要注意哦,最后输出0时后面无空格,直接换行(倒福啦,像不像(^o^)/~)
代码如下:
#include <stdio.h>void fun(int x){ int i; printf("0"); if (x!=0) { for (i=1;i<x;i++) printf(" %d",i); for (i=x;i>=0;i--) printf(" %d",i); } printf("\n");}int main(){ int n,i,j; scanf("%d",&n); for (i=0;i<n;i++) { for (j=(n-i)*2;j;j--) printf(" "); fun(i); } for (i=n;i>=0;i--) { for (j=(n-i)*2;j;j--) printf(" "); fun(i); } return 0;}
- CodeForces 118B Presentfrom Lena
- Codeforces 118B Present from Lena
- codeforces 118B Present from Lena
- Codeforces Beta Round #89 (Div. 2) B. Present from Lena
- B. Present from Lena
- lena
- CodeForces-118B-PresentFromLena
- codeforces B
- codeforces B
- codeforces B
- codeforces B
- 【codeforces】678 F. Lena and Queries【线段树维护凸壳】
- lena图
- Lena原型
- CodeForces 626B CodeForces 626B【暴力】
- CodeForces 841B (B) 博弈
- codeforces 134B
- codeforces#98 b
- JavaWeb学习总结(十三)——使用Session防止表单重复提交
- 寒假作业——分数求和
- 黑马程序员------代码片段记录
- 【java编程】String之重写trim方法
- CentOS/Linux 安装VNCserver
- CodeForces 118B Presentfrom Lena
- shell 编程控制语句if
- 计算器:中缀表达式转后缀表达式
- Expectation-Maximization(EM) 算法
- 【Android入门 十二】animation动画效果
- AsyncTask使用的问题
- 如何分析解决Android ANR
- 【POJ1459】Power Network
- (1078)HDU-记忆化搜索