abc 276

Pankajcoder1 · Pankajcoder1 · commit 97318e335434 · 2022-11-05T19:35:37.000+05:30
diff --git a/Atcoder/ABC/abc276_A-Rightmost.cpp b/Atcoder/ABC/abc276_A-Rightmost.cpp
@@ -0,0 +1,48 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+
+int solve(){
+    string s;
+    cin>>s;
+    int ans=-1;
+    for(int i=0;i<s.size();i++){
+        if(s[i]=='a'){
+            ans=i+1;
+        }
+    }
+    cout<<ans<<endl;
+    return 0;
+}
+int main()
+{
+    long long testCase;
+    testCase=1;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/
diff --git a/Atcoder/ABC/abc276_B-Adjacency_List.cpp b/Atcoder/ABC/abc276_B-Adjacency_List.cpp
@@ -0,0 +1,63 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+int solve()
+{
+    int n, m;
+    cin >> n >> m;
+    vector<vector<int>> v(n + 1);
+    for (int i = 0; i < m; i++)
+    {
+        int a, b;
+        cin >> a >> b;
+        v[a].push_back(b);
+        v[b].push_back(a);
+    }
+    for (int i = 1; i <= n; i++)
+    {
+        cout << v[i].size() << " ";
+        sort(v[i].begin(), v[i].end());
+        if (v[i].size())
+        {
+            for (auto x : v[i])
+            {
+                cout << x << " ";
+            }
+        }
+        cout << endl;
+    }
+    return 0;
+}
+int main()
+{
+    long long testCase;
+    testCase = 1;
+
+    while (testCase--)
+    {
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+ * stuff you should look before submission
+ * constraint and time limit
+ * int overflow
+ * special test case (n=0||n=1||n=2)
+ * don't get stuck on one approach if you get wrong answer
+ */
diff --git a/Atcoder/ABC/abc276_C-Previous_Permutation.cpp b/Atcoder/ABC/abc276_C-Previous_Permutation.cpp
@@ -0,0 +1,50 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+
+int solve(){
+    int n;
+    cin>>n;
+    vector<int> v(n);
+    for(auto &x:v){
+        cin>>x;
+    }
+    prev_permutation(v.begin(),v.end());
+    for(auto x:v){
+        cout<<x<<" ";
+    }
+    return 0;
+}
+int main()
+{
+    long long testCase;
+    testCase = 1;
+
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/
diff --git a/Atcoder/ABC/abc276_D-Divide_by_2_or_3.cpp b/Atcoder/ABC/abc276_D-Divide_by_2_or_3.cpp
@@ -0,0 +1,73 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+
+int solve(){
+    int n;
+    cin>>n;
+    vector<int> v(n);
+    for(auto& x:v){
+        cin>>x;
+    }
+    int hcf=v[0];
+    for(int i=1;i<n;i++){
+        hcf=__gcd(hcf,v[i]);
+    }
+    int operation=0;
+    for(int i=0;i<n;i++){
+        if(v[i]%hcf){
+            cout<<-1<<endl;
+            return 0;
+        }
+        else{
+            int d=v[i]/hcf;
+            while(d%2==0){
+                d/=2;
+                operation++;
+            }
+            while(d%3==0){
+                d/=3;
+                operation++;
+            }
+            if(d!=1){
+                cout<<-1<<endl;
+                return 0;
+            }
+        }
+    }
+    cout<<operation<<endl;
+    return 0;
+}
+int main()
+{
+    long long testCase;
+    testCase = 1;
+
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/
diff --git a/Atcoder/ABC/abc276_E-Round_Trip.cpp b/Atcoder/ABC/abc276_E-Round_Trip.cpp
@@ -0,0 +1,91 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+int flag=0;
+int h,w;
+vector<vector<char>> grid;
+vector<vector<bool>> check;
+
+void dfs(int i,int j,int count){
+    if(i<0 || j<0 || i>=h || j>=w){
+        return;
+    }
+    if(check[i][j]==true){
+        return;
+    }
+    if(grid[i][j]=='#'){
+        return;
+    }
+    if(grid[i][j]=='S' && count>0){
+        flag+=(count>=4);
+        return;
+    }
+    check[i][j]=true;
+    dfs(i+1,j,count+1);
+    dfs(i-1,j,count+1);
+    dfs(i,j+1,count+1);
+    dfs(i,j-1,count+1);
+
+}
+
+int solve()
+{
+    cin>>h>>w;
+    int intialI = 0, intialJ = 0;
+
+    grid.resize(h,vector<char>(w));
+    check.resize(h,vector<bool>(w,false));
+
+    for(int i=0;i<h;i++){
+        for(int j=0;j<w;j++){
+            cin>>grid[i][j];
+            if(grid[i][j]=='S'){
+                intialI = i;
+                intialJ = j;
+            }
+        }
+    }
+    dfs(intialI+1,intialJ,1);
+    dfs(intialI-1,intialJ,1);
+    dfs(intialI,intialJ+1,1);
+    dfs(intialI,intialJ-1,1);
+    if(flag){
+        cout<<"Yes"<<endl;
+    }
+    else{
+        cout<<"No"<<endl;
+    }
+    return 0;
+}
+int main()
+{
+    long long testCase;
+    testCase = 1;
+
+    while (testCase--)
+    {
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+ * stuff you should look before submission
+ * constraint and time limit
+ * int overflow
+ * special test case (n=0||n=1||n=2)
+ * don't get stuck on one approach if you get wrong answer
+ */
diff --git a/Codeforces/After Placement/1747A-Two_Groups.cpp b/Codeforces/After Placement/1747A-Two_Groups.cpp
@@ -0,0 +1,48 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+
+int solve(){
+    int n;
+    cin>>n;
+    long long sum=0;
+    for(int i=0;i<n;i++){
+        long long temp;
+        cin>>temp;
+        sum+=temp;
+    }
+    cout<<abs(sum)<<endl;
+    return 0;
+}
+int main()
+{
+    long long testCase;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/
diff --git a/Codeforces/After Placement/1747B-BAN_BAN.cpp b/Codeforces/After Placement/1747B-BAN_BAN.cpp
