第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-436 算法训练 正六边形

#include<stdio.h>
int main()
{
	int N;
	int i,j,k;
	scanf("%d",&N);
	//第一行
	for(i=0;i<N;i++) {
		if (i==0) {
            for (j=0;j<N-1;j++) {
			printf(" ");
		    }
		}
		printf("*");
	}
	printf("\n");
	//第2到2*n-2行
	for (i=1;i<N;i++) {
		for(j=0;j<N-i-1;j++) {
			printf(" ");
		}
		printf("*");
		for(k=0;k<N+2*i-2;k++) {
			printf(" ");
		}
		printf("*");
		printf("\n");
	}
	for (i=N-2;i>0;i--) {
		for(j=0;j<N-i-1;j++) {
			printf(" ");
		}
		printf("*");
		for(k=0;k<N+2*i-2;k++) {
			printf(" ");
		}
		printf("*");
		printf("\n");
	}
	//最后一行
	for (i=0;i<=N-1;i++) {
		if (i==0) {
			for(j=0;j<N-1;j++) {
				printf(" ");
			}
		}
		printf("*");
	}
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n-1; i++)
        cout << " ";
    for (int i = 0; i < n; i++)
        cout << "*";
    cout << endl;
    for (int i = 1; i < n; i++)
    {
        for (int j = (n - i)-1; j > 0; j--)
            cout << " ";
        cout << "*";
        for (int j = 1; j <= n + 2 * i - 2; j++)
            cout << " ";
        cout << "*" << endl;
    }
    for (int i = n; i > 2; i--)
    {
        for (int j = (n - i + 2)-1; j > 0; j--)
            cout << " ";
        cout << "*";
        for (int j = n + 2 * (i - 3); j > 0; j--)
            cout << " ";
        cout << "*" << endl;
    }
    for (int i = 0; i < n-1; i++)
        cout << " ";
    for (int i = 0; i < n; i++)
        cout << "*";
    return 0;
}

import java.io.*;
import java.math.*;
import java.util.*;


public class Main {

    static final int INF = 0x3f3f3f3f;
    static final long LNF = 0x3f3f3f3f3f3f3f3fL;

    public static void main(String[] args) throws IOException {
        initReader();
        int n=nextInt();
        char[][]sb=new char[3*n][3*n];
        for(int i=0;i<3*n;i++)Arrays.fill(sb[i],' ');
        for(int i=n;i<=2*n-1;i++){
            sb[1][i]='*';
            sb[2*n-1][i]='*';
        }
        for(int i=2,j=n-1,k=2*n;i<=n;i++,j--,k++){
            sb[i][j]='*';
            sb[i][k]='*';
        }
        for(int i=n+1,j=2,k=3*n-3;i<=2*n-2;i++,j++,k--){
            sb[i][j]='*';
            sb[i][k]='*';
        }
        for(int i=1;i<=2*n-1;i++){
            for(int j=1;j<=3*n-2;j++){
                pw.print(sb[i][j]);
            }
            pw.println();
        }



        pw.close();
    }


    /***************************************************************************************/

    static BufferedReader reader;
    static StringTokenizer tokenizer;
    static PrintWriter pw;

    public static void initReader() throws IOException {
        reader = new BufferedReader(new InputStreamReader(System.in));
        tokenizer = new StringTokenizer("");
        pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));

//        从文件读写
//        reader = new BufferedReader(new FileReader("test.in"));
//        tokenizer = new StringTokenizer("");
//        pw = new PrintWriter(new BufferedWriter(new FileWriter("test1.out")));
    }

    public static boolean hasNext() {
        try {
            while (!tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(reader.readLine());
            }
        } catch (Exception e) {
            return false;
        }
        return true;
    }

    public static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

    public static String nextLine() {
        try {
            return reader.readLine();
        } catch (Exception e) {
            return null;
        }
    }

    public static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    public static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    public static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    public static char nextChar() throws IOException {
        return next().charAt(0);
    }
}

n=int(input())
for i in range(1,2*n):
    if i==1 or i ==2*n-1:
        print(' '*4+'*'*n)
    if 1<i<n:
        print(' '*(n-i)+'*'+' '*(n+2*(i-2))+'*')
    if i==n:
        print('*'+' '*(n+(n-2)*2)+'*')
    if n<i<2*n-1:
        print(' '*(i-n)+'*'+' '*(n+2*(2*n-1-i-1))+'*')