Prime Land

原创 2018年04月17日 17:12:09

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 ekx, ekx-1, ..., e1, e0, (ekx > 0), that The sequence

(ekx, ekx-1, ... ,e1, e0)



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

To commemorate my first number of topics

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef long long ll;
const int N=1000;
int prime[N],p[N],tot=0;
using namespace std;
struct num
{
    int d,z;
};
num n[N],r[N];
void solve(ll s)
{
    int index=0;
    int sum;
    for(int i=0;i<tot;i++)
    {
        if(s%p[i]==0)
        {
            sum=0;
            while(s%p[i]==0)
            {
                sum++;
                s=s/p[i];
            }
            r[index].d=p[i];
            r[index++].z=sum;
        }
    }
    if(s>1)
    {
        r[index].d=s;
        r[index++].z=1;
    }
    for(int i=index-1;i>0;i--)
        printf("%d %d ",r[i].d,r[i].z);
    printf("%d %d\n",r[0].d,r[0].z);
}
void init()
{
    for(int i=2;i<N;i++)
        prime[i]=1;
    for(int i=2;i<N;i++)
    {
        if(prime[i])
            p[tot++]=i;
        for(int j=0;j<tot&&i*p[j]<N;j++)
        {
            prime[i*p[j]]=0;
            if(i%p[j]==0)
                break;
        }
    }
}
int main()
{
    int x,y,k;
    init();
    while(scanf("%d",&x)&&x)
    {
        k=0;
        ll sum=1;
        n[k].d=x;
        scanf("%d",&y);
        n[k++].z=y;
        char c;
        while(1)
        {
            scanf("%c",&c);
            if(c=='\n')
                break;
            scanf("%d %d",&x,&y);
            n[k].d=x;
            n[k++].z=y;
        }
        for(int i=0;i<k;i++)
        {
            for(int j=1;j<=n[i].z;j++)
                sum*=n[i].d;
        }
        solve(sum-1);
    }
    return 0;
}

poj 1365 Prime Land 唯一分解定理

这个题,一大堆英文烦死了,但是貌似原数必须用long long存,我wa了半天,之前一直以为原数的范围时[3,32767],结果发现这可能是底数的范围。 Prime Land...
  • yskyskyer123
  • yskyskyer123
  • 2016-03-12 12:31:47
  • 374

HITOJ Prime Land 1069 (求质因子) 好题

Prime Land   Source : ACM ICPC Central European Regional 1997   Time limit : 1 sec   Memory...
  • yanghui07216
  • yanghui07216
  • 2015-12-10 14:16:06
  • 398

POJ - 1365 Prime Land (整数分解+筛素数)

题目链接:http://poj.org/problem?id=1365点击打开链接 Prime Land Time Limit: 1000MS   Memory Lim...
  • xuejye
  • xuejye
  • 2018-01-14 11:14:27
  • 58

POJ 1365 Prime Land

POJ 1365 Prime Land 快速幂
  • u014737310
  • u014737310
  • 2014-08-02 18:40:39
  • 633

poj 1365 Prime Land

题意:输入:a1,b1,a2,b2....。求出x=a1^b1 * a2^b2 * ....。将x-1这个数分解成素数的乘积。并将这些素数按从大到小的顺序输出及其幂。 思路:求出所有的素数。求出x,...
  • qdlgdx_lsy
  • qdlgdx_lsy
  • 2013-09-05 15:57:11
  • 440

POJ 1365 -- Prime Land

题目大意:题目给出一个整数的质数分解展开形式,给出每一个质因数及对应的指数。 例如样例2:  5 1 2 1  =  5^1*2^1 = 10  根据所给的质数分解展开形式求出原数n,并求出n-1...
  • u011346442
  • u011346442
  • 2015-01-06 09:17:38
  • 209

POJ-1365 Prime Land (数论)

Prime Land Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4088   Acc...
  • Zorro980302
  • Zorro980302
  • 2017-02-15 15:34:11
  • 113

poj1365 Prime Land

数字的质因子分解。。 Code: #include #include #include #include using namespace std; typedef long lo...
  • yew1eb
  • yew1eb
  • 2013-08-19 06:01:20
  • 1723

POJ1365 Prime Land 初等数论

题目给出x的质数分解,求x-1
  • xuyouqiao2005
  • xuyouqiao2005
  • 2014-08-16 16:26:20
  • 247

POJ1365——Prime Land

Prime Land Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3085   Acc...
  • Guard_Mine
  • Guard_Mine
  • 2014-09-12 17:59:37
  • 579
收藏助手
不良信息举报
您举报文章:Prime Land
举报原因:
原因补充:

(最多只允许输入30个字)