uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
ea570273-a86f-4a21-8f38-effc98939a19 | bintangshada/kuliah | tugas/123240247_Tugas4/tugas4Final.cpp | #include <iostream>
using namespace std;
string nama[5];
int nilai[5][4];
int rerata[5];
int tertinggi;
int terendah;
bool sudahAdaNilai;
bool sudahAdarataRata;
char ulang;
void inputMahasiswa();
int tinggi();
void lihatNilai();
int rataRata();
int rendah();
int main(){
int pilih;
do{
system("cls");
... | TOOL | 0.982433 | 3.967363 |
1ec77da3-c16b-45b0-859d-47fbdec4b2a9 | P79N6A/Codes-1 | 2015.9~2016.3/Rank of Tetris.cpp | #include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
const int INF = 0x7f7f7f7f;
const int MAXN = 1e4 + 111;
vector<int> G[MAXN];
int p[MAXN], in[MAXN], a[MAXN], b[MAXN];
char cmp[2 * MAXN];
int find(int x)
{
return x == p[x] ? x : p[x] = find(p[x]);
}
void unite(int x, int y)
{
x = find... | ALGO | 0.999933 | 4.158964 |
e365b16c-6d3c-4068-b7ae-add81f51b71a | visheshj2005/leetcode | Longest_Common_Prefix.cpp | class Solution {
public:
string longestCommonPrefix(vector<string>& arr) {
int min = arr[0].length();
int flag;
string ans = "";
int len = arr.size();
for(int i=0;i<len;i++){
if(arr[i].length()<min){
min = arr[i].length();
}
}
... | ALGO | 0.999929 | 5.512925 |
fe265b96-7879-4add-bc5d-910e466ba2fc | anuar2k/WDI-2019 | Kartkowki/2016-2017/K3_B_ZAD2.cpp | #include <iostream>
using namespace std;
struct node {
int val;
node *next;
};
int split(node *a, node *&b) {
while (a != nullptr) {
node *bTmp = b;
node *bTmpPrev = nullptr;
while (bTmp != nullptr) {
if (bTmp == a) {
int added = 0;
whi... | ALGO | 0.999166 | 4.254618 |
1c5e392f-e774-4408-8d71-3d7c898240bc | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_11735_6.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string x;
cin >> x;
for (char j = 'a'; j != 'z'; ++j) {
for (int i = 0; i < n && k > 0; ++i) {
if (j == x[i]) {
x[i] = '!';
k--;
}
}
if (k <= 0) break;
}
for (int i = 0; i < n; ++i) ... | ALGO | 0.999509 | 3.600753 |
7726230a-8f9a-4e27-845b-6720785e6fd4 | Noiri/Yukicoder_with_Cpp | level_1.5/No192_合成数.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
if(n%2 == 0) cout << n << endl;
else cout << n+1 << endl;
return 0;
} | ALGO | 0.998382 | 3.384173 |
a64d2a3a-7093-4c3d-ad35-b79d28076995 | ishandutta2007/codeforces | hehezhou/normal/1200/F.cpp | #include <bits/stdc++.h>
using namespace std;
const int mod = 2520;
int n;
int insta[1010][2530], ans[1010][2530];
int w[1010];
int dep[1010][2530];
int son[1010][12], len[1010];
int sta[2530000];
int cnt[1010];
inline int dfs(int x, int y) {
insta[x][y] = 1;
if(ans[x][y]) return ans[x][y];
sta[dep[x][y]] =... | ALGO | 0.999982 | 3.556486 |
6a733732-ae85-4bb6-a2b0-b7a6947ff14d | Leonezz/trivial | adapter/priority_queue.cpp | #include <functional>
#include <utility>
#include <vector>
namespace trivial {
template <typename T, typename Cont = std::vector<T>,
typename Cmp = std::less<T>>
class priority_queue {
Cont cont{};
Cmp cmp{};
private:
static void heapify(Cont& arr, size_t l, size_t r, Cmp cmp) {
using std::swap;
... | ALGO | 0.998842 | 5.770988 |
231c3c25-d4cc-4399-9633-f8f107fa273a | Akshit56/DSA-Practice | Recursion/reverseCount.cpp | #include<iostream>
using namespace std;
void reverseNumber(int n){
if(n==1){
cout<<1<<" ";
return; // return acts as a break statement here
}
cout<<n<<" ";
reverseNumber(n-1);
}
int main(){
int n;
cout<<"Enter a number : ";
cin>>n;
reverseNumber(n);
return 0;
} | ALGO | 0.999783 | 4.015987 |
4ec7c8f0-8fdf-445f-9c43-f845716f19d2 | kushagra414/100-Days-of-Code | KushagraShekhawat/Programs/Day 98/254. Maximum difference between node and its ancestor.cpp | // { Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// 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 = val;
temp->left = NULL;
temp->right = NULL;
... | ALGO | 0.998688 | 6.405542 |
4e1f55aa-62e1-485a-99b9-70f367d12043 | iuiou/Mtreefork | algorithm/inMTREE/global.cpp | #include "global.h"
int nV = 0;
location_t* V = NULL;
const double speed = 1.0;
const double EPS = 1e-6;
const double INF = 1e25;
double usedTime = 0.0;
int usedMemory = 0;
double timeLimit = 12 * 60 * 60; // 12 hours
long long distCnt = 0;
int tag = 0;
int dim = 112;
size_t dataSize = 0;
vector <double> RAN;
vector ... | ALGO | 0.994379 | 3.48316 |
dcaffd5d-b8c3-4894-87c5-2c9543c1e610 | sagar1024/not-mycppjourney | CP/Codeforces/2. First 100 problems/22. Games.cpp | // A. Games
// time limit per test: 1 second
// memory limit per test: 256 megabytes
// input: standard input
// output: standard output
// Manao works on a sports TV. He's spent much time watching the football games of some country. After a while he began to notice different patterns. For example, each team has two ... | ALGO | 0.99984 | 4.238096 |
7b9aa777-b728-40ea-8154-62316ee99be5 | zerovm/llvm-port | lib/CodeGen/SelectionDAG/LegalizeTypes.cpp | #include "LegalizeTypes.h"
#include "llvm/ADT/SetVector.h"
#include "llvm/IR/CallingConv.h"
#include "llvm/IR/DataLayout.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/ErrorHandling.h"
#include "llvm/Support/raw_ostream.h"
using namespace llvm;
static cl::opt<bool>
EnableExpensiveChecks("enable-legali... | TOOL | 0.878999 | 7.874564 |
3eebd0bc-f49d-4810-b10f-29ed33cda76e | vestr-at-work/graph-algorithms-visualization | src/main.cpp |
#include "BFSGraphAlgorithm.hpp"
#include "FlowGraph.hpp"
#include "FlowGraphConfigLoader.hpp"
#include "FordFulkersonGraphAlgorithm.hpp"
#include "GIFRenderer.hpp"
#include "GraphAlgorithmVisualizer.hpp"
#include "PathGraph.hpp"
#include "PathGraphConfigLoader.hpp"
#include <cstddef>
#include <iostream>
#include <fst... | ALGO | 0.974661 | 6.020907 |
1b5d3ed0-5779-4912-8a8a-aef04a2c8874 | PavanT22/CD_EL | libcxx/test/std/numerics/rand/rand.dist/rand.dist.norm/rand.dist.norm.f/eval.pass.cpp | // <random>
// template<class RealType = double>
// class fisher_f_distribution
// template<class _URNG> result_type operator()(_URNG& g);
#include <random>
#include <cassert>
#include <vector>
#include <algorithm>
#include <cmath>
#include "test_macros.h"
double fac(double x)
{
double r = 1;
for (; x > 1;... | TEST | 0.968174 | 4.490033 |
661b2e3f-ac85-4de8-b7dc-9f04b0b357f1 | stevn4127/frameworks_av | media/codecs/m4v_h263/dec/src/datapart_decode.cpp | #include "mp4dec_lib.h"
#include "vlc_decode.h"
#include "bitstream.h"
#include "scaling.h"
#include "mbtype_mode.h"
#include "idct.h"
#define OSCL_DISABLE_WARNING_CONDITIONAL_IS_CONSTANT
/* ======================================================================== */
/* Function : DecodeFrameDataPartMode() ... | ALGO | 0.933086 | 5.404089 |
587759c5-8a14-484f-bfec-0670330d8ad2 | MPasca/bachelor | bachelor/GameStateProcessing.cpp | #include "GameStateProcessing.h"
#include "path_computing/PaCo.h"
using namespace inputdcd;
namespace stateprocessing
{
CharacterState convert_input_to_player_state(InputState inputState)
{
switch (inputState)
{
case ARROW_DOWN:
return MOVE_DOWN;
case ARROW_UP:
return MOVE_UP;
case ARROW_LEFT:
re... | ALGO | 0.978898 | 4.919467 |
210d713e-f6c9-4839-98f4-b5408d6e1d1b | xrav3nz/competitive-programming-3 | 1 - Introduction/1 - Ad Hoc Part I/2 - Game - Others - Easier/489-hangman-judge.cpp | #include <iostream>
#include <string>
#include <cstring>
using namespace std;
int total, strike, t, c[26];
string answer, guess;
int main (int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
#endif
while (cin >> t) {
if (t == -1)
break... | ALGO | 0.997379 | 3.303258 |
10692034-f221-4ed8-afa7-aee9cb50223b | yanbo8502/coding_exercises | cpp/leet_code/regular_expression_matching/regx_match.cpp | /*
https://leetcode.com/problems/regular-expression-matching/
'.' Matches any single character.
'*' Matches zero or more of the preceding element.
The matching should cover the entire input string (not partial).
The function prototype should be:
bool isMatch(const char *s, const char *p)
Some examples:
isMatch("aa",... | ALGO | 0.999269 | 6.972669 |
54487d64-40c8-427d-b984-584044e4f2d3 | RazkaAlehira/TugasUAS | ProgramMenghitungTagihanListrik.cpp | #include <iostream>
#include <iomanip>
// Fungsi untuk menghitung tagihan listrik
double hitungTagihan(double pemakaianKwh) {
const double tarifBlok1 = 500.0;
const double tarifBlok2 = 800.0;
const double tarifBlok3 = 1000.0;
const double biayaBeban = 30000.0;
const double pajakPemakaian = 0.10;
... | TOOL | 0.921914 | 6.179918 |
0c6d20b9-14d6-4fee-a360-0569aec23a62 | Esaak/your | sftp/zip/zip.cpp | #include "zip.h"
#include <string.h>
#include "bits.h"
#include "crc32.h"
#include "deflate.h"
/* Read 16/32 bits little-endian and bump p forward afterwards. */
#define READ16(p) ((p) += 2, read16le((p) - 2))
#define READ32(p) ((p) += 4, read32le((p) - 4))
/* Write 16/32 bits little-endian and bump p forward afterw... | TOOL | 0.858076 | 5.72161 |
24e3948f-0da2-4e1d-a151-0a8f0730bbbe | liujiapeng678/AlgorithmPracticing | P1828 [USACO3.2] 香甜的黄油 Sweet Butter/9.26.cpp |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
const int N = 810, M = 2910,INF = 0x3f3f3f3f;
int n, p, c;
int h[N], e[M], ne[M], w[M], idx;
int dist[N];
int num[N];
bool st[N];
int ans = INF;
void add(int a, int b, int c)
{
w[idx] = c;
e[idx] = b;
ne[idx] = h[a];
h[a] = idx++;
}
void ... | ALGO | 0.999912 | 3.717675 |
3d2bb74a-deba-41e6-9faf-c986f4c99def | miaowangtw/OpenCV2.4.9_CB | sources/modules/ocl/src/split_merge.cpp | /*M///////////////////////////////////////////////////////////////////////////////////////
//
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
//
// By downloading, copying, installing or using the software you agree to this license.
// If you do not agree to this license, do not download, instal... | TOOL | 0.960412 | 7.317139 |
c4670ab3-99a0-4661-bf64-d5a0beb59293 | ronald-debugging/Ronald-KVstorageBaseRaft | example/raftCoreExample/raftKvDB.cpp | //
// Created by Ronald on 24-12-28.
//
#include <iostream>
#include "raft.h"
// #include "kvServer.h"
#include <kvServer.h>
#include <unistd.h>
#include <iostream>
#include <random>
void ShowArgsHelp();
int main(int argc, char **argv) {
//////////////////////////////////读取命令参数：节点数量、写入raft节点节点信息到哪个文件
if (argc < 2... | CONFIG | 0.87961 | 3.64211 |
66549368-bad7-4de3-b74e-c01356a49168 | theazgra/TrafficLightDetection | src/dlib/dlib/server/server_http.cpp | #include "server_http.h"
namespace dlib
{
// ----------------------------------------------------------------------------------------
namespace http_impl
{
inline unsigned char to_hex( unsigned char x )
{
return x + (x > 9 ? ('A'-10) : '0');
}
const std::string ... | WEB | 0.949757 | 6.014633 |
8de9aefc-7b28-4bf1-8435-56a3029afa8c | Nisha1203/Logic-Building | program212.cpp |
#include<iostream>
using namespace std;
class Array
{
public:
int iSize;
int *Arr;
Array(int iNo)
{
iSize = iNo;
Arr = new int[iSize];
}
void Accept()
{
cout<<"Enter the elements : "<<"\n";
int iCnt = 0;
... | ALGO | 0.970422 | 4.112538 |
6dcede3a-c0ad-4be2-8c35-62b7090087d4 | hex-programmer/code | cp/leetcode/94. Binary Tree Inorder Traversal.cpp | // platform : leetcode
// contest : practice
// problem : 94. Binary Tree Inorder Traversal
// date : 2024-08-25
#include <bits/stdc++.h> // clang-format off
#define kl '\n'
typedef long long ll;typedef unsigned long long ull;typedef long double lld;
#define optimize ios_base::sync_with_stdio(false);cin.tie(nullptr);... | ALGO | 0.999988 | 6.853904 |
2ed7b6d7-ba91-472f-9f32-765080c2b546 | marcpb94/mana-multilevel | test_apps/lammps/src/CORESHELL/pair_buck_coul_long_cs.cpp | // clang-format off
/* ----------------------------------------------------------------------
Contributing author: Hendrik Heenen (<EMAIL>)
------------------------------------------------------------------------- */
#include "pair_buck_coul_long_cs.h"
#include <cmath>
#include "atom.h"
#include "force.h"
#include... | ALGO | 0.993167 | 5.146564 |
5c885157-344f-4461-bc5d-dddb3bb5e603 | igaspard/LeetCode | 740_DeleteandEarn.cpp | class Solution {
public:
int deleteAndEarn(vector<int>& nums) {
if (nums.empty())
return 0;
const int r = *max_element(nums.begin(), nums.end());
vector<int> points(r+1, 0);
for (auto num: nums)
points[num] += num;
return rob(points);
}
... | ALGO | 0.999676 | 5.93486 |
f898b44d-9158-4d81-bb08-fcbd0bea501a | limhan124/ALGOLAB | week2/search snippets/search_snippets.cpp | #include<iostream>
#include <climits>
#include<algorithm>
#define MAX (1024*64+4)
#define NMAX 2052
using namespace std;
typedef struct{
int position;
int word;
}point;
bool cmp(point a,point b)
{
return a.position<b.position;
}
point line[MAX];
int word_frequency[NMAX];
int testcases(){
//n个单词
int n;
cin>... | ALGO | 0.999824 | 3.828459 |
e521bc42-21ed-41d3-81e6-a8dd2b7672ef | Sumedha-Bajpaii/Daily_Challenge_Solutions | 2196-create-binary-tree-from-descriptions/2196-create-binary-tree-from-descriptions.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.9999 | 5.526863 |
ae90dae0-0fc8-464b-bf89-e016f8d7fba0 | josprachi/SimpleGameOfLife | GameOfLife/GOL_Shapes/frameworks/cocos2d-x/cocos/platform/win32/CCFileUtils-win32.cpp | #include "platform/CCPlatformConfig.h"
#if CC_TARGET_PLATFORM == CC_PLATFORM_WIN32
#include "platform/win32/CCFileUtils-win32.h"
#include "platform/win32/CCUtils-win32.h"
#include "platform/CCCommon.h"
#include "tinydir/tinydir.h"
#include <Shlobj.h>
#include <cstdlib>
#include <regex>
#include <sstream>
using namesp... | TOOL | 0.933256 | 6.154255 |
26d32e44-7a39-4cd9-ae98-0b9df2e71738 | Iamthankyou/Dev | (C-C++) Lap_Trinh_Dev/Uoc_So.cpp | #include<bits/stdc++.h>
using namespace std;
void inSo(int n)
{
for(int i = 1; i<=n; i++)
{
if(n%i == 0) cout<<i<<endl;
}
}
int main()
{
int n;
cin>>n;
inSo(n);
}
| ALGO | 0.998627 | 4.629299 |
707a2833-1eb9-4d9c-a952-02d7a9ba5f0a | arkantrust/network_architect | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998809 | 6.763549 |
b1e4478a-cf58-4027-bfe6-f894d9a713d1 | CarterPry/AdventCode2022 | Day20/gps.cpp | #include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main(){
ifstream infile("input.txt");
vector<int> numbers;
int x;
while (infile >> x){
numbers.push_back(x);
}
int YouAreHere = 0;
int n = numbers.size();
for (int i = 0; i < n; i++){
int moves = numbers[i];
int N... | ALGO | 0.999905 | 3.56691 |
ee0c0f34-d1c3-4f72-af0f-b0b229275980 | TeodoraB12/Portfolio | Vezba2.cpp | //kodot go vrakja vremeto na procesorot koe programta go potrosila
#include <stdio.h> /* printf */
#include <time.h> //vremenska biblioteka /* clock_t, clock, CLOCKS_PER_SEC */
#include <math.h> //matematicka biblioteka /* sqrt */
int frequency_of_primes (int n) { //funkcija od celobrojna promenliva
... | ALGO | 0.997689 | 5.692299 |
a17f4281-3f9f-4441-8bff-139121f0d549 | MOOC-Animation-and-CGI-Motion/assignment-preview | t2m2/include/eigen/bench/benchmarkSlice.cpp | // g++ -O3 -DNDEBUG benchmarkX.cpp -o benchmarkX && time ./benchmarkX
#include <Eigen/Array>
using namespace std;
using namespace Eigen;
#ifndef REPEAT
#define REPEAT 10000
#endif
#ifndef SCALAR
#define SCALAR float
#endif
int main(int argc, char *argv[])
{
typedef Matrix<SCALAR, Eigen::Dynamic, Eigen::Dynamic> ... | TOOL | 0.897238 | 3.573001 |
1c00bdcf-b46c-4b21-8bba-0a12ca2b5ab5 | masudranam/dsa_problems | Codeforces/G_Cut_Substrings.cpp | #include<bits/stdc++.h>
using namespace std;
#define print(a) for(auto x:a)cout<<x<<' ';cout<<'\n';
#define debug(x) cout<<#x<<" "<<x<<'\n'
#define int long long int
const int M = 1e9 + 7;
const int N = 5e2 + 10;
bool match[N];
pair<int,int> dp[N][N];
int n, m;
pair<int,int> Merge(pair<int,int> a, pair<int,int> b... | ALGO | 0.999983 | 4.40151 |
868bebde-e9a2-47e9-9877-57c42a1f6be6 | keisuke90/AtCoder | tessoku/first/a39.cpp | #include <bits/stdc++.h>
using namespace std;
int N;
int L[300009], R[300009];
vector<pair<int, int>> tmp;
int main(){
cin >> N;
for(int i = 1; i <= N; i++){
cin >> L[i] >> R[i];
tmp.push_back(make_pair(R[i], L[i]));
}
sort(tmp.begin(), tmp.end());
for(int i = 1; i <= N; i++){
... | ALGO | 0.999982 | 4.011446 |
6ab5bf3d-2cc1-44ef-b79f-768ebbee0546 | ebylmz/cse462-augmented-reality | hw01/BasicAR/Library/PackageCache/com.unity.ide.visualstudio@2.0.21/Editor/COMIntegration/COMIntegration~/COMIntegration.cpp | #include <iostream>
#include <sstream>
#include <string>
#include <filesystem>
#include <windows.h>
#include <shlwapi.h>
#include <fcntl.h>
#include <io.h>
#include "BStrHolder.h"
#include "ComPtr.h"
#include "dte80a.tlh"
constexpr int RETRY_INTERVAL_MS = 150;
constexpr int TIMEOUT_MS = 10000;
// Often a DTE call m... | TOOL | 0.952719 | 6.933585 |
8044649b-412a-44cf-8112-5e5925ab4a5a | AniketKasav/DSA-in-cpp | recursion/Nfactorial.cpp | #include<bits/stdc++.h>
using namespace std;
int fact(int n){
if(n==1){
return 1;
}
return n*fact(n-1);
}
int main(){
cout<<fact(3);
return 0;
}
| ALGO | 0.999955 | 4.434741 |
7ebdd2ec-d1ec-4163-8fa7-970a5a1f2a8d | HeroRickyGAMES/Projeto-Guarita-Nice-SDK-Flutter | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998756 | 6.772262 |
ccf98032-d37c-41be-86ae-02171755a116 | blesdfa/CS3 | hwWritten2/hw2.cpp | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int fastFind(vector<double> &A, double key) {
int s = 0;
int e = 1;
while (A[e] < key && e < A.size()) {
s = e;
e *= 2;
}
e = min(e, int(A.size() - 1));
while (s <= e) {
int mid = (s + e) / 2;... | ALGO | 0.999988 | 5.589605 |
19f70fb7-d9dc-4888-99b0-8c2f10359a51 | aelobdog/cograsim | lib/oxDNA/src/Backends/MCMoves/MCRot.cpp | /**
* @file MCRot.cpp
* @date 30/apr/2014
* @author flavio
*
*
*/
#include "MCRot.h"
template<typename number>
MCRot<number>::MCRot () : BaseMove<number>() {
_orientation_old = LR_matrix<number> (1., 0., 0., 0., 1., 0., 0., 0., 1.);
_orientationT_old = LR_matrix<number> (1., 0., 0., 0., 1., 0., 0., 0.,... | ALGO | 0.900882 | 6.34232 |
731f282b-f4a5-44b1-bb07-bbbe5d03c93c | alexfernandez0804/Laboratorio8 | bullet3-3.25/src/BulletCollision/NarrowPhaseCollision/btMinkowskiPenetrationDepthSolver.cpp | #include "btMinkowskiPenetrationDepthSolver.h"
#include "BulletCollision/NarrowPhaseCollision/btSubSimplexConvexCast.h"
#include "BulletCollision/NarrowPhaseCollision/btVoronoiSimplexSolver.h"
#include "BulletCollision/NarrowPhaseCollision/btGjkPairDetector.h"
#include "BulletCollision/CollisionShapes/btConvexShape.h"
... | ALGO | 0.999397 | 6.201314 |
5ae8fcf3-428c-4c6e-8363-8d0ccf4b05ce | adipandas/route-planner | src/model.cpp | #include "model.h"
#include "pugixml.hpp"
#include <iostream>
#include <string_view>
#include <cmath>
#include <algorithm>
#include <assert.h>
static Model::Road::Type String2RoadType(std::string_view type)
{
if( type == "motorway" ) return Model::Road::Motorway;
if( type == "trunk" ) return M... | TOOL | 0.85064 | 6.070182 |
7e4fcfde-c70d-4f6e-b00d-761026d62137 | mlt/mapwingis-osgeo | Tin/TinHeap.cpp | # include "stdafx.h"
# include "TinHeap.h"
TinHeap::TinHeap()
{ minDeviation = 1.0;
}
TinHeap::TinHeap( double p_minDeviation )
{ minDeviation = p_minDeviation;
}
TinHeap::~TinHeap()
{
}
void TinHeap::clear()
{
all_nodes.clear();
}
void TinHeap::insert( long triangleIndex, double dev, vertex v )
{
if( dev < minDev... | ALGO | 0.998261 | 4.350829 |
d3d8c9b9-3c8a-426e-a8ec-83f270977b87 | ZooInJang/Solo_Project_Second | opencv-4.x/opencv-4.x/3rdparty/openexr/IlmImf/ImfDeepCompositing.cpp | #include "ImfDeepCompositing.h"
#include "ImfNamespace.h"
#include <algorithm>
#include <vector>
OPENEXR_IMF_INTERNAL_NAMESPACE_SOURCE_ENTER
using std::sort;
using std::vector;
DeepCompositing::DeepCompositing()
{
}
DeepCompositing::~DeepCompositing()
{
}
void
DeepCompositing::composite_pixel (float outputs[],
... | ALGO | 0.948825 | 5.125371 |
2cacc392-903e-48a8-8cf6-964997d49899 | tizm317/CodingTest | Simulation/16235.cpp | //#include <iostream>
//#include <vector>
//#include <algorithm> // sort
//#include <tuple>
//#include <deque>
//using namespace std;
//
//// Ǯ
//// ¥ : 2023. 08. 02.
//// ȣ : #16235
//// ̸ : ũ
//// ˰ : ùķ̼
//// ð: O()
//
//int N; // ũ <= 10
//int fertilizerArr[15][15]; // 迭
//int board[15][15]; // 迭
//
//i... | ALGO | 0.998992 | 4.074236 |
c92657f6-2e6b-4a7f-8ebf-8828477f8f32 | DevS0ni/OOP345-Object-Oriented-Software-Development-Using-C | In Class Coding/multithreading/test2.cpp | #include <iostream>
#include <numeric>
#include <chrono>
#include <vector>
#include <thread>
double sum_parallel(std::vector<double> &vec){
auto sum_up = [&vec] (std::size_t start, std::size_t end){
double sum = 0.0;
for(std::size_t i=start; i<end; i++){
sum += vec[i];
}
... | ALGO | 0.999209 | 5.587065 |
9eee2ff7-147a-4df1-9b44-10c467405808 | Mr0Bread/Kris_Labs | First_Lab/1_3.cpp | #include <iostream>
using namespace std;
float input(string message) {
cout << message;
float temp;
cin >> temp;
return temp;
}
float convertFromFtoC(float temperature) {
return (temperature - 32) / 1.8;
}
float convertFromCtoF(float temperature) {
return (temperature * 1.80) + 32;
}
int ma... | TOOL | 0.990763 | 5.078105 |
f328162f-ea67-4139-a923-980e28f49267 | Agiraldo07/labinfo2practica1 | problemas/Problema_15/main.cpp | #include <iostream>
using namespace std;
int main()
{
bool aux=false;
int num,count1=1,count2=0,div,num1=0;
cout<<"Escribe un numero:";
cin>>num;
while(aux==false){
div=1;
count2=0;
num1=(count1*(count1+1))/2;
while(div<=num1){
if(num1%div==0)count2++;
... | ALGO | 0.999342 | 3.86312 |
da5a8d49-07a3-4ba6-9b98-2d9324251fa3 | Mferrill/TrinityBotCore | src/server/game/Combat/ThreatManager.cpp | #include "ThreatManager.h"
#include "Unit.h"
#include "Creature.h"
#include "CreatureAI.h"
#include "Map.h"
#include "Player.h"
#include "ObjectAccessor.h"
#include "UnitEvents.h"
#include "SpellAuras.h"
#include "SpellMgr.h"
//==============================================================
//================= ThreatCa... | TOOL | 0.930399 | 5.207967 |
60bcd29a-4b95-4f8f-8c98-1426f6ee2ddb | Yernar111/C- | rec_stl_число_без_пары.cpp | #include <iostream>
#include <vector>
#include <algorithm>
/* */
using namespace std;
int without_pair(vector <int> a,int i){
if (i==a.size()-1)
return a.back();
if (a[i]!=a[i-1] && a[i]!=a[i+1])
return a[i];
return without_pair(a,i+1);
}
int main(){
int n,m;
cin>>n;
vector... | ALGO | 0.999838 | 3.791403 |
156c66b1-9136-4df2-9669-acd0e7d44dbf | algoplutus1708/Competitive-Programming-Solutions | Codeforces/485 - Round #276 (Div. 2)/C. Bits.cpp | /*** KNOWLEDGE IS POWER ***/
#include<bits/stdc++.h>
typedef long long ll ;
#define int ll
#define pb push_back
#define all(v) v.begin(),v.end()
#define mod 1000000007
#define inf LLONG_MAX
using namespace std ;
void solve( )
{
int l , r ;
cin >> l >> r ;
for(int i = 1 ; i + l <= r ; (i <<= 1))
{
if(!(l&i))
... | ALGO | 0.999769 | 3.645828 |
25868323-1abb-40e1-abba-aa4b34397adf | RomanLopez530/PROGRAMA1 | condiciones complejas/año bisiesto.cpp | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int a, r1, r2;
cout<<"ingrese un ao: ";
cin>>a;
r1= a % 4;
r2= a % 10;
if (r1 > 0 && r2 > 0)
{
cout<<"el aos no es bisiesto y no es divisible entre 10 ";
}
else if (r1 > 0 && r2 == 0)
{
cout<<"el ao no es bisiesto pero es divis... | ALGO | 0.996853 | 3.373097 |
ca8398a4-f309-4f3a-82ff-a877a2a87d3e | PaukIsUha/optimizing_formating_code | predictions/submissions-aizu-cot-gpt35/Codenet/p00454/377927803/response_4.cpp | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
constexpr int inf = 1e9;
int w, h;
int n;
int x1[1005], x2[1005];
int y1[1005], y2[1005];
bool fld[1005 * 6 + 2][1005 * 6 + 2];
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int compress(int *x... | ALGO | 0.998456 | 4.298056 |
ade9931e-03f7-4c22-ab6d-ade17751fdc4 | ishandutta2007/codeforces | _h_/normal/665/C.cpp | #include <iostream>
#include <algorithm>
#include <map>
#include <string>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
#include <random>
#include <cassert>
#include <cstdio>
#include <cstring>
using namespace std;
#define rep(i,a,b) for(int i = (a); i < int(b); +... | ALGO | 0.999982 | 4.220865 |
5af09d60-b33e-441d-9747-bed34ba889cd | chw1224/control_ur_robot_with_omega_haptic | omega_haptic/sdk-3.16.1/externals/Eigen/doc/examples/Tutorial_BlockOperations_print_block.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace std;
int main()
{
Eigen::MatrixXf m(4,4);
m << 1, 2, 3, 4,
5, 6, 7, 8,
9,10,11,12,
13,14,15,16;
cout << "Block in the middle" << endl;
cout << m.block<2,2>(1,1) << endl << endl;
for (int i = 1; i <= 3; ++i)
{
cout << "B... | ALGO | 0.986569 | 3.6853 |
9b9be480-aa67-4d87-87da-af78fb5f33b0 | Rikoshet-234/X-Ray-PBR | xrSource/SDK/boost_1_30_0/libs/graph/example/cycle-file-dep.cpp | using namespace boost;
namespace std
{
template < typename T >
std::istream & operator >> (std::istream & in, std::pair < T, T > &p)
{
in >> p.first >> p.second;
return in;
}
}
typedef adjacency_list < listS, // Store out-edges of each vertex in a std::list
vecS, // Store v... | ALGO | 0.99902 | 5.947524 |
eda210af-9d46-49b6-bf35-3bce9438cc39 | 2jun0/Algorithm | codes/_before/cpp/유기농 배추.cpp | //#include <iostream>
//#include<cstring>
//#include <string>
//#include <cmath>
//#include <algorithm>
//#include <stack>
//#include <vector>
//#include <set>
//#include <queue>
//#include <map>
//
//#define ABS(x) (((x) < 0)?-(x):(x))
//#define SWAP(a,b, temp) temp = (a); a = (b); b = temp;
//#define PI 3.14159265358... | ALGO | 0.999233 | 3.360813 |
88094800-61d6-4af4-9490-5fbea4b33aed | hxuhack/BiOpq | lib/Transforms/Utils/FlattenCFG.cpp | #include "llvm/Transforms/Utils/Local.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/Analysis/AliasAnalysis.h"
#include "llvm/Analysis/ValueTracking.h"
#include "llvm/IR/IRBuilder.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/raw_ostream.h"
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
using names... | ALGO | 0.99345 | 7.369925 |
1adf584a-1fa5-4280-a56e-17afd8918c7a | Pulakesh5/_DSA_ | MARCH 2025/10 March/Edit Distance gfg.cpp | class Solution {
public:
// Function to compute the edit distance between two strings
int LEN1, LEN2;
int editDistance(string& s1, string& s2) {
// code here
LEN1 = s1.size();
LEN2 = s2.size();
vector<vector<int>> dp(LEN1+1, vector<int>(LEN2+1,-1));
// findDistance(... | ALGO | 0.999985 | 5.729144 |
d2a1f0e7-29ff-4e8d-b6cf-a778ba6c2d06 | szmanda/ZSK | klasa4/CPP/matura2019/liczby2.cpp | #include <iostream>
#include <fstream>
using namespace std;
int silnia(int a){
int wynik=1;
for (int i = a; i > 1; i--) {
wynik*=i;
}
return wynik;
}
int main()
{
ifstream file;
file.open("liczby.txt");
fstream out;
out.open("wyniki.txt",ios::app);
out<<"Zadanie 2.\n";
int liczba... | ALGO | 0.999414 | 4.781136 |
9c7ffbdd-c73c-426d-bb08-dc0159e3f4d6 | ChessCoder1729/Competitive-Programming | CSES/Sorting And Searching/07. SumOfTwoValues.cpp | #include <bits/stdc++.h>
using namespace std;
#define endl '\n';
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define py cout << "YES" << endl;
#define pn cout << "NO" << endl;
const long long inf = 1e18;
const long long mod = 1e9+7;
const int n = 1e5;
typedef long long ll;
typedef unsigned... | ALGO | 0.999927 | 4.202368 |
7ea937c8-e01e-4000-83c9-c271a91abe23 | Ubaid-Manzoor/Algorithum-and-Data-Structure-Problems | Karatsuba_Multiplication/Karatsuba.cpp | #include<iostream>
#include<string>
using namespace std;
string add(string lhs, string rhs) {
int carry = 0;
string result;
int length = max(lhs.size(), rhs.size());
while (lhs.size() < length)
lhs.insert(0,"0");
while (rhs.size() < length)
rhs.insert(0,"0");
for(int i = length-1;... | ALGO | 0.999962 | 4.700291 |
d4246579-56ad-4ea4-93d9-be33b9f58836 | JIRonnie/ardupilot | libraries/AP_Proximity/AP_Proximity_Boundary_3D.cpp | #include "AP_Proximity_Boundary_3D.h"
#define PROXIMITY_BOUNDARY_3D_TIMEOUT_MS 750 // we should check the 3D boundary faces after this many ms
/*
Constructor.
This incorporates initialisation as well.
*/
AP_Proximity_Boundary_3D::AP_Proximity_Boundary_3D()
{
// initialise sector edge vector used for buildin... | ALGO | 0.977966 | 5.57996 |
01b56819-c9dd-4827-88ee-8fe91cc966a8 | andrewschoi/cses-solutions | rangequeries/dynamicrangesumqueries.cpp | #include <bits/stdc++.h>
using namespace std;
template <class T>
class BIT
{
private:
int size;
vector<T> bit;
vector<T> arr;
public:
BIT(int size) : size(size), bit(size + 1), arr(size){};
void set(int ind, int val) { add(ind, val - arr[ind]); }
void add(int ind, int val)
{
arr[ind] += val;
ind... | ALGO | 0.999866 | 4.591187 |
3a416a5e-f179-47ae-a42c-12ff2936dba3 | d339akkumar/Custom-Brew | custom_brew/windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998801 | 6.772262 |
f238f762-3b7f-4d29-943b-9f171ec3c6d7 | laosiaudi/leetcode | Lowest_Common_Ancestor_of_a_Binary_Search_Tree.cpp | /*********************************************************************************
* File Name : Lowest_Common_Ancestor_of_a_Binary_Search_Tree.cpp
* Created By : laosiaudi
* Creation Date : [2015-10-18 01:08]
* Last Modified : [2015-10-18 01:10]
* Desc... | ALGO | 0.999998 | 5.982567 |
8626dd34-c40b-4e0b-b352-6a0b25a969a1 | qmqsyz/libcxx-build | llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.clamp/clamp.pass.cpp | // <algorithm>
// XFAIL: c++03, c++11, c++14
// template<class T>
// const T&
// clamp(const T& v, const T& lo, const T& hi);
#include <algorithm>
#include <cassert>
#include "test_macros.h"
struct Tag {
Tag() : val(0), tag("Default") {}
Tag(int a, const char *b) : val(a), tag(b) {}
~Tag() {}
i... | TEST | 0.931749 | 6.801015 |
3b8f6a29-4e69-430b-a1d0-417e3a2982e1 | f2rkan/intro-to-Programming-w-c-plus-plus | part-4/2/cuma3.cpp | //recur.cpp --using recursion
#include<iostream>
void countdown(int n);
int main(void)
{
countdown(4);
return 0;
}
void countdown(int n)
{
using namespace std;
cout << "Countdown . . . " << n << endl;
if(n > 0)
countdown(n-1);
cout << n << " Kabuum!\n";
} | ALGO | 0.997787 | 5.018557 |
ccd6cd5f-57a4-43ad-9ffc-67fc2cbce351 | tanvir031/Competitive-Programming- | Codeforces/hudai.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
long long n1,n2,q;
while(t--)
{
cin >> n1 >> n2;
vector < pair <long long,long long> > v1,sorted;
vector < long long > v2(n2);
for(long long i=0;i<n1;i++)
{
cin >> q;
v1.push_back({q,i});
}
for(long long j=0;j<n2;... | ALGO | 0.999937 | 3.477557 |
b6bd221d-a0bd-45b8-8688-529602948d87 | tsusu0409/atcoder | ABC/200/206/c.cpp | #include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int,int>;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N){
cin >> A[i];
}
ll ans = N * (N-1) /... | ALGO | 0.999966 | 4.198553 |
cafc6bf4-b480-408c-a2c8-c5539d0e4cbd | JCarlosRS97/Caballeo | Caballo2.cpp | #include "Jugada.hpp"
#include "includes.hpp"
using namespace std;
using namespace Caballeo;
struct Elemento{
Jugada *jugada;
Elemento *sig;
};
typedef Elemento* Lista;
void iniTablero(Tablero &t){
for(int i=0; i<8; i++){
for(int j=0; j<8; j++){
t[i][j]=65;
}
}
}
void dibTablero(Tablero &t){
for(int i=0; i<... | ALGO | 0.997646 | 3.30159 |
baf57a43-ebba-4f74-8c45-c72a4e5cb28f | Nuktaverma/practice | topic4 structure and union/4a_structure_allign_intro.cpp | #include<iostream>
using namespace std;
struct S1
{
char c1;
double d1;
char c2;
};
struct S2
{
char c1;
char c2;
double d1;
};
struct S3
{
double d1;
char c1;
char c2;
};
int main()
{
cout << sizeof(S1) << ' '
<< sizeof(S2) << ' '
<< sizeof(S3);
return ... | ALGO | 0.90786 | 4.089633 |
33b6ae81-2b51-47a9-a51f-d9d7337b5846 | Rizwanabid-23/PF-1 | week12/p5.cpp | #include<iostream>
using namespace std;
int main(){
// INCOMPLETE AND DONE WRONG
int arr[5]={1,2,3,4,5};
int arr2[5];
int arr3[5];
for(int i=0;i<5;i++){
arr2[0]=arr[4];
arr2[i+1]=arr[i];
arr3[0]=arr2[4];
arr3[i+1]=arr2[i];
}
cout<<endl;
}
| ALGO | 0.998925 | 3.208541 |
9faaed67-c239-47be-b68e-64f8c009fdeb | goelayush7/LEETCODE | 784-insert-into-a-binary-search-tree/insert-into-a-binary-search-tree.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999993 | 6.266747 |
e24b3302-6dcb-41cc-8e06-58111ce04009 | ishandutta2007/codeforces | tzc_wk/normal/1304/F1.cpp | //Coded by tzc_wk
/*
D P
l l
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define fz(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define foreach(it,v) for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define all(a) a.begin(),a.end()
#define g... | ALGO | 0.999951 | 3.165716 |
3c5ed114-95b9-442b-91db-6aacf458d256 | Phantasm-Studios/UnrealEngine | Engine/Source/ThirdParty/hlslcc/hlslcc/src/hlslcc_lib/ir_hv_accept.cpp | #include "ShaderCompilerCommon.h"
#include "ir.h"
/**
* \file ir_hv_accept.cpp
* Implementations of all hierarchical visitor accept methods for IR
* instructions.
*/
/**
* Process a list of nodes using a hierarchical vistor.
*
* If statement_list is true (the default), this is a list of statements, so
* v->base_ir wi... | ALGO | 0.947571 | 6.347957 |
e0d10054-c32f-4331-8588-154e01a5903f | auspbro/VSProj | CTest/ConsoleApplication3/ConsoleApplication3/ConsoleApplication3.cpp | // ConsoleApplication3.cpp : ̨Ӧóڵ㡣
//
#include "stdafx.h"
float Max = 0, Min = 0;
int _tmain(int argc, _TCHAR* argv[])
{
float average(float array[], int n);
float ave, score[10], sum = 0;
int i;
printf("Please enter 10 scores:");
for (i = 0; i <= 10; i++)
scanf_s("%f", &score[i]);
ave = average(score, 10);... | ALGO | 0.98034 | 3.568943 |
7cc56fdf-e5b5-44f2-ba17-48c0b311cbad | AFIFA181/Compiler-Design | factoria.cpp | #include <iostream>
using namespace std;
int main()
{
int i,n, fact=1;
cout<<"Enter any desire positive number: ";
cin>>n;
for (i=1; i<=n; i++)
{
fact =fact*i;
}
cout<<"Factorial of " <<n<<" is : " <<fact <<endl;
return 0;
}
| ALGO | 0.999361 | 3.163326 |
06fdb446-299a-44d4-a81f-cf2ca67e198f | AdsonFS/beecrowd-codes | codes/2664.cpp | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for(int i = (a); i <= (b); i++)
#define PER(i, a, b) for(int i = (a); i >= (b); i--)
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pf push_front
#define pb push_back
#define mk make_pair
#define S se... | ALGO | 0.999953 | 3.913239 |
601e2971-14e6-4de3-9457-0cb59addabcd | itsmepsk/Competitive | Codechef/Contests/Long/JULY14/GERALD09/GERALD09.cpp | #include <iostream>
using namespace std;
int main() {
int t,n,m,k,i,j,count;
char arr[5] = {'G','C','A','T'};
cin >> t;
while(t--) {
cin >> n >> m >> k;
if(k <= n*m) {
for(i=0;i<n;i++) {
for(j=0;j<m;j++) {
cout << "A";
}
... | ALGO | 0.999551 | 4.03383 |
f886a7f4-687e-40e8-8be7-47b8f1787ef9 | fzhiy/CPP-Practice | JianZhiOffer/JZ49 丑数.cpp | /***
* @Date: 2022-03-27 13:07:17
* @Author: yufeng
* @GitHub: https://github.com/fzhiy
* @Email: <EMAIL>
* @LastEditTime: 2022-03-27 13:07:17
*/
// O(n) / O(n)
class Solution {
public:
int GetUglyNumber_Solution(int index) {
if (index < 6) return index;
vector<int> res(index);
res[0... | ALGO | 0.999981 | 5.67287 |
7c7c7fdb-728a-4587-8c8a-1a6f5a04c33d | lifelessgarmentss/fund-alg-hwrk | dz01/taskn1/main.cpp | #include <iostream>
#include <cmath>
#include "ellipse.h"
#include "ellipse.cpp"
using namespace std;
int main()
{
Ellipse ellipse1, ellipse2;
ellipse1 = Ellipse(1, 2, 3, 4, true);
ellipse2 = ellipse1;
cout << "Calculated hyperparameter: " << ellipse1.count_hyperparametr() << endl;
... | ALGO | 0.982236 | 5.022511 |
5151c62b-696f-4ddd-ad98-94d3a96978a0 | Vishal-Agarwal12/Competitive-programming-codes | 1672A.cpp | #include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve()
{
ll n;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ll res = 0;
for (auto x : a)
{
res += (x - 1);
}
if (res % 2 == 1)
{
cout << "errorgorn" << endl;
}
... | ALGO | 0.999504 | 4.106911 |
ecd1a2b2-2eb4-425d-b2f8-d88fc8164bea | xiyanykt/code | HDU/2025 Spring 1/1005.cpp | #include<bits/stdc++.h>
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using f64 = long double;
using i128 = __int128;
using u128 = unsigned __int128;
using f128 = __float128;
#ifndef ONLINE_JUDGE
#include "algo/debug.hpp"
#else
#define debug(...) (void)42
#endif
template<class T>
c... | ALGO | 0.999674 | 6.052341 |
5dbf151d-1746-43ef-b87f-28dc29c4e5cd | JiangWenqi/Algorithm-Questions | Leetcode-Solutions/105.construct-binary-tree-from-preorder-and-inorder-traversal.cpp | // @before-stub-for-debug-begin
#include <vector>
#include <string>
#include "commoncppproblem105.h"
using namespace std;
// @before-stub-for-debug-end
/*
* @lc app=leetcode id=105 lang=cpp
*
* [105] Construct Binary Tree from Preorder and Inorder Traversal
*
* https://leetcode.com/problems/construct-binary-tree... | ALGO | 0.999959 | 7.285813 |
86142ba4-6be7-4914-b8af-889f13deef74 | hljeong/cp | cf/1804b.cpp | #include <bits/stdc++.h>
#define A first
#define B second
#define vc vector
#define pb push_back
#define endl '\n'
using namespace std;
using ll = long long; using ld = long double;
using vi = vc<int>; using vll = vc<ll>;
using si = set<int>; using sll = set<ll>;
using pi = pair<int, int>; using pll = pair<ll, ll>;
usi... | ALGO | 0.999968 | 3.680668 |
a908a669-7a5f-4ffc-994a-54d485f11e85 | ishandutta2007/codeforces | hank55663/normal/1144/D.cpp | #include<bits/stdc++.h>
#define pdd pair<double,double>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define cpii const pii
#define cpdd const pdd
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define sqr(x) ((x)*(x))
#define LL long long
using namespace std;
int a[200005];
void go(in... | ALGO | 0.999951 | 3.205372 |
51501277-7fe5-494b-9753-6635ef69a322 | vieanh88/Applied_Algorithms_HUST | Practice/GCD_dequy.cpp | #include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
using namespace std;
// Bi ton: Tim uoc chung lon nhat
int GCD (int a, int b) {
//TH co so
if (b==0) {
return a;
}
return GCD(b, a%b);
}
int main() {
//toi uu nhap xuat
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//nhan gia tri
... | ALGO | 0.999833 | 4.98094 |
0a6f6e0d-c771-4d50-8a8e-31813e3928f7 | edpannelap/flapcoin | src/script/sign.cpp | #include <script/sign.h>
#include <key.h>
#include <policy/policy.h>
#include <primitives/transaction.h>
#include <script/standard.h>
#include <uint256.h>
typedef std::vector<unsigned char> valtype;
MutableTransactionSignatureCreator::MutableTransactionSignatureCreator(const CMutableTransaction* txToIn, unsigned int... | ALGO | 0.96402 | 7.074459 |
ed715081-d242-462c-99bd-1b0ee061506b | MilkClouds/Competitive-Programming | Atcoder/abc207/B_Hydrate.cpp | # pragma GCC optimize ("O3")
# pragma GCC optimize ("Ofast")
# pragma GCC optimize ("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define rep2(i,a,b) for(int i = (b) - 1; i >= (a); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int... | ALGO | 0.999564 | 3.38328 |
d61afb13-deaa-4f1d-b2b9-8348228f2cba | ishandutta2007/codeforces | tempura0224/normal/1179/D.cpp | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | ALGO | 0.999942 | 4.103034 |
da956d14-72f0-433a-8018-a98c6c24a47c | rituraj0/OtherCompetitions | 246/3.cpp | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define sz size()
#define bg begin()
#define en end()
#define Y second
#define X first
typedef long long ll;
#define fi freopen("input.txt","r",stdin)
#define fo freopen("output.txt","w",stdout)
const double pi = acos(-1.0);
c... | ALGO | 0.999778 | 3.202806 |
b76a739c-59e3-460b-8ec6-28b06e35c70e | r-d-s-l-w/competitive-programming | USACO/Greedy Gift Givers.cpp | /*
ID: radek.m1
TASK: gift1
LANG: C++11
*/
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ALL(x) (x).begin(),(x).end()
#define endl '\n'
#define DEBUG(x) cout << '>' << #x << ": " << x << endl;
#define REP(i,n... | ALGO | 0.992518 | 3.405165 |
ec568018-edfa-4023-b108-f2ae3dbed662 | ishandutta2007/codeforces | magga/normal/1375/E.cpp | #include<bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define rep(i,n) for(int i = 0; i < n ; ++i)
#define REP(i,a,b) for(int i = a ; i <= b ; ++i)
#define filei freopen("input.txt", "r", stdin);
#define fileo freopen("output.txt", "w", stdout);
#... | ALGO | 0.999757 | 3.388927 |
7066b56c-4813-40fb-a787-6f43776495dd | slitvinov/lammps-sph-multiphase | src/GPU/pair_lj_cut_gpu.cpp | /* ----------------------------------------------------------------------
Contributing author: Mike Brown (SNL)
------------------------------------------------------------------------- */
#include "math.h"
#include "stdio.h"
#include "stdlib.h"
#include "pair_lj_cut_gpu.h"
#include "atom.h"
#include "atom_vec.h"
#... | ALGO | 0.999001 | 6.499557 |
f040f3ab-9df2-4b32-b5be-52e990e0c689 | YeluriKetan/project-TREADS | Codeforces/A/41 A. Translation/Solution.cpp | #include "iostream"
#include "algorithm"
using namespace std;
int main() {
ios::sync_with_stdio(false);
string a, b; cin >> a >> b;
reverse(a.begin(), a.end());
cout << (a == b ? "YES" : "NO") << "\n";
return 0;
} | ALGO | 0.999985 | 3.589931 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.