# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3674 | wookayin | Following Flow (kriii1_F) | C++98 | 0 ms | 1680 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <utility>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <cstdio>
using namespace std;
#pragma warning(disable:4996)
#define REP(t, n) for(int t=0; t<(int)(n); ++t)
#define FOR(t, x, y) for(int t=x; t<(int)(y); ++t)
int n, m;
vector< pair<int,int> > gr[33];
vector< vector<double> > A;
vector< double > B;
void gauss(vector< vector<double> > &A, vector<double> &b, vector<double> & x)
{
int n = A.size();
const double EPS = 1e-9;
REP(i, n) {
int pivot = i;
for(int j = i+1; j<n; ++j)
if( fabs(A[j][i]) > fabs(A[pivot][i]) ) pivot = j;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |