problemscpp
A collection of my answers to algorithm problems in c++.
载入中...
搜索中...
未找到
comp526::weakvertices 命名空间参考

函数

int main (istream &cin, ostream &cout)
 
 TEST (weakvertices, case1)
 

函数说明

◆ main()

int comp526::weakvertices::main ( istream & cin,
ostream & cout )

在文件 comp526.cpp491 行定义.

491 {
492 int n;
493 while(cin >> n) {
494 if(n == -1)
495 return 0;
496 vector<vector<int>> siblings = vector(n, vector<int>());
497 vector<vector<bool>> graph = vector(n, vector<bool>(n, false));
498 for(int i = 0; i < n; i++) {
499 for(int j = 0; j < n; j++) {
500 int x;
501 cin >> x;
502 if(x == 1) {
503 siblings[i].push_back(j);
504 //siblings[j].push_back(j);
505 graph[i][j] = true;
506 graph[j][i] = true;
507 }
508 }
509 }
510 for(int i = 0; i < n; i++) {
511 bool flag = true;
512 for(int j = 0; j < siblings[i].size(); j++) {
513 for(int k = j + 1; k < siblings[i].size(); k++) {
514 if(graph[siblings[i][j]][siblings[i][k]]) {
515 flag = false;
516 break;
517 }
518 }
519 if(!flag) {
520 break;
521 }
522 }
523 if(flag) {
524 cout << i << ' ';
525 }
526 }
527 cout << endl;
528 }
529
530 return 0;
531 }

被这些函数引用 TEST().

◆ TEST()

comp526::weakvertices::TEST ( weakvertices ,
case1  )

在文件 comp526_test.cpp298 行定义.

298 {
299 istringstream in("9\n0 1 1 1 0 0 0 0 0\n1 0 0 0 0 0 1 0 0\n1 0 0 1 0 1 0 0 0\n1 0 1 0 0 1 1 0 0\n0 0 0 0 0 0 1 1 0\n0 0 1 1 0 0 0 0 0\n0 1 0 1 1 0 0 1 0\n0 0 0 0 1 0 1 0 1\n0 0 0 0 0 0 0 1 0\n1\n0\n-1\n");
300 auto out = ostringstream();
301 main(in, out);
302 const auto ans = out.str();
303 ASSERT_EQ("1 8 \n0 \n", ans);
304 }
int main(istream &cin, ostream &cout)

引用了 main().