Skip to content

Instantly share code, notes, and snippets.

@airekans

airekans/euler_point.cpp

Created August 2, 2013 05:43
Show Gist options
  • Save airekans/6137744 to your computer and use it in GitHub Desktop.
Save airekans/6137744 to your computer and use it in GitHub Desktop.
Download ZIP
在一个椭圆形的土地内，给定椭圆边上的n个点，两两之间连线，最多能将这个土地分成多少块？ 思路：欧拉公式 V - E + F = 2
Raw
euler_point.cpp
int main(int argc, char** argv)
{
// solution here.
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment