WEBSITE RETURNED, HOWEVER SUBMIT QUANTITY IS RESTRICTED PER DAY TO VERY LITTLE (UNDER JUDGE0 NEW POLICY, API PROVIDER). Therefore it is very much for you to pay attention TEST CAREFULLY CODE BEFORE SUBMIT.
December 22, 2018
HomeExerciseLoopPrime factors

Prime factors

By Loop  14 Comments ☞ timesheets code
NOT IN HUE, MISSING than output. Read the instructions and code samples do post here if you're wrong or not know how to do

Threads: Input 1 number, analysis of which achievement of the prime factors.
Input: A positive integer.
Output: Integrated chain of alternating prime factors by commas *. Factors Descending.
For example:

input:
6
output:
2*3

You are not logged in? Log in to Submit Now!

NOT IN HUE, MISSING than output. Read the instructions and code samples do post here if you're wrong or not know how to do
14 Comments
  1. Truong Dinh

    What is processing? ?

    • nguyenvanquan7826

      ah, I'm sure the system is handling you then. Maybe due to many submissions, processing is slow.

    • NTN-Ghost

      The code is wrong

  2. poppycute99

    NZEC laf ntn ad

    • nguyenvanquan7826

      Probably no output ko.

  3. coder_cuibap_ICTU

    Please advise 1 little. The teacher's explanation after I submitted it:
    if(n > 1) printf(“*”);
    Must be:
    if(n > i) printf(“*”);
    it's more correct

    • nguyenvanquan7826

      In this TH it's the same, Because when it gets bigger 1 then you can definitely multiply, so print the sign *.

  4. Noo The Lee

    Total error “Time Limit Exceeded” what is it, admin?

    • nguyenvanquan7826

      Running time is over. You should check the instructions before you do it.

  5. nguyenxuanminhduc

    Admin, please look at my work, why do I get Runtime error 207 yes

  6. AnoTherK

    I got an error File size limit exceeded what is it

    • nguyenvanquan7826

      the code is too heavy.

      • AnoTherK

        #include
        using namespace std;
        long long n;
        int main(){
        ios::sync_with_stdio(0), cin.tie(NULL), cost.(NULL);
        China>>n;
        long long i=2;
        while(n){
        cost<<"*";
        bool kt=0;
        while(n%i==0){n/=i; kt=1;}
        if(kt) cost<<i;
        }
        }
        Compared to many articles on the web, this one is still quite light nhẹ

  7. no need to be

    oh why is there? 4/5 Thus ad, test number 5 where

Add a Comment