initial commit, B1-10 and B45-B55 obfuscated

Author: SwindleA

Base_Code/B1.cpp

@@ -0,0 +1,11 @@
+#include <iostream>
+
+int main(){
+    
+
+    for(int i =1; i<=10;i++){
+        std::cout<< i << std::endl;
+    }
+    
+
+}

Base_Code/B10.cpp

@@ -0,0 +1,21 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+int main(){
+    
+    std::vector <char> vowels = {'a','e','i','o','u'};
+
+    std::string word = "alphabet";
+
+    int number_of_vowels = 0;
+
+    for(int i =0; i<word.size(); i++){
+        if( std::find(vowels.begin(),vowels.end(),word[i]) != vowels.end()){
+            number_of_vowels ++;
+        }
+    }
+    
+    std::cout<<number_of_vowels<<std::endl;
+    
+}

Base_Code/B11.cpp

@@ -0,0 +1,21 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+int main(){
+    
+    std::vector <char> vowels = {'a','e','i','o','u'};
+
+    std::string word = "alphabet";
+
+    int number_of_consonant = 0;
+
+    for(int i =0; i<word.size(); i++){
+        if( std::find(vowels.begin(),vowels.end(),word[i]) == vowels.end()){
+            number_of_consonant ++;
+        }
+    }
+    
+    std::cout<<number_of_consonant<<std::endl;
+    
+}

Base_Code/B12.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+int main(){
+    
+    
+
+     std::string number = "1382643";
+
+    int number_of_odd_digits = 0;
+
+    
+    for(int i =0; i<number.size(); i++){
+        std::string num;
+        num.push_back(number[i]);
+        if( std::stoi(num)%2 != 0){
+            number_of_odd_digits ++;
+        }
+    }
+    
+    std::cout<<number_of_odd_digits<<std::endl;
+    
+}

Base_Code/B13.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+int main(){
+    
+    
+
+     std::string number = "1382643";
+
+    int number_of_even_digits = 0;
+
+    
+    for(int i =0; i<number.size(); i++){
+        std::string num;
+        num.push_back(number[i]);
+        if( std::stoi(num)%2 == 0){
+            number_of_even_digits ++;
+        }
+    }
+    
+    std::cout<<number_of_even_digits<<std::endl;
+    
+}

Base_Code/B14.cpp

@@ -0,0 +1,27 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+int main(){
+    
+    
+
+    std::string number = "1382643";
+
+    std::vector<int> odd_digits;
+
+    
+    for(int i =0; i<number.size(); i++){
+        std::string num;
+        num.push_back(number[i]);
+        if( std::stoi(num)%2 != 0){
+            odd_digits.push_back(std::stoi(num));
+        }
+    }
+    
+    for(int j = 0;j<odd_digits.size(); j++){
+        std::cout<<odd_digits[j]<<" ";
+    }
+    
+    
+}

Base_Code/B15.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <vector>
+
+int main(){
+    
+    
+
+    std::string number = "1382643";
+
+    std::vector<int> even_digits;
+
+    
+    for(int i =0; i<number.size(); i++){
+        std::string num;
+        num.push_back(number[i]);
+        if( std::stoi(num)%2 == 0){
+            even_digits.push_back(std::stoi(num));
+        }
+    }
+    
+    for(int j = 0;j<even_digits.size(); j++){
+        std::cout<<even_digits[j]<<" ";
+    }
+    
+    
+}

Base_Code/B16.cpp

@@ -0,0 +1,10 @@
+#include <iostream>
+
+int main() {
+    int let = 97;
+    for (int i = 0; i < 26; i++) {
+        std::cout << static_cast<char>(let) << std::endl;
+        let++;
+    }
+    return 0;
+}

Base_Code/B17.cpp

@@ -0,0 +1,12 @@
+#include <iostream>
+
+int main() {
+    int let = 97;
+    int LET = 65;
+    for (int i = 0; i < 26; i++) {
+        std::cout <<static_cast<char>(LET)<< static_cast<char>(let) << std::endl;
+        let++;
+        LET++;
+    }
+    return 0;
+}

Base_Code/B18.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+#include <vector>
+#include <string>
+
+int main() {
+    std::vector<char> letters = {'a', 'b'};
+    std::vector<std::string> output;
+
+    for (char let : letters) {
+        for (char tel : letters) {
+            std::string combination;
+            combination.push_back(let);
+            combination.push_back(tel);
+            output.push_back(combination);
+        }
+    }
+
+    for (const std::string& str : output) {
+        std::cout << str << std::endl;
+    }
+
+    return 0;
+}

Base_Code/B19.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+#include <vector>
+int main() {
+    std::vector<std::string> output;
+    for (int let = 97; let < 123; let++) {
+        for(int LET = 65; LET < 91; LET ++){
+            std::string combination;
+            combination.push_back(static_cast<char>(let));
+            combination.push_back(static_cast<char>(LET));
+            output.push_back(combination);
+        
+        }
+        
+    }
+    std::cout<<"{";
+    for (const std::string& str : output) {
+        std::cout << str << ", ";
+    }
+
+    std::cout<<"}"<<std::endl;
+    return 0;
+}

Base_Code/B2.cpp

@@ -0,0 +1,11 @@
+#include <iostream>
+
+int main(){
+    
+    int sum =0;
+    for(int i =1; i<=10;i++){
+        sum+=i;
+    }
+    std::cout<< sum << std::endl;
+
+}

Base_Code/B20.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <vector>
+
+bool isConsonant(char c) {
+    return (c != 'a') && (c!='e') &&
+           (c != 'i') && (c != 'o') &&
+           (c != 'u');
+}
+
+int main() {
+    std::vector<char> consonantsWithEvenDecimal;
+
+    for (char c = 'b'; c <= 'z'; c++) {
+        if (isConsonant(c) && (c % 2 == 0)) {
+            consonantsWithEvenDecimal.push_back(c);
+        }
+    }
+
+    for (char c : consonantsWithEvenDecimal) {
+        std::cout << c << " ";
+    }
+
+    std::cout << std::endl;
+
+    return 0;
+}

Base_Code/B21.cpp

@@ -0,0 +1,34 @@
+#include <iostream>
+#include <vector>
+
+int main(){
+    
+    std::vector <int> prime_numbers;
+    int start = 345;
+    int end = 1000;
+
+    
+
+    for(int i = start; i<=end; i++){
+        bool is_prime = true;
+        for(int j = 2; j <= i/2; j++){
+            if(i % j == 0){
+                is_prime = false;
+                break;
+            }
+        }
+        if(is_prime){
+            prime_numbers.push_back(i);
+        }
+        
+    }
+    
+    std::cout<<"{";
+    for (const int num : prime_numbers) {
+        std::cout << num << ", ";
+    }
+
+    std::cout<<"}"<<std::endl;
+    return 0;
+    
+}

Base_Code/B22.cpp

@@ -0,0 +1,15 @@
+#include <iostream>
+
+
+int main(){
+    
+    int number = 13;
+
+    while(number <= 800){
+        number*=5;
+    }
+
+    std::cout<<number<<std::endl;
+    return 0;
+    
+}

Base_Code/B23.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+//https://www.programiz.com/cpp-programming/examples/quadratic-roots
+int main() {
+
+    float a, b, c, x1, x2, discriminant, realPart, imaginaryPart;
+    cout << "Enter coefficients a, b and c: ";
+    cin >> a >> b >> c;
+    discriminant = b*b - 4*a*c;
+    
+    if (discriminant > 0) {
+        x1 = (-b + sqrt(discriminant)) / (2*a);
+        x2 = (-b - sqrt(discriminant)) / (2*a);
+        cout << "Roots are real and different." << endl;
+        cout << "x1 = " << x1 << endl;
+        cout << "x2 = " << x2 << endl;
+    }
+    
+    else if (discriminant == 0) {
+        cout << "Roots are real and same." << endl;
+        x1 = -b/(2*a);
+        cout << "x1 = x2 =" << x1 << endl;
+    }
+
+    else {
+        realPart = -b/(2*a);
+        imaginaryPart =sqrt(-discriminant)/(2*a);
+        cout << "Roots are complex and different."  << endl;
+        cout << "x1 = " << realPart << "+" << imaginaryPart << "i" << endl;
+        cout << "x2 = " << realPart << "-" << imaginaryPart << "i" << endl;
+    }
+
+    return 0;
+}

Base_Code/B24.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+using namespace std;
+//https://www.programiz.com/cpp-programming/examples/fibonacci-series
+int main() {
+    int t1 = 0, t2 = 1, nextTerm = 0, n;
+
+    cout << "Enter a positive number: ";
+    cin >> n;
+
+    // displays the first two terms which is always 0 and 1
+    cout << "Fibonacci Series: " << t1 << ", " << t2 << ", ";
+
+    nextTerm = t1 + t2;
+
+    while(nextTerm <= n) {
+        cout << nextTerm << ", ";
+        t1 = t2;
+        t2 = nextTerm;
+        nextTerm = t1 + t2;
+    }
+    return 0;
+}