Code_with_chandan

  HackerRank Tuples Solution in Python Task Given an integer,n, and n  space-separated integers as input, create a tuple, t, of those n integers. Then compute and print the result of hash(t). Note:   hash()  is one of the functions in the  __builtins__  module, so it need not be imported. Input Format The first line contains an integer,n, denoting the number of elements in the tuple. The second line contains n space-separated integers describing the elements in tuple t . Output Format Print the result of  hash(t) . Sample Input 0 2 1 2 Sample OUTPUT- 3713081631934410656 n = int(input()) int_list = [int(i) for i in input().split()] int_tuple = tuple(int_list) print(hash(int_tuple))

  How  to Check Whether a Number is Prime Number or Not in C:-  A number is considered as a prime number when it satisfies the below conditions.  A prime number is a number that can be divided by 1 and itself A number that can not be divided by any other number other than 1 or itself is a prime number. It should have only 2 factors. They are 1 and the number itself. ALGORITHMS:-                                               Step 1 . Read a “num” value to check prime or not. Step 2 . set i=1,div=0. Step 3 . if i<=num if true go to step 4, else go to step 7. Step 4 . Check the condition num%i==0 if true then evaluate step 5, else go to step 6. Step 5 . set div=div+1. Step 6 . i=i+1, go to step 4. Step 7 . check div, if div==2 display prime, else display not prime. Step 8 . Stop CODE: - #include <stdio.h> int  main() {      int  num,i;     printf( "enter any number:" );     scanf( "%d" ,&num);     i= 2 ;      while

 How to find the Tringle is Valid or Not in C:- Code:- #include <stdio.h> int  main() {        int  side_1,side_2,side_3;        int  a,b,c;       printf( "enter the value of sides:" ); scanf( "%d\n %d\n %d" ,&side_1,&side_2,&side_3);       a= ((side_1*side_1)==((side_2*side_2)+(side_3*side_3)));       b= ((side_2*side_2)==((side_1*side_1)+(side_3*side_3)));       c= ((side_3*side_3)==((side_1*side_1)+(side_2*side_2)));       if  (a || b || c)      {         printf( "The triangle is valid" );      }       else      {         printf( "The triangle is not valid" );      }       return   0 ; } OUTPUT:   FOLLOW AND SUBSCRIBE THIS WEBPAGE FOR   MORE NEW PROGRAMS AND CODING SOLUTIONS ✌✌✌✌☝👆👇👇👇👇👇

 Write' The First Program' Hello World in C:- CODE:- #include <stdio.h> int  main() {     printf( " hellow world" );      return   0 ; } OUTPUT:- FOLLOW THIS WEBPAGE FOR MORE NEW PROGRAMS AND CODING SOLUTIONS.

How to find the number is Harshad number or not in C:- In this program we will discuss of a number is a Harshad number or not in C programming. In mathematics, a Harshad number is a number that is divisible by the sum of its digits. We use a while loop statement with the following conditions. Input consists of 1 integer. ALGORITHMS:- Step 1 - Enter the number to be check. Step 2 - store the number in a temporary variable. Step 3 - Initialise the while loop until the temp is not equal to zero      (i) Calculate the remainder of the temp, divided with the 10 and store in digit      (ii)  add the digit with sum and store it in the sum.      (ii) divide the temp with the 10 and store in the temp; Step 4 - find the modulus of the number with sum and store in the res; Step 5 - if res equal to zero then a given number is a Harshad number else the given number is not a Harshad number. Step 6 - Stop.     Code:- #include <stdio.h> int  main() {       //To initialize of variable       int  

  Write a C program to find the number is an Abundant number or not:- In this program to find a number is an Abundant number or not. A number n is said to be an Abundant Number to follow these condition the sum of its proper di visors is greater than the number itself. And the difference between these two values is called abundance. Ex:-  Abundant number  12 having a proper divisor is 1,2,3,4,6 the sum of these factors is 16 it is greater than 12 so it is an Abundant number. Some other abundant numbers     18, 20, 24, 30, 36, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120.. ALGORITHMS:- Step 1 - Enter the number, to find the Abundant number. Step 2 - Initialize the loop with c=1 to c<=number and follow the following calculation      (i) check if whether the number is divisible with c and c got a result zero.      (ii) now sum=sum+c, add a digit into a sum and store it in the sum. Step 3 . then the checksum is greater than the number print true. Step 4 . else i

How  to find  Number is a positive or Negative in C:- T he following concept will test whether a number is positive or negative. It is done by checking where the number lies on the number line. The following algorithm will help to check this condition. If the input number is greater than zero then it is a positive number. If the input number is less than zero it is a negative number. If the number is zero then it is neither positive nor negativ e. Same logic we have followed in the below C program. ALGORITHMS:- Step 1. Start Step 2. Enter the number. Step 3. If the number is less than or equal to zero, check if it is zero. Step 4. If the number is zero, print, “, The number is zero.” Step 5. If the number is less than zero, print, “The number is negative.” Step 6. If the number is more than zero, print, “The number is positive.” Step 7. Stop  Code:- #include<stdio.h>  int main() {     int num;     printf("Enter the value of num: ");     scanf("%d",&num); /

   How to Find Greatest of Three Numbers in C:- The C program to find the greatest of three numbers requires the user to insert three integers. The flow chart is also used in C programming to find the greatest number among three integers inserted by the user. A simple if-else block is used to identify the greatest number. ALGORITHMS:- Step 1 : Start Step 2 : Take three integer values from the user. Step 3 : If no1 is greater than no2 and no3, print “Number1 is greatest”. Step 4 : If no2 is greater than no1 and no3, print “Number2 is greatest”. Step 5 : If both the conditions are false, then print “Number3 is greatest”. Step 6 : Stop CODE: - #include <stdio.h> int  main() {      int  num1,num2,num3;     printf( "Enter any three numbers : " );     scanf( "%d %d %d" ,&num1,&num2,&num3);     {      if ((num1>num2)&&(num1>num3))     printf( "num1 is greator %d" ,num1);      else   if ((num2>num1)&&(num2>num3))     p

How to Check Year is a Leap Year or Not in C:- In this program we have to find the year is a leap year or not. Generally  we assume that year is exactly divisible by 4 is a leap year. But it is not only in this case 1900 is divisible by 4. But it  is not a leap so it that case we follows these conditions    It is exactly divisible by 100 If it is divisible by 100, then it should also exactly divisible by 4 And it is divisible by 400   These all conditions are true year is a leap year. ALGORITHMS:- Step 1 . Initialize variable “year” to find leap year. Step 2 . Take input from User. Step 3 . We use this condition ((year%4==0)&&            (year%100!=0)) || (year%400==0)) to check the year is Leap or not. S tep 4 . It is true display year is a leap year. Step 5 . It is false display year is not a leap year. Step 6 . Stop. CODE: - #include <stdio.h> int  main() {      int  year;     printf( "Enter any year: " );     scanf( "%d" ,&year);      if (((yea