Pagini recente » Borderou de evaluare (job #1413479) | Borderou de evaluare (job #173545) | Cod sursa (job #1687208) | Rezultatele filtrării | Cod sursa (job #903706)
Cod sursa(job #903706)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <deque>
#include <stack>
#include <math.h>
using namespace std;
int main()
{
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n, k, i, j, x, dif, aux;
vector <int> sol;
//Read
fin>>n>>k;
//Compute
x = 1;
while( x*(x-1)/2 < k ) x++;
dif = x*(x-1)/2 - k;
for(i=1; i<=n-x; i++)
fout<<i<<" ";
for(i=n; i>n-x; i--)
sol.push_back(i);
//Print
fout<<sol[dif]<<" ";
for(i=0; i<sol.size(); i++)
if(i!=dif)
fout<<sol[i]<<" ";
}