RT，样例对了，提交后又AC又RE又WA。。。

#include <bits/stdc++.h>
using namespace std;
# define ll long long
ll a[1000],b[1000000],n,m,h,t,num,tot,tot2,tot3;
void search (ll x)
{
    for (ll i=1;i<x;i++)
    {
        for (ll j=0;j<x;j++)
        {
            ll len = 0;
            ll z = 0;
            while (z<t)
            {
                len++;
                if (len%2==0) a[len] = i;
                else a[len] = j;
                z=z*x+a[len];
                if (z>t) break;
                b[z]++;
            }
        }
    }
}

int main()
{
    scanf ("%lld %lld %lld %lld %lld", &n, &m, &h, &t, &num);
    for (ll i=n;i<=m;i++)
    {
        search (i);
    }
    for (ll i=h;i<=t;i++)
    {
        if (b[i]==num) printf ("%lld\n", i);
    }
}