Pagini recente » Cod sursa (job #2428435) | Cod sursa (job #1583010) | Cod sursa (job #2986741) | Cod sursa (job #2286257) | Cod sursa (job #2863032)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("functii.in");
ofstream fout("functii.out");
const int MOD = 30103;
int v[10007];
int powe(int n, int p)
{
int ans = 1;
while (p > 0)
{
if (p % 2 == 1)
{
ans *= n;
ans %= MOD;
}
n = (1ll * n * n) % MOD;
p /= 2;
}
return ans;
}
int main()
{
int n, s;
fin >> n >> s;
v[1] = 1;
for (int i = 2; i <= n; i++)
{
v[i] = 1ll * v[i - 1] * i % MOD;
}
fout << ((v[n] * 1ll * powe(v[s], MOD - 2) % MOD * powe(v[n - s], MOD - 2)) % MOD * (powe(2, s) + MOD - 2)) % MOD;
return 0;
}