Cod sursa(job #1190728)
Utilizator | Data | 25 mai 2014 16:58:51 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | itmarathon | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n,i,k,j,e,r;
int main()
{ f>>n>>k;
while (i*(i+1)/2<k)i++;
r=i*(i+1)/2-k;
for (j=1;j<=n-i-1;j++)g<<j<<" ";
e=n-r;
g<<n-r<<" ";
for (j=n;j>=n-i;j--)
if (j!=n-r)g<<j<<" ";
f.close();
g.close();
}