原创 D - Problem D. Euler Function (歐拉函數找規律)
In number theory, Euler's totient function φ(n)φ(n) counts the positive integers up to a given integer nn that are rela
原创 多校訓練賽:K - Time Zone (擴大再縮小)
Chiaki often participates in international competitive programming contests. The time zone becomes a big problem. Give
原创 ZCMU-2014: 一生之敵(數學+枚舉)
2014: 一生之敵 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 723 Solved: 116 [Submit][Status][Web Board] Description 轉存失
原创 L - Left Mouse Button (DFS)
Mine sweeper is a very popular small game in Windows operating system. The object of the game is to find mines, and mar
原创 F - Problem F. Grab The Tree (博弈)
Little Q and Little T are playing a game on a tree. There are nn vertices on the tree, labeled by 1,2,...,n1,2,...,n, c
原创 L - Problem L. Visual Cube (模擬打印圖)
Little Q likes solving math problems very much. Unluckily, however, he does not have good spatial ability. Everytime he
原创 mac os安裝Windows系統失敗後不能合併爲一個分區
本人在學校電腦醫院作志願者,經常會遇到很多人拿着mac要求裝Windows系統,這我就很無奈了呀,好好的macos不用非要用windows。那就裝吧。。。。。 其實在此之前我都很順利的將幾臺mac裝過windows,但人總有失敗的。聽我細
原创 杭電多校訓練賽:D - Distinct Values(向左排序+set維護)
Chiaki has an array of nn positive integers. You are told some facts about the array: for every two elements aiai and a
原创 多校訓練賽1:C. Triangle Partition(按關鍵詞排序?不知道)
Chiaki has 3n3n points p1,p2,…,p3n It is guaranteed that no three points are collinear. Chiaki would like to construct
原创 PAT:Stack (30)(樹狀數組+二分查找)
Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). Th
原创 數星星(樹狀數組)
Description 天文學家經常觀察星象圖。星象圖中用平面上的點來表示一顆星星,每一顆星星都有一個笛卡爾座標。設定星星的等級爲其左下角星星的總數。天文學家們想知道星星等級的分佈情況
原创 ZCMU-1127: 第三章:再見,林靜!
1127: 第三章:再見,林靜! Time Limit: 10 Sec Memory Limit: 128 MB Submit: 87 Solved: 21 [Submit][Status][Web Board] Descriptio
原创 ZCMU-2164:去註釋
2164: 去註釋 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 104 Solved: 44 [Submit][Status][Web Board] Description 給你一段C
原创 ZCMU-1040:二哥的困惑Ⅲ(貪心)
1040: 二哥的困惑 Ⅲ Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 216 Solved: 84 [Submit][Status][Web Board] Description
原创 前綴和
所謂前綴和,可以簡單歸納成一條公式,即ans[ i ] = ans[ i - 1 ] + a[ i ]; 如何理解,看例題: Description 已知兩個正整數a和b,求在a與b之間(包含a和b)的所有整數的十進制表示中1出現的次