i tried the suggested input in following code:-
t=int(input())
li=[1,2,3,4,5,6,7]
y=’’;l=[]
is_this_true=True
for i in range(t):
le=int(input())
l+=(map(int,input().split()))
mid =le//2
for k in li:
if k not in l:
is_this_true=False
break
for j in range(mid):
if (l[mid-j]==l[mid+j]) and (l[j]+1==l[j+1] or l[j]==l[j+1]) and (is_this_true) and l[mid]==7:
y=“yes”
else:
y=“no”
break
print(y)
l=[]
is the answer “no” for this input??
this is a partially correct answer, I am not getting the cases that might give error…please suggest some cases that might go wrong in this code of " chef and pairs" https://www.codechef.com/viewsolution/56786343
i wrote this code for problem chef and proxy, it is working alright for me but it is showing that answer is not correct , please point out the mistake!!! https://www.codechef.com/viewsolution/58536954
hii,im new to competitive programming and when im trying this particular program i was getting my desired output but it shows partially correct can you please look into it and guide me : CodeChef: Practical coding for everyone
Hey guys , im 20 and in 2nd year of my university. I was exploring into competitive programming and had a question in mind that is 20 too late as a start to be good at CP? I have aims on getting to the top charts. Plus some advices needed as a begginer in CP !
Hey… I’ve been stuck at this question for quite some time now… Review: ArrayList Operations – CodeChef: Practical coding for everyone
All sample test cases are passing but still getting wrong answer while submitting… not able to figure out which test case it is failing for
Here’s my code :
import java.util.*;
class Codechef
{
public static void main (String[] args)
{
Scanner read = new Scanner(System.in);
int t = read.nextInt();
for(int i=0; i<t; i++)
{
ArrayList a = new ArrayList();
int n = read.nextInt();
for(int j=1; j<=n; j++){
int ele = read.nextInt();
a.add(ele);
}
// Update the code below to solve this problem
for(int j=0; j<a.size()-1;){
if(j<a.size()-1 && a.get(j)==a.get(j+1) || j>0 && a.get(j)==a.get(j-1)){
a.remove(j);
}
else j++;
}