Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Create EXUNA.cpp #9

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create EXUNA.cpp #9

wants to merge 1 commit into from

Commits on Oct 25, 2019

  1. Create EXUNA.cpp 

    The cost of an ordering (A1,A2,…,AN) is defined as (((A1modA2)modA3)......)modAN where XmodY means the remainder when X is divided by Y. You need to find the maximum cost which can be attained through any possible ordering of the elements.
    @Triansh
    Triansh authored Oct 25, 2019
    Configuration menu
    Copy the full SHA
    a0fec9e View commit details
    Browse the repository at this point in the history