雅可比迭代法

#include <iostream>
using namespace std;

#define N 50
double (*data)[N+1]=new double[N][N+1];
double *x=new double[N];
double *y= new double[N];
double sum(const int &,int n);

int main()
{
int n,t;
cout<<"输入方程的阶数n:\n";
cin>>n;
cout<<"输入迭代次数t:\n";
cin>>t;
cout<<"输入增广矩阵\n";
    for (int i=0;i!=n;++i)
        for (int j=0; j!=n+1;++j)
            cin >> data[i][j];
cout << "请输入初始向量:" << endl;
    for (int i=0;i!=n;++i)
        cin >> x[i];
cout << "结果\n";
    for (int i=0;i!=t;++i)
{
        for (int j=0;j!=n;++j)
            y[j]=(data[j][n]-sum(j,n))/data[j][j];
for  (int e=0;e<n;e++)
x[e]=y[e];