- 博客(3)
- 收藏
- 关注
RSS订阅原创 Codeforces Round #401 (div. 2)解题报告
Problem A-Shell Game找规律 6个一组//Author: Lixiang#includestruct Shell_Game{ int N,X; void init(){ scanf("%d%d",&N,&X); } int getans(){ switch(N%6){ case 0: if(X==0)return 0; if(X=
2017-02-25 16:17:08
435
原创 [Updating]ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)
Problem A-A Serial Killer模拟//Author: Lixiang#include#includestruct A_Serial_Killer{ char now[2][11]; int N; void init(){ scanf("%s%s",now[0],now[1]); scanf("%d",&N); } bool cmp(char a[
2017-02-24 11:54:27
876
原创 Codeforces Round #398 (Div. 2)解题报告
Problem A- Snacktower模拟，贪心，每次找最大的//Author: Lixiang#include#include#includeusing namespace std;const int maxn=100001;struct Snacktower{ int a[maxn],b[maxn],N; void init(){ scanf("%d",&N
2017-02-20 15:50:23
429
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人