摘要： 分析： 我们假设购买一种可乐p瓶，我们可以得到期望：p*(m/n*a[i]+(n-m)/n*b[i])，由这个式子我们可以看出唯一的变量是i，所以可以遍历i找出式子的最大值 #include <map> #include <set> #include <stack> #include <cmath> 阅读全文

摘要： Minimum Ternary String time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are given a te 阅读全文

摘要： Median on Segments (Permutations Edition) time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard outpu 阅读全文

摘要： Summarize to the Power of Two time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output A sequence 阅读全文

摘要： Polycarp and Div 3 time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Polycarp and Div 3 ti 阅读全文

摘要： Coins and Queries time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Coins and Queries time 阅读全文

摘要： #include using namespace std; int c[1005][1005]; int main(){ memset(c,0,sizeof(c)); c[0][0] = 1; for(int i = 1; i <= 1000; i ++){ for(int j = 0; j <= i; j ++) if(j == 0 || j == i) c[i]... 阅读全文

摘要： Covered Points Count time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Covered Points Coun 阅读全文

摘要： Light It Up time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Light It Up time limit per te 阅读全文

摘要： Posterized time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Professor Ibrahim has prepared 阅读全文