Cod sursa(job #1327032)
| Utilizator | Data | 26 ianuarie 2015 12:21:48 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | simulareoji2015 | Marime | 0.46 kb |
#include<cstdio>
bool be[100005];
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
int n,i,p1,p2;
long long k;
scanf("%d%lld",&n,&k);
for(i=n-1;i>=1 && k>0;i--)
{
k=k-n+i;
be[i]=1;
}
be[n+k]=0;
p1=n+k;
p2=i;
for(i=1;i<=p2;i++)
printf("%d ",i);
printf("%d ",p1);
for(i=n;i>p2;i--)
if(i!=p1)
printf("%d ",i);
return 0;
}
