Pagini recente » Cod sursa (job #2084960) | Cod sursa (job #374610) | Cod sursa (job #281966) | Cod sursa (job #1606707) | Cod sursa (job #2593422)
#include <iostream>
#include <fstream>
#define NMAX 5000000
using namespace std;
ifstream f("pascal.in");
ofstream g("pascal.out");
int n, p, ans, nr[NMAX+10], nr1[NMAX+10];
void precalc()
{ for(int d=p; d<=n; d*=p)
for(int i=d; i<=n; i+=d) nr[i]++;
}
void solve4()
{ p = 2;
precalc();
int val = 0, st = 1, dr = n;
for(int i=1; i<=n; i++)
{ val = val + nr[dr] - nr[st];
st++;
dr--;
if(val >= 2) ans++;
}
g << ans << '\n';
}
void solve6()
{ for(int d=2; d<=n; d*=2)
for(int i=d; i<=n; i+=d) nr[i]++;
for(int d=3; d<=n; d*=3)
for(int i=d; i<=n; i+=d) nr1[i]++;
int val1 = 0, val2 = 0, st = 1, dr = n;
for(int i=1; i<=n; i++)
{ val1 = val1 + nr[dr] - nr[st];
val2 = val2 + nr1[dr] - nr1[st];
st++;
dr--;
if(val1 && val2) ans++;
}
g << ans << '\n';
}
int main()
{
f >> n >> p;
if(p == 4) solve4();
else if(p == 6) solve6();
else
{ precalc();
int val = 0, st = 1, dr = n;
for(int i=1; i<=n; i++)
{ val = val + nr[dr] - nr[st];
st++;
dr--;
if(val) ans++;
}
g << ans << '\n';
}
return 0;
}