Cod sursa(job #1094671)
Utilizator | Andretti Naiden andretti | Data | 29 ianuarie 2014 18:13:08 |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.52 kb |
#include<stdio.h>
using namespace std;
typedef long long ll;
ll n,k;
void read()
{
scanf("%lld%lld",&n,&k);
}
void solve()
{
int i;
for(i=0;(n-i-1)*(n-i)/2>k;i++)
if(i!=0) printf("%d ",i);
int ind=i+k-(n-i-1)*(n-i)/2;
printf("%d ",ind);
for(int j=n;j>=i;j--)
if(j!=ind) printf("%d ",j);
}
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
read();
solve();
fclose(stdin);
fclose(stdout);
return 0;
}