Cod sursa(job #1080981)
Utilizator | Data | 13 ianuarie 2014 02:44:05 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int main()
{
long long k, s=1, n, i, p, inv;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
fin>>n>>k;
while(s*(s+1)/2<=k)
s++;
for(i=1; i<n-s; i++)
fout<<i<<" ";
inv = s*(s+1)/2;
p = n - inv + k;
fout<<p<<" ";
for(i=n; i>=n-s; i--)
if(i!=p)
fout<<i<<" ";
}