NA-PTA-NA Lab3 线性方程组求解[严格对角占优/正定的Gauss-Seidel法]

There is No Free Lunch

Format of function:

void Price( int n, double p[] );

where int n satisfies that 2< n ≤10000; double p[ ] is passed into the function as an array of prices p​i​​ and then will be returned storing the costs of the dishes.

Sample program of judge:

#include <stdio.h>
#define Max_size 10000 /* max number of dishes */

void Price( int n, double p[] );

int main()
{
   
    int n