PsTree

Bookshelf 2 DescriptionFarmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.FJ

1 #include 2 #include 3 #include 4 #includestring> 5 #include 6 #define MAXN 1111 7 using namespace std; 8 class Point{ 9 public:10 int x,y;11 bool operator con

Flip GameDescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece

Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10370 Accepted: 5922DescriptionThe ministers of the cabinet were quite upset by the message from

1.DFS 1 #include 2 #include 3 #include 4 #includestring> 5 #include 6 #include 7 #include 8 using namespace std; 9 char str[20], ans[10]; 10 int vis[20], flag; 11 bool cmp(cha

Disease ManagementDescriptionAlas! A set of D (1 Input* Line 1: Three space-separated integers: N, D, and K * Lines 2..N+1: Line i+1 describes the diseases of cow i with a list of 1 or more sp

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9928 Accepted: 3687DescriptionN cities named with numbers 1 ... N are connected with one-way roads. Each road has tw

滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 71659 Accepted: 26468DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升

1 #include 2 #include 3 #include 4 #includestring> 5 #define MAXN 1000010 6 #define LL long long 7 const LL INF = 0x7fffffffffffff; 8 using namespace std;

1 #include 2 #include 3 #include 4 #includestring> 5 #include 6 #define MAXN 20010 7 using namespace std; 8 typedef struct{ 9 int to,next;10 }Node;11 typedef struct PP{12

Collecting BeepersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2381 Accepted: 1284DescriptionKarel is a robot who lives in a rectangular coordinate s

Party at Hali-BulaTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5130 Accepted: 1822DescriptionDear Contestant,I'm going to have a party at my villa

Tudoku DescriptionTom is a master in several mathematical-theoretical disciplines. He recently founded a research-lab at our university and teaches newcomers like Jim. In the first lesson he e

Easy FindingDescriptionGiven a M×N matrix A. Aij ∈ {0, 1} (0 ≤ i InputThere are multiple cases ended by EOF. Test case up to 500.The first line of input is M, N (M ≤ 16, N ≤ 300). The next M l

Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10118 Accepted: 4264DescriptionOn Planet MM-21, after their Olympic games this year, curling

Cow Relays DescriptionFor their physical fitness program, N (2 ≤ N ≤ 1,000,000) cows have decided to run a relay race using the T (2 ≤ T ≤ 100) cow trails throughout the pasture.Each trail c

A - NetworkTime Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1144DescriptionA Telephone Line Company (TLC) is establishing a new te

An Industrial Spy DescriptionIndustrial spying is very common for modern research labs. I am such an industrial spy - don't tell anybody! My recent job was to steal the latest inventions from a

Multiplication Puzzle DescriptionThe multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scor

Network SaboteurTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8751 Accepted: 4070DescriptionA university network is composed of N computers. System admi

Cow PicnicTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4928 Accepted: 2019DescriptionThe cows are having a picnic! Each of Farmer John's K (1 ≤ K ≤ 1

Fiber NetworkTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2896 Accepted: 1335DescriptionSeveral startup companies have decided to build a better Intern