2018年7月5日
摘要: problem This time, you are supposed to find A B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each c 阅读全文
posted @ 2018-07-05 22:22 yoyo_sincerely 阅读(286) 评论(0) 推荐(0) 编辑
摘要: problem tip 求电梯载上所有人时,所花时间。 answer include using namespace std; define INF 0x3f3f3f3f int n; int main(){ // freopen("test.txt", "r", stdin); cin n; in 阅读全文
posted @ 2018-07-05 21:44 yoyo_sincerely 阅读(247) 评论(0) 推荐(0) 编辑
摘要: problem Given a sequence of K integers { N~1~, N~2~, ..., N~K~ }. A continuous subsequence is defined to be { N~i~, N~i+1~, ..., N~j~ } where 1 using 阅读全文
posted @ 2018-07-05 21:10 yoyo_sincerely 阅读(432) 评论(0) 推荐(0) 编辑