为了熟悉一下code jam的平台,今天简单试了一下,做了一下Qualification Round Africa 2010的三道题目,都是很基础的。

  A题:给一个数n和一系列数a[],从a[]中找出两个数的和等于n,输出这两个数的下标。

 1 #include <cstdio>
 2 #define MAXN 2010
 3 
 4 int p[MAXN];
 5 
 6 int main()
 7 {
 8 #ifdef LOCAL
 9     freopen("A-large-practice.in", "r", stdin);
10     freopen("A.out", "w", stdout);
11 #endif
12     int T;
13     scanf("%d", &T);
14     for (int kase = 1; kase <= T; kase++)
15     {
16         int c, n;
17         scanf("%d%d", &c, &n);
18         for (int i = 1; i <= n; i++)
19             scanf("%d", &p[i]);
20         int i, j;
21         for (i = 1; i <= n; i++)
22             for (j = i+1; j <= n; j++)
23                 if (p[i] + p[j] == c)  goto s;
24 s:        printf("Case #%d: %d %d\n", kase, i, j);
25     }
26     return 0;
27 }
View Code

相关文章: