Cod sursa(job #1611983)
Utilizator | Data | 24 februarie 2016 17:11:08 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#define maxn 100001
using namespace std;
int main()
{long long k,m,n,i;
fstream f("farfurii.in",ios::in);
fstream g("farfurii.out",ios::out);
f>>n>>k;
m=1;
while(m*(m-1)/2<k)
m++;
for(i=1;i<=n-m;i++)
g<<i<<" ";
k=n+k-(m*(m-1))/2;
g<<k<<" ";
for(i=n;i>=n-m+1;i--)
if(i!=k)
g<<i<<" ";
}