标签：code set rip line htm base fonts each orm
Among all the factors of a positive integer N, there may exist several consecutive numbers. For example, 630 can be factored as 3×5×6×7, where 5, 6, and 7 are the three consecutive numbers. Now given any positive N, you are supposed to find the maximum number of consecutive factors, and list the smallest sequence of the consecutive factors.
Each input file contains one test case, which gives the integer N (1<N<2?31??).
For each test case, print in the first line the maximum number of consecutive factors. Then in the second line, print the smallest sequence of the consecutive factors in the format factor[1]*factor[2]*...*factor[k], where the factors are listed in increasing order, and 1 is NOT included.
630
3
5*6*7题目大意：给出数N，找出其最长连续因子，因子要从小选起。
//哇好难，越做越难，，，
#include <iostream> #include <vector> #include<math.h> using namespace std; int main() { int n; cin>>n; int m=sqrt(n); int maxl=0,tp=0,bg=0; vector<int> vt; for(int i=2;i<=m;i++){ int t=n;//这个i表示从哪个地方开始。 if(n%i==0){ tp++; t/=i; if(tp>maxl){ maxl=tp; bg=i;//就是这个开始的时候。但是你得能整除才可以。哇这个好难。 } }else{ tp=0; } } cout<<maxl<<‘\n‘; for(int i=bg;i<maxl+tp;i++){ cout<<i; if(i!=maxl+tp-1) cout<<"*"; } return 0; }
//写不下去了，要考虑好多问题啊。
PAT 1096 Consecutive Factors[难]
标签：code set rip line htm base fonts each orm
原文地址：https://www.cnblogs.com/BlueBlueSea/p/9953447.html
