POJ-1365 Prime Land (数论)
来源:互联网 发布:电脑如何激活windows 编辑:程序博客网 时间:2024/06/06 18:24
Prime Land
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4088 Accepted: 1849
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.
(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 15 1 2 1509 1 59 10
Sample Output
2 43 213 1 11 1 7 1 5 1 3 1 2 1
题意:每一行给出一个数n的质因数及其幂次,求将n-1分解质因子的结果。
注意输入格式
#include <stdio.h>#include <string.h>#include <stdlib.h>#define maxn 40000typedef long long ll;int pri[5000];bool vis[maxn];ll ans[5000][2];int icount,cut;ll qmul(ll a,ll b)//快速幂{ ll ans=1; while(b) { if(b&1) ans*=a; a*=a; b>>=1; } return ans;}void printpri()//打印素数{ memset(vis,0,sizeof(vis)); memset(pri,0,sizeof(pri)); for(int i=2;i<=maxn;++i) { if(!vis[i]) { pri[icount++]=i; for(int j=i;j<=maxn;j+=i) vis[j]=1; } }}void solve(ll num)//分解{ memset(ans,0,sizeof(ans)); cut=0; for(int i=0;i<icount;++i) { if(num%pri[i]==0) { ans[cut][0]=pri[i]; while(num>1&&num%pri[i]==0) { ans[cut][1]++; num/=pri[i]; } cut++; } } if(num>1) { ans[cut][0]=num; ans[cut++][1]=1; } printf("%lld %lld",ans[cut-1][0],ans[cut-1][1]); for(int i=cut-2;i>=0;--i) printf(" %lld %lld",ans[i][0],ans[i][1]); printf("\n");}int main(){ icount=0; printpri(); while(1) { ll n,m,sum=1; char c; scanf("%lld",&n); if(n==0) break; scanf("%lld",&m); sum*=qmul(n,m); c=getchar(); if(c=='\n') { solve(sum-1); continue; } else { while(1) { scanf("%lld%lld",&n,&m); sum*=qmul(n,m); c=getchar(); if(c=='\n') { solve(sum-1); break; } } } } return 0;}
0 0
- POJ-1365 Prime Land (数论)
- poj 1365 Prime Land 【简单数论】
- POJ 1365 / Central Europe 1997 Prime Land (数论)
- (Relax 数论1.10)POJ 1365 Prime Land(质因数分解)
- POJ 1365 Prime Land
- POJ-1365-Prime Land
- poj 1365 Prime Land
- POJ 1365 Prime Land
- POJ 1365 Prime Land
- POJ 1365 Prime Land
- POJ 1365 -- Prime Land
- POJ 1365 Prime Land
- POJ 1365 Prime Land 素数
- POJ1365 Prime Land 初等数论
- POJ 1365 Prime Land 整数分解
- poj 1365 Prime Land (质因子分解)
- POJ 1365 Prime Land(素因子分解)
- POJ-1365-Prime Land 解题报告
- sql server
- Trafodion 存储过程的优势
- JS在浏览器上的性能分析(一)脚本的下载与运行
- Html和CSS基础
- VIM高频使用快捷键及命令
- POJ-1365 Prime Land (数论)
- OS超全开源框架、项目和学习资料汇总--数据库、缓存处理、图像浏览、摄像照相视频音频篇
- 亚马逊跨界女性内衣市场能靠谱么?
- jdk、jre
- 梁定郊推行贿赠之关键六个字
- MyEclipse2016下载
- Java中如何结束线程
- 67. @Transactional的类注入失败【从零开始学Spring Boot】
- 集成腾讯ilive音视频通讯,实现医生和患者实时在线音视频沟通