when wll be the code jam?
On 8/5/09, Hugo Benicio wrote:
> Precisely :)
>
> On Wed, Aug 5, 2009 at 2:21 PM, Aditya Bhiday
> wrote:
>
>> Yes, I meant compiler. Sorry for the mistake. The idea is that if you use
>> a
>> CLI to run your compiled code then it is easier and much more
>> straightforwa
R u Jew ?
On Wed, Aug 12, 2009 at 5:37 PM, Raphael Fogel wrote:
>
> I am looking for an Israeli coder for a blog post
>
> Best,
> Raphael Fogel
> www.startupmania.co.il
>
> >
>
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Goog
any one in this mail chain is TOPCODE?
On Fri, Aug 14, 2009 at 5:12 PM, token0 wrote:
>
> The second is right.
> The questions are always the same.
> Inputs and outputs are not different for C and C++.
> You can always choose the language you use. For example you can solve
> a part of the questi
If u r from any IIt or above u can hope,or if u r a Turing
On Sun, Aug 16, 2009 at 1:44 PM, Mani wrote:
>
> I want to know the opportunities given , if any?
> And how much candidates manage to get those?
> >
>
--~--~-~--~~~---~--~~
You received this message becau
Hello please tell the start and end time of the contest in india, in india
times
Regards
Jawahar
On Thu, Aug 27, 2009 at 6:42 AM, sun eghost wrote:
> hello! everyone, nice to meet you!
>
> >
>
--~--~-~--~~~---~--~~
You received this message because you are subscr
Hello how meny points are required to go for next round?
On Fri, Sep 4, 2009 at 11:34 AM, Rajat wrote:
>
> Wouldn't it be great if the scoreboard had some filter features. We
> could make great use of filtering out users by their preferred
> programming language. Or we would love to have a score
how meny point u got?
On Fri, Sep 4, 2009 at 1:35 PM, xakee wrote:
>
> Hi ,
>
> I could not qualify. I did all three small problems. For the first
> large one, I did not know I would have just 8 minutes to respond, and
> my solution timed out (was taking too long). On largeB, my code ran
> fine
Hello any one received the invitation for the second round
Regards
Jawahar
On Mon, Sep 7, 2009 at 6:46 AM, Chen Mingcheng wrote:
>
> Dear Administrator:
>
>Since I would be free all day, I nearly made the choice randomly,
> and now I forget what is my choice.
>Will there be any letter to
Dynamic programing gives the effective way of recursion, with table that
contains the previous results
Regards
Jawahar
On Thu, Sep 10, 2009 at 5:55 PM, amit jain wrote:
> thanx buddy
>
> On Thu, Sep 10, 2009 at 2:11 PM, Mayank Jaiswal wrote:
>
>> Hi amit,
>>
>> I'll try to help you.
>> Recal
roblem_statement&pm=10620>Its a good
> problem. Give it a try :) ,, Don't worry, we are there to explain in case.
>
> - Anil Kishore,
> IIIT-Hyderabad.
>
>
> On Thu, Sep 10, 2009 at 6:52 PM, samuel jawahar
> wrote:
>
>> Dynamic programing gives
U have to wait for one year,if u really intersted to coding participate in
topcoder
topcoder.com
On Mon, Sep 14, 2009 at 12:32 PM, Sravan wrote:
>
> When will the next Code Jam be? Is it yearly?
>
> >
>
--~--~-~--~~~---~--~~
You received this message because you a
Hello this is completely not related to this context
but hope i will get some help
how to add new class to next JDK release
Regards
Jawahar
On Mon, Sep 28, 2009 at 7:22 PM, Grant Kot wrote:
> i vote that everyone in the world except code jam participants get
> t-shirts.
>
> >
>
--~--~-~
hello one request
if any one know how to test the Topcoder problems offline please help me
currently marathin56 is open
i wanted to test my solution
Regards
Jawahar
On Mon, Oct 12, 2009 at 4:41 PM, Brats wrote:
>
> Hey .. here is a problem I saw somewhere on net. Can anyone give me
> some ideas
Who is the Winner?
On Sun, Nov 8, 2009 at 3:59 PM, Christoph Dürr wrote:
>
> If you were one of the first 500, then you won a cute T-shirt. On its
> back are lines from different programming languages. Do you found out
> which languages ?
>
> --~--~-~--~~~---~--~~
I am taking this opportunity to great The Google Code Jame Hero ACRush
I don't know IITans participated or not
Regards
Samuel Jawahar
On Tue, Nov 17, 2009 at 3:50 PM, Rajkarn Singh wrote:
> Congratulations...ACRush :-)
>
>
> On Mon, Nov 16, 2009 at 4:22 PM, y
how meny rounds u cleared in this year?,hope u will be clear more rounds in
10
On Fri, Nov 20, 2009 at 1:01 AM, Raphael Ribas wrote:
> Now that we have the accouncing, I can`t wait for the annoucement!
>
>
> On Thu, Nov 19, 2009 at 5:12 PM, Bartholomew Furrow wrote:
>
>> There's one more thing th
code snippet:-
String aux="aewwewe$ssdfsdfdf$sdfsdfsdfs$rterter$";
System.out.println(aux.split("$").length);
outPut:1
On Wed, Mar 21, 2012 at 5:50 PM, mandy wrote:
> here is a link to the problem...
> http://code.google.com/codejam/contest/351101/dashboard#s=p1
> Input:-this is a test
> Outpu
gt; --
> Ahmed Aly
> www.ahmed-aly.com
>
> On Sun, Mar 25, 2012 at 10:34 AM, Samuel Jawahar wrote:
>
>> code snippet:-
>> String aux="aewwewe$ssdfsdfdf$sdfsdfsdfs$rterter$";
>> System.out.println(aux.split("$").length);
>> outPut:1
>>
&
ype>o2.type){
return 1;
}
if(o1.typewrote:
> Thanks a lot Ahmed
> Samuel
>
> On Sun, Mar 25, 2012 at 11:10 PM, Ahmed Aly wrote:
>
>> $ is a special character, try the following code, and it should work:
>>
>> String aux="aewwewe$ssdfsdfdf$sdfsdfsdfs$rterter$&
ed method stub
if(o1.type>o2.type){
return 1;
}
if(o1.typewrote:
> Thanks a lot Ahmed
> Samuel
>
> On Sun, Mar 25, 2012 at 11:10 PM, Ahmed Aly wrote:
>
>> $ is a special character, try the following code, and it should work:
>>
>> String aux="aewwew
Hi any one solved this
http://code.google.com/codejam/contest/32016/dashboard#s=p1
On Wed, Mar 28, 2012 at 12:56 PM, aaroncai wrote:
> IntelliJ IDEA is the best
>
> http://java.dzone.com/articles/why-idea-better-eclipse
>
>
> 2012/3/28 Sachin Gupta
>
>> which is the best java IDE for develo
Hi any one solved Milkshaes problem?
I have implemented in DP
don't know why it is failing,can any one review my code
-start---
import java.io.BufferedReader;
import java.io.FileReader;
import ja
http://code.google.com/codejam/contest/dashboard?c=32016#s=p1
On Tue, Apr 3, 2012 at 7:50 PM, Samuel Jawahar wrote:
> Hi any one solved Milkshaes problem?
> I have implemented in DP
> don't know why it is failing,can any one
Hello.did you solve the problem milkshake
http://code.google.com/codejam/contest/dashboard?c=32016#s=p1&a=1
On Sat, Apr 7, 2012 at 2:58 PM, Abizern wrote:
> I made a short screencast last night to show the process of solving a
> problem, retrieving the input files and uploading the solutions fo
Hello Bartholomew
I have solved the Milkshake(
http://code.google.com/codejam/contest/dashboard?c=32016#s=p1&a=1) problem
with below algorithm
Start:
For each test case
declare malt and unmalt of size number of flavours,initial values of malt
and unmalt are zeros
1)get all cutomer choices in to cho
t 1 else 0
end:
On Sat, Apr 7, 2012 at 3:52 PM, Abizern wrote:
> Not yet, but I'll consider doing a 'cast about it next.
>
>
> On 7 April 2012 10:57, Samuel Jawahar wrote:
>
>> Hello.did you solve the problem milkshake
>> http://code.google.com/codejam/conte
-code-jam-milkshakes/
>
>
> On 7 April 2012 12:55, Samuel Jawahar wrote:
>
>> Hello if you have time can you please verify my algorithm to solve the
>> milkshake problem
>>
>> start:
>>
>> For each test case
>> declare malt and unmalt of size nu
print all malt[i] if malt[i]>0 print 1 else 0
End:
On Sat, Apr 7, 2012 at 6:31 PM, Samuel Jawahar wrote:
> Thanks a lot for giving response
> But i need u to go through my algorithm
> did you check my algorithm?can you please
> Regards
> Samuel
>
>
> On Sat, Apr 7, 2
step 4
then print all malt[i] if malt[i]>0 print 1 else 0
End:
On Sat, Apr 7, 2012 at 5:08 PM, Samuel Jawahar wrote:
> Hello Bartholomew
> I have solved the Milkshake(
> http://code.google.com/codejam/contest/dashboard?c=32016#s=p1&a=1)
> problem with below algorithm
> Sta
is a solution
> though - just throw the malt away.
>
>
>
> On 7 Apr 2012, at 12:55, Samuel Jawahar wrote:
>
> Hello if you have time can you please verify my algorithm to solve the
> milkshake problem
>
> start:
>
> For each test case
> declare malt and unmalt of s
use the Binomial theorem to solve this.
did you solve the milkshake problem?
On Sun, Apr 8, 2012 at 6:28 PM, Sachin Gupta wrote:
> can anyone please check why this code is giving wrong answers. I've
> checked the solutions each of them uses recursion to solve the problem.
> http://code.google.com
slight modification now it is working
Start:
All choices for the malt are moved the end if the choice list
ex:3 1,2 0,1 0 given
2 0,2 0,3 1 arranged is the pre condition for this algorithm
For each test case
declare malt and unmalt of size number of flavours,initial values of malt
and unmalt are z
Hello i need good DP book,please let me know which one is good
regards
Samuel
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to google-code+unsubscr...@googlegr
Thanks Joseph,can you please tell me the good book for Dynamic programming
On Tue, Apr 16, 2013 at 12:46 AM, Joseph DeVincentis wrote:
> To solve Treasure, first make sure that the problem has some solution.
> This requires:
>
>1. There are enough copies of each key available somewhere.
>
what is that, bridge problem?
On Thu, Apr 25, 2013 at 7:08 AM, Joseph DeVincentis wrote:
> Samuel, I don't have a book to recommend for that. But where I really
> learned how to do dynamic programming was Project Euler.
>
>
> On Wed, Apr 24, 2013 at 8:59 PM, Samuel Jawaha
i got it,thanks a lot
On Thu, Apr 25, 2013 at 7:37 AM, Samuel Jawahar wrote:
> what is that, bridge problem?
>
>
> On Thu, Apr 25, 2013 at 7:08 AM, Joseph DeVincentis wrote:
>
>> Samuel, I don't have a book to recommend for that. But where I really
>> learned h
Is it possible to in different timt zone
On Sat, Apr 27, 2013 at 4:52 PM, Joseph DeVincentis wrote:
> The problem with this is that pow(foo, 0.5) performs a floating point
> calculation which is not accurate to the 18 significant figures required
> for this result.
>
>
> On Sat, Apr 27, 2013 at
Is it possible to in different time zone
On Sun, Apr 28, 2013 at 5:23 PM, Samuel Jawahar wrote:
> Is it possible to in different timt zone
>
>
> On Sat, Apr 27, 2013 at 4:52 PM, Joseph DeVincentis wrote:
>
>> The problem with this is that pow(foo, 0.5) performs a floating
int a=2*r+1;
int d=4;
double d=-(2*a-d)+Math.sqrt((2*a-d)*(2*a-d)+8*d*k);
int dinominator=2*d;
int result=d/dinominator;
answer is result
On Sun, Apr 28, 2013 at 7:35 AM, bas <366a...@gmail.com> wrote:
> The result of that formula is very large, so there is a possibility
> that it will not fit i
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to google-code+unsubscr...@googlegroups.com.
To post to this group, send email to google-code@googlegroups.com.
s has an extensive introduction to Dynamic programming. here is the
>>> link
>>>
>>> http://www.amazon.com/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844/ref=pd_sim_b_6/191-4382951-9705247
>>>
>>>
>>> On Wed, Apr 24, 2013 at 6:50 PM, Samuel Jawa
Hello DP experts can you please suggest good book for DP
Regards
Samuel
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to google-code+unsubscr...@googlegroups.c
problems. And if you get stuck or need help, the
> editorials are always there.
>
>
>
> On Mon, May 6, 2013 at 10:57 PM, Samuel Jawahar wrote:
>
>> Hello DP experts can you please suggest good book for DP
>> Regards
>> Samuel
>>
>> --
>> You re
Hello all can you please let me know good books for
"Counting the restricted combinations"
Regards
Samuel
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to goog
Hello,can anyone please help tell me the Good book for counting
Regards
Samuel
On Tue, Apr 22, 2014 at 12:51 AM, Luke Pebody wrote:
> I do not agree with the sentiments expressed in this email. In general,
> for early rounds, there is a significantly easier "brute force" algorithm
> that will s
Hello,is it possible to conduct the test on week days only,instead of
weekends
Regards
Samuel
On Fri, Oct 10, 2014 at 11:57 PM, 'Google Code Jam' via Google Code Jam <
google-code@googlegroups.com> wrote:
> Hi All,
>
> We're close to announcing the 2015 Code Jam schedule! But we want your
> feedb
Hello,for some problems java will not give correct results
even Algorithm is correct
example
even for small n's it is not working
is it because of java mod function?
example:
my codecheff id:jawa2code
my Algo:
http://discuss.codechef.com/questions/58496/seagcd-editorial
my code:
http://www.codeche
Hello,for some problems java will not give correct results
even Algorithm is correct
example
even for small n's it is not working
is it because of java mod function?
example:
my codecheff id:jawa2code
my Algo:
http://discuss.codechef.com/questions/58496/seagcd-editorial
my code:
http://www.codeche
Hello sir,so many people have to work on Saturday too,if possible please
give heigher priority to Sunday to conduct exam
Regards
Samuel
On Sun, Apr 8, 2018, 08:06 Bartholomew Furrow wrote:
> It's missing for now, though either Pablo or Ian mentioned that it's on
> their list of things to add. I'
it was very slow yesterday
On Sat, Apr 7, 2018 at 8:07 PM, newbie007 wrote:
> after some minutes the solutions are in submissions, even though it says a
> "problem occurred"
>
> --
> You received this message because you are subscribed to the Google Groups
> "Google Code Jam" group.
> To unsubsc
think that was the major one.
>
> Please bear in mind that I don't work at Google anymore, so if I've said
> something incorrect or impolitic then please don't blame them. :-)
>
> Bartholomew
>
> On Sat, Apr 7, 2018 at 8:50 PM Samuel Jawahar
> wrote:
>
&g
Oh really great sir
On Mon, Apr 9, 2018, 01:57 Bartholomew Furrow wrote:
> Right now I work at home, and my employers are both under the age of 6. :-)
>
> On Sun, Apr 8, 2018 at 1:01 PM Samuel Jawahar
> wrote:
>
>> Thanks a lot sir,where are you working
>>
&g
You can know by the icon they disply,if it ? And displying NOT this
message"testing skiped"
On Mon, Apr 9, 2018, 01:13 Felix Voituret wrote:
> Well the real difference here is that you do not know if the time limit
> was respected for the hidden dataset (previously large). So you really has
> to
Hello Sir,
Rounding Error:-
My understanding is we need to maximize the sum of n values of 100/n,if it
is below 100%
please let me know ,my understanding is correct or not
Regards
Samuel
On Mon, Apr 30, 2018 at 8:33 AM, Si wrote:
> Hi, I think I test all the cases but I still get WA in set1. I
, May 2, 2018 at 3:23 PM, Samuel Jawahar wrote:
> Hello Sir,
> Rounding Error:-
> My understanding is we need to maximize the sum of n values of 100/n,if it
> is below 100%
> please let me know ,my understanding is correct or not
> Regards
> Samuel
>
>
>
> On Mon, A
Samuel
On Wed, May 2, 2018 at 4:43 PM, Samuel Jawahar wrote:
> In Sample Case #3, one optimal scenario is as follows: each of the
> remaining two people chooses an unchosen language, so the rounded
> percentages add up to 50 + 17 + 17 + 17 = 101.
>
> if 5 people chooses same language
In Sample Case #3, one optimal scenario is as follows: each of the
remaining two people chooses an unchosen language, so the rounded
percentages add up to 50 + 17 + 17 + 17 = 101.
if 5 people chooses same language and one person chooses different one
then the result=102
5*17+17=102
Regards
On W
all chose different languages then each of six languages
> would have 17% and the total would be 102, but that option is not available
> due to the initial condition indicating three people chose the same
> language.
>
> On Wed, May 2, 2018 at 7:14 AM Samuel Jawahar
> wrote:
Hello all ,please help me to solve this problem
https://stackoverflow.com/questions/11382189/number-of-ways-to-place-kings-on-chess-board
suggest me to books required to solve this type of problem
Regards
Samuel
--
You received this message because you are subscribed to the Google Groups
"Google
Hello,what is the measning of "Answers with a relative or absolute error of
at most 10-6 will be considered correct."
https://code.google.com/codejam/contest/32013/dashboard#s=p2
Regards
Samuel
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
Hello,how to know points?only through mail we will come to know?
Regards
Samuel
On Mon, Apr 8, 2019 at 9:26 PM wrote:
> I have earned required 30 points to be qualified for the next round, but
> the "Schedule" section does not show me a tick under the "Qualified" part.
> Do you have the same is
Hello Sir ,i am not able to open the dashboard
Regards
Samuel
On Sat, Apr 13, 2019 at 4:03 AM 'Pablo Heiber' via Google Code Jam <
google-code@googlegroups.com> wrote:
> Hi Everyone,
>
> We have updated the way we compile and/or run code in several languages to
> address some of the feedback from
Hello please verify my approach ,please let me know for which test case it
is failing
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
class Solution {
static int c[] = null, d[] = null;
public static void solve() {
Buffere
Hello sir,please review my code,help me for which test case it is failing
---
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.
tic int getMaxCnt_D(int l, int u, ArrayList locations) {
int max = 0;
for (int i = l; i < u; i++) {
if (max < d[i]) {
locations.clear();
max = d[i];
locations.add(i);
continue;
}
if (max == d[i]) {
locations.add(i);
}
}
return max;
}
}
class Pair {
int l = 0, r = 0;
public String toString() {
Hello Sir can you please review my Code?
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class Solution {
private static boolean isOverLapping(ArrayList activityList,
Acti
Hello sir,please let me know for which test case it is failing
please review my code
Regards
Samuel
===
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class Solution {
private static b
Hello, i also faced same problem
Can you please review my code
User name:figlet
On Tue, 7 Apr 2020, 6:14 am Olena Lizina, wrote:
> Hi all,
>
> I didn't pass the Qualification Round 2020 because stuck with Parenting
> Partnering Returns.
> My solution passes the Sample test cases, but failed on
Thanks a lot sir
On Mon, Apr 27, 2020 at 9:10 PM porker2008 wrote:
> Hey jawa,
>
> You need to process all activities based on the start time.
> If you greedily assign activity in the given order, you will fail the
> following input
>
> Sample Input
> *1*
> *4*
> *1 2*
> *1 5*
> *5 6*
> *2 6*
>
Hello sir,
for this input you mentioned ,the first 2 activities 1 2 and 1 5,are
overlapping how we can assign these two for different kids
Regards
Samuel
On Mon, Apr 27, 2020 at 9:10 PM porker2008 wrote:
> Hey jawa,
>
> You need to process all activities based on the start time.
> If you greedi
Hello every one,
Please help me where it is failing
Please review my code please
please let me know for which test case it is falling
Solution: 46363012 | CodeChef
https://www.codechef.com/viewsolution/46363012
My Algorithm:-
1)Nodecount Map contains the number of nodes under this
2)x_at_node it
Hello Tanisha,
please let me know for which test case it is falling
Solution: 46363012 | CodeChef
https://www.codechef.com/viewsolution/46363012
My Algorithm:-
1)Nodecount Map contains the number of nodes under this
2)x_at_node it contains x value at each node
3)once x_at_node table populated, sumi
Hello , please let me know for which test case it is falling
Solution: 46363012 | CodeChef
https://www.codechef.com/viewsolution/46363012
My Algorithm:-
1)Nodecount Map contains the number of nodes under this
2)x_at_node it contains x value at each node
3)once x_at_node table populated, suming all
Hello , please let me know for which test case it is falling
Solution: 46363012 | CodeChef
https://www.codechef.com/viewsolution/46363012
My Algorithm:-
1)Nodecount Map contains the number of nodes under this
2)x_at_node it contains x value at each node
3)once x_at_node table populated, suming all
Hello , please let me know for which test case it is falling
Solution: 46363012 | CodeChef
https://www.codechef.com/viewsolution/46363012
My Algorithm:-
1)Nodecount Map contains the number of nodes under this
2)x_at_node it contains x value at each node
3)once x_at_node table populated, suming all
Hello , please let me know for which test case it is falling
Solution: 46363012 | CodeChef
https://www.codechef.com/viewsolution/46363012
My Algorithm:-
1)Nodecount Map contains the number of nodes under this
2)x_at_node it contains x value at each node
3)once x_at_node table populated, suming all
Hello , please let me know for which test case it is falling
Solution: 46363012 | CodeChef
https://www.codechef.com/viewsolution/46363012
My Algorithm:-
1)Nodecount Map contains the number of nodes under this
2)x_at_node it contains x value at each node
3)once x_at_node table populated, suming all
Hello , please let me know for which test case it is falling
Solution: 46363012 | CodeChef
https://www.codechef.com/viewsolution/46363012
My Algorithm:-
1)Nodecount Map contains the number of nodes under this
2)x_at_node it contains x value at each node
3)once x_at_node table populated, suming all
Hello please let me know some testcase to where it is failing
https://codingcompetitions.withgoogle.com/codejam/round/00876ff1/00a45ef7
On Monday, April 4, 2022 at 8:16:14 PM UTC+5:30 DarkDogg92 wrote:
> Hello everybody,
>
> I can't manage to solve the Chain Reactions problem. My
Hello plesse send one test case where it is failing
https://codingcompetitions.withgoogle.com/codejam/round/00876ff1/00a45ef7
On Mon, 4 Apr 2022, 20:16 DarkDogg92, wrote:
> Hello everybody,
>
> I can't manage to solve the Chain Reactions problem. My solution seems to
> work local
; in the top right corner click on the download, and check the Download
> section of chrome. It will show the name of the file and also the link
> where it is from. Only sharing the latter link will contain the desired
> code content.
>
> Kata
>
> Samuel Jawahar ezt írta (időpo
https://codejam.googleapis.com/dashboard/get_file/AQj_6U2-pTNTum7Yk9UWYoDOxk0_IQv4H-zDnwRS/Solution.java?dl=1
On Mon, 11 Apr 2022, 05:59 Katalin Brányiné Sulák, <
branyine.sulak.kata...@gmail.com> wrote:
> I have taken a look into your solution and despite it has the correct O(N)
> idea, unfortun
file and also the link
> where it is from. Only sharing the latter link will contain the desired
> code content.
>
> Kata
>
> Samuel Jawahar ezt írta (időpont: 2022. ápr. 6.,
> Sze, 2:27):
>
>> Hello plesse send one test case where it is failing
>>
>> https:
Hello plesse let me known one good book for dynamic programing
Regards
Samuel
On Tue, 19 Apr 2022, 10:12 Samuel Jawahar, wrote:
> Thanks a lot sir for spending valuable time
> I have done wrong one if condition that why it was failed
> I corrected in practice mode it worked
84 matches
Mail list logo
