Bus System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8055 Accepted Submission(s): 2121 Problem Description Because of the huge population of China, public transportation is very importa…
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1690 Bus System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6569 Accepted Submission(s): 1692 Problem Description Because of the huge popula…
Arbitrage Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6522 Accepted Submission(s): 3019 Problem Description Arbitrage is the use of discrepancies in currency exchange rates to transform o…
Minimum Transport Cost Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9814 Accepted Submission(s): 2641 Problem Description These are N cities in Spring country. Between each pair of cities…
变形课 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 20748 Accepted Submission(s): 7494 Problem Description 呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规…
题意:给你n个数,这些数可以互相加或者减,输出在范围[1,sum]里不能通过运算得出的数 思路:套母函数模版 #include <iostream> #include<cstdio> using namespace std; #define N 110 int a[N],c1[10010],c2[10010],v[10010]; int main(int argc, char** argv) { int n,sum,i,j,k,ans; while(scanf("%d&q…
Problem Description Because of the huge population of China, public transportation is very important. Bus is an important transportation method in traditional public transportation system. And it's still playing an important role even now. The bus sy…
Bus System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6082 Accepted Submission(s): 1560 Problem Description Because of the huge population of China, public transportation is very importa…