Pagini recente » Cod sursa (job #2540784) | Borderou de evaluare (job #2772036) | Cod sursa (job #2698464) | Cod sursa (job #3169149) | Cod sursa (job #2373628)
#include <cstdio>
#define MOD 98999
using namespace std;
int s1stirling[201][201];
int s2stirling[201][201];
void formarestirlin_despeta_1()
{
s1stirling[0][0]=1;
s1stirling[1][1]=1;
for(int n=1; n<=200; n++)
{
for(int k=n; k>0; k--)
s1stirling[n][k]=s1stirling[n-1][k-1]-(n-1)*s1stirling[n-1][k];
}
}
void formarestirlin_despeta_2()
{
s2stirling[0][0]=1;
s2stirling[1][1]=1;
for(int n=1; n<=200; n++)
{
for(int k=n; k>0; k--)
s2stirling[n][k]=s2stirling[n-1][k-1]+k*s2stirling[n-1][k];
}
}
int n, k;
int t, tip;
int main()
{
freopen("stirling.in","r",stdin);
freopen("stirling.out","w",stdout);
formarestirlin_despeta_1();
formarestirlin_despeta_2();
scanf("%d", &t);
for(int i=1;i<=t;i++){
scanf("%d %d %d", &tip, &n, &k);
if(tip==1)
printf("%d\n",s1stirling[n][k]);
else printf("%d\n", s2stirling[n][k]);
}
return 0;
}