#include <bits/stdc++.h>
long long (%lld) = -9,223,372,036,854,775,808 ~ 9,223,372,036,854,775,807
unsigned long long (%llu) = 0 ~ 18,446,744,073,709,551,615
int %d, char %c, char * (string) %s, double %lf, long long %lld
std::cout, std::cin --> printf(), scanf()
// ex) string -> c_str()
printf("%s", str.c_str())
-
algorithm
- unique
- find
- *max_element
- sort
- next_permutation
- fill / fill_n
// ex) 2D vector fill(matrix.begin(), matrix.end(), vector<int> (MAX, n)); | fill_n(matrix.begin(), MAX, vector<int> (MAX, n));
// ex) 2D array fill(arr[0], arr[MAX - 1] + MAX, n);
fill(arr[0], arr[MAX], n); | fill_n(arr[0], MAX * MAX, n);
// ex) 1D vector fill(matrix.begin(), matrix.end(), n); | fill_n(matrix.begin(), MAX, n);
// ex) 1D array fill(arr, arr+MAX, n); | fill_n(arr, MAX, n);
-
queue
- queue
- priority queue
-
sstream
- stringstream
-
functional
- greater
- less
-
cctype
- isdigit()
- isalpha()
-
iomanip
- fixed
- setprecision()
-
numeric
- accumulate
init -> 0(int), 0.0(double), 0LL(long long)
-
solution
- 유클리드 호제법
- 에라토스테네스의 체 (소수판별 수가 많을 때)
- Read File
freopen("sample_input.txt", "r", stdin);