Rare
0/5
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.
Feel free to file a request to complete this using the "Contact Us" button.
Example 1
| Status | Source | Problem Name | Difficulty | Tags | Solution |
|---|---|---|---|---|---|
| DMOJ | Very Hard |
This section is not complete.
Feel free to file a request to complete this using the "Contact Us" button.
Example 2
| Status | Source | Problem Name | Difficulty | Tags | Solution |
|---|---|---|---|---|---|
| Plat | Very Hard | External Sol |
This section is not complete.
Feel free to file a request to complete this using the "Contact Us" button.
1int N, h[750][750];2ll ans;3vector<pair<int,pi>> v;45int hsh(int a, int b) {6 return N*a+b;7}89const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1};10
Problems
| Status | Source | Problem Name | Difficulty | Tags | Solution |
|---|---|---|---|---|---|
| Kattis | Very Hard | View Solution | |||
| CF | Very Hard | Check CF | |||
| CF | Very Hard | Check CF |
Module Progress:
Give Us Feedback on Euler's Formula!
Join the Discussion!
Feel free to voice your thoughts in the comments section.