摘要： 水题代码：#include<iostream>#include<fstream>using namespace std;int a[1201],n;int b[1201],top;void prim(){ int i,j,k; if(n==1) { a[1]=1; top=1; return; } if(n==2) { a[1]=1; a[2]=2; top=2; return; } a[1]=1;a[2]=2; memset(b,0,sizeof(b)); top=2; for(i=2;i<=n;i+=2) b[i]=1; for(i=3;i<=n;i+= 阅读全文

摘要： 注意理解算法。代码：#include<iostream>#include<fstream>using namespace std;long long a[1501];void read(){// ifstream cin("in.txt"); int i,j,k; int a1=1,a2=1,a3=1; a[1]=1; a1=1; a2=1; a3=1; for(i=2;i<=1500;i++) { a[i]=min(a[a1]*2,min(a[a2]*3,a[a3]*5)); if(a[i]==a[a1]*2) a1++; if(a[i]== 阅读全文

摘要： 水题。代码：#include<iostream>#include<string.h>#include<fstream>using namespace std;char x[101][101];char c[101];char str[101],str1[101];int len=101,n;void read(){// ifstream cin("in.txt"); int i,j,k,m,s,t; cin>>k; while(k--) { cin>>n; len=101; for(i=0;i<n;i++) 阅读全文

摘要： 假设最大积的分解为n=a1+a2+a3+...+a[t-2]+a[t-1]+a[t](a1<a2<a3<...<a[t-2]<a[t-1]<a[t])我们来证明这个数列的一些性质；1.1<a1if a1=1, then a1(=1), a[t] together could be replaced by a[t]+1.2.to all i, a[i+1]-a[i]<=2;if some i make a[i+1]-a[i]>=3,then a[i],a[i+1] together could be replaced by a[i]+1,a[ 阅读全文

摘要： 容斥原理。代码：#include<iostream>#include<fstream>using namespace std;long long n,m;long long num[60],cnt[60];long long top,per;long long f(long long ,long long);void get(long long s,long long t,long long p){ long long i; if(t==p) { long long j=m; for(i=0;i<t;i++) j/=cnt[i]; per+=f(j,n); } e 阅读全文

摘要： 欧拉路径。代码：#include<iostream>#include<fstream>#include<vector>#include<algorithm>using namespace std;int n;char x[1001][22];struct e{ int data; int num; int vis;};int in[30],out[30],v[30];vector<e> edge[30],edge1[30];int cmp1(const void *a,const void*b){ char *s1=(char *)a 阅读全文