uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
4bb23862-3d56-43cb-babb-45f66ec24502 | AltonDupre41/Alton-Unit-Test-Assignment | Main.cpp | #include <iostream>
#include <string>
#include <vector>
#include <typeinfo>
#include "MergeSort.h"
using namespace std;
bool is_number(const std::string& s)
{
std::string::const_iterator it = s.begin();
while (it != s.end() && std::isdigit(*it)) ++it;
return !s.empty() && it == s.end();
}
//Note, a good ... | ALGO | 0.994273 | 4.94466 |
96cfc835-2802-4b8c-ba6f-0942fa842adf | Swapno963/Phitron-Batch-3 | contest/Group Contest/sheet_6_math/G_Summation_of_its_divisors.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n; cin >> n;
long long sum = 0;
int root = sqrt(n);
for(int i=1; i<=root; i++)
if(n % i == 0){
sum +=i;
if(i != n/i)
sum += (n/i);
}
cout << sum << endl;
return 0;
} | ALGO | 0.999915 | 4.531778 |
921f2ae5-697f-417f-9651-ff2b2ada6eb4 | JaeKyungHeo/algorithm_practice_cpp | 10989.cpp | #include <iostream>
using namespace std;
int arr[10001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int k, N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> k;
arr[k]++;
}
int count = 0;
for (int i = 0; count != N;i++) {
if (arr[i] > 0) {
for (int j = 0; j < a... | ALGO | 0.999947 | 3.967149 |
5e4e4d21-926d-40ff-8983-a1e3bfca89d6 | suresh5189/Data-Structures-Algorithms | Recursion/Fibonacci.cpp | #include <bits/stdc++.h>
using namespace std;
FibonacciFunction(int n)
{
if (n <= 1)
return n;
int last = FibonacciFunction(n - 1);
int secondLast = FibonacciFunction(n - 2);
return last + secondLast;
}
int main()
{
int n;
cout << "Enter the Number :";
cin >> n;
cout << Fibonac... | ALGO | 0.999938 | 4.969204 |
cd1bbb26-20ea-4cf6-8404-c800d2bcc3b5 | Le-xiaoyu/AlgorithmPractice | KY168 求最大值/求最大值.cpp | // KY168 ţ ֵ
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int max = INT_MIN, n, temp;
while (cin) {
n = 10;
while (n != 0) {
cin >> temp;
if (temp > max) {
max = temp;
}
n--;
}
}
c... | ALGO | 0.997911 | 3.429721 |
77f317bc-e448-4855-8ed0-aa4c7d3eff78 | Jovi-Wong/Data-Structure-and-Algorithm | BTS/chap04.cpp | #include <iostream>
#include <limits>
#include <cstdlib>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <vector>
typedef int TYPE;
#define MIN (std::numeric_limits<TYPE>::min())
class BinaryTree
{
public:
class Node
{
public:
TYPE data;
Node *left;
Node *right;
Node *parent;
int d... | ALGO | 0.998614 | 3.830385 |
007418a7-9d4e-4467-a341-b4d728021012 | shovon26/COMPETITIVE | Coin Row problem.cpp | ///Coin change
#include<bits/stdc++.h>
using namespace std;
const int sz=500;
int f[sz];
int cc_set[sz];
int way(int n,int c_set[])
{
memset(c_set,0,sizeof c_set);
f[0]=0;
f[1]=c_set[1];
for(int i=2;i<=n;i++)
{
f[i]=max((c_set[i]+f[i-2]),f[i-1]);
cout<<f[i]<<endl;
}
return ... | ALGO | 0.999752 | 3.913626 |
dc0926ba-e327-4e87-a323-b672670b7bd3 | Marzaan/Codeforces | Translation.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin >> s >> t;
if(){
cout << "Yes";
}
else{
cout << "No";
}
}
| ALGO | 0.99996 | 3.766372 |
59ca55ec-4239-4e15-8fc7-d92d8b92fdd6 | fayizdev/signup | 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 |
22da16f1-8020-4e55-8832-f16442d37cc8 | kavita200496/Interview-Bit | Two Pointers/3 Sum.cpp | https://www.interviewbit.com/problems/3-sum/
int Solution::threeSumClosest(vector<int> &A, int B) {
vector<int> res;
int n = A.size();
sort(A.begin(), A.end());
for (int i = 0; i < n-2; i++) {
int l = i+1, h = n-1;
while (l < h) {
auto tmp = A[i] + A[l]+A[h];
... | ALGO | 0.999998 | 5.737673 |
e1f69be3-c732-45c9-8037-eae9d87174f5 | acshiryu/acshiryu.github.io | source/assets/code/poj/3070.cpp | #include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
struct prog {
int a[2][2] ;
void init(){
a[0][0]=a[1][0]=a[0][1]=1;
a[1][1]=0;
}
};
prog matrixmul ( prog a ,prog b )
{
int i , j , k ;
prog c ;
for (... | ALGO | 0.999971 | 3.850538 |
ce51a43e-b567-4410-8332-e603ba59b130 | sprkrd/adventofcode | 2022/25/part1.cpp | #include <algorithm>
#include <cassert>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
constexpr int k_midpoint = 2;
constexpr int k_base = 2*k_midpoint + 1;
const char* digits_representation = "=-012";
int snafu_digit_to_int(char c) {
switch (c) {
case '='... | ALGO | 0.999789 | 5.582613 |
b862a8ac-199c-4198-9ec0-44a495f1ad60 | readul-islam/c_plus_plus_practices | binarySearch/FindPivotInArray.cpp | #include <iostream>
using namespace std;
void selection_sort(int arr[], int size){
}
int main(){
int arr[6] = {6,5,2,7,1,3};
int size = 6;
selection_sort(arr, size);
return 0;
} | ALGO | 0.999695 | 4.315076 |
db139b1f-8264-414e-9903-b9641c8e83a4 | abhijitmanna912001/DSA-Problem-Solving | LinkedList/ReverseLinkedList.cpp | #include <iostream>
using namespace std;
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) {}
};
ListNode *reverseRecursion(ListNode *prev, ListNode *curr)
{
if (curr ... | ALGO | 0.998912 | 5.182246 |
3b1275fd-7270-4bbb-8c97-75436c87b69c | alexandraback/datacollection | solutions_5662291475300352_1/C++/DaniJVaz/C.cpp | #include <cstdio>
#include <algorithm>
#include <vector>
typedef long long ll;
using namespace std;
struct Hiker {
Hiker() : deg(0), time(0) {}
Hiker(ll deg, ll time) : deg(deg), time(time) {}
ll deg;
ll time;
};
bool operator<(const Hiker & h1, const Hiker & h2) {
if (h1.time != h2.time)
return h1.time < h2... | ALGO | 0.99942 | 3.795467 |
2b86cc15-1c03-46ad-be94-268975477318 | iglidraci/cen109-algorithms | Week4/Example_6.cpp | #include <iostream>
using namespace std;
int main (void)
{
static int N = 10;
int counter, sum, number;
cout << " Enter a Positive Integer smaller"
<< " or equal to 10 (the counter) ";
cin >> counter;
cout << endl;
sum = 0;
do
{
cout << " Enter a Positive Integer " ;
cin >> number;
cout << endl;
... | ALGO | 0.98199 | 3.295602 |
b89fae8c-069d-4d45-b325-1cdbb2cb3bb3 | VanshikaAggarwal1501/code | C++/arrays.cpp/waveprint.cpp | #include<iostream>
using namespace std;
void printingwave(int arr[3][4]){
int j=0;
for(int i=0; i< 4; i++){
if(i&1){
j=2;
while(j>=0){
cout<< arr[j][i]<< " ";
j--;
}
}
else {
j=0;
while(j< 3){
... | ALGO | 0.999722 | 3.522492 |
4069f650-73d4-4397-81cf-ef9c2cb78c21 | Teo-Goli/Zilliqa | src/libConsensus/ConsensusLeader.cpp | #include "ConsensusLeader.h"
#include <utility>
#include "common/Constants.h"
#include "common/Messages.h"
#include "libMessage/Messenger.h"
#include "libNetwork/Guard.h"
#include "libNetwork/P2PComm.h"
#include "libUtils/BitVector.h"
#include "libUtils/DataConversion.h"
#include "libUtils/DetachedFunction.h"
#include... | ALGO | 0.988211 | 6.146962 |
37ee6f5c-f3fe-427b-9fd0-e642ed053ae9 | SOFTK2765/PS | codeforces/800/214A.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
scanf("%d %d", &n, &m);
int cnt = 0;
for(int i=0;i*i<=n;i++)
{
int tmp = n-(i*i);
if(i+(tmp*tmp)==m) cnt++;
}
printf("%d", cnt);
return 0;
} | ALGO | 0.999633 | 3.524598 |
6114ba7b-fb05-401c-85f2-adb0891bf9b9 | pz1971/Data-Structures-And-Algorithms-in-C-and-CPP | String/Burrows Wheeler Transformation/bwtinverse.cpp | #include <bits/stdc++.h>
using namespace std ;
string InverseBWT(const string &bwt)
{
string text = "";
string left_col = bwt ;
sort(left_col.begin(), left_col.end()) ;
map<char, int> cnt ;
vector<int> id(bwt.size()) ;
for(int i = 0 ; i < bwt.size() ; i++){
id[i] = cnt[ bwt[i] ]++ ;
}
int cur = 0 ;
do{
... | ALGO | 0.999988 | 4.907034 |
3e23de15-b577-49db-81f4-fda328ed7ead | bhuppidhamii/myLeetCode | 3490-find-the-maximum-length-of-valid-subsequence-i/find-the-maximum-length-of-valid-subsequence-i.cpp | class Solution {
public:
int maximumLength(vector<int>& nums) {
int countEven = 0, countOdd = 0;
for (int num : nums) {
if (num % 2 == 0) countEven++;
else countOdd++;
}
// Try building alternating parity subsequence
int altLen = 1; // At least one nu... | ALGO | 0.999816 | 5.831638 |
fc442b4d-b265-4c96-a3cd-b1721e34805c | we-are-kicking-lhx/xinxinalgorithm | T075. Sort Colors.cpp | class Solution {
public:
void f_swap(int &a, int &b){
int temp = a;
a = b;
b = temp;
}
void sortColors(vector<int>& nums) {
if (nums.size() <= 1) return;
int n = nums.size();
int zero = 0, two = n - 1;
for (int i = 0; i <= two; i++) {
if (n... | ALGO | 0.999978 | 5.949085 |
a0b4f539-6294-48b1-907f-3ea7bf7675d2 | mariyaeggs/C_Methodology_Collection | C++_Algorithms/Week1/Answers/Lab1/Sample_LinkedList_Tester.cpp | #include <iostream>
using namespace std;
#include "LinkedList.h"
int main()
{
// Test the class constructor
LinkedList intList;
cout << "Constructing intList\n";
// Test insert()
intList.insert(100, 0);
intList.display(cout);
cout << endl;
intList.insert(200, 0);
intList.display(cout);
... | TEST | 0.968813 | 5.192107 |
38d00020-8971-4528-ad4e-686d05888676 | Prabhat2002/Data_Structure_and_Algorithm | Reduce Array Size to The Half.cpp | class Solution {
public:
int minSetSize(vector<int>& arr)
{
int n=arr.size();
map<int,int>mp;
for(int i=0;i<n;i++)
mp[arr[i]]++;
priority_queue<pair<int,int>>pq;
for(auto i=mp.begin();i!=mp.end();i++)
pq.push({i->second,i->first});
int m=0... | ALGO | 0.999902 | 5.585864 |
00ba3b1e-d78f-4abd-afde-76841c7d15e6 | Mahesh-Motale77/Array_Interview_Questions | Char_max_occurence.cpp |
#include<iostream>
using namespace std;
char maxOccChar(string s){
int arr[26]={0};
for(int i=0;i<s.length();i++){
char ch=s[i];
int number=0;
number = ch - 'a';
arr[number]++;
}
int maxi=-1; int ans=0;
for(int i=0;i<26;i++){
if(maxi<arr[i]){
m... | ALGO | 0.999933 | 4.460753 |
a5d54ff2-64a7-4932-b72f-336c9c0bd633 | istiaqueahmedarik/Phitron | week 4/D_Districts_Connection.cpp | #include <bits/stdc++.h>
#define int long long
#define float double
#define endl '\n'
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int32_t main()
{
IOS;
int t;
cin >> t;
while (t--)
{
int n;
cin >>... | ALGO | 0.999816 | 3.983054 |
a62e060d-b230-4ab4-84a5-db0b0dc4af65 | SETURAJ/LeetCode-Solutions | 3sum/Runtime Error/2-2-2022, 1_17_35 AM/Solution.cpp | // https://leetcode.com/problems/3sum
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
int n=nums.size();
vector<vector<int>>res;
if(n<3)
return res;
sort(nums.begin(),nums.end());
for(int i=0;i<n;i++)
{
if(i>0 && num... | ALGO | 0.999947 | 6.074914 |
48f8e840-0809-47b7-b143-237869228e56 | statinf-otawa/otawa-clp | sem_ForwardPredicateBuilder.cpp | #include <elm/data/HashMap.h>
#include <elm/data/ListMap.h>
#include <elm/data/ListMap.h>
#include <otawa/proc/BBProcessor.h>
#include "otawa/pred/predicates.h"
namespace otawa { namespace pred {
using namespace sem;
static sem::cond_t symetric(sem::cond_t c) {
switch(c) {
case NO_COND: return c;
case EQ: retur... | ALGO | 0.999359 | 5.845092 |
763e7a1c-3889-49c3-b375-7fa91afaebb6 | Moujuruo/algo_note | leetcode/2096.step-by-step-directions-from-a-binary-tree-node-to-another.cpp | /*
* @lc app=leetcode.cn id=2096 lang=cpp
* @lcpr version=30121
*
* [2096] 从二叉树一个节点到另一个节点每一步的方向
*/
// @lcpr-template-start
#include <type_traits>
using namespace std;
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iostream>
#include <lis... | ALGO | 0.999978 | 7.033011 |
1f0a88f1-4722-4272-9aa3-8f03923f5a24 | jkfrie/AlgoLab-HS19-ETHZ | CPP_Tutorial/Sort.cpp | #include <iostream> // We will use C++ input/output via streams
#include <vector>
#include <algorithm>
void testcase() {
// read input
int n; std::cin >> n;
std::vector<int> numbers(n, 0);
int tmp;
for(int i = 0; i < n; ++i){
std::cin >> tmp;
numbers[i] = tmp;
}
int x; std::cin >> x;
//sort i... | ALGO | 0.999593 | 4.562021 |
2b1cabd7-daef-49f3-aedc-8d13e2637965 | morsalin80/Codeforces-and-atcoder | atcoder/abc159/A.cpp | /// Bismillahir Rahmanir Rahim
/* Mohammad Morsalin
Dept of ICE, NSTU
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define int long long
#define f0(... | ALGO | 0.999856 | 4.309081 |
a6cb7835-5e17-4d61-9da0-a486aabc2180 | Cytnx-dev/Cytnx | src/backend/linalg_internal_cpu/Pow_internal.cpp | #include "backend/linalg_internal_cpu/Pow_internal.hpp"
#include "cytnx_error.hpp"
namespace cytnx {
namespace linalg_internal {
void Pow_internal_d(boost::intrusive_ptr<Storage_base> &out,
const boost::intrusive_ptr<Storage_base> &ten, const cytnx_uint64 &Nelem,
... | ALGO | 0.965633 | 6.376228 |
dbfca270-11cc-4b5d-b58a-662ec4251d5e | dotM87/competitive-programming | codeforces/A_Word.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef map<int, int> mp;
typedef priority_queue<int> pq;
#define forn(i, n) for (int i = 0; i < (n); i++)
#define fore(i, a... | ALGO | 0.999733 | 5.47592 |
54d215a5-8b6d-469a-a4b1-19393b7facbb | itzelacev/logica-para-programacion | ln_sen_cos.cpp | /* Mediante la aplicacin de ciclos y funciones se va a crear un men que le permita al usuario elegir entre
calcular el logaritmo natural, seno o coseno mediante la aproximacin usando series numricas infinitas
en las cuales el usuario definir la cantidad de trminos de la serie a trabajar.
El men har que el usuario r... | ALGO | 0.998868 | 3.707283 |
05d59563-097f-44ff-b0f4-a8b552b1870f | jitu619/interview-assignments | HashMap/maximal-rectangle.cpp | class Solution {
public:
vector<int> NSR(vector<int> &arr){
stack<int> s;
vector<int> v;
int n=arr.size();
for(int i=n-1;i>=0;i--){
if(s.empty()){
v.push_back(n);
s.push(i);
}
else if(arr[s.top()]<arr[i]){
... | ALGO | 0.999928 | 6.175068 |
171f73cc-7a22-447b-b2e2-16cbf5d4b94a | Charudatta999/Programming_Practice | src/Minimum_Add_to_Make_Parentheses_Valid.cpp | #include<iostream>
#include<string>
#include<vector>
#include<unordered_map>
int minAddToMakeValid(std::string s)
{
int open{0}, close{0};
for( auto it : s)
{
if(it == '(' )
{
open++;
}
else if( it == ')' && open > 0)
{
open--;
}
... | ALGO | 0.999364 | 5.665456 |
5e34fad0-2e6b-4d20-b290-5f97efd54ba8 | sarvex/leetcode-powershell | solution/0000-0099/0057.Insert Interval/Solution.cpp | class Solution {
public:
vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
vector<vector<int>> ans;
int st = newInterval[0], ed = newInterval[1];
bool insert = false;
for (auto& interval : intervals) {
int s = interval[0], e = interval... | ALGO | 0.999993 | 6.327136 |
b2ec3605-fb75-47b1-abc6-9f35a0525df1 | isysoi3/Programming | c++/2 сем/Kr5/Kr5/Kr5.cpp | // Kr5.cpp: определяет точку входа для консольного приложения.
//
#include <iostream>
#include <fstream>
#include <vector>
#include <map>
#include <string>
#include <Windows.h>
#include <set>
#include <list>
using namespace std;
int main()
{
setlocale(LC_ALL, "RUS");
SetConsoleCP(1251);
SetConsoleOutputCP(1251);
... | TOOL | 0.923918 | 3.283401 |
2d843b75-ca2e-4323-93e1-5c991cf4efe4 | phUR99/TEST | 프로그래머스/2/43165. 타겟 넘버/타겟 넘버.cpp | #include <string>
#include <vector>
using namespace std;
bool solve(int s, vector<int> &arr, int t){
int ret = 0;
for(int i =0; i < arr.size(); i++){
if((1<<i) & s)
ret += arr[i];
else
ret -= arr[i];
}
return ret == t;
}
int solution(vector<int> numbers, int ta... | ALGO | 0.999913 | 6.059716 |
d1c5e272-cebd-4850-873c-ad1f9a6b3693 | mfs6174/mfs6174-ACM | CF103B.cpp | /*
ID: mfs6174
PROG: 计算几何基本函数
LANG: C++
*/
#include<iostream>
#include<fstream>
#include<string>
#include<sstream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define sf scanf
using namespace std;
//ifstream inf("ti.in");
//ofstream ouf("ti.out");
//freopen("ti.i","r",stdin);
const int maxlo... | ALGO | 0.999876 | 3.896946 |
9741cea5-dbe2-45ff-a5c3-c4dfc9972a1f | Manan-Rastogi/RevisingCPP_DSA_2024 | OOPS_4_Pillars_Polymorphism.cpp | #include<bits/stdc++.h>
using namespace std;
/*
Polymorphism:
- poly = many
- morph = forms
-> Compile Time Polymorphism:
- Function Overloading:
- use same name for more than 1 functions
- change return type or change no of params or change type of params
- Operator Overloading:
- assign an opera... | ALGO | 0.985865 | 4.426202 |
a7b1579f-0641-4a5a-a467-67266dc14713 | liuq901/code | SPOJ/sp_9117.cpp | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
bool f[1000010];
int c[10000],a[1000010];
vector <ll> p;
void init()
{
for (int i=2;i<=1000;i++)
{
if (f[i])
continue;
for (int j=i;i*j<=1000000;j++)
f[i*j]=true;
}
... | ALGO | 0.999811 | 4.010017 |
2ab8b1c6-8980-46f3-ae2f-b013a5264c14 | yvn819/Autonomous-Drone | src/path_planner/src/path_generator.cpp | #include "../include/path_planner/path_generator.h"
#include <iostream>
PathGenerator::PathGenerator()
{
subscribeAndPublish();
}
PathGenerator::~PathGenerator()
{
}
void PathGenerator::subscribeAndPublish()
{
sub_grid_map_ = nh_.subscribe<nav_msgs::OccupancyGrid>("/projected_map_filter", 1, &PathGenerator... | TOOL | 0.857917 | 3.689145 |
dea3583e-89e4-4433-a999-6c70e6fdd3fe | hal-uw/gpu_variability_sc22_artifact | sec5c_lammps/src/npair_kokkos.cpp | #include "npair_kokkos.h"
#include "atom_kokkos.h"
#include "atom_masks.h"
#include "domain_kokkos.h"
#include "neighbor_kokkos.h"
#include "nbin_kokkos.h"
#include "nstencil.h"
#include "force.h"
namespace LAMMPS_NS {
/* ---------------------------------------------------------------------- */
template<class Device... | ALGO | 0.986233 | 6.765348 |
82e64c27-e564-4332-a1aa-a5ed296625d9 | aliyun/alibabacloud-AnalyticDB-python-demo-face-recognition | SeetaFace2/example/tracking/example.cpp | #pragma warning(disable: 4819)
#include <seeta/FaceTracker.h>
#include <seeta/Struct_cv.h>
#include <seeta/Struct.h>
#include <opencv2/highgui/highgui.hpp>
#include <opencv2/imgproc/imgproc.hpp>
#include <array>
#include <map>
#include <iostream>
int main()
{
seeta::ModelSetting::Device device = seeta::ModelSett... | TOOL | 0.930329 | 4.3729 |
6f7e379c-d8d7-4fde-b3c0-dd2de1fe1ae7 | StylianosPs/Search-And-Clustering-Algorythms-Project | Source/hypercube.cpp | #include "hypercube.hpp"
HyperCube::HyperCube(){}
HyperCube::HyperCube(int d, int window){//CONSTRUCTOR
k = d;
tableSize = pow(2, k);
w = window;
hyper_hashTable = new vector<bucketList>[tableSize];
v_array = new vector<float>[k];//ARRAY WITH K V FOR EACH Hi FUNCTION
zero_hi = new vector<int>... | ALGO | 0.998836 | 4.495131 |
8123cc4e-0967-4508-96e4-9cc77fe56404 | ChinnamPoojithaSuryaRajeswari/Leetcode | 63-unique-paths-ii/unique-paths-ii.cpp | class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size(),n=obstacleGrid[0].size();
if(obstacleGrid[0][0]==1)return 0;
vector<vector<long long>>vec(m,vector<long long>(n,-1));
vec[0][0]=1;
long long k =1;
fo... | ALGO | 0.999798 | 5.840957 |
d666e529-bf28-4c6a-b534-1c8f33dd314f | Will-Z/algorithm-practice | leetcode OJ/Array/33-Search in Rotated Sorted Array.cpp | //
// Created by Will on 2/9/16.
//
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int search(vector<int>& nums, int target) {
if (!nums.size())
return -1;
for (int i = 0; i < nums.size(); i++)
if (nums[i] == target)
return... | ALGO | 0.999572 | 5.576576 |
bce155b4-a9fa-4108-bf4a-8e4a78727a74 | alexandraback/datacollection | solutions_2751486_1/C++/FKint/main.cpp | #include <cstdio>
#include <iostream>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <bitset>
using namespace std;
bool consonant(char c){
if(c == 'a' || c == 'e... | ALGO | 0.999358 | 4.228455 |
df6d5bcf-dfef-4ebc-a0ba-b3fe9e3f5c3c | JCFactory/MobileGrowthMonitor | opencv-3.2.0/modules/imgproc/src/smooth.cpp | #include "precomp.hpp"
#include "opencl_kernels_imgproc.hpp"
#include "opencv2/core/openvx/ovx_defs.hpp"
namespace cv
{
/****************************************************************************************\
Box Filter
\*****************************************************... | ALGO | 0.962095 | 5.180546 |
60c1a930-f954-4671-9835-8d02bff2aef3 | pralinkhaira/Leet-Code-Solutions | 1478-maximum-number-of-events-that-can-be-attended/maximum-number-of-events-that-can-be-attended.cpp | class Solution
{
public:
int maxEvents(vector<vector<int>>& events)
{
// Step 1: Sort events by start day
sort(events.begin(), events.end());
// Step 2: Min-heap for end days
priority_queue<int, vector<int>, greater<int>> minHeap;
int i = 0;
int count... | ALGO | 0.99997 | 6.414754 |
3fb3f089-caee-46a3-9c50-21939822d9e5 | AminShahrabi/CodeForces_Solutions | C++/1186A - Vus the Cossack and a Contest.cpp | // Amin Shahrabi Github
// https://github.com/AminShahrabi/CodeForces_Solutions
// Shush Gharbi
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if (b >= a && c >= a ) cout << "Yes";
else cout << "No";
}
| ALGO | 0.99999 | 3.938803 |
83b101af-36eb-4a19-924d-2f1f04fa928f | lgwest/cpp-game-dev | Chapter11/Include/bullet/BulletCollision/CollisionDispatch/SphereTriangleDetector.cpp | #include "LinearMath/btScalar.h"
#include "SphereTriangleDetector.h"
#include "BulletCollision/CollisionShapes/btTriangleShape.h"
#include "BulletCollision/CollisionShapes/btSphereShape.h"
SphereTriangleDetector::SphereTriangleDetector(btSphereShape* sphere,btTriangleShape* triangle,btScalar contactBreakingThreshold)
... | ALGO | 0.99894 | 7.24815 |
40edc919-1689-46c6-a2b0-99d9d8ffb98a | Malinowsk/Jobs-In-C-Plus-Plus | Análisis y Diseño de Algoritmos 2/Tp Backtracking/main.cpp | #include <iostream>
#include <list>
#include <fstream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <cstdlib>
using namespace std;
class Punto {
public:
Punto(int x, int y) { this->x = x; this->y = y; }
int getX() const { return x; }
int getY() const { return y; }
void setX(int ... | ALGO | 0.996735 | 3.235479 |
cb0edab8-e757-41ba-9c06-8517139f8a07 | iamishansharma/Placement-Preparation | DSA/GeeksForGeeks/DSA-Self-Paced/Recursion/Sum of Digits of a Number.cpp | // { Driver Code Starts
//Initial Template for C++
#include <iostream>
using namespace std;
// } Driver Code Ends
//User function Template for C++
// Complete this function
int sumOfDigits(int n)
{
if(n == 0)
return 0;
return n%10 + sumOfDigits(n/10);
}
// { Driver Code Starts.
int main(... | ALGO | 0.999875 | 6.849812 |
e5eedfd0-9e9c-43fc-988e-3c7461722ffd | TriNguyenThanh/DSA | LinkedListVer2/Bai11_subarray.cpp | /*###Begin banned keyword - each of the following line if appear in code will raise error. regex supported
define
include
struct
classs
new
delete
using
###End banned keyword*/
#include <iostream>
using std::cin;
using std::cout;
using std::endl;
struct Node{
int val;
Node* next;
};
struct List{
Node *h... | ALGO | 0.999906 | 4.235158 |
7acdf05c-3647-4f3c-b9f1-de09304c1e9f | sahilmadaan048/crispy-chainsaw-ladders | 1300 to 1399 rating/problelm 18(A. Chips)/main.cpp | // https://codeforces.com/problemset/problem/92/A
#include <iostream>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
// n is the number of walruses
// m is the number of chips the presenter has initially
int current_walrus = 1; // Start giving chips from walrus number 1
while (m... | ALGO | 0.99997 | 4.331439 |
28c28ea6-b88b-4fa5-a210-c82cf8b24b37 | RESQ-Chain/RESQ | src/merkleblock.cpp | #include "merkleblock.h"
#include "hash.h"
#include "primitives/block.h" // for MAX_BLOCK_SIZE
#include "utilstrencodings.h"
using namespace std;
CMerkleBlock::CMerkleBlock(const CBlock& block, CBloomFilter& filter)
{
header = block.GetBlockHeader();
vector<bool> vMatch;
vector<uint256> vHashes;
vM... | ALGO | 0.998857 | 5.939562 |
05396169-c9a9-4ef0-bbfb-a5f465a94c92 | Kanika1609/map_project | aiims_j/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.998759 | 6.76775 |
fada1056-7ad2-4220-9440-284b123910d8 | raincross7/code-similarity | codes/train_code/problem412/problem412_319.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define N 666666
int arr[N],sum1[N],sum2[N];
signed main(){
int a,b;
cin>>a>>b;
if(a==b){
cout<<"0";return 0;
}
if(abs(a)==abs(b)){
cout<<"1";return 0;
}
if(a==0){
if(b>=0) cout<<b-a;else cout<<abs(b)+1;
return 0;
}
if(b==0){
if(a<=0... | ALGO | 0.999987 | 3.92008 |
9e0d378f-4c9c-4219-b395-060022c81352 | Raj007-bit/CPP-DataStructure | insert_at_head.cpp | #include<iostream>
using namespace std;
class node{
public:
int data;
node* next;
node(int data){
this->data = data;
next = NULL;
}
};
void insertAtHead(node * &head,int data){
if(head==NULL){
head = new node(data);
return;
}
//otherwise
node * n = new node(data);
n->next = head;
head = n;
}
voi... | ALGO | 0.999514 | 3.746682 |
835277b1-6622-4f6d-b0cb-768ea18021a7 | rcalizayapa/11_arreglos | Ejercicio-3.cpp | #include <iostream>
using namespace std;
int main() {
const int numDias = 7;
float tempMin[numDias], tempMax[numDias], tempMedia[numDias];
float tempBaja = 9999;
for (int i = 0; i < numDias; ++i) {
cout << "Ingrese la temperatura mínima del día " << i + 1 << ": ";
cin >> tempMin[i];
... | ALGO | 0.999842 | 4.753019 |
85ec31a2-6898-4c3a-acd8-118a59694295 | Tongyuang/EdgeTile | EdgeTileServer/libs/opencv/3rdparty/openexr/IlmImf/dwaLookups.cpp | #define OPENEXR_BUILTIN_TABLES
//
// A program to generate various acceleration lookup tables
// for Imf::DwaCompressor
//
#include <cstddef>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <OpenEXRConfig.h>
#ifndef OPENEXR_BUILTIN_TABLES
#ifdef OPENEXR_IMF_HAVE_SYSCONF_NPROCESS... | ALGO | 0.97338 | 5.427552 |
cc201862-5d6e-4bb9-874c-4ddc52c5c611 | sobhanbera/codes | c35.cpp | /*\
|*| @author : sobhanbera
|*| @code_since : 19-10-2018
|*| @created on : 05-09-2020 01:30:22 PM
\*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef l... | ALGO | 0.999724 | 3.744309 |
a2f84e15-563d-46af-b66e-aa8bad716629 | aluleam/Data-Sctructure-CS300 | Program2MK/Program2MK/robot_path.cpp | // **********************************************************************************
// **********************************************************************************
// Program: Robot Path **
// Name: Masumbuko Alulea ... | ALGO | 0.998185 | 6.596864 |
bdc7cbf0-b02f-48ef-b3f6-b69d461e982e | ahmeducf/problem-solving | CodeForces/800/427A. Police Recruits.cpp | #include <iostream>
using namespace std;
int main()
{
long long n = 0, hired = 0, count_u = 0;
cin >> n ;
long long arr[n];
for (long long i = 0; i < n; i++)
{
cin >> arr[i];
if (arr[i] > 0)
{
hired += arr[i];
}
if (arr[i] < 0)
{
... | ALGO | 0.999982 | 4.066109 |
8eb3a0a6-c279-415c-a73a-5e3f88eab28c | kushagra06/competitive-programming | cf/467b.cpp | #include<bits/stdc++.h>
using namespace std;
int bin[20];
void binary(int x)
{
int i=19;
for(int j=0;j<20;j++)
bin[j]=0;
while(x>=1)
{
bin[i--]=x%2;
x=x/2;
}
}
int main()
{
int n,m,k;
cin >> n >> m >> k;
vector<int> a(m+1);
for(int i=0;i<m+1;i++)
... | ALGO | 0.99999 | 4.152169 |
11e75e4e-b74e-4cbb-be7b-2984b9382d18 | ofir-tan/School-Super-Data-Structure | source/AuxiliaryFunctions.cpp | #include "AuxiliaryFunctions.h"
bool isNumber(const string &s) {
return all_of(s.begin(), s.end(),
[](char c) { return isdigit(c) != 0; });
}
vector<string> stringToWords(string const &str, const char delim) {
vector<string> res;
// construct a stream from the string
stringstream ss(... | TOOL | 0.861574 | 5.549465 |
1b7f4f00-5ede-4d42-baeb-ac6dd72fdf81 | linyawd/prog2coursecpp | homework5/t_05_16l.cpp | #include <stdio.h>
#include <math.h>
int main() {
double x, epsilon, term, sum = 1.0;
int k = 1;
printf("Введіть значення x: ");
scanf("%lf", &x);
printf("Введіть значення epsilon: ");
scanf("%lf", &epsilon);
term = 1.0 / 2.0;
while (fabs(term) >= epsilon) {
sum -= term;
... | ALGO | 0.999965 | 3.97474 |
ce21dc97-c79a-454c-a470-48d5abf0bbc3 | harsha-810/DSA0156-C- | pattern.cpp | #include<iostream>
using namespace std;
int main()
{
int n;
cout<<"Enter number of rows:"<<endl;
cin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
cout<<i<<" ";
}
cout<<endl;
}
}
| ALGO | 0.99686 | 3.638415 |
1b292a72-dc2b-4737-9c6b-50c188f77ba8 | ishandutta2007/codeforces | nikarabika/normal/545/B.cpp | #include <bits/stdc++.h>
using namespace std;
string s, t;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> s >> t;
int d = 0;
for(int i = 0; i < s.size(); i++)
d += (s[i] != t[i]);
if(d & 1){
cout << "impossible" << endl;
return 0;
}
int c = 0;
for(int i = 0; i < s.size(); i++){
if(... | ALGO | 0.999997 | 3.33344 |
4fb8bdf8-46bc-4fef-9137-8ee63c8de41d | alexandraback/datacollection | solutions_5738606668808192_0/C++/apronchenkov/solution.cpp | #include <algorithm>
#include <array>
#include <iostream>
#include <vector>
struct JamCoin {
unsigned long coin;
std::array<unsigned long, 9> witnesses;
};
template <typename T>
std::string toBinaryString(T value) {
std::string result;
do {
result.push_back('0' + value % 2);
value /= 2;
} while (val... | ALGO | 0.999877 | 5.498006 |
f2550be3-d334-41a6-8453-80b5341d0a2c | ZtoYtoQ/NCNN-PoseEstimation | src/layer/arm/binaryop_arm.cpp | #include "binaryop_arm.h"
#include <math.h>
#include <algorithm>
#include <functional>
#if __ARM_NEON
#include <arm_neon.h>
#include "neon_mathfun.h"
#endif // __ARM_NEON
namespace ncnn {
DEFINE_LAYER_CREATOR(BinaryOp_arm)
BinaryOp_arm::BinaryOp_arm()
{
#if __ARM_NEON
support_packing = true;
#endif // __ARM_NEO... | TOOL | 0.987171 | 7.11868 |
6ceae591-2872-4db7-979d-ae12893be66d | pannalamanasa/Simple-Programs | prime.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int minJumps(vector<int>& arr) {
int n = arr.size();
int minJumps = 0;
int currentEnd = 0;
int currentFarthest = 0;
for (int index = 0; index < arr.size() - 1; index++)
{
currentFarth... | ALGO | 0.999619 | 5.221579 |
70d875c7-925a-40b7-b1c2-dee91d3522b8 | jnkUHaFnir/human-vs-ai | 3-3_gpt-4-1106/gpt4-1106_335.cpp | #include <mpi.h>
#include <vector>
#include <iostream>
typedef struct {
int id;
std::vector<int> neighbors;
} Node;
void sendNode(int dest, const Node& node, int tag, MPI_Comm comm) {
// First, send the node ID.
MPI_Send(&node.id, 1, MPI_INT, dest, tag, comm);
// Then send the size of the nei... | ALGO | 0.988797 | 6.461306 |
3752e9c2-a21c-4d72-bf67-e2a13433f12f | martigotsev/prakticum | week10/task7.cpp | #include<iostream>
using namespace std;
const int size=10000;
void printStr(char *str)
{
for (int i = 0; str[i] != '\0'; i++)
{
cout << str[i];
}
cout << endl;
}
void changeSymbol(char &c)
{
if (c >= '0' && c <= '9')
c = '#';
else if (c >= 'a' && c <= 'z')
c -= 'a' - 'A'... | ALGO | 0.996004 | 3.881742 |
6ea7256a-255a-4ad0-b014-5f3051eafaff | fdj32/fork_samples | cppreference/w/cpp/utility/bitset/flip.cpp |
#include <iostream>
#include <bitset>
int main()
{
std::bitset<4> flops;
std::cout << flops << '\n'
<< flops.flip(0) << '\n'
<< flops.flip(2) << '\n'
<< flops.flip() << '\n';
}
| ALGO | 0.935259 | 4.775445 |
b06eeee5-8eb2-4682-984b-dff4a25987d5 | EdricYeo117/DataStructure-AlgorithmsPracticeRepo | LeetCode/LeetCode Stacks/popForStackWithVector.cpp | #include <iostream>
#include <vector>
using namespace std;
class Stack
{
private:
vector<int> stackVector;
public:
vector<int> &getStackVector()
{
return stackVector;
}
void printStack()
{
for (int i = stackVector.size() - 1; i >= 0; i--)
{
cout << stackVe... | TOOL | 0.988728 | 5.642893 |
2d0d27d5-8663-4d73-9e59-32de480234f0 | Ujjwalmittal03/e_commerce | 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 |
4874f110-8da8-4134-a375-0033c4516261 | wazenmai/Leetcode | Medium/3243_shortest_distance_after_road_addition_queries_I/solution2.cpp | /**
* Title: Shortest Distance After Road Addition Queries I (Leetcode Medium 3243)
* Author: Bronwin Chen <<EMAIL>>
* Date: 27, November, 2024
* Method: Use bfs to find shortest path from 0 to n instead of dijkstra.
* Result: Time complexity O(m * (n + m))), where m is the number of queries, n is the number of... | ALGO | 0.9999 | 6.475888 |
2a92d6b9-7984-4a7e-848e-6b154cb3352d | ishandutta2007/codeforces | msg555/normal/167/C.cpp | #include <iostream>
#include <vector>
#include <cstdio>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cassert>
#include <cstdlib>
#include <cmath>
#include <numeric>
using namespace std;
// Can make B in base A
bool can(long long A, long long B) {
if(A % 2) {
l... | ALGO | 0.999973 | 4.749225 |
bb256af9-df93-4739-8aa0-aef6d95188f3 | Ahnaf-41M/Codeforces_AtCoder | codeforces/1113/B.cpp | #include <bits/stdc++.h>
#include <ext/rope>
#define pb push_back
#define int long long
#define endl "\n"
#define MX 100005
#define all(v) v.begin(),v.end()
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define rep(i,a,b) for(int i = a... | ALGO | 0.999933 | 4.133718 |
d74f456a-c50d-4268-a878-fe29ce2c377a | ishandutta2007/codeforces | tmwilliamlin168/normal/1176/F.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=2e5;
int n;
ll dp1[mxN+1][10], dp2[4][4][2];
//moves, cost, double damaged
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
memset(dp1, 0xc0, sizeof(dp1));
dp1[0][0]=0;
for(int _=0; _<n; ++_) {
memse... | ALGO | 0.999492 | 3.090927 |
61a9b76f-46a4-419d-b07f-87eecb6e8e83 | pramodkumar5921/DSA | Has Path.cpp | #include<bits/stdc++.h>
using namespace std;
void dfs(int node,vector<int>graph[],vector<int>&vis){
vis[node]=1;
for(auto child:graph[node]){
if(vis[child]==0){
dfs(child,graph,vis);
vis[child]=1;
}
}
return;
}
void solve(){
int v,e;
cin>>v>>e... | ALGO | 0.999918 | 5.062019 |
3bf69213-4b28-4bab-bf78-6707b9dd6b51 | miteshkumar77/LC | insert-into-a-sorted-circular-linked-list/Wrong Answer/9-22-2020, 8:35:04 PM/Solution.cpp | // https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list
/*
// Definition for a Node.
class Node {
public:
int val;
Node* next;
Node() {}
Node(int _val) {
val = _val;
next = NULL;
}
Node(int _val, Node* _next) {
val = _val;
next = _next;
... | ALGO | 0.999993 | 6.382754 |
8d082480-59f8-4bc2-ba35-f14bfc12a4c8 | sarvex/leetcode-vala | solution/0800-0899/0852.Peak Index in a Mountain Array/Solution.cpp | class Solution {
public:
int peakIndexInMountainArray(vector<int>& arr) {
int left = 1, right = arr.size() - 2;
while (left < right) {
int mid = (left + right) >> 1;
if (arr[mid] > arr[mid + 1])
right = mid;
else
left = mid + 1;
... | ALGO | 0.999972 | 5.774917 |
7c6edf36-9f57-4389-b238-ca130e911856 | rajatsen91/XtremeContextualBandits | lib/eigen/doc/examples/Tutorial_BlockOperations_block_assignment.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace std;
using namespace Eigen;
int main()
{
Array22f m;
m << 1,2,
3,4;
Array44f a = Array44f::Constant(0.6);
cout << "Here is the array a:" << endl << a << endl << endl;
a.block<2,2>(1,1) = m;
cout << "Here is now a with m copied into its cent... | ALGO | 0.945912 | 3.331377 |
a5bfa4e0-da4f-4e49-a9aa-39f0c18d064c | unibas-dmi-hpc/LB4OMP | runtime/src/kmp_tasking.cpp | /*
* kmp_tasking.cpp -- OpenMP 3.0 tasking support.
*/
#include "kmp.h"
#include "kmp_i18n.h"
#include "kmp_itt.h"
#include "kmp_stats.h"
#include "kmp_wait_release.h"
#include "kmp_taskdeps.h"
#if OMPT_SUPPORT
#include "ompt-specific.h"
#endif
#include "tsan_annotations.h"
/* forward declaration */
static void _... | TOOL | 0.864589 | 7.884379 |
9a49d261-304f-42e1-9bbf-c2f0ac41aa13 | IgorTsoy2022/SkillBox | m19_05_Experts/m19_05_Experts.cpp | #include <iostream>
#include <fstream>
#include <string>
#include <vector>
static void toupper(std::string& text) {
for (auto& c : text) {
if (c >= 'a' && c <= 'z') {
c = c - 32;
}
}
}
static bool text_view(const std::string & filename) {
bool isOk = false;
std::ifstream fs... | ALGO | 0.974335 | 4.301104 |
6a689565-ba0c-4c9f-8f5b-ef128991e2e7 | Tubbz-alt/virtualbox | src/VBox/NetworkServices/Dhcpd/Config.cpp | /* $Id: Config.cpp $ */
/** @file
* DHCP server - server configuration
*/
/*********************************************************************************************************************************
* Header Files ... | TOOL | 0.921827 | 5.503274 |
a5c66d00-771a-469e-a2eb-045ea8d7740e | alexandraback/datacollection | solutions_1485490_0/C++/Renelvon/main.cpp | #include <algorithm>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <queue>
using namespace std;
unsigned long int solve( queue<unsigned long int> nB, queue<unsigned long int> typeB,
queue<unsigned long int> nT, queue<unsigned long int> typeT);
int main() {
unsigned long int ... | ALGO | 0.999761 | 4.330853 |
f9c95284-aabd-4a5b-956a-2600c1b63570 | Monika3002/100days-DSA | 100days-DSA/leetcode/finduniqueElement.cpp | // problem no 1207
#include<iostream>
using namespace std;
void printArray(int arr[] , int size){
for(int i=0 ; i <size ; i++){
cout << arr[i]<< " ";
}
}
int uniqueElement(int arr[ ], int size){
int ans =0;
for(int i =0 ; i< size ; i++){
ans = ans ^ arr[i];
}
return ans;
}
int ... | ALGO | 0.99973 | 4.597952 |
ade07103-fc99-451b-b865-c6d70bdc6dee | Daksh1407/LeetCode_Q | Predecessor and Successor - GFG/predecessor-and-successor.cpp | //{ Driver Code Starts
// C++ program to find predecessor and successor in a BST
#include "bits/stdc++.h"
using namespace std;
// BST Node
struct Node
{
int key;
struct Node *left;
struct Node *right;
Node(int x){
key = x;
left = NULL;
right = NULL;
}
};
// } Driver Code Ends
/* BST Node
struct ... | ALGO | 0.999954 | 5.570868 |
4295e440-ee50-4bc8-885d-44c090af82fa | BlockLink/blocklink_crosschain_privatekey | libbitcoin/src/chain/compact.cpp | #include <bitcoin/bitcoin/chain/compact.hpp>
#include <cstdint>
#include <bitcoin/bitcoin/math/hash.hpp>
#include <bitcoin/bitcoin/utility/assert.hpp>
namespace libbitcoin {
namespace chain {
// Bitcoin compact for represents a value in base 256 notation as follows:
// value = (-1^sign) * mantissa * 256^(exponent-3)... | TOOL | 0.987801 | 7.49706 |
4c13acde-1f8e-418f-b9b5-a1c82377c801 | Xiaovy/acm | gym_102253/L.cpp | #include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define lson rt << 1
#define rson rt << 1 | 1
#define all(x) (x).begin(),(x).end()
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
const int maxn = 1e6;
const int mol = 1e9 + 7;
int l[maxn + 11],r[maxn + 11],fac[maxn + 11],in... | ALGO | 0.99993 | 3.671761 |
35f55491-c024-4267-b5e7-fb9c1871bfc3 | JohnEsleyer/employee-scan | 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.998859 | 6.785645 |
385efddd-7ee9-4979-9e96-3db150303812 | Trinity-Developers-Club/20DOOS_DSA | Leetcode Daily/max-area-of-island.cpp | //https://leetcode.com/problems/max-area-of-island/submissions/
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int utility(vector<vector<int>>& grid, int i, int j)
{
if(i<0 || i>=grid.size() || j<0 || j>=grid[0].size())
return 0;
if(grid[i][j]==0)
... | ALGO | 0.999944 | 6.212555 |
591c54b2-a187-4531-ab37-1439ffc72c6e | guptacharchil/leetcode | buyandsellstock.cpp | #include<iostream>
using namespace std;
struct interval
{
int start;
int end;
};
void abc()
{
//vector<vector<in>> v()
int n;
cin>>n;
interval aa[n/2+1];
int count = 0;
int i=0;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
while(i<n-1)
{
while(i<n-1&&a[i+1]<a[i])
i++;
if(i==n-1)
break;
aa[count]... | ALGO | 0.998322 | 4.631731 |
f12e6a94-a96f-4f2d-93fd-b0b6d9632fef | HectorTa1989/LeetCode-Cpp | Array/Permutation Sequence.cpp | /*The set [1,2,3,...,n] contains a total of n! unique permutations.
By listing and labeling all of the permutations in order, we get the following sequence for n = 3:
"123"
"132"
"213"
"231"
"312"
"321"
Given n and k, return the kth permutation sequence.
Note:
Given n will be between 1 and 9 inclusive.
Given k will be ... | ALGO | 0.999955 | 6.423748 |
0c671868-3211-41b9-92af-4d4820440a83 | Subrat-Ranjan-Sahu/DataStructure-Practice | DataStructure-Practice/Session3/C++/SearchIn2DMatrix.cpp | #include<iostream>
using namespace std;
int main(){
int n,m,target;
cin>>n>>m>>target;
int matrix[n][m];
for(int i=0; i<n; i++)
{
for(int j=0; j<m; j++)
{
cin>>matrix[i][j];
}
}
int s = 0;
int e = n*m-1;
bool isPresent = false;
while(s<=... | ALGO | 0.999845 | 4.132962 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.