Pagini recente » Cod sursa (job #311771) | Cod sursa (job #258152) | Cod sursa (job #62308) | Cod sursa (job #1559556) | Cod sursa (job #147182)
Cod sursa(job #147182)
#include <cstdio>
#include <cstring>
#define SIZE 10000
#define NR_CIFRE 10000
int a[SIZE], aa[SIZE], aaa[SIZE], b[SIZE], c[SIZE];
void add(int A[], int B[])
{
int i, t = 0;
for (i=1; i<=A[0] || i<=B[0] || t; i++, t/=10)
A[i] = (t += A[i] + B[i]) % 10;
A[0] = i - 1;
}
void mul(int A[], int B)
{
int i, t = 0;
for (i = 1; i <= A[0] || t; i++, t /= 10)
A[i] = (t += A[i] * B) % 10;
A[0] = i - 1;
}
void MUL(int A[], int B[])
{
int i, j, t, C[NR_CIFRE];
memset(C, 0, sizeof(C));
for (i = 1; i <= A[0]; i++)
{
for (t=0, j=1; j <= B[0] || t; j++, t/=10)
C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;
if (i + j - 2 > C[0]) C[0] = i + j - 2;
}
memcpy(A, C, sizeof(C));
}
void SUB(int A[], int B[])
{
int i, t = 0;
for (i = 1; i <= A[0]; i++)
A[i] += (t = (A[i] -= B[i] + t) < 0) * 10;
for (; A[0] > 1 && !A[A[0]]; A[0]--);
}
void sub(int A[], int b)
{
int i, t = 0;
for(i = 1; i <= A[0]; i++)
{
if(A[i]-b >= 0)
{
A[i] -= b;
continue;
}
else
{
b -= A[i];
A[i] = 0;
}
}
}
void read()
{
freopen("sarpe.in", "r", stdin);
freopen("sarpe.out", "w", stdout);
char t1[SIZE];
int i;
scanf("%s", &t1);
a[0] = aa[0] = aaa[0] = strlen(t1);
for(i = 1; i <= a[0]; i++)
a[i] = aa[i] = aaa[i] = t1[i-1] - '0';
}
int main()
{
int i;
read();
b[0] = 1;
b[1] = 1;
c[0] = 1;
c[2] = 2;
sub(a, 1);
sub(aa, 2);
mul(aaa, 4);
MUL(a, aa);
mul(a, 2);
add(a, aaa);
for(i = a[0]; i >= 1; i--)
printf("%d", a[i]);
printf("\n");
return 0;
}