Help me in solving FCTRL2 problem

My issue

My code

#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#include <iostream>
using namespace std;
using namespace boost::multiprecision;

int main(){
	int t,n;
	for(int i=1;i<t+1;i++){
		int product=1;
		for(int j=n;j>0;j--)
	return 0;

Problem Link: FCTRL2 Problem - CodeChef

like the constraint of n is upto 100 so u can’t store factorial of 100 in any datatype .
so to compute it u have to perform basic multiplication like 11=1 then 12=2 then 23=6 then 64=24 then 24*5=120 and so on… and u have to store the answer of some vector or array to perform next multiplication.