原创 POJ1000-A+B Problem
A+B ProblemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 446656 Accepted: 251482DescriptionCalculate a+bInp
2020-06-22 14:20:20
原创 Codeforces Round#458Div.1+2 D.Bash and a Tough Math Puzzle 區間GCD
D. Bash and a Tough Math Puzzletime limit per test2.5 secondsmemory limit per test256 megabytesinputstandard inputoutpu
2020-06-22 14:20:07
原创 HDU5726-GCD 區間GCD+二分
GCDTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4611 Acc
2020-02-20 17:30:39
原创 POJ1004-Financial Management
Financial ManagementTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 193201 Accepted: 73428DescriptionLarry gr
2020-02-20 17:30:39
原创 Codeforces Round#458Div.1+2 C.Travelling Salesman and Special Numbers 數位dp
C. Travelling Salesman and Special Numberstime limit per test1 secondmemory limit per test256 megabytesinputstandard in
2020-02-20 17:30:39
原创 POJ1002-487-3279 map應用
487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 303418 Accepted: 54259DescriptionBusinesses like to h
2020-02-20 17:30:39
原创 POJ1005-I Think I Need a Houseboat
I Think I Need a HouseboatTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 108947 Accepted: 47310DescriptionFr
2020-02-20 17:30:39
原创 模板：區間GCD
一、RMQ實現 RMQ不能實現更新。#include <iostream> #include <sstream> #include <iomanip> #include <string> #include <numeric>
2020-02-20 17:30:39
原创 模板：中國剩餘定理
一、m[]兩兩互質時 簡單證明： 必要時數據類型改爲long long#include <iostream> #include <sstream> #include <iomanip> #include <st
2020-02-20 17:30:39
原创 模板：歐幾里得 擴展歐幾里得 乘法逆元
一、歐幾里得算法 求a，b的最小公約數。int GCD(int a, int b) { int r; while (b) { r = a % b; a = b; b = r; } return a; }二
2020-02-20 17:30:39
原创 POJ1007-DNA Sorting
DNA SortingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 106816 Accepted: 42795DescriptionOne measure of ``
2020-02-20 17:30:39
原创 POJ1003-Hangover
HangoverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 132971 Accepted: 64680DescriptionHow far can you make
2020-02-20 17:30:39
原创 POJ1006-Biorhythms 中國剩餘定理
BiorhythmsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 143074 Accepted: 46000DescriptionSome people believ
2020-02-20 17:30:39
原创 機器學習筆記：正則化項
在機器學習算法中如果只使用經驗風險最小化去優化損失函數則很可能造成過擬合的問題，通常我們要在損失函數中加入一些描述模型複雜程度的正則化項，使得模型在擁有較好的預測能力的同時不會因爲模型過於複雜而產生過擬合現象，即結構風險最小化 正則化
2018-10-03 04:34:41
3
原创 TensorFlow筆記：模型的存儲和加載
tf.train.Saver類 TensorFlow中的模型存取都是通過這個類來實現的 以 my_model 爲例，存儲時會在目錄下生成四個文件，分別是 checkpoint 文件、 my_model.meta 文件、 my_mode
2018-10-03 04:34:41
2