2014年03月_xiaoyu1_1

原创 Codeforces Round #236 (Div. 2) D. Upgrading Array

set..map..质因数分解。。#include#include#include#include#include#includeusing namespace std;#define inf 0x3f3f3f3fint p[5050];int g[5050];set b;int gcd(int a,int b){ return b?gcd(b,

2014-03-18 10:44:16 654

原创 D. Nass Number 第八届北京邮电大学程序设计竞赛 - 热身赛 (2)

时间限制 1000 ms 内存限制 65536 KB题目描述We define two functions under base 10. f(x) indicates the number which is formed by operating bitwise exclusive or(xor) with each digit of x, and g(x) indic

2014-03-13 11:01:31 1124

原创 A Claire_ 's problem 第八届北京邮电大学程序设计竞赛 - 热身赛 (2)

时间限制 5000 ms 内存限制 65536 KB题目描述As we all know,Claire_ and ykwd are famous ACMers in BUPT ACM Group.They always play games together.Nowadays they play such a game:at first,Claire_ writes dow

2014-03-12 13:19:44 1269

原创 hdu 4497 GCD and LCM --- 2013通化邀请赛

http://blog.csdn.net/tobewhatyouwanttobe/article/details/10285863#include #include #include #include #include#include#include#includeusing namespace std;#define ll __int64#define i

2014-03-12 09:26:48 654

原创 Codeforces Round #235 (Div. 2) ----D. Roman and Numbers

D. Roman and Numberstime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputRoman is a young mathematician, very f

2014-03-11 23:12:12 669

原创 H. Transfer numbers 第八届北京邮电大学程序设计竞赛 - 热身赛 (2)

时间限制 1000 ms 内存限制 65536 KB题目描述ykwd likes playing with numbers. One day, he came up with a way to transfer a number to another. Now, let’s define this kind of transfer. X is a positive nu

2014-03-08 19:42:38 919

原创 I. Counting 第八届北京邮电大学程序设计竞赛 - 热身赛 (1)

时间限制 1000 ms 内存限制 65536 KB题目描述In a math class,you are assigned the following task.First,look at the definition F(n,d)=k which means that in the given number n,there are k d's.For insta

2014-03-08 11:14:35 831

原创 hdu 4309 Seikimatsu Occult Tonneru ----网络流

共2*n+2个点源点到 i(1p i+n（1 u到v，流量为正无穷p==0，u到v可以通过人 u到v，流量为正无穷p>0，为桥，可通过一人，修好后可通过正无穷人，边最多有12 个 u到v，流量为 12^12,枚举p>0的桥的所有可能情况，求最大流时的，最小费用#include #include

2014-03-06 12:59:10 564

原创 hdu 4339 Query ---线段树

给两个字符串，1操作修改其中一个串的一个字符的值2操作询问从该字符串开始往后的两个字符串字符相同的长度标记字符相同为1，不同为0，每次修改相当于修改0,1值，zhi,标记每段的左值，为0，或1la,标记每段从左开始连续1的长度flag,标记叶子节点的1,0值//没啥用，可删掉。。len ,标记段长然后就是更新，询问操作了。。#

2014-03-04 16:54:16 418

xiaoyu1_1的专栏