2022 information and future preparation topic 4 new online judge 2034: pruning shrubs

P2034 - [ Blue Bridge Cup 2022 Preliminaries ] Pruning shrubs - New Online Judgehttp://oj.ecustacm.cn/problem.php?id=2034

Memory limit ：256 MB The time limit ：1 S Standard input and output

Topic type ： Traditional evaluation methods ： Text comparison uploader ： External import

Submit ：57 adopt ：45

Submit Submit the record Statistics Discussion board

Title Description

Alice has to finish a job of pruning shrubs .
Yes N The shrubs are arranged neatly from left to right .
Alice trims a bush at the party every day , Make the height of the Bush 0 centimeter .
Alice's order of pruning shrubs is to start with the shrub on the far left , Trim a shrub to the right every day .
When the rightmost Bush is trimmed , She'll turn around , Start pruning the shrubs to the left the next day .
Until you trim the leftmost shrub and turn the direction again . And then go back and forth .
Shrubs grow every day from morning to evening 1 centimeter , And the rest of the time will not grow tall .
On the first morning , The height of all shrubs is 0 centimeter . Alice wanted to know how high each Bush was at the top .

Input format

A positive integer N , The meaning is as stated in the title .
30% Test data for ：1<N≤10;
100% Test data for ：1<N≤10000.

Output format

Output N That's ok , One integer per row , The first i  The line represents the first... From left to right i How high can a tree grow .

sample input   Copy

3

sample output   Copy

4
2
4

Category labels

Basic questions   Thinking questions

Ideas ：

A little , Direct water .

AC Code ：

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int> 
#define vll vector<ll> 
#define vll2 vector<ll,vector<ll> > 
#define vi2 vector<int,vector<int> > 
#define pii pair<int,int>
#define pll pair<ll,ll>
int main(){
	int n; cin>>n;
	for(int i=1;i<=n;i++) cout<<max(i-1,n-i)*2<<endl;                                                                                                                                                                                                                               
    return 0;
}
//ACplease!!!


/*  printf("                                                                \n");
	printf("                                                                \n");
	printf("       * * *               * * *             * * *             * * *            \n");
	printf("     *       *           *       *         *      *          *       *         \n");
	printf("    *        *          *         *       *        *        *         *        \n");
	printf("            *           *         *                *                  *      \n");
	printf("           *            *         *               *                  *     \n");
	printf("          *             *         *              *                  *       \n");
	printf("         *              *         *             *                  *            \n");
	printf("        *               *         *           *                  *            \n");
	printf("      *                  *       *          *                  *           \n");
	printf("    * * * * * * *          * * *          * * * * * * *      * * * * * * *                           \n");
*/