Cod sursa(job #516989)
Utilizator | Data | 27 decembrie 2010 14:19:19 | |
---|---|---|---|
Problema | Pascal | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
using namespace std;
unsigned long n,i,j,lnou[5000000],lvechi[5000000],k,nr;
int main()
{
ifstream f("pascal.in");
ofstream g("pascal.out");
f>>n>>k;
lvechi[1]=1;
for(i=1;i<=n;i++)
{
for(j=1;j<=i+1;j++)
lnou[j]=lvechi[j]+lvechi[j-1];
for(j=1;j<=i+1;j++)
lvechi[j]=lnou[j];
}
for(i=1;i<=(n+2)/2;i++)
if(lvechi[i]%k==0)
nr++;
if(n%2)
g<<nr*2;
else
g<<nr*2-1;
return 0;
}