题目:http://codeforces.com/problemset/problem/450/C
题意:给你n*m的巧克力块,切k次(只能沿着巧克力单元线切),当分的块数最少时,最小的块的面积为多少?
分析:贪心
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,m,k;
long long ans;
scanf("%lld %lld %lld",&n,&m,&k);
if(n+m-2<k)
{
printf("-1\n");
exit(0);
}
if(n>m)
{
swap(n,m);
}
if(m >= k+1)
{
ans = max(m/(k+1)*n,n/(k+1)*m);
printf("%lld\n",ans);
}
else
{
ans = max(m/(k-(n-1)+1),n/(k-(m-1)+1));
printf("%lld\n",ans);
}
return 0;
}