原创 Oil Deposits
Oil Deposits The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. Geo
2020-02-25 11:09:20
原创 大數加法
#include<stdio.h> #include<iostream> #include<string> #include<algorithm> using namespace std; string s1,s2; string add
2020-02-25 11:09:20
原创 中序後序重建二叉樹
B - Tree Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description
2020-02-25 11:09:20
原创 Train Problem I
A - Train Problem I Time Limit:1000MS Memory Limit:32768KB
2020-02-25 11:09:20
原创 uva 10183 How many Fibs?
Problem B: How many Fibs? Recall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n
2020-02-25 11:09:10
原创 Bicoloring
G - Bicoloring Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Descripti
2020-02-25 11:09:10
原创 Knight Moves
D - Knight Moves Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Descrip
2020-02-25 11:09:10
原创 poj 2251 Dungeon Master
Dungeon Master Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16305 Accepted: 6323 Description You
2020-02-25 11:09:10
原创 大數階乘
#include<stdio.h> #include<string.h> #include<iostream> const int M = 40000; using namespace std; int f[M]; int main()
2020-02-25 11:09:10
原创 Where is the Marble?
Where is the Marble? Raju and Meena love to play with Marbles. They have got a lot of marbles with numbers writ
2020-02-25 11:09:10
原创 大數減法
</pre><pre class="cpp" name="code">#include<stdio.h> #include<iostream> #include<algorithm> #include<string> #include<m
2020-02-25 11:09:10
原创 Ordering Tasks
Description Problem F Ordering Tasks Input: standard input Output: standard output Time Limit: 1 sec
2020-02-25 11:09:10
原创 nyist 14 會場安排問題
會場安排問題 時間限制：3000 ms | 內存限制：65535 KB 難度：4 描述 學校的小禮堂每天都會有許多活動，有時間這些活動的計劃時間會發生衝突，需要選擇出一些活動進行舉辦。小劉的工作就是安排學校小禮堂的活動，每個
2018-08-24 01:23:17
原创 nyist 891 找點
找點 時間限制：2000 ms | 內存限制：65535 KB 難度：2 描述 上數學課時，老師給了LYH一些閉區間，讓他取儘量少的點，使得每個閉區間內至少有一個點。但是這幾天LYH太忙了，你們幫幫他嗎？ 輸入多組測試數
2018-08-24 01:23:17
原创 hdu 1754 I Hate It
////HDU 1754 I Hate It （線段樹模板題）更新一點的值 詢問區間最大值 #include<iostream> #include<stdio.h> #include<string.h> #define MAXX 5001
2018-08-24 01:23:16