mkwayisi:
IMO, the hottest stock for short-term investment is PREMBREW. Since August 8, it has consistently risen from #0.77 to 1.65 (105.19% increase), within just 17 days!! Of course, you should know when the chips are set to come down

SKYQUEST: Deal all, I want to make short to medium term entries into any 10 of the following picks at the entry price indicated, make una please advise me biko!:

ASHAKACEM 33.00
CAVERTON 5.60
CCNN 14.50
DANGSUGAR 8.70
ETI 16.25
FBNH 14.60
FCMB 4.25
FIDELITYBK 1.95
FIDSON 3.20
JAPAULOIL 0.51
MAYBAKER 1.58
SKYEBANK 2.9
TOTAL 179
TRANSCORP 5.65
UBA 7.2
UBN 8.16
VITAFOAM 4.1
WAPIC 0.76

soloniger: what is this NSEMPA meaning? my BnSITL

mutago: I just develop an encryption software on my own to secure my company source code on the server. 5,000 naira to anyone who can reverse this code below. Google and take it anywhere in the world for soultion.

Remember. 5,000 naira awaits you. All you have to do is to show us some portion of the encrypted codes.
Thank You

U2FsdGVkX1+tobr1PpzkuRlkv4uwmj8s3dPEw+/LLZ51vj/w+LDFBwWwbtTvfaW4c1WLBMFGxBAqKWz3YHT1i9o3vCMwW74sVJWGbvooaH/gXuThaRyFMYCM0h05ez8QFT0OvTxKaN/SrDSqmYUWWGRwZcDuyXOZybVj4eK2xROWVKOv7BolrQGd85q8Q59tuVL8s2bdeLY1eOXGlCEvfOYbyj07yMvK67Nu51jN/qnJmR3Q5/H/K2XO8vFP+nBsrtEa2Iw5t67obxQo2oxVZZuKIFCjCh9FkHJQWUffraZtWM5XqdN65yD7lmBDiCtK+/mZ7MfotbIQFHdBv7STxQ==

veektorh:
. . .
By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
. . .
Find the sum of all the multiples of 3 or 5 below 1000.

olu_kenzo: GNU Compiler Collection (GCC), Cygwin, Mingw, g++ are compilers.

olu_kenzo: Its easy to mix it up.

olu_kenzo: Reminds me of the arguments on what roles gcc and g++ play.

olu_kenzo: A lot things going on under the hood.

olu_kenzo: GCC invokes g++ for c++ compiles and gcc for C compiles.

olu_kenzo: Face palms.

olu_kenzo: Let's keep it simple guys!

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

int main(void)
{
	char ***matrix;
	int i, j, k, l, ix, jx, len, dir, size;
	char buf[16];

	printf("Enter the size of your matrix: " );
	fgets(buf, sizeof(buf), stdin);
	len = strlen(buf);
	if (buf[len-1] == '\n')
		buf[len-1] = 0;
	
	if ((size = atoi(buf)) < 1) {
		printf("Error: Invalid input '%s'.\n", buf);
		return 1;
	}
	
	matrix = malloc(sizeof(char **) * size);
	if (matrix == NULL) {
		printf("Error: malloc failed." );
		return 1;
	}
	
	for (i = 0; i < size; i++) {
		matrix[i] = malloc(sizeof(char *) * size);
		if (matrix[i] == NULL) {
			printf("Error: malloc failed." );
			for (j = 0; j < i; j++)
				free(matrix[j]);
			free(matrix);
			return 1;
		}
	}
	
	for (i = 0; i < size; i++) {
		for (j = 0; j < size; j++) {
			printf("Enter value for matrix[%d][%d]: ", i, j);
			fgets(buf, sizeof(buf), stdin);
			len = strlen(buf);
			if (buf[len-1] == '\n') {
				buf[len-1] = 0;
				len--;
			}
			
			matrix[i][j] = malloc(sizeof(char) * (len + 1));
			if (matrix[i][j] == NULL) {
				printf("Error: malloc failed." );
				for (; i >= 0; i--) {
					for (j--; j >= 0; j--)
						free(matrix[i][j]);
					free(matrix[i]);
				}
				free(matrix);
				return 1;
			}
			
			strcpy(matrix[i][j], buf);
		}
	}
	
	printf("\nThis is how your matrix looks like:\n" );
	for (i = 0; i < size; i++) {
		for (j = 0; j < size; j++) {
			printf("%s ", matrix[i][j]);
		}
		printf("\n" );
	}
	
	printf("\nNow, here is the matrix in spiral order:\n" );
	dir = 0; // 0 = R; 1 = D; 2 = L; 3 = U;
	
	i = 0, j = -1;
	for (len = size; len > 0; len--) {
		for (k = j < 0 ? 1 : 0; k < 2; k++, dir++) {
			switch (dir % 4) {
				case 0: ix = 0;  jx = 1;  break;
				case 1: ix = 1;  jx = 0;  break;
				case 2: ix = 0;  jx = -1; break;
				case 3: ix = -1; jx = 0;  break;
			}
			
			for (l = 0; l < len; l++) {
				i += ix; j += jx;
				printf("%s%s", !(i || j) ? "" : ", ", matrix[i][j]);
			}
		}
	}
	printf(".\n\n" );
	
	for (i = 0; i < size; i++) {
		for (j = 0; j < size; j++)
			free(matrix[i][j]);
		free(matrix[i]);
	}
	free(matrix);
	
	return 0;
}

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

typedef struct _page {
	char *header;
	char **items;
	size_t count;
} page;

typedef struct _page_box {
	page **pages;
	size_t count;
} page_box;

//==[ CODE ]===================================================================
// create_page_box
page_box * create_page_box(void)
{
	page_box *pb;
	if ((pb = malloc(sizeof(*pb))))
		memset(pb, 0, sizeof(*pb));
	return pb;
}

//==[ CODE ]===================================================================
// create_page
page * create_page(page_box *pb, const char *hdr)
{
	if (pb != NULL) {
		pb->pages = realloc(pb->pages, sizeof(*pb->pages) * (pb->count + 1));
		if (pb->pages != NULL) {
			pb->pages[pb->count] = malloc(sizeof(page));
			if (pb->pages[pb->count] != NULL) {
				memset(pb->pages[pb->count], 0, sizeof(page));
				if (hdr && (pb->pages[pb->count]->header = malloc(strlen(hdr) + 1)))
					strcpy(pb->pages[pb->count]->header, hdr);
				pb->count++;
				return pb->pages[pb->count-1];
			}
		}
	}
	return NULL;
}

//==[ CODE ]===================================================================
// add_page_item
int add_page_item(page *pg, const char *str)
{
	if (pg && str) {
		pg->items = realloc(pg->items, sizeof(*pg->items) * (pg->count + 1));
		if (pg->items != NULL) {
			pg->items[pg->count] = malloc(strlen(str) + 1);
			if (pg->items[pg->count] != NULL) {
				strcpy(pg->items[pg->count], str);
				pg->count++;
				return 1;
			}
		}
	}
	return 0;
}

//==[ CODE ]===================================================================
// free_page_box
void free_page_box(page_box *pb)
{
	int i, j;
	for (i = 0; i < pb->count; i++) {
		for (j = 0; j < pb->pages[i]->count; j++)
			free(pb->pages[i]->header);
		free(pb->pages[i]);
	}
	free(pb);
}

//==[ CODE ]===================================================================
// main
int main()
{
	page_box *pb;
	page *pg;
	int i, j;
	
	// Create a container for all pages
	pb = create_page_box();
	
	// Create page 1
	pg = create_page(pb, "Header 1" );
	add_page_item(pg, "pg1menu1" );
	add_page_item(pg, "pg1menu2" );
	add_page_item(pg, "pg1menu3" );
	
	// Create page 2
	pg = create_page(pb, "Header 2" );
	add_page_item(pg, "pg2menu1" );
	add_page_item(pg, "pg2menu2" );
	
	// Create page 3
	pg = create_page(pb, "Header 3" );
	add_page_item(pg, "pg3menu1" );
	add_page_item(pg, "pg3menu2" );
	add_page_item(pg, "pg3menu3" );
	
	// Print out all the pages
	for (i = 0; i < pb->count; i++) {
		printf("%s\n===========\n", pb->pages[i]->header);
		for (j = 0; j < pb->pages[i]->count; j++) {
			printf("%d. %s\n", j + 1, pb->pages[i]->items[j]);
		}
		printf("\n" );
	}
	
	// Free all allocated memory
	free_page_box(pb);
	pb = NULL;
	
	return 0;
}

babihouse: thanks but it is not working

lordZOUGA: I don't like windows Command prompt. Bash on Linux is way cooler.

babihouse: what can i do with command prompt? how powerful is it? pls drop any material that will aid my learning.

echo start dance > dance.bat & dance

nairawall: WinDev: from my research, I discovered the WinDev development suite uses the w-lang which is a fifth generation programming language.

ciphoenix: @OP if you're the coder, then work with the language you're comfortable with

fx0ne: The competition is now closed.

fx0ne: You didn't attempt the second challenge?

Joe50: of course...

GideonG: There is nothing like database designing.
You don't design database, you work with database.

textBox3.Text = ans

import com.nairaland.*;
try {
	new Comment("Hello, fellas!" );
} catch (DerailedThreadException e) {
	System.out.println("What now, " + e.getWhinyUser() + "?" );
}

webdezzi:

₱®ÌИСΞ:

Import world.smart.charming.females
Supercoolchick hottie = new Supercoolchick()

it will compile as long as the capital case of "Import" is corrected

₱®ÌИСΞ:

Import world.smart.charming.females
Supercoolchick hottie = new Supercoolchick()