其他

HHyper Prefix SetsPrefix goodness of a set string is length of longest common prefix*number of strings in the set. For example the prefix goodness of the set {000,001,0011} is 6.You are given a set of binary strings. Find the maximum prefix goodness

Information SharingTime Limit: 3 Seconds      Memory Limit: 65536 KBThere is going to be a test in the kindergarten. Since the kids would cry if they get a low score in the test, the teacher has already told every kid some information about the test

Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4904    Accepted Submission(s): 2991Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is

D. Maximum Xor Secondarytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct

Problem AAlmost Union-FindI hope you know the beautiful Union-Find structure. In this problem, you're to implement something similar, but not identical.The data structure you need to write is also a collection of disjoint sets, supporting 3

floyd算是求最短路徑裡面的最簡單的一種演算法了。  它一般用在求一個有向網（或無向網），對每一個頂點vi不等於vj，要求求出vi與vj之間的最短路徑和最短路徑的長度。如果用dijkstra的話要迴圈n次，用floyd雖然時間複雜性並未減少，同樣是 o（n^3），但是寫起來更加簡單。這個裡面沒什麼特別好講的地方，值得注意的是他的兩個遞推公式。A^k[i][j]=min{A^(k-1)[i][j],A^(k-1)[i][k]+A^(k-1)[k][j]}

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42406    Accepted Submission(s): 11468Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a

D. Psychos in a Linetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n psychos standing in a line. Each psycho is assigned a unique integer from1 to n. At each step every psycho who has

integers a1, a2...aN follow, indicating the skill rank of each player, in the order of west to east (1ai100000 , i = 1...N ).OutputFor each test case, output a single line contains an integer, the total number of different games.Sample Input13 1 2

RochambeauTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1658 Accepted: 577DescriptionN children are playing Rochambeau (scissors-rock-cloth) game with you. One of them is the judge. The rest children are divided into three groups (it is

B. Physics Practicaltime limit per test1 secondmemory limit per test256 megabytesinputinput.txtoutputoutput.txtOne day Vasya was on a physics practical, performing the task on measuring the capacitance. He followed the teacher's advice and did as

PotentiometersInput: Standard InputOutput: Standard OutputA potentiometer, or potmeter for short, is an electronic device with a variable electric resistance. It has two terminals and some kind of control mechanism (often a dial, a wheel or a slide)

#include<cstdio>#include<cstring>#include<cstdlib>#include<iostream>using namespace std;int pre[25],next[25];int N,m,n;int pos1,pos2;//移除結點void remove(int n){ next[pre[n]]=next[n];//第二個人的下一個位置

Terrible SetsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 2778 Accepted: 1413DescriptionLet N be the set of all natural numbers {0 , 1 , 2 , . . . }, and R be the set of all real numbers. wi, hi for i = 1 . . . n are some elements in N,

Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13923 Accepted: 5424DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with

StringTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 0    Accepted Submission(s): 0Problem DescriptionGiven 3 strings A, B, C, find the longest string D which satisfy the following rules:a) D

題目大意是：輸入正整數n，按從小到大的順序輸出所有形如abcde/fghij=n的運算式，其中a-j恰好為數字0-9的一個排列，2=<n<=79.楊麗輸入：62輸出：79546/01283=6294736/01528=62 //這是一道非常沒含量的簡單的枚舉的題，所以我沒把他算在寒假前刷題裡，之所以把他寫出來是因為這是我第一次真正的開始系統的看關於暴力演算法的東西，暑假的時候打了醬油，現在就是在贖罪，老是聽十元大師說暴力辦法解決這道題，感覺暴力似乎是個很牛逼的東西。今天就寫個最傻逼的

Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8582 Accepted: 3603DescriptionOn Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played

X-Plosives A secret service developed a new kind of explosive that attain its volatile property only when a specific association of products occurs. Each product is a mix of two different simple compounds, to which we call a binding pair. If N>2,

The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 18435 Accepted: 8920DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To