heaventouch

摘要： MatrixTime Limit:3000MSMemory Limit:65536KTotal Submissions:16797Accepted:6312DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 14 #include15 #define N 100516 int c[N][N];17 int lowbit(int i) 阅读全文

摘要： Mobile phonesTime Limit:5000MSMemory Limit:65536KTotal Submissions:13889Accepted:6451DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with the rows and columns numbered 阅读全文

摘要： 1、n串最长公共子序列 1 #include 2 #include 3 #include 4 using namespace std; 5 const int MAXF=1000005; 6 const int MAXN=105; 7 int n; 8 int base[MAXN],len[MAXN],pos[MAXN]; 9 char ans;10 char f[MAXF];11 char word[MAXN][MAXN];12 void solve()13 {14 int idx=0;15 for(int i=0;i<n;i++){16 idx+=(pos[... 阅读全文

摘要： Ultra-QuickSortTime Limit:7000MSMemory Limit:65536KTotal Submissions:37971Accepted:13672DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in 阅读全文

摘要： StarsTime Limit:1000MSMemory Limit:65536KTotal Submissions:29888Accepted:13066DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and not to the 阅读全文

摘要： A Bug's LifeTime Limit:10000MSMemory Limit:65536KTotal Submissions:26599Accepted:8676DescriptionBackgroundProfessor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender 阅读全文

摘要： Find them, Catch themTime Limit:1000MSMemory Limit:10000KTotal Submissions:28649Accepted:8761DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify whi 阅读全文

摘要： How Many Answers Are WrongTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2045Accepted Submission(s): 807Problem DescriptionTT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing TT to play the follo 阅读全文

摘要： FlingTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 354Accepted Submission(s): 143Problem DescriptionFling is a kind of puzzle games available on phone.This game is played on a board with 7 rows and 8 columns. Each puzzle consists of a set of furb 阅读全文

摘要： 敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36121Accepted Submission(s): 15282Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人 阅读全文

摘要： Stock ChaseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1201Accepted Submission(s): 363Problem DescriptionI have to admit, the solution I proposed last year for solving the bank cash crisis didn’t solve the whole economic crisis. As it turns out 阅读全文

摘要： 统计难题Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 15844Accepted Submission(s): 6777Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统 阅读全文

摘要： Hat’s WordsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6648Accepted Submission(s): 2456Problem DescriptionA hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.You are to find all the ha 阅读全文

摘要： 文件输入输出：1 freopen("in.txt","r",stdin);2 freopen("out.txt","w",stdout);View Code 阅读全文

摘要： 确定比赛名次Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9840Accepted Submission(s): 3837Problem Description有N个比赛队（1 5 #include 6 int g[505][505]; 7 int in[505],ans[505],n,m; 8 void topo() 9 {10 for(int i=1;i<=n;i++)11 for(int j=1;j<=n;j++... 阅读全文