Return tuple or null

// return a tuple or null
fn solve(sum: u32, gcd: u32) -> Option<(u32, u32)> {
    if sum % gcd != 0 {
        None
    } else {
        Some((gcd, sum - gcd))
    }
}
// FYI: the problem solved is:
// Given the sum and gcd of two numbers, return the two numbers in ascending order.

Return tuple or null

// return tuple or null
#include <stdlib.h>

int *gdc_sum(int sum, int gcd) {
  int   *res = malloc(sizeof(int) * 2);
  res[0] = gcd;
  res[1] = sum - gcd;
  return sum % gcd != 0 ? (NULL) : (res);
}
// FYI: the problem to solve is:
// Given the sum and gcd of two numbers, return the two numbers in ascending order.

Return tuple or null

# return tuple or null
def solve s,g 
  s % g != 0 ? -1 : [g, s - g]
end
# FYI: the problem to solve is:
# Given the sum and gcd of two numbers, return the two numbers in ascending order.

Return tuple or null

// return tuple or null
using namespace std;

pair<int, int> solve(int s, int g){  
    return (s % g != 0) ? make_pair(-1, -1) : make_pair(g, s - g);  
}
// FYI: the problem to solve is:
// Given the sum and gcd of two numbers, return the two numbers in ascending order.

Return tuple or null

package kata

func Solve(s int, g int) []int {
  if s % g != 0 {
    return []int{-1, -1}
  }
  return []int{g, s - g}
}
// FYI: the problem to solve is:
// Given the sum and gcd of two numbers, return the two numbers in ascending order.

Similar codes

0 vote321 views1 answer
Rust loop n times
Rust
1 vote340 views1 answer
Array as a parameter rust
Rust
0 vote292 views1 answer
Rust lang underscore
Rust
0 vote377 views1 answer
Create file rust
Rust
0 vote385 views1 answer
Take two integers, return the quotient and remainder, divmod
Rust
0 vote363 views1 answer
Rust bevy states
Rust
0 vote355 views1 answer
Rust vec length
Rust
0 vote362 views1 answer
Rust modulus
Rust
1 vote341 views2 answers
Rust sleep
Rust
3 votes444 views1 answer
Random number generator in rust
Rust