codeforces 1749

Author: Pankajcoder1

Codeforces/After Placement/1749A-Cowardly_Rooks.cpp

@@ -0,0 +1,62 @@
+/*
+    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;
+    map<int,int> row,col;
+    for(int i=0;i<m;i++){
+        int a,b;
+        cin>>a>>b;
+        row[a]++;
+        col[b]++;
+    }
+    int countR=0,countC=0;
+    for(int i=1;i<=n;i++){
+        if(row[i]==0)
+            countR++;
+        if(col[i]==0)
+            countC++;
+    }
+    if (countR && countC)
+    {
+        cout<<"YES"<<endl;
+    }
+    else{
+        cout<<"NO"<<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
+*/

Codeforces/After Placement/1749B-Death's_Blessing.cpp

@@ -0,0 +1,54 @@
+/*
+    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<pair<ll,ll>> v(n);
+    ll ans=0;
+    for(int i=0;i<n;i++){
+        cin>>v[i].second;
+        ans+=v[i].second;
+    }
+    for(int i=0;i<n;i++){
+        cin>>v[i].first;
+        ans+=v[i].first;
+    }
+    sort(v.begin(),v.end());
+    ans-=v[n-1].first;
+    cout<<ans<<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
+*/

LeetCode/1137.N-th_Tribonacci_Number.cpp

@@ -0,0 +1,55 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+/*  --------------------MAIN PROGRAM----------------------------*/
+// to run ctrl+b
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+// Experience :
+// Cp is nothing but only observation and mathematics.
+
+
+//Add main code here
+
+class Solution
+{
+public:
+    int tribonacci(int n)
+    {
+        vector<int> dp(n+1,0);
+        dp[0]=0;
+        if(n==0)
+            return dp[0];
+        dp[1]=1;
+        if(n==1)
+            return dp[1];
+        dp[2]=1;
+        for(int i=3;i<=n;i++){
+            dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
+        }
+        return dp[n];
+    }
+};
+
+/* -----------------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
+*/

LeetCode/70.Climbing_Stairs.cpp

@@ -9,7 +9,6 @@ class Solution {
         else
         {
             vector<int> dp(n+1,0);
-            dp[0]=0;
             dp[1]=1;
             dp[2]=2;
             for(int i=3;i<=n;i++)