Rare
0/6
Euler's Formula
Author: Benjamin Qi
Prerequisites
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
| Status | Source | Problem Name | Difficulty | Tags | |||||
|---|---|---|---|---|---|---|---|---|---|
| DMOJ | Very Hard | ||||||||
This section is not complete.
Any help would be appreciated! Just submit a Pull Request on Github.
Example 2
| Status | Source | Problem Name | Difficulty | Tags | |||||
|---|---|---|---|---|---|---|---|---|---|
| Plat | Very Hard | ||||||||
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
| Status | Source | Problem Name | Difficulty | Tags | |||||
|---|---|---|---|---|---|---|---|---|---|
| Kattis | Very Hard | Show TagsDSU, Euler's Formula | |||||||
| CF | Very Hard | Show TagsEuler's Formula, FFT | |||||||
| CF | Very Hard | Show TagsEuler's Formula | |||||||
| Plat | Very Hard | Show TagsEuler's Formula | |||||||
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!