Pagini recente » Cod sursa (job #301698) | Cod sursa (job #1563860) | Cod sursa (job #2938381) | Cod sursa (job #1961442) | Cod sursa (job #1439147)
#include <cstdio>
#define nmax 205
#define mod 98999
using namespace std;
int dp[nmax][nmax],dp1[nmax][nmax];
int main(){
int i,j,x,n,m,t;
freopen("stirling.in","r",stdin);
freopen("stirling.out","w",stdout);
scanf("%d\n",&t);
dp[1][1] = 1;
for(i = 2; i <= 200; ++i)
for(j = 1; j <= 200;++j)
dp[i][j] = (dp[i-1][j-1] - (i-1)*dp[i-1][j])%mod;
dp1[1][1] = 1;
for(i = 2; i <= 200; ++i)
for(j = 1; j <= 200;++j)
dp1[i][j] = (dp1[i-1][j-1] + j*dp1[i-1][j])%mod;
while(t--){
scanf("%d %d %d\n",&x,&n,&m);
if(x == 1) printf("%d\n",dp[n][m]);
else printf("%d\n",dp1[n][m]);
}
return 0;
}