How to count how many (3, 10 appears in data?
I have done a little bit programming but abnormal program.
(3 , 10)
(3 , 31)
(3 , 51)
(3 , 71)
(3 , 78)
(3 , 97)
(3 , 105)
(3 , 113)
(3 , 135)
(3 , 138)
(3 , 9)
(3 , 30)
(3 , 50)
(3 , 71)
(3 , 77)
(3 , 97)
(3 , 106)
(3 , 112)
(3 , 135)
(3 , 138)
(3 , 10)
(3 , 31)
(3 , 51)
(3 , 71)
(3 , 78)
(3 , 97)
(3 , 106)
(3 , 113)
(3 , 135)
(3 , 138)
(3 , 15)
(3 , 36)
(3 , 56)
(3 , 71)
(3 , 83)
(3 , 97)
(3 , 105)
(3 , 118)
(3 , 135)
(3 , 138)
(3 , 15)
(3 , 36)
(3 , 56)
(3 , 71)
(3 , 83)
(3 , 97)
(3 , 106)
(3 , 118)
(3 , 135)
(3 , 138)
(3 , 10)
(3 , 31)
(3 , 51)
(3 , 71)
(3 , 78)
(3 , 97)
(3 , 106)
(3 , 113)
(3 , 135)
(3 , 138)
int mycount;
int k;
int myints[] = {students.at (i).examcode.at(0),students.at(i).examcode.at(k)};
mycount = (int) count (myints, myints+12, 1);
for ( int i = 0 ; i < students.size (); i++ )
for ( int k = 0+1;k<students.at(i).examcode.size(); k++ )
cout << "1" << mycount <<" \n";