Pagini recente » Cod sursa (job #17305) | Cod sursa (job #2629164) | Cod sursa (job #2478770) | Cod sursa (job #150250) | Cod sursa (job #466896)
Cod sursa(job #466896)
#include <iostream>
using namespace std;
#define maxc 50000
int N, V[10];
int A[maxc], B[maxc], auxA[maxc], auxB[maxc], C[maxc];
void mul() {
int i, j, t;
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));
}
int cmp() {
if(auxA[0] < auxB[0]) return -1;
else if(auxA[0] > auxB[0]) return 1;
for(int i=auxA[0]; i>=1; i--) {
if(auxA[i] > auxB[i]) return 1;
else if(auxA[i] < auxB[i]) return -1;
}
return 0;
}
int main() {
FILE *f1=fopen("prod.in", "r"), *f2=fopen("prod.out", "w");
int i, j, p, q;
for(i=1; i<=9; i++) {
fscanf(f1, "%d", &V[i]);
}
A[0] = B[0] = 0;
for(i=9; i>=1; i--) {
while(V[i]) {
//adaug i la cel mai mic dintre numere
int nr = 1;
while(A[nr]) {
nr++;
}
auxA[0] = nr - 1;
for(j=1; j<nr; j++) {
auxA[j] = A[nr - j];
}
nr = 1;
while(B[nr]) {
nr++;
}
auxB[0] = nr - 1;
for(j=1; j<nr; j++) {
auxB[j] = B[nr - j];
}
int p = cmp();
if(p <=0 ) {
A[0]++;
A[ A[0] ] = i;
}
else {
B[0]++;
B[ B[0] ] = i;
}
V[i]--;
}
}
for(i=A[0]; i>=1; i--) {
auxA[i] = A[i];
}
for(i=1; i<=A[0]; i++) {
A[i] = auxA[ A[0] - i + 1];
}
for(i=B[0]; i>=1; i--) {
auxB[i] = B[i];
}
for(i=1; i<=B[0]; i++) {
B[i] = auxB[ B[0] - i + 1];
}
mul();
for(i=A[0]; i>=1; i--) {
fprintf(f2, "%d", A[i]);
}
fclose(f1); fclose(f2);
return 0;
}