tssm · September 28, 2015 00:48 · Mar 6, 2014 · Mar 6, 2014 · Jul 30, 2013 · Jul 30, 2013
diff --git a/factorial → gistfile1.cpp b/factorial → gistfile1.cpp
@@ -1,4 +1,4 @@
-int calculateFactorialOf(unsigned number) {
+int getFactorialOf(unsigned number) {
 
 	if (number == 0) {
 

diff --git a/gistfile2.cpp b/gistfile2.cpp
@@ -1,14 +0,0 @@
-bool isHappy(unsigned int number) {
-    unsigned int sum;
-
-    do {
-        sum = 0;
-        for (; number > 0; sum += (number % 10) * (number % 10), number /= 10);
-        if (sum < 10) break;
-        number = sum;
-    } while (true);
-
-    if (sum == 1) return true;
-
-    return false;
-}

diff --git a/gistfile1.py → gistfile2.py b/gistfile1.py → gistfile2.py
@@ -1,4 +1,5 @@
 def isNarcissistic(number):
+
     # Determines the number of digits:
     digits = 0
     for (dividend = number; dividend > 0; dividend //= 10):

diff --git a/gistfile3.cpp b/gistfile3.cpp
@@ -1,8 +1,18 @@
-bool isRepunit(number) {
-    while (number > 0) {
-        if (number % 10 != 1) return false;
-        number /= 10;
-    }
+bool isHappy(unsigned int number) {
+
+	unsigned int sum;
+
+	do {
+
+		sum = 0;
+		for (; number > 0; sum += (number % 10) * (number % 10), number /= 10);
+		if (sum < 10) break;
+		number = sum;
+
+	} while (true);
+
+	if (sum == 1) return true;
+
+	return false;
 
-    return true;
 }
diff --git a/gistfile4.cpp b/gistfile4.cpp
@@ -1,10 +1,12 @@
-bool isPrime(long int number) {
-    if (number <= 1) return false;
-
-    if (number == 2) return true;
+bool isRepunit(number) {
 
-    for (unsigned int i = 2; i < (number / 2) + 1; ++i)
-        if (number % i == 0) return false;
+	while (number > 0) {
+
+		if (number % 10 != 1) return false;
+		number /= 10;
+
+	}
+
+	return true;
 
-    return true;
 }
diff --git a/gistfile5.cpp b/gistfile5.cpp
@@ -1,15 +1,15 @@
-bool isAutomorphic(number) {
-    unsigned int digits = 0,
-                 divisor = 1,
-                 squareNumber = number * number;
+bool isPrime(long int number) {
 
-    // Calculate the number of digits:
-    for (unsigned int i = number; i > 0; i /= 10, ++digits);
+	if (number <= 1) return false;
+
+	if (number == 2) return true;
 
-    // Calculate the divisor to use:
-    for (int i = 1; i <= digits; divisor *= 10, i++);
+	for (unsigned int i = 2; i < (number / 2) + 1; ++i) {
 
-    if ((squareNumber % divisor) == number) return true;
+		if (number % i == 0) return false;
+
+	}
+
+	return true;
 
-    return false;
 }
diff --git a/gistfile6.cpp b/gistfile6.cpp
@@ -1,10 +1,15 @@
-bool isPalindromic(unsigned int number) {
-    int reversed = 0;
+bool isAutomorphic(number) {
 
-    // Reverse the number:
-    for (unsigned int i = number; i > 0; reversed = (10 * reversed) + (i % 10), i /= 10);
+    unsigned int digits = 0, divisor = 1, squareNumber = number * number;
 
-    if (reversed == number) return true;
+	// Calculate the number of digits:
+	for (unsigned int i = number; i > 0; i /= 10, ++digits);
+
+	// Calculate the divisor to use:
+	for (int i = 1; i <= digits; divisor *= 10, i++);
+
+	if ((squareNumber % divisor) == number) return true;
+
+	return false;
 
-    return false;
 }
diff --git a/gistfile7.cpp b/gistfile7.cpp
@@ -1,13 +1,12 @@
-bool isPerfect(unsigned int number) {
-    unsigned int divisorsSum = 1;
+bool isPalindromic(unsigned int number) {
 
-    for (divisor = 2; divisor <= (number / 2) + 1; ++divisor) {
-        if (number % divisor == 0)
-            divisorsSum += divisor;
-    }
+	int reversed = 0;
 
-    if (number == divisorsSum)
-        return true;
+	// Reverse the number:
+	for (unsigned int i = number; i > 0; reversed = (10 * reversed) + (i % 10), i /= 10);
+
+	if (reversed == number) return true;
+
+	return false;
 
-    return false;
 }
diff --git a/gistfile8.cpp b/gistfile8.cpp
@@ -1,12 +1,23 @@
-# Change the base of a decimal base integer
-unsigned int(unsigned int number, unsigned short int newBase) {
-    unsigned int baseChanged = 0,
-                 exponent = 1;
+bool isPerfect(unsigned int number) {
 
-    for (unsigned int quotient = number; quotient > 0; quotient /= base) {
-        baseChanged += exponent * (quotient % base);
-        exponent = (10 * exponent);
-    }
+	unsigned int divisorsSum = 1;
+
+	for (divisor = 2; divisor <= (number / 2) + 1; ++divisor) {
+
+		if (number % divisor == 0) {
+
+			divisorsSum += divisor;
+
+		}
+
+	}
+
+    if (number == divisorsSum) {
+
+		return true;
+
+	}
+
+	return false;
 
-    return baseChanged;
 }
diff --git a/gistfile9.cpp b/gistfile9.cpp
@@ -0,0 +1,15 @@
+# Change the base of a decimal base integer
+unsigned int(unsigned int number, unsigned short int newBase) {
+
+	unsigned int baseChanged = 0, exponent = 1;
+
+	for (unsigned int quotient = number; quotient > 0; quotient /= base) {
+
+		baseChanged += exponent * (quotient % base);
+		exponent = (10 * exponent);
+
+	}
+
+	return baseChanged;
+
+}
diff --git a/factorial b/factorial
@@ -0,0 +1,15 @@
+int calculateFactorialOf(unsigned number) {
+
+	if (number == 0) {
+
+		return 1;
+
+	}
+
+	unsigned int factorial, i;
+
+	for (factorial = i = 1; i <= number; factorial *= i, i++);
+
+	return factorial;
+
+}
diff --git a/isNarcissistic.py → gistfile1.py b/isNarcissistic.py → gistfile1.py
diff --git a/gistfile2.cpp b/gistfile2.cpp
@@ -0,0 +1,14 @@
+bool isHappy(unsigned int number) {
+    unsigned int sum;
+
+    do {
+        sum = 0;
+        for (; number > 0; sum += (number % 10) * (number % 10), number /= 10);
+        if (sum < 10) break;
+        number = sum;
+    } while (true);
+
+    if (sum == 1) return true;
+
+    return false;
+}
diff --git a/gistfile3.cpp b/gistfile3.cpp
@@ -0,0 +1,8 @@
+bool isRepunit(number) {
+    while (number > 0) {
+        if (number % 10 != 1) return false;
+        number /= 10;
+    }
+
+    return true;
+}
diff --git a/gistfile4.cpp b/gistfile4.cpp
@@ -0,0 +1,10 @@
+bool isPrime(long int number) {
+    if (number <= 1) return false;
+
+    if (number == 2) return true;
+
+    for (unsigned int i = 2; i < (number / 2) + 1; ++i)
+        if (number % i == 0) return false;
+
+    return true;
+}
diff --git a/gistfile5.cpp b/gistfile5.cpp
@@ -0,0 +1,15 @@
+bool isAutomorphic(number) {
+    unsigned int digits = 0,
+                 divisor = 1,
+                 squareNumber = number * number;
+
+    // Calculate the number of digits:
+    for (unsigned int i = number; i > 0; i /= 10, ++digits);
+
+    // Calculate the divisor to use:
+    for (int i = 1; i <= digits; divisor *= 10, i++);
+
+    if ((squareNumber % divisor) == number) return true;
+
+    return false;
+}
diff --git a/gistfile6.cpp b/gistfile6.cpp
@@ -0,0 +1,10 @@
+bool isPalindromic(unsigned int number) {
+    int reversed = 0;
+
+    // Reverse the number:
+    for (unsigned int i = number; i > 0; reversed = (10 * reversed) + (i % 10), i /= 10);
+
+    if (reversed == number) return true;
+
+    return false;
+}
diff --git a/gistfile7.cpp b/gistfile7.cpp
@@ -0,0 +1,13 @@
+bool isPerfect(unsigned int number) {
+    unsigned int divisorsSum = 1;
+
+    for (divisor = 2; divisor <= (number / 2) + 1; ++divisor) {
+        if (number % divisor == 0)
+            divisorsSum += divisor;
+    }
+
+    if (number == divisorsSum)
+        return true;
+
+    return false;
+}
diff --git a/gistfile8.cpp b/gistfile8.cpp
@@ -0,0 +1,12 @@
+# Change the base of a decimal base integer
+unsigned int(unsigned int number, unsigned short int newBase) {
+    unsigned int baseChanged = 0,
+                 exponent = 1;
+
+    for (unsigned int quotient = number; quotient > 0; quotient /= base) {
+        baseChanged += exponent * (quotient % base);
+        exponent = (10 * exponent);
+    }
+
+    return baseChanged;
+}
diff --git a/isNarcissistic.py b/isNarcissistic.py
@@ -1,19 +1,15 @@
 def isNarcissistic(number):
-    digits = digitsSum = 0
-
     # Determines the number of digits:
-    dividend = number
-    while (dividend > 0):
-        dividend //= 10
-        digits = digits + 1
+    digits = 0
+    for (dividend = number; dividend > 0; dividend //= 10):
+        digits += 1
 
     # Calculates the sum of the squared digits:
-    dividend = number
-    while (dividend > 0):
+    digitsSum = 0
+    for (dividend = number; dividend > 0; dividend //= 10):
         digitsSum += (dividend % 10) ** digits
-        dividend //= 10
 
-    # Returns the answer
+    # Returns the answer:
     if (digitsSum == number):
         return true
 

diff --git a/isNarcissistic.py b/isNarcissistic.py
@@ -0,0 +1,20 @@
+def isNarcissistic(number):
+    digits = digitsSum = 0
+
+    # Determines the number of digits:
+    dividend = number
+    while (dividend > 0):
+        dividend //= 10
+        digits = digits + 1
+
+    # Calculates the sum of the squared digits:
+    dividend = number
+    while (dividend > 0):
+        digitsSum += (dividend % 10) ** digits
+        dividend //= 10
+
+    # Returns the answer
+    if (digitsSum == number):
+        return true
+
+    return false
No results found