Cod sursa(job #1208901)
Utilizator | Data | 16 iulie 2014 19:16:00 | |
---|---|---|---|
Problema | Farfurii | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.33 kb |
#include <fstream>
using namespace std;
bool used[100001];
int main(){
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int n,k;
f >> n >> k;
unsigned long long Max=n*(n-1)/2;
for(int i=1;i<=n;i++){
if(Max-n+i>=k){
Max-=n-i;
g << i <<" ";
used[i]=1;
}
}
for(int i=n;i>=1;i--)
if(!used[i]) g << i << " ";
}