Pagini recente » Cod sursa (job #3156679) | Cod sursa (job #2862690) | Cod sursa (job #2196443) | Cod sursa (job #1432679) | Cod sursa (job #1138208)
#include<cstdio>
using namespace std;
#define NMAX 201
#define MOD 98999
int s[NMAX][NMAX] , S[NMAX][NMAX] ;
int t , tip , n , m;
int main()
{
freopen("stirling.in" , "r" , stdin );
freopen("stirling.out" , "w" , stdout );
s[1][1] = S[1][1] = 1;
for(int i = 2 ; i < NMAX ; ++i )
for(int j = 1 ; j < NMAX ; ++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;
}
scanf("%d" , &t);
for(int i = 1 ; i <= t ; ++i )
{
scanf("%d%d%d" , &tip , &n , &m );
if(tip == 1)
printf("%d\n" , s[n][m]);
else
printf("%d\n" , S[n][m]);
}
return 0;
}