提交记录 6329


用户 题目 状态 得分 用时 内存 语言 代码长度
TowardstheSun 1000i. 【传统题】 A+B Problem Accepted 100 9.29 us 16 KB C++11 1.40 KB
提交时间 评测时间
2018-10-06 01:05:34 2020-08-01 00:42:10
#pragma GCC optimize("delete-null-pointer-checks,inline-functions-called-once,expensive-optimizations,optimize-sibling-calls,tree-switch-conversion,inline-small-functions,rerun-cse-after-loop,hoist-adjacent-loads,indirect-inlining,reorder-functions,no-stack-protector,partial-inlining,sched-interblock,cse-follow-jumps,align-functions,strict-aliasing,schedule-insns2,tree-tail-merge,inline-functions,schedule-insns,reorder-blocks,unroll-loops,thread-jumps,crossjumping,caller-saves,devirtualize,align-labels,align-loops,align-jumps,unroll-loops,sched-spec,fast-math,Ofast,inline,gcse,gcse-lm,ipa-sra,tree-pre,tree-vrp,peephole2,-Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <stdio.h>
#include <ctype.h>

char _I_Buffer[2110],_O_Buffer[2110],*_I_pos = _I_Buffer,*_O_pos = _O_Buffer;
inline int get()
{
	register int res = 0, k = 1;
	while (!isdigit(*_I_pos))
		if (*_I_pos++ == '-')k = 0;
	while (isdigit(*_I_pos)) (res = (res << 3) + (res << 1)) += (*_I_pos++) & 15;
	return k ? res : -res;
}
inline void put(register int n)
{
	static char _buf[20];
	register char* _pos(_buf);
	if (n < 0) {*_O_pos++ = '-';n = -n;}
	do *_pos++ = 48 + n % 10;while (n /= 10);
	while (_pos != _buf)*_O_pos++ = *--_pos;
}
int main()
{
	fread(_I_Buffer, 1, 2110, stdin);
	register int n = get();
	while (n--) put(get() + get()), *_O_pos++ = '\n';
	fwrite(_O_Buffer, 1, _O_pos - _O_Buffer, stdout);
}

CompilationN/AN/ACompile OKScore: N/A

Testcase #19.29 us16 KBAcceptedScore: 100


Judge Duck Online | 评测鸭在线
Server Time: 2026-04-10 07:54:40 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠