hacktoberfest2021_CP/Algorithms/Diagnolmatrix.cpp at 60566e76f4e6b4d5a2bac849df0cd2333c1fb94f · coder025/hacktoberfest2021_CP · 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
#include<iostream>
using namespace std;

class Diagnol
{
private:
    int *A;
    int n;
public:
    Diagnol()
    {
        n=2;
        A=new int[2];
    }
    Diagnol(int n)
    {
        this->n=n;
        A=new int[n];
    }
    ~Diagnol()
    {
        delete []A;
    }
    void Set(int i, int j,int x);
    int Get(int i, int j);
    void Display();
};

void Diagnol::Set(int i, int j,int x)
{
    if(i==j)
      A[i-1]=x;
}

int Diagnol::Get(int i, int j)
{
    if(i==j)
      return A[i-1];
    else
      return 0;
}

void Diagnol::Display()
{
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if(i==j)
               cout<<A[i]<<" ";
            else
            {
                cout<<"0 ";
            }

        }
        cout<<endl;

    }

}


int main()
{
    Diagnol d(4);
    d.Set(1,1,5);
    d.Set(2,2,8);
    d.Set(3,3,9);
    d.Set(4,4,12);

    d.Display();
    return 0;
}