亲和串

Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 25   Accepted Submission(s) : 17

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem Description

Input

Output

Sample Input

AABCD
CDAA
ASD
ASDF

Sample Output

yes
no

//纯字符串函数应有，没什么好说的

#include <stdio.h>
#include <string.h>
#define N 100010
int main()
{
	char a[N];
	char b[N];
	char c[N];
	while(~scanf("%s",a))
	{
		scanf("%s",b);
		strcpy(c,a);
		strcat(a,c);
		if(strstr(a,b))
			printf("yes\n");
		else 
			printf("no\n");
	}
	return 0;
}

HDoj-2203-亲和串

原文：http://blog.csdn.net/holyang_1013197377/article/details/44587353