第十三次CCF计算机软件能力认证CSP题解

CSP13-1 跳一跳

/*
csp13-1 跳一跳
2017/04/02
by Tawn
*/
#include <bits/stdc++.h>

using namespace std;
const int maxn = 100;

int main()
{
  int i;
  int j = 0;
  int s = 0;
  while(cin >> i && i)
  {
    if(i == 1) {s += 1; j = 0;}
    if(i == 2) {s += j+2; j += 2;}
  }
  cout << s << endl;
  return 0;
}

CSP13-2 碰撞的小球

/*
csp13-2 碰撞的小球
2017/04/02
by Tawn
*/
#include <bits/stdc++.h>

using namespace std;
const int maxn = 100;

int n, L , t;
int pos[maxn];
int ori[maxn];

int main()
{
  cin >> n >> L >> t;
  for(int i = 1; i <= n; i++)
     {
       cin >> pos[i];
       ori[i] = 1;
     }

  while(t--)
  {
    for(int i = 1; i <= n; i++)
    {
      if(pos[i] == 0 || pos[i] == L) ori[i] = -ori[i];
      pos[i] += ori[i];
    }
    for(int i = 1; i <= n; i++)
      for(int j = i+1; j <= n; j++)
      {
        if(p