int main()
{
int E,s,r,val,ans,cases=1;
while(scanf("%d %d %d",&nx,&ny,&E)!=EOF)
{
for(s=0;s<=nx;++s)
{
for(r=0;r<=ny;++r)
w[s][r]=(~INF+1);
}
if(E==0)
{
printf("Case %d: -1\n",cases++);
continue;
}
while(E--)
{
scanf("%d %d %d",&s,&r,&val);
if(val>=0)
w[s][r]=val;
}
ans=KM();
printf("Case %d: %d\n",cases++,ans);
}
return 0;
}
int main()
{
while( scanf( "%d %d %d %d" , &n , &m , &s , &v ) not_eq EOF )
{
init();
//printf( "input d\n" );
KM();
//printf( "KM d\n" );
out();
}
return 0;
}
int main()
{
int i,f,ans;
while(scanf("%d",&n)!=EOF)
{
for(i=1;i<=n;i++)
for(f=1;f<=n;f++)
scanf("%d",&W[i][f]);
ans=KM();
printf("%d\n",ans);
}
return 0;
}
/**
* Computes the lower Incomplete Gamma Function.
*
* The computation is slow because it involves a power series that needs to
* be developped sufficiently to ensure convergence.
*/
static double
lower_igf(double s, double z)
{
double c;
if (z < 0.0)
return 0.0;
c = 1.0 / s;
c *= pow(z, s) * exp(-z);
return c * KM(s, z);
}
static long double log_igf(long double S, long double Z)
{
if(Z < 0.0)
{
return 0.0;
}
long double Sc, K;
Sc = (logl(Z) * S) - Z - logl(S);
K = KM(S, Z);
return logl(K) + Sc;
}
int main() {
int n, m;
while(scanf("%d %d", &n, &m) == 2) {
if(n == 0 && m == 0)
break;
N = n, M = m;
int i, j;
for(i = 1; i <= n; i++) {
for(j = 1; j <= m; j++) {
scanf("%lf", &W[i][j]);
W[i][j] *= -1;
}
}
printf("%.2lf\n", -KM()/n+eps);
}
return 0;
}
int main()
{
// freopen("in.txt","r",stdin);
char str[M];
int a, b,dis;
while (scanf("%d%d", &n, &m) != EOF,n+m)
{
a = b = 0;
for (int i = 0; i < n; i++)
{
scanf("%s", str);
for (int j = 0; j < m; j++)
{
if (str[j] == 'H')
{
xx[++a].x = i;
xx[a].y = j;
}
if (str[j] == 'm')
{
yy[++b].x = i;
yy[b].y = j;
}
}
}
nx=ny= max(a, b);
memset(w,0,sizeof(w));
for (int i = 1; i <= a; ++i)
for (int j = 0; j <= b; ++j)
{
dis=dist(yy[j],xx[i]);
w[j][i]=(300-dis);
}
int ans=KM();
printf("%d\n",300*nx-ans);
}
}
float Ship::GM(){
return KM() - KGh();
}
int
lesstif_key_event (XKeyEvent * e)
{
char buf[10], buf2[10];
KeySym sym, sym2;
int slen, slen2;
int mods = 0;
int i, vi;
static int sorted = 0;
acc_table_t *my_table = 0;
if (!sorted)
{
sorted = 1;
qsort (acc_table, acc_num, sizeof (acc_table_t), acc_sort_rev);
}
if (e->state & ShiftMask)
mods |= M_Shift;
if (e->state & ControlMask)
mods |= M_Ctrl;
if (e->state & Mod1Mask)
mods |= M_Alt;
e->state &= ~(ControlMask | Mod1Mask);
slen = XLookupString (e, buf, sizeof (buf), &sym, NULL);
if (e->state & ShiftMask)
{
e->state &= ~ShiftMask;
slen2 = XLookupString (e, buf2, sizeof (buf2), &sym2, NULL);
}
else
slen2 = slen;
/* Ignore these. */
switch (sym)
{
case XK_Shift_L:
case XK_Shift_R:
case XK_Control_L:
case XK_Control_R:
case XK_Caps_Lock:
case XK_Shift_Lock:
case XK_Meta_L:
case XK_Meta_R:
case XK_Alt_L:
case XK_Alt_R:
case XK_Super_L:
case XK_Super_R:
case XK_Hyper_L:
case XK_Hyper_R:
return 1;
}
if (cur_table == 0)
{
cur_table = acc_table;
cur_ntable = acc_num;
}
//printf("\nmods %x key %d str `%s' in %p/%d\n", mods, (int)sym, buf, cur_table, cur_ntable);
#define KM(m) ((m) & ~M_Multi)
for (i = 0; i < cur_ntable; i++)
{
dump_multi (i, 0, cur_table+i, 1);
if (KM(cur_table[i].mods) == mods)
{
if (sym == acc_table[i].u.a.key)
break;
}
if (KM(cur_table[i].mods) == (mods & ~M_Shift))
{
if (slen == 1 && buf[0] == cur_table[i].key_char)
break;
if (sym == cur_table[i].u.a.key)
break;
}
if (mods & M_Shift && KM(cur_table[i].mods) == mods)
{
if (slen2 == 1 && buf2[0] == cur_table[i].key_char)
break;
if (sym2 == acc_table[i].u.a.key)
break;
}
}
if (i == cur_ntable)
{
if (cur_table == acc_table)
lesstif_log ("Key \"%s\" not tied to an action\n", buf);
else
lesstif_log ("Key \"%s\" not tied to a multi-key action\n", buf);
cur_table = 0;
return 0;
}
if (cur_table[i].mods & M_Multi)
{
cur_ntable = cur_table[i].u.c.n_chain;
cur_table = cur_table[i].u.c.chain;
dump_multi (0, 0, cur_table, cur_ntable);
return 1;
}
if (e->window == XtWindow (work_area))
{
have_xy = 1;
action_x = e->x;
action_y = e->y;
}
else
have_xy = 0;
/* Parsing actions may not return until more user interaction
happens, so remember which table we're scanning. */
my_table = cur_table;
for (vi = 1; vi < my_table[i].u.a.node->c; vi++)
if (resource_type (my_table[i].u.a.node->v[vi]) == 10)
if (hid_parse_actions
(my_table[i].u.a.node->v[vi].value))
break;
cur_table = 0;
return 1;
}
int main(){
init();
KM();
out();
return 0;
}
