Gain insights into competitive programming, explore C++ skills with theory, code samples, practice problems, and master faster implementation for contests like ACM ICPC, Google CodeJam, and HackerCup.

Competitive programming can be a great way to build out your programming skills, get on any major company’s radar, and earn a little extra cash along the way.

In this course, you will learn to prepare for competitive programming contests like ACM ICPC, Google CodeJam, Facebook HackerCup, and many more.

Each topic is broken down with a healthy mix of theory, code samples, step-by-step solved sample problems, illustrations, useful practice problems, and tips and tricks for faster implementation.

You will need some solid C++ foundations coming into this course, but by the end it, you will be confident enough in your C++ skills to take home the win.

Competitive Programming in C++: The Keys to Success

# Problem statement
Given an integer, $N$, print all the prime factors of $N$.

**Input format**

A single line of input contains an integer $N$ $(1 \leq N \leq 10^{10})$.

**Output format**

Print all the prime factors of $N$.

---

# Sample
**Input 1:** `
```
24
```

**Output 1:** 
```
2 3
```

**Input 2:** 
```
207
```

**Output 2:** 
```
3 23
```

---

# Explanation

$24 = 2^{3} \times 3$, prime factors are $2$ and $3$

$207 = 3^{2}\times23$, prime factors are $3$ and $23$

---

# Solution
Starting from $i=2$ and going up to  $\sqrt{N}$; if $i$ divides $N$, add this to the list of prime factors and remove all occurrences of $i$ by repetitively dividing $N$ by $i$. 

In the end, if the number is completely factored, we are left with $1$, in which case we are done.

If we do not end up with $1$, that means $N$ has a prime factor $> \sqrt{N}$. This prime factor is the number we are left with since it's power will be $1$ (_as discussed earlier_).

In this lesson, we'll discuss how to find the prime factorization of a number.


Introduction

Complexity Analysis

Number Theory

Arrays and Vectors

Sieve of Eratosthenes

Strings

Sorting

Linked List

Stack

Queue

Binary Tree

2 Pointers

Heap

Binary Search Tree

Balanced Binary Search Tree

Course Conclusion

Solved Problem - Prime Factorization

Problem statement

Sample

Explanation