Cod sursa(job #1067732)
Utilizator | FMI-Alex Dobrin Barracuda | Data | 27 decembrie 2013 14:28:36 |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long a[100007],n,m,k,pos,t;
int main () {
f>>n>>k;
for(int i=1;i<=n;++i) {
m=(n-i)*(n-i-1)/2;
if(m<k){
pos=i;
break;
}
}
for(int i=1;i<pos;++i){
a[++t]=i;
}
a[++t]=k-m+pos;
for(int i=n;i>=pos;--i){
if(i!=k-m+pos)
a[++t]=i;
}
for(int i=1;i<=t;++i){
g<<a[i]<<" ";
}
return 0;
}