Cod sursa(job #2492871)
Utilizator | Robert Gaspar Darkwarrior | Data | 15 noiembrie 2019 14:46:51 |
---|---|---|---|
Problema | Patrate2 | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
///Raspunsul este n!*(2^(n^2))
using namespace std;
ifstream f("patrate2.in");
ofstream g("patrate2.out");
struct Huge{
int a[100000];
};
void makeHuge(Huge &H, unsigned long X) {
H.a[0] = 0;
while (X) {
++H.a[0];
H.a[H.a[0]] = X % 10;
X /= 10;
}
}
void mult(){
}
int main()
{
int n;
cin>>n;
Huge A;
makeHuge(A,5387563765756);
/*for(int i=1;i<=A.a[0];i++){
cout<<A.a[i];
}*/
cout<<A.a[0];
return 0;
}