OJ Board

The problem is I am not familiar with C++.
When next_permutation() STL can be implemented in a faster way, I think we can also do the same using C code.

Can I get how the next_perumutation STL is implemented on the net?
If you come across any such thing do help me to make my code more faster ...

Hello,

I remove the for loop which i was using for output and instead used

[c]printf("%s\n",&tstr[1]);[/c]

This seems significantly faster, but still I am getting TLE on oj.

I only know exponential algorithm for generating permutations. Is there any faster algorithm or can this code be still ...

I think that is what I am doing in the loop
while(i)
{
...
}

before that I am just sorting the string so that if the input is
baca
i will begin the loop with the string aabc.

Can you give me more hints on how to generate the string, without any computations.

hello,

I am using Disjkastra's algorithm to generate the permutations of the given string in lexicographical ( dictonary ) order. But it is taking a lot of time when the string length exceeds 8.

Can u guys help me in speeding up my program.
[c]
#include <stdio.h>
#include <string.h>

int main(void ...

I am getting correct solution for all the input between 3 and INT_MAX, that too instantly, with this code for 516. why OJ is giving TLE?
please help.

[c]
#include <stdio.h>
#include <math.h>
#include <string.h>

unsigned stack[100];

int main(void)
{
char str[80];
unsigned register base,exp,i,val ...

Hello,

Thanks for the reply. What I really meant was, I am able to get the algo for most of the problems. but my solution though correct lacks some severe optimization as a result my memory usage or time taken will be very high.

I have been doing a lot of home work in this respect, both with web ...

Hello,

I am new to this acm programming challenges. I have solved quite a few problems and all using conventional means and algorithms, which take a hell lot time to solve the given problem. My solutions are in no match with the time, people have taken to solve the problems.

How do u people ...