蓝桥杯 Torry的困惑(基本型)

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

bool check(int x)
{
     int i;
     for (i=2;i<=(int)sqrt(x);i++)
         if (x%i==0)
            return 0;
     return 1;
     }

int i,a[100100],k=0,n,ans=1;
    
int main()
{

    for (i=2;i<=1300000;i++)
    {
        if (check(i))
        {
           k++;
           a[k]=i%50000;                
           }
        }
    cin >> n;
    for (i=1;i<=n;i++)
    {
        ans=(ans*a[i])%50000;
        }
    cout << ans << endl;
    return 0;
    }