uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
1011b892-6a84-4d87-8474-5fbff6b19d7d | xzMhehe/codingce-leetcode | codingce-cpp/动态规划/NumWays.cpp | //
// Created by 24607 on 2022/12/8.
//
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int numWays(int n) {
if (n == 0) {
return 1;
}
vector<int> v(n + 1, 0);
v[0] = 1;
v[1] = 1;
for (int i = 2; i < n + 1; i++) {
... | ALGO | 0.999977 | 5.573078 |
24391a5d-6591-48cb-ac32-4fdcbb19b351 | takashigoto1207/atcoder | abc3xx/abc398/abc398_a.cpp | #include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using namespace atcoder;
using ll = long long;
int main() {
int N;
cin >> N;
rep(i, (N - 1) / 2) cout << '-';
if (N % 2 == 1)
cout << "=";
else
cout << "==";
rep(i, (N - 1) / 2) cout... | ALGO | 0.999939 | 4.442947 |
5ff52bce-f9fc-4d73-b1a5-3da61a61b55d | adityaraj0109/Competitive-Programming-DSA | FINAL450/Longest Common Subsequence.cpp | #include <bits/stdc++.h>
using namespace std;
void debugMode()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
//This approach is giving TLE
int solution1(string s1, string s2,vector<vector<int>> &dp, int i, int j){
if(i==s1.size() || j==s2.size()) ret... | ALGO | 0.999994 | 5.598788 |
e12da505-52df-4848-ab19-abd7a8404647 | Abdul-Wasey2662/fantastic-chainsaw | Hashing.cpp | #include <iostream>
#include <list>
#include<string>
using namespace std;
class HashTable
{
int x;
list<int>* table;
public:
HashTable(int V)
{
int s = prime(V);
this->x = s;
table = new list<int>[x];
}
void insertion(int key, int data)
{
int in = hash(key... | ALGO | 0.999628 | 4.375172 |
047f1655-3e6e-49ef-b25e-688f42a25ed4 | Vikaskumar0112/cppdsa | c4_jan_8.cpp | #include <iostream>
using namespace std;
int arr[100];
int main()
{
cout<<"Enter the size of array: (max 9) ";
int n;
cin>>n;
for(int i =0; i<n; i++)
{
cin>>arr[i];
}
cout<<"Orignal Array: "<<endl;
for(int i=0; i<n; i++) cout<<arr[i]<<" ";
int x;
cout<<"Enter new data: ";
cin>>x;
for(int i=n; i>=0... | ALGO | 0.998782 | 3.499536 |
0e84e250-d695-4f01-986b-2603e675ccfd | PhillipDiCarlo/The-Corruptor | ASRC Systems Simulation Driver/boost_1_74_0/libs/numeric/ublas/doc/samples/vector_binary_scalar.cpp | #include <boost/numeric/ublas/vector.hpp>
#include <boost/numeric/ublas/io.hpp>
int main () {
using namespace boost::numeric::ublas;
vector<double> v (3);
for (unsigned i = 0; i < v.size (); ++ i)
v (i) = i;
std::cout << 2.0 * v << std::endl;
std::cout << v * 2.0 << std::endl;
}
| ALGO | 0.939757 | 3.24158 |
f4691311-7abd-46ed-9f43-480e0fc6a5b9 | Hangeulkim/Algorithm | 1022.cpp | #include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
vector<int> calc;
int cnt=0;
int digit(int num){
int d=0;
while(num>0){
d++;
num/=10;
}
return d;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int r1,c... | ALGO | 0.999081 | 3.029966 |
e5828fa9-d61f-4756-b8b0-4f317f8f8092 | Jevan-National-University-of-Singapore/CS2040C_Data_Structures_and_Algorithms_C- | Alfred/CS2040C Data Structures and Algorithms/CS2040C Data Structures and Algorithms/Problem Set Assignments/PS3/B_DoctorKattis_pq_unorderedset.cpp | #include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <queue>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
vector<priority_queue<int>> clinic(101); // create array of priority queues, size 101 to hold different infe... | ALGO | 0.999504 | 4.75231 |
c537db7d-48d0-499b-a8f0-639e2cb881d6 | RajaKunalPandit1/Leetcode_Questions | 41. First Missing Positive.cpp | Output Status :
Runtime
67 ms
Beats
88.24%
Memory
41.1 MB
Beats
92.58%
// Naive Sol :: Time : O(N) :: Aux_Space : O(N)
class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
int n = nums.size();
unordered_map<int,int> mp;
for(int i=0;i<n;i++){
mp[nu... | ALGO | 0.999919 | 5.198327 |
26778072-b71c-43a9-a482-dac0bccbccd0 | ritikdhasmana/6company30daysChallenge | Day11-15/GenerateBinaryNumbers.cpp | //link - https://practice.geeksforgeeks.org/problems/generate-binary-numbers-1587115620/1/#
/*
question -
Given a number N. The task is to generate and print all binary numbers with decimal values from 1 to N.
*/
// { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//Function... | ALGO | 0.999892 | 6.325307 |
cbb0f910-821f-4a3f-add4-ebae83acbd83 | Exr0nProjects/learn_cpp | problems/contests/standard-xjoi/1543/x_1_union-find/x_main_1_union-find.cpp | /*
* Problem 1_union-find (contests/standard-xjoi/1543/1_union-find)
* Create time: Sat 01 Aug 2020 @ 15:04 (PDT)
* Accept time: Sat 01 Aug 2020 @ 15:07 (PDT)
*
*/
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <vector>
#include <string>
#include <list>
#in... | ALGO | 0.999977 | 4.262265 |
01ac9b68-83df-42c2-9de1-2d2028769c29 | soumilk/Secrets_of_Cpp | Data Structure Implementation/Link List/02.concatenate_two_list.cpp | //
// Created by soumil on 3/27/2020.
// LINEAR SINGLY LINKED LIST in C++ - CONCATENATE TWO LIST
/*
* This is the implementation doe for the singly linear linked list.
* Code performs some basic operations like:
1. Insertion
2. Deletion
3. Display
4. Find Length
5. Concatenate ... | ALGO | 0.998533 | 4.866774 |
c476e451-0cd5-416a-8805-c9228feb8d6f | ZikXewen/Submissions | laptop/thailandoi/oct22_order_fix.cpp | #include<cstdio>
#include<algorithm>
#include<map>
#define ii pair<int,int>
#define MXN 1005
using namespace std;
int N,post[MXN],pre[MXN];
map<int,pair<int,int>> m;
void rec(int *s1,int *e1,int *s2,int *e2){//printf("%d %d %d %d\n",*s1,*e1,*s2,*e2);
if(e1-s1<=1) return;
if(*(s1+1)==*(s2+1)){
m[*s1]={*(s1+1),0}; re... | ALGO | 0.99999 | 3.442878 |
54429d6a-f1e7-4c81-8edc-a98342acb3f1 | kingkk31/BOJ | source code/1527_금민수의 개수.cpp | #include <iostream>
#include <set>
#include <math.h>
using namespace std;
set<long long> data;
void makeNum(int n, long long sum)
{
if (n == 0){
data.insert(sum);
return;
}
makeNum(n - 1, sum * 10 + 4);
makeNum(n - 1, sum * 10 + 7);
}
int main()
{
int n,m;
cin >> n >> m;
for (int i = 1; i <= 10;i++)
... | ALGO | 0.999823 | 3.578225 |
98549395-73a7-4a5e-8770-1af082b4f9f9 | sumit8692/Leetcode-solutions | 747-largest-number-at-least-twice-of-others/747-largest-number-at-least-twice-of-others.cpp | class Solution {
public:
int dominantIndex(vector<int>& nums) {
int max = INT_MIN;
int store_ind = -1;
for(int i = 0; i < nums.size(); i++) if(nums[i] > max){ max = nums[i]; store_ind = i;}
for(int i = 0; i < nums.size(); i++)
if(i!=store_ind) if(2*nums[i... | ALGO | 0.999981 | 5.861201 |
d50a0c79-7233-4d2b-a6db-8e93a71509be | NothingIsAll/wukong-androidndk | glabc/src/main/cpp/FreeImage/Source/OpenEXR/IlmImf/ImfB44Compressor.cpp | //-----------------------------------------------------------------------------
//
// class B44Compressor
//
// This compressor is lossy for HALF channels; the compression rate
// is fixed at 32/14 (approximately 2.28). FLOAT and UINT channels
// are not compressed; their data are preserved exactly.
//
// Each HALF ch... | TOOL | 0.863177 | 4.645477 |
bc73892d-73b8-43a3-a666-eb716f858caf | moonpiee/codepy | filesimp2.cpp | #include<iostream>
#include<fstream>
#include<vector>
#include<sstream>
#include<bits/stdc++.h>
using namespace std;
int main(){
ifstream opoffile("inp.txt");
string text;
vector<vector<string>> finalout;
//>> extracts from streamfile, << inputs to streamfile
//getline() or opofile>... | DATA | 0.923829 | 3.456172 |
6881dc69-8b9f-4d3a-9aae-d2f36a3ab343 | modricwang/ctrlaltdel-aosp-ime | app/src/main/cpp/jni/src/suggest/core/dictionary/dictionary_utils.cpp | #include "suggest/core/dictionary/dictionary_utils.h"
#include "dictionary/interface/dictionary_structure_with_buffer_policy.h"
#include "dictionary/property/ngram_context.h"
#include "suggest/core/dicnode/dic_node.h"
#include "suggest/core/dicnode/dic_node_priority_queue.h"
#include "suggest/core/dicnode/dic_node_vec... | ALGO | 0.994473 | 7.557642 |
ba683a8f-922a-4ffe-b520-07466534e2cc | CarloNicolini/paco | src/eigen/bench/spbench/sp_solver.cpp | // Small bench routine for Eigen available in Eigen
// (C) Desire NUENTSA WAKAM, INRIA
#include <iostream>
#include <fstream>
#include <iomanip>
#include <Eigen/Jacobi>
#include <Eigen/Householder>
#include <Eigen/IterativeLinearSolvers>
#include <Eigen/LU>
#include <unsupported/Eigen/SparseExtra>
//#include <Eigen/Sp... | ALGO | 0.994845 | 4.29849 |
f0d44073-928f-495f-a2e4-c5c61a515134 | devmourya44/DSA-Practice | Basic/Count numbers containing 4/count-numbers-containing-4.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
int check4(int num)
{
int x;
while(num>0)
{
x=num%10;
if(x==4)
{
return 1;
}
num=num/10;
}
return 0;
... | ALGO | 0.999563 | 6.082285 |
e7a4a8f5-54de-44a2-b93e-276b15c0d110 | ishandutta2007/codeforces | endagorion/normal/1305/G.cpp | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define... | ALGO | 0.999929 | 3.49378 |
18551c46-dc73-4e03-9a0e-7429691fe071 | ishandutta2007/codeforces | pb0207/normal/963/C.cpp | #include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
#include<cmath>
using namespace std;
typedef long long ll;
const int N=2e5+1e3+7;
int n;
map<ll,ll>c1,c2;
ll w[N],h[N],c[N],g;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%lld%lld%lld",&w[i],&h[i],&c[i]),g=_... | ALGO | 0.999953 | 3.6407 |
bc84d41f-c11b-49d9-9fac-71ce78569558 | kavita121/Coding | TRICOIN_Codechef.cpp | //Coins And Triangle Problem Code: TRICOIN
//CODEFORCES
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t, i, n;
cin>>t;
while(t--)
{
cin>>n;
int height = 0;
i = 1;
while( ((i+1)*i/2) <= n)
{
i++;
height++;
}
... | ALGO | 0.999906 | 4.875191 |
2d7a528b-51b3-4f03-a03d-a5c8515baf6d | TakebeUmi/fluid-engine-dev | src/tests/time_perf_tests/parallel_tests.cpp | #include <jet/parallel.h>
#include <benchmark/benchmark.h>
#include <random>
class Parallel : public ::benchmark::Fixture {
public:
std::vector<double> a, b, c;
size_t n = 0;
unsigned int numThreads = 1;
std::mt19937 rng{0};
std::uniform_real_distribution<> d{0.0, 1.0};
void SetUp(const ::... | TEST | 0.941496 | 6.330607 |
4c963499-879b-41c6-85ab-e20e70a1385c | Nicu-Ducal/Competitive-Programming | C++/InfoArena/Arhiva probleme/Random/random.cpp | #include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
typedef unsigned long long ul;
typedef long long ll;
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
ifstream cin("random.in");
ofstream cout("random.out");
int n;
cin >> n;
s... | ALGO | 0.999689 | 4.003723 |
43174e84-1ad2-4528-ad2c-b2b82ccdea16 | seungeunn/coding_test | programmers/Lv.0/7의개수.cpp | /*
문제 설명
머쓱이는 행운의 숫자 7을 가장 좋아합니다. 정수 배열 array가 매개변수로 주어질 때, 7이 총 몇 개 있는지 return 하도록 solution 함수를 완성해보세요.
*/
#include <string>
#include <vector>
using namespace std;
int solution(vector<int> array) {
int answer = 0;
for(int i=0; i<array.size(); i++){
int a=array[i];
while(a>0){
... | ALGO | 0.99773 | 5.476231 |
1c183f56-d5db-4baf-8134-a20d1dcc11ea | Siddhant-Sr/LeetCode | 39-combination-sum/39-combination-sum.cpp | class Solution {
public:
void findCombination(int ind, int target, vector<int> &arr, vector<vector<int>> &ans, vector<int>&ds) {
if(ind == arr.size()) {
if(target == 0) {
ans.push_back(ds);
}
return;
}
// pick up the element
if(ar... | ALGO | 0.999961 | 6.462856 |
4997b412-cd3a-4e43-aa2d-54de9bd6e9ef | ishandutta2007/codeforces | wasa855/normal/1348/F.cpp | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define fir first
#define s... | ALGO | 0.999998 | 3.483254 |
148c9879-7620-49d1-baf8-a496243f94dd | hi-takeda/test | fork/main.cpp | #include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
int main() {
int number=0;
pid_t pid=fork();
if(pid==0) {
//子プロセス側
sleep(5);
number=10;
printf("child:%d\n", number);
exit(0);
} else {
//親プロセス側
printf("parent:%d\n", number);
... | TOOL | 0.910925 | 3.611757 |
7a29748d-a078-4ae3-aed2-2f79c52e0d50 | sanesedu/CompetitiveProgramming | codeforces/A/1080a/main.cpp |
#include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fori(i, n) for(int i = 0; i < (int)(n); ++i)
#define forid(i, n) for(int i = (int)(n) - 1; i >= 0; --i)
#define forl(i, n) for(long long i = 0; i < (long long)(n); ++i)
#define forld(i, n) for(long long i = (long long)(n) - 1;... | ALGO | 0.999567 | 3.007626 |
9602671b-8492-4f88-a58f-eb3e1e2fb969 | RBardhana/Github-Task-Sesi-5 | soal_no_3.cpp | #include <iostream>
using namespace std;
int main()
{
int i, j;
int n = 3;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= i; j++)
{
cout << "* ";
}
cout << "\n";
}
return 0;
} | ALGO | 0.999884 | 3.932861 |
4bdf67ac-3c82-49fd-bd5d-7ad758f3c5d8 | Icay12/LeetCode | Cpp/43_MultiplyString.cpp | class Solution {
public:
string multiply(string num1, string num2) {
int len1 = num1.length();
int len2 = num2.length();
int p[12100] = {0};
string result = "";
for(int i = len1 - 1; i >= 0; --i) {
for(int j = len2 - 1; j >= 0; --j) {
int mul = (nu... | ALGO | 0.999916 | 5.928016 |
136ea0bb-7110-4532-99e3-aad52ab5b64d | Garima9654/AlgoOnGraphs | week1_graph_decomposition1/1_finding_exit_from_maze/reachability.cpp | #include <iostream>
#include <vector>
using std::vector;
using std::pair;
int explore(vector<vector<int> > &adj, int x, int y, vector<int> &visited) {
if (x == y) {
return 1;
}
visited[x] = 1;
for(int i = 0; i < adj[x].size(); i++) {
if (!visited[adj[x][i]]) {
if(explore(adj, adj[x][i], y, visited)) {
... | ALGO | 0.999967 | 4.597142 |
1e4db46c-796f-469e-84bb-10fa8eec1e50 | RevealMind/itmo | discrete_math/term_3/lab_3/d.cpp | #include <iostream>
#include <vector>
#include <cstdio>
using std::vector;
vector<int> s;
int n, m;
bool check1, check3;
vector<bool> check2;
void check_pos_bit(int mask, vector<bool> &mas, bool state) {
for (int i = 0; i < n; ++i) {
if ((mask & (1 << i)) != 0)
mas[i] = state;
}
}
void i... | ALGO | 0.999944 | 4.132464 |
705199ac-55f0-45f2-ab80-93de46470e3c | pedrofaria09/CPAR | TP2/Sieve/seq_openmp.cpp | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <ctime>
#include <omp.h>
#include <fstream>
using namespace std;
long long numberOfPrimes(vector<bool> values){
long long count = 0;
for(long long i = 0; i < values.size(); i++){
if (values[i])
count++;
... | TOOL | 0.880925 | 3.940348 |
a9ae6a56-016d-4250-86ba-b59abdd2e105 | GarrettCrippen/leetcode | medium/numIslands.cpp | class Solution
{
private:
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, -1, 1};
public:
// let's use some sort of flood fill algorithm (BFS)
int numIslands(vector<vector<char>> &grid)
{
// visited array
vector<vector<bool>> visited(grid.size(), vector<bool>(grid[0].size(), false));
... | ALGO | 0.99989 | 6.496035 |
1908a7bd-a477-42f3-94f3-b80e90bf8cbd | youlive789/AlgorithmStudy | BackJoon/math1/10250.cpp | #include <iostream>
#include <iomanip>
using namespace std;
int main() {
// H: 층수, W: 방수, N: N번째 손님
// 6 12 10 - 402
// 30 50 72 - 1203
int cases;
cin >> cases;
while (cases--) {
int cntFloor, cntRoom, customer;
cin >> cntFloor >> cntRoom >> customer;
int floor = cus... | ALGO | 0.997725 | 3.642805 |
c662a3b8-25be-4ef6-8979-a0c788691190 | davetcoleman/ompl-release | demos/RigidBodyPlanning.cpp | /* Author: Ioan Sucan */
#include <ompl/base/SpaceInformation.h>
#include <ompl/base/spaces/SE3StateSpace.h>
#include <ompl/geometric/planners/rrt/RRTConnect.h>
#include <ompl/geometric/SimpleSetup.h>
#include <ompl/config.h>
#include <iostream>
namespace ob = ompl::base;
namespace og = ompl::geometric;
bool isStat... | TOOL | 0.959895 | 4.33704 |
e4de2ee2-86e6-4252-be64-c9b36738af60 | Junaid7200/University-Labs | Data Structures/Stacks/.history/LabEvalPractice_20240418221220.cpp | #include <iostream>
using namespace std;
class Node {
public:
int data;
Node* next;
Node(int data) {
this -> data = data;
this -> next = NULL;
}
void setData(int data) { this -> data = data; }
void setNext(Node* node) { this -> next = node; }
int getData() { return this -> data; }
Node... | ALGO | 0.996736 | 4.538329 |
76c20fa8-7b34-4b7f-b710-cb5ab2096603 | SoyOscarRH/Wallbreakers | Week5/513-FindBottomLeftTreeValue.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void findBottomLeftValue(TreeNode* root, int& maxDepth, int& leftVal, int depth) {
if (n... | ALGO | 0.999989 | 6.332141 |
06e7005c-fb88-45ed-9b1c-b68af3ac9cc2 | tayu0110/atcoder | abc/abc237g.cpp | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <map>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <casse... | ALGO | 0.999873 | 4.18167 |
18ff325f-22c6-48cd-81a2-4ff92f865e81 | huyleaiengineer/Data-Structure-and-Algorithm | chapter_2_Searching_sorting/0.createArr.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
srand(time(nullptr));
for (int i = 6; i <= 6; ++i)
{
ofstream f("array"+to_string(i)+".txt");
cout << "n = "; cin >> n;
f << n << '\n';
for (int j = 1; j <= n; ++j)
f << rand()%(2*n)-n << ' ';... | TOOL | 0.927145 | 3.079321 |
648ec69f-8b7a-412c-af8f-38abb1d39e80 | abhikumr7248/CodeInCpp | A_In_Search_of_an_Easy_Problem.cpp | #include <iostream>
#include <vector>
#include <string>
#include <cstdio>
#include <algorithm>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll signed long long
#define ld long double
/*---------------------------------------------------------... | ALGO | 0.999717 | 3.5162 |
79c96d9a-4ec4-4b0b-a873-02a4dc6f7da9 | sangcheol12/boj_solve | Greedy/boj28062.cpp | #include <bits/stdc++.h>
using namespace std;
int candy[1001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, sum=0, less=1001, hol_n=0; cin >> n;
for(int i=0; i<n; i++) {
cin >> candy[i];
sum += candy[i];
if(candy[i]%2) {
hol_n... | ALGO | 0.999961 | 4.38514 |
45161fa4-cfc0-48e2-a231-ffd5af3f8a31 | mohamedayman2030/mohamedayman2030-CppND-Route-Planning-Project | CppND-Route-Planning-Project/src/route_planner.cpp | #include "route_planner.h"
#include <algorithm>
RoutePlanner::RoutePlanner(RouteModel &model, float start_x, float start_y, float end_x, float end_y): m_Model(model) {
// Convert inputs to percentage:
start_x *= 0.01;
start_y *= 0.01;
end_x *= 0.01;
end_y *= 0.01;
// TODO 2: Use the m_Model.Fi... | ALGO | 0.994814 | 4.279201 |
add8125f-8714-4cf4-89c1-29b74e7c401b | SaruarChy/CodeChef-Solution | CORUS - Isolation Centers.cpp | //Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int t,n,q,c,ans;
cin>>t;
while(t--)
{
cin>>n>>q;
string s;
cin>>s;
map<char,int>mp;
map<char,int>visit;
for(int i=0; i<s.length(); i++){
mp[s[i]]... | ALGO | 0.999207 | 3.500125 |
dd784b38-8015-40dc-8e8f-e4f6f9e17ddb | ishandutta2007/codeforces | potassium/normal/1451/F.cpp | #pragma GCC optimize ("O3", "unroll-loops")
//#pragma GCC target ("avx2")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(x) (x... | ALGO | 0.999921 | 3.652631 |
23707883-31cb-46cb-a46e-092fa8ea43e4 | Apress/beg-cpp | 9781484200087_Source_Code/Chapter 6 code/Chapter 6/Ex6_04.cpp | // Ex6_04.cpp
// Calculating primes using pointer notation
#include <iostream>
#include <iomanip>
int main()
{
const size_t max{ 100 }; // Number of primes required
long primes[max] { 2L, 3L, 5L }; // First three primes defined
size_t count{ 3 }; ... | ALGO | 0.998352 | 5.105067 |
ee022129-6072-4356-8cb1-df6ae55ca640 | 7weetKing/TASKS | MOD_22/Exersice_3/Exersice_3.cpp | #include <iostream>
#include <map>
#include <string>
bool Anograms(std::string& str1,std::string& str2)
{
std::map<char, int> count;
for (std::string::iterator it = str1.begin(); it != str1.end(); ++it)
{
char ch = *it;
count[ch]++;
}
for (std::string::iterator it = str2.begin(); it != str2.end(); ++it)
{
... | ALGO | 0.999903 | 4.852379 |
412e12a5-b312-42da-ac4f-28b38b45a5d2 | chdb-io/chdb | src/Compression/CompressionCodecEncrypted.cpp | #include <string_view>
#include <base/MemorySanitizer.h>
#include <Compression/CompressionCodecEncrypted.h>
#include <Compression/CompressionFactory.h>
#include <IO/VarInt.h>
#include <Parsers/IAST.h>
#include <base/types.h>
#include <Common/Exception.h>
#include <Common/OpenSSLHelpers.h>
#include <Common/logger_useful... | TOOL | 0.858021 | 5.731051 |
0b63e115-969b-4e12-9ddc-138796d06367 | happyZYM/OI-source | history_source/挑战程序设计竞赛/2.3.2.1.cpp | #include<cstdio>
int n,w[105],v[105],W;
int dp[10005];
inline int max(int a,int b){return a>b?a:b;}
void solve()
{
int i,j;
for(i=0;i<n;i++)
for(j=w[i];j<=W;j++)
dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
printf("%d\n",dp[W]);
}
void init()
{
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%d%d",w+i,v+i);
scanf("%d",&W);... | ALGO | 0.999948 | 3.920785 |
4f497c5e-e3f1-461e-8392-1d2be69adda6 | wenliangsun/LeetCode | 剑指offer/1到n中整数中1出现的次数.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int findNthDigit(int n) {
}
}; | ALGO | 0.999632 | 5.74233 |
43dc32ab-1a2c-4c1b-b33c-a8e7e99ef7bb | abishekshyamsunder/LeetCode | Surrounded_Regions.cpp | class Solution {
public:
vector<vector<int>> color;
vector<vector<char>> gboard;
int m,n;
void dfs_visit(int i, int j)
{
color[i][j] = 1;
if(i!=0 && gboard[i-1][j]=='O' && color[i-1][j]==0)
{
dfs_visit(i-1,j);
}
if(i!=m-1 && gboard[i+1][j]=='O'... | ALGO | 0.999915 | 5.97192 |
e4ffe210-908d-4827-aceb-2b3c49d6bb28 | Eagle233Fake/Eagle233-Algorithms | ProgrammerCarl/20250224-/BinaryTree/107.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999969 | 6.602849 |
533ee2b7-b387-45a1-8f57-a121bf57c111 | felipesdias/Extractor-URI-Online-Judge | URI-EN/BEGINNER/2544 - Kage Bunshin no Jutsu.cpp | // Author: Felipe Souza Dias <<EMAIL>>
// Name: Kage Bunshin no Jutsu
// Level: 1
// Category: BEGINNER
// URL: https://www.urionlinejudge.com.br/judge/en/problems/view/2544
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while(cin >> n)
cout << __builtin_ctz(n) << "\n";
return 0... | ALGO | 0.999398 | 4.742232 |
551cfa94-7959-417f-bf11-849d74daadc2 | hs-krispy/BOJ | Break egg against an egg.cpp | //
// Created by 0864h on 2020-01-28.
//
#include<iostream>
#include<vector>
using namespace std;
int n, Max = 0;
vector<pair<int, int>> v;
bool check[8][8];
void break_egg(int idx, int count)
{
if(idx == n)
{
if(Max < count)
Max = count;
return;
}
if(v[idx].first <= 0)
... | ALGO | 0.999972 | 3.808677 |
26f96ace-10c5-45d7-92df-3e045e571897 | h33p/libmv | src/third_party/OpenExif/src/OpenExifJpeg/OpenExif_jidctflt.cpp | #define OE_JPEG_INTERNALS
#include "OpenExif_jinclude.h"
#include "OpenExifJpegLib.h"
#include "OpenExif_jdct.h" /* Private declarations for DCT subsystem */
#ifdef DCT_FLOAT_SUPPORTED
/*
* This module is specialized to the case DCTSIZE = 8.
*/
#if DCTSIZE != 8
Sorry, this code only copes with 8x8 DCTs. /* deli... | ALGO | 0.998837 | 5.990018 |
64b57c3e-5a81-47a5-943d-fc6d796daf79 | GS-Bishwasa/DSA-JOURNY | DSA In C++/DSA Lecture 33/Sum_of_Array_Using_Recursion.cpp | #include<iostream>
using namespace std;
int getSum(int *arr, int size) {
//base case
if(size == 0) {
return 0;
}
if(size == 1 )
{
return arr[0];
}
int remainingPart = getSum(arr+1, size-1);
int sum = arr[0] + remainingPart;
return sum;
}
int main() {
int arr[... | ALGO | 0.999916 | 5.331964 |
be8a483b-03a7-4964-be59-7bb941fd7a2c | millaker/MiGPU-llvm-project | libc/src/math/generic/f16subl.cpp | #include "src/math/f16subl.h"
#include "src/__support/FPUtil/generic/add_sub.h"
#include "src/__support/common.h"
#include "src/__support/macros/config.h"
namespace LIBC_NAMESPACE_DECL {
LLVM_LIBC_FUNCTION(float16, f16subl, (long double x, long double y)) {
return fputil::generic::sub<float16>(x, y);
}
} // namesp... | ALGO | 0.973489 | 6.195601 |
b99ae48b-f1ec-498f-aede-ed8684ee3a17 | EazyReal/CompetitveProgramming | before2024/20200403-cf-631/E.cpp | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define rep(i, st, n) for (int i = (st); i < (n); ++i)
#define repinv(i, st, n) for (int i = ((n)-1); i >= (st); --i)
#define MEM(a, b) memset(a, b, s... | ALGO | 0.999844 | 3.871798 |
b20ab6a0-2d6c-4524-97c5-05a2a835e1f5 | prakhal-gupta/leetcode | 2370-longest-ideal-subsequence/2370-longest-ideal-subsequence.cpp | class Solution {
public:
int longestIdealString(string s, int k) {
int N = size(s);
vector<vector<int>> dp(N, vector<int>(26, -1));
int res = 0;
for (int c = 0; c < 26; c++) {
res = max(res, dfs(N - 1, c, dp, s, k));
}
return res;
}
int dfs(int i,... | ALGO | 0.999947 | 6.184541 |
9007405b-5d89-4d0a-ab41-886c73991de9 | afkummer/sbpo2019-fix-and-optimize | src/FixAndOptimize.cpp | #include "FixAndOptimize.h"
#include "Timer.h"
#include <algorithm>
#include <iostream>
using namespace std;
FixAndOptimize::FixAndOptimize(MipModel& model): m_inst(model.instance()), m_model(model) {
// Empty
}
FixAndOptimize::~FixAndOptimize() {
// Empty
}
void FixAndOptimize::solve(const int seed, const i... | ALGO | 0.999474 | 7.012662 |
858f2f7d-9789-400f-9d39-c520ef23b10c | jianningzhuang/CS2040C-Data_Structures_and_Algorithms | PS1/basic_programming_2.cpp | #include <bits/stdc++.h>
using namespace std;
void print_map(map<int,int> &m){
for (auto i = m.begin(); i != m.end(); i++){
cout << i->first << ": " << i->second << "\n";
}
cout << endl;
}
void test_1(vector<int> &v, int target){
int l = 0;
int r = v.size() - 1;
while (l < r){
if (v[l] + v[r] == t... | ALGO | 0.999735 | 4.501662 |
a3cb44eb-1288-4ff5-9abb-536e4937c7b1 | mohitmallick17/LeetCodeSolutions | Geek in a Maze - GFG/geek-in-a-maze.cpp | // { Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
int numberOfCells(int m, int n, int r, int c, int u, int d, vector<vector<char>> &mat){
if(mat[r][c] == '#')return 0;
queue<vector<int>> q;
q.push({r, c, 0,... | ALGO | 0.998751 | 5.963451 |
ac53c060-b023-4af6-b2ed-b3b1adf1e011 | MDRobiulhassan/Data-Structure-Algorithms | Recursion/Combo/palindromepartition.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
void substring(int i, string &s, vector<vector<string> > &ans,
vector<string> &temp)
{
if (i == s.size())
{
ans.push_back(temp);
return;
}
for (int j = i; j < s.size... | ALGO | 0.999959 | 5.669572 |
09504c60-cca0-4e50-96dd-41a4c697bab9 | aditya301cs/My_Daily_Practice_DSA | 0073-set-matrix-zeroes/0073-set-matrix-zeroes.cpp | class Solution {
public:
void setZeroes(vector<vector<int>>& matrix) {
int m = matrix.size(); // Number of rows
int n = matrix[0].size(); // Number of columns
bool shouldFillFirstRow = false, shouldFillFirstCol = false;
// Step 1: Check if the first row should be filled with zero... | ALGO | 0.999104 | 7.449298 |
1da53d93-2337-4228-91cb-657f66476065 | NickWeber3/interviewPreparation | Linked Lists/kthToLast.cpp | /***
Problem:
Find the kth to last element of a singly linked list.
***/
// Approach 1: Have one pointer iterate list until the end, keeping track of length.
// Then have another pointer start at the beginning of the list, and
// iterate length-k times to get to kth to last node.
// O(n) time, O(1) ... | ALGO | 0.999043 | 5.564133 |
5d23e59e-30a9-4f1e-88f3-fe112ffe4b6e | harshthakur3/Codeforces-Solution | B_Subsequence_Update.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
int n, l, r;
cin >> n >> l >> r;
vector<int> a(n), b(r), c(n - l + 1);
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < r; i++){
b[i] = a... | ALGO | 0.9998 | 3.614328 |
18af49d3-77f0-47e4-858d-36e22ae8c58e | conan1005/DSA-Questions | Leetcode/11-strings/easy/1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.cpp | /*******************************************************************
*******************************************************************/
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
class Solution {
public:
int isPrefixOfWord(string sentence, string searchWord) {
int wordIdx ... | ALGO | 0.999849 | 4.805478 |
55494154-295a-457d-94ee-2cebaa1e09f8 | DevGrishin/Cpp-code-examples | Sorting Algorithms/quicksort/quicksort.cpp | #include <iostream>
#include <ctime>
#include <vector>
#include <string>
#include <array>
#include <fstream>
#include <algorithm>
using namespace std;
void quick_sort(vector<int> &sort, int left, int right) {
if (left >= right) {
return;
}
bool loop = true;
int dif = sort[(left + right) /... | ALGO | 0.999893 | 5.101396 |
9f15828a-c955-48e7-94b6-3ba01b7826b4 | minsa97/lecture_cpp | ch01_basic/33_실습2.cpp | // 33_실습2.cpp
#include <iostream>
using namespace std;
int main(void){
for(int i=2;i<=9;i++){
for(int j=1;j<=9;j++){
cout<<i<<'*'<<j<<'='<<i*j<<'\t';
}
cout<<endl;
}
return 0;
} | ALGO | 0.997803 | 3.473443 |
9741dcbc-20dd-4e03-bcae-40718c40eee2 | ztys1/BTBU_CODE | Sophomore/numberlogic/w2/参考答案/1(2)byZhaoXiaokang.cpp | #include <iostream>
#include <stack>
using namespace std;
int main()
{
stack<int> s;
int query;
cin >> query;
int l = sizeof(query) * 8;
while(l > 0)
{
s.push(query & 1);
query = query >> 1;
l--;
}
while(!s.empty())
{
cout << s.top();
s.pop();
}
cout << endl;
return 0;
}
| ALGO | 0.999528 | 3.865801 |
da4dedea-6583-4eb8-bf37-c96bf5691015 | AALEKH/solutions | 173_leetcode.cpp | /**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class BSTIterator {
public:
TreeNode* node;
BSTIterator(TreeNode *root) {
node = root;
}
/** @return w... | ALGO | 0.999987 | 6.033185 |
f67348eb-9df0-4e18-b4c7-86874947278c | Shimanto-125/XPSC_Shimanto | Week_15/Day-04/D_Super_Permutation.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
void solve()
{
int n;
cin>>n;
if(n==1)
{
cout<<1<<endl;
return;
}
if(n%2==1)
{
cout<<-1<<endl;
return;
}
int j=1;
for(int i=n;i>0;i--)
{
if(i%2==1)
... | ALGO | 0.999825 | 5.200834 |
1f2f5877-ee38-4d35-bd15-07edc243163d | piash76/UVA | uva12468.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int i,j,a,b,x,y,r;
while(1)
{
cin>>a>>b;
if(a==-1 && b==-1)
{
break;
}
x=abs(a-b);
y=100-b+a;
r=min(x,y);
cout<<r<<endl;
}
return 0;
}
| ALGO | 0.999598 | 3.43949 |
99a2515c-24f0-4acc-a376-4d976676b9e9 | Jimitpatel1729/LeetCodeSolutions | intersection-of-two-linked-lists/intersection-of-two-linked-lists.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
if(headA == NULL || headB == NULL) return NULL;
... | ALGO | 0.999733 | 5.07998 |
f702bbeb-ca4d-49ad-ae8d-050bac7fe1ac | hookflash/obsolete.opbb10 | hookflash-libs/boost/libs/xpressive/tools/perl2xpr.cpp | #include <stack>
#include <string>
#include <iostream>
#include <boost/xpressive/xpressive_static.hpp>
#include <boost/xpressive/regex_actions.hpp>
namespace x = boost::xpressive;
using namespace x;
int main(int argc, char *argv[])
{
int i = 1, j = 1;
bool nocase = false;
char const *dot = " ~_n ";
ch... | TOOL | 0.982948 | 5.017993 |
93fa2e56-5e98-4a85-a201-f398d3761fe1 | duschnyk/Lesson57RevisionSolution | Task04/logic.cpp | // [The Tribonacci Number]
// Число трибоначчи
//
// Необходимо разработать рекурсивную функцию, которая находит
// число трибоначчи по его порядковому номеру (index).
//
// Числа трибоначчи – бесконечная последовательность целых чисел { tn },
// заданного с помощью рекуррентного соотношения:
// t1 = 0, t2 = 0, t3 ... | ALGO | 0.999898 | 5.928409 |
e715c938-e55c-4528-8d64-b7a2b3ddd6ac | ishandutta2007/codeforces | pashka/normal/1343/D.cpp | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
void solve_test() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<int> p(2 * k + 2);
for (int i = 0; i < n / 2; i++) {
int x = a[i];
int y ... | ALGO | 0.999594 | 4.469121 |
08cd5b8d-ecc2-4305-9424-0e573a68e7cd | LorenFiorini/42_CPP_Modules | module_09/ex01/sources/RPN.cpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* RPN.cpp :+: :+: :+: ... | ALGO | 0.871796 | 4.905234 |
22afe593-28bb-4f43-af5f-74d999a249bf | sjzez-chess/source | model/modell/Dijkstra 堆.cpp | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
const int N = 510;
int n, m;
int w[N];
int h[N], e[N], ne[N], idx;
int dist[N];
bool st[N];
void add(int a, int b, int c)
{
e[idx] = b;
w[idx] = c;
ne[idx] = h[a];
h[a] = idx ++ ;
}
int dijkstra()
{
memset(dist, 0x3f, si... | ALGO | 0.999918 | 4.470618 |
e06ab9e6-425b-4e7e-9aa9-1edf39896532 | Geo50/Image-Gallery-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.998756 | 6.772262 |
a5ad5164-7d6b-4de3-942a-92353165f218 | wokissyou99/RedHeartGame | 红桃/红桃/红桃.cpp |
//ԿҪлַ
#include <stdlib.h>
#include <stdio.h>
#include<graphics.h> //ͼͷļͼҪ
#include<conio.h> //ڿ̨ļ
#include <math.h>
#include <windows.h>
#include <time.h>
#include "function.h"
#include "numrain.h"
#include "mmsystem.h"
#include "rain.h"
#pragma comment(lib,"Winmm.lib")... | TOOL | 0.956628 | 3.105864 |
a7618875-9250-43cf-960d-e8358c88599c | ishandutta2007/codeforces | shun_pi/normal/1530/A.cpp | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, e... | ALGO | 0.999892 | 6.302697 |
7d0b3270-7bc3-4a24-9607-dc31d6a06ff3 | shubhamkapoor01/LeetCode | Distance from the Source (Bellman-Ford Algorithm) - GFG/distance-from-the-source-bellman-ford-algorithm.cpp | // { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function Template for C++
class Solution{
public:
/* Function to implement Dijkstra
* adj: vector of vectors which represents the graph
* S: source vertex to start traversing graph with
* V: number ... | ALGO | 0.999948 | 4.620243 |
912dd339-2a4f-4ba1-b484-4ddf04dff652 | siwakasen/tubes_pbp | 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 |
8c0f26c5-810f-49c4-932b-015659077eb2 | mustakimur/CFI-LB | llvm-project/libcxx/test/std/containers/associative/multiset/find.pass.cpp | // <set>
// class multiset
// iterator find(const key_type& k);
// const_iterator find(const key_type& k) const;
#include <set>
#include <cassert>
#include "test_macros.h"
#include "min_allocator.h"
#include "private_constructor.hpp"
int main(int, char**)
{
{
typedef int V;
typedef std::m... | TEST | 0.950865 | 4.876418 |
f6eaa70d-637a-45a4-af57-5e11629820f5 | Vatala-Phalgun/DSA_Lab | DSA Lab/Sorting/insertion_sort.cpp | #include <iostream>
using namespace std;
int main()
{
int n;
cout << "Enter the no of elements : ";
cin >> n;
int a[n];
cout << "Enter the elements ======\n";
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int k = 1; k < n; k++)
{
int temp = a[k];
int ... | ALGO | 0.999959 | 4.298131 |
36fad781-a4f0-4044-8814-af54c4f99206 | sanjeev1779/codechef | cirkill_prac.cpp | #include<string.h>
#include<stdio.h>
#include<math.h>
int det( int a1, int a2, int a3, int a4, int a5, int a6, int a7, int a8, int a9)
{
int val;
val= a1*(a5*a9-a6*a8)- a2*(a4*a9-a6*a7)+ a3*(a4*a8-a5*a7);
return val;
}
main()
{
int test_cases,n,i,j,k,m,first,second,third,fourth,val,area;
double an... | ALGO | 0.997822 | 3.80156 |
b46da25f-a2a7-4256-b1db-dbdea197ddee | mrunalsr/CPP_Language_Codes | Leetcode47.cpp | #include<iostream>
using namespace std;
class Solution{
public:
string reversewords(string s)
{
int n = s.length();
int k=0;
string temp[100];
string word= "";
for(int i=n-1;i>=0;i--)
{
if(s[i] == ' ')
{
if(!word.empt... | ALGO | 0.999802 | 4.621285 |
9b2c2d35-cd33-4389-ad62-f1c8cf0c68ad | chandradeepkumar16/LeetCode-Ques | 0100-same-tree/0100-same-tree.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999984 | 6.378657 |
bab41e6f-add3-4030-97af-ae06c37353a6 | BitcoinCash1/Bitcoin-Cash-Node | src/banman.cpp | #include <banman.h>
#include <netaddress.h>
#include <ui_interface.h>
#include <util/system.h>
#include <util/time.h>
BanMan::BanMan(fs::path ban_file, const CChainParams &chainparams,
CClientUIInterface *client_interface, int64_t default_ban_time)
: m_client_interface(client_interface),
m_ba... | TOOL | 0.890111 | 7.319027 |
169290d0-a993-48da-a0f6-3112f575eb49 | Rajesh351/Leetcodeall | 0684-redundant-connection/0684-redundant-connection.cpp | class Solution {
public:
bool bfs(unordered_map<int, vector<int>>& adj, vector<bool>& vis, int source) {
queue<pair<int, int>> pq;
pq.push({source, -1});
vis[source] = true;
while (!pq.empty()) {
auto it = pq.front();
pq.pop();
int node = it.first;
int parent = it.seco... | ALGO | 0.999866 | 6.421803 |
d76a3668-b164-4dfb-bb48-2451ae8b0077 | allem40306/Competitive-Programming | zerojudge/D250~499/zjd439.cpp | #include <bits/stdc++.h>
using namespace std;
const int N=500005;
vector<int>v;
bitset<N>b;
int spof[N]={0,1,2};
void prime(){
v.clear();
b.reset();
for(int i=2;i<N;i++){
if(!b[i]){
spof[i]=i;
v.push_back(i);
for(int j=2;j*i<N;j++){
b[i*j]=1;
... | ALGO | 0.999967 | 4.647459 |
45d6df54-07b7-4a9d-a1b0-cca4a8139563 | ZMoD-R/android_frameworks_av | media/libstagefright/codecs/mp3dec/src/pvmp3_mdct_6.cpp | /*
------------------------------------------------------------------------------
PacketVideo Corp.
MP3 Decoder Library
Filename: mdct_18.cpp
Date: 09/21/2007
------------------------------------------------------------------------------
REVISION HISTORY
Description:
-------------------------------... | ALGO | 0.999206 | 6.154814 |
dbff8852-6283-4d5c-8222-3daf4cef9e8b | Qin-Yuan/autoware_car | autoware_localization/utils/common/kalman_filter/src/kalman_filter.cpp | #include "kalman_filter/kalman_filter.hpp"
KalmanFilter::KalmanFilter() {}
KalmanFilter::KalmanFilter(
const Eigen::MatrixXd & x, const Eigen::MatrixXd & A, const Eigen::MatrixXd & B,
const Eigen::MatrixXd & C, const Eigen::MatrixXd & Q, const Eigen::MatrixXd & R,
const Eigen::MatrixXd & P)
{
init(x, A, B, C, ... | ALGO | 0.96125 | 6.700865 |
f0bb0240-11b4-4126-9772-57f0b11fe153 | Ujala-2110/STRIVER-SDE-SHEET | Serialize_and_deserialize_bt.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Codec {
public:
// Encodes a tree to a single string.
string serialize(TreeNode* root) {
if(!root) re... | ALGO | 0.999668 | 6.16221 |
7a925973-7909-44ad-afee-f397027032fa | dependon/durian-ocr | 3rdparty/opencv-4.5.4/3rdparty/carotene/src/sum.cpp | #include "common.hpp"
#include "vtransform.hpp"
namespace CAROTENE_NS {
bool isSumSupported(u32 channels)
{
return (channels && channels < 5);
}
void sum(const Size2D &_size,
const u8 * srcBase, ptrdiff_t srcStride,
u32 * sumdst, u32 channels)
{
internal::assertSupportedConfiguration(isSum... | TOOL | 0.987975 | 5.974161 |
29ae585a-a486-4d03-b8c7-b840f817da11 | dwhaynes/leetcode-solutions | 168-excel-sheet-column-title/2022-03-13 20.08.50 - Accepted - runtime 0ms - memory 6MB.cpp | class Solution {
public:
string convertToTitle(int columnNumber) {
string ans;
while(columnNumber){
columnNumber--;
char digit = columnNumber %26 + 'A';
ans += digit;
columnNumber/=26;
}
reverse(ans.begin(),ans.end());
return an... | ALGO | 0.999539 | 6.09206 |
1535c03d-e1ee-4343-8673-1d4df8f419ff | lagenar/diffalgo | diff.cpp | #include <iostream>
#include "Archivo.h"
#include "Algoritmos.h"
#include "Diferencial.h"
using namespace std;
int main(int argc, char *argv[])
{
if (argc < 3) {
cout << "uso: " << argv[0] << " <archivo origen> <archivo objetivo>" << endl;
return 0;
}
Archivo origen(argv[1]);
if (!orig... | ALGO | 0.999534 | 3.945065 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.