08 2015 档案
摘要:#include#include#include#include#includeusing namespace std;int main(){ int n,p,q; int i,j,k; while(scanf("%d%d%d",&n,&p,&q)!=EOF) { ...
阅读全文
摘要:#include#include#include#includeusing namespace std;int main(){ int t,n,m; int i,j,k; //scanf("%d",&t); while(scanf("%d%d",&n,&m)!=EOF) ...
阅读全文
摘要:#include#include#include#includeusing namespace std;int main(){ int t,n,m; int i,j,k; scanf("%d",&t); while(t--) { scanf("%d%d",...
阅读全文
摘要:#include#include#include#include#include#include#include#include#define LL __int64using namespace std;int fa[3000];int val[3000];int find(int x){ i...
阅读全文
摘要:#include#include#include#include#include#define LL __int64using namespace std;int num[30];int c1[100];int c2[100];void fun(){ int i,j,k,l; memse...
阅读全文
摘要:#include#include#include#includeusing namespace std;int mat[1010][1010];int link[1010];int vis[1010];int n,m;bool find(int u){ int v; for(v=0;v<...
阅读全文
摘要:#include#include#include#includeusing namespace std;int n,m,k;int mat[110][110];int link[110];int vis[110];bool find(int u){ int v; for(v=0;v0&&...
阅读全文
摘要:struct node{ int next[27]; int v; void init() { v=0; memset(next,-1,sizeof(next)); }};node L[1000500];int tot=0;void add(...
阅读全文
摘要:#include#include#includeusing namespace std;char num[10000];int get_sum(){ int ret=0; for(int i=0;i<strlen(num);i++) { ret+=(num[i]-'0...
阅读全文
摘要:#include#include#include#include#include#includeusing namespace std;int gcd(int x,int y){ return y==0?x:gcd(y,x%y);}int main(){ int h,m,s; in...
阅读全文
摘要:#include#include#include#include#include#includeusing namespace std;int vis[50];int fa[50];int num[50];int find(int x){ return fa[x]==x?x:find(fa[x...
阅读全文
摘要:#include#include#include#include#includeusing namespace std;int mat[200][200];int ran[200];int main(){ int n,m; int i,j,k; int f,t; while(...
阅读全文
摘要:#include#include#include#includeusing namespace std;double p[1010][1010][5];double dp[1010][1010];int n,m;void fun(){ int i,j,k; for(i=n;i>=1;i-...
阅读全文
摘要:#include #include #include using namespace std;int hp1 , hp2 ;double dp[2][2100] ;double a , b , p ;double ka[10] , kb[10] ;int main(){ int i , j ,...
阅读全文
摘要:#include #include #include #include #include #include #include #define lson l,mid,os2[j]&&maxxans) ans=dp[j]; } printf("%d\n",ans); }...
阅读全文
摘要:#include #include #include #include #include #include #include #define lson l,m,rt> 1; build(lson); build(rson); up(rt);}int A,B;void update(...
阅读全文
摘要:#include#include#include#include#include#define INF 30000000#define pai 3.1415926using namespace std;char s1[1000],s2[1000];int dp[1000][1000];int mai...
阅读全文
摘要:#include#include#include#include#includeusing namespace std;int n,c;int a[100000+100];int solve(int m){ int ret=1; int i,j,k; int l=0,r; f...
阅读全文
摘要:#include#include#include#include#include#define INF 1000000using namespace std;int d[200][200];int main(){ int n,m; while(scanf("%d%d",&n,&m)!=E...
阅读全文
摘要:#include#include#include#includeusing namespace std;int fa[7000];int dp[7000][5];int vis[7000];int n;void dfs(int rt){ int i,j,k; vis[rt]=1; ...
阅读全文