Pagini recente » Istoria paginii runda/am_piramide | Cod sursa (job #1824940) | Istoria paginii runda/brasov_9_jr | Istoria paginii runda/jbprep1/clasament | Cod sursa (job #1300092)
#include <fstream>
using namespace std;
ifstream fin("patrate2.in");
ofstream fout("patrate2.out");
int n, m, i, j, k, ok, minim, maxim;
unsigned long long v[10000000];
void inmultire(int B){
int i, t = 0;
for (i = 1; i <= v[0] || t; i ++, t /= 10)
v[i] = (t += v[i] * B) % 10;
v[0] = i - 1;
return;
}
void afisare(int n){
for(i = n; i >= 1; i --)
fout << v[i];
return;
}
int main(){
fin >> n; v[0] = 1; v[1] = 2;
for(i = 2; i <= n * n; i ++){
inmultire(2);
}
inmultire(n);
afisare(v[0]);
return 0;
}