Cod sursa(job #1082991)
Utilizator | Data | 15 ianuarie 2014 14:46:48 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("farfurii.in");
ofstream fo("farfurii.out");
long long n,k,x,i,p;
int main() {
fi>>n>>k;
for (x=1;x*(x-1)<=2*k;++x);
for (i=1;i<=n-x;++i)
fo<<i<<' ';
p=n-(x-1)*x/2+k;
fo<<p<<' ';
for (i=n;i>n-x+1;--i)
if (i!=p)
fo<<i<<' ';
if (k)
fo<<i;
return 0;
}