Cod sursa(job #1977641)
| Utilizator | Data | 5 mai 2017 18:17:36 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream in("stirling.in");
ofstream out("stirling.out");
int t,sp,n,m;
int s[205][205],S[205][205];
const int MOD=98999;
int main()
{
s[1][1]=S[1][1]=1;
for(int i=2; i<=200; i++)
for(int j=1; j<=200; 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;
}
in>>t;
while(t--)
{
in>>sp>>n>>m;
if(sp==1) out<<s[n][m]<<'\n';
else out<<S[n][m]<<'\n';
}
return 0;
}
