Pagini recente » Cod sursa (job #2278189) | Cod sursa (job #159239) | Cod sursa (job #2947573) | Cod sursa (job #526058) | Cod sursa (job #1649291)
#include <fstream>
#define w 205
#define mod 98999
using namespace std;
long long a[w][w];
long long b[w][w];
void st1()
{
int i,j;
for (i=0;i<=200;i++)
a[i][i]=1;
for (i=2;i<=200;i++)
{
for (j=1;j<i;j++)
a[i][j]=(a[i-1][j-1]-(i-1)*a[i-1][j])%mod;
}
}
void st2()
{
int i,j;b[0][0]=1;
for (i=1;i<=200;i++)
b[i][i]=b[i][1]=1;
for (i=2;i<=200;i++)
{
for (j=2;j<i;j++)
b[i][j]=(b[i-1][j-1]+j*b[i-1][j])%mod;
}
}
int main()
{
ifstream f("stirling.in");
ofstream g("stirling.out");
int i,T,op,x,y;
st1();st2();
f>>T;
for (i=1;i<=T;i++)
{
f>>op>>x>>y;
if (op==1)
g<<a[x][y]<<'\n';
else g<<b[x][y]<<'\n';
}
f.close();
g.close();
return 0;
}