2015年10月25日
Codeforces Round #277 (Div. 2) E. LIS of Sequence DP
摘要： E. LIS of SequenceTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/486/problem/EDescriptionThe next "Data Structures and Algori... 阅读全文
posted @ 2015-10-25 13:50 qscqesze 阅读(309) 评论(0) 推荐(0) 编辑
Codeforces Round #277 (Div. 2) D. Valid Sets 暴力
摘要： D. Valid SetsTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/486/problem/DDescriptionAs you know, an undirected connected grap... 阅读全文
posted @ 2015-10-25 13:45 qscqesze 阅读(155) 评论(0) 推荐(0) 编辑
Codeforces Round #277 (Div. 2) B. OR in Matrix 贪心
摘要： B. OR in MatrixTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/486/problem/BDescriptionLet's define logical OR as an operation... 阅读全文
posted @ 2015-10-25 13:40 qscqesze 阅读(250) 评论(0) 推荐(0) 编辑
Codeforces Round #277 (Div. 2) A. Calculating Function 水题
摘要： A. Calculating FunctionTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/486/problem/ADescriptionFor a positive integer n let's ... 阅读全文
posted @ 2015-10-25 13:30 qscqesze 阅读(258) 评论(0) 推荐(0) 编辑
套题 Codeforces Round #277 (Div. 2)
摘要： A. Calculating Function水题，分奇数偶数处理一下就好了#include#includeusing namespace std;int main(){ long long n;scanf("%lld",&n); if(n%2==1) printf("%lld\n",(... 阅读全文
posted @ 2015-10-25 13:19 qscqesze 阅读(229) 评论(0) 推荐(0) 编辑