UVa 10465 - Homer Simpson

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>

using namespace std;

int m, n, t, opt[10005], V[3];

int main ( ) {
while ( scanf ( "%d%d%d", &m, &n, &t ) == 3 ) {
V[1] = m, V[2] = n;
memset ( opt, -1, sizeof ( opt ) );
opt[0] = 0;
for ( int i = 1; i <= 2; ++i )
for ( int j = V[i]; j <= t; ++j )
if ( opt[j - V[i]] != -1 ) opt[j] = max ( opt[j], opt[j - V[i]] + 1 );
int tmp = 0;
for ( int i = t; i >= 0; --i ) {
if ( opt[i] != -1 ) break;
++tmp;
}
printf ( "%d", opt[t - tmp] );
if ( tmp != 0 ) printf ( " %d", tmp );
printf ( "\n" );
}
}