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 vote111 views1 answer
Stl reverse sort a array
C++
1 vote119 views1 answer
How to modify set C++
C++
1 vote121 views1 answer
C++ remove n characters from string
C++
0 vote120 views1 answer
Recursive power in c++
C++
0 vote119 views1 answer
How to find the left most bit 1 in binary of any number
C++
0 vote112 views1 answer
Parenthesis Checker using stack in c++
C++
0 vote122 views1 answer
Fstring from float c++ ue4
C++
0 vote119 views1 answer
C++ clear char array
C++
2 votes120 views2 answers
C++ sum the digits of an integer
C++
0 vote141 views1 answer
Ue4 foreach loop c++
C++