Explanation:
Overlay analysis is an approach, taking in data from two or more layers to create a single output layer.
For example, if we have a layer of land use and a layer of soil fertility, we can derive from the two layers the percentage of agricultural land developed over fertile soil.
Ether get a new headset or take out the plug blow on it or wipe it or clean the inside of the computer where the headset wire goes
Answer:
Question is incomplete.
Assuming the below info to complete the question
You have a collection of n lockboxes and m gold keys. Each key unlocks at most one box. Without a matching key, the only way to open a box is to smash it with a hammer. Your baby brother has locked all your keys inside the boxes! Luckily, you know which keys (if any) are inside each box.
Detailed answer is written in explanation field.
Explanation:
We have to find the reachability using the directed graph G = (V, E)
In this V are boxes are considered to be non empty and it may contain key.
Edges E will have keys .
G will have directed edge b1b2 if in-case box b1 will have key to box b2 and box b1 contains one key in it.
Suppose if a key opens empty box or doesn’t contain useful key means can’t open anything , then it doesn’t belongs to any edge.
Now, If baby brother has chosen box B, then we have to estimate for other boxes reachability from B in Graph G.
If and only if all other boxes have directed path from box B then just by smashing box B we can get the key to box b1 till last box and we can unlock those.
After first search from B we can start marking all other vertex of graph G.
So algorithm will be O ( V +E ) = O (n+m) time.
Hi,
the program is as follows
___________________________________________________________
import java.io.*;
class doubleval
{
public static void main()throws IOException
{
DataInputStream dt=new DataInputStream(System.in);
System.out.println("Enter NUMBER WHOSE DOUBLE U WANT TO PRINT");
int n=Integer.parseInt(dt.readLine());
for(int i=n;i<=100;i=2*i)
{
System.out.println(i);
}
}
}
