spp

dileep kD is the answer.. so,my answer is correct but is this the procedure for solving that one or there exits some other methods.

pradeep_agrawalBelow is my code for the given problem statement solved using recursion. #include "stdio.h" void function(int m, int n, int* loopIndexes) { printf("Hello\n"); } void mNumberOfLoops(int m, int n, int...

hi shiva the answer would be 4. reason from 1 to 10 there are 3, 6 & 9 which are divisible by 3. arrange them as 3=3^1 6=2*(3^1) 9=3^2 add...

sookie@spp Oh so you were talking about "nested for loops -m times". Dude if you simply want to print("Hello") M[sup]M[/sup] times then why so much complications with for loops? Are...

sookieHi spp, Sorry but your problem is not clear to me. Below is my trial of what I understood from the problem specified in above post. package myjava; import java.io.BufferedReader;...

In a programme i created a .c/.cpp file dynamically ie at run time and i want to run that file simultanously. how should i proceed? Its urgent & very important....

dynamically i want to write a programme for 'M' for loops i.e. 'M' will be provided at the run time and depending on that 'M' for loops will executes. Example:...

pradeep_agrawalCould you please add more details on how the number of combinations can be c(n,m). As per me if you do simple selection (without crossing boundaries of matrix) then the...

hi friends, due to some error or something my auto update feature of my laptop is not working. when i am restarting my laptop then the time and date changing...

selection of m*m matrix from m*n matrix can be done in c(n,m) ways. so can anyone sgeest me an algorithm or c/c++ programme to get all the possible selections. thank...