Cod sursa(job #2998757)

Utilizator Zed1YasuoAlex Birsan Zed1Yasuo Data 9 martie 2023 22:41:00
Problema Pascal Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.16 kb
#include <fstream>

using namespace std;
ifstream f("pascal.in");
ofstream g("pascal.out");
int n,k;
const int N=5e6+5;
int d2[N],sol,d3[N],d5[N];
int main()
{
    f>>n>>k;
    for(int i=2;i<=n;i+=2)
        d2[i]=d2[i/2]+1;
    for(int i=3;i<=n;i+=3)
        d3[i]=d3[i/3]+1;
    for(int i=5;i<=n;i+=5)
        d5[i]=d5[i/5]+1;
    for(int i=1;i<=n;i++)
    {
        d2[i]+=d2[i-1];
        d3[i]+=d3[i-1];
        d5[i]+=d5[i-1];
    }
    for(int i=0;i<=n;i++)
    {
        ///N!/(N-I)!*I!

      ///  g<<d2[n]<<" "<<d2[i]<<" "<<d2[n-i]<<"  "<<d2[n]-d2[i]-d2[n-i]<<'\n';
      ///  g<<d3[n]<<" "<<d3[i]<<" "<<d3[n-i]<<"  "<<d3[n]-d3[i]-d3[n-i]<<'\n';
      ///  g<<d5[n]<<" "<<d5[i]<<" "<<d5[n-i]<<"  "<<d5[n]-d5[i]-d5[n-i]<<'\n';
        if(k==2&&d2[n]-d2[i]-d2[n-i]>=1)
            sol++;
        else
        if(k==3&&d3[n]-d3[i]-d3[n-i]>=1)
            sol++;
        else
        if(k==4&&d2[n]-d2[i]-d2[n-i]>=2)
            sol++;
        else
        if(k==5&&d5[n]-d5[i]-d5[n-i])
            sol++;
        else
        if(k==6&&d3[n]-d3[i]-d3[n-i]>=1&&d2[n]-d2[i]-d2[n-i]>=1)
            sol++;
    }
    g<<sol;
    return 0;
}