Cod sursa(job #1444427)
Utilizator | Data | 29 mai 2015 19:16:30 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.32 kb |
#include<fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n,k,i,j,m;
int main()
{ f>>n>>k;
while(i*(i+1)/2<k) ++i;
for (j=1;j<=n-i-1;++j) g<<j<<' ';
m=i*(i+1)/2-k; g<<n-m<<' ';
for (j=n;j>=n-i;--j) if (j!=n-m) g<<j<<' ';
g<<'\n';
return 0;
}