Problem
This is an example problem statement in markdown, and a mini guide on writing statements. Please make sure to remove everything here before publishing your problem.
- Codechef uses markdown for its problem statements. Markdown syntax can be found [here](https://github.com/showdownjs/showdown/wiki/Showdown's-Markdown-syntax). Note the `[text](link)` syntax to insert a hyperlink.
- Codechef also uses $\LaTeX$ to render mathematical expressions, and you are advised to make liberal use of it to make your statement look good.
- Text can be made **bold** or *italicized*.
- **Do not** use HTML tags (p, ul, li, pre, br, ...) in the statement.
- To insert an image, first upload it to an online hosting service (for an official contest, ask a Codechef admin to do this for you — this is important) and then use the following syntax: ``.
- If your problem doesn't contain subtasks, ensure that the Subtasks section below is disabled and **all content is deleted from it**.
If you face any issues, either contact a Codechef admin directly or send us an email at help@codechef.com.
Below is an example problem statement that uses some of the above-mentioned features.
---------
Chef has a simple undirected graph $G$ with $N$ vertices and $M$ edges. A [subgraph](https://mathworld.wolfram.com/Subgraph.html) $H$ of $G$ is called *good* if:
- $H$ is connected
- $H$ contains all $N$ vertices of $G$
- There is a unique path between any two vertices in $H$, using only edges in $H$
Count the number of *good* subgraphs of $G$. Since this number might be large, report it modulo $10^9 + 7$.
In other news, here's a completely unrelated image:
.
Solution
JAVAimport java.util.*;
import java.lang.*;
import java.io.*;
class Codechef
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(System.in);
int X = sc.nextInt();
int Y = sc.nextInt();
System.out.println(7-X-Y);
}
}