自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

蒻菜_羊羊羊的专栏

编程是人造的学科,而数学是神造的学科.

  • 博客(193)
  • 收藏
  • 关注

原创 机器学习实战(k-近邻算法)

给定训练数据样本和标签,对于某测试的一个样本数据,选择距离其最近的k个训练样本,这k个训练样本中所属类别最多的类即为该测试样本的预测标签。简称kNN。通常k是不大于20的整数,这里的距离一般是欧式距离。K最近邻(k-Nearest Neighbour,KNN)分类算法,是一个理论上比较成熟的方法,也是最简单的机器学习算法之一。该方法的思路是:如果一个样本在特征空间中的k个最相似(即特征

2015-11-05 15:57:21 567

原创 机器学习---预测电影类型

#coding=UTF8 from numpy import *import operatordef createDataSet(): group = array([[3,104],[2,100],[1,81],[101,10],[99,5]]) #训练集 labels = ['affectional film','affectional film','affectiona

2015-11-04 19:18:08 1363 1

转载 机器学习----梯度下降法

回归(regression)、梯度下降(gradient descent)发表于332 天前 ⁄ 技术, 科研 ⁄ 评论数 3 ⁄ 被围观 1152 次+本文由LeftNotEasy所有,发布于http://leftnoteasy.cnblogs.com。如果转载,请注明出处,在未经作者同意下将本文用于商业用途,将追究其法律责任。前言:上次写过一篇关于贝叶斯概率论的数学

2015-11-01 20:17:18 478

原创 hdu5137 How Many Maos Does the Guanxi Worth(ACM/ICPC 西安区域赛现场赛)

How Many Maos Does the Guanxi WorthTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1371    Accepted Submission(s): 510Problem Desc

2015-10-23 20:32:58 450

原创 HDU5461 Largest Point 贪心(2015acm沈阳网络赛)

Largest PointTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1274    Accepted Submission(s): 502Problem DescriptionGiven the seq

2015-10-21 09:28:54 737

原创 人工湖公路(树状数组)

是生命之源,这些大家都知道。所以但凡有水的地方都会有人。而且一般靠近江河湖海的地方人也特别的多。人工湖是一个美丽壮阔的湖,在湖的四周分布着若干个城市。由于水路并不发达,所以这些城市的交通一般都是靠陆路。每个城市只和靠其左右的两个城市建有公路。即,我们可以这么想象:湖是一个圆,在圆上分布着N个城市,编号为1~N,编号为i的城市只和编号i%N+1,(i-2+N)%N+1两个城市有公路相连。

2015-10-05 12:20:56 793 1

原创 无根树转有根树代码

#include#include#includeusing namespace std;const int maxn= 10005;int n,p[maxn];vector G[maxn];void dfs(int u,int fa) //递归转化为以u为根的子树,u的父亲为fa { int d = G[u].size(); for(int i=0;i<d;i++) //循

2015-09-21 21:24:03 504

原创 POJ3497 UVA12124 Assemble(二分 + 贪心)

AssembleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3361 Accepted: 1070DescriptionRecently your team noticed that the computer you use to practice

2015-09-21 20:06:12 476

原创 2014年 acmicpc北京区域赛题目(hdu5112 hdu5119 hdu5120 hdu5122)

A Curious MattTime Limit: 2000/2000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1071    Accepted Submission(s): 564Problem DescriptionThere is a

2015-09-07 19:01:08 865

原创 POJ3159 Candies(差分约束 PS:此题spfa+队列过不了,spfa + stack才能过)

CandiesTime Limit: 1500MS Memory Limit: 131072KTotal Submissions: 25914 Accepted: 7074DescriptionDuring the kindergarten days, flymouse was the monitor of his

2015-08-27 22:39:07 580

原创 POJ1364 King(差分约束 SPFA)

KingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11146 Accepted: 4081DescriptionOnce, in one kingdom, there was a queen and that queen was expectin

2015-08-27 21:03:23 407

原创 HDU2449 Remmarguts' Date(第k短路)

Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 24007 Accepted: 6535Description"Good man never makes girls wait or breaks an appointme

2015-08-27 12:55:17 795

原创 hdu1081 最大子矩阵和(DP动态规划 最大子序列和变形题)

To The MaxTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9922    Accepted Submission(s): 4791Problem DescriptionGiven a two-dim

2015-08-25 13:17:14 548

原创 hdu1080 Human Gene Functions (DP动态规划,带权最长公共子串)

Human Gene FunctionsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2733    Accepted Submission(s): 1545Problem DescriptionIt is

2015-08-24 22:17:17 436

原创 HDU1069 Monkey and Banana(dp动态规划,最长非递减子序列变形题)

Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9861    Accepted Submission(s): 5126Problem DescriptionA group

2015-08-24 13:16:10 828

原创 HDU1024 Max Sum Plus Plus(DP动态规划 最大子串和增强版)

Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20708    Accepted Submission(s): 6886Problem DescriptionNow I t

2015-08-23 21:12:43 1096

原创 POJ1986 Distance Queries(LCA最近公共祖先)

Distance QueriesTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 10604 Accepted: 3746Case Time Limit: 1000MSDescriptionFarmer John's cows refused

2015-08-19 20:39:17 1143

原创 POJ3164 Command Network(最小树形图)

Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 14736 Accepted: 4232DescriptionAfter a long lasting war on words, a war on arms fina

2015-08-19 14:42:26 341

原创 POJ2560 Freckles(prim最小生成树)

FrecklesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7839 Accepted: 3763DescriptionIn an episode of the Dick Van Dyke show, little Richie connects

2015-08-15 13:48:04 486

原创 POJ2230 Watchcow(欧拉回路)

WatchcowTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 6467 Accepted: 2819 Special JudgeDescriptionBessie's been appointed the new watch-cow for th

2015-08-14 13:42:58 495

原创 图的广度优先遍历和深度优先遍历(基于链式前向星)

#include#include #includeusing namespace std;const int maxn = 100001;int head[maxn];bool vis[maxn];bool bvis[maxn];queue que;struct EdgeNode{ int to; int w; int next;};EdgeNode Edge

2015-08-12 23:10:38 919

原创 前向星和链式前向星

前向星:#include#include#includeusing namespace std;const int maxn = 100001;int head[maxn]; //储存起点为vi的第一条边的位置int n,m;struct Node{ int from; int to; int w; }edge[maxn*3];bool cmp(Node a,

2015-08-12 19:51:11 513

原创 POJ2478 Farey Sequence(欧拉函数,打表)

Farey SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13435 Accepted: 5272DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is th

2015-08-08 21:07:11 539

原创 POJ 1284 Primitive Roots(欧拉函数)

Primitive RootsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3319 Accepted: 1934DescriptionWe say that integer x, 0 i mod p) | 1 <= i <= p-1 } is eq

2015-08-08 20:58:59 408

原创 POJ 2407 Relatives(欧拉函数)

RelativesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12422 Accepted: 6043DescriptionGiven n, a positive integer, how many positive integers less t

2015-08-08 20:45:56 456

原创 POJ1811 (Prime Test Pollard rho整数分解,Miller-Rabin素数测试)

Prime TestTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 30648 Accepted: 7880Case Time Limit: 4000MSDescriptionGiven a big integer number, you

2015-08-08 20:39:34 445

原创 POJ3641(Pseudoprime numbers 费马小定理)

Pseudoprime numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7393 Accepted: 3048DescriptionFermat's theorem states that for any prime number p and for any integer a > 1, ap = a (mod

2015-08-08 20:31:10 612

原创 POJ1320 Street Numbers(佩尔方程)

Street NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2784 Accepted: 1547DescriptionA computer programmer lives in a street with houses number

2015-08-08 20:19:33 458

原创 Hdu1164(Eddy's research I 因子分解)

Eddy's research ITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7629    Accepted Submission(s): 4636Problem DescriptionEddy's i

2015-08-08 19:48:17 371

原创 HDU 3292(No more tricks, Mr Nanguo 佩尔方程矩阵快速幂求解)

No more tricks, Mr NanguoTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 298    Accepted Submission(s): 188Problem DescriptionNow Sa

2015-08-05 19:28:28 661

原创 POJ1305(Fermat vs. Pythagoras 毕达哥拉斯三元组解不定方程)

Fermat vs. PythagorasTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 1412 Accepted: 821DescriptionComputer generated and assisted proofs and verificatio

2015-08-05 18:00:37 777

原创 POJ1006 Biorhythms

BiorhythmsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 121250 Accepted: 38176DescriptionSome people believe that there are three cycles in a person's

2015-08-04 19:53:41 362

原创 2015--多校训练第5场 1002 1005 1007

MZL's simple problemTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 189    Accepted Submission(s): 80Problem DescriptionA simple pro

2015-08-04 18:52:21 406

原创 POJ 3233 Matrix Power Series(矩阵的快速幂)

Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 17841 Accepted: 7538DescriptionGiven a n × n matrix A and a positive integer k, fi

2015-08-03 22:13:11 916

原创 POJ3243(Clever Y),POJ2417(Discrete Logging) && HDU2815(高次同余定律)

Clever YTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7217 Accepted: 1784DescriptionLittle Y finds there is a very interesting formula in mathematics:

2015-08-02 16:22:17 471

原创 POJ3579(Hello Kiki 中国剩余定律,同余方程)

Hello KikiTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2548    Accepted Submission(s): 933Problem DescriptionOne day I was shoppi

2015-07-31 20:55:51 667

原创 POJ1573(X问题 中国剩余定律)

X问题Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4234    Accepted Submission(s): 1351Problem Description求在小于等于N的正整数中有多少个X满足:X

2015-07-31 19:39:57 362

原创 POJ2891 Strange Way to Express Integers(解多元线性同余方程)

Strange Way to Express IntegersTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 11289 Accepted: 3482DescriptionElina is reading a book written by Ruji

2015-07-31 12:54:42 931

原创 hdu多校第三场 Solve this interesting problem (5323 线段树模拟 + DFS)

Solve this interesting problemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1810    Accepted Submission(s): 542Problem Description

2015-07-29 22:08:23 609

原创 POJ2992 Divisors(整数分解)

DivisorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10847 Accepted: 3214DescriptionYour task in this problem is to determine the number of divisors

2015-07-29 20:26:13 735

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除