-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathUva626.cpp~
More file actions
74 lines (71 loc) · 1.86 KB
/
Copy pathUva626.cpp~
File metadata and controls
74 lines (71 loc) · 1.86 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include <iostream>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <sstream>
using namespace std;
typedef vector<int> vi;
bool identical(vi result,vector<vi> Result){
vi temp=result;
for(int i=0;i<Result.size();i++){
sort(temp.begin(),temp.end());
vi curr=Result[i];
vi localTemp=Result[i];
sort(localTemp.begin(),localTemp.end());
if(temp==localTemp){
reverse(result.begin(),result.end());
if(result!=curr){
return true;
}
}
}
return false;
}
int main()
{
int N;
while(cin>>N){
vector<vi> Coll;
vi vec;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
int n;
cin>>n;
vec.push_back(n);
}
Coll.push_back(vec);
vec.clear();
}
int total=0;
vector<vi> result;
for(int i=0;i<Coll.size();i++){
for(int j=0;j<Coll[i].size();j++){
if(Coll[i][j]==1){
for(int k=0;k<N;k++){
if(Coll[j][k]==1 && Coll[k][i]==1){
vi temp;
temp.push_back(i+1);temp.push_back(j+1);temp.push_back(k+1);
if(identical(temp,result)==false){
total++;
result.push_back(temp);
}
}
}
}
}
}
for(int i=0;i<result.size();i++){
for(int j=0;j<result[i].size();j++){
cout<<result[i][j]<<" ";
}
cout<<endl;
}
cout<<"Total : "<<total<<endl;
}
return 0;
}