a2oj added

Author: kothariji

A2OJ/A/031. Cakeminator.cpp

@@ -0,0 +1,73 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+	int n, m;
+	cin>>n>>m;
+	int a[n][m],flag =0;
+	string s[n];
+	for(int i=0; i<n; i++)
+		cin>>s[i];
+	for(int i=0; i<n; i++)
+	{
+		for(int j=0; j<m; j++)
+		{
+			if(s[i][j] == '.')
+				a[i][j] = 0;
+			else
+				a[i][j]= -1;
+		}
+	}
+	for(int i=0; i<n; i++)
+	{
+		flag =0;
+		for(int j=0; j<m; j++)
+		{
+			if(a[i][j] == -1)
+			{
+				flag =1;
+				break;
+			}
+		}
+		if(flag == 0)
+		{
+			for(int j=0; j<m; j++)
+			{
+				a[i][j] = 1;
+			}
+		}
+	}
+	for(int j=0; j<m; j++)
+	{
+		flag =0;
+		for(int i=0; i<n; i++)
+		{
+			if(a[i][j] == -1)
+			{
+				flag =1;
+				break;
+			}
+		}
+		if(flag == 0)
+		{
+			for(int i=0; i<n; i++)
+			{
+				a[i][j] = 1;
+			}
+		}
+	}
+	int count = 0;
+	for(int i=0; i<n; i++)
+	{
+		for(int j=0; j<m; j++)
+		{
+			if((a[i][j] == 1))
+				count++;
+		}
+	}
+	cout<<count;
+	return 0;
+}

A2OJ/A/032. Valera and Antique Items.cpp

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+	lli n,v,cost,ans = 0;
+	cin>>n>>v;
+	vector <int> v1;
+	int k,flag;
+	for(int i =0; i<n; i++)
+	{
+		cin>>k;
+		flag = 0;
+		for(int j = 1; j<= k; j++)
+		{
+			cin>>cost;
+			if(cost < v)
+				flag = 1;
+		}
+		if(flag == 1)
+		{
+			v1.push_back(i+1);
+			ans += 1;
+		}
+	} 
+	cout<<ans<<endl;
+	for(auto c: v1)
+		cout<<c<<" ";
+
+	return 0;
+}

A2OJ/A/033. Appleman and Easy Task.cpp

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+	int n,flag =0;
+	cin>>n;
+	string a[n];
+	for(int i=0; i<n; i++)
+		cin>>a[i];
+	for(int i=0 ;i<n; i++)
+	{
+		int count = 0;
+		for(int j=0; j<n; j++)
+		{
+			if((i-1 >= 0) and (a[i-1][j] == 'o')){
+				count++;
+				//cout<<"YES1"<<end;
+			}
+			if((i+1 < n) and (a[i+1][j] == 'o')){
+				count++;
+				//cout<<"YES2"<<end;
+			}
+			if((j-1 >= 0) and (a[i][j-1] == 'o')){
+				count++;
+				//cout<<"YES3"<<end;
+			}
+			if((j+1 < n) and (a[i][j+1] == 'o')){
+				count++;
+				//cout<<"YES4"<<end;
+			}
+			if((count %2) != 0)
+			{
+				flag =1;
+				break;
+			}
+		}
+		if(flag == 1)
+			break;
+		
+	}
+	if(flag == 0)
+		cout<<"YES";
+	else
+		cout<<"NO";
+
+
+	return 0;
+}

A2OJ/A/034. Bear and Raspberry.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+	int n,c;
+	cin>>n>>c;
+	int a[n];
+	for(int i=0; i<n; i++)
+		cin>>a[i];
+	int maxi = 0;
+	for(int i=0; i<n-1; i++)
+	{
+		int left = a[i] - c;
+		if(left >= a[i+1])
+		{
+			int profit = left - a[i+1];
+			if(profit > maxi)
+				maxi = profit;
+		}
+	}
+	cout<<maxi;
+
+	return 0;
+}

A2OJ/A/035. Lunch Rush.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+	lli n,k,data1,data2, maxjoy = INT_MIN;
+	cin>>n>>k;
+	vector <lli> f,t;
+	for(int i=0; i<n; i++)
+	{
+		cin>>data1>>data2;
+		lli joy;
+		if(data2 <= k)
+			joy = data1;
+		else
+			joy = data1 - (data2-k);
+		if(joy> maxjoy)
+			maxjoy = joy;
+	}
+	cout<<maxjoy;
+	
+
+	return 0;
+}