显示原始代码
#include <stdio.h>
#include <math.h>
long long weishu(long long a) {
long long count = 0;
while (a != 0) {
a /= 10;
count++;
}
return count;
}
int main() {
long long n;
scanf("%d", &n);
long double num_wei = 0;
for (long long i = 0; i < n; i++) {
num_wei += pow(2, i);
}
long long result1 = weishu((long long)num_wei);
printf("%lld\n", result1);
int result2[10][50];
long long num_wei1 = (long long)num_wei;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 50; j++) {
result2[i][j] = 0;
}
}
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 50; j++) {
result2[i][j] = num_wei1 % 10;
num_wei1 /= 10;
}
}
for (int i = 9; i >= 0; i--) {
for (int j = 49; j >= 0; j--) {
printf("%d", result2[i][j]);
}
printf("\n");
}
return 0;
}