Skip to main content

Program to find the suffix of a number (between 1-31) | C programming

 Q.3      WAP in C/ C++/ java to find the suffix of the given number.

            Inputs              Outputs

              1                          st

              2                          nd

              3                          rd

              11                        th

              21                        st

   22                         nd

              23                        rd


Solution : 

#include<stdio.h>
// char* is a return type for string values
char* suffix(int x) // function to return suffix of number in string form
{
    if (x==1 || x==21 || x==31)
        return "st";
    else if (x==2 || x==22)
        return "nd";
    else if(x==3 || x==23)
        return "rd";
    else
        return "th";
    
}
void main()
{
    int n;
    printf("\nEnter any positive number : ");
    scanf("%d", &n);

    if (n<0 || n>31)
    {
        printf("\nInvalid input! Enter the value again -->");
        main(); // calls the main() function again
    }
    else
    {
        printf("Your output is : %d", n);
        puts(suffix(n)); // shows the suffix of the number
        
    }
} // end of main()

Comments

Post a Comment

Popular posts from this blog

Program to perform to certain tasks using numbers | C programming

     1.          Q.1      WAP in C/ C++/ java to perform the following tasks : a.       Accept two numbers from the user( a and b). b.       Print the numbers. c.        Print the smallest number. d.       Calculate their :                                i.       Summation (a+b)                               ii.       Subtract them (a-b)                              iii.       Multiply them (a*b)                              iv.  ...
Post a Comment
Read more

Neon Number | C programming

 Q.8     WAP in C/ C++/ java to check whether the number is a Neon number or not. Input: 9 Output: Neon Number Explanation: the square is 9*9 = 81 and the sum of the digits of the square ( 8+1) is 9. Solution :  #include <stdio.h> int   sumofdigits ( int  x)  // function to compute sum of digits {      int   sum = 0 ;      while (x > 0 )     {          sum += x % 10 ;         x = x / 10 ;     }      return   sum ; } int   main () {      int   n ;         printf ( " \n Enter any positive number : " );      scanf ( " %d " ,  & n );      if  ( n < 0 )     { ...
Post a Comment
Read more

Special Number | C programming

 Q.9    WAP in C/ C++/ java to check whether the number is a Special Number or not. Definition: If the sum of the factorial of digits of a number (N) is equal to the number itself, the number (N) is called a  special  number. INPUT : 145     The digits of the number are: 1, 4, 5 Factorial of digits: 1! = 1 4! = 4*3*2*1 = 24 5! = 5*4*3*2*1 = 120 Sum of factorial of digits = 1 + 24 + 120 = 145             Hence, the given number 145 is a special number. Solution :  #include   <stdio.h> int   factorial ( int  x)  // function to return factorial of the number {      int   f   =   1 ;      for  ( int   i   =   1 ;  i   <=  x;  i ++ )     {     ...
Post a Comment
Read more