Pagini recente » Cod sursa (job #471573) | Borderou de evaluare (job #1567267) | Cod sursa (job #2584821) | Cod sursa (job #863660) | Cod sursa (job #1929220)
#include <iostream>
#include <fstream>
#define MOD 98999
using namespace std;
ifstream f ("stirling.in");
ofstream t ("stirling.out");
int S[210][210],s[210][210];
inline void preproc () {
s[0][0]=S[0][0]=1;
for (int i=1;i<210;++i)
for (int 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;
}
int main()
{
preproc();
int q;
f>>q;
for (int type,x,y;q;--q){
f>>type>>x>>y;
if (type==1)
t<<s[x][y]<<'\n';
else
t<<S[x][y]<<'\n';
}
return 0;
}