src2020/1837_bestway/bestway2.cpp

16 lines
396 B
C++
Raw Normal View History

2020-03-20 17:40:39 +08:00
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int n, m, a[101][101] = { 0 },ge[101]={0};//a[i][j] i-->j <20><>ֱ<EFBFBD><D6B1>·<EFBFBD><C2B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ż<EFBFBD>ȯ<EFBFBD><C8AF>
double f[101][21] = { 0 };//<2F><><EFBFBD><EFBFBD>1<EFBFBD><31><EFBFBD>̾<EFBFBD><CCBE><EFBFBD><EBA3AC><EFBFBD><EFBFBD><EFBFBD>Ż<EFBFBD>ȯ<EFBFBD><C8AF>
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> a[i][j];
}
}
do{
}while (t<w);
}