Skip to content

Commit 63a336f

Browse files
Solution
1 parent 8017777 commit 63a336f

File tree

2 files changed

+77
-0
lines changed

2 files changed

+77
-0
lines changed

Diff for: ContainsDupilcates.cpp

+36
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
#include<iostream>
2+
#include<vector>
3+
4+
using namespace std;
5+
6+
bool containsDuplicates(vector<int> a) {
7+
int count = 0;
8+
for(int i=0;i<a.size();i++){
9+
for(int j=i;j<a.size();j++){
10+
if(a[i] == a[j+1])
11+
count++;
12+
}
13+
if(count > 0)
14+
break;
15+
}
16+
bool flag = 0;
17+
if(count >= 1)
18+
flag = true;
19+
else
20+
flag = false;
21+
22+
return flag;
23+
}
24+
25+
int main(){
26+
int size;
27+
cin>>size;
28+
vector<int> vec;
29+
int val;
30+
for(int i=0;i<size;i++){
31+
cin>>val;
32+
vec.push_back(val);
33+
}
34+
cout<<containsDuplicates(vec);
35+
return 0;
36+
}

Diff for: PhoneCall.cpp

+41
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,41 @@
1+
#include<iostream>
2+
3+
using namespace std;
4+
5+
int phoneCall(int min1, int min2_10, int min11, int s) {
6+
int count = 0,count1 = 0;
7+
if(s-min1>=0){
8+
count++;
9+
s = s - min1;
10+
}
11+
for(int i=0;i<9;i++){
12+
count1++;
13+
if(s - min2_10 >= 0){
14+
count++;
15+
s = s - min2_10;
16+
}
17+
else
18+
break;
19+
}
20+
if(count1 == 9){
21+
while(1){
22+
if(s-min11>=0){
23+
count++;
24+
s = s-min11;
25+
}else
26+
break;
27+
}
28+
}
29+
30+
31+
32+
33+
return count;
34+
}
35+
36+
int main(){
37+
int minu1,minu2_10,min11,total;
38+
cin>>minu1>>minu2_10>>min11>>total;
39+
cout<<phoneCall(minu1,minu2_10,min11,total);
40+
return 0;
41+
}

0 commit comments

Comments
 (0)