Prime Land
Time Limit:
1000MS
|
|
Memory Limit:
10000K
|
Total Submissions:
3845
|
|
Accepted:
1728
|
Description
Everybody in the Prime Land is using a prime base number system. In this system, each positive integer x is represented as follows: Let {pi}i=0,1,2,... denote the increasing sequence of all prime numbers. We know that x > 1 can be represented in only one way in the form of product of powers of prime factors. This implies that there is an integer kx and uniquely determined integers e
kx, e
kx-1, ..., e
1, e
0, (e
kx > 0), that
The sequence
(e kx, e kx-1, ... ,e 1, e 0)
is considered to be the representation of x in prime base number system.
It is really true that all numerical calculations in prime base number system can seem to us a little bit unusual, or even hard. In fact, the children in Prime Land learn to add to subtract numbers several years. On the other hand, multiplication and division is very simple.
Recently, somebody has returned from a holiday in the Computer Land where small smart things called computers have been used. It has turned out that they could be used to make addition and subtraction in prime base number system much easier. It has been decided to make an experiment and let a computer to do the operation ``minus one''.
Help people in the Prime Land and write a corresponding program.
For practical reasons we will write here the prime base representation as a sequence of such pi and ei from the prime base representation above for which ei > 0. We will keep decreasing order with regard to pi.
(e kx, e kx-1, ... ,e 1, e 0)
is considered to be the representation of x in prime base number system.
It is really true that all numerical calculations in prime base number system can seem to us a little bit unusual, or even hard. In fact, the children in Prime Land learn to add to subtract numbers several years. On the other hand, multiplication and division is very simple.
Recently, somebody has returned from a holiday in the Computer Land where small smart things called computers have been used. It has turned out that they could be used to make addition and subtraction in prime base number system much easier. It has been decided to make an experiment and let a computer to do the operation ``minus one''.
Help people in the Prime Land and write a corresponding program.
For practical reasons we will write here the prime base representation as a sequence of such pi and ei from the prime base representation above for which ei > 0. We will keep decreasing order with regard to pi.
Input
The input consists of lines (at least one) each of which except the last contains prime base representation of just one positive integer greater than 2 and less or equal 32767. All numbers in the line are separated by one space. The last line contains number 0.
Output
The output contains one line for each but the last line of the input. If x is a positive integer contained in a line of the input, the line in the output will contain x - 1 in prime base representation. All numbers in the line are separated by one space. There is no line in the output corresponding to the last ``null'' line of the input.
Sample Input
17 1 5 1 2 1 509 1 59 1 0
Sample Output
2 4 3 2 13 1 11 1 7 1 5 1 3 1 2 1
解题思路:采用O(sqrt(n))的算法分解质因数,看了几份网上的代码,感觉处理的麻烦了些,其实输入的时候可以采用整数和字符结合读入的方式,如果以字符串形式读入的话处理起来会更复杂,输出端我采用的是map存储,map这种数据结构刚好可以达到有序的目的,同时又可以记录下每个素因子的个数,只需要倒序输出即可。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
map<int,int> factor(ll n)//传入要进行质因数分解的整数
{
ll m = 1;
ll num = n;
map<int,int>ret;
int sqrtn = int(sqrt(n));
for(int div = 2; div <= sqrtn; div++)//分解质因数
{
while(n%div==0)
{
n /= div;
ret[div]++;
}
}
if(n>1) ret[n]++;
map<int,int>::reverse_iterator it;
for(it=ret.rbegin();it!=ret.rend();it++)//倒叙输出
{
if(it!=ret.rbegin())
cout << ' ';
cout << it->first << ' ' << it->second ;
}
cout << endl;
return ret;
}
ll mypow(int n, int m)
{
int i;
ll ans = 1;
for(i=1; i<=m; i++)
{
ans *= n;
}
return ans;
}
int main()
{
ll sum = 1;
int n,m;
char ch;
while(1)
{
sum = 1;
cin>>n;
if(n==0) break;
cin>>m;
sum *= mypow(n,m);
while(1)
{
ch = getchar();
if(ch=='\n')
{
factor(sum-1);
break;
}
else
{
cin>>n>>m;
sum *= mypow(n,m);
}
}
}
//cout << "Hello world!" << endl;
return 0;
}