=====codeforces=====
文章平均质量分 87
林伏案
妖蛾子良多的范老爷
展开
-
Round #374解题报告
A(水)#include #include #include #include using namespace std;const int maxn = 100 + 7;char str[maxn];int cnt[maxn], n;int main() { while(~scanf("%d", &n)) { scanf("%s", str); memset(c原创 2016-10-03 10:59:22 · 333 阅读 · 0 评论 -
#Round 375解题报告
A#include #include #include using namespace std;const int INF = 1e6;int a, b, c;int main(){ while(cin >> a >> b >> c) { int maxP = max(a, max(b, c)); int minP = min(a,原创 2016-10-05 17:33:33 · 223 阅读 · 0 评论 -
codeforces round#420
a题:time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOkabe needs to renovate the Future Gadget Laboratory after he tri原创 2017-06-26 16:45:25 · 499 阅读 · 0 评论