阿丙的博客园

摘要： Unimodal Palindromic DecompositionsTime Limit:2 Seconds Memory Limit:65536 KBA sequence of positive integers is Palindromic if it reads the same forward and backward. For example:23 11 15 1 37 37 1 15 11 231 1 2 3 4 7 7 10 7 7 4 3 2 1 1A Palindromic sequence is Unimodal Palindromic if the values do 阅读全文

摘要： FatMouse and CheeseTime Limit:10 Seconds Memory Limit:32768 KBFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 # includeusing namespace std;int map[105][105];int vis[105][105];int n,k;bool judge(int x, 阅读全文

摘要： CountDescriptionProf. Tigris is the head of an archaeological team who is currently in charge of an excavation in a site of ancient relics.This site contains relics of a village where civilization once flourished. One night, examining a writing record, you find some text meaningful to you. It reads 阅读全文

摘要： Min NumberDescriptionNow you are given one non-negative integer n in 10-base notation, it will only contain digits ('0'-'9'). You are allowed to choose 2 integers i and j, such that: i!=j, 1≤i 2 # include 3 int main() 4 { 5 int T,n,i,j,k; 6 char s[10010]; 7 char temp; 8 int max,min; 阅读全文

摘要： Monkey and BananaTime Limit:2 Seconds Memory Limit:65536 KBA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. If the monkey is clever enough, it shall be able to 阅读全文

摘要： Match for BonusTime Limit:2 Seconds Memory Limit:65536 KBRoy played a game with his roommates the other day.His roommates wrote 2 strings of characters, and gave each character a bonus value. When Roy pinned the positions of one common character in the 2 strings, the bonus value of that character wo 阅读全文

摘要： Fire NetTime Limit:2 Seconds Memory Limit:65536 KBSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.A blockhouse is a small castle that has four openings through which to shoot. The fou 阅读全文

摘要： PalindromesTime Limit: 2 Seconds Memory Limit: 65536 KBA regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is a palindrome because it is the same when the string is read from left to right as when the string is re 阅读全文

摘要： The mell hellTime Limit:1000MSMemory Limit:131072KB64bit IO Format:%lld & %lluDescriptionInHUST,there are always many students go to themellhall at the same time as soon as the bell rings. Students have to queue up for a meal ,and the queue isawalyslong,So it takes much time.Suposse there are N 阅读全文

摘要： Little Sheep and a paperTime Limit:2 SecMemory Limit:128 MBSubmissions:95Solved:30Description One day, god Sheep gets an AK(all kill) in a contest, so he is very boring, then he just plays with a paper. The paper has two faces called A and B. Sheep finds the paper can be folded for infinity times,.. 阅读全文

摘要： Constructing RoadsTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescriptionThe city of M is a famous shopping city and its open-air shopping malls are extremely attractive. During the tourist seasons, thousands of people crowded into these shopping malls and enjoy the vary-di 阅读全文

摘要： 内存管理Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description在为进程动态分配内存时,操作系统必须对其进行管理。一种管理内存的方式是，维护一张记录内存使用情况的表来模拟内存的存储情况，其任一表项可能是以下两种情况之一：一个已分配给进程的内存区或者一个空闲的内存区。表中每一个表项含有以下内容：空闲区或已使用内存区的指示标志、内存大小、指向下一表项的指针。一个表项一般有一个前驱表项和一个后继表项（除非这个表项是内存的最底端或最顶端），已使用区表项的前驱表项和后继表项可能是已使用区表项也 阅读全文

摘要： Japanese Mahjong IIITime Limit: 2 Seconds Memory Limit: 65536 KBMahjong is a game of skill, strategy and calculation and involves a certain degree of chance. In this problem, we concentrate on Japanese Mahjong, a variation of mahjong. For brief, all of the word mahjong mentioned following refer to . 阅读全文

摘要： Rock, Scissors, PaperTime Limit: 5 Seconds Memory Limit: 32768 KBBart's sister Lisa has created a new civilization on a two-dimensional grid. At the outset each grid location may be occupied by one of three life forms: Rocks, Scissors, or Papers. Each day, differing life forms occupying horizont 阅读全文

摘要： 选课时间(题目已修改,注意读题)Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1865Accepted Submission(s): 1501Problem Description又到了选课的时间了，xhd看着选课表发呆，为了想让下一学期好过点，他想知道学n个学分共有多少组合。你来帮帮他吧。（xhd认为一样学分的课没区别）Input输入数据的第一行是一个数据T，表示有T组数据。每组数据的第一行是两个整数n(1 #include #includ 阅读全文