NicolasFrancaX
/ 1068.cpp
Created
January 8, 2019 22:13
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <string> | |
| #include <stack> | |
| using namespace std; | |
| bool verification(string s) { | |
| stack<char> stq; | |
| for (unsigned int i = 0; i < s.length(); i++) { |
NicolasFrancaX
/ 1244.cpp
Created
January 8, 2019 21:27
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <sstream> | |
| #include <map> | |
| #include <vector> | |
| using namespace std; | |
| int main() { | |
| string text; | |
| string word; |
NicolasFrancaX
/ packList.js
Created
September 27, 2016 11:55
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function packLists(a) { | |
| if (!a.length) { | |
| return [[]]; | |
| } else if (a.length == 1) { | |
| return [[a[0]]]; | |
| } | |
| var c = [a[0]] |
NicolasFrancaX
/ primeFactors.js
Created
September 26, 2016 12:26
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* (**) Determine the prime factors of a given positive integer. | |
| * Construct a flat list containing the prime factors in ascending order. | |
| * Example: | |
| * * (prime-factors 315) | |
| * (3 3 5 7) | |
| */ | |
| function prime(n) { | |
| if (n < 2) { |
NicolasFrancaX
/ primeFactors.js
Created
September 26, 2016 12:24
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* (**) Determine the prime factors of a given positive integer. | |
| * Construct a flat list containing the prime factors in ascending order. | |
| * Example: | |
| * * (prime-factors 315) | |
| * (3 3 5 7) | |
| */ | |
| function prime(n) { | |
| if (n < 2) { |
NicolasFrancaX
/ primeFactors.js
Created
September 26, 2016 12:19
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* (**) Determine the prime factors of a given positive integer. | |
| * Construct a flat list containing the prime factors in ascending order. | |
| * Example: | |
| * * (prime-factors 315) | |
| * (3 3 5 7) | |
| */ | |
| function prime(n) { | |
| if (n < 2) { |
NicolasFrancaX
/ primeFactors.js
Created
September 26, 2016 11:58
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* (**) Determine the prime factors of a given positive integer. | |
| * Construct a flat list containing the prime factors in ascending order. | |
| * Example: | |
| * * (prime-factors 315) | |
| * (3 3 5 7) | |
| */ | |
| function prime(n) { | |
| if (n < 2) |
NicolasFrancaX
/ primeFactors.js
Created
September 26, 2016 11:57
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* (**) Determine the prime factors of a given positive integer. | |
| * Construct a flat list containing the prime factors in ascending order. | |
| * Example: | |
| * * (prime-factors 315) | |
| * (3 3 5 7) | |
| */ | |
| function prime(n) { | |
| if (n < 2) { |
NicolasFrancaX
/ primeFactors.js
Created
September 26, 2016 11:56
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* (**) Determine the prime factors of a given positive integer. | |
| * Construct a flat list containing the prime factors in ascending order. | |
| * Example: | |
| * * (prime-factors 315) | |
| * (3 3 5 7) | |
| */ | |
| function prime(n) { | |
| if (n < 2) { |
NicolasFrancaX
/ primeFactors.js
Created
September 26, 2016 11:52
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* (**) Determine the prime factors of a given positive integer. | |
| * Construct a flat list containing the prime factors in ascending order. | |
| * Example: | |
| * * (prime-factors 315) | |
| * (3 3 5 7) | |
| */ | |
| function prime(n) { | |
| if (n < 2) { | |
| return false; |
NewerOlder