Codeforces
shiyuankongbu
这个作者很懒,什么都没留下…
展开
-
CF MemSQL Round1 E. The Red Button
题目:The Red Button思路:YY#include #include #include #include #include #include #include #include #include #include using namespace std;bool vis[100010];int main(){ memset(vis,fal原创 2013-07-14 06:51:45 · 1069 阅读 · 0 评论 -
GCJ Round 1A 2008 Problem A. Minimum Scalar Product
题目:GCJ Round 1A 2008 Problem A. Minimum Scalar Product思路:贪心#include #include #include #include #include #include #include #define eps (1e-10)using namespace std;vectorv1,v2;bool cmp(原创 2013-09-02 13:19:39 · 1395 阅读 · 1 评论 -
Codeforces 209 div2 D. Pair of Numbers
题目:D. Pair of Numbers思路:预处理每个数最右边和最左边能够整除它的下标,然后暴力,记得去重,不然会Wa tag :dp + 预处理#include #include #include #include #include #include #include using namespace std;#define maxn 30001原创 2013-11-05 08:53:50 · 1127 阅读 · 0 评论 -
Codeforces 211 div2 D. Renting Bikes
题目:Codeforces 211 div2 D. Renting Bikes tag :二分思路:二分求出最大租车数mid,对于排序后的b,p,对应相减为:p[mid+1-i]-b[n+1-i]#include #include #include #include #include using namespace std;#define maxn 100010原创 2013-11-12 20:22:18 · 1012 阅读 · 0 评论 -
Codeforces 200 div1 C. Read Time
题目:Codeforces 200 div1 C. Read Time tag :二分思路:开始思路二分没错,就是忽略了一种情况。贪心想的话是,对于当前能访问到的地方尽量先访问,从左往右。但是有可能会忽略的是,先往右边扫,然后再往左,也有可能是先往左扫,再往右扫。细节注意点,不然会Wa的很惨。#include #include #include #include原创 2013-11-13 16:21:34 · 1085 阅读 · 0 评论 -
CF A. Arrangement of RGB Balls
题目:CF A. Arrangement of RGB Balls 思路:找规律这题样例中已经把答案都给出来了,最大最小值之差大于等于2的肯定无解,0 1 1 和 0 0 1 需要特判,然后 a a a 是6种,a b b 和 a a b 都是2种#include #include #include #include using namespace原创 2013-10-23 09:27:03 · 788 阅读 · 0 评论 -
Codeforces 208 div2 D. Dima and Hares
题目:Codeforces 208 div2 D. Dima and Hares tag :dp思路:dp[i][0] 表示i先于i+1 前 i 项的最大值 dp[i][1] 表示i后于i+1 前 i 项的最大值注意:求最大值的时候要注意最后一项,如果单纯求max(dp[n][1],dp[n][0])就错了,因为dp[n][1]没有第n+1项原创 2013-11-19 22:20:08 · 1344 阅读 · 1 评论 -
CF I. Matrix
题目:CF I. Matrixtag:预处理+暴力#include #include #include #include #include #include using namespace std;#define maxn 410int a[maxn][maxn];int b[maxn][maxn];int c[maxn][maxn原创 2013-10-24 19:45:26 · 807 阅读 · 0 评论 -
Codeforces 209 div2 C. Prime Number
题目:C. Prime Number思路:通分之后,分母是x^sum,分子是sigma(x^(sum-a[i])),首先能提取的公因式是min(x^(sum-a[i])),对于剩下的,看产生的1能不能形成ax的形式,while搞定 tag :暴力#include #include #include #include #include using namespace原创 2013-11-05 08:50:10 · 1124 阅读 · 0 评论 -
GCJ Round 1A 2008 Problem C. Numbers
题目:GCJ Round 1A 2008 Problem C. Numbers思路:构造矩阵水题#include #include #include #include #include #include #include #define eps (1e-10)using namespace std;#define mod 1000struct Matrix{原创 2013-09-02 13:35:00 · 1748 阅读 · 0 评论 -
CF 231 div2
A.呵呵Code:a.cppB.Very Beautiful Number题意:一个数a(p)a(p-1)a...a2a1 * x = a1a(p)a(p-1)...a3a2思路:小学奥数,枚举个位,依次推出十位,百位,至于为什么是最小解,我当时写的时候还真没考虑Code:b.cppC.Dominoes题意:给出初始4种牌的个数,求一种摆放方法,使得每列原创 2014-02-21 22:33:37 · 1281 阅读 · 2 评论 -
CF 232 div1
A.On Number of Decompositions into Multipliers题意:m=a1*a2...*an,求m拆分成n个数的排列思路:对m质因数分解之后,对每个质因子的幂用隔板法分成n份,C(x+n-1,n-1)Code:a.cppB.On Sum of Fractions题意:v(n)表示不超过n的最大素数,u(n)表示超过n的最小素数,求si原创 2014-02-27 19:11:39 · 1380 阅读 · 0 评论 -
CF L. Rolling Cube
题目:CF L. Rolling Cubetag:模拟#include #include #include #include #include #include using namespace std;#define maxn 100010int b[7];struct Cube{ int a[7]; void right()原创 2013-10-24 19:41:15 · 832 阅读 · 0 评论 -
CodeChef November Challenge 2013 » Yet Another Cute Girl
题目:Yet Another Cute Girl Chef doesn't love math anymore. He loves Sasha. Sashen'ka is cute.Chef goes on a date with her. Flowers are boring, while numbers are not. He knows that most of all原创 2013-11-04 21:04:55 · 1278 阅读 · 0 评论 -
Codeforces Beta Round #3
题目:Codeforces Beta Round #3放个寒假,赶脚自己成SB了,代码写得越来越冗长,越来越水了A:Shortest path of the king呃,简单的DFS,尼玛,我没当DFS做,感觉好SB#include #include #include using namespace std;#define min(a,b) (a<b?a:b)#d原创 2013-02-14 17:41:13 · 597 阅读 · 0 评论 -
Codeforces Round #137 (Div. 2)
A. Shooshuns and Sequencetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day shooshuns found a sequenc原创 2012-12-05 19:59:04 · 1737 阅读 · 0 评论 -
Codeforces Beta Round #4 (Div. 2 Only)
题目:Codeforces Beta Round #4 (Div. 2 Only)A:Watermelon判断这个数是否能分成两个偶数之和#include bool is_ok(int n){ if(n%2==0) { n-=2; if(n%2==0&&n>0) return true;原创 2013-02-15 12:04:23 · 575 阅读 · 0 评论 -
Codeforces Round #155 (Div. 2)
A. Cards with Numberstime limit per test1 secondmemory limit per test256 megabytesinputinput.txtoutputoutput.txtPetya has got 2n cards, each card contains some原创 2012-12-12 22:05:20 · 744 阅读 · 0 评论 -
CROC-MBTU 2012, Elimination Round (ACM-ICPC)
A. System Administratortime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus is a system administrato原创 2012-11-22 07:39:59 · 1731 阅读 · 3 评论 -
CF 61 div2 D. Petya and His Friends
题目:D - Petya and His Friends思路:高精度模板可以过,但是找规律也行高精度的:#include #include #include #include #include #include #include using namespace std;#define maxn 240bool vis[maxn];mapm;stri原创 2013-07-24 17:04:57 · 868 阅读 · 0 评论 -
CF 181 div2 C. Beautiful Numbers
题目:C - Beautiful Numbers题意:输入a,b,n,求满足长度为n且只由a,b组成的数字各位之和也只由a,b组成的组合数。n的大小是10^6,受之前某个题的影响,这样想的:假设a#include #include #include #include #include using namespace std;#define maxn 1000010原创 2013-07-24 00:20:47 · 1172 阅读 · 0 评论 -
Codeforces Round #146 (Div. 2) B. Easy Number Challenge
B. Easy Number Challengetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's denote d(n) as the number of原创 2012-10-23 02:37:18 · 1121 阅读 · 0 评论 -
CF 5 E. Bindian Signalizing
题目:Bindian Signalizing思路:dp 将环分成链之后,用pair记录开始到当前值的一个较大的值#include #include #include #include #include #include #include using namespace std;#define maxn 1000010int a[maxn];int b[maxn];in原创 2013-07-15 13:34:00 · 1499 阅读 · 0 评论 -
Codeforces Round #146 (Div. 2) C. LCM Challenge
C. LCM Challengetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSome days ago, I learned the concept of LC原创 2012-10-23 02:43:06 · 921 阅读 · 0 评论 -
Codeforces Round #170 (Div. 2)
题目:Codeforces Round #170 (Div. 2)A : Circle Line求从起始到目标的最短路,直接累加这一段,跟剩下的取个最小值即可= = 为了跟wiking大神比速度,手贱WA一次#include #include #include #include #include using namespace std;int n;int a[原创 2013-05-23 15:58:51 · 673 阅读 · 0 评论 -
CF 230 div2
A.呵呵B.没看C.Blocked Points题意:给出半径R,求圆内最外圈的整点的个数思路:平分成四份,对于每部分,可以找一个对称轴,特判0和接近对称轴的那个值Code:c.cpp D.Tower of Hanoi题意:给出3根柱子的汉诺塔间移动圆盘的消耗,求从第一根柱子移动n个盘子到第三根的最小花费思路:因为大盘不能放在小盘的上面,原创 2014-02-19 15:47:54 · 1302 阅读 · 1 评论