0_0_39341888_20973.cpp:2:1: error: stray '\241' in program
2 | <a1><a1><a1><a1>Consider a bidirectional graph G with N vertices and M edges. All edges are painted into either white or black. Can we find a Spanning Tree with some positive Fibonacci number of white edges?
| ^~~~
0_0_39341888_20973.cpp:2:2: error: stray '\241' in program
2 | <a1><a1><a1><a1>Consider a bidirectional graph G with N vertices and M edges. All edges are painted into either white or black. Can we find a Spanning Tree with some positive Fibonacci number of white edges?
| ^~~~
0_0_39341888_20973.cpp:2:3: error: stray '\241' in program
2 | <a1><a1><a1><a1>Consider a bidirectional graph G with N vertices and M edges. All edges are painted into either white or black. Can we find a Spanning Tree with some positive Fibonacci number of white edges?
| ^~~~
0_0_39341888_20973.cpp:2:4: error: stray '\241' in program
2 | <a1><a1><a1><a1>Consider a bidirectional graph G with N vertices and M edges. All edges are painted into either white or black. Can we find a Spanning Tree with some positive Fibonacci number of white edges?
| ^~~~
0_0_39341888_20973.cpp:5:1: error: stray '\241' in program
5 | <a1><a1><a1><a1>The first line of the input contains an integer T, the number of test cases.
| ^~~~
0_0_39341888_20973.cpp:5:2: error: stray '\241' in program
5 | <a1><a1><a1><a1>The first line of the input contains an integer T, the number of test cases.
| ^~~~
0_0_39341888_20973.cpp:5:3: error: stray '\241' in program
5 | <a1><a1><a1><a1>The first line of the input contains an integer T, the number of test cases.
| ^~~~
0_0_39341888_20973.cpp:5:4: error: stray '\241' in program
5 | <a1><a1><a1><a1>The first line of the input contains an integer T, the number of test cases.
| ^~~~
0_0_39341888_20973.cpp:6:1: error: stray '\241' in program
6 | <a1><a1><a1><a1>For each test case, the first line contains two integers N(1 <= N <= 105) and M(0 <= M <= 105).
| ^~~~
0_0_39341888_20973.cpp:6:2: error: stray '\241' in program
6 | <a1><a1><a1><a1>For each test case, the first line contains two integers N(1 <= N <= 105) and M(0 <= M <= 105).
| ^~~~
0_0_39341888_20973.cpp:6:3: error: stray '\241' in program
6 | <a1><a1><a1><a1>For each test case, the first line contains two integers N(1 <= N <= 105) and M(0 <= M <= 105).
| ^~~~
0_0_39341888_20973.cpp:6:4: error: stray '\241' in program
6 | <a1><a1><a1><a1>For each test case, the first line contains two integers N(1 <= N <= 105) and M(0 <= M <= 105).
| ^~~~
0_0_39341888_20973.cpp:7:1: error: stray '\241' in program
7 | <a1><a1><a1><a1>Then M lines follow, each contains three integers u, v (1 <= u,v <= N, u<> v) and c (0 <= c <= 1), indicating an edge between u and v with a color c (1 for white and 0 for black).
| ^~~~
0_0_39341888_20973.cpp:7:2: error: stray '\241' in program
7 | <a1><a1><a1><a1>Then M lines follow, each contains three integers u, v (1 <= u,v <= N, u<> v) and c (0 <= c <= 1), indicating an edge between u and v with a color c (1 for white and 0 for black).
| ^~~~
0_0_39341888_20973.cpp:7:3: error: stray '\241' in program
7 | <a1><a1><a1><a1>Then M lines follow, each contains three integers u, v (1 <= u,v <= N, u<> v) and c (0 <= c <= 1), indicating an edge between u and v with a color c (1 for white and 0 for black).
| ^~~~
0_0_39341888_20973.cpp:7:4: error: stray '\241' in program
7 | <a1><a1><a1><a1>Then M lines follow, each contains three integers u, v (1 <= u,v <= N, u<> v) and c (0 <= c <= 1), indicating an edge between u and v with a color c (1 for white and 0 for black).
| ^~~~
0_0_39341888_20973.cpp:9:1: error: stray '\241' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:2: error: stray '\241' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:3: error: stray '\241' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:4: error: stray '\241' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:39: error: stray '\241' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:40: error: stray '\260' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:46: error: stray '#' in program
9 | ˇˇˇˇFor each test case, output a line ˇ°Case #x: sˇ±. x is the case number and s is either ˇ°Yesˇ± or ˇ°Noˇ± (without quotes) representing the answer to the problem.
| ^
0_0_39341888_20973.cpp:9:51: error: stray '\241' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:52: error: stray '\261' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:92: error: stray '\241' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:93: error: stray '\260' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:97: error: stray '\241' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:98: error: stray '\261' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:103: error: stray '\241' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:104: error: stray '\260' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:107: error: stray '\241' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer to the problem.
| ^~~~
0_0_39341888_20973.cpp:9:108: error: stray '\261' in program
9 | <a1><a1><a1><a1>For each test case, output a line <a1><b0>Case #x: s<a1><b1>. x is the case number and s is either <a1><b0>Yes<a1><b1> or <a1><b0>No<a1><b1> (without quotes) representing the answer t
|
