Akamai Interview Question
Computer ScientistsCountry: India
Interview Type: Phone Interview
import java.util.Scanner;
class Shil_Treasure {
private static Scanner scan;
static long LCM(long x, long y)
{
long a;
a = (x > y) ? x : y; // a is greater number
while(true)
{
if(a % x == 0 && a % y == 0)
return a;
++a;
}
}
public static void main(String [] args) {
int n,i,nq;
scan = new Scanner(System.in);
n=scan.nextInt();
int[] a=new int[n];
int[] q1=new int[n];
int[] q2=new int[n];
int[] q3=new int[n];
for(i=0;i<n;i++)
{
a[i]=(int) scan.nextLong();
}
nq=(int) scan.nextLong();
for(i=0;i<nq;i++)
{
q1[i]=(int) scan.nextLong();
q2[i]=(int) scan.nextLong();
q3[i]=(int) scan.nextLong();
}
for(i=0;i<nq;i++)
{
if(q1[i]==1)
{
a[q2[i]-1]=q3[i];
}
else if(q1[i]==2)
{
System.out.println(LCM(a[q2[i]-1],a[q3[i]-1]));
}
}
}
}
import java.util.Scanner;
class Shil_Treasure {
private static Scanner scan;
static long LCM(long x, long y)
{
long a;
a = (x > y) ? x : y; // a is greater number
while(true)
{
if(a % x == 0 && a % y == 0)
return a;
++a;
}
}
public static void main(String [] args) {
int n,i,nq;
scan = new Scanner(System.in);
n=scan.nextInt();
int[] a=new int[n];
int[] q1=new int[n];
int[] q2=new int[n];
int[] q3=new int[n];
for(i=0;i<n;i++)
{
a[i]=(int) scan.nextLong();
}
nq=(int) scan.nextLong();
for(i=0;i<nq;i++)
{
q1[i]=(int) scan.nextLong();
q2[i]=(int) scan.nextLong();
q3[i]=(int) scan.nextLong();
}
for(i=0;i<nq;i++)
{
if(q1[i]==1)
{
a[q2[i]-1]=q3[i];
}
else if(q1[i]==2)
{
System.out.println( LCM(a[q2[i]-1],a[q3[i]-1])%1000000007 );
}
}
}
}
which algorithm i have to used ?? for this problem ???
- sunilkanaujia.manit August 14, 2015