[ŠŽ] NR.5 Akmenukai psl50.

#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

void code()
{
    ifstream d("duom.txt");

    int b[10];
    fill_n(b, 10, 0);
    int n = 0;
    d >> n;
    for (int i = 1; i <= n; i++)
    {
        d >> b[i];

    }
    int j = 0,  z = 0;
    for (int i = 1; i <= n; i++)
    {
        j = i + 1;
        if (b[i] > 0)
        {
            while (j <= n && b[i] > 0 && b[i] - 1 >= 0 && j != i)
            {
                b[i]--;
                b[j]++;
                if (j == n)
                {
                    z = n;
                    while (z > 1 && z != i)
                    {
                        b[i]--;
                        b[z] += 1;
                        z--;
                    }
                }
                j++;
            }
        }
        cout << b[i] << endl;
    }

    d.close();
}

int main()
{
    code();
}