uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
d1e41ed5-9685-4fd0-b08a-8fa8f7f1c683 | ishandutta2007/codeforces | i_love_tanya_romanova/normal/178/B2.cpp | //#pragma comment(linker, "/STACK:16777216")
#include <iostream>
#include <fstream>
#include <string>
#include <math.h>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stdio.h>
#include <stack>
#include <algorithm>
#include <list>
#define y1 aasdfasdfasdf
#define yn askfhwqriuperikldjk
#defin... | ALGO | 0.999919 | 3.53786 |
649216ae-c79c-408d-8291-a57bf09d388a | Suryansh-23/CodeForces | 706B - Interesting Drink.cpp | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <limits>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define loopi(a, b) for (ll i = a; i < b; i++)
#define loopj(a, b) for (ll j = a; j < b; j++)
#define loopk(a, b) for (ll k = a; k < b; k... | ALGO | 0.999715 | 3.755705 |
775d39c7-db4b-40c2-a1ad-1e2b5a2ffb48 | ESTEKI/data_acquisition | my includes/EIGENDIR/doc/examples/tut_arithmetic_dot_cross.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
using namespace std;
int main()
{
Vector3d v(1,2,3);
Vector3d w(0,1,2);
cout << "Dot product: " << v.dot(w) << endl;
double dp = v.adjoint()*w; // automatic conversion of the inner product to a scalar
cout << "Dot product via a matrix product... | ALGO | 0.998457 | 4.012072 |
a97daa82-27c0-40b7-b2c4-f37eb4030fc8 | glanzkaiser/LasthrimProjection | Source Codes/C++/Calculus/ch8-Indeterminate Forms and Improper Integrals/ch8-3-Improper Integral for Weibul Distribution (NOT YET)/main.cpp | // g++ main.cpp -o result -lsymbolicc++
#include <iostream>
#include "symbolicc++.h"
using namespace std;
int main()
{
Symbolic x("x"), θ("θ"), µ("µ"), β("β"), fx, fx_int, Efx_int, Varfx_int;
fx = (β/θ)*pow((x/θ),β-1)*exp((x/θ)^β);
cout << "f(x) = " << fx << endl;
fx_int = integrate(fx,x);
cout << "\n****... | ALGO | 0.940737 | 4.056445 |
c1f3b4e3-cf44-44f9-b4ee-33037d4e8910 | FilippoFantinato/simple-synthetiser | src/solvers/SimpleCoSafetySolver.cpp | #include "./SimpleCoSafetySolver.h"
SimpleCoSafetySolver::SimpleCoSafetySolver(const SafetyArena& arena, const Cudd& manager)
: GameSolver(arena, manager)
{
}
BDD SimpleCoSafetySolver::solve()
{
const auto& initial = _arena.initial();
const auto& compose = _arena.compose();
auto fixpoint = _manager... | ALGO | 0.999955 | 6.130263 |
ff08b25e-32b4-40d7-954c-5bdcc6f0d882 | changetheprophecy/OOP-with-cpp-by-E-Balagurusamy | Exercise 3.5 .cpp | /*3.5: An election is contested by five candidates. The candidates are numbered 1 to 5 and the voting is done by marking the candidate number on the ballot paper.
Write a program to read the ballots and count the vote cast for each candidate using an array variable count. In case, a number read is outside the range 1 t... | ALGO | 0.992617 | 4.129099 |
da2176dc-9265-434e-81bc-c5bdf0e16eec | alu0101030531/DfaToDot | Source/dfa.cpp | /**
Asignatura: Computabilidad y Algoritmia (CyA)
Curso: 2º
Práctica 6 CyA - Autómata Finito Determinista
Autor: Christian Jesús Pérez Hernández
Correo: <EMAIL>
Fecha: 27/10/2019
Archivo dfa.cpp: Define la clase dfa, permite construir un dfa dado un fichero, recorrer el dfa para un cadena dada,
... | ALGO | 0.998924 | 5.564203 |
e30f9703-f670-4ba9-8b77-5626c42b8ea9 | sheeluofficial/practice | OthersCode/LeetCode-Solutions-master/LeetCode-Solutions-master/C++/array-transformation.cpp | // Time: O(n^2)
// Space: O(n)
class Solution {
public:
vector<int> transformArray(vector<int>& arr) {
while (is_changable(arr)) {
auto new_arr = arr;
for (int i = 1; i + 1 < arr.size(); ++i) {
new_arr[i] += int(arr[i - 1] > arr[i] && arr[i] < arr[i + 1]);
... | ALGO | 0.999998 | 5.576945 |
253f561a-c1e1-4fdb-972c-77e32240631e | Showrov-CoU/Codeforces-Solution | C_Unique_Number.cpp | #include <bits/stdc++.h>
#define PI 2*acos(0.0)
#define ll long long int
#define ull unsigned long long int
#define MOD 1e9+7
#define endl ("\n")
#define vector vector<ll>
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/__gcd(a,b)))
#define loop(i,... | ALGO | 0.999311 | 4.082367 |
1a8025ed-1ac5-42c0-b86e-0dfdc5540210 | hzfsls/leetcode-supercrawl | data/1156.swap-for-longest-repeated-character-substring/code_snippets/sol.cpp | class Solution {
public:
int maxRepOpt1(string text) {
}
}; | ALGO | 0.999396 | 5.512339 |
a977a532-0f1b-494f-a32c-d763d584acf2 | amsraman/Competitive_Programming | Google CodeJam/2019/Qualification Round/D.cpp | #include <bits/stdc++.h>
using namespace std;
int t, n, b, f;
string res[5];
int main() {
cin >> t;
while(t--) {
cin >> n >> b >> f;
for(int i = 0; i < 5; i++) {
for(int j = 0; j < n; j++) {
cout << (((j & 31) >> i) & 1);
}
cout << endl;
... | ALGO | 0.99926 | 3.142766 |
467e38ea-65ba-4904-8cd8-aad97717e44c | ishandutta2007/codeforces | chen_zexing/normal/1520/A.cpp | #include <stdio.h>
#include<iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <climits>
#include <set>
#include <unordered_map>
#include <time.h>
#include <map>
#include <stack>
#include <unordered_set>
#define hash hassh
using namespace st... | ALGO | 0.999959 | 4.041304 |
b8cc443c-88f4-4f4f-94ef-9cde32b3f408 | Irfan-Ali01/Data-Structure-Labs | lab7_3.cpp | // infix and postfix with stack
#include <iostream>
#include <stack>
using namespace std;
int prcd (char op){
if (op == '+' || op == '-') return 1;
if (op == '*' || op == '/') return 2;
return 0;
}
bool isOp(char c){
return c == '+' || c == '-' || c == '*' || c == '/';
}
string itp (string infix){... | ALGO | 0.999001 | 4.485058 |
2edb25cd-3c40-4eef-8c91-ca413c8de9dc | saikatchakraborty49/-CrackYourInternship | Stacks and Queues/nextGreaterElement.cpp | class Solution {
public:
vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
stack<int>st;
st.push(INT_MIN);
int n2=nums2.size();
int n1=nums1.size();
unordered_map<int,int>mpp;
vector<int>ans2(n2);
vector<int>ans1(n1);
for(int i=n... | ALGO | 0.999957 | 5.738997 |
65e425ff-a5ac-4d16-960e-293aa5b21d02 | imtypist/algorithm-note | codeup/AOE.cpp | #include <cstdio>
#include <map>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
const int maxn = 20;
const int INF = 1000000000;
map<char, int> charToInt;
map<int, char> intToChar;
stack<int> topOrder;
int G[maxn][maxn];
int inDegree[maxn],ve[maxn],vl[maxn];
bool topologicalSort(int n){
... | ALGO | 0.999942 | 3.992428 |
99d428cf-d3d9-4eab-b1bb-d6e295576348 | OpenSEMC/android_frameworks_av | media/libstagefright/codecs/amrnb/common/src/div_32.cpp | /*
Filename: /audio/gsm_amr/c/src/div_32.c
------------------------------------------------------------------------------
REVISION HISTORY
Description: Updated template. Changed function interface to pass in a
pointer to overflow flag into the function instead of using a
global flag. R... | ALGO | 0.999179 | 6.673717 |
1b7d1e51-1d8e-4bf4-b528-48c8bdf36b04 | ChristodoulosPappas/HOBBIT-Space-Efficient-zkSNARK-with-Optimal-Prover-Time | src/merkle_tree.cpp |
#include "config_pc.hpp"
#include "merkle_tree.h"
#include <vector>
#include <math.h>
#include <omp.h>
#include "virgo_prime_field.h"
#include "fieldElement.hpp"
#include <unistd.h>
using namespace std;
int merkle_tree::size_after_padding;
void merkle_tree::get_int32(vector<unsigned int> &arr, __hhash_digest hash){... | ALGO | 0.999223 | 3.888633 |
e243475f-c658-41b7-b0f3-c43bb1cfb221 | devjwsong/algorithm-study | leetcode/1603.cpp | #include <iostream>
using namespace std;
class ParkingSystem {
public:
int numBigs = 0, numMediums = 0, numSmalls = 0;
int maxBigs = 0, maxMediums = 0, maxSmalls = 0;
ParkingSystem(int big, int medium, int small) {
maxBigs = big;
maxMediums = medium;
maxSmalls = small;
}
... | ALGO | 0.981472 | 5.657543 |
6f9a2677-1b85-4b60-bed3-f1f9857b0716 | cwjc/algorithm_code | FOJ/FOJ-1003.cpp | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
long long n;
int Ans[15];
char myLeft[6],myRight[6],myState[6];
int leng;
void MarkRest(char* s1,char* s2,int len)
{
int i;
int temp[15];
for(int i=0;i<len;i++)
{
temp[s1[i]-'A']=1;
temp[s2[i]-'A']=1;
}
for(int i... | ALGO | 0.999416 | 3.380527 |
75f3b5be-9cb7-4246-982f-1cae191304e3 | mohit2b/Codeforces-Solution | 1398A. Bad Triangle.cpp | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long int
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#... | ALGO | 0.999682 | 3.64237 |
a8645a19-fe0a-4d39-b6ac-bd4f0d3c19b7 | yinyanghu/ProjectEuler | problem1-50/problem32.cpp | #include <iostream>
#include <cstring>
//#include <memory>
#include <algorithm>
#include <vector>
using namespace std;
bool flag[10];
bool check(int x)
{
bool backup[10];
memcpy(backup, flag, sizeof(flag));
while (x)
{
if (!backup[x % 10]) return false;
backup[x % 10] = false;
x /= 10;
}
if (!backup[0]) re... | ALGO | 0.999777 | 3.738675 |
e99731db-eac6-4ae4-a563-7284241efb6c | aajibade1/Circuit-Partition-Algorithm- | eigen/doc/examples/Tutorial_BlockOperations_colrow.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace std;
int main()
{
Eigen::MatrixXf m(3,3);
m << 1,2,3,
4,5,6,
7,8,9;
cout << "Here is the matrix m:" << endl << m << endl;
cout << "2nd Row: " << m.row(1) << endl;
m.col(2) += 3 * m.col(0);
cout << "After adding 3 times the first colu... | ALGO | 0.992064 | 3.576145 |
bca89967-377f-4e7d-b9bc-e48978a1cc21 | Harshita781/DSA | Recursion/Rate_In_a_maze.cpp | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool isSafe(int x,int y,int n,vector<vector<int>> visited,vector<vector<int>> &m){
if((x>=0 && x<n) && (y>=0 && y<n) && visited[x][y]==0 && m[x][y]==1){
return true;
}
else{
return false;
}
}
void solve(vector<v... | ALGO | 0.999994 | 4.971761 |
2a176a5a-2ab9-4847-b502-5ecbb4f7be9e | HYDRO2070/Love-Babbar-DSA | Dynamic Programming (D.P.)/unique_binary_search_tree.cpp | // in this question we have been given N which represent the number of node of a tree. we have to retrun the no of unique BST make by the n nodes.
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// int solve(int n,vector<int> &dp){
// if(n == 0 || n == 1) return 1;
// if(dp[n] != -1) return... | ALGO | 0.999986 | 5.267376 |
32c14ec9-aef4-4d98-a08b-2b3d7754d4d8 | iammrinal98/HackerRank---Problem-Solving | Birthday Cake Candles.cpp | #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdlib>
#include <map>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
scanf("%d",&n);
int highest=-1, cnt=0;
for (int i=0;i<n;i++)
{
int h;
scanf("%... | ALGO | 0.999865 | 3.805221 |
f6eae241-f123-448c-9abe-cf2e1bb11959 | ujjwalkumardas/program.cpp | arrays/53nd.cpp | #include <iostream>
using namespace std;
int main()
{
int arr[9], f = 0;
for (int i = 0; i < 9; i++)
{
int n;
cout << "enter the no =";
cin >> n;
arr[i] = n;
}
int n;
cout << "enter the searching element = ";
cin >> n;
for (int i = 0; i < 9; i++)
{
... | ALGO | 0.994786 | 3.932688 |
90535271-0f77-44bb-859a-107dbaf8542f | ishandutta2007/codeforces | dmitrygrigorev/normal/1161/A.cpp | #include <bits/stdc++.h>
#define int long long
using namespace std;
main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(k);
for (int i=0; i < k; i++) cin >> v[i];
vector<int> was(n);
fill(was.begin(), was.end(), 0);
vector<bool> checked(n);
... | ALGO | 0.99997 | 3.475367 |
fda355f1-b3f7-4a3b-a2b4-55533d1cf04f | ROCm-Developer-Tools/llvm-project | libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp | // <algorithm>
// template<ForwardIterator Iter>
// requires OutputIterator<Iter, Iter::reference>
// && EqualityComparable<Iter::value_type>
// constexpr Iter // constexpr after C++17
// unique(Iter first, Iter last);
#include <algorithm>
#include <cassert>
#include <memory>
#include "test_macr... | TEST | 0.967341 | 6.715465 |
a92b261d-3bc8-435c-a15b-63a28fb5091c | AlexandruValeanu/Competitive-Programming | Infoarena/Suma5.cpp | #include <bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 1;
struct Node
{
long long lazy;
long long sumaInt, sumaQuery;
int capatSt, capatDr;
Node()
{
lazy = sumaInt = sumaQuery = 0;
capatSt = capatDr = 0;
}
long long real_sum() const
{
return sum... | ALGO | 0.999794 | 5.002003 |
6e0f5726-0180-4d87-b8b6-008986c4cab0 | AbhijitDoesCoding/Coding | A_Valera_and_X.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define nline cout<<"\n";
#define yes cout<<"Yes\n";
#define no cout<<"No\n";
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#defi... | ALGO | 0.999977 | 4.483207 |
9bb8851c-5113-49ee-86ef-1f6da2383491 | fudoge/Problem_Solving | 0260-single-number-iii/0260-single-number-iii.cpp | class Solution {
public:
vector<int> singleNumber(vector<int>& nums) {
int XOR = accumulate(nums.begin(), nums.end(), 0, bit_xor<>());
int i = 0;
while(((XOR >> i) & 1) == 0) i++;
int A = 0, B = 0;
for(int x : nums) {
if(((x >> i) & 1) == 0) {
A ... | ALGO | 0.999991 | 5.544151 |
79ca0965-2c1d-45a2-a1a7-0a8ba73c94a2 | kpjgit/study | baek/stack/tower.cpp | //2493
#include <bits/stdc++.h>
int N;
int main(void) {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin >> N;
std::stack<std::pair<int, int>> tower;
tower.push({1000000001, 0});
int input;
for(int i = 1; i <= N; i++) {
std::cin >> input;
while(tower... | ALGO | 0.999935 | 4.486628 |
9ed8ca46-51a5-4091-85b6-97b077ce04f8 | PriyanshK09/Leetcode-Discord-Bot | solutions/employee-importance.cpp | // Time: O(n)
// Space: O(h)
/*
// Employee info
class Employee {
public:
// It's the unique ID of each node.
// unique id of this employee
int id;
// the importance value of this employee
int importance;
// the id of direct subordinates
vector<int> subordinates;
};
*/
class Solution {
pub... | ALGO | 0.999889 | 6.700421 |
ceb3110c-8144-40a0-8df7-b6a69b5c41b8 | wenfrid/algorithm | en/codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp | /**
* File: linkedlist_stack.cpp
* Created Time: 2022-11-28
* Author: qualifier1024 (<EMAIL>)
*/
#include "../utils/common.hpp"
/* Stack class based on linked list */
class LinkedListStack {
private:
ListNode *stackTop; // Use the head node as the top of the stack
int stkSize; // Length of the st... | ALGO | 0.998183 | 5.818768 |
c195bcdb-1fec-47b6-8d1d-9b5a7d98bc76 | SamProkopchuk/coding-problems | hackerrank/countingsort4/solution.cpp | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
struct item {
int i;
string s;
bool dash;
};
int cmp(const item& a, const item& b) {
return a.i < b.i;
}
int main() {
int n;
cin >> n;
vector<item> v(n);
for (int i=0; i<n; ++i) {
cin >> v[i].i;
cin >> v[i].s;... | ALGO | 0.999942 | 4.088598 |
9c1b66a7-6e72-49df-b54c-2bf7ebd9a934 | anubhavsinghgtm/DSA | 2. Array/10-minimum-height.cpp | /*
Problem from the GFG
problem link:
https://practice.geeksforgeeks.org/problems/find-duplicates-in-an-array/1?page=1&category[]=Arrays&sortBy=submissions
=====================================================================================
*/
#include<bits/stdc++.h>
using namespace std;
void minimumheight(int ... | ALGO | 0.999543 | 4.310924 |
1747535f-7cce-4f3b-9183-20bbddab6dfa | Anachor/HellBent | Ashiq's Code Library/data structure/segtree pt upd range sum.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int tree[4*N] , a[N]; /// be careful with overflow
void build (int cn,int b,int e) {
if (b == e) {
tree[cn] = a[b];
return;
}
int lc = 2*cn, rc = lc+1, mid = (b+e)/2;
build(lc,b,mid);
build(rc,mid+1,e);
tree[c... | ALGO | 0.999854 | 3.874856 |
d64bacbc-1b53-4272-af87-303433361fb8 | divyanshusharma3031/leetcode | Optimal Strategy For A Game - GFG/optimal-strategy-for-a-game.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//Function to find the maximum possible amount of money we can win.
class Solution{
public:
int dp[1001][1001][2];
long long solve(int i,int j,bool b,int arr[])
{
if(i>=j)
{
return 0;... | ALGO | 0.999953 | 6.126776 |
afcacb7c-4349-496e-a715-be39bbcd054f | ikeji/openjdk7-hotspot | src/share/vm/runtime/advancedThresholdPolicy.cpp | #include "precompiled.hpp"
#include "runtime/advancedThresholdPolicy.hpp"
#include "runtime/simpleThresholdPolicy.inline.hpp"
#ifdef TIERED
// Print an event.
void AdvancedThresholdPolicy::print_specific(EventType type, methodHandle mh, methodHandle imh,
int bci, CompLevel ... | TOOL | 0.981592 | 6.987879 |
d7370f61-4916-4247-846e-86e9ff4e0005 | n1khilmane/Leetcode | 153-find-minimum-in-rotated-sorted-array/153-find-minimum-in-rotated-sorted-array.cpp | class Solution {
public:
int findMin(vector<int>& nums) {
if(nums.size()==1)
return nums[0];
int left=0, right = nums.size()-1;
if(nums[right]>nums[0])
return nums[0];
while(right>=left)
{
int mid = left + (right... | ALGO | 0.999993 | 5.583423 |
98463758-4a78-40c8-8d44-3a5064a675d2 | ryojimabuchi/AtCoder | AtCoder/ABC/061/B.cpp | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int city[51] = {};
while(M-- > 0){
int a, b;
cin >> a >> b;
city[a - 1]++;
city[b - 1]++;
}
for(int i = 0; i < N; ++i){
cout << city[i] << endl;
}
}
| ALGO | 0.999979 | 4.37125 |
f5bd1bd9-1d34-40d1-9ad1-1c2e87692e10 | kartik9436/pooja | AI/selection&prims.cpp | #include <iostream>
#include <limits>
#include <algorithm> // for std::swap
using namespace std;
// Selection Sort on a plain array
void selectionSort(int a[], int n) {
for (int i = 0; i + 1 < n; ++i) {
int minIdx = i;
for (int j = i + 1; j < n; ++j) {
if (a[j] < a[minIdx])
... | ALGO | 0.999524 | 4.995516 |
4c4107c2-8a60-43b5-bd58-fa718e0d216c | a-rison/DSA | oops/exceptionHnadling.cpp | #include <bits/stdc++.h>
using namespace std;
int division(int a, int b)
{
if (b == 0)
throw 1;
return a / b;
}
int main()
{
int x = 10, y = 0, z;
try
{
z = division(x, y);
cout << z << endl;
}
catch (int e)
{
cout << "Division by zero" << '\n';
}
... | TOOL | 0.962319 | 4.527577 |
c1af3178-b871-47ae-a4fb-7adc449d22e7 | Anishukla/Codechef_Hacktoberfest-2021 | Codechef-2019/FEB19A/GUESSRT.cpp | /*
@author: Ilias Khan
====
Link to the problem:
https://www.codechef.com/FEB19A/problems/GUESSRT
Link to my profile:
https://www.codechef.com/users/iliaskhan
*/
#include <iostream>
#include<cstdio>
using namespace std;
long upp(long l, long r, long n)
{
if (r == 0)
return 1;
long h = upp(... | ALGO | 0.999932 | 3.86491 |
660ab5e7-1b6d-497c-a921-a82803ac06d5 | abhinavrapartiwar/DSA-Journey | Binary Search Algorithms/Ceiling_of_number.cpp | #include <iostream>
using namespace std;
int ceiling(int arr[], int t, int l)
{
int start, mid, end;
start = 0;
end = l - 1;
while (start <= end)
{
mid = start + (end - start) / 2;
if (arr[mid] > t)
end = mid - 1;
else if (arr[mid] < t)
start = mid + 1... | ALGO | 0.999962 | 5.380195 |
7c6c1d69-0085-417d-a92d-c291ea663167 | vuthehung/CTDL-GT | queue/solocphat3.cpp | #include<bits/stdc++.h>
using namespace std;
vector<string> res;
void init() {
queue<string> q;
q.push("6");
q.push("8");
res.push_back("6");
res.push_back("8");
while(1) {
string t1 = q.front(); q.pop();
if(t1.length() == 15) break;
res.push_back(t1 + "6");
res.push_back(t1 + "8");
q.push(t1 + "6");
... | ALGO | 0.999693 | 4.53983 |
c98e311e-4a8e-40bf-8a6b-a1d9c527bbf2 | Devansh8954/program-cpp | String array program/Compress_the_String.cpp | #include <iostream>
#include <cstring>
#include<string>
using namespace std;
string getCompressedString(string &input) {
// Write your code here.
int count = 1;
int k=0;
char lastCh = input[0];
for(int i=1; i<=input.length(); i++)
{
if(input[i] == lastCh)
{
coun... | ALGO | 0.999988 | 5.389516 |
a191b671-3664-43f6-885b-9b954ac7464f | Haroon-64/Flutter_apps | start/windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998574 | 6.776823 |
946760b0-68c5-4998-ae34-bc6144c61372 | XiaoChan3655/cs106b | Assignment 6/Apportionment.cpp | #include "Apportionment.h"
#include "HeapPQueue.h"
#include "cmath"
using namespace std;
Map<string, int> apportion(const Map<string, int>& populations, int numSeats) {
/* TODO: Delete this line and the lines below it, then implement this function. */
HeapPQueue pq;
Map<string, int> stateSeats;
for (st... | ALGO | 0.992417 | 6.253255 |
978f5efc-581e-4f5e-bab6-5b585fd7d4fd | prakharmosesOK/ChatApplication | Core/Source/Core/ExtraRes/BoostAiso/boost_1_84_0/libs/metaparse/example/meta_metaparse/main.cpp | #define BOOST_MPL_LIMIT_STRING_SIZE 64
#define BOOST_METAPARSE_LIMIT_STRING_SIZE BOOST_MPL_LIMIT_STRING_SIZE
#include <boost/metaparse/grammar.hpp>
#include <boost/metaparse/string.hpp>
#include <boost/metaparse/build_parser.hpp>
#include <boost/metaparse/token.hpp>
#include <boost/metaparse/entire_input.hpp>
#includ... | TOOL | 0.912384 | 6.584231 |
128fb1c0-f47b-4d86-8cc5-a2b31a4d6e2c | SanketRKakade/Leetcode-Solved | 0023-merge-k-sorted-lists/0023-merge-k-sorted-lists.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* mergeKLists... | ALGO | 0.999836 | 6.074543 |
a3982e7c-8e3d-4f59-aff3-72456be12f0a | kinleyrabgay/flutter_grocery_bloc | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998784 | 6.761023 |
382355e7-84b3-43e2-b46c-4c3d8f674c92 | hookflash/obsolete.opbb10 | hookflash-libs/boost/libs/math/example/inverse_gamma_example.cpp | // inverse_gamma_example.cpp
// Example 1 of using inverse gamma functions.
#include <boost/math/special_functions/gamma.hpp>
using boost::math::gamma_p_inv; // Compute x given a
//using boost::math::gamma_q_inv;
//using boost::math::gamma_p_inva; // Compute a given x
//using boost::math::gamma_q_inva;
#include <io... | ALGO | 0.885119 | 4.164167 |
7ffd7db7-bdc3-4626-b0c5-69a1566119c8 | XianweiCheng01/gem5_SALAM | ext/llvm/llvm-9.0.0.src/utils/TableGen/OptParserEmitter.cpp | #include "llvm/TableGen/Error.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SmallString.h"
#include "llvm/ADT/Twine.h"
#include "llvm/TableGen/Record.h"
#include "llvm/TableGen/TableGenBackend.h"
#include <cctype>
#include <cstring>
#include <map>
using namespace llvm;
// Ordering on Info. The logic should ma... | TOOL | 0.854277 | 7.843121 |
a7d8648e-251a-4c4f-98f0-ce5e128c80dc | sireButItsUnique/solutions-23-24 | ccc/16/j2.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int square[4][4], magikNum = 0;
// cin.ignore(1);
for (int i = 0; i < 4; i++) {
string buffer, numBuffer;
int numNum = 0;
getline(cin, buffer);
for (int j = 0; j < buffer.size(); j++) {
if (buffer.at(j) == ' ') {
square[i][numNum] = atoi(num... | ALGO | 0.999739 | 4.33896 |
edf893af-823d-41e8-a7dd-0932d3210f1a | akshat-o5/Data-Structures-and-Algorithms | Revision/DP/NumberOfCoins.cpp | // https://www.geeksforgeeks.org/problems/number-of-coins1824/1
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
// Top Down Approach || Recursion + Memoization
int solve(vector<int> &coins, vector<int> &dp, int M, int sum){
if(sum=... | ALGO | 0.999993 | 5.979397 |
6bcc47f3-b210-4df3-a0f6-205683f32e38 | Farhana-Najnin/Algorithm | module 3/merge_sort_implementation.cpp | //increasing
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+7;
int nums[N];
void merge(int l,int r,int mid){
int left_size=mid-l+1;
int L[left_size+1];
int right_size=r-mid;
int R[right_size+1];
for(int i=l,j=0;i<=mid;i++,j++)
L[j]=nums[i];
for(int i=mid+1,j=0;i<=r;i++,j++)
R[j]=nums[i];
L[left_si... | ALGO | 0.999994 | 4.4811 |
7a8dee92-a8dd-47e8-a569-a892384ad564 | goodchai0/Problems | 1328-break-a-palindrome/1328-break-a-palindrome.cpp | class Solution {
public:
string breakPalindrome(string palindrome) {
bool flag=0;
int n=palindrome.size();
if(n<2){
return "";
}
for(int i=0;i<n;i++){
if(n&1 && n/2==i){
continue;
}
//cout<<palindrome[i]<<endl;
... | ALGO | 0.99625 | 3.965333 |
b19c14ae-1d12-4d22-b9db-7ad867e12c83 | ACyming/OI | c++/比赛/洛谷/【LGR-196-Div.4】洛谷入门赛 #26/游戏与共同语言.cpp | #include <bits/stdc++.h>
using namespace std;
int w[3], c[3], t[3];
int main() {
cin >> w[1] >> c[1] >> t[1];
cin >> w[2] >> c[2] >> t[2];
if (w[1] > w[2])
cout << "A";
else if (w[1] < w[2])
cout << "B";
else {
if(c[1] > c[2]) cout << "A";
else if(c[1] < c[2]) cout <<... | ALGO | 0.99993 | 4.116799 |
c2ccf1ce-0911-48b5-ab30-3315abc705b7 | gagreen/Algorithm | baekjoon/baekjoon_4948.cpp | #include <stdio.h>
#include <math.h>
/* \佺׳ ü*/
void getEratos(bool *eratos, int end) {
int i, j;
// ظ one-base ۼѴ.
// 2 end true ʱȭ
for(i=2; i<=end; i++) { eratos[i] = true; }
for(i=2; i<=sqrt(end); i++) { // 2 end (ִ ִ )
if(eratos[i]) {
for(j=i*2; j<=end; j+=i) {
eratos[j] = false;
}
... | ALGO | 0.999937 | 3.936426 |
4b93f182-8d2e-4304-876b-b61bef1084f1 | varelandrew/DepthSpectrum | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998689 | 6.787361 |
23095d3c-7760-46f7-9ae4-c6076966d709 | vbonnici/grafe-sim | analysis/data/p01143/s557528046.cpp | #include<iostream>
using namespace std;
int main(){
int N,M,P;
while(cin>>N>>M>>P){
if(N==0)break;
int c=0;
int d[1100]={},cn=0;
for(int i=1;i<=N;i++){
cin>>c;
d[i]=c;
cn+=c;
}
if(d[M]==0){
cout<<0<<endl;
}
else{
cout<<((cn*(100-P))-((cn*(100-P))%d[M]))/d[M]<<endl;
}
}
return 0;
} | ALGO | 0.999727 | 3.124828 |
9ae37cef-07db-4d59-a451-774b228fd5fd | raincross7/code-similarity | codes/train_code/problem485/problem485_380.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<... | ALGO | 0.99869 | 4.111081 |
fae31e35-9dd1-4469-abca-67111d3b0739 | atcoder/ac-library | test/example/mincostflow_practice.cpp | #include <atcoder/mincostflow>
#include <iostream>
using namespace std;
using namespace atcoder;
const long long BIG = 1'000'000'000;
int main() {
int n, k;
cin >> n >> k;
/**
* generate (s -> row -> column -> t) graph
* i-th row correspond to vertex i
* i-th col correspond to vertex n + ... | ALGO | 0.99986 | 4.028921 |
f72a01ff-43fd-4a99-9e03-a7965340d6eb | ishandutta2007/codeforces | nishant403/normal/1469/A.cpp | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r)
{
uniform_int_distribution<int> uid(l, r);
return uid(rng);... | ALGO | 0.999313 | 4.509444 |
aa840096-8353-4ccc-8414-7e64c214fae2 | kurdybacha/advent-of-code-2024 | day03/solve.cpp | #include <print>
#include <regex>
#include "../utils.h"
using namespace std;
uint64_t parse_and_count(const string file_name, bool enable_inst = false) {
regex expr_regex("do\\(\\)|don't\\(\\)|mul\\((\\d{1,3}),(\\d{1,3})\\)");
fstream file{file_name};
string line;
uint64_t result = 0;
bool enable... | TOOL | 0.960786 | 5.459941 |
d0c7249c-942d-4757-b8ae-eaf0614b2840 | BanSheeGun/Learning | Algorithm/Experiment/1/C.cpp | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int a[10000000];
int x, i, n, ans;
int main() {
memset(a, 0, sizeof(a));
string aa = "1234005678904321";
a[0] = aa.length();
for ... | ALGO | 0.99997 | 3.282801 |
0820390c-754b-42ad-9053-e47cf0970595 | vivek6225/DSA | STACK/createStackbtArray.cpp | #include <bits/stdc++.h>
using namespace std;
class MyStack {
int top;
int* arr;
int size;
public:
MyStack(int size) {
arr = new int[size];
top = -1;
this->size = size;
}
void push(int data) {
if (top == size - 1) {
cout << "Stack overflow\n";
... | ALGO | 0.997724 | 5.225724 |
b78073f2-8260-46b2-a2e7-668579bf3820 | sevencoinz/sevencoinA18 | src/kernel.cpp | #include <boost/assign/list_of.hpp>
#include "kernel.h"
#include "db.h"
using namespace std;
extern int nStakeMaxAge;
extern int nStakeTargetSpacing;
// Modifier interval: time to elapse before new modifier is computed
// Set to 3-hour for production network and 20-minute for test network
unsigned int nModifierInt... | ALGO | 0.996816 | 6.053648 |
b8178763-7e53-426e-8597-a3475c4c7ca6 | devjiwon/baekjoon | 14681.cpp | #include <iostream>
using namespace std;
int main(){
int a, b;
scanf("%d %d", &a, &b);
if(a > 0 && b > 0){
printf("1");
} else if(a > 0 && b < 0){
printf("4");
} else if(a < 0 && b < 0){
printf("3");
} else{
printf("2");
}
return 0;
} | ALGO | 0.999983 | 3.742987 |
57734908-2424-46ef-a618-1b3acf5f0e6a | abhishekrane/Automating_Simulation | lammps-11Aug17/src/ntopo_bond_template.cpp | #include <mpi.h>
#include "ntopo_bond_template.h"
#include "atom.h"
#include "atom_vec.h"
#include "force.h"
#include "domain.h"
#include "update.h"
#include "output.h"
#include "thermo.h"
#include "molecule.h"
#include "memory.h"
#include "error.h"
using namespace LAMMPS_NS;
#define DELTA 10000
/* -----------------... | ALGO | 0.961709 | 5.377292 |
2bd69c58-64f7-4dbd-866d-68f47b687b40 | Blueblack319/apws25 | matmul/util.cpp | #include "util.h"
#include <cuda_runtime.h>
#include <omp.h>
#include <sys/time.h>
#include <cmath>
#include <cstdbool>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define CHECK_CUDA(call) \
do { ... | TOOL | 0.868654 | 5.088942 |
a9df1acf-a384-4991-9469-80dccf67dd13 | ishandutta2007/codeforces | bidzilya/normal/342/B.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
int s, f;
cin >> n >> m >> s >> f;
--s;
--f;
int dx;
char cdx;
if (s < f) {
dx = +1;
cdx = 'R';
} else {
dx = -1;
... | ALGO | 0.999979 | 3.358663 |
a8f41525-e5a9-4cfd-bdc7-cdfc403ae2c4 | raincross7/code-similarity | codes/train_code/problem432/problem432_143.cpp | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | ALGO | 0.999949 | 3.813823 |
ea6950b6-57ab-419c-9662-1c1dfa4a3a04 | raincross7/code-similarity | codes/train_code/problem326/problem326_200.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int N, K, X, Y, result;
cin>>N;
cin>>K;
cin>>X;
cin>>Y;
if(N>K){
cout<< X*K + Y*(N-K);
}else{
cout<< X*N;
}
}
| ALGO | 0.998928 | 3.120893 |
b8339189-8e5d-4a39-8432-94cee4c34fcb | bsdelf/research | shm/main.cpp | #include <iostream>
#include "scx/SemVar.hpp"
using namespace scx;
using namespace std;
#include <unistd.h>
#include <semaphore.h>
#include <sys/fcntl.h>
#include <sys/shm.h>
#include <sys/ipc.h>
void parent(sem_t* semp, int shmid) {
int* data = (int*)shmat(shmid, NULL, 0);
int x;
while (true) {
cin >> ... | TOOL | 0.859065 | 3.387349 |
61725657-6a01-49d6-bb96-e5f6a04d04c9 | ivandavoid/Competitive-Programming | Vao10/chinhthuc/BAI2.cpp | #include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define sti stack<int>
#define stll stack<long long>
#define pf push_front
#define sz size()
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define str string
#define ... | ALGO | 0.99995 | 3.780169 |
fd5bb4c8-02f4-49c4-a6a3-45c67e4b7f08 | HyeonseopJeong/ProblemSolving | 2021summer/week1/2-2.cpp | // 2-2. OX퀴즈 https://www.acmicpc.net/problem/8958
#include <iostream>
#include <string>
using namespace std;
int main() {
int tc; cin >> tc;
while(tc--) {
string s;
cin >> s;
int cnt, score;
cnt = score = 0;
for(const char & ch : s) {
if(ch == 'O') score += ++cnt;
else cnt = 0;
... | ALGO | 0.999613 | 6.146044 |
5e096182-b247-4c57-adc6-4c5d9abedfc9 | Subrat29/100DaysCodingChallenge | Sorting Algorithm/Make all array elements equal with minimum cost/app1.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int computeCost(int arr[], int N, int X)
{
int cost = 0;
for (int i = 0; i < N; i++)
cost += abs(arr[i] - X);
return cost;
}
int minCostToMakeElementEqual(int arr[], int N)
{
int low, high;
low = high = arr[0];
for (int i = 0; i ... | ALGO | 0.999851 | 5.063235 |
a00de257-32c3-4c7f-99de-11f3f2eaa6fe | Arsh-2811/DSA | sorting.cpp | #include <iostream>
#include <algorithm>
using namespace std;
void print_array(int arr[], int n){
for(int i = 0; i < n; i++){
cout << arr[i] << " ";
}
cout << endl;
}
void bubblesort(int arr[], int n){ // Bubble sort is a stable sorting algorithm and also in place as it does not require any ext... | ALGO | 0.999982 | 4.976445 |
348029d7-ae85-411e-9ad0-1d6d07ff8837 | hsh0128/algorithm | 기본 수학1(백준)/2839.cpp | #include <stdio.h>
// N = 3X + 5Y (N은 3~5000 사이의 상수, X와 Y는 변수)
// X + Y 의 최솟값을 구하라 (Y의 최대, X의 최소를 구하면 된다)
// 5Y = N - 3X
// Y = (N - 3X) / 5
int main() {
int N, X, Y = -1;
scanf_s("%d", &N);
for (X = 0; 3 * X <= N; X++) {
if ((N - 3 * X) % 5 == 0) {
Y = (N - 3 * X) / 5;
break;
}
}
if (Y == -1) X = 0... | ALGO | 0.999881 | 3.43512 |
764db599-5f74-4870-9205-a4365cdd807e | subham159/Cpp | Perimeterofrectangle.cpp | #include<iostream>
using namespace std;
int main(){
int l,b,perimeter;
cout<<"Enter the length and breath:--";
cin>>l>>b;
perimeter=2*(l*b);
cout<<"The Premeter of Rectangle is :--- "<<perimeter;
return 0;
} | TOOL | 0.971266 | 3.607425 |
c1c2953e-a134-4e85-8baf-212d8c017d8c | Jh-jaehyuk/BOJ | BOJ/10000++/17000~/17071.cpp | //
// 17071.cpp
// BOJ
//
// Created by J213h on 2023/09/11.
//
#include <bits/stdc++.h>
using namespace std;
static queue<pair<int, int>> myqueue;
static int visited[500001][2];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
fill(&visited[0][0],... | ALGO | 0.999978 | 4.590548 |
7011a764-02e5-4572-b377-c1175b58a69b | JawadSher/DSA-LeetCode-GFG-Problems-Repository | 24 - Dynamic Programming Problems/11 - 0-1 Knapsack Problem/02 - Top-Down | DP | Approach.cpp | class Solution {
public:
// Recursive function with memoization to solve the knapsack problem
int solve(int capacity, vector<int> &value, vector<int> &weight, int index, vector<vector<int>>& dp){
// Base case: If we are at the first item (index 0)
if(index == 0){
// If the... | ALGO | 0.999999 | 6.724764 |
79a4b56a-3999-4aac-8a6a-302cbd54129e | krasimir-p/WhileLoop | Dishwasher2/Dishwasher2.cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
const int DETERGENT_FOR_A_DISHE = 5;
const int DETERGENT_FOR_A_POT = 15;
const int BOTTLE_DETRGENT_CAPACITY = 750;
int bottles;
cin >> bottles;
string input;
int loading = 0, dishes = 0, pots = 0, differ = 0;
wh... | ALGO | 0.997239 | 4.426504 |
5a4df83f-b3e0-466f-9bf0-debed8cbb687 | sandialabs/StrideSearch | python/StrideSearchUtilities.cpp | #include "Python.h"
#include "StrideSearchUtilities.h"
#include <cmath>
// static const double deg2rad = std::atan(1.0) / 45.0;
void llToXYZ(double& x, double& y, double& z, const double& lat, const double& lon){
x = std::cos(deg2rad * lat) * std::cos(deg2rad * lon);
y = std::cos(deg2rad * lat) * std::sin(deg... | TOOL | 0.99543 | 6.452632 |
cace0a04-afa7-47bc-be51-04732f7e349e | CN-DXTZ/Online-Judge | LeetCode_C++/010_isMatch.cpp | #include<iostream>
#include<string>
#include<vector>
using namespace std;
class Solution
{
#define 正则表达式
// "."可匹配任意一个字符; "x*"整体可匹配任意（0~n）个"x"
public:
// 法二: 动态规划
bool isMatch(string s, string p)
{
int len_s = s.size(), len_p = p.size();
// dp[i][j] 表示 s[0...i - 1] 和 p[0...j - 1] 匹配
vector<vector<bool>> dp... | ALGO | 0.999159 | 3.754801 |
1b3f8de3-f5cc-4932-82e3-d3efe9bde1c9 | txxxxc/competitive-programming | educational_90/index.cpp | #include <bits/stdc++.h>
using namespace std;
#define debug(arg) std::cerr << #arg << ": " << (arg) << '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
void add(int &a, int b) {
int MOD = 1000000007;
a += b;
if (a >= MOD) a -= MOD;
}
int main() {
int N; cin >> N;
string S; cin >> S... | ALGO | 0.99997 | 4.384337 |
fe220af4-456e-4318-ac32-f5c9732e85db | Mukit09/UVA_Solution | 11787.cpp | #include<stdio.h>
#include<string.h>
long a[100];
long cnt[100],i,l,incr,decr,sum,fg,t;
char ch[550];
int main()
{
a['B']=1;
a['U']=10;
a['S']=100;
a['P']=1000;
a['F']=10000;
a['T']=100000;
a['M']=1000000;
scanf("%ld",&t);
while(t--)
{
fg=cnt['B']=cnt['U']=cnt['S']=cnt['P']=cnt['F']=cnt['T']=cnt['M']=0;
... | ALGO | 0.997873 | 3.146758 |
97112ae1-a447-4066-a092-114389a3d2a9 | makio93/competitive-atcoder | abc204/abc204_a/main.cpp | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
#define rep(i, n) for (int i=0; i<(int)(n); ++(i))
#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))
#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))
#define rep3r(i, m, n) for (int i=(... | ALGO | 0.999928 | 3.814184 |
2b0afc28-fcf9-4721-9f14-f0f33a5aecc8 | dark733/Programs-Repo | MainDir/Basics/avg_of_two_numbers.cpp | #include <iostream>
float first_num,second_num,average_num,res;
float average(float first_num,float second_num);
int main(){
std::cout<<"Average of two numbers"<<std::endl;
std::cout<<"enter first number"<<std::endl;
std::cin>>first_num;
std::cout<<"enter first number"<<std::endl;
std::cin>>second_num;
res... | ALGO | 0.933388 | 3.937401 |
d9432c11-8a92-4003-b28e-52af0477075a | ravi2320/InterviewBit | 90. Move Zeroes.cpp | /*
Move Zeroes
Programming
Arrays
Medium
65.8% Success
172
4
Bookmark
Asked In:
Problem Description
Given an integer array A, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Note that you must do this in-place without making a copy of the array.
Problem Constraints
1 <... | ALGO | 0.999988 | 7.272519 |
4bb579a5-b8df-4078-aa4b-96ed2c1e3fda | sharmaji6880/LeetCode | Medium/insertion-sort-list.cpp | class Solution {
public:
ListNode* insertionSortList(ListNode* head) {
vector<int> arr;
ListNode *current=head;
while(current) {
arr.push_back(current->val);
current=current->next;
}
sort(arr.begin(),arr.end());
current=head;
int i=0;
... | ALGO | 0.999985 | 5.891303 |
815238fa-a64c-4756-89e5-c68b719ad768 | Aidyn-A/NektarWithScalar | library/Demos/MultiRegions/PostProcHDG3D.cpp | #include <cstdio>
#include <cstdlib>
#include <LibUtilities/Memory/NekMemoryManager.hpp>
#include <LibUtilities/BasicUtils/SessionReader.h>
#include <LibUtilities/Communication/Comm.h>
#include <MultiRegions/DisContField3D.h>
#include <SpatialDomains/MeshGraph3D.h>
//#define TIMING
#ifdef TIMING
#include <time.h>
#de... | ALGO | 0.998105 | 4.115963 |
a6e15ad7-9b04-4042-b857-b6110b575e6c | CodingPythonMan/CPPAdvanced | CPPSTL/STLDesign/ContainerIterator/container2.cpp | /*#include <iostream>
template<typename T> struct Node
{
T data;
Node* next;
Node(const T& a, Node* n) : data(a), next(n) {}
};
template<typename T> class slist_iterator
{
Node<T>* current = 0;
public:
slist_iterator(Node<T>* p = 0) : current(p) {}
slist_iterator& operator++()
{
current = current->next;
... | TOOL | 0.988796 | 3.685084 |
da18676b-4e81-49a6-b2e2-80cd2169b7c7 | vivekvinchhi/C---programs | pattern5.cpp | #include<iostream>
using namespace std;
// 1
// 23
// 456
// 78910
int main()
{
int n, count=1;
cin>>n;
for (int i = 1; i < n; i++)
{
for (int j = 1; j <= i ; j++)
{
cout<<i+j-1;
count = count+1;
}
cout<<endl;
}
return 0;
} | ALGO | 0.999824 | 3.932632 |
3f288543-3af3-48ea-a3a6-166ccfcceae7 | samuelliao/PDF_DRM_CSHARP | ext/sumatra/src/EbookDoc.cpp | #include "BaseUtil.h"
#include "EbookDoc.h"
#include "ByteReader.h"
#include "FileUtil.h"
#include "HtmlPullParser.h"
#include "MobiDoc.h"
#include "PdbReader.h"
#include "TrivialHtmlParser.h"
#include "WinUtil.h"
#include "ZipUtil.h"
inline WCHAR *FromHtmlUtf8(const char *s, size_t len)
{
ScopedMem<char> tmp(str... | TOOL | 0.86776 | 5.773436 |
a57ad4e5-6e61-49f5-a904-d161ed8bc922 | Tazri/Problem-Solving-By-C-and-C-Plus-Plus | codeforce/1000/before-2025-3-mar-27/1913.B.SwapandDelete.cpp | // link : https://codeforces.com/problemset/problem/1913/B
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dl;
#define optimize() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define fraction() \
cout.un... | ALGO | 0.999591 | 4.796498 |
4c954165-1e84-4418-994a-be4d33f0eeb0 | Aayush8356/myCode | dsa/codechef/new.cpp | // { Driver Code Starts
//Initial template for C++
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution
{
public:
//Function to partition the array around the range such
//that array is divided into three parts.
void... | ALGO | 0.999977 | 5.505818 |
36d35f08-a401-42e0-8d71-8aad8bef391d | oMarceloMotta/quitanda_flutter | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.9988 | 6.76073 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.