LeeBlog

摘要： #include<stdio.h>#include<stdlib.h>#include<string.h>int len,map[26][ 26 ],des[26],a,b,f = 0,m;char ch[1000];void DFS( int n ){ if( f ) return ; if( n == 'm' - 'a' ) { f = 1; return; } for( int i = 0; i < 26 ; ++i ) { if( n != i && map[n][i] == 1 ) { if( 阅读全文

摘要： #include<stdio.h>#include<string.h>struct E{ char name[1000]; char less[1000]; int d; int num; }e[60024];int c = 0,max = 0,count = 0;void swap( int x,int y ){ struct E t; t = e[ x ]; e[ x ] = e[ y ]; e[ y ] = t; }int cmp( int x,int y ){ if( e[ x ].d == e[ y ].d ) if( e[x].num < e[y].n 阅读全文