摘要：
#include#include#define N 200int map[N][N],n,m,indegree[N];int judge() { int k,i,j; for(k=0;k<n;k++) { for(i=0;i<n;i++) { if(i... 阅读全文
摘要：
#include#include#define N 600int map[N][N],indegree[N],n,m;void judge() {int k,i,j,flag=0;for(k=1;k<=n;k++)for(i=1;i<=n;i++) {if(indegree[i])continue;... 阅读全文
摘要：
//暴力+并查集#include#include#define N 300#define inf 0x7fffffffstruct node {int x,y,spee;}map[N*4];int pre[N];int find(int n) {if(n!=pre[n])pre[n]=find(pr... 阅读全文
摘要：
#includeint main() {int n,k,i,flag=0;while(scanf("%d%d",&n,&k)!=EOF) {flag=0;for(i=1;i<=k;i++) {if(flag==0) {flag=1;printf("%d %d",2*i-1,2*i);}elsepri... 阅读全文
摘要：
#include#define N 1000050int text[N],t[N],next[N],n,m;void getnext() {int j=0,k=-1;next[0]=-1;while(j<m) {if(k==-1||t[j]==t[k]) {j++;k++;next[j]=k;}el... 阅读全文
摘要：
#include//考英语的题坑。。。#include#define N 200#define inf 999999999int map[N][N];int main() {int i,j,k,n,m,max;char s[20];while(scanf("%d",&n)!=EOF) {memset... 阅读全文
摘要：
#include#include#define N 100int map[N][N];int main() {int t,n,m,i,j,k,sum1,sum2,total,mid,a,b;scanf("%d",&t);while(t--) {scanf("%d%d",&n,&m);memset(m... 阅读全文