Cod sursa(job #650088)
Utilizator | Gabi Purcaru gabipurcaru | Data | 17 decembrie 2011 12:52:46 |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
long long n,k,p,i,r;
int main() {
in>>n>>k;
for(p=1; p*(p+1)/2 <= k; p++);
if(p*(p-1)/2 == k) {
for(i=1; i<=n-p; i++) {
out<<i<<' ';
}
for(i=n; i>=n-p+1; i--)
out<<i<<' ';
} else {
for(i=1; i<=n-p-1; i++)
out<<i<<' ';
r = n-p*(p+1)/2+k;
out<<r<<' ';
for(i=n; i>=n-p+1; i--)
out<<(i > r ? i : i-1)<<' ';
}
return 0;
}