Pagini recente » Cod sursa (job #1385168) | Cod sursa (job #2123403) | Cod sursa (job #1188601) | Cod sursa (job #2739869) | Cod sursa (job #1346978)
#include<cstdio>
#include<algorithm>
#include<cstring>
#define Nmax 201
using namespace std;
int n,i,j,x,y,z,t;
int s[Nmax+5][Nmax+5],S[Nmax+5][Nmax+5];
void dp()
{
for (i=2;i<=Nmax;i++)
for (j=1;j<=i;j++)
{
s[i][j]=s[(i-1)][j-1]-(i-1)*s[(i-1)][j];
S[i][j]=S[(i-1)][j-1]+j*S[(i-1)][j];
}
}
int main()
{
freopen("stirling.in","r",stdin);
freopen("stirling.out","w",stdout);
scanf("%d",&t);
s[1][1]=S[1][1]=1;
dp();
while (t--)
{
scanf("%d %d %d",&x,&y,&z);
if (x==1) printf("%d\n",s[y][z]);
else printf("%d\n",S[y][z]);
}
return 0;
}