Cod sursa(job #1328700)
| Utilizator | Data | 28 ianuarie 2015 18:04:57 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int i,n,fv[100001],pos,dif;
long long int k;
int main()
{
f>>n>>k;
for (i=1;i<=n;++i)
if (1ll*i*(i-1)/2 >= k)
break;
--i;
pos=n-i;
dif=k - 1ll*i*(i-1)/2;
for (i=1;i<pos;++i)
g<<i<<" ";
g<<i+dif<<" ";
for (i=n;i>=pos;--i)
{
if (i ==pos + dif)
///g<<pos<<" ";
continue;
else g<<i<<" ";
}
return 0;
}
