Enumeration Basics
0 likes • Nov 18, 2022
C++
Loading...
More C++ Posts
/*this program will simulate the spreading of a disease through agrid of people, starting from a user-defined person. It will countthe number of turns taken before everyone on the grid is immunizedto the disease after having caught it once.This program will user the SIR model (Susceptible, Infectious, Recovered)and cellular automata to simulate the people in the grid.*/#include <iostream>using namespace std;/* Any and all global variables */const int SIZE = 8; //Size of the square person array/* Any and all functions */void gridDefaultify(char[][SIZE], int);//Purpose: Sets each item in the person array to 's'//Parameters: A square, two-dimensional array// The size of that array's boundsvoid gridDisplay(char[][SIZE], int);//Purpose: Formats and prints the information in the person grid//Parameters: A square, two-dimensional array// The value of the current dayvoid nextTurn(char[][SIZE], char[][SIZE], int&);//Purpose: Updates the grid of people, and the current day//Parameters: Two square, two-dimensional arrays// A reference to the current day (so that it can be updated)int countInfected(char[][SIZE], int);//Purpose: Counts the number of infectious people on the grid//Parameters: A square, two-dimensional array// The size of that array's boundsint main(){int currentDay = 0; //Infection begins on day 0, and ends one day after the last person is Recoveredchar gridCurrent[SIZE][SIZE]; //Grid of all peoplechar gridUpdate[SIZE][SIZE]; //Where the user chooses to start the infectionint xToInfect;int yToInfect; //Set of coordinates for the initial infection position, given by user//Initializes the grids to all 's'gridDefaultify(gridCurrent, SIZE);gridDefaultify(gridUpdate, SIZE);//The below block gets the initial infection coordinates from the usercout << "Please enter a location to infect: ";while(true){cin >> xToInfect >> yToInfect;xToInfect--;yToInfect--;if(xToInfect < 0 || yToInfect < 0 || xToInfect >= SIZE || yToInfect >= SIZE){cout << "Those coordinates are outside the bounds of this region." << endl;cout << "Please enter another location to infect: ";continue;} else {gridCurrent[xToInfect][yToInfect] = 'i';break;}}//Displays the initial state of the gridgridDisplay(gridCurrent, currentDay);//The below block will display and update the grid until the infection is done.while(true){nextTurn(gridCurrent, gridUpdate, currentDay);gridDisplay(gridCurrent, currentDay);if(countInfected(gridCurrent, SIZE) == 0) break; //Once there are no more infected, the game is done}//Displays the number of days taken for the infection to endcout << "It took " << currentDay + 1 << " days for the outbreak to end";cout << endl;return 0;}void gridDefaultify(char arr[][SIZE], int arrSize){for(int x = 0; x < arrSize; x++){for(int y = 0; y < arrSize; y++){arr[x][y] = 's'; //Sets all items in the passed-in array to 's'}}return;}void gridDisplay(char arr[][SIZE], int day){cout << "Day " << day << endl; //Prints the current dayfor(int x = 0; x < SIZE; x++){for(int y = 0; y < SIZE; y++){cout << arr[x][y] <<" "; //Prints the array's contents}cout << endl; //Formats with newlines}cout << endl; //Some spacingreturn;}void nextTurn(char today[][SIZE], char update[][SIZE], int& day){day++; //Updates the dayint xCheck; //X coordinate to be checkedint yCheck; //Y coordinate to be checkedfor(int x = 0; x < SIZE; x++){for(int y = 0; y < SIZE; y++){//Sets all 'i' to 'r' in the new gridif(today[x][y] == 'i' || today[x][y] == 'r'){update[x][y] = 'r'; //Updates all infectious to recovered, and keeps current recovered}if(today[x][y] == 's'){ // If the person is susceptible...for(int xCheck = x-1; xCheck <= x+1; xCheck++){ // Check all x coordinates around the personfor(int yCheck = y-1; yCheck <= y+1; yCheck++){ // Check all y coordinates around the personif(xCheck == x && yCheck == y){// Don't check at the person because there is no need to check there} else {if(xCheck >= 0 && yCheck >= 0 && xCheck < SIZE && yCheck < SIZE){ // Make sure the checked coordinates are in boundsif(today[xCheck][yCheck] == 'i'){ //Is the person at the checked coordinates infected?update[x][y] = 'i'; //If so, update the 's' to 'i' in the new grid}}}}}}}}for(int x = 0; x < SIZE; x++){for(int y = 0; y < SIZE; y++){today[x][y] = update[x][y]; //Updates today's grid with the new values}}}int countInfected(char arr[][SIZE], int arrSize){int count = 0;for(int x = 0; x < arrSize; x++){for(int y = 0; y < arrSize; y++){if(arr[x][y] == 'i') count++; //Increments count for each infected person in the grid}}return count;}
#include <iostream>using namespace std;int main() {int dataEntry;int arr[5];for(int i = 0; i < 5; i++) {cout << "Enter a number that you want to put into the array: ";cin >> dataEntry;arr[i] = dataEntry;}cout << endl;for(int i = 0; i < 5; i++) {cout << "Outputting array info at position " << i + 1 << ": " << arr[i] << endl;}for(int i=0;i<5;i++){for(int j=i+1;j<5;j++){if(arr[i]>arr[j]){int temp=arr[i];arr[i]=arr[j];arr[j]=temp;}}}cout << endl;for(int i = 0; i < 5; i++) {cout << "Outputting sorted array info at position " << i + 1 << ": " << arr[i] << endl;}return 0;}
//Get data file at https://codecatch.net/post.php?postID=91e87d73//Iteration 1 of Wing Project. Solution breaks down around n=35#include <iostream>#include <fstream>#include <string>#include <vector>#include <map>using namespace std;int getSum(map<int, int> list);void readData(map<int, float>* data);void lowestPrice();void findSums(int n, vector<map<int, int>>* sumsList, map<int, float>* data);//void findSum(map<int, int> currList, int x, int n, vector<map<int, int>>* sumsList);void findSum(map<int, int> currList, int x, int n, vector<map<int, int>>* sumsList, map<int, float>* data);float getPrice(map<int, int> set, map<int, float>* data);template <typename S>ostream& operator<<(ostream& os, const vector<S>& vector){// Printing all the elements using <<for (auto element : vector) {os << element << " ";}return os;}bool operator==(map<int, int> m1, map<int, int> m2){if(m1.size() != m2.size())return false;bool ret = true;for(auto it = m1.begin(); it !=m1.end() && ret; it++){if(ret && m1.count(it->first) != m2.count(it->first))ret = false;if(ret && m1.count(it->first) == 1){if(m1.at(it->first) != m2.at(it->first))ret = false;}}return ret;}int main(){map<int, float> data;readData(&data);vector<map<int, int>> *sumsList;sumsList = new vector<map<int, int>>;findSums(40, sumsList, &data);for(auto el : *sumsList){for(auto it = el.begin(); it != el.end(); it++){cout << it->first << "->" << it->second << " ";}cout << getPrice(el, &data) << endl;}return 0;}/* Returns the price of wings given a set of numbers of wings to buy.* Returns -1 if the set contains a number that is not possible to buy.*/float getPrice(map<int, int> set, map<int, float>* data){float price = 0;for(auto it = set.begin(); it != set.end(); it++){//If data doesn't contain an element of set, return -1if(data->count(it->first) == 0)return -1;price += data->at(it->first) * it->second; //pricePerPacket * qtyOfPackets}return price;}/* Adds the elements of list.* Suppose mapping is <num, qty>.* Returns sum(num*qty)*/int getSum(map<int, int> list){int sum = 0;for(auto it = list.begin(); it != list.end(); it++)sum += it->first * it->second;return sum;}void findSums(int n, vector<map<int, int>>* sumsList, map<int, float>* data){map<int, int> currList;//Recur when currSum < nauto it = data->begin();while(it->first <= n && it != data->end()){findSum(currList, it->first, n, sumsList, data);it++;}}void findSum(map<int, int> currList, int x, int n, vector<map<int, int>>* sumsList, map<int, float>* data){//Append x to currListif(currList.count(x) == 0)currList.emplace(x, 1);else{int val = 1+ currList.at(x);currList.erase(x);currList.emplace(x, val);}//Determine current sum, check for return casesint currSum = getSum(currList);if(currSum > n)return;else if(currSum == n){//Check to make sure no duplicatesfor(auto list : *sumsList){if(list == currList)return;}sumsList->push_back(currList);return;}//Recur when currSum < nauto it = data->begin();while(it->first <= n-x && it != data->end()){findSum(currList, it->first, n, sumsList, data);it++;}}void readData(map<int, float>* data){ifstream file ("./data", ifstream::in);if(file.is_open()){int i = 0;while(!file.eof()){float wings, price;string skipnl;file >> wings;file >> price;data->emplace(wings, price);getline(file, skipnl);i++;}}}
//From https://create.arduino.cc/projecthub/abhilashpatel121/easyfft-fast-fourier-transform-fft-for-arduino-9d2677#include <cmath>#include <iostream>const unsigned char sine_data[] = { //Quarter a sine wave0,4, 9, 13, 18, 22, 27, 31, 35, 40, 44,49, 53, 57, 62, 66, 70, 75, 79, 83, 87,91, 96, 100, 104, 108, 112, 116, 120, 124, 127,131, 135, 139, 143, 146, 150, 153, 157, 160, 164,167, 171, 174, 177, 180, 183, 186, 189, 192, 195, //Paste this at top of program198, 201, 204, 206, 209, 211, 214, 216, 219, 221,223, 225, 227, 229, 231, 233, 235, 236, 238, 240,241, 243, 244, 245, 246, 247, 248, 249, 250, 251,252, 253, 253, 254, 254, 254, 255, 255, 255, 255};float sine(int i){ //Inefficient sineint j=i;float out;while(j < 0) j = j + 360;while(j > 360) j = j - 360;if(j > -1 && j < 91) out = sine_data[j];else if(j > 90 && j < 181) out = sine_data[180 - j];else if(j > 180 && j < 271) out = -sine_data[j - 180];else if(j > 270 && j < 361) out = -sine_data[360 - j];return (out / 255);}float cosine(int i){ //Inefficient cosineint j = i;float out;while(j < 0) j = j + 360;while(j > 360) j = j - 360;if(j > -1 && j < 91) out = sine_data[90 - j];else if(j > 90 && j < 181) out = -sine_data[j - 90];else if(j > 180 && j < 271) out = -sine_data[270 - j];else if(j > 270 && j < 361) out = sine_data[j - 270];return (out / 255);}//Example data://-----------------------------FFT Function----------------------------------------------//float* FFT(int in[],unsigned int N,float Frequency){ //Result is highest frequencies in order of loudness. Needs to be deleted./*Code to perform FFT on arduino,setup:paste sine_data [91] at top of program [global variable], paste FFT function at end of programTerm:1. in[] : Data array,2. N : Number of sample (recommended sample size 2,4,8,16,32,64,128...)3. Frequency: sampling frequency required as input (Hz)If sample size is not in power of 2 it will be clipped to lower side of number.i.e, for 150 number of samples, code will consider first 128 sample, remaining sample will be omitted.For Arduino nano, FFT of more than 128 sample not possible due to mamory limitation (64 recomended)For higher Number of sample may arise Mamory related issue,Code by ABHILASHContact: [email protected]Documentation:https://www.instructables.com/member/abhilash_patel/instructables/2/3/2021: change data type of N from float to int for >=256 samples*/unsigned int sampleRates[13]={1,2,4,8,16,32,64,128,256,512,1024,2048};int a = N;int o;for(int i=0;i<12;i++){ //Snapping N to a sample rate in sampleRatesif(sampleRates[i]<=a){o = i;}}int in_ps[sampleRates[o]] = {}; //input for sequencingfloat out_r[sampleRates[o]] = {}; //real part of transformfloat out_im[sampleRates[o]] = {}; //imaginory part of transformint x = 0;int c1;int f;for(int b=0;b<o;b++){ // bit reversalc1 = sampleRates[b];f = sampleRates[o] / (c1 + c1);for(int j = 0;j < c1;j++){x = x + 1;in_ps[x]=in_ps[j]+f;}}for(int i=0;i<sampleRates[o];i++){ // update input array as per bit reverse orderif(in_ps[i]<a){out_r[i]=in[in_ps[i]];}if(in_ps[i]>a){out_r[i]=in[in_ps[i]-a];}}int i10,i11,n1;float e,c,s,tr,ti;for(int i=0;i<o;i++){ //ffti10 = sampleRates[i]; // overall values of sine/cosine :i11 = sampleRates[o] / sampleRates[i+1]; // loop with similar sine cosine:e = 360 / sampleRates[i+1];e = 0 - e;n1 = 0;for(int j=0;j<i10;j++){c=cosine(e*j);s=sine(e*j);n1=j;for(int k=0;k<i11;k++){tr = c*out_r[i10 + n1]-s*out_im[i10 + n1];ti = s*out_r[i10 + n1]+c*out_im[i10 + n1];out_r[n1 + i10] = out_r[n1]-tr;out_r[n1] = out_r[n1]+tr;out_im[n1 + i10] = out_im[n1]-ti;out_im[n1] = out_im[n1]+ti;n1 = n1+i10+i10;}}}/*for(int i=0;i<sampleRates[o];i++){std::cout << (out_r[i]);std::cout << ("\t"); // un comment to print RAW o/pstd::cout << (out_im[i]); std::cout << ("i");std::cout << std::endl;}*///---> here onward out_r contains amplitude and our_in conntains frequency (Hz)for(int i=0;i<sampleRates[o-1];i++){ // getting amplitude from compex numberout_r[i] = sqrt(out_r[i]*out_r[i]+out_im[i]*out_im[i]); // to increase the speed delete sqrtout_im[i] = i * Frequency / N;std::cout << (out_im[i]); std::cout << ("Hz");std::cout << ("\t"); // un comment to print freuency binstd::cout << (out_r[i]);std::cout << std::endl;}x = 0; // peak detectionfor(int i=1;i<sampleRates[o-1]-1;i++){if(out_r[i]>out_r[i-1] && out_r[i]>out_r[i+1]){in_ps[x] = i; //in_ps array used for storage of peak numberx = x + 1;}}s = 0;c = 0;for(int i=0;i<x;i++){ // re arraange as per magnitudefor(int j=c;j<x;j++){if(out_r[in_ps[i]]<out_r[in_ps[j]]){s=in_ps[i];in_ps[i]=in_ps[j];in_ps[j]=s;}}c=c+1;}float* f_peaks = new float[sampleRates[o]];for(int i=0;i<5;i++){ // updating f_peak array (global variable)with descending orderf_peaks[i]=out_im[in_ps[i]];}return f_peaks;}//------------------------------------------------------------------------------------////main.cppint data[64]={14, 30, 35, 34, 34, 40, 46, 45, 30, 4, -26, -48, -55, -49, -37,-28, -24, -22, -13, 6, 32, 55, 65, 57, 38, 17, 1, -6, -11, -19, -34,-51, -61, -56, -35, -7, 18, 32, 35, 34, 35, 41, 46, 43, 26, -2, -31, -50,-55, -47, -35, -27, -24, -21, -10, 11, 37, 58, 64, 55, 34, 13, -1, -7};int main(){const unsigned int SAMPLE_RATE = 48*1000; //48khzauto result = FFT(data,64,SAMPLE_RATE);std::cout << result[0] << " " << result[1] << " " << result[2] << " " << result[3] << std::endl;delete[] result;return 0;}
#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 <cmath>#include <string.h>using namespace std;int main() {string tickerName;int numOfContracts;float currentOptionValue;cout << "Enter a stock ticker: ";getline(cin, tickerName);cout << "Enter the current number of " << tickerName << " contracts you are holding: ";cin >> numOfContracts;cout << "Enter the current price of the option: ";cin >> currentOptionValue;cout << "The value of your " << tickerName << " options are: $" << (currentOptionValue * 100.00) * (numOfContracts);cout << endl;return 0;}