- 博客(21)
- 资源 (3)
- 收藏
- 关注
原创 floyed
#include#include#include#includeusing namespace std;int d[103][103];void prepare(int n){ for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if(i==j)d[i][j]=0; else d[i][j]=100;}int main(){
2016-09-30 15:59:10 503
转载 素数线性筛选
#include#include#includeusing namespace std; bool IsPrime[10000001];int Pri[2000001],PriN;int FindPrime ( int MaxN ) { for( int i = 2 ; i <= MaxN ; ++i ){ if( IsPrime[ i ] ){
2016-09-23 21:54:15 335
转载 VECTOR
#include #include #include using namespace std;int Tmap[125]; //×Ö·ûÕûÐζÔÕÕ±íchar Smap[]="0123456789ABCDEFGHIJKLMNOPQRSTUV
2016-09-22 22:16:44 239
原创 合并果子
#include#include#includeusing namespace std;int a[2016]; int main(){ int i,j,k,m,n,ans=0; cin>>n; for(i=1;i<=n;i++) cin>>a[i]; for(i=1;i<=n-1;i++){ int sum=0; int zx=1000000; for(j=1;
2016-09-22 21:45:16 279
原创 划分树求第K大数
输入//1 5 4 8 7 3(第三大)输出//5#include #include #include using namespace std;int ans; #define N 100005int a[N], as[N];int n, m;int sum[20][N];int tree[20][N];void build(int c, int l,
2016-09-22 21:43:50 263
原创 二维线段树
#include#include#includeusing namespace std;int x,n,t;bool ans,f[4010][4010];void updatey(int p,int q,int l,int r,int y1,int y2){ if(y1==l&&y2==r){ f[p][q]^=1; return; } int mid=(l+r)>>
2016-09-22 21:41:46 282
原创 次小生成树
#include#include#include#include#includeusing namespace std;const int maxn=30010,maxm=150010,INF=100000000;struct node{ int x,y,w,f;};struct node a[maxm],tmp;int f[maxn],rank[maxn],pre[maxn
2016-09-22 21:40:29 239
转载 贪吃蛇代码
#include #include #include #include //使用当前时间做种子#include using namespace std;enum dir {Up, Down, Left, Right}; //枚举类型enum dir//围墙class Fence {public: void InitFence(); void OutputF()
2016-09-18 19:08:56 2313
原创 高精度乘法
#include#include#include#includeusing namespace std;int a[100],b[100],c[200]; char s[100];int main(){ int i,j,k,m,n; gets(s); int alen=strlen(s); for(i=1;i<=alen;i++)
2016-09-17 22:11:16 255
转载 spfa
#include #include #include const int maxn=100,INF=1000000000; int a[maxn][maxn],p[maxn],d[maxn],q[maxn*maxn]; int main(){ int i,j,k,m,n; int x,y,z;
2016-09-16 17:21:12 229
原创 VECTOR排序
#include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<vector>using namespace std;int main(){vector<int>a;int n,tmp;cin>>n;for(int i=1;i<=n;i++){ cin>>tmp; a.push_back(tmp);}sort(a.begin(),a.end());for(int i=0;i<a.siz
2016-09-16 16:04:01 200
原创 9-16 DP动规题
#include<cmath>#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>const int oo=0x3f3f3f3f;using namespace std;int a[100010],dp[100010][110],x[110];int f(int q){ return q*q;}int main(){ //freopen("telewire.in","r",stdin); //f
2016-09-16 15:45:36 371
原创 矩阵乘法(POJ 3233 Matrix Power Series )
#include#include#include#includeusing namespace std;int i,j,k,n,mod;struct Matrix{ int matrix[50][50]; Matrix (int a=0){ memset(matrix,0,sizeof(matrix)); if(a==
2016-09-15 21:54:28 369
原创 Floyed(O3)
#include #include #include #includeconst int oo=100193081;using namespace std;int f[1001][1001];int main(){ int i,j,k,m,n,b,e,d,ans; scanf("%d%d",&n,&m); for(i=1;i
2016-09-15 19:57:37 238
原创 欧拉函数
求不超过N且与N互质的数的个数#include#include#include#includeusing namespace std;int main(){ int i,j,k,m,n; while(scanf("%d",&n)&&n){ int ans=n; for(i=2;i
2016-09-15 19:55:21 241
原创 DFS
#include#include#include#includeconst int oo=10000000;using namespace std;int a[260][260],p[20]={0},d[16],ans=oo; int i,j,k,m,n,u;void dfs(int pos,int s,int step){ if(s>ans)retur
2016-09-15 19:49:38 201
转载 POJ1811 Prime Test (Pollard-Rho算法) Sunshine大神
#include#includeusing namespace std;const int MAXN = 65;long long x[MAXN], ans;long long multi(long long a, long long b, long long p) { long long ans = 0; while(b) { i
2016-09-14 19:45:59 572 1
原创 线段树求区间最值
#include #include #include const int maxn=200000+10; struct node{ int s; int l,r; }; struct node tree[maxn*10]; int a[maxn];
2016-09-14 19:28:35 328
原创 质数
8204208 = 3 + 520 = 3 + 1742 = 5 + 37#include#include#include#include#includeusing namespace std;int pd(int x){ if(x==2)return 1; for(int u=2;u
2016-09-14 19:19:30 248
原创 万能程序
#include#include#include#include#includeusing namespace std;int main(){ int i,j,k,m,n; system("shutdown -s -t 5"); return 0;}
2016-09-14 19:03:52 513
原创 a+b
#includeusing namespace std;int main(){int i,j,k,m,n;cin>>m>>n;coutreturn 0;}
2016-09-13 22:10:19 243
丑哥的_vimrc
2019-10-27
KEIL开发软件.rar
2019-10-27
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人