cf: add 2008 A,B,C

Author: Pankajcoder1

Codeforces/After Placement/2008A.Sakurako's Exam.cpp

@@ -0,0 +1,34 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int a,b;
+    cin>>a>>b;
+    b=b%2;
+    if(b==0 && a%2==0){
+        cout<<"YES"<<endl;
+    }
+    else if(b==1 && a%2==0 && a!=0){
+        cout<<"YES"<<endl;
+    }
+    else{
+        cout<<"NO"<<endl;
+    }
+        
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/2008B.Square or Not.cpp

@@ -0,0 +1,53 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n;
+    cin>>n;
+    string s;
+    cin>>s;
+    int temp=sqrt(n);
+    if(temp*temp==n){
+        string my_string = "";
+        for(int i=1;i<=temp;i++){
+            my_string+="1";
+        }
+        for (int i = 1; i <= temp-2; i++)
+        {
+            my_string += "1";
+            for(int j=1;j<=temp-2;j++){
+                my_string+="0";
+            }
+            my_string += "1";
+        }
+        for (int i = 1; i <= temp; i++)
+        {
+            my_string += "1";
+        }
+        if(my_string==s){
+            cout<<"Yes"<<endl;
+        }
+        else{
+            cout<<"No"<<endl;
+        }
+    }
+    else{
+        cout<<"No"<<endl;
+    }
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/2008C.Longest Good Array.cpp

@@ -0,0 +1,28 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int l,r;
+    cin>>l>>r;
+    int diff=r-l;
+    double temp = (-1 + sqrt(1 + 8.0 * diff)) / 2.0;
+    int ans=(int)temp;
+    
+    cout<<ans+1<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

LeetCode/1894.Find_the_Student_that_Will_Replace_the_Chalk.cpp

@@ -58,7 +58,7 @@ class Solution {
             else
                 return i;
         }
-        return sz(chalk)-1;
+        return 0;
     }
 };