KeyboardPianist的博客

Average Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 2641    Accepted Submission(s): 624 Special Judge Problem Description There ar

C. Heap Operations time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Petya has recently learned data structure named "Binary heap".

C. Replace To Make Regular Bracket Sequence time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are given string s consists

简单计算器 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15736    Accepted Submission(s): 5370 Problem Description 读入一个只包含 +, -, *, / 的非负整

A. Extract Numbers time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given string s. Let's call word any larg

模拟即可，不能走各自已经走过的路，不能转两次弯   #include #include #include #define maxn 1005 using namespace std; struct node { int x, y, flag, Time, isMove; }; node dk, t; bool vis[maxn][maxn][2]; int dx[

题目：点击打开链接 求余然后模拟 #include #include #define maxn 20005 char s[maxn], c[maxn]; void fun(int l, int r, int k) { int Move = k%(r-l+1), p; for(int i = l;i <= r;i++){ p = i - l;

L长度的旅途，有n个沼泽地，在沼泽地里每单位距离消耗A能量，平地每单位距离回复B能量（除了沼泽都是平地），问一开始至少要多少能量才能走完这段路。 让一开始的能量为0，模拟一遍，得到的能量最小值（小于等于0）*(-1)就是答案 #include int l[105], r[105]; int main() { int t, i, A, B, n, L, min, tmp, k;

The 2015 ACM-ICPC Asia Beijing First Round Online Programming Co L：如果光标左边还有字符，光标左移 R：如果光标右移还有字符，光标右移 S：切换模式（插入模式，复写模式），初始时默认为“插入模式”，然后每次遇到S都切换模式 B：如果光标左边有一个字符，删除 D：如果光标右边有一个字符，删除 C：复制，初始化为NOTHIN

E. Correct Bracket Sequence Editor time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Recently Polycarp started to develop a text ed