zoukankan      html  css  js  c++  java
  • PAT 1096 Consecutive Factors[难]

    1096 Consecutive Factors (20 分)

    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.

    Input Specification:

    Each input file contains one test case, which gives the integer N (1<N<231​​).

    Output Specification:

    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.

    Sample Input:

    630
    

    Sample Output:

    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<<'
    ';
        for(int i=bg;i<maxl+tp;i++){
            cout<<i;
            if(i!=maxl+tp-1)
                cout<<"*";
        }
       return 0;
    }

    //写不下去了,要考虑好多问题啊。 

  • 相关阅读:
    栈的经典运用-求值数学表达式
    java中Stack的源码解析
    java-背包的实现
    数据库的事务的特性及隔离级别
    EnumMap的用法和源码解析
    java final关键字的解析
    java中的static关键字解析
    XPath如何定位dom节点
    java 枚举(enum) 详细用法
    jdk动态代理
  • 原文地址:https://www.cnblogs.com/BlueBlueSea/p/9953447.html
Copyright © 2011-2022 走看看