fork download
copy 
  1.  
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4. ///#define int long long
  5. #define ll long long
  6. #define ln '\n'
  7. #define u unsigned
  8. #define f first
  9. #define ss second
  10.  
  11. ll logg(ll base ,ll x){
  12.     ll s=0;
  13.     if(!x)return 1;
  14.     while(x){
  15.         x/=base;
  16.         s++;
  17.     }
  18.     return  s;
  19. }
  20. const ll N=1000000007;
  21. const  ll mod=998244353;
  22.  
  23. ll fastPow(ll x,ll y,ll mode){
  24.     if(y==0)
  25.         return 1;
  26.     //
  27.  
  28.     if(y%2==1){
  29.         ll b=x%mode;
  30.         ll ans=fastPow(b,y/2,mode)%mode;
  31.         ans=(ans*ans)%mode;
  32.         return (ans*b)%mode;
  33.     }
  34.  
  35.     else{
  36.         ll b=x%mode;
  37.         ll ans=fastPow(b,y/2,mode)%mode;
  38.         ans=(ans*ans)%mode;
  39.         return ans;
  40.     }
  41.  
  42. }
  43.  
  44. ll power(ll x, ll y,ll mode)
  45. {
  46.     ll res = 1;
  47.     x = x % mode;
  48.  
  49.     while (y > 0) {
  50.         if (y & 1)
  51.             res = (res * x) % mode;
  52.         y = y >> 1;
  53.         x = (x * x) % mode;
  54.     }
  55.  
  56.     return res;
  57. }
  58. u ll GCD(u ll a, u ll b)
  59. {
  60.     return b == 0 ? a : GCD(b, a % b);
  61. }
  62. u ll lcm(u ll x,u ll y){
  63.     return (ll)(((x/(ll)__gcd(x,y)))*y);
  64. }
  65. ll ceiling (ll x,ll y){
  66.     if(x%y)return x/y +1;
  67.     return x/y;
  68. }
  69. bool sortby(const pair<ll,ll>&a,const pair<ll,ll>&b){
  70.     if(a.first==b.first)
  71.         return a.second>b.second;
  72.     return a.first<b.first;
  73. }
  74. ////////////////////////////////////////
  75. ll fact[10001],invfact[10001];
  76. ll invMod(ll x,ll mode){
  77.     return fastPow(x,mode-2,mode)%mode;
  78. }
  79. void factorial(ll mode){
  80.     ll ff=1;
  81.     fact[0]=1;invfact[0]=1;
  82.     for(ll i=1;i<=1000;i++){
  83.         ff*=i;ff%=mode;
  84.         fact[i]=ff;
  85.         invfact[i] = invMod(fact[i],mode);
  86.     }
  87. }
  88.  
  89.  
  90. ll ncr(ll n,ll r,ll mode){
  91.     return ( (fact[n]* invfact[r])%mode* invfact[n-r])%mode;
  92. }
  93. ///////////////////////////////////////////////
  94. bool isPrime(ll n){
  95.     if(n == 1){
  96.         return false;
  97.     }
  98.     for(ll i = 2; i*i<=n; i++){
  99.         if(n%i == 0){
  100.             return false;
  101.         }
  102.     }
  103.  
  104.     return true;
  105. }
  106.  
  107. int on_bits(long long n){ return __builtin_popcountll(n);}
  108. //////////////////////////////////////////////////
  109. void Update(vector<ll>&B,int idx,ll val){
  110.     while(idx<B.size()){
  111.         B[idx]+=val;
  112.         idx+=(idx&-idx);
  113.     }
  114. }
  115. ll get_sum(vector<ll>&B,int l,int r){
  116.     ll s1=0,s2=0;l=max(l-1,0);
  117.     while(l){
  118.         s1+=B[l];
  119.         l-=(l&-l);
  120.     }
  121.     while(r){
  122.         s2+=B[r];
  123.         r-=(r&-r);
  124.     }
  125.     return s2-s1;
  126. }
  127. //////////////////////////////////////////
  128.  
  129. bool valid(int x,int uu){
  130.     if(x>=0 && x<uu)return 1;
  131.     return 0;
  132. }
  133. ll pow2[200];
  134. void power2(){
  135.     ll p=1;
  136.     pow2[0]=1;
  137.     for(int i=1;i<=200000;i++){
  138.         p*=2;p%=N;
  139.         pow2[i]=p;
  140.     }
  141. }
  142. ll sum_(ll l,ll r){
  143.     return (r*(r+1))/2-(l*(l+1))/2;
  144. }
  145. bool is_pal(string s){
  146.     string s2=s;
  147.     reverse(s2.begin(), s2.end());
  148.     return s==s2;
  149. }
  150. ///MiraculousN
  151. void change(int &x,int& y){
  152.     if(x==-1 && y==1)y=-1;
  153.     else if(x==-1 && y==-1)x=1;
  154.     else if(x==1 && y==-1)y=1;
  155.     else x=-1;
  156. }
  157.  
  158. void solve(){
  159.     int n,k;cin>>n>>k;
  160.     vector<int>v(n+1,0);
  161.     set<int>st;
  162.     for(int i=1;i<=n;i++){
  163.         st.insert(i);
  164.     }
  165.     for(int i=1;i<=n;i++){
  166.         int curr=*st.begin(),idx=i;
  167.         if(v[idx]!=0)break;
  168.         while(idx<=n){
  169.             v[idx]=curr;
  170.             st.erase(curr);
  171.             curr++;
  172.             idx+=k;
  173.         }
  174.     }
  175.     for(int i=1;i<=n;i++)cout<<v[i]<<' ';
  176.     cout<<ln;
  177. }
  178.  
  179. int main()
  180. {
  181.     ios_base::sync_with_stdio(0);
  182.     cin.tie(0);cout.tie(0);
  183.     int T=1;cin>>T;
  184.    /// map_pow();
  185.     //power2();
  186.     //factorial(N);
  187.     while(T--){
  188.         solve();
  189.     }
  190.     return 0;
  191. }
  192.  
  193. /*
  194. 4
  195. 1 2 3 4
  196. 6
  197. 3 5 6 7 1 2
  198.  
  199. 10
  200. 7 10 1 2 1 7 1 5 9 9
  201. 9
  202. 6 2 5 6 7 7 5 5 2
  203.  
  204. 2
  205. 6 10
  206. 3
  207. 6 3 3
  208.  
  209.  */
Success #stdin #stdout 0.01s 5524KB
comments (?)
stdin
copy 
1
5 4
stdout
copy 
1 3 4 5 2
https://ideone.com/2Pg6wv
language:
C++ (gcc 8.3)
created:
1 year ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!