Pagini recente » Cod sursa (job #3213728) | Cod sursa (job #2624398) | Cod sursa (job #427571) | Cod sursa (job #333982) | Cod sursa (job #597673)
Cod sursa(job #597673)
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
const int N=100002;
int n,k,ok;
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)*(n-aux-1)/2>=k && aux<=n){
out<<aux<<" ";
viz[aux]=true;
aux++;
//poz++;
}
if(((n-aux)*(n-aux-1))/2+add<k){
while(((n-aux)*(n-aux-1))/2+add<k){
add++;
}
out<<aux+add<<" ";
//poz++;
viz[aux+add]=true;
}
for(i=n;i>=1;i--){
if(viz[i]==false){
out<<i<<" ";
poz++;
}
}
/*for(i=1;i<=n;i++){
out<<v[i]<<" ";
}*/
return 0;
}