i cannot match the explanation with the problem statement…how it is?
Can we ask about the explanation of given test cases?
import java.util.Scanner;
class Puzzle
{
static int n,a[];
static int sum=0,statue,count,count1=0;
public static void main(String s[])
{
try
{
for(int j=0;j<50;j++)
{
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
if(n==0)
{
break;
}
count=0;
sum = 0;
count1++;
a=new int[n];
for(int i=0;i<n;i++)
{
a[i] = sc.nextInt();
sum = sum+a[i];
}
statue = sum/n;
for(int i=0; i<n;i++)
{
if(a[i]<=statue)
{
continue;
}
else
{
count=count + (a[i]-statue);
}
}
System.out.println(“Set #”+count1);
System.out.println(“The minimum number of moves is “+count+”.”);
}
}
catch(Exception e)
{
}
}
}
Can I change the alphabets after deleting to make the given string as palidrome?
sir i not understood this point can please explain it
At the beginning Chef has segment [0, X] and no points on it. On each step Chef chooses the subsegment of maximal length possible such as it contains no points on it.
Is there something in specific that needs to be done to get my queries answered?
I have posted queries adhering to the above mentioned guidelines and still never get a response, can you explain a reason why this could be the case. Thanks in advance…!
#include <stdio.h>
#include <math.h>
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
int a=0,b=0,c=0;
scanf("%d %d",&a,&b);
c=pow(a,b);
printf("%d\n",c);
}
return 0;
WHAT ERROE IN IT
}
i don’t get it
#include<stdio.h>
#include<math.h>
int main()
{
int a[10];
int i,t,p;
scanf("%d",&t);
if(t<=0)
{
p=0;
printf("%d\n",p);
}
else{
while(t>0)
{
int min1,min2;
p=0;
for(i=0;i<=9;i++)
{
scanf("%d",(a+i));
}
min1=a[1];
min2=1;
for(i=1;i<=9;i++)
{
if(min1>a[i])
{
min2=i;
min1=a[i];
}
}
if(min1>a[0])
{
p=min2;
p=ppow(10,a[0]+1);
}
else
{
for(i=0;i<=min1;i++)
p=p+min2pow(10,i);
}
printf("%d\n",p);
t–;
}
}
return 0;
}
check y this not true
Please do not post a Question as an answer here. If you want to ask a question, go to Discuss -> Forums -> Ask a Question.
I am new on this website. I have so many doubts while I participate in a contest. Can I ask them on the problem page by posting a comment? Will I be banned for asking something which is not relevant?
I am new on this website. I have so many doubts while I participate in a contest. Can I ask them on the problem page by posting a comment? Will I be banned for asking something which is not relevant?
Adobe Systems is hiring Software Engineers CTC:- 8-30 Lac, Exp:- 0-8 Years, Bangalore
Apply Here:- http://jobsiit.com/jobs/view/1876/Adobe-Systems/Software-Engineer
Check out the latest Coding jobs :- http://jobsiit.com/jobs/listing/Computer%20Science
package com.bhawna.CodeChef.easy;
import java.util.Scanner;
public class LuckyLong {
public static void main(String args[])
{
int number,mod,count=0;
Scanner scan=new Scanner(System.in);
System.out.println("Enter the number of test cases");
int testCases=scan.nextInt();
while(testCases>0)
{
count=0;
System.out.println("Enter a number");
number=(scan.nextInt());
while(number>0)
{
mod=number%10;
if((mod%7==0||mod%4==0))
{
}
else
{
count++;
}
number=number/10;
}
System.out.println(count);
testCases--;
}
}
}
#include<stdio.h>
#include<string.h>
main();
{
int n;
char c[2],k[2];
int i,t;
//printf(“enter the no of names”);
scanf("%d",&n);
for(t=0;t<n;t++)
{
scanf("%s",&c[t]);
scanf("%s",&k[t]);
}
strcmp (c[t],k[t]);
if (strcmp(c[t],k[t])==1)
{
printf("%s",k[t]);
}
for(t=0;t<n;t++)
{
i=atoi(c[t]);
printf(" %d",i);
}
return 0;
}
I AM NOT GETTING UR QUES MATRIX IN MARCH CHALLENGE ,WHAT IS THE DIFFERENCE BETWEEN QUERY 5&7
It says “Wrong Answer”.Code is working on my desktop compiler.
Here is the code.
Please help!
#include<stdio.h>
int main()
{
int i=0,j=0,max1=0,max2=0;
scanf("%d",&i);
int n[i],o[i];
while(j<i)
{
scanf("%d %d",&n[j],&o[j]);
j++;
}
j=0;
while(j<i)
{
if(max1<(n[j]-o[j]))
max1=n[j]-o[j];
if(max2<(o[j]-n[j]))
max2=o[j]-n[j];
j++;
}
if(max1>max2)
printf("1 %d",max1);
else
printf("2 %d",max2);
return 0;
}why i am getting wa on my problem
As I have karma = 1, I cannot comment on the problems of June challenge (I can, but it says “you comment screened out till admin’s approval”, and I got no answers yet), neither I can create new threads in discussions 
So, probably, someone will see my comment here and will comment on my behalf that I have strong suspicions that the problem CHPLGNS of June’s Challenge has incorrect test data set #9. If you solve the problem honestly testing for each pair of the polygons, which one is contained inside another one, it will detect that in the data set #9 there is a pair of polygons not lying one inside another (my implementation of this approach correctly passes all other test cases, showing, by the way, that in the test cases #### 4, 10 some of the polygons touch each other, though task’s authors replied many times in the comments that it never happens). So, there is another, simpler approach to solve the problem, valid if it is guaranteed, as in the task condition, that for each pair of the polygons one of them contains another. And this approach passes the set #9, though, in no way it really checks that the test-set satisfies task conditions.