Pagini recente » Cod sursa (job #2293836) | Cod sursa (job #2878759) | Cod sursa (job #1910400) | Cod sursa (job #1819195) | Cod sursa (job #1209052)
#include <fstream>
using namespace std;
int main(){
ifstream f("farfurii.in");
ofstream g("farfurii.out");
unsigned long long k,n,p=0;
f >> n >> k;
while(p*(p-1)/2<k) p++;
for(int i=1;i<=n-p;i++)
g << i <<" ";
if(p*(p-1)/2==k){
for(int i=n;i>n-p;i--)
g << i <<" ";
}
else{
g << n-(p*(p-1)/2-k) <<" ";
for(int i=n;i>n-p;i--)
if(i!=n-(p*(p-1)/2-k)) g << i << " ";
}
}