![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
水题
WEIHAI1996
这个作者很懒,什么都没留下…
展开
-
HDOJ 1050 Moving Tables 找重叠最多的点
http://acm.hdu.edu.cn/showproblem.php?pid=1050//找重叠最多的点 #include#include#includeusing namespace std;int main(){ int T; int n; int a,b; int i,j; int c[210]; cin>>T; while(T-原创 2015-07-20 15:39:02 · 322 阅读 · 0 评论 -
HDOJ 2080 Lowest Common Multiple Plus
http://acm.hdu.edu.cn/showproblem.php?pid=2028#include#include#include#includeint main(){ int n; int i; int a[100]; int tem; while(~scanf("%d",&n)) { tem=0; for(i=1;i原创 2015-07-20 21:18:59 · 372 阅读 · 0 评论 -
HDOJ 2028 Lowest Common Multiple Plus (求n个数的最小公倍数)
http://acm.hdu.edu.cn/showproblem.php?pid=2028#include#include#include#includeint main(){ int n; int i; int a[100]; int tem; while(~scanf("%d",&n)) {原创 2015-07-22 19:01:17 · 389 阅读 · 0 评论 -
HDOJ 2502 月之数
http://acm.hdu.edu.cn/showproblem.php?pid=2502#include#include#include#includeusing namespace std;int main(){int T;int n;int i;int s;//每个数的二进制个数 int a[25];for(i=1;i{s=pow原创 2015-07-22 19:12:06 · 468 阅读 · 0 评论 -
ZOJ 1241 Geometry Made Simple
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1241#include#include#include#includeint main(){double a,b,c;double s;int i=0;while(scanf("%lf%lf%lf",&a,&b,&c),(a||原创 2015-07-22 19:16:37 · 425 阅读 · 0 评论 -
HDOJ 1200 To and Fro
http://acm.hdu.edu.cn/showproblem.php?pid=1200#include#include#include#include#includechar a[205];char b[25][205];int main(){int n;int i,j,k;int str;while(scanf("%d",&n),n)原创 2015-07-22 17:51:49 · 335 阅读 · 0 评论 -
HDOJ 2089 不要62
http://acm.hdu.edu.cn/showproblem.php?pid=2089#include#include#include#include#define N 1000000int a[N];int main(){int n,m;int i;int sum;void cmp(int i);for(i=1;i{cmp原创 2015-07-22 17:55:13 · 348 阅读 · 0 评论 -
HDOJ 1234 开门人和关门人
http://acm.hdu.edu.cn/showproblem.php?pid=1234#include#include#include#includeusing namespace std;#define N 1000struct jilu{char name[N];char s[N],e[N];}a[N];int cmp1(jilu x,原创 2015-07-22 18:43:23 · 438 阅读 · 0 评论 -
百练 2703 骑车与走路 动态数组malloc
http://bailian.openjudge.cn/practice/2703#include#include int main(){int n;int i; scanf("%d",&n);double *juli=(double *)malloc(n*sizeof(double));for(i=0;i{scanf("%lf",&juli[i原创 2015-07-22 19:19:56 · 469 阅读 · 0 评论