Poj.3100 Root of the Problem【水】 2015/09/22
The input consists of one or more pairs of values for B and N. Each pair appears on a single line, delimited by a single space. A line specifying the value zero for both B and N marks the end of the input. The value of B will be in the range 1 to 1,000,000 (inclusive), and the value of N will be in the range 1 to 9 (inclusive).
相關推薦
Poj.3100 Root of the Problem【水】 2015/09/22
The input consists of one or more pairs of values for B and N. Each pair appears on a single line, delimited by a single space. A line specifying the valu
Poj.2590 Steps【“英語題”，水】 2015/09/22
Steps Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7825 Accepted: 3600 Description One steps through integer points o
ZOJ.2835 Magic Square【水】 2015/09/23
Magic Square Time Limit: 2 Seconds Memory Limit: 65536 KB In recreational mathematics, a magic square of n-degree is an arrangem
CodeForces-3A Shortest path of the king【水題】
A. Shortest path of the king time limit per test1 second memory limit per test64 megabytes inputstandard input outputstandard output The king is left alon
HDU1010 ZOJ2110 Tempter of the Bone【DFS】
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 153873 Accepted Submission(s): 4
Hdoj.2058 The sum problem【數列】 2015/11/24
The sum problem Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19595 Accep
ZOJ.2540 Form a Square【水】 2015/10/01
Form a Square Time Limit: 2 Seconds Memory Limit: 65536 KB Have you ever put up a tent on top of a mountain? The difficulty lies
ZOJ.1577 GCD & LCM【水，暴力】 2015/09/22
GCD & LCM Time Limit: 2 Seconds Memory Limit: 65536 KB Given x and y (2 <= x <= 100,000, 2 <= y <= 1,000,000), y
ZOJ.2679 Old Bill【水】 2015/10/12
Old Bill Time Limit: 2 Seconds Memory Limit: 65536 KB Among grandfather��s papers a bill was found: 72 turkeys $_679_ The first
NYOJ 927 The partial sum problem 【DFS】+【剪枝】
har int 輸出 amp lines cmp dsm sim pri The partial sum problem 時間限制：1000 ms | 內存限制：65535 KB 難度：2 描寫敘述One day,Tom’s
1069. The Black Hole of Numbers (20)【模擬】——PAT (Advanced Level) Practise
int exce 個人 esp ack ble sam namespace constant 題目信息 1069. The Black Hole of Numbers (20) 時間限制100 ms 內存限制65536 kB 代碼長度限制1600
poj 2942 Knights of the Round Table(無向圖的雙連通分量+二分圖判定)
tac define style while ons 會議 什麽 路徑 多個 #include<cstdio> #include<cstring> #include<cmath> #include<cstdlib
poj 2942 Knights of the Round Table - Tarjan
str 畫畫 class gin signed include rec col rules Being a knight is a very attractive career: searching for the Holy Grail, saving damsels in
poj 2942 Knights of the Round Table(點雙連通分量+奇圈判定)
cst 一個 log ini ins cut insert bool ring 鏈接：https://vjudge.net/problem/POJ-2942 題意：給定一個無向圖，求出補圖，然後求補圖中有多少個點不屬於任何奇圈。 分析：首先是騎士有不能坐在一起的人，不好想
POJ 3498 March of the Penguins（網絡流+枚舉）
網絡 png col floating oge eve ext const tput 題目鏈接：http://poj.org/problem?id=3498 題目： Description Somewhere near the south pole, a numb
POJ 3083 -- Children of the Candy Corn（DFS+BFS）TLE
cin 列數 tle 圖片 逆時針 sta div ima ostream POJ 3083 -- Children of the Candy Corn（DFS+BFS） 題意: 給定一個迷宮，S是起點，E是終點，#是墻不可走，.可以走 1）先輸出左轉優先時，從S到E的步數
POJ-1426 Find The Multiple【BFS】
題目傳送門 題意： 給出一個整數n，(1 <= n <= 200)。求出任意一個它的倍數m，要求m必須只由十進位制的’0’或’1’組成。m第一個數字必須是1，且n不大於200，m不超過100個十進位制數字。 題解：BFS，M從1開始遍歷所有可能的值。不知道為什麼lo
POJ - 3083 Children of the Candy Corn
Children of the Candy Corn Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 152
POJ 3311 Hie with the Pie【狀壓DP+floyed】
題意： 將所有外賣送去所有對應地點再回到店鋪，求最短路。 分析：Floyed預處理任意兩點最小距離，然後二維狀壓(最後的結束位置要考慮，不然回到起點的距離沒辦法計算)。 dp[j+1][(1&l
Tempter of the Bone【DFS+奇偶剪枝】scanf會WA！！！
多好的一道題，交scanf會WA，cin一發過，我WA了30+次，驚是這樣的BUG，我就說我推的公式怎會錯呢！！！ （如果有字型縮小的方式，我要把上面那行縮小些，先看大家WA） 可真是一道有趣的題目，首先，有這樣的圖推出奇偶剪枝： 0 1 0 1 1 0 1 0