Hello Everyone - I started Codeforces because it is a very good platform to improve your coding and logical skills. I am trying to solve and upsolve the problems as much as possible(not too much because of my tight school schedule and sometimes for exams i take breaks).

• I don't know what happen but I am not able to solve even A B of Div 2 after spending quality tiime on Codeforces and also on other coding platforms and leaned the Data Structures.
• I know that i am very naive and doing something very silly in my journey to become expert but i am not able to figure out what i am doing wrong. I am very open to criticism and please give all valuable insights that will significantly help me to solve problems consistently.
• I am really passionate to do anything to become expert so please help me.
• I know there are many high rated people that will figure out what i am doing wrong(that i am not able to do by myself) and correct me.

266609289### THIS IS MY FIRST TIME WRITING A BLOG IDK HOW TO PROPERLY DO IT ....I HOPE EVERYONE CAN UNDERSTAND WHAT I AM SAYING

Problem Statement:Manhattan Permutations(Codeforces Round 953 Div 2) In my code i am using int n,k; but the problem is it is giving me wrong answer because one testcase is (1 1000000000000) which is integer out of bound

MY concern is why after this one testcase all of my other tescases is giving me wrong answers , and when i remove this one testcase ...my code runs perfectly fine

Can someone explain me what is happening....i will pin my code screenshot .....PLZ PLZ PLZ!!! explain me why that one testcase is causing other testcases to fail(this is my main problem).