程序代码：

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

double a[100000][5],max,min,ans,now;
int n,i,j,k;

int main()
{
    while (scanf("%d",&n) != EOF)
    {
          for (i = 0; i < n; i++) 
            for ( j = 0; j < 5; j++) scanf("%lf",&a[ i ][ j ]);
          ans=0.0;
          for (k = 0; k < 32; k++)
          {
              max = -1e10; min = 1e10;
              for (i = 0; i < n; i++)
              {
                  now = 0;
                  for (j = 0; j < 5; j++)
                    if ((1 << j) & k) now = now + a[ i ][ j ]; else now = now - a[ i ][ j ];
                  if (max < now) max = now;
                  if (min > now) min = now;
              }
              if (ans < max - min) ans = max - min;
          }
          printf("%.2lf\n",ans);
    }
}

程序代码：

#include<stdio.h>
int gcd(int a, int b)
{
    int r;
    while(r = a % b) a = b, b = r;
    return b;
}
long long f(long long a, long long b, long long c)
{
    return (abs(b) == 1 ? c : c - a * f(b, a % b, c % b)) / b;
}
int cal(int L, int W, long long x, long long y)
{
    int c, g;
    c = W - L + x - y;
    g = gcd(L, W);
    if(c % g) return -1;
    L /= g; W /= g; c /= g;
    y = f(L, -W, c);
    x = (c + W * y) / L;
    while(x < 0 || y < 0) x += W, y += L;
    return (x & 1) + ((y & 1) << 1);
}
int main()
{
    int L, W, x, y;
    while(scanf("%d%d%d%d", &L, &W, &x, &y), (L | W | x | y))
    printf("%d\n", cal(L, W, x, y));
    return 0;
}

程序代码：

#include <stdio.h>

#define N 35

int main()
{
    int n,i,score;
    char a[N],b[N],c[N];
    while(scanf("%d %s %s %s",&n,a,b,c)!=EOF)
    {
        for(i=0,score=0;i<n;i++)
        {
            if(a[i]!=b[i])   
            {
                score++;
                if(b[i]==c[i])    score++;
            }
            else if(a[i]!=c[i])    score++;
        }
        printf("%d\n",score);
    }
    return 0;
}

程序代码：

#include<stdio.h>
int cal(int n, int *x, int *y, int *c)
{
    int b[8] = {}, r, f, i, j, k, t;
   
    for(t = 0, i = 1; i <= 16; i++)
    for(j = 1; j <= 30; t += f, j++)
    {
        for(f = k = 0; k < n && (i - x[k] || j - y[k]); k++);
        if(k == n) for(k = 0; k < n; k++)
            if((i != x[k] || j != y[k]) && abs(i - x[k]) <= 1 && abs(j - y[k]) <= 1)
                b[k] |= 1 << t, f = 1;
    }

    for(r = -1, i = 0; i < 1 << t; j == n ? r &= i++ : i++)
    for(j = 0; j < n; j++)
    {
        for(f = 0, k = b[j] & i; k; f++, k &= k - 1);
        if(f != c[j]) break;
    }
   
    if(r < 0) return 0;
    for(f = 0; r; f++, r &= r - 1);
    return f;
}
int main()
{
    int t, n, x[8], y[8], c[8], i;
    for(scanf("%d", &t); t--; printf("%d\n", cal(n, x, y, c)))
    for(scanf("%d", &n), i = 0; i < n; i++)
    scanf("%d%d%d", &x[i], &y[i], &c[i]);
    return 0;
}

程序代码：

#include <stdio.h>

int main()
{
    int a,b,i,j;
    char digit[]={"124813612512481361251248136125124813612512481371251249137125124"};
    while(scanf("%d %d",&a,&b)!=EOF)
    {
        for(i=a+1,j=0;i<=62;i++)
            if(digit[i]-'0'==b)    {printf("%d\n",i);j=1;break;}
        if(j==0)    printf("0\n");
    }
    return 0;
}

程序代码：

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

void init(int *sum)
{
    int i,j,k,x,num,n=32768,a[8192],b[32768];
    n++;n/=2;
    a[0]=2;a[1]=3;num=2;
    for(i=1;i<=2*n;i++)    b[i]=0;
    for(i=3;i<=n;i+=3)
    for(j=0;j<2;j++)
    {
        x=2*(i+j)-1;
        while(b[x]==0)
        {
            a[num++]=x;
            for(k=x;k<=2*n;k+=x)    b[k]=1;
        }
    }
    for(i=1;i<num;i++)
    for(j=i;j<num;j++)
        sum[a[i]+a[j]]++;
}

int main()
{
    int t,n,sum[65536]={0};
    init(sum);
    scanf("%d",&t);
    while(t-- && scanf("%d",&n))
        printf("%d\n",sum[n]);
    return 0;
}

程序代码：

#include<stdio.h>
int f(int n, int k, int p, int m)
{
    int c, i, d, tn, tk, t, tm;
    for(tm = m, c = i = 0, d = n * k; d <= m; c += d, n = tn, k = tk, i++)
    for(tn = n, tk = k; c >= p && d <= m; tm = t < tm ? t : tm)
    {
        d += tn >= tk ? (tk++, tn) : (tn++, tk);
        t = i + (m - (c -= p) - 1 + d) / d;
    }
    return tm;
}
int main()
{
    int t, n, k, p, m;
    for(scanf("%d", &t); t--; printf("%d\n", f(n, k, p, m)))
        scanf("%d%d%d%d", &n, &k, &p, &m);
    return 0;
}

程序代码：

#include<stdio.h>
int main()
{
    int f[101][101], i, j;
    for(i = 1; i <= 100; i++) f[i][1] = f[1][i] = 1;
    for(i = 2; i <= 100; i++)
    for(j = 2; j <= 100; j++)
        f[i][j] = j > i ? f[i][i] :
        j == i ? 1 + f[i][j - 1] :
        f[i - j][j] + f[i][j - 1];
    for(scanf("%d", &i); i--; printf("%d\n", f[j][j]))
        scanf("%d", &j);
    return 0;
}

程序代码：

#include <stdio.h>
#include <string.h>

int main()
{    
    char s[1024],ch;
    int i,j,len,size;
    while(scanf("%s",s) && strcmp(s,"XXX")!=0)
    {
        len=strlen(s);
        for(i=0;i<len;i++)
            if(s[i]>='0' && s[i]<='9')
            {
                size=0;
                ch=s[i-1];
                while(s[i]>='0' && s[i]<='9')
                {
                    size *= 10;
                    size += s[i]-'0';
                    i++;
                }
                i--;
                for(j=1;j<size;j++)    printf("%c",ch);
            }
            else    printf("%c",s[i]);
        printf("\n");
    }
    return 0;
}

程序代码：

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

int main()
{
    int a,b,c;
    while(scanf("%d %d %d",&a,&b,&c) && (a+b+c))
    {
        a=pow(a,2);
        b=pow(b,2);
        c=pow(c,2);
        if(a+b==c || a+c==b ||b+c==a)    printf("right\n");
        else    printf("wrong\n");
    }
    return 0;
}