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 |
|---|---|---|---|---|---|---|---|
3eec96f0-f4d2-4c2b-9a0c-80135a8f8e72 | LFTCLICK/lftclick_engine | LFT Click Engine/Src/AStarTerrain.cpp | // ---------------------------------------------------------------------------
// Project Name : LFTClick Engine
// File Name : AStarTerrain.cpp
// Author : <NAME>
// Creation Date : 2021/03/23
// Purpose : Terrain data for A*
// History :
// --------------------------------------------------------------------... | ALGO | 0.998297 | 3.795625 | {
"github_metadata": {
"branch": "main",
"commit_count": 313,
"repo_created_at": "2022-01-11T06:22:02.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "9d2802ba23... |
7f34d404-aadd-4a33-a365-5ca13f33ffba | 1592063346/Codes | Codeforces/CF#524 Div.2/3.cpp | #include<bits/stdc++.h>
using namespace std;
#define rg register
typedef long long ll;
int T;
struct Matrix {
int x1, y1, x2, y2;
Matrix () {}
Matrix operator & (const Matrix& a) const {
Matrix res;
res.x1 = max(x1, a.x1);
res.y1 = max(y1, a.y1);
res.x2 = min(x2, a.x2);
res.y2 = min(y2, a... | ALGO | 0.99865 | 4.391613 | {
"github_metadata": {
"branch": "master",
"commit_count": 436,
"repo_created_at": "2018-12-27T22:56: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": "0178f3ec... |
719a9590-6894-416e-ac35-eafae293d4d8 | mostafa-saad/MyCompetitiveProgramming | Olympiad/Baltic/official/boi2007_solutions/sound-sol/sound_fa.cpp | // <NAME>
#define _CRT_SECURE_NO_DEPRECATE
#include <cstdio>
#include <list>
#include <cassert>
#include <ctime>
using namespace std;
typedef list<int> LI;
struct MinMaxQueue {
LI q, qmax, qmin;
void push(int v) {
q.push_back(v);
// every v gets added to or removed from the qmin a... | ALGO | 0.999992 | 3.809662 | {
"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": "70c05... |
39a1f36e-5d73-4d8a-999d-10a260ceb8cf | Sudo248/Algorithm | caybieuthuc1.cpp | #include<bits/stdc++.h>
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
using namespace std;
typedef long long ll;
struct Node{
char data;
Node* left;
Node* right;
};
Node* newNode(char val){
Node* tmp = new Node;
tmp->data = val;
tmp->left = NULL;
tmp... | ALGO | 0.999923 | 4.516382 | {
"github_metadata": {
"branch": "master",
"commit_count": 2,
"repo_created_at": "2021-07-17T10:21: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": "68cbb57e5b... |
f3ba3de0-42dc-4229-83a3-57178e905c66 | rkwhrcjsaud/kibum | 백준/Gold/1107. 리모컨/리모컨.cc | #include <iostream>
#include <set>
#define MIN(a, b) (a > b ? b : a)
int n, m;
int min;
std::set <int> s;
void force(int c, int cnt)
{
c *= 10;
if (c > n && abs(c - n) > min)
return ;
std::set<int>::iterator iter = s.begin();
while (iter != s.end())
{
int t = c + *iter;
... | ALGO | 0.999911 | 3.407118 | {
"github_metadata": {
"branch": "master",
"commit_count": 796,
"repo_created_at": "2022-06-26T08:54:05.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "12bbcef2... |
ea7bfad4-dce9-4e42-ae02-29b16e41bbb5 | SIMRANRAINA2023a1r065/Simran-Raina-2023A1R065-Cpp-Lab | 16AprilDiamondProblem.cpp | /* In hybrid inheritance,
when we access parent class function from child class object due to multiple path,
compiler raise a error known as Ambigious Function Error
or
Diamond Problem.
To solve this error, we have 2 different methods:
1.Scope Resolution Operator ::
2. Virtual Inheritance */
#include<iostream>
using n... | TOOL | 0.903244 | 5.68938 | {
"github_metadata": {
"branch": "main",
"commit_count": 55,
"repo_created_at": "2025-03-03T04:35: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": "f7565a651fa... |
21ac2157-4c64-4b41-bbaa-b5d61d9a1dc9 | DimaTomsk/3d-renderer | lib/include/matrix.hpp | #pragma once
#include <array>
namespace Renderer {
template <typename T>
struct Vec3DT {
T x{};
T y{};
T z{};
Vec3DT operator+(const Vec3DT& other) const {
return {x + other.x, y + other.y, z + other.z};
}
Vec3DT operator-() const { return {-x, -y, -z}; }
};
using Vec3D = Vec3DT<double>;
using Vec... | TOOL | 0.900835 | 5.98651 | {
"github_metadata": {
"branch": "master",
"commit_count": 4,
"repo_created_at": "2025-04-01T10:14: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": "5b71c4f5ba... |
0d28b296-1e9a-4355-8384-42ab0f0bf12d | murphypei/linux-cpp-sweety | aes/aes.cpp | #include "aes.hpp"
#include <cstring>
#include <cstdlib>
#include <stdexcept>
#include <iostream>
using namespace bigo::ml::bvt;
using namespace std;
constexpr unsigned char AESCipher::AES_SBOX[16 * 16];
constexpr unsigned char AESCipher::AES_INV_SBOX[16 * 16];
constexpr unsigned char AESCipher::AES_RCON[11 * 4];
... | ALGO | 0.986007 | 5.680168 | {
"github_metadata": {
"branch": "master",
"commit_count": 80,
"repo_created_at": "2016-11-13T12:54:06.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "98b5b3cc4... |
cfd5d28f-6c69-4368-bf0e-551485b194d3 | keiakihito/Double_BFBCG_Comparison | CUDA_BFBCG/include/functions/cuSPARSE_util.h | #ifndef CUSPARSE_UTIL_H
#define CUSPARSE_UTIL_H
#include <iostream>
#include <cuda_runtime.h>
#include <cusparse.h>
#include <cstdlib>
#include <cmath>
#include <sys/time.h>
#include "helper.h"
//Input: const CSRMatrix &csrMtx, double *dnsMtxB_d, int numClmB, double * dnxMtxC_d
//Process: Matrix Multiplication Spa... | TOOL | 0.998042 | 4.801241 | {
"github_metadata": {
"branch": "main",
"commit_count": 29,
"repo_created_at": "2024-07-11T22:54:06.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "ddecdb4c9b9... |
2da378e4-2c95-4810-8570-38f7027c0305 | Tai-Yaki/AtCoder | 157/c.cpp | #include <iostream>
#include <iomanip>
#include <string>
#include <unordered_map>
#include <cmath>
#include <algorithm>
typedef long long ll;
typedef long double ld;
using namespace std;
int main()
{
int n, m, s[5], c[5], ans[3];
cin >> n >> m;
for (int i = 0; i < n; i++) ans[i] = -1;
for (int i = 0; i < m... | ALGO | 0.999948 | 3.241791 | {
"github_metadata": {
"branch": "master",
"commit_count": 111,
"repo_created_at": "2020-05-29T06:26: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": "630ac4af... |
e197f3a1-0186-4b0d-82d7-580084c23bdb | Avadh09/C- | Words/Constitution.cpp | //SAMPLE
/**
* Assignment 11. STL Vector and Map
*
* Construct a concordance with an STL vector and an STL map.
* Time word insertion and search operations.
*
* Author: <NAME>
* Department of Computer Engineering
* San Jose State University
*/
#include <iostream>
#include <fstream>
#include <... | TEST | 0.979013 | 5.92872 | {
"github_metadata": {
"branch": "master",
"commit_count": 14,
"repo_created_at": "2017-09-20T06:27: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": "2368cce61... |
6efd47c2-572b-4727-84ba-6c999217a98a | Dxuian/DSA | self/smc.cpp | #include <bits/stdc++.h>
using namespace std;
void re(vector<string> &A, int p, string &b);
string solution(vector<string> &A)
{
string b = "";
re(A, 0, b);
return b;
}
void re(vector<string> &A, int p, string &b)
{
if (p == A.size())
{
return;
}
if (p == 0)
{
b += "1";
... | ALGO | 0.999991 | 4.201973 | {
"github_metadata": {
"branch": "main",
"commit_count": 12,
"repo_created_at": "2023-06-16T20:08:07.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "a939b758da5... |
9b955e66-ced5-47c5-a273-03a2f9f11c4e | KhawYewOnn/binary-search | src/cache_heap_search.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include "binary_search.h"
using namespace std;
//definitely need to learn make_file soon...
/*
* only works for cache_height = 3, size = 63
*/
bool check_correctness(const vector<int>& other) {
vector<int> base {0, 1, 2, 3, 4, 5, 6, 7, 8, 1... | ALGO | 0.999887 | 3.983897 | {
"github_metadata": {
"branch": "master",
"commit_count": 14,
"repo_created_at": "2018-10-22T18:36:27.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "a25299e19... |
2254fd47-7509-4fe4-8398-91786a38dba1 | Keshav1707/Submissions | D_Paint_the_Tree.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define di(x) \
ll x; \
cin >> x
#define vecll vector<ll>
#define pb push_back
#define po pop_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el << endl;
#define PI 3.14159265359
type... | ALGO | 0.999712 | 4.882128 | {
"github_metadata": {
"branch": "master",
"commit_count": 1,
"repo_created_at": "2024-04-06T11:54:05.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "51b06fd221... |
9c6bf8f6-c85e-4e0a-a380-1da6851636cd | MarcioAntusa/Beecrowd-Solutions | C++/2582.cpp | #include <iostream>
using namespace std;
int main()
{
int n, sum, x, y;
cin >> n;
while (n--)
{
cin >> x >> y;
sum = x + y;
if (sum == 0) {
cout << "PROXYCITY" << endl;
}
else if (sum == 1) {
cout << "P.Y.N.G." << endl;
}
... | ALGO | 0.997756 | 3.232393 | {
"github_metadata": {
"branch": "main",
"commit_count": 5,
"repo_created_at": "2022-05-03T01:46: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": "312d8785e00a... |
eeb33824-74b7-4fdd-afc4-c6b336f30bf9 | AdityaShekharTiwary/codeforces | worms.cpp | #include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#define ll long long int
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define nline "\n"
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<": "; _print(x); cerr << endl;
#else
#define debug(x);
#endif
void _print(l... | ALGO | 0.999758 | 4.462108 | {
"github_metadata": {
"branch": "main",
"commit_count": 319,
"repo_created_at": "2020-11-01T11:49:19.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 1,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "d43086b69a... |
db81bf84-d01c-4ac2-9dd6-4f24d6246fc3 | RhoNit/heap | sort-a-k-sorted-array.cpp | #include <bits/stdc++.h>
using namespace std;
void sortKsorted(vector<int> &v, int n, int k) {
priority_queue<int, vector<int>, greater<int>> pq;
int x = 0;
for(int i = 0; i < v.size(); i++) {
if(pq.size() <= k) {
pq.push(v[i]);
}
else {
v[x] = pq.top();... | ALGO | 0.999972 | 4.70051 | {
"github_metadata": {
"branch": "master",
"commit_count": 25,
"repo_created_at": "2022-07-27T04:56: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": "d16c57326... |
06ac9332-141b-4c90-b300-0f2bfaf54078 | shahidafridi-swe/BasicDataStructures | Module_21/convert_array_to_BST.cpp | #include <bits/stdc++.h>
using namespace std;
class Node
{
public:
int val;
Node *left;
Node *right;
Node(int val)
{
this->val = val;
this->left = NULL;
this->right = NULL;
}
};
void levelOrderPrint(Node *root)
{
queue<Node *> q;
q.push(root);
while (!q.empt... | ALGO | 0.999984 | 5.545909 | {
"github_metadata": {
"branch": "main",
"commit_count": 29,
"repo_created_at": "2023-12-20T08:32:08.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "4acb1b218ff... |
a8f4998b-a6a2-44bf-8146-da75003e943e | JonathanCollaud/dgp2017-group1 | dgp2016-exercise9/implicit_fairing/mesh_processing.h | //=============================================================================
//
// Code framework for the lecture
//
// "Digital 3D Geometry Processing"
//
// <NAME>, <NAME>
//
// Copyright (C) 2016 by Computer Graphics and Geometry Laboratory,
// EPF Lausanne
//
//-----------------------------------... | ALGO | 0.943546 | 4.807443 | {
"github_metadata": {
"branch": "master",
"commit_count": 66,
"repo_created_at": "2017-10-06T12:29: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": "e5c22c43d... |
ee469f0b-1576-47d6-9d7a-4130cc028fe9 | MartijnTerpstra/mst | mst/mx_math_quaternion.inl | //////////////////////////////////////////////////////////////////////////////////////////////
// //
// MST Utility Library //
// Copyright (c)2025 <NAME> ... | TOOL | 0.979162 | 6.066103 | {
"github_metadata": {
"branch": "main",
"commit_count": 250,
"repo_created_at": "2020-10-16T20:47:27.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 1,
"pull_requests": 0
},
"file_meta": {
"content_id": "dd61d82dc4... |
25bf7733-dbca-4c2b-97a2-e3f631c921ac | PetreCatalin/Concursuri-Programare-Competitiva | Alte concursuri/fbcookingthebooks/main.cpp | #include <fstream>
#include <cstring>
using namespace std;
long t,i,nr,j,a[15],aux,r,minim,poz,poz1,b[15],maxim,ok;
char s[15];
int main()
{
ifstream f("input.in");
ofstream g("output.out");
f>>t;
for (r=1;r<=t;++r) {
f>>s;
nr=strlen(s);
for (j=0;j<=nr-1;++j) {
a[... | ALGO | 0.99991 | 3.191388 | {
"github_metadata": {
"branch": "master",
"commit_count": 8,
"repo_created_at": "2017-05-30T11:37:45.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "4384a819fe... |
99b7d2e8-fc5f-454d-9815-b986c001e743 | Amphxros/EDA | 12 Uvas/02 Media Prometida/02_MediaPrometida.cpp | // <NAME>
#include <iostream>
#include <vector>
// O(n)
int resolver(const std::vector<int>& v, const int& media) {
int suma=0;
int ult=11;
for(int i=0;i<v.size();i++){
suma+=v[i];
}
ult= (media* (v.size() + 1) - suma);
return ult;
}
// Resuelve un caso de prueba, le... | ALGO | 0.999925 | 4.638859 | {
"github_metadata": {
"branch": "main",
"commit_count": 89,
"repo_created_at": "2021-08-05T12:55:41.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 7,
"pull_requests": 0
},
"file_meta": {
"content_id": "eb516bfa2cd... |
9785a992-1340-40e2-af9c-127bb12bfba4 | RobotLocomotion/drake | math/continuous_algebraic_riccati_equation.cc | #include "drake/math/continuous_algebraic_riccati_equation.h"
#include <optional>
#include "drake/common/drake_assert.h"
#include "drake/common/is_approx_equal_abstol.h"
#include "drake/systems/primitives/linear_system_internal.h"
namespace drake {
namespace math {
Eigen::MatrixXd ContinuousAlgebraicRiccatiEquation... | ALGO | 0.99991 | 7.632078 | {
"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":... |
c8ff1c74-8c4a-4762-95e7-73752a5aba6e | TanvirDeol/Competitive-Programming | CCC/DMOPC '18 C3 P2.cpp | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define getInd(s) find(tones.begin(), tones.end(), s) - tones.begin()
vector<string> tones;
int calc(int n, int m) {
if (m < n) {
return m + tones.size() - n;
}
else {
return abs(n - m);
}
}
int main() {
tones.push_back("A");
tones.push_back("... | ALGO | 0.999847 | 3.825838 | {
"github_metadata": {
"branch": "master",
"commit_count": 175,
"repo_created_at": "2020-03-03T23:00:47.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "16e5a178... |
e4ce082c-7fa3-4a50-8718-55dd67cbff7d | CivilNet/video_nonlocal_net_caffe2 | third_party/ComputeLibrary/arm_compute/core/NEON/kernels/assembly/kernels/a64_gemm_s8_12x8/a55r1.hpp | /*
* Copyright (c) 2017 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
* rights ... | ALGO | 0.962918 | 5.264771 | {
"github_metadata": {
"branch": "master",
"commit_count": 5,
"repo_created_at": "2018-08-16T12:32:00.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 11,
"forks": 7,
"issues": 0,
"pull_requests": 1
},
"file_meta": {
"content_id": "e2cac14dda... |
f12dde7d-b8e4-41bd-a994-2c7e000dd38a | jinnatul/problemSolving | src/LightOJ/0 Lightoj/lightoj 1231 - Coin Change (I).cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int dp[55][1005];
int coins[55], cointsvalue[55], n, k;
ll call (int pos, int sum) {
if(sum == k) return 1;
if(pos == n) return 0;
if (dp[pos][sum] != -1) return dp[pos][sum];
int modd = 100000007;
ll cnt = 0;
for (int i = ... | ALGO | 0.999942 | 4.077684 | {
"github_metadata": {
"branch": "master",
"commit_count": 521,
"repo_created_at": "2018-08-06T22:11:03.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 3,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "46376f6a... |
d2aaca10-2b7c-48fa-bf11-462441d66b8e | OpenSees/OpenSees | SRC/reliability/analysis/analysis/MultiDimVisPrincPlane.h | /* ****************************************************************** **
** OpenSees - Open System for Earthquake Engineering Simulation **
** Pacific Earthquake Engineering Research Center **
** **
** ... | ALGO | 0.904616 | 5.917922 | {
"github_metadata": {
"branch": "master",
"commit_count": 8721,
"repo_created_at": "2018-09-12T00:49:34.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 667,
"forks": 719,
"issues": 42,
"pull_requests": 23
},
"file_meta": {
"content_id": "ae... |
4618c3c0-9913-4f20-8a18-878ccab5f96c | VermaSamarth/CodeHelp-DSA | Dynamic Programming/PaintingFence.cpp | #include<iostream>
#include<vector>
using namespace std;
// Recusive Solution
int PaintFenceRecursion(int n, int k){
if(n == 1)
return k;
if(n == 2)
return k * k;
return (PaintFenceRecursion(n-1, k) + PaintFenceRecursion(n - 2, k)) * (k - 1);
}
// Top Down Dynamic Programming Solution
int ... | ALGO | 0.999984 | 5.184855 | {
"github_metadata": {
"branch": "main",
"commit_count": 219,
"repo_created_at": "2023-02-04T20:37:27.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "a8fb3e556b... |
5444214c-1d5b-427c-b631-fb2801d6f543 | yhwang1990/minimum-coresets | ANN/coreset/coreset.cpp | #include <stdlib.h>
#include <assert.h>
#include <time.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <boost/numeric/ublas/matrix.hpp>
#include "../Point.h"
#include "../ANN.h"
#include "../RMSUtils.h"
#include "../IOUtil.h"
using namespace std;
vector<Point> validDirs;
vector<do... | ALGO | 0.998063 | 5.026598 | {
"github_metadata": {
"branch": "main",
"commit_count": 76,
"repo_created_at": "2020-11-18T11:42: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": "f6e5a3f05a8... |
05577b25-cc00-4b36-8fdd-130ce6ff0b61 | PaddlePaddle/Paddle | paddle/cinn/optim/merge_block_utils.cc | // Copyright (c) 2024 PaddlePaddle Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required... | ALGO | 0.997189 | 6.981982 | {
"github_metadata": {
"branch": "develop",
"commit_count": 54743,
"repo_created_at": "2016-08-15T06:59:08.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 23037,
"forks": 5770,
"issues": 1009,
"pull_requests": 823
},
"file_meta": {
"content_... |
e3f4f8f8-56bf-44dc-a3da-2438e50e599a | japawBlob/codes | ALG/ALG_5/barunka.cpp | #include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <iostream>
#include <cmath>
#define COUNT 6
using namespace std;
int number_of_operands = 0;
int all_consolidations = 0;
int loaded_num = 0;
int depth_after = 0;
int all_elements = 0;
int x = -1;
typedef struct node
{
int value = 0;
struct no... | ALGO | 0.99988 | 3.536828 | {
"github_metadata": {
"branch": "main",
"commit_count": 50,
"repo_created_at": "2020-11-11T17:04:14.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 2,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "1f9089d321a... |
4c42bd21-f25d-46be-9677-9def1c17534c | bugoutianzhen123/DataStruct | esp14/work.cpp | #include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
Node *next;
};
Node *GetCircle(Node *node)
{
Node *p1 = node, *p2 = node;
while (p1 && p2->next)
{
p1 = p1->next;
p2 = p2->next->next;
if (p1 == p2)
{
p1 = node;
while (p1 ... | ALGO | 0.999773 | 3.776848 | {
"github_metadata": {
"branch": "master",
"commit_count": 6,
"repo_created_at": "2024-10-10T12:24: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": "bc45201f27... |
b309c301-5af2-4045-aaa9-7731a4665e66 | hqztrue/ponyai | common/utils/strings/utils.h | // Copyright @2018 Pony AI Inc. All rights reserved.
#pragma once
#include <algorithm>
#include <memory>
#include <string>
#include "common/utils/strings/string_view.h"
namespace strings {
bool StartWith(StringView full_string, StringView search_string);
bool EndWith(StringView full_string, StringView search_strin... | TOOL | 0.942204 | 7.406799 | {
"github_metadata": {
"branch": "master",
"commit_count": 168,
"repo_created_at": "2018-03-08T07:51:24.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 5,
"forks": 4,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "66feef82... |
66c498fe-9810-4e7c-a62e-dfc2606a5cb3 | Hunterdii/GeeksforGeeks-POTD | April 2024 GFG SOLUTION/April-25.cpp | //{ Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution {
public:
int findMaxSum(int N, int M, std::vector<std::vector<int>>& Mat) {
if (N < 3 || M < 3) {
return -1;
}
... | ALGO | 0.999967 | 5.876024 | {
"github_metadata": {
"branch": "main",
"commit_count": 3732,
"repo_created_at": "2024-03-09T09:48:49.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 202,
"forks": 54,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "b7d0c5... |
f431d00e-fcc7-46dc-b871-d606128bdb53 | AhJo53589/leetcode-cn | problems/remove-k-digits/SOLUTION.cpp |
//////////////////////////////////////////////////////////////////////////
class Solution {
public:
string removeKdigits(string num, int k) {
if (num.size() == k) return "0";
while (k-- > 0) {
for (int i = 0; i < num.size(); i++) {
if (i != num.size() - 1 && num[i] <= nu... | ALGO | 0.999996 | 5.994861 | {
"github_metadata": {
"branch": "master",
"commit_count": 891,
"repo_created_at": "2019-04-22T05:43:11.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 252,
"forks": 39,
"issues": 1,
"pull_requests": 0
},
"file_meta": {
"content_id": "cfe76... |
4bb9f304-5f6c-473d-926a-c1db7edd061e | zekemyapp/AOC_2023 | day_02/day_02.cpp | #include <iostream>
#include <fstream>
#include <string>
using namespace std;
#define IS_SECOND_PART
struct sample {
int red;
int green;
int blue;
};
int getFullNumber(std::string str, size_t start)
{
size_t end = str.find_first_not_of("0123456789");
string result = str.substr(start, end - start);
return ato... | ALGO | 0.98872 | 4.452614 | {
"github_metadata": {
"branch": "main",
"commit_count": 34,
"repo_created_at": "2023-12-02T19:04: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": "1b1096e4703... |
179d28b1-789d-456a-95fd-8d43a7b1942a | wouterkool/attention-learn-to-route | problems/pctsp/PCTSP/PCPTSP/main.cpp | #include <iostream>
#include <vector>
#include <string>
#include <fstream>
#include <sstream>
#include <random>
#include <time.h>
#include <iterator>
#include <algorithm>
using namespace std;
struct Params {
vector<vector<unsigned int>> vertices;
vector<vector<unsigned int>> distanceMatrix;
vector<bool> visited;
... | ALGO | 0.999731 | 3.154733 | {
"github_metadata": {
"branch": "master",
"commit_count": 27,
"repo_created_at": "2018-03-22T16:43:08.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1240,
"forks": 360,
"issues": 29,
"pull_requests": 0
},
"file_meta": {
"content_id": "917... |
f914a0d6-dca4-4aaa-bb33-21af1c489b3f | hashiryo/Library | test/atcoder/abc256_f.DynSeg.test.cpp | // competitive-verifier: PROBLEM https://atcoder.jp/contests/abc256/tasks/abc256_f
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
// 双対 の verify
#include <iostream>
#include <array>
#include "src/Math/ModInt.hpp"
#include "src/DataStructure/SegmentTree_Dynamic.hpp"
using namespace std;
using Mint= Mo... | ALGO | 0.99898 | 5.28163 | {
"github_metadata": {
"branch": "master",
"commit_count": 2057,
"repo_created_at": "2020-03-25T09:12:48.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 2,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "75900a0... |
6bda0d57-2540-47f7-b9ac-85bc1f8d8b9d | JeffersonLab/chroma | lib/meas/hadron/barspinmat_w.cc | /*! \file
* \brief Baryon spin and projector matrices
*/
#include "chromabase.h"
#include "meas/hadron/barspinmat_w.h"
namespace Chroma
{
/*! \ingroup hadron */
namespace BaryonSpinMats
{
//! NR = (1/2)* ( 1 + g_4 )
SpinMatrix NR()
{
SpinMatrix g_one = 1.0;
return SpinMatrix(0.5 * (... | ALGO | 0.974274 | 5.113419 | {
"github_metadata": {
"branch": "master",
"commit_count": 12973,
"repo_created_at": "2013-08-13T18:20:39.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 65,
"forks": 55,
"issues": 1,
"pull_requests": 12
},
"file_meta": {
"content_id": "7c00... |
78fa10d7-439e-46ee-8c32-b677d5797e6c | tsudu214/AtC | ABC/c257.cpp | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <climits>
#include <vector>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <string>
#include <cstring>
#include <cmath>
#include <array>
#include <numeric>
#include <unorder... | ALGO | 0.999688 | 4.128685 | {
"github_metadata": {
"branch": "main",
"commit_count": 62,
"repo_created_at": "2021-08-06T23:12:02.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "7f7f3e5038d... |
e9f635f6-f4c3-4737-bfd6-1664a7498477 | xdtianyu/android-6.0.0_r1 | frameworks/av/include/media/stagefright/ClockEstimator.h | /*
**
** Copyright 2014, The Android Open Source Project
**
** Licensed under the Apache License, Version 2.0 (the "License");
** you may not use this file except in compliance with the License.
** You may obtain a copy of the License at
**
** http://www.apache.org/licenses/LICENSE-2.0
**
** Unless required by appl... | ALGO | 0.94578 | 7.58518 | {
"github_metadata": {
"branch": "master",
"commit_count": 9,
"repo_created_at": "2015-10-30T07:34:42.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 26,
"forks": 29,
"issues": 0,
"pull_requests": 1
},
"file_meta": {
"content_id": "a1cc0577... |
65792c5b-542e-4659-ad44-654c17da25fb | Charlyhash/LeetCode | 148. Sort List.cpp | /*
leetcode 148. Sort List
Sort a linked list in O(n log n) time using constant space complexity.
解题思路:将链表从中间分成两个链表，然后对每一个链表排序。
*/
#include "LeetCodeList.h"
#include <iostream>
#include <vector>
using namespace std;
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ... | ALGO | 0.999996 | 5.794649 | {
"github_metadata": {
"branch": "master",
"commit_count": 4,
"repo_created_at": "2016-03-29T03:34:28.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "05d5feb93a... |
f4a81dd8-61ce-4fa5-9cfb-b8886f7f65db | Ishaq-A/cpp-programming-projects | Section11Challenge/main.cpp | #include <iostream>
#include <vector>
using namespace std;
void display_menu();
char get_selection();
void print_numbers(const vector<int> numbers);
void add_numbers(vector<int> &numbers);
void calculate_mean(vector<int> &numbers);
void smallest_number(vector<int> &numbers);
void largest_number(vector<int> &numbers);... | TOOL | 0.996703 | 4.784725 | {
"github_metadata": {
"branch": "main",
"commit_count": 1,
"repo_created_at": "2024-10-12T15:12:56.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "6512fea7f629... |
37166af4-1096-409a-b421-5c50726fefb5 | Kyan820815/leetcode | lc03xx/lc0310.cpp | //--- Q: 0310. Minimum Height Trees
//--- method 1: dfs recursion, my version
class Solution {
public:
vector<int> findMinHeightTrees(int n, vector<vector<int>>& edges) {
if (!edges.size()) {
return {0};
}
queue<int> que;
vector<int> res, deg(n, 0);
vector<vector... | ALGO | 0.99999 | 5.933177 | {
"github_metadata": {
"branch": "main",
"commit_count": 137,
"repo_created_at": "2020-11-27T03:28:06.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "bb9aaec99c... |
0261e9a1-eee4-487e-99ca-ddeec8b1b0cf | CoderRaushan/CPP_programs_by_raushan_kumar | Data Structure/sorting/mergeSort.cpp | #include <bits/stdc++.h>
using namespace std;
void merge(vector<int> &v1, vector<int> &v2, vector<int>&ans, int n1, int n2)
{
int i = 0;
int j = 0;
int k = 0;
while (i < n1 && j < n2)
{
if (v1[i] <= v2[j])
{
ans[k] = v1[i];
i++;
k++;
}
... | ALGO | 0.999999 | 5.471938 | {
"github_metadata": {
"branch": "main",
"commit_count": 195,
"repo_created_at": "2023-10-04T18:36:50.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "28237fc022... |
bef5f97d-c73d-478c-b84d-5a93f7d59c8b | GauthamBanasandra/CompetitiveCoding | UVa/Graph/All pairs shortest paths/334/Identifying concurrent events.cpp | #include <ios>
#include <iostream>
#include <ostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
namespace uva_334 {
using Node = size_t;
class Scheduler {
public:
Scheduler(const std::vector<std::vector<std::string>> &sequences,
const std::... | ALGO | 0.999843 | 5.338412 | {
"github_metadata": {
"branch": "master",
"commit_count": 1007,
"repo_created_at": "2015-06-13T18:11:03.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 2,
"forks": 2,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "7100f66... |
1883bd80-4dca-4c81-9bd6-eabe67085b51 | kmjp/procon | srm/etc/2022_humble_final/SpecialSquare.cpp | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#defin... | ALGO | 0.99936 | 3.614697 | {
"github_metadata": {
"branch": "master",
"commit_count": 3966,
"repo_created_at": "2015-02-15T11:25:23.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 12,
"forks": 2,
"issues": 0,
"pull_requests": 2
},
"file_meta": {
"content_id": "58c857... |
3cf66a08-3ca1-4ad9-b6e5-8ba3762a3cbd | dholmes215/adventofcode-cpp | src/2021/day07.cpp | //
// Copyright (c) 2020-2021 <NAME> (dholmes at dholmes dot us)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
#include <aoc.hpp>
#include <aoc_range.hpp>
#include <cmath>
#include <vector>
namespace aoc:... | ALGO | 0.999891 | 5.44698 | {
"github_metadata": {
"branch": "main",
"commit_count": 319,
"repo_created_at": "2021-11-09T03:33:05.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 3,
"forks": 0,
"issues": 5,
"pull_requests": 0
},
"file_meta": {
"content_id": "535e4c7567... |
847eae6b-c606-4492-a8ed-f84e6d8ddd47 | lzxZz/dlagon | dlagon/src/http/http_request.cc | // Copyright 2018, lzxZz
// e-mail : <EMAIL>
// last modified in 2019.1.11
/*
对`http/request.h`的实现
*/
#include "http/http_request.h"
#include <string>
#include <sstream>
#include <unordered_map>
#include <vector>
#include <boost/algorithm/string.hpp>
#include "common/debug.h"
#include "http/header.h"
#include... | WEB | 0.902445 | 4.008845 | {
"github_metadata": {
"branch": "master",
"commit_count": 55,
"repo_created_at": "2018-11-01T05:33:20.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 10,
"forks": 2,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "000bee29... |
512e1191-ef4c-44a4-90b2-611170611a94 | alu3177/IA_Practica3 | lib/instancia.hpp | /*
* Inteligencia Artificial - Práctica 3: Problema de empaquetado unidimensional
*
* AUTOR: <NAME> (alu3177)
* EMAIL: <EMAIL>
* FECHA DE ENTREGA: 22 - 11 -12
*
* Se incluye repositorio GIT con el desarrollo de la práctica.
*
* Enunciado del problema:
* Se dispone de una cantidad indeterminada de contene... | ALGO | 0.997653 | 5.03556 | {
"github_metadata": {
"branch": "master",
"commit_count": 23,
"repo_created_at": "2012-12-03T21:57:21.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "90f2441bd... |
87b7aaa4-22ac-4e0e-9106-15dceaf9c204 | rhythmrx9/CS50- | C++/checknumpalindrome.cpp | #include <iostream>
using namespace std;
// A Palindrome number is a number that reads the same backwards as forwards
int main()
{
int n, num, digit, rev = 0;
cout << "Enter a positive number: ";
cin >> num;
n = num;
do
{
digit = num % 10;
rev = (rev * 10) + digit;
... | ALGO | 0.994672 | 3.867102 | {
"github_metadata": {
"branch": "master",
"commit_count": 323,
"repo_created_at": "2021-10-03T12:46: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": "51d5e2b5... |
f53ec631-3185-41b2-97bd-b2d8468d7cf3 | nanmenkaimak/ADS-2022 | labs/lab10/c.cpp | #include <bits/stdc++.h>
using namespace std;
int visit[10000] = {false};
map<int,int> mp;
queue <int> q;
vector<int> res;
void bfs(int a, int b) {
visit[a] = true;
mp[a] = -1;
q.push(a);
while(!q.empty()) {
int t = q.front();
q.pop();
if(t == b)
break;
i... | ALGO | 0.999984 | 3.78307 | {
"github_metadata": {
"branch": "main",
"commit_count": 15,
"repo_created_at": "2022-09-10T10:15: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": "e4e8e349fd4... |
96de6b50-b9dd-4028-965a-af9639274f2d | noahc66260/C-PrimerPlus | Chapter7/pe7-5.cpp | // pe7-5.cpp -- calculates the factorial of a number using a recursive function
// This is exercise 5 of chapter 7 in C++ Primer Plus by <NAME>
#include<iostream>
unsigned long int factorial(unsigned int n);
int main(void)
{
using namespace std;
cout << "Enter a number: ";
unsigned int number;
// I've chosen t... | ALGO | 0.999821 | 4.595482 | {
"github_metadata": {
"branch": "master",
"commit_count": 6,
"repo_created_at": "2014-10-04T20:06:59.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 79,
"forks": 45,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "bda24387... |
575195db-2aa3-4ccc-b5ff-4f44bdcdefeb | Kirill-Gorev/my_projects | C++/P01/solution/matrix.hpp | #include <iostream>
struct List{
List(double value, size_t n);
double a;
size_t n_pillars;
List *next, *prev;
};
double const E = 0.000000001;
double const Znach = 0;
class StringMatrix{
List *string;
void delete_List();
public:
StringMatrix();
double& operator [] (size_t k);
doub... | TOOL | 0.951109 | 3.521483 | {
"github_metadata": {
"branch": "main",
"commit_count": 1,
"repo_created_at": "2021-12-21T18:32:07.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "40555053ae07... |
7b3dcac1-0c68-4d58-b43c-777b6d877676 | opengm/opengm | include/opengm/inference/auxiliary/minstcutibfs.hxx | #pragma once
#ifndef OPENGM_MINSTCUTIBFS_HXX
#define OPENGM_MINSTCUTIBFS_HXX
#include <queue>
#include <cassert>
#include "ibfs.h"
namespace opengm {
namespace external {
/// \brief IBFS solver for the min st-cut framework GraphCut
template<class NType, class VType>
class MinSTCutIBFS{
public:
... | ALGO | 0.979858 | 3.987933 | {
"github_metadata": {
"branch": "master",
"commit_count": 2107,
"repo_created_at": "2012-06-01T11:37:44.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 421,
"forks": 153,
"issues": 58,
"pull_requests": 9
},
"file_meta": {
"content_id": "52... |
d85154af-2326-4cf8-9ce7-2dc73e55f14d | djayy035/dj035_PS | Baekjoon/28215.cpp | #include <bits/stdc++.h>
#define ll long long
#define MEM 70
#define x first
#define y second
#define sz size()
#define pb push_back
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef pair<ll, ll> pi;
const ll INF = 4e18;
const ll MOD = 1e4;
ll gcd(ll a, ll b)
{
if (a % b)
return gcd(b, a % ... | ALGO | 0.999978 | 3.373368 | {
"github_metadata": {
"branch": "main",
"commit_count": 132,
"repo_created_at": "2021-02-10T14:00:51.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "b9dd8a6a68... |
e3ee4cac-5a83-4b67-b011-f425abea2155 | kant9612/library | 301~400/377/C.cpp | #include <iostream>
#include <set>
#include <vector>
#include <utility>
using namespace std;
const int dx[8] = {2, 1, -1, -2, -2, -1, 1, 2};
const int dy[8] = {1, 2, 2, 1, -1, -2, -2, -1};
int main() {
long long N;
int M;
cin >> N >> M;
set<pair<int, int>> occupied;
set<pair<int, int>> threa... | ALGO | 0.999854 | 4.238679 | {
"github_metadata": {
"branch": "master",
"commit_count": 110,
"repo_created_at": "2024-09-29T10:10:24.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 6,
"pull_requests": 0
},
"file_meta": {
"content_id": "965c5a2f... |
18f57e08-97a5-4391-803e-dad64e2b9c79 | AdrianH1/CodewarsCPP | BuildTower/BuildTower/main.cpp | #include <iostream>
#include <vector>
#include <string>
class Kata
{
public:
std::vector<std::string> towerBuilder(int nFloors)
{
int lvl = 1;
int base = nFloors + (nFloors - 1);
int stars = 1;
int empty = base - 1;
std::string floor;
std::vector<std::string> tow... | ALGO | 0.999281 | 5.85823 | {
"github_metadata": {
"branch": "master",
"commit_count": 46,
"repo_created_at": "2022-01-14T14:27:04.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "d8eb6864f... |
dd3db18a-e7f5-4ece-99be-5bb003b3ffc1 | gautamaggarwaldev/Dynamic-Programming | 56_MatrixChainMultiplicationByRecursion.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution
{
public:
int mcm(vector<int> &arr, int i, int j)
{
if (i >= j)
{
return 0;
}
int mn = INT_MAX;
for (int k = i; k <= j - 1; k++)
{
// arr[i-1] * arr[k] * arr[j] is th... | ALGO | 0.999948 | 4.558802 | {
"github_metadata": {
"branch": "main",
"commit_count": 89,
"repo_created_at": "2025-07-04T11:55:08.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "d0220e08b8f... |
dd625136-680a-441c-9ce4-5bca5902552c | ishandutta2007/codeforces-k | kostroma/normal/790/C.cpp | #pragma comment(linker, "/STACK:1024000000")
#define _CRT_SECURE_NO_WARNINGS
#undef NDEBUG
//#include "testlib.h"
#include <cstdio>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <memory.h>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <bitset>
#includ... | ALGO | 0.999771 | 3.493889 | {
"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": "95a736f64b7f... |
5606c9b7-b1e3-4829-8f55-587e617cc967 | UET-2425HK2-INT2210-01/PhucTH | Answers/Lect6_Assignments_MinHeap.cpp | /******************************************************************************
Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, PHP, Ruby,
C#, OCaml, VB, Perl, Swift, Prolog, Javascript, Pascal, COBOL, HTML, CSS, JS
Code, Compile, Run and Debug online from anywhere ... | ALGO | 0.999697 | 4.966155 | {
"github_metadata": {
"branch": "main",
"commit_count": 17,
"repo_created_at": "2025-02-21T12:47:01.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 0,
"forks": 1,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "6c5741d46fb4... |
161c26f6-ed4a-4287-99ca-a90b0eceaeb7 | reddy-lab-code-research/MuST-CoST | data/transcoder_evaluation_gfg/cpp/LOWER_INSERTION_POINT.cpp | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include... | ALGO | 0.998868 | 5.169886 | {
"github_metadata": {
"branch": "main",
"commit_count": 30,
"repo_created_at": "2022-02-08T19:28:59.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 11,
"forks": 5,
"issues": 1,
"pull_requests": 0
},
"file_meta": {
"content_id": "f0e2b6e763e... |
82f64f93-9fa4-4826-aacc-46004138b653 | KastnerRG/pp4fpgas | labs/project4/HLS/0_Initial/fft.cpp | /*
This is traditional 2-radix DIT FFT algorithm implementation.
It is based on conventional 3-loop structure.
INPUT:
In_R, In_I[]: Real and Imag parts of Complex signal
OUTPUT:
In_R, In_I[]: Real and Imag parts of Complex signal
*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "fft.h"
void f... | ALGO | 0.999987 | 5.409583 | {
"github_metadata": {
"branch": "master",
"commit_count": 126,
"repo_created_at": "2018-05-09T17:03:03.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 846,
"forks": 151,
"issues": 4,
"pull_requests": 1
},
"file_meta": {
"content_id": "3c442... |
90616cc8-a787-420e-8bd1-3e98395629b0 | amalp12/MyLibrary | C++/C++ STL Demo/ArrayDivisionAmal.cpp | #include <iostream>
#include <vector>
using namespace std;
typedef vector<long long> vl ;
typedef long long ll;
//Failed code
int main()
{
ll n, sum=0, temp=0, index;
cin >> n;
vl a(n);
for(int i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
if (sum%2!=0)
{
cout <<"N... | ALGO | 0.999989 | 3.478537 | {
"github_metadata": {
"branch": "master",
"commit_count": 75,
"repo_created_at": "2020-07-03T10:05: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": "8e29a59aa... |
e0d80366-fda5-4dd0-8686-e72706d2122d | Gwzlchn/Solutions | leetcode/409.最长回文串.cpp | /*
* @lc app=leetcode.cn id=409 lang=cpp
*
* [409] 最长回文串
*
* https://leetcode-cn.com/problems/longest-palindrome/description/
*
* algorithms
* Easy (52.13%)
* Likes: 126
* Dislikes: 0
* Total Accepted: 26.3K
* Total Submissions: 49K
* Testcase Example: '"abccccdd"'
*
* 给定一个包含大写字母和小写字母的字符串，找到通过这些字母... | ALGO | 0.99974 | 5.978294 | {
"github_metadata": {
"branch": "master",
"commit_count": 314,
"repo_created_at": "2019-07-04T07:35:03.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "387b2692... |
daa697b8-c41a-45e1-b192-335d1bd01bda | yangfengzzz/DigitalFundamental | src.tracing/sphere.cpp | //
// sphere.cpp
// src.common
//
// Created by 杨丰 on 2020/11/2.
//
#include "sphere.h"
#include "onb.h"
#include "pdf.h"
double sphere::pdf_value(const point3& o, const vec3& v) const {
hit_record rec;
if (!this->hit(ray(o, v), 0.001, infinity, rec))
return 0;
auto cos_theta_max = sqrt(1 ... | ALGO | 0.980389 | 6.510829 | {
"github_metadata": {
"branch": "main",
"commit_count": 18,
"repo_created_at": "2020-11-10T07:13:35.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "322687d1f8b... |
b9d05561-337b-4582-8f2c-a2dbdb1504f9 | darkv314/CompetitiveProgrammingBackup | Usaco/usacoJudge/fence_painting/usaco_fence_painting.cpp | #include <bits/stdc++.h>
#define fori(x, y) for (int i = x; i < y; i++)
#define forj(x, y) for (int j = x; j < y; j++)
#define input freopen("paint.in", "r", stdin)
#define output freopen("paint.out", "w", stdout)
#define pb push_back
#define mk make_pair
#define ll long long
#define INF 1000000000
using namespace std... | ALGO | 0.999986 | 3.977881 | {
"github_metadata": {
"branch": "master",
"commit_count": 12,
"repo_created_at": "2023-05-11T09:19:15.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "bc90c9015... |
2dad40d4-adee-432c-9516-9dd16b648131 | jingminglake/Leetcode | twoSumII/twoSumII.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
vector<int> res;
int left = 0, right = numbers.size() - 1;
while (left < right) {
int sum = numbers[left] + numbers[right];
if (... | ALGO | 0.999961 | 5.484807 | {
"github_metadata": {
"branch": "master",
"commit_count": 1483,
"repo_created_at": "2017-02-24T09:35:36.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 10,
"forks": 4,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "850874... |
5e0df3c0-14f3-4778-a4dd-c02764df3b2b | BackupTheBerlios/egmg-svn | branches/problem-branch/trunk/src/egmg/Stencil/HelmholtzLike2D2.cpp | /** \file HelmholtzLike2D2.cpp
* \author <NAME>
* \brief Contains the implementation of the class HelmholtzLike2D2
*/
#include "HelmholtzLike2D2.h"
namespace mg
{
PositionArray HelmholtzLike2D2::initJx_() const
{
const int t[]={0,-1,0,1,0};
return PositionArray(t,5);
}
PositionArray HelmholtzLike2D2::ini... | ALGO | 0.994376 | 4.694135 | {
"github_metadata": {
"branch": "master",
"commit_count": 205,
"repo_created_at": "2015-08-12T17:28: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": "78279a19... |
44cf5a2d-c3dc-479e-8696-163d0337313e | RoxaneC/M1-MATHS | Programmation_C++/TPsNotés/2018/gradient_descente/quartic.cpp |
#include "quartic.hpp"
#include "gradient.hpp"
#include "vect.hpp"
#include <iostream>
using namespace std;
// question 9 + CORRECTION
class G {
public:
G(){};
double operator()(const Vect<2> &v) const { return pow(v[0],4) + pow(v[1],4) - 2*v[0]*v[0] - 2*v[1]*v[1] + v[0] + v[1]; };
Vect<2> g... | ALGO | 0.999338 | 4.044881 | {
"github_metadata": {
"branch": "main",
"commit_count": 84,
"repo_created_at": "2024-01-15T18:33: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": "718dff5852f... |
9bd707a5-b8b4-4f5e-8e29-c6f0d8d98efc | dakshgupta2002/long-lines | 100DaysOfCode/try again/FailedToDo/NumberPairs.cpp | //<NAME>
//<NAME>
#include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x <<endl;
#define sum(a) accumulate(a.begin(), a.end(), 0);
#define fo(i, n) for (auto i = 0; i < n; i++)
#define foitr(it, l) for (auto it = l.begin(); it != l.end(); it++)
typedef long double ld;
typedef unsigned ... | ALGO | 0.999003 | 4.834502 | {
"github_metadata": {
"branch": "main",
"commit_count": 79,
"repo_created_at": "2021-07-11T17:51:14.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 1,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "27a66396d1c... |
9dd99c60-bce4-4108-87ca-865839d765ea | nolivafrvm/tdc_arduino | PWD_Pulse_Fan/PWD_Pulse_Fan.ino | // ---Teoría de control---
// ---Implementación de Pulse Width Modulation | modulación por ancho o de pulso---
#define FAN_PULSE 5 //Tacometro // GPIO5
#define FAN_CONTROL 4 //pwn Fan pin // GPIO 4
int rpm;
int count = 0;
unsigned long tiempo;
unsigned long start_time;
void setup(void)
{
Serial.begin(9600);
... | TOOL | 0.946594 | 5.208148 | {
"github_metadata": {
"branch": "main",
"commit_count": 6,
"repo_created_at": "2023-08-23T22:30: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": "61534cf3479d... |
3f88f32b-8e59-45a8-becb-353264141de8 | shubham0109/ALGO_IIITB_2019 | bst.cpp | #include <iostream>
#include <ctime>
using namespace std;
struct node{
int key;
node* par;
node *lc, *rc;
};
node* insertBST(node* root, node* parent, int num){
if (root == NULL){
node* newNode = new node();
newNode->key = num;
newNode->lc = NULL;
newNode->rc = NULL;
... | ALGO | 0.99994 | 4.718176 | {
"github_metadata": {
"branch": "master",
"commit_count": 3,
"repo_created_at": "2019-08-16T09:07:47.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "9a463a69e1... |
52e2358e-36bd-42c1-b778-549c29bd84f0 | Pluto00/leetcode | Algorithm/cpp/string/shifting-letters.cpp | /*
有一个由小写字母组成的字符串 S，和一个整数数组 shifts。
我们将字母表中的下一个字母称为原字母的 移位（由于字母表是环绕的， 'z' 将会变成 'a'）。
例如·，shift('a') = 'b'， shift('t') = 'u',， 以及 shift('z') = 'a'。
对于每个 shifts[i] = x ， 我们会将 S 中的前 i+1 个字母移位 x 次。
返回将所有这些移位都应用到 S 后最终得到的字符串。
示例：
输入：S = "abc", shifts = [3,5,9]
输出："rpl"
解释：
我们以 "abc" 开始。
将 S 中的第 1 个字母移位 3 次后，我们得到 "dbc... | ALGO | 0.999737 | 6.177313 | {
"github_metadata": {
"branch": "master",
"commit_count": 219,
"repo_created_at": "2019-12-22T23:43:49.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "555553ea... |
219f8ba8-0754-4f44-97b4-4867173299f9 | nvnamsss/leetcode | Find Missing Observations/main.cpp | /*
You have observations of n + m 6-sided dice rolls with each face numbered from 1 to 6. n of the observations went missing, and you only have the observations of m rolls. Fortunately, you have also calculated the average value of the n + m rolls.
You are given an integer array rolls of length m where rolls[i] is the... | ALGO | 0.999723 | 5.16025 | {
"github_metadata": {
"branch": "master",
"commit_count": 31,
"repo_created_at": "2020-04-21T13:05:50.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 5,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "4a156ae30... |
9779378f-9b16-471a-882d-ef996cb7515a | Kawser-nerd/CLCDSA | Source Codes/CodeJamData/12/52/19.cpp | #include <iostream>
#include <set>
#define SMAX 6000
#define MMAX 10000
#define TO_INDEX(x, y) ((x) * SMAX + (y))
#define TO_X(index) ((index) / SMAX)
#define TO_Y(index) ((index) % SMAX)
using namespace std;
int p[SMAX * SMAX];
bool b[SMAX * SMAX];
int movex[MMAX];
int movey[MMAX];
int parent(int i) {
return (... | ALGO | 0.999987 | 4.732648 | {
"github_metadata": {
"branch": "master",
"commit_count": 20,
"repo_created_at": "2019-09-30T05:38:13.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 22,
"forks": 8,
"issues": 1,
"pull_requests": 0
},
"file_meta": {
"content_id": "d3d78ebc... |
d116b6fc-b60c-4ad6-b0b7-ec8a02e53db9 | SnoopyCodes/code | gold/randomprac/2019jan/sleepycowsort.cpp | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#define rat order_of_key
#define at find_by_order
#define gset gp_hash_table
#define gmap gp_hash_table
using namespace __gnu_pbds;
template <class T>
using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_... | ALGO | 0.999997 | 3.892361 | {
"github_metadata": {
"branch": "main",
"commit_count": 264,
"repo_created_at": "2024-04-06T21:09:48.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "40910c9a1b... |
5a02e493-c915-4aa4-bf29-724e7362f0c2 | 16BitNarwhal/Competitive-Programming | dmoj/ac19p5.cpp | #include <bits/stdc++.h>
using namespace std;
const int MM = 2e3;
int N, mat[MM][MM], res[MM][MM], ans=0;
vector<vector<int>> adj = {{-1,0}, {1,0}, {0,-1}, {0,1}};
void dfs(int x, int y) {
if (res[x][y]) return;
for (vector<int> nxt : adj) {
int newx = x + nxt[0], newy = y + nxt[1];
if (newx<0 |... | ALGO | 0.999807 | 3.922245 | {
"github_metadata": {
"branch": "master",
"commit_count": 70,
"repo_created_at": "2023-12-22T00:17: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": "aac537b6e... |
599432fb-d68c-44d4-bd0e-4af689959f0a | Seeed-Studio/ArduinoCore-imxrt | tools/sdk/middleware/mcu-boot/tools/tools/elftosb/common/SB2Image.cpp | /*
* Copyright (c) 2008-2015 Freescale Semiconductor, Inc.
* Copyright 2016-2018 NXP
* All rights reserved.
*
* SPDX-License-Identifier: BSD-3-Clause
*/
#include "SB2Image.h"
#include <stdexcept>
#include <algorithm>
#include <time.h>
#include "crc.h"
#include "SHA1.h"
#include "Random.h"
#include "rijndael.h"
#... | TOOL | 0.960166 | 4.051964 | {
"github_metadata": {
"branch": "master",
"commit_count": 79,
"repo_created_at": "2019-08-01T01:41:59.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 14,
"forks": 7,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "67d82248b... |
e3b702de-4ea2-49b3-8f21-9543b0cad600 | deepakmehta/DSAlgoProblems | DistributeCandies.cxx | /*
Alice has n candies, where the ith candy is of type candyType[i].
Alice noticed that she started to gain weight, so she visited a doctor.
The doctor advised Alice to only eat n / 2 of the candies she has (n is always even).
Alice likes her candies very much, and she wants to eat the maximum number of different
type... | ALGO | 0.999169 | 5.798415 | {
"github_metadata": {
"branch": "main",
"commit_count": 28,
"repo_created_at": "2022-04-22T08:56:52.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "26feb3deaf9... |
2c32aebd-b4d2-4bc5-ba98-781d63995fed | sraihan73/Lucene- | core/src/java/org/apache/lucene/search/similarities/MultiSimilarity.cpp | using namespace std;
#include "MultiSimilarity.h"
namespace org::apache::lucene::search::similarities
{
using FieldInvertState = org::apache::lucene::index::FieldInvertState;
using LeafReaderContext = org::apache::lucene::index::LeafReaderContext;
using CollectionStatistics = org::apache::lucene::search::CollectionSt... | ALGO | 0.992438 | 6.19368 | {
"github_metadata": {
"branch": "master",
"commit_count": 3,
"repo_created_at": "2018-10-08T04:50:55.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 5,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "2df4b66720... |
d05b9b67-a71c-4a9b-8f2f-ff0c48da9ea7 | wqrqwerqrw/Lerica | lyd/0x14Hash/CH1401兔子与兔子.cpp | /************************************************
# @Author: miniLCT
# @DateTime: 2019-07-21 22:48:49
# @Description: 打好acm就能和cls一样天天吃小龙虾
***********************************************/
/*#include <bits/stdc++.h>
using namespace std;
#define eps 1e-8
#define close ios::sync_with_stdio(false); cin.tie(0);... | ALGO | 0.999954 | 3.755682 | {
"github_metadata": {
"branch": "master",
"commit_count": 5,
"repo_created_at": "2019-09-13T08:56: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": "ea211ae1fd... |
802f8fd6-3f83-4e65-b503-cdca41c3ae22 | apache/doris | be/src/vec/runtime/ipv4_value.h | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... | TOOL | 0.902075 | 6.587555 | {
"github_metadata": {
"branch": "master",
"commit_count": 26499,
"repo_created_at": "2017-08-10T12:13:30.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 13962,
"forks": 3497,
"issues": 2697,
"pull_requests": 616
},
"file_meta": {
"content_i... |
62383720-100e-463a-8baf-4e3fff9ec71b | Evan-Varan/Misc-Projects | Frequency Sort/Evan Code 5.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
vector<int> frequencySort(vector<int>& nums)
{
vector<int> frequencies;
vector<int> result;
int maxValue = INT_MIN;
int minValue = INT_MAX;
int maxFreq = INT_MIN;
... | ALGO | 0.999999 | 5.69503 | {
"github_metadata": {
"branch": "main",
"commit_count": 4,
"repo_created_at": "2024-08-07T21:20:03.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 1,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "18d697201b9b... |
ce2fe5c0-91d7-4eb5-8554-6495e2a69a74 | BogdanPecheritsa/Lab1algoritms | task3.cpp | #include <stdio.h>
int main() {
signed char a = 5;
signed char b = 127;
signed char c = 2;
signed char d = 3;
signed char e = -120;
signed char f = -34;
signed char g = -5;
signed char h = 56;
signed char i = 38;
printf("а) 5 + 127 = %hd\n", (short)(a + b));
printf("б) 2 - ... | TOOL | 0.935277 | 3.948533 | {
"github_metadata": {
"branch": "main",
"commit_count": 3,
"repo_created_at": "2024-02-27T07:08: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": "4b8af2697849... |
7fd455d1-7fa9-4fcd-82aa-5cb148407a4d | Bikranta3121/Placewit | array/begineer level i/pythagorean.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution{
public:
// Function to check if the
// Pythagorean triplet exists or not
bool checkTriplet(int arr[], int n) {
unordered_set<int> s;
for(int i=0;i<n;i++)
s.inser... | ALGO | 0.99977 | 5.596848 | {
"github_metadata": {
"branch": "main",
"commit_count": 146,
"repo_created_at": "2023-01-21T15:00:45.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "c03e3ef604... |
69b52197-b829-469a-83ee-0d47d5c6245b | InsightSoftwareConsortium/ITK | Modules/Filtering/CurvatureFlow/include/itkBinaryMinMaxCurvatureFlowFunction.h | /*=========================================================================
*
* Copyright NumFOCUS
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.o... | ALGO | 0.999121 | 7.831862 | {
"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": "7... |
e9361f84-d2aa-42d5-ade3-eb5c8570a83b | khangvobr5/bai_2-c-h-c-l-i- | Untitled3.cpp | #include <stdio.h>
int main() {
// Khai bao va khoi tao hai bien kieu so nguyen
int soThuNhat = 10;
int soThuHai = 20;
// Khai bao bien de luu ket qua
int tong = soThuNhat + soThuHai; // Tinh tong
int hieu = soThuNhat - soThuHai; // Tinh hieu
int tich = soThuNhat * soThuHai; // T... | ALGO | 0.991926 | 3.453441 | {
"github_metadata": {
"branch": "master",
"commit_count": 1,
"repo_created_at": "2025-04-22T03:27:06.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "c4f7db79a3... |
c344141e-b28c-4cec-bc4d-2641aef63b68 | wrenchwastaken/LeetCode | 0084-largest-rectangle-in-histogram/0084-largest-rectangle-in-histogram.cpp | class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
int n = heights.size();
int areaMax = 0;
stack<int> st;
//lets traverse through the array
for(int i=0;i<n;i++){
//if stack is not empty and the element on top is bigger than the next
... | ALGO | 0.999858 | 6.487581 | {
"github_metadata": {
"branch": "main",
"commit_count": 1179,
"repo_created_at": "2023-08-14T17:59: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": "cd2c6a252... |
8e7134f1-3be8-42b7-b66f-23eaae50b5ce | mikami-yua/c_leaarning_ch08 | 01函数模板.cpp | #include<iostream>
using namespace std;
//实现两个整型交换的函数
void swapInt(int& a, int& b) {
int temp = a;
a = b;
b = temp;
}
//实现两个浮点型交换的函数
void swapDouble(double& a, double& b) {
double temp = a;
a = b;
b = temp;
}
//函数模板
template<typename T>//声明一个模板，告诉编译器后面代码紧跟的T不要报错，T是通用数据类型
void mySway(T &a,T &b) {
T temp = a... | ALGO | 0.994152 | 4.313504 | {
"github_metadata": {
"branch": "master",
"commit_count": 9,
"repo_created_at": "2021-03-01T08:38:28.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "a851a6539f... |
4fad80f9-9783-4aff-9740-70f0b6c9622b | Vaa3D/vaa3d_tools | released_plugins/v3d_plugins/neurontracing_neutube/src_neutube/neurolabi/gui/zswcpositionadjuster.cpp | #include "zswcpositionadjuster.h"
#include "zvoxelarray.h"
#include "swctreenode.h"
#include "c_stack.h"
#include "tz_math.h"
#include "zstackgraph.h"
#include "neutubeconfig.h"
ZSwcPositionAdjuster::ZSwcPositionAdjuster() :
m_signal(NULL), m_mask(NULL), m_workspace(NULL),
m_background(NeuTube::IMAGE_BACKGROUND_DA... | TOOL | 0.931012 | 5.647746 | {
"github_metadata": {
"branch": "master",
"commit_count": 7983,
"repo_created_at": "2016-01-27T18:19:17.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 110,
"forks": 70,
"issues": 11,
"pull_requests": 12
},
"file_meta": {
"content_id": "5ab... |
38929263-8a91-4d24-b519-b39dd076eb6d | ChristopherRDZ/Competitive_Programming | Omegaup Problems/ConvertidorOMI2018.cpp | /// Problem Link: https://omegaup.com/arena/problem/OMI2018-Convertidor
/// OMI 2018
#include <iostream>
#include <math.h>
using namespace std;
int letras (char x){
int valor = x - 'A' + 1;
return valor;
}
char numeros (long long int n){
char letra = n + 'A' - 1;
return letra;
}
char respuesta[102... | ALGO | 0.999913 | 3.931146 | {
"github_metadata": {
"branch": "master",
"commit_count": 1,
"repo_created_at": "2022-10-31T02:13: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": "46e5fb2246... |
1a5bfec5-ad80-44bb-8005-bfb2bc65510c | sestys/alg_puzzles | adventOfCode/2020/14/part1.cpp | #include <vector>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
pair<int, uint64_t> parseLine(string &line, unordered_map<int, bool>& mask){
if (line[1] == 'a'){
line.erase(0, 7);
mask.clear();
for (int i = 0, n = line.size() - 1; i <= n; ++i){
... | ALGO | 0.995736 | 4.376237 | {
"github_metadata": {
"branch": "main",
"commit_count": 28,
"repo_created_at": "2020-10-02T09:27: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": "edb13128b57... |
74214fd6-4695-4cd6-96b0-9cb7790e0829 | duchenlong/Cpp | leetcode/平方矩阵 II.cpp | #include <iostream>
using namespace std;
const int N = 110;
int f[N][N],n;
void slove() {
for(int i = 1; i <= n; i++) {
int t = 1;
for(int j = i; j <= n; j++) f[i][j] = t++;
t = 1;
for(int j = i; j <= n; j++) f[j][i] = t++;
}
for(int i = 1; i <= n; i++) {
for(i... | ALGO | 0.999921 | 4.352612 | {
"github_metadata": {
"branch": "master",
"commit_count": 1006,
"repo_created_at": "2020-03-01T15:16:31.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 18,
"forks": 25,
"issues": 2,
"pull_requests": 0
},
"file_meta": {
"content_id": "38a9a... |
6f6acf85-9d6b-4187-b4b5-0f5c01fbf382 | jehlum11/Logos | Code for the games/GuessAllWords.cpp |
#include <iostream>
#include <fstream>
#include <string>
#include <list>
#include<cstdlib>
#include<ctime>
#include <vector>
#include <cctype>
#include <algorithm>
#include<stdlib.h>
using namespace std;
int main () {
srand(time(0));
int random = rand();
int min = 0;
int max = 370349;
//cout << ... | TOOL | 0.907214 | 3.167254 | {
"github_metadata": {
"branch": "master",
"commit_count": 17,
"repo_created_at": "2019-03-22T06:06: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": "90f0e7326... |
c6577932-fd30-4d34-9017-a342b39d4263 | mleotta/kwiver | vital/algo/compute_stereo_depth_map.h | /*ckwg +29
* Copyright 2017 by Kitware, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice,
* this list of... | ALGO | 0.969142 | 7.022617 | {
"github_metadata": {
"branch": "master",
"commit_count": 9310,
"repo_created_at": "2016-08-19T14:25:48.000Z",
"is_fork": true,
"is_org_owned": false,
"forked_from": "Kitware/kwiver",
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id... |
1e7701b8-bc81-4272-99c5-e348d0338b37 | sayfiyevs/finalproject | main.cpp | #include <iostream>
#include <windows.h>
using namespace std;
void printWelcome(){
cout << "===================\n| WELCOME |\n===================" << endl << endl;
}
int id_generator=101;
struct Users {
int id=id_generator;
string name;
int balance;
int loan=0;
};
Users users[100];
void Crea... | TOOL | 0.943568 | 3.90843 | {
"github_metadata": {
"branch": "master",
"commit_count": 3,
"repo_created_at": "2025-04-24T13:13:57.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "1c52c00fed... |
18237dd4-356f-4e03-a899-4233449b7c7b | IrishMan-5403/id5130_psc | Ass_1/Q3/a.cpp | #include<bits/stdc++.h>
#include <omp.h>
using namespace std;
void init_grid(double x_grid [], double y_grid [], double delta, int N, double x_min, double x_max, double y_min, double y_max){
x_grid[0] = x_min;
y_grid[0] = y_min;
for(int i = 1; i < N+1; i++){
x_grid[i] = x_grid[i-1] + delta;
... | ALGO | 0.999806 | 4.43595 | {
"github_metadata": {
"branch": "main",
"commit_count": 7,
"repo_created_at": "2024-05-03T12:33:59.000Z",
"is_fork": false,
"is_org_owned": false,
"forked_from": null,
"stars": 0,
"forks": 0,
"issues": 0,
"pull_requests": 0
},
"file_meta": {
"content_id": "7472d7cd6666... |
1c6616e2-7b38-491b-8099-53b6bc921cb0 | niananto/data-structures-and-algorithms-two-2-2 | offline-05 2022-01-19/1805093/separateChaining.h | #include"hashFunctions.h"
using namespace std;
bool insertItem(vector<list< pair<string, unsigned long> >> &table, string key, int N, unsigned long* collision){
int index = hashFunction(&key[0]) % N;
static unsigned long value = 1;
list< pair<string, unsigned long> > :: iterator itr;
for(itr=table... | ALGO | 0.999784 | 4.513944 | {
"github_metadata": {
"branch": "main",
"commit_count": 6,
"repo_created_at": "2022-05-18T17:35: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": "ed664ccde827... |
a85537d1-d5bc-4d10-8c1b-8e4f1322cd55 | miracl/MIRACL | source/dssver.cpp | /*
* Digital Signature Algorithm (DSA)
*
* See Communications ACM July 1992, Vol. 35 No. 7
* This new standard for digital signatures has been proposed by
* the American National Institute of Standards and Technology (NIST)
* under advisement from the National Security Agency (NSA).
*
* This progr... | ALGO | 0.969154 | 5.579414 | {
"github_metadata": {
"branch": "master",
"commit_count": 45,
"repo_created_at": "2012-11-06T01:20:49.000Z",
"is_fork": false,
"is_org_owned": true,
"forked_from": null,
"stars": 683,
"forks": 243,
"issues": 67,
"pull_requests": 12
},
"file_meta": {
"content_id": "53d5... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.