Cod sursa(job #3363609)
| Utilizator | Data | 19 august 2026 17:41:25 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream cin("stirling.in");
ofstream cout("stirling.out");
int s[205][205],S[205][205];
const int mod=98999;
int main()
{
s[1][1]=S[1][1]=1;
for(int n=2;n<=200;n++){
for(int m=1;m<=n;m++){
s[n][m]=(s[n-1][m-1]-(n-1)*s[n-1][m])%mod;
S[n][m]=(S[n-1][m-1]+m*S[n-1][m])%mod;
}
}
int t;
cin>>t;
while(t--){
int x,n,m;
cin>>x>>n>>m;
if(x==1) cout<<s[n][m];
else cout<<S[n][m];
cout<<'\n';
}
return 0;
}
