2013年10月_Fate_O

原创 ACM-> 二分图的最优匹配

SimilarityTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 3718DescriptionWhen we were children, we were always asked to do

2013-10-31 19:50:04 669

原创 ACM->CF 358A

A. Dima and Continuous Linetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDima and Seryozha live in an or

2013-10-31 19:21:22 663

原创 ACM->逻辑判断 ZOJ 3657 The Little Girl who Picks Mushrooms

The Little Girl who Picks MushroomsTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3657DescriptionIt's yet another festival s

2013-10-31 19:20:10 634

原创 ACM->2-sat ZOJ 3656 Bit Magic

Time Limit:8000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3656DescriptionYesterday, my teacher taught me about bit operators: and (&),

2013-10-31 14:21:02 668

原创 ACM->CF Knight Tournament

Knight TournamentTime Limit:3000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 357CAppoint description: System Crawler (2013-10-16)

2013-10-25 10:31:14 610

原创 ACM->uvalive->Sentry Robots(二分图匹配的最小点覆盖)

Sentry RobotsTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVALive 6156DescriptionWe need to guard a set of points of interest

2013-10-21 11:10:52 761

原创 ACM->uva10494

#include #include #include #include #include #include using namespace std;#define MAXN 1000 + 10struct Bign{ int len; int s[MAXN];}a, ans;void output(Bign temp){ int u = 0; while

2013-10-20 19:39:38 561

原创 ACM->uva748

#include #include #include #include using namespace std;#define MAXN 500 + 50int a[MAXN], b[MAXN];int c[MAXN];int record;void output(int temp[], int t){ int u = 0, v = 0; for (int i

2013-10-20 19:39:08 469

原创 ACM->uva465

#include #include #include #include using namespace std;#define MAXN 500 + 50int a[MAXN], b[MAXN];int c[MAXN];int cmp[10] = { 7, 4, 6, 3, 8, 4, 7, 4, 1, 2};bool is_big(int temp[]){ i

2013-10-20 19:38:45 609

原创 ACM-uva10106

#include #include #include #include using namespace std;#define MAXN 500 + 50int a[MAXN], b[MAXN];int c[MAXN];void input(){ string str1, str2; while (cin >> str1 >> str2) { int len

2013-10-20 19:38:21 471

原创 ACM-uva424

#include #include #include using namespace std;#define MAXN 100 + 100int ans[MAXN];int add[MAXN];void input(){ string str; memset(ans, 0, sizeof(ans)); while (cin >> str) { if (s

2013-10-20 19:37:18 481

原创 ACM-uva10115

#include #include #include #include #include using namespace std;#define MAXN 10 + 5string rules[MAXN];string change[MAXN];string str;void input(){ int n; while (scanf("%d", &n) !=

2013-10-20 19:36:45 445

原创 ACM->uva644

#include #include #include #include #include using namespace std;#define MAXN 10 + 5string str;string in[MAXN];void input(){ int tot = 0, k = 0; while (getline(cin, str)) { if (st

2013-10-20 19:36:11 460

原创 ACM->uva10878

#include #include #include #include #include using namespace std;string str;void input(){ while (getline(cin, str)) { if (str[0] == '|') { int ans = 0; for (int i = 1; i < s

2013-10-20 19:35:36 489

原创 ACM-uva10815

#include #include #include #include #include #include #include using namespace std;string str;map store;map ::iterator it;char change(char ch){ if (ch >= 'A' && ch <= 'Z') { ch +=

2013-10-20 19:35:02 543

原创 ACM->uva409

#include #include #include #include #include using namespace std;#define MAXN 20 + 5string excuses[MAXN], keywords[MAXN];string excusess[MAXN];int n, m;int num[MAXN];char change(char c

2013-10-20 19:34:38 544

原创 ACM->uva573

#include #include #include using namespace std;#define INF 1e20string str;double p, u, i;double change(int x){ double res = 0; int u = -1, end = -1; char ch; const double m = 0.0

2013-10-20 19:34:06 498

原创 ACM-uva10361

#include #include #include using namespace std;string str1, str2, str3, str4, str5;string str, Str;void destruction(){ str1 = str2 = str3 = str4 = str5 = ""; int num = 0; for (int i =

2013-10-20 19:33:11 540

原创 ACM-uva10010

#include #include #include using namespace std;#define MAXN 50 + 5int temp[MAXN][MAXN];int r, c;int dir[8][2] = { 0, -1, -1, 0, 0, 1, 1, 0, -1, -1, -1, 1, 1, 1, 1, -1};int ansr, ansc;

2013-10-20 19:31:50 532

原创 ACM->uva401

/*找回文,i != n - i - 1; 镜像 Reverse i != n - i - 1*/#include #include #include #include using namespace std;char Reverse[35] = { 'A', '#', '#', '#', '3', '#', '#', 'H', 'I', 'L', '#',

2013-10-20 19:30:52 595

转载 c++->const用法总结

1. const修饰普通变量和指针const修饰变量，一般有两种写法：const TYPE value;TYPE const value;这两种写法在本质上是一样的。它的含义是：const修饰的类型为TYPE的变量value是不可变的。对于一个非指针的类型TYPE，无论怎么写，都是一个含义，即value只不可变。例如：

2013-10-18 15:53:56 424

原创 YY->POJ 1328

Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1328DescriptionAssume the coasting is an infinite straight line. Land is in one s

2013-10-13 22:12:56 567

原创模拟->YY POJ 1786

Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1786DescriptionDrivers of Advanced Cargo Movement, Ltd. usually have to wait quit

2013-10-13 22:10:23 549

原创数学-> YY POJ 1338

Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1338DescriptionUgly numbers are numbers whose only prime factors are 2, 3 or 5. T

2013-10-13 22:07:30 543

原创模拟->YY POJ 2339 Rock, Scissors, Paper

Rock, Scissors, PaperTime Limit:5000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2339DescriptionBart's sister Lisa has created a new civili

2013-10-13 22:04:05 855

原创模拟->YY POJ 2612 Mine Sweeper

Mine SweeperTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2612DescriptionThe game Minesweeper is played on an n by n grid. In

2013-10-13 22:00:56 823

原创模拟->YY POJ 1028 Web Navigation

Web NavigationTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1028DescriptionStandard web browsers contain features to move bac

2013-10-13 21:55:09 645

转载数学-三分->讲解

原文：http://hi.baidu.com/vfxupdpaipbcpuq/item/81b21d1910ea729c99ce33db 二分法作为分治中最常见的方法，适用于单调函数，逼近求解某点的值。但当函数是凸性函数时，二分法就无法适用，这时三分法就可以“大显身手”～～如图，类似二分的定义Left和Right，mid = (Le

2013-10-13 21:31:58 604

原创数学-三分->HDU 3714 Error Curves

Error CurvesTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 3714DescriptionJosephina is a clever girl and addicted to Machine L

2013-10-13 21:26:26 589

原创枚举->HDU 3711 Binary Number

Binary NumberTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 3711DescriptionFor 2 non-negative integers x and y, f(x, y) is def

2013-10-13 21:14:31 711

原创 2-sat->HDU 3715 Go Deeper

Go DeeperTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 3715DescriptionHere is a procedure's pseudocode: go(int dep, int n

2013-10-13 21:12:24 620

原创 CF->CodeForces 256A

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 256ADescriptionGena loves sequences of numbers. Recently, he has discover

2013-10-12 19:01:35 684

原创 CF->CodeForces 137C

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 137CDescriptionPolycarpus likes studying at school a lot and he is always

2013-10-12 18:58:17 1094

原创 CF->CodeForces 137B

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 137BDescription"Hey, it's homework time" — thought Polycarpus and of cour

2013-10-12 18:56:48 1021

原创 CF->CodeForces 137A

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 137ADescriptionPolycarpus has postcards and photos hung in a row on the w

2013-10-12 18:55:41 566

原创数学->hdu 2973

YAPTCHATime Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2973DescriptionThe math department has been having problems lately. Due

2013-10-12 18:37:26 647

原创字符->hdu 2970 Suffix reconstruction

Suffix reconstructionTime Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2970DescriptionGiven a text s[1..n] of length n, we create

2013-10-12 18:35:50 723

原创待完成

UVALive 4766

2013-10-12 18:30:27 561

原创 DP->UVALive 4764

Bing itTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVALive 4764DescriptionI guess most of you played cards on the trip to Harbin, b

2013-10-12 18:29:06 995 1

原创字符->UVALive 4773 YY and YY Again

YY and YY AgainTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVALive 4773DescriptionIf we define each of the upper case letters a num

2013-10-12 18:24:15 1066

简单五子棋c++

cfree5_0_pro_setup_ch.exe

空空如也