Skip to content

Commit cda3b68

Browse files
committed
a2oj added
1 parent a9ee9b2 commit cda3b68

5 files changed

+121
-0
lines changed

A2OJ/A/036. Laptops.cpp

+23
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
#include <bits/stdc++.h>
2+
#define lli long long int
3+
#define endl "\n"
4+
using namespace std;
5+
6+
int main() {
7+
8+
int n,p1,p2,flag =0;
9+
cin>>n;
10+
for (int i = 0; i<n; i++)
11+
{
12+
cin>>p1>>p2;
13+
if (p1 != p2)
14+
{
15+
cout << "Happy Alex";
16+
flag = 1;
17+
break;
18+
}
19+
}
20+
if(flag == 0)
21+
cout << "Poor Alex";
22+
return 0;
23+
}

A2OJ/A/037. Soft Drinking.cpp

+16
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
#include <bits/stdc++.h>
2+
#define lli long long int
3+
#define endl "\n"
4+
using namespace std;
5+
6+
int main()
7+
{
8+
int n, k, l, c, d, p, nl, np;
9+
cin>>n>>k>>l>>c>>d>>p>>nl>>np;
10+
int maxdrink = (k*l)/nl;
11+
int maxslice = (c*d);
12+
int maxsalt = p/np;
13+
cout<<min(maxsalt, min(maxslice, maxdrink))/n;
14+
15+
return 0;
16+
}

A2OJ/A/038. Playing with Dice.cpp

+23
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
#include <bits/stdc++.h>
2+
#define lli long long int
3+
#define endl "\n"
4+
using namespace std;
5+
6+
int main()
7+
{
8+
int ch1, ch2;
9+
cin>>ch1>>ch2;
10+
int win1 = 0, tie = 0, win2 = 0;
11+
for(int i=1; i<=6; i++)
12+
{
13+
if(abs(ch1-i) < abs(ch2-i))
14+
win1++;
15+
else if(abs(ch1-i) > abs(ch2-i))
16+
win2++;
17+
else
18+
tie++;
19+
}
20+
cout<<win1<<" "<<tie<<" "<<win2;
21+
22+
return 0;
23+
}

A2OJ/A/039. Minimum Difficulty.cpp

+26
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
#include <bits/stdc++.h>
2+
#define lli long long int
3+
#define endl "\n"
4+
using namespace std;
5+
6+
int main()
7+
{
8+
int n;
9+
cin>>n;
10+
int a[n];
11+
vector <int> diff;
12+
for(int i=0; i<n; i++)
13+
{
14+
cin>>a[i];
15+
if(i != 0)
16+
diff.push_back(a[i]-a[i-1]);
17+
}
18+
int maxi = *max_element(diff.begin(), diff.end());
19+
int ans = INT_MAX;
20+
for(int i=1; i<n-1; i++)
21+
{
22+
ans = max(maxi, min(ans, diff[i] + diff[i-1]));
23+
}
24+
cout<<ans;
25+
return 0;
26+
}

A2OJ/A/040. Greg's Workout.cpp

+33
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
#include <bits/stdc++.h>
2+
#define lli long long int
3+
#define endl "\n"
4+
using namespace std;
5+
6+
int main()
7+
{
8+
int n;
9+
cin>>n;
10+
int chest = 0, bicep = 0, back = 0;
11+
for(int i=1; i<=n; i++)
12+
{
13+
int data;
14+
cin>>data;
15+
if(i%3 == 0)
16+
back += data;
17+
else if(i%3 == 1)
18+
chest += data;
19+
else
20+
bicep += data;
21+
}
22+
//cout<<chest<<" "<<bicep<<" "<<back<<endl;
23+
if((chest > bicep) and (chest >back))
24+
cout<<"chest";
25+
else if((chest < bicep) and (bicep >back))
26+
cout<<"biceps";
27+
else
28+
cout<<"back";
29+
30+
31+
32+
return 0;
33+
}

0 commit comments

Comments
 (0)