Cod sursa(job #2098110)
Utilizator | Data | 2 ianuarie 2018 13:33:41 | |
---|---|---|---|
Problema | Pascal | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
#include <vector>
using namespace std;
vector <long long> p;
ifstream in("pascal.in");
ofstream out("pascal.out");
int main()
{
int n,d;
in>>n>>d;
for(int i=0; i<2; i++)
{
p.push_back(1);
}
for(int i=2; i<=n; i++)
{
p.push_back(1);
for(int i=p.size()-2; i>=1; i--)
{
p[i]+=p[i-1];
}
}
int l=p.size(),cnt=0;
for(int i=0; i<l; i++)
{
if(p[i]%d==0)
cnt++;
}
out<<cnt<<'\n';
return 0;
}