2016暑期联训
mirror58229
C++ Java Python+ACM算法learning
展开
-
HDU 5753 Permutation Bo
#include using namespace std; int c[1005]; int main(){ int n; while(~scanf("%d",&n)){ double ex=0; for(int i=0;i<n;i++){ scanf("%d",&c[i]); } ex=c[0]/2.0+c[n-1]/2.0; for (int i=1;i<n-1原创 2016-07-27 21:03:25 · 353 阅读 · 0 评论 -
HDU 5761 Rower Bo
#include using namespace std; int main(){ int a,v1,v2; while(~scanf("%d%d%d",&a,&v1,&v2)){ if(a==0){ printf("%s\n","0.0000000000"); continue; } if(v1<=v2){ printf("%s\n","Infinity");原创 2016-07-27 21:10:40 · 361 阅读 · 0 评论 -
HDU 5762 Teacher Bo
#include #include #include #include using namespace std; const int N=100005; struct Point{ //定义结构体表示点 int x,y; }point[N]; int dis(Point x1,Point x2){ //计算曼哈顿距离 return abs(x1.x-x2.x)+abs(x原创 2016-07-27 21:13:56 · 283 阅读 · 0 评论 -
HDU 5793 A Boring Question(逆元+快速幂)
#include #include using namespace std; typedef long long ll; const ll N=1000000007; ll pow_mod(ll a,ll n,ll m){ //快速幂运算 if(n==0) return 1; ll x=pow_mod(a,n/2,m); ll ans=x*x%原创 2016-08-05 21:08:22 · 468 阅读 · 0 评论 -
HDU 5818 Joint Stacks(优先队列+swap)
Problem Description A stack is a data structure in which all insertions and deletions of entries are made at one end, called the "top" of the stack. The last entry which is inserted is the first on原创 2016-08-11 00:35:22 · 579 阅读 · 0 评论 -
HDU 5795 A Simple Nim(Nim游戏博弈+SG函数)
Problem Description Two players take turns picking candies from n heaps,the player who picks the last one will win the game.On each turn they can pick any number of candies which come from the same原创 2016-08-11 09:31:24 · 545 阅读 · 0 评论 -
HDU 5826 physics(公式推导+sort)
Problem Description There are n balls on a smooth horizontal straight track. The track can be considered to be a number line. The balls can be considered to be particles with the same mass. At t原创 2016-08-16 08:21:39 · 335 阅读 · 0 评论 -
HDU 5831 Rikka with Parenthesis II
Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them: Correct parentheses sequences c原创 2016-08-16 10:58:21 · 516 阅读 · 0 评论 -
HDU 5752 Sqrt Bo
#include #include #include #include #include using namespace std; string s; int main(){ while(cin>>s){ if(s.length()>10){ cout<<"TAT"<<endl; continue; } stringstream ss;原创 2016-07-27 20:35:08 · 365 阅读 · 0 评论