Cod sursa(job #1902128)
Utilizator | Data | 4 martie 2017 13:46:01 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in ("farfurii.in");
ofstream out ("farfurii.out");
long long m,n,k,l;
int main()
{
in>>n>>k;
m=1;
while(m*(m+1)/2<k)
m++;
l=n-m;
for(int i=1;i<l;i++)
out<<i<<' ';
k=n+k-m*(m+1)/2;
out<<k<<' ';
for(long long i=n;i>=l;i--)
{
if(i!=k)
out<<i<<' ';
}
return 0;
}