uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
ce12cf54-ec5d-4c9b-b809-964919acffeb | mashfiqur05/Problem-Solving | Codeforces/1881E_Block_Sequence.cpp | /// *** --- ||| In the name of ALLAH ||| --- *** ///
#include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("inp... | ALGO | 0.999906 | 3.9964 |
c71d859f-25a4-4372-a8e5-ab4bdd8424a0 | chenfan2014/CFgit | C++Primer/DataStruct/tree/binaryOrderTree.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
struct BTNode{
int data;
BTNode *lchild;
BTNode *rchild;
};
int judgeOrderTree(BTNode *node)
{
int b1, b2;
int prev1 = -65535;
if(node == NULL){ //判断指针是否有效
return 1;
}else{ //指针有效
b... | ALGO | 0.999977 | 4.518154 |
a2d78adf-2314-462d-9704-9ad34cfe40c6 | tsksnhr/programming_contest | atcoder/abc170c.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
int X, N;
cin >> X >> N;
map<int, int> dict;
for (int i=0; i<N; i++){
int temp;
cin >> temp;
dict[temp]++;
}
int ans = 1e4;
for (int i=0; i<101; i++... | ALGO | 0.999961 | 3.792817 |
23e9ae0e-711d-4d66-bef4-b073a3bb2dc1 | imtiaz1710/competitive-programming | codeforces/codeforces contest/Codeforces Round #652 (Div. 2)/a.cpp | #include <bits/stdc++.h>
#define ll long long
#define us unsigned short int
#define fin freopen("/home/imtiaz/Desktop/in.txt", "r", stdin)
#define fout freopen("/home/imtiaz/Desktop/out.txt","w", stdout)
#define dbg(x) cerr << #x << ": " << x << endl
#define fastio ios::sync_with_stdio (false); cin.tie (0);
using names... | ALGO | 0.998737 | 4.302262 |
d76b5124-164a-49c8-a565-c33d67c25c5c | 1119-2916/competitive-programming | csacademy/044/d.cpp | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb ... | ALGO | 0.999938 | 4.433405 |
58184c10-52c1-40b5-ab7c-046e4df29f17 | GaussGreen/old-code | JP/code/drlib/market/src/DDEParams.cpp | //----------------------------------------------------------------------------
//
// Group : Convertibles Research
//
// Filename : DDEParams.cpp
//
// Description : parameters for DDE calculations: asset vol, sprd mean reversion etc
//
// Author : Qing Hou
//
//
//--------------------------------... | TOOL | 0.910225 | 7.38238 |
2e5ee5a2-6606-498e-a51a-a07fcbbd7a44 | omey-bhosale/sem7 | DAA/2_Huffman_Coding.cpp | #include<bits/stdc++.h>
using namespace std;
struct MinHeapNode{
char data;
int freq;
MinHeapNode* left, *right;
MinHeapNode(char data, int freq){
left=right=nullptr;
this->data = data;
this->freq = freq;
}
};
void printCodes(struct MinHeapNode* root, string str){
if(root == nullptr){
return;
}
if(ro... | ALGO | 0.999917 | 4.858793 |
505f00f9-fef0-4e83-bc85-cbbb01754751 | r-forge/flr | pkg/FLBioDym/src/fwd.cpp | #include "fwd.hpp"
double calcSP(FLRConstBD model, double stock, double *params)
{
double sp=0.0;
switch(model) {
case FLRConst_BDPellaT:
sp = params[0]*stock;
break;
}
if (sp<0) sp=1e-25;
return sp;}
//
// extern "C" SEXPDLLExport SP(SEXP xModel, SEXP xPar, SEXP xStock, SE... | ALGO | 0.999563 | 6.052841 |
9f4c0bdc-d875-45da-b212-864f40ee7efc | Avi8010/Data-Structures | array/circularsum.cpp | #include <bits/stdc++.h>
#include <climits>
using namespace std;
int kadane(int arr[], int n){
int csum=0;
int maxsum=INT_MIN;
for(int i=0;i<n;i++){
csum+=arr[i];
if(csum<0){
csum=0;
}
maxsum=max(maxsum,csum);
}
}
int main(){
int n;
cin>>n;
int ar... | ALGO | 0.999995 | 4.43027 |
8378d2f8-b77a-4079-8bbb-b57019703b62 | tanyaaa05/Data-Structures-Learning | Char Array/uppercaseOfcharArray.cpp | #include<iostream>
#include<string.h>
using namespace std;
void convertIntoUppercase(char word[]) {
int n=strlen(word);
for(int i = 0; i < n; i++) {
if(word[i]>='a' && word[i]<='z'){
word[i] = word[i] + 'A' - 'a';
}
}
}
int main() {
char word[100];
cin.getline(wor... | ALGO | 0.96561 | 4.825383 |
0b406dca-1379-465d-975a-181d3a462c92 | y123456yz/reading-and-annotate-mongodb-5.0 | mongo-r5.0.7/src/third_party/mozjs-60/extract/modules/fdlibm/e_pow.cpp | /* @(#)e_pow.c 1.5 04/04/22 SMI */
/* __ieee754_pow(x,y) return x**y
*
* n
* Method: Let x = 2 * (1+f)
* 1. Compute and return log2(x) in two pieces:
* log2(x) = w1 + w2,
* where w1 has 53-24 = 29 bit trailing zeros.
* 2. Perform y*log2(x) = n+y' by simulating multi-precision
* arithmetic, wh... | ALGO | 0.999751 | 5.638732 |
247cfe21-526c-49f4-9460-f388b451b800 | FRalissia88/Vision_robot | opencv/sources/modules/photo/src/align.cpp | #include "precomp.hpp"
#include "opencv2/photo.hpp"
#include "opencv2/imgproc.hpp"
#include "hdr_common.hpp"
namespace cv
{
class AlignMTBImpl CV_FINAL : public AlignMTB
{
public:
AlignMTBImpl(int _max_bits, int _exclude_range, bool _cut) :
name("AlignMTB"),
max_bits(_max_bits),
exclude_ra... | TOOL | 0.971628 | 5.323123 |
81eb26c9-fa4d-443f-b0f5-5b037faceda9 | lydsera/Solutions | LeetCode/383.cpp | #include<iostream>
#include<unordered_map>
using namespace std;
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
int len=magazine.size();
unordered_map<char,int> m;
for(int i=0;i<len;i++)
{
char tmp=magazine[i];
if(m.find(tmp)... | ALGO | 0.999926 | 5.476768 |
66ac8099-47af-46d8-a588-0cc5dae756f2 | Punisherofgod-sanskar/matrix | pathfinder.cpp | // ✅ Final updated pathfinder.cpp (fully correct for multiple runs)
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <chrono>
#include <cstdlib>
#include <algorithm>
using namespace std;
using namespace chrono;
struct Node {
int x, y, g, h;
Node* parent;
int f() const { re... | ALGO | 0.999609 | 5.333343 |
5fa13f8a-6cc3-4b55-881d-97a3c4fba8be | snikolova27/SDP | group-G/source/proxy/proxy.cpp | #include <cstdint>
#include <cstring>
#include <iostream>
// change to 1 to compile StaticBitset
#if 0
struct StaticBitset {
private:
uint32_t *data;
int count;
public:
StaticBitset(int count, bool value)
: data(new uint32_t[/*TODO*/])
, count(count) {
if (value) {
// set *all* bits to 1
memset(data, ... | TOOL | 0.99637 | 6.10323 |
e8b40a3b-f91e-4ce7-b667-ff5d6179c02a | xrisk/2018 | Codechef/PERFNEC.cpp | #include <limits.h>
#include <iostream>
#include <map>
#include <unordered_map>
#include <utility>
using namespace std;
typedef pair<int, int> PII;
int S, G, Q, R, D;
int ok(int o) {
switch (o) {
case 0:
return S;
case 1:
return G;
case 2:
return Q;
case 3:
return R;
cas... | ALGO | 0.9998 | 4.476226 |
705586b0-d2e7-476f-8fd3-1c7dcc28ee50 | LightX-Project/frameworks_av | media/libmedia/StringArray.cpp | //
// Sortable array of strings. STL-ish, but STL-free.
//
#include <stdlib.h>
#include <string.h>
#include <media/StringArray.h>
namespace android {
//
// An expanding array of strings. Add, get, sort, delete.
//
StringArray::StringArray()
: mMax(0), mCurrent(0), mArray(NULL)
{
}
StringArray:: ~StringArray(... | TOOL | 0.971086 | 6.43154 |
d3e86a4d-a2ce-4bd7-8972-f7d6735d0909 | adobrich/CppPrimer | Chapter_04/exercise_22b.cpp | // Extend the program that assigned high pass, pass and fail grades to also
// assign low pass for grades between 60 and 75 inclusive. Write two versions:
// One version that uses only conditional operators; the other should use one
// or more `if` statements. Which version do you think is easier to understand
// and w... | TOOL | 0.852657 | 5.232895 |
d5c2dad6-9ffc-4051-bbb4-f0364ac81467 | gmh5225/KProcTerminator | src/KProcTerminator/ProcessUtilities.cpp | #include "ProcessUtilities.hpp"
NTSTATUS FindProcessId(const WCHAR* processName, PHANDLE ProcessId) {
NTSTATUS status;
ULONG neededSize;
PSYSTEM_PROCESS_INFORMATION processInfo;
status = ZwQuerySystemInformation(SystemProcessInformation, NULL, 0, &neededSize);
if (!NT_SUCCESS(status) && status != ... | TOOL | 0.882423 | 6.075145 |
418b173f-163b-4839-95e4-461ac4d98cc2 | kushagra-18/Leetcode-solutions | 1431. Kids With the Greatest Number of Candies.cpp | class Solution {
public:
vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
int max = *max_element(candies.begin(), candies.end());
int i;
vector <bool> candiesNew;
int n =candies.size();
for(i = 0;i<n;i++){
... | ALGO | 0.999934 | 5.913943 |
3ef09a40-95f3-4f97-9ab6-9d4d0f552f74 | RinCloud/TrickCatcher | Datasets/TrickyBugs/GenProgs/dpp_generated_progs_cpp/p04047/p04047_num2_parsed.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> skewers(2*N);
for (int i = 0; i < 2*N; i++) {
cin >> skewers[i];
}
sort(skewers.begin(), skewers.end());
int maxIngredients = 0;
for (int i =... | ALGO | 0.999823 | 4.743056 |
8d572917-6faa-4a6c-9f53-612a0d2ccc8a | Hariom-Nagar211/Data-Structures-and-Algorithms | 47_BinaryTree/4_Zig_Zag_Traversal.cpp | #include<bits/stdc++.h>
using namespace std;
struct node
{
int data;
struct node* left;
struct node* right;
node(int val)
{
data = val;
left = nullptr;
right = nullptr;
}
};
void Brute(node* root)
{
stack<node*> st1;
stack<node*> st2;
vector<int> arr;
... | ALGO | 0.999997 | 5.200761 |
cded5463-2027-49a4-aed6-3e35001c38a7 | OCHMOHA/pycpp | Dichotomy_Method.cpp | #include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
double example_function(double x) {
return x * x * x - 0.2 * x * x + 0.5 * x - 1;
}
// Dichotomy (Bisection) method to find the root of a function
// f - pointer to the function
// a, b - interval where the root is searched
// epsilon -... | ALGO | 0.999997 | 6.532876 |
68d9d4bd-21d1-43e7-9c2d-cf4955ce1481 | Sehee-Lee-01/algorithmCPP | class2/11866.cpp | #include <iostream>
#include <vector>
using namespace std;
int N, K;
vector<int> input;
int main() {
scanf("%d %d", &N, &K);
for (int i=1; i<=N; i++) {input.push_back(i);}
printf("<");
int index = K-1;
vector<int>::iterator del_iter;
while (!input.empty()) {
if (index>=input.size()) {
... | ALGO | 0.999965 | 3.238823 |
5325731a-b036-4243-8802-b0d2e39c47c7 | electricalArt/SomeOldCppProjects | VasilievAN_Programmirovanie_na_c++/chapter4_functions/4.16_function-pointer_demonstrate.cpp | /*
* =====================================================================================
*
* Filename: 4.16_function-pointer_demonstrate.cpp
*
* Description: creates three pointers to funcs and demonstrates them
*
* Version: 1.0
* Created: 05/31/20 13:11:35
* Revision: none
... | TOOL | 0.862881 | 4.890284 |
406e1b9f-e17e-4b23-91c1-e9fe0e3fda40 | Omar-Khaled2198/Codeforces_Solutions | 262/A [Roma and Lucky Numbers].cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <stdio.h>
using namespace std;
int main()
{
int n,k,c=0,fc=0;
cin>>n>>k;
string s;
for(int i=0;i<n;i++)
{
cin>>s;
for(int i=0;i<s.size();i++)
{
if(s[i]=='4'||s[i]=='7')
{
c++;
}
}
if(c<=k)
fc... | ALGO | 0.999289 | 3.550846 |
6a1c7b35-a0f7-413f-af15-7292106c57c1 | Mosina916/OCT24_Cpp | heap/finallnlargest.cpp | #include<iostream>
#include <queue>
using namespace std;
int main(){
priority_queue<int,vector<int>,greater<int> > h;
// 5 7 2 1 9 3 71 -4 -6 15 3 1 -1
int n;
cin>>n;//4
int c=0;
int data;
cin>>data;//3
while(data!=-1){
if(c<=n-1){
h.push(data);
c++;//4
}
else{
if(h.top()<data){
h.pop();
h.push(data);... | ALGO | 0.999957 | 3.599504 |
8c40ab00-9446-4834-90ab-56b4f2da440d | Prateek307/Dynamic-Programming | Climbing_stairs.cpp | /*
In this problem you are having stairs you have tell in how many minimum steps you can reach the last step also at one time
you can either jump 1 or 2 steps
*/
#include<bits/stdc++.h>
using namespace std;
const long long mod = 1e9+7;
int ways(int i,vector<int> &dp)
{
if(i==0 || i==1)
return dp[i] = 1;
... | ALGO | 0.999991 | 5.06266 |
ea08ecc3-eddb-4581-aad9-7f075b9641c3 | nenakhov22/algorithms-and-data-structures | task6-avl-tree.cpp | #include <iostream>
#include <fstream>
using namespace std;
struct AVLTreeNode {
AVLTreeNode(int data=0)
:_pLeft(nullptr),
_pRight(nullptr),
_pParent(nullptr),
_data(data),
_bf(0)
{}
AVLTreeNode* _pLeft; // Левый потомок узла
AVLTreeNode* _pRight; // правый дочерний элемент узла
AVLTreeNode* _pParent;... | ALGO | 0.999893 | 3.927931 |
ccab3175-0033-47fd-ae59-aa9eb43f3868 | hRJ06/DSA | Leetcode/861. Score After Flipping Matrix.cpp | class Solution {
public:
int matrixScore(vector<vector<int>>& grid) {
int n = grid.size(), m = grid[0].size();
for(int i = 0; i<n; i++) {
if(!grid[i][0]) {
for(int j = 0; j<m; j++) {
grid[i][j] ^= 1;
}
}
}
fo... | ALGO | 0.999974 | 6.455635 |
707012d2-a96b-4295-a51e-a92deb584586 | manikanta2901/ubuntu | .history/codingChallenges/cpp/Codechef/longChallenges/August/aaa_20200817093002.cpp | #include<bits/stdc++.h>
#include<vector>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<iterator>
#include<string>
#include<map>
#define vv vector
#define F first
#define S second
#define MP make_pair
#define EXECUTE_FASTER ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define printM... | ALGO | 0.999963 | 3.10348 |
52a468ad-6e6c-44d3-8fed-42053130d026 | Supermjork/IEEEXtreme | Codeforces/Sheet 1/S-interval.cpp | #include <iostream>
using namespace std;
int main()
{
float x;
cin >> x;
// determine the interval
if (x >= 0 && x <= 25)
{
cout << "Interval [0,25]";
}
else if (x > 25 && x <= 50)
{
cout << "Interval (25,50]";
}
else if (x > 50 && x <= 75)
{
cout ... | ALGO | 0.94725 | 4.272824 |
2a292d0d-42c0-45f6-bfdc-3a8f0d59d7b8 | bachtran02/comp-prog | codeForces/B_Queue_at_the_School.cpp | #include <bits/stdc++.h>
using namespace std;
int n, t;
// bggbg
// gbggb
// ggbgb
string reorder(string & s){
string next = s;
for(int i = 0; i < n-1; i++){
if(s[i] == 'B' && s[i + 1] == 'G'){
next[i] = 'G', next[i + 1] = 'B';
}
}
return next;
}
int main(){
ios::sync_... | ALGO | 0.999858 | 4.774036 |
5c46dfa8-6ae5-491c-aabe-c06782702f93 | alanhpereira/OBIPrep-2022 | solves/segTree/arranhaCeu/arranhaCeu2.cpp | #include <stdio.h>
#define MAX 100100
typedef long long ll;
ll seg[4*MAX];
ll query(int idx, int l, int r, int i, int j){
if(l > j || r < i) return 0;
if(l >= i && r <= j) return seg[idx];
int mid = (l+r)/2;
return query(2*idx, l, mid, i, j) + query(2*idx+1, mid+1, r, i, j);
}
void update(int idx, i... | ALGO | 0.999847 | 3.918374 |
8b1e1964-5729-40e3-810e-c23aee22d186 | somanshu611/DSA | StacksAndQueues/StackImplementationUsingQueue.cpp | #include<bits/stdc++.h>
using namespace std;
// For interview, first start with 2 queues approach, then tell the
// single queue approach.
// For both the approachs TC = O(N), the only difference is SC = O(2*N) for 2 queues
// and SC = O(N) for single queue.
// single Queue Approach :
class MyStack {
public:
... | ALGO | 0.999295 | 4.931479 |
8f08c489-8011-4498-85b6-3d17d9519b9a | dmachaj/AdventOfCode | 2020/Day4/main.cpp | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include "HelpfulInfrastructure.h"
using namespace std::literals;
#pragma warning (disable: 4267) // size_t <-> uint
namespace
{
void Part1()
{
std::string bigInput;
char on... | ALGO | 0.896331 | 5.998544 |
7966daa5-1d16-474b-b269-339e418643f1 | pr7prashant/dsa-practice | RecursionAndBacktracking/WordBreak.cpp | /*
**************** Problem Description ****************
Given a string s and a dictionary of words dict of length n, add spaces in s to construct a sentence where each word is a valid dictionary word.
Each dictionary word can be used more than once. Return all such possible sentences.
Example 1 :
Input:
s... | ALGO | 0.999967 | 6.062942 |
3125c3f7-05f2-4a07-9c49-9e217328a7c3 | 1-08-08/vs_code | Trie.cpp | #include <bits/stdc++.h>
using namespace std;
class Trie
{
public:
bool is_end;
Trie *vec[26];
long long number;
Trie()
{
this->is_end = false;
this->number = -1;
for (int i = 0; i < 26; i++)
this->vec[i] = NULL;
}
};
void insert(Trie *root, string nam, long... | ALGO | 0.999924 | 4.612853 |
fd161bb8-b09a-464a-b3f0-7eed7295f883 | aleena-zahra/cpp-console-patterns | nerdy_square_pattern2.cpp | #include<iostream>
using namespace std;
int main(){
int rows;
cout<<"Enter rows\n";
cin>>rows;
for(int i=0; i<rows; i++){
for (int j=0; j<rows; j++ ){
if(j>=i){
cout<<j-i;
}
else if(i>j){
cout<<rows-j;
}
}
... | ALGO | 0.999902 | 3.660649 |
9bc51dd4-c3e5-486a-9639-f3da96d2cd03 | mrh880/LearningCPlusPlusWithMohammedAbu-Hadhoud | LearningC++WithMohammedAbu-Hadhoud/Course8/Libraries/StringsOperations.cpp | #include "StringsOperations.h"
#include <string>
#include <vector>
using namespace std;
vector<string> SplitWordInSentence(string Word, string Delemiter)
{
int LengthOfDelemiter = Delemiter.length();
int Position = 0;
string TempWord = "";
vector<string> TempVector;
while ((Position = Word.find(D... | TOOL | 0.949108 | 4.151715 |
854f1051-3802-41a2-b591-73ec471ef069 | Teenakumawat123/LEETCODE | 1411-convert-binary-number-in-a-linked-list-to-integer/convert-binary-number-in-a-linked-list-to-integer.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:
int binary_to_decimal... | ALGO | 0.999991 | 5.835524 |
eb48d344-899f-45af-9004-ebdaea9707ff | yasmws/Algorithms | Lista1/c.cpp | #include "stdio.h"
#include "stdlib.h"
#include "stdbool.h"
#include "string.h"
#include "math.h"
#include<stdio.h>
#include<stack>
#include<vector>
#define UNVISITED 0
#define VISITED 1
using namespace std;
typedef struct graph
{
vector < vector < int > >list;
int numEdge;
int* Mark;
int numVertex;
}Graph... | ALGO | 0.999966 | 3.827245 |
7e6c4a62-23e5-4b97-804d-ef075047b2ba | njrafi/Competitive-Programming-Solutions | Vjudge/UVA/Counting Zeroes.cpp | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define gc getchar
#define pc putchar
#else
#define gc getchar_unlocked
#define pc putchar_unlocked
#endif
using namespace std;
#define vi vector<int>
#define si set<int>
#define vs vector<string>
#define pii pair<int,int>
#define vpi vector<pii>
#define pri priority_que... | ALGO | 0.999327 | 3.804634 |
67f10f88-6ea0-43f9-ba07-5ca3a7ff5893 | fedeluis/MSc-proj | CV/project/src/p_measure.cpp | #include "p_measure.h"
#include "gt_reader.h"
#include "UmboFunct.h"
#include <iostream>
#include <stdexcept>
int const N_CLASSES = 14;
double mAP() {
int gt_counter[N_CLASSES]; // counter for ground truth bounding boxes
for(int i=0; i<N_CLASSES; i++)
gt_counter[i]=0;
std::map<int, std::vector... | DATA | 0.951069 | 3.841627 |
b0447400-8e75-4f90-ac8a-7351f92ab244 | yashk9293/Love-Babbar-DSA | Lec_085/85_0.cpp | // Adjacent List
#include<bits/stdc++.h>
using namespace std;
class Graph {
public:
unordered_map<int, list<int>> adj;
void addEdge(int u, int v, bool direction) {
// direction = false -> undirected graph;
// direction = true -> directed graph
// create an edge from u to v
... | ALGO | 0.999972 | 5.698994 |
5d5ea132-769c-4356-9c56-d613e71415aa | saingsab/ladspa-plugin-bundle | cmt_1.17/src/ambisonic.cpp | /*****************************************************************************/
/* This module provides simple plugins handling B-Format and
FMH-Format audio. Ambisonics is a mathematical technique designed
to capture the sound field around point. See
http://www.muse.demon.co.uk/3daudio.html. "Ambisonics" is ... | TOOL | 0.901003 | 5.943983 |
621a1d66-62fc-49d6-bfa6-00ce3a8ef884 | GooferByte/data-structures-and-algo | DataStructures-and-Algorithm-main/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Minimum element in BST .cpp | int minValue(Node* root) {
if(!root) return -1;
while(root!=NULL){
if(root->left != NULL){
root = root->left;
}
else return root->data;
}
}
| ALGO | 0.999985 | 3.797985 |
93d2b266-c774-4b42-997b-9afba794f2e3 | Sgewux/CompetitiveProgramming | codeforces/2024/PermutationCounting.cpp | #include <bits/stdc++.h>
void solve(){
long long n;
long long k;
std::cin>>n;
std::cin>>k;
std::vector<long long>v(n);
for(long long i = 0; i<n; i++){
std::cin>>v[i];
}
std::sort(v.begin(), v.end());
long long min = v[0];
long long lastSeen = v[0];
long long i =0;... | ALGO | 0.999928 | 3.936292 |
45f0336b-9f4b-43c4-b342-587c5594214c | gokulsreekumar/C-Problem-Solving | insertionSortMod.cpp | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
void insertionSort(vector<int>& arr) {
int i=1;
int n=arr.size();
for(i; i<n; i+=2) {
lower_bound(arr.begin(), arr.begin()+i+1, )
}
}
int main() {
return 0;
} | ALGO | 0.999913 | 5.072921 |
b91f470c-51e3-47f8-8f74-44efb4820a53 | ZYLZhuPP/OI | YBTOJ/675_2.cpp | #include<bits/stdc++.h>
using namespace std;
#define For(i, l, r) for (int i = (l); i <= (r); ++i)
const int N = 2e5 + 5;
struct IO {
char c; int f;
#define gc() getchar()
template<class C>
inline IO& operator >> (C &x) {
x = 0; f = 1;
while (!isdigit(c = gc()) && ~c) f |= -!(c ^ 45);
... | ALGO | 0.999948 | 3.739408 |
5e0c8932-5d82-4043-840f-3e107a94a236 | kavita121/Coding | Median2SortedArray_Leetcode.cpp | //4. Median of Two Sorted Arrays
//Leetcode ACCEPTED
class Solution {
public:
vector<int> merge(vector<int> &A, vector<int> &B)
{
vector<int> res;
int i=0, j=0;
while(i<A.size() && j<B.size())
{
if(A[i] < B[j])
{
res.push_back(A[i]);
... | ALGO | 0.999934 | 6.050714 |
2b209884-75c4-4cb1-97e6-83d77a8c77cd | multifacs/pp-projects-collection | modules/tbb/conjugate_gradient/main.cpp | #include "./conjugate_gradient.h"
TEST(CONJUGATE_GRAD_TBB, TEST_1) {
int n = 2;
matrix A;
vec B;
B = generateRandomVector(n);
A = generateMatrix(generateRandomVector(n));
// print("A", A);
// print("B", B);
std::vector<double> X = conjugateGradientSolver(A, B);
// print("X", X);
vec check = ma... | TEST | 0.860284 | 6.206165 |
6f2acd56-5228-4781-9e90-cf375bcc2761 | Ramanees/Comp-Arch | booth algorithm.cpp | #include <stdio.h>
// Function to perform Booth's algorithm for multiplication
int boothMultiplication(int multiplicand, int multiplier) {
int product = 0;
int accumulator = 0;
int m = multiplicand;
int q = multiplier;
int count = sizeof(int) * 8; // Number of bits in an integer
// Extend the ... | ALGO | 0.999993 | 5.563446 |
e3f247f3-19ab-4266-b270-5195eea3a815 | ishangautam7/BCT | 2nd sem/l1/q5.cpp | #include <iostream>
using namespace std;
inline double calculatePerimeter(float r){
return 3.14 * 2 * r;
}
inline double calculatePerimeter(double l, double b){
return 2*(l + b);
}
inline double calculatePerimeter(double a, double b, double c){
return a + b + c;
}
int main(){
float r;
double l, ... | ALGO | 0.990515 | 3.351419 |
e32d78b3-bbbe-4e7a-8514-1ad22073924e | Linvoker/leetcode | 108.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
//根本不用去想复杂的二叉树旋转操作，题目没说按照从低到高的顺序制作AVL树
//只需要满足平衡条件即可，得到的AVL树按照插入的顺序不同可以不止有一种，只要高度平衡就好
//测试的时候估计是比较高度差是否小于等于1
//所以这题用veco... | ALGO | 0.999998 | 6.53495 |
4ad337f0-fb02-4ddf-984d-65030c272772 | agul/contest-tasks | caide_archive/2016-03-03/cf631B/cf631B.cpp | #include "Head.h"
#include "IO/IO.h"
using namespace std;
int __;
IO io;
const int MOD = 1000000007;
const int MAXN = 111111;
struct Event {
int type;
int index;
int color;
int time;
Event() {}
Event(int type, int index, int color, int time) : type(type), index(index), color(color), time(time) {}
bool opera... | ALGO | 0.999071 | 4.085899 |
124cc2fd-c0b3-4684-9738-9008b20b10b6 | debjit31/leetcode-solutions | Top 20 Dynammic Programming Problems GFG/subset_sum.cpp | #include <stdio.h>
#include<bits/stdc++.h>
using namespace std;
bool isSubsetSum(int set[], int n, int sum)
{
bool subset[n + 1][sum + 1];
for (int i = 0; i <= n; i++)
subset[i][0] = true;
for (int i = 1; i <= sum; i++)
subset[0][i] = false;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= sum;... | ALGO | 0.999833 | 4.17624 |
a3b319e0-f96a-4399-ae24-7e6b3c687511 | PedroKravetz/ClubeProgramacao | Oficinas/2021-07-13/CF10385D.cpp | #include <bits/stdc++.h>
using namespace std;
int caixas[112345];
int main()
{
int n, controle, soma = 0, aux;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &controle);
caixas[controle] += 1;
aux = controle;
while (caixas[aux] == 2)
{
ca... | ALGO | 0.999958 | 3.52044 |
11cf66d3-1f64-4944-a9a3-540d26859467 | falkdavid/blender-branches | intern/cycles/integrator/path_trace_work_gpu.cpp | #include "integrator/path_trace_work_gpu.h"
#include "integrator/path_trace_display.h"
#include "device/device.h"
#include "integrator/pass_accessor_gpu.h"
#include "scene/scene.h"
#include "session/buffers.h"
#include "util/log.h"
#include "util/string.h"
#include "util/tbb.h"
#include "util/time.h"
#include "kerne... | ALGO | 0.90409 | 4.348535 |
009f90dd-4289-4296-9ae2-61b7ae432798 | peter3110/algo3-tp1 | problema3/prob3_metodo1.cpp |
#include <iostream>
#include <vector>
#include <fstream>
#include <math.h>
#include <assert.h>
#include <cstdio>
#include <utility>
#include <sys/time.h>
#include <iomanip>
using namespace std;
/* Funciones Auxiliares */
pair<bool, int> nuevoHazard2(int productoi, int camionj, vector<int> &productosEnCamion, vector<... | ALGO | 0.999922 | 3.870163 |
e469f8e8-5ee1-40a5-85a2-fa843a496f5d | anshumanmishhra1/LeetCode | countNegativeNumbersInaSortedMatrix.cpp | class Solution {
public:
int countNegatives(vector<vector<int>>& grid) {
int m= grid.size();
int n = grid[0].size();
int count = 0;
for(int i=0;i<m;i++){
int lo = 0;
int hi = n-1;
while(lo<=hi){
int mid = lo+(hi-lo)/2;
... | ALGO | 0.99999 | 6.346473 |
6c073175-3814-4655-93b0-0e62a46daf5f | Rajeshnds/Competitive-Programming | codeforces/dragonmas/codeforces(c++)/C_The_Delivery_Dilemma.cpp | #include<bits/stdc++.h>
using namespace std;
# define ll long long
int t,n,b,a[200001];
pair<ll,ll>p[200001];
void solve(){
long long m=0,s=0;
for(int i=0;i<n;i++)cin>>p[i].first;
for(int i=0;i<n;i++)cin>>p[i].second,m+=p[i].second;
sort(p,p+n);
for(int i=n-1;i>=0;i--){
m=min(m,max(p[i].firs... | ALGO | 0.999352 | 3.305443 |
36686507-7941-46cc-97fe-b8c7e567b0ff | QQ-BangxinXu/CodingInterviews | 061-按之字形顺序打印二叉树/levelorder_stack.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
using namespace std;
#define __tmain main
#ifdef __tmain
#define debug cout
#else
#define debug 0 && cout
#endif // __tmain
#define undebug 0 && cout
#ifdef __tmain
struct TreeNode {
int val;
struct TreeNode *left;
struct ... | ALGO | 0.999997 | 4.990596 |
8cc012f0-e7e8-44d7-8982-750b4fc2ae79 | Pratikekhande/C-plus-plus-DSA | recurrsion/Subsets.cpp | class Solution {
private:
void solve(vector<int> nums, vector<int> output, int index, vector<vector<int> >& ans) {
//base case
if(index >= nums.size()) {
ans.push_back(output);
return ;
}
//exclude
solve(nums, output, index+1, ans);
... | ALGO | 0.999947 | 6.182323 |
d23e3a71-5f4c-4418-bc48-035c81cbde0b | tasnim-zeba/Problem-Solving | Codeforces/1178b.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
long long a[1000005],b[1000005],i,c,l;
cin>>s;
l=s.size();
if(l<5){
printf("0\n");
}
else{
a[0]=0;
for(i=1;i<l;i++){
if(s[i]=='v'){
if(s[i]==s[i-1]){
a[i]=a[i-1]+1;
}
... | ALGO | 0.999515 | 3.878276 |
5dda32a8-00a6-401b-9cf8-47e864fec8d8 | Robin329/CPlusPlusThings | learn_algorithms/leetcode/algorithms/cpp/maximumScoreFromRemovingSubstrings/MaximumScoreFromRemovingSubstrings.cpp | // Source :
// https://leetcode.com/problems/maximum-score-from-removing-substrings/ Author
// : Hao Chen Date : 2021-03-28
/*****************************************************************************************************
*
* You are given a string s and two integers x and y. You can perform two types
*of op... | ALGO | 0.999838 | 6.166945 |
23a50990-e812-4af9-973b-3c746b8608f4 | Nesquiker/AOC_2022 | ten/main.cpp | #include <iostream>
#include <fstream>
#include <unordered_map>
#include <vector>
void part_2 (const std::string f_path) {
std::ifstream data(f_path);
std::string row (40, '.');
std::vector<std::string> image (6, row);
int cycle = -1;
bool last_was_add = false;
int add_x = 0;
int total = 1;... | ALGO | 0.999737 | 6.183126 |
6ce85009-69e6-4930-82fc-4e57eef805f9 | Akash-dangwal/Assignment2 | q5.cpp | class MyLinkedList {
private:
struct Node {
int a;
Node* b;
Node(int x) : a(x), b(nullptr) {}
};
Node* c;
int d;
public:
MyLinkedList() : c(nullptr), d(0) {
}
int get(int e) {
if (e < 0 || e >= d) {
return -1;
}
... | ALGO | 0.999624 | 5.045044 |
438e67a1-6bcb-416b-b651-996dab774f40 | iusmng/C | s_dec2oct.cpp | /*Convert decimal to octal by equation*/
#include<stdio.h>
void dec_oct(int dec)
{
int oct=0,i=1;
while(dec!=0)
{
oct=oct+(dec%8)*i;
dec=dec/8;
i=i*10;
}
printf("%d", oct);
}
int main()
{
int dec;
printf("Enter a decimal number: ");
scanf("%d", &dec);
dec_oc... | ALGO | 0.997759 | 4.591238 |
1ed5519c-59ab-4d26-8465-95db7b862878 | osirisQdt2810/algorithms | src/leetcode/cheatsheet/solution/2700-2799/2799.Count Complete Subarrays in an Array/Solution.cpp | class Solution {
public:
int countCompleteSubarrays(vector<int>& nums) {
unordered_set<int> s(nums.begin(), nums.end());
int cnt = s.size();
int ans = 0, n = nums.size();
for (int i = 0; i < n; ++i) {
s.clear();
for (int j = i; j < n; ++j) {
s.... | ALGO | 0.999932 | 6.161869 |
fc1002ab-dc5c-42c8-b5d4-65409ceba608 | reposhelf/playground | cpp-lang/algo/sedgewick/ch03/distancless.cpp | #include "point.h"
#include <cstdlib>
#include <iostream>
using namespace std;
float randFloat()
{
return 1.0 * rand() / RAND_MAX;
}
int main(int argc, char *argv[])
{
const int pointCount = atoi(argv[1]);
if (!pointCount)
{
cout << "error: invalid value" << endl;
return 0;
}
... | ALGO | 0.947849 | 4.670042 |
f459b7f8-388a-4a42-b019-08952c513ed1 | gbeatty/waveTextureGenerator | WaveTextureGenerator.cpp |
#include "tessendorf.h"
#define STB_IMAGE_WRITE_IMPLEMENTATION
#include "stb_image_write.h"
#include <strstream>
#include <iostream>
#include <iomanip>
#include <ppl.h>
#include <atomic>
#include <filesystem>
using namespace std::experimental;
int main()
{
const auto outputDir = filesystem::current_path().appe... | TOOL | 0.857811 | 4.377524 |
06cb2070-d7bf-4cb6-907a-800aacc07c65 | powware/leet-code | src/746_min_cost_climbing_stairs.cpp | #include <vector>
#include <unordered_map>
#include <gtest/gtest.h>
class Solution
{
public:
int minCostClimbingStairs(std::vector<int> &cost)
{
const auto n = cost.size();
for (std::size_t i = 2; i < n; ++i)
{
cost[i] += std::min(cost[i - 1], cost[i - 2]);
}
... | TEST | 0.997998 | 6.792354 |
91a122bf-6b4c-45b0-887a-f02b2b19b4f1 | ghibli613/cp-coding | coding/codeforces/ct14/B.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
const double PI = 3.14159265358979323846;
void solve()
{
int n, x; cin >> n >> x;
... | ALGO | 0.999962 | 4.122833 |
02d1e810-2b7b-4563-ac96-5da0c77b0a0c | OwaisK4/Competitive-Programming | CSES/Cycle_Finding.cpp | #include <bits/stdc++.h>
#define int long long
#define all(a) a.begin(), a.end()
#define seed chrono::high_resolution_clock::now().time_since_epoch().count()
#define file_read(filepath) freopen(filepath, "r", stdin);
#define file_write(filepath) freopen(filepath, "w", stdout);
#define fastio \
ios... | ALGO | 0.999897 | 4.836572 |
6baf7ba9-ab06-4f7a-aa8f-ea7b86707b23 | eourcs/LockFreeCuckooHash | tbb-2017_U5/examples/task/tree_sum/main.cpp | #include "common.h"
#include <cstdlib>
#include <cstdio>
#include <cstring>
// The performance of this example can be significantly better when
// the objects are allocated by the scalable_allocator instead of the
// default "operator new". The reason is that the scalable_allocator
// typically packs small objects m... | TOOL | 0.906004 | 5.937888 |
203fda34-04f7-47dd-8fb2-6ad7122363bc | ratnesh-maurya/Educational-Tech-Exploration | C++ and C/C++/Sorting/3WayMergeSort.cpp | // C++ Program to perform 3 way Merge Sort
#include <bits/stdc++.h>
using namespace std;
void merge(vector<int> &gArray, int low, int mid1,
int mid2, int high, vector<int> &destArray)
{
int i = low, j = mid1, k = mid2, l = low;
// Choose smaller of the smallest in the three ranges
while ((i < mid1) && (j < mid2)... | ALGO | 0.999973 | 5.148783 |
e7a62c57-85e7-4e5f-971a-95e9db00627c | lancelote/stepic_programming_intro_cplusplus | src/module3/local_max/local_max.cpp | /**
* Элемент последовательности называется локальным максимумом, если он строго
* больше предыдущего и последующего элемента последовательности. Первый и
* последний элемент последовательности не являются локальными максимумами.
*
* Дана последовательность натуральных чисел, завершающаяся числом 0.
* Определите ... | ALGO | 0.999911 | 4.681045 |
4ceb197f-ef29-48e8-8129-507394743274 | lamoreauxaj/USACO | Training Pages/Chapter 1/transform.cpp | /*
ID: lamorea1
LANG: C++
PROG: transform
*/
#include <cstdio>
using namespace std;
int N;
char map[13][13];
char map1[13][13];
bool eq() {
for(int r = 0; r < N; r++) for(int c = 0; c < N; c++) if(map[r][c]!=map1[r][c]) return false; return true;
}
void rotate() {
for(int r = 0; r < (N+1)/2; r++) {
for(int c = 0... | ALGO | 0.999996 | 3.17099 |
bb7bc9df-0515-4df5-9495-a4e250b3f773 | MelodyyyYin/DataZip-Efficient-Data-Compression-and-Decompression | HCTree.cpp | #include "HCTree.hpp"
#include "Helper.hpp"
#include <vector>
#include <queue>
#
void helper(HCNode * node);
void helper(HCNode * node){
if(node == nullptr){
return;
}
if(node -> c1 != nullptr){
helper(node -> c1);
}
if(node -> c0 != nullptr){
helper(node -> c0);
}
d... | ALGO | 0.999839 | 4.20509 |
83fb7654-b9ee-4e7b-b92e-263b77d52f33 | ishandutta2007/codeforces | krk/normal/187/A.cpp | #include <cstdio>
using namespace std;
const int Maxn = 200005;
int n;
int a[Maxn], pos[Maxn];
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
int b; scanf("%d", &b);
pos[b] = i;
}
int i = 1;
while (i < n && pos[a[i - 1]] < pos[a[i]]) i++;
prin... | ALGO | 0.999887 | 3.432445 |
ad150597-97a7-4a6e-bacb-04ba3babd680 | LaZoark/NIU_programming | C++程式設計/ch07/ex07_03.cpp | #include<iostream>
#include<cstdlib>
using namespace std;
//U}Cƭ쫬ŧi
void print_arr(int arr[],int);//H}CWٶǻ
void swap(int *i, int *j);
void BubbleSort(int *arr, int length);//Hб`ƶǻ
int main()
{
//ŧiêlƦZ}C
int score_arr[]={78,69,83,90,75,54,71,45,67};
cout<<"Z}C:"<<endl;
//Is*
print_arr(score_arr,9);
cou... | ALGO | 0.999752 | 3.989699 |
822c66dd-154a-4c8f-9222-c1c686ae2924 | YangZhou1997/SmartNIC-GEM5 | src/systemc/tests/systemc/misc/v1.0/dash1/speed.cpp | /*****************************************************************************
speed.cpp -- Definition of the speedometer.
Original Author: Ali Dasdan, Synopsys, Inc.
*****************************************************************************/
/*************************************************************... | ALGO | 0.9125 | 5.958485 |
12205b21-2f9a-4cff-81f3-8231ea46c8c6 | fj0rdingz/Competive_Programming | contests/cf745/a.cpp | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
// g++ hoge.cpp -std=c++17 -I . でコンパイルできる
// -fsanitize=undefinedでオーバーフロー検出
#include <bits/stdc++.h>
//#include <atcoder/all>
#define mod 2000000014
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO c... | ALGO | 0.999973 | 4.081011 |
3cc31608-b13b-4f3e-87d1-ebee631a44e3 | snejoker/MonteCarloVaREngine | MonteCarloSimulationVaREngine/MonteCarloSimulationVaREngine/TSHandler.cpp | #include "TSHandler.h"
#include <iostream>
#include <cmath>
#include <assert.h>
#include <algorithm>
#include <list>
TSHandler::TSHandler(std::vector<std::vector<double>> riskFactorTimeSeries_, std::vector<AbsOrRel> absOrRelReturnsVector_, unsigned long daysBackUsed_) : riskFactorTimeSeries(riskFactorTimeSeries_), abs... | ALGO | 0.98337 | 6.039422 |
1916e568-9df1-4075-8b2d-83c5195537db | pihu26112005/Cpp | DSA(love babbar)/problems/LECTURE WISE/L-69(BINARY SEARCH TREE)/2-delet_from_BST.cpp |
#include "../L-62(BINARY TREE)/myclass.h"
node* deleteNode(node* root, int key) {
// Write your code here.
node* temp = root ;
if(temp == NULL)
{
return root ;
}
if(key==temp->data)
{
if(temp->left==NULL && temp->right==NULL)
{
delete temp... | ALGO | 0.999961 | 4.012749 |
5611ef88-3943-426f-b41d-f6b90612087e | kosirobwada/AtCoderSubmit | submissions/abc128/b.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF = 1e9;
const ll LINF = 1e18;
const ld pi = 3.141592653589793238;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> vec(N);
for (int i = 0; i < N; i++) {
cin >> get<0>(vec[i]);
int x;
... | ALGO | 0.999814 | 3.756854 |
8d587b88-85ba-4acd-89f3-b24cbd1eaefc | JAceituno/BDD_Biblioteca | index_file.cpp | #include "keynode.hpp"
#include "index_file.hpp"
#include "header_editorial.hpp"
#include "header_book.hpp"
#include "book.hpp"
#include "editorial.hpp"
#include <vector>
#include <cstring>
#include <string>
#include <fstream>
#include <iostream>
using namespace std;
Index_file::Index_file(const char* file_name){
st... | TOOL | 0.963718 | 3.497862 |
fd388179-f3d6-48fb-8a5e-e0c6827d7b3a | AnselGitAccount/USERMESO-2.0-mdpd | src/angle_charmm.cpp | /* ----------------------------------------------------------------------
Contributing author: Paul Crozier (SNL)
------------------------------------------------------------------------- */
#include "math.h"
#include "stdlib.h"
#include "angle_charmm.h"
#include "atom.h"
#include "neighbor.h"
#include "domain.h"
#... | ALGO | 0.998698 | 6.612746 |
3fec13b7-2a1d-4a29-a3df-6d027c617f79 | umaidansari12/CP | previous_codes/construct_binary_tree_from_inorder_and_postorder.cpp | Node* solve(int in[], int post[], int s, int e, int &pi)
{
if (s > e)
return NULL;
Node* root = new Node(post[pi]);
pi--;
if (s == e)
return root;
int i;
for (i = s; i <= e; i++)
if (in[i] == root->data)
break;
if (i <= e)
{
root->right = solve... | ALGO | 0.99999 | 5.945506 |
2de4efdc-c75b-4ebc-80b4-714ff797c38f | yuyangh/LeetCode | 208. Implement Trie Prefix Tree.cpp | #include "LeetCodeLib.h"
/*
* 208. Implement Trie (Prefix Tree)
*
* https://leetcode.com/problems/implement-trie-prefix-tree/description/
*
* algorithms
* Medium
*
* Implement a trie with insert, search, and startsWith methods.
*
* Example:
* Trie trie = new Trie();
*
* trie.insert("apple");
* trie.searc... | ALGO | 0.998725 | 5.953717 |
a034fb6e-c4fc-42ce-92f1-4f7ad3ec6bda | katsuster/binutils-gdb | gdb/testsuite/gdb.rocm/simple.cpp | #include "hip/hip_runtime.h"
#include <cassert>
__global__ void
do_an_addition (int a, int b, int *out)
{
*out = a + b;
}
int
main ()
{
int *result_ptr, result;
/* Allocate memory for the device to write the result to. */
hipError_t error = hipMalloc (&result_ptr, sizeof (int));
assert (error == hipSucces... | ALGO | 0.94174 | 6.267791 |
c9dd132e-96fa-48a0-a322-dceb815b02cd | Momin-786/PF-Lab-Programs-In-C | Functions/evenodd.cpp | #include<stdio.h>
int even_odd(int num){
if(num%2==0)
{
return 0;
}
else
{
return 1;
}
}
int main()
{
int n;
printf("enter number:");
scanf("%d",&n);
int res=even_odd(n);
if(res==0)
{
printf("Even number");
}
else printf("Odd number");
} | ALGO | 0.999969 | 3.249664 |
73e9b7ac-14b0-40f7-a924-3e2bf67d4838 | mdalamrahman4/LeetCode-solutions | 2225-find-players-with-zero-or-one-losses/2225-find-players-with-zero-or-one-losses.cpp | class Solution {
public:
vector<vector<int>> findWinners(vector<vector<int>>& matches) {
map<int,int> lost;
for (auto m : matches)
{
if (!lost.count(m[0])) lost[m[0]] = 0;
lost[m[1]]++;
}
vector<int> zero, ones;
for (auto[k,l] : lost)
... | ALGO | 0.999769 | 5.737783 |
1601996a-bb00-46e4-9139-6bb81902205f | wildcat-rocketry/llvm | libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection.pass.cpp | // <algorithm>
// template<InputIterator InIter1, InputIterator InIter2, typename OutIter>
// requires OutputIterator<OutIter, InIter1::reference>
// && OutputIterator<OutIter, InIter2::reference>
// && HasLess<InIter2::value_type, InIter1::value_type>
// && HasLess<InIter1::value_type, InIte... | TEST | 0.981482 | 6.617931 |
7c66ff8e-4003-4b8d-abb3-ed357c1c688a | Md-Merazul-Islam/XPSC-Batch-3 | Weekly contest/cf div -2/New folder/A_Wallet_Exchange.cpp |
// /**************************************************************
// ** BISMILLAH HIR RAHMAN NIR RAHIM **
// ** Author: Md Merazul Islam **
// ** CST, MPI **
// ** Sreepur, Gazipur, Dhaka ... | ALGO | 0.999804 | 5.383217 |
6c2442eb-df5e-4387-ad95-a61772ded2d1 | sbmaruf/lightoj-Problem_Solution | Data Structures/Segment TreeInterval Tree/1348 - Aladdin and the Return Journey.cpp | #include<bits/stdc++.h>
using namespace std ;
#define MAX 30100
#define LGMAX 16
inline int readInt() {
int ip = getchar_unlocked(), ret = 0, flag = 1;
for(; ip < 48 || ip > 57; ip = getchar_unlocked()) {
if(ip == 45) {
flag = -1;
ip = getchar_unlocked();
break;
}
}
for(; ip > 47 && ip... | ALGO | 0.999525 | 4.622603 |
c057e08c-4fc6-4f14-9e40-8267c7368913 | loveAhQ/fingerprint-identification | demo.cpp | #include"CFinPrint.h"
#include"CFPrintMatch.h"
using namespace std;
int main()
{
//the the size of fingerprint images should be 256x256
CFinPrint f1("fp1.jpg");
CFinPrint f2("fp2.jpg");
CFPrintMatch m(32, 64, 8, 4);
cout << "An example of matching fingerprint(one to one) " << endl;
cout << "match f1 with ... | TOOL | 0.89127 | 3.517209 |
21f1b757-94d9-41a3-8ff0-3cbaa6ac9160 | YvesHarrison/Leetcode | Reservoir Sampling/382. Linked List Random Node/solution.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
/** @param head The linked list's head.
Note that the head is guaranteed to be not null, so it contains at least one node. *... | ALGO | 0.999742 | 5.323399 |
a84d0358-0a30-473d-b72e-5384e068d6b8 | AyushNirmal13/FDS | pizza.cpp | /*
Pizza parlor accepting maximum M orders. Orders are served in first come first served
basis. Order once placed cannot be cancelled. Write C++ program to simulate the system
using circular queue using array.
*/
#include<iostream>
using namespace std;
const int MAX=5;
class PizzaParlour
{
int front,rear;
int orde... | ALGO | 0.990607 | 5.585583 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.