a2oj added

Author: kothariji

A2OJ/A/071. Eugeny and Array.cpp

@@ -0,0 +1,27 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n, m, a, l, r, c(0), d(0);
+    scanf("%d%d", &n, &m);
+    while (n--)
+    {
+        scanf("%d", &a);
+        if (a == 1)
+        {
+            c += 1;
+        }
+        else
+        {
+            d += 1;
+        }
+    }
+    int up = min(c, d) * 2;
+    while (m--)
+    {
+        scanf("%d%d", &l, &r);
+        printf((r - l) % 2 == 1 && r - l < up ? "1\n" : "0\n");
+    }
+    return 0;
+}

A2OJ/A/072. Dima and Continuous Line.cpp

@@ -0,0 +1,30 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main ()
+{
+    int n,x,y;
+    int i,j;
+    cin>>n;
+    int a[n];
+    for(i=0;i<n;i++)
+    cin>>a[i];
+    for(i=0;i<n-2;i++)
+    {
+        x=y=0;
+        for(j=i+2;j<n;j++)
+        {
+            if((a[j]>a[i]&&a[j]>a[i+1])||(a[j]<a[i]&&a[j]<a[i+1]))
+                x++;
+            else
+                y++;
+        }
+        if(x&&y)
+        {
+            cout<<"yes";
+            return 0;
+        }
+    }
+cout<<"no";
+return 0;
+}

A2OJ/A/073. Reconnaissance 2.cpp

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+ 
+int main()
+{
+	int n;
+	cin>>n;
+	int a[n];
+	for(int i=0; i<n;i++)
+		cin>>a[i];
+	int mindiff = INT_MAX;
+	int x,y;
+	for(int i=0; i<n-1;i++)
+	{
+		if(abs(a[i] - a[i+1]) < mindiff)
+		{
+			mindiff = abs(a[i] - a[i+1]);
+			x = i+1;
+			y = i+1+1;
+		}
+	}
+	if(abs(a[0] - a[n-1]) < mindiff)
+		{
+			mindiff = abs(a[0] - a[n-1]);
+			x = 1;
+			y = n;
+		}
+	cout<<x<<" "<<y;	
+	
+	return 0;
+}

A2OJ/A/074. Help Vasilisa the Wise 2.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+ 
+int main()
+{
+	int a , b, c,d;
+	int c1,c2,r1,r2,d1,d2;
+	cin>>r1>>r2>>c1>>c2>>d1>>d2;
+	for(a = 1 ; a<=9 ; a++)
+	{
+		for(b = 1; b<=9; b++)
+		{
+			for(c= 1; c<=9; c++)
+			{
+				for(d = 1; d<=9; d++)
+				{
+					if((r1 == (a+b)) and (r2 == (c+d)) and (c1 == (a+c)) and (c2 == (b+d)) and (d1 == (a+d)) and (d2 == (b+c)))
+					{
+						cout<<a<<" "<<b<<endl;
+						cout<<c<<" "<<d<<endl;
+						return 0;
+					}
+				}
+			}
+		}
+	}
+	
+	return 0;
+}

A2OJ/A/075. Comparing Strings.cpp

@@ -0,0 +1,46 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    string s1,s2;
+    cin>>s1>>s2;
+    int i=0;
+    if(s1.length() != s2.length())
+    {
+        cout<<"NO";
+        return 0;
+    }
+    int err = 0,er1 = -1,er2;
+    while(i < (s1.length()))
+    {
+        if(s1[i] != s2[i])
+        {
+            err++;
+            if(er1 != -1)
+                er2 = i;
+            else
+                er1 = i;
+        }
+        if(err > 2)
+        {
+            cout<<"NO";
+            return 0;   
+        }
+        i++;
+    }
+    if(err == 0)
+        cout<<"YES";    
+    else if (err == 1)
+        cout<<"NO";
+    else
+    {
+        if((s1[er1] == s2[er2]) and (s1[er2] == s2[er1]))
+            cout<<"YES";
+        else
+            cout<<"NO";   
+    }
+    
+    return 0;
+
+}