Codeforces Round #303 (Div. 2)

A.Toy Cars

　　题意：给出n辆玩具车两两碰撞的结果，找出没有翻车过的玩具车。

　　思路：简单题。遍历即可。

 1 #include<iostream>
 2 #include<cstdio>
 3 using namespace std;
 4 int mp[110][110];
 5 int goodcar[110];
 6 int main()
 7 {
 8     int n;
 9     scanf("%d", &n);
10     for (int i = 1; i <= n; i++)
11     {
12         for (int j = 1; j <= n; j++) scanf("%d", *(mp + i) + j);
13     }
14     int cnt = 0;
15     for (int i = 1; i <= n; i++)
16     {
17         bool ok = true;
18         for (int j = 1; j <= n; j++)
19         {
20             if (j == i) continue;
21             if (mp[i][j] == 1 || mp[i][j] == 3||mp[j][i]==2||mp[j][i]==3)
22             {
23                 ok = false;
24                 break;
25             }
26         }
27         if (ok) goodcar[cnt++] = i;
28     }
29     printf("%d\n", cnt);
30     if (cnt)
31     {
32         for (int i = 0; i < cnt; i++)
33         {
34             if (i) printf(" ");
35             printf("%d", goodcar[i]);
36         }
37         printf("\n");
38     }
39     return 0;
40 }

View Code