Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
36 changes: 36 additions & 0 deletions multilevelinheritance.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

class Triangle{
public:
void triangle(){
cout<<"I am a triangle\n";
}
};

class Isosceles : public Triangle{
public:
void isosceles(){
cout<<"I am an isosceles triangle\n";
}
};

//Write your code here.
class Equilateral : public Isosceles{
public:
void equilateral(){
cout<<"I am an equilateral triangle\n";
}
};
int main(){

Equilateral eqr;
eqr.equilateral();
eqr.isosceles();
eqr.triangle();
return 0;
}
23 changes: 23 additions & 0 deletions pointer.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
#include <stdio.h>

void update(int *a,int *b) {
int p,q;
p = *a+*b;
q = *a-*b;
if(q<0){
q*=-1;
}
*a=p;
*b=q;
}

int main() {
int a, b;
int *pa = &a, *pb = &b;

scanf("%d %d", &a, &b);
update(pa, pb);
printf("%d\n%d", a, b);

return 0;
}
37 changes: 37 additions & 0 deletions sets.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;


int main() {
set<int> s;
int i, n, q, a, b;
set<int>::iterator j;
cin>>q;
for(i=0;i<q;i++){
cin>>a>>b;
if(a==1){
s.insert(b);
}
else if(a==2){
s.erase(b);
}
else{
j = s.find(b);
if(j==s.end()){
cout<<"No"<<endl;
}
else {
cout<<"Yes"<<endl;
}
}
}
return 0;
}



30 changes: 30 additions & 0 deletions variablesizedarray.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int n;
int q;
cin >> n >> q;
vector<int> a[n];
for(int i = 0; i < n; i++){
int m;
cin >> m;
int o;
for(int j = 0; j < m; j++){
cin >> o;
a[i].push_back(o);
}
}
int r, s;
for(int k = 1; k <= q; k++){
cin >> r >> s;
cout << a[r][s] << endl;
}
return 0;
}