程序代码：

#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<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>
int main()
{
    unsigned f[100][100];
    int n, i, j, k, m, t;
    for(; scanf("%d", &n) != EOF; printf("%u\n", f[0][n - 1]))
    {
        for(i = 0; i < n; i++) scanf("%u", &f[i][i]);
        for(i = n - 2; i >= 0; i--)
        for(j = i + 1; j < n; f[i][j++] = m)
        for(m = 0, k = i; k <= j; k++)
        if(m < (t = (k <= i ? 1 : f[i][k - 1]) * (k >= j ? 1 : f[k + 1][j]) + f[k][k])) m = t;
    }
    return 0;
}

程序代码：

#include<stdio.h>

typedef struct { int x; int y; } Point;

int area2(Point p0, Point p1, Point p2)
{
    int a;
    a = (p1.x - p0.x) * (p1.y + p0.y);
    a += (p2.x - p1.x) * (p2.y + p1.y);
    a += (p0.x - p2.x) * (p0.y + p2.y);
    return abs(a);
}

int inside(Point p0, Point p1, Point p2, Point p3)
{
    int a, b;
    a = area2(p1, p2, p3);
    b = area2(p0, p1, p2);
    b += area2(p0, p2, p3);
    b += area2(p0, p3, p1);
    return a == b;
}

void max_triangle(Point * p, int n)
{
    int a = 0, ta, i, j, k, t;
    char s[4] = {};
    for(i = 0; i < n; i++)
    for(j = i + 1; j < n; j++)
    for(k = j + 1; k < n; k++)
    {
        ta = area2(p[i], p[j], p[k]);
        if(ta <= a) continue;
        for(t = 0; t < n; t++)
        {
            if(t == i || t == j || t == k) continue;
            if(inside(p[t], p[i], p[j], p[k])) break;
        }
        if(t == n)
        {
            a = ta;
            s[0] = 'A' + i;
            s[1] = 'A' + j;
            s[2] = 'A' + k;
        }
    }
    puts(s);
}       
   
int main()
{
    Point p[16];
    int n, i;
    char s[8];
    for(; scanf("%d", &n), n; max_triangle(p, n))
    for(i = 0; i < n; i++) scanf("%s%d%d", s, &p[i].x, &p[i].y);
    return 0;
}

程序代码：

#include<stdio.h>
long long f(long long a, int b, int k)//a为题中数n，b为题中基数p，k为题中某数字k；我选了自己喜欢的命名含意
{
    long long c = 0, p, q, t; //c统计次数，p第i位的基权，q第i位前（高位）的值，t是个余数一两句话解释不清楚，看代码
    if(k >= b) return 0;
    for(p = 1, q = a; q /= b; p *= b)
    {
        c += k ? q * p : (q - 1) * p;
        t = (a - q * p * b) - k * p + 1; //这里没有使用取模运算是为了防止溢出
        c += t < 0 ? 0 : t < p ? t : p;
    }
    t = (k ? a - k * p : 0) + 1;
    return c + (t <= 0 ? 0 : t < p ? t : p);
}
int main()
{
    long long n;
    int p, k;
    char s[4];
    for(; scanf("%lld%d%s", &n, &p, s) != EOF; printf("%lld\n", f(n, p, k)))
        k = s[0] >= 'a' ? s[0] - 'a' + 36 : s[0] >= 'A' ? s[0] - 'A' + 10 : s[0] - '0';
    return 0;
}

程序代码：

#include<stdio.h>
int main()
{
    char s[10001], * p;
    int t, r;
    for(scanf("%d", &t); t--; puts(r % 3 ? "NO" : "YES"))
    for(scanf("%s", p = s), r = 0; *p; r += *(p++));
    return 0;
}

程序代码：

#include<stdio.h>
#include<ctype.h>
#include<math.h>
char * trans(int a, char * n, int b)
{
    int d, i, t;
    for(d = i = 0; t = toupper(n[i++]); d = d * a + (t <= '9' ? t - '0' : t - 'A' + 10));
    for(n[i = (d ? log(d) : 0) / log(b) + 1] = 0; i--; d /= b) n[i] = (t = d % b) <= 9 ? t + '0' : t - 10 + 'A';
    return n;
}
int main()
{
    int a, b;
    char n[128];
    scanf("%d%s%d", &a, n, &b);
    printf("%s\n", trans(a, n, b));
    return 0;
}