2034: [Blue Bridge Cup 2022 preliminary] pruning shrubs

2034: [ Blue Bridge Cup 2022 Preliminaries ] Pruning shrubs

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

Topic type ： Tradition Evaluation method ： Text comparison Uploaded by ： External import

Submit ：227 adopt ：158

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

 

#include <iostream>

using namespace std;

int main()
{
    int n;
    cin >> n;
    for(int i=1;i<=n;++i)
    {
        int temp=max(abs(i-n),abs(i-1));
        cout << 2*temp << endl;
    }
    return 0;
}