First make a palindrome that is case and punctuation sensitive :

You code revised a little :

#include <string.h>

bool palindrome (const char *s)
{
int index = 0, length = 0;
length =...

Sure :

//declare char *password = "hello";
//ask user for the password
//check if( strcmp(userInput,password) == 0 )
//if so the let him through
//else exit program

You don't. You let the pro handle it, ahem, ahem.

<quote>So basically I want to be able to stick a few zeros in front of the smaller binary numbers.

Check the length, while(binary.length mode eight != 0 ) addToFront('0');

You need to check through every element in the array to ensure that there is no repetition right ? So if the array was of size n, then to ensure that there is no repetition inside the array, you need...

Wow over 500 lines for a determinant. Maybe you should be a teacher?

Seriously, I wouldn't want use that function to calculate the determinate, becuase I would have to do this :...

They didn't like that one either.

aww man. I though some n00b came up with this title. I should have
known. This is funny though.

>>But this looks ugly and I had to use a separate variable.

I think that looks beautiful. In fact you can just make a function that does that, and so it will be in a sense a one liner.

I don't...

In c ( or C++) : 0 is false, and any other number is true.

This (http://gmplib.org/) is a good library. Try inputting 500!
in their sample program and see what you get.


P.S : its factorial and not fectorial

You need to do a little more :


int LoadBitmap(const char* filename)
{
GLubyte* pixels;
HBITMAP hbmp;
BITMAP bmp;
GLuint size;
GLenum format;

You put (Nov 28th 2009):




He put ( Jul 16th, 2004 ):



See the problem?

don't use the sqrt function. compare the squared distance.

Yep, not unless you obscure the meaning of "sorting".

Disregarding the header and the bottom of the table and just
considering the inside of the table you can simply just do this :


for(int i = Max; i >= Min; --i){
//print i
...

You have 1 extra comma in your array initialize list.

And this code :

char i = rand(letters[i]);


is wrong. rand does not take anything it its parameter.

This is how to use it.

Did you try that out ? I see problems with that.

>>PS: i already searched on the internet

Then obviously you haven't searched at daniweb.

Anyhow, do you first know how to generate a number from a min to max?

If practice is what you want then

google1 (http://hkn.eecs.berkeley.edu/~dyoo/cs3/recursion-problems.pdf)

google2 (http://hkn.eecs.berkeley.edu/~dyoo/cs3/recursion-problems-2.pdf)

Its undefined, google sequence points.

Aia I like your avatar.

You could sort the array and the check if adjacent values are the same.

Also, if the numbers aren't too far apart, then what you could do
is get the average of the 3 numbers, and find the number that is closest
to the average. This will work long as the number aren't...

You mean the input is something like this ?

<enter fraction > 123/452


And its read as a string.

If so then separate the string into 2 components the left side before the '/' character...

Sounds like H.W. Try googling it up, and read a couple articles and
post what you think the answer should be, and from there we could determine if you got it( from our opinion)

So by now you should know that you need nested loop, right?
since there are 3 rows, your outer loop should go up to 3.

Now for your nested loop. What you can have is have 2 for loop inside the ...

* * * * * # # # 1
* * * * # # # # 2 ROW
* * * # # # # # 3

realize that there are 5 '*' the 4 '*' then 3 '*' after each line.
On the other side, there are 3 '#', then 4 '#' then 5 '#'.

What...

Haven't tested it yet, but it could be similar to this :


int M = 5;
int i = 1;
while(i <= M) cout << i++ <<" "; //print from 1 to 5
while(--i > 0) cout << i << " "; //print from 4 to 1

Actually there is only 1 index, which is 0 in char A[1];
A[0] = 'a'; //ok
A[1] = 'b'; //bug

what exactly do you mean by distinct prime factor?

Get started.


int main()
{
//Create array
//use a for loop to ask user for input
// for i from 0 to array size cin >> myArray[i];
//create a sum,average, high and low...

where is c initialized ?

Create two int variable.
Ask user for input
Check if input is valid
if so the proceed else go back to get user input
start a for loop from i = 0; i < L;
start another loop ( nested loop ) that...

sort the array.
And from there see which value occurs the most.

Yes, structure goes by units of 4.

int cnt = 0;

for infinite loop
{
//do stuff
if(//do stuff is what i need) // then break;
else cnt++;

//if cnt is above the limit then break;
}

sizeof(array)/sizeof(double) ?

This thread is hilarious.

Have a left, middle, and end variable. Make middle static.

Move left up 1, move end down 1. If left == mid || right == mid then stop.

@OP : is the God dam a typecast to pointers, because you hate them?