Ad
  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    Спасибо за подсказку для старичка!

  • Custom User Avatar

    from sympy import symbols

    from sympy.solvers.diophantine import diop_DN

    I solve this kata using module sympy

    I import from the module sympy, and the test program swears and prescribed import sympy does not help

    ModuleNotFoundError: No module named 'sympy'

    Give some advice please

  • Custom User Avatar

    I also agree with the user eliseuvideira who sent this message:

    The description is very confusing for anyone that is not native speaker,
    please make it clear what I need to do to complete this kata.

    If possible, show the code how to generate an array (or a hint where you can find it!) From tuples with such values D = 3 N = 3 and so that the sum is 81 as in Kata's task ---- super_sum (3, 3), 81)
    Even in the example for Kath’s decision, it’s not clear how the list was created. If D = 2 and N = 3 the answer is 18 which would be the sum of every number in the following:

    [
    [(0,0), (0,1), (0,2)],
    [(1,0), (1,1), (1,2)],
    [(2.0), (2.1), (2.2)]
    ]

  • Custom User Avatar

    But it seemed to me that if I correctly translated the words of the assignment,
    there would be no need to rewrite anything, but just flip the arrays in place
    and change the pointers a, b = b, a

    Maybe I'm not understanding something.

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution