Cod sursa(job #2154213)
Utilizator | Data | 6 martie 2018 19:43:59 | |
---|---|---|---|
Problema | Pascal | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("pascal.in");
ofstream g("pascal.out");
int N,D,nr;
long long L0[5000001],L[5000001];
int main()
{
f>>N>>D;
L0[0]=L0[1]=1;
for(int i=2;i<=N;++i){
L[i]=L[0]=1;
for(int j=1;j<i;++j)
L[j]=L0[j-1]+L0[j];
for(int j=0;j<=i;++j)L0[j]=L[j];
}
for(int i=1;i<N;++i)
if(!(L0[i]%D))
++nr;
g<<nr;
return 0;
}