摘要：
题目 ：Problem DescriptionNew semester is coming, and DuoDuo has to go to school tomorrow. She decides to have fun tonight and will be very busy after tonight. She like watch cartoon very much. So she wants her uncle to buy some movies and watch with her tonight. Her grandfather gave them L minutes to 阅读全文
摘要：
题目：Problem DescriptionClaire and her little friend, ykwd, are travelling in Shevchenko's Park! The park is beautiful - but large, indeed. N feature spots in the park are connected by exactly (N-1) undirected paths, and Claire is too tired to visit all of them. After consideration, she decides to 阅读全文
摘要：
题目：Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 2 #include 3 using namespace std; 4 5 int dp[105][105],map[105][105]; 6 int n,k,sum; 7 8 int dfs( int x, int y ) { 9 10 if(... 阅读全文