IDPC Template
IDPC Template
1. C++ compiler
{
"cmd" : ["g++ -std=c++14 $file_name -o $file_base_name && timeout 4s
./$file_base_name<inputf.in>outputf.in"],
"selector" : "source.c",
"shell": true,
"working_dir" : "$file_path"
}
2. String to int
3. gcd
4. LCM
5. Quick Sort
1|Page
Md. Nazmul Hossain 223002089
return pIndex;
}
6. Substring
7. String Reverse
reverse(s.begin(), s.end());
2|Page
Md. Nazmul Hossain 223002089
distances[start] = 0;
q.push(start);
while (!q.empty()) {
int current = q.front();
q.pop();
if (current == end) {
break; // Found the end node, no need to continue
}
return path;
}
#include <iostream>
#include <vector>
if (n == 0) {
return prefixSum; // Return an empty vector for an empty input
}
prefixSum[0] = arr[0];
for (int i = 1; i < n; ++i) {
prefixSum[i] = prefixSum[i - 1] + arr[i];
}
3|Page
Md. Nazmul Hossain 223002089
return prefixSum;
}
int main() {
vector<int> arr = {1, 2, 3, 4, 5};
return 0;
}
12. Circle
13. Sieve
void sieveOfEratosthenes(int n) {
vector<bool> isPrime(n + 1, true);
isPrime[0] = isPrime[1] = false;
4|Page
Md. Nazmul Hossain 223002089
#include <iostream>
int main() {
for (int i = 1; i < N; ++i) {
for (int j = i; j < N; j += i) {
d[j]++;
}
}
for (int i = 1; i <= 100; i++) {
if (d[i] == 2) {
cout << i << '\n';
}
}
return 0;
}
15.Formulas
5|Page