【HDU】1358 Period KMP

传送门：【HDU】1358 Period

KMP水题。

代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;

const int maxN = 1000005 ;

char a[maxN] ;
int fail[maxN] ;

void Get_Fail ( char a[] , int len ) {
	fail[1] = 0 ;
	for ( int i = 2 , j = 0 ; i <= len ; ++ i ) {
		while ( j && a[i] != a[j + 1] ) j = fail[j] ;
		if ( a[i] == a[j + 1] ) ++ j ;
		fail[i] = j ;
	}
}

void work () {
	int cas = 0 , len ;
	while ( ~scanf ( "%d%s" , &len , &a[1] ) && len ) {
		Get_Fail ( a , len ) ;
		printf ( "Test case #%d\n" , ++ cas ) ;
		for ( int i = 2 ; i <= len ; ++ i ) {
			if ( fail[i] && i % ( i - fail[i] ) == 0 ) printf ( "%d %d\n" , i , i / ( i - fail[i] ) ) ;
		}
		printf ( "\n" ) ;
	}
}

int main () {
	work () ;
	return 0 ;
}