![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
[水题生涯]
文章平均质量分 59
wgxlovezl
这个作者很懒,什么都没留下…
展开
-
[水]20121004Finding Feasible Paths
简单模拟#include#include#include#include#include#include#include#include#include#define inf (1ull<<63)-1#define N 100005#define maxn 100005#define pb(a) push_back(a)#define mem原创 2012-10-04 10:14:18 · 352 阅读 · 0 评论 -
2012天津热身赛
1-2分别测C++,JAVA数据题3.类似田忌赛马题目,给出两组马的能力值,问是否能通过安排对战顺序让两人胜利的次数一样。水题,YY一下就过了。#include#include#include#include#include#include#include#include#include#define inf (1ull<<63)-1#defin原创 2012-10-20 19:01:35 · 1694 阅读 · 0 评论 -
[HDU4438][TJ08H]Hunters
#include#includeusing namespace std;double n,m;int main(){ int T,i,j,k; double p,q; cin>>T; while (T--) { cin>>n>>m>>p>>q; double sum1,sum2;原创 2012-10-26 11:43:27 · 2324 阅读 · 0 评论 -
[HDU4431][TJ01A]Mahjong
#include#include#include#include#include#include#include#includeusing namespace std;int n,m;sett;int mn[50],mx[50];bool check(){ int i,j; for (j=1;j<38;j++) { if (j%原创 2012-10-26 10:50:40 · 398 阅读 · 0 评论 -
[HDU4432][TJ02B]Sum of divisors
#include#include#include#include#include#include#include#include#include#define inf (1ull<<63)-1#define N 100005#define maxn 100005#define pb(a) push_back(a)#define mem(a,b)原创 2012-10-26 11:50:04 · 342 阅读 · 0 评论