摘要： //hdu 1695 GCD Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15816 Accepted Submission(s): 6095 阅读全文

摘要： // ACM训练联盟周赛 C. Teemo's tree problem There is an apple tree in Teemo's yard. It contains n nodes and n-1 branches, and the node 1 is always the root o 阅读全文

摘要： // hdu 6434 ( Problem I. Count ) Problem I. Count Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s 阅读全文

摘要： 1 //N！ 2 #include 3 #include 4 #include 5 #define ll long long 6 #define M 100000000 7 #define N 50000//根据数据量选择 8 using namespace std; 9 ll n; 10 ll a[N];//要用ll 11 void solve(ll n) 12 {... 阅读全文

摘要： Teemo likes to drink raspberry juice. He even spent some of his spare time tomake the raspberry juice himself. The way to make the raspberries juice i 阅读全文

摘要： Teemo has a formula and he want to calculate it quickly. The formula is . As the result may be very large, please output the result mod 1000000007. In 阅读全文

摘要： 65536K Teemo is very interested in convex polygon. There is a convex n-sides polygon, and Teemo connect every two points as diagonal lines, and he wan 阅读全文

摘要： ACM训练联盟周赛 131072K Teemo decides to use his money to conquer the universe. It is known that there are m planets that humans can reach at present. They 阅读全文

摘要： Almost Sorted Array Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 7686 Accepted Submission(s) 阅读全文

摘要： I Count Two Three Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2719 Accepted Submission(s): 11 阅读全文