Cod sursa(job #946033)
| Utilizator | Data | 3 mai 2013 17:49:08 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.34 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<=r;j++)g<<j<<" ";
e=n-r;
g<<n-r<<" ";
for (j=n;j>=r+1;j--)
if (j!=n-r)g<<j<<" ";
f.close();
g.close();
}
