uuid stringlengths 36 36 | repo_name stringlengths 5 133 | relative_path stringlengths 3 3.76k | content stringlengths 282 4.03M | category stringclasses 6
values | algo_rel_score float32 0.9 1 | quality_score float32 3 8.13 | source_meta dict |
|---|---|---|---|---|---|---|---|
ad45dc25-a918-44be-8382-70be900863c5 | MarekKowalski/LiveScan3D | src/LiveScanClient/marker.cpp | // Copyright (C) 2015 <NAME> (<EMAIL>), <NAME> (<EMAIL>)
// License: MIT Software License See LICENSE.txt for the full license.
// If you use this software in your research, then please use the following citation:
// <NAME>.; <NAME>.; Daniluk, M.: "LiveScan3D: A Fast and Inexpensive 3D Data
// Acquisit... | TOOL | 0.921659 | 4.939222 | {
"github_metadata": {
"branch": "master",
"commit_count": 59,
"repo_created_at": "2015-10-14T13:04:07.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 785,
"forks": 207,
"issues": 35,
"pull_requests": 2
},
"file_meta": {
"content_id": "97a2... |
d4059ae2-8ff8-47f8-bd72-2904fae6883f | mlpack/mlpack | src/mlpack/core/distributions/diagonal_gaussian_distribution.hpp | /**
* @file core/distributions/diagonal_gaussian_distribution.hpp
* @author <NAME>
*
* Implementation of the Gaussian distribution with diagonal covariance.
*
* mlpack is free software; you may redistribute it and/or modify it under the
* terms of the 3-clause BSD license. You should have received a copy of the... | ALGO | 0.907029 | 6.639832 | {
"github_metadata": {
"branch": "master",
"commit_count": 30653,
"repo_created_at": "2014-12-17T18:16:59.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 5396,
"forks": 1663,
"issues": 16,
"pull_requests": 9
},
"file_meta": {
"content_id": "... |
67e84686-5d08-4a2f-b73f-e8f31b686558 | nxp-imx/arm-computelibrary-imx | src/core/NEON/kernels/arm_conv/depthwise/kernels/sve_fp32_nhwc_3x3_s1_output3x3_mla_depthfirst/generic_indirect.cpp | /*
* Copyright (c) 2021, 2023 Arm Limited.
*
* SPDX-License-Identifier: MIT
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* r... | ALGO | 0.980009 | 6.434217 | {
"github_metadata": {
"branch": "lf-6.6.3_1.0.0",
"commit_count": 4341,
"repo_created_at": "2022-08-04T03:20:19.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "... |
b7143cf7-c53a-4c7a-b368-c9ef158d56b5 | curious-keshav/100DaysOfCodePP | 10_sum_of_digits.cpp | class Solution {
public:
int func(int num) {
int sum = 0;
while (num) {
sum += num % 10;
num /= 10;
}
return sum;
}
int func2(string s) {
int num = 0;
for (int i = 0; i < s.size(); i++) {
num += s[i] - '0';
}
... | ALGO | 0.999864 | 5.442985 | {
"github_metadata": {
"branch": "main",
"commit_count": 25,
"repo_created_at": "2024-08-22T07:29:43.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "ec1a98a9b3a... |
1aa94056-6b88-4ef5-8760-c545ebdaccaf | ikr/algo-practice | toki/2024/troc38/C/solution.cpp | #include <atcoder/modint>
#include <bits/stdc++.h>
using namespace std;
using mint = atcoder::modint998244353;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n, m;
cin >> n >> m;
set<int> A;
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
... | ALGO | 0.999978 | 4.244016 | {
"github_metadata": {
"branch": "master",
"commit_count": 5422,
"repo_created_at": "2016-06-23T07:28:44.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 3,
"forks": 2,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "5fe67eb... |
bf090a37-f297-448f-9d38-0306fc04bdac | eozkaynar/EE441-Data-Structures | Programming Assignments/EE441_PA3_2375582_P1/EE441_PA3_2375582_P1/adhoc.cpp | #include "adhoc.h"
#include "queue.hpp"
#include "stack.hpp"
#include <iostream>
#include <algorithm>
using namespace std;
// Helper function to remove node
void removeNodesById(vector<Node>& nodes, int idToRemove)
{
// Check for each node
for (int i = 0 ; i < nodes.size()-1; i++)
{
// If corres... | ALGO | 0.998932 | 3.013657 | {
"github_metadata": {
"branch": "main",
"commit_count": 2,
"repo_created_at": "2024-06-21T11:20:35.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "42319aa2a3ae... |
514e8892-47a6-404d-b9ef-13c187d2e883 | flang-compiler/flang | runtime/libpgmath/lib/common/log10f/fs_log10_scalar_legacy.cpp |
/*
* Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
* See https://llvm.org/LICENSE.txt for license information.
* SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
*
*/
#include <immintrin.h>
#include <common.h>
#if !(defined _CPU)
#error: please define _CPU - specific suffi... | ALGO | 0.956925 | 5.615853 | {
"github_metadata": {
"branch": "master",
"commit_count": 2173,
"repo_created_at": "2017-05-10T19:13:24.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 837,
"forks": 141,
"issues": 262,
"pull_requests": 22
},
"file_meta": {
"content_id": "0... |
a61480eb-9fbe-433a-8077-8d07744598c3 | iliyian/CompetitiveProgramming | vjudge.net/624792/A.cpp | #include <bits/stdc++.h>
#define int long long
using namespace std;
struct Edge {
int v, w, id;
};
struct Ed {
int u, v, w;
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
freopen("A.in", "r", stdin);
freopen("A.out", "W", stdout);
int n, m;
cin >> n >> m;
vector<int> sum(n + 1,... | ALGO | 0.999967 | 3.805707 | {
"github_metadata": {
"branch": "main",
"commit_count": 354,
"repo_created_at": "2024-04-21T10:50:41.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "28d2cef259... |
052800f7-ad3b-4a56-84da-df817659197c | old-yan/CP-template | TEST/local/Dijkstra_naive_test.cpp | #include "GRAPH/Dijkstra_naive.h"
#include "IO/FastIO.h"
#include "TEST/std_bit.h"
void test_distance_sum() {
// 普通使用者只需要了解熟悉 OY::DijkstraNaive::Graph 的使用
cout << "test distance sum:\n";
// 建图
OY::VectorAddDijkstraNaive<int> G(7);
// 注意加的边都是有向边
G.add_edge(0, 1, 100);
G.add_edge(0, 2, 200);... | ALGO | 0.950611 | 4.76034 | {
"github_metadata": {
"branch": "main",
"commit_count": 390,
"repo_created_at": "2021-06-29T16:22:18.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 268,
"forks": 43,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "a474aff... |
f79c8ba0-d3a3-420c-a1dc-3b347dc5446d | akshayaradhya/pipenetwork | src/PipeNetwork.cpp | #include "PipeNetwork.h"
#include "Node.h"
#include "Tube.h"
#include<iostream>
#include<fstream>
#include <string>
#include<vector>
#include<sstream>
#include"linalg.hpp"
#include"linalg_impl.hpp"
#include<vector>
using namespace std;
vector<Node> pipeNodes;
vector<Tube> pipeTubes;
vector<double> Q_vector;
int ... | TOOL | 0.979742 | 3.676717 | {
"github_metadata": {
"branch": "master",
"commit_count": 4,
"repo_created_at": "2019-01-24T09:59:34.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "ed78e08373... |
91d901f4-20c2-4b08-879c-58bb69a2141d | hellocomrade/happycoding | hackerrank/CutTree.cpp | #include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
//https://www.hackerrank.com/challenges/cut-the-tree/problem
/*
Cut the Tree
Anna loves graph theory! She has an n-vertex tree, t, where each vertex u:
- Is indexed with a unique integer from 1 to n.
- Contains a data value, data(u).
A... | ALGO | 0.999971 | 4.627839 | {
"github_metadata": {
"branch": "master",
"commit_count": 1008,
"repo_created_at": "2015-11-28T18:57:08.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 6,
"forks": 6,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "0f8f6f4... |
e1cb7bd9-5a42-4445-a776-958eb5c5608c | anuragji111/cpp-solutions-leetcode-top-150 | construct_binary_tree_from_inorder_and_postorder_traversal.cpp | Statemenet 73) Given two integer arrays inorder and postorder where inorder is the inorder traversal of a binary tree and postorder is the postorder traversal of the same tree, construct and return the binary tree.
Example 1:
Input: inorder = [9,3,15,20,7], postorder = [9,15,7,20,3]
Output: [3,9,20,null,null,15,7... | ALGO | 0.999976 | 6.682749 | {
"github_metadata": {
"branch": "main",
"commit_count": 157,
"repo_created_at": "2024-01-03T13:11:19.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "07a3bacfdf... |
532706da-75a7-4138-85f4-946ca8133437 | yf291115925/CPP-Nanodegree | 5_Concurrency/02_Passing_Data_Between_Threads/02_Promises_and_Future/example_3.cpp | #include <iostream>
#include <thread>
#include <future>
#include <cmath>
void computeSqrt(std::promise<double> &&prms, double input)
{
std::this_thread::sleep_for(std::chrono::milliseconds(2000)); // simulate work
double output = sqrt(input);
prms.set_value(output);
}
int main()
{
// define input data... | TOOL | 0.933904 | 6.456551 | {
"github_metadata": {
"branch": "master",
"commit_count": 1,
"repo_created_at": "2019-07-22T14:31:24.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 46,
"forks": 38,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "2390fa11... |
961e954d-e076-4abe-8c49-9f86e7c5def1 | unibook1283/algorithm | 백준/16439.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int a[30][30];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
vector<int> v;
for (int i = 0; i < m - 3; i++) {
v.push_back(0);
}
for (int i = 0; i < 3; ... | ALGO | 0.999988 | 3.607626 | {
"github_metadata": {
"branch": "main",
"commit_count": 351,
"repo_created_at": "2022-03-20T12:28:12.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "19e78f8425... |
45674efa-9dbf-40a0-872d-5ab0b69b34f2 | mostafa-saad/MyCompetitiveProgramming | Olympiad/COCI/official/2013/contest2_solutions/informacije.cpp | #include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int MAXN = 201;
int left[MAXN], right[MAXN];
int lo[MAXN], hi[MAXN];
int n, m;
int match[MAXN], vis[MAXN];
vector< int > E[MAXN];
int dfs( int x ) {
if ( vis[x] ) return 0;
vis[x] = 1;
for ( int i = 0; i <... | ALGO | 0.999991 | 3.77371 | {
"github_metadata": {
"branch": "master",
"commit_count": 439,
"repo_created_at": "2017-02-05T22:26:39.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 415,
"forks": 85,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "fa34e... |
ceefc5fb-0505-4b6c-95f1-cdd25d854151 | Jin-s-work/Algorithm | SDS_알고리즘/Day 3/BOJ 1275 커피숍 2.cpp | #include <iostream> // stdio.h 와 같은 것
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <cstring>
#include <cmath>
#include <functional>
#include <map>
#include <unordered_map>
#include <set>
// control i
#define MAX 987654321
#define mod 1000000007
#define pii pair<i... | ALGO | 0.999949 | 4.075423 | {
"github_metadata": {
"branch": "main",
"commit_count": 1201,
"repo_created_at": "2021-10-15T14:20:32.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "fe8830aed... |
4c5eba9c-d248-4877-a010-8f5da6e27d41 | leigelaing/C- | 第十一节.cpp | #include<stdio.h>
void test(int n)
{
if(n<10000)
{
test(n+1);
}
}
int main()
{
test(1);
return 0;
}
/*int fib(int n)
{
int a = 1;
int b = 1;
int c = 0;
while(n>2)
{
c = a + b;
a = b;
b = c;
n--;
}
return c;
}
/*int count = 0;
int fib(int n)
{
if(n == 3) //测试第三个斐波那契数被重复计算的次数
{
... | ALGO | 0.999844 | 3.539548 | {
"github_metadata": {
"branch": "master",
"commit_count": 61,
"repo_created_at": "2020-09-18T04:11:23.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "e46788074... |
5e675fa2-2a72-4fc1-bcf0-7c657b3e48b7 | readex-eu/readex-ptf | aagent/src/strategies/src/StallCycleAnalysisPerSyst.cc | /**
@file StallCycleAnalysisPerSyst.cc
@ingroup StallCycleAnalysisPerSystStrategy
@brief Itanium2 stall cycles PerSyst search strategy
@author <NAME>
@verbatim
Revision: $Revision$
Revision date: $Date$
Committed by: $Author$
This file is part of the Periscope performance ... | ALGO | 0.948212 | 5.529527 | {
"github_metadata": {
"branch": "master",
"commit_count": 3,
"repo_created_at": "2018-06-28T15:48:19.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 1,
"forks": 2,
"issues": 2,
"pull_requests": 1
},
"file_meta": {
"content_id": "d67c20fb289... |
695bbe23-eaca-47ac-93ec-ddfdf6a020d6 | FoxAlex98/UniCT | algoritmi/livello 3/min-enqueue.cpp | /*programma che crea un build min heap utilizzando un array e tutti i metodi che ne conseguono
ma usando l'enqueue al posto del buildheap e l'heapify
l'input è formato da:
tipo numeroelementi elementi .......
*/
#include <iostream>
#include <fstream>
#include <sstream>
#include <ctime>
#incl... | ALGO | 0.961657 | 3.887338 | {
"github_metadata": {
"branch": "master",
"commit_count": 1,
"repo_created_at": "2019-11-11T19:11:36.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "656400f20f... |
1a538691-251b-4b68-811f-7eebf5dd4f2d | whatisyourname0/BOJ_Repository | archives/cpp/4949.cpp | #include <bits/stdc++.h>
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define endl "\n"
#define INF 9876543201;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string words;
vector<char> s;
while (true) {
s.clear();... | ALGO | 0.999845 | 4.392266 | {
"github_metadata": {
"branch": "master",
"commit_count": 180,
"repo_created_at": "2022-01-31T10:09:50.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "e989e24e... |
748301e2-4fec-4a52-8edf-4555739a76db | barryyuanhao/cmake-project | src/testcode/102_binary-tree-level-order-traversal/reference.cc | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef struct TreeNode{
int val;
TreeNode* left;
TreeNode* right;
};
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(... | ALGO | 0.999977 | 5.439789 | {
"github_metadata": {
"branch": "main",
"commit_count": 65,
"repo_created_at": "2023-03-25T09:13:19.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "17722fe35fd... |
01f0a27f-6552-418f-89a1-d67fbb58d898 | yoche2000/alopexlagopus | CityU EE2331 Data Structure and Algorithm/Tut-07/tutorial_07.cpp | // Student name: <NAME>
// Student ID : 55348947
/*
Submission deadline: Friday, 20 March, 12 noon.
Upload your .cpp file to Canvas.
Put down your name and student ID at the top of your program file.
10% marks will be deducted if your program file does not contain your name and ID.
Submitted program that can... | ALGO | 0.998419 | 4.342032 | {
"github_metadata": {
"branch": "master",
"commit_count": 41,
"repo_created_at": "2020-02-20T16:49:24.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "2649b7658... |
1e20339c-26b2-4cde-a4a4-850bdb3ba8ab | mitul3737/Mitul-s-Competitive-Programming | BRAC University Competitive Programming training/Beginner Classes/Minimum Spanning Tree/Kruskal.cpp | //Minimum Spanning Tre
//Here 1 to 2 is an edge, 1 to 3 is an edge, 2 to 3 is tree and 1 to has cost 10, thus others............ thus total minimum cost is 30
//Input:
//3 3
//1 2 10
//1 3 20
//2 3 30
//Output:
//Taking 1 2 with cost 10
//Taking 1 3 with cost 20
//30
//Process finished with exit code 0
#include<bit... | ALGO | 0.999935 | 4.694445 | {
"github_metadata": {
"branch": "main",
"commit_count": 35,
"repo_created_at": "2021-03-08T06:51:11.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 2,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "4bdbf77b3d5... |
be6e1775-d310-4964-ac8a-38e0a50e3c90 | PaulLaliberte/Visualizing_Number_Theory | c++_implementation/main.cpp | //
// main.cpp
// sa_algo
//
// Created by <NAME> on 3/18/17.
// Copyright © 2017 <NAME>. All rights reserved.
//
#include "class_sa.hpp"
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <iterator>
void allegro_code()
{
//sa_algo new_circle;
//Chloe's code
//
}
void find_matrix(sa... | ALGO | 0.980664 | 3.533439 | {
"github_metadata": {
"branch": "master",
"commit_count": 31,
"repo_created_at": "2017-03-16T05:29:48.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "79ee7dac1... |
91d15e93-cdae-436d-ad14-2e3465f5d0e8 | snowflip/rushcodes | book_codes/Real time 3d terrain Engines using C++ and DirectX 9/Source/gaia/quad_tree.cpp | #define CQUADTREE_CPP
#define GAIA_DLL
/***************************************************************\
^^^^^^^^ ^^^^^^^^ ^^^^^^^^ ^^^^^^^^
^^ ^^ ^^ ^^ ^^ ^^ ^^
^^ ^^^^^^^^ ^^ ^^^^^^^^
^^ ^^^ ^^ ^^ ^^ ^^ ^^
^^ ^^ ^^ ^^ ^^ ^^ ^^... | ALGO | 0.999155 | 5.593693 | {
"github_metadata": {
"branch": "master",
"commit_count": 85,
"repo_created_at": "2016-03-28T08:36:12.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 1,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "3626222d0... |
750a4275-f63b-4a95-b05c-1075dddac166 | MoRamdan11/Algorithms-and-Data-structure | 1- Algorithms Toolbox/Week 4/4-2 Majority Element.cpp | #include <iostream>
using namespace std;
void mergee(int a[], int n1, int b[], int n2, int sorted_arr[])
{
int index1 = 0;
int index2 = 0;
int index = 0;
while(index1 != n1 && index2 != n2)
{
if(a[index1] < b[index2])
sorted_arr[index++] = a[index1++];
else
s... | ALGO | 0.999991 | 3.817194 | {
"github_metadata": {
"branch": "master",
"commit_count": 58,
"repo_created_at": "2020-09-16T14:32:24.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "b11068ee1... |
398e11c3-a38c-4761-93a6-bd0d2d34746d | kypo13/C-Programming | C/avl cn.cpp | #include<stdio.h>
#include<stdlib.h>
struct node{
int key;
int height;
struct node *left,*right;
};
int max(int a,int b){
if(a<b)return b;
else return a;
}
int getheight(struct node *curr){
if(curr==NULL){
return 0;
}
return curr->height;
}
int getbf(struct node *curr){
if(curr==NULL){
return 0;
}
re... | ALGO | 0.999973 | 3.581556 | {
"github_metadata": {
"branch": "master",
"commit_count": 25,
"repo_created_at": "2020-09-29T05:34:22.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "43c856d13... |
081a9541-705a-40c5-a197-4c3dcc1f8c5f | GabrielArana0220/Simulador-chafa-Automata-finito | automata_finito.cpp | #include <iostream>
#include <string.h>
#include <vector>
class nodo
{
bool validacion;
int * comportamiento;
int num;
public:
nodo()
{
validacion = false;
}
void creacion_nodo(std::string alfabeto, int nodos)
{
comportamiento = new int [alfabeto.size()];
num = alfabeto.size();
for (int i ... | ALGO | 0.990776 | 3.604597 | {
"github_metadata": {
"branch": "master",
"commit_count": 3,
"repo_created_at": "2020-09-09T22:11:16.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "5fcbbe192a... |
3d185885-04fe-4488-a527-3fc047bddbc3 | conorwes/aoc2021 | aoc2021/Source/day_03.cpp | #include "common.hpp"
#include <functional>
#include <algorithm>
class Day_03 {
public:
~Day_03() {};
// Part One: What is the power consumption of the submarine?
static bool PartOne(const std::vector<std::string>& vec, int& out) {
out = 0;
int gamma = 0, epsilon = 0, width = vec[0].size();
... | ALGO | 0.99575 | 6.168483 | {
"github_metadata": {
"branch": "main",
"commit_count": 9,
"repo_created_at": "2022-02-01T01:32:11.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "9d6a0648f997... |
bd60ceab-244e-4343-a5b5-316deff77142 | alexandraback/datacollection | solutions_5769900270288896_0/C++/rptynan/bru.cpp | #include <iostream>
using namespace std;
#define INF 1 << 30;
int N;
int R, C;
bool grid[20][20];
int dfs(int r, int c, int n, int tot) {
if (r == 0 && c == C) {
if (n != N) return INF;
return tot;
/* int count = 0; */
/* for (int i = 0; i < R; i++) { */
/* for (int ... | ALGO | 0.999793 | 4.851117 | {
"github_metadata": {
"branch": "master",
"commit_count": 58,
"repo_created_at": "2017-03-08T11:33:58.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 4,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "902374d02... |
2ba0c205-d48e-465e-9229-35382ae31457 | SaurabhMaurya9695/DSA-1.0 | 17th day.cpp | // Max subarray of size k
class Solution{
public:
long maximumSumSubarray(int k, vector<int> &arr , int n){
int i = 0 , j = 0 ; //
long long ans = INT_MIN ;
long long sum = 0 ;
while(j < n)//
{//
sum += arr[j]; // you have to do cal here
if(j... | ALGO | 0.999975 | 5.381498 | {
"github_metadata": {
"branch": "main",
"commit_count": 38,
"repo_created_at": "2023-01-12T17:52:12.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 1,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "773e8da812c... |
f2d959c1-8cec-4a46-a7f4-16b0093b1f04 | 5mil/lee | i2pd/libi2pd/Signature.cpp | #include <memory>
#include "Log.h"
#include "Signature.h"
namespace i2p
{
namespace crypto
{
class Ed25519
{
public:
Ed25519 ()
{
BN_CTX * ctx = BN_CTX_new ();
BIGNUM * tmp = BN_new ();
q = BN_new ();
// 2^255-19
BN_set_bit (q, 255); // 2^255
BN_sub_word (q, 19);
l = B... | TOOL | 0.974333 | 6.018237 | {
"github_metadata": {
"branch": "master",
"commit_count": 90,
"repo_created_at": "2017-10-24T17:56:29.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 45,
"issues": 0,
"pull_requests": 2
},
"file_meta": {
"content_id": "0b03fe4a... |
e269bac1-186a-413f-8809-c21d5e330ef3 | Volverman/procon-archive | atcoder.jp/diverta2019/diverta2019_c/Main.cpp | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | ALGO | 0.999946 | 3.782716 | {
"github_metadata": {
"branch": "master",
"commit_count": 652,
"repo_created_at": "2020-09-10T00:09:38.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "9debb3b4... |
dd5b4815-48f3-4449-ab48-c00944b28d5a | yumcyaWiz/photon_mapping | include/photon_map.h | #ifndef _PHOTON_MAP_H
#define _PHOTON_MAP_H
#include <concepts>
#include <numeric>
#include <queue>
#include <vector>
#include "core.h"
struct Photon {
Vec3f throughput; // BxDF * Geometric Term / pdf
Vec3f position;
Vec3f wi; // incident direction
// implementation of Point concept
static constexpr int ... | ALGO | 0.994541 | 6.334289 | {
"github_metadata": {
"branch": "main",
"commit_count": 194,
"repo_created_at": "2021-11-04T07:45:48.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 116,
"forks": 11,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "adfb936... |
1a0c8391-5320-4582-a30b-05bdcf683f98 | JJkang04/BaekJoon | 백준/Gold/4179. 불！/불！.cc | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <set>
#include <algorithm>
#include <list>
#include <stack>
#include <queue>
#define endl '\n'
typedef long long ll;
using namespace std;
#define X first
#define Y second
int r, c;
string board[1002];... | ALGO | 0.99994 | 4.22827 | {
"github_metadata": {
"branch": "main",
"commit_count": 117,
"repo_created_at": "2023-11-18T09:50:32.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "a809a06514... |
2a9c1973-c148-42d0-a0fb-08647cf4e22a | emilyju0314/gpt_code_plagiarism | dataset/code_content_classifier/allpro_train/1_6019_96.cpp | #include <bits/stdc++.h>
using namespace std;
int n, K;
int ar[1002000];
int S[1002000];
long long res;
struct node {
int cnt;
node *left;
node *right;
node() {
left = NULL;
right = NULL;
cnt = 0;
}
} root;
void add(int x) {
node *temp = &root;
for (int i = 30; i >= 0; i--) {
temp->cnt++;
... | ALGO | 0.999982 | 4.462681 | {
"github_metadata": {
"branch": "main",
"commit_count": 50,
"repo_created_at": "2024-04-28T03:59:40.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "9b70f6c48fd... |
8d8a1ae1-ba7b-48ac-9091-40e3f80f0d6e | Alok-kumar-Maurya/codes | 11dec.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
#define debugxy(x,y) cout<<"[ "<<x<<" "<<y<<" ]"<< endl
#define debugx(x) cout <<"[ "<< x <<" ]"<<endl
int32_t ma... | ALGO | 0.999957 | 3.880432 | {
"github_metadata": {
"branch": "main",
"commit_count": 4,
"repo_created_at": "2021-03-06T06:26:53.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "8b417faf77a3... |
aafd9de7-843b-47da-bb36-5e0bea1550af | DaryaBaizhanova/otus_pub | solve/solve.cpp | #include "solve.h"
#include <iostream>
#include <string>
#include <cmath>
CSolve::CSolve()
{
}
std::vector<double> CSolve::solve(double a, double b, double c, double eps)
{
std::vector<double> res;
double x1, x2;
string err = "";
if (a == eps) {
err = "\'a\' не может быть равно " + std::to_... | ALGO | 0.999863 | 4.003046 | {
"github_metadata": {
"branch": "main",
"commit_count": 6,
"repo_created_at": "2023-02-09T12:01:13.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "b0bf47d2ec3a... |
8fcb3ca1-43bf-446f-af20-bcb84d3cac18 | AnotherTwinkle/submissions | codeforces/1675/D.cpp | #include <bits/stdc++.h>
using ll = long long;
void solve() {
int n;
std::cin >> n;
int root;
std::map<int, std::vector<int>> parents;
for (int i = 1; i <= n; i++) {
int x; std::cin >> x;
if (x == i) root = i;
else parents[x].push_back(i);
}
std::vector<std::vector... | ALGO | 0.999889 | 5.161868 | {
"github_metadata": {
"branch": "master",
"commit_count": 241,
"repo_created_at": "2023-01-22T06:49:18.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "175cd176... |
c5e3a5bd-9baf-45cb-9131-1d26f6daaf07 | Drone-Banks/ACM | BZOJ/2154(Mobius).cpp | #include <bits/stdc++.h>
#define zyy 20101009
#define MaxN 10000005
const long long mod = 20101009;
#define ll long long
using namespace std;
ll mu[MaxN],prime[MaxN];
bool not_prime[MaxN];
ll sum[MaxN];
ll ans, x, y;
inline ll read(){
ll x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
... | ALGO | 0.999989 | 4.487611 | {
"github_metadata": {
"branch": "master",
"commit_count": 12,
"repo_created_at": "2018-03-24T10:06:25.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "aa20f1d61... |
6e887171-de8f-41f4-a67a-87f7ef04a9de | river-zero/Coding_Test | 백준/Gold/9935. 문자열 폭발/문자열 폭발.cc | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string str, bomb;
cin >> str >> bomb;
vector<char> result;
int bombLen = bomb.size();
for (char ch : str) {
result.push_back(ch);
/... | ALGO | 0.999981 | 4.839292 | {
"github_metadata": {
"branch": "main",
"commit_count": 631,
"repo_created_at": "2023-06-26T13:51:30.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "f02ce01fb9... |
17ba7a91-948e-4670-86bd-01d0c57e2325 | nahmedraja/GASAL2 | src/kernels/ksw_kernel_template.h | #ifndef __KSW_KERNEL_TEMPLATE__
#define __KSW_KERNEL_TEMPLATE__
// This old core provides the same result as the currently LOCAL core, but lacks some optimization. Left for historical / comparative purposes.
#define CORE_LOCAL_DEPRECATED_COMPUTE() \
uint32_t gbase = (gpac >> l) & 15;/*get a base from target_batch... | ALGO | 0.996883 | 5.21459 | {
"github_metadata": {
"branch": "master",
"commit_count": 254,
"repo_created_at": "2018-02-22T17:35:43.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 48,
"forks": 14,
"issues": 11,
"pull_requests": 0
},
"file_meta": {
"content_id": "3c092... |
452a0b87-7723-4777-9418-cc1ed9faba4e | TYHTTT3850/Code-Learning | Cpp-Learning/C++案例练习/运算符重载/复数类运算符重载练习.cpp | //通过运算符重载实现复数的乘除法和指数运算
#include <iostream>
#include <cmath>
using namespace std;
class Complex{
double real;
double image;
public:
double modulus = sqrt(pow(real,2) + pow(image,2));//复数的模
Complex(double a,double b):real(a),image(b){} //构造函数
Complex conjugate(){ //获取共轭复数
return Complex(re... | ALGO | 0.949997 | 4.919808 | {
"github_metadata": {
"branch": "main",
"commit_count": 786,
"repo_created_at": "2025-02-12T15:50:41.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 2,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "3066cee339... |
29128399-b308-45a6-948a-a0792ff351f9 | nikhil033/Data-Structures | Queue_Using_Linked_List.cpp | #include<iostream>
#include<stdio.h>
#include<conio.h>
using namespace std;
struct node{
int item;
struct node *next;
};
class queue{
node *head, *tail;
public:
queue(){
head = NULL;
tail = NULL;
}
void enQueue(int data){
node *temp = new node;
temp -> item = data... | ALGO | 0.999621 | 3.577151 | {
"github_metadata": {
"branch": "master",
"commit_count": 2,
"repo_created_at": "2020-03-10T10:39:09.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 2,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "38c98e117b... |
a75b15cd-9a15-4ec4-9610-e67004a352d9 | riyachak004/Sudoku | sudoku.hpp | //
// sudoku.hpp
// sudoku
//
// Created by <NAME> on 7/5/22.
//
#ifndef sudoku_hpp
#define sudoku_hpp
#include <stdio.h>
#include <vector>
#include <unordered_set>
using namespace std;
class game {
private:
struct cell {
int val;
bool input = false;
vector <int> possible;
... | ALGO | 0.979115 | 3.869957 | {
"github_metadata": {
"branch": "main",
"commit_count": 15,
"repo_created_at": "2023-07-20T01:00:38.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "4efe7b4f9ee... |
eb41b54c-8023-4d49-acb6-f98b4b76bb1a | snmath-pi/DataStructures | 450DSASHEET/BinaryTree/ZigZagTraversal.cpp | //{ Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
#define MAX_HEIGHT 100000
// Tree Node
struct Node {
int data;
Node* left;
Node* right;
};
// Utility function to create a new Tree Node
Node* newNode(int val) {
Node* temp = new Node;
temp->data = va... | ALGO | 0.999985 | 5.858545 | {
"github_metadata": {
"branch": "main",
"commit_count": 629,
"repo_created_at": "2022-02-14T15:23:24.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 2,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "3896d3474d... |
cf4ade43-fecb-44dd-8887-b9d74a370a17 | rwf93/Starbound | source/frontend/StarChatBubbleSeparation.cpp | #include "StarChatBubbleSeparation.hpp"
namespace Star {
bool compareLeft(RectF const& a, RectF const& b) {
return a.xMin() < b.xMin();
}
bool compareRight(RectF const& a, RectF const& b) {
return a.xMax() > b.xMax();
}
bool compareOverlapLeft(RectF const& newBox, RectF const& fixedBox) {
return newBox.xMax()... | TOOL | 0.961479 | 6.006436 | {
"github_metadata": {
"branch": "master",
"commit_count": 15,
"repo_created_at": "2023-06-20T05:58:09.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 130,
"forks": 37,
"issues": 6,
"pull_requests": 0
},
"file_meta": {
"content_id": "ca7522... |
89ebd1f7-d25f-45ca-bbd7-68a22fca14cf | ToxicTrigger/Game_argo | 02_BFS/main.cpp | #include <iostream>
#include "Map.h"
#include "ArrayQ.h"
#include <Windows.h>
#include <string>
using namespace std;
void drawObject(Map map, Object player, Object des, ArrayQ end);
void update(Map map, Object player, Object des, bool isEnd, ArrayQ end);
void bfs(Map map, Object player, Object des, ArrayQ q, bool isE... | ALGO | 0.981359 | 3.553032 | {
"github_metadata": {
"branch": "master",
"commit_count": 33,
"repo_created_at": "2018-03-08T00:50:09.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "020bf01f8... |
dd25cba5-571f-42aa-ab8a-24e3cf49c534 | yeeevip/yeee-memo | learn-example/algorithm/coding/HashExample/A1025.cpp | /*Input Specification:
Each input file contains one test case. For each case, the first line contains a positive number N (<=100),
the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (<=300),
the number of testees, and then K lines containing the registration n... | ALGO | 0.999403 | 3.390496 | {
"github_metadata": {
"branch": "master",
"commit_count": 389,
"repo_created_at": "2022-07-11T02:51:53.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 46,
"forks": 6,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "ec961ea... |
e7cbf6f4-5780-4ce2-a05b-6fcc2716a47a | timzsu/FABLE | src/GC/lowmc.h | #ifndef EMP_LOWMC_H__
#define EMP_LOWMC_H__
#include <bitset>
#include <array>
#include "GC/bit.h"
#include "GC/integer.h"
#include <fmt/core.h>
namespace sci {
const unsigned numofboxes = 8; // Number of Sboxes
const unsigned blocksize = 64; // Block size in bits
const unsigned keysize = 128; // Key size in ... | ALGO | 0.992389 | 5.147155 | {
"github_metadata": {
"branch": "main",
"commit_count": 108,
"repo_created_at": "2024-03-17T04:06:15.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 1,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "6bb7190172... |
569513a1-5290-4ac5-9eed-b4d558f499aa | AllanNozomu/CompetitiveProgramming | Leetcode/res/Word Ladder/1.cpp | \*
Author: allannozomu
Runtime: 108 ms
Memory: 43.7 MB*\
class Solution {
public:
string changeOneCharacter(string a, int i){
a[i] = '*';
return a;
}
int ladderLength(string beginWord, string endWord, vector<string>& wordList) {
unordered_map<string, vector<string>> str_to_comb... | ALGO | 0.999963 | 4.726112 | {
"github_metadata": {
"branch": "master",
"commit_count": 20,
"repo_created_at": "2018-06-03T15:15:33.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "c1d3d55a6... |
c9401da5-a67d-4c7b-bbc9-2aaa3503ab8a | freshmanhhhhhh/CTF_APK_design | pj3_design/wonderland/app/src/main/cpp/aes_simplified.h | //
// Created by Ham on 2022/6/6.
//
#ifndef ONE_AES_SIMPLIFIED_H
#define ONE_AES_SIMPLIFIED_H
#include<iostream>
#include<bitset>
#include<string>
typedef std::bitset<8> byte;
typedef std::bitset<32> word;
//种子密钥长度以及扩展轮数
const int Nr = 10;
const int Nk = 4;
//种子密钥
byte Key[16] = {0x2b, 0x7e, 0x15, 0x16, 0x28, 0xae,... | ALGO | 0.998937 | 3.825399 | {
"github_metadata": {
"branch": "main",
"commit_count": 6,
"repo_created_at": "2023-03-14T14:16:16.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "2a845e6bbd68... |
d64a3ede-49f6-4e03-8d72-e9f11a1b78b4 | ethantnguyen3/assignment2 | assignment.cpp | #include "assignment.h"
#include <iostream>
#include <string>
#include <stdexcept>
//constructor
template <typename Item_Type>
SinglyLinkedList<Item_Type>::SinglyLinkedList() : head(nullptr), tail(nullptr), num_items(0) {}
//destructor
template <typename Item_Type>
SinglyLinkedList<Item_Type>::~SinglyLinkedList() {
... | ALGO | 0.996607 | 5.681293 | {
"github_metadata": {
"branch": "main",
"commit_count": 13,
"repo_created_at": "2024-09-27T19:37:29.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "98d04a41642... |
a7bb4208-f847-4cc9-b030-4518616637d8 | ROCm/hipSPARSE | library/src/nvidia_detail/extra/hipsparse_csrgemm.cpp | /* ************************************************************************
* Copyright (C) 2025 Advanced Micro Devices, Inc. All rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Sof... | ALGO | 0.968018 | 4.612452 | {
"github_metadata": {
"branch": "develop",
"commit_count": 764,
"repo_created_at": "2018-06-05T08:38:52.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 67,
"forks": 49,
"issues": 2,
"pull_requests": 2
},
"file_meta": {
"content_id": "6084c2... |
c7ceecfc-7a56-4cb4-bdd4-8cc479fcf705 | acmupv/ProgrammingCompetition2023 | Problemas/Contando bancos/soluciones/main.cc | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
void alg(int N, int D, map<int, vector<int>>& banks);
int main() {
int N, D;
int caseNum = 1;
while (true) {
cin >> N >> D;
if (N == 0 && D == 0) {
break;
}
if (ca... | ALGO | 0.999864 | 4.173639 | {
"github_metadata": {
"branch": "main",
"commit_count": 5,
"repo_created_at": "2023-05-15T07:06:57.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "daaa13112960b... |
06a58215-f405-43db-b5ab-c09a729bdf39 | zzwblog/AlgorithmCode | 力扣刷题/980 Unique Paths III.cpp | //#include "000库函数.h"
//
//class Solution {
//public:
// int uniquePathsIII(vector<vector<int>>& grid) {
// n = grid.size();
// m = grid[0].size();
// int nums = 0, res = 0;
// for(int i=0;i<n;++i)
// for (int j = 0; j < m; ++j)
// {
// if (grid[i][j] == 0)
// ++nums;//统计可走空格数量
// if (grid[i][j] == 1)... | ALGO | 0.999542 | 5.1834 | {
"github_metadata": {
"branch": "master",
"commit_count": 1,
"repo_created_at": "2020-09-03T10:47:30.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "5cfc28fbcd... |
3adf7482-5f26-459e-ab7e-281a89aba698 | eliotmasset/Cassage-d-empreinte-MD5-par-force-brute | src/sequentielle.cpp | #include <iostream>
#include <cstddef>
#include <unistd.h>
#ifndef CRYPTOPP_ENABLE_NAMESPACE_WEAK
#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1
#endif
#include "../cryptopp/dll.h"
#include "../cryptopp/default.h"
#include "../cryptopp/md5.h"
#include "../cryptopp/hex.h"
//Fonction qui renvoie l'empreinte md5 d'un string
s... | ALGO | 0.98986 | 4.920846 | {
"github_metadata": {
"branch": "master",
"commit_count": 64,
"repo_created_at": "2020-09-09T15:18:35.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 2,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "e2ebca620... |
6650588b-7517-4888-999b-4c3a77a9426a | liusonglei796/code | 洛谷1036(包含隐式回溯和显式回溯的区别).cpp | #include<bits/stdc++.h>
using namespace std;
int n,k;
vector<int>v1;
bool isPrime(int num) {
if(num < 2) return false;
for(int i = 2; i * i <= num; i++) {
if(num % i == 0) return false;
}
return true;
}
//隐式回溯：通过函数参数传递新状态，函数返回时自动恢复旧状态
//显式回溯：明确地标记和修改状态，然后手动恢复状态
//在这道题中，由于我们只需要记录sum，而sum是通过参数传递... | ALGO | 0.999975 | 4.177172 | {
"github_metadata": {
"branch": "main",
"commit_count": 54,
"repo_created_at": "2024-12-01T06:09:37.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "34a922abcb6... |
dd34ad04-63f4-42a5-b03e-3c02ff671c63 | manwar/perlweeklychallenge-club | challenge-266/ulrich-rieke/cpp/ch-2.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
std::vector<std::string> split( const std::string & startline ,
const std::string & sep ) {
std::vector<std::string> separated ;
std::string::size_type start { 0 } ;
std::string::size_type pos ;
do {
... | ALGO | 0.999572 | 5.170811 | {
"github_metadata": {
"branch": "master",
"commit_count": 44412,
"repo_created_at": "2019-03-30T01:15:28.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 194,
"forks": 332,
"issues": 5,
"pull_requests": 4
},
"file_meta": {
"content_id": "36... |
df5aa270-d7ee-4654-8bb2-c0a57890702f | christophschmalhofer/poker | XPokerEval/XPokerEval.TwoPlusTwo.Test/test.cpp | #include "../util/tchar.h"
#include "../util/Timer.h"
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
// The handranks lookup table- loaded from HANDRANKS.DAT.
int HR[32487834];
// This function isn't currently used, but shows how you lookup
// a 7-card poker hand.... | ALGO | 0.912672 | 6.309922 | {
"github_metadata": {
"branch": "master",
"commit_count": 2,
"repo_created_at": "2011-01-23T20:21:21.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 71,
"forks": 43,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "4f0e69de... |
bd0b96da-0f7b-47e3-a70f-a9c799032bdd | YXHXianYu/YXHXianYu-XCPC-Template | Contest/牛客练习赛114/4.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
void work() {
int n;
cin >> n;
vector<int> a(n + 1);
for(int i = 1; i <= n; i++) cin >> a[i];
vector<int> cnt(n + 1);
for(int i = 1; i <= n; i++) cnt[a[i]]++;
for(int i = 1; i <= min(15ll, n); i++) cout << cnt[i] << " "; co... | ALGO | 0.99993 | 4.520629 | {
"github_metadata": {
"branch": "main",
"commit_count": 34,
"repo_created_at": "2023-08-18T12:10:01.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 9,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "b7db0490c6f... |
99f98adf-840b-4a39-8169-ccd1b1cafc64 | VitaliyEroshin/cpp-essentials | Graphs/CycleSearch.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 1;
int n, m;
vector<vector<int>> graph(N);
vector<int> used(N, 0);
vector<int> parent(N, -1);
int cycleStart, cycleEnd;
bool dfs(int v) {
used[v] = 1;
for (auto x : graph[v]) {
if (used[x] == 0) {
parent[x] = v;
i... | ALGO | 0.999998 | 4.321391 | {
"github_metadata": {
"branch": "main",
"commit_count": 28,
"repo_created_at": "2020-11-06T18:35:59.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "08362c75640... |
d9a0b328-2fc2-4007-98f3-dc0027e18764 | Exawind/nalu-wind | include/ngp_algorithms/EffSSTDiffFluxCoeffAlg.h | // Copyright 2017 National Technology & Engineering Solutions of Sandia, LLC
// (NTESS), National Renewable Energy Laboratory, University of Texas Austin,
// Northwest Research Associates. Under the terms of Contract DE-NA0003525
// with NTESS, the U.S. Government retains certain rights in this software.
//
// This sof... | ALGO | 0.997974 | 6.79788 | {
"github_metadata": {
"branch": "master",
"commit_count": 2492,
"repo_created_at": "2018-05-03T15:39:32.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 137,
"forks": 93,
"issues": 18,
"pull_requests": 7
},
"file_meta": {
"content_id": "1cfe... |
2194da79-834f-4a32-8c0c-17e13397f6da | ishandutta2007/codeforces-k | ksun48/normal/674/C.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
double dp[210000][2];
int n, zz;
double t[210000];
double sum1[210000];
double sum2[210000];
double add1(int a, int b){
if(b < a) return 0;
if(a == 0) return sum1[b];
return sum1[b]-sum1[a-1];
}
double add2(int a, int b){
if(b < a) return 0;
if(a =... | ALGO | 0.999725 | 3.412129 | {
"github_metadata": {
"branch": "main",
"commit_count": 1,
"repo_created_at": "2024-04-11T06:06:31.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "f3cb68c41411... |
0bc48669-f9b7-4b8e-b5f1-f4415dd74462 | RobotLocomotion/drake | multibody/contact_solvers/sap/sap_weld_constraint.h | #pragma once
#include <memory>
#include <utility>
#include "drake/common/drake_copyable.h"
#include "drake/common/eigen_types.h"
#include "drake/math/rigid_transform.h"
#include "drake/multibody/contact_solvers/sap/sap_holonomic_constraint.h"
namespace drake {
namespace multibody {
namespace contact_solvers {
namesp... | ALGO | 0.992544 | 6.937114 | {
"github_metadata": {
"branch": "master",
"commit_count": 33726,
"repo_created_at": "2014-01-26T16:11:05.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 3630,
"forks": 1305,
"issues": 690,
"pull_requests": 46
},
"file_meta": {
"content_id":... |
21cf8d55-dcd7-4e24-a32b-78917abb3a83 | cyt2017/majiangProj | qmajiangrecbase.cpp | #include "qmajiangrecbase.h"
void QMaJiangRecBase::GetGrayAvgStdDev(cv::Mat& src, double& avg, double &stddev)
{
cv::Mat img;
if (src.channels() == 3)
cv::cvtColor(src, img, CV_BGR2GRAY);
else
img = src;
cv::mean(src);
cv::Mat mean;
cv::Mat stdDev;
cv::meanStdDev(img, mean, s... | TOOL | 0.97624 | 3.791501 | {
"github_metadata": {
"branch": "master",
"commit_count": 1,
"repo_created_at": "2017-10-15T03:55:22.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 14,
"forks": 9,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "c2384b0e7... |
e4ddf3cf-98dc-4cc4-98b4-d3e95bf4a0e7 | xiaoxiaozhi/opencvTest | srccode/opencv_042.cpp | #include <opencv2/opencv.hpp>
#include <iostream>
using namespace cv;
using namespace std;
int main(int argc, char** argv) {
VideoCapture capture("D:/images/video/balltest.mp4");
if (!capture.isOpened()) {
printf("could not open the camera...\n");
}
namedWindow("MeanShift Demo", WINDOW_AUTOSIZE);
Mat frame, hs... | ALGO | 0.984172 | 5.006367 | {
"github_metadata": {
"branch": "master",
"commit_count": 5,
"repo_created_at": "2021-05-08T08:40:54.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "f9d37ee2a5... |
5ed75e1c-7a6d-47c7-b2c0-7ec7cb5f1993 | vishusharmaX/100DaysofCodeChallenge | Difficulty: Medium/Tower Of Hanoi/tower-of-hanoi.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
// You need to complete this function
// avoid space at the starting of the string in "move disk....."
long long count = 0;
void solve(int n, int src, int dest, int helper){
... | ALGO | 0.999869 | 5.56272 | {
"github_metadata": {
"branch": "main",
"commit_count": 2746,
"repo_created_at": "2023-05-07T16:09:54.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "3eecd0adb... |
9b55415c-b8f2-4c6b-97a1-2e08b4a40687 | AhmedHani/Online-Judges-Problems-SourceCode | UVa/11631 - Dark roads.cpp | //============================================================================
// File : 11631 - Dark roads.cpp
// Author : <NAME>
// Copyright : AHani
// Version : UVa - Accepted - 0.394
// Created on August 28, 2012, 8:41 PM
//=========================================================================... | ALGO | 0.999881 | 3.551934 | {
"github_metadata": {
"branch": "master",
"commit_count": 398,
"repo_created_at": "2013-03-23T16:10:11.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 15,
"forks": 14,
"issues": 1,
"pull_requests": 0
},
"file_meta": {
"content_id": "514881... |
783121f6-35ad-4ba4-a162-04c6b2d65501 | marinapapa/HoPE-model | libs/hrtree/arch/simd/mbr_intersect_policy_impl.hpp | // hrtree/arch/simd/mbr_intersect_policy_impl.hpp header file
//
// Part of the Hilbert Rtree library.
// Copyright (c) 2000-2014 <NAME>
//
// This software is provided "as is" without express or implied warranty,
// and with no claim as to its suitability for any purpose.
#ifndef HRTREE_ARCH_SIMD_MBR_INTERSECT_POLICY... | ALGO | 0.936707 | 6.459888 | {
"github_metadata": {
"branch": "main",
"commit_count": 25,
"repo_created_at": "2021-06-02T09:46:48.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 3,
"forks": 1,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "3e4e375f158... |
d7c42083-c366-4659-a09a-37a0a5ce8273 | Mackenzie-98/Solutions | Maratón UFPS/2020/g.cpp | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define ft first
#define sd second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#def... | ALGO | 0.999913 | 3.837167 | {
"github_metadata": {
"branch": "main",
"commit_count": 7,
"repo_created_at": "2021-08-24T01:41:42.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "24525e2d69d4... |
980cb3b8-b152-401b-adda-815cc0174e67 | M4573R/competitive-programming-archive | codeit/2014/vi-sprint/code.cpp | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
string min_lex(const string& sequence)
{
string minimum;
for (unsigned int left = 0, right = sequence.size() - 1; left <= right; )
{
if (sequence[left] < sequence[right])
{
minimum += sequence[left++]... | ALGO | 0.999997 | 4.356831 | {
"github_metadata": {
"branch": "master",
"commit_count": 1407,
"repo_created_at": "2015-09-01T07:44:33.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 29,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "320a7f... |
2e65d4ce-99f9-4923-ab26-dcd1bbb89fa1 | ENRICOSCHI/NeetCodeProblems | Sliding Window/Longest Substring Without Repeating Characters/main.cpp | class Solution {
public:
int characterReplacement(string s, int k) {
int n = s.size();
int freq[26] = {0}; // frequency of characters
int left = 0, right = 0; // sliding window boundaries
int maxCount = 0, maxLength = 0; // result variables
while (right < n) {
freq[s[right] - 'A']++; // increment frequency of current c... | ALGO | 0.999977 | 6.699714 | {
"github_metadata": {
"branch": "main",
"commit_count": 10,
"repo_created_at": "2023-01-30T18:51:35.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "0b25208b61f... |
70a06c0f-91c2-40f8-8ad8-de141ab8137b | om-mapari/Data-Structures-Implementation | Templets_/Converted/Stack_LinkedList.cpp | #include <iostream>
using namespace std;
template <class t>
class node {
public:
t data;
node<t>* next;
};
template <class t>
class stack {
node<t> *top;
public:
stack(){
top = NULL;
}
void push(t x);
void pop();
bool isempty();
t Top();
void print();
};
t... | ALGO | 0.987924 | 3.399608 | {
"github_metadata": {
"branch": "master",
"commit_count": 6,
"repo_created_at": "2021-10-05T22:15:03.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 2,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "3c37511f20... |
c25be698-2df3-44ea-88ff-117cadc63650 | xoyojank/nebula3 | code/extlibs/OGDF/src/basic/GridLayoutModule.cpp | /*
* $Revision: 2549 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2012-07-04 23:09:19 +0200 (Mi, 04. Jul 2012) $
***************************************************************/
/** \file
* \brief Implements grid mapping mechanism of class GridLayoutModule
*
* \author <NAME>
*
* \par License:
* ... | ALGO | 0.976236 | 6.357981 | {
"github_metadata": {
"branch": "master",
"commit_count": 6,
"repo_created_at": "2012-11-23T19:29:49.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 62,
"forks": 38,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "650eeacd... |
e0404544-bcc9-415f-99f8-3f5fc59a1dc0 | InsightSoftwareConsortium/ITK | Modules/ThirdParty/Eigen3/src/itkeigen/Eigen/src/Geometry/OrthoMethods.h | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2008-2009 <NAME> <<EMAIL>>
// Copyright (C) 2006-2008 <NAME> <<EMAIL>>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// wit... | ALGO | 0.994726 | 6.730638 | {
"github_metadata": {
"branch": "main",
"commit_count": 57165,
"repo_created_at": "2010-07-27T15:48:04.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 1517,
"forks": 701,
"issues": 268,
"pull_requests": 49
},
"file_meta": {
"content_id": "d... |
910ab2bc-5b70-4034-801c-c2e65a610a2b | Diegores14/CompetitiveProgramming | Lightoj/1300 - Odd Personality/solution.cc | #include <bits/stdc++.h>
using namespace std;
const int tam = 10005;
int n = 0, m, timer, comp, cant[tam], component[tam], color[tam], tin[tam], low[tam];
list< int > G[tam];
bool used[tam];
stack< int > s;
int ans = 0;
bool bicolored( int idx, int col = 0 ) {
color[idx] = col;
for( int to : G[idx] ) {
... | ALGO | 0.999957 | 5.410548 | {
"github_metadata": {
"branch": "master",
"commit_count": 718,
"repo_created_at": "2018-06-08T22:15:18.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 8,
"forks": 2,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "34032632... |
bdb81f4a-e63f-4fd4-b81b-d316f15dbaed | m790101/c-practice | unorder-list.cpp | // g++ -std=c++11 unorder-list.cpp -o unorder-list
#include <iostream>
#include<vector>
void twoSum(std::unordered_map<int, int> arrayMap, std::vector<int> array, int targetNum);
int main()
{
std::vector<int> vData = {3,9,2,7,13,1};
std::unordered_map<int,int> mapData;
int targetNum = 14;
for(... | ALGO | 0.999566 | 5.371067 | {
"github_metadata": {
"branch": "main",
"commit_count": 37,
"repo_created_at": "2024-01-24T11:43:58.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "e152a0086c6... |
de414411-6420-44a2-9a21-04a12fb153c7 | gauravxshukla/LeetCode-Journey | Recursion/Reverse_a_stack_using_recursion.cpp | /*
Stack Prerequisites
Declaring a Stack = stack<int> stk;
Push a value - stk.push(value);
Pop a value - stk.pop();
Find the top element - stk.top();
Check if Stack is empty - stk.empty();
Size of Stack - stk.size();
*/
#include<bits/stdc++.h>
using namespace std;
void insert(stack<int>... | ALGO | 0.999864 | 5.005345 | {
"github_metadata": {
"branch": "main",
"commit_count": 17,
"repo_created_at": "2021-12-29T18:26:49.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "f42ce08f57d... |
15c90982-148b-4316-97fd-9e5f549e62de | sonugiri1043/LeetCode | LeetCode_412_FizzBuzz.cpp | /*Write a program that outputs the string representation of numbers from 1 to n.
But for multiples of three it should output “Fizz” instead of the number and for the
multiples of five output “Buzz”. For numbers which are multiples of both three and five output “FizzBuzz”.
Example:
n = 15,
Return:
[
"1",
"2",
"Fizz... | ALGO | 0.999778 | 6.541022 | {
"github_metadata": {
"branch": "master",
"commit_count": 294,
"repo_created_at": "2019-06-03T17:55:38.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "d98c261e... |
ce8b7cb7-f700-4147-8517-45ed94ecaa09 | zhanghuicuc/WebRTC-VideoEngine-Demo | webrtc_videoengine_demo/webrtc/modules/rtp_rtcp/source/vp8_partition_aggregator.cc | /*
* Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contribut... | ALGO | 0.999642 | 6.557229 | {
"github_metadata": {
"branch": "master",
"commit_count": 7,
"repo_created_at": "2015-08-10T14:40:17.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 66,
"forks": 46,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "00619662... |
0630dbfd-e1b5-4c5a-975b-ffc2b7aca227 | 2019331043-Zakaria/Codes | CB/madfaka.cpp | // C++ program to find the N-th character
// in the string "1234567891011.."
#include <bits/stdc++.h>
using namespace std;
// Function that returns the N-th character
char NthCharacter(int n)
{
// initially null string
string s = "";
// starting integer
int c = 1;
// add integers in string
for (int i = 1;; i++... | ALGO | 0.999476 | 3.951588 | {
"github_metadata": {
"branch": "main",
"commit_count": 4,
"repo_created_at": "2024-05-09T16:22:14.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "26d40b0902f3... |
5210fbd6-0b72-4ded-b2d4-8a5c01f523a6 | AneVas/PracticasComputacionI | Puntos/Punto.cpp | //
// Created by <NAME> on 14/10/2021.
//
#include <iostream>
#include <math.h>
#define PI 3.14159265
#include "Punto.h"
using namespace std;
Punto2D::Punto2D() {
i = 0;
j = 0;
k = 0;
}
void Punto2D::SetPosicion(float x, float y) {
i = x;
j = y;
}
void Punto2D::Trasladar(float temp1, float temp2) {
... | ALGO | 0.93886 | 3.870588 | {
"github_metadata": {
"branch": "main",
"commit_count": 22,
"repo_created_at": "2021-09-15T04:33:33.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "295f77c2081... |
06910536-ec9b-480d-ae0b-1c525485e799 | Sandstorm831/Programming_Palindrome | maximum_path_sum.cpp | /* Problem Link - https://leetcode.com/problems/binary-tree-maximum-path-sum/
A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them.
A node can only appear in the sequence at most once. Note that the path does not need to pass through the root.
The... | ALGO | 0.99995 | 4.729664 | {
"github_metadata": {
"branch": "main",
"commit_count": 115,
"repo_created_at": "2022-05-04T23:00:37.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "6299a2f540... |
7ae86b89-9adb-42c6-ac21-e66a8f7e51aa | FlorianSWA/schwarzl_project_2 | src/controller/main.cpp | /*
Author: <NAME>
Date: 2021-02-01
*/
#include <iostream>
#include <unistd.h>
#include <sys/wait.h>
#include <random>
#include <chrono>
#include "spdlog/fmt/fmt.h"
#include "spdlog/spdlog.h"
#include "spdlog/sinks/rotating_file_sink.h"
#include "spdlog/fmt/bundled/color.h"
#include "CLI11.hpp"
#include "utils.h"
#incl... | TOOL | 0.982877 | 5.278718 | {
"github_metadata": {
"branch": "main",
"commit_count": 42,
"repo_created_at": "2021-02-08T11:43:18.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "a3865bec3dd... |
59e9fb72-b61f-4264-9b44-dc6b9defcc2c | ppauljonathan/cpp-code | radixsort.cpp | #include<iostream>
using namespace std;
int pow(int a,int b)
{
int pr=1;
for(int i=0;i<b;i++){pr*=a;}
return pr;
}
struct node{int data;node *next;};
void insert(node **head,int el)
{
node *t=new node,*m=*head;
t->data=el;t->next=NULL;
if(*head==NULL){*head=t;}
else
{
while(m-... | ALGO | 0.999971 | 4.593489 | {
"github_metadata": {
"branch": "main",
"commit_count": 15,
"repo_created_at": "2021-06-04T04:56:36.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "ad2ad8ffae9... |
b0713e46-d7ba-434c-a30f-91a8660fdad2 | janreggie/leetcode | 0101-0200/105-construct-binary-tree-from-preorder-and-inorder-traversal/main.cpp | #include <bits/stdc++.h>
using namespace std;
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), left(left), right(right) {}
strin... | ALGO | 0.999998 | 6.702715 | {
"github_metadata": {
"branch": "master",
"commit_count": 118,
"repo_created_at": "2021-06-02T11:41:41.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "48b5c972... |
cc2203bc-a36f-4112-ae26-304c6eb8ed04 | lab104yifan/ACM | mul/7312.cpp | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100005;
#define lson(x) ((x<<1)+1)
#define rson(x) ((x<<1)+2)
#define INF 0x3f3f3f3f
int t, n, num[N];
struct Node {
int l, r, x, setv;
bool cover;
} node[4 * N];
int gcd(int a, int b) {
if (!b) return a;
ret... | ALGO | 0.999965 | 3.746413 | {
"github_metadata": {
"branch": "master",
"commit_count": 12,
"repo_created_at": "2013-09-13T08:21:30.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 1,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "6297938d7... |
4a1a3195-7dfa-4e00-b8f4-47449bbf2e22 | jpucilos/classwork_archive | EE553/Homework/HW1/HW_1b_JoePuciloski.cpp | /*
Convergence of n-gons
1. Start with a circle r= 1
2. Circumscribe a triangle, (n=3) around the circle
3. Circumscribe a circle around the triangle
4. Circumscribe a square (n=4) around the circle
5. Circumscribe a circle around the square...
6. Circumscribe a pentagon (n=5) around the circle.
...
print out t... | ALGO | 0.999647 | 4.617023 | {
"github_metadata": {
"branch": "master",
"commit_count": 74,
"repo_created_at": "2017-09-15T16:32:26.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 2,
"forks": 1,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "32c41d645... |
ea87c76a-36b4-438e-a928-75cacc0babd9 | ogoe/waves2Foam | src/waves2Foam/waveTheories/externalWaveForcing/irregularFast/irregularFast.H | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration |
\\ / A nd | Copyright held by original author
\\/ M anipulation |
------------------... | ALGO | 0.980247 | 6.642099 | {
"github_metadata": {
"branch": "master",
"commit_count": 277,
"repo_created_at": "2012-02-20T17:41:28.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 47,
"forks": 45,
"issues": 0,
"pull_requests": 2
},
"file_meta": {
"content_id": "678981... |
9beefc20-8b41-4010-bcc0-b46949e31e8e | sunghyo0100/Practice | Divide and Conquer(D&C)/11650_D&C_S5.cpp | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
typedef long long ll;
using namespace std;
#define PRESET cin.tie(NULL); ios::sync_with_stdio(false);
#define debug(x) cout << ... | ALGO | 0.999968 | 5.161736 | {
"github_metadata": {
"branch": "main",
"commit_count": 21,
"repo_created_at": "2025-04-28T08:02:13.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "4767a5c8944... |
849efdb7-fecb-41e6-8b6d-c9e42df2e189 | zukun/rcc | vxl/vxl-1.13.0/contrib/brl/bseg/bvpl/bvpl_opinion_functor.cxx | //:
// \file
#include "bvpl_opinion_functor.h"
#include <vcl_cmath.h>
#include <vcl_iostream.h>
// Default constructor
bvpl_opinion_functor::bvpl_opinion_functor()
{
this->init();
}
//:Initializes all local variables
void bvpl_opinion_functor::init()
{
b_=1.0;
u_=1.0;
n_p_=1;
n_m_=1;
}
void bvpl_opinion_f... | ALGO | 0.998837 | 5.93354 | {
"github_metadata": {
"branch": "master",
"commit_count": 11,
"repo_created_at": "2013-02-21T15:10:15.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 14,
"forks": 16,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "35ca340... |
9f2e1641-4464-4480-bd6a-b468aa8fe600 | OSCCAR-PFM/OSCCAR | ThirdParty-2.3.x/ParaView-4.1.0/ParaViewCore/ClientServerCore/Rendering/vtkStreamingPriorityQueue.h | /*=========================================================================
Program: ParaView
Module: vtkStreamingPriorityQueue
Copyright (c) Kitware, Inc.
All rights reserved.
See Copyright.txt or http://www.paraview.org/HTML/Copyright.html for details.
This software is distributed WITHOUT ANY W... | ALGO | 0.997952 | 7.286705 | {
"github_metadata": {
"branch": "master",
"commit_count": 905,
"repo_created_at": "2014-05-14T10:29:15.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 5,
"forks": 1,
"issues": 2,
"pull_requests": 0
},
"file_meta": {
"content_id": "6691ce224... |
2c21c35a-1055-43ba-a23d-865fdfc74627 | ibariev/cpp_modules | module_08/ex01/span.cpp | #include "span.hpp"
Span::Span()
{
this->N = 0;
}
Span::Span(const Span & other)
{
*this = other;
}
Span::Span(unsigned int _N)
{
this->N = _N;
}
Span::~Span()
{
return ;
}
const Span & Span::operator=(const Span & other)
{
this->vct = other.vct;
this->N = other.N;
return (*this);
}
void Span::addNumber(in... | ALGO | 0.973103 | 4.8784 | {
"github_metadata": {
"branch": "master",
"commit_count": 3,
"repo_created_at": "2022-01-25T00:30:38.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "c2bda177be... |
31e83f23-4203-4a35-b3af-5e23d21c1f8f | eabhi-me/try-cpp | level-1/stack/using-linkedlist.cpp | #include<iostream>
using namespace std;
class Node{
public:
int data;
Node *next;
Node(int x){
this->data=x;
this->next=nullptr;
}
};
class Stack{
public:
Node* top;
Stack(){
top = nullptr;
}
void push(int d){
if(top==nul... | ALGO | 0.997788 | 3.99812 | {
"github_metadata": {
"branch": "main",
"commit_count": 34,
"repo_created_at": "2024-03-12T19:58:08.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "ff1e45f8160... |
cae687c6-b2ea-4d69-9457-9d62be91a07e | kira-1011/A2SV | swapPairNodes.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 {
private:
ListNode* ... | ALGO | 0.999993 | 6.143142 | {
"github_metadata": {
"branch": "main",
"commit_count": 419,
"repo_created_at": "2022-04-21T09:44:42.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "30a58643fa... |
6db6e014-de29-4b65-8e20-973f9879988b | Egeorgel42/cpp | cpp9/ex02/PmergeMe.cpp | #include "PmergeMe.hpp"
PmergeMe::PmergeMe() {}
PmergeMe::PmergeMe(const PmergeMe &cp) {(void)cp;}
PmergeMe &PmergeMe::operator=(const PmergeMe &cp) {(void)cp; return *this;}
const char *PmergeMe::InvalidArgument::what() const throw() {return "Invalid argument(s)";}
const char *PmergeMe::NoArgument::what() const t... | ALGO | 0.998879 | 5.517508 | {
"github_metadata": {
"branch": "master",
"commit_count": 29,
"repo_created_at": "2023-06-23T21:27:13.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "9e9faf099... |
b64a3fc1-231d-4b0a-99ae-854d0ea90f28 | HallerJohn/HallerJohn_CSC17_Fall2018 | Lab/MidTerm/Problem4/main.cpp | /*
* File: main.cpp
* Author: <NAME>
* Created on August 29, 2018, 12:58 PM
* Purpose: Class work
*/
//System Libraries
#include <iostream>
#include <cstdlib>
using namespace std;
//User Libraries
//Global Constants - Math/Physics Constants, Conversions,
// 2-D Array Dimensions
//Function... | ALGO | 0.998322 | 3.480114 | {
"github_metadata": {
"branch": "master",
"commit_count": 45,
"repo_created_at": "2018-08-29T19:46:17.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "4542701af... |
56651e50-9974-4f51-a976-9c3497b85e9d | Xarma123/cp-practice | D_Suspicious_logarithms.cpp | #include <bits/stdc++.h>
using namespace std;
#define lol unsigned long long
lol logbase(lol a, lol b)
{
lol v = 1;
for (lol i = 0;; i++)
{
if (v > a)
return i - 1;
v = v * 1ll * b;
}
return -1;
}
lol pw(lol a, lol b)
{
lol r = 1;
while (b > 0)
{
if (b... | ALGO | 0.999938 | 4.73187 | {
"github_metadata": {
"branch": "master",
"commit_count": 176,
"repo_created_at": "2022-09-18T23:21:39.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "20619717... |
c40e63fa-f145-41af-bf4b-e66b65b733fb | danny-wang/leetcode | 289. Game of Life.cpp | /**
289. Game of Life
According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician <NAME> in 1970."
Given a board with m by n cells, each cell has an initial state live (1) or dead (0). Each cell interacts with its eight neighbors (hori... | ALGO | 0.999969 | 6.059771 | {
"github_metadata": {
"branch": "master",
"commit_count": 76,
"repo_created_at": "2016-09-30T07:54:36.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "9232dfd54... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.