Cod sursa(job #1204036)
Utilizator | Data | 1 iulie 2014 19:29:35 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long x2,n,i,j,k,s,x;
int main()
{
f>>n>>k;
while (s+x<k)
{
s+=x;
x++;
}
x--;
x2=k-s;
for (i=1;i<=n-x-2;i++)
g<<i<<' ';
g<<n-x-1+x2<<' ';
for (i=n;i>=n-x+x2;i--)
g<<i<<' ';
for (i=n-x+x2-2;i>=n-x-1;i--)
g<<i<<' ';
f.close();
g.close();
return 0;
}