Games - Algorithm

Here's your approach:

$1.$ Define a struct with two fields: home and away.

$2.$ Read $n$ and create an array of $n$ team structs.

$3.$ Read each team's colors into the array.

$4.$ Initialize a conflict counter to 0.

$5.$ Outer loop: for each team $i$ from 0 to $n-1$ (the host).

$6.$ Inner loop: for each team $j$ from 0 to $n-1$ (the guest).

$7.$ If $i \neq j$ and teams[i].home == teams[j].away, increment the counter.

$8.$ Print the counter. The nested loops check every game. Structs make comparison clean: you access teams[i].home and teams[j].away without juggling separate arrays.