uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
66cbe9b2-6bdd-4d65-acf7-ca758fa7d655 | yunjichoi9151/Front-end_Algorithm_Study | Algorithm/GMG/숨바꼭질_1697.cpp | // visited 관리를 하지 않아 이미 들른 곳을 계속 들렀고, 메모리가 터졌다.
#include <iostream>
#include <queue>
using namespace std;
int main()
{
int N, K, location, time;
cin >> N >> K;
queue<int> ql;
queue<int> qt;
bool visited[100001] = {false};
visited[N] = true;
ql.push(N);
qt.push(0);
while(!ql.empty())
{
location = ql.fr... | ALGO | 0.999869 | 4.042873 |
ae4b8bbf-dc57-4c0d-825e-91520e4cee44 | simgksk/Baekjoon | Cpp/11xxx /11549.cpp | #include <iostream>
using namespace std;
int main()
{
int t;
int abcde;
int n = 0;
cin >> t;
for (int i = 0; i < 5; i++)
{
cin >> abcde;
if (abcde == t)
n++;
}
cout << n;
return 0;
}
| ALGO | 0.99976 | 4.100378 |
d3f770f0-b433-4e8e-a212-8c2f9220b31f | saltowl/OOP_5 | OOP_5/FileParser.cpp | #include "FileParser.h"
using namespace std;
// TODO: add condition_variable to WriteFile()
FileParser::FileParser(const string& in, const string& out) : inFile(in), outFile(out) {}
void FileParser::Calculation()
{
while (!stop)
{
unique_lock<mutex> lck(mut);
while (!notified) // loop to avoid spurious wakeu... | ALGO | 0.991186 | 3.735719 |
6a9bc06a-eb6c-448a-8c53-94c5cf082dad | ShyamSanjeyS/Data-Structures-Works | DLL.cpp | #include<iostream>
using namespace std;
struct node{
int data;
node *back;
node *fore;
};
struct list{
int count;
node *head;
node *rear;
};
class DLL{
list *Dlist;
public:
DLL(){
Dlist=NULL;
}
void createDLL(){
Dlist = new list;
Dlist->head=NULL;
... | ALGO | 0.999764 | 4.17326 |
3bd909c3-4460-4a3a-b042-7d8dd95a6fa1 | sarvex/solution-cpp | 2105.watering_plants_ii.cpp | class Solution {
public:
int minimumRefill(vector<int>& plants, int capacityA, int capacityB) {
int i = 0, j = plants.size() - 1;
int ans = 0, a = capacityA, b = capacityB;
while (i <= j) {
if (i == j) {
if (max(capacityA, capacityB) < plants[i]) ++ans;
... | ALGO | 0.999962 | 5.982135 |
8b5ad01b-e250-4915-8c05-d1fd323931f4 | rutuja-patil923/Data-Structures-and-Algorithms | Stack/nextGreater.cpp | vector<long long> nextLargerElement(vector<long long> arr, int n)
{
unordered_map<long long,long long> up;
vector<long long> ans;
stack<long long> st;
st.push(arr[0]);
for(int i=1;i<n;i++)
{
while(!st.empty() && st.top()<arr[i])
... | ALGO | 0.999993 | 4.713272 |
fb43fa0a-d867-4bc4-a8d0-a51e3978e5f4 | ishandutta2007/codeforces | chemthan/normal/700/A.cpp | #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
... | ALGO | 0.999905 | 3.499312 |
cba60dcc-5143-4b1a-bb49-389d64f7c848 | Rinnnt/CompetitiveProgramming | Codeforces/c1843/D.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nl '\n'
vector<vector<ll>> al(254001);
ll leaves[254001];
void find_leaves(ll cur, ll parent) {
ll ls = 1;
for (ll child : al[cur]) {
if (child != parent) {
find_leaves(child, cur);
ls += leaves[child];
}
}
if (ls ... | ALGO | 0.999735 | 4.496474 |
b5ced9c2-1c1a-4fdd-8d86-e721f4ec953e | Anemois/Codeforces | 891_3-F.cpp | //2023/12/17
#include <bits/stdc++.h>
#define Anemoi ios_base::sync_with_stdio(false);cin.tie(0);
#define int long long
using namespace std;
const int MAX = 2e9;
void solve(){
int n;
cin >> n;
map<int, int> mp;
for(int i=0; i<n; i++){
int x;
cin >> x;
mp[x]++;
}
int q;
cin >> q;
while(q--){
int b, c;
... | ALGO | 0.999667 | 4.645752 |
bf2b0d86-c9e2-4891-9c1e-444ce4dd8c17 | Ayush-Rawal/OS | 3-25.cpp | #include<iostream>
#include<queue>
#include<vector>
using namespace std;
class Process {
public:
int at, bt, priority;
Process(int a, int b, int p) {
at = a;
bt = b;
priority = p;
}
int doProc() {return --bt;}
int complete() {return bt;}
};
void priorityWithPreempt(vec... | ALGO | 0.999824 | 4.817772 |
71fb101f-50b8-43be-89a9-b8ba911aecd0 | pandey-kumar/cpp- | codes/CPP/Arrays L11-L16/2D arrays/L15/01_Matrix_Multiply.cpp | //Write a programme to print the multiplication of two matrix given by the user>>
# include<iostream>
# include<bits/stdc++.h>
using namespace std;
int main(){
int m;
cout<<"Enter rows of 1st matrix: ";
cin>>m;
int n;
cout<<"Enter column of 1st matrix: ";
cin>>n;
int p;
cout<<"Enter row... | ALGO | 0.997915 | 3.453407 |
02e26169-f4f7-410e-8ba8-3e80b91e3589 | skift-org/karm | src/libs/karm-image/png/decoder.cpp | module;
#include <karm-gfx/canvas.h>
#include <karm-logger/logger.h>
export module Karm.Image:png.decoder;
import Karm.Core;
import Karm.Archive;
import Karm.Debug;
namespace Karm::Image::Png {
static Debug::Flag debugPng{"png"};
enum struct ColorType : u8 {
GREYSCALE = 0,
TRUECOLOR = 2,
INDEXED = 3,
... | TOOL | 0.944633 | 5.932606 |
564b5194-f0ee-4195-abae-627184a28a28 | tothbotond00/Education | 1.Félév/Programozás/Projektek/8Array/main.cpp | #include <iostream>
#include <time.h>
#include <stdlib.h>
#include <sstream>
using namespace std;
enum error{VanNulla,RosszMeret};
//Keretprogram a tömbös feladatokhoz
//Tömb maximális mérete
const int maxsize=1000;
//Tömb feltöltése konzolról
//n - tömb mérete
void FillArrayFromConsol(int x[],int &n);
//Tömb fel... | TOOL | 0.947261 | 3.281389 |
74b8e868-62cd-4f84-aa8e-07f2899a6953 | rayz/algorithms | ac/142/c.cpp | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
map<int, int> m;
for(int i = 0; i < n; i++){
int x;
cin >> x;
m[x] = i+1;
}
for(int i = 1; i <= n; i++){
... | ALGO | 0.999962 | 4.205637 |
5cfffbae-3ec3-410d-8b35-df3d168b8eed | pennymaxlw/Algorithms_and_Data_Structures | problems/ms100/ms100New_012.cpp | #include <iostream>
using namespace std;
bool CheckContinuousArray(int arr[5]) {
int min = -1, max = -1;
for (int i = 0; i < 5; ++i) {
if (arr[i] == 0) continue;
if (arr[i] > max) max = arr[i];
if (arr[i] < min) min = arr[i];
}
if (min == -1 || max == -1)
return true;
else
return (max - m... | ALGO | 0.999223 | 3.928542 |
dc9886d1-3f00-4c91-ae86-c33f30b203ac | YuvarajP/usdc_planning | project/starter_files/eigen-3.3.7/test/sparseLM.cpp | #include "main.h"
#include <Eigen/LevenbergMarquardt>
using namespace std;
using namespace Eigen;
template <typename Scalar>
struct sparseGaussianTest : SparseFunctor<Scalar, int>
{
typedef Matrix<Scalar,Dynamic,1> VectorType;
typedef SparseFunctor<Scalar,int> Base;
typedef typename Base::JacobianType JacobianT... | TEST | 0.989792 | 6.130261 |
0be2337b-7b35-4ff8-8a77-43281f197b4a | Mrsuyi/algorithm | leetcode/188.cpp | #include <iostream>
#include <vector>
#include <stack>
#include <string>
#include <unordered_map>
#include <algorithm>
#include <set>
#include <queue>
#include <unordered_set>
using namespace std;
class Solution
{
public:
int maxProfit(int k, vector<int>& prices)
{
int len = prices.size();
if (len < 2 || k < 1)... | ALGO | 0.982196 | 4.550688 |
4b815492-ea04-4293-9bb3-354a0a4f4ead | TCGBench/TCGBench | data/problems/problems_noip/problems_noip/P1019/P1019_std.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<string> words(n);
for(auto &s: words) cin>>s;
char start_char;
cin>>start_char;
// Precompute overlap
// overlap[i][j] = maximum k where words[i] suffix k == words[j] prefix k
vector<vector<int>> ov... | ALGO | 0.999897 | 4.730821 |
8299df13-fcf6-4da7-b242-17576e897c5c | OperDoc/newOlimp | String/base.cpp | #include <bits/stdc++.h>
using namespace std;
void pf(string &s, vector<int> &ans) {
for (int i = 1; i < s.size(); i++){
int j = ans[i - 1];
while (j > 0 && s[i] != s[j])
j = ans[j - 1];
if (s[i] == s[j])
j++;
ans[i] = j;
}
}
void zf(string &s, vector<int> &ans){
for (int i = 1, l ... | ALGO | 0.999959 | 4.033765 |
550b7fac-314c-44c2-8919-35a6791480c6 | roma6kk/AaP_Labs_2SEM | Lab1/Lab1(4)E3.cpp | #include <iostream>
#include <cmath>
using namespace std;
double dichotomyMethod(double (*equation)(double), double a, double b, double e) {
double c;
while (fabs(b - a) > e) {
c = (a + b) / 2.0;
if (equation(c) == 0.0)
return c;
else if (equation(a) * equation(c) < 0)
... | ALGO | 0.999995 | 4.441014 |
31ee76d8-89b7-47f1-8426-4ff1dfd4633d | fire855/android_frameworks_av-mtk | camera/mediatek/MtkCameraParameters.cpp | #define LOG_TAG "MTKCameraParams"
#include <utils/Log.h>
#include <string.h>
#include <stdlib.h>
#include <camera/MtkCameraParameters.h>
namespace android {
//++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
// App Mode.
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++... | CONFIG | 0.862749 | 6.070403 |
d6f8d87c-9e89-4f0f-af44-ccc19268a537 | doviethung11192023/code_c_pluss_pluss_2 | bai 25 buoi 10 xep tre.cpp | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
int cnt=0;
int baby_left= 0;
int baby_right=n-1;
while (baby_left<=baby_right){
if(a[baby_left]+a[baby_right]<=m){
cnt++;
baby_left++;
baby_right--... | ALGO | 0.999994 | 3.823568 |
ccd77800-4dda-4268-b5ec-a15acff3951a | prince8809/algorithm_notebook | Common Algorithm/fibonacci_normal_recursion.cpp | #include<bits/stdc++.h>
#define lli long long int
using namespace std;
lli comp=0;
lli fibonacci(lli n)
{
comp++;
if(n==1)
return 0;
if(n==2)
return 1;
return fibonacci(n-1)+fibonacci(n-2);
}
int main()
{
lli n;
cin>>n;
cout<<fibonacci(n);
//cout<<fibarray[3];
cout<<"\ncomple... | ALGO | 0.999921 | 3.785634 |
7a33e76a-f4a9-42d3-ab8e-c4fea43e4fba | DrZhang818/my-first-project | Problems/Codeforces/Contests/Round1029/D.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
typedef unsigned long long ull;
const int inf = 1000000000;
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
int d = a[2] -... | ALGO | 0.999868 | 3.937233 |
eff00c0b-94bc-42e4-ba41-ebb1e711c77a | MTG/gaia | src/tools/gaiabench.cpp | #include <QCoreApplication>
#include <iostream>
#include "dataset.h"
#include "frozendataset.h"
#include "frozensearch.h"
#include "distancefunction.h"
#include "timer.h"
#include "view.h"
using namespace std;
using namespace gaia2;
ParameterMap parseOptions(int argc, char* argv[]) {
if (argc < 2) {
G_ERROR("not... | ALGO | 0.961417 | 6.250512 |
9c755820-14ca-457b-abf7-cd1e09c69f99 | Leapense/problems | 23910번: Alien Piano/Alien Piano.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
for (int tc = 1; tc <= T; tc++)
{
int K;
cin >> K;
vector<int> A(K);
for (auto &x : A)
cin >> x;
vector<int> prev_cost(5, ... | ALGO | 0.999846 | 4.828706 |
7286b1db-333b-434e-bec1-9620f28ef03f | Stefanstud/leetcode-env | data/leetcode_solutions/solutions/0072. Edit Distance/0072.cpp | class Solution {
public:
int minDistance(string word1, string word2) {
const int m = word1.length();
const int n = word2.length();
// dp[i][j] := min # of operations to convert word1[0..i) to word2[0..j)
vector<vector<int>> dp(m + 1, vector<int>(n + 1));
for (int i = 1; i <= m; ++i)
dp[i][... | ALGO | 0.999987 | 6.281842 |
f936ab5a-e870-48ab-94b6-42f550dc07e4 | danghoangnhan/leetcode | contest/2816.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* recursi... | ALGO | 0.99986 | 6.366801 |
e2efb3b0-f690-4afe-8c0b-981da0efc7d3 | shacojx/SourceCodeGameTLBB | Game/boost/libs/graph/example/topo-sort-file-dep2.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, ... | ALGO | 0.999688 | 5.68406 |
b2439ea7-aede-44a9-aa53-64a4cbe442a7 | ishandutta2007/codeforces | galen_colin/normal/1407/A.cpp | #include <bits/stdc++.h>
using namespace std;
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define f first
#define s second
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
typedef long long ll;
typedef long double lld;
... | ALGO | 0.999953 | 3.678166 |
1e37e9c7-199e-4a3f-a8f1-9392c57ddd8d | tanmaybansal97/new | samples/cpp/tutorial_code/ml/introduction_to_pca/introduction_to_pca.cpp | /**
* @file introduction_to_pca.cpp
* @brief This program demonstrates how to use OpenCV PCA to extract the orienation of an object
* @author OpenCV team
*/
#include <iostream>
#include <opencv2/opencv.hpp>
using namespace std;
using namespace cv;
// Function declarations
void drawAxis(Mat&, Point, Point, Scalar... | ALGO | 0.999627 | 7.420601 |
2639f711-10d7-4faf-b8e4-332ccb3bb793 | ipsavitsky/leetcode-solutions | 0098.validate-binary-search-tree.cpp | /**
* @file 0098.simplify-path.cpp
* @author Ilya Savitsky (<EMAIL>)
* @brief https://leetcode.com/problems/validate-binary-search-tree/
* @version 0.1
* @date 2024-07-07
*
* @copyright Copyright (c) 2023
*
*/
#include <iostream>
#include <optional>
#include <tuple>
struct TreeNode {
int val;
TreeNode... | ALGO | 0.999256 | 6.962517 |
9e4a9da5-ca96-42e5-adb1-397f51977b16 | maligir/temp | third_party/opencv/opencv/samples/cpp/tutorial_code/Histograms_Matching/calcHist_Demo.cpp | /**
* @function calcHist_Demo.cpp
* @brief Demo code to use the function calcHist
* @author
*/
#include "opencv2/highgui.hpp"
#include "opencv2/imgcodecs.hpp"
#include "opencv2/imgproc.hpp"
#include <iostream>
using namespace std;
using namespace cv;
/**
* @function main
*/
int main(int argc, char** argv)
{
... | ALGO | 0.940175 | 6.780258 |
a4f22b7d-6618-4714-8e83-af3445f3bb54 | Eliud-Garcia/Programa2-Notebook | cpp/Data Structures/sqrt decomposition.cpp |
//minimum range queries with updates
const int oo = 1e9 + 50;
const int MAXN = 2e5 + 5;
const int S = sqrt(MAXN);//block size
const int B = MAXN / S + 1; //# de bloques
int a[MAXN];
int blocks[B];
int get_idx(int i){
//es el indice donde inicia el
//bloque en el que cae i
return (i / S) * S;
}
int mai... | ALGO | 0.999707 | 4.595287 |
dd030588-fe8f-4151-ac47-a00df236a23b | 7aeHoon/BaekJoon | 프로그래머스/0/120923. 연속된 수의 합/연속된 수의 합.cpp | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> solution(int num, int total) {
vector<int> answer;
int start = 0, end = 0, psum = 0, size = 1;
while (true) {
if (psum == total && size == num) {
break;
}
if (... | ALGO | 0.999876 | 3.928358 |
1c86fccf-5580-4e46-993a-8b366749b5a0 | YttriumWillow/OI | Contests/2024/MX/0223/B/B.cpp | #include <iostream>
#include <queue>
#define i64 long long
#define qwq puts("fzy qwq ~");
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define file(prob) freopen(prob".in", "r", stdin); freopen(prob".out", "w", stdout);
const int N = 1e5 + 10;
int n, m, A[N], B[N];
i64 res;
int main(/*int argc, char const... | ALGO | 0.999969 | 3.409338 |
dec033ba-f888-49d8-93eb-735ae4830ccf | MrityunjayNPandey/CP | XOR_Times_2_Is_Sum.cpp | /**
* codeforces: _joKer_0
* codechef: joker_0000
* created: 19-06-2022 21:45:46
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#ifdef DEBUG
#include "algo/debug.h"
#else
#define debug(...)
#define print(x)
#defin... | ALGO | 0.999984 | 4.721759 |
618bdebf-81b1-4627-8a16-bd370fb2e419 | gjamesli2126/leetcode | lc215_maxminheap.cpp | #include <bits/stdc++.h>
#define testMain main
using namespace std;
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
/*time: O(nlogk), space: O(n), minheap will only need to maintain k space*/
priority_queue<int> maxheap;
if (k <= nums.size() / 2) {
//use ... | ALGO | 0.999752 | 5.322581 |
c647a715-9261-4164-8e7f-344930403d04 | GoatGirl98/Walkthrough-of-ACCoding-in-BUAA | 2018级-理科-大学计算机基础/E1-大学计算机基础(理科)五一假期-思维试炼/BUAAOJ2229.cpp | #include<iostream>
#define maxn 100010
using namespace std;
/************************
其实这题贪心也是可以的
************************/
int num[maxn], b[maxn], cnt[2 * maxn];
int main() {
int n;
int res = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> num[i];
b[i] = b[i - 1] + 2 * num[i] - 1;
... | ALGO | 0.999901 | 3.300748 |
0f9a2f50-a423-4db2-98e5-e290e7d2c882 | Rozhina-PM/godot-3.1.1-bazaar | thirdparty/misc/pcg.cpp | #include "pcg.h"
uint32_t pcg32_random_r(pcg32_random_t* rng)
{
uint64_t oldstate = rng->state;
// Advance internal state
rng->state = oldstate * 6364136223846793005ULL + (rng->inc|1);
// Calculate output function (XSH RR), uses old state for max ILP
uint32_t xorshifted = ((oldstate >> 18u) ^ oldst... | ALGO | 0.86151 | 5.787397 |
88a0fba7-d915-4e85-b589-9ae8d5128659 | chaniversial/BOJ_cpp | 1260/main.cpp | #include <iostream>
#include <queue>
#include <stack>
using namespace std;
#define MAX 1002
int map[MAX][MAX];
bool visited[MAX];
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
queue<int> q;
void print_mtrx(int N) {
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
cout << ... | ALGO | 0.999959 | 3.948462 |
dfa77185-6a95-4665-acab-a0f2f66b80e4 | 16naman11/Leetcode-Top-150 | 15ThreeSumAttempt2.cpp | class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> ans;
int n = nums.size();
if (n < 3) {
return ans; // No triplets possible
}
sort(nums.begin(), nums.end());
for (int i = 0; i < n - 2... | ALGO | 0.999948 | 6.656433 |
a79148d5-fdc7-4439-9a41-d2d16e082dbf | jeanlemotan/silkopter | eigen/failtest/colpivqr_int.cpp | #include "../Eigen/QR"
#ifdef EIGEN_SHOULD_FAIL_TO_BUILD
#define SCALAR int
#else
#define SCALAR float
#endif
using namespace Eigen;
int main()
{
ColPivHouseholderQR<Matrix<SCALAR,Dynamic,Dynamic> > qr(Matrix<SCALAR,Dynamic,Dynamic>::Random(10,10));
}
| TEST | 0.933827 | 3.159166 |
c2248f46-fae3-4b84-a84d-f1292a088646 | lmjshineee/FuShi | hfut_exam/42.cpp | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void Bubble(int data[],int length){
for(int i=0;i<length-1;i++){
bool flag=false;
for(int j=length-1;j>i;j--){
if(data[j-1]>data[j]){
swap(data[j-1],data[j]);
flag=true;
... | ALGO | 0.999779 | 3.598396 |
9149f68d-447c-4388-9ba0-a02d556c64e4 | yunshengtian/ASAP | simulation/externals/eigen/doc/examples/TutorialLinAlgInverseDeterminant.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix3f A;
A << 1, 2, 1,
2, 1, 0,
-1, 1, 2;
cout << "Here is the matrix A:\n" << A << endl;
cout << "The determinant of A is " << A.determinant() << endl;
cout << "The inverse of A is:\n... | ALGO | 0.999683 | 4.186114 |
ad321a80-edb4-45d5-87ec-9bea5537a279 | pcw109550/problem-solving | LeetCode/reverse-vowels-of-a-string.cpp | #include <algorithm>
#include <iostream>
#include <string>
#include <cctype>
using namespace std;
class Solution {
public:
string reverseVowels(string s) {
// O(N)
int N = s.size();
int lo = 0, hi = N - 1;
while (lo < hi) {
if (!is_vowel(s[lo])) {
lo++;
... | ALGO | 0.999935 | 6.644188 |
35db892f-015f-48ca-9000-bd64b071786b | LongJohnCoder/fabric-engine-old | Native/ThirdParty/Private/bullet-2.78/src/BulletCollision/CollisionShapes/btStaticPlaneShape.cpp | #include "btStaticPlaneShape.h"
#include "LinearMath/btTransformUtil.h"
btStaticPlaneShape::btStaticPlaneShape(const btVector3& planeNormal,btScalar planeConstant)
: btConcaveShape (), m_planeNormal(planeNormal.normalized()),
m_planeConstant(planeConstant),
m_localScaling(btScalar(0.),btScalar(0.),btScalar(0.))
{
m_... | ALGO | 0.873614 | 7.253411 |
53a2ebd8-8d46-430c-b4b1-5f4f84a3d158 | swag-lang/swag | llvm/llvm/lib/CodeGen/MachineDominators.cpp | #include "llvm/CodeGen/MachineDominators.h"
#include "llvm/ADT/SmallBitVector.h"
#include "llvm/CodeGen/Passes.h"
#include "llvm/InitializePasses.h"
#include "llvm/Pass.h"
#include "llvm/PassRegistry.h"
#include "llvm/Support/CommandLine.h"
using namespace llvm;
namespace llvm {
// Always verify dominfo if expensive ... | ALGO | 0.999328 | 7.742328 |
056f6709-5ae2-446a-83b7-cb0dd7d8adc2 | moveit/moveit_core | constraint_samplers/src/constraint_sampler_tools.cpp | /* Author: Ioan Sucan */
#include <moveit/constraint_samplers/constraint_sampler_tools.h>
#include <moveit/constraint_samplers/constraint_sampler_manager.h>
void constraint_samplers::visualizeDistribution(const moveit_msgs::Constraints &constr, const planning_scene::PlanningSceneConstPtr &scene, const std::string &gr... | TOOL | 0.99117 | 6.646174 |
7c644260-f408-497b-8c97-28b53d4ea6bb | migavv/CompetitiveProgramingEIA | uva/10718 - Bit Mask.cpp | //
// Created by migav on 22/04/2023.
//
#include<bits/stdc++.h>
using namespace std;
int main() {
long long n,l,u,m;
while(cin >> n >> l >> u) {
m = 0;
for(int i = 35; i >= 0; i--) {
long long k = (1LL << i)|m;
if(k > u) continue; //k out of range
if(k <= ... | ALGO | 0.999513 | 4.077069 |
a47845e0-95dc-4fe8-8252-42087f2b4765 | Anjana-sankar-k/OOP_S1 | function.cpp | #include<iostream>
using namespace std;
float add(float a,float b){ //function for finding sum
float sum= a+b;
return sum;
}
float subtract(float a, float b){
if(a>b){
float difference= a-b;
return difference;
}
else{
float difference=b-a;
return difference;
}
}
... | ALGO | 0.92181 | 3.469965 |
d6d56b27-ea8b-40f8-9485-4392e23358ab | Kuxha/a2oj-Ladders | less than 1300/C++/17-248A.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int l1=0,l0=0,r1=0,r0=0;
int a,b;
for(int i=0;i<n;i++){
cin>>a>>b;
if(a){
l1++;
}else{
l0++;
}
if(b){
... | ALGO | 0.99999 | 4.116258 |
1eda2113-9b19-4ab0-be9f-18d25c2a8ef5 | ilkoninn/CPP-Tasks | Test35.cpp | #include <iostream>
using namespace std;
int main(){
float x, y;
cin>>x>>y;
if(x > y) cout<<x;
else cout<<x<<" "<<y;
return 0;
} | ALGO | 0.999149 | 3.793805 |
244ea491-4079-4d48-a97c-c6dea9a7853c | Dev-raj01/leetcode-solutions | rotate-array.cpp | //https://leetcode.com/problems/rotate-array/submissions/1301038707
class Solution {
public:
void rotate(vector<int>& nums, int k) {
k=k%nums.size();
reverse(nums.begin(),nums.end());
reverse(nums.begin(),nums.begin()+k);
reverse(nums.begin()+k,nums.end());
}
}; | ALGO | 0.999976 | 6.1305 |
e320d6ae-41de-44a6-8eb6-e2e6dff89a11 | JunBinLiang/Road-To-1900 | 模板题/零食采购(LCA).cpp | //https://www.lanqiao.cn/problems/19707/learning/?page=1&first_category_id=1&tags=%E6%A0%91%E4%B8%8A%E5%B7%AE%E5%88%86&tag_relation=intersection
#include <iostream>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <se... | ALGO | 0.999927 | 4.62117 |
e91a760a-8275-4508-bbb3-69df57ca86ae | ljh1101/myleetcode | tree/111_minDepth.cpp | #include <queue>
#include <vector>
using namespace std;
struct TreeNode
{
int val;
TreeNode* left;
TreeNode* right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode* left, TreeNode* right)
: val(x),... | ALGO | 0.999975 | 6.43519 |
7c6201d0-f865-4c4a-848f-55918ca4af21 | wiraphatys/COMP_PROG_2110104 | Grader/solution/99_Recur_12.cpp | #include <bits/stdc++.h>
using namespace std;
int PowerMod(int a, int k, int m) {
if (k == 0) {
return 1;
} else if (k % 2 == 0) {
return int(pow(PowerMod(a, k / 2, m), 2)) % m;
} else {
return int(a * pow(PowerMod(a, k / 2, m), 2)) % m;
}
}
int main() {
int a, k, m;
ci... | ALGO | 0.999967 | 4.873475 |
ba821ed9-4500-47b0-b2ec-fbb055dfdd42 | kubesji/CFR_Poker | src/train.cpp | #include <algorithm>
#include <array>
#include <iostream>
#include <unordered_map>
#include <chrono>
#include <random>
#include <mutex>
#include <thread>
#include <cmath>
#include "action.h"
#include "game.h"
// #include "leduc.h"
#include "node.h"
#include "settings.h"
#include "utils.h"
using namespace std;
/* Gam... | ALGO | 0.998615 | 4.467483 |
b828efad-a781-44fc-a8a8-0dc965056db3 | zyhustgithub/leetcode | hard/488.祖玛游戏.cpp | /*
* @lc app=leetcode.cn id=488 lang=cpp
*
* [488] 祖玛游戏
*/
// @lc code=start
class Solution {
public:
int findMinStep(string board, string hand) {
for (auto ch: hand) {
++mp[ch];
}
int res = INT_MAX;
DFS(board, 0, res);
return (res == INT_MAX) ? -1 : res;
... | ALGO | 0.999991 | 6.305624 |
d00a6fa5-05a6-4768-9c24-60f690b3bdc3 | thaimeo03/Leet-code | cpp/1213-Maximum-Product-Difference-Between-Two-Pairs.cpp | class Solution{
public:
int maxProductDifference(vector<int>& nums){
sort(nums.begin(), nums.end());
return nums.rbegin()[1] * nums.back() - nums[0] * nums[1];
}
};
| ALGO | 0.999519 | 5.128185 |
601c1f06-22f3-4e08-9a08-411ac79e653b | ythea/repulsive-surfaces | src/energy/tpe_multipole_nl_0.cpp |
#include "energy/tpe_multipole_nl_0.h"
namespace rsurfaces
{
template<typename T1, typename T2>
mreal TPEnergyMultipole_Normals0::FarField( T1 alpha, T2 betahalf)
{
T2 minus_betahalf = -betahalf;
auto S = bct->S;
auto T = bct->T;
mint b_m = bct->far->b_m;
... | ALGO | 0.999809 | 5.878909 |
d2f7fcdc-7d16-4450-8605-c0ed650c38c6 | Xipog77/BTVN-DSA | 23020615 - BTH - T2/Câu1.cpp | #include <iostream>
#include <vector>
using namespace std;
struct Node
{
int data;
Node * next;
Node(int _data){
data = _data;
next = nullptr;
}
};
Node* addNode(Node* head, int _data){
Node * newNode = new Node(_data);
if (head == nullptr) return newNode;
... | ALGO | 0.999999 | 3.955456 |
3dd298eb-af88-46ff-9736-c41a2c833aea | cloudcalvin/Algorithms-CPP | C++ program to implement Quick.cpp | /***************************************************************
Program to sort the elements in ascending order using Quick Sort.
***************************************************************/
#include<stdio.h>
#include<conio.h>
#include<dos.h>
#include<stdlib.h>
#define SIZE 10
void Quick(int A[SIZE],int,int);
int... | ALGO | 0.999968 | 4.968616 |
35002579-60e3-464a-99c4-d179b763eb95 | oneapi-src/SYCLomatic | libc/src/math/generic/f16div.cpp | #include "src/math/f16div.h"
#include "src/__support/FPUtil/generic/div.h"
#include "src/__support/common.h"
#include "src/__support/macros/config.h"
namespace LIBC_NAMESPACE_DECL {
LLVM_LIBC_FUNCTION(float16, f16div, (double x, double y)) {
return fputil::generic::div<float16>(x, y);
}
} // namespace LIBC_NAMESPA... | ALGO | 0.986622 | 7.118158 |
3288fa0e-3514-4b1f-979b-a2d1f8e2b152 | its-AkshatJain/DSA-Problem-Solving | 5. Stack and Queues/17. SpecialStackGetMin.cpp | #include <iostream>
#include <stack>
using namespace std;
// Design a stack that supports getMin() in O(1) time and O(1) extra
class SpecialStack{
public:
stack<int> s;
int mini;
void push(int data) {
// Implement the push() function.
// For first element
if(s.empty()){
... | ALGO | 0.999847 | 5.172263 |
e01450fd-eb47-4812-ac39-ba40eaa5d48c | godot-extended-libraries/godot-fire | thirdparty/bullet/BulletCollision/CollisionShapes/btStridingMeshInterface.cpp | #include "btStridingMeshInterface.h"
#include "LinearMath/btSerializer.h"
btStridingMeshInterface::~btStridingMeshInterface()
{
}
void btStridingMeshInterface::InternalProcessAllTriangles(btInternalTriangleIndexCallback* callback, const btVector3& aabbMin, const btVector3& aabbMax) const
{
(void)aabbMin;
(void)aabb... | ALGO | 0.88111 | 6.528596 |
89361df5-a51b-4a57-9d8d-314b0b7e263d | amirhmk/Mr_Flamingo | src/eigen/unsupported/doc/examples/MatrixExponential.cpp | #include <unsupported/Eigen/MatrixFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
const double pi = std::acos(-1.0);
MatrixXd A(3,3);
A << 0, -pi/4, 0,
pi/4, 0, 0,
0, 0, 0;
std::cout << "The matrix A is:\n" << A << "\n\n";
std::cout << "The matrix exponential ... | ALGO | 0.999744 | 3.706936 |
2b1b6a34-054f-46e7-baf3-4e8edaed24c6 | Junsang-L33/boj | 5639.cpp | #include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef struct Node{
int data;
struct Node* left;
struct Node* right;
}Node;
Node* alloc_new_node(int data){
Node* newnode = (Node*)malloc(sizeof(Node));
newnode->data = data;
newnode->left = NULL;
newnode->right = NULL;
return newnode;
}
Node* make_... | ALGO | 0.999923 | 4.389846 |
bfaf1b63-a79c-4013-906a-678639ff965e | spofa/app_framework_engine | src/thirdparty/icu/common/ucharstriebuilder.cpp | #include "unicode/utypes.h"
#include "unicode/ucharstrie.h"
#include "unicode/ucharstriebuilder.h"
#include "unicode/unistr.h"
#include "unicode/ustring.h"
#include "cmemory.h"
#include "uarrsort.h"
#include "uassert.h"
#include "uhash.h"
#include "ustr_imp.h"
U_NAMESPACE_BEGIN
/*
* Note: This builder implementation... | TOOL | 0.956131 | 7.381204 |
29a969c5-8029-4c32-9d4b-97d5fed7243e | sk-108/DSA | recursion_fibo.cpp | #include<iostream>
using namespace std;
int fib(int n)
{
if(n == 0)
{
return 0;
}
if(n == 1)
{
return 1;
}
int so1 = fib(n-1);
int so2 = fib(n-2);
return so1 + so2;
}
int main()
{
int n;
cin>>n;
cout<<fib(n);
return 0;
} | ALGO | 0.999972 | 4.837809 |
fbabc935-2f0d-47b7-b271-156ecaf3a5df | WujekFoliarz/Dying-Light-1-DUALSENSE-MOD | thirdparty/duaLib/src/source/crc.cpp | #include "crc.h"
uint32_t compute(unsigned char* buffer, size_t len) {
uint32_t result = crcSeed;
for (size_t i = 0; i < len; i++) {
result = hashTable[((unsigned char)result) ^ ((unsigned char)buffer[i])] ^
(result >> 8);
}
return result;
}
| ALGO | 0.998479 | 5.741341 |
f5b30fbd-2ab4-48ce-9141-0cfef83bf8c4 | Leiru-Cat-Developer/CPP-Educational | Programas Básicos [CURSO]/11 - Funciones - Ejercicio 13 - CALCULAR AÑOS.cpp | /*
ESCRIBA UNA FUNCIN LLAMADA "calcAos()" QUE TENGA UN PARMETRO ENTERO QUE REPRESENTE EL NMERO TOTAL
DE DAS DESDE LA FECHA 1/1/2000 Y PARMETROS DE REFERENCIA NOMBRADOS "ao, mes, dia". LA FUNCIN ES
CALCULAR EL AO, MES Y DA ACTUAL PARA EL NMERO DADO DE DAS QUE SE LE TRANSMITAN. PARA ESTE PROBLEMA
SUPONGA QUE CADA AO ... | ALGO | 0.957418 | 3.42029 |
48729d54-5a13-4399-9af5-dce8eef694b8 | RobCTs/IoT_Signal_analysis | managed_components/espressif__esp-dsp/modules/common/misc/dsps_pwroftwo.cpp | #include "dsp_common.h"
bool dsp_is_power_of_two(int x)
{
return (x != 0) && ((x & (x - 1)) == 0);
}
int dsp_power_of_two(int x)
{
for (size_t i = 0; i < 32; i++) {
x = x >> 1;
if (0 == x) {
return i;
}
}
return 0;
}
| ALGO | 0.878962 | 5.533778 |
64018bf3-5659-44c2-8e60-96ceef8167c8 | alvinzhaowei/VD-STAR | boost_1_66_0/libs/spirit/classic/example/fundamental/more_calculators/phoenix_subrule_calc.cpp | ///////////////////////////////////////////////////////////////////////////////
//
// Full calculator example
// [ demonstrating phoenix and subrules ]
//
// [ Hartmut Kaiser 10/8/2002 ]
//
///////////////////////////////////////////////////////////////////////////////
//#define BOOST_SPIRIT_DEBUG // define ... | TOOL | 0.943147 | 6.534732 |
8ba158bc-3db5-416d-9842-5ed1ede65580 | ishandutta2007/codeforces | andr1y/normal/1237/A.cpp | #include <bits/stdc++.h>
#define ld long double
#define ll long long
#define ull unsigned ll
#define pll pair<ll, ll>
#define itr(a) begin(a), end(a)
#define pb push_back
#define x first
#define y second
#define endl '\n'
#define FAST cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
#define FILES(namein, nameout)... | ALGO | 0.999967 | 3.630787 |
f57cfe93-953e-495c-8db4-072b2b6b5960 | Hser2bio/Lats-Core | src/bls/bls_ies.cpp | #include "bls/bls_ies.h"
#include "crypto/aes.h"
#include "hash.h"
#include "random.h"
#include "streams.h"
template <typename Out>
static bool EncryptBlob(const void* in, size_t inSize, Out& out, const void* symKey, const void* iv)
{
out.resize(inSize);
AES256CBCEncrypt enc((const unsigned char*)symKey, (co... | ALGO | 0.977103 | 7.429727 |
66bf4bf0-77b3-4ad3-adcc-7344c6dd5c54 | anis009/competitve-programming | target_sum.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
// freopen("addin.txt","r",stdin);
// freopen("addout.txt","w",stdout);
int t;
cin>>t;
while(t--){
int n,target;
cin>>n>>target;
int a[n];
map<int,int>hashMap;
vector<pair<int,int>>vect;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){... | ALGO | 0.999834 | 3.671484 |
9b896dfd-354b-4a4a-babf-5b303c960c96 | divyansh1511/CPP | Striver sheet/DAY 13/2.cpp | #include<iostream>
using namespace std;
class queueusingarr{
public:
int* data;
int capacity;
int front;
int rear;
queueusingarr(){
data = new int[20];
capacity = 20;
front = -1;
rear = -1;
}
int size(){
return rear+1;
}
bool isempty(){
... | ALGO | 0.968723 | 3.881871 |
213ff419-b3bc-46bf-ab47-4c7db64f0391 | RaineWillow/sdf_engine | src/utils/trie.cpp | #include "trie.hpp"
Trie::Trie() {
_entryNode = new trieNode();
}
Trie::~Trie() {
destroyTrie();
delete _entryNode;
_entryNode = NULL;
}
bool Trie::addWord(std::string word, int id) {
trieNode * currentNode = _entryNode;
bool isNewWord = false;
for (size_t i = 0; i < word.length(); i++) {
if (curre... | ALGO | 0.993086 | 4.859216 |
7b47f8e2-663f-49b8-9111-e033c220287d | TXP2023/OI-code | P8855 [POI2002] 商务旅行.cpp | #include <vector>
#include <stdio.h>
#include <algorithm>
#include <ctype.h>
#include <climits>
#include <stdint.h>
typedef int64_t ll;
typedef uint64_t unill;
//ǰ
//
template< typename T >
inline T readf();
std::vector< ll > depth;
std::vector< std::vector< ll > > edge;
std::vector< std::vector< ll > > father;
std:... | ALGO | 0.999874 | 4.322904 |
f6a4c709-070e-4e41-b3ff-0ff58868c382 | Sur818/Coding-Projects | CppCompiler/pointer in 2d array (10).cpp | #include<iostream>
using namespace std;
int **array_merge(int *a,int *b,int n,int m)
{
int i,j,**c,k,t;
c=new int*[n];
for(i=0;i<n;i++)
{
c[i]=new int[2*m];
}
k=-1,t=0;
for(i=0;i<n;i++)
{
k++;
t=0;
for(j=0;j<2*m;j++)
{
if(j<m)
c[i][j]=*(a+i*m+j);
else
c[i][j]=*(b+k*m+(t++));
}
}
return c;
}
int main()
{
int i,j,n,m;... | ALGO | 0.998542 | 3.097222 |
d7372c75-49ec-43ab-8ee6-e88dab356085 | tanvirmirza/cpp-code | AboutCpp/Fanction_tut.cpp | #include <iostream>
using namespace std;
int sumation(int x, int y)
{
int sum;
sum = x + y;
return sum;
}
int sumation(int x, int y, int z){
int sum;
sum = x + y + z;
return sum;
}
void substraction(int, int);
int multiflication()
{
int x, y, multi;
cout << "Input value of x and y = ... | ALGO | 0.928805 | 3.234169 |
405a7165-a308-4dd2-b69d-2f3f2ca4d953 | alexp1234/lab2 | HelloMPI.cpp | /*
* HelloMPI.cpp
*
* Created on: Oct 7, 2020
* Author: ITCS 3145 Q.
*/
#include <iostream>
#include <mpi.h>
using namespace std;
class HelloSerial{
public:
void greetings(int argc, char* argv[]);
void greetings();
};
class HelloMPI{
public:
void greetingsMPI();
};
void HelloSerial::greetings(int arg... | ALGO | 0.935106 | 3.912845 |
f9f59f19-b4df-4a70-bc04-a51320a4a381 | Shivam-Vishwakarma-123/DSA-Codes | SortingTechnique/insertionsort.cpp | #include <iostream>
#include<vector>
using namespace std;
int main() {
vector<int> arr{10,9,8,5,6,1};
int n = arr.size();
//insertion sort
for(int round=1;round<arr.size();round++){
int value=arr[round];
int j=round-1;
while(arr[j]>value){
arr[j+1]=arr[j];
j--;
}
arr[j+1]=val... | ALGO | 0.99979 | 4.224703 |
2716c5c4-5db6-4d7e-871d-1d60671b073e | Wagonee/string_sorting_compare | string_sorting_compare/A1m/main.cpp | #include <string>
#include <vector>
#include <iostream>
struct LcpResult {
int comparison_outcome;
int lcp_val;
};
LcpResult lcp_compare_strings_counting(const std::string &s1, const std::string &s2, int k_known_lcp) {
int lcp = k_known_lcp;
size_t len1 = s1.length();
size_t len2 = s2.length();
size_t max... | ALGO | 0.999994 | 5.835166 |
76443b1b-49c5-4650-a0f3-2a92967c03e6 | M-Salameh/codeforces-problems | CSES/Sorting and Searching/Factory Machines.cpp | #include <bits/stdc++.h>
#define endl '\n'
#define all(v) v.begin(),v.end()
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mid (l+r)/2
using namespace __gnu_pbds;
using namespace std;
#define ordered_set tree<long long, null_type,less_equal<long long>, rb_tree_tag,tree_order_sta... | ALGO | 0.999981 | 5.698307 |
0cb2f7c3-9952-4f3d-9c0c-ffeac464cd30 | maxbrundev/AmberEngine | Sources/Amber/AmberEngine/src/AmberEngine/Tools/FileSystem/IniFile.cpp | /**
* @project: Overload
* @author: Overload Tech.
* @licence: MIT
*/
#include "Amberpch.h"
#include "AmberEngine/Tools/FileSystem/IniFile.h"
#include <filesystem>
#include <fstream>
AmberEngine::Tools::Filesystem::IniFile::IniFile(const std::string& p_filePath) : m_filePath(p_filePath)
{
Load();
}
void AmberEngi... | TOOL | 0.857386 | 6.442486 |
cafec8dd-5a41-4da7-879f-4ff710464ce0 | AlbertoLarrauri/MinimizerProject | minimizers/OFAMinimizers/basic_incremental.cpp | //
// Created by llarrauriborroto on 23/02/2021.
//
#include "basic_incremental.h"
#include "../ofa_minimizer.h"
#include "../compat_matrix.h"
using namespace SBCMin;
using namespace OFAMinimizers;
void BasicIncremental::init() {
solver = std::make_unique<CMSat::SATSolver>();
partial_solution = compat_matri... | ALGO | 0.999921 | 5.86314 |
e5c267bc-6137-4478-97dc-9d89a47c77f2 | ADVdiego/CommonAlgorithms | Source/Utility/SumExample.cpp | #include "SumExample.h"
namespace CommonAlgorithms
{
namespace Utility
{
SumExample::SumExample():
sum_{0}
{};
void SumExample::operator()(const int value)
{
sum_ += value;
}
} // namespace Utility
} // namespace CommonAlgorithms
| TOOL | 0.863442 | 4.973944 |
3fd214f6-9fd9-4384-b650-3cdfec669e53 | jonstewart/boost-svn | libs/numeric/ublas/doc/samples/vector_binary.cpp | #include <boost/numeric/ublas/vector.hpp>
#include <boost/numeric/ublas/io.hpp>
int main () {
using namespace boost::numeric::ublas;
vector<double> v1 (3), v2 (3);
for (unsigned i = 0; i < (std::min) (v1.size (), v2.size ()); ++ i)
v1 (i) = v2 (i) = i;
std::cout << v1 + v2 << std::endl;
st... | ALGO | 0.965544 | 3.927654 |
a3259741-5665-4a6f-8f29-164fab885f20 | jodyxha/QHG4 | QHG4/populations/OoAConfGen2BPop.cpp | #include <omp.h>
#include <hdf5.h>
#include "EventConsts.h"
#include "GeneUtils.h"
#include "SPopulation.cpp"
#include "Prioritizer.cpp"
#include "LayerBuf.cpp"
#include "LayerArrBuf.cpp"
#include "Action.cpp"
////////////////////////////
#include "WeightedMove.cpp"
#include "ConfinedMove.cpp"
#include "SingleEvalua... | ALGO | 0.985568 | 6.733876 |
8a790a30-b909-41ff-959d-641c2aef7f0a | ceerRep/loj-speedtest | memory-cache.cpp | namespace
{
const int MX = 3 << 25;
int a[MX];
inline unsigned int rand1()
{
static unsigned int sed = 0;
return (sed = (sed * 233 + 19260421)) & (MX - 1);
}
inline unsigned int rand2()
{
static unsigned int sed = 0;
return (sed = (sed * (MX + 1) + 1025)) & (... | ALGO | 0.961105 | 3.567979 |
99709337-f90e-4666-8be9-33eb4aea1517 | Kaleb-Hankerson/Calhoun-Cplusplus | ch4hw.cpp | /*
Kaleb Hankerson
A01360919
2-11-2025
*/
#include <iostream>
#include <iomanip>
#include <string>
int main(){
//declaring string variables to store name and nationality
std::string name, nationality;
//declaring int variable to store age
int age;
//declaring char variable to store citizenship
... | TOOL | 0.949218 | 6.263054 |
447e32d3-e07f-475e-8872-62b9927aefc4 | appleCatch/algorithm | src/aimtoffer/interview_25.cpp | //
// Created by Byte on 2020/4/6.
//
#include <iostream>
#include <vector>
using namespace std;
// 定义二叉树节点
struct BinaryTreeNode {
int m_nValue;
BinaryTreeNode * m_pLeft;
BinaryTreeNode * m_pRight;
};
void FindPath(BinaryTreeNode *pRoot, int expectedNum, int currentSum, vector<int> path);
void FindPath(... | ALGO | 0.999878 | 4.272433 |
85ab65c0-ebef-493e-abe0-5ad9ff09f329 | Romu-ua/Atcoder | ABC/241/B.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
bool flag =... | ALGO | 0.999997 | 4.087655 |
4d49b86f-ebf5-4b82-98cf-5b03ad1bc24a | wybosys/nnt | 3rd/Bullet/BulletCollision/BroadphaseCollision/btQuantizedBvh.cpp | #include "btQuantizedBvh.h"
#include "LinearMath/btAabbUtil2.h"
#include "LinearMath/btIDebugDraw.h"
#include "LinearMath/btSerializer.h"
#define RAYAABB2
btQuantizedBvh::btQuantizedBvh() :
m_bulletVersion(BT_BULLET_VERSION),
m_useQuantization(false),
//m_traversalMode(TRAVERSAL_STACKLESS_CACHE_FRIE... | ALGO | 0.997011 | 7.081435 |
fc1c8928-8598-4ccc-8923-14026b840d8c | gppc-dev/startkit-classic | main.cpp | #include <cstdio>
#include <ios>
#include <numeric>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <iomanip>
#include "ScenarioLoader.h"
#include "Timer.h"
#include "Entry.h"
#include "validator/ValidatePath.hpp"
#if __linux__
#define GPPC_MEM... | ALGO | 0.973086 | 3.709576 |
5000966e-dd23-480f-8f56-21feb8ceb5be | calvinmccarter/mega-cggm | AltNewtonCD/eigen3/doc/examples/TemplateKeyword_flexible.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
template <typename Derived1, typename Derived2>
void copyUpperTriangularPart(MatrixBase<Derived1>& dst, const MatrixBase<Derived2>& src)
{
/* Note the 'template' keywords in the following line! */
dst.template triangularView<Upper>() = src.template... | TOOL | 0.992653 | 5.804369 |
c74dab75-7a8a-4af9-bc97-c410c611614f | mehrdad46/acm | regional/dhaka/11/A.a70babat.cpp | #include <algorithm>
#include <iostream>
#include <fstream>
#include <map>
#include <utility>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <sstream>
#include <set>
#include <complex>
#include <iomanip>
#include <queue>
#define FOR(i, n) for(int i = 0; i < (n); i++... | ALGO | 0.99953 | 3.491866 |
53487bd1-d81f-4235-adac-c8ef1b1ad68b | tectijuana/git-basico-interfazb-keyemsi | programa2.cpp | #include "iostream"
#include "string"
/*
*Problema 2
*Encontrar el entero positivo mayor
*en una lista de quince enteros
*algunos de los cuales son impares
*/
//@Author keyemsi
// @Date 25 marzo 2022
using namespace std;
int main()
{
int num,aux=0;
int lista[15];
for(int i=0;i<15;i... | ALGO | 0.989341 | 3.591487 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.