![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
水题
ACM__dongsheng
在校大学生
展开
-
hdu 2058 The sum problem
The sum problem Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 20343 Accepted Submission(s): 5979Problem DescriptionGiven a sequence 1,2,3原创 2016-01-13 19:14:11 · 88 阅读 · 0 评论 -
hdu1379DNA Sorting
Problem Description One measure of unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequenceDAABEC”, this me原创 2016-04-08 20:35:18 · 693 阅读 · 0 评论 -
hdu1390Binary Numbers
Problem Description Given a positive integer n, find the positions of all 1’s in its binary representation. The position of the least significant bit is 0.ExampleThe positions of 1’s in the binary rep原创 2016-04-09 17:14:16 · 448 阅读 · 0 评论 -
hdu 5944
rfgsf原创 2016-10-30 21:04:41 · 437 阅读 · 0 评论 -
萌萌哒的第一题
DESCRIPTION有一批n个数据需要通过rpc调用获取信息,为了加快速度,我们想要把n个数据平均分成若干份,每份的数据量为x(x可以整除n),假设一次rpc调用所需要的时间为a+b*x^2(其中a、b为常数),那么当给出a、b和n的时候,请求出一个x使得总时间最少,若有多个x满足,请输出最小的x。INPUT 输入数据包含多组数据(<=15)。 每一组只有一行三个整数a、b(1 <= a, b原创 2017-03-04 21:20:04 · 381 阅读 · 0 评论 -
B. Not Afraid
x 和 -x 同时存在否#include <bits\stdc++.h>using namespace std;int mark[10005][2];int main(){ int n,m;scanf("%d%d",&n,&m); int flag = 1; for(int i=0;i<m;i++){ for(int j=1;j<=n;j++) {原创 2017-03-24 02:06:38 · 610 阅读 · 0 评论