keshuqi的博客

Network Saboteur Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 11122   Accepted: 5372 Description A university network is composed of N computers. System a

The input consists of more than one description of town (but totally, less than ten descriptions). Every description starts with number N of towns and number M of pairs of towns directly connected

Accepted 0ms

Description It is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to counter a chronic breakdown in l

Description Cellular automata are mathematical idealizations of physical systems in which both space and time are discrete, and the physical quantities take on a nite set of discrete values. A cel

Computer networking requires that the computers in the network be linked. This problem considers a \linear" network in which the computers are chained together so that each is connected to exact

Your task is to write a program that can decide whether you can nd an arithmetic expression consisting of ve given numbers ai (1  i  5) that will yield the value 23. For this problem we will only

6741870 ksq2013 UVA 11205 Accepted   60 C++11 5.3.0 1002 2016-08-04 14:25:22 题目大意如下：给定n个LED灯串，每个灯串由p个LED灯构成，并给出每个灯串当下的状态，需要让所有灯串中规定的某些灯灭掉，询问最少剩下几盏正常的灯可以

Channel Allocation Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 14361   Accepted: 7311 Description When a radio station is broadcasting over a very large ar

The Psychic Poker Player Time Limit: 3000MS     64bit IO Format: %lld & %llu Description In 5-card draw poker, a player is dealt a hand of five cards (which may be looked at)

Description 　　农夫约翰打算建立一个栅栏将他的牧场给围起来，因此他需要一些特定规格的木材。于是农夫约翰到木材店购 买木材。可是木材店老板说他这里只剩下少部分大规格的木板了。不过约翰可以购买这些木板，然后切割成他所需 要的规格。而且约翰有一把神奇的锯子，用它来锯木板，不会产生任何损失，也就是说长度为10的木板可以切成长 度为8和2的两个木板。你的任务：给你约翰所需要的木板的规

Sudoku Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 17953   Accepted: 8688   Special Judge Description Sudoku is a very simple task. A square table with

Shredding Company Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 5379   Accepted: 3023 Description You have just been put in charge of developing a new shre

【题目背景】 James 是A市一家物流处的boss，他手下有N个员工，他向顾客们承诺，公司的运营效率是A市最高的。有一天，他接到了N张订单。为了信守承诺，提高运营效率，他找到你，希望你帮他找出一个合理方案，使员工办事速度之和最小（效率最高）。 【输入】 第一行，一个正整数N。 下面是一个N*N的方阵，第i行第j列表示第i个员工运输第j种订单的速度。 【输出】 一个整数，即最小速度总和

细胞（cell.cpp） 【题目描述】 一矩形阵列由数字0到9组成，数字1到9代表细胞，细胞的定义为沿细胞数上下左右还是细胞数字则为同一细胞，求给定矩形阵列的细胞个数。 【样例输入】 4 10 0234500067 1034560500 2045600671 0000000089 【样例输出】 4 程序：果断宽搜 #include #include using name

Catch That Cow Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 73973   Accepted: 23308 Description Farmer John has been informed of the location of a fugit

题目描述 单词接龙是一个与我们经常玩的成语接龙相类似的游戏，现在我们已知一组单词，且给定一个开头的字母，要求出以这个字母开头的最长的“龙”（每个单词都最多在“龙”中出现两次），在两个单词相连时，其重合部分合为一部分，例如 beast和astonish，如果接成一条龙则变为beastonish，另外相邻的两部分不能存在包含关系，例如at 和 atide 间不能相连。 输入输出格式 输入