其他

DescriptionOrganizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms:1. All of the teams solve at least one problem. 2. The

DescriptionConsider a single-elimination football tournament involving 2n teams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tournament are placed in a list in order of increasing index. Then, the first team in the

小HH：乳鴿的神題，狀態很容易看出來，有50000*1024，很難保持，我用散列表逾時了，用bitset剛好可以卡過，不過後來我想，只有尾結點才有效，中間的很多結點完全可以忽略，可以先用最短路吧各個尾結點之間的距離算出來，經過測試，不到50個點，馬上就最佳化到50*1024了，本來9s多過的最佳化到了100多MS#include <stdio.h>#include <math.h>#include <queue>#include

n 0th day, there are n-1 people and 1 bloodsucker. Every day, two and only two of them meet. Nothing will happen if they are of the same species, that is, a people meets a people or a bloodsucker meets a bloodsucker. Otherwise, people may be

Conquer a New RegionTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 647    Accepted Submission(s): 174Problem DescriptionThe wheel of the history rolling forward, our king conquered a new

Recently poet Mr. po encountered a serious problem, rumor said some of his early poems are written by others. This brought a lot of trouble to Mr. po, so one day he went to his best friend MasterO for help. MasterO handed over a small wooden box

CodeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1746 Accepted: 655DescriptionKEY Inc., the leading company in security hardware, has developed a new kind of safe. To unlock it, you don't need a key but you are required to enter the

DescriptionWshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There are N nodes in the tree. Each node has an amount of apples. Wshxzt starts her happy trip at one node. She can eat up all the apples in the

求兩點之間的最短距離//memset(map, 0x1ffffff, sizeof(map));//錯誤的初始化方式正確使用memset的方式是，初始指定的是8位的數值。比如說memset(map, 0x3f, sizeof(map)); 則map如果是int類型，則被初始化為4個3f 即 0x3f3f3f3f#include <iostream>using namespace std;#define N 105int n, m;int map[N][N];void floyd(){

Problem DescriptionA balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagine each digit as a box with weight indicated by the digit. When a pivot is placed at some digit of the

CatenymsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8414 Accepted: 2212DescriptionA catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For example,

Problem DescriptionHere is a function f(x):　　　int f ( int x ) {　　　 if ( x == 0 ) return 0;　　　 return f ( x / 10 ) + x % 10;　　　}　　　Now, you want to know, in a given interval [A, B] (1 <= A <= B <= 109), how many integer x that mod f(x)

文章目錄 目標串中各個模式串出現了幾次 目標串中各個模式串出現了幾次這就更簡單了，都不用把out標記成false了題目中的病毒都是大寫字母這個條件應該怎麼用？#include <cstdio>#include <cstdlib>#include <string>#include <climits>#include <iostream>#include <vector>#

Play GameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 35    Accepted Submission(s): 24Problem DescriptionAlice and Bob are playing a game. There are two piles of cards. There are N cards in

DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone' (also known as 'Rock, Paper, Scissors', 'Ro, Sham, Bo', and a host of other names) in order to make arbitrary decisions such as who gets

應用模板，對模板有更深入的理解。1.       當前結點的失敗指標 等於       父節點的失敗指標指向的結點的的同個字母兒子結點的指標 2. v = chd[ fail[u] ][i];這句為了別的結點計算敗者指標提供便利。無其他作用。3. work在結點之間的轉移方式 #include <cstdio>#include <cstdlib>#include <string>#include <climits>#include

題意：有3個重複持續時間，周期天數分別為23、28、33。對於某一年，已知某年這3個周期的某一峰值分別是當年的第p、e、i天，問從第d天開始到最近一個滿足3個周期都達到峰值的日期還有多少天。資料比較小，直接打表可過：# include <stdio.h>int tab[40][40][40]; int cal(int num){if (num <= 0) return num + 21252 ;return num ;}int main (){int p,e,i,d,T,

Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the plot of the Boss Incubator, she is trapped in a labyrinth called LOOPS.The planform of the LOOPS

歸併ac代碼為：#include <iostream>#include <fstream>using namespace std;#define MAX 500005int a[MAX], t[MAX];__int64 cnt;void Merge(int l, int mid, int r){int i = l, j = mid + 1, k = 0;while(i <= mid && j <= r) {if(a[i] > a[j])

題意：解出0-5題得分區間不同。在解題相同的同學中，分數在該解題數前一半的同學加5分。排序即可#include<iostream>#include <string>#include <algorithm>using namespace std;const int N = 110;int a[N], flag[6];typedef struct{int num, index;//char str[10];string str;}Node;Node