q2
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354
#include <iostream>
#include <cmath>
using namespace std;
void printStars(int n) {
for(int i=0;i < n;i++) {
cout << "*";
}
cout << endl;
}
void binning(int *array,int r){
if(r < 10)
array[r] ++;
else
array[9] ++;
}
int main() {
int array1[10]={0};
int array2[10]={0};
int N;
cin >> N;//input N
srand(time(NULL));
for(int n=0;n<N;n++){
double r = ((double)rand())/(RAND_MAX);
double r1 = ((double)rand())/(RAND_MAX);
double r2 = ((double)rand())/(RAND_MAX);
double r3 = (r1+r2)*0.5;
r = floor(r*10);
r3 =floor(r3*10);
//cout << r << endl;
binning(array1,r);
binning(array2,r3);
}
cout<<"uniform distribution:"<<endl;
for(int n=0;n<10;n++){
//cout << array1[n] <<endl;
printStars((int)floor(100*array1[n]/N));
}
cout<<"triangular distribution:"<<endl;
for(int n=0;n<10;n++){
//cout << array2[n] <<endl;
printStars((int)floor(100*array2[n]/N));
}
return 0;
}
Cpp
INFO