coding__girl的博客

A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N. No two places have the same number. The lines are bidi

The number of students interested to participate in this year’s Intra-BUET Programming Contest is huge. Since it is very difficult to accommodate such a large number of students in our labs, we have de

The gopher family, having averted the canine threat, must face a new predator. The are n gophers and m gopher holes, each at distinct (x,y) coordinates. A hawk arrives and if a gopher does not reach a

In this problem you will need to find out which task has the most number of dependencies. A task A depends on another task B if B is a direct or indirect dependency of A. For example, if A depends on

The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the

The inhabitants of Tigerville and Elephantville are engaged in a seasonal war. Last month, Elephantville successfully launched and orbited a spy telescope called the Bumble Scope. The purpose of the Bu

题意： 黑白两方下棋，必有一人胜出，若黑棋能从第一行走到最后一行则Black胜出，若白棋能从能从第一列走到最后一列则White胜出 思路： 只需判断Black是否胜出，用dfs搜索黑棋能否能从第一行走到最后一行#include <iostream> using namespace std; int N,flag=0; int dx[]={1,0,1,0,-1,-1};//记录六个方向 int

A construction company owns a large piece of real estate within the state of Florida. Recently, the company decided to develop this property. Upon inspection of the property, however, it was revealed t

Kamal is a Motashota guy. He has got a new job in Chittagong. So, he has moved to Chittagong from Dinajpur. He was getting fatter in Dinajpur as he had no work in his hand there. So, moving to Chittago

“First, the breath of God. Only the penitent man will pass. Second, the Word of God, Only in the footsteps of God will he proceed. Third, the Path of God, Only in the leap from the lion’s head wil

You might have noticed that English and Spanish are spoken in many areas all over the world. Now it would be nice to rank all languages according to the number of states where they are spoken. You’re

匈牙利算法，将狗的兴趣点与人走的每段路作二部图（即图的左边是点，右边是边），求出该二部图对于狗的兴趣点的最大匹配数，再加上人必经的点数，就是狗的路线。#include <iostream> #include <cmath> #include <vector> #include <cstring> using namespace std; const int Maxn=105; int N,M; do