Pagini recente » Cod sursa (job #276631) | Istoria paginii runda/simulare_oji_2023_clasa_10_11_martie/clasament | Borderou de evaluare (job #2298045) | Cod sursa (job #481719) | Cod sursa (job #2277324)
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair< int , int > PII;
ll n, m;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
cin >> n >> m;
ll val = 1;
while (val * (val - 1) / 2 < m) ++val;
ll diff = val * (val - 1) / 2 - m;
ll num = n - diff;
for (int i = 1; i <= n - val; i++) cout << i << " ";
cout << num << " ";
for (int i = n; i > n - val; i--) if (i != num) cout << i << " ";
return 0;
}