摘要：时间限制:2000ms单点时限:200ms内存限制:256MB描述Given N arithmetic expressions, can you tell whose result is closest to 9?输入Line 1: N (1 #include #include using namespace std;int main(){int N; cin >> N; int index = 1; double res = DBL_MAX; double ans; for(int i = 1 ; i > a >> op >> b; switch.. 阅读全文

摘要：时间限制:10000ms单点时限:1000ms内存限制:256MB描述You are given a sequence of integers, A = a1, a2, ... an. A consecutive subsequence of A (say ai, ai+1 ... aj) is called a "repeated sequence" if it appears more than once in A (there exists some positive k that ai+k = ai, ai+k+1 = ai+1, ... aj+k = aj) an 阅读全文