.

Author: DhruvPasricha

.cph/.Guess_the_Number.cpp_81912b2accf383c5853e422d72c9eda8.prob

@@ -0,0 +1 @@
+{"name":"Guess the Number","group":"CodeChef - March Cook-Off 2021 Division 2","url":"https://www.codechef.com/COOK127B/problems/GUESSIT","interactive":true,"memoryLimit":256,"timeLimit":1000,"tests":[{"id":1616386126488,"input":"2\n0 0 0 0 1\n1","output":""}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"GuessTheNumber"}},"batch":{"id":"2b615ec6-1ac2-4100-b364-0e0fd57f297e","size":1},"srcPath":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Guess_the_Number.cpp"}

.vscode/settings.json

@@ -0,0 +1,5 @@
+{
+    "files.associations": {
+        "iostream": "cpp"
+    }
+}

Google/KickStart Round A 2021/template.cpp

@@ -90,8 +90,9 @@ class Math
 //------------------------------------------------------------------------------
 void solve()
 {
-    
+     
 }
+
 //------------------------------------------------------------------------------
 int32_t main()
 {

Guess_the_Number.cpp

@@ -0,0 +1,116 @@
+
+//------------------------------------------------------------------------------
+#include <iostream>
+#include <vector>
+// #include <bits/stdc++.h>
+#include <cmath>
+// #include <algorithm>
+// #include <unordered_map>
+// #include <map>
+// #include <set>
+// #include <unordered_set>
+//------------------------------------------------------------------------------
+using namespace std;
+//------------------------------------------------------------------------------
+#define FastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
+#define v(Type) vector<Type>
+#define w(T)  \
+    int T;    \
+    cin >> T; \
+    while (T--)
+#define int long long int
+#define mod 1000000007ll
+#define endl "\n"
+//------------------------------------------------------------------------------
+// Any fucntion can be called using Math.function_name();
+//------------------------------------------------------------------------------
+class Math
+{
+public:
+    //Returns gcd of two numbers
+    int gcd(int a, int b)
+    {
+        return (a % b == 0) ? b : gcd(b, a % b);
+    }
+
+    //Returns lcm of two numbers
+    int lcm(int a, int b)
+    {
+        return a * (b / gcd(a, b));
+    }
+
+    // Returns flag array isPrime
+    // isPrime[i] = true (if i is Prime)
+    // isPrime[i] = false (if i is not Prime)
+    vector<bool> *seiveOfEratosthenes(const int N)
+    {
+        vector<bool> *isPrime = new vector<bool>(N + 1, true);
+        (*isPrime)[0] = (*isPrime)[1] = false;
+        for (int i = 2; i * i <= N; ++i)
+            if ((*isPrime)[i])
+                for (int j = i * i; j <= N; j += i)
+                    (*isPrime)[j] = false;
+
+        return isPrime;
+    }
+
+    //Returns (x ^ n)
+    int pow(const int &x, int n)
+    {
+        if (n == 0)
+            return 1;
+        int h = pow(x, n / 2);
+        return (n & 1) ? h * h * x : h * h;
+    }
+
+    //Returns (x ^ n) % M
+    int pow(const int &x, int n, const int &M)
+    {
+        if (n == 0)
+            return 1;
+        int h = pow(x, n / 2) % M;
+        return (n & 1) ? (h * h * x) % M : (h * h) % M;
+    }
+
+    //Returns all Primes <= N
+    vector<int> *primesUptoN(const int N)
+    {
+        vector<bool> *isPrime = seiveOfEratosthenes(N);
+        vector<int> *Primes = new vector<int>;
+        if (2 <= N)
+            (*Primes).push_back(2);
+        for (int i = 3; i <= N; i += 2)
+            if ((*isPrime)[i])
+                (*Primes).push_back(i);
+        return Primes;
+    }
+
+} Math;
+//------------------------------------------------------------------------------
+void solve()
+{
+    int i = 0;
+    int in = 0;
+    do
+    {
+        cout << A[i++] << endl;
+        fflush(stdout);
+        cin >> in;
+    } while (in == 0);
+}
+//------------------------------------------------------------------------------
+int32_t main()
+{
+    // FastIO;
+    for (int i = 1; i <= 1e6; i++)
+    {
+        long double sq = sqrt(i);
+        if (floor(sq) == ceil(sq))
+            A.push_back(i);
+    }
+    w(T)
+        solve();
+
+    return 0;
+}
+//------------------------------------------------------------------------------

Guess_the_Number.exe

@@ -0,0 +1 @@
+{"name":"A. Deadline","group":"Codeforces - Educational Codeforces Round 80 (Rated for Div. 2)","url":"https://codeforces.com/problemset/problem/1288/A","interactive":false,"memoryLimit":256,"timeLimit":2000,"tests":[{"input":"3\n1 1\n4 5\n5 11\n","output":"YES\nYES\nNO\n","id":1616507626779}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ADeadline"}},"batch":{"id":"7086097f-3b74-4beb-a884-0ff0da89eae2","size":1},"srcPath":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\A_Deadline.cpp"}

Practice/.cph/.A_Deadline.cpp_583c53798d903faddb71f0deb5517cec.prob

@@ -0,0 +1 @@
+{"name":"B. Yet Another Meme Problem","group":"Codeforces - Educational Codeforces Round 80 (Rated for Div. 2)","url":"https://codeforces.com/problemset/problem/1288/B","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"3\n1 11\n4 2\n191 31415926\n","output":"1\n0\n1337\n","id":1616508670836}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BYetAnotherMemeProblem"}},"batch":{"id":"cabb044c-aef0-4564-8067-97a8969bb00e","size":1},"srcPath":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\B_Yet_Another_Meme_Problem.cpp"}

Practice/.cph/.B_Yet_Another_Meme_Problem.cpp_3dac90d52e66a50b7c1e074a2e6402a2.prob

@@ -0,0 +1 @@
+{"name":"Chef and Dynamo","group":"CodeChef - Practice(Easy)","url":"https://www.codechef.com/PRACTICE/problems/DYNAMO","interactive":true,"memoryLimit":256,"timeLimit":1000,"tests":[],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChefAndDynamo"}},"batch":{"id":"747eaf98-a78b-43be-8290-695a2afc7f81","size":1},"srcPath":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\Chef_and_Dynamo.cpp"}

Practice/.cph/.Chef_and_Dynamo.cpp_e4f4a9eae3b1c9390c358a0c36c4aeed.prob

@@ -0,0 +1 @@
+{"name":"Chefina and Prefix Suffix Sums","group":"CodeChef - Practice(Medium)","url":"https://www.codechef.com/PRACTICE/problems/CHEFPSA","interactive":false,"memoryLimit":256,"timeLimit":1000,"tests":[{"input":"4\n1\n-1 1\n1\n0 0\n2\n4 3 1 4\n3\n5 3 7 10 5 10","output":"0\n1\n2\n4","id":1616483391416},{"id":1616484630252,"input":"1\n3\n-1 -1 -1 0 0 0","output":""}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ChefinaAndPrefixSuffixSums"}},"batch":{"id":"eb2c2d99-cfb4-44ae-a6e4-6f59b4005ff5","size":1},"srcPath":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\Chefina_and_Prefix_Suffix_Sums.cpp"}

Practice/.cph/.Chefina_and_Prefix_Suffix_Sums.cpp_a0ef2d85a29660c3002376f05a5139e6.prob

@@ -0,0 +1 @@
+{"name":"Local: Nesting Depth","url":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\Nesting Depth.cpp","tests":[{"id":1616390037735,"input":"4\n0000\n101\n111000\n1","output":"Case #1: 0000\nCase #2: (1)0(1)\nCase #3: (111)000\nCase #4: (1)"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\Nesting Depth.cpp","group":"local","local":true}