Thread: Ninja's Software Challenge

Ok, I think I've solved the 4 first. I'm a bit confused by the fifth, though. Either there're 1 item too little in the array, or I'm missing something.

Spoiler for Challenge 1:

Code:

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

const char * ConvertToUNIX(const char * str){
	unsigned int n = 0;
	char* str2 = new char[strlen(str) + 1];
	for ( ; str[n] ; n++) {
		if (str[n] != '\\') {
			str2[n] = str[n];
		} else {
			str2[n] = '/';
		}
	}
	str2[n] = '\0';
	return str2;
}

int main(void){
    const char * path = "..\\MyDocuments\\Programming\\Tut1.cpp";
    printf("Modified string: %s\n", ConvertToUNIX(path));
}

Spoiler for challenge 2:

Code:

#include <stdio.h>

unsigned int Sum(unsigned int Value) {
    return (((Value+1)*Value)/2);
}

int main(){
    unsigned int TestValue = 10000;
    printf("Original string: %d\n", Sum(TestValue));
}

Spoiler for challenge 3:

Code:

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

int Analyze(const char * math){
    unsigned int n = 0, len = strlen(math);
	int ans;
	char *n1, *n2;
	while (n < len) {
		if (math[n] < 48 || math[n] > 57) {
			break;
		}
		n++;
	}
	n1 = new char[n+1];
	n2 = new char[len - n];
	strncpy(n1, math, n);
	strncpy(n2, math+n+1, (len - n));
	n1[n] = '\0';
	n2[len - n] = '\0';
	switch (math[n]) {
		case '*':
			ans = (atoi(n1)*atoi(n2));
			break;
		case '/':
			ans = (atoi(n1)/atoi(n2));
			break;
		case '+':
			ans = (atoi(n1)+atoi(n2));
			break;
		case '-':
			ans = (atoi(n1)-atoi(n2));
			break;
		default:
			ans = 0;
	}
	delete[] n1;
	delete[] n2;
	return ans;
}

int main(void){
    char * test = "12+4";
    printf("Answer: %d\n", Analyze(test));
    char * test2 = "4*100";
    printf("Answer: %d\n", Analyze(test2));
}

Spoiler for challenge 4:

Code:

#include <stdio.h>

int Count(const char * str, char search){
    unsigned int i = 0, n = 0;
	while (str[n]) {
		if (str[n] == search)
			i++;
		n++;
	}
	return i;
}

int main(void){
    char * test = "Hello World, I'm a lil string";
    printf("Answer: %d\n", Count(test, 'l'));
}

Also, it'd be nice if other people hide their code too. So that the ones who come here to try can find their own solutions, and don't get influenced by the ones that have been posted.