Cod sursa(job #1190657)
| Utilizator | Data | 25 mai 2014 15:57:34 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | itmarathon | Marime | 0.53 kb |
#include <fstream>
#include<iostream>
using namespace std;
long long n,i,k,j,p,q;
void Citire()
{
ifstream fin("farfurii.in");
fin>>n>>k;
fin.close();
}
void Rezolvare()
{
ofstream fout("farfurii.out");
while(i*(i+1)/2 < k) i++;
p= i*(i+1)/2-k;
cout<<p;
for(j=1;j<=n-i-1;j++) fout<<j<<" ";
q=n-p;
fout<<q<<" ";
for(j=n;j>=n-i;j--)
if(j!=n-p) fout<<j<<" ";
fout<<"\n";
fout.close();
}
int main()
{
Citire();
Rezolvare();
return 0;
}
