ACCU WEATHER

MIN MAX OF TWO NUMBERS

-
Given 2 Integers A and B Print them in such a way that Minimum number followed by Maximum number. If both values are equal print -1.
Space seperated values represent A and B.
Constraints
1<= A, B <= 1000
Output Format
Space separated values of Minimum and Maximum.
Sample Input 0
40 5
Sample Output 0
5 40
Explanation 0
Given values 40, 5. The minimum values among them are 5. So we print 5 followed by 40.
Source Code:
import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner ik=new Scanner(System.in);
        int a=ik.nextInt();
        int b=ik.nextInt();
        if(a>b)
        {
                  a=a+b;  
                  b=a-b;
                  a=a-b;
            System.out.println(a+" "+b);
        }
        else if(a==b)
        {
          System.out.println(-1);  
        }
        else
        {
            System.out.println(a+" "+b);   
        }
    }
}

Popular posts from this blog

Integer Addition

-
Given two integer values A, B. Perform additon and display thre result. Input Format Space seperated values represents A and B. Constraints -10,000,000 <= A, B <= 10,000,000,000 Output Format Single line of integer represents addition of A and B Sample Input 0 90 10 Sample Output 0 100 Explanation 0 90 + 10 = 100 Sample Input 1 99 -98 Sample Output 1 1 Source code: import java.io.*; import java.util.*; public class Solution { public static void main(String[] args) { Scanner ik=new Scanner(System.in); int a=ik.nextInt(); int b=ik.nextInt(); System.out.println(a+b); } }
Read more

Sum of alternative Numbers

-
Given a values N. Find the sum's of alternative the numbers from 0 to N. Input Format Single value represents N Constraints 0<= N <= 10,00,000 Output Format Two spaceseperated value represents sum's of alternative values from 0 to N. Sample Input 0 5 Sample Output 0 6 9 Explanation 0 Given N value 5. The numbers from 0 to 5 is 0,1,2,3,4,5 Alternative Sum1=0+2+4=6 alternative sum2= 1+3+5=9 Sample Input 1 1 Sample Output 1 0 1 Source Code: #include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> int main() { long long int n,c=0,c1=0,j=1,i=0; scanf("%lld",&n); while(i<=n) { c=c+i; i=i+2; } while(j<=n) { c1=c1+j; j=j+2; } printf("%lld %lld",c,c1); return 0; }
Read more

IsEven

-
Given an integer N. Find whether the N is even or not. *Hint: Try to solve this using all of the following logics. Using Modulor Operator Using shift Operator Using Division, Multiplication operator Using AND Operator. Input Format Single line of integer represents T, No of test cases followed by T space seperated integer values. Constraints 1<= T <= 100 0<= N <= 1000000000000 Output Format Print Yes if it is even number Print No if it is Odd Number Sample Input 0 5 2 4 3 5 123 Sample Output 0 Yes Yes No No No Sample Input 1 3 10004 23453 12345 Sample Output 1 Yes No No Source Code: import java.io.*; import java.util.*; public class Solution { public static void main(String[] args) { Scanner ik=new Scanner(System.in); int n=ik.nextInt(); for(int i=0;i<n;i++) { int a=ik.nextInt(); i...
Read more