Pagini recente » Cod sursa (job #2210300) | Cod sursa (job #506239) | Cod sursa (job #817298) | Cod sursa (job #2423334) | Cod sursa (job #1741011)
#include <fstream>
std::ifstream f("stirling.in");
std::ofstream g("stirling.out");
int main()
{
int mod = 98999,t,m,n,x,M =201,s[M][M],S[M][M],i,j;
for(i = 0 ; i < M; i++)
s[i][i] = S[i][i] = 1;
for(i = 1 ; i < M; i++)
for(j = 1 ; j <= i ; j++)
{
s[i][j] = (s[i-1][j-1] - (i-1)*s[i-1][j])%mod;
S[i][j] = (S[i-1][j-1] + j*S[i-1][j])%mod;
}
f >> t;
while(t--)
{
f >> x >> n >> m;
if(x ==1)
g << s[n][m] <<'\n';
else
g << S[n][m] << '\n';
}
return 0;
}