Indeed Prime Challenge 2015

Problem:

For example, consider array A such that:

A[0] = 1 A[1] = 3 A[2] = 2 A[3] = 1 A[4] = 2 A[5] = 1 A[6] = 5 A[7] = 3 A[8] = 3 A[9] = 4 A[10] = 2

The following picture illustrates the landscape after it has flooded:

The gray area is the rock floor described by the array A above and the blue area with dashed lines represents the water filling the low-lying areas with maximum possible volume. Thus, blocks 3 and 5 have a water depth of 2 while blocks 2, 4, 7 and 8 have a water depth of 1. Therefore, the maximum water depth of this area is 2.

Code:

public class Solution {

    public static void main(String[] nt){
        int[] a={1,3,2,1,2,1,5,3,3,4,2};
        System.out.print("Max Depth is : "+solution(a));
    }

    static int solution(int[] a){
        int i=Integer.MIN_VALUE;
        int[] left=new int[a.length];
        int[] right=new int[a.length];

        int max=a[0];
        for(int x=0;x<a.length;x++){
            if(a[x]>max){
                max=a[x];
            }
            left[x]=max;
        }

        max=a[a.length-1];
        for(int x=a.length-1;x>=0;x--){
            if(a[x]>max){
                max=a[x];
            }
            right[x]=max;
        }

        for(int x=0;x<a.length;x++){
            int z=min(left[x],right[x])-a[x];
            i=i<z?z:i;
        }

        return i;
    }

    static int min(int a,int b){
        if(a>b){
            return b;
        }return a;
    }
}

Output:

PlayFair Cipher

PlayFair Cipher Java:

Code:

1-----> PlayFair.java

package com.nearur;

import java.awt.*;

public class PlayFair {
   
   private String key="Monarchy";
   private char[] keyarraay=key.toUpperCase().toCharArray();
   private char[] alpha={'A','B','C','D','E','F','G','H','I','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
   char[][] matrix=new char[5][5];
   StringBuffer buffer=new StringBuffer();

   public PlayFair(){
      int j=0,k=0;
      for (int i=0;i<keyarraay.length;i++){
         if(k!=5){
            if(!check(keyarraay[i])){
            matrix[j][k++]=keyarraay[i];
            }
         }else {
            i--;
            k=0;j++;
         }
      }

      for (int i=0;i<alpha.length;i++){
         if(k!=5){
            if(!check(alpha[i])){
               matrix[j][k++]=alpha[i];
            }
         }else {
            i--;
            k=0;j++;
         }
      }

   }

//  function to view matrix   public void show(){
      for (int i=0;i<5;i++) {
         for (int j = 0; j < 5; j++) {
            System.out.print(matrix[i][j]);
         }
         System.out.println();
      }
   }

// function to check for duplicate characters   private boolean check(char a){
      for (int i=0;i<5;i++) {
         for (int j = 0; j < 5; j++) {
            if(matrix[i][j]==a){
               return true;
            }
         }
      }
      return false;
   }


   // function to encrypt   public String encrypt(String msg){

      msg=msg.toUpperCase();
      msg=msg.replaceAll(" ","");
      msg=msg.replaceAll("J","I");
      if(msg.length()%2!=0){
         msg=msg.concat("X");
      }
      char[] msgs=msg.toCharArray();

      for (int i=0;i<msgs.length;i++){
         Point x1=find(msgs[i++]);
         Point x2=find(msgs[i]);

         if(x1.x==x2.x){
//same row            if(x1.y+1==5){
               x1.y=0;
            }
            else {
               x1.y++;
            }
            if(x2.y+1==5){
               x2.y=0;
            }else {
               x2.y++;
            }
            buffer.append(matrix[x1.x][x1.y]);
            buffer.append(matrix[x2.x][x2.y]);
         }else if(x1.y==x2.y){
//same column            if(x1.x+1==5){
               x1.x=0;
            }
            else {
               x1.x++;
            }
            if(x2.x+1==5){
               x2.x=0;
            }else {
               x2.x++;
            }
            buffer.append(matrix[x1.x][x1.y]);
            buffer.append(matrix[x2.x][x2.y]);
         }else{
            //diagonal            if(x2.x>x1.x) {
               int d=x2.x-x1.x;
               x2.x=x2.x-d;
               x1.x=x1.x+d;
            }else{
               int d=x1.x-x2.x;
               x2.x=x2.x+d;
               x1.x=x1.x-d;
            }
            buffer.append(matrix[x2.x][x2.y]);
            buffer.append(matrix[x1.x][x1.y]);

         }

      }

      return buffer.toString();
   }

   // function to decrypt   public String decrypt(String msg){

      buffer.delete(0,buffer.length());
      msg=msg.toUpperCase();

      char[] msgs=msg.toCharArray();

      for (int i=0;i<msgs.length;i++){
         Point x1=find(msgs[i++]);
         Point x2=find(msgs[i]);

         if(x1.x==x2.x){   //same row            if(x1.y-1<0){
               x1.y=4;
            }
            else {
               x1.y--;
            }
            if(x2.y-1<0){
               x2.y=4;
            }else {
               x2.y--;
            }
            buffer.append(matrix[x1.x][x1.y]);
            buffer.append(matrix[x2.x][x2.y]);
         }else if(x1.y==x2.y){   //same column
            if(x1.x-1<0){
               x1.x=4;
            }
            else {
               x1.x--;
            }
            if(x2.x-1<0){
               x2.x=4;
            }else {
               x2.x--;
            }
            buffer.append(matrix[x1.x][x1.y]);
            buffer.append(matrix[x2.x][x2.y]);
         }else{  //diagonal                        if(x2.x>x1.x) {
               int d=x2.x-x1.x;
               x2.x=x2.x-d;
               x1.x=x1.x+d;
            }else{
               int d=x1.x-x2.x;
               x2.x=x2.x+d;
               x1.x=x1.x-d;
            }
            buffer.append(matrix[x2.x][x2.y]);
            buffer.append(matrix[x1.x][x1.y]);

         }

      }

      return buffer.toString();
   }


// function  to return positon of character in matrix   private Point find(char c){
      Point p=null;
      for (int i=0;i<5;i++) {
         for (int j = 0; j < 5; j++) {
            if(matrix[i][j]==c){
               p=new Point(i,j);
               return p;
            }
         }
      }
      return p;
   }

}

2.-------> Encyption.java

package com.nearur;

public class Encryption {

   public static void main(String[] args) {


      PlayFair playFair=new PlayFair();
      String x=playFair.encrypt("key square");
      System.out.println("Cipher : "+x);
      System.out.println("Plain  : "+playFair.decrypt(x));

   }

}

Output:

For Project Click Here  (GitHub Link "https://github.com/mrdishant/Cryptography")

CG3

Code:

#include<iostream.h>
#include<conio.h>
#include<graphics.h>
void main(){

    int g=DETECT,gmode;
    initgraph(&g,&gmode,"C://TURBOC3//BGI");
    setcolor(10);
    setbkcolor(15);
    settextstyle(SANS_SERIF_FONT,HORIZ_DIR,5);
    outtextxy(100,100,"HELLO WORLD!");
    setcolor(20);
    settextstyle(DEFAULT_FONT,HORIZ_DIR,5);
    outtextxy(100,200,"HELLO WORLD!");
    setcolor(25);
    settextstyle(BOLD_FONT,HORIZ_DIR,5);
    outtextxy(100,300,"HELLO WORLD!");
    getch();
}

Output:

CG2

Code:

#include<iostream.h>
#include<conio.h>
#include<graphics.h>
void main(){
    
    int g=DETECT,gmode;
    initgraph(&g,&gmode,"C://TURBOC3//BGI");
    line(10,90,300,90);
    setcolor(10);
    rectangle(10,100,300,250);
setcolor(30);
    circle(100,180,50);
setcolor(15);
    line(160,230,200,120);
    line(200,120,240,230);
    line(240,230,160,230);

    getch();
}

Output:

Number To Equivalent InWords String

Code:
package com.nearur;

import java.util.Scanner;

public class English {

String[] ones= {"","one","two","three","four","five","six","seven","eight","nine","ten","eleven","twelve","thirteen","fourteen","fifteen","sixteen","seventeen","eighteen","ninteen"};
String[] tens= {"","","twenty","thirty","fourty","fifty","sixty","seventy","eighty","ninty"};
StringBuffer buffer=new StringBuffer();

String c(int n) {
if(n<0) {
return "Minus "+c(-n);
}else if(n<20) {
return ones[n];
}else if(n<100) {
return tens[n/10]+" "+ones[n%10];
}else if(n<1000) {
return c(n/100)+" hundred "+c(n%100);
}else if(n<100000) {
return c(n/1000)+" thousand "+c(n%1000);
}else if(n<10000000) {
return c(n/100000)+" lakh "+c(n%100000);
}else if(n<1000000000) {
return c(n/10000000)+" crore "+c(n%10000000);
}

return "";
}

public static void main(String[] args) {
English a=new English();
Scanner in =new Scanner(System.in);
System.out.print("Enter Any Number : ");
int n=in.nextInt();
System.out.println(a.c(n).toUpperCase());

}

}

Output:

Name In Binary

Code:

package com.nearur;

import java.util.Scanner;

public class NTB {


static StringBuffer buffer=new StringBuffer();
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
System.out.print("Enter Your Name:");
String a=in.nextLine();
String[] name=a.split(" ");

for(String x:name) {
convert(x);
}

System.out.println("Binary Code is : "+buffer.toString());
}

static void convert(String name) {

char[] a=name.toCharArray();
for(char x: a) {
binary((int)x);
buffer.append(" ");
}

}
static void binary(int n) {
while(n>0) {
if(n%2==0) {
buffer.append("0");
}else {
buffer.append("1");
}
n=n/2;
}
}


}

Output:

Computer Graphics (PUT PIXEL)

CODE:


#include<iostream.h>
#include<conio.h>
#include<graphics.h>
void main(){
int g=DETECT,gmode;
initgraph(&g,&gmode,"C://TURBOC3//BGI");
putpixel(100,100,10);
getch();
}


Output: