![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
水题
sunbaofeng2
这个作者很懒,什么都没留下…
展开
-
uva993 - Product of digits-------------水题 1A
#include #include #include #include #include #include #define N 105using namespace std;int n;int a[10];int main(){// freopen("ex.in","r",stdin); int t; scanf("%d",&t); while原创 2012-09-03 15:07:09 · 512 阅读 · 0 评论 -
10397 - Connect the Campus--最短路1AC
#include#include#include#include#include#include#include #include#include#include#define LL long long#define inf 0x7fffffff#define E 1e-9#define M 100#define N 751using namespace std;s原创 2012-10-12 17:21:14 · 478 阅读 · 0 评论 -
567 Risk---------模板题1A
#include#include#include#include#include#include#include #include#include#include#define LL long long#define inf 0x7fffffff#define E 1e-9#define M 100#define N 21using namespace std;i原创 2012-10-12 19:17:52 · 476 阅读 · 0 评论 -
uva11995--水题(训练指南)
#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x7fffffff#define exp 1e-9#define M 100#define N 105usi原创 2013-03-06 19:47:54 · 702 阅读 · 0 评论 -
699 - The Falling Leaves---递归
#include #include #include #include #include #include #define N 100using namespace std;int a[N*2];void build(int value ,int w){ int n; a[w]+=value; scanf("%d",&n); if(n!=-1原创 2012-08-10 19:36:40 · 366 阅读 · 0 评论 -
uva10487 - Closest Sums
凑就行!#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x7fffffff#define eps 1e-7#define M 105#define N 13000usin原创 2013-03-27 16:49:46 · 598 阅读 · 0 评论 -
uva 10026 - Shoemaker's Problem
#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x7fffffff#define eps 1e-7#define M 105#define N 1010using names原创 2013-03-27 17:30:37 · 533 阅读 · 0 评论 -
UVa 10670 - Work Reduction(水)
#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define UI unsigned int#define inf 0x7fffffff#define eps 1e-7#define M 105#d原创 2013-03-27 21:50:57 · 623 阅读 · 0 评论 -
HDU 4691(后缀数组+lcp)水题
#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define inf 0x7fffffff#define exp 1e-9#define N 100009using namespace std;in原创 2013-08-20 20:06:51 · 826 阅读 · 0 评论 -
hdu4651(定理题-水)
欧拉函数的倒数是分割函数的母函数,亦即:的生成函数是 (1)再利用五边形数定理可得到以下的展开式: (2)将(2)式带入(1)式,并乘到(1)式的左边,进行展开,合并同类项,根据非常数项的系数为0!!即将生成函数配合五边形数定理,可以得到以下的递归关系式#include#include#include原创 2013-08-11 21:16:25 · 723 阅读 · 0 评论 -
10056 - What is the Probability --水题
#include#include#include#include#include#include#include #define inf 0x7fffffff#define N 10000#define MIN 1e-6//至少是6,5的话就错了!#define M 100#define LL long longusing namespace std;//int n,k,原创 2012-09-18 22:02:57 · 695 阅读 · 0 评论 -
10132 - File Fragmentation------水题
#include#include#include#include#include#include#include #define inf 0x7fffffff#define N 300#define MIN 1e-11#define M 10000#define LL long longusing namespace std;int n,k,h,t,nn;int len原创 2012-09-11 15:28:50 · 421 阅读 · 0 评论 -
311 Packets
#include #include #include #include #include #include #define N 7using namespace std;int n;int a[N];int temp[5]= {0,1,3,5,9};int l[3];int main(){// int t;// scanf("%d",&t);原创 2012-09-03 16:11:14 · 424 阅读 · 0 评论 -
10954 Add All------------水题
#include #include #include #include #include #include #include #define N 100000using namespace std;int n;int a[N];int cmp(const void *a,const void *b){ return *(int*)a-*(int*)b;}int原创 2012-09-03 20:45:07 · 475 阅读 · 0 评论 -
10400 - Game Show Math------水题
#include#include#include#include#include#include#include #define N 105#define MIN 1e-11#define M 32010#define MM 70000using namespace std;int a[N];int s[N];int v[N][MM];//MM粗心忘了,wa!!!in原创 2012-09-08 23:18:33 · 471 阅读 · 0 评论 -
UVA_10716 - Evil Straw Warts Live-------水题(模拟)
#include#include#include#include#include#include#include #define inf 0x7fffffff#define N 1000#define MIN 1e-11#define M 10001#define MM 20020#define LL long longusing namespace std;int n原创 2012-09-10 08:31:39 · 643 阅读 · 0 评论 -
10245 - The Closest Pair ----------水题--二分
#include#include#include#include#include#include#include #define inf 0x7fffffff#define N 10001#define MIN 1e-11#define M 10000#define LL long longusing namespace std;int n,t,k;struct poi原创 2012-09-10 09:24:09 · 409 阅读 · 0 评论 -
10308 - Roads in the North--不好!
#include#include#include#include#include#include #include#include#define LL long long#define inf 0x7fffffff#define E 1e-9#define M 100#define N 10010using namespace std;int maxv,len[N][N原创 2012-09-26 20:40:10 · 550 阅读 · 0 评论 -
10057 - A mid-summer night's
#include#include#include#include#include#include#include #define N 1000000#define MIN 1e-11#define M 32010#define MM 70000using namespace std;int n,t;int a[N];int cmp(const void *a,const原创 2012-09-09 17:15:19 · 875 阅读 · 0 评论 -
357 - Let Me Count The Ways---水题--数据类型long long
#include#include#include#include#include#include#include #define inf 0x7fffffff#define N 30005#define MIN 1e-11#define M 10000#define LL long longusing namespace std;int n,k,h,t,m;int my原创 2012-09-11 16:09:39 · 435 阅读 · 0 评论 -
825 - Walking on the Safe Side------水题(注意输入方式)
在输入上WA了很多遍,主要是因为两个数之间可能隔了不止一个空格,之前全都按照一个空格来算的。#include#include#include#include#include#include#include #define inf 0x7fffffff#define N 105#define MIN 1e-11#define M 10000#define LL lo原创 2012-09-11 17:42:50 · 468 阅读 · 0 评论 -
hdu(4655-打表找规律)
#include#include#include#include#include#include#include#include#include#include#include#include#define tree int o,int l,int r#define lson o<<1,l,mid#define rson o<<1|1,mid+1,r#define l原创 2013-08-12 09:25:23 · 719 阅读 · 0 评论