程序代码：

#include<stdio.h>
char np[40];
   
void ring(int n, int d)
{
    static int r[20], f[21];
    int i, t;
    if(d == n)
    {
        if(np[r[n - 1] + 1]) return;
        for(putchar('1'), i = 1; i < n; printf(" %d", r[i++]));
        puts("");
        return;
    }
    if(!d)
    {
        for(i = 0; i < n; f[i] = 0, r[i++] = i + 1);
        ring(n, d + 1);
    }
    else for(i = 2; i <= n; i++)
    {
        if(f[i] || np[i + r[d - 1]]) continue;
        r[d] = i; f[i] = 1;
        ring(n, d + 1);
        f[i] = 0;
    }
}

int main()
{
    int i, j;
    for(i = 2; i < 40; i++)
    if(!np[i]) for(j = i + i; j < 40; j += i) np[j] = 1;
    for(i = 1; scanf("%d", &j) != EOF; i++)
    {
        if(i - 1) puts("");
        printf("Case %d:\n", i);
        ring(j, 0);
    }
    return 0;
}

程序代码：

#include<stdio.h>
int main()
{
    int a, b, c;
    while(scanf("%d%d%d", &a, &b, &c) != EOF)
    puts(a ^ b ^ c ? "Wm" : "Qinz");
    return 0;
}

程序代码：

#include<stdio.h>
int cal(int a, int b)
{
    int r[160000] = {}, s[160000], n, mb, i, t, p, q;
    if(a >= b) return a - b;
    mb = b * 2 / 3;
    for(s[0] = a, n = 1, i = 0; i < n && (t = s[i]) - b; i++)
    {
        q = r[t] + 1;
        if(t < b && !r[p = t + 1]) r[s[n++] = p] = q;
        if(t <= mb && !r[p = t << 1]) r[s[n++] = p] = q;
        if(t && !r[p = t - 1]) r[s[n++] = p] = q;
    }
    return r[b];
}
int main()
{
    int a, b;
    while(scanf("%d%d", &a, &b) != EOF) printf("%d\n", cal(a, b));
    return 0;
}

程序代码：

#include <stdio.h>
#include <stdlib.h>
#define Max 1000000007

struct matrix 
{
    long long p[9];
};

struct matrix ans,beg;
int time,n,a,b,c;

void initialize(struct matrix *ans)
{
    ans->p[0]=1; ans->p[1]=1; ans->p[2]=1;
    ans->p[3]=1; ans->p[4]=0; ans->p[5]=0;
    ans->p[6]=0; ans->p[7]=1; ans->p[8]=0;
}

void multi(struct matrix *a,struct matrix b)
{
    struct matrix c;
    c.p[0]=(a->p[0]*b.p[0]+a->p[1]*b.p[3]+a->p[2]*b.p[6])%Max;
    c.p[1]=(a->p[0]*b.p[1]+a->p[1]*b.p[4]+a->p[2]*b.p[7])%Max;
    c.p[2]=(a->p[0]*b.p[2]+a->p[1]*b.p[5]+a->p[2]*b.p[8])%Max;
    
    c.p[3]=(a->p[3]*b.p[0]+a->p[4]*b.p[3]+a->p[5]*b.p[6])%Max;
    c.p[4]=(a->p[3]*b.p[1]+a->p[4]*b.p[4]+a->p[5]*b.p[7])%Max;
    c.p[5]=(a->p[3]*b.p[2]+a->p[4]*b.p[5]+a->p[5]*b.p[8])%Max;
    
    c.p[6]=(a->p[6]*b.p[0]+a->p[7]*b.p[3]+a->p[8]*b.p[6])%Max;
    c.p[7]=(a->p[6]*b.p[1]+a->p[7]*b.p[4]+a->p[8]*b.p[7])%Max;
    c.p[8]=(a->p[6]*b.p[2]+a->p[7]*b.p[5]+a->p[8]*b.p[8])%Max;
    
    int i;
    for (i=0; i<9; i++) a->p[i]=c.p[i];
}

void factorial(int dep)
{
    if (dep==1) initialize(&ans); 
    else if (dep&1)
    {
        factorial(dep>>1); multi(&ans,ans); multi(&ans,beg);
    }
    else
    {
        factorial(dep>>1); multi(&ans,ans);
    }
}

int main()
{
    scanf("%d",&time);
    initialize(&beg);
    while (time--)
    {
        scanf("%d%d%d%d",&a,&b,&c,&n);
        if (n==1) printf("%d\n",a); else
        if (n==2) printf("%d\n",b); else
        if (n==3) printf("%d\n",c); else
        {
            factorial(n-3);
            printf("%lld\n",(ans.p[0]*c+ans.p[1]*b+ans.p[2]*a)%Max);
        }
    }
}
        

程序代码：

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

long long a,b;

long long cal(int b)
{
    if (b==0) return 1; else
    if (b&1)
    {
        long long temp=cal(b/2); return temp*temp*a;
    }
    else
    {
        long long temp=cal(b/2); return temp*temp;
    }
}

int main()
{
    while (scanf("%lld%lld",&a,&b),a!=0) printf("%lld\n",cal(b));
}
        

程序代码：

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

int len,ans;
char s[11];

int C(int a,int b)
{
    int i; long long temp=1;
    for (i=1; i<=b; i++) temp*=(a-i+1);
    for (i=1; i<=b; i++) temp/=i;
    return temp;
}

int error()
{
    int i=0;
    while (s[i])
    {
        if (s[i]<'a' || s[i]>'z') return 1;
        i++;
    }
    len=i;
    for (i=0; i<len-1; i++)
      if (s[i]>=s[i+1]) return 1;
    return 0;
}

int main()
{
    int i,j;
    while (scanf("%s",s)!=EOF)
    {
        if (error())
        {
            printf("0\n"); continue;
        }
        ans=0;
        for (i=1; i<len; i++) ans+=C(26,i);
        for (i='a'; i<s[0]; i++) ans+=C('z'-i,len-1);
        for (i=1; i<len; i++)
          for (j=s[i-1]+1; j<s[i]; j++) ans+=C('z'-j,len-i-1);
        printf("%d\n",ans+1);
    }
}
        

程序代码：

#include<stdio.h>
#include<string.h>
int main()
{
    char a[10001];
    int b, c[10], n, i;
    long long f;
    for(f = 0; scanf("%s%d", a, &b) != EOF; puts(""))
    {
        for(i = 0; i < 10; c[i++] = 0);
        for(n = strlen(a); n--; c[(f += (long long)b * (a[n] - '0')) % 10]++, f /= 10);
        for(; f; c[f % 10]++, f /= 10);
        for(n = i = 0; i < 10; n < c[i] && (n = c[i]), i++);
        for(i = 0; i < 10 && c[i] < n; i++);
        for(printf("%d", i++); i < 10; c[i] == n && printf(" %d", i), i++);
    }
    return 0;
}

程序代码：

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

#define COUNT_MAX    8
#define TIME_MAX    1E7

typedef struct
{
    double x;
    double y;
    double v;
    double d;
}PERSON;

PERSON Senior[COUNT_MAX];
int List[COUNT_MAX];
int N;

double intersect(PERSON g, PERSON s, PERSON * mg)
{
    double c0, c1, c2, vsd, vcd, a, b, c;
    double x, y, t;

    vsd = s.v * sin(s.d);
    vcd = s.v * cos(s.d);
    c0 = g.v * g.v * g.d;
    c1 = s.x - g.x;
    c2 = s.y - g.y;

    a = s.v * s.v - g.v * g.v;
    b = 2 * (c0 + c1 * vcd + c2 * vsd);
    c = c1 * c1 + c2 * c2 - c0 * g.d;

    t = -(b + sqrt(b * b - 4 * a * c)) / (2 * a);
    x = s.x + vcd * t;
    y = s.y + vsd * t;

    mg->x = x;
    mg->y = y;
    mg->v = g.v;
    mg->d = t;

    return t + sqrt(x * x + y * y) / s.v;
}

double sub_cal(PERSON g, double use_t, int deep)
{
    static double min_t;
    double t;
    PERSON mg;
    int i, j, tmp;

    if(deep == 0) min_t = TIME_MAX;
    if(deep == N && min_t > use_t) min_t = use_t;

    for(i = deep; i < N; i++)
    {
        tmp = List[i]; List[i] = List[deep]; List[deep] = tmp;
        t = intersect(g, Senior[List[deep]], &mg);
        if(t < min_t) sub_cal(mg, t > use_t ? t : use_t, deep + 1);
        tmp = List[i]; List[i] = List[deep]; List[deep] = tmp;
    }
    return min_t;
}

double cal(double v)
{
    PERSON g = {0, 0, v, 0};
    return sub_cal(g, 0, 0);
}

int main()
{
    double v;
    int i;
   
    for(i = 0; i < COUNT_MAX; List[i] = i++);
    for(; scanf("%d", &N), N; printf("%.0f\n", cal(v)))
    for(scanf("%lf", &v), i = 0; i < N; i++)
        scanf("%lf%lf%lf%lf", &Senior[i].x, &Senior[i].y, &Senior[i].v, &Senior[i].d);
    return 0;
}

程序代码：

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

int main()
{
    int f[11][102][102],n,m,i,j,p,q,max,min,t_case;
    
    scanf("%d",&t_case);
    while (t_case--)
    {
        scanf("%d%d",&n,&m);
        memset(f,0,sizeof(f));
        
        for (i=1; i<=m; i++)
        {
            f[1][i][i]=i;
            for (j=i+1; j<=m; j++) f[1][i][j]=f[1][i][j-1]+j;
        }
        
        for (i=2; i<=n; i++)
          for (q=0; q<m; q++)
            for (p=1; p<=m-q; p++)
            {
                min=10000;
                for (j=p; j<=p+q; j++)
                {
                    max=(f[i-1][p][j-1]+j>f[i][j+1][p+q]+j)?f[i-1][p][j-1]+j:f[i][j+1][p+q]+j;
                    if (min>max) min=max;
                }
                f[i][p][p+q]=min;
            }
        printf("%d\n",f[n][1][m]);
    }
}
            
    
        

程序代码：

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

int main()
{
    int n,sum1,sum2,i,j,p;
    while (scanf("%d",&n),n!=0)
    {
        sum1=0;
        for (j=n; j!=0; sum1+=j%10,j/=10);    
        
        sum2=0; p=n;
        for (i=2; i<=sqrt(n); i++)
          while (n%i==0)
          {
              n/=i;
              for (j=i; j!=0; sum2+=j%10,j/=10);
          }
        if (p==n)
        {
            printf("No\n"); continue;
        }
        if (n!=1)
          for (j=n; j!=0; sum2+=j%10,j/=10);
        
        if (sum1==sum2) printf("Yes\n"); else printf("No\n");
    }
}