随笔分类 -  Topcoder

SRM 524 div2
摘要:250pt一开始还反应不出来。暴力,枚举两个数。#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#include <string.h>#include <cmath>using namespace std;class ShippingCubes{public: int minimalCost(int N) { int mins=2000000000; for(int i=1;i<=N;i++) { for(int j=1 阅读全文

posted @ 2011-11-19 00:28 lwbaptx 阅读(357) 评论(0) 推荐(0)

SRM 523 div2
摘要:250pt.一个水题,直接一个dfs就行了,很久没敲代码,比赛的时候写错一个判断条件,卡了很久才发现。。。。。#include <iostream>#include <cstdio>#include <algorithm>#include <string>#include <cmath>#include <vector>using namespace std;class AlphabetPath{public: string doesItExist(vector<string> M);};int sx[4]={ 阅读全文

posted @ 2011-11-15 02:28 lwbaptx 阅读(225) 评论(0) 推荐(0)

SRM 513 div2
摘要:250pt,大水题一道,按照题目意思模拟一下就行了。#include <iostream>#include <cstdio>#include <string.h>#include <vector>#include <cmath>#include <algorithm>using namespace std;class TrainingCamp{ public: vector<string> determineSolvers(vector<string> attendance, vector<s 阅读全文

posted @ 2011-07-26 21:21 lwbaptx 阅读(189) 评论(0) 推荐(0)

SRM 512 div2
摘要:迟来的比赛总结。256pt这题算是比较水的一题,主要是排序一下,然后再分情况讨论一下就行了。#include <iostream>#include <cstdio>#include <algorithm>#include <string>#include <cmath>#include <vector>using namespace std;class MarbleDecoration{ public: int maxLength(int R, int G, int B);};int MarbleDecoration::m 阅读全文

posted @ 2011-07-15 23:06 lwbaptx 阅读(225) 评论(2) 推荐(0)

导航