Loading...
More C++ Posts
#include <iostream>using namespace std;/* Function: get_coeffParameters: double& coeff, int pos passed from bb_4acReturn: type is void so no return, but does ask for user to input data that establishes what a b and c are.*/void get_coeff(double& coeff, int pos) {char position;if(pos == 1) {position = 'a';} else if(pos == 2) { //a simple system to determine what coefficient the program is asking for.position = 'b';} else {position = 'c';}cout << "Enter the co-efficient " << position << ":"; //prompt to input coeffcoeff = 5; //input coeff}/* Function: bb_4acParameters: no parameters passed from main, but 3 params established in function, double a, b, c.Return: b * b - 4 * a * c*/double bb_4ac() {double a, b, c; //coefficients of a quadratic equationget_coeff(a, 1); // call function 1st timeget_coeff(b, 2); // call function 2nd timeget_coeff(c, 3); // call function 3rd timereturn b * b - 4 * a * c; //return b * b - 4 * a * c}int main() {cout << "Function to calculate the discriminant of the equation. . . " << endl;double determinate = bb_4ac(); //assign double determinate to bb_4ac functioncout << "The discriminant for given values is: " << determinate << endl; //output the determinate!}
/*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;}
//Constant prefix notation solver using bruh//Could make it infix or postfix later#include<string>#include<vector>#include<iostream>std::vector<long double> bruhBuff;long double operator ""bruh(long double a){bruhBuff.push_back(a);return a;}long double operator ""bruh(const char op){if(bruhBuff.size() < 2) throw "Bruh weak";long double b = bruhBuff.back();bruhBuff.pop_back();long double a = bruhBuff.back();bruhBuff.pop_back();switch(op){case (int)('+'):return a + b;case (int)('-'):return a - b;case (int)('*'):return a * b;case (int)('/'):return a / b;}return 69l;}int main(){1.0bruh;2.0bruh;std::cout << '+'bruh << std::endl;return 0;}
//===============Header File==================#include <iostream>#include <sstream> //stringbuf#include <utility> //exchange//Couple rules://Characters given through the getter functions have to be removed from the buffer.//This is so that bufferEmpty() == buffer.in_avail() > 0 basically always.//skipWhitespace doesn't remove the text from the buffer, but it does return the number of characters.//nextWord will trim whitespace before the word//nextInt will trim non-numbers before the number//hasNextInt and hasNextWord will trim the whitespace. If you think you need it, you should get nextWhitespace before doing any of those.//Whitespace after a word or an int is left on the buffer.//nextWhitespace will (get and) remove whitespace until the end of the line, including the newline character, but stops before the next line.//nextWhitespace won't read the next line when called before the end of the line, and it won't prompt the user for the next line if interactive.//If nextWhitespace is called after reading the end of the line, then it will read a new line into the buffer, which will prompt the user.//It acts like nextLine, but if there's something non-whitespace on the current line it stops there.class Scanner {public:std::stringbuf buffer;std::istream& input;Scanner(std::istream& in = std::cin) : buffer(), input(in) {}//Buffer debuggingbool fillBuffer();bool bufferEmpty();void printBufferEmpty();std::string getBuffer();size_t bufferLength();void printBufferStats();//Intbool hasNextInt();int nextInt();//Wordbool hasNextWord();std::string nextWord();//Linebool hasNextLine();//Whitespacesize_t skipWhitespace(); //Prob should be private, but I don't believe in that private shit.bool hasNextWhitespace();std::string nextWhitespace();std::string nextWhitespaceAll();std::string nextLine();};//===============Source File==================bool Scanner::fillBuffer() { //Returns if it had to get the next line from the input.const bool badInput = input.eof() || input.bad();const bool shouldFillBuffer = bufferEmpty() && !badInput;if (shouldFillBuffer) {std::string line;if (std::getline(input, line)) {buffer.str(buffer.str() + line + "\n");}}return shouldFillBuffer;}bool Scanner::bufferEmpty(){return buffer.str() == "";}void Scanner::printBufferEmpty(){std::cout << "The buffer is " << (bufferEmpty()? "" : "not") << " empty." << std::endl;}std::string Scanner::getBuffer(){return buffer.str();}size_t Scanner::bufferLength(){return buffer.str().length();}void Scanner::printBufferStats(){if(bufferEmpty()){std::cout << "The buffer is \"\"" << std::endl;return;}std::cout << "The length of the buffer is " << bufferLength() << std::endl;if(buffer.sgetc() == '\r'){std::cout << "The buffer is \\r\\n" << std::endl;}else if(buffer.sgetc() == '\n'){std::cout << "The buffer is \\n" << std::endl;}}bool Scanner::hasNextInt() {return hasNextWord() && (std::isdigit(buffer.sgetc()) || buffer.sgetc() == '-');}int Scanner::nextInt() {if (!hasNextInt()) { //Will fill the buffer if not filled. Will also trim whitespace.return 0;}std::string num;size_t charactersRead = 0;while (buffer.in_avail() > 0 && (std::isdigit(buffer.sgetc()) || buffer.sgetc() == '-')) {num += buffer.sbumpc();++charactersRead;}buffer.str(buffer.str().erase(0, charactersRead));return std::stoi(num);}bool Scanner::hasNextWord() {nextWhitespaceAll();return buffer.in_avail() > 0;}std::string Scanner::nextWord() {if (!hasNextWord()) { //Will fill the buffer if not filled. Will also trim whitespace.return "";}std::string word;size_t charactersRead = 0;while (buffer.in_avail() > 0 && !std::isspace(buffer.sgetc())) {word += buffer.sbumpc();++charactersRead;}buffer.str(buffer.str().erase(0, charactersRead));return word;}bool Scanner::hasNextLine() {return (!bufferEmpty()) || fillBuffer();}size_t Scanner::skipWhitespace() { //Returns characters readsize_t charactersRead = 0;while (buffer.in_avail() > 0 && std::isspace(buffer.sgetc())) {buffer.sbumpc();++charactersRead;}return charactersRead;}bool Scanner::hasNextWhitespace(){fillBuffer();return buffer.in_avail() > 0 && std::isspace(buffer.sgetc());}std::string Scanner::nextWhitespace() {if (!hasNextWhitespace()) { //Will fill the buffer if not filledreturn "";}const size_t charactersRead = skipWhitespace();std::string whitespace = buffer.str().substr(charactersRead);buffer.str(buffer.str().erase(0, charactersRead));return whitespace;}std::string Scanner::nextWhitespaceAll(){std::string whitespace;while(hasNextWhitespace()){std::string gottenWhiteSpace = nextWhitespace();whitespace += gottenWhiteSpace;}return whitespace;}std::string Scanner::nextLine(){if (!hasNextLine()) {return "";}fillBuffer();//Swap out the old buffer with an empty buffer, and get the old buffer as a variable.std::string line = std::exchange(buffer, std::stringbuf()).str();//Remove the newline.if(line[line.length() - 1] == '\n' || line[line.length() - 1] == '\r' ) line.pop_back();if(line[line.length() - 1] == '\r' || line[line.length() - 1] == '\n' ) line.pop_back();return line;}//=================Word and Int test=================while(bruh.hasNextInt() || bruh.hasNextWord()){std::cout << "started loop" << std::endl;if(bruh.hasNextInt()){std::cout << "Int: " << bruh.nextInt() << " " << std::endl;}else{std::cout << "Word: " << bruh.nextWord() << " " << std::endl;}bruh.nextWhitespace();}//===================Line test======================for(int count = 1; bruh.hasNextLine(); ++count){std::string line = bruh.nextLine();std::cout << "Line " << count << ": " << line << std::endl;}
#include <iostream>using namespace std;main{cout << "No tabbing. That's very sad :(\n";cout << "No in-editor highlighting either :(((\n";cout << "Descriptions might be niice too.";}
#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);}