Cod sursa(job #1902091)
Utilizator | Data | 4 martie 2017 13:26:41 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
long long n,k,p;
int main()
{
in>>n>>k;
p=1;
while(p*(p+1)/2<k)
p++;
for(int i = 1;i<n-p;i++)
{
out<<i<<' ';
}
k=n+k-p*(p+1)/2;
out<<k<<' ';
for(long long i = n; i>=n-p; i--)
{
if(i!=k)
out<<i<<' ';
}
return 0;
}