#include <iostream>
#include <fstream>
#include <iomanip>
#include <math.h>

using namespace std;
#include "a2.h"

// solution to question 1:
double geomean(double a[], int n) {
    if (a==NULL || n<=0) return 0.0;
    double mult=1.0;
    for (int i=0;i<n;i++) {
	mult*=a[i];
    }
    return pow(mult,1.0/n);
}

/* solution to question 2:
1.77
*/

// solution to question 3:
void transpose(double a[][N]) {
	double t;
    for (int i=0;i<N;i++) {
	for (int j=i+1;j<N;j++) {
	    t=a[i][j];
	    a[i][j]=a[j][i];
	    a[j][i]=t;
	}
    }
}

/* solution to question 4:
1.1 '1.9 1.1 '2.9
2.3 2.3 '0.66 1.3
9 6 3 7
4 4 13 2
*/

// solution to question 5:
complex* readIn(const char* name, int* size) {
    ifstream fin(name);
    int s;
    fin>>s;
    if (s<0 || fin.fail()) {
	*size=0;
	return NULL;
    }
    *size=s;
    complex* a=new complex[s];
    for (int i=0;i<s;i++) {
	a[i].real=0.0;
	a[i].imaginary=0.0;
    }
    for (int i=0;i<s;i++) {
	fin >> a[i].real >> a[i].imaginary;
    }
    return a;
}

// solution to question 6:
void process(const char* in1, const char* in2, const char* outname) {
    int size1=0;
    int size2=0;
    complex* a1=readIn(in1,&size1);
    complex* a2=readIn(in2,&size2);
    complex* a3=NULL;
    if (size1<=0 || size2 <=0 || size1!=size2) {
	writeOut(outname,NULL,0);
    }
    else {
	a3=multiplyArrays(a1,a2,size1);
	writeOut(outname,a3,size1);
    }
    delete[]a1;
    delete[]a2;
    delete[]a3;
}
void writeOut(const char* name, complex a[], int size) {
    ofstream fout(name);
    fout << size << " ";
    for (int i=0;i<size;i++) {
	fout << a[i].real << " " << a[i].imaginary << " " ;
    }
    fout << endl;
}
complex* multiplyArrays(complex a1[], complex a2[], int size) {
    complex* a3=new complex[size];
    for (int i=0;i<size;i++) {
	a3[i]=multiplyComplex(a1[i],a2[i]);
    }
    return a3;
}
complex multiplyComplex(complex c1, complex c2) {
    complex result;
    result.real=c1.real*c2.real - c1.imaginary*c2.imaginary;
    result.imaginary=c1.real*c2.imaginary + c1.imaginary*c2.real;
    return result;
}

/* solution to question 7:

*/