Pagini recente » Cod sursa (job #845294) | Cod sursa (job #2050106) | Borderou de evaluare (job #2666578) | Cod sursa (job #2298504) | Cod sursa (job #1339596)
#include <fstream>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
long long i, n, k, j;
int main()
{
cin>>n>>k;
for(i=n-1; i>=1 && k>0; --i)
k=k-n+i;
for (j=1; j<=i; ++j) cout<<j<<' '; cout<<n+k<<' ';
for (j=n; j>i; --j)
if (j!=n+k) cout<<j<<' ';
return 0;
}