136 - Ugly Numbers

By DaPrimitive Soource -

136

Accepted

View Problem

UVA Problem: 136 - Ugly Numbers
Time Limit: 3.00 Seconds
Program Language: C++
Publisher: http://www.uvaonlinejudge.org

♣ Try it Out ::
#include<iostream>
using namespace std;

int main()
{
    int p,q,r, i=1, P,Q,R, ugly[1501]={0};

    ugly[0]=1, p=q=r=0;

    while(ugly[1499] == 0) {
        P = ugly[p]*2;
        Q = ugly[q]*3;
        R = ugly[r]*5;

        if(P<Q && P<R) {ugly[i++]=P; p++;} else
        if(Q<P && Q<R) {ugly[i++]=Q; q++;} else
        if(R<P && R<Q) {ugly[i++]=R; r++;} else
        if(P == Q) {q++;} else
        if(P == R) {r++;} else
        if(R == Q) {r++;}
    }
    cout<<"The 1500'th ugly number is "<<ugly[1499]<<"."<<endl;

    return(0);
}

♣ Source Codes ::

আবূ হুরাইরাহ (রাঃ) হতে বর্ণিত আছে, তিনি বলেন, নবী (সাল্লাল্লাহু আলাইহি ওয়াসাল্লাম) বলেছেনঃ কোন লোকের মিথ্যাবাদী হ্বার জন্য এতটুকুই যথেষ্ট যে, যা সে শুনে অন্যের নিকট তাই বলে বেড়ায়। (মুসলিমঃ ৫)

Popular posts from this blog

C++ :: Topological Sort Algorithm (using DFS)

By DaPrimitive Soource -
Image
A topological sort of a dag G = (V,E) is a linear ordering of all its vertices such that if G contains an edge (u,v), then u appears before v in the ordering. (If the graph contains a cycle, then no linear ordering is possible.) PSEUDOCODE TOPOLOGICAL-SORT(G) call DFS(G) to compute finishing times v.f for each vertex v as each vertex is finished, insert it onto the front of a linked list return the linked list of vertices
Read more

C++ :: Depth-First Search Algorithm (DFS)

By DaPrimitive Soource -
Image
.:: PSEUDOCODE ::. DFS(G) for each vertex u ∈ G.V u.color = WHITE u.π = NIL time = 0 for each vertex u ∈ G.V if u.color == WHITE DFS-VISIT(G,u) DFS-VISIT(G,u) time = time + 1 u.d = time u.color = GRAY for each v ∈ G.Adj[u] if v.color == WHITE v.π = u DFS-VISIT(G,v) u.color = BLACK time = time + 1 u.f = time
Read more

C++ :: Strongly Connected Components Algorithm (SCC)

By DaPrimitive Soource -
Image
Many algorithms that work with directed graphs begin with such a decomposition. After decomposing the graph into strongly connected components, such algorithms run separately on each one and then combine the solutions according to the structure of connections among components. ALGORITHM STRONGLY-CONNECTED-COMPONENTS(G) call DFS(G) to compute finishing times u.f for each vertex u compute GT call DFS(GT), but in the main loop of DFS, consider the verteces in order of decreasing u.f (as computed in line 2) output the vertices of each tree in the depth-first forest formed in line 4 as a separate strongly connected component
Read more