/* To find a working Algorithmus is one thing. The other thing is to output the result well. This challenge is devided in two tasks: First write a code that adds the sum of two dices. Store the results of 200 throws in a list. After that output the frequency of the sums from 2 to 12 in a well designed ASCII chart. It should show a gaussian bell curve. Here is a code sample. I am sure, you can do much better. https://code.sololearn.com/c6Af408Yxiuz/?ref=app https://www.sololearn.com/post/220541/?ref=app */ #include #include #include #include #include #include #include using namespace std; int main() { random_device rd; mt19937 emt(rd()); std::uniform_int_distribution<> dist(1,6); map hist; cout << "Dice Sum: \n" << "[" << setw(2) << right; for (int n = 0; n < 200; ++n) { int sum = dist(emt)+dist(emt); cout << sum << ", "; ++hist[sum]; } cout << "]\n\n"; int maxfr=0; for (auto&&[num,freq] : hist) { if(maxfr < freq) maxfr = freq; cout << setw(2) << right << num << ": " << string(freq,'#') << '\n'; } cout << "\n\n"; // setup for vertical display auto maxf = max_element(begin(hist), end(hist), [](auto p1, auto p2){ return p1.secondsecond; vector graphps(11); for(int i=0,j=2; i<11; i++,j++){ graphps[i]=string(maxf-hist[j],' ')+string(hist[j],'#'); } for(int i=0;i

[Challenge] Gaussian_dice_roll_curve.cpp