2013年8月14日
TopCoder SRM 588 DIV2 KeyDungeonDiv2
摘要： 简单的题目class KeyDungeonDiv2{public: int countDoors(vector doorR, vector doorG, vector keys) { int res = 0; for(int i = 0 ; i < doorR.size(); i ++){ if(doorR[i] <= keys[0]+keys[2] && doorG[i] <= keys[1]+keys[2] && doorR[i] + doorG[i] <=keys[0]+keys[1]+keys[2]) res ++;... 阅读全文
posted @ 2013-08-14 20:05 OpenSoucre 阅读(347) 评论(0) 推荐(0)