Pagini recente » Cod sursa (job #1996380) | Cod sursa (job #324495) | Cod sursa (job #179790) | Cod sursa (job #330495) | Cod sursa (job #597664)
Cod sursa(job #597664)
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
const int N=100002;
int n,k,ok,v[N];
bool viz [N];
int main(){
int i,aux=1,poz=1,add=0;
in>>n>>k;
/*for(i=1;i<=n;i++){
if((n-i-1)*(n-i-2)>k){
sol[i]=aux;
viz[aux]=true;
aux++;
}
else{*/
while((n-aux-1)*(n-aux-2)>k){
v[poz]=aux;
viz[aux]=true;
aux++;
poz++;
}
while((n-aux-1)*(n-aux-2)+add<k){
add++;
}
v[poz]=aux+add;
poz++;
viz[aux+add]=true;
for(i=n;i>=1;i--){
if(viz[i]==false){
v[poz]=i;
poz++;
}
}
for(i=1;i<=n;i++){
out<<v[i]<<" ";
}
return 0;
}