Pagini recente » Cod sursa (job #1842895) | Cod sursa (job #471895) | Cod sursa (job #1500811) | Cod sursa (job #726227) | Cod sursa (job #2616434)
//#include "pch.h"
#include <iostream>
#include <fstream>
#include <vector>
#include <climits>
#include <algorithm>
#include <string>
using namespace std;
using ll = long long int;
fstream f("stirling.int");
ofstream o("stirling.out");
constexpr int mod = 98999;
int n, m, speta, t;
int v1[205][205];
int v2[205][205];
void speta2(int n, int k)
{
v1[1][1] = 1;
int i, j = 0;
for (i = 2; i <= 200; i++)
{
for (j = 1; j <= i; j++)
{
v1[i][j] = (v1[i - 1][j - 1] + j * v1[i - 1][j]) % mod;
}
}
}
void speta1(int n, int k)
{
v2[1][1] = 1;
int i, j = 0;
for (i = 2; i <= n; i++)
{
for (j = 1; j <= i; j++)
{
v2[i][j] = (v2[i - 1][j - 1] - (i - 1)*v2[i - 1][j]) % mod;
}
}
}
int main()
{
f >> t;
while (t--)
{
f >> speta >> n >> m;
if (speta == 1)
{
speta1(n, m);
o << v2[n][m] << "\n";
}
else
{
speta2(n, m);
o << v1[n][m] << "\n";
}
}
}