上一页 1 2 3 4 5 6 7 ··· 13 下一页
摘要: 关于产生随机数的方法,网上有很多介绍,这里把自己学会的一种拿出来记录下。必备的头文件: # include # includesrand((unsigned)time(NULL));产生[a,b]内的随机数,其实可以通过rand()%(b-a+1)+a;# include# include# inc... 阅读全文
posted @ 2015-08-24 11:08 BYYB_0506 阅读(443) 评论(0) 推荐(0) 编辑
摘要: 数据归一化有两种常用的方法,我们在处理很多大范围的数据的时候,往往需要数据归一化。1.min-max标准化 这种归一化的方法是说, 对于任意一个给定的数列a[i],利用a[i]-min/(max-min)的方法既可以消除因为数据的量纲问题所带来的不能进行多种数据共同分析的缺陷。2.Z-score标... 阅读全文
posted @ 2015-08-22 20:05 BYYB_0506 阅读(1779) 评论(0) 推荐(0) 编辑
摘要: A very big corporation is developing its corporative network. In the beginning each of the N enterprisesof the corporation, numerated from 1 to N, org... 阅读全文
posted @ 2015-08-19 17:51 BYYB_0506 阅读(579) 评论(0) 推荐(0) 编辑
摘要: A secret service developed a new kind of explosive that attain its volatile property only when a speci cassociation of products occurs. Each product i... 阅读全文
posted @ 2015-08-19 17:12 BYYB_0506 阅读(285) 评论(0) 推荐(0) 编辑
摘要: A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensordata, Internet traffic, nancial tickers, on-line auc... 阅读全文
posted @ 2015-08-19 16:45 BYYB_0506 阅读(254) 评论(0) 推荐(0) 编辑
摘要: InputThere are several test cases. The rst line of each test case contains two integers n, m (1  n;m 100; 000), the number of elements in the array... 阅读全文
posted @ 2015-08-19 15:20 BYYB_0506 阅读(167) 评论(0) 推荐(0) 编辑
摘要: InputThere are several test cases. Each test case begins with a line containing a single integer n (1  n 1000). Each of the next n lines is either a... 阅读全文
posted @ 2015-08-19 14:12 BYYB_0506 阅读(171) 评论(0) 推荐(0) 编辑
摘要: D - BillboardCrawling in process... Crawling failed Time Limit:8000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 279... 阅读全文
posted @ 2015-08-19 11:39 BYYB_0506 阅读(164) 评论(0) 推荐(0) 编辑
摘要: C - Minimum Inversion NumberCrawling in process... Crawling failed Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status P... 阅读全文
posted @ 2015-08-19 01:30 BYYB_0506 阅读(198) 评论(0) 推荐(0) 编辑
摘要: 好久没来写blog了,不能颓了。这道题的数据范围很小,n#include#include#includeusing namespace std;int num[100], n;string s;int gcd(int a, int b){ return b ? gcd(b, a % b) : ... 阅读全文
posted @ 2015-08-17 12:16 BYYB_0506 阅读(273) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 ··· 13 下一页