- 博客(9)
- 资源 (6)
- 收藏
- 关注
原创 POJ3264
#include #include #include #include #define N 200222 int maxc[N][40],minc[N][40],a[N],n,m; int ifmax(int a,int b) { if(a>b) return a; return b; } int ifmin(int a,int b)
2015-07-22 15:04:58 358
原创 POJ2367拓扑排序入门
#include #include #include #define MAX 110 typedef struct nn{ int data[MAX]; int top; }nn; nn ms; int vis[MAX]; int mp[MAX][MAX]; int res[MAX]; int flag,n,fla; int check(int x) { int i;
2015-07-20 16:00:17 453
转载 扩展的欧几里得模板
__int64 EXTENDED_EUCLID(__int64 a,__int64 b,__int64& x,__int64& y) { if(b==0) { x=1; y=0; return a; } __int64 d=EXTENDED_EUCLID(b,a%b,x,y); __int64 xt=x;
2015-07-17 16:13:37 478
原创 HDU2138
这个其实可以当做求素数的模板。 #include #include #include #define false 0 #define true 1 #define bool int typedef unsigned long long int llong; llong mod_pro(llong x,llong y,llong n) { llong ret=0,tmp=x%n;
2015-07-17 16:06:20 552
原创 GCD
#includelong long int gcd(long long int a,long long int b){return (a==0)?b:gcd(b%a,a);}
2015-07-17 16:02:33 314
原创 POJ2352
Stars Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 36355 Accepted: 15810 Description Astronomers often examine star maps where stars are represented by po
2015-07-08 13:27:07 298
原创 POJ3268
Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 14455 Accepted: 6511 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently
2015-07-08 00:33:26 350
windows_opencv3.3.0_build_world_withoutCUDA_x86.zip
2018-05-28
tensorflow1.8.0rc+python2.7+ubuntu16.04+cuda9.0+cudnn7.1
2018-04-24
浙江工商大学数据结构实验指导书
2015-06-15
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人