标签:oid ast arch tput tar search ted sci algo
Time Limit: 3000MS | Memory Limit: 30000K | |
Total Submissions: 18542 | Accepted: 9007 |
Description
Input
Output
Sample Input
3 aaa 12 aabaabaabaab 0
Sample Output
Test case #1 2 2 3 3 Test case #2 2 2 6 2 9 3 12 4
Source
1 #include <algorithm> 2 #include <cstring> 3 #include <cstdio> 4 5 using namespace std; 6 7 const int N(1000000+5); 8 int len,p[N]; 9 char s[N]; 10 11 inline void Get_next() 12 { 13 for(int j=0,i=2;i<=len;p[i++]=j) 14 { 15 for(;s[i]!=s[j+1]&&j>0;) j=p[j]; 16 if(s[i]==s[j+1]) j++; 17 } 18 } 19 20 int main() 21 { 22 for(int i=0;scanf("%d",&len)&&len;) 23 { 24 scanf("%s",s+1); 25 memset(p,0,sizeof(p)); 26 Get_next(); 27 printf("Test case #%d\n",++i); 28 for(int i=1;i<=len;i++) 29 { 30 int l=i-p[i]; 31 if(i!=l&&i%l==0) 32 printf("%d %d\n",i,i/l); 33 } 34 printf("\n"); 35 } 36 return 0; 37 }
标签:oid ast arch tput tar search ted sci algo
原文地址:http://www.cnblogs.com/Shy-key/p/7384587.html