Content 给一个长度为 \(n\) 的字符串 \(s\),执行以下操作: 降序遍历 \(n\) 的所有因子(从 \(n\) 到 \(1\)). 对于每一个因子 \(i\) 翻转字符串 \(s_{[1,i]}\). 现在给出操作后的字符串,求原字符串. 数据范围:\(1\leqslant n\leqslant 100\). Solution 既然原来的操作是降序遍历因子,那么还原的时候不正是升序遍历因子吗?所以,按照逆推的思想,我们可以按照下面的操作模拟: 升序遍历 \(n\) 的所有因子(…

B - Reversing Encryption A string s of length n can be encrypted by the following algorithm: iterate over all divisors of n in decreasing order (i.e. from n to 1), for each divisor d, reverse the substring s[1-d] (i.e. the substring which starts at p…

A string ss of length nn can be encrypted(加密) by the following algorithm: iterate(迭代) over all divisors(除数) of nn in decreasing order (i.e. from nn to 11), for each divisor dd, reverse the substring s[1…d]s[1…d] (i.e. the substring which starts at po…

[链接]:CF [代码]: #include<bits/stdc++.h> #define PI acos(-1.0) #define pb push_back #define F first #define S second #define debug puts #define setp cout << fixed << setprecision(3) #define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cou…

感觉现在\(div3\)的题目也不错啊? 或许是我变辣鸡了吧....... 代码戳这里 A. Mishka and Contes 从两边去掉所有\(≤k\)的数,统计剩余个数即可 B. Reversing Encryption 显然,加密的过程是可逆的 考虑反向还原的方法,加密的时候的时候是逆向的,所以我们解密再用正向,即从1-n枚举n的约数,然后倒转字符串即可 C. Alphabetic Removals 以字母为第一关键字,位置编号为第二关键字,排个序,去掉前k个 在剩余的中,按照位置再排个…

Mishka and Contest #pragma comment(linker, "/STACK:102400000,102400000") #ifndef ONLINE_JUDGE #include "stdafx.h" #else #include<bits/stdc++.h> #endif using namespace std; typedef long long lint; typedef vector<int> VI; typ…

02-1. Reversing Linked List (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 CHEN, Yue Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6,…

题意说的很清楚了,这种题的话,做的时候最好就是在纸上自己亲手模拟一下,清楚一下各个指针的情况, 这样写的时候就很清楚各个指针变量保存的是什么值. PS:一次AC哈哈,所以说自己动手在纸上画画还是很有好处的~ #include <iostream> #include <cstdio> #include <algorithm> #include <string.h> #include <cmath> #include <queue> us…

Unique Encryption Keys 题目链接: http://acm.hust.edu.cn/vjudge/problem/26633 Description http://7xjob4.com1.z0.glb.clouddn.com/bced90d15c27e75270cc759651dcfa63 Input The input contains several cipher descriptions. Each description starts with one line co…

Stack Machine Executor 题目链接: http://acm.hust.edu.cn/vjudge/problem/26628 Description http://7xjob4.com1.z0.glb.clouddn.com/18113a5cf78f108997460e36f7079fc6 Input The input contains several instances. Each instance consists of two lines, the first lin…