Loading...
More C++ Posts
#include <iostream>using namespace std;int main {cout << 1;}
int main()
#include <iostream>using namespace std;int main(){int arr[] = {5, 1, 4, 20, 10, 2, 13, 11, 6, 21};int greed[] = {0, 0, 0, 0};int k = 0;int i;int set_index;while (k < 4){i = 0;while (i < 10){if (arr[i] > greed[k]){greed[k] = arr[i];set_index = i;}i++;}arr[set_index] = 0;k++;}cout << greed[0] << " " << greed[1] << " " << greed[2] << " " << greed[3] << endl;}
#include <iostream>#include <vector>using namespace std;void swap(int *a, int *b){int temp = *b;*b = *a;*a = temp;}void heapify(vector<int> &hT, int i){int size = hT.size();int largest = i;int l = 2 * i + 1;int r = 2 * i + 2;if (l < size && hT[l] > hT[largest])largest = l;if (r < size && hT[r] > hT[largest])largest = r;if (largest != i){swap(&hT[i], &hT[largest]);heapify(hT, largest);}}void insert(vector<int> &hT, int newNum){int size = hT.size();if (size == 0){hT.push_back(newNum);}else{hT.push_back(newNum);for (int i = size / 2 - 1; i >= 0; i--){heapify(hT, i);}}}void deleteNode(vector<int> &hT, int num){int size = hT.size();int i;for (i = 0; i < size; i++){if (num == hT[i])break;}swap(&hT[i], &hT[size - 1]);hT.pop_back();for (int i = size / 2 - 1; i >= 0; i--){heapify(hT, i);}}void printArray(vector<int> &hT){for (int i = 0; i < hT.size(); ++i)cout << hT[i] << " ";cout << "\n";}int main(){vector<int> heapTree;insert(heapTree, 3);insert(heapTree, 4);insert(heapTree, 9);insert(heapTree, 5);insert(heapTree, 2);cout << "Max-Heap array: ";printArray(heapTree);deleteNode(heapTree, 4);cout << "After deleting an element: ";printArray(heapTree);}
#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;}
#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;}