FilesExpand file tree

 master

/

10054.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

62 lines (56 loc) · 1.13 KB

 master

/

10054.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

62 lines (56 loc) · 1.13 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include <iostream>

#include <vector>

#include <string.h>

using namespace std;

const int MAXN = 100;

int N, n_case;

int g[MAXN][MAXN], start;

vector<int> ans;

void dfs(int cur){

for(int i=0; i<MAXN; i++){

if(g[cur][i]>0){

g[cur][i]--;

g[i][cur]--;

dfs(i);

}

}

ans.push_back(cur);

}

void work(){

for(int i=0; i<MAXN; i++){

int t_sum = 0;

for(int j=0; j<MAXN; j++){

t_sum+=g[i][j];

}

if(t_sum%2!=0){

cout<<"some beads may be lost"<<endl;

return ;

}

}

dfs(start);

int sz = ans.size();

for(int i=0; i<sz-1; i++){

cout<<ans[i]<<" "<<ans[i+1]<<endl;

}

}

int main(){

int T,a,b;

int blank= 0;

cin>>T;

for(n_case=1; n_case<=T; n_case++){

if(blank>=1)cout<<endl;

blank++;

cin>>N;

memset(g,0,sizeof(g));

ans.clear();

cout<<"Case #"<<n_case<<endl;

for(int j=0; j<N; j++){

cin>>a>>b;

g[a][b] += 1;

g[b][a] += 1;

start = a;

}

work();

}

return 0;

}