Pagini recente » Cod sursa (job #1065373) | Cod sursa (job #1711059) | Cod sursa (job #570613) | Cod sursa (job #1507002) | Cod sursa (job #1166158)
#include<fstream>
#include<cstdio>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define ll long long
#define inf (1<<30)
#define base 256
#define ba 255
#define N 210
#define EPS 1e-12
#define mod 98999
#define inu "stirling.in"
#define outu "stirling.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
int n,T,t,x,y,s[N][N],S[N][N];
int main ()
{
n=200;
s[0][0]=S[0][0]=1;
FOR(i,1,n)
FOR(j,1,i)
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%mod;
FOR(i,1,n)
FOR(j,1,i)
S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%mod;
f>>T;
FOR(i,1,T)
{
f>>t>>x>>y;
if(t==1)
g<<s[x][y]<<"\n";
else
g<<S[x][y]<<"\n";
}
return 0;
}