Solved questions on december algorithms

December-01/C++_AminulIslam254.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long long ll;
+
+ll fun1(vector<string> s)
+{
+    ll i,count1=0;
+    char j;
+    ll n=s.size();
+    ll a[26]={0};
+    for(i=0;i<n;i++)
+    {
+        string temp1=s[i];
+        for(j='a';j<='z';j++)
+        {
+            if(temp1.find(j)!=string::npos)
+            {
+                a[j-'a']++;
+            }
+        }
+    }
+    for(i=0;i<26;i++)
+    {
+        if(a[i]==n)
+        {
+            count1++;
+        }
+    }
+    return count1;
+}
+
+int main()
+{
+    vector<string> s;
+    int i,n;
+    cout<< "Enter the no of elements"<<endl;cin>>n;
+    cout<< "Enter the elements"<<endl;
+    for(i=0;i<n;i++)
+    {
+        string temp1;
+        cin>>temp1;
+        s.push_back(temp1);
+    }
+    cout<<fun1(s)<<endl;
+
+    return 0;
+}

December-02/C++_AminulIslam254.cpp

@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long long ll;
+
+bool fun1(ll n)
+{
+    unordered_set<ll> s1;
+    while(1)
+    {
+        ll temp1=0;
+        while(n)
+        {
+            temp1+=((n%10)*(n%10));
+            n/=10;
+        }
+        if(temp1==1)
+        {
+            return true;
+        }
+        if(s1.count(temp1))
+        {
+            return false;
+        }
+        s1.insert(temp1);
+        n=temp1;
+    }
+}
+
+int main()
+{
+    ll n;
+    cout<< "Enter the element"<<endl;
+    cin>>n;
+    if(fun1(n))
+    {
+        cout<< "YES"<<endl;
+    }
+    else
+    {
+        cout<< "NO" <<endl;
+    }
+
+    return 0;
+}

December-03/C++_AminulIslam254.cpp

@@ -0,0 +1,66 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long long ll;
+
+
+int fun1(vector<vector<char>> a,string s,string name,ll i,ll j,ll r,ll c)
+{
+    if(s.length()>name.length())
+    {
+        return 0;
+    }
+    if(i>=r)
+    {
+        return 0;
+    }
+    if(j>=c)
+    {
+        return 0;
+    }
+    if(s==name)
+    {
+        return 1;
+    }
+    int m1=(fun1(a,s+a[i][j],name,i,j+1,r,c));
+    int m2=(fun1(a,s,name,i+1,j,r,c));
+    int m3=(fun1(a,s,name,i,j+1,r,c));
+    int m4=(fun1(a,s+a[i][j],name,i+1,j,r,c));
+    return m1+m2+m3+m4;
+}
+
+int main()
+{
+    ll r,c;
+    cout<< "Enter the no of rows"<<endl;
+    cin>>r;
+    cout<< "Enter the no of coloumns"<<endl;
+    cin>>c;
+    vector<vector<char>>a;
+    ll i,j;
+    cout<< "Enter elements"<<endl;
+    for(i=0;i<r;i++)
+    {
+        vector<char>temp1;
+        for(j=0;j<c;j++)
+        {
+            char c; cin>>c;
+            temp1.push_back(c);
+        }
+        a.push_back(temp1);
+    }
+    string s="";
+    string name;
+    cout<< "Enter name"<<endl;
+    cin>>name;
+    if(fun1(a,s,name,0,0,r,c))
+    {
+        cout<< "YES"<<endl;
+    }
+    else
+    {
+        cout<< "NO" <<endl;
+    }
+    return 0;
+}

December-05/C++_AminulIslam254.cpp

@@ -0,0 +1,68 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long long ll;
+
+int main()
+{
+    ll n1,n2,i;
+    cout<< "Enter the no of customers"<<endl;
+    cin>>n1;
+    cout<< "Enter the no of biscuits"<<endl;
+    cin>>n2;
+    queue<ll> customers,biscuits;
+    cout<< "Enter the customers preferances"<<endl;
+    for(i=0;i<n1;i++)
+    {
+        ll var;cin>>var;
+        customers.push(var);
+    }
+    cout<< "Enter the biscuits types"<<endl;
+    for(i=0;i<n2;i++)
+    {
+        ll var;cin>>var;
+        biscuits.push(var);
+    }
+
+    ll ans=0;
+    while(!customers.empty())
+    {
+        if(customers.front()==biscuits.front())
+        {
+            customers.pop();
+            biscuits.pop();
+        }
+        else
+        {
+            queue<ll> temp1=customers;
+            bool flag=false;
+            while(!temp1.empty())
+            {
+                if(temp1.front()==biscuits.front())
+                {
+                    flag=true;
+                    break;
+                }
+                temp1.pop();
+            }
+            if(flag)
+            {
+                customers.push(customers.front());
+                customers.pop();
+            }
+            else
+            {
+                break;
+            }
+
+        }
+    }
+    if(!customers.empty())
+    {
+        ans+=customers.size();
+    }
+    cout<<ans<<endl;
+
+    return 0;
+}

December-06/C++_AminulIslam254.cpp

@@ -0,0 +1,87 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long long ll;
+
+int main()
+{
+    string s; cin>>s;
+    vector<ll> posu;
+    vector<ll> post;
+    ll i;
+    for(i=0;i<s.length();i++)
+    {
+        if(s[i]=='U')
+        {
+            posu.push_back(i);
+        }
+        else
+        {
+            post.push_back(i);
+        }
+    }
+    ll ans=0,j;
+    if(post.size()<=posu.size())
+    {
+        ll ind=posu[0];
+        bool flag=false;
+        for(i=0;i<posu.size();i++)
+        {
+            if(ind!=posu[i])
+            {
+                ll back1=posu.back();
+                swap(s[ind],s[back1]);
+                post.push_back(back1);
+                sort(post.begin(),post.end());
+                for(j=post[0];j<post.size()-1;j++)
+                {
+                    if((post[j]+1)!=post[j+1])
+                    {
+                        flag=true;
+                        break;
+                    }
+                }
+                ans++;
+                if(!flag)
+                {
+                    break;
+                }
+                flag=false;
+            }
+            ind++;
+        }
+    }
+    else
+    {
+        ll ind=post[0];
+        bool flag=false;
+        for(i=0;i<post.size();i++)
+        {
+            if(ind!=post[i])
+            {
+                ll back1=post.back();
+                swap(s[ind],s[back1]);
+                posu.push_back(back1);
+                sort(posu.begin(),posu.end());
+                for(j=posu[0];j<posu.size()-1;j++)
+                {
+                    if((posu[j]+1)!=posu[j+1])
+                    {
+                        flag=true;
+                        break;
+                    }
+                }
+                ans++;
+                if(!flag)
+                {
+                    break;
+                }
+                flag=false;
+            }
+            ind++;
+        }
+    }
+    cout<<ans<<endl;
+    return 0;
+}

December-07/C++_AminulIslam254.cpp

@@ -0,0 +1,58 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long long ll;
+
+int main()
+{
+    ll n;
+    cout<< "Enter the no of buildings"<<endl;
+    cin>>n;
+    ll a[n][6],i,j;
+    cout<< "Enter coordinates"<<endl;
+    for(i=0;i<n;i++)
+    {
+        for(j=0;j<6;j++)
+        {
+            cin>>a[i][j];
+        }
+    }
+    ll num,k;
+    cout<< "Enter the no of jet planes"<<endl;
+    cin>>num;
+    ll store1=0;
+    for(k=0;k<num;k++)
+    {
+        cout<< "Enter axis either x or y"<<endl;
+        char c; cin>>c;
+        cout<< "Enter axis number for x or y"<<endl;
+        ll axisnum;cin>>axisnum;
+        for(i=0;i<n;i++)
+        {
+            bool issmall=false;
+            bool isbig=false;
+            if(c=='x') j=0;
+            if(c=='y') j=1;
+            for(;j<6;j+=2)
+            {
+                if(a[i][j]<axisnum)
+                {
+                    issmall=true;
+                }
+                else if(a[i][j]>axisnum)
+                {
+                    isbig=true;
+                }
+            }
+            if(issmall && isbig)
+            {
+                store1++;
+            }
+        }
+        cout<<store1<<endl;
+        store1=0;
+    }
+
+    return 0;
+}