Pagini recente » Cod sursa (job #1645929) | Cod sursa (job #2331932) | Cod sursa (job #2781085) | Cod sursa (job #1121941) | Cod sursa (job #2283299)
#include <bits/stdc++.h>
using namespace std;
#if 1
#define pv(x) cout<<#x<<" = "<<(x)<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif
// #if 1
#ifdef INFOARENA
ifstream in("pascal.in");
ofstream out("pascal.out");
#else
#define in cin
#define out cout
#endif
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pld = pair<ld, ld>;
using pdd = pair<double, double>;
#define pb push_back
const long double PI = 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862;
const long double EPS = 1e-8;
const int inf_int = 1e9 + 5;
const ll inf_ll = 1e18 + 5;
const int NMax = 2e5 + 5;
const int mod = 666013;
const int dx[] = {-1,0,0,+1}, dy[] = {0,-1,+1,0};
// intoarce la ce putere se afla x in descompunerea lui num;
int getOcc(int num, int x) {
int ans = 0;
while (num % x == 0) {
ans += 1;
num /= x;
}
return ans;
}
int main() {
// cin.sync_with_stdio(false);
// cin.tie(0);cout.tie(0);
int N,D;
in >> N >> D;
int ans = 0;
if (D == 4) {
int numOcc = 0;
for (int k = 1; k <= N; ++k) {
numOcc += getOcc(N - k + 1, 2);
numOcc -= getOcc(k, 2);
if (numOcc >= 2) {
ans += 1;
}
}
}
if (D == 6) {
int numOcc2 = 0;
int numOcc3 = 0;
for (int k = 1; k <= N; ++k) {
numOcc2 += getOcc(N - k + 1, 2);
numOcc2 -= getOcc(k, 2);
numOcc3 += getOcc(N - k + 1, 3);
numOcc3 -= getOcc(k, 3);
if (numOcc2 >= 1 && numOcc3 >= 1) {
ans += 1;
}
}
}
else {
int numOcc = 0;
for (int k = 1; k <= N; ++k) {
numOcc += getOcc(N - k + 1, D);
numOcc -= getOcc(k, D);
if (numOcc >= 1) {
ans += 1;
}
}
}
out << ans << '\n';
return 0;
}