├── Array ├── Take_discount_or_Not.exe ├── .vscode │ └── settings.json ├── MIN_To_MAX.bin ├── MIN_To_MAX.exe ├── Take_discount_or_Not.bin ├── Find_maximum_in_an_Array.bin ├── Find_maximum_in_an_Array.exe ├── Largest_and_Second_Largest.bin ├── Largest_and_Second_Largest.exe ├── Search_an_element_in_an_array.bin ├── Search_an_element_in_an_array.exe ├── Find_maximum_in_an_Array.cpp ├── .cph │ ├── .MIN_To_MAX.cpp_92634091d02fe2a0edfc59269eb00f9f.prob │ ├── .Sum_of_Array_elements.cpp_eef60295182a2e6a903a5f42a31ebf82.prob │ ├── .Duplicate_Integers.cpp_741919966786ee68a492fd0dfebfbb3f.prob │ ├── .Find_maximum_in_an_Array.cpp_f37ef5ead6b29c472d398737ffc7070f.prob │ ├── .Vector_Introduction.cpp_ed5c05d4d5ff57bce56ef780500b8fc7.prob │ ├── .Maximum_Subarray_Sum.cpp_0a675911200d791ed8b08aba583fd1d3.prob │ ├── .Leader_of_an_Array.cpp_e66130db654ccc541b0bdab08511b13a.prob │ └── .Search_an_element_in_an_array.cpp_c19b9211efdc32f8cfd90b36157880c3.prob ├── Search_an_element_in_an_array.cpp ├── MIN_To_MAX.cpp └── Largest_and_Second_Largest.cpp ├── .vscode ├── settings.json └── c_cpp_properties.json ├── Basic Math ├── Fitness.bin ├── Fitness.exe ├── Candy_Store.bin ├── Candy_Store.exe ├── Find_Remainder.bin ├── Find_Remainder.exe ├── Sum_of_Digits.bin ├── Sum_of_Digits.exe ├── Favourite_Numbers.bin ├── Favourite_Numbers.exe ├── Scalene_Triangle.bin ├── Chef_and_Chocolates.bin ├── Chef_and_Chocolates.exe ├── Second_Max_of_Three_Numbers.bin ├── Second_Max_of_Three_Numbers.exe ├── Fitness.cpp ├── Find_Remainder.cpp ├── Chef_and_Chocolates.cpp ├── Second_Max_of_Three_Numbers.cpp ├── Candy_Store.cpp ├── Sum_of_Digits.cpp ├── Scalene_Triangle.cpp └── Favourite_Numbers.cpp ├── Sorting ├── 400_M_Race.bin ├── 400_M_Race.exe ├── Passing_Marks.bin ├── Passing_Marks.exe ├── Simple_Sorting.bin ├── Simple_Sorting.exe ├── Simple_Sorting.cpp └── Passing_Marks.cpp ├── String ├── DNA_Storage.bin ├── DNA_Storage.exe ├── Additional_Sample_1.bin ├── Additional_Sample_1.exe ├── Convert_String_to_Title_Case.exe ├── Different_Consecutive_Characters.bin ├── Different_Consecutive_Characters.exe ├── Convert_String_to_Title_Case.cpp ├── Additional_Sample_1.cpp ├── Different_Consecutive_Characters.cpp └── DNA_Storage.cpp ├── 500 difficulty rating ├── .vscode │ └── settings.json ├── .cph │ ├── .2000.cpp_e1a1d89266df1b7441e93920eef9991b.prob │ ├── .Fever.cpp_b9242e908f4c439736d9e59bd0a308ec.prob │ ├── .Parity.cpp_7ac4920944aadc7d6955886ffb26df5b.prob │ ├── .Ageing.cpp_f7d219ed0f2ce7fb8eaf36c3d826d0d5.prob │ ├── .Lunchtime.cpp_9d0b336eb235f8f29589ca5803e8b228.prob │ ├── .Sum_it.cpp_43f3aeb3cd6c6646af6e1c7e793c9413.prob │ ├── .Discount.cpp_ad1cab231c07740d756b43c34cd74bf5.prob │ ├── .Tyre_problem.cpp_2358867c8c25569b00387fdbd6f85c7f.prob │ ├── .Chess_Time.cpp_18a9d065caecf1563105a999d445a6e8.prob │ ├── .Couple_Game.cpp_f4a15128ddaafd2b41a0967062d14a24.prob │ ├── .Battery_Low.cpp_4851b7f35dc08fe32880e26f0ef284b1.prob │ ├── .Fill_the_Bucket.cpp_7d7ea02dd770009438e9aeb5a648fb51.prob │ ├── .Insurance.cpp_c5cd68c85f3202ee9663ea80730ffa17.prob │ ├── .Mana_Points.cpp_d6a50b0dbe939ba3fe5f3c6adef720bd.prob │ ├── .Playlist.cpp_f099236db54e0a6ddb41c4cfe5c25b8f.prob │ ├── .Best_Coupon.cpp_09834f58a9ffee380323d45b13b8ddbf.prob │ ├── .Chef_Plays_Ludo.cpp_9c4ea6fe54da229155be61f78b4e6bfd.prob │ ├── .Miami_GP.cpp_2d816e6c4a67b128c125013a1b16b5b9.prob │ ├── .Six_Friends.cpp_f04ea36e2ef22487630c575830e77d61.prob │ ├── .Volume_Control.cpp_8d59092322df3da2286fb5b5480f0a56.prob │ ├── .Who_is_taller.cpp_04b0231c1a9efdd9756953fd6dcc0157.prob │ ├── .Instagram.cpp_2ce4ace5b96aa2c7095bb453abfe1442.prob │ ├── .Is_it_hot_or_cold.cpp_df4ff7a59a3c480251f134363dbf8830.prob │ ├── .Minimum_Coins.cpp_9f1801e61c7db84b46a1e6027a01c904.prob │ ├── .Netflix.cpp_a08055c865c3e4f9d469cdfe098b2951.prob │ ├── .Parliament.cpp_417fd18303573e4c5e347529722d3539.prob │ ├── .Reach_Home.cpp_4ecb5391c8c30749cf59016e74e12e28.prob │ ├── .Saving_Taxes.cpp_1a452ab9b611d120013926a847e627c2.prob │ ├── .Sum_of_Digits.cpp_6257c5d0d5eb1f8f4464caa3694f36db.prob │ ├── .Waiting_Time.cpp_95c93f159e5c731b0b23fd7179bf3b01.prob │ ├── .Water_Requirement.cpp_19f5ca4a04059d0f67673a5c63033eaf.prob │ ├── .Candy_Division.cpp_c097337b35a4dfcafefb439e681fc656.prob │ ├── .Car_Trip.cpp_dba1680d34354e3ce30b0c44941440ff.prob │ ├── .Donation_Drive.cpp_effba6ddb31eea6996529fd2ebb2dcfd.prob │ ├── .Read_Pages.cpp_c876f350a47f67dc339bcb986fe61bbb.prob │ ├── .Right_There.cpp_0e175b7aa0c31a370b5ca5b4db1887bf.prob │ ├── .Sleep_deprivation.cpp_19d8241527b252820e2d56d5e504e03f.prob │ ├── .Spice_Level.cpp_ad72f22c048b780ef348fd6c4c11a27b.prob │ ├── .Battery_Health.cpp_3d450a28392ffde27f7207a9b35463b1.prob │ ├── .Best_of_Two.cpp_3bd778d4d059a51285bc44405b8605e0.prob │ ├── .Chef_On_Date.cpp_ef3fe5306c4e8f37fc812cb80cbd348a.prob │ ├── .Chef_and_Gym.cpp_291856311b0d3841625c5a2b3ee937a5.prob │ ├── .Clear_Day.cpp_5b0c344f01415cf897f4b88ee1f96dfa.prob │ ├── .Counting_Words.cpp_f4e31b6c3002691af2e087a2e3754282.prob │ ├── .Ezio_and_Guards.cpp_21c807b47e949b24dffe7a874c87c112.prob │ ├── .Four_Tickets.cpp_5ec4e7370da27496c8b6c1ca27c7de4b.prob │ ├── .IPL_Ticket_Rush.cpp_b865a63ec621a1fc0e442a2bbc70d91d.prob │ ├── .Bull_or_Bear.cpp_4fac212481877dee4341e59c4aa77a73.prob │ ├── .Chef_and_Chocolates.cpp_e8e37e85f92964eab582612278384e60.prob │ ├── .Get_Subscription.cpp_eabb7d2daa195fb25fd8d7d80501f7b9.prob │ ├── .Kitchen_Timings.cpp_d1afd87bfb60f9073c7703523f4751bd.prob │ ├── .Masterchef_finals.cpp_531c41347887ccc919f4255ecebd0d37.prob │ ├── .Monthly_Budget.cpp_2ab2293838e4535b84e0497509fab914.prob │ ├── .Off_By_One.cpp_4af2d1dbe3fd87893c76993cfdedf773.prob │ ├── .Passes_for_Fair.cpp_67b79dcd675ab8485e5f4e4593c21de6.prob │ ├── .The_Cheaper_Cab.cpp_d7be4f50abb62b6ef2f8de3cc8acbf7f.prob │ ├── .Audible_Range.cpp_397c315fcca2ae0d0aaa035e5c85d96a.prob │ ├── .Biryani_classes.cpp_45634b0e82817aff3e2940c5b1815bf7.prob │ ├── .Chef_and_Chapters.cpp_f1f3a2d9886004f78e006e4eaa2fd3a3.prob │ ├── .Chef_and_Donation.cpp_2b60e2c2f9d1208a3d7fd95786dd6d84.prob │ ├── .Increase_IQ.cpp_4014537111fbef3b40efff9df0f8886a.prob │ ├── .MATH_1_Enrolment.cpp_20609ecb799cb0cf2fcfce89b93d6d0a.prob │ ├── .Maximum_Submissions.cpp_a866bfba79ffb3d350148e603b4bb667.prob │ ├── .Reach_on_Time.cpp_7336a2df4b634a513309e69dd3eb9bd5.prob │ ├── .Roller_Coaster.cpp_08e86aa012401551e0aec4070447457b.prob │ ├── .TV_Discount.cpp_7dc69d95fc35e4dfbd7619b43146e6de.prob │ ├── .The_Gift.cpp_e1098d7f76e3f3716bb7cd8194294a9d.prob │ ├── .The_Mango_Truck.cpp_022923cc906d04f6026d1e228c9eac31.prob │ ├── .Bidding.cpp_dcea263c93c7e11c2699b986d2572930.prob │ ├── .Broken_Phone.cpp_0e8ed94fbbb641cda0308d8b6ed8168a.prob │ ├── .Dominant_Army.cpp_da16ee3590655eadb9f7760be9901331.prob │ ├── .Donation_Rewards.cpp_6f09e7c2777452920d7a66314e486edf.prob │ ├── .First_and_Last_Digit.cpp_ae8e68fe0849350e01b8cc205b08559f.prob │ ├── .Profit_Increment.cpp_ad4d0e71746d012799106c19ceffb25e.prob │ ├── .Rain_in_Chefland.cpp_442000ed49670775c0be4414fe476925.prob │ ├── .Time_Complexity.cpp_ee2c32c29cf3c71960618d11c65347b1.prob │ ├── .True_and_False_Paper.cpp_044f21b8d6a4bab7a6a6f311d62481c6.prob │ ├── .Chairs_Requirement.cpp_1602659a556c09a750e1a4dd02968255.prob │ ├── .Credit_score.cpp_bc2c42aa3af5090086f2414658b7cfed.prob │ ├── .Enormous_Input_Test.cpp_69d147b5dbbe5c02e8cfc996223ed5ca.prob │ ├── .Final_Population.cpp_d5463dad1496d70da061f91371e65143.prob │ ├── .Reach_the_Target.cpp_84b6d3678b1db6230a9f3e95ad798505.prob │ ├── .Speciality.cpp_2aaf296dda22ab121449527a485e4959.prob │ ├── .Bob_at_the_Bank.cpp_41514f73cc5e1f332104240af372ac25.prob │ ├── .Bone_Appetit.cpp_63f5b854395166e6fd583a2f2fa138dd.prob │ ├── .Determine_the_Score.cpp_179fd995740210a2666a1a087c8100dd.prob │ ├── .Just_One_More_Episode.cpp_a76715a41ec3fa6a2c5ab2dc8e772cf6.prob │ ├── .Lucky_Seven.cpp_546d5fe8b832254cfd0eb1066cf805cf.prob │ ├── .Pending_Assignments.cpp_38ef0f42882843458fe3d6f183ae72c6.prob │ ├── .Tom_and_Jerry_Chase.cpp_bffac30ca522cfc14d92e858632dc861.prob │ ├── .Chef_and_Masks.cpp_04a08c230d5f8914a9e70432d6c847e6.prob │ ├── .Chef_gives_Party.cpp_66ae79e3cd2eceb1c9d47455eec7c7a7.prob │ ├── .Codechef_Airlines.cpp_553f1614d87879cc491d95ede99d251d.prob │ ├── .Course_Registration.cpp_f2c298d2fde69e6694006c087d48b02d.prob │ ├── .Multivitamin_Tablets.cpp_f3a613ddd8e37bf0801eca1425b4eecf.prob │ ├── .Interior_Design.cpp_c94bfe6ec93623fdf3c6fa70ecc5b5d5.prob │ ├── .Monopoly_in_Chefland.cpp_1612ac22820864649c57f3d85bd65df0.prob │ ├── .Overspeeding_Fine.cpp_afdb509ed7c53bccd74552e98b69bbd5.prob │ ├── .Total_Prize_Money.cpp_8f5ee2e0df01d643bef6adf1c9e5cb7e.prob │ ├── .Chef_and_Wire_Frames.cpp_81275210639832c58d036a99672018ef.prob │ ├── .Good_Investment_or_Not.cpp_61d7d3beeee8f8091a9b9621a1646aa6.prob │ ├── .Height_of_Rationals.cpp_d80536b2302a80ca2d5baaa4c1f7f187.prob │ ├── .Second_Max_of_Three_Numbers.cpp_7d153c64db09677b2ba9a15262b5d4ea.prob │ ├── .Double_Rent.cpp_110e8dd071092d98daecb45068b3612a.prob │ ├── .Puzzle_Hunt.cpp_b04568236507bd397dc60010803f1f48.prob │ ├── .ATM.cpp_e67926dd691116c984e7d4446ab20126.prob │ ├── .Bucket_and_Water_Flow.cpp_70b16feaec6707178ed78300259fe7aa.prob │ ├── .Cricket_World_Cup_Qualifier.cpp_b596a55389c96c3a5e0834b27ee3baa6.prob │ ├── .404_Not_Found.cpp_800b96cf154b22c6306fd45a5f68bd02.prob │ ├── .October_Marathon.cpp_834e6a0f68078621eec11c51747569b4.prob │ ├── .Messi_vs_Ronaldo.cpp_7681ff0b7c5d097d655953d394bbae1e.prob │ ├── .Air_Quality_Index.cpp_70244244067c8816190b8158cfec5e34.prob │ ├── .How_many_unattempted_problems.cpp_28f191baa5f03904adabcfd811d11941.prob │ └── .Practice_makes_us_perfect.cpp_c52f2d5dda0da9ab75e7622d9c83644f.prob ├── The_Gift.cpp ├── Height_of_Rationals.cpp ├── ATM.cpp ├── Maximum_Submissions.cpp ├── Fill_the_Bucket.cpp ├── Get_Subscription.cpp ├── Instagram.cpp ├── Minimum_Coins.cpp ├── Volume_Control.cpp ├── Chef_and_Chapters.cpp ├── Discount.cpp ├── Time_Complexity.cpp ├── Ezio_and_Guards.cpp ├── Good_Investment_or_Not.cpp ├── True_and_False_Paper.cpp ├── Best_of_Two.cpp ├── Dominant_Army.cpp ├── Final_Population.cpp ├── Multivitamin_Tablets.cpp ├── Chef_gives_Party.cpp ├── Is_it_hot_or_cold.cpp ├── Miami_GP.cpp ├── Sum_it.cpp ├── Chef_and_Chocolates.cpp ├── Best_Coupon.cpp ├── Reach_Home.cpp ├── Car_Trip.cpp ├── Chef_and_Wire_Frames.cpp ├── Lucky_Seven.cpp ├── First_and_Last_Digit.cpp ├── Profit_Increment.cpp ├── Six_Friends.cpp ├── 2000.cpp ├── Off_By_One.cpp ├── Double_Rent.cpp ├── Puzzle_Hunt.cpp ├── Chef_and_Gym.cpp ├── Credit_score.cpp ├── Spice_Level.cpp ├── Air_Quality_Index.cpp ├── The_Cheaper_Cab.cpp ├── Donation_Rewards.cpp ├── Cricket_World_Cup_Qualifier.cpp ├── Chef_and_Masks.cpp ├── Counting_Words.cpp ├── Increase_IQ.cpp ├── Overspeeding_Fine.cpp ├── Broken_Phone.cpp ├── Bone_Appetit.cpp ├── Clear_Day.cpp ├── How_many_unattempted_problems.cpp ├── Rain_in_Chefland.cpp ├── Speciality.cpp ├── 404_Not_Found.cpp ├── Ageing.cpp ├── Candy_Division.cpp ├── Chef_and_Donation.cpp ├── Mana_Points.cpp ├── Parity.cpp └── Battery_Low.cpp ├── 500 to 1000 difficulty problems ├── .vscode │ ├── settings.json │ └── c_cpp_properties.json ├── .cph │ ├── .CRED_Coins.cpp_19a67aa5218b4c8675e1c9b9b13debf4.prob │ ├── .Exams.cpp_f0bcaeb5523bd62e9c9d73fa3763acb2.prob │ ├── .Jenga_Night.cpp_62361d8ef636bca668e38ef0c55ff8c5.prob │ ├── .Car_or_Bike.cpp_44f744298d3dca79aa3e7a47024eda49.prob │ ├── .Sale_Season.cpp_fc0e906e06a02c61340896f2dc9e8a74.prob │ ├── .Discus_Throw.cpp_41ce9d373575aa9a7cccb1c5a6c9ce00.prob │ ├── .Expert_Setter.cpp_358483da0199b674d65c4015e4c7c865.prob │ ├── .Flip_the_cards.cpp_dd07bea7a3b13cbbe64065c20d547951.prob │ ├── .Minimum_Pizzas.cpp_396719b7af6b2a1cdba8fb2660c030bb.prob │ ├── .Good_Program.cpp_e8774e8e49c3a28db29b1b08912cda59.prob │ ├── .Subscriptions.cpp_79b733a0f5e47891e7d9a4029c54cb21.prob │ ├── .Chef_in_his_Office.cpp_5e58f1ad2a7f000df307e2ac56999734.prob │ ├── .Monopoly.cpp_b7fab7a9aeb1085d04fa5ffbdc33a11b.prob │ ├── .Chef_and_Candies.cpp_33e8616f9e2a29038ce771ea8a5d94dd.prob │ ├── .Count_the_Notebooks.cpp_2f489f93c835ea8eccfba9a8509b8c8d.prob │ ├── .Sasta_Shark_Tank.cpp_dd07b80c4391c273eefee8f5c6ddd29d.prob │ ├── .Test_Score.cpp_3fe9b3af2fef1ae85262628ad6a1bb1b.prob │ ├── .Minimum_Cars_required.cpp_2a67ba36276e4eb5f1c4d718f8c12806.prob │ ├── .Chefland_Games.cpp_2578066def2fa707d6fed9a18eba9269.prob │ ├── .Janmansh_and_Assignments.cpp_504069c93e4d441f1c747eec2db85650.prob │ ├── .Maximise_the_Tastiness.cpp_859801f2565944b3a0af7fbae7fc0d50.prob │ ├── .Chef_and_NextGen.cpp_73931d40cf132c331fb5f4a4e6d72a50.prob │ ├── .Greater_Average.cpp_1d3666f32e30d0beaefe591e88416554.prob │ ├── .Qualify_the_round.cpp_6d694d15b276c9786347bf6a9977895d.prob │ ├── .Reverse_The_Number.cpp_3044988b1938bc6043489c4b20b7b524.prob │ ├── .Sugarcane_Juice_Business.cpp_146189ac939f1da4b970ea16108e3501.prob │ ├── .The_Three_Topics.cpp_2b695a62a527918addcf278f2d33aa6d.prob │ ├── .Elections_in_Chefland.cpp_89e7ca787cae7a1f37a62804dc6e38ab.prob │ ├── .Watching_Movies_at_2_x.cpp_60eba8a1d3464d3d7a48fc353dd19d86.prob │ ├── .Is_the_Score_Consistent.cpp_e76e29b02f1fc72f4c7f9d19b8b90a85.prob │ ├── .Water_Filling.cpp_47f88fbaacdde6208ba35bbc154f1eb6.prob │ ├── .Air_Conditioner_Temperature.cpp_024dd751d70c29a47f73ce6150b6dab1.prob │ ├── .Bus_Seat_Numbering.cpp_a35256589c6cedb4e3f3f9e75694a9e5.prob │ ├── .Problems_in_your_to_do_list.cpp_d9ca025233f68212f732c5018a6406c8.prob │ └── .Mahasena.cpp_130613ee04bee4c3f1a5aa3c47c229f2.prob ├── Minimum_Pizzas.cpp ├── Exams.cpp └── Sugarcane_Juice_Business.cpp ├── .cph ├── .Fitness.cpp_7a13d54b156e20551c9e6cd99a8ddee6.prob ├── .MIN_To_MAX.cpp_203ddec00001d6e781bbbad24348204a.prob ├── .400_M_Race.cpp_dff1ffa0a377e21220631c6a80fb993e.prob ├── .Candy_Store.cpp_b993cc18b448a3e054d44f8fafdb692e.prob ├── .Simple_Sorting.cpp_f6d222b369dca53eeb49c1a75c96b0d8.prob ├── .Sum_of_Digits.cpp_1430235609f0275614d08dd2a986301c.prob ├── .Find_Remainder.cpp_ab12198497043b14fdd7dd5209ce7d64.prob ├── .DNA_Storage.cpp_67bae528b37bbbb9acb4091dfb229096.prob ├── .Passing_Marks.cpp_932ba37560d40bbb2f68f1e708684fa1.prob ├── .Scalene_Triangle.cpp_ec51e0a774aa8cc82679e8759324d29d.prob ├── .Find_maximum_in_an_Array.cpp_853252eaf0c3ad024dfa80fb09d5228f.prob ├── .Chef_and_Chocolates.cpp_f03a7e3e5a4f3bc076a67e3f04fb3cad.prob ├── .Second_Max_of_Three_Numbers.cpp_b723dbf5f6a198c695896db4b72b47ea.prob ├── .Largest_and_Second_Largest.cpp_8486784a43a9961b102e9224c570a1cf.prob ├── .Favourite_Numbers.cpp_e01f4a9fc6df26175fcc4e593b5af4bc.prob ├── .Different_Consecutive_Characters.cpp_9df5efc067ed623c10ee2fbb9f2a68ea.prob ├── .Search_an_element_in_an_array.cpp_9a1c88ecf61af077c8e43b0047ab8473.prob ├── .Take_discount_or_Not.cpp_d5875e785f33ddbaf581e32ebf7ceab9.prob ├── .Additional_Sample_1.cpp_d3e4299c26554759b87471bd7463c4a9.prob └── .Convert_String_to_Title_Case.cpp_2fbd1c5a3db3012d7bfcf5f02b771332.prob └── Level up from 1 star to 2 star └── .cph ├── .Hoop_Jump.cpp_b93ce9340e8a344dfd2f53313274665c.prob ├── .Richie_Rich.cpp_101d4ab05695a68f01b63c67a621e1c9.prob └── .Vaccine_Dates.cpp_c7f1c6d4a25f27d56e5d0d2adc8d0952.prob /Array/Take_discount_or_Not.exe: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "files.associations": { 3 | "iostream": "cpp" 4 | } 5 | } -------------------------------------------------------------------------------- /Array/.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "files.associations": { 3 | "iostream": "cpp" 4 | } 5 | } -------------------------------------------------------------------------------- /Array/MIN_To_MAX.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Array/MIN_To_MAX.bin -------------------------------------------------------------------------------- /Array/MIN_To_MAX.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Array/MIN_To_MAX.exe -------------------------------------------------------------------------------- /Basic Math/Fitness.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Fitness.bin -------------------------------------------------------------------------------- /Basic Math/Fitness.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Fitness.exe -------------------------------------------------------------------------------- /Sorting/400_M_Race.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Sorting/400_M_Race.bin -------------------------------------------------------------------------------- /Sorting/400_M_Race.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Sorting/400_M_Race.exe -------------------------------------------------------------------------------- /String/DNA_Storage.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/String/DNA_Storage.bin -------------------------------------------------------------------------------- /String/DNA_Storage.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/String/DNA_Storage.exe -------------------------------------------------------------------------------- /Sorting/Passing_Marks.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Sorting/Passing_Marks.bin -------------------------------------------------------------------------------- /Sorting/Passing_Marks.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Sorting/Passing_Marks.exe -------------------------------------------------------------------------------- /500 difficulty rating/.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "files.associations": { 3 | "iostream": "cpp" 4 | } 5 | } -------------------------------------------------------------------------------- /Basic Math/Candy_Store.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Candy_Store.bin -------------------------------------------------------------------------------- /Basic Math/Candy_Store.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Candy_Store.exe -------------------------------------------------------------------------------- /Sorting/Simple_Sorting.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Sorting/Simple_Sorting.bin -------------------------------------------------------------------------------- /Sorting/Simple_Sorting.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Sorting/Simple_Sorting.exe -------------------------------------------------------------------------------- /Array/Take_discount_or_Not.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Array/Take_discount_or_Not.bin -------------------------------------------------------------------------------- /Basic Math/Find_Remainder.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Find_Remainder.bin -------------------------------------------------------------------------------- /Basic Math/Find_Remainder.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Find_Remainder.exe -------------------------------------------------------------------------------- /Basic Math/Sum_of_Digits.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Sum_of_Digits.bin -------------------------------------------------------------------------------- /Basic Math/Sum_of_Digits.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Sum_of_Digits.exe -------------------------------------------------------------------------------- /String/Additional_Sample_1.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/String/Additional_Sample_1.bin -------------------------------------------------------------------------------- /String/Additional_Sample_1.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/String/Additional_Sample_1.exe -------------------------------------------------------------------------------- /Basic Math/Favourite_Numbers.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Favourite_Numbers.bin -------------------------------------------------------------------------------- /Basic Math/Favourite_Numbers.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Favourite_Numbers.exe -------------------------------------------------------------------------------- /Basic Math/Scalene_Triangle.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Scalene_Triangle.bin -------------------------------------------------------------------------------- /Array/Find_maximum_in_an_Array.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Array/Find_maximum_in_an_Array.bin -------------------------------------------------------------------------------- /Array/Find_maximum_in_an_Array.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Array/Find_maximum_in_an_Array.exe -------------------------------------------------------------------------------- /Basic Math/Chef_and_Chocolates.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Chef_and_Chocolates.bin -------------------------------------------------------------------------------- /Basic Math/Chef_and_Chocolates.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Chef_and_Chocolates.exe -------------------------------------------------------------------------------- /Array/Largest_and_Second_Largest.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Array/Largest_and_Second_Largest.bin -------------------------------------------------------------------------------- /Array/Largest_and_Second_Largest.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Array/Largest_and_Second_Largest.exe -------------------------------------------------------------------------------- /Array/Search_an_element_in_an_array.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Array/Search_an_element_in_an_array.bin -------------------------------------------------------------------------------- /Array/Search_an_element_in_an_array.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Array/Search_an_element_in_an_array.exe -------------------------------------------------------------------------------- /String/Convert_String_to_Title_Case.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/String/Convert_String_to_Title_Case.exe -------------------------------------------------------------------------------- /Basic Math/Second_Max_of_Three_Numbers.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Second_Max_of_Three_Numbers.bin -------------------------------------------------------------------------------- /Basic Math/Second_Max_of_Three_Numbers.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/Basic Math/Second_Max_of_Three_Numbers.exe -------------------------------------------------------------------------------- /String/Different_Consecutive_Characters.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/String/Different_Consecutive_Characters.bin -------------------------------------------------------------------------------- /String/Different_Consecutive_Characters.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/abubakaristiak/Codechef-Problems/HEAD/String/Different_Consecutive_Characters.exe -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "files.associations": { 3 | "iostream": "cpp", 4 | "chrono": "cpp", 5 | "random": "cpp", 6 | "limits": "cpp", 7 | "valarray": "cpp" 8 | } 9 | } -------------------------------------------------------------------------------- /Sorting/Simple_Sorting.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int n;cin>>n; 6 | int ar[n]; 7 | for(int i=0; i> ar[i]; 8 | sort(ar,ar+n); 9 | for(int i=0; i 3 | using namespace std; 4 | int main() 5 | { 6 | int t; 7 | cin >> t; 8 | while (t--) 9 | { 10 | int n; 11 | cin >> n; 12 | int walk = n*5*2; 13 | cout << walk < 3 | using namespace std; 4 | int main() 5 | { 6 | int t; 7 | cin >> t; 8 | while (t--) 9 | { 10 | int a,b; 11 | cin >> a>>b; 12 | int remainder = a%b; 13 | cout << remainder < 3 | using namespace std; 4 | int main() 5 | { 6 | int t; 7 | cin >> t; 8 | while (t--) 9 | { 10 | int x,y,z; 11 | cin >> x >> y >> z; 12 | int total = x*5 + y*10; 13 | int chocolates = total/z; 14 | cout << chocolates << endl; 15 | } 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /Basic Math/Second_Max_of_Three_Numbers.cpp: -------------------------------------------------------------------------------- 1 | //https://www.codechef.com/practice/course/basic-math/BASICMATH/problems/SNDMAX 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int t; 7 | cin >> t; 8 | while (t--) 9 | { 10 | int a,b,c; 11 | cin >> a>>b>>c; 12 | int ar[3] = {a,b,c}; 13 | sort(ar,ar+3); 14 | int mx = ar[1]; 15 | cout << mx< 3 | using namespace std; 4 | int main() 5 | { 6 | int t; 7 | cin >> t; 8 | while (t--) 9 | { 10 | int x,y; 11 | cin >> x >> y; 12 | if(x>=y){ 13 | cout << y< 3 | using namespace std; 4 | int main() 5 | { 6 | int t; 7 | cin >> t; 8 | while (t--) 9 | { 10 | int n; 11 | cin>> n; 12 | int sum = 0; 13 | while (n != 0) 14 | { 15 | int a = n%10; 16 | sum +=a; 17 | n /=10; 18 | } 19 | cout << sum< 4 | using namespace std; 5 | int main() 6 | { 7 | string s; 8 | getline(cin,s); 9 | 10 | stringstream ss; 11 | ss<>word) 14 | { 15 | for(int i=0; i 3 | using namespace std; 4 | int main() 5 | { 6 | int t; 7 | cin >> t; 8 | while (t--) 9 | { 10 | int x,y,z; 11 | cin >> x >>y >> z; 12 | if(x != y && y != z && x != z){{ 13 | cout << "YES"< 3 | using namespace std; 4 | int main() 5 | { 6 | int test; 7 | cin >> test; 8 | while (test--) 9 | { 10 | int n; 11 | cin >> n; 12 | int mx = -1; 13 | for(int i=0; i> x; 16 | mx = max(mx,x); //-> if(x>max)max = x; 17 | 18 | } 19 | cout << mx << endl; 20 | } 21 | 22 | return 0; 23 | } -------------------------------------------------------------------------------- /.cph/.Fitness.cpp_7a13d54b156e20551c9e6cd99a8ddee6.prob: -------------------------------------------------------------------------------- 1 | {"name":"Fitness","group":"CodeChef - Practice Basic Math","url":"https://www.codechef.com/practice/course/basic-math/BASICMATH/problems/FIT","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n1\n3\n7\n10\n","output":"10\n30\n70\n100\n","id":1718904311754}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"Fitness"}},"batch":{"id":"945eb72e-7f03-4a25-8a01-65cbfad94d16","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Fitness.cpp"} -------------------------------------------------------------------------------- /Sorting/Passing_Marks.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int t; 6 | cin >> t; 7 | while (t--) 8 | { 9 | int n,x; 10 | cin >> n >> x; 11 | int ar[n]; 12 | for(int i=0; i> ar[i]; 14 | } 15 | sort(ar, ar+n); 16 | 17 | int max_pass_m; 18 | if(x==0){ 19 | cout << ar[n-1]+1< 3 | using namespace std; 4 | int main() 5 | { 6 | int test; 7 | cin >> test; 8 | while (test--) 9 | { 10 | string s,t,m; 11 | cin >> s >> t; 12 | for(int i=0; i<5; i++){ 13 | if(s[i]==t[i]){ 14 | cout << "G"; 15 | } 16 | else{ 17 | cout << "B"; 18 | } 19 | 20 | } 21 | cout << endl; 22 | } 23 | 24 | return 0; 25 | } -------------------------------------------------------------------------------- /.cph/.Candy_Store.cpp_b993cc18b448a3e054d44f8fafdb692e.prob: -------------------------------------------------------------------------------- 1 | {"name":"Candy Store","group":"CodeChef - Practice Basic Math","url":"https://www.codechef.com/practice/course/basic-math/BASICMATH/problems/CANDYSTORE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n3 1\n5 5\n4 7\n2 3\n","output":"1\n5\n10\n4\n","id":1718906822454}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CandyStore"}},"batch":{"id":"41bad1a7-f8ae-409b-8191-cd8ea513ae40","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Candy_Store.cpp"} -------------------------------------------------------------------------------- /.cph/.Simple_Sorting.cpp_f6d222b369dca53eeb49c1a75c96b0d8.prob: -------------------------------------------------------------------------------- 1 | {"name":"Simple Sorting","group":"CodeChef - Practice Sorting","url":"https://www.codechef.com/practice/course/sorting/SORTING/problems/TSORT","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"5\n5\n3\n6\n7\n1\n","output":"1\n3\n5\n6\n7\n","id":1718721758367}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"SimpleSorting"}},"batch":{"id":"29d43136-d18b-4d7d-bb57-f108567a5c16","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Simple_Sorting.cpp"} -------------------------------------------------------------------------------- /Basic Math/Favourite_Numbers.cpp: -------------------------------------------------------------------------------- 1 | //https://www.codechef.com/practice/course/basic-math/BASICMATH/problems/FAVOURITENUM 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int t; 7 | cin >> t; 8 | while (t--) 9 | { 10 | int n; 11 | cin >> n; 12 | if(n%2==0 && n%7==0){ 13 | cout <<"Alice"< 3 | using namespace std; 4 | int main() 5 | { 6 | int test; 7 | cin >> test; 8 | while (test--) 9 | { 10 | int n; 11 | cin >> n; 12 | string a; 13 | cin >> a; 14 | int count = 0; 15 | for(int i=0; i 3 | using namespace std; 4 | int main() 5 | { 6 | int n,x; 7 | cin >> n>> x; 8 | int ar[n]; 9 | for(int i=0; i> ar[i]; 11 | } 12 | bool flag = false; 13 | for(int i=0; i 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int x,n,m; cin >> x >> n >> m; 18 | if(x+m>=n){ 19 | yes; 20 | }else no; 21 | return 0; 22 | 23 | 24 | // Alhamdulillah 25 | } -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Candy_Division.cpp_c097337b35a4dfcafefb439e681fc656.prob: -------------------------------------------------------------------------------- 1 | {"name":"Candy Division","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CANDIVIDE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n3\n4\n2\n6\n","output":"YES\nNO\nNO\nYES\n","id":1733651353442}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CandyDivision"}},"batch":{"id":"c0b28a8e-b6da-4e4e-9641-5f0f77400494","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Candy_Division.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Car_Trip.cpp_dba1680d34354e3ce30b0c44941440ff.prob: -------------------------------------------------------------------------------- 1 | {"name":"Car Trip","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CARTRIP","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"5\n800\n3\n299\n301\n300\n","output":"8000\n3000\n3000\n3010\n3000\n","id":1733980718896}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CarTrip"}},"batch":{"id":"965c81af-1ba4-468c-9c5c-2e693ba31db0","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Car_Trip.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Donation_Drive.cpp_effba6ddb31eea6996529fd2ebb2dcfd.prob: -------------------------------------------------------------------------------- 1 | {"name":"Donation Drive","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/DONDRIVE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n5 2\n3 3\n5 4\n7 5\n","output":"3\n0\n1\n2\n","id":1733552237243}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"DonationDrive"}},"batch":{"id":"7f3c8a64-77bd-4a6e-bd91-164526f07b5c","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Donation_Drive.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Read_Pages.cpp_c876f350a47f67dc339bcb986fe61bbb.prob: -------------------------------------------------------------------------------- 1 | {"name":"Read Pages","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/READPAGES","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n5 2 3\n10 3 3\n7 7 1\n3 2 1\n","output":"YES\nNO\nYES\nNO\n","id":1733894160515}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ReadPages"}},"batch":{"id":"ce7f0d97-6c9e-4445-95bc-1fb15bbd85d6","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Read_Pages.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Right_There.cpp_0e175b7aa0c31a370b5ca5b4db1887bf.prob: -------------------------------------------------------------------------------- 1 | {"name":"Right There","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/RIGHTTHERE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n2 5\n4 3\n6 6\n10 9\n","output":"YES\nNO\nYES\nNO\n","id":1733733064067}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"RightThere"}},"batch":{"id":"6577609c-a9b0-41b3-89a8-f91507b5340c","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Right_There.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Sleep_deprivation.cpp_19d8241527b252820e2d56d5e504e03f.prob: -------------------------------------------------------------------------------- 1 | {"name":"Sleep deprivation","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/SLEEP","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n4\n7\n10\n","output":"YES\nNO\nNO\n","id":1733894691008}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"SleepDeprivation"}},"batch":{"id":"109bc13d-69b2-40b7-b707-43c69e950af4","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Sleep_deprivation.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Spice_Level.cpp_ad72f22c048b780ef348fd6c4c11a27b.prob: -------------------------------------------------------------------------------- 1 | {"name":"Spice Level","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/KITCHENSPICE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n4\n1\n6\n9\n","output":"MEDIUM\nMILD\nMEDIUM\nHOT\n","id":1734001803228}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"SpiceLevel"}},"batch":{"id":"249ea00c-7277-4c5c-8e92-43652c309b4d","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Spice_Level.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.CRED_Coins.cpp_19a67aa5218b4c8675e1c9b9b13debf4.prob: -------------------------------------------------------------------------------- 1 | {"name":"CRED Coins","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/CREDCOINS","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1735119759995,"input":"3\n10 10\n20 4\n70 7\n","output":"1\n0\n4\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CREDCoins"}},"batch":{"id":"9baff4aa-b2d0-419d-af3f-3cc7398ac9e0","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\CRED_Coins.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Exams.cpp_f0bcaeb5523bd62e9c9d73fa3763acb2.prob: -------------------------------------------------------------------------------- 1 | {"name":"Exams","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/EXAMCHEF","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n2 10 12\n2 10 3\n1 5 3\n3 6 9\n","output":"YES\nNO\nYES\nNO\n","id":1735118716515}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"Exams"}},"batch":{"id":"9403fc39-4d7d-4678-a663-cd274349bbe4","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Exams.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Jenga_Night.cpp_62361d8ef636bca668e38ef0c55ff8c5.prob: -------------------------------------------------------------------------------- 1 | {"name":"Jenga Night","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/JENGA","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1740764134079,"input":"3\n3 3\n4 2\n2 4\n","output":"YES\nNO\nYES\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"JengaNight"}},"batch":{"id":"7e382ccb-f849-4606-a3cf-e724cbdc418f","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Jenga_Night.cpp"} -------------------------------------------------------------------------------- /Array/.cph/.Leader_of_an_Array.cpp_e66130db654ccc541b0bdab08511b13a.prob: -------------------------------------------------------------------------------- 1 | {"name":"Leader of an Array","group":"CodeChef - Arrays","url":"https://www.codechef.com/learn/course/arrays/ARRAYS02/problems/DSAAGP11","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"6\n16 17 4 3 5 2\n","output":"17 5 2\n","id":1734983213941},{"input":"5\n5 5 5 5 5\n","output":"5\n","id":1734983213932}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"LeaderOfAnArray"}},"batch":{"id":"9b928114-149c-4944-b19d-c087a65b6a9d","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Array\\Leader_of_an_Array.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Battery_Health.cpp_3d450a28392ffde27f7207a9b35463b1.prob: -------------------------------------------------------------------------------- 1 | {"name":"Battery Health","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/BTRYHLTH","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n97\n42\n80\n10\n","output":"YES\nNO\nYES\nNO\n","id":1733723638402}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BatteryHealth"}},"batch":{"id":"d50271cf-6225-4c78-84c1-6d035840eb8d","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Battery_Health.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Best_of_Two.cpp_3bd778d4d059a51285bc44405b8605e0.prob: -------------------------------------------------------------------------------- 1 | {"name":"Best of Two","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/BESTOFTWO","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n40 60\n67 55\n50 50\n1 100\n","output":"60\n67\n50\n100\n","id":1733650917083}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BestOfTwo"}},"batch":{"id":"6c3809ed-cc2e-4fbe-8c0a-2b26e18022f7","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Best_of_Two.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Chef_On_Date.cpp_ef3fe5306c4e8f37fc812cb80cbd348a.prob: -------------------------------------------------------------------------------- 1 | {"name":"Chef On Date","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CHEFONDATE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n1 1\n1 2\n2 1\n50 100\n","output":"YES\nNO\nYES\nNO\n","id":1733651489371}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChefOnDate"}},"batch":{"id":"8d864390-7e3c-434f-a020-f35c9d937ca0","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Chef_On_Date.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Chef_and_Gym.cpp_291856311b0d3841625c5a2b3ee937a5.prob: -------------------------------------------------------------------------------- 1 | {"name":"Chef and Gym","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CGYM","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n1 2 3\n10 12 13\n23 1 22\n23 1 63\n","output":"2\n1\n0\n2\n","id":1734973095162}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChefAndGym"}},"batch":{"id":"26a6c48a-acb1-43f7-88d9-5487258f308d","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Chef_and_Gym.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Clear_Day.cpp_5b0c344f01415cf897f4b88ee1f96dfa.prob: -------------------------------------------------------------------------------- 1 | {"name":"Clear Day","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CLEARDAY","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"2 3\n","output":"2\n","id":1733549297850},{"input":"3 4\n","output":"0\n","id":1733549297796}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ClearDay"}},"batch":{"id":"abb090d9-faa2-4ec5-be57-b95844021aae","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Clear_Day.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Counting_Words.cpp_f4e31b6c3002691af2e087a2e3754282.prob: -------------------------------------------------------------------------------- 1 | {"name":"Counting Words","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CNTWRD","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n1 1\n4 2\n2 4\n95 42\n","output":"1\n8\n8\n3990\n","id":1733723517404}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CountingWords"}},"batch":{"id":"07b4ec27-bc2f-43e4-8118-d51463fd52db","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Counting_Words.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Ezio_and_Guards.cpp_21c807b47e949b24dffe7a874c87c112.prob: -------------------------------------------------------------------------------- 1 | {"name":"Ezio and Guards","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/MANIPULATE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1734346810171,"input":"3\n5 7\n6 6\n9 1\n","output":"NO\nYES\nYES\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"EzioAndGuards"}},"batch":{"id":"a768837a-4ba7-4309-ad0d-26d95098010f","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Ezio_and_Guards.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Four_Tickets.cpp_5ec4e7370da27496c8b6c1ca27c7de4b.prob: -------------------------------------------------------------------------------- 1 | {"name":"Four Tickets","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/FOURTICKETS","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n100\n500\n250\n1000\n","output":"YES\nNO\nYES\nNO\n","id":1733733960225}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"FourTickets"}},"batch":{"id":"232febcd-0f59-4604-a1bc-49e64c1d1a1b","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Four_Tickets.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.IPL_Ticket_Rush.cpp_b865a63ec621a1fc0e442a2bbc70d91d.prob: -------------------------------------------------------------------------------- 1 | {"name":"IPL Ticket Rush","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/IPLTRSH","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1733552569413,"input":"4\n5 3\n5 7\n4 1\n8 8\n","output":"2\n0\n3\n0\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"IPLTicketRush"}},"batch":{"id":"29a8c4b9-39f4-4bb5-9173-1374ce8c5d42","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\IPL_Ticket_Rush.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/Height_of_Rationals.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int x,y; cin >> x >> y; 18 | int height=max(x,y); 19 | cout << height << endl; 20 | return 0; 21 | 22 | 23 | // Alhamdulillah 24 | } -------------------------------------------------------------------------------- /Level up from 1 star to 2 star/.cph/.Richie_Rich.cpp_101d4ab05695a68f01b63c67a621e1c9.prob: -------------------------------------------------------------------------------- 1 | {"name":"Richie Rich","group":"CodeChef - Level up from 1* to 2*","url":"https://www.codechef.com/practice/course/1to2stars/LP1TO201/problems/CHFRICH","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1735390858897,"input":"3\n100 200 10\n111 199 11\n190 200 10\n","output":"10\n8\n1\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"RichieRich"}},"batch":{"id":"e9f8e13e-240f-41d8-bc2e-1bc50e8aeebc","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Level up from 1 star to 2 star\\Richie_Rich.cpp"} -------------------------------------------------------------------------------- /.cph/.Largest_and_Second_Largest.cpp_8486784a43a9961b102e9224c570a1cf.prob: -------------------------------------------------------------------------------- 1 | {"name":"Largest and Second Largest","group":"CodeChef - Practice Arrays","url":"https://www.codechef.com/practice/course/arrays/ARRAYS/problems/LARGESECOND","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n3\n4 1 6\n7\n3 7 2 1 1 5 3\n5\n8 2 9 4 9\n2\n1 2\n","output":"10\n12\n17\n3\n","id":1718643034585}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"LargestAndSecondLargest"}},"batch":{"id":"b7e0b689-69d2-44c2-92d7-7d244501c045","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Largest_and_Second_Largest.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Bull_or_Bear.cpp_4fac212481877dee4341e59c4aa77a73.prob: -------------------------------------------------------------------------------- 1 | {"name":"Bull or Bear","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/BULLBEAR","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n4 2\n8 8\n3 4\n2 1\n","output":"LOSS\nNEUTRAL\nPROFIT\nLOSS\n","id":1733733656273}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BullOrBear"}},"batch":{"id":"05ea23ec-0d82-4ed5-b267-6a1a44e81079","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Bull_or_Bear.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Chef_and_Chocolates.cpp_e8e37e85f92964eab582612278384e60.prob: -------------------------------------------------------------------------------- 1 | {"name":"Chef and Chocolates","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CHEFCHOCO","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"2\n7 5 5\n10 1 1\n","output":"10\n9\n","id":1734971782686}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChefAndChocolates"}},"batch":{"id":"c60403a4-d671-41cd-b4a6-021c133e3589","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Chef_and_Chocolates.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Get_Subscription.cpp_eabb7d2daa195fb25fd8d7d80501f7b9.prob: -------------------------------------------------------------------------------- 1 | {"name":"Get Subscription","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/SUBSCRIBE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n50\n3\n30\n80\n","output":"YES\nNO\nNO\nYES\n","id":1733856524859}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"GetSubscription"}},"batch":{"id":"b1761b21-8b2c-4819-8c80-b28a77f8f116","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Get_Subscription.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Kitchen_Timings.cpp_d1afd87bfb60f9073c7703523f4751bd.prob: -------------------------------------------------------------------------------- 1 | {"name":"Kitchen Timings","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/KITCHENTIME","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n1 2\n3 7\n9 11\n2 10\n","output":"1\n4\n2\n8\n","id":1733552369835}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"KitchenTimings"}},"batch":{"id":"3cc97691-b52d-494f-bca6-02f886b90c39","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Kitchen_Timings.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Masterchef_finals.cpp_531c41347887ccc919f4255ecebd0d37.prob: -------------------------------------------------------------------------------- 1 | {"name":"Masterchef finals","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/TOP10","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n15\n10\n1\n50\n","output":"NO\nYES\nYES\nNO\n","id":1733549819236}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"MasterchefFinals"}},"batch":{"id":"82965bec-1914-4348-8dfc-2158f6f6e671","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Masterchef_finals.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Monthly_Budget.cpp_2ab2293838e4535b84e0497509fab914.prob: -------------------------------------------------------------------------------- 1 | {"name":"Monthly Budget","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/BUDGET_","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n1000 10\n250 50\n1500 50\n","output":"YES\nNO\nYES\n","id":1734770038895}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"MonthlyBudget"}},"batch":{"id":"c52f8005-3368-4a49-b46c-49b7b77faff8","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Monthly_Budget.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Off_By_One.cpp_4af2d1dbe3fd87893c76993cfdedf773.prob: -------------------------------------------------------------------------------- 1 | {"name":"Off By One","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/OFFBY1","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3 5\n","output":"81\n","id":1733551956186},{"input":"4 12\n","output":"161\n","id":1733551956248}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"OffByOne"}},"batch":{"id":"9981507b-7d1d-49c9-8425-ecdf8eaa6fba","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Off_By_One.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Passes_for_Fair.cpp_67b79dcd675ab8485e5f4e4593c21de6.prob: -------------------------------------------------------------------------------- 1 | {"name":"Passes for Fair","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/FAIRPASS","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n5 8\n6 3\n2 2\n1 2\n","output":"YES\nNO\nNO\nYES\n","id":1733893969489}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"PassesForFair"}},"batch":{"id":"fb1f1f40-74e5-41dc-9668-edc32ee8a742","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Passes_for_Fair.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.The_Cheaper_Cab.cpp_d7be4f50abb62b6ef2f8de3cc8acbf7f.prob: -------------------------------------------------------------------------------- 1 | {"name":"The Cheaper Cab","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CABS","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n30 65\n42 42\n90 50\n","output":"FIRST\nANY\nSECOND\n","id":1734073014794}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"TheCheaperCab"}},"batch":{"id":"b5b2e48e-3f86-4985-ab38-2d86511d1e3c","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\The_Cheaper_Cab.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Car_or_Bike.cpp_44f744298d3dca79aa3e7a47024eda49.prob: -------------------------------------------------------------------------------- 1 | {"name":"Car or Bike","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/TRAVELFAST","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1736687103941,"input":"3\n1 5\n4 2\n6 6\n","output":"BIKE\nCAR\nSAME\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CarOrBike"}},"batch":{"id":"c4209451-9fd4-45fe-86db-2acdc5d4ffa5","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Car_or_Bike.cpp"} -------------------------------------------------------------------------------- /.cph/.Favourite_Numbers.cpp_e01f4a9fc6df26175fcc4e593b5af4bc.prob: -------------------------------------------------------------------------------- 1 | {"name":"Favourite Numbers","group":"CodeChef - Practice Basic Math","url":"https://www.codechef.com/practice/course/basic-math/BASICMATH/problems/FAVOURITENUM","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"8\n7\n14\n21\n18\n27\n63\n126\n8\n","output":"Charlie\nAlice\nCharlie\nCharlie\nBob\nBob\nAlice\nCharlie\n","id":1718907930083}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"FavouriteNumbers"}},"batch":{"id":"82abd7bf-d168-406e-9611-d1b4e1b8c381","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Favourite_Numbers.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Audible_Range.cpp_397c315fcca2ae0d0aaa035e5c85d96a.prob: -------------------------------------------------------------------------------- 1 | {"name":"Audible Range","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/AUDIBLE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"5\n42\n67\n402\n45000\n45005\n","output":"NO\nYES\nYES\nYES\nNO\n","id":1733649792941}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"AudibleRange"}},"batch":{"id":"204b191d-3583-4646-bcf7-73c7f2c3f80d","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Audible_Range.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Biryani_classes.cpp_45634b0e82817aff3e2940c5b1815bf7.prob: -------------------------------------------------------------------------------- 1 | {"name":"Biryani classes","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/BIRYANI","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n1 10\n1 15\n2 10\n2 15\n","output":"10\n15\n20\n30\n","id":1733550325708}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BiryaniClasses"}},"batch":{"id":"2b63eaea-24ff-4ad9-aa64-f59d91fa49f0","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Biryani_classes.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Chef_and_Chapters.cpp_f1f3a2d9886004f78e006e4eaa2fd3a3.prob: -------------------------------------------------------------------------------- 1 | {"name":"Chef and Chapters","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/SEMCOURSES","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n1 1 1\n2 1 2\n1 2 3\n","output":"1\n4\n6\n","id":1733896678395}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChefAndChapters"}},"batch":{"id":"34d15fff-622d-42af-8e56-6b4067dbb48e","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Chef_and_Chapters.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Chef_and_Donation.cpp_2b60e2c2f9d1208a3d7fd95786dd6d84.prob: -------------------------------------------------------------------------------- 1 | {"name":"Chef and Donation","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/DNATION","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n1 3\n2 5\n4 5\n2 10\n","output":"2\n3\n1\n8\n","id":1733734365123}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChefAndDonation"}},"batch":{"id":"e5935744-43db-485f-9ee7-5589cc0750e9","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Chef_and_Donation.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Increase_IQ.cpp_4014537111fbef3b40efff9df0f8886a.prob: -------------------------------------------------------------------------------- 1 | {"name":"Increase IQ","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/INCRIQ","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"165\n","output":"Yes\n","id":1734873458213},{"input":"120\n","output":"No\n","id":1734873458170}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"IncreaseIQ"}},"batch":{"id":"32dc6543-492b-4874-9aee-0fc9c61d5c99","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Increase_IQ.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.MATH_1_Enrolment.cpp_20609ecb799cb0cf2fcfce89b93d6d0a.prob: -------------------------------------------------------------------------------- 1 | {"name":"MATH1 Enrolment","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/M1ENROL","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n1 1\n12 34\n50 49\n49 50\n","output":"0\n22\n0\n1\n","id":1733895903475}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"MATH1Enrolment"}},"batch":{"id":"447643b8-3538-40da-97ed-8f1bfe964d2d","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\MATH_1_Enrolment.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Maximum_Submissions.cpp_a866bfba79ffb3d350148e603b4bb667.prob: -------------------------------------------------------------------------------- 1 | {"name":"Maximum Submissions","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/MAXIMUMSUBS","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n1\n2\n3\n4\n","output":"2\n4\n6\n8\n","id":1734692666867}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"MaximumSubmissions"}},"batch":{"id":"a1e7593d-407b-491e-8ec8-ffc9a70ab014","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Maximum_Submissions.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Reach_on_Time.cpp_7336a2df4b634a513309e69dd3eb9bd5.prob: -------------------------------------------------------------------------------- 1 | {"name":"Reach on Time","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/TIMELY","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"6\n30\n60\n14\n29\n31\n42\n","output":"YES\nYES\nNO\nNO\nYES\nYES\n","id":1733650089639}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ReachOnTime"}},"batch":{"id":"7d7979bf-9e56-418b-b706-c20bc40f5b63","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Reach_on_Time.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Roller_Coaster.cpp_08e86aa012401551e0aec4070447457b.prob: -------------------------------------------------------------------------------- 1 | {"name":"Roller Coaster","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/MINHEIGHT","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n15 20\n50 48\n32 32\n38 39\n","output":"NO\nYES\nYES\nNO\n","id":1733651227386}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"RollerCoaster"}},"batch":{"id":"0e208e21-c89e-40c9-9c2f-fd03dc9213a1","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Roller_Coaster.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.TV_Discount.cpp_7dc69d95fc35e4dfbd7619b43146e6de.prob: -------------------------------------------------------------------------------- 1 | {"name":"TV Discount","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/TVDISC","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1734692821366,"input":"3\n85 75 35 20\n100 99 0 0\n30 40 0 10\n","output":"First\nSecond\nAny\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"TVDiscount"}},"batch":{"id":"ffb73a8c-c75d-4928-a5f6-a77bd7dc83fb","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\TV_Discount.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.The_Gift.cpp_e1098d7f76e3f3716bb7cd8194294a9d.prob: -------------------------------------------------------------------------------- 1 | {"name":"The Gift","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CS2023_GIFT","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"5 10 15\n","output":"YES\n","id":1734002075128},{"id":1734002075138,"input":"4 50 7\n","output":"NO\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"TheGift"}},"batch":{"id":"1d56c006-e39d-46ad-8ae3-79db26249aad","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\The_Gift.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.The_Mango_Truck.cpp_022923cc906d04f6026d1e228c9eac31.prob: -------------------------------------------------------------------------------- 1 | {"name":"The Mango Truck","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/MANGOES","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n2 5 11\n4 10 20\n1 1 1\n6 40 90\n","output":"3\n2\n0\n8\n","id":1734874019005}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"TheMangoTruck"}},"batch":{"id":"9c2abd5c-a01b-4dc9-9c6c-48611354d4d1","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\The_Mango_Truck.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Sale_Season.cpp_fc0e906e06a02c61340896f2dc9e8a74.prob: -------------------------------------------------------------------------------- 1 | {"name":"Sale Season","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/SALESEASON","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1735228036778,"input":"4\n15\n70\n250\n1000\n","output":"15\n70\n225\n975\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"SaleSeason"}},"batch":{"id":"19bed3ba-edde-4e54-93c4-edd171b03887","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Sale_Season.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Bidding.cpp_dcea263c93c7e11c2699b986d2572930.prob: -------------------------------------------------------------------------------- 1 | {"name":"Bidding","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/AUCTION","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n200 100 400\n155 1000 566\n736 234 470\n124 67 2\n","output":"Charlie\nBob\nAlice\nAlice\n","id":1733893194731}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"Bidding"}},"batch":{"id":"152975a8-64b6-4736-b7f7-be4e3d2a2eec","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Bidding.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Broken_Phone.cpp_0e8ed94fbbb641cda0308d8b6ed8168a.prob: -------------------------------------------------------------------------------- 1 | {"name":"Broken Phone","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/BROKENPHONE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n100 1000\n10000 5000\n3000 3000\n","output":"REPAIR\nNEW PHONE\nANY\n","id":1734764663057}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BrokenPhone"}},"batch":{"id":"0494bedb-3542-4aef-a47b-5b018ab687e5","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Broken_Phone.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Dominant_Army.cpp_da16ee3590655eadb9f7760be9901331.prob: -------------------------------------------------------------------------------- 1 | {"name":"Dominant Army","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/DOMINANT","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n15 5 6\n12 13 16\n1 1 100\n10 10 20\n","output":"YES\nNO\nYES\nNO\n","id":1734971081168}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"DominantArmy"}},"batch":{"id":"44f7e414-9960-4f87-9a79-da8d4de63d6b","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Dominant_Army.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Donation_Rewards.cpp_6f09e7c2777452920d7a66314e486edf.prob: -------------------------------------------------------------------------------- 1 | {"name":"Donation Rewards","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/DOREWARD","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n1\n3\n5\n7\n","output":"BRONZE\nBRONZE\nSILVER\nGOLD\n","id":1734072648058}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"DonationRewards"}},"batch":{"id":"a231f0a1-1194-41e7-aba4-ccc7659fc1ab","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Donation_Rewards.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.First_and_Last_Digit.cpp_ae8e68fe0849350e01b8cc205b08559f.prob: -------------------------------------------------------------------------------- 1 | {"name":"First and Last Digit","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/FLOW004","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n1234\n124894\n242323\n","output":"5\n5\n5\n","id":1734770246211}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"FirstAndLastDigit"}},"batch":{"id":"344c7669-979f-43f9-9483-5bbbaaec8a47","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\First_and_Last_Digit.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Profit_Increment.cpp_ad4d0e71746d012799106c19ceffb25e.prob: -------------------------------------------------------------------------------- 1 | {"name":"Profit Increment","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/PROINC","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1734692134555,"input":"4\n100 10\n200 5\n500 10\n100 7\n","output":"20\n25\n60\n17\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ProfitIncrement"}},"batch":{"id":"1c909bf9-b52d-496e-a131-7a0b83a69970","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Profit_Increment.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Rain_in_Chefland.cpp_442000ed49670775c0be4414fe476925.prob: -------------------------------------------------------------------------------- 1 | {"name":"Rain in Chefland","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/RAINFALL1","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1733859979856,"input":"4\n1\n20\n3\n7\n","output":"LIGHT\nHEAVY\nMODERATE\nHEAVY\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"RainInChefland"}},"batch":{"id":"067dde72-5ad0-4164-9100-b6985d573f2c","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Rain_in_Chefland.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Time_Complexity.cpp_ee2c32c29cf3c71960618d11c65347b1.prob: -------------------------------------------------------------------------------- 1 | {"name":"Time Complexity","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/COMPLEXITY","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n9 9\n15 7\n10 19\n21 20\n","output":"NO\nYES\nNO\nYES\n","id":1733980218791}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"TimeComplexity"}},"batch":{"id":"c0f15ff5-9735-4cbd-b975-1536c3720ce3","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Time_Complexity.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.True_and_False_Paper.cpp_044f21b8d6a4bab7a6a6f311d62481c6.prob: -------------------------------------------------------------------------------- 1 | {"name":"True and False Paper","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/TFPAPER","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n1 1\n50 0\n100 76\n","output":"0\n50\n24\n","id":1734072828905}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"TrueAndFalsePaper"}},"batch":{"id":"35fd9af4-f38b-452a-b7fa-b5a2edd17415","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\True_and_False_Paper.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Discus_Throw.cpp_41ce9d373575aa9a7cccb1c5a6c9ce00.prob: -------------------------------------------------------------------------------- 1 | {"name":"Discus Throw","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/DISCUS","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1740938340123,"input":"3\n10 15 8\n32 32 32\n82 45 54\n","output":"15\n32\n82\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"DiscusThrow"}},"batch":{"id":"d2e1e073-2857-4eb8-8286-d3a3a2bb027c","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Discus_Throw.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Expert_Setter.cpp_358483da0199b674d65c4015e4c7c865.prob: -------------------------------------------------------------------------------- 1 | {"name":"Expert Setter","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/EXPERT","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1735570599699,"input":"4\n5 3\n1 1\n4 1\n2 1\n","output":"YES\nYES\nNO\nYES\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ExpertSetter"}},"batch":{"id":"88f62b49-847b-4369-a8a7-f607ee001ab2","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Expert_Setter.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Flip_the_cards.cpp_dd07bea7a3b13cbbe64065c20d547951.prob: -------------------------------------------------------------------------------- 1 | {"name":"Flip the cards","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/FLIPCARDS","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n5 0\n4 2\n3 3\n10 2\n","output":"0\n2\n0\n2\n","id":1749188780161}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"FlipTheCards"}},"batch":{"id":"5414a1d3-53d8-498b-a326-cf2e7522e83d","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Flip_the_cards.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Minimum_Pizzas.cpp_396719b7af6b2a1cdba8fb2660c030bb.prob: -------------------------------------------------------------------------------- 1 | {"name":"Minimum Pizzas","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/MINPIZZA","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1735319724433,"input":"4\n1 5\n2 6\n4 3\n3 5\n","output":"2\n3\n3\n4\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"MinimumPizzas"}},"batch":{"id":"d775e3ac-a321-402d-a71d-6610310f2758","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Minimum_Pizzas.cpp"} -------------------------------------------------------------------------------- /.cph/.Different_Consecutive_Characters.cpp_9df5efc067ed623c10ee2fbb9f2a68ea.prob: -------------------------------------------------------------------------------- 1 | {"name":"Different Consecutive Characters ","group":"CodeChef - Practice Strings","url":"https://www.codechef.com/practice/course/strings/STRINGS/problems/DIFFCONSEC?tab=statement","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n2\n11\n4\n0101\n5\n00100\n","output":"1\n0\n2\n","id":1718541212208}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"DifferentConsecutiveCharacters"}},"batch":{"id":"d15b952a-399b-4260-a85f-0825d6918ade","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Different_Consecutive_Characters.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Chairs_Requirement.cpp_1602659a556c09a750e1a4dd02968255.prob: -------------------------------------------------------------------------------- 1 | {"name":"Chairs Requirement","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CHAIRS_","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n20 14\n41 41\n35 0\n50 100\n","output":"6\n0\n35\n0\n","id":1733734117376}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChairsRequirement"}},"batch":{"id":"e4314f4e-48b6-4732-bacc-6d6d2877d844","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Chairs_Requirement.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Credit_score.cpp_bc2c42aa3af5090086f2414658b7cfed.prob: -------------------------------------------------------------------------------- 1 | {"name":"Credit score","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CREDSCORE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"823\n","output":"YES\n","id":1734770161088},{"input":"251\n","output":"NO\n","id":1734770161065}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CreditScore"}},"batch":{"id":"99ebf260-b592-48f9-a05e-9476a7dfdd81","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Credit_score.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Enormous_Input_Test.cpp_69d147b5dbbe5c02e8cfc996223ed5ca.prob: -------------------------------------------------------------------------------- 1 | {"name":"Enormous Input Test","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/INTEST","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1734770546634,"input":"7 3\n1\n51\n966369\n7\n9\n999996\n11\n","output":"4\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"EnormousInputTest"}},"batch":{"id":"24bffe2d-81a6-44c0-a171-19d2cdd08055","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Enormous_Input_Test.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Final_Population.cpp_d5463dad1496d70da061f91371e65143.prob: -------------------------------------------------------------------------------- 1 | {"name":"Final Population","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/POPULATION","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n3 1 2\n2 2 2\n4 1 8\n10 1 10\n","output":"4\n2\n11\n19\n","id":1733979770791}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"FinalPopulation"}},"batch":{"id":"731f9a81-3cb5-450f-8a3d-df3e24dadbef","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Final_Population.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Reach_the_Target.cpp_84b6d3678b1db6230a9f3e95ad798505.prob: -------------------------------------------------------------------------------- 1 | {"name":"Reach the Target","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/REACHTARGET","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n200 50\n100 99\n130 97\n53 51\n","output":"150\n1\n33\n2\n","id":1733650794057}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ReachTheTarget"}},"batch":{"id":"f1d6f5e8-2acf-43b7-aa73-fba0830b3c7d","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Reach_the_Target.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Speciality.cpp_2aaf296dda22ab121449527a485e4959.prob: -------------------------------------------------------------------------------- 1 | {"name":"Speciality","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/SPECIALITY","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n5 3 2\n1 2 4\n2 5 1\n9 4 5\n","output":"Setter\nEditorialist\nTester\nSetter\n","id":1734692516103}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"Speciality"}},"batch":{"id":"254a6bf0-f92a-4d63-a73d-8c4335f9d8b5","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Speciality.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Good_Program.cpp_e8774e8e49c3a28db29b1b08912cda59.prob: -------------------------------------------------------------------------------- 1 | {"name":"Good Program","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/NIBBLE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n8\n17\n52\n3\n","output":"Good\nNot Good\nGood\nNot Good\n","id":1740505734037}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"GoodProgram"}},"batch":{"id":"fa9e5859-04d2-43a4-83e4-bb5878f54a21","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Good_Program.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Subscriptions.cpp_79b733a0f5e47891e7d9a4029c54cb21.prob: -------------------------------------------------------------------------------- 1 | {"name":"Subscriptions","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/SUBSCRIBE_","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1735033765119,"input":"3\n1 100\n12 250\n16 135\n","output":"100\n500\n405\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"Subscriptions"}},"batch":{"id":"f45d6131-50db-494b-8b85-1fd0da763a69","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Subscriptions.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Bob_at_the_Bank.cpp_41514f73cc5e1f332104240af372ac25.prob: -------------------------------------------------------------------------------- 1 | {"name":"Bob at the Bank","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/BOBBANK","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n100 11 1 10\n999 25 36 9\n2500 100 125 101\n","output":"200\n900\n-25\n","id":1734873746549}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BobAtTheBank"}},"batch":{"id":"b594b2d5-cb67-45c1-8ad0-fbed1e363d2b","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Bob_at_the_Bank.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Bone_Appetit.cpp_63f5b854395166e6fd583a2f2fa138dd.prob: -------------------------------------------------------------------------------- 1 | {"name":"Bone Appetit","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/BNE_APT","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4 2\n5 6\n","output":"32\n","id":1733650429884},{"input":"5 0\n0 2\n","output":"0\n","id":1733650429903}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BoneAppetit"}},"batch":{"id":"d91ef540-6fd5-4220-be31-476013c1a89d","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Bone_Appetit.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Determine_the_Score.cpp_179fd995740210a2666a1a087c8100dd.prob: -------------------------------------------------------------------------------- 1 | {"name":"Determine the Score","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/DETSCORE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n10 3\n100 10\n130 4\n70 0\n","output":"3\n100\n52\n0\n","id":1733551667956}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"DetermineTheScore"}},"batch":{"id":"737d0931-3b29-4430-9563-964d5dad3c96","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Determine_the_Score.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Just_One_More_Episode.cpp_a76715a41ec3fa6a2c5ab2dc8e772cf6.prob: -------------------------------------------------------------------------------- 1 | {"name":"Just One More Episode","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/ONEMORE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n30\n23\n60\n24\n","output":"Yes\nNo\nYes\nNo\n","id":1733859099241}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"JustOneMoreEpisode"}},"batch":{"id":"5a5c018a-7785-4625-952e-e119404fe14f","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Just_One_More_Episode.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Lucky_Seven.cpp_546d5fe8b832254cfd0eb1066cf805cf.prob: -------------------------------------------------------------------------------- 1 | {"name":"Lucky Seven","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/LUCKYSEVEN","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"proceeding\n","output":"d\n","id":1733549170653},{"input":"outofsight\n","output":"i\n","id":1733549170669}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"LuckySeven"}},"batch":{"id":"0429ee0d-06f4-448c-a9ac-91b755d1b830","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Lucky_Seven.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Pending_Assignments.cpp_38ef0f42882843458fe3d6f183ae72c6.prob: -------------------------------------------------------------------------------- 1 | {"name":"Pending Assignments","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/ASSIGNMNT","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n5 5 5\n50 80 2\n20 72 1\n","output":"YES\nNO\nYES\n","id":1734771012428}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"PendingAssignments"}},"batch":{"id":"69e9eb8c-c0f1-41ff-bddf-7539b756bed3","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Pending_Assignments.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Tom_and_Jerry_Chase.cpp_bffac30ca522cfc14d92e858632dc861.prob: -------------------------------------------------------------------------------- 1 | {"name":"Tom and Jerry Chase","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/JERRYCHASE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1733723774502,"input":"4\n2 3\n4 1\n1 1\n3 5\n","output":"YES\nNO\nNO\nYES\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"TomAndJerryChase"}},"batch":{"id":"c13c396f-3d30-4ce8-808f-d9c9d072904b","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Tom_and_Jerry_Chase.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Chef_in_his_Office.cpp_5e58f1ad2a7f000df307e2ac56999734.prob: -------------------------------------------------------------------------------- 1 | {"name":"Chef in his Office","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/OFFICE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n10 5\n12 2\n8 7\n","output":"45\n50\n39\n","id":1735118948635}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChefInHisOffice"}},"batch":{"id":"2acdd4e8-d915-477f-b0c1-3e1a7cad04d9","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Chef_in_his_Office.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Monopoly.cpp_b7fab7a9aeb1085d04fa5ffbdc33a11b.prob: -------------------------------------------------------------------------------- 1 | {"name":"Monopoly","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/MONOPOLY2","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1738916998157,"input":"4\n1 1 1 10\n30 20 6 4\n100 90 3 4\n14 15 16 17\n","output":"YES\nNO\nYES\nNO\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"Monopoly"}},"batch":{"id":"9efa9302-352c-4bc3-8769-5dba003bd5da","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Monopoly.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Chef_and_Masks.cpp_04a08c230d5f8914a9e70432d6c847e6.prob: -------------------------------------------------------------------------------- 1 | {"name":"Chef and Masks","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CMASKS","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n10 100\n9 100\n88 99\n1 11\n","output":"Cloth\nDisposable\nCloth\nDisposable\n","id":1734688145992}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChefAndMasks"}},"batch":{"id":"62f788ef-37ba-4be0-8fca-6621127293f1","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Chef_and_Masks.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Chef_gives_Party.cpp_66ae79e3cd2eceb1c9d47455eec7c7a7.prob: -------------------------------------------------------------------------------- 1 | {"name":"Chef gives Party","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/PARTY2","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n5 10 70\n5 10 40\n10 40 400\n14 14 150\n","output":"YES\nNO\nYES\nNO\n","id":1733979919046}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChefGivesParty"}},"batch":{"id":"c7fecc4a-e96d-41f8-ae60-5bef4c487ef8","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Chef_gives_Party.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Codechef_Airlines.cpp_553f1614d87879cc491d95ede99d251d.prob: -------------------------------------------------------------------------------- 1 | {"name":"Codechef Airlines","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/AIRLINES","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n2 15 10\n1 10 1\n5 60 100\n1 11 7\n","output":"150\n10\n5000\n70\n","id":1734873248872}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CodechefAirlines"}},"batch":{"id":"b62d0164-788e-486a-9c26-7ca94fa904fd","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Codechef_Airlines.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Course_Registration.cpp_f2c298d2fde69e6694006c087d48b02d.prob: -------------------------------------------------------------------------------- 1 | {"name":"Course Registration","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/COURSEREG","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n2 50 27\n5 40 38\n100 100 0\n","output":"Yes\nNo\nYes\n","id":1734771253095}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CourseRegistration"}},"batch":{"id":"8d5562c9-7363-4006-91a2-6f612c2104a2","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Course_Registration.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Multivitamin_Tablets.cpp_f3a613ddd8e37bf0801eca1425b4eecf.prob: -------------------------------------------------------------------------------- 1 | {"name":"Multivitamin Tablets","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/TABLETS","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1733981519752,"input":"4\n1 10\n12 0\n10 29\n10 30\n","output":"YES\nNO\nNO\nYES\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"MultivitaminTablets"}},"batch":{"id":"43bca83e-8da3-4d5c-b50b-93ca4fce3ac9","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Multivitamin_Tablets.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Chef_and_Candies.cpp_33e8616f9e2a29038ce771ea8a5d94dd.prob: -------------------------------------------------------------------------------- 1 | {"name":"Chef and Candies","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/CHEFCAND","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1736686719936,"input":"4\n20 12\n10 100\n10 9\n20 9\n","output":"2\n0\n1\n3\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChefAndCandies"}},"batch":{"id":"d831f751-4b81-4944-aca7-c845dd7aacee","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Chef_and_Candies.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Count_the_Notebooks.cpp_2f489f93c835ea8eccfba9a8509b8c8d.prob: -------------------------------------------------------------------------------- 1 | {"name":"Count the Notebooks","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/NOTEBOOK","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1735736549589,"input":"3\n1\n100\n50\n","output":"10\n1000\n500\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CountTheNotebooks"}},"batch":{"id":"ddff3bec-34de-44b1-b294-00e059bc5767","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Count_the_Notebooks.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Sasta_Shark_Tank.cpp_dd07b80c4391c273eefee8f5c6ddd29d.prob: -------------------------------------------------------------------------------- 1 | {"name":"Sasta Shark Tank","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/SST","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1749183154396,"input":"3\n100 200\n200 100\n200 500\n","output":"ANY\nFIRST\nSECOND\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"SastaSharkTank"}},"batch":{"id":"7b9d8f57-e2f5-4656-b40d-b89e9fdf7f6b","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Sasta_Shark_Tank.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Test_Score.cpp_3fe9b3af2fef1ae85262628ad6a1bb1b.prob: -------------------------------------------------------------------------------- 1 | {"name":"Test Score","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/CHEFSCORE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"5\n1 8 4\n3 6 12\n4 5 0\n10 10 100\n8 5 36\n","output":"NO\nYES\nYES\nYES\nNO\n","id":1740505449471}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"TestScore"}},"batch":{"id":"76af2c4f-d344-42b7-8530-3d595b060616","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Test_Score.cpp"} -------------------------------------------------------------------------------- /.cph/.Search_an_element_in_an_array.cpp_9a1c88ecf61af077c8e43b0047ab8473.prob: -------------------------------------------------------------------------------- 1 | {"name":"Search an element in an array","group":"CodeChef - Practice Arrays","url":"https://www.codechef.com/practice/course/arrays/ARRAYS/problems/SEARCHINARR","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"5 3\n7 3 5 2 1\n","output":"YES\n","id":1718552645740},{"id":1718552645811,"input":"5 10\n7 3 5 2 1\n","output":"NO\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"SearchAnElementInAnArray"}},"batch":{"id":"8be4d058-dd05-44f9-9998-c26d4e6aecc5","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Search_an_element_in_an_array.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Interior_Design.cpp_c94bfe6ec93623fdf3c6fa70ecc5b5d5.prob: -------------------------------------------------------------------------------- 1 | {"name":"Interior Design","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/INTRDSGN","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n10 20 9 25\n10 20 9 20\n10 20 20 10\n100 43 85 61\n","output":"30\n29\n30\n143\n","id":1733980347809}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"InteriorDesign"}},"batch":{"id":"63b23b79-d95a-4c9b-9dbd-b7dd8fc438a0","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Interior_Design.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Monopoly_in_Chefland.cpp_1612ac22820864649c57f3d85bd65df0.prob: -------------------------------------------------------------------------------- 1 | {"name":"Monopoly in Chefland","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/MONOPOLY","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1734875316212,"input":"4\n1 1 1\n1 2 4\n2 10 3\n1 2 3\n","output":"No\nYes\nYes\nNo\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"MonopolyInChefland"}},"batch":{"id":"1805d4d9-ef60-433e-b3c0-f9b0536458f9","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Monopoly_in_Chefland.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Overspeeding_Fine.cpp_afdb509ed7c53bccd74552e98b69bbd5.prob: -------------------------------------------------------------------------------- 1 | {"name":"Overspeeding Fine","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/FINE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"7\n40\n110\n70\n100\n69\n101\n85\n","output":"0\n2000\n0\n500\n0\n2000\n500\n","id":1733893350251}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"OverspeedingFine"}},"batch":{"id":"5e844922-28d6-4d9d-b30f-49895ee62fa3","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Overspeeding_Fine.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Minimum_Cars_required.cpp_2a67ba36276e4eb5f1c4d718f8c12806.prob: -------------------------------------------------------------------------------- 1 | {"name":"Minimum Cars required","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/MINCARS","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1749187240531,"input":"4\n4\n2\n7\n98\n","output":"1\n1\n2\n25\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"MinimumCarsRequired"}},"batch":{"id":"48b9147c-800e-42a9-8473-336d46bebe0f","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Minimum_Cars_required.cpp"} -------------------------------------------------------------------------------- /Array/MIN_To_MAX.cpp: -------------------------------------------------------------------------------- 1 | //https://www.codechef.com/practice/course/arrays/ARRAYS/problems/OPMIN 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int test; 7 | cin >> test; 8 | while (test--) 9 | { 10 | int n; 11 | cin >> n; 12 | vector ar(n); 13 | for(int i=0; i> ar[i]; 15 | } 16 | int mn = *min_element(ar.begin(),ar.end()); 17 | 18 | int count = 0; 19 | for(int i=0; imn){ 21 | count++; 22 | } 23 | } 24 | cout << count< 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int x; cin >> x; 18 | double y; cin >> y; 19 | if(x%5==0 && x+0.50<=y){ 20 | y-=(x+0.50); 21 | } 22 | cout << fixed << setprecision(2) << y << endl; 23 | return 0; 24 | 25 | 26 | // Alhamdulillah 27 | } -------------------------------------------------------------------------------- /Level up from 1 star to 2 star/.cph/.Vaccine_Dates.cpp_c7f1c6d4a25f27d56e5d0d2adc8d0952.prob: -------------------------------------------------------------------------------- 1 | {"name":"Vaccine Dates ","group":"CodeChef - Level up from 1* to 2*","url":"https://www.codechef.com/practice/course/1to2stars/LP1TO201/problems/VDATES","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n10 8 12\n14 2 10\n4444 5555 6666\n8 8 12\n","output":"Take second dose now\nToo Late\nToo Early\nTake second dose now\n","id":1735391193467}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"VaccineDates"}},"batch":{"id":"ad423b91-adf8-4788-8913-aab0ca283864","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Level up from 1 star to 2 star\\Vaccine_Dates.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Cricket_World_Cup_Qualifier.cpp_b596a55389c96c3a5e0834b27ee3baa6.prob: -------------------------------------------------------------------------------- 1 | {"name":"Cricket World Cup Qualifier","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/CWC23QUALIF","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n","output":"No\n","id":1733549046467},{"id":1733549046484,"input":"17\n","output":"Yes\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"CricketWorldCupQualifier"}},"batch":{"id":"8087838d-f5d7-4150-aaef-66d41f44047f","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Cricket_World_Cup_Qualifier.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/Maximum_Submissions.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x; cin >> x; 21 | int res = x*2; 22 | cout << res << endl; 23 | } 24 | 25 | return 0; 26 | 27 | 28 | // Alhamdulillah 29 | } -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Elections_in_Chefland.cpp_89e7ca787cae7a1f37a62804dc6e38ab.prob: -------------------------------------------------------------------------------- 1 | {"name":"Elections in Chefland","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/ELECTN","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n4 3\n5 3 1 2\n3 2\n1 3 4\n4 2\n2 1 2 4\n5 6\n1 2 3 4 5\n","output":"2\n2\n3\n0\n","id":1749183915525}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ElectionsInChefland"}},"batch":{"id":"72f08e7f-16fd-4635-82ca-f07296a63576","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Elections_in_Chefland.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Watching_Movies_at_2_x.cpp_60eba8a1d3464d3d7a48fc353dd19d86.prob: -------------------------------------------------------------------------------- 1 | {"name":"Watching Movies at 2x","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/MOVIE2X","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"100 20\n","output":"90\n","id":1749188530080},{"input":"50 24\n","output":"38\n","id":1749188530081}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"WatchingMoviesAt2x"}},"batch":{"id":"7dd56370-487e-4808-b961-c8ab2f0b0fa2","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Watching_Movies_at_2_x.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.404_Not_Found.cpp_800b96cf154b22c6306fd45a5f68bd02.prob: -------------------------------------------------------------------------------- 1 | {"name":"404 Not Found","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/ERROR404","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"200\n","output":"FOUND\n","id":1733551792796},{"input":"404\n","output":"NOT FOUND\n","id":1733551792815},{"id":1733551792837,"input":"301\n","output":"FOUND\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"NotFound"}},"batch":{"id":"617bc14b-8825-4ee1-9b7a-18ece71cf766","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\404_Not_Found.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/Fill_the_Bucket.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int k,n; cin >> k >> n; 21 | int over = k-n; 22 | cout << over << endl; 23 | } 24 | 25 | return 0; 26 | 27 | 28 | // Alhamdulillah 29 | } -------------------------------------------------------------------------------- /500 difficulty rating/Get_Subscription.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x; cin >> x; 21 | if(x>30){ 22 | yes; 23 | }else no; 24 | } 25 | 26 | return 0; 27 | 28 | 29 | // Alhamdulillah 30 | } -------------------------------------------------------------------------------- /500 difficulty rating/Instagram.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; cin >> x >> y; 21 | if(x>10*y){ 22 | yes; 23 | }else no; 24 | } 25 | 26 | return 0; 27 | 28 | 29 | // Alhamdulillah 30 | } -------------------------------------------------------------------------------- /500 difficulty rating/Minimum_Coins.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x; cin >> x; 21 | int notes=x%10; 22 | cout << notes << endl; 23 | 24 | } 25 | 26 | return 0; 27 | 28 | 29 | // Alhamdulillah 30 | } -------------------------------------------------------------------------------- /500 difficulty rating/Volume_Control.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; cin >> x >> y; 21 | int res=abs(x-y); 22 | cout << res << endl; 23 | } 24 | 25 | return 0; 26 | 27 | 28 | // Alhamdulillah 29 | } -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Is_the_Score_Consistent.cpp_e76e29b02f1fc72f4c7f9d19b8b90a85.prob: -------------------------------------------------------------------------------- 1 | {"name":"Is the Score Consistent","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/TRUESCORE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1738916436138,"input":"3\n1 5\n3 5\n3 4\n2 6\n2 2\n2 2\n","output":"POSSIBLE\nIMPOSSIBLE\nPOSSIBLE\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"IsTheScoreConsistent"}},"batch":{"id":"d4c64eae-d473-4e63-aef3-701e1743423e","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Is_the_Score_Consistent.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/Chef_and_Chapters.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y,z; cin >> x >> y >> z; 21 | int res=x*y*z; 22 | cout << res << endl; 23 | } 24 | 25 | return 0; 26 | 27 | 28 | // Alhamdulillah 29 | } -------------------------------------------------------------------------------- /500 difficulty rating/Discount.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int discount; cin >> discount; 21 | int res=100-discount; 22 | cout << res << endl; 23 | } 24 | 25 | return 0; 26 | 27 | 28 | // Alhamdulillah 29 | } -------------------------------------------------------------------------------- /500 difficulty rating/Time_Complexity.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int a,b; cin >> a >> b; 21 | if(a>b){ 22 | yes; 23 | }else no; 24 | } 25 | 26 | return 0; 27 | 28 | 29 | // Alhamdulillah 30 | } -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Water_Filling.cpp_47f88fbaacdde6208ba35bbc154f1eb6.prob: -------------------------------------------------------------------------------- 1 | {"name":"Water Filling","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/WATERFILLING","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"5\n0 0 0\n1 1 1\n1 1 0\n0 1 0\n0 1 1\n","output":"Water filling time\nNot now\nNot now\nWater filling time\nNot now\n","id":1735226717602}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"WaterFilling"}},"batch":{"id":"4117e3c2-2b56-4ba7-8813-36f43f7ac533","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Water_Filling.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.October_Marathon.cpp_834e6a0f68078621eec11c51747569b4.prob: -------------------------------------------------------------------------------- 1 | {"name":"October Marathon","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/OCTATHON","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"2\n","output":"GOLD\n","id":1733857244943},{"input":"5\n","output":"SILVER\n","id":1733857245021},{"id":1733857245006,"input":"6\n","output":"BRONZE\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"OctoberMarathon"}},"batch":{"id":"7e74e397-972b-4c32-b001-931ec7ed2f96","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\October_Marathon.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Air_Conditioner_Temperature.cpp_024dd751d70c29a47f73ce6150b6dab1.prob: -------------------------------------------------------------------------------- 1 | {"name":"Air Conditioner Temperature","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/ACTEMP","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1749187045222,"input":"4\n30 35 25\n30 35 40\n30 35 35\n30 25 35\n","output":"Yes\nNo\nYes\nNo\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"AirConditionerTemperature"}},"batch":{"id":"e49a7c25-0d88-4a42-b01a-31031761a3cc","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Air_Conditioner_Temperature.cpp"} -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Bus_Seat_Numbering.cpp_a35256589c6cedb4e3f3f9e75694a9e5.prob: -------------------------------------------------------------------------------- 1 | {"name":"Bus Seat Numbering","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/SEATNUMBER","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1749187873560,"input":"5\n6\n28\n16\n13\n10\n","output":"Lower Double\nUpper Single\nUpper Double\nLower Single\nLower Double\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BusSeatNumbering"}},"batch":{"id":"69de1018-1967-4ed7-91c9-10d8d49311c8","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Bus_Seat_Numbering.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/Ezio_and_Guards.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; 21 | cin >> x >> y; 22 | if(x>=y){ 23 | yes; 24 | }else no; 25 | } 26 | 27 | return 0; 28 | 29 | 30 | // Alhamdulillah 31 | } -------------------------------------------------------------------------------- /500 difficulty rating/Good_Investment_or_Not.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; cin >> x >> y; 21 | if(y*2<=x){ 22 | yes; 23 | }else no; 24 | } 25 | 26 | return 0; 27 | 28 | 29 | // Alhamdulillah 30 | } -------------------------------------------------------------------------------- /500 difficulty rating/True_and_False_Paper.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; cin >> x >> y; 21 | int bob_score=x-y; 22 | cout << bob_score << endl; 23 | } 24 | 25 | return 0; 26 | 27 | 28 | // Alhamdulillah 29 | } -------------------------------------------------------------------------------- /500 difficulty rating/Best_of_Two.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int a,b; cin >> a >> b; 21 | if(a>b){ 22 | cout << a << endl; 23 | }else cout << b << endl; 24 | } 25 | 26 | return 0; 27 | 28 | 29 | // Alhamdulillah 30 | } -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Messi_vs_Ronaldo.cpp_7681ff0b7c5d097d655953d394bbae1e.prob: -------------------------------------------------------------------------------- 1 | {"name":"Messi vs Ronaldo","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/MVR","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"40 30 50 10\n","output":"Equal\n","id":1733856701250},{"input":"91 22 60 30\n","output":"Messi\n","id":1733856701267},{"input":"60 30 80 20\n","output":"Ronaldo\n","id":1733856701275}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"MessiVsRonaldo"}},"batch":{"id":"41e04785-ff5c-4c2c-9edb-dca2846cce11","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Messi_vs_Ronaldo.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/Dominant_Army.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y,z; cin >> x >> y >> z; 21 | 22 | if(x>y+z || y>x+z || z>x+y){ 23 | yes; 24 | }else no; 25 | } 26 | 27 | return 0; 28 | 29 | 30 | // Alhamdulillah 31 | } -------------------------------------------------------------------------------- /500 difficulty rating/Final_Population.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y,z; cin >> x >> y >> z; 21 | int population_growth = x-y+z; 22 | cout << population_growth << endl; 23 | } 24 | 25 | return 0; 26 | 27 | 28 | // Alhamdulillah 29 | } -------------------------------------------------------------------------------- /500 difficulty rating/Multivitamin_Tablets.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; cin >> x >> y; 21 | int res=x*3; 22 | if(res<=y){ 23 | yes; 24 | }else no; 25 | } 26 | 27 | return 0; 28 | 29 | 30 | // Alhamdulillah 31 | } -------------------------------------------------------------------------------- /500 difficulty rating/Chef_gives_Party.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int n,x,y; cin >> n >> x >> y; 21 | int cost=n*x; 22 | if(cost<=y){ 23 | yes; 24 | }else no; 25 | } 26 | 27 | return 0; 28 | 29 | 30 | // Alhamdulillah 31 | } -------------------------------------------------------------------------------- /500 difficulty rating/Is_it_hot_or_cold.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int n; cin >> n; 21 | if(n>20){ 22 | cout << "HOT" << endl; 23 | }else cout << "COLD" << endl; 24 | } 25 | 26 | return 0; 27 | 28 | 29 | // Alhamdulillah 30 | } -------------------------------------------------------------------------------- /500 difficulty rating/Miami_GP.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; cin >> x >> y; 21 | double motion = x*1.07; 22 | if(motion>=y){ 23 | yes; 24 | }else no; 25 | } 26 | 27 | return 0; 28 | 29 | 30 | // Alhamdulillah 31 | } -------------------------------------------------------------------------------- /500 difficulty rating/Sum_it.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int a, b, c; cin >> a >> b >> c; 21 | if(a+b==c){ 22 | yes; 23 | }else{ 24 | no; 25 | } 26 | } 27 | 28 | return 0; 29 | 30 | 31 | // Alhamdulillah 32 | } -------------------------------------------------------------------------------- /500 difficulty rating/Chef_and_Chocolates.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int c,x,y; cin >> c >> x >> y; 21 | int needed=c-x; 22 | int cost = needed*y; 23 | cout << cost << endl; 24 | } 25 | 26 | return 0; 27 | 28 | 29 | // Alhamdulillah 30 | } -------------------------------------------------------------------------------- /.cph/.Additional_Sample_1.cpp_d3e4299c26554759b87471bd7463c4a9.prob: -------------------------------------------------------------------------------- 1 | {"name":"Additional Sample 1","group":"CodeChef - Practice Strings","url":"https://www.codechef.com/practice/course/strings/STRINGS/problems/WORDLE?tab=hints","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"10\nABCDE\nEDCBA\nROUND\nRINGS\nSTART\nSTUNT\nTRORS\nTHORS\nTOPER\nGOPES\nUNTIL\nUTILL\nABCD\nDCBA\nSAFES\nAIFES\nLOOPS\nPOOLS\nCARSA\nSCARS\n","output":"BBGBB\nGBBBB\nGGBBG\nGBGGG\nBGGGB\nGBBBG\nBBBBG\nBBGGG\nBGGBG\nBBBBB\n","id":1718538211223}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"AdditionalSample1"}},"batch":{"id":"56f0c2d5-a0d5-40ac-a65f-af26034427b2","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Additional_Sample_1.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/Best_Coupon.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int n; cin>> n; 21 | int dis_product=n*0.1; 22 | int dis_flat=100; 23 | cout << max(dis_flat, dis_product) << endl; 24 | } 25 | 26 | return 0; 27 | 28 | 29 | // Alhamdulillah 30 | } -------------------------------------------------------------------------------- /500 difficulty rating/Reach_Home.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; 21 | cin >> x >> y; 22 | int distance=x*5; 23 | if(distance>=y){ 24 | yes; 25 | }else no; 26 | } 27 | 28 | return 0; 29 | 30 | 31 | // Alhamdulillah 32 | } -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Air_Quality_Index.cpp_70244244067c8816190b8158cfec5e34.prob: -------------------------------------------------------------------------------- 1 | {"name":"Air Quality Index","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/AIRINDEX","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"50\n","output":"YES\n","id":1733894462857},{"input":"100\n","output":"NO\n","id":1733894462842},{"input":"99\n","output":"YES\n","id":1733894462842},{"input":"145\n","output":"NO\n","id":1733894462841}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"AirQualityIndex"}},"batch":{"id":"63ad3741-cc2f-4e1a-97b5-ea6e0700710b","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Air_Quality_Index.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/Car_Trip.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x; cin >> x; 21 | if(x<300){ 22 | cout << 3000 << endl; 23 | }else{ 24 | cout << x*10 << endl; 25 | } 26 | } 27 | 28 | return 0; 29 | 30 | 31 | // Alhamdulillah 32 | } -------------------------------------------------------------------------------- /500 difficulty rating/Chef_and_Wire_Frames.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int len, width, n; cin >> len >> width >> n; 21 | int area=2*len+2*width; 22 | int cost=n*area; 23 | cout << cost << endl; 24 | } 25 | 26 | return 0; 27 | 28 | 29 | // Alhamdulillah 30 | } -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/Minimum_Pizzas.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int n,x; cin >> n >> x; 21 | int required=n*x; 22 | 23 | int pizza=(required+3)/4; 24 | cout << pizza << endl; 25 | } 26 | 27 | return 0; 28 | 29 | 30 | // Alhamdulillah 31 | } -------------------------------------------------------------------------------- /500 difficulty rating/Lucky_Seven.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-07 || 11:26:12 6 | * * * * File : Lucky_Seven.cpp 7 | */ 8 | 9 | #include 10 | #define ll long long 11 | #define pi pair 12 | #define asort(v) sort(v.begin(), v.end()) 13 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 14 | #define yes cout << "YES\n" 15 | #define no cout << "NO\n" 16 | #define cyes cout << "Yes\n" 17 | #define cno cout << "No\n" 18 | #define endl "\n" 19 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 20 | 21 | using namespace std; 22 | int main() 23 | { 24 | fast(); 25 | string s; cin >> s; 26 | cout << s[7-1] << endl; 27 | return 0; 28 | 29 | 30 | // Alhamdulillah 31 | } -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Problems_in_your_to_do_list.cpp_d9ca025233f68212f732c5018a6406c8.prob: -------------------------------------------------------------------------------- 1 | {"name":"Problems in your to-do list","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/TODOLIST","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"5\n3\n800 1200 900\n4\n999 1000 1001 1002\n5\n1 2 2 2 5000\n5\n1000 1000 1000 1000 1000\n3\n900 700 800\n","output":"1\n3\n1\n5\n0\n","id":1749186656817}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ProblemsInYourToDoList"}},"batch":{"id":"d5e27732-abfb-4ff4-9b60-5d8697a42d5b","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Problems_in_your_to_do_list.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/First_and_Last_Digit.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int n; cin >> n; 21 | string s=to_string(n); 22 | 23 | int first = s[0]-'0', last=s[s.size()-1]-'0'; 24 | cout << first+last << endl; 25 | } 26 | 27 | return 0; 28 | 29 | 30 | // Alhamdulillah 31 | } -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/Exams.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y,z; cin >> x >> y >> z; 21 | int passed=x*y; 22 | 23 | int per=passed/2; 24 | if(z>per){ 25 | yes; 26 | }else no; 27 | } 28 | 29 | return 0; 30 | 31 | 32 | // Alhamdulillah 33 | } -------------------------------------------------------------------------------- /.cph/.Convert_String_to_Title_Case.cpp_2fbd1c5a3db3012d7bfcf5f02b771332.prob: -------------------------------------------------------------------------------- 1 | {"name":"Convert String to Title Case","group":"CodeChef - Practice Strings","url":"https://www.codechef.com/practice/course/strings/STRINGS/problems/TITLECASE","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1718548979107,"input":"5\nhello world\nthis is a CODECHEF problem\nWELCOME to the JUNGLE\nthe quick BROWN fOx\nprogramming in PYTHON\n","output":"Hello World\nThis Is A CODECHEF Problem\nWELCOME To The JUNGLE\nThe Quick BROWN Fox\nProgramming In PYTHON\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ConvertStringToTitleCase"}},"batch":{"id":"f8f5412f-d949-4aa8-bb32-205a9376120f","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\Convert_String_to_Title_Case.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/Profit_Increment.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; cin >> x >> y; 21 | 22 | int buy=x-y; 23 | int sell=x+(x/10); 24 | int profit=sell-buy; 25 | cout << profit << endl; 26 | 27 | } 28 | 29 | return 0; 30 | 31 | 32 | // Alhamdulillah 33 | } -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/Sugarcane_Juice_Business.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | ll t; cin >> t; 18 | while (t--) 19 | { 20 | ll n; cin >> n; 21 | ll sell = n*50; 22 | ll cost = (sell*70)/100; 23 | 24 | ll profit=sell-cost; 25 | cout << profit << endl; 26 | } 27 | 28 | return 0; 29 | 30 | 31 | // Alhamdulillah 32 | } -------------------------------------------------------------------------------- /500 difficulty rating/Six_Friends.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; cin >> x >> y; 21 | int dui=x*3; 22 | int tin=y*2; 23 | 24 | if(dui 12 | #define ll long long 13 | #define pi pair 14 | #define asort(v) sort(v.begin(), v.end()) 15 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 16 | #define yes cout << "YES\n" 17 | #define no cout << "NO\n" 18 | #define cyes cout << "Yes\n" 19 | #define cno cout << "No\n" 20 | #define endl "\n" 21 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 22 | 23 | using namespace std; 24 | int main() 25 | { 26 | fast(); 27 | int n; cin >> n; 28 | int to_pay=(n*2000)/500; 29 | cout << to_pay << endl; 30 | return 0; 31 | 32 | 33 | // Alhamdulillah 34 | } -------------------------------------------------------------------------------- /500 difficulty rating/Off_By_One.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-07 || 12:12:45 6 | * * * * File : Off_By_One.cpp 7 | */ 8 | 9 | 10 | #include 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int a,b; cin >> a >> b; 27 | int res=a+b; 28 | cout << res << '1' << endl; 29 | return 0; 30 | 31 | 32 | // Alhamdulillah 33 | } -------------------------------------------------------------------------------- /500 difficulty rating/Double_Rent.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-07 || 11:30:59 6 | * * * * File : Double_Rent.cpp 7 | */ 8 | 9 | 10 | #include 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int x; cin >> x; 27 | int after_pay = 2*x; 28 | cout << after_pay << endl; 29 | return 0; 30 | 31 | 32 | // Alhamdulillah 33 | } -------------------------------------------------------------------------------- /500 difficulty rating/Puzzle_Hunt.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-08 || 15:31:23 6 | * * * * File : Puzzle_Hunt.cpp 7 | */ 8 | 9 | 10 | #include 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int n; cin >> n; 27 | if(n>=6 && n<=8){ 28 | cyes; 29 | }else cno; 30 | return 0; 31 | 32 | 33 | // Alhamdulillah 34 | } -------------------------------------------------------------------------------- /500 difficulty rating/Chef_and_Gym.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y,z; cin >> x >> y >> z; 21 | 22 | if(x+y<=z){ 23 | cout << 2 << endl; 24 | }else if(x<=z){ 25 | cout << 1 << endl; 26 | }else cout << 0 << endl; 27 | } 28 | 29 | return 0; 30 | 31 | 32 | // Alhamdulillah 33 | } -------------------------------------------------------------------------------- /500 difficulty rating/Credit_score.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-21 || 14:36:03 6 | * * * * File : Credit_score.cpp 7 | */ 8 | 9 | 10 | 11 | #include 12 | #define ll long long 13 | #define pi pair 14 | #define asort(v) sort(v.begin(), v.end()) 15 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 16 | #define yes cout << "YES\n" 17 | #define no cout << "NO\n" 18 | #define cyes cout << "Yes\n" 19 | #define cno cout << "No\n" 20 | #define endl "\n" 21 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 22 | 23 | using namespace std; 24 | int main() 25 | { 26 | fast(); 27 | int n; cin >> n; 28 | if(n>=750){ 29 | yes; 30 | }else no; 31 | return 0; 32 | 33 | 34 | // Alhamdulillah 35 | } -------------------------------------------------------------------------------- /500 difficulty rating/Spice_Level.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x; cin >> x; 21 | if(x<4){ 22 | cout << "MILD" << endl; 23 | }else if(x>=4 && x<7){ 24 | cout << "MEDIUM" << endl; 25 | }else cout << "HOT" << endl; 26 | } 27 | 28 | return 0; 29 | 30 | 31 | // Alhamdulillah 32 | } -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.How_many_unattempted_problems.cpp_28f191baa5f03904adabcfd811d11941.prob: -------------------------------------------------------------------------------- 1 | {"name":"How many unattempted problems","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/PRACLIST","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"10 4\n","output":"6\n","id":1733551274437},{"input":"10 10\n","output":"0\n","id":1733551274400},{"input":"1000 990\n","output":"10\n","id":1733551274454},{"input":"500 1\n","output":"499\n","id":1733551274450}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"HowManyUnattemptedProblems"}},"batch":{"id":"0d7175ec-34bc-48b1-9dcc-16735c85b320","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\How_many_unattempted_problems.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/.cph/.Practice_makes_us_perfect.cpp_c52f2d5dda0da9ab75e7622d9c83644f.prob: -------------------------------------------------------------------------------- 1 | {"name":"Practice makes us perfect","group":"CodeChef - 500 difficulty rating","url":"https://www.codechef.com/practice/course/basic-programming-concepts/DIFF500/problems/PRACTICEPERF","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"12 15 8 10\n","output":"3\n","id":1734770722015},{"input":"2 3 1 10\n","output":"1\n","id":1734770722013},{"input":"12 100 99 11\n","output":"4\n","id":1734770721950},{"input":"1 1 1 1\n","output":"0\n","id":1734770721982}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"PracticeMakesUsPerfect"}},"batch":{"id":"88edd577-ffd8-49a9-8c7d-adddef1ab819","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 difficulty rating\\Practice_makes_us_perfect.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/Air_Quality_Index.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-11 || 11:21:06 6 | * * * * File : Air_Quality_Index.cpp 7 | */ 8 | 9 | 10 | 11 | #include 12 | #define ll long long 13 | #define pi pair 14 | #define asort(v) sort(v.begin(), v.end()) 15 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 16 | #define yes cout << "YES\n" 17 | #define no cout << "NO\n" 18 | #define cyes cout << "Yes\n" 19 | #define cno cout << "No\n" 20 | #define endl "\n" 21 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 22 | 23 | using namespace std; 24 | int main() 25 | { 26 | fast(); 27 | int n; cin >> n; 28 | if(n>=100){ 29 | no; 30 | }else yes; 31 | return 0; 32 | 33 | 34 | // Alhamdulillah 35 | } -------------------------------------------------------------------------------- /500 difficulty rating/The_Cheaper_Cab.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; cin >> x >> y; 21 | if(x 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x; cin >> x; 21 | if(x<=3){ 22 | cout << "BRONZE" << endl; 23 | }else if(x>3 && x<=6){ 24 | cout << "SILVER" << endl; 25 | }else cout << "GOLD" << endl; 26 | } 27 | 28 | return 0; 29 | 30 | 31 | // Alhamdulillah 32 | } -------------------------------------------------------------------------------- /500 difficulty rating/Cricket_World_Cup_Qualifier.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-07 || 11:24:15 6 | * * * * File : Cricket_World_Cup_Qualifier.cpp 7 | */ 8 | 9 | #include 10 | #define ll long long 11 | #define pi pair 12 | #define asort(v) sort(v.begin(), v.end()) 13 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 14 | #define yes cout << "YES\n" 15 | #define no cout << "NO\n" 16 | #define cyes cout << "Yes\n" 17 | #define cno cout << "No\n" 18 | #define endl "\n" 19 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 20 | 21 | using namespace std; 22 | int main() 23 | { 24 | fast(); 25 | int n; cin >> n; 26 | if(n<12){ 27 | cno; 28 | }else cyes; 29 | return 0; 30 | 31 | 32 | // Alhamdulillah 33 | } -------------------------------------------------------------------------------- /Array/Largest_and_Second_Largest.cpp: -------------------------------------------------------------------------------- 1 | //https://www.codechef.com/practice/course/arrays/ARRAYS/problems/LARGESECOND 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int test; 7 | cin >> test ; 8 | while (test--) 9 | { 10 | int n; 11 | cin >> n; 12 | vector ar(n); 13 | for(int i=0; i> ar[i]; 15 | } 16 | int f_mx = INT_MIN; 17 | int s_mx = INT_MAX; 18 | for(int i=0; if_mx){ 20 | s_mx = f_mx; 21 | f_mx = ar[i]; 22 | } 23 | else if((ar[i]>s_mx) && (ar[i] 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; cin >> x >> y; 21 | int disposable = x*100; 22 | int cloth = y*10; 23 | if(disposable 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int a,b; 21 | cin >> a >> b; 22 | int count_word=a*b; 23 | cout << count_word << endl; 24 | } 25 | 26 | return 0; 27 | 28 | 29 | // Alhamdulillah 30 | } -------------------------------------------------------------------------------- /500 difficulty rating/Increase_IQ.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-22 || 19:17:39 6 | * * * * File : Increase_IQ.cpp 7 | */ 8 | 9 | 10 | #include 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int n; cin >> n; 27 | int iq=n+7; 28 | if(iq>170){ 29 | cyes; 30 | }else cno; 31 | 32 | return 0; 33 | 34 | 35 | // Alhamdulillah 36 | } -------------------------------------------------------------------------------- /500 difficulty rating/Overspeeding_Fine.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int speed; cin >> speed; 21 | if(speed<=70){ 22 | cout << 0 << endl; 23 | }else if(speed>70 && speed<=100){ 24 | cout << 500 << endl; 25 | }else cout << 2000 << endl; 26 | } 27 | 28 | return 0; 29 | 30 | 31 | // Alhamdulillah 32 | } -------------------------------------------------------------------------------- /500 difficulty rating/Broken_Phone.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x,y; cin >> x >> y; 21 | if(x 3 | using namespace std; 4 | int main() 5 | { 6 | int test; 7 | cin >> test; 8 | while (test--) 9 | { 10 | int n; 11 | cin >> n; 12 | string s; 13 | cin>>s; 14 | for(int i=0; i 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int n,m; cin >> n >> m; 27 | int x,y; cin >> x >> y; 28 | int res=n*x+m*y; 29 | cout << res << endl; 30 | return 0; 31 | 32 | 33 | // Alhamdulillah 34 | } -------------------------------------------------------------------------------- /500 difficulty rating/Clear_Day.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-07 || 11:28:19 6 | * * * * File : Clear_Day.cpp 7 | */ 8 | 9 | 10 | #include 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int x,y; cin >> x >> y; 27 | int total_rainy_clody=x+y; 28 | int res=7-total_rainy_clody; 29 | cout << res << endl; 30 | return 0; 31 | 32 | 33 | // Alhamdulillah 34 | } -------------------------------------------------------------------------------- /500 difficulty rating/How_many_unattempted_problems.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-07 || 12:01:27 6 | * * * * File : How_many_unattempted_problems.cpp 7 | */ 8 | 9 | 10 | #include 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int x,y; cin >> x >> y; 27 | int unattempted=x-y; 28 | cout << unattempted << endl; 29 | return 0; 30 | 31 | 32 | // Alhamdulillah 33 | } -------------------------------------------------------------------------------- /500 difficulty rating/Rain_in_Chefland.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int x; cin >> x; 21 | if(x<3){ 22 | cout << "LIGHT" << endl; 23 | }else if(x>=3 && x<7){ 24 | cout << "MODERATE" << endl; 25 | }else{ 26 | cout << "HEAVY" << endl; 27 | } 28 | } 29 | 30 | return 0; 31 | 32 | 33 | // Alhamdulillah 34 | } -------------------------------------------------------------------------------- /500 difficulty rating/Speciality.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define pi pair 4 | #define asort(v) sort(v.begin(), v.end()) 5 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 6 | #define yes cout << "YES\n" 7 | #define no cout << "NO\n" 8 | #define cyes cout << "Yes\n" 9 | #define cno cout << "No\n" 10 | #define endl "\n" 11 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 12 | 13 | using namespace std; 14 | int main() 15 | { 16 | fast(); 17 | int t; cin >> t; 18 | while (t--) 19 | { 20 | int a,b,c; cin >> a >> b >> c; 21 | if(a>b && a>c){ 22 | cout << "Setter" << endl; 23 | }else if(b>c && b>a){ 24 | cout << "Tester" << endl; 25 | } 26 | else cout << "Editorialist" << endl; 27 | } 28 | 29 | return 0; 30 | 31 | 32 | // Alhamdulillah 33 | } -------------------------------------------------------------------------------- /500 to 1000 difficulty problems/.cph/.Mahasena.cpp_130613ee04bee4c3f1a5aa3c47c229f2.prob: -------------------------------------------------------------------------------- 1 | {"name":"Mahasena","group":"CodeChef - 500 to 1000 difficulty rating","url":"https://www.codechef.com/practice/course/logical-problems/DIFF800/problems/AMR15A","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"1\n1\n","output":"NOT READY\n","id":1735119072455},{"input":"1\n2\n","output":"READY FOR BATTLE\n","id":1735119072379},{"input":"4\n11 12 13 14\n","output":"NOT READY\n","id":1735119072382},{"input":"3\n2 3 4\n","output":"READY FOR BATTLE\n","id":1735119072398},{"input":"5\n1 2 3 4 5\n","output":"NOT READY\n","id":1735119072451}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"Mahasena"}},"batch":{"id":"e2d1f23b-d7a0-40d2-aa5a-427291704261","size":1},"srcPath":"e:\\OJ Problem\\Codechef\\500 to 1000 difficulty problems\\Mahasena.cpp"} -------------------------------------------------------------------------------- /500 difficulty rating/404_Not_Found.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-07 || 12:09:55 6 | * * * * File : 404_Not_Found.cpp 7 | */ 8 | 9 | 10 | #include 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int x; cin >> x; 27 | int response=404; 28 | if(x==response){ 29 | cout << "NOT FOUND" << endl; 30 | }else cout << "FOUND" << endl; 31 | return 0; 32 | 33 | 34 | // Alhamdulillah 35 | } -------------------------------------------------------------------------------- /500 difficulty rating/Ageing.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-09 || 14:29:39 6 | * * * * File : Ageing.cpp 7 | */ 8 | 9 | 10 | 11 | #include 12 | #define ll long long 13 | #define pi pair 14 | #define asort(v) sort(v.begin(), v.end()) 15 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 16 | #define yes cout << "YES\n" 17 | #define no cout << "NO\n" 18 | #define cyes cout << "Yes\n" 19 | #define cno cout << "No\n" 20 | #define endl "\n" 21 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 22 | 23 | using namespace std; 24 | int main() 25 | { 26 | fast(); 27 | int t; cin >> t; 28 | while (t--) 29 | { 30 | int x; cin >> x; 31 | int age=x-10; 32 | cout << age << endl; 33 | } 34 | 35 | return 0; 36 | 37 | 38 | // Alhamdulillah 39 | } -------------------------------------------------------------------------------- /500 difficulty rating/Candy_Division.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-08 || 15:49:15 6 | * * * * File : Candy_Division.cpp 7 | */ 8 | 9 | 10 | #include 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int t; cin >> t; 27 | while(t--){ 28 | int x; cin >> x; 29 | if(x%3==0){ 30 | yes; 31 | }else no; 32 | } 33 | return 0; 34 | 35 | 36 | // Alhamdulillah 37 | } -------------------------------------------------------------------------------- /500 difficulty rating/Chef_and_Donation.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-09 || 14:52:47 6 | * * * * File : Chef_and_Donation.cpp 7 | */ 8 | 9 | 10 | #include 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int t; cin >> t; 27 | while (t--) 28 | { 29 | int a, b; cin >> a >> b; 30 | cout << b-a << endl; 31 | } 32 | 33 | return 0; 34 | 35 | 36 | // Alhamdulillah 37 | } -------------------------------------------------------------------------------- /500 difficulty rating/Mana_Points.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-11 || 01:34:21 6 | * * * * File : Mana_Points.cpp 7 | */ 8 | 9 | 10 | #include 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int t; cin >> t; 27 | while (t--) 28 | { 29 | int x,y; cin >> x >> y; 30 | int res=y/x; 31 | cout << res << endl; 32 | } 33 | 34 | return 0; 35 | 36 | 37 | // Alhamdulillah 38 | } -------------------------------------------------------------------------------- /500 difficulty rating/Parity.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-08 || 15:53:00 6 | * * * * File : Parity.cpp 7 | */ 8 | 9 | 10 | 11 | #include 12 | #define ll long long 13 | #define pi pair 14 | #define asort(v) sort(v.begin(), v.end()) 15 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 16 | #define yes cout << "YES\n" 17 | #define no cout << "NO\n" 18 | #define cyes cout << "Yes\n" 19 | #define cno cout << "No\n" 20 | #define endl "\n" 21 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 22 | 23 | using namespace std; 24 | int main() 25 | { 26 | fast(); 27 | int t; cin>> t; 28 | while (t--) 29 | { 30 | int x; cin >> x; 31 | if(x%2==0){ 32 | cyes; 33 | }else cno; 34 | } 35 | 36 | return 0; 37 | 38 | 39 | // Alhamdulillah 40 | } -------------------------------------------------------------------------------- /500 difficulty rating/Battery_Low.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Bismillahir Rahmanir Raheem 3 | * 4 | * * * * Coder : abubakaristiak 5 | * * * * Created : 2024-12-22 || 19:19:29 6 | * * * * File : Battery_Low.cpp 7 | */ 8 | 9 | 10 | #include 11 | #define ll long long 12 | #define pi pair 13 | #define asort(v) sort(v.begin(), v.end()) 14 | #define rsort(v) sort(v.begin(), v.end(), greater<>()) 15 | #define yes cout << "YES\n" 16 | #define no cout << "NO\n" 17 | #define cyes cout << "Yes\n" 18 | #define cno cout << "No\n" 19 | #define endl "\n" 20 | #define fast() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 21 | 22 | using namespace std; 23 | int main() 24 | { 25 | fast(); 26 | int t; cin >> t; 27 | while (t--) 28 | { 29 | int n; cin >> n; 30 | if(n<=15){ 31 | cyes; 32 | }else cno; 33 | } 34 | 35 | return 0; 36 | 37 | 38 | // Alhamdulillah 39 | } --------------------------------------------------------------------------------