Add files via upload

Author: AdityaSeth777

29 - Bitwise AND/Solution.c

@@ -0,0 +1,116 @@
+#include <assert.h>
+#include <limits.h>
+#include <math.h>
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+char* readline();
+char** split_string(char*);
+
+
+void calculate_the_maximum(int n, int k) {
+int i,j;
+int max=0;
+int h=0;
+for(i=1;i<n;i++)
+{
+  for(j=i+1;j<=n;j++)
+  {  int v=i&j;
+     if(v>=k)
+        break;
+     if(max<v)
+        max=v;
+         
+   }
+   
+}
+printf("%d\n",max);
+
+
+}
+
+
+int main()
+{
+    char* t_endptr;
+    char* t_str = readline();
+    int t = strtol(t_str, &t_endptr, 10);
+
+    if (t_endptr == t_str || *t_endptr != '\0') { exit(EXIT_FAILURE); }
+
+    for (int t_itr = 0; t_itr < t; t_itr++) {
+        char** nk = split_string(readline());
+
+        char* n_endptr;
+        char* n_str = nk[0];
+        int n = strtol(n_str, &n_endptr, 10);
+
+        if (n_endptr == n_str || *n_endptr != '\0') { exit(EXIT_FAILURE); }
+
+        char* k_endptr;
+        char* k_str = nk[1];
+        int k = strtol(k_str, &k_endptr, 10);
+        calculate_the_maximum(n,k);
+         if (k_endptr == k_str || *k_endptr != '\0') {
+          exit(EXIT_FAILURE);
+        }
+    }
+
+    return 0;
+}
+
+char* readline() {
+    size_t alloc_length = 1024;
+    size_t data_length = 0;
+    char* data = malloc(alloc_length);
+
+    while (true) {
+        char* cursor = data + data_length;
+        char* line = fgets(cursor, alloc_length - data_length, stdin);
+
+        if (!line) { break; }
+
+        data_length += strlen(cursor);
+
+        if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') { break; }
+
+        size_t new_length = alloc_length << 1;
+        data = realloc(data, new_length);
+
+        if (!data) { break; }
+
+        alloc_length = new_length;
+    }
+
+    if (data[data_length - 1] == '\n') {
+        data[data_length - 1] = '\0';
+    }
+
+    data = realloc(data, data_length);
+
+    return data;
+}
+//Aditya Seth
+char** split_string(char* str) {
+    char** splits = NULL;
+    char* token = strtok(str, " ");
+
+    int spaces = 0;
+
+    while (token) {
+        splits = realloc(splits, sizeof(char*) * ++spaces);
+        if (!splits) {
+            return splits;
+        }
+
+        splits[spaces - 1] = token;
+
+        token = strtok(NULL, " ");
+    }
+
+    return splits;
+}

29 - Bitwise AND/Solution.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main()
+{
+    int t;
+    cin >> t;
+
+    int N, K;
+    
+    for(int i = 0; i < t; i++)
+    {
+        vector<int> s;
+        cin >> N >> K;
+
+        for(int j = 1; j <= N; j++)
+        {
+            s.push_back(j);
+        }
+
+        int maximum = 0;
+
+        for(int A = 0; A < N; A++)
+        {
+            for(int B = A + 1; B < N; B++)
+            {
+                if((s[A] & s[B]) < K && (s[A] & s[B]) > maximum)
+                    maximum = (s[A] & s[B]);
+            }
+        }
+
+        cout << maximum << endl;
+    }
+//Aditya Seth
+    return 0;
+}
+

29 - Bitwise AND/Solution.py

@@ -0,0 +1,33 @@
+#!/bin/python3
+
+import math
+import os
+import random
+import re
+import sys
+
+
+def bitwiseAnd(N, K):
+
+
+    return (K-1 if ((K-1) | K) <= N else K-2)
+    
+
+if __name__ == '__main__':
+    fptr = open(os.environ['OUTPUT_PATH'], 'w')
+
+    t = int(input().strip())
+
+    for t_itr in range(t):
+        first_multiple_input = input().rstrip().split()
+
+        count = int(first_multiple_input[0])
+
+        lim = int(first_multiple_input[1])
+
+        res = bitwiseAnd(count, lim)
+
+        fptr.write(str(res) + '\n')
+
+    fptr.close()
+#Aditya Seth