原创 hdu 5135__Little Zu Chongzhi's Triangles
Little Zu Chongzhi's Triangles Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) T
2020-02-21 20:06:03
原创 hdu 5131__Song Jiang's rank list
Song Jiang's rank list Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Sub
2020-02-21 20:06:03
原创 hdu 5119__Happy Matt Friends
Happy Matt Friends Time Limit: 6000/6000 MS (Java/Others) Memory Limit: 510000/510000 K (Java/Others) Total Submiss
2020-02-21 20:06:03
原创 hdu5475__An easy problem(線段樹單點更新)
An easy problem Time Limit: 8000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s
2020-02-21 20:06:03
原创 rust實現Fibonacci數列
for循環實現 fn main() { let mut v = vec![1,1]; let n = 12; for i in 2..n { let tmp = v[(i-1) as usize
2019-03-19 20:32:01
3
原创 Codeforces 505B __Mr. Kitayuta's Colorful Graph(floyd)
B. Mr. Kitayuta's Colorful Graph time limit per test 1 second memory limit per test 256 megabytes input sta
2018-08-25 08:13:30
2
原创 UVA 12291 Polyomino Composer
1.若sma(small中‘*’的個數)!=lar(large中'*'的個數)，必不成立。 2.求出small的有效長height寬width，然後枚舉i(0~n-height),j(0~n-width)，找出第一個與small匹配的位置
2018-08-25 08:13:30
3
原创 hdu 5651
xiaoxin juju needs help Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Subm
2018-08-25 08:13:30
原创 hdu 1087
Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) To
2018-08-25 08:13:30
原创 Codeforces 710C_Magic Odd Square(構造)
C. Magic Odd Square time limit per test 1 second memory limit per test 256 megabytes input standard input outp
2018-08-25 08:13:29
原创 hdu 5115__Dire Wolf
Dire Wolf Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 1
2018-08-25 08:13:29
3
原创 hdu 5596__GTW likes gt
GTW likes gt Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s)
2018-08-25 08:13:29
原创 POJ3295
/*********************************** Problem: 3295 User: 626478972 Memory: 212K Time: 16MS Language: C++ Result: Acc
2018-08-25 08:13:29
原创 POJ 1860 最短路
Bellman Ford可以求是否存在負權迴路，我們把他改成求正權迴路。 #include <cstdio> #include <cstring> #include <algorithm> #include <queue> #incl
2018-08-25 08:13:29
原创 POJ2586
#include <cstdio> #include <cstring> #include <algorithm> #include <queue> #include <cmath> #include <set> #include <io
2018-08-25 08:13:29
1