codeforces
文章平均质量分 69
代码是块糖
来自SDUT计院学生一枚。个人主页:http://www.ihypo.net
展开
-
Codeforces Round #231 (Div.2) - A. Counting Sticks
A. Counting Sticks When new students come to the Specialized Educational and Scientific Centre (SESC) they need to start many things from the beginning. Sometimes the teachers say (not alway原创 2014-02-21 01:51:11 · 602 阅读 · 0 评论 -
Codeforces Round #229 (Div. 2) B. Inna, Dima and Song
B. Inna, Dima and Songtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInna is a great piano player and Dima is a mode原创 2014-02-12 08:45:10 · 2018 阅读 · 0 评论 -
[Codeforces]Coder-Strike 2014 - Round 1
A#include #include #include char s[110];int main(){ int n,k; scanf ("%d%d",&n,&k); scanf ("%s",s); int len = strlen (s); if (k > n / 2) { while (k < n)原创 2014-04-19 02:47:03 · 606 阅读 · 0 评论 -
codeforces-Coder-Strike 2014 - Finals (online edition, Div. 2)
A. Pasha and Hamsters#include #include int l1[101];int l2[101];int main(){ memset(l1,0,sizeof (l1)); memset(l2,0,sizeof (l2)); int n,a,b,i,t; scanf ("%d%d%d",&n,&a,&b);原创 2014-04-23 00:05:18 · 605 阅读 · 0 评论 -
Codeforces Round #247 (Div. 2) A B
A就是下标求和,无难度原创 2014-05-22 02:14:52 · 639 阅读 · 0 评论