uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
2122bf07-0e16-46f6-9bf6-b43f50f43ccc | WOPH96/Hardwork_Luck | baekjoon/queue/queue-1158/C++/queue-1158.cpp | // #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
// 입력변수생성
int n, k;
// 다른 변수 생성
// 입력, 테스트 출력
void print();
void sol()
{
queue<int> q;
for (int i = 1; i <= n; i++)
{
q.push(i);
}
cout << "<";
while (!q.empty())
{
f... | ALGO | 0.999992 | 3.809883 |
c04b6a7b-a48e-432f-84ee-cb1bbe6fa623 | mauroberto/maratona | 1303.cpp | #include<stdio.h>
#include<queue>
#include<vector>
using namespace std;
int p[102];
int ps[102];
int v[102];
int main(){
int n, c = 1;
scanf("%d", &n);
while(n != 0){
if(c > 1) printf("\n");
for(int i=0; i<=n; i++){p[i] = 0; v[i] = 0; ps[i] = 0;}
priority_queue <pair<pair<int, double>, int>, vecto... | ALGO | 0.999169 | 3.418356 |
5e3a6568-37cc-4cb2-b536-6d5457682d1b | SK1965/cp-sheet | replacement.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n;
cin >> n;
string s;
cin >> s;
string r;
cin >> r;
int i = 0;
vector<char> st;
for (char c : s) {
st.push_back(c);
while (st.size() >= 2 && st[st.size() - 1] != st[st... | ALGO | 0.99993 | 5.323471 |
f1ef2abe-e31a-4439-8bd3-4813ec189d62 | MathIsLife/CoolestCodeLibrary | Codeforces - Function.cpp | /*
|\ | `|` |``\ ```|` | | /```\ |``\
| \ | | |__/ | |___| | | |__/
| \ | | | \ | | | | | | \
_| \| _|_ | \ \__) | | \___/ | \
Codeforces 455E - Function
Category: Data Structures
Keys: Observation, Merg... | ALGO | 0.99993 | 4.970599 |
e292fac6-7015-40af-9e75-8a2984b21eaf | Asa-to/c-prac | atcoder/old/abc117b.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
template<typename T> bool chmax(T &a, T b) {if(a <= b){a = b; return true;}return false;}
template<typename T> bool chmin(T &a, T b) {if(a >= b){a = b; return true;}return false;}
int main(void){
int ... | ALGO | 0.999967 | 3.797128 |
ef2b8009-057e-4115-8834-5eef97d83d4a | Sanchay117/codeforces_solutions_2 | Down_With_Brackets_2110B.cpp | #include <bits/stdc++.h>
#include <climits>
#include <fstream>
#include <future>
#include <numeric>
using namespace std;
#define ll long long
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define F first
#define S second
#define pb push_back
#define vi vector<int>
#define vll ve... | ALGO | 0.998985 | 4.190916 |
e8543f90-3c47-42fa-91d0-16c0bf5b48ef | ksww1891/baekjoon | 12100.cpp | #include<iostream>
#include<queue>
using namespace std;
int board[21][21];
int n, answer;
bool goUp(){
int tmp[21][21];
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
tmp[i][j] = board[i][j];
}
}
queue<int>q;
for(int i = 1; i <= n; i++){
for(int j = 1... | ALGO | 0.99996 | 3.896472 |
0938bec1-f485-4711-9aae-f543be433497 | ampl/coin | Cbc/Clp/src/ClpDualRowSteepest.cpp | /* $Id$ */
#include "CoinPragma.hpp"
#include "ClpSimplex.hpp"
#include "ClpDualRowSteepest.hpp"
#include "CoinIndexedVector.hpp"
#include "ClpFactorization.hpp"
#include "CoinHelperFunctions.hpp"
#include <cstdio>
//#############################################################################
// Constructors / Destru... | ALGO | 0.886953 | 5.787404 |
8357b528-1b17-402c-9fe9-8cba101d5fc0 | sophon-ai-algo/examples | simple/ssd/cpp/cpp_multi_bmcv_bmrt/ssd.cpp | #include "ssd.hpp"
#include "utils.hpp"
using namespace std;
#define IS_END_OF_DATA(entry) (entry[1] == 0 && entry[2] == 0 &&\
entry[3] == 0 && entry[4] == 0 &&\
entry[5] == 0 && entry[6] == 0)
#define INPUT_WIDTH 300
#define INPUT_HEIGHT 300
#define BUFF... | DATA | 0.875486 | 4.873214 |
a86214e5-112f-4201-997b-ff5690871b22 | Jia-Sian/OJ | uva/580.cpp | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
long long dp[50][3];
int main(){
long long n,i;
dp[1][0]=1;
dp[1][1]=1;
dp[1][2]=0;
for(i=2;i<50;i++){
dp[i][0]=dp[i-1][0]+dp[i-1][1]+dp[i-1][2];
dp[i][1]=dp[i-1][0];
dp[i][2]=d... | ALGO | 0.999769 | 3.517246 |
b6da99b9-c73a-42b9-b71c-42ec5e91bdb1 | TrainingAfternoon/CinCity | Mitchell/Summer2021/WK5/PE.cpp | #include <bits/stdc++.h>
// var types
#define ll long long
#define ld long double
#define nn '\n'
#define pb push_back
#define mp make_pair
// collection shorthand
#define V vector
#define vi V<int>
#define vll V<ll> #define vd V<double>
#define pii pair<int, int>
#define pll pair<ll,ll>
#define vpii V<pii>
#define v... | ALGO | 0.999981 | 3.840144 |
a0723d45-0fc4-4ec1-a932-1508e9f10e62 | kushwanth1404/CSA0699-DAA | DAA CODES/29.cpp | #include <stdio.h>
// Function to find the maximum value in the knapsack
int knapsack(int W, int weights[], int values[], int n) {
int dp[n + 1][W + 1];
// Initialize the dp array
for (int i = 0; i <= n; i++) {
for (int w = 0; w <= W; w++) {
if (i == 0 || w == 0) {
dp[i][w] = 0;
} else if (weights[i - 1] <= w) {... | ALGO | 0.999994 | 5.566836 |
e491240e-38b5-4ab1-bc47-627e14c28ec0 | Anh2806/NguyenTruongTuanAnh_MonC | Chapter 4/Program/vd1.cpp | #include <iostream>
using namespace std;
int main()
{
bool trueValue,falseValue;
int x = 5, y = 10;
trueValue = x < y;
falseValue = y ==x;
cout << "True is" << trueValue << endl;
cout << "False is" << falseValue << endl;
return 0;
} | TOOL | 0.99872 | 3.551344 |
9db5d1dd-d8b9-4963-9e4c-42c6f60bcf36 | hieupm123/again | code/C++/CSES2/1093 - Two Sets II.cpp | /*
Problem Name: Two Sets II
Problem Link: https://cses.fi/problemset/task/1093
Author: Sachin Srivastava (mrsac7)
*/
#include<bits/stdc++.h>
using namespace std;
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args);... | ALGO | 0.999936 | 3.743502 |
01c6da53-c567-4715-83b1-5cdc45a64bd6 | erwincoumans/experiments | bullet2/BulletSoftBody/btSoftSoftCollisionAlgorithm.cpp | #include "btSoftSoftCollisionAlgorithm.h"
#include "BulletCollision/CollisionDispatch/btCollisionDispatcher.h"
#include "BulletCollision/CollisionShapes/btBoxShape.h"
#include "BulletCollision/CollisionDispatch/btCollisionObject.h"
#include "BulletSoftBody/btSoftBodySolvers.h"
#include "btSoftBody.h"
#include "BulletCo... | ALGO | 0.99391 | 3.763516 |
4e89447f-c63e-4b82-8834-973ee8e58e16 | GeorgeKstr/Audio-Fingerprinting-song-recognition | source code/database.cpp | ///author George Kiriakidis
///libraries used: mpg123, fftw3, libpng, png++
#include "database.h"
#include <iostream>
using namespace std;
Database::Database(const char *file){
this->dbfile = file;
loadfromfile(file);
}
void Database::put(string trackname, unsigned long *fingerprints, size_t n, const char *fil... | TOOL | 0.931052 | 3.900501 |
f4ed65db-c79a-4653-a110-f1b316c5d3f6 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_6824_6.cpp | #include <bits/stdc++.h>
using namespace std;
string s[100005];
string reve[100005];
int c[100005];
long long dp[100005][2];
int n;
long long solve(int i, bool rev) {
if (i == n) {
return 0;
}
long long &ret = dp[i][rev];
if (ret != -1) {
return ret;
}
ret = 1e18;
if (!rev) {
if (s[i - 1] <= s... | ALGO | 0.999906 | 3.887911 |
c12a58b7-062d-4b29-b570-fe2d1f26f580 | pinheiro-lu/progCompetitiva | desafios-de-programacao/4/e/sol.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define f first
#define s second
const ll MOD = 1e9 + 7;
/* Retorna x^n % MOD */
ll mod_pow(ll x, int n, ll MOD = MOD) {
if (n == 0) return 1;
if (n == 1) return x;
ll ans = mod_pow(x, n/2, MOD);
if (n & 1) {
return a... | ALGO | 0.999935 | 5.063993 |
ca477172-d152-454c-813b-5ad867efa352 | ZisongXu/hello_world_test | home/phd_project/data/bullet3-master/src/BulletCollision/Gimpact/btGImpactBvh.cpp | /*! \file gim_box_set.h
\author Francisco Leon Najera
*/
#include "btGImpactBvh.h"
#include "LinearMath/btQuickprof.h"
#ifdef TRI_COLLISION_PROFILING
btClock g_tree_clock;
float g_accum_tree_collision_time = 0;
int g_count_traversing = 0;
void bt_begin_gim02_tree_time()
{
g_tree_clock.reset();
}
void bt_end_gim0... | ALGO | 0.999771 | 7.202734 |
28eda7c2-0641-4819-a671-e9e6c31ab4d4 | devs1979/Leetcode-sub | 2650-split-with-minimum-sum/2650-split-with-minimum-sum.cpp | class Solution {
public:
int splitNum(int num, string a = "", string b = "", bool alter = true) {
auto numstr = to_string(num);
sort(numstr.begin(), numstr.end());
for (auto c: numstr)
if (alter = !alter)
a.push_back(c);
else
b.push_back(c);
... | ALGO | 0.99982 | 5.832711 |
ddefb89b-8b4d-4d70-9401-dc2ea9a4e720 | KElgenidy/XV6-Project-Series | ImpSchedulingAlgorithms/MLFQ.cpp | #include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
struct process
{
int pid;
int arrivalTime;
int burstTime;
int finishTime;
int btSum;
int remTime; //remaining time for RR
int turnaroundTime;
int waitingTime;
int responseTime... | ALGO | 0.999944 | 4.536754 |
3fed42f7-ff2d-4a04-a56b-bf76d7ff7d78 | exeHammer/QMLPinyin | pinyin/mystdlib.cpp | #include <stdlib.h>
namespace ime_pinyin {
// For debug purpose. You can add a fixed version of qsort and bsearch functions
// here so that the output will be totally the same under different platforms.
void myqsort(void *p, int n, int es,
int (*cmp)(const void *, const void *)) {
qsort(p,n, es, cmp);... | TOOL | 0.998507 | 3.959905 |
1b56de3c-26ae-415e-a6e5-3d5525ba2861 | KrishnaKurmi/CPP | ArmStrongNumber.cpp | #include <iostream>
using namespace std;
// Function to calculate base^exponent without using pow()
int power(int base, int exponent) {
int result = 1;
for (int i = 0; i < exponent; i++) {
result *= base;
}
return result;
}
int main() {
int number, originalNumber, remainder, result = 0;
... | ALGO | 0.999903 | 6.218441 |
458e7c99-d153-44c3-b910-ca812259cfab | lsw6684/Cplusplus-Problem | Practices/simpleOperator.cpp | #include <iostream>
using namespace std;
class Square {
private:
int side;
public:
//To be defined
Square(int x = 0) : side(x)
{}
int getSide()
{
return side;
}
friend Square operator+(const Square& s1, const Square& s2);
friend Square operator-(const Square& s1, const Square& s2);
int getArea()
{
retur... | ALGO | 0.980487 | 5.156456 |
e48411a5-6e6a-487a-a79c-10fa6fbf9be7 | OmarHafez1/Competitive_Programming_Solutions | codeforces.com/1744_E1.cpp | //============================================================================
// Author : Omar_Hafez
// Created : 16 October 2022 (Sunday) 5:44:01 PM
//============================================================================
/*
________
/ \
/ / ... | ALGO | 0.999887 | 4.872551 |
6a233e54-efc9-405d-8bb5-ab55672fc806 | nilotpal9797/CodeforcesSolution | 313B.cpp | #include <iostream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <utility>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <cctype>
#includ... | ALGO | 0.999871 | 3.665845 |
5aa831b9-3253-4292-8a57-d8ea7488b860 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_9196_3.cpp | #include <bits/stdc++.h>
int n, k;
char b[2][1000002];
struct state {
int h;
char wall;
int water;
} q[2000002] = {0};
char s[1000002][2] = {0};
int isv(state st) {
if (st.h < 0 || st.h <= st.water) return 0;
if (b[st.wall][st.h] == 'X' || s[st.h][st.wall]) return 0;
return 1;
}
int found(state st) {
if (... | ALGO | 0.999964 | 3.417163 |
900b12c1-e823-40e9-9926-1aedb3da0520 | moophis/careercup | 4.8.cpp | /**
* careercup 4.8
* You have two very large binary trees: T1, with millions of nodes,
* and T2, with hundreds of nodes. Create an algorithm to decide
* if T2 is a subtree of T1.
*
* A tree T2 is a subtree of T1 if there exists a node n in T1
* such that the subtree of n is identical to T2. That is, if
* y... | ALGO | 0.999965 | 6.00555 |
009857c9-9dcb-4da3-aca8-97bfdac65b49 | cjlcarvalho/maratona | URI/2157.cpp | #include <bits/stdc++.h>
using namespace std;
void espelho(int a, int b){
int j;
for(int i = a; i<=b; i++) cout << i;
for(int i = b; i >= a; i--){
j = i;
while(j){
cout << j % 10;
j /= 10;
}
}
cout << endl;
}
int main(){
int n, a, b;
cin >> ... | ALGO | 0.999744 | 4.815023 |
6a2b0fb3-e2e6-453d-ae19-e7a545a916cc | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_2769_5.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int s, f;
s = f = 1;
while (f < min(A, B)) {
f *= ++s;
}
cout << f;
return 0;
}
| ALGO | 0.999959 | 4.361132 |
9b2bfb1e-146a-41e6-9103-091b3778c362 | g-gisbert/Inpainting-Holes-In-Folded-Fabric-Meshes | deps/libIGL/include/igl/comb_line_field.cpp | #include "comb_line_field.h"
#include <vector>
#include <deque>
#include "per_face_normals.h"
#include "is_border_vertex.h"
#include "rotation_matrix_from_directions.h"
#include "triangle_triangle_adjacency.h"
namespace igl {
template <typename DerivedV, typename DerivedF>
class CombLine
{
public:
const Eigen::... | ALGO | 0.998002 | 5.595365 |
b95376ad-4c18-4673-8dcf-d7b59f3cd3db | augarov/leetcode | problems/11.container-with-most-water/solution.cpp | /*
* @lc app=leetcode id=11 lang=cpp
*
* [11] Container With Most Water
*
* https://leetcode.com/problems/container-with-most-water/description/
*
* algorithms
* Medium (56.73%)
* Likes: 30219
* Dislikes: 1897
* Total Accepted: 3.6M
* Total Submissions: 6.3M
* Testcase Example: '[1,8,6,2,5,4,8,3,7]'... | ALGO | 0.999964 | 7.133856 |
7ca08cd5-0693-4b98-abd8-d0295af014fa | hshs1103/programmers | lv2/lv2_fibonacci.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int solution(int n) {
vector<int> v(n+1, 0);
v[1] = 1;
for(int i = 2; i <= n; i++) v[i] = (v[i-1] + v[i-2]) % 1234567;
return v[n];
}
| ALGO | 0.999981 | 5.027629 |
a439ac8c-563d-400e-9c84-733c68495272 | muthu165/C-Plus-Plus-programs-and-Data-Structures | currency.cpp | #include<bits/stdc++.h>
using namespace std;
void currency(int amt){
int notes[10]={2000,500,200,100,50,20,10,5,2,1};
int ans[10]={0};
for(int i=0;i<10;i++){
if(amt>=ans[i]){
ans[i]=amt/notes[i];
amt=amt%notes[i];
}
}
cout<<"Currency Count"<<endl;
for(int i=0;i<10;i++){
if(ans[i]!=0){
cout<<notes[i... | ALGO | 0.978158 | 3.644602 |
575149e1-9af3-43ee-821b-6cbb5673145c | paras2003gupta/programming | stackusingarray.cpp | #include<iostream>
using namespace std;
#define MAXSIZE 1000;
class stack{
private:
int arr [40000];
int top;
public:
stack(){
top = -1;
}
void push(int data);
void pop();
void traverse();
};
void stack::pop(){
if(top==-1){
cout<<"Your stack is empty"<<endl;
... | ALGO | 0.9914 | 3.875261 |
d386e788-15b4-409e-a8d3-95d33aa03180 | neuroproc/Neuron | work/src/cplasplas.cpp | #include <algorithm>
#include <vector>
#include <iostream>
int main()
{
int data[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
std::vector<int> v1(data, data+10);
std::fill(v1.begin(), v1.end(), -1);
//std::cout << *v1.begin() << " " << *v1.end();
//printf("%d %d\n", (int)v1.begin(), (int)v1.end())... | TOOL | 0.946337 | 3.52348 |
9878542d-ccac-49ad-94dd-cea6521d2e4d | dan-lara/Uri-problems-Beecrowd | 5 - 1161 - Soma de Fatoriais.cpp | #include <iostream>
using namespace std;
long long int fat(int n){
if(n > 1)
return n * fat(n - 1);
else
return 1;
}
int main() {
int n,m;
while(cin>>n>>m)
cout<<fat(n)+fat(m)<<endl;
return 0;
} | ALGO | 0.999947 | 4.296602 |
dbf50f36-d3ef-427b-abf0-7aa762878540 | rafayhabib321/PF-LAB | Shape using for loop/Inverted Number Triangle.cpp | #include <iostream>
using namespace std;
int main() {
int n = 5;
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= i; j++) {
cout << j;
}
cout << endl;
}
cout<<'\n';
cout<<"Inverted Number Triangle.";
return 0;
}
| ALGO | 0.999588 | 4.503158 |
71d11b07-6a35-4932-9f6a-22eb1a567d1a | kanbang/myexercise | QtTest/WildMagic/Wm5Mathematics/Wm5DistPoint2Segment2.cpp | #include "Wm5MathematicsPCH.h"
#include "Wm5DistPoint2Segment2.h"
namespace Wm5
{
//----------------------------------------------------------------------------
template <typename Real>
DistPoint2Segment2<Real>::DistPoint2Segment2 ( const Vector2<Real>& point,
const Segment2<Real>& segment )
... | ALGO | 0.946788 | 6.950751 |
558591aa-48cf-4bff-9f8e-2f06a9af7f92 | Zapryanovx/FMI_2023_Introduction_to_Programming | practicum07_171123/01_min_row_el.cpp | //#include <iostream>
//
//const int MAX_SIZE = 10;
//
//int findMinOfRow(int matrix[], int rows, int cols);
//
//int main() {
//
// int matrix[MAX_SIZE][MAX_SIZE] = {};
// int rows = 0, cols = 0;
// std::cin >> rows >> cols;
//
// for (int i = 0; i < rows; i++) {
// for (int j = 0; j < cols; j++) {
// std::cin >> m... | ALGO | 0.999822 | 4.680716 |
d4c9afbd-4d72-4749-8467-f3c3ffc3c01a | Kerwin-H/LEARN-Cpp | 20210612/20210612/20210612.cpp | class Solution {
int f(int n, int m) {
if (n == 1) {
return 0;
}
int x = f(n - 1, m);
return (m + x) % n;
}
public:
int lastRemaining(int n, int m) {
return f(n, m);
}
};
class Solution {
public:
int add(int a, int b) {
if (a == 0 || b == 0) {
return a == 0 ? b : a;
}
int sum = 0, carry = ... | ALGO | 0.999971 | 6.011533 |
3ac20189-11e0-4271-b935-e9b6a59426f6 | mot-tom/mdmake | src/oxi_layer.cpp | #include <iostream>
#include <sstream>
#include <fstream>
#include <cstdlib>
#include <string>
#include <vector>
#include <math.h>
#include "opt.h"
using namespace std;
// Outline of this program
/*
This program is for oxidize "NW" whose z axis is long axis.
You have to make "layer(number)" in the same directory.... | TOOL | 0.945849 | 3.305172 |
ac0953d6-8e55-4a7a-b3e4-af764ae048bf | nskowron/Uni | Sem4/AI/List3/bot.cpp | #include <iostream>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <string.h>
#include <string>
#include <limits>
#include <algorithm>
#include "board.hpp"
int DEPTH;
int WIN_SCORE = 100000;
extern short board[5][5];
// to check moves in a spiral from inside - help pruning
inline in... | ALGO | 0.950288 | 4.6169 |
80b801a4-968d-4670-a70c-070afbec6c7e | cs-joy/C-Tweenty | 35.LogicalOperatorsAndThreeWayComparison/C++ 20 Template Project/main.cpp | #include <iostream>
consteval int get_value(){
return 3;
}
int main(){
constexpr int value = get_value();
std::cout << "value : " << value << std::endl;
return 0;
} | TOOL | 0.860461 | 4.566338 |
3fa57fe3-bd12-4ad5-ab6e-915a0b1fc652 | sarvex/leetcode-chicken | solution/0500-0599/0581.Shortest Unsorted Continuous Subarray/Solution.cpp | class Solution {
public:
int findUnsortedSubarray(vector<int>& nums) {
vector<int> arr = nums;
sort(arr.begin(), arr.end());
int left = 0, right = arr.size() - 1;
while (left <= right && nums[left] == arr[left]) ++left;
while (left <= right && nums[right] == arr[right]) --rig... | ALGO | 0.999958 | 5.964485 |
2e960782-9595-486b-8052-72294a6fd82c | Ananyatomar25/Leetcode-Problem-solving | 1359-count-all-valid-pickup-and-delivery-options/1359-count-all-valid-pickup-and-delivery-options.cpp | class Solution {
public:
int countOrders(int n) {
if(n == 0 || n == 1) return n;
long res = 1, mod = 1000000007;
for(int i=1;i<=n;i++){
res = res*i;
res = res%mod;
res = res*((2*i) - 1);
res = res%mod;
}
return... | ALGO | 0.999984 | 5.651919 |
57402f5c-37c3-47b7-8159-7f8a042444d4 | Artak3689/Code- | BineriTree.cpp | #include<iostream>
#include<vector>
struct Node
{
int data ;
Node* left;
Node* right;
Node(int num)
{
this->data = num ;
this->left = nullptr ;
this->right = nullptr ;
}
~Node()
{
delete this->left;
delete this->right;
}
};
void insert(int num,Node* root)
{
if(num < root->data && root->left==nullp... | ALGO | 0.999718 | 4.100004 |
10c03543-1293-4cdd-97c3-dbf900a25713 | liang-junkai/ICS2019-PA | nexus-am/apps/microbench/src/dinic/dinic.cpp | #include <benchmark.h>
static int N;
const int INF = 0x3f3f3f;
struct Edge {
int from, to, cap, flow;
Edge(){}
Edge(int from, int to, int cap, int flow) {
this->from = from;
this->to = to;
this->cap = cap;
this->flow = flow;
}
};
template<typename T>
static inline T min(T x, T y) {
return x... | TEST | 0.949257 | 4.328967 |
12f13550-04cb-46b3-a5dc-6e9606e8d9e4 | bwks/university_2801ict | problem4/task-1/spf.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <algorithm>
#include <string>
#include <climits>
using namespace std;
struct Node {
int toll;
unordered_map<string, int> roads;
};
struct Route {
vector<string> path;
int distance;
int toll;
};
// Helper function for ... | ALGO | 0.999954 | 6.289884 |
d5d9a35c-9cae-4b56-baff-fa5da01dea36 | Sean0628/competitive_programming | atcoder/abc/abc234/d.cpp | #include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define out(arg) cout << (arg) << endl
using ll = long long;
using P = pair<int, int>;
using mint = modint1000000007;
void chmax(ll& a, ll b) { a = max(a, b); }
void chmin(ll& a,... | ALGO | 0.999993 | 4.097216 |
6e78d3bc-1a94-4f88-8bce-f1bb1864985e | ishandutta2007/codeforces | yhchang3/normal/1077/F1.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pll;
ll n,k,x,b[5010],dp[5010][5010];
deque<pll> dq;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n>>k>>x;
for(int i=1;i<=n;i++)
cin>>b[i];
for(int i=1;i<=n;i++)
for(int j=0;j<=x;j++)
... | ALGO | 0.999963 | 3.819164 |
ba3052b8-d249-4728-b7a3-073f8c4d3783 | genqiaolynn/cpp_learn_package | project/tools1/c5/deletefiles.cpp | #include "_public.h"
// 程序退出和信号2、15的处理函数。
void EXIT(int sig);
int main(int argc,char *argv[])
{
// 程序的帮助。
if (argc != 4)
{
printf("\n");
printf("Using:/project/tools1/bin/deletefiles pathname matchstr timeout\n\n");
printf("Example:/project/tools1/bin/deletefiles /log/idc \"*.log.20*\" 0.02\n");
... | TOOL | 0.869412 | 3.32624 |
8a4a1efd-596e-4df1-9e7a-bdd4167af0de | StolasIn/leetcode_Submissions | content/maximum-product-subarray/Wrong Answer/1-19-2021, 6_43_47 PM/Solution.cpp | // https://leetcode.com/problems/maximum-product-subarray
class Solution {
public:
int maxProduct(vector<int>& nums) {
int pro1=1;
int pro2=1;
int max1=1;
int min1=1;
int sum=1;
int n=nums.size();
for(int i=0;i<n;i++){
max1=max(min1*nums[i],max1*n... | ALGO | 0.999984 | 6.10615 |
673b3d77-a707-4480-a006-459a2c84efa0 | dmh2000/go_leetcode | lc-cpp/philo.cpp | #include <Windows.h>
#include <iostream>
#include <mutex>
#include <algorithm>
#include <functional>
#include <list>
class BinarySemaphore {
private:
int count;
std::condition_variable cv;
std::mutex mtx;
public:
BinarySemaphore(int v) {
count = v;
}
void put() {
std::unique_lock<std::mutex> lk(mtx);
//... | ALGO | 0.999632 | 4.822922 |
b9c1dacb-2e9b-48ef-afbb-779b3a359ed9 | quentin452/CatzEngine-BulletFork | lib/src/BulletCollision/CollisionShapes/btBvhTriangleMeshShape.cpp | // #define DISABLE_BVH
#include "BulletCollision/CollisionShapes/btBvhTriangleMeshShape.h"
#include "BulletCollision/CollisionShapes/btOptimizedBvh.h"
#include "LinearMath/btSerializer.h"
/// Bvh Concave triangle mesh is a static-triangle mesh shape with Bounding Volume Hierarchy optimization.
/// Uses an interface t... | ALGO | 0.950739 | 7.822073 |
08fa9f23-d34e-44c5-bf6a-98738b190836 | jagfoljersolen/lab6z2 | boost_1_86_0/libs/regex/performance/table_helper.cpp | #ifdef _MSC_VER
# pragma warning (disable : 4224)
#endif
#include <boost/regex.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/filesystem.hpp>
#include <boost/filesystem/fstream.hpp>
#include <boost/container_hash/hash.hpp>
#include <vector>
#include <set>
#include <iostream>
#include <sstream>
#include <ioman... | TOOL | 0.91192 | 4.91222 |
9a17c17b-5d45-423a-9091-282c49a78e92 | alicevision/AliceVision | src/aliceVision/track/TracksBuilder.cpp | #include "TracksBuilder.hpp"
#include <aliceVision/system/Logger.hpp>
#include <aliceVision/utils/Histogram.hpp>
#include <lemon/list_graph.h>
#include <lemon/unionfind.h>
namespace aliceVision {
namespace track {
using namespace aliceVision::matching;
using namespace lemon;
/// IndexedFeaturePair is: map<viewId, ... | ALGO | 0.921547 | 6.194482 |
30b1e6ec-622f-486b-b173-4b0a17daa1b8 | tyabus/xray-1.0 | 3rd_party/boost/libs/thread/src/threadmon.cpp | #include <boost/config.hpp>
#if defined(BOOST_HAS_WINTHREADS)
#if defined(BOOST_THREAD_BUILD_DLL)
#include <boost/thread/detail/threadmon.hpp>
#define WIN32_LEAN_AND_MEAN // Exclude rarely-used stuff from Windows headers
#include <windows.h>
#ifdef BOOST_MSVC
# pragma warning(disable : 4786)
#endif
#include <l... | TOOL | 0.891992 | 6.875803 |
48554817-996a-46a1-a640-5d025a636936 | saucam/code | codeforces/itmosummercamp2021/day6/A/k.cpp | #include <bits/stdc++.h>
using namespace std;
const long long INF = numeric_limits<long long>::max();
vector<long long> t;
int x;
void buildTree(vector<int> &a) {
x = 1;
int n = a.size();
while(x < n) {
x *= 2;
}
t.assign(2 * x - 1, INF);
for (int i=0; i< n; i++) {
t[i + x - 1] = a[i];
}
for (... | ALGO | 0.999318 | 4.378869 |
6da8de36-d99e-40e9-a419-5011d0ebdf9e | hanumanb/Trillions | packages/stokhos/example/uq_handbook/pce_example.cpp | // pce_example
//
// usage:
// pce_example
//
// output:
// prints the Hermite Polynomial Chaos Expansion of the simple function
//
// v = 1/(log(u)^2+1)
//
// where u = 1 + 0.1*x_1 + 0.05*x_2 + 0.01*x_3 x1,x2,x3 are zero-mean
// unit-variance Gaussian random variables.
#include "Stokhos_Sacado.h... | ALGO | 0.973289 | 6.094447 |
67567111-9ead-49e4-adfb-355800bef6e9 | mami-uchida/firebase_practice4 | 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 |
51fe972a-bc16-4173-811b-f9e0385e5201 | BinomialSheep/CompetitiveC-- | AtcoderProblems/典型90/056_LuckyBag.cpp | #pragma region header
#include <bits/stdc++.h>
// デバッグ用マクロ：https://naskya.net/post/0002/
#ifdef LOCAL
#include <debug_print.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using vi = vector<int>... | ALGO | 0.999974 | 5.105899 |
cd85f1fb-dcd7-4b9e-803f-0101e9bac0c5 | ameyjain99/LeetCode | Solutions/0353. Design Snake Game/0353.cpp | class SnakeGame {
public:
/** Initialize your data structure here.
@param width - screen width
@param height - screen height
@param food - A list of food positions
E.g food = [[1,1], [1,0]] means the first food is positioned at [1,1], the
second is at [1,0]. */
SnakeGame(int width, int hei... | ALGO | 0.999923 | 6.208695 |
d3e7d39f-3dc3-4f8b-bf10-812f6886621b | jaouad2001/Codesforces_solutions | Night at the Museum.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
int count = 0;
char prev = 'a';
for(auto i : s){
int a = abs(i - prev);
... | ALGO | 0.999776 | 3.763361 |
ce22f5ec-3867-476a-aaed-6095a959b540 | blackaly/ps | cf/Atilla's Favorite Problem.cpp | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long
#define makefast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
using namespace std;
int main() {
makefast;
int tt = 0; cin >> tt;
while(tt--){
int n = 0; cin >> n;
string str = ""; cin... | ALGO | 0.999693 | 4.700662 |
dfab5bd6-6e7e-446e-8575-725ca49ed25e | ishandutta2007/codeforces | sendthemtohell/normal/1151/A.cpp | #ifndef LOCAL
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#endif //LOCAL
#define _SCL_SECURE_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
//#define push_back pb
#define first x
#define second y
#include <cassert>
#include <ciso646>
#includ... | ALGO | 0.999749 | 4.30645 |
2aeaf883-6eac-4dcc-9748-4af711c412c5 | MahieenSabahat/BBT243019 | BBT243019 (1)/Code 1.cpp | #include <iostream>
using namespace std;
int main() {
int num1, num2, product;
cout << "Enter the first integer: ";
cin >> num1;
cout << "Enter the second integer: ";
cin >> num2;
product = num1 * num2;
cout << "The product is " <<product<<"\n";
return 0;
}
| TOOL | 0.983006 | 4.105022 |
455e01a1-db48-4a63-90e7-aa78bcaa4221 | dhruvabhat24/Codechef | Practice for ZCO and INOI/Practice Problems/Sorting Rows of Numbers.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n;
cin>>n;
vector<vector<int>>v1;
for(int i=0;i<n;i++){
vector<int>v2;
int num;
while(cin>>num){
if(num==-1){
v1.push_back(v2);
break;
}
v2.push_... | ALGO | 0.999589 | 4.441367 |
25bf89e1-a34e-4bb2-8ba2-1509515395ab | VitorNoe/exerc-ciosStrings-Arrays | exercicio14.cpp | #include <iostream>
#include <string>
using namespace std;
void inverterPalavra(const string& palavra) {
if (palavra.empty()) {
return;
}
inverterPalavra(palavra.substr(1));
cout << palavra[0];
}
int main() {
char palavra[10];
cout << "Digite uma palavra: ";
cin >> palavra;
co... | ALGO | 0.998457 | 5.825717 |
7553fb10-d83c-4e69-ae92-4d9571994474 | jjuyeoni/prac-algorithm | programmers/백만장자프로젝트.cpp | #include<bits/stdc++.h>
using namespace std;
int test_case, N;
long long sum = 0, mx;
int a[1000010];
int main() {
cin >> test_case;
for (int i = 0; i < test_case; i++) {
memset(a, 0, sizeof(a));
sum = 0;
cin >> N;
for (int j = 0; j < N; j++) {
cin >> a[j];
}
// solve ۼ
mx = a[N-1];
for (int j... | ALGO | 0.999239 | 3.96016 |
eaa77e3c-8c1c-417a-9922-fd12439dff3d | ljw9609/SE344 | 大作业/用到的额外库/eigen3/eigen-eigen-5a0156e40feb/doc/examples/tut_arithmetic_scalar_mul_div.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
Matrix2d a;
a << 1, 2,
3, 4;
Vector3d v(1,2,3);
std::cout << "a * 2.5 =\n" << a * 2.5 << std::endl;
std::cout << "0.1 * v =\n" << 0.1 * v << std::endl;
std::cout << "Doing v *= 2;" << std::endl;
v *= 2;
std::cout << ... | ALGO | 0.992431 | 3.669638 |
9ea2180f-7dac-4f04-8bd4-887f7f9aa54f | rajvikash18113/CLG-Code | DSA Lab/lab5.cpp | /*Write a program to implement push and pop operations on a stack using linear
array*/
#include <iostream>
using namespace std;
class STACKS
{
private:
int stack[10];
const int MAX = 10; // Constant for maximum size
int top;
public:
STACKS() : top(-1) {} // Constructor to initialize top
void p... | ALGO | 0.999343 | 5.825311 |
de0e8f3d-0a42-45fc-bef3-0ed572340a61 | prashantdhaka1/LeetCode-Solutions | C++/two-sum-iv-input-is-a-bst.cpp | // Time: O(n)
// Space: O(h)
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool findTarget(TreeNode* root, int k) {
if (!root) {
... | ALGO | 0.999996 | 6.494485 |
7e1da51b-5fd6-46c0-9e59-a3e98d65cf5f | ssugam10/leetcode-solutions | 0003-longest-substring-without-repeating-characters/0003-longest-substring-without-repeating-characters.cpp | class Solution {
public:
int lengthOfLongestSubstring(string s) {
int n = s.length();
unordered_set<int> st;
int ct = 0;
int i = 0;
int j = 0;
while(j<n){
int ch = (int)s[j];
if(st.find(ch) != st.end()){
ct = max(ct,j-i);
... | ALGO | 0.999959 | 6.076682 |
050299d7-d3c4-4292-b399-f2e2c053aa99 | A-Nobel/HydraNew | gtsam/gtsam/geometry/Similarity2.cpp | /**
* @file Similarity2.cpp
* @brief Implementation of Similarity2 transform
* @author John Lambert, Varun Agrawal
*/
#include <gtsam/base/Manifold.h>
#include <gtsam/geometry/Pose2.h>
#include <gtsam/geometry/Rot3.h>
#include <gtsam/geometry/Similarity2.h>
#include <gtsam/slam/KarcherMeanFactor-inl.h>
namespa... | ALGO | 0.998745 | 3.750127 |
10ebbf25-be0b-4e48-957f-a97cb8dfb3e3 | lostrepository/lainexperiment | lainexperiment-cpp/src/hackerrank/mozilla/compress-the-string.cpp | /*
*
* This source file is a part of lainexperiment project.
* Description for it can be found in ReadMe.txt.
*
*/
/*
*
* Date: 20/03/2016
*
* Hacker rank
* Mozilla challenge
* Problem: Compress the string
* Status: accepted
*
* Problem
*
* Compress the string using run-length algorithm.
*
* Sample
... | ALGO | 0.999864 | 5.398105 |
62664c38-62d3-4ac5-9cfd-5ba93d8d00af | ishandutta2007/codeforces | shayan.p/normal/645/D.cpp | // new day,new strength,new thougts
#include<bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define F first
#define S second
#define sz(c) int((c).size())
#define REP(i,n) for(int i=0;i<int(n);i++)
#define REPD(i,n) for(int i=int(n)-1;i>=0;i--)... | ALGO | 0.999992 | 4.001007 |
4b49e3b1-5aa7-44e1-83f3-43eb4fe2dbbe | YifeiNie/Lidar_SLAM | MR_SLAM/LoopDetection/src/fast_gicp/thirdparty/Eigen/bench/benchmarkX.cpp | // g++ -fopenmp -I .. -O3 -DNDEBUG -finline-limit=1000 benchmarkX.cpp -o b && time ./b
#include <iostream>
#include <Eigen/Core>
using namespace std;
using namespace Eigen;
#ifndef MATTYPE
#define MATTYPE MatrixXLd
#endif
#ifndef MATSIZE
#define MATSIZE 400
#endif
#ifndef REPEAT
#define REPEAT 100
#endif
int mai... | ALGO | 0.97335 | 3.370773 |
43a04059-1bdd-40eb-b0d6-b8adfe05e797 | abhinavmalhotra01/leetcode | 1125-smallest-sufficient-team/1125-smallest-sufficient-team.cpp | class Solution {
public:
int m, n;
int target_mask;
vector<int> result;
unordered_map<string , int > dp;
void solve(vector<int> &people_skill , int idx , vector<int> &temp, int mask ) {
if(idx == people_skill.size()) {
if(mask == target_mask) {
if(... | ALGO | 0.999882 | 5.767696 |
3183ec05-9b5f-4a9f-82d1-a7d770d09a01 | Wu0409/NOIP_solution | 不同路径（Leetcode 62）/main.cpp | //QUESTION:不同路径
#include <iostream>
using namespace std;
/*
int u[100][100];
int m = 7,n = 3;
int solution(int m = 0, int n = 0) {
if(m >= 7 || n >= 3) return 0;
if(m == 6 && n == 3){
return 1;
}
int &ans = u[m][n];
if(ans != -1) return ans;
ans = 0;
ans += solution(m+1,n) + s... | ALGO | 0.998151 | 4.053474 |
4724498f-8676-4175-abc7-5d92e85df06d | michalpolic/hololens_mapper | third_party/AliceVision/src/aliceVision/panorama/panoramaMap.cpp | #include "panoramaMap.hpp"
#include <iostream>
#include <list>
namespace aliceVision
{
bool PanoramaMap::append(IndexT index, const BoundingBox & box)
{
BoundingBox bbox = box;
// if the reference bounding box is looping on the right of the panorama,
// make it loop on the left instead to reduce th... | ALGO | 0.994952 | 5.210432 |
a376850d-b8aa-4feb-aa4a-22a1978b8a22 | liubaoryol/Project5_lo13_agl8 | src/Project5.cpp | ///////////////////////////////////////
// COMP/ELEC/MECH 450/550
// Project 5
// Authors: Alex Liapis & Liuba Orlov Savko
//////////////////////////////////////
#include <iostream>
#include <fstream>
#include <cmath>
#include <functional>
#include <memory>
#include <vector>
#include <ompl/base/SpaceInformation.h>
#in... | ALGO | 0.998879 | 5.281186 |
7ea53a72-697e-47eb-bff7-3ab8b95823e7 | wongxingjun/leetcode | bestTimetoBuyandSellStock2.cpp | /*
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same ... | ALGO | 0.999045 | 6.129147 |
18eef3da-9e45-4cc0-9f73-c257225beb27 | harsh70568/Daily_Problems_Solution | Symmetric Tree - GFG/symmetric-tree.cpp | // { Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
#define MAX_HEIGHT 100000
// Tree Node
struct Node {
int data;
Node* left;
Node* right;
};
// Utility function to create a new Tree Node
Node* newNode(int val) {
Node* temp = new Node;
temp->data = va... | ALGO | 0.999854 | 6.443497 |
579f258e-718b-477e-94e9-d5a4a7695d46 | ajitkumar108/c-- | average.cpp | #include<iostream>
using namespace std;
int main()
{
int a;
cin>>a;
int arr[a];
int count=0;
for (int i = 0; i < a; i++)
{
cin>>arr[i];
cout<<arr[i]<<end;
for (int j = i+1; i < a; i++)
{
for (int k = 0; k < a; i++)
{
if (arr[k]==(ar... | ALGO | 0.999053 | 3.167304 |
1cdb1d06-594c-4a87-bc3c-4fd53bffd7d3 | RafDevX/advent-of-code | 2021/day03/part1.cpp | #include <fstream>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int most_common(vector<vector<int>> count, bool least_common = false)
{
string num = "";
for (int i = 0; i < count.size(); i++) {
char n = '0';
if (count[i][1] > count[i][0]) {
n = '1';
}
if (least_common) {
... | ALGO | 0.995238 | 5.740073 |
165bc91a-6fcf-4e8e-860a-28edbb2ace10 | amirhnazerii/Lidar_ObjDet_Robustness | pcdet/ops/iou3d_nms/src/iou3d_nms.cpp | #include <torch/serialize/tensor.h>
#include <torch/extension.h>
#include <vector>
#include <cuda.h>
#include <cuda_runtime_api.h>
#include "iou3d_nms.h"
#define CHECK_CUDA(x) do { \
if (!x.type().is_cuda()) { \
fprintf(stderr, "%s must be CUDA tensor at %s:%d\n", #x, __FILE__, __LINE__); \
exit(-1); \
} \... | ALGO | 0.947305 | 5.820333 |
6f260756-b654-446a-b40d-2cf694800f60 | jsq1234/DSAProblems | Backtracking/fair-distribution-of-cookies_1418.cpp | /*
[8,15,10,20,8]
2;
[6,1,3,2,2,4,1,2]
3;
*/
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int distributeCookies(vector<int>& cookies, int k) {
vector<int> child(k,0);
int minUnfairness = INT_MAX;
solve(cookies,0,child,minUnfairness);
return minUnfairness;
... | ALGO | 0.999641 | 4.41722 |
57e034a5-3900-4c2b-b06b-89761ab33279 | omarhashem92/Lidar_Obstacle_Detection | src/environment.cpp | /* \author Aaron Brown */
// Create simple 3d highway enviroment using PCL
// for exploring self-driving car sensors
#include "sensors/lidar.h"
#include "render/render.h"
#include "processPointClouds.h"
#include "myProcessPointCloud.h"
// using templates for processPointClouds so also include .cpp to help linker
//#in... | TOOL | 0.895708 | 4.49708 |
cf9c7a8d-d236-4b9d-9819-b0e46727fe5d | Abhijith0422/paisa_management | 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.998784 | 6.761023 |
849f879f-3b9d-438c-a513-d205deb5eecd | kajoj2/Marilin-ender3-skr-tft-bttouch | Marlin/src/HAL/shared/backtrace/unwarm_arm.cpp | #if defined(__arm__) || defined(__thumb__)
#define MODULE_NAME "UNWARM_ARM"
#include <stdio.h>
#include "unwarm.h"
/** Check if some instruction is a data-processing instruction.
* Decodes the passed instruction, checks if it is a data-processing and
* verifies that the parameters and operation really indicate a d... | TOOL | 0.867791 | 4.13308 |
94bc89b5-87d8-402f-9b3c-5132f19ee445 | sujal3011/Striver-A2Z-DSA | Arrays/Medium/Sort an array of 0s, 1s and 2s.cpp | #include<bits/stdc++.h>
using namespace std;
//Storing cnt of 0,1,2
//Time complexity--->O(2*n)....two passes required
//Space complexity--->O(n)
void sortColors(vector<int>& arr) {
int n=arr.size();
int zero_cnt=0,one_cnt=0,two_cnt=0;
for(int i=0;i<n;i++){
if(arr[i]==0) zero_cnt++;... | ALGO | 0.99959 | 5.037473 |
79b2628f-7d73-4eb4-a361-f2fc58c37b2d | felip-auten-code/STM32F407ICP-ARUCO-VALIDATION | ICP/eigen-3.4.0/unsupported/doc/examples/MatrixPower_optimal.cpp | #include <unsupported/Eigen/MatrixFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
Matrix4cd A = Matrix4cd::Random();
MatrixPower<Matrix4cd> Apow(A);
std::cout << "The matrix A is:\n" << A << "\n\n"
"A^3.1 is:\n" << Apow(3.1) << "\n\n"
"A^3.3 is:\n" << Apow(3.3) << "\n\n"
... | ALGO | 0.997654 | 3.396939 |
990e7769-956c-4f15-a87b-cda9a7eae3a7 | Warawreh/CP-Library | Contests/ACPC 2022 KickOff/m.cpp | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define fast ios::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int nax = 1e7 + 10;
int cos... | ALGO | 0.999968 | 3.868635 |
e5c8da23-d60e-4254-8ac9-259333714857 | hanwenlei/Leetcode | leetcode5.cpp | #include<iostream>
#include<string>
#include<algorithm>
#include<cstring>
using namespace std;
class Solution {
public:
string longestPalindrome(string s) {
string temp = "!#";
int length = s.length();
for(int i = 0; i < length; ++i)
{
temp += s[i];
temp += '#';
... | ALGO | 0.999859 | 4.378226 |
4bc23668-cbbe-4dc2-b10a-75e0b596e71d | kabuto64425/Atcoder | other/CADDi2018/ProductAndGCD.cpp | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
const ll INF = 1000000000000; /... | ALGO | 0.999987 | 4.898897 |
4e468d20-4c6f-47b5-a16e-f9ef18933ff0 | basedafdev/geometry-processing-cubicstylization | libigl/include/igl/readDMAT.cpp | #include "verbose.h"
#include <cstdio>
#include <iostream>
#include <cassert>
#include <memory>
// Static helper method reads the first to elements in the given file
// Inputs:
// fp file pointer of .dmat file that was just opened
// Outputs:
// num_rows number of rows
// num_cols number of columns
// Returns
... | TOOL | 0.868912 | 6.084391 |
c4845619-68ad-46d0-9d9a-f3fa03d708ff | paras-aghija/placement_DSA | DSA/DP/dp_adjacentBitCount.cpp | #include<bits/stdc++.h>
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
/*
SPOJ: GNYR09F
*/
int dp[105][105][2];
int solve(int n, int k, int first) {
if (n == 0) return 0;
if (n == 1) {
if (k == 0) return 1;
else return 0;
}
if (dp[n][k][first] != -1) {
return dp[n]... | ALGO | 0.999926 | 4.050787 |
51451259-5a54-427b-99bc-e04e5e7f24e9 | bingleilou/fSEAD | fpga/hls/xstream_e20/cardio/C3/xstream_cardio_E20C3.cpp | #include "xstream_cardio_E20C3.h"
void windower(interface_t data,
interface_t X0[DIM_MAX],interface_t X1[DIM_MAX],interface_t X2[DIM_MAX],interface_t X3[DIM_MAX],interface_t X4[DIM_MAX],interface_t X5[DIM_MAX],interface_t X6[DIM_MAX],interface_t X7[DIM_MAX],interface_t X8[DIM_MAX],interface_t X9[DIM_MAX],in... | ALGO | 0.967408 | 3.297001 |
390b1731-6460-4888-8053-fd11dfc484ac | sottorivalab/FORECAST_image_tiling | code/image_tiles/3rdparty/OpenCV-4.1.2/modules/imgproc/src/segmentation.cpp | #include "precomp.hpp"
/****************************************************************************************\
* Watershed *
\****************************************************************************************/
namespace cv
{
// A no... | ALGO | 0.998101 | 6.091136 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.