# C Exercises: Reads two integers and checks whether they are multiplied or not

## C Basic Declarations and Expressions: Exercise-24 with Solution

Write a C program that reads two integers and checks whether they are multiplied or not.

**Pictorial Presentation:**

**C Code:**

```
#include <stdio.h>
int main() {
int x, y;
printf("\nInput the first number: ");
scanf("%d", &x);
printf("\nInput the second number: ");
scanf("%d", &y);
if(x > y)
{
int temp;
temp = x;
x = y;
y = temp;
}
if((y % x)== 0)
{
printf("\nMultiplied!\n");
}
else
{
printf("\nNot Multiplied!\n");
}
return 0;
}
```

Sample Output:

Input the first number: 5 Input the second number: 15 Multiplied!

**Flowchart:**

**C Programming Code Editor:**

** Contribute your code and comments through Disqus.**

**Previous:** Write a C program that reads three floating values and check whether it is possible to make a triangle with them. Also calculate the perimeter of the triangle if the said values are valid.

**Next:** Write a C program that reads an integer between 1 and 12 and print the month of the year in English.

**What is the difficulty level of this exercise?**

Test your Programming skills with w3resource's quiz.

## C Programming: Tips of the Day

** What does (x ^ 0x1) != 0 mean?**

The XOR operation (x ^ 0x1) inverts bit 0. So the expression effectively means: if bit 0 of x is 0, or any other bit of x is 1, then the expression is true.

Conversely the expression is false if x == 1.

So the test is the same as:

if (x != 1)

and is therefore (arguably) unnecessarily obfuscated.

Ref :https://bit.ly/2NIisQM

**Weekly Trends**- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join
- JavaScript functions Exercises
- Python Tutorial
- Python Array Exercises
- SQL Cross Join
- C# Sharp Array Exercises

We are closing our Disqus commenting system for some maintenanace issues. You may write to us at reach[at]yahoo[dot]com or visit us at Facebook