with some code or description of what you've attempted

for the original problems, the answers should be 20 and 256. Since it's a loop, it'll repeat until the condition is false (i.e. until a>12 and a>25 respectively).

Wikipedia (http://en.wikipedia.org/wiki/Dijkstra%27s_shortest_path)

Look around some... the internet has lots of information readily available ;)

floating point numbers always have a degree of imprecision. A floating point value will never be equal to a whole number. You should check to see if it is within an acceptable epsilon from a whole...

Your code probably shouldn't compile. add(int, int) is specified to return an int, but doesn't, which should raise a compile time error.

We will help newbies who show some effort, through code or otherwise. We will not write code for newbies. We will not do research for newbies. And, as Grunt pointed out, if you really are a...

basically, you should put code segments between and tags. It looks like this:
Your code will be in here
and formatting will be preserved
so we can all read it If you want to point out a...

~a flips the bits in a, but doesn't save the result anywhere. On the next line, a is still equal to 0xffff. 0x marks that the value is written in hexadecimal (simlarly, a number preceded by a 0,...

#include<stdio.h>
int main() // main's return type is int
{
/* ... */
b= m%2; // I'm assuming you mean n%2

while( b!= 0) // this will check if n is even or odd. if it's even, the loop will be...