heaventouch

摘要： find the nth digitTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7403Accepted Submission(s): 2120Problem Description假设：S1 = 1S2 = 12S3 = 123S4 = 1234.........S9 = 123456789S10 = 1234567891S11 = 12345678912............S18 = 123456789123456789...... 阅读全文

摘要： Can you find it?Time Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 8506Accepted Submission(s): 2216Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three number 阅读全文

摘要： Strange fuctionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2278Accepted Submission(s): 1697Problem DescriptionNow, here is a fuction:F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 15 #define e 1e-716 double fac(double a,double b)17 {18 return 6*a*... 阅读全文

摘要： Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5999Accepted Submission(s): 2828Problem DescriptionNow,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100;Now please try yo 阅读全文

摘要： Watch The MovieTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 4613Accepted Submission(s): 1456Problem 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. 阅读全文

摘要： 饭卡Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8047Accepted Submission(s): 2749Problem Description电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格以及卡 阅读全文

摘要： ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3215Accepted Submission(s): 1670Problem DescriptionACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different co 阅读全文

摘要： Cyclic TourTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/65535 K (Java/Others)Total Submission(s): 1197Accepted Submission(s): 626Problem DescriptionThere are N cities in our country, and M one-way roads connecting them. Now Little Tom wants to make several cyclic tours, which satisfy th 阅读全文

摘要： I love sneakers!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3265Accepted Submission(s): 1337Problem DescriptionAfter months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to spend 阅读全文

摘要： The dog taskTime Limit:1000MSMemory Limit:10000KTotal Submissions:2559Accepted:1038Special JudgeDescriptionHunter Bob often walks with his dog Ralph. Bob walks with a constant speed and his route is a polygonal line (possibly self-intersecting) whose vertices are specified by N pairs of integers (Xi 阅读全文

摘要： Air RaidTime Limit:1000MSMemory Limit:10000KTotal Submissions:6184Accepted:3703DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you can never 阅读全文

摘要： COURSESTime Limit:1000MSMemory Limit:10000KTotal Submissions:15975Accepted:6293DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students that satisfies si 阅读全文

摘要： Muddy FieldsTime Limit:1000MSMemory Limit:65536KTotal Submissions:7340Accepted:2715DescriptionRain has pummeled the cows' field, a rectangular grid of R rows and C columns (1 14 #include15 struct node{16 int x;17 int y;18 }edge[55][55];19 char c[55][55];20 int g[1500][1500];21 int vis[1500];... 阅读全文

摘要： Treasure ExplorationTime Limit:6000MSMemory Limit:65536KTotal Submissions:6284Accepted:2533DescriptionHave you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would never kn 阅读全文

摘要： Antenna PlacementTime Limit:1000MSMemory Limit:65536KTotal Submissions:5803Accepted:2901DescriptionThe Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, is their discovery of a new, 阅读全文