代码

#include <stdio.h>
namespace judgeduck {
    extern char *stdin_content;
    extern int stdin_size;
    extern char *stdout_content;
    extern int stdout_size;
    extern int stdout_max_size;
}
#define uuin (judgeduck::stdin_content)
char* _O_pos = stdout_content;
inline int gyo() {
    int res = 0;
	do {res=10*res+*uuin++;} while(*uuin>47);
	++uuin;
	return res;
}
inline int get() {
	if (*uuin=='-') {
	    ++uuin;
        return -gyo();
	} else {
        return gyo();
	}
}
inline void put(char c) {
    *_O_pos++ = ch;
}
inline int put(int n) {
	if (n<0) {
	    n=-n;
        put('-');
	}
	switch(n) {
    case 1000000000 ... 2147483647:
        put(48+n/1000000000); n%=1000000000;
    case 100000000 ... 999999999:
        put(48+n/100000000); n%=100000000;
    case 10000000 ... 99999999:
        put(48+n/10000000); n%=10000000;
    case 1000000 ... 9999999:
        put(48+n/1000000); n%=1000000;
    case 100000 ... 999999:
        put(48+n/100000); n%=100000;
    case 10000 ... 99999:
        put(48+n/10000); n%=10000;
    case 1000 ... 9999:
        put(48+n/1000); n%=1000;
    case 100 ... 999:
        put(48+n/100); n%=100;
    case 10 ... 99:
        put(48+n/10); n%=10;
	}
	put(48+n);
	put(10);
}
int _ = []() {
    uuin+=4;
    for (int i=0; i<100; ++i) {
        int a=get(), b=get();
        put(a+b);
    }
    stdout_size = _O_pos - stdout_content;
    asm volatile("int %0"::"i"(48),"a"(18)); // exit
    return 0;
}
();
int main() {
}

评测结果