Two Letter Combinations
0 likes • Nov 18, 2022 • 0 views
C++
Loading...
More C++ Posts
#define NUM_BITS 8#include <iostream>struct Number{int num : NUM_BITS;Number(){}Number(const int& bruh){num = bruh;}operator int() const { return num; }Number& operator=(const int& bruh){num = bruh;return (*this);}};using namespace std;bool isNegative(const int& num){//This gets the bitwise and of num and 10000000000000000000000000000000//This implicit casts to bool, which means (num & (1 << 31)) != 0return (num & (1 << 31));}void printBinaryNumber(const int& num, const int numBits){for(int i = numBits; i > 0; --i){//8..1int bitMask = 1 << (i-1);if(num & bitMask){ //Test the bitcout << '1';}else{cout << '0';}}}void printCarryBits(const int& a, const int& b, const int numBits){int answer = 0;bool carry = false;for(int i = 0; i < numBits; ++i){//8..1int bitMask = 1 << i;bool aBit = a & bitMask;bool bBit = b & bitMask;if(aBit && bBit || aBit && carry || bBit && carry){ //Carry bit is true nextif(carry)answer |= bitMask;carry = true;}else{if(carry)answer |= bitMask;carry = false;}}printBinaryNumber(answer, 8);}void printBorrowBits(const int& a, const int& b, const int numBits){int answer = 0;bool carry = false;for(int i = 0; i < numBits; ++i){//8..1int bitMask = 1 << i;bool aBit = a & bitMask;bool bBit = b & bitMask;if((!(aBit ^ carry)) && bBit){ //Carry bit is true nextif(carry)answer |= bitMask;carry = true;}else{if(carry)answer |= bitMask;carry = false;}}printBinaryNumber(answer, 8);}void doProblem(const int& a, const int& b, const char& sign, const int& result, const int& numBits){if(sign == '+'){cout << ' '; printCarryBits(a, b, numBits); cout << endl;}else{cout << ' '; printBorrowBits(a, b, numBits); cout << endl;}cout << ' '; printBinaryNumber(a, numBits); cout << endl;cout << sign; printBinaryNumber(b, numBits); cout << endl;cout << "----------" << endl;cout << ""; printBinaryNumber(result, numBits + 1); cout << " = " << result;cout << endl;}int main(){Number a = 0b110;Number b = 0b011;cout<< a << endl << b << endl;doProblem(a, b, '+', a + b, NUM_BITS);doProblem(a, b, '-', a - b, NUM_BITS);doProblem(-a, b, '+', -a + b, NUM_BITS);doProblem(a, b, '-', -a - b, NUM_BITS);return 0;}
#include "stdio.h"#include <stdlib.h>int main (int argCount, char** args) {int a = atoi(args[1]);int b = atoi(args[2]);unsigned int sum = 0;unsigned int p = 1;for (unsigned int i = 1; i < b; i++) {p = p * i;}// (b!, (1 + b)!, (2 + b)!, ..., (n + b)!)for (unsigned int i = 0; i < a; i++) {p = p * (i + b);sum = sum + p;}printf("y: %u\n", sum);return 0;}
#include <iostream>#include <string> //Should already be in iostream#include <cstdlib>//A word score adds up the character values. a-z gets mapped to 1-26 for the values of the characters.//wordScore [wordValue]//Pipe in the input into stdin, or type the words yourself.//Lowercase words onlyint characterValue(const char b){return ((b >= 'a') && (b <= 'z'))? ((b - 'a') + 1) : 0;}int main(int argc, char** argv){//The first argument specifies if you are trying to look for a certain word scoreint wordValue = (argc > 1)? std::atoi(argv[1]) : 0;std::string line;while(std::getline(std::cin, line)){int sum = 0;for(const char c : line){sum += characterValue(c);}if(wordValue){ //If wordValue is 0 or the sum is the correct valueif(wordValue == sum){std::cout << line << std::endl;}} else {std::cout << sum << "\t" << line << std::endl;}}return 0;}
// Iterative C++ program to// implement Stein's Algorithm//#include <bits/stdc++.h>#include <bitset>using namespace std;// Function to implement// Stein's Algorithmint gcd(int a, int b){/* GCD(0, b) == b; GCD(a, 0) == a,GCD(0, 0) == 0 */if (a == 0)return b;if (b == 0)return a;/*Finding K, where K is thegreatest power of 2that divides both a and b. */int k;for (k = 0; ((a | b) & 1) == 0; ++k){a >>= 1;b >>= 1;}/* Dividing a by 2 until a becomes odd */while ((a & 1) == 0)a >>= 1;/* From here on, 'a' is always odd. */do{/* If b is even, remove all factor of 2 in b */while ((b & 1) == 0)b >>= 1;/* Now a and b are both odd.Swap if necessary so a <= b,then set b = b - a (which is even).*/if (a > b)swap(a, b); // Swap u and v.b = (b - a);} while (b != 0);/* restore common factors of 2 */return a << k;}// Driver codeint main(){int a = 12, b = 780;printf("Gcd of given numbers is %d\n", gcd(a, b));return 0;}
/*Good morning! Here's your coding interview problem for today.This problem was asked by Stripe.Given an array of integers, find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can contain duplicates and negative numbers as well.For example, the input [3, 4, -1, 1] should give 2. The input [1, 2, 0] should give 3.You can modify the input array in-place.*/#include <iostream>using namespace std;int calcMissing(int* input, int size){int sum = 0;int n = 1; //add one to account for missing valuefor(int i = 0; i < size; i++){if(input[i] > 0){sum += input[i];n++;}}//If no numbers higher than 0, answer is 1if(sum == 0)return 1;return (n*(n+1)/2) - sum; //Formula is expectedSum - actualSum/* expectedSum = n*(n+1)/2, the formula for sum(1, n) */}int main(){cout << calcMissing(new int[4]{3, 4, -1, 1}, 4) << endl;cout << calcMissing(new int[3]{1, 2, 0}, 3) << endl;//No positive numberscout << calcMissing(new int[1]{0}, 1) << endl;}
#include "goat.h" //include goat.hvoid Goat::setBreed(string breed) {this->breed = breed;}void Goat::setWeight(float weight) {this->weight = weight;}void Goat::setName(string name) {this->name = name;}void Goat::setGender(char gender) {this->gender = gender;}void Goat::setSpayed(bool goatIsSpayed) {this->goatIsSpayed = goatIsSpayed;}void Goat::setRegistrationID(string registrationID) {this->registrationID = registrationID;}void Goat::setColor(string color) {this->color = color;}void Goat::setOtherComments(string otherComments) {this->otherComments = otherComments;}string Goat::getBreed() {return breed;}float Goat::getWeight() {return weight;}string Goat::getName() {return name;}char Goat::getGender() {return gender;}bool Goat::getSpayed() {return goatIsSpayed;}string Goat::getRegistrationID() {return registrationID;}string Goat::getColor() {return color;}string Goat::getOtherComments() {return otherComments;}Goat::Goat() {breed = "";weight = 0.0;name = "";gender = '\0';goatIsSpayed = false;registrationID = "";color = "";otherComments = "";}Goat::Goat(string goatBreed, float goatWeight, string goatName, char goatGender, bool goatSpayedStatus, string goatRegistrationID, string goatColor, string goatOtherComments) {breed = goatBreed;weight = goatWeight;name = goatName;gender = goatGender;goatIsSpayed = goatSpayedStatus;registrationID = goatRegistrationID;color = goatColor;otherComments = goatOtherComments;}Goat::~Goat() {cout << "goat destroyed" << endl;}void Goat::printinfo() {cout << "Breed: " << breed << endl << "weight: " << weight << endl << "Name: " << name << endl << "Gender: " << gender << endl << "is Spayed: ";if(goatIsSpayed) { //here I do a logical test on boolean goatIsSpayed. if true cout << true else cout << falsecout << "True";} else {cout << "False";}cout << endl << "Registration ID: " << registrationID << endl << "Color Description: " << color << endl << "Other Comments: " << otherComments << endl << endl;}