OTTFF的博客

Space ElevatorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10883 Accepted: 5185DescriptionThe cows are going to space! They plan to achieve orbit by

DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12800 Accepted: 5866DescriptionCows are such finicky eaters. Each cow has a preference for certa

题目本身不难但是卡了好久。因为一个break。说明以后在有输入输出的循环里加break要格外注意。用了二分搜索法，不过这个题目还可以hash。之后补充hash。#include #includeusing namespace std;const int M=50005;int s1[M];int bs(int n,int key){ int lo=0,hi=

油田，经典的bfs调用bfs次数就是油田的片数感觉还能优化貌似调用过的油田直接改回非油田就好了不用再开数组标记了#include #include #include using namespace std;const int M=105;char ti[M][M];int isu[M][M];int dx[8]={-1,0,1,1,1,0,-1,-1};int

bfs这个题目就麻烦在数字是按位变化的，所以要把数字拆开……#include #include #include using namespace std;const int M=10005;int pri[M];int prim[11][10][10][10]; //拆开的素数int isu[M];queuere;void bfs(int n,int

bfs就是跟马的运动方式一样么……#include #include #include using namespace std;const int M=305;int isu[M][M];int dx[8]={-2,-1,1,2,2,1,-1,-2};int dy[8]={-1,-2,-2,-1,1,2,2,1};queuere;int tot;void b

To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 43794 Accepted: 23206DescriptionGiven a two-dimensional array of positive and negative integ

Collecting BugsTime Limit: 10000MS Memory Limit: 64000KTotal Submissions: 3427 Accepted: 1695Case Time Limit: 2000MS Special JudgeDescriptionIvan is fond

数独，当年一家人都很疯狂的玩如今用电脑dfs非常容易的就解决了。判断在同一大格里可以填有点麻烦。题目每组输入其实是9个整数，所以……另外就是题目要求对于有多个解的题目，输出一个可行解。#include #include using namespace std;int ss[9]; //输入这里也卡了一下int s[9][9];

ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6422 Accepted: 2263 Special JudgeDescriptionAs you know, all the computers use

HighwaysTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26862 Accepted: 12295DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately

OulipoTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8752    Accepted Submission(s): 3534Problem DescriptionThe French author G

Apple TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9584 Accepted: 3192DescriptionWshxzt is a lovely girl. She likes apple very much. One day HX t

Cash MachineTime Limit: 10 Seconds      Memory Limit: 32768 KBA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate bills for a requested cash amo

Charlie's ChangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4094 Accepted: 1269DescriptionCharlie is a driver of Advanced Cargo Movement, Ltd. Charl

SudokuTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 4918 Accepted: 2332DescriptionA Sudoku grid is a 16x16 grid of cells grouped in sixteen 4x4 squ

SudokuTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9412 Accepted: 3375DescriptionIn the game of Sudoku, you are given a large 9 × 9 grid divided in

Square DestroyerTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3642 Accepted: 1577DescriptionThe left figure below shows a complete 3*3 grid made wit

Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 48763 Accepted: 17823DescriptionIn this problem, you have to analyze a particular sorti

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 40456 Accepted: 16833DescriptionGiven two strings a and b we define a*b to be their conca

这个问题最开始没看出是二分的问题。启发就是很多需要搜索答案的问题可能是用二分的方法来求解。答案所求就是二分的量。拿掉石子时优先从一侧挨着拿直到符合条件。#include #include #include using namespace std;const int M=50005;int d[M];int ns(int k,int n){ int co

二分查找的问题题意为n衣服有a滴水，烘干每分钟为k滴 不烘干为每分钟1滴问衣服干的最短时间。注意一个是这个题最后求得是整数分钟，因此过程中要用ceil来向上取整求衣服烘所需要的时间另外问题要用long long 不然会wa#include #include #include using namespace std;typedef long long LL;co

Multiplication PuzzleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7071 Accepted: 4354DescriptionThe multiplication puzzle is played with a row of c

Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21478 Accepted: 8797 Special JudgeDescriptionGiven a positive integer n, write a pr

Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14394 Accepted: 7186DescriptionThe little cat is so famous, that many coup

Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14291 Accepted: 6361DescriptionThe Genographic Project is a research partnership between IBM

StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 37221 Accepted: 16231DescriptionAstronomers often examine star maps where stars are represented by po

Closest Common AncestorsTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 17232 Accepted: 5525DescriptionWrite a program that takes as input a rooted tree a

Get Many Persimmon TreesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3922 Accepted: 2553DescriptionSeiji Hayashi had been a professor of the Nisshinkan

SquareTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 21782 Accepted: 7606DescriptionGiven a set of sticks of various lengths, is it possible to join th

3027 - Corporative NetworkTime limit: 3.000 secondsA very big corporation is developing its corporative network. In the beginning each of the N enterprises of the corporation, numerated from 1 to

食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 53514 Accepted: 15677Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动

Error CorrectionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5920 Accepted: 3823DescriptionA boolean matrix has the parity property when each row a

ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22987 Accepted: 13469DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses

没什么特别的，简单的快速幂，照着output中公式写即可#include #includeusing namespace std;int qp(int nn,int n,int m) //nn的n次幂模m{ int r=1; while(n>0) { if(n&1) r=(r*nn)%m; n>>=1

BracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4204 Accepted: 2230DescriptionWe give the following inductive definition of a “regular brack

Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 42953 Accepted: 17377DescriptionA subsequence of a given sequence is the given seque

直接模拟即可。题目比较长。#include #include #include using namespace std;char hmn[19][10]={"pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kanki

PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11767 Accepted: 4981 Special JudgeDescriptionYou are given two pots, having the volume of A an

PainterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3725 Accepted: 2252DescriptionThe local toy store sells small fingerpainting kits with between