Cod sursa(job #2300766)
| Utilizator | Data | 11 decembrie 2018 22:58:55 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <cstdio>
#include <vector>
using namespace std;
FILE * f=fopen("farfurii.in","r");
FILE * g=fopen("farfurii.out","w");
vector <long long> v;
long long n;
long long k;
int main()
{
fscanf(f,"%lld%lld",&n,&k);
long long i=1;
for(;i<=n && (n-i)*(n-i-1)/2 >= k;i++)
v.push_back(i);
k -= (n-i)*(n-i-1)/2;
v.push_back(i+k);
for(int j=n; j>=i; j--)
if(j != i + k)
v.push_back(j);
for(auto it:v)
fprintf(g,"%lld ",it);
return 0;
}
