[gcj] Re: RobotPathDecoding

You need to use long long to handle intermediate result, otherwise it will overflow. Otherwise, your solution looks pretty good! *#include * *#include * *#include * *using namespace std;* *long long MOD = 10LL;* *pair, int> xydis(string s) {* * long long x = 0;* * long long y = 0;* *

[gcj] RobotPathDecoding

https://codingcompetitions.withgoogle.com/kickstart/round/0019ffc8/002d83dc This is RobotPathDecoding problem from kickstart 2020 RoundB. I have written this code in c++ with a recursive function. it works fine with testSet1 but gives WA on testSet2 Could any one resolve this

[gcj] BuildingPalindromes

https://codingcompetitions.withgoogle.com/kickstart/round/00050eda/00119866 This a problem from kickstart 2019 Round B. The test set1 works fine, but a TLE on testSet2, could any one resolve this issue? If any please do reply. Thanks #include #include #include #include using

[gcj] Re: [1A][Square Dance][JAVA] WA, how so ?

Thank it works for the first Test case now I have TLE for the second. I don't understand how it changes something ? Le jeudi 23 avril 2020 20:34:34 UTC+2, vijender ahlawat a écrit : > > Hi Quentin > > try changing score to long > > int score = 0; > > long score = 0; > > On Thursday, 23 April 2020