PrevNext
Rare
 0/5

Euler's Formula

Author: Benjamin Qi

A formula for finding the number of faces in a planar graph.

Introduction

This section is not complete.

Any help would be appreciated! Just submit a Pull Request on Github.

Example 1

StatusSourceProblem NameDifficultyTagsSolutionURL
DMOJVery Hard

This section is not complete.

Any help would be appreciated! Just submit a Pull Request on Github.

Example 2

StatusSourceProblem NameDifficultyTagsSolutionURL
PlatVery HardExternal Sol

This section is not complete.

Any help would be appreciated! Just submit a Pull Request on Github.
int N, h[750][750];
ll ans;
vector<pair<int,pi>> v;
int hsh(int a, int b) {
return N*a+b;
}
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1};

Problems

StatusSourceProblem NameDifficultyTagsSolutionURL
KattisVery HardView Solution
CFVery HardCheck CF
CFVery HardCheck CF

Module Progress:

Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!

Give Us Feedback on Euler's Formula!

Leave suggestions for us by making a post on the USACO Forum! Ex: Unclear sections, mislabeled problems, etc.

PrevNext