No Minimum No Maximum Help
closed account (iT0i3TCk)
Can anyone give me code for GEARS 100 pts in exchange of full pts EQUILBR / NMNMX
closed account (jy6DLyTq)
I can also give NMNMX/EQUILBR full AC SOLUTION IN EXCHANGE OF GEARS PROBLEM SOLUTION IF INTRESTED PM ME
please help for NMNMX...
i am getting 20 points.
think i am meesing up with mod somewhere..
please help!!
i am getting 20 points.
think i am meesing up with mod somewhere..
please help!!
i cannot tell without seeing where its getting wrong pm through your other account
@coder don't worry about the big numbers....but try to reduce these numbers as low as possible...and use euler totient...I would recommend using Python for this question
Hello all,
I sometimes like to think of myself as a decent programmer, and there for, might offer some assistance, but I read the problem and don't understand what it is asking you for. If some one could explain it in a more simple form of English, then maybe I could be of more help.
Thanks.
I sometimes like to think of myself as a decent programmer, and there for, might offer some assistance, but I read the problem and don't understand what it is asking you for. If some one could explain it in a more simple form of English, then maybe I could be of more help.
Thanks.
Sorry that link does not work for me. My web browser is too old. I can't update my browser either. My computer is too old.
it must be(n-1-i)C(k-1)
the idea here is we neeed to make ith elemnt the rst elemnt of the subsequnce. n-1-i is the numbr of elmnts after ith elmnt .so we choose k-1 elmnts from these n-1-i elements .
similary in the other exp we make our ith elemnt as last elemnt choosing k-1 elements from first i elemnts.
and hence the expressions!!
the idea here is we neeed to make ith elemnt the rst elemnt of the subsequnce. n-1-i is the numbr of elmnts after ith elmnt .so we choose k-1 elmnts from these n-1-i elements .
similary in the other exp we make our ith elemnt as last elemnt choosing k-1 elements from first i elemnts.
and hence the expressions!!
@ Kr002
ok I follow the undirected graph concept. But now N vertices and M edges. Does this mean you do not no how many vertices and edges there are? Or they can change?
Wait a second... Is this a different problem? What happened to the no min no max problem? I think I am mixing things up in my head.
ok I follow the undirected graph concept. But now N vertices and M edges. Does this mean you do not no how many vertices and edges there are? Or they can change?
Wait a second... Is this a different problem? What happened to the no min no max problem? I think I am mixing things up in my head.
Last edited on
closed account (jy6DLyTq)
I HAVE EQUILBR NMNMX GEARS AND WARTARAN FULL AC SOLUTION (WARTARAN 98 POINTS)
I ANYBODY CAN GIVE ME SUBWAY/PIZZA I CAN HELP IN RETURN IN ABOVE PROBLEM
I ANYBODY CAN GIVE ME SUBWAY/PIZZA I CAN HELP IN RETURN IN ABOVE PROBLEM
Topic archived. No new replies allowed.