Case Matching Find Replace Take three inputs, a string of text, T; a string of characters to replace, F; and a string of characters to replace them with, R. For each substring of T with the same (case insensitive) characters as F, replace them with the characters in R. However, keep the same cas...

Good day, I am trying to code in maple 2015 the wallis sieve which is a fractal but instead of taking away always the 1/3 of each remaining cell or sub-cell, the progression goes in 3,5,7,9,11 etc for each sub-level. So for n=2, the remaining area is 8/9*24/25* 4 units (starting with a square o...

You are given a directed graph with n nodes and m edges. The nodes are numbered from 1 to n, and node i is assigned a cost ci. The cost of a walk on the graph is defined as the greatest common divisor of the costs of the vertices used in the walk. Formally, the cost of a walk v1, v2, ⋯ , vk i...

Rohan was asked to solve the following problem: For any given permutation in range(1,2,3...n), Rohan calculates two values S1 and S2. where, S1 = number of pairs(i , j) in that permutation such that i < j and perm[i] > perm[j] and S2 = Sum(max(0 , i - perm[i])) where perm[i] is the value present...

Input no input for this challenge The Challenge Write a code that outputs: The first 10 prime numbers whose sum of their digits equal the number of bytes of your code Examples Let's say your code is Co&%423@k"oo" which is 13 bytes your code must output [67, 139, 157, 193, 229, 283, 337, ...

Output diagonal positions of me squared. code-golf math Input: a number n. Output: A list or print to output which values are separated by a char different from new-line of all positions of diagonals of n^2. Examples: 1 X 1 2 \/ /\ 1 2 3 4 3 \#/ #X# /#\ 1 3 5 7 9 4 \##/ #\/# #/\# /##\ 1 4 ...