Conversion Of Big Number into Words(In Indian System).

-

package snlkjha;
import java.util.*;
import java.math.BigInteger;
/**
 * @author snlkjha
 */
public class N2word {

    public static String get(int n){
        String[] x1={"","One","Two","Three","Four","Five","Six","Seven","Eight","Nine","Ten","Eleven","Twelve","Thrteen","Fourteen","Fifteen","Sixteen","Seventeen","Eighteen","Ninteen"};
        String[] x2={"","Ten","Twenty","Thirty","Forty","Fifty","Sixty","Seventy","Eighty","Ninty","Hundred"};
        if(n<20) return x1[n];
        else return x2[n/10]+" "+x1[n%10];
    }
 
    public static String convert_number_into_words(BigInteger n){
      String message=" Only",x3[]={"","Hundred","Thousand","Lakh","Crore","Arab","Kharab","Nil","Padma","Shankh","Mahashankh"};
      int k=0,divide[]={100,10,100,100,100,100,100,100,100,100,100};
      int remainder[]={10,100,100,100,100,100,100,100,100,100,100};
      int rem =n.remainder(BigInteger.valueOf(100)).intValue(); /*Decimal*/
      message=get(rem)+message;
      while(n.compareTo(BigInteger.valueOf(0))>0){
        n=n.divide(BigInteger.valueOf(divide[k]));                   /*till MahaShankh*/
        rem=n.remainder(BigInteger.valueOf(remainder[k++])).intValue();
        if(rem>0)
        message=get(rem)+" "+x3[k]+" "+message;
        }
        return message;
      }

    public static void main(String[] args) {
        Scanner scan=new Scanner(System.in);
        System.out.print("Enter the Amount(Max 21 digits): ");
        BigInteger num=scan.nextBigInteger();
        if(num.compareTo(BigInteger.valueOf(1))<0||num.toString().length()>21){
            System.out.println("Out of range.");
            System.exit(0);
        }
        System.out.println("Amount : "+num+".00"+"\nIn Words :"+convert_number_into_words(num));
    }
}

Output:

Enter the Amount: 459632587412369
Amount : 459632587412369.00
In Words :Forty Five Nil Ninty Six Kharab Thirty Two Arab Fifty Eight Crore Seventy Four Lakh Twelve Thousand Three Hundred Sixty Nine Only


Popular posts from this blog

Code to upload multiple files simultaneously using JSP, Servlet .

-
Image
Step 1 : Create a jsp page. index.jsp <%--      Document   : index     Created on : 21 Sep, 2013, 5:58:32 PM     Author     : snlkjha --%> <%@page contentType="text/html" pageEncoding="UTF-8"%> <!DOCTYPE html> <html>     <head>         <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">         <title>JSP Page</title>     </head>     <body>         <form action="UploadServlet" method="post" enctype="multipart/form-data">             <input type="file" id="file" name="file1" accept="image/*"  multiple="muliple" required/><br>             <input type="submit"/>            <br><br> ${requestScope.message} ...
Read more

8 Bit Plane Slicing of an image in Image Processing

-
Image
%================ Bit Plane Slicing Program =================% A=imread('bit_plane_img.tif'); subplot(3,3,1),imshow(A),title('INPUT IMAGE'); for i=1:8     B=bitplaneslicing(A,i);     subplot(3,3,i+1),imshow(B),title(i); end %====================================================% %================ Bit Plane Slicing Function =================% function [ B ] = bitplaneslicing( A ,n) % function for n bit plane slicing where n<=8 [M,N]=size(A); B=zeros(M,N); for i = 1:M     for j = 1:N         str=dec2bin(A(i,j),8);         if strcmp(str(9-n),'0')             B(i,j)=0;         else             B(i,j)=2^(n-1);         end     end end end %====================================================% Input Image: bit_plane_img.tif Output Image:
Read more

STRING PALINDROME USING STACK AND QUEUE

-
#include<stdio.h> #include<stdlib.h> #include<string.h> void push(char ); char pop(); void nq(char ); char dq(); typedef struct list {     char data;     struct list *next; }node; node *top=NULL,*front=NULL,*rear=NULL; int main() {     char word[20];     printf("Type the Word:");     scanf("%s",word);     int length=strlen(word),i=0;     while(word[i]!='\0')     {         push(word[i]);         nq(word[i]);         i++;     }     for(i=0;i<length;i++)     {         if(pop()!=dq())         break;             }     if(i==length)        ...
Read more