其他

Doing Homework againTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4511    Accepted Submission(s): 2645Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has

Encoded BarcodesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1167    Accepted Submission(s): 402Problem DescriptionAll the big malls need a powerful system for the products retrieval. Now

Count the stringTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3002    Accepted Submission(s): 1397Problem DescriptionIt is well known that AekdyCoin is good at string problems as well as

Flying to the MarsTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8081    Accepted Submission(s): 2618Problem DescriptionIn the year 8888, the Earth is ruled by the PPF Empire . As the

Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1729    Accepted Submission(s): 755Problem DescriptionCC always becomes very depressed at the end of this month, he has checked

Wild WordsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4377 Accepted: 1142DescriptionA word is a string of lowercases. A word pattern is a string of lowercases, '?'s and '*'s. In a pattern, a '?' matches any single lowercase, and a '*'

剪花布條Problem

Surround the TreesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6007    Accepted Submission(s): 2261Problem DescriptionThere are a lot of trees in an area. A peasant wants to buy a rope to

Phone ListTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19045 Accepted: 6016DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let's say the phone catalogue

Hardwood SpeciesTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 15439 Accepted: 6190DescriptionHardwoods are the botanical group of trees that have broad leaves, produce a fruit or nut, and generally go dormant in the winter. America's

A Star not a Tree?Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2991 Accepted: 1533DescriptionLuke wants to upgrade his home computer network from 10mbs to 100mbs. His existing network uses 10base2 (coaxial) cables that allow you to

Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9735 Accepted: 4670DescriptionThe little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their

這個題目算是比較簡單的題目，但是過的人不是很多，AC率也不是很高，主要是這個問題要注意和多細節，卡精度倒也沒那麼嚴格1、如果矩形的四個頂點到圓心的距離全部大於半徑，那麼顯然不會相交（很多人都死在這裡）2、把圓圓心按照矩形的邊滾一圈，圓所覆蓋的地區，只要圓心在這個地區內部就符合相交的條件具體判斷見下面代碼三種情況，離橫邊距離，豎邊距離，和四個頂點的距離#include <iostream>#include <string.h>#include <stdio.h>

Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1658    Accepted Submission(s): 605Problem DescriptionHomer: Marge, I just figured out a way to discover some of the

這個題目誰要是在比賽的時候沒出，後來肯定後悔死了首先題目意思很簡單，就是讓你去掉圖中最少邊數，讓整個圖中任意兩點之間的距離是偶數也就是圖不存在奇圈這個很容易想到二部圖，考慮到資料量很小，那麼現在就可以枚舉，怎麼枚舉呢，把整個圖枚舉分成兩部分然後去除同一集合裡面的連邊，這裡枚舉是用二進位枚舉，0代表一個集合，1代表一個集合，然後遍曆所有的邊，如果邊的兩個端點在一個集合內，那麼直接去除，選最小的這裡得到一個教訓

最大子矩陣Time Limit: 30000/10000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2249    Accepted Submission(s): 1139Problem

Wooden SticksTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9018    Accepted Submission(s): 3680Problem DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are

這個題目只要想是歐拉通路那麼基本上就搞定了判斷偶拉通路就是度為奇數的點為0個或者2個用trie樹來做檢索為顏色編號工作然後用並查集判斷一是否聯通就基本上沒問題了！#include <iostream>#include <stdio.h>#include <string.h>using namespace std;struct trie{ trie *next[26]; int num; int singial;//標號}re_root,po[

EntropyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3150    Accepted Submission(s): 1207Problem DescriptionAn entropy encoder is a data encoding method that achieves lossless data

最長迴文Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5319    Accepted Submission(s): 1815Problem Description給出一個只由小寫英文字元a,b,c...y,z組成的字串S,求S中最長迴文串的長度.迴文就是正反讀都是一樣的字串,如aba,