Submission #2556539

---

Source Code Expand

import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}

void main()
{
  int k, n; readV(k, n);

  int[] ans;

  if (k%2 == 0) {
    ans ~= k/2;
    ans ~= k.repeat.take(n-1).array;
  } else {
    ans = ((k+1)/2).repeat.take(n).array;
    foreach (i; 0..n/2) {
      if (ans[$-1] == 1) {
        ans = ans[0..$-1];
      } else {
        ans[$-1]--;
        ans ~= k.repeat.take(n-ans.length).array;
      }
    }
  }

  foreach (i; 0..ans.length) {
    write(ans[i]);
    if (i < ans.length-1) write(" ");
  }
  writeln;
}

Submission Info

Judge Result