Submission #1062069

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  vi ch(n);
  rep (i, n) {
    ch[i] = i+1;
  }
  vi ans(n, 0);
  int rr = 1;
  rep (i, n) {
    int q = (ll)rr * (n - i) / k;
    rr = (ll)rr * (n - i) % k;
    if (rr == 0) {
      q -= 1;
      rr = k;
    }
    ans[i] = ch.at(q);
    ch.erase(begin(ch) + q);
  }
  rep (i, n) {
    printf("%d\n", ans[i]);
  }

  return 0;
}

Submission Info

Judge Result