Cod sursa(job #3167204)
Utilizator | Data | 10 noiembrie 2023 12:45:30 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
ll n,k,i=1;
cin>>n>>k;
while((n-i)*(n-i-1)/2>=k)cout<<i++<<' ';
ll p=k-(n-i)*(n-i-1)/2+i;
cout<<p<<' ';
while(n>=i)
{
if(n!=p)
cout<<n<<' ';
n--;
}
return 0;
}