程序代码：

#include<stdio.h>
int main()
{
    int a, b;
    scanf("%d%d", &a, &b);
    printf("%d\n", a + b);
    return 0;
}

程序代码：

#include<stdio.h>
int main()
{
    int a, b;
    for(; scanf("%d%d", &a, &b) != EOF; printf("%d\n", a + b));
    return 0;
}

程序代码：

#include<stdio.h>
#define N    100000
int main()
{
    int e[N + 1] = {0}, p[N], pn = 0, an, m, i, j, t;

    for(i = 2; i <= N; e[i++] = 1);

    for(i = 2; i <= N; i++)
    if(e[i]) for(p[pn++] = i, j = i + i; j <= N; j += i) e[j] = 0;

    for(an = pn, i = 0; an < N - 1; i++)
    {
        if((t = p[i] + 1) <= N && !e[t]) e[p[an++] = t] = e[p[i]] + 1;

        for(j = 0, m = N / p[i]; j < pn && p[j] <= m; j++)
        if(!e[t = p[i] * p[j]]) e[p[an++] = t] = e[p[i]] + 1;
    }

    for(i = 3; i <= N; i++) e[i] += e[i - 1];

    while(scanf("%d%d", &i, &j) != EOF) printf("%d\n", e[j] - e[i - 1]);

    return 0;
}

程序代码：

#include<stdio.h>
#include<stdlib.h>
#define MAX_N    1000
#define MAX_M    100000
struct{ int a, b, v, c; }E[MAX_M];
int N, M, R;
int cvf(const void * a, const void * b){ return E[*(int *)a].v - E[*(int *)b].v;}
int gv(int *ei, int en)
{
    int v[MAX_N], c = MAX_M, r = R, i, j, t, va, vb, vc;
    if(en < N - 1) return -1;
    for(i = 0; i < N; v[i] = i++);
    for(j = 1, i = 0; i < en && j < N && r > 0; i++)
    {
        if((va = v[E[ei[i]].a]) == (vb = v[E[ei[i]].b])) continue;
        if(c > (vc = E[ei[i]].c)) c = vc;
        for(j++, r -= E[ei[i]].v, t = 0; t < N; t++)
            if(v[t] == vb) v[t] = va;
    }
    if(j < N || r < 0) return -1;
    return c;
}
int cal()
{
    int ei[MAX_M], en = M, i, j, k, t;
    if(M < N - 1) return -1;
    for(i = 0; i < en; ei[i] = i++);
    qsort(ei, M, sizeof(int), cvf);
    for(k = -1; (t = gv(ei, en)) >= 0; en = j)
    {
        if(k < t) k = t;
        for(j = i = 0; i < en; i++)
            if(E[ei[i]].c > t) ei[j++] = ei[i];
    }
    return k;
}
int main()
{
    int i;
    for(; scanf("%d%d%d", &N, &M, &R) != EOF; printf("%d\n", cal()))
    for(i = 0; i < M; i++) scanf("%d%d%d%d", &E[i].a, &E[i].b, &E[i].v, &E[i].c);
    return 0;
}

程序代码：

#include<stdio.h>
#include<string.h>
int cal(char * s1, char * s2, int a, int b, int c)
{
    int m[2048], *p1 = m, *p2 = &m[1024], *pt;
    int s1n, s2n, sn, i, j, t;
    s1n = strlen(s1);
    s2n = strlen(s2);
    for(p1[0] = i = 0; i < s1n; i++) p1[i + 1] = p1[i] + b;
    for(i = 0; i < s1n; pt = p1, p1 = p2, p2 = pt, i++)
    for(p2[0] = p1[0] + a, j = 0; j < s2n; j++)
        if(s1[i] == s2[j]) p2[j + 1] = p1[j];
        else{
            t = p1[j + 1] + a;
            t = t > p1[j] + c ? p1[j] + c : t;
            t = t > p2[j] + b ? p2[j] + b : t;
            p2[j + 1] = t;
        }
    return p1[s2n];
}

int main()
{
    char s1[1024], s2[1024];
    int a, b, c;
    while(scanf("%d%d%d%s%s", &a, &b, &c, s1, s2) != EOF)
        printf("%d\n", cal(s1, s2, a, b, c));
    return 0;
}

程序代码：

#include<stdio.h>
int turn(int s, int d)
{
    const int c[6][6] = {
        {0, 2, 5, 8, 6, 3}, {0, 3, 6, 8, 5, 2},
        {1, 3, 6, 9, 7, 4},    {1, 4, 7, 9, 6, 3},
        {6, 8, 10, 12, 11, 9}, {6, 9, 11, 12, 10, 8}
    };
    int b[13] = {}, i, t;
    for(i = 0; s; s >>= 1) b[i++] = s & 1;
    for(t = b[c[d][i = 0]]; i < 5; i++) b[c[d][i]] = b[c[d][i + 1]];
    b[c[d][5]] = t;
    for(i = 0; i < 13; i++) s |= b[i] << i;
    return s;
}
int main()
{
    int t[8192] = {}, s[8192] = {0x348}, sn = 1, i, j, ts;
    char str[16];
    for(i = 0; i < sn; i++)
    for(j = 0; j < 6; j++)
    {
        ts = turn(s[i], j);
        if(!t[ts]) t[ts] = t[s[i]] + 1, s[sn++] = ts;
    }
    for(; scanf("%s", str) != EOF; printf("%d\n", t[i]))
    for(i = j = 0; j < 13; j++) i += str[j] - '0' << j;
    return 0;
}

程序代码：

#include<stdio.h>
int cal(char * s)
{
    int n, c, f, i, j;
    for(n = 0; s[n]; s[n] = s[n++] - '0');
    for(c = i = 0; i < n; c += f, i += !s[i])
    for(f = 0, j = i; j < n; s[j] += f * 10, f = s[j] & 1, s[j++] >>= 1);
    return c;
}
int main()
{
    char a[128], b[128];
    int c;
    for(; scanf("%s%s", a, b) != EOF; puts((c = cal(a) - cal(b)) > 0 ? "wm" : c ? "zyf" : "neither"));
    return 0;
}

程序代码：

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

#define MAX_NUM    1000

int cmp(const void * a, const void * b)
{
    if(*(double *)a > *(double *)b) return 1;
    if(*(double *)a < *(double *)b) return -1;
    return 0;
}
   
double fun(int x1, int y1, int x2, int y2)
{
    if(x1 == x2) return 1E10;
    return (double)(y2 - y1) / (x2 - x1);
}

int cal(int s[][2], int n)
{
    int x, y, c, i, j, k;
    double line[MAX_NUM];
    if(!n) return 0;
    for(c = i = 0; i < n; i++)
    {
        x = s[i][0];
        y = s[i][1];
        for(j = i + 1; j < n; j++) line[j] = fun(x, y, s[j][0], s[j][1]);
        qsort(line + i + 1, n - i - 1, sizeof(double), cmp);
        for(j = i + 1; j < n; (c = (k - j > c) ? (k - j) : c), j = k)
        for(k = j + 1; k < n && fabs(line[k] - line [j]) < 1E-10; k++);
    }
    return c + 1;
}

int main()
{
    int s[MAX_NUM][2], n, i;
    for(; scanf("%d", &n) != EOF; printf("%d\n", cal(s, n)))
    for(i = 0; i < n; i++) scanf("%d%d", &s[i][0], &s[i][1]);
    return 0;
}

程序代码：

#include<stdio.h>
int cal(int * a, int n)
{
    int c, x, i, t;
    for(c = 0, x = a[0], i = 1; i < n && !((t = x - a[i]) & 0xFFFFFFFE); c += t, i++);
    if(c == x) return x;
    for(c = 1, x = a[0] + 1, i = 1; i < n && !((t = x - a[i]) & 0xFFFFFFFE); c += t, i++);
    if(c == x) return x;
    return -1;
}
int main()
{
    int a[128], n, i;
    for(; scanf("%d", &n) != EOF; printf("%d\n", cal(a, n)))
    for(i = 0; i < n; scanf("%d", &a[i++]));
    return 0;
}