Pagini recente » Cod sursa (job #893437) | Cod sursa (job #201677) | Cod sursa (job #854570) | Istoria paginii runda/calcularea_aia | Cod sursa (job #1001791)
#include<stdio.h>
int n, m;
bool Ap[100007];
int main(){
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
scanf("%d %d", &n, &m);
int Sum, i;
for(i = 1; Sum <= m; ++ i)
Sum += i;
if(Sum > m)
Sum = i - 2;
else
Sum = i - 1;
m -= (Sum * (Sum + 1)) / 2;
for(int i = 1; i <= n - Sum - 2; ++ i){
printf("%d ", i);
Ap[i] = 1;
}
printf("%d ", n - Sum + m - 1);
Ap[n - Sum + m - 1] = 1;
for(int i = n; i >= n - Sum - m; -- i)
if(Ap[i] == 0)
printf("%d ", i);
return 0;
}