Cod sursa(job #1190761)
Utilizator | Data | 25 mai 2014 17:15:04 | |
---|---|---|---|
Problema | Farfurii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | itmarathon | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int main()
{
int n, k, s=0, i=0, p=0, p1;
f>>n>>k;
while (s<k)
{
i++;
s+=i;
}
s-=i;
p=s+n-k;
for(int j=1; j<n-i; j++)
{
g<<j<<" ";
}
p1=p-(n-i-1);
int nr=n;
nr=nr-p1+1;
g<<nr<<" ";
for (int j=n; j>n-i-1; j--)
{
if(j!=nr) g<<j<<" ";
}
}