47

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

int main()
{

    vector<char> prime(404322, true);
    prime[0] = prime[1] = false;
    for (int i = 2; i <= 404321; ++i)
        if (prime[i])
            if (i * 1ll * i <= 404321)
                for (int j = i * i; j <= 404321; j += i)
                    prime[j] = false;

    int mx(-10000), ans(0), ans1(0);

    for (int i = 356738; i < 404321 + 1; ++i)
    {
        for (int j = 2; j < sqrt(i) + 1; ++j)
        {
            if (prime[j])
            {
                if (i % j == 0)
                {
                    int tmp = i / j;
                    ans++;
                    if (prime[tmp])
                    {
                        if (tmp - j > mx)
                        {
                            mx = tmp - j;
                            ans1 = i;
                        }
                    }
                }
            }
        }
    }
    cout << "Kol-vo takih chisel: " << ans << ". Chislo s naibol'shei raznost'u prostih delitelei: " << ans1;
    return 0;
}