Cod sursa(job #2754703)
| Utilizator | Data | 26 mai 2021 12:44:29 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int main()
{
int n,k,inv;
fin>>n>>k;
inv=1;
while(inv*(inv+1)<=2*k) ///calculam nr. inversiuni
{
inv++;
}
for(int i=1; i<n-inv; i++) ///afisam numerele pana la numarul de inversiuni
fout<<i<<" ";
fout<<n+k-inv*(inv+1)/2; ///scapam de inversiunile in plus
for(int i=n; i>=n-inv; i--) ///afisam restul sirului inversat
if(i!=n+k-inv*(inv+1)/2)
{
fout<<i<<" ";
}
return 0;
}
