Updated version

Author: nero-ventus

.gitignore

@@ -1,3 +1,2 @@
 mkcpr-config.json
-Output.tex
 Template.tex

CodeFolder/Basics/C++/Output format.cpp

@@ -0,0 +1,18 @@
+int main() {
+  ios state(nullptr);
+  state.copyfmt(cout); //Saves current format state
+  double D = 13.34567;
+  cout << setprecision(4) << D << endl // 13.35
+  << fixed << D << endl; // 13.3457
+  cout.copyfmt(state); //Restores format
+  int N = 13;
+  cout << setw(4) << N << endl //" 13"
+  << setfill('0') << N << endl //"0013"
+  << left << N << endl // "1300"
+  << right << N << endl // "0013"
+  << hex << N << endl // "000d"
+  << uppercase << N << endl // "000D"
+  << nouppercase << N << endl // "000d"
+  << oct << N << endl // "0015"
+  << dec << N << endl; // "0013"
+}

CodeFolder/C++/Permutations.cpp renamed to CodeFolder/Basics/C++/Permutations.cpp

@@ -1,4 +1,4 @@
-#define Dt int //Data type int long long int string ...
+#define Dt int //Datatype int,long long,string,etc.
 #define T vector<Dt>;
 
 vector<T> permutations(T v) {

CodeFolder/Basics/C++/Priority Queue.cpp

@@ -0,0 +1,20 @@
+struct Object {
+  int x, y;
+};
+
+int main() {
+  // Comparison function cmp for objects
+  auto cmp = [](const Object &a, const Object &b) {
+    return a.x > b.x;
+  };
+  // Comparison function cmpd for datatypes
+  auto cmpd = [](const int &a, const int &b) {
+    return a > b;
+  };
+  // For object
+  priority_queue<Object, vector<Object>,
+                 decltype(cmp)> pq(cmp);
+  // For datatypes
+  priority_queue<int, vector<int>,
+		 decltype(cmpd)> pq(cmpd);
+}

CodeFolder/Basics/C++/Random.cpp

@@ -0,0 +1,13 @@
+mt19937_64 seed(chrono::steady_clock::now()
+                    .time_since_epoch()
+                    .count());
+
+int random(int min, int max) {  // [min, max]
+  return uniform_int_distribution<int>(min,
+                                       max)(seed);
+}
+
+double random(double min, double max) {  // [min, max)
+  return uniform_real_distribution<double>(min,
+                                           max)(seed);
+}

CodeFolder/Basics/C++/Read Line.cpp

@@ -0,0 +1,6 @@
+// if mixing 'cin' with 'getline', remember to put 'ignore' between 'cin' and 'getline' in that order
+
+int main(){
+  string s;
+  getline(cin, s);
+}

CodeFolder/Basics/C++/Set of Object.cpp

@@ -0,0 +1,18 @@
+struct Object {
+  int x, y;
+};
+
+int main() {
+  // Comparison function cmp for objects
+  auto cmp = [](const Object &a, const Object &b) {
+    return a.x > b.x;
+  };
+  // Comparison function cmpd for datatypes
+  auto cmpd = [](const int &a, const int &b) {
+    return a < b;
+  };
+  //For object
+  set<Object, decltype(cmp)> pq(cmp);
+  //For datatypes
+  set<Object, decltype(cmpd)> pq(cmpd);
+}

CodeFolder/Basics/C++/Sort Vector of Objects.cpp

@@ -0,0 +1,13 @@
+struct Object {
+  char first;
+  int second;
+};
+
+bool cmp(const Object &a, const Object &b) {
+  return a.second > b.second;
+}
+
+int main() {
+  vector<Object> v = {{'c', 3}, {'a', 1}, {'b', 2}};
+  sort(v.begin(), v.end(), cmp);
+}

CodeFolder/Basics/C++/Sort Vector of Pairs.cpp

@@ -0,0 +1,10 @@
+bool sortbysec(const pair<int,int> &a, 
+               const pair<int,int> &b) {
+    return a.second < b.second; 
+}
+
+vector<pair<int, int>> pairs;
+//Sort by first element
+sort(pairs.begin(), pairs.end());
+//Sort by second element
+sort(pairs.begin(), pairs.end(), sortbysec);

CodeFolder/Basics/C++/String Split.cpp

@@ -0,0 +1,6 @@
+vector<string> split(string str, char token) {
+  stringstream ss(str);
+  vector<string> v;
+  while (getline(ss, str, token)) v.push_back(str);
+  return v;
+}

CodeFolder/Basics/C++/String to Int and Int to String.cpp

@@ -0,0 +1,15 @@
+int main() {
+  // String to Int
+  int n = stoi("123") + 1;
+  cout << n << endl;  // output: 124
+  // stoll for long long int
+  // stoull for unsigned long int
+  // stod for double
+  // stold for long double
+  
+  // Int to String
+  // to_string converts int, double, long long int, etc. to string
+  string str = "str+" + to_string(123 + 1);
+  cout << str << endl;  // output: str+124
+  return 0;
+}

CodeFolder/Basics/C++/Substring.cpp

@@ -0,0 +1,4 @@
+// [l, r)
+string substr(string &s, int l, int r) {
+  return string(s.begin() + l, s.begin() + r);
+}

CodeFolder/C++/Template.cpp renamed to CodeFolder/Basics/C++/Template.cpp

@@ -1,3 +1,4 @@
+// 26
 #include <bits/stdc++.h> //Include all c++ libraries
 using namespace std;
 #define io_op ios_base::sync_with_stdio(false);cin.tie(NULL); //IO Optimation
@@ -18,13 +19,13 @@ using namespace std;
 #define p_b push_back
 #define all(v) v.begin(), v.end()
 #define alla(arre, size) arre, arre + size
-#define forv(v, i) for(int i=0; i<v.size(); i++) //Vector for
-#define rforv(v, i) for(int i=v.size()-1; i>-1; i--) //Reverse vector for
-#define forx(x, i) for(int i=0; i<x; i++) //Num for
+#define forv(v, i) for(int i=0; i<v.size(); i++) //For Vector
+#define rforv(v, i) for(int i=v.size()-1; i>-1; i--) //For Reverse vector
+#define forx(x, i) for(int i=0; i<x; i++) //For Number
 #define showv(v, i) for(auto i:v) cout << i << ' '; //Display vector
 #define npermute next_permutation
 #define ppermute prev_permutation
-
+// 4
 int main(){
 	io_op
 	return 0;

CodeFolder/Basics/Python/Combinations.py

@@ -0,0 +1,4 @@
+import itertools
+# from arr choose k = > combinations(arr, k)
+# example arr=[1, 2, 3] and k=3
+print(list(itertools.combinations([1, 2, 3], 3)))

CodeFolder/Basics/Python/Fast IO.py

@@ -0,0 +1,15 @@
+from sys import stdin, stdout
+
+N = 10
+# Reads N chars from stdin(it counts '\n' as char)
+stdin.read(N)
+# Reads until '\n' or EOF
+line = stdin.readline()
+# Reads all lines in stdin until EOF
+lines = stdin.readlines()
+# Writes a string to stdout, it doesn't add '\n'
+stdout.write(line)
+# Writes a list of strings to stdout
+stdout.writelines(lines)
+# Reads numbers separated by space in a line
+numbers = list(map(int, stdin.readline().split()))

CodeFolder/Basics/Python/Permutations.py

@@ -0,0 +1,4 @@
+import itertools
+# All permutations of an arr
+# Example arr=[1, 2, 3]
+print(list(itertools.permutations([1, 2, 3])))

CodeFolder/Basics/Python/Random.py

@@ -0,0 +1,13 @@
+import random
+# Initialize the random number generator.
+random.seed(None)
+# Returns a random integer N such that a <= N <= b
+random.randint(a, b)
+# Returns a random integer N such that 0 <= N < b
+random.randrange(b)
+# Returns a random integer N such that a <= N < b
+random.randrange(a, b)
+# Returns an integer N with k random bits.
+random.getrandbits(k)
+# Shuffles a list
+random.shuffle(li)

CodeFolder/Basics/Python/Sort List of Objects.py

@@ -0,0 +1,12 @@
+# 5
+class MyObject :
+  def __init__(self, first, second, third):
+    self.first = first
+    self.second = second
+    self.third = third
+
+li = [MyObject('b', 3, 1), MyObject('a', 3, 2), MyObject('b', 3, 3)]
+# returns list sorted by first then by second then by third in increasing order
+ol = sorted(li, key = lambda x: (x.first, x.second, x.third), reverse=False)
+# sorts inplace by first then by second then by third in increasing order
+li.sort(key = lambda x: (x.first, x.second, x.third), reverse=False)

CodeFolder/Basics/Python/Sort List.py

@@ -0,0 +1,5 @@
+li = ['a', 'c', 'b']
+# sorts inplace in descending order
+li.sort(reverse=True)
+# returns sorted list ascending order
+ol = sorted(li)