- 博客(7)
- 资源 (16)
- 收藏
- 关注
原创 如何对窗体进行打印预览 (Visual C#)
MSDN上抄下来的……如何:对窗体进行打印预览Visual C# 语言概念如何:对窗体进行打印预览 (Visual C#)此示例说明如何对当前窗体进行打印预览的副本。示例[System.Runtime.InteropServices.DllImport("gdi32.dll")] public static extern long BitBlt (IntPtr hdcDest, int nXDest, int nYDest, int nWidth, int nHeight, IntPtr hdcSrc,
2010-11-30 12:17:00 5561
原创 The 2010 ACM-ICPC Asia Chengdu Regional Contest
<br /> The 2010 ACM-ICPC Asia Chengdu Regional Contest - C<br />Binary Number<br />Time Limit: 2 Seconds Memory Limit: 65536 KB <br />For 2 non-negative integers x and y, f(x, y) is defined as the number of different bits in the binary format of x and
2010-11-16 13:55:00 3666
原创 树状DP- hdu 1011 Starship Troopers
<br />Starship Troopers<br />Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 2089 Accepted Submission(s): 483<br /><br /><br />Problem Description<br />You, the leader of Starship Troopers,
2010-11-11 12:01:00 3087 3
原创 09 conventional exercise
1001刚刚学过的单调队列难度:4星http://hi.baidu.com/edwardmj/blog/item/82fcbcc49ecc4f179d163d21.html这个解题报告写得很清楚1002题意:给你一棵树,每条边有一个权值,问你想让all leaf 和 root 不连通,至少要去掉的value难度:2星思路:搜索想要使任一节点下的all leaf和它父节点不联通无非2 methods:1.使该节点和父节点不联通(1条边)2.使该节点和所有叶子不联通use edge[x].ver[i][0] t
2010-11-07 16:57:00 2384
原创 hdu 1452
<br />想要计算2004^x的所有因子和对29求余结果<br /> <br />2004^x=2^2x*3^x*167^x<br /> <br />用sum(T)表示T的所有因子和<br />则sum(2004^x)%29=sum(2^2x)%29*sum(3^x)%29*sum(167^x)%29<br /> =sum(2^2x)%29*sum(3^x)%29*sum(22^x)%29 <br />
2010-11-06 20:35:00 2212
原创 hdu 2779
<br />贪心,注意贪的不是终止时间,因为有可能数据:<br /> <br />5<br />9 10<br />9 10<br />8 11<br />10 11<br />10 11<br /> <br /> <br />如果贪心贪终止时间结果是4,而事实上[8,9]是可以用的<br /> <br />#include<iostream> #include<algorithm> #include<functional> #include<queue> using namespace std;
2010-11-05 17:15:00 2238
原创 Shrinking Polygons hust 14048
Shrinking PolygonsTime Limit: Unknown Memory Limit: Unknown 64bit IO Format: %lld & %llu <br />[Submit] [Go Back] [Status] <br />Description<br /> <br /> <br />A polygon is said to be inscribed in a circle when all its vertices lie on that circle.
2010-11-03 19:36:00 2898 4
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关注的人