When it scans, the object will be one color and the background will be another, right? Count the number of pixels that are the object's color. And multiply that by the area of a pixel.

Make a poop simulator.

Make a GUI application using GTK+ 2.



Use your coding skill to make stuff.

And let's not forget about alignment issues, recursive functions, data structures, and anything whose size depends on user input.

calloc initializes the memory with zero. calloc = clear + alloc

Presumably he has random access to the list; otherwise this problem would be impossible.

The answer is pretty simple, and we're not just going to give you the answer.

Here's a hint though: ...

You're mistaking zero for Zorro. Get it right.

I still don't get why you bother adding zero.

Yes. In general, you should make a function

int random(int n) {
return (int) (n * (rand() / (1.0 + RAND_MAX)));
}

and use that to generate a random number from 0 to n-1. With a decent...

There are none.

Well, there are a few. If you don't have a C++ compiler that targets the platform you're looking for, or if you're working on a project (that somebody else started) that uses C...

Probably because you're assigning an element past the end of the array, and there's a variable there that throws off your code unpredictably.

Also, you've already showed a way to change that...

message_to_network should already be a function that waits for a new message to reach the socket. I'm guessing about its implementation, but you should just need to call that function -- it will...

Haskell version:

main = do putStr "Enter the number: "
n <- readLn
putStr "\n\nThe representation : "
putStrLn . intercalate " " . map ((names !!) . digitToInt ....

Here's a rather neat solution that is relatively portable. It only reverses bytes though.

unsigned int reverse_bytes(unsigned int n) {

#if UINT_MAX > 4294967295

n = ((n &...

I'd add

4. Caller makes a char*, passes a pointer to the char** to the callee, and the callee sets the caller's char* to point to some freshly allocated memory, with the caller's responsibilty to...

Well, first, do you know anything about parsing, or just about recursion? Because you'll have to use a bit of that, for your program to understand the expressions the user types in.

Use a heap ^_^ to store the top two elements as you walk through the array. Then finding the top K elements takes O(N log K) time instead of O(N log N).

That doesn't involve function pointers though :-/

Mentioning function pointers must be a sign of being completely lost, since there's only a finite constant set of values a function pointer can...

I am very confused. How in the world are you going to implement a stack using function pointers?

First, the program communicates with the operating system differently. To perform input and output, it must talk to the OS with a system call, using a particular protocol, and they use different...

- I don't understand the question.
- The expression (&T) returns a value of type nodeptr**, when T is of type nodeptr*, but insert expects an argument of type nodeptr*.
- Case 10 doesn't change the...

Then that's not the case, since RECT and POINT both use LONGs. Maybe you should look closely at the behavior of Get_Mouse() and see what it outputs.

It seems that you're using an unsigned integer to represent your coordinates. When you decrement an unsigned integer, such as 0, instead of getting -1, you get the highest possible value the integer...

Not to mention that his very own example is still unsafe!

Open up synaptic and search for wxwidgets or just 'wx'.

By the way, your shift key's broken.

Come to think of it, it's not even correct. However, the code I gave (despite its uselessness) is only 3 bytes longer than the OP's code when compiled under GCC -O3.

The...

alloc.h is a nonstandard header file. What are you trying to compile with?

Maybe
int i = p * q << 12;
int j = (i >> (sizeof(int)-1) * CHAR_BIT) & (~0xF)
i = (i & j) | (~ j);

Use pipes?

You could write a full-blown HTML parser, you could use somebody else's HTML parser, or you could use a cheapo solution that looks for strings like NZD-USD and walks their way forward through values....

No. Gently caress you. Do your own homework.

I don't think that's what the question's asking, Lerner. It doesn't say that.

shmay, if you need to generate a number in the range [0, 37) with five random decimal digits after the decimal point,...

You could create a lazy list datatype that only produces values when you request them -- and whose values it produces are the natural numbers. Then run the sieve of Eratosthenes on it. Then peel...

Sure.

Also, more portable, since you're not making assumptions about character set.

What happens when you compute fact(13)? The number is too large to be represented by a long (which has range up to 2^31-1, approximately 4 billion). That messes up the computations at that point.

http://eternallyconfuzzled.com/tuts/hashing.html

You can use % 10 to find the units digit of a number. For example, n % 10 gives the units digit of n. You can then use / 10 to divide an integer by ten. For example, n / 10 divides n by ten.
...

Well, I was kind of joking when I said straightforward :)

But anybody with a good understanding of basic algebra could be taught how to do this and understand how it works.

Also, anybody...

Yeah, there's a simple and straightforward algorithm for this.

The first step is to understand how to represent a linear system of equations with matrices and how to solve that with a computer...