// alt_tb_java

import java.util.*;
import java.util.Arrays;
import java.util.ArrayList;
public class alt_tab
{

public static void main(String args[])

{
int[] arr = {1,2,3,4};
int input1=4;
int input2=3;
List<Integer> input3 = new ArrayList<Integer>(arr.length);
for (int i : arr)
{
input3.add(i);
}
input3.add(0,input3.get(input2-1));
input3.remove(input2);
System.out.println(input3);

}
###########################################################################
//client and love for his number
package practice;
import java.util.Scanner;

public class Client_and_his_love_for_numbers {

public static void main(String args[]) {

Scanner in = new Scanner(System.in);

System.out.println("enter the no");
int n=in.nextInt();
int count=0,flag=0,flag1=0,i,j;
while(!(n==0||n==1)) {
for(i=n/2;i>=2;i--) {
for(j=2;j<i/2+1;j++) {
if(i%j==0) {
flag=1;
break;
}

}
if(flag==0) {
if(n%i==0) {
n=i;
flag1=1;
break;

}
}
else {
flag=0;
}
}

if(flag1==1) {
flag1=0;
}
 else {
n=n-1;
}

count++;
System.out.println("n:"+n);
}
System.out.println("count:"+count);

}
###########################################################################
3//coding marathon

import java.util.*;
import java.util.Arrays;
public class Coding_marathon
{

public static void main(String args[])

{ int sum=0;
int n=4 ;//total number of participants
int k=4;// number of toppers
int m,temp;
int[] arr = {1,2,3,4,5,6,4};
for (int i = 0; i <arr.length; i++)
{
for (int j = i + 1; j < arr.length; j++)
{
if (arr[i] < arr[j])
{
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
for(int i=0;i<k;i++)
{
sum=sum+arr[i];
}

System.out.println(sum);

}
}
############################################################################
4>Coding marathon
import java.util.Arrays;
public class kk_Coding_Marathon {

public static void main(String[] args) {

int input1=4;//does'nt require bcz initialization is already done there

int input2=2;//does'nt require bcz initialization is already done there
int input3[]= {4,1,2,5};//does'nt require bcz initialization is already
done there
Arrays.sort(input3);
 int sum=0;
for(int i=input1-1;i>=(input1-input2);i--) {
sum+=input3[i];
}

System.out.println(sum);//while writing a program instead of writing

this line write====> return(sum)

}
####################################################################
5>mayers exam

public class KK_Myers_Exam {

public static void main(String args[]) {

int input1;//does'nt require bcz initialization is already done there

int inut2[]=new int[100];//does'nt require
input1=5;//does'nt require
int k=0,sum=0,found=1;
int input2[]= {1,4,5,4,5};//does'nt require
int i,l;
for( i=1;i<input1;i++) {
while(found==1) {
for(l=0;l<i;l++) {
if(input2[i]==input2[l]) {
input2[i]++;
found=1;
break;
}
else
found=0;

}found=1;

}
for(int j=0;j<input1;j++) {

sum+=input2[j];
}

System.out.println("sum="+sum);//while writing a program instead of

writing this line write====> return(sum)
}

}
##########################################################################
6>kk_picnic

public class kk_picnic {

public static void main(String[] args) {

// TODO Auto-generated method stub
int input1=5;//does'nt require bcz initialization is already done there
int input2[]= {1,1,3,2,2};//does'nt require bcz initialization is
already done there
int count=0,k=0,found=1;
for(int i=1;i<input1;i++) {
for(int j=i-1;j>=k;j--) {
if(input2[i]==input2[j]) {

k=i+1;
found=1;
count++;
break;
}

}
}
System.out.println(count);//while writing a program instead
of writing this line write====> return(count)
}

}
##################################################################
6>Love letter
package practice;
import java.util.*;
import java.util.Scanner;
import java.util.Arrays;

public class Love_Letter {

public static void main(String args[]) {

Scanner sc=new Scanner(System.in);//does'nt require bcz initialization

is already done there
System.out.println("Enter the String");//does'nt require bcz
initialization is already done there
String s=sc.nextLine();//does'nt require bcz initialization is already
done there

System.out.println("enter the rotation");//does'nt require bcz

initialization is already done there
int n=sc.nextInt();//does'nt require bcz initialization is already done
there

String[] fs,fs1=new String[100];

fs=s.split(" ");
fs1=s.split(" ");
int count=0,flag=0;
for(int i=0;i<fs.length;i++) {

char[] c=new char[100];

c=fs[i].toCharArray();
int j=0;
while(n>flag) {
char d=c[i];
for( j=0;j<c.length-1;j++) {
c[j]=c[j+1];

}
c[j]=d;
flag++;
 }
flag=0;
fs[i]=String.valueOf(c);
if(fs[i].equals(fs1[i])) {
count++;
}

}
System.out.println("count="+count);//while writing a program instead of
writing this line write====> return(count)

}
}
###################################################################################
###############################
7>pizza delivery
package sukeerthslk;
import java.lang.Math;
import java.util.Scanner;

public class Pizza_delivery {

//function starts
public double maxTime(int input1,int input2, int[][] input3)
{
//input 1 is speed of Dan
//input 2 is X orders at X locations ie no of elements in the 2d matrix
//time=Distance/speed
{
double arr[]=new double[input2-1]; //arr is used to store all distances between
point
int count=0;
double time=0;
for (int i=0;i<input3.length-1;i++) //main logic of mettle code
{
double p=input3[i][0],q=input3[i+1][0], r=input3[i][1],s=input3[i+1][1];
arr[count]=Math.sqrt((q- p) * (q- p) + (s - r) * (s - r));
count++;

}
// to find maximum distance in distance array
double max = arr[0];
for (int i = 1; i < arr.length; i++)
{
if (arr[i] > max)
max = arr[i]; //max diistance
}

time=max/input1; //time= max distance/time;

//time should round to 6 decimal places so
double scale = Math.pow(10, 6);
return Math.round(time* scale) / scale;

}
//function ends
}
 public static void main(String[] args) //no need to write main method
{
Pizza_delivery func=new Pizza_delivery();
int input1,input2;
try (Scanner sc = new Scanner(System.in)) {
System.out.println("Input1:");
input1=sc.nextInt();
System.out.println("Input2:");
input2=sc.nextInt();
System.out.println("Input3:");
int[][] input3 = new int[input2][2];
for(int i=0; i<input2; i++)
{
for(int j=0; j<2; j++)
{
input3[i][j] = sc.nextInt();
}

}
double maxTime = func.maxTime(input1 ,input2,input3);
System.out.println(maxTime);
}

}
}

###################################################################################
############
8>sarena And flowers

public class Sarena_And_Flowers {

public static void main(String[] args) {

// TODO Auto-generated method stub
int input1=10;//does'nt require bcz initialization is already done
there
int input2=7;//does'nt require bcz initialization is already done there
int input3[]= {2,1,2,1,3,1,4,5,6,1};//does'nt require bcz
initialization is already done there
int count=1,i,j,found=1;
for(i=1;i<input2;i++) {
for(j=0;j<i;j++)
{
if(i==j)continue;
if(input3[i]==input3[j]) {
found=0;
break;
}
}
if(found==0) {
found=1;
}
else {
count++;
}
 }
System.out.println(count);//while writing a program instead of writing
this line write====> return(count)

}
###################################################################################
####
9>Topology

import java.util.*;
public class NewClass
{
public static int find_topo(int m,int n)
{
int topo;
if((m-n)==1)
{
return(1);
}
else if(n==m)
{
return(3);
}
else if(n==m-1)
{
return(2);
}
return(-1);
}

public static void main(String[] args)

{

int a = 4;
int m=3;
int ans;
ans=find_topo(a,m);
System.out.println(ans);
}

###################################################################################
######
10>Zombies

import java.util.*;
import java.util.Arrays;
import java.util.ArrayList;
public class NewClass
{
 public static int common_divisor(int n1,int n2)
{ int gcd=1;
for(int i=1;i<=n1 && i<=n2 ;++i)
{
if(n1 %i==0 && n2%i==0)
gcd=i;
}
if(gcd==1)
{
return(1);
}
else
{
return(0);
}
}

public static void main(String args[])

{
int[] arr = {2,4,6,8,10,12,14,3};//percentage of zombies
ArrayList<Integer> perfect_city = new ArrayList<Integer>(100);
int n=arr.length;// number of cities
int n1=0;
int n2=0;

for(int i=0;i<n-1;i++)
{ int flag1=0;
int flag2=0;
n1=arr[i];

n2=arr[i+1];
flag1=common_divisor(n1,n2);
if( n1>n2)
{
flag2=1;
}
if(flag1==1 && flag2==1)
{
perfect_city.add(arr[i]);
}
}
System.out.println(perfect_city);//to print all perfect cities
System.out.println(perfect_city.get(0));// to print left most index of
perfect cities
}

}
###################################################################################
##############################
11>Magical stick
import java.util.Arrays;
public class kk_magical_stick {

public static void main(String[] args) {

int n=3;
 int input2[]= {1,2,3};
int input3[]= {20,30,40};
int sum=0;
int dif=0;

int a[]=new int [n];

for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
if(i==j) {
continue;

if(input2[j]>input2[i]) {
dif=input2[j]-input2[i];
sum+=(dif*input3[j]);

}
if(input2[j]<input2[i]) {
dif=input2[i]-input2[j];
sum+=(dif*input3[j]);

}
a[i]=sum;
sum=0;

}
Arrays.sort(a);

System.out.println(a[0]);

}
###################################################################################
##########################
12>Placement session begins

public class kk_placement_session_begins {

public static void main(String[] args) {

// TODO Auto-generated method stub

int input1=5;
int input2[]= {3,4,1,5,2};
int a[]=new int[100];
int count=0;
for(int i=input1-1;i>=1;i--) {
for(int j=i-1;j>=0;j--) {
if(input2[i]<input2[j]) {
count++;

}
 a[i]=count;

count=0;
}
a[0]=0;
for(int i=0;i<input1;i++) {
System.out.println(a[i]);
}