URI Online Judge | 1044 Multiples (Solution)

Problem Link:
https://www.urionlinejudge.com.br/judge/en/problems/view/1044

URI Online Judge | 1044

Multiples

Adapted by Neilor Tonin, URI  Brazil
Timelimit: 1
Read two values (A and B). After, the program should print the message "Sao Multiplos" (are multiples) or "Nao sao Multiplos" (aren’t multiples), corresponding to the read values.

Input

The input has two integer numbers.

Output

Print the message relative to the input as stated above.
Sample InputSample Output
6 24Sao Multiplos
6 25Nao sao Multiplos
Solution:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
#include <stdio.h>
int main()
{
    int a,b;
    scanf("%d %d",&a,&b);
    if ( a%b==0||b%a==0)
    {
        printf("Sao Multiplos\n");
    }
    else
    {
        printf("Nao sao Multiplos\n");
    }
    return 0;
}

Comments

  1. UnknownDecember 10, 2016 at 11:26 AM

    please what about this code??!!
    it shows me 40% wrong answer

    #include
    using namespace std;

    int main()
    {
    int A , B;
    cin>>A>>B;

    if ( (A % 2 == 0) && (B % 2 == 0) && (B % A == 0) && (A != 0) && (B != 0) )
    cout<<"Sao Multiplos"<<endl;
    else
    cout<<"Nao sao Multiplos"<<endl;

    return 0;
    }

    ReplyDelete
  2. Loading username...February 11, 2017 at 12:56 AM

    #Elbana
    I think , it's a bit complex condition .

    ReplyDelete
  3. FriendsDecember 19, 2017 at 9:36 PM

    #include
    using namespace std;
    int main()
    {
    int a,b;
    cin>>a>>b;
    if(b%a==0)
    {
    cout<<"Sao Multiplos"<<endl;
    }
    else
    {
    cout<<"Nao sao Multiplos"<<endl;
    }



    return 0;
    }
    what about this code

    ReplyDelete

Post a Comment

Popular posts from this blog

URI Online Judge | 1036 Bhaskara's Formula (Solution)

Image
Problem Link: https://www.urionlinejudge.com.br/judge/en/problems/view/1036 URI Online Judge | 1036 Bhaskara's Formula Adapted by Neilor Tonin, URI   Brazil Timelimit: 1 Read 3 floating-point numbers. After, print the roots of bhaskara’s formula. If was impossible to calculate the roots because a division by zero or a square root of a negative number, presents the message  “Impossivel calcular” . Input Read 3 floating-point numbers A, B and C. Output Print the result with 5 digits after the decimal point or the message if it is impossible to calculate. Sample Inputs Sample Outputs 10.0 20.1 5.1 R1 = -0.29788 R2 = -1.71212 0.0 20.0 5.0 Impossivel calcular 10.3 203.0 5.0 R1 = -0.02466 R2 = -19.68408 10.0 3.0 5.0 Impossivel calcular Solution: #include<stdio.h> #include<math.h> int main() {      double a,b,c,r1,r2,del;      scanf ( "%lf %lf %lf" ,&a,&b,&c);...
Read more

URI Online Judge | 1043 Triangle (Solution)

Image
Problem Link: https://www.urionlinejudge.com.br/judge/en/problems/view/1043 URI Online Judge | 1043 Triangle Adapted by Neilor Tonin, URI   Brazil Timelimit: 1 Read three point floating values (A, B and C) and verify if is possible to make a triangle with them. If it is possible, calculate the perimeter of the triangle and print the message: Perimetro = XX.X If it is not possible, calculate the area of the trapezium which basis A and B and C as height, and print the message: Area = XX.X Input The input file has tree floating point numbers. Output Print the result with one digit after the decimal point. Sample Input Sample Output 6.0 4.0 2.0 Area = 10.0 6.0 4.0 2.1 Perimetro = 12.1 Solution: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 #include <stdio.h> int main() {      double a,b,c;      scanf ( "%lf %lf %lf" ,&a,&b,&c...
Read more

URI Online Judge | 1042 Simple Sort (Solution)

Image
Problem Link: https://www.urionlinejudge.com.br/judge/en/problems/view/1042 URI Online Judge | 1042 Simple Sort Adapted by Neilor Tonin, URI   Brazil Timelimit: 1 Read three integers and sort them in ascending order. After, print these values in ascending order, a blank line and then the values in the sequence as they were readed. Input The input contains three integer numbers. Output Present the output as requested above. Sample Input Sample Output 7 21 -14 -14 7 21 7 21 -14 -14 21 7 -14 7 21 -14 21 7 Solution: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 #include <stdio.h> int main() {      int a, b, c, g, m, s, temp;      scanf ( "%d %d %d" , &a, &b, &c);      g = a;      m = b;     ...
Read more