Competitive Programming Code Templates

Abstract

---

A collection of code templates to kickstart the journey of solving interesting problems on Codeforces!

Tip

1. Make sure all inputs are read in in sequence
2. Use at least 64Bit to prevent integer overflow issue, long in Java, long long in CPP
3. Dynamic Array (List) over Array

Java Code Template

---

Test Solution.java with test cases inside input.txt

java Solution.java < input.txt

Solution.java when there are multiple inputs in a single test case

Solution.java

import java.util.*;
 
public class Solution {
 static Scanner scanner = new Scanner(System.in);
 
 // Write your solution here
 public static void solve() {
   System.out.println("Write your solution inside the solve() method");
 }
 
 public static void main(String[] args) {
   int t = scanner.nextInt();
   scanner.nextLine();
   
   while(t-- > 0) {
     solve();
   }
 }
}

Solution.java when there is only a single input in a given test case

Solution.java

import java.util.*;
 
public class Solution {
 static Scanner scanner = new Scanner(System.in);
 
 // Write your solution here
 public static void solve() {
   System.out.println("Write your solution inside the solve() method");
 }
 
 public static void main(String[] args) {
   solve();
 }
}

Basic Data Structure Operation Cheatsheet

Java List

CPP Code Template

---

Test Solution.cpp with test cases inside input.txt

g++ -o Solution Solution.cpp && ./Solution < input.txt

Solution.cpp when there are multiple inputs in a single test case

Solution.cpp

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <functional>
#include <limits>
#include <bitset>
#include <iomanip>
#include <iterator>
#include <cassert>
using namespace std;
typedef long long ll;
 
struct test {
 void solve() {
   cout << "Write your solution inside the solve() method\n";
 }
};
 
int main() {
 ios::sync_with_stdio(false);
 int t;
 cin >> t;
 for (int i = 0; i < t; i++) {
   test().solve();
 }
 return 0;
}

Solution.cpp when there is only a single input in a given test case

Solution.cpp

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <functional>
#include <limits>
#include <bitset>
#include <iomanip>
#include <iterator>
#include <cassert>
using namespace std;
typedef long long ll;
 
struct test {
 void solve() {
   cout << "Write your solution inside the solve() method\n";
 }
};
 
int main() {
   ios::sync_with_stdio(false);
 
   test().solve();
 
   return 0;
}