```/* G02DA_P0W_F C++ Header Example Program.
*
* Copyright 2019 Numerical Algorithms Group.
* Mark 27, 2019.
*/

#include <nag.h>
#include <stdio.h>
#include <string>
#include <iostream>
using namespace std;

int main(void)
{
int     exit_status = 0;
double  tol = 0.000001;

cout << "G02DA_P0W_F C++ Header Example Program Results\n\n";

// Skip heading in data file
string mystr;
getline (cin, mystr);

Integer n, m;
cin >> n;
cin >> m;

// Allocate arrays depending on m and n.
double  *x=0, *y=0;
Integer *isx=0;
x   = new double  [m*n];
y   = new double  [n];
isx = new Integer [m];

for (int i = 0; i<n; ++i) {
for (int j = 0; j<m; ++j) {
int k = i + j*n;
cin >> x[k];
}
cin >> y[i];
}

// Calculate ip
Integer ip = 0;
for (int j = 0; j<m; ++j) {
cin >> isx[j];
if (isx[j]>0) {
ip++;
}
}
// Mean = 'M'
ip++;

// Allocate arrays depending on ip
double  *b=0, *cov=0, *h=0, *p=0, *q=0, *res=0, *se=0, *wk=0;
Integer lcov = (ip*ip+ip)/2, lp = ip*(ip+2), lq = n*(ip+1);
Integer lwk  = ip*ip + 5*(ip-1);
b   = new double [ip];
cov = new double [lcov];
h   = new double [n];
p   = new double [lp];
q   = new double [lq];
res = new double [n];
se  = new double [ip];
wk  = new double [lwk];

// Perform Regression
Integer idf, irank;
logical svd;
Integer ifail = 0;
b,se,cov,res,h,q,n,svd,irank,p,tol,wk,ifail,1,1);

// Display results
if (svd) {
cout << "Model is not of full rank, rank = " << irank << endl;
}
cout << "Residual sum of squares         = " << rss;
cout << "\nDegrees of freedom              = " << idf << endl;
cout << "\nVariable   Parameter estimate   Standard error\n\n";
cout.setf(ios::scientific,ios::floatfield);
cout.precision(2);
for (int i=0; i < ip; ++i) {
cout.width(5); cout << i << "       ";
cout.width(12); cout << b[i] << "       ";
cout.width(12); cout << se[i] << endl;
}

delete [] x;
delete [] y;
delete [] isx;
delete [] b;
delete [] cov;
delete [] h;
delete [] p;
delete [] q;
delete [] res;
delete [] se;
delete [] wk;

return exit_status;
}
```