Cent Savings

Introduction

This problem asks you to divide a list of n integers into d groups, where the sum of the items in each group, mod 10, is minimized cumulatively across all d groups.

Solutions

Solution Using foo and X with Bob and alice algorithm

Idea

I had an idea! I thought of using bob and foo because of XYZ.

How to

The code was done this way.

Solution - *Language X*

#include <stdio.h>

int main()
{
    printf ("Hello Word!");
    return 0;
}

Super Epic Fails

It would be really easy to make this mistake or that mistake

Tags

• BFS
• Dynamic Programming