Pagini recente » Cod sursa (job #3340332) | Cod sursa (job #2215238) | Cod sursa (job #1169723) | Istoria paginii utilizator/doru | Cod sursa (job #3332014)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <cmath>
#define ll long long
// #define fin cin
// #define gout cout
using namespace std;
ifstream fin("stirling.in");
ofstream gout("stirling.out");
void stirling_speta_1(int a[201][201])
{
a[0][0]=1;
for(int i=1; i<201; ++i)
{
a[0][i]=a[i][0]=0;
for(int j=1; j<201; ++j)
a[i][j]=a[i-1][j-1]+(i-1)*a[i-1][j];
}
}
void stirling_speta_2(int a[201][201])
{
a[0][0]=1;
for(int i=1; i<201; ++i)
{
a[0][i]=a[i][0]=0;
for(int j=1; j<201; ++j)a[i][j]=a[i-1][j-1]+j*a[i-1][j];
}
}
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(0);
gout.tie(0);
int salut,x,n,m;
fin>>salut;
int a[201][201],b[201][201];
stirling_speta_1(a);
stirling_speta_2(b);
while(salut--)
{
fin>>x>>n>>m;
if(x==1)gout<<((n-m)%2?-1:1)*a[n][m]<<'\n';
else gout<<((n-m)%2?-1:1)*b[n][m]<<'\n';
}
return 0;
}