2015-2016 ACM-ICPC, NEERC, Moscow Subregional Contest A

371人阅读 评论(0)

A. Anagrams
time limit per test1 second
memory limit per test512 megabytes
inputstandard input
outputstandard output
Consider the positional numeral system with a given base b. A positive integer x is called b-anagram of a positive integer y if they have the same length of representation in this system (without leading zeroes) and y can be obtained by rearranging the digits of x.

A positive integer k is called b-stable if for every integer m that is divisible by k all its b-anagrams are also divisible by k. Your task is to find all b-stable integers k for a given base b.

Input
The only line of the input contains an integer b — the base of the given positional numeral system (2 ≤ b ≤ 2·109).

Output
Print all b-stable integers k represented in the standard decimal numeral system. They must be printed in ascending order.

Examples
input
3
output
1 2
input
9
output
1 2 4 8
input
33
output
1 2 4 8 16 32

// ml:run = \$bin < input
#include <iostream>
#include <set>

using ll = long long;
ll b;

int main()
{
std::ios_base::sync_with_stdio(false);
std::cin >> b;
b--;
std::set<int> ans;
ans.insert(1);
ans.insert(b);
for (ll i = 2; i * i <= b; i++)
if (b % i == 0) {
ans.insert(i);
ans.insert(b / i);
}
for (auto i : ans) std::cout << i << " ";
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：21117次
• 积分：1071
• 等级：
• 排名：千里之外
• 原创：89篇
• 转载：1篇
• 译文：0篇
• 评论：5条
文章分类
友情链接
http://izihan.cf/ http://blog.csdn.net/Danliwoo
最新评论