Codeforces 118B Present from Lena

最新推荐文章于 2022-11-21 21:55:25 发布

原创最新推荐文章于 2022-11-21 21:55:25 发布 · 1k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#acm #解题报告 #codeforces #图形

Codeforces 专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一个简单的算法，用于根据给定的最大数字 n 生成一个类似手帕的图案。该图案呈菱形分布，中间为最大数字 n，向外数字依次递减。文章提供了完整的 C++ 代码实现，并强调了输出格式的重要性。

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.

Input

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 test(s)

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

水题，找规律输出图形。注意输出格式，否则会WA。

#include <stdio.h>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <ctime>
#include <fstream>
#define MAXN  100001

using namespace std;
typedef long long LL;

int main() {

	int n;
	while(scanf("%d",&n)!=EOF){
	for(int i = 0;i<n+1;i++){
		for(int h = 0;h<(n-i)*2;h++){
			printf(" ");
		}
		printf("0");
		for(int j = 1;j<i;j++){
			printf(" %d",j);
		}
		for(int j = i;j>=0 && i!=0;j--){
			printf(" %d",j);
		}		
	printf("\n");
	}
	
	for(int i = n-1;i>=0;i--){
		for(int h = 0;h<(n-i)*2;h++){
			printf(" ");
		}
		printf("0");
		for(int j = 1;j<i;j++){
			printf(" %d",j);
		}
		for(int j = i;j>=0 && i!=0;j--){
			printf(" %d",j);
		}		
	printf("\n");
	}
	}
	return 0;
}