int a[]=new int[N];
while(true)
{
int z=0;
for(int i=1;i<N;i++)
{
a[i]=i+1;
}
boolean b=true;
for(int i=0;i<N && i!=Integer.MAX_VALUE;i++)
{
if(b)
{
a[i]=Integer.MAX_VALUE;
b=false;
}
else
b=true;
if(a[i]!=Integer.MAX_VALUE)
z++;
}
if(z==1)
return z;
}
โ๏ธโ๏ธ
Block code
while(true)
{
int z=0;
for(int i=1;i<N;i++)
{
a[i]=i+1;
}
boolean b=true;
for(int i=0;i<N && i!=Integer.MAX_VALUE;i++)
{
if(b)
{
a[i]=Integer.MAX_VALUE;
b=false;
}
else
b=true;
if(a[i]!=Integer.MAX_VALUE)
z++;
}
if(z==1)
return z;
}
โ๏ธโ๏ธ
Block code
Forwarded from Vaibhav Choubey
Forwarded from Deleted Account
Mindtree _C1_ JD_(2021_off-campus).pdf
575.6 KB
https://www.techgig.com/codegladiators
Last date 29th July
๐คฆโโ๐คฆโโ๐คฆโโ
Ab me July me hi dunga
Last date 29th July
๐คฆโโ๐คฆโโ๐คฆโโ
Ab me July me hi dunga
Forwarded from Mradal Tiwari
ยฐยฐยฐ Warning ยฐยฐยฐยฐ
Plz don't send pm for solutions of mcq questions
Post your questions here you will get solutions
๐๐
Plz don't send pm for solutions of mcq questions
Post your questions here you will get solutions
๐๐