该文被密码保护。 阅读全文
摘要：
代码: 1 #include<bits/stdc++.h> 2 using namespace std; 3 const int N = 500000 + 50; 4 int n, a[12][2], b[N]; 5 int ans[3];/* & ^ | */ 6 char op[N][2]; 7 阅读全文
摘要：
Codeforces Round #384 (Div. 2) E. Vladik and cards 状压dp 大致题意: 给定一个序列an，序列中只有1~8的8个整数，让你选出一个子序列，子序列应该满足下列两个要求 1.子序列中不同整数出现的次数极差小于或等于1 2.子序列中整数分布是连续的，即子 阅读全文
摘要：
定义两个数论函数f,g 它们的狄利克雷卷积表示f∗g，设卷起来得到的新函数是h 则 h(i)=∑d|if(i)g(id) 明显h也是一个数论函数 显然它满足交换，结合律，甚至分配律 阅读全文
摘要：
E. Vanya and Balloons time limit per test 3 seconds memory limit per test 512 megabytes Vanya plays a game of balloons on the field of size n × n, whe 阅读全文
摘要：
B. Mike and Feet time limit per test 1 second memory limit per test 256 megabytes Mike is the president of country What-The-Fatherland. There are n be 阅读全文
摘要：
D. Gargari and Permutations time limit per test 2seconds memory limit per test 256 megabytes Gargari got bored to play with the bishops and now, after 阅读全文
摘要：
C. Sorting by Subsequences time limit per test 1 second memory limit per test 256 megabytes C. Sorting by Subsequences time limit per test 1 second ti 阅读全文
摘要：
A. Anastasia and pebbles time limit per test 1 second memory limit per test 256 megabytes Anastasia loves going for a walk in Central Uzhlyandian Park 阅读全文
摘要：
A. Pavel and barbecue time limit per test 2 seconds memory limit per test 256 megabytes Pavel cooks barbecue. There are n skewers, they lay on a brazi 阅读全文