Codechef challenges

1

What is the difference between cookoff, lunchtime, and starters except for the time duration?
Is there any difficulty difference?

2

Cook-off feels harder than lunch time and obviously starters is easier than that.
Also, I think cookoff doesn’t have partially correct solutions while lunchtime does

4

for more increase you have to solve 5.

5

I did 4 too, but I got +67. I did the first 3 very fast. It depends on how fast you submit too.

7

yeah and then u copied solution from youtube .

@abhinav_rajput
https://www.codechef.com/viewsolution/48014895

8

I DID THAT BY MYSELF KID
ACCORDING TO YOU, EVERYONE WHO DID THAT IN CPP IS A CHEATER
LMAO
SOMEONE WHO CODES IN PY IS SAYING THAT LOL

9

solutions that match with yours

https://www.codechef.com/viewsolution/48016894

https://www.codechef.com/viewsolution/48017050

https://www.codechef.com/viewsolution/48016973

https://www.codechef.com/viewsolution/48017241

https://www.codechef.com/viewsolution/48017241

and a thousand more

10

lol may of them just created the method before and some of them created the method after the main.
Their approach is same it does not mean that they cheated

11

I wrote that code in java too before that, it was giving me tle because of nested for, that’s why i used c to code it.
except that tle my logic was correct in java
Now you’ll also say that I cheated the java sol too but unfotunately it gave me tle
unlucky

12

not the approach bro . everything is same . cant u see . creating method before and after is not what i am saying . i am saying about the logic

13

since when c is not having nested loops :joy:

14

yeah I know the logic is same, but it does not mean that everyone cheated.
If you match the first or second question You’ll find the many of ppl applied same logic in that too.
Anyways, if someone is cheating, it’s his or her loss, you are not getting job from the code chef ranks.
If i have cheated according to you, maybe the’ll ban me in furure and I wont get better in coding anyways.
so it’s tatally my loss why are you worried.?

15

nested loops are there in every language ,
binary search can be done in any language. point is not that . ur solution matches compltely with others.thats the point

16

i already tried to do that with the binary search in java and it was giving me tle
if you want my java code I can give you that
that’s why I did not used binary search in cpp

17

i am not worried abt u . i am worried abt the amount of cheating happening

19

here is the code that I did in java after the contest end (Fixed TLE with binary search), if you doubt my logic building LMAO.

package JAVA;
import java.util.*;

public class codeChefCookOffQ3 {
    public static int bSearch(long[] arr, long value) {
        int p = 0;
        int r = arr.length - 1;
        while (p <= r) {
            int q = (p + r) / 2;
            if (arr[q] == value)  return q;
            else if (arr[q] > value)  r = q - 1;
            else p = q + 1;
        }
        return (p+r)/2;
    }
    public static void main(String []args){
        Scanner sc=new Scanner(System.in);

        int n=sc.nextInt();
        int q=sc.nextInt();
        long[] arr =new long[n];
        for (int j=0;j<n;j++){
            arr[j]=sc.nextLong();
        }
        Arrays.sort(arr);
        for (int j=0;j<q;j++){
            long x=sc.nextLong();
            int y=bSearch(arr,x);
            if (y>=n){
                y=n-1;
            }
            if (arr[y]==x){
                System.out.println(0);
            }
            else {
                int count;
                if (arr[y]<x){
                    count = n - y - 1;
                }

                else{
                    count = n - y;
                }
                if (count%2==0) {
                    System.out.println("POSITIVE");
                }
                else {
                    System.out.println("NEGATIVE");
                }
            }
        }
    }
}
20

dude what do you mean ?
is it not possible to learn the logic in a day if u cheat ???

21

then y didnt u build this logic yesterday

22

i dont doubt u and i dont even know you .
all i am saying that the code matches with other solutions . completely

23

whatever,
go ahead and report then
oh wait you already did that lol
now
I don’t have any shit left to prove that I did that by myself
bey
have a good day