Pagini recente » Cod sursa (job #2514149) | Cod sursa (job #637956) | Cod sursa (job #425443) | Cod sursa (job #3142797) | Cod sursa (job #968715)
Cod sursa(job #968715)
#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <bitset>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <ctime>
#include <string>
#include <cstring>
#include <iomanip>
#include <algorithm>
using namespace std;
ifstream ff("stirling.in");
ofstream gg("stirling.out");
#define max 202
#define md 98999
int aa[max][max], bb[max][max];
void clc(){
aa[1][1]=bb[1][1]=1;
for(int i=2;i<=200;i++)
for(int j=1;j<=200;j++){
aa[i][j]=(aa[i-1][j-1]+j*aa[i-1][j])%md;
bb[i][j]=(bb[i-1][j-1]-(i-1)*bb[i-1][j])%md;
}
}
int main(){
int o, t, n, m;
ff >> t;
clc();
for(int i=0;i<t;i++){
ff >> o >> n >> m;
if(o==1) gg << bb[n][m] << "\n"; else
gg << aa[n][m] << "\n";
}
}