Pagini recente » Cod sursa (job #1153910) | Cod sursa (job #3209782) | Cod sursa (job #2898308) | Cod sursa (job #2300389) | Cod sursa (job #627336)
Cod sursa(job #627336)
#include<fstream>
using namespace std;
int main() {
long long limit,k,pass;
int n,i;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
in>>n>>k;
in.close();
for(i=0;i<n;i++) {
limit=(n-i-1)*(n-i-2)/2;
if(limit>k)
out<<i+1<<" ";
else
{pass=i+k-limit+1;
out<<pass<<" ";
break;
}
}
limit=n;
for(;i<n;i++,limit--)
if(limit!=pass) out<<limit<<" ";
out.close();
return 0;
}