Keep it up

❤️🎉🙌🏻✨

This can also be fixed by setting the material to double sided but it comes with an additional computational Cost

Very informative and nice explanation .. found this explanation very helpful ❤️🙌🏻✨

search drawtocode

Aap konse college mai hai

Nice ! Keep it up 👍🏻✨👏🏻👏🏻

Amazing explanation ! ❤️👍🏻✨

Bro if array is 0 , 6 , 7 for 2nd question what should be the output? YES or NO

bro in last question u didn't explain that how u generated that formula

Nice

Kya aap contest ke que bhi karayege

Bhaiyaa aap ki rating kya hai codechef mai

Bhaiya kuch tips do na 😋

Bhaiya aap toh itne hushaar ho , aap toh Google mai honge na 🤔🤗

Very nice !! Explanation keep it up ❤️👏🏻👏🏻👍🏻

Nice explanation

Nice explanation

Nice explanation

dark mode

Bhai, contest ko mazaak kyun banake rakha hai, ye rating talented logo ko apna capabilities dikhane ka ek jariya hai, please chhod de

bro how to visualize python code?

Hlo bro

bahut kharab explanation

Bhai tujhse nahi hoga rehne de 😂

Amazing explanation!... Thank you:)

Java code Scanner scanner = new Scanner(System.in); int T = scanner.nextInt(); scanner.nextLine(); // consume the newline after T int[] results = new int[T]; for (int i = 0; i < T; i++) { String S = scanner.nextLine(); int min_horizontal = 0, max_horizontal = 0, min_vertical = 0, max_vertical = 0; if (S.charAt(0) == '1') { min_horizontal = -10; } if (S.charAt(1) == '1') { max_horizontal = 10; } if (S.charAt(2) == '1') { max_vertical = 10; } if (S.charAt(3) == '1') { min_vertical = -10; } int number_of_cells = (max_horizontal - min_horizontal + 1) * (max_vertical - min_vertical + 1); results[i] = number_of_cells; } for (int result : results) { System.out.println(result); }

Python code import sys input_func = sys.stdin.read data = input_func().split() T = int(data[0]) results = [] for i in range(1, T + 1): S = data[i] min_horizontal, max_horizontal = 0, 0 min_vertical, max_vertical = 0, 0 if S[0] == '1': min_horizontal = -10 if S[1] == '1': max_horizontal = 10 if S[2] == '1': max_vertical = 10 if S[3] == '1': min_vertical = -10 number_of_cells = (max_horizontal - min_horizontal + 1) * (max_vertical - min_vertical + 1) results.append(number_of_cells) for result in results: print(result)

Java code Scanner scanner = new Scanner(System.in); // Number of test cases int numTestCases = scanner.nextInt(); // To store the results for each test case int[] results = new int[numTestCases]; for (int testCase = 0; testCase < numTestCases; testCase++) { // Size of the array int arraySize = scanner.nextInt(); int[] array = new int[arraySize]; // Input array elements for (int i = 0; i < arraySize; i++) { array[i] = scanner.nextInt(); } // Calculate the total sum of the array int totalSum = 0; for (int num : array) { totalSum += num; } if (totalSum % 2 == 0) { // If total sum is even, the largest subarray is the entire array results[testCase] = arraySize; } else { // If total sum is odd, find the first and last odd element indices int leftOddIndex = -1; int rightOddIndex = -1; for (int i = 0; i < arraySize; i++) { if (array[i] % 2 != 0) { leftOddIndex = i; break; } } for (int i = arraySize - 1; i >= 0; i--) { if (array[i] % 2 != 0) { rightOddIndex = i; break; } } // Determine the largest subarray length with even sum by removing one odd element if (leftOddIndex == 0 || rightOddIndex == arraySize - 1) { results[testCase] = arraySize - 1; } else { results[testCase] = Math.max(arraySize - 1 - leftOddIndex, rightOddIndex); } } } // Print all results for (int result : results) { System.out.println(result); } scanner.close();

Python code # Number of test cases num_test_cases = int(input()) # To store the results for each test case results = [] for test_case in range(num_test_cases): array_size = int(input()) array = list(map(int, input().split())) total_sum = sum(array) if total_sum % 2 == 0: # If total sum is even, the largest subarray is the entire array results.append(array_size) else: # If total sum is odd, find the first and last odd element indices left_odd_index = -1 right_odd_index = -1 for i in range(array_size): if array[i] % 2 != 0: left_odd_index = i break for i in range(array_size - 1, -1, -1): if array[i] % 2 != 0: right_odd_index = i break # Determine the largest subarray length with even sum by removing one odd element if left_odd_index == 0 or right_odd_index == array_size - 1: results.append(array_size - 1) else: results.append(max(array_size - 1 - left_odd_index, right_odd_index)) # Print all results for result in results: print(result)

i dont get this logic....please explain bro

import sys input = sys.stdin.read # Read the input data = input().split() T = int(data[0]) results = [0] * T sum_of_first_nine = 45 # 1 + 2 + ... + 9 index = 1 for i in range(T): N = int(data[index]) index += 1 full_cycles = N // 9 remainder = N % 9 # Sum from complete cycles and the remaining part result = full_cycles * sum_of_first_nine + (remainder * (remainder + 1)) // 2 results[i] = result # Output the sum of original values for res in results: print(res)

def count_non_consecutive_pairs(s, n): count_pairs = 0 i = 1 while i < n: if s[i] == s[i - 1]: count_pairs += 1 i += 1 i += 1 return count_pairs def main(): num_test_cases = int(input()) for _ in range(num_test_cases): length = int(input()) moves = input() result = count_non_consecutive_pairs(moves , length) print(length- result) if __name__ == "__main__": main()

import java.util.*; import java.lang.*; import java.io.*; class Codechef { public static void main (String[] args) throws java.lang.Exception { // your code goes here Scanner scanner = new Scanner(System.in); int cases = scanner.nextInt(); for (int k = 0; k < cases; k++) { int amount = scanner.nextInt(); int year = scanner.nextInt(); int result = 0; for (int i = 0; i < year; i++) { if (amount * 2 > amount + 1000) { amount *= 2; result = amount; } else { amount += 1000; result = amount; } } System.out.println(result); } scanner.close(); } }

# cook your dish here for k in range(int(input())): amount,year=map(int,input().split()) result=0 for i in range(year): if(amount*2>amount+1000): amount*=2 result=amount else: amount+=1000 result=amount print(result)

t=int(input()) for i in range(t): n=int(input()) # n is number of integers in n array a=list(map(int,input().split())) subarray = [1]*n # initialises a list subarray of length n with all elements set to 1 # last element always though it may be positive or negative for i in range(n-2,-1,-1): if (a[i]*a[i+1]<0): # 2 -2 -3 # -3*-2==6>0 #last second element is 1 # -2*2=-4<0 # last third element is 1+1=2 # subarray= 2 1 1 subarray[i]=subarray[i+1]+1 else: subarray[i]=1 print(*subarray) # subarray 2 1 1 without* it will print 211 which will give error

whatsapp.com/channel/0029VaUDt2Q23n3kqYyoP43U

class Solution: def isPalindrome(self, x: int) -> bool: if x < 0: return False reversed_num = 0 temp = x while temp != 0: digit = temp % 10 reversed_num = reversed_num * 10 + digit temp //= 10 return reversed_num == x

whatsapp.com/channel/0029VaUDt2Q23n3kqYyoP43U

class Solution { public int[] twoSum(int[] nums, int target) { Map<Integer,Integer> map= new HashMap<>(); // Map and HashMap these are in built codes for writing HashMap for(int i=0;i<nums.length;i++){ // nums={2,7,11,15} and our target element is target=9 // nums.length=4 int substract= target-nums[i]; // substract=9-nums[0 // substract =9-2=7 if(map.containsKey(substract)){ return new int[]{ map.get(substract),i}; } map.put(nums[i],i); } throw new IllegalArgumentException(" No 2 sums have solution"); } }

whatsapp.com/channel/0029VaUDt2Q23n3kqYyoP43U

# Code by Prathamesh Ghodmare class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: for i in range(len(nums)): # nums=[2,7,11,15] # len(nums)=4 for j in range(i+1,len(nums)): #i+1=0+1=1 #len(nums)=4 #j will start from 1 to 4 if nums[j]==target-nums[i]: #nums[j]=7. and target=9. also nums[i]=2 # 7==9-2 return [i,j]

whatsapp.com/channel/0029VaUDt2Q23n3kqYyoP43U

whatsapp.com/channel/0029VaUDt2Q23n3kqYyoP43U

whatsapp.com/channel/0029VaUDt2Q23n3kqYyoP43U

import java.util.*; import java.lang.*; import java.io.*; class Codechef { public static void main(String[] args) throws java.lang.Exception { Scanner sc = new Scanner(System.in); int t = sc.nextInt(); while (t > 0) { int n = sc.nextInt(); int arr[] = new int[n + 1]; for (int i = 1; i <= n; i++) { arr[i] = sc.nextInt(); } long ans = 0; for (int i = 1; i <= n; i++) { long left = (long) arr[i]; if (left == 1) { ans += (long) n; } else { long power = 1; for (int j = 1; j <= n; j++) { power *= left; if (power > 1000000000L) { break; } else { long right = (long) arr[j]; if (power <= right) { ans++; } } } } } System.out.println(ans); t--; } } }

import java.util.*; class Codechef { public static void main(String[] args) throws java.lang.Exception { Scanner jk = new Scanner(System.in); int t = jk.nextInt(); while (t > 0) { int vk = jk.nextInt(); PriorityQueue<Integer> max = new PriorityQueue<>(Collections.reverseOrder()); PriorityQueue<Integer> min = new PriorityQueue<>(); for (int j = 0; j < vk; j++) { int va = jk.nextInt(); max.add(va); min.add(va); } int ans = 0; int to = vk / 2; while (to > 0) { int ge = max.poll(); int small = min.poll(); int df = ge - small; ans += df; to--; } if (vk % 2 != 0) { ans += min.poll(); } System.out.println(ans); t--; } } }