https://blog.youkuaiyun.com/windriseszh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/windrises/article/details/46920781https://blog.youkuaiyun.com/windrises/article/details/46920781windrisesFri, 17 Jul 2015 01:02:06 +0800https://blog.youkuaiyun.com/windrises/article/details/46555259https://blog.youkuaiyun.com/windrises/article/details/46555259windrisesFri, 19 Jun 2015 02:15:59 +0800https://blog.youkuaiyun.com/windrises/article/details/46487281https://blog.youkuaiyun.com/windrises/article/details/46487281windrisesSun, 14 Jun 2015 01:09:22 +0800 #include using namespace std; const int maxx=3; int main() { //char的int值范围在-]]>https://blog.youkuaiyun.com/windrises/article/details/44902861https://blog.youkuaiyun.com/windrises/article/details/44902861windrisesMon, 06 Apr 2015 16:06:58 +0800 #include #include using namespace std; int result[5010]; int main() { int m;]]>https://blog.youkuaiyun.com/windrises/article/details/44884909https://blog.youkuaiyun.com/windrises/article/details/44884909windrisesSun, 05 Apr 2015 04:07:18 +0800https://blog.youkuaiyun.com/windrises/article/details/44813861https://blog.youkuaiyun.com/windrises/article/details/44813861windrisesWed, 01 Apr 2015 21:30:54 +0800 #include #include #includehttps://blog.youkuaiyun.com/windrises/article/details/44813823https://blog.youkuaiyun.com/windrises/article/details/44813823windrisesWed, 01 Apr 2015 21:27:38 +0800 #include #include #include using namespace std; set dict; int main() { string s,buf; while(cin>>s) { int l=s.size(); f]]>https://blog.youkuaiyun.com/windrises/article/details/44794535https://blog.youkuaiyun.com/windrises/article/details/44794535windrisesWed, 01 Apr 2015 01:56:39 +0800 #include int a[85],n,l,cnt; bool judge(int cur) { for(int i=1,j;i<=cur/2;i++) { for(j=cur;j>=cur-i+1;j--) if(a[j]!=a[j-i]) br]]>https://blog.youkuaiyun.com/windrises/article/details/44760983https://blog.youkuaiyun.com/windrises/article/details/44760983windrisesMon, 30 Mar 2015 23:30:23 +0800 #include #include using namespace std; int a[20],n,cnt; bool isprime(int m) { for(int i=2;ihttps://blog.youkuaiyun.com/windrises/article/details/44554189https://blog.youkuaiyun.com/windrises/article/details/44554189windrisesMon, 23 Mar 2015 01:54:06 +0800https://blog.youkuaiyun.com/windrises/article/details/44280437https://blog.youkuaiyun.com/windrises/article/details/44280437windrisesSun, 15 Mar 2015 20:36:46 +0800https://blog.youkuaiyun.com/windrises/article/details/44076741https://blog.youkuaiyun.com/windrises/article/details/44076741windrisesThu, 05 Mar 2015 04:34:54 +0800 using namespace std; int main() { char a[15]={}; while(cin>>a+1) { int i,j; for(i=7;i<=9;i++) { for(j=1;j<=6;j++)]]>https://blog.youkuaiyun.com/windrises/article/details/44074321https://blog.youkuaiyun.com/windrises/article/details/44074321windrisesThu, 05 Mar 2015 01:57:01 +0800https://blog.youkuaiyun.com/windrises/article/details/44074143https://blog.youkuaiyun.com/windrises/article/details/44074143windrisesThu, 05 Mar 2015 01:47:17 +0800 #include #include #include using namespace std; bool judge(int x,int y,char b,char d); void m(int x,int y,char b,char d);]]>https://blog.youkuaiyun.com/windrises/article/details/44074111https://blog.youkuaiyun.com/windrises/article/details/44074111windrisesThu, 05 Mar 2015 01:46:12 +0800 #include #include #include using namespace std; bool fuc(int x,int y,int i); int h[20][20]={},v[20][20]={}; int main() {]]>https://blog.youkuaiyun.com/windrises/article/details/44074095https://blog.youkuaiyun.com/windrises/article/details/44074095windrisesThu, 05 Mar 2015 01:44:54 +0800 #include #include #include using namespace std; int f[11][10]={},ri[41]={},rj[41]={}; int num,bi,bj; char c[41]={}; int ju]]>https://blog.youkuaiyun.com/windrises/article/details/44070113https://blog.youkuaiyun.com/windrises/article/details/44070113windrisesThu, 05 Mar 2015 00:08:26 +0800 #include #include using namespace std; char code[8][1<<8]; bool readcode() { memset(code,0,sizeof(code)); for(int i=1;]]>https://blog.youkuaiyun.com/windrises/article/details/44070035https://blog.youkuaiyun.com/windrises/article/details/44070035windrisesThu, 05 Mar 2015 00:05:36 +0800 #include #include using namespace std; int n,k,m,a[25]; int go(int p,int cnt,int q) { while(cnt--) { do { p=(p+n]]>https://blog.youkuaiyun.com/windrises/article/details/44038673https://blog.youkuaiyun.com/windrises/article/details/44038673windrisesTue, 03 Mar 2015 15:21:16 +0800 #include using namespace std; int main() { int n; while(cin>>n&&n!=-1) { string a,b; cin>>a>>b; int la=a.size(),lb=b.size(),cnt=0;]]>https://blog.youkuaiyun.com/windrises/article/details/44038653https://blog.youkuaiyun.com/windrises/article/details/44038653windrisesTue, 03 Mar 2015 15:20:25 +0800 #include #include using namespace std; int main() { string a,b; while(cin>>a>>b) { int l=a.size(),cnt1[26]={},cnt2[26]={},i; for(int i=]]>