Pagini recente » Borderou de evaluare (job #279920) | Borderou de evaluare (job #2587737) | Monitorul de evaluare | Statistici Jarca Andrei (asdfsfafafafafafafafa) | Cod sursa (job #3366381)
// #pragma GCC optimize("O3,unroll-loops,fast-math")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int Nmax=4e3+5,inf=1e9,MOD=1e9+7;
int ans[Nmax],len;
void mult(int x) {
int carry=0;
for (int i=0; i<len; ++i) {
carry+=ans[i]*x;
ans[i]=carry%10;
carry/=10;
}
while (carry) {
ans[len++]=carry%10;
carry/=10;
}
}
int main() {
ifstream cin("patrate2.in");
ofstream cout("patrate2.out");
int n;
cin>>n;
ans[0]=len=1;
for (int i=1; i<=n; ++i) mult(i);
for (int i=1; i<=n*n; ++i) mult(2);
for (int i=len-1; i>=0; --i) cout<<ans[i];
return 0;
}