其他

http://pat.zju.edu.cn/contests/pat-a-practise/1013 It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately

http://pat.zju.edu.cn/contests/pat-a-practise/1055 Forbes magazine publishes every year its list of billionaires based on the annual ranking of the world's wealthiest people. Now you are supposed to simulate this job, but concentrate only on

http://pat.zju.edu.cn/contests/pat-a-practise/1007 Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 <= i <= j <= K. The Maximum Subsequence 

電腦不能直接理解進階語言,只能直接理解機器語言,所以必須要把進階語言翻譯成機器語言,電腦才能執行進階語言編寫的程式. 翻譯的方式有兩種：一個是編譯，一個是解釋。 編譯型語言寫的程式執行之前，需要一個專門的編譯過程，把程式編譯成為機器語言的檔案，以後要啟動並執行話就不用重複翻譯了，直接使用編譯的結果就行了。程式執行效率高，依賴編譯器，跨平台性差些。如C、C++、Delphi等。

http://pat.zju.edu.cn/contests/pat-a-practise/1003 As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each

http://pat.zju.edu.cn/contests/pat-a-practise/1069 For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decreasing order, a new number can be

http://ac.jobdu.com/problem.php?pid=1451 題目描述： 大家常常感慨，要做好一件事情真的不容易，確實，失敗比成功容易多了。 做好“一件”事情尚且不易，若想永遠成功而總從不失敗，那更是難上加難了，就像花錢總是比掙錢容易的道理一樣。

http://www.patest.cn/contests/mooc-ds/02-1 Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K = 3, then you must output 3→2→1→6→5→4; if K =

輸入r，h，求圓柱體的表面積，保留3位小數 #include <stdio.h>#include <math.h>int main(){const double pi = 4.0 * atan(1.0);double r, h, s1, s2, s;scanf("%lf%lf", &r, &h);s1 = pi*r*r;s2 = 2*pi*r*h;s = s1*2.0 + s2;printf("Area = %.3lf\n", s);return 0;

原文連結 程式員你工資拖後腿了麼 發布時間：2017-06-05 10:33:13 370人關注 10人蔘與 最近全國各地平均工資資料公布，IT產業的平均工資排行各行業門類首位，16年程式員們創造了平均工資122478元的貢獻，然而好像跟我的工資並沒有什麼關係，感覺再一次拖了國家後腿. 現在好多親朋好友一回去就問你幹啥的，你說程式員，結婚沒，生二胎沒，你說養不起，程式員工資多高怕啥。 然而看了上圖，我想不僅僅是我拖了後腿，還是有小夥伴陪著我的

題目描述：     求任意兩個不同進位非負整數的轉換（2進位～16進位），所給整數在long所能表達的範圍之內。     不同進位的表示符號為（0，1，...，9，a，b，...，f）或者（0，1，...，9，A，B，...，F）。 輸入：     輸入只有一行，包含三個整數a，n，b。a表示其後的n 是a進位整數，b表示欲將a進位整數n轉換成b進位整數。a，b是十進位整數，2 =<

時間限制 400 ms 記憶體限制 65536 kB 代碼長度限制 8000 B 判題程式 Standard 作者 CHEN, Yue

http://www.patest.cn/contests/mooc-ds/01-1 給定K個整數組成的序列{ N1, N2, ..., NK }，“連續子列”被定義為{ Ni, Ni+1, ..., Nj }，其中 1 <= i <= j <= K。“最大子列和”則被定義為所有連續子列元素的和中最大者。例如給定序列{ -2, 11, -4, 13, -5, -2 }，其連續子列{ 11, -4, 13

本場 Chat 主要介紹北美求職流程與趨勢。 矽谷面試流程 矽谷最受歡迎的公司與職業 矽谷 offer 能給多少 & 生活成本有多大 如何拿到面試 以作者最近求職經驗為例，介紹微軟、Facebook、Apple、Google、LinkedIn、airbnb各自面試特點 如何刷題 閱讀全文: http://gitbook.cn/gitchat/activity/5a1103271d527635a5671978

http://pat.zju.edu.cn/contests/pat-a-practise/1038 Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given {32, 321, 3214, 0229, 87}, we can recover many numbers such like 32-321-3214-02

如果一個矩陣每一行每一列都嚴格單調遞增，我們稱該矩陣為楊氏矩陣（Young Tableau）。對於楊氏矩陣(a[m][ n])，通常會涉及兩個問題：(1) 怎樣在楊氏矩陣中尋找某個元素X。(2) 怎樣在楊氏矩陣找第k大的數。 2. 解決方案 楊氏矩陣是一種非常巧妙的資料結構，它既可以用來當堆，又可以用來當做平衡樹。 (1) 問題1求解 【方案一】 <二分尋找>

http://pat.zju.edu.cn/contests/pat-a-practise/1082 Given an integer with no more than 9 digits, you are supposed to read it in the traditional Chinese way. Output "Fu" first if it is negative. For example, -123456789 is read as "Fu yi Yi er

1084. Broken Keyboard (20) 時間限制 200 ms 記憶體限制 32000 kB 代碼長度限制 16000 B 判題程式 Standard

http://pat.zju.edu.cn/contests/pat-a-practise/1031 Given any string of N (>=5) characters, you are asked to form the characters into the shape of U. For example, "helloworld" can be printed as: h de ll rlowo That is, the characters

http://pat.zju.edu.cn/contests/pat-a-practise/1010 Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is "yes", if 6 is a decimal number and 110 is a binary number. Now for any pair of