I was working on a codeblocks project, but when I tried to bild/run the code, I got the error code c00000fd. I never heard of it, and I could't find it anywhere on the Internet. I would like to know at least what does the code mean but if you could help me fix my project i would be gratefull. Here is the code:
#include <fstream>
using namespace std;
ifstream fin("forta.in");
ofstream fout("forta.out");
int main()
{
    int p,n,maxx=0;
    long long x,minn=2000000000;
    fin>>p>>n;
    if(p==1)
    {
        for(int i=0; i<n; i++)
        {
            fin>>x;
            long long divt=1,p,cx=x,m=0;
            long long frp[2000000000],prim[2000000000];
            frp[0]=0;
            frp[1]=0;
            for(int i=2; i<=x; i++)
                frp[i]=1;
            for(int i=2; i<=x; i++)
            {
                if(frp[i]==1)
                {
                    prim[m++] =i; ///stochez nr prime
                    for(int j=i+i; j<=x; j=j+i)
                        frp[j]=0;
                }
            }
            for(int i=0; i<m ; i++) ///  sirul de nr prime
            {
                p=0;
                while(x%prim[i]==0)
                {
                    p++;
                    x=x/prim[i];
                }
                divt=divt*(p+1);
            }
            if(divt>maxx)
            {
                maxx=divt;
                minn=cx;
            }
            else if(divt==maxx)
            {
                if(cx<minn)
                    minn=cx;
            }
        }
        fout<<minn;
    }
    if(p==2)
    {
        int fr[20000]= {0}, maxx=0;
        for(int i=0; i<n; i++)
        {
            fin>>x;
            long long divt=1,p,cx=x,m=0;
            long long frp[x+1], prim[x+1];
            frp[0]=0;
            frp[1]=0;
            for(int i=2; i<=x; i++)
                frp[i]=1;
            for(int i=2; i<=x; i++)
            {
                if(frp[i]==1)
                {
                    prim[++m] =i; ///stochez nr prime
                    for(int j=i+i; j<=x; j=j+i)
                        frp[j]=0;
                }
            }
            for(int i=0; i<m ; i++) ///  sirul de nr prime
            {
                p=0;
                while(x%prim[i]==0)
                {
                    p++;
                    x=x/prim[i];
                }
                divt=divt*(p+1);
            }
            fr[divt]++; /// frecventa pe nr de div
            if(maxx<fr[divt])
                maxx=fr[divt];
        }
        fout<<maxx;
    }
    return 0;
}
And here is the complete error report: Problem signature:
Problem Event Name: APPCRASH
  Application Name: OJI_2020_A6-A_forta.exe
  Application Version:  0.0.0.0
  Application Timestamp:    604a50ce
  Fault Module Name:    OJI_2020_A6-A_forta.exe
  Fault Module Version: 0.0.0.0
  Fault Module Timestamp:   604a50ce
  Exception Code:   c00000fd
  Exception Offset: 0000000000003146
 
    