道阻且长

 
#include <iostream>
using namespace std;
const int MAXN = 1001;
#define clr(x) memset(x, 0, sizeof(x))
int main()
{
    char ch;
    int ans, count;
    int i, j, n, m, cnt = 0;
    int a[MAXN], val[MAXN], real[MAXN];
    cin >> n >> m;
    clr(val);
    clr(real);
    while(m --) {
        cin >> a[0];
        for(i = 1; i <= 2 * a[0]; i++)
            cin >> a[i];
        cin >> ch;
        if(ch == '=') {
            for(j = 1; j <= 2 * a[0]; j++) real[a[j]] = 1;
        }else if(ch == '>') {
            cnt ++;
            for(j = 1; j <= a[0]; j++) val[a[j]] ++;
            for(j = a[0] + 1; j <= 2 * a[0]; j++) val[a[j]] --;
        }else {
            cnt ++;
            for(j = 1; j <= a[0]; j++) val[a[j]] --;
            for(j = a[0] + 1; j <= 2 * a[0]; j++) val[a[j]] ++;
        }
    }
    count = 0, ans = 0;
    for(i = 1; i <= n; i++) {
        if(real[i]) continue;
        if(val[i] == cnt || val[i] == -cnt) {
            count ++;
            ans = i;
        }
    }
    if(count != 1) printf("0\n");
    else printf("%d\n", ans);
    return(0);
}

#include<iostream>
using namespace std;
const int MAXN = 111;
int main()
{
    char s[MAXN];
    int i, j, c[MAXN];
    memset(c, 0, sizeof(c));
    while(cin >> s) {
        if(strcmp(s, "0") == 0) break;
        int rear = MAXN - 1;
        for(i = strlen(s) - 1; i >= 0; i --) {
            c[rear] += s[i] - '0';
            c[rear - 1] += c[rear] / 10;
            c[rear] %= 10;
            rear --;
        }
    }
    i = 0;
    while(c[i] == 0) i ++;
    for(j = i; j < MAXN; j ++)
        printf("%d", c[j]);
    printf("\n");
    return(0);
}

#include <iostream>
using namespace std;
const int MAXN = 101;
 
int main()
{
    int i, j, k, n, cube, pw[MAXN];
    scanf("%d", &n);
    for(i = 1; i < MAXN; i ++) pw[i] = i * i * i;
    for(cube = 3; cube <= n; cube ++)
        for(i = 2; i < cube; i ++) {
            if(pw[i] + pw[i + 1] + pw[i + 2] > cube * cube * cube) break;
            for(j = i + 1; j < cube; j ++) {
                if(pw[i] + pw[j] + pw[i + 2] > cube * cube * cube) break;
                for(k = j + 1; k < cube; k ++) {
                    if(pw[i] + pw[j] + pw[k] > cube * cube * cube) break;
                    if(pw[i] + pw[j] + pw[k] == cube * cube * cube)
                        printf("Cube = %d, Triple = (%d,%d,%d)\n", cube, i, j, k);
                }
            }
        }
    return(0);
}