Untitled Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 774 Accepted Submission(s): 423 Problem Description There is an integer a and n i
比赛的时候过了两道,第三道超时20分钟过得 A题简单,我用了17分钟才写出来,看了界面熊大大的status,四分钟,直接把我吓傻,看了他的代码才知道,与大大之间的差距有多大: #include <iostream>#include <cstdio>#include <cmath>#include <cstring>#define LL long long#define pir pir
//// main.cpp// HDU 4857 拓扑排序//// Created by 郑喆君 on 8/9/14.// Copyright (c) 2014 itcast. All rights reserved.//#include<cstdio>#include<cstring>#include<iostream>#include<iomanip>#includ
比赛链接:http://bestcoder.hdu.edu.cn/contests/contest_show.php?cid=608 Senior's Array Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 888 Ac
比赛链接:http://bestcoder.hdu.edu.cn/contests/contest_show.php?cid=604 Dylans loves numbers Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s):
Problem Description John has several lines. The lines are covered on the X axis. Let A is a point which is covered by the most lines. John wants to know how many lines cover A. Input
第一题: sum sum Accepts: 640 Submissions: 1744 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) 问题描述 给定一个数列,求是否存在连续子列和为m的倍数,存在输出YES,否则输出NO 输入描述 输入文件的第一行有一个正整数T(1
转载自: http://www.kuangbin.net/archives/hdu4910 慢慢学习. HDU 4910 Problem about GCD 求小于等于 N 的与N互质的所有数的乘积MOD N Problem about GCD Time Limit: 2000/1000 MS (Java/Others) Memory Limi