經濟指標 -- 消費與通貨膨脹循環

《獵豹財務長投資羅盤》



複習一下消費與通貨膨脹循環。有兩個循環：

(1) 存貨水準 => 工業生產指數 => 製造業每週工時 + 申請失業救濟金 => 個人所得 => 消費者信心指數 => 零售銷售金額 => 存貨/銷售比率

(2) 存貨水準 => 工業生產指數 => 生產者信心指數 (PPI) => 消費者物價指數 (CPI) => 消費者信心指數



(A) 個人所得

• U.S. Bureau of Labor Statistics: Home > Subject Areas > Current Employment Statistics > Average hourly and weekly earnings of all employees on private nonfarm payrolls by industry sector, seasonally adjusted > Employment, Hours, and Earnings from the Current Employment Statistics survey ((National))

(B) 消費者信心指數

• University of Michigan Consumer Sentiment Index
• The Conference Board: The Conference Board Consumer Confidence Index®
• 台灣經濟發展研究中心：消費者信心指數
• 台灣綜合研究院：消費者信心指數調查報告

(C) 零售銷售金額

• Department of Commerce: Home › Economic Indicators › Advance Monthly Sales for Retail and Food Services › Advance Monthly Sales for Retail and Food Services

(D) 存貨/銷售比率、存貨水準

• Department of Commerce: Home › Economic Indicators › Monthly Wholesale Trade › Monthly Wholesale Trade
• 歷史資料：http://www.census.gov/wholesale/

(E) 工業生產指數

• http://www.federalreserve.gov/releases/g17/current
• http://research.stlouisfed.org/fred2/series/INDPRO

(F) 製造業每週工時

• U.S. Bureau of Labor Statistics: Home > Subject Areas > Current Employment Statistics > Average weekly hours and overtime of all employees on private nonfarm payrolls by industry sector, seasonally adjusted

(G) 申請失業救濟金

• Unemployment Insurance, Employment & Training Administration (ETA) - U.S. Department of Labor: http://www.ows.doleta.gov/unemploy/claims_arch.asp
• 歷史：http://www.ows.doleta.gov/unemploy/claims.asp (N.S.A = Not Seasonally Adjusted，S.F = Seasonal Factor，S.A = Seasonal Adjusted)

(H) PPI

• U.S. Bureau of Labor Statistics: http://www.bls.gov/ppi/

(I) CPI

• U.S. Bureau of Labor Statistics: http://www.bls.gov/cpi/
• St. Louis Fed: http://research.stlouisfed.org/fred2/series/CPIAUCSL?cid=9
• 行政院主計處: 首頁 > 出版品 > 統計電子書 > 物價指數

好玩的解題網站

UVa Online Judge: http://uva.onlinejudge.org/

Project Euler: http://projecteuler.net 數學大傷腦

ROSALIND: http://rosalind.info/ 生物資訊演算法也傷腦

Codeforces: http://codeforces.com 有解答跟測資可以參考，相當實用，不像 UVaOJ 大黑箱。

Project Euler -- Solved 59 out of 434 problems

終於進入 Level 2 了。

越寫越覺得討厭純暴力法找答案，這會破壞純潔的數學感。

Problem 37 蠻有趣的，這可以純粹靠紙筆把答案找出來，很神奇。

UVa Online Judge -- 500 Accepted

My Account: http://uhunt.felix-halim.net/id/31623

Source Codes (including WA, RE, SE): https://bitbucket.org/Menggen/uva/src

World RanklistShow: above [ 10 | 20 | 50 | 100 ]; below [ 10 | 20 | 50 | 100 ]
Rank	Name	Username	AC	Subs	2d	7d	31d	3m	1y
612	Anis CUET	anis_cuet016	504	1734	-	-	-	-	-
613	PG tsai	smartPG	504	1950	-	-	-	-	1
614	郭志孝 Taiwan 南實踐	David_kuo	504	2473	-	-	-	-	147
615	Kogle	Kogle	504	3551	-	-	-	-	-
616	Mohammad Rakibul Haider	rhr	503	1435	-	-	-	-	164
617	hanting chiang	y790930	503	2006	-	-	-	4	8
618	CFIS TEAM	--- ? ---	502	628	-	-	-	-	-
619	Zheng Ruan	RuanZheng	502	1450	-	-	-	-	-
620	Persephone	medusa	501	896	-	-	-	2	116
621	Stormbind	stormbind	501	1598	-	-	-	-	2
622	Meng-Gen, Tsai	ChopinPlover	500	837	12	42	141	500	500
623	Carlos Eduardo Atencio Torres	caratos	500	1351	-	-	-	-	43
624	Joseph Wen	wenjoseph	500	1537	-	-	-	-	-
625	HSIG Team - UFPE	--- ? ---	498	949	-	-	-	-	-
626	shovon	shovonshovo	498	1448	-	-	-	-	34
627	Sitesh Shrivastava	SITZ	498	1672	-	-	-	-	-
628	Wang Hong	--- ? ---	497	1678	-	-	-	-	-
629	Shahidul Islam (SUST)	Sumon2001	497	1973	-	-	-	-	-
630	Mr. Even	--- ? ---	497	2950	-	-	-	-	-
631	Ranjai Banerji	ranban282	496	1354	-	-	-	-	-
632	Andre Raul Quispesaravia Ildefonso	4ndrr3	496	1357	-	-	1	3	10

終於突破 500 ACCEPTED 障礙。

最後用 string processing 衝關，處理字串真的要很有耐心。

UVa 12478 -- Hardest Problem Ever (Easy)

Problem ((PDF file))

懶得寫程式，直接把可能答案試一次

RAKIBUL
ANINDYA
MOSHIUR
SHIPLU
KABIR
SUNNY
OBAIDA
WASI

第五次會成功，所以會吃到 4個 WA。

UVa 12101 -- Prime Path

Problem: Link

老梗，建質數表，接著仿 UVa 429 - Word Transformation 概念，

利用 BFS 找最短路徑。



另一題比較有意思的是 UVa 10491，傳說中違反直覺的三門問題。



今天總算進前700名，還有一段辛苦的路要走。

World RanklistShow: above [ 10 | 20 | 50 | 100 ]; below [ 10 | 20 | 50 | 100 ]
Rank	Name	Username	AC	Subs	2d	7d	31d	3m	1y
682	National University	--- ? ---	473	2785	-	-	-	-	-
683	Tamim Shahriar Subeen ( SUST )	--- ? ---	472	1120	-	-	-	-	-
684	Bruno Adami	Brunooo	472	2135	-	-	-	1	60
685	Ashiqur Rahman	_ashik	470	1039	3	8	19	27	116
686	Izone Kochi (	--- ? ---	469	914	-	-	-	-	-
687	Sieve of Kabir	--- ? ---	469	1237	-	-	-	-	-
688	Tomislav Grbin	tgrbin	469	1694	-	-	-	-	-
689	Kh. Tafiqul Islam	Rashad	468	1173	-	-	-	-	3
690	Shih-Chia Cheng	--- ? ---	468	1608	-	-	-	-	-
691	Simon Gog	--- ? ---	468	1968	-	-	-	-	-
692	Meng-Gen, Tsai	ChopinPlover	467	778	9	22	133	467	467
693	Juergen Werner	Wernie	467	955	-	-	-	-	-
694	Henry	MingHengTsai	467	1955	-	-	-	-	-
695	Ngô Hoàng Anh Phúc	nhap96	467	2155	-	1	5	5	20
696	Lại Mạnh Tuấn	laituanksa245	466	1221	-	-	-	-	370
697	Gaurav Kumar	fR0DDY	465	849	-	-	1	2	24
698	shoaib muhammad	shoaibo1o1	465	1214	-	-	20	63	465
699	Alva Thomson	alvathNg	465	1274	-	2	19	29	305
700	Md. Kamruzzaman	--- ? ---	465	1751	-	-	-	-	-
701	Justice League	jlgansito	463	819	-	-	-	2	159
702	Standia, Liu	standia	463	861	-	-	-	-	-

Dynamic Programming -- UVa 10003

UVa 10003: Cutting Sticks

Recursive + Memoization = Top-Down Dynamic Programming

Accepted Code:

int Cut(int left, int right)
{
    if (!visited[left][right])
    {
        int cost = 1 << 30;
        for (int i = left + 1; i < right; i++)
        {
            cost = minimum(cost, 
                Cut(left, i) + Cut(i, right) + (coord[right] - coord[left]));
        }
        memoization_cut[left][right] = cost;
        visited[left][right] = true;
    }
    return memoization_cut[left][right];
}