
#include 

using namespace std;

const int N = 10;
int a[N];

void insert (int x)
{
    int k = 0;
    while (k < N && x > a[k])
        k++;
    // x umistit do a[k]
    // k == N znamena, ze jsme nenasli vhodne misto

    if (k < N)
    {
        for (int i = N-1; i>k; i--)
            a[i] = a[i-1];

        a[k] = x;
    }
}

int main()
{
    for (int j = 0; j


#include 

using namespace std;

const string text = "nejaka posloupnost slov ";


int pos = 0;

int pocet ()
{
    int v = 0;
    int n = text.length();
    while (text [pos] != ' ')
    {
        v++;
        pos++;
        if (pos >= n) pos = 0;
    }
    pos++;
    if (pos >= n) pos = 0;
    return v;
}

int main ()
{
    cout << pocet () << endl;
    cout << pocet () << endl;
    cout << pocet () << endl;
    cout << pocet () << endl;
    cout << pocet () << endl;
    cout << pocet () << endl;
    cout << pocet () << endl;
    cout << pocet () << endl;
    cout << pocet () << endl;
}