1017C - The Phone Number - CodeForces Solution


constructive algorithms greedy *1600

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
#define  int long long int 
using namespace std;

const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
const int inf  = LLONG_MAX;


int32_t main(){
std::ios_base ::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
std::cout << std::fixed << std::setprecision(25);
    int n ; cin >>  n ; 
    int jk = (int) sqrt ( n );
    int target = n /jk * jk;
    int p = n  ; 
    int prnt = target +1 ;
    if ( target == n ){
        target -= jk ; 
        prnt = target + 1 ;
    }
    for ( int  i = 0; i < n ; i++)
    {
        cout << prnt << " " ; 
        prnt ++ ; 
        if ( prnt > p ){
            p = target ; 
            target -= jk ; 
            prnt = target + 1 ; 
        }
    }
    
return 0;
}


Comments

Submit
0 Comments
More Questions

448A - Rewards
1622A - Construct a Rectangle
1620A - Equal or Not Equal
1517A - Sum of 2050
620A - Professor GukiZ's Robot
1342A - Road To Zero
1520A - Do Not Be Distracted
352A - Jeff and Digits
1327A - Sum of Odd Integers
1276A - As Simple as One and Two
812C - Sagheer and Nubian Market
272A - Dima and Friends
1352C - K-th Not Divisible by n
545C - Woodcutters
1528B - Kavi on Pairing Duty
339B - Xenia and Ringroad
189A - Cut Ribbon
1182A - Filling Shapes
82A - Double Cola
45A - Codecraft III
1242A - Tile Painting
1663E - Are You Safe
1663D - Is it rated - 3
1311A - Add Odd or Subtract Even
977F - Consecutive Subsequence
939A - Love Triangle
755A - PolandBall and Hypothesis
760B - Frodo and pillows
1006A - Adjacent Replacements
1195C - Basketball Exercise