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