A:
扫一遍。

1 #include<cstdio>
2 #include<cstdlib>
3 #include<cstring>
4
5 using namespace std;
6
7 int n;
8
9 char s1[3],s2[3];
10
11 int main()
12 {
13 scanf("%d",&n);
14 int ans=1;
15 scanf("%s",s1);
16 for (int a=2;a<=n;a++)
17 {
18 scanf("%s",s2);
19 if (s2[0]!=s1[0]) ans++;
20 s1[0]=s2[0];
21 }
22 printf("%d
",ans);
23
24 return 0;
25 }
B:
解方程。

1 #include<cstdio>
2 #include<cstdlib>
3 #include<cstring>
4
5 using namespace std;
6
7 int main()
8 {
9 int a,b,c;
10 scanf("%d%d%d",&a,&b,&c);
11 int v1=(a+b+c)/2-c;
12 int v2=b-v1;
13 int v3=a-v1;
14 if (v1>=0 && v2>=0 && v3>=0 && v2+v3==c) printf("%d %d %d
",v1,v2,v3);
15 else printf("Impossible
");
16
17 return 0;
18 }