摘要： 问题 D: Zeros and Ones时间限制: 1 Sec内存限制: 128 MB 提交: 43解决: 18 [提交][状态][讨论版]题目描述Consider strings of characters made up by concatenating any number of the strings 0, 01 or 11.For example 00011111 is one such string, as is 001011, but 1011 is not.Your job is simply to determine if a given string can be cons 阅读全文

摘要： 问题 G: 塔防游戏时间限制: 1 Sec内存限制: 128 MB 提交: 37解决: 17 [提交][状态][讨论版]题目描述小明最近迷上了塔防游戏，塔防游戏的规则就是在地图上建炮塔，用于防御敌军的进攻。这里我们假设地图是一个n行m列的格子，每个炮塔只能建在格子里，这里的炮塔有点奇怪，因为它只能攻击它自己所在行和所在列的格子（包括自身），并且每两个塔既不能放在同一列也不能放在同一行；现在小明建好了cnt个塔，小明一看这cnt个塔的攻击范围刚好把地图割成了S个炮塔攻击不到的区域，因为区域太多了，小明没法数，小明想知道答案S是多少，你能帮助他吗？输入有多组测试数据；每组测试数据的格式如下：第一行 阅读全文

摘要： B. Dima and To-do Listtime limit per test 1 secondmemory limit per test256 megabytesYou helped Dima to have a great weekend, but it's time to work. Naturally, Dima, as all other men who have girlfriends, does everything wrong.Inna and Dima are now in one room. Inna tells Dima off for everything 阅读全文

摘要： A. Dima and Guardstime limit per test1 secondmemory limit per test256 megabytesNothing has changed since the last round. Dima and Inna still love each other and want to be together. They've made a deal with Seryozha and now they need to make a deal with the dorm guards...There are four guardpost 阅读全文

摘要： 我是不是快要滚蛋了，这次CF爆0？居然第一题都过不去了，妈蛋附近有没有神经病医院，我要去看看！精力憔悴！第一题，我以为要恰好这么多钱，不能多余，想想这也没必要，不符合逻辑，及自己就是这么傻逼！写了个这,B代码 1 int main(){ 2 while (~scanf("%d", &n)){ 3 int x, y; 4 k = -1; 5 for (int i = 0; i (i % 2))xi--,xj++;11 if ((j % 2) = a[xi]){ k = j / 2, x = a[i], y = b[j... 阅读全文