Codeforces Round #779 (Div. 2) 1658B - Marin and Anti-coprime Permutation Solution

 

Problem Link : https://codeforces.com/problemset/problem/1658/B 

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

long long mod=998244353;

int main()

{

    long long  n,ans,t,i;

    cin>>t;

    while(t--)

    {

        cin>>n;

        if(n%2==1)

            cout<<"0"<<endl;

        else

        {

            ans=1;

            for(i=1;i<=n/2;i++)

            {

                ans*=(i*i);

                ans=ans%mod;

            }

            cout<<ans<<endl;

        }

    }

}