uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
a2749df4-545d-4d19-a031-824b71ac838f | ZaBarudo/tiny-gpu-lang-backend | flang/runtime/findloc.cpp | // Implements FINDLOC for all required operand types and shapes and result
// integer kinds.
#include "reduction-templates.h"
#include "flang/Runtime/character.h"
#include "flang/Runtime/reduction.h"
#include <cinttypes>
#include <complex>
namespace Fortran::runtime {
template <TypeCategory CAT1, int KIND1, TypeCate... | ALGO | 0.927326 | 5.919716 |
646da192-8992-4d3f-a1fa-f849c58d0ef8 | satyamtiwari736182/CP | pepcoding/Level 3/Text Processing/5_Find String Roots.cpp | // In mathematics, the N-th root of a number M, is a number K such that K^N=M, i.e. KKK...K=M where k is multiplied N times.
// Given a string S you have to find the maximum N such that the N-th root of S exists.
// For ex :
// If S= "sumsumsumsum", for N=2 the string T="sumsum" is the N-th root of S, While for N=4 it... | ALGO | 0.998528 | 3.742832 |
c00c1fe3-9241-4872-9e5f-297f24729437 | zarif98sjs/Competitive-Programming | CodeForces/Contest/Edu Round 95/G2.cpp |
/** Which of the favors of your Lord will you deny ? **/
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define PII pair<int,int>
#define PLL pair<LL,LL>
#define F first
#define S second
#define ALL(x) (x).begin(), (x).end()
#define READ freopen("alu.txt", "r", stdin)
#define WRITE ... | ALGO | 0.999952 | 3.721987 |
960c3d56-5bf6-4b75-a961-74d5cd609ad0 | vishnu510/LeetCode_Problem | Permutations of a given string - GFG/permutations-of-a-given-string.cpp | // { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
void helper(string s,int i,set<string>& res){
if(i==s.size()){
res.insert(s);
return;
}
for(int k=i;k<s.size();k++){
swap(s[i],s[k... | ALGO | 0.999947 | 6.105857 |
35590604-3daf-49d1-9b77-edc2faab0059 | shreejitverma/SDE-Interview-Prep | LeetCode/C++/magical-string.cpp | // Time: O(n)
// Space: O(n)
class Solution {
public:
int magicalString(int n) {
string S = "122";
for (int i = 2; S.length() < n; ++i) {
S += string(S[i] - '0', S.back() ^ 3);
}
return count(S.begin(), S.begin() + n, '1');
}
};
| ALGO | 0.99996 | 6.152877 |
27fa4ec8-4547-4ea0-ad7f-ac3117f7d11d | ltc-mweb/libmw | src/crypto/Pedersen.cpp | #include "Pedersen.h"
#include "ConversionUtil.h"
#include <mw/exceptions/CryptoException.h>
#include <mw/common/Logger.h>
#include <mw/util/VectorUtil.h>
Commitment Pedersen::PedersenCommit(const uint64_t value, const BlindingFactor& blindingFactor) const
{
secp256k1_pedersen_commitment commitment;
const int... | ALGO | 0.989204 | 7.226763 |
83b8dc64-809d-443b-a569-f1e37cf64ae1 | mit-acl/aclswarm | aclswarm/lib/codegen_admm/ADMMGainDesign3D/CXSparse/Source/cs_cumsum_ci.cpp | #include "cs.h"
/* p [0..n] = cumulative sum of c [0..n-1], and then copy p [0..n-1] into c */
double cs_cumsum(CS_INT* p, CS_INT* c, CS_INT n) {
CS_INT i, nz = 0;
double nz2 = 0;
if (!p || !c) {
return (-1);
} /* check inputs */
for (i = 0; i < n; i++) {
p[i] = nz;
nz += c[i... | ALGO | 0.999586 | 3.838272 |
825de9c3-7758-44ed-83d4-fa93177300f5 | bdcbqa314159/leetCodeWork | merge-two-sorted-lists/merge-two-sorted-lists.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLis... | ALGO | 0.999917 | 5.762478 |
e64254c6-2988-4e50-90f8-6660ba248b7f | MartinJK/Mafia-Definitive-Edition-ScriptHook | M1DEScriptHook/src/M1DEScriptHook.cpp | #include <windows.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <fstream>
#include <thread>
#include <chrono>
#include <algorithm>
#include <M1DEScriptHook.h>
#include <Common.h>
#include <LuaFunctions.h>
#include <ScriptSystem.h>
#include <hooking/hooking.h>
M1DEScriptHook::M1... | TOOL | 0.902305 | 4.446437 |
72863591-4235-4e17-a8a4-660d40258d05 | samridhrana06/C- | Basic maths/palindrome.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int a = 12;
int temp =a;
int ans = 0;
int i =0;
while (a!=0){
int re = a%10;
a = a/10;
ans = ans*10 +re;
}
if(ans == temp){
cout<<"palindrome";
}
else{
cout<<"Not palindrome";
}
// cout<<ans;
return 0;
} | ALGO | 0.99981 | 3.782504 |
0cb52017-e547-4652-9dd3-b14931c51e1e | OpenXRay/xray-soc-history | net.ssa/xrPlugins/xrCore/Source/rt_compressor.cpp | #include "stdafx.h"
#pragma hdrstop
#include "rt_lzo.h"
#define HEAP_ALLOC(var,size) \
lzo_align_t __LZO_MMODEL var [ ((size) + (sizeof(lzo_align_t) - 1)) / sizeof(lzo_align_t) ]
__declspec(thread) HEAP_ALLOC(rtc_wrkmem,LZO1X_1_MEM_COMPRESS);
void rtc_initialize ()
{
VERIFY (lzo_init()==LZO_E_OK);
}
u32 rtc_c... | TOOL | 0.935802 | 5.733191 |
44278b28-405a-4ed9-9c23-afaa34d99f41 | ping-72/DSA-Sheet-Algozenith | Binary_tree/IsBst.cpp |
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int val;
Node *left, *right;
Node(int x) : val(x), left(NULL), right(NULL) {}
};
bool isBst(Node *root)
{
// Complete the function
if (root == NULL)
return true;
queue<Node *> q;
q.push(root);
while (!q.empty())
... | ALGO | 0.999973 | 5.612851 |
94b4b097-f79d-41ee-b217-ec71fcb116f5 | Esheta10/GeeksForGeeks-Solutions | Difficulty: Easy/Find Maximum Sum Strictly Increasing Subarray/find-maximum-sum-strictly-increasing-subarray.cpp |
class Solution {
public:
int maxsum_SIS(int arr[], int n) {
// Your code goes here
int maxSum = 0;
for(int i=0;i<n;i++)
{
int sum = arr[i];
int j=i+1;
while(j<n && arr[j]>arr[j-1])
{
sum += arr[j];
j+... | ALGO | 0.999924 | 5.799037 |
8e28e5e9-1e87-48ef-8c0c-2446666be6c6 | AmanKumar2324/LeetCode_Practice | 2433_FindTheOriginalArrayOfPrefixArray.cpp | /*2433. Find The Original Array of Prefix Xor
Medium
492
25
Companies
You are given an integer array pref of size n. Find and return the array arr of size n that satisfies:
pref[i] = arr[0] ^ arr[1] ^ ... ^ arr[i].
Note that ^ denotes the bitwise-xor operation.
It can be proven that the answer is unique.
Example 1:
... | ALGO | 0.999997 | 5.766318 |
1fe4247d-6f20-4f76-b68d-d0c304ea7680 | opehn/codetree-TILs | 240920/계속 중첩되는 사각형/continuously-overlapping-squares.cpp | #include <iostream>
using namespace std;
#define GRID_SIZE 201
#define OFFSET 100
#define RED 1
#define BLUE 2
int main() {
int n;
cin >> n;
int grid[GRID_SIZE][GRID_SIZE] = {};
int x1, y1, x2, y2;
for(int k = 0; k < n; k++){
cin >> x1 >> y1 >> x2 >> y2;
x1 += OFFSET;
x2 +=... | ALGO | 0.994074 | 4.268101 |
58050170-c2ab-44d1-8afb-7141a5c3a68e | goldi1027/EHL | boost_1_64_0/libs/compute/perf/perf_stl_prev_permutation.cpp | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include "perf.hpp"
int rand_int()
{
return static_cast<int>((rand() / double(RAND_MAX)) * 25.0);
}
int main(int argc, char *argv[])
{
perf_parse_args(argc, argv);
std::cout << "size: " << PERF_N << std::endl;
// create ve... | ALGO | 0.994556 | 5.428024 |
6e2c2341-bfe1-4f8e-bd1c-bce1de5b7bfc | Nafyaz/my-codes | Codeforces/0404B.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
double a, d, dist;
ll n;
cin >> a >> d >> n;
cout << fixed << setprecision(6);
dist = 0;
while(n--)
{
dist += d;
dist -= floor(dist/a/4)*a*4;... | ALGO | 0.999895 | 3.260303 |
f9b61f7f-4204-4370-8ae6-ebfd8ed42b35 | chaochao42/self_calibrated_jnerf | contrib/mipnerf/python/jnerf/ops/op_include/eigen/doc/examples/make_circulant2.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
// [circulant_func]
template<class ArgType>
class circulant_functor {
const ArgType &m_vec;
public:
circulant_functor(const ArgType& arg) : m_vec(arg) {}
const typename ArgType::Scalar& operator() (Index row, Index col) const {
Index index = ... | ALGO | 0.998222 | 5.538595 |
c377010e-20d5-45a7-a831-4e77034dc54f | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_5872_2.cpp | #include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double PI = acos(-1.0);
const int INF = 2147483647;
const long long LLINF = 9223372036854775807;
int main() {
int n, x;
cin >> n >> x;
if (n == 3) {
cout << ">.v" << endl;
cout << "..." << endl;
cout << "^.<" << endl;
cou... | ALGO | 0.999925 | 3.08028 |
df9f736c-f5f1-430e-b76f-2b4908c67fda | Hasanul-Bari/codeforces | codeforces/1238/B.cpp | #include<bits/stdc++.h>
#define faster ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ull unsigned long long
const double PI = acos(-1.0);
using namespace std;
int main()
{
faster
int q,n,r;
cin>>q;
while(q--)
{
cin>>n>>r;
int a[n];
for(i... | ALGO | 0.999869 | 3.652467 |
7fe3641b-b258-4456-ac5e-67fccaf03efe | Saavrm26/mycppprogs | codeforces/practice/marketingscheme.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin>>t;
while(t--){
int l,r;
cin>>l>>r;
if(l*2>r){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
... | ALGO | 0.999929 | 4.122468 |
df4af0de-3f53-4b71-ad50-41bfd55f1914 | Fish-dev2/Cplusplus_HF_7 | Cplusplus_HF_7/cphoneitername.cpp | //JI9J9A Fzi Blint FELADAT7V2
#include "cphoneitername.h"
#include <algorithm>
CPhoneIterName::CPhoneIterName(CPhoneList& list) : m_cpList(&list), m_iCurrIndex(0)
{
orderNames();
}
CPhoneIterName::~CPhoneIterName() {}
Record* CPhoneIterName::begin() {
if (m_cpList->m_iFirstEmpty > 0) {
m_iCurrIndex ... | TOOL | 0.863263 | 4.256381 |
65a5525b-293f-4571-b8a3-f61b4437fc96 | leverimmy/Codes | 比赛/学校/2019-11-6测试/HB-熊泽恩/product/product.cpp | #include <bits/stdc++.h>
#define ll long long
#define rgi register int
#define rgl register long long
#define il inline
const int N = 200 + 10;
ll n, t[N], d[N], f[N][N];
struct node {
ll t, d;
} p[N];
il ll read() {
rgl x = 0, f = 0, ch;
while(!isdigit(ch = getchar())) f |= ch == '-';
while(isdigit(ch)) x = (x... | ALGO | 0.999908 | 3.606093 |
b4ea336c-067d-423a-b0b5-d65bfa3ba0de | BPhucKHMT/23521208_23521215_Bai02 | Bai144/Bai144.cpp |
#include <iostream>
#include <iomanip>
#include <cmath>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
bool primenumber(int);
int main()
{
int n;
cout << "Nhap n ";
cin >> n;
if (primenumber ( n))
cout << "NT";
else
cout << "Ko Nt";
system("pause");
return 0;
}
bool primenumber(int nn)
... | ALGO | 0.99569 | 3.910917 |
9cf99687-20b2-4f54-975d-080a58a8464a | tuankiet309/UDTT | ThucHanhSo3/Bai3.cpp | #include<iostream>
using namespace std;
float a[15]{3,5,1,4,2,6,8,7,9,122,22,14,15,12,19};
void mergeSort(int l,int r)
{
float b[15]{0};
if(r>l)
{
int m = (r+l)/2;
mergeSort(l,m);
mergeSort(m+1,r);
for(int i = m;i>=l;i--)
{
b[i] = a[i];
}
for(int j=m+1;j<=r;j++)
{
b[r+m+1-j] = a[j];
}
int ... | ALGO | 0.99958 | 3.334212 |
02d421ad-da0d-410a-bde1-781337b3faca | colllijo/Robocode | lib/json/tests/thirdparty/Fuzzer/FuzzerCrossOver.cpp | #include "FuzzerDefs.h"
#include "FuzzerMutate.h"
#include "FuzzerRandom.h"
#include <cstring>
namespace fuzzer {
// Cross Data1 and Data2, store the result (up to MaxOutSize bytes) in Out.
size_t MutationDispatcher::CrossOver(const uint8_t *Data1, size_t Size1,
const uint8_t *Dat... | ALGO | 0.982286 | 6.068955 |
bbca1e33-489a-4b24-8c84-0de01ce3d485 | kunalkatara12/DSA-Questions | Dynamic Programming/(117)Minimum Sum Path.cpp | /*
Link: https://leetcode.com/problems/minimum-path-sum/
Problem:64. Minimum Path Sum
Level: Medium
Company Tags: Amazon | Microsoft | Google | Goldman Sachs | Oracle | Apple | Uber | Square
Statement: Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the s... | ALGO | 0.999992 | 6.623373 |
19293d3c-67ad-447b-a977-431d8ac0ceeb | AsaPuls/WSQ | mastery19.cpp | #include <iostream>
using namespace std;
int main () {
int num1,num2;
cout << "give me 2 numbers: " << endl;
cin >> num1;
cin >> num2;
if (num1 > num2)
cout << "The 1st number is bigger than the 2nd number" << endl;
else if (num1 < num2)
cout << "The 1st number is smaller than the 2nd number" << en... | ALGO | 0.998165 | 3.068745 |
dc81a03b-07ab-47d7-abe8-d4a3eec26243 | tuura/compote | src/c++/BDD/base.cpp | /*
Author: Andrey Mokhov, Newcastle University
Date: 12 December 2012
Contact: andrey.mokhov@{ncl.ac.uk, gmail.com}
Description: BDD base implementation.
*/
#include <algorithm>
#include <limits>
#include "base.h"
namespace bdd
{
Base::Base(size_t cacheSize)
: sink(getNodeID(nullptr), getNodeID(nullptr), Node:... | ALGO | 0.979952 | 7.730646 |
5701a09b-b528-4b4e-a574-4a4e4de6e7c1 | BadBehavior/BadBehavior_T3D | Engine/source/core/strings/stringFunctions.cpp | #include <stdarg.h>
#include <stdio.h>
#include "core/strings/stringFunctions.h"
#include "platform/platform.h"
#if defined(TORQUE_OS_WIN) || defined(TORQUE_OS_XBOX) || defined(TORQUE_OS_XENON)
// This standard function is not defined when compiling with VC7...
#define vsnprintf _vsnprintf
#endif
//-----------------... | TOOL | 0.996058 | 4.930969 |
c5914e2b-87bc-42ff-ba2e-756964d02ece | codeelu/ACM_Summer | day17/AAAA.cpp | #include <bits/stdc++.h>
using namespace std; // ____ _ _ __ __
#define ll long long // / ___| | |_| | / /
const ll INF = 0x3f3f3f3f; // | | | _ | V /
const ll N = 5e4 + 5; // | |___ | | | | | |
const ll MOD = 1e9 + 7; // ____| |_| |_| |_|
//ll read() {
// ll x... | ALGO | 0.999381 | 4.30228 |
2c6cf61b-3a8f-4700-8f65-2fa5eb2a67fe | Gaurav-20/LeetCode-Solutions | 0844-backspace-string-compare/0844-backspace-string-compare.cpp | class Solution {
public:
string getActualString(string str) {
string strActual;
for (char& c: str) {
if (c == '#') {
if (strActual.size() > 0) {
strActual.pop_back();
}
} else {
strActual += c;
}
... | ALGO | 0.999668 | 6.051876 |
12d0bc9c-3268-49db-a490-906c89221607 | CakeForest/noip | 算法竞赛第二版std/ch8/UVa1471.cpp | // UVa1471 Defense Lines
// Rujia Liu
// Algorithm 1: use STL set to maintain the candidates.
// This is a little bit more intuitive, but less efficient (than algorithm 2)
#include<cstdio>
#include<set>
#include<cassert>
using namespace std;
const int maxn = 200000 + 5;
int n, a[maxn], f[maxn], g[maxn];
struct Candid... | ALGO | 0.999793 | 4.259089 |
fac7d851-59c9-448f-aafb-242b6f90038e | barrystyle/ravencoin-24.x | src/crypto/sha256.cpp | #include <crypto/sha256.h>
#include <crypto/common.h>
#include <assert.h>
#include <string.h>
#include <compat/cpuid.h>
#if defined(__linux__) && defined(ENABLE_ARM_SHANI) && !defined(BUILD_BITCOIN_INTERNAL)
#include <sys/auxv.h>
#include <asm/hwcap.h>
#endif
#if defined(MAC_OSX) && defined(ENABLE_ARM_SHANI) && !de... | ALGO | 0.999255 | 6.51263 |
51c263ea-c01f-4d8b-9b67-6b6776e5266a | abhikumr7248/CodeInCpp | A_Trust_Nobody.cpp | #include <iostream>
#include <vector>
#include <string>
#include <cstdio>
#include <algorithm>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll signed long long
#define ld long double
#define to_low(s) transform(s.begin(), s.end(), s.begin(), ... | ALGO | 0.999943 | 3.859831 |
9b95ad5b-9a42-4eca-b05e-fbbba6f951f4 | archallumin/ac | BOJ/5001 - 10000/8958.cpp | #include <iostream>
using namespace std;
int main(void) {
int t;
cin >> t;
while (t--) {
int cnt = 0, pnt = 0;
string a;
cin >> a;
for (int i = 0; i < a.length(); i++) {
if (a[i] == 'O') {
pnt++;
cnt += pnt;
} else {
pnt = 0;
}
}
cout << cnt << "\... | ALGO | 0.999159 | 4.800206 |
75a79e30-eeb1-477a-afaa-b340cf6870cb | bhanupgpt/leetcode-practice | 2379-maximum-total-importance-of-roads/2379-maximum-total-importance-of-roads.cpp | class Solution {
public:
long long maximumImportance(int n, vector<vector<int>>& roads) {
vector<long long> degree(n, 0);
for (vector<int>& edge : roads) {
degree[edge[0]]++;
degree[edge[1]]++;
}
sort(degree.begin(), degree.end());
long long value =... | ALGO | 0.999952 | 6.134337 |
a20b67d6-85b5-4388-9770-3aaf3f0f41ff | imulan/procon | atcoder/past202004-open/d.cpp | // clang-format off
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostrea... | ALGO | 0.999509 | 4.160022 |
5d689237-2a56-432e-8d20-410bcee72d79 | chenjunhao0315/Tensor | Tensor/ScatterGatherKernel.cpp | //
// ScatterGatherKernel.cpp
// Tensor
//
// Created by 陳均豪 on 2022/7/12.
//
#include "ScatterGatherKernel.hpp"
#include "TensorAdvancedIndexing.hpp"
#include "TensorIterator.hpp"
#include "Dispatch.hpp"
#include "Math.hpp"
namespace otter {
// Implement as functors since lambdas don't get optimized.
class Reduc... | ALGO | 0.997715 | 6.171503 |
ec7298d2-6102-4104-bc48-f4d591c41dd7 | napaholic/TIL-JAY | ProblemSolve/baekjoon/ps1940.cpp | //
// Created by jaewkim on 2023/07/17.
//
//#include <bits/stdc++.h>
//
//using namespace std;
//
//int cnt, sumVal, result;
//
//void print(vector<int> b) {
// int sum = b[0] + b[1];
// if (sum == sumVal) {
// result++;
// }
// return ;
//}
//
//void combi(int start, vector<int> &b, vector<int> &v) {
// if (b.size()... | ALGO | 0.999979 | 5.496559 |
be06da1b-9c4d-4c32-99ad-e0c0aad0fd29 | ishandutta2007/codeforces | xyf007/normal/1066/F.cpp | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
template <typename T>
void checkmax(T &x, T y) {
if (x < y) x = y;
}
... | ALGO | 0.999739 | 4.575614 |
bd54a9eb-6406-4376-b97c-421dbcc3a44f | fhvirus/CodeArchive | TIOJ/1204stack.cpp | #pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#include<cstdio>
#define FOR(i,n) for(int i=0;i<n;++i)
const int S = 1<<18;
inline char readchar(){
static char buf[S], *p = buf, *q = buf;
if(p==q&&(q=(p=buf)+fread(buf,1,S,stdin))==buf) return EOF;
return *p++;
}
inline int R(){
int ans = 0, c = readchar(), minus... | ALGO | 0.999809 | 3.863777 |
957ccd29-532b-4945-8516-c8ca7312722c | amitbansal7/Competitive-Programming | SPOJ/DOTAA.cpp | /* Amit Bansal - @amitbansal7 */
#include <bits/stdc++.h>
#include <string>
#define lli long long int
#define llu unsigned long long int
#define S(x) scanf("%d",&x)
#define Sl(x) scanf("%lld",&x)
#define Mset(p,i) memset(p,i,sizeof(p))
#define mlc(t,n) (t *)malloc(sizeof(t)*n)
#define NIL -1
#define INF INT_MAX
#define... | ALGO | 0.999719 | 3.636666 |
55e03204-0ac8-4465-8c8e-e31ad08e6aa4 | MA1ya1nk/mak.cpp | 7 may 2024/index.cpp | #include<iostream>
#include<string>
using namespace std;
class node{
public:
int data;
node* left;
node* right;
node(int data){
this->data=data;
this->right=NULL;
this->left=NULL;
}
};
node* buildtree(node* &root){
int data;
cout<<"enter the data "<<... | ALGO | 0.999638 | 3.703909 |
fa380e03-8fb8-4495-9eac-e19f6697ace7 | WenShihKen/uva | Zerojudge/a218 連猴子都會的小case.cpp | #include<stdio.h>
int all[100];
int main()
{
int many;
while (scanf("%d", &many) != EOF){
int i, temp, max = 0, j;
for (i = 0; i < 100; i++){
all[i] = 0;
}
for (i = 0; i < many; i++){
scanf("%d", &temp);
all[temp]++;
}
for (i = 0; i < 10; i++){
if (all[i]>max){
max = all[i];
}
}
for... | ALGO | 0.99995 | 3.546223 |
33efc888-783d-4474-9907-0f2d679c0ccc | aksaddleback/class-codes | S01/p4.cpp | #include<iostream>
using namespace std;
int main() {
int v1, v2, v3;
cout << "Enter 3 numbers: ";
cin >> v1 >> v2 >> v3;
int output = (v1 + v2) * v3;
cout << "The result is: " << output << endl;
} | ALGO | 0.995019 | 3.810904 |
29dd30ef-458a-4974-a26d-fbd4940bee85 | ung-steven/competitive_programming | DMOPC '18 Contest 4 P2 - Dr. Henri and Responsibility.cpp | #include <bits/stdc++.h>
#define MEM(a, b) memset(a, (b), sizeof(a))
#define PI 3.1415926535897932384626433832795
#define endl '\n'
#define exists(s, e) (s.find(e)!=s.end())
#define WHILE(n)
#define pb push_back
#define f first
#define s second
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()... | ALGO | 0.99988 | 3.806011 |
2872d771-2a29-470f-a104-186021906f44 | tanishq1200/DSA | Char and strings/Reverse vowels of a string.cpp | //Leetcode - https://leetcode.com/problems/reverse-vowels-of-a-string/
class Solution {
public:
bool checkVowel(char ch){
int ans = 0;
if(ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'){
ans = 1;
}
else if(ch == 'a' || ch == 'e' || ch == 'i' || ch ... | ALGO | 0.999928 | 6.609156 |
9f9a4f3b-14e5-4ad3-b471-e653acaf3cb8 | csbalint38/Lightning-Engine-Public | ContentTools/EnvMapProcessing.cpp | #include "ToolsCommon.h"
#include <DirectXTex.h>
#include <dxgi1_6.h>
using namespace DirectX;
using namespace Microsoft::WRL;
namespace lightning::tools {
namespace {
namespace shaders {
#include "EnvMapProcessing_equirectangular_to_cube_map_cs.inc"
};
constexpr u32 prefiltered_diffuse_cubemap_size{ 64 };... | TOOL | 0.856386 | 6.547868 |
1f8c9d03-b00d-4d83-8380-bbcd76092147 | amoudgl/leetcode-solutions | src/palindrome-partitioning.cpp | // Author: Abhinav Moudgil [ https://leetcode.com/amoudgl/ ]
class Solution {
public:
vector<vector<string>> partition(string s) {
vector<string> v;
if (s.empty())
{
ans.push_back(v);
return ans;
}
string prev = "";
f(s, 0, prev, v);
re... | ALGO | 0.999982 | 6.478447 |
95a46349-7496-4409-9704-792957e71b40 | abhijitmondall/XPSC | Contests/Codechef/CC_C3-Div4/Reach_5_Star.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int x, y;
cin >> x >> y;
if (x + y >= 2000)
{
cout << "YES" << '\n';
}
else
{
cout << "NO" << '\n';
}
return 0;
} | ALGO | 0.999896 | 3.206978 |
ede0b02c-45dc-4d16-a9e9-c468e855cd8c | KmrAnish04/100DaysOfCode | Recursion-Backtracking/73_Word_Break.cpp | // *************************** RECURSION-BACKTRACKING ***************************
/*
Problem Description:
Question Link:
GFG:
Leetcode:
pepcoding: https://www.pepcoding.com/resources/data-structures-and-algorithms-in-java-levelup/recursion-and-backtracking/wordbreak1official/ojquestio... | ALGO | 0.999969 | 5.532273 |
18713686-1abc-4d97-b086-6375151fcf04 | Vamsi192111558/CSA5742-FUNDAMENTAL-OF-COMPUTING | 5th problem.cpp | #include<stdio.h>
int main()
{
int n, sum=0;
printf("enter n value :");
scanf("%d",&n);
for(int i=1; i<=n; i++)
{
printf("%d+",i);
sum +=i;
}
printf("\b=%d",sum);
return 0;
}
| ALGO | 0.9995 | 3.194682 |
073bef20-55ae-4b1f-b748-17ebc1450d16 | NilayBadjatya/Interview_DS_Algo | Prefix Sum/Prefix Sum + Subarrays(Feels Like SW but actually Prefix Sum)/Contiguous Array.cpp | class Solution {
public:
int findMaxLength(vector<int>& nums) {
int n = nums.size();
vector<int> prefix(n);
if(nums[0] == 0){
prefix[0] = -1;
}else{
prefix[0] = 1;
}
for(int i = 1; i < n; i++){
prefix[i] = prefix[i-1] + (nums[i] ==... | ALGO | 0.99994 | 5.705169 |
3023a25f-b6ae-433f-992e-4d05a65864b7 | Redleaf23477/ojcodes | codeforces/edu72/A.cpp | //
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long int ll;
ll str, smart, ex;
void init();
void process();
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
int T; cin >> T;
while(T--)
{
init();
process();
}
cout.flush();
return 0;
}
... | ALGO | 0.999854 | 4.407308 |
ba148220-8d59-4f56-9f94-b07738cbf5d8 | DeepeshnotCool/LeetCode-Submissions | my-folder/problems/ransom_note/solution.cpp | class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
map<char, int> m;
for(auto it: ransomNote){
m[it]++;
}
for(auto it: magazine){
m[it]--;
}
for(auto it: m){
cout<<it.second<<endl;
if(it... | ALGO | 0.999808 | 5.92038 |
88f0c84d-d0f6-4164-a7a8-e7aba6d9ae87 | ACamaian/ActarDemonstrator-analysis-tool | hough/transformation/eigen/doc/examples/Tutorial_ArrayClass_interop.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
MatrixXf m(2,2);
MatrixXf n(2,2);
MatrixXf result(2,2);
m << 1,2,
3,4;
n << 5,6,
7,8;
result = (m.array() + 4).matrix() * m;
cout << "-- Combination 1: --" << endl << result << endl << e... | ALGO | 0.999467 | 4.555802 |
1672b1fd-d99b-433d-8cd7-df574d06da04 | ishandutta2007/codeforces | maxwellzen/normal/1670/E.cpp | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> iset;
typedef long long ll;
typedef long double db;
typedef string str;
typedef vector<int> vi;
typedef vector... | ALGO | 0.999732 | 4.607818 |
88ae509a-86f7-49e5-bdd0-a173c611a277 | rakib151p/CodeForces_Solution | C_Binary_String_Copying.cpp | /* Md Rakibul Islam
United International University
Dhaka,Bangladesh */
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define ull long long
#define uull unsigned long long int
#define pb push_back
#define p push
#define pop pop_back
#define pii pair<long long, long long... | ALGO | 0.999116 | 3.859554 |
94972aa4-48fa-4cf2-a507-ff6ee03b07bf | quocluongg/C-_PTIT | TH_02_LuongVoKhoiQuoc_N22DCPT077/bai6.cpp |
#include <iostream>
using namespace std;
void nhap(int **, const int &);
int tong_cheo(int **, const int &);
int main()
{
int n = 0;
while (n <= 0)
{
cout << "Nhap n: ";
cin >> n;
}
int **a = new int*[n];
for (int i = 0; i < n; i++)
{
a[i] = new int[n];
}
nhap(a, n);
cout << "Tong cac phan tu co... | ALGO | 0.999628 | 3.733769 |
38c33151-1a0d-4b4b-beea-7b938b83f53e | Bee0Theepob/Data_Struct | ex00m1.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
std::ios_base::sync_with_stdio(false); std::cin.tie(0);
int n,m,tmp;
vector<int> v;
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>tmp;
v.push_back(tmp);
}
int c=0,i=0;
while(true){
for(int x:v){
if(x==0... | ALGO | 0.999983 | 3.32012 |
ade6d561-833e-44b3-a273-3ff3b507135d | EdOoO21/codes-c-plus-plus | algo contests 4th module/1st dfs/1 dfs.cpp | #include <cstddef>
#include <cstdint>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <vector>
#include <sstream>
#include <string>
void dfs(size_t index, std::vector<bool>& peaks, std::vector<std::vector<int64_t>>& graph) {
peaks[index] = true;
for (auto neigh : graph[index]) {
if (!... | ALGO | 0.999925 | 3.98483 |
946e291d-c227-4087-b134-13864114ef67 | Kleadron-Software/Godot-1.0-XP | servers/physics/step_sw.cpp | /*************************************************************************/
/* step_sw.cpp */
/*************************************************************************/
/* This file is part of: */
/* ... | ALGO | 0.988715 | 3.712182 |
f5632487-7c41-4f32-97e1-2a3b59960e60 | hasancse91/LightOJProblems | LightOJ 1113 - Discover the Web.cpp | #include<iostream>
using namespace std;
int main()
{
int tCase,t,i,top,num,pos;
cin>>tCase;
for(t=1; t<=tCase; t++)
{
top=0;
pos=0;
string url[110],op,link;
url[0]="http://www.lightoj.com/";
cout<<"Case "<<t<<":\n";
while(true)
{
... | ALGO | 0.998309 | 3.650985 |
4dc597bf-2102-4c34-b3bf-a7727cc8854a | utec-cs-aed/solution_mix | MaxHeap/main.cpp | #include <iostream>
#include "heap.h"
using namespace std;
int main()
{
try
{
MaxHeap<int> heap(20);
heap.push(3);
heap.push(2);
heap.push(15);
cout << "Size is " << heap.size() << endl;
cout << heap.top() << " ";
cout << heap.pop() << " ";
heap.... | ALGO | 0.865644 | 4.424653 |
4fd181e8-a997-43bc-a562-c2c8a110d177 | ozakiryota/gaussian_sphere_slam | src/icp_optimization.cpp | #include <ros/ros.h>
#include <sensor_msgs/PointCloud2.h>
#include <geometry_msgs/PoseStamped.h>
#include <pcl/point_cloud.h>
#include <pcl/point_types.h>
#include <pcl/visualization/cloud_viewer.h>
#include <pcl_conversions/pcl_conversions.h>
#include <tf/tf.h>
#include <pcl/common/transforms.h>
#include <pcl/registra... | ALGO | 0.980009 | 4.36505 |
f8367f0e-e91a-449b-ba1f-24609fa65b75 | hyperaid/LEETCODE | 2955-account-balance-after-rounded-purchase/account-balance-after-rounded-purchase.cpp | class Solution {
public:
int accountBalanceAfterPurchase(int purchaseAmount) {
if((purchaseAmount%10)<5){
return 100-(purchaseAmount-(purchaseAmount%10));
}
return 100-(purchaseAmount+(10-purchaseAmount%10));
}
}; | ALGO | 0.989328 | 4.673308 |
55651dd3-e69b-4604-9abb-52ce55f1f61c | 17abd12/DSA | lab1/t5.cpp | // a) Write code of a function that swaps values of variables a and b. Input to the function should be the address of both the variables.
// b) Write code of a function that swaps values of the variables a and b using pointer-to-pointer variables ppa and ppb.
// Problem
#include <iostream>
using namespace std;
void sw... | ALGO | 0.999151 | 5.618323 |
3215aeab-cf94-4347-8ebf-f8291ba663c4 | vibieprince/CDC-LECTURES | LECTURE 3 21-05-2025/minimumDaysForBokeh.cpp | #include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
int minDays(vector<int>& bloomDay, int m, int k) {
// m bokesh banane hain
// use k adjacent flowers
// minimum days
// 1 se 10 ki banegi
// 5th pe kitne banenge
}
};
/*
35
278
367
6... | ALGO | 0.999942 | 5.49693 |
7c1e332b-0322-4cae-9d7d-d32197d655f7 | Kavin1421/Leetcode-Solution | 2600-2699/2609.Find the Longest Balanced Substring of a Binary String/Solution2.cpp | class Solution {
public:
int findTheLongestBalancedSubstring(string s) {
int zero = 0, one = 0;
int ans = 0;
for (char& c : s) {
if (c == '0') {
if (one > 0) {
zero = 0;
one = 0;
}
++zero;
... | ALGO | 0.999972 | 6.043231 |
c3f01697-799c-4166-8d2c-069a8bcc1049 | uv-7/DAA_LabManual | week2/q1.cpp | #include<iostream>
using namespace std;
int Binary_search_Firstoccurence(int arr[],int n,int key)
{
int res=0;
int low=0,high=n-1;
while (low<=high)
{
int mid=low+(high-low)/2;
if (key==arr[mid])
{
res=mid;
high=mid-1;
}
else if (key>ar... | ALGO | 0.999832 | 4.268965 |
468e9ce1-8dc8-4c2a-8cee-c6883a48166e | vinhhungpugg/My_LT | day_con_tang.cpp | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> M(n), N(n, 1), prev_index(n, -1);
for (int i = 0; i < n; i++)
cin >> M[i];
int dem = 0, end_index = 0; // end_index là chỉ số của phần tử cuối cù... | ALGO | 0.999999 | 4.402853 |
663f5b0e-69a8-499a-b266-a8f864f85c9a | nanodesu-kirara/cpp | mop/dp/CombinationString.cpp | /**
* 5.4 交替字符串
* 交替s1 和 s2 组成 s3
* 不改变原本的相对顺序
*/
#include<vector>
#include<string>
#include<iostream>
using std::vector;
using std::string;
bool widget(const string&, const string&, const string&);
int main()
{
string s1{"aabcc"};
string s2{"dbbca"};
// string s3{"aadbbcbcac"};
string s3{"accab... | ALGO | 0.99995 | 5.219631 |
07f30ee9-bd03-4e54-be27-cc6ddaa1bb34 | sunnylpu/sunny-code | c++ programming/loops/reverse_of_a_number.cpp | #include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int reversed=0;
while(n!=0){
int digit=n%10;
reversed=reversed*10 + digit;
n=n/10;
}cout<<"reverse is: "<<reversed;
} | ALGO | 0.999964 | 4.71031 |
b9ea1a1f-dc6d-43c0-a8d6-b872c4b2d8ff | StefanosVav/Multithreaded-Programming-CPP | Syspro/PROJECT2/SkipList.cpp | #include <string>
#include <iostream>
#include "SkipList.h"
#include "citizen.h"
#include "date.h"
using namespace std;
//SKIP NODE CONSTRUCTOR
SkipNode::SkipNode(int citizenID, int level, citizen *c)
{
ID = citizenID;
Citizen = c;
forward = new SkipNode*[level+1]{0}; //Initialize and fill forward arr... | ALGO | 0.998999 | 4.458472 |
004f7350-2e85-4343-909d-61380100731d | dude123studios/USACO | USACO-Silver/Grind/practice/t.cpp | #include <bits/stdc++.h>
using namespace std;
bool v[10];
vector<int> curr;
int val()
{
int sum = 0;
for (int x : curr)
{
sum = sum * 10 + x;
}
return sum;
}
void dfs(int i)
{
if (i != 0 && val() % i != 0)
return;
if (i == 10)
{
for (int x : curr)
{
... | ALGO | 0.999634 | 5.58226 |
57292fd0-c29d-4e71-aaa2-24276297fb69 | BCHSBC/ProgrammerSLV | 프로그래머스/lv3/12979. 기지국 설치/기지국 설치.cpp | #include <iostream>
#include <vector>
using namespace std;
int solution(int n, vector<int> stations, int w)
{
long answer = 0;
long start = 1;
long div = 2*w + 1;
for(int i = 0;i<stations.size();i++){
if(i == 0){
if(stations[i] - w > 1){
long res = stations[i] - w -1... | ALGO | 0.999836 | 3.989455 |
99880c9f-417c-4a42-9831-319bb7b8c43e | forward0606/code_book | code_book/tree/LowCommonAnsectorDjset.cpp | // use the concept of union and find to find LCA
// outline algorithm
// O(NlogN)
#define INF 100000008
#define maxSize 200005
#define root 1
vector< vector<int> > adj;
vector<vector<pair<int, int> > > query;
int vis[200005];// structure like disjoinset
int ans[200005];// the ans of the Nth query
void init(int n){
... | ALGO | 0.999947 | 4.41438 |
5d0fd655-08b7-4116-af92-8aeac168231d | Cpasjuste/boost | libs/histogram/examples/getting_started_listing_01.cpp | // clang-format off
//[ getting_started_listing_01
#include <algorithm> // std::for_each
#include <boost/format.hpp> // only needed for printing
#include <boost/histogram.hpp> // make_histogram, regular, weight, indexed
#include <cassert> // assert (used to test this example for correctness)
... | TOOL | 0.92421 | 7.241726 |
d11c487e-89aa-49b1-83ca-9d6e5700fbf6 | lvokic/miniob_lvokic | src/observer/sql/optimizer/predicate_pushdown_rewriter.cpp | //
// Created by Wangyunlai on 2022/12/30.
//
#include "sql/optimizer/predicate_pushdown_rewriter.h"
#include "common/log/log.h"
#include "sql/expr/expression.h"
#include "sql/operator/logical_operator.h"
#include "sql/operator/table_get_logical_operator.h"
RC PredicatePushdownRewriter::rewrite(std::unique_ptr<Logica... | ALGO | 0.978126 | 5.804819 |
e0de1958-97d5-4fbe-88e4-c5cbb7611277 | BillTsaiFlute/TU-SciComp-Code-WS22-23 | 05-hailstone/ex02_autograde.cpp | // TK25Oct2022
#include <cstdio>
#include <iostream>
#include <memory>
#include <stdexcept>
#include <string>
#include <array>
#include <random>
#include <limits>
#include <vector>
using namespace std;
int const default_samples = 5;
int const min_start = 1;
int const max_start = 10'000;
int const cache_s... | TEST | 0.999087 | 5.576698 |
41d8cdbf-e928-4a6d-b0a2-354af05cd6a2 | facebookarchive/clangir | libc/src/math/aarch64/sqrtf.cpp | #include "src/math/sqrtf.h"
#include "src/__support/common.h"
namespace __llvm_libc {
LLVM_LIBC_FUNCTION(float, sqrtf, (float x)) {
float y;
__asm__ __volatile__("fsqrt %s0, %s1\n\t" : "=w"(y) : "w"(x));
return y;
}
} // namespace __llvm_libc
| ALGO | 0.958265 | 4.445354 |
4265d0aa-28a0-4563-b610-b2f664a70820 | smritiiD7/Leet_Coding | 3-longest-substring-without-repeating-characters/3-longest-substring-without-repeating-characters.cpp | class Solution {
public:
int lengthOfLongestSubstring(string s) {
if(s=="") return 0;
set<char> set1;
int ans = INT_MIN;
int i=0,j=0, n=s.length();
while(i<n && j<n)
{
if(set1.find(s[j])==set1.end())
{
set1.insert(s[j++]);
... | ALGO | 0.999906 | 5.72179 |
8abdac96-9d6e-4431-ace4-731efdd81503 | kamala228/ConsoleApplication31 | ConsoleApplication31/ConsoleApplication31.cpp | #include <iostream>
#include <vector>
using namespace std;
class Project {
public:
string name;
string description;
string status;
Project(string n, string d) : name(n), description(d), status("активний") {}
void change_status(string new_status) {
status = new_status;
}
void show... | TOOL | 0.911484 | 5.663151 |
e1bb7b1f-7ff8-42f2-97c7-94234c60cb80 | OmniLayer/omnicore-lite-deprecated | src/pow.cpp | #include "pow.h"
#include "arith_uint256.h"
#include "chain.h"
#include "primitives/block.h"
#include "uint256.h"
#include "util.h"
unsigned int GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlockHeader *pblock, const Consensus::Params& params)
{
unsigned int nProofOfWorkLimit = UintToArith256(params.... | ALGO | 0.998993 | 7.272558 |
5b43249c-b76e-47b4-b293-9ddabacdce7f | LMFRomero/SRS_Cards | boost/libs/compute/perf/perf_stl_includes.cpp | #include <vector>
#include <algorithm>
#include <iostream>
#include "perf.hpp"
int rand_int()
{
return static_cast<int>((rand() / double(RAND_MAX)) * 25.0);
}
int main(int argc, char *argv[])
{
perf_parse_args(argc, argv);
std::cout << "size: " << PERF_N << std::endl;
std::vector<int> v1(PERF_N);
... | TEST | 0.967148 | 5.960803 |
40a24ec1-886b-4294-abd2-e626f50091b7 | Karishmawanchoo/DSA-using-cpp- | queue.cpp | #include<iostream>
#include<queue>
using namespace std;
int main()
{
queue<string> q;
q.push("abha");
q.push("sabha");
q.push("mabha");
//size
cout << "Size of the queue is: " << q.size() << endl;
//front
cout << "Front element of the queue is: " << q.front() << endl;
//pop
q.po... | ALGO | 0.857937 | 4.60149 |
9fc9431c-24cb-40c6-9f68-dc40ed71281e | Akshit1903/cpp-code-templates | companies/phonepe/Max Frequency.cpp | #include <bits/stdc++.h>
using namespace std;
int getMaxFreq(vector<int>&arr,long long x,int n){
if(n==0){
return 0;
}
int j=0;
for(int i=1;i<n;i++){
x-=(arr[i]-arr[i-1])*(i-j);
if(x<0){
x+=arr[i]-arr[j];
j++;
}
}
return n-j;
}
int main() {
... | ALGO | 0.999922 | 4.752202 |
4d8e9d1b-ef57-45a4-89be-b0d7c5ec8b2a | ArtemKovera/data-structures-cpp | linkedlist.cpp | // implementation of simple singly linked list in C++
//THERE IS A NEWER version of singly linked list in this repo
#include<iostream>
#include<string>
class LinkedList
{
private:
//basis structure for a node
struct Node;
//node count
int count;
//pointer pointing to first node
Node* first;... | ALGO | 0.999569 | 5.318061 |
db6ae732-f25e-4946-add1-ec1a7883b988 | morishita8256/AtCoder | ABC/161-180/ABC167/B - Easy Linear Programming.cpp | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#defi... | ALGO | 0.999872 | 3.633863 |
976ad7ba-f204-4c95-91d1-fe2112a2abff | JimmieKJ/unrealCode | UnrealEngineGitHub/Engine/Source/Editor/UnrealEd/Private/SnappingUtils.cpp | #include "UnrealEd.h"
#include "SnappingUtils.h"
#include "ScopedTransaction.h"
#include "Editor/LevelEditor/Public/LevelEditor.h"
#include "Editor/LevelEditor/Public/LevelEditorActions.h"
#include "VertexSnapping.h"
#include "ViewportSnappingModule.h"
#include "GameFramework/PhysicsVolume.h"
#include "GameFramework/Wo... | TOOL | 0.870723 | 6.113499 |
8597f794-42bd-41fd-b07a-7ed06bf31f06 | rivercity310/study | algorithm/algorithm_cpp/prj/chap1_04_iterator_usercontainer.cpp | #include <iostream>
using namespace std;
struct singly_ll_node {
int data;
singly_ll_node* next;
};
class singly_ll {
private:
using node = singly_ll_node;
using node_ptr = node*;
node_ptr head;
public:
void push_front(int val) {
auto new_node = new node{ val, NULL };
if (head != NULL)
new_node->next =... | ALGO | 0.997528 | 4.948229 |
97e35551-93c9-4382-980e-0c1b7eb342d5 | Wasisirshar/course | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.9988 | 6.76073 |
8842368c-5e05-45ce-a9c3-41acf83231db | sunkuet02/problem-solving | Accepted Code/UVA/11062 - Andy's Second Dictionary.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
set<string>v;
set<string> ::iterator it;
string temp = "" ;
while(getline(cin,s))
{
std::transform(s.begin(), s.end(), s.begin(), ::tolower);
for(int i = 0 ; i< s.size() ; i ++ )
{
if((s[i... | ALGO | 0.991226 | 3.886843 |
f6b8722d-bbab-4411-b87a-3b37a638b83d | aksh-bhatt/DAA | q3.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++) cin>>v[i];
int key;
cin>>key;
int idx = -1;
int flag = 0;
int from = 0;
int x = 0;
... | ALGO | 0.999953 | 4.467648 |
1fedabd9-5459-4443-b450-867deadafc5e | osalbahr/Learn-Programming | codeforces/2000/a.cpp | #include <iostream>
using namespace std;
string solve()
{
string s;
cin >> s;
if (s.size() < 3)
return "NO";
if (s.substr(0, 2) != "10")
return "NO";
if (s[2] == '0')
return "NO";
int x = 0;
sscanf(s.c_str() + 2, "%d", &x);
if (x >= 2)
retur... | ALGO | 0.997471 | 4.612124 |
2cc63ff1-233b-4629-8b40-8a627601f1a3 | ffrige/SDC-PathPlanning | src/Eigen-3.3/doc/examples/TutorialLinAlgExComputeSolveError.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
MatrixXd A = MatrixXd::Random(100,100);
MatrixXd b = MatrixXd::Random(100,50);
MatrixXd x = A.fullPivLu().solve(b);
double relative_error = (A*x - b).norm() / b.norm(); // norm() is L2 norm
cout << "The ... | ALGO | 0.99955 | 3.625966 |
ec2464f7-653e-4e3a-a109-00d730256db7 | gitpat-ea/Visual_Studio | 30.03/one_way_list.cpp | #include <iostream>
struct OneWaynode{
int data;
OneWaynode *next;
};
OneWaynode* add_node(int data, OneWaynode * head){
OneWaynode* new_ptr = new OneWaynode();
new_ptr->data = data;
new_ptr->next = head;
return new_ptr;
}
struct OneWayList{
OneWaynode * top = nullptr;
};
void add_after(... | ALGO | 0.999792 | 4.255424 |
70d32ef2-6c22-49a2-9de4-3996042645d6 | BonexGoo/Boss2D | Boss2D/addon/opencv-4.1.1_for_boss/samples/cpp/morphology2.cpp | #include "opencv2/imgproc.hpp"
#include "opencv2/imgcodecs.hpp"
#include "opencv2/highgui.hpp"
#include <stdlib.h>
#include <stdio.h>
#include <string>
using namespace cv;
static void help()
{
printf("\nShow off image morphology: erosion, dialation, open and close\n"
"Call:\n morphology2 [image]\n"
"This p... | TOOL | 0.895717 | 5.165823 |
545ebef7-55f2-4e13-abc9-87c3d6b80fa8 | fisyak/TFG | StRoot/StarGenerator/EvtGen1_06_00/src/EvtGenBase/EvtDalitzReso.cpp | #include "EvtGenBase/EvtPatches.hh"
/*****************************************************************************
* Project: BaBar detector at the SLAC PEP-II B-factory
* Package: EvtGenBase
* File: $Id: EvtDalitzReso.cpp,v 1.1 2016/10/28 16:52:45 jwebb Exp $
*
* Description:
* Class to compute Dalitz ampli... | ALGO | 0.95802 | 5.725775 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.