🔒 Closed Factoring (whole number) in tagalog

Status
Not open for further replies.

codyscott

Honorary Poster
Ganito rin yata yung factoring sa math (para sa whole numbers).

Mukhang tama naman yung results sa akin or kung may mas magandang kayong approach, sabihan nyo ako.

(app version 2.0, kung may time, gagawin ko siyang PRIME FACTORING app. Itong version na ito hindi pa guaranteed na PRIME ang results)

Enjoy.

Code:
/*
Subject: Factoring a WHOLE NUMBER
Description: Ang factoring ay parang ganito: Halimbawa, 10.
Ang mga factors niya ay 2, 5 (kasi 2x5 = 10) or kaya 5, 2 (kasi 5 x 2 = 10).
1 x 10 (kasi 1 x 10 = 10) ay puwede rin, pero usually hindi tayo interesado dyan.
Another example: 50. Ang mga factors niya ay 2, 25 and also 5, 10 (and vice versa)

Take note: Hindi ko tinawag na PRIME FACTORING itong app na ito kasi yung ibang results, kailangan pang
i-factor down to the primest factor. Like the 2, 25 (puwede pa i-factor and 25 to 5 x 5) and also 5, 10 (puwede
pa i-factor and 10 into 2 x 5). Yan ang magiging version 2.0 ng app na ito.

Author: Codyscott at phcorner.org
Group: Seriously Java
*/
#include <iostream>
using namespace std;

int main() {
    //1. Tanungin ang user kung anong WHOLE number ang ipa-factor
    int wholeNumber = 0;
    cout << "Pare, bigyan mo ako ng whole number na ipa-factor natin: ";
    cin >> wholeNumber;
 
    //2. Gawa tayo ng dalawang array
    //para gagamitin natin pang side by side compare
    int multiplicands[wholeNumber];
    int multipliers[wholeNumber];
 
    //3. Yung dalawang array, lagyan natin ng mga values...from 1 to wholeNumber
    // Parang ganito:
    // multiplicands = {1,2,3,4,5,6...up to wholeNumber}
    // multipliers = {1,2,3,4,5,6...up to wholeNumber}
    //para lang pang compare natin side by side sila later
    for(int i=1; i<=wholeNumber; i++){
        int valueToPut = i;
        multiplicands[i]=valueToPut;
        multipliers[i]=valueToPut;
    }
 
    //4. Print out ng label lang ito (optional). Pampaganda
    cout << "Factors of " << wholeNumber << ":\n";
 
    //5. Hanapin na natin yung mga factors
    //Please note: on some whole numbers, baka ang lalabas hindi pa PRIME factors (ibig sabihin, puwede pang i-factor)
    //Ang style ng looping dito ay pang two-dimensional array
    //Ito yung OUTER LOOP (loop siya within multiplicands array)
    for(int cand=1; cand<=wholeNumber; cand++){
     
        //Ito yung INNER LOOP (loop siya within multipliers array)
        for(int plier=1; plier<wholeNumber; plier++){
            int m = multiplicands[cand];    //5a. kukunin niya yung isang value sa multiplicands array
            int p = multipliers[plier];        //5b. tapos kukunin din niya yung value sa multipliers array
            int product = m * p;            //5c. tapos kukunin niya yung product
         
            //dito, i-evaluate lang natin ng konti
            //5d. pag nakapareho ang product at yung wholeNumber
            if(product==wholeNumber){
                //i-evaluate uli natin
                //pag lumabas 1 x wholenumber, skip lang natin (factor din siya kaso hindi tayo interesado)
                if(m==1 && p==wholeNumber){
                    break;
                }
                //pag lumabas wholenumber x 1, skip lang natin (factor din siya kaso hindi tayo interesado)
                else if(p==1 && m==wholeNumber){
                    break;
                }
                //dito lang tayo interesado. I-print lang natin.
                else {
                        cout << m << " x "<< p << endl;
                }
            }
         
        }
     
    } //end of OUTER LOOP (multiplicands array)
     
}
 
Status
Not open for further replies.

About this Thread

  • 1
    Replies
  • 575
    Views
  • 2
    Participants
Last reply from:
PHC_Oraayt

Online now

Members online
1,079
Guests online
1,722
Total visitors
2,801

Forum statistics

Threads
2,275,291
Posts
28,962,081
Members
1,232,690
Latest member
lulla17
Back
Top