Skip to main content

C++ program to find LCM and HCF of given 3 numbers

#include<iostream.h>
#include<conio.h>
void lcm(int, int, int);
void hcf(int, int, int);
void main()
{
char choice;
do
{ int a,b,c;
clrscr();
cin>>a>>b>>c;
lcm(a,b,c);
hcf(a,b,c);
cout<<"\n\nDO YOU WANT TO REPEATTHE PROGRAM?(Y/N): ";
cin>>choice;
}while(choice=='Y'||choice=='y');
}
void lcm(int x,int y, int z)
{
long max,lcom, count, flag=0;
if(x>=y&&x>=z)
max=x;
else if(y>=x&&y>=z)
max=y;
else if(z>=x&&z>=y)
max=z;
for(count=1;flag==0;count++)
{
lcom=max*count;
if(lcom%x==0 && lcom%y==0 && lcom%z==0)
{
flag=1;
cout<<"\nTHE LCM OF "<<x<<","<<y<<","<<z<<" IS "<<lcom;
}
}
}
void hcf(int p, int q, int r)
{
int gcf=1,flag=0, count;
for(count=1; flag==0;count++)
{
if(p%count==0&&q%count==0&&r%count==0)
gcf=count;
if(count>p&&count>q&&count>r)
{
flag=1;
cout<<"\nTHE GCF OF "<<p<<","<<q<<","<<r<<" IS "<<gcf;
}
}
}

Also Read : 

1)  Principles of Server Virtualization

2) Top Ten Data Storage Tools

3) Implement a simple calculator (detailed comments on JAVA code)

4) What is a Livelock scenario in java?

5) What is Disk scheduling algorithm in java ( code Example) 

6) What is a Deadlock situation in Java? What are the minimum requirements for a Deadlock situation in a program in Java? How can we prevent a Deadlock in Java?

7) Recursion-maze problem - Rat in the Maze - Game

8) What are features ,  Advantages and disadvantages of Javascript?

9) C program to read a file and display its contents along with line numbers before each line.

10) C++ program to find LCM and HCF of given 3 numbers


11)  What is cloud computing technology and what are the concepts, principles, applications, and prospects for cloud computing technology?

12) What are the basic characteristics of enterprise cloud computing, and what are the main stages in the construction process?

13) 20 best practices for database design

14) Best practices for DB2 database index design

Labels:

Comments

Post a Comment

Popular posts from this blog

40 Redis interview questions for 2021 - 2022

  Redis interview questions 1.What is Redis?. 2. What is the data type of Redis? 3. What are the benefits of using Redis? 4. What are the advantages of Redis over Memcached? 5. What are the differences between Memcache and Redis? 6. Is Redis single-process and single-threaded? 7. What is the maximum storage capacity of a string type value? 8. What is the persistence mechanism of Redis? Their advantages and disadvantages? 9. Redis common performance problems and solutions: 10. What is the deletion strategy of redis expired keys? 11. Redis recycling strategy (elimination strategy)? 12. Why does edis need to put all data in memory? 13. Do you understand the synchronization mechanism of Redis? 14. What are the benefits of Pipeline? Why use pipeline? 15. Have you used Redis cluster? What is the principle of cluster? 16. Under what circumstances will the Redis cluster solution cause the entire cluster to be unavailable? 17. What are the Java clients supp...
Post a Comment
Read more

8 common methods for server performance optimization

  1. Use an in-memory database In-memory database is actually a database that puts data in memory and operates directly. Compared with the disk, the data read and write speed of the memory is several orders of magnitude higher. Saving the data in the memory can greatly improve the performance of the application compared to accessing it from the disk. The memory database abandoned the traditional way of disk data management, redesigned the architecture based on all data in memory, and made corresponding improvements in data caching, fast algorithms, and parallel operations, so the data processing speed is faster than that of traditional databases. Data processing speed is much faster.       But the problem of security can be said to be the biggest flaw in the memory database. Because the memory itself has the natural defect of power loss, when we use the memory database, we usually need to take some protection mechanisms for the data on the memory in advance, such...
Post a Comment
Read more

Recursion-maze problem - Rat in the Maze - Game

  package com.bei.Demo01_recursion; public class MiGong {     public static void main(String[] args)  {         //First create a two-dimensional array to simulate the maze         int [][]map=new int[8][7];         //Use 1 for wall         for (int i = 0; i <7 ; i++) {             map[0][i]=1;             map[7][i]=1;         }         for (int i = 0; i <8 ; i++) {             map[i][0]=1;             map[i][6]=1;         }         //Set the bezel         map[3][1]=1;         map[3][2]=1;         //Output         for (int i = 0; i <8 ; i++) {             for (int j = 0; j ...
Post a Comment
Read more