uva1371

最新推荐文章于 2024-10-27 17:37:14 发布

小刀刺大熊

最新推荐文章于 2024-10-27 17:37:14 发布

阅读量284

点赞数

分类专栏：练习题目文章标签： c++

本文链接：https://blog.csdn.net/seanbill/article/details/122850403

版权

ACM竞赛动态规划算法状态转移方程复杂问题

关键词由CSDN通过智能技术生成

练习题目专栏收录该内容

80 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1e6 + 7;
int n;
char input[maxn];
int fail[maxn];

int main()
{
	int kCase = 0;
	while (cin >> n && n) {
		cin >> (input);
		fail[0] = fail[1] = -1;
		int i = 0, j = -1;
		while (i < n) {
			if (j == -1 || input[j] == input[i])fail[++i] = ++j;
			else j = fail[j];
		}
		cout << "Test case #" << ++kCase << endl;
		for (int i = 2; i <= n; i++) {
			if (fail[i] > 0 && i % (i - fail[i]) == 0) {
				cout << i << " " << i / (i - fail[i]) << endl;
			}
		}
		cout << endl;
	}
	return 0;
}