- 博客(20)
- 资源 (16)
- 收藏
- 关注
原创 Divisors pku 2992
DivisorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6789 Accepted: 1783<br />DescriptionYour task in this problem is to determine the number of divisors of Cnk. Just for fun -- or do you need any special reason for such a useful computation?
2010-09-29 20:05:00 2285
原创 pku 3090 Visible Lattice Points
<br />http://acm.pku.edu.cn/JudgeOnline/problem?id=3090<br /> <br />题目大意:一个从(0,0)到(n,n)的坐标阵,问多少点能被点(0,0)看到。如果(0,0)到(i,j)的连线被点挡住就算看不到。<br /><br />画图可见,左上和右下两部分的对称性,考虑右下部分,as for a point(x,y) <br />1.有x>=y <br />2.若gcd(x,y)>1;(比如(6,2))则t=gcd(x,y),必存在比它小的(x/
2010-09-28 12:20:00 1915
原创 差分约束 模板
<br />/*根据题意我们可以构建差分约束模型但是我们要求起始点和终点距离最远这里我们有两种做法:1、我们可以添加约束条件 即最后一个点和起始点的距离要>=n我们只要二分枚举n,判断是否有负环就好2、我们可以只进行一次差分约束就好,这里我们要明白一个东西。就是求最短路的时候, 我们求得的值是满足条件约束的最大值,求最长路的时候,我们求得的值是满足条件 约束的最小值。就说最短路吧:我们可以这么想。开始的时候,我们初始化为+无穷。 我们是不断减小最短路的值来看是
2010-09-27 11:11:00 3252
原创 Euclid NBU 1844
<br />Euclid<br />Time Limit:1000MS Memory Limit:65536K<br />Total Submit:49 Accepted:11 <br />Description<br />In one of his notebooks, Euclid gave a complex procedure for solving the <br />following problem. With computers, perhaps there is an easier wa
2010-09-27 10:40:00 2282
原创 C# 屏蔽tab 、 用Enter实现Tab功能
<br />C#中如何用Enter实现tab的功能呢?<br /> <br />C#如何是数据焦点跳到下一个输入位置,高亮选中所有文本:<br />//先按顺序设置每个控件的TabIndex属性,然后将每个控件的Key_Down事件指定到下面这个事件方法,可以实现按Enter跳到下一个控件<br /> private void numericUpDown_radius_KeyDown(object sender, KeyEventArgs e)<br /> {<br />
2010-09-24 19:18:00 7959 2
原创 验证Textbox输入
1.只能输入数字:<br /> private void textBox1_KeyPress(object sender, KeyPressEventArgs e)<br /> {<br /> if (!(((e.KeyChar >= '0') && (e.KeyChar <= '9')) || e.KeyChar <= 31))<br /> {<br /> if (e.KeyChar == '.')<br
2010-09-24 15:36:00 3155
原创 pku 3621
<br />牛可以从任意点出发, 每个点有欢乐值, 一个点可以去多次, 但是欢乐值只增加一次, 每条<br />边有时间消耗, 求一条回路使得 总欢乐值/总时间 最大.<br /><br />#include <stdio.h>#include <string.h>#define M 1005const double inf = 10000000000;int l, p;struct node{ int v, weight, next;}graph[5005];int
2010-09-21 11:10:00 1611
原创 Schedule zoj 3348
ScheduleTime Limit: 1 Second Memory Limit: 32768 KB <br />DD enters the top-level pingpong match! As the game going on, he wonders if there is possibility for him to get the champion(excluding joint champions). Now provide you the results of previou
2010-09-20 11:43:00 1966 3
原创 Word Game hdu 2429 综合题
Word Game<br />Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 592 Accepted Submission(s): 155<br /><br />Problem Description It's a game with two players. Given a dictionary of words, a
2010-09-18 10:57:00 2542
原创 PKU 2337 判断并输出欧拉回路
http://acm.pku.edu.cn/JudgeOnline/problem?id=2337 CatenymsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4137 Accepted: 975DescriptionA catenym is a pair of words separated by a period such that the last letter of the first word is the same as t
2010-09-14 19:36:00 2546
原创 PKU 1386 Play on Words 判断图中是否存在欧拉回路、欧拉路
http://acm.pku.edu.cn/JudgeOnline/problem?id=1386Play on WordsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4633 Accepted: 1676<br />DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to s
2010-09-14 19:27:00 2651
原创 Kth Largest
<br />Kth Largest<br /> <br />Totalsubmit: 970 Accepted: 168 <br />Description<br />There are two sequences A and B with N (1<=N<=10000) elements each. All of the elements are positive integers. Given C=A*B, where '*' representing Cartesian product, c
2010-09-11 08:59:00 1864
原创 Sum Of SubRectangular Parallelepiped
<br />Sum Of SubRectangular Parallelepiped<br />Totalsubmit: 508 Accepted: 148<br />Description<br />There is a rectangular parallelepiped with a integer in each cell.Can you caculate the maximum sum of sub rectangular parallelepipeds?<br />Input<br />In
2010-09-10 16:33:00 2190
转载 Microsoft VS 2008 过期解决方法
<br />电脑上的Microsoft Visual Studio 2008 Team System 试用版提示离过期还有**天。<br />于是百度,搜索结果大多是以下两种解决方法:<br /><br />一:开始》控制面板》添加或删除程序 里找到VS2008,点“更改/删除”,维护窗口弹出后,或下一步,就会看到一个输入序列号的地方,把序列号输进去,点“升级”按钮即可,Team Suite和Professional通用。<br />以下是收集的序列号:<br />(1)Visual Studio 200
2010-09-10 15:27:00 14377 3
原创 模板[点在多边形内的判断]
<br />#include <stdio.h>#include <stdlib.h>#include <math.h>#define INF 10000#define eps 1e-8#define zero(x) (((x)>0?(x):-(x))<eps)struct point{ double x,y;};struct LINE{ point a,b;};double xmult(point p1,point p2,point p0){
2010-09-09 10:18:00 2254
原创 A Task Process DP
A Task Process<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 615 Accepted Submission(s): 299<br /><br />Problem DescriptionThere are two kinds of tasks, namely A and B. There are N wor
2010-09-08 16:22:00 1937
原创 Strange Calendar III zoj 4011
<br /> Strange Calendar IIITime Limit: 2 Seconds Memory Limit: 65536 KB<br />As we know, in the Bzu planet and in the cc98 planet, people use special calendar which is similar to that used in the earth. In fact, in the BoMb planet, people use a simi
2010-09-07 12:55:00 1658
原创 Counting Factor Trees zoj 3405
Counting Factor TreesTime Limit: 2 Seconds Memory Limit: 65536 KB <br />Factoring, i.e., listing all the prime factors, of an integer is a useful skill that often helps to solve math problems. For example, one of the ways to find the GCD (Greatest C
2010-09-07 10:47:00 3420
转载 C#中ToString格式大全 String.Format 格式
C 货币<br />2.5.ToString("C")<br />¥2.50 <br />D 十进制数<br />25.ToString("D5")<br />00025<br />E 科学型<br />25000.ToString("E")<br />2.500000E+005<br />F 固定点<br />25.ToString("F2")<br />25.00<br />G 常规<br />2.5.ToString("G")<br />2.5<br /><br />N 数字<br />2500000
2010-09-05 10:07:00 9476
原创 Task Schedule
Task ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 267 Accepted Submission(s): 99Problem DescriptionOur geometry princess XMM has stoped her study in computational geometry to concentrate
2010-09-01 15:08:00 3341
LR_Mnist.py
2015-01-07
deep learning 概览+时序模型
2014-05-29
Convolution Neural Network (CNN)
2014-05-15
人脸检测与识别
2014-03-16
决策树python实现
2014-03-10
KMeans和Kmedoid算法的matlab实现
2012-11-18
C++矩阵处理工具——Eigen3
2012-07-24
Difference of Gaussian DoG
2012-06-09
动态规划基础(初学者必读)
2009-10-14
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人