oops-/op2.cpp at master · Raushan-Shahi/oops- · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
// practice of nesting of member function
// not working properly

#include <iostream>
#include <string>
using namespace std;

class mnitstud
{
    int x, m[4];
    string s;
    friend  mnitstud result(mnitstud o);

public:
    void getmarks();
    void getdetails();
};

void mnitstud ::getmarks()
{
    cout << "enter the marks of following subject:" << endl;
    cout << "maths: ";
    cin >> m[0];
    cout << "\nBME: ";
    cin >> m[1];
    cout << "\nCSP: ";
    cin >> m[2];
    cout << "\nEco: ";
    cin >> m[3];
}

void mnitstud ::getdetails()
{
    cout << "enter your student id: " << endl;
    cin >> x;
    cout << "enter your name: " << endl;
    cin >> s;
}

mnitstud result(mnitstud o)
{
    int flag = 0;
    for (int i = 0; i < 4; i++)
    {
        if ((i == 0) && (o.m[0] < 33))
        {
            cout << "the student failed in maths." << endl;
            flag = 1;
        }
        else if ((i == 1) && (o.m[1] < 33))
        {
            cout << "the student failed in BME." << endl;
            flag = 1;
        }
        else if ((i == 2) && (o.m[2] < 33))
        {
            cout << "the student failed in CSP." << endl;
            flag = 1;
        }
        else if ((i == 3) && (o.m[3] < 33))
        {
            cout << "the student failed in Eco." << endl;
            flag = 1;
        }
        else if (flag == 0)
        {
            cout << "the student passed in all subjects." << endl;
            flag = 1;
        }
    }
}

int main()
{
    int n, i;
    cout << "enter the number of students in the class: " << endl;
    cin >> n;
    mnitstud obj[n];

    for (i = 0; i < n; i++)
    {
        obj[i].getdetails();
        obj[i].getmarks();
        result(obj[i]);
    }
    return 0;
}