Home

Chef of Codechef help you to solve programming question of codechef.

For HacherRank Problem solving doubt visit below given link :-
https://hackofhackerrank.blogspot.com/2020/08/home.html

For any doubts in codechef question you may write in this as a comment.

Winner Winner Chicken Dinner
  

Comments

  1. Manikanta Matta5 July 2020 at 08:23

    Chefina has two sequences A1,A2,…,AN and B1,B2,…,BN. She views two sequences with length N as identical if, after they are sorted in non-decreasing order, the i-th element of one sequence is equal to the i-th element of the other sequence for each i (1≤i≤N).

    To impress Chefina, Chef wants to make the sequences identical. He may perform the following operation zero or more times: choose two integers i and j (1≤i,j≤N) and swap Ai with Bj. The cost of each such operation is min(Ai,Bj).

    You have to find the minimum total cost with which Chef can make the two sequences identical.

    ReplyDelete
    Replies
    1. Dhruv Fadadu31 August 2020 at 06:14

      Sorry Manikanta for late reply, but for this question I require a sample of output and input of this if you can provide it to me in comment.

      Delete
  2. आयुष22 September 2020 at 07:19

    Please help me in solving this question
    https://www.codechef.com/problems/RGAME

    ReplyDelete

Post a Comment

Popular posts from this blog

Download file

  Question :      Download file  (Codechef Problem)                        Problem Code:  DWNLD Solution in C++ : #include <iostream> using namespace std; int main() { int tc; //testcase cin>>tc; for(int j=0;j<tc;j++) {     int number,k,temp=0,net,price=0;     cin>>number>>k;     for(int i=0;i<number;i++)     {         int t,d;    //time and data         cin>>t>>d;         temp=temp+t;         if(temp>k)         {             net = temp-k;             if(net<t){                 price=net*d;             }             else                 price=price+(t*d);         }     }     cout<<price<<"\n"; } return 0; }  
Read more

Days in Month

Question :- https://www.codechef.com/problems/NW1 Solution in C language :- #include <stdio.h> #include<string.h> int main(void) { // your code goes here int q,i; scanf("%d",&q); for(i=0;i<q;i++){     int temp , j , w , c=1 , a[7]={ };     char s[6]="\0";     scanf("%d",&w);     scanf("%s",s);     if(strcmp(s,"mon")==0){         temp=0;         a[0]=1;     }     else if(strcmp(s,"tues")==0){         a[1]=1;         temp=1;     }     else if(strcmp(s,"wed")==0){         a[2]=1;         temp=2;     }     else if(strcmp(s,"thurs")==0){         a[3]=1;         temp=3;     }     else if(strcmp(s,"fri")==0){         a[4]=1;         temp=4;     }     else if(strcmp(s,"sat")==0){         a[5]=1;         temp=5;     }     else if(strcmp(s,"sun")==0){         a[6]=1;         temp=6;  
Read more