uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
aedfa035-1421-470d-8791-5100c82fb76d | ROCm/rocSHMEM | src/wf_coal_policy.cpp | #include "wf_coal_policy.hpp"
#include "util.hpp"
namespace rocshmem {
/**
* TODO: Determine tradeoffs between number of instructions, LDS utilization,
* and quality of coalescing.
*/
/**
* About the current algorithm:
* 1) The algorithm is low overhead. It uses no LDS (shared) space or
* rounds of a t... | ALGO | 0.995716 | 4.729782 |
6d581a8b-801d-4733-8f5b-d73429c85f0f | RoniRan542/MyCodingProjects | coding_quests/min_coins_to_sum.cpp | /****************************************************************
*Name : Ran Aharon Cohen *
*Date: 14.07.22 *
*Description : Compute the fewest amount of coins that you need*
in order to make up the sum *
**************... | ALGO | 0.999707 | 5.645421 |
a597c759-c006-41a5-9690-6acc1dfb559d | gengzhenfei/LeetCode | c++/L007ReverseInteger.cpp | #include <string>
#include <algorithm>
#include <iostream>
using namespace std;
class L007ReverseInteger
{
private:
/* data */
public:
L007ReverseInteger(/* args */);
~L007ReverseInteger();
int reverse(int x)
{
// 如果x==-2147483648，直接返回0
if (x == -2147483648) return 0;
// |... | ALGO | 0.999853 | 5.325685 |
0843f0ce-c6d1-4178-8dd9-370494036280 | ArielGarciaM/CompetitiveProgramming | Kattis/torn2pieces.cpp | #include <bits/stdc++.h>
using namespace std;
map<string, set<string>> adj;
map<string, int> vist;
map<string, string> parent;
void dfs(string src)
{
vist[src] = 1;
for(auto v : adj[src])
{
if(!vist[v])
{
parent[v] = src;
dfs(v);
}
}
}
int main()
{
... | ALGO | 0.999997 | 4.897982 |
76e3f48f-745d-4af9-9adb-2588b711181b | Haneol/Algorithm | [challenge-90]/w1/1213.cpp | #include<bits/stdc++.h>
using namespace std;
int arr[26] = {0, };
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string str;
cin >> str;
sort(str.begin(), str.end());
for(char c : str) arr[c - 'A']++;
int tmp = -1;
string output = "";
for(int i = 0; i < 26; i++) {
i... | ALGO | 0.999991 | 3.632998 |
6db0fdb4-dcda-4bdb-88c9-4adec847a483 | pallabcodes/c-or-c-plus-plus | pointers-related/pointers.cpp | #include <iostream>
using namespace std;
int doublePriority()
{
int num1;
double num2;
// This is known as type promotion. since, double has a higher rank or priority
cout << sizeof(num1 + num2);
return 0;
}
int size()
{
// Create a new integer and assign it the value 10
int *ptr1 = new ... | TOOL | 0.982354 | 4.483373 |
8a3e4bdd-cdca-42c7-b98a-bd0368dc579d | kylanisrina/DutaSampoPantine | DutaSampoClear/function3.cpp | #include <iostream>
using namespace std;
long power(int x){
return x*x*x*x;
}
int main(){
int y = 2;
double z;
z = (power(y + 2) - power(y)) / power(y);
cout << "power(y) = " << power(y) << "\n";
cout << "power(y+2) = " << power(y+2) << ", and z = " << z << endl;
} | ALGO | 0.998725 | 3.678103 |
940c0a36-4344-4081-9fe3-565dfd1a7afa | LoadingSugar/HDU2 | KMP.cpp | #include<stdio.h>
#include<stdlib.h>
#include<string>
#define maxSize 15
typedef struct {
char *str;
int length;
}Str;
int naive(Str str,Str substr) {
int i=1,j=1,k=1;
while(i<=str.length&&j<=substr.length){
if(str.str[i]==substr.str[j]){
i++;
j++;
}else{
j=1;
i=++k;//i=k++
}
}
if(j>substr.le... | ALGO | 0.999542 | 3.372651 |
b2fcd190-587c-421c-846a-bf6e99577da7 | takechiyo-19940627/algorithm-question | at_coder/AtCoderBeginnerContest215/B-log2(N).cpp | #include <iostream>
#include <cmath>
using namespace std;
int main() {
long long n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
long long l = 2;
long long cnt = 1;
bool can_contiune = true;
while (can_contiune) {
l *=2;
if (l > n) {
can_contiune = false;
break;
... | ALGO | 0.999954 | 4.563612 |
1a406e35-5a8d-4248-ae11-087943577a1c | cooljacket/algo2015 | w9/BB.cpp | #include <cstring>
#include <cstdio>
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
int dp[1<<20];
int sum[1<<20];
int p[101];
int minz;
int main()
{
int i,n,j,t1,t2,x;
scanf("%d",&n);
for(i = 0;i < n;i ++)
{
sc... | ALGO | 0.999792 | 3.158536 |
b240a9b6-9703-4a2d-8e61-b6b108009b76 | Mrinal321/Competitive-Programming-Problem | C_Longest_Good_Array.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define lld long double
//Ordered set(tree)
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type, less<ll... | ALGO | 0.999628 | 4.073717 |
7437e63a-c066-4662-8cba-89fdfd07a698 | p-mazhnik/mipt-cpp | 1sem/Base_seminar/10_2/2.cpp | #include <iostream>
#include <cmath>
using namespace std;
struct point
{
int x;
int y;
};
int idistance(point a, point b)
{
return sqrt((a.x - b.x)*(a.x - b.x) + (a.y - b.y)*(a.y - b.y));
}
int main()
{
point a, b;
cin >> a.x >> a.y >> b.x >> b.y;
cout << idistance(a, b) << endl;
return ... | ALGO | 0.999797 | 3.815156 |
32800ae9-9710-45ce-baf6-946da2f91fe1 | JudyBee/ETH-AlgoLab2019 | Week 11/surveillance/surveillance.cpp | #include <iostream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/push_relabel_max_flow.hpp>
typedef boost::adjacency_list_traits<boost::vecS, boost::vecS, boost::directedS> traits;
typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property,
boost::property<boost... | ALGO | 0.999852 | 4.047818 |
05a30d5d-959f-4334-9101-89878718e0fc | nuaazdh/acm | exercise-6-1-UVa673-Parentheses-Balance.cpp | #include <stdio.h>
#include <string.h>
#include <stack>
char balance_parenthese(char c) {
switch (c) {
case ')':
return '(';
case ']':
return '[';
default:
return ' ';
}
}
int main() {
int T, i, len;
char buff[200];
scanf("%d", &T);
w... | ALGO | 0.999697 | 4.565767 |
49ce9827-d963-443d-ae69-8123fcfdbded | Adri-10/Data-Structure | Lab 8(Heap)/submit/4.cpp | #include<stdio.h>
#include <iostream>
using namespace std;
void heapify(int arr[], int n, int i)
{
int smallest=i;
int l= 2*i;
int r= 2*i+1;
if (l<n && arr[l] < arr[smallest])
{
smallest = l;
}
if (r < n && arr[r] < arr[smallest])
{
smallest = r;
}
if (smallest!= ... | ALGO | 0.999885 | 3.66032 |
5f5954ac-a26b-466d-b4cd-bacaba263a8c | aviksain/Arsh-DSA-Sheet | Heaps/Medium/K_Closest_Points_to_Origin.cpp | class Solution {
public:
vector<vector<int>> kClosest(vector<vector<int>>& points, int k) {
vector<vector<int>> ans;
priority_queue<vector<int>> pq;
for(auto p: points) {
int i = p[0];
int j = p[1];
pq.push({i*i + j*j,i,j});
if(pq.size() > k) ... | ALGO | 0.999998 | 5.734128 |
1f0d6098-3ee9-4e56-9b6c-4bfe514bb428 | Gggguns/programmingLearning | c++/text_2024_4_25_exam_1.cpp | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
int getLongestPalindrome(string A) {
int Ret = -0x3ffff;
int n = A.size();
int m = A.size();
vector<vector<bool>> dp(n + 1, vector<bool>(m + 1));
for (int i = n;i... | ALGO | 0.999714 | 4.833259 |
56a83a86-84d0-40e2-9d38-71b938290b45 | buzsakilab/fieldtrip | src/combineClusters.cpp | #include "mex.h"
#include <algorithm>
#include <vector>
/* The computational routine */
void combineClusters_impl(unsigned int *labelmat, unsigned int *total, mwSize spatdimlength, mwSize timefreqlength, mxLogical *neighbours, unsigned int *out) {
/* increase the total by one because indices in labelmat are ... | ALGO | 0.999856 | 6.373729 |
81905b9b-b4fb-4e0f-9dcf-5a47f0be2048 | phy504-sbu-s24/homework3 | solutions/hilbert.cpp | #include <cassert>
#include <iostream>
#include <vector>
using real_vec_t = std::vector<double>;
using real_mat_t = std::vector<real_vec_t>;
int main() {
// read in the size of the matrix
int N{-1};
std::cout << "Enter the size, N, for the vector: ";
std::cin >> N;
assert(N > 0);
// const... | ALGO | 0.9996 | 4.466045 |
3abb4f2d-82e3-486b-9bff-ac4276c88a68 | charles-pku-2013/CodeRes_Cpp | Google_OJ/Practice_Round_China_New_Grad_Test_2014/A_Bad_Horse/ColorGraph.cpp | //!! 图着色问题
// https://code.google.com/codejam/contest/2933486/dashboard
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <iostream>
#include <set>
#include <map>
#include <bitset>
#include <queue>
#define N_COLORS 2
enum { UNCOLORED, RED, BLUE };
struct GraphNode... | ALGO | 0.999935 | 5.061989 |
2b0a76a6-e411-4f00-b179-3a3850276169 | dadm-projekt/dadm-cpp | eigen-3.3.7/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.999781 | 3.625966 |
8b441d37-c5b9-4b58-ba00-831a670d8d77 | ForUsers/NumWorksHackedOs | poincare/src/hyperbolic_tangent.cpp | #include <poincare/hyperbolic_tangent.h>
namespace Poincare {
template<typename T>
Complex<T> HyperbolicTangentNode::computeOnComplex(const std::complex<T> c, Preferences::AngleUnit angleUnit) {
return Complex<T>(Trigonometry::RoundToMeaningfulDigits(std::tanh(c)));
}
template Complex<float> Poincare::HyperbolicTa... | ALGO | 0.998403 | 6.934807 |
f4bc4239-5f09-46ce-820e-bf93d17c09d2 | nhkieu21/CPlusPlus | oddsum.cpp | #include<bits/stdc++.h>
using namespace std;
int main ()
{
long long n=1,kq=0;
while (n!=0)
{
cin>>n;
if (n%2==1)
{
kq=kq+n;
}
}
cout<<kq;
}
| ALGO | 0.999946 | 3.397315 |
9c91536c-2acf-4699-bd3c-18d8dd69636a | Hugoalv79/Competitive-Programming | CodeForces/800-1000/Lucky_Ticket.cpp | #include<math.h>
bool isLucky(int n)
{
int digits = (int)log10(n) + 1;
int sum1=0, sum2=0;
for (int i=0; n>0; n/=10,i++)
{
if(i<digits/2)
sum1 += n%10;
else
sum2 += n%10;
}
return sum1 == sum2;
}
// #include <iostream>... | ALGO | 0.998792 | 3.35846 |
a28c0a7f-be74-42bc-8af5-ec75be206c90 | Tphuong612/Cplusplus_ptit | test vao ra tren tep.cpp | #include <fstream>
#include <iostream>
#include <string>
using namespace std;
int main() { string line;
ifstream in_file{ "PTIT.in" };
if(in_file.fail()==true){
cout<< "file khong ton tai";
return 0;//ket thuc chuong trinh luon
}
ofstream out_file{ "PTIT.out" };
while (in_file >> line){ out_file << line <<... | TOOL | 0.893747 | 3.876037 |
e0334fd8-ff95-48ca-b2db-a8ecdf6aa85a | iclean-capstone-project/iclean-mobile-app | 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.998859 | 6.785645 |
fecc9cc9-2d3e-4040-9b6d-4b3f58b958d7 | ShumwayGordon/Parallel_Algorithms_ITMO | labs_code/lab_00/A0.cpp | #include <iostream>
#define separator 0
#define word 1
unsigned int words_num(char* str)
{
unsigned num = 0;
bool cur_place = separator;
while ( *str )
{
if (*str == ' ' || *str == '\t' || *str == '\n' || *str == '\r')
cur_place = separator;
else if (cur_place == separator)... | ALGO | 0.972481 | 4.384335 |
5fad6cdd-395f-4f51-a79b-8f8aa0e4576f | habib09/problem-solution | uva/677 All Walks of length n from the first node.cpp | #include <string.h>
#include <cstdio>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <sstrea... | ALGO | 0.999829 | 3.506336 |
e0a93efb-86a4-4161-b146-a03cd50a3af0 | BlissOS/platform_frameworks_av | media/codecs/amrnb/dec/src/a_refl.cpp | /*
------------------------------------------------------------------------------
Filename: /audio/gsm-amr/c/src/a_refl.c
Functions: a_refl
Date: 02/05/2002
------------------------------------------------------------------------------
REVISION HISTORY
Description: Removing unneeded include files and the ... | ALGO | 0.999854 | 5.786362 |
1c4b41b5-537d-487a-ad34-de87f0f6e0f3 | ishandutta2007/codeforces | oyjason/normal/1336/B.cpp | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define debug(x) cerr<<#x<<" = "<<x
#define sp <<" "
#define el <<endl
#define fgx cerr<<" ---------------------------------------------- "<<endl
#define uint unsigned int
#define ULL unsigned long long
#define LDB long double
#define DB double
#define... | ALGO | 0.999956 | 4.080429 |
89786e8e-0120-48e9-a0d3-31a52ed50008 | MuKuLJain07/Data-Structure | C++ Love Babbar/LeetCode/Basic Maths/Fast_exponential.cpp | // NOTE : GCD(a,b) * LCM(a,b) = a*b
# include <iostream>
using namespace std;
int power(int a, int b){
int result = 1;
for(int i = 0; i < b; i++){
result*=a;
}
return result;
}
int fast_exponential(int a, int b){
int res = 1;
while(b>0){
// odd
if(b&1){
res... | ALGO | 0.999751 | 5.003033 |
60e6c32d-ede9-41fa-b27b-ce01293356be | devdrx/cp-submissions | Increasing Array.cpp | // You are given an array of n integers. You want to modify the array so that it is increasing, i.e., every element is at least as large as the previous element.
// On each move, you may increase the value of any element by one. What is the minimum number of moves required?
// Input
// The first input line contains an... | ALGO | 0.999898 | 4.377695 |
e6602fbe-0159-45df-9429-17e465b77a26 | jchang005/csc103lectures | 05/lucas.cpp | /* Lucas sequences. */
// the usual stuff:
#include <iostream>
using std::cin;
using std::cout;
using std::endl;
int main()
{
/* Lucas sequences (of the first kind). For numbers P,Q, set
* U_n = P*U_{n-1} - Q*U_{n-2}.
* The first two terms are defined as 0 and 1, respectively.
* NOTE: this is a generalization... | ALGO | 0.999688 | 4.938016 |
876fedca-23f6-4c25-a6e1-e2b2c6d1c5da | st1gmat/alg_and_data_struct | ads-task11-mst-st1gmat/mst.cpp | #include <iostream>
#include<fstream>
struct Edge
{
int u, v, weight;
};
class make_set
{
public:
int* parent;
int* rank;
make_set(int n)
{
parent = new int[n];
rank = new int[n];
for (int i = 0; i < n; i++)
{
parent[i] = i;
rank[i] = 0;... | ALGO | 0.999963 | 5.131292 |
caa7a942-509f-4635-9ef9-98e5a607cbfe | Patel7Manav/Leetcode-Solutions | 1286-iterator-for-combination/1286-iterator-for-combination.cpp | class CombinationIterator {
public:
int cl;
vector<string>cont;
int in=0;
void comb(string &s,string characters,int ind)
{
if(s.length()==cl)
{
cont.push_back(s);
return;
}
if(ind>=characters.length())
return;
for(int i=ind;... | ALGO | 0.999622 | 5.696532 |
2c056b9f-f55d-4a8b-8c56-24a40a277357 | emir97/ASP | ASP Algorithms/Sorting Algorithms/SelectionSort.cpp | #include <iostream>
using namespace std;
template<class T>
void SelectionSort(T numbers[], int size){
int j, minIndex;
T temp;
for (size_t i = 0; i < size - 1; i++)
{
minIndex = i;
for (size_t j = i + 1; j < size; j++)
if (numbers[j] < numbers[minIndex])
minIndex = j;
if (minIndex != i){
temp = num... | ALGO | 0.999617 | 4.424928 |
7364caf4-770f-4a43-a64f-bc166ba0f787 | nxp-appcodehub/dm-snoring-detection-based-on-rt1060 | eiq/tensorflow-lite/tensorflow/lite/micro/kernels/squared_difference.cpp | #include "tensorflow/lite/c/common.h"
#include "tensorflow/lite/kernels/internal/quantization_util.h"
#include "tensorflow/lite/kernels/internal/reference/binary_function.h"
#include "tensorflow/lite/kernels/internal/reference/integer_ops/add.h"
#include "tensorflow/lite/kernels/kernel_util.h"
#include "tensorflow/lite... | ALGO | 0.983816 | 7.616862 |
f7313076-d89d-42a7-9945-3b12438eea2b | cedrickperron/c-coding | Gravitational_Waves/power_spectrum.cpp | //power_spectrum.cpp
#include "power_spectrum.h"
rvector<double> power_spectrum(rvector<complex> fhat)
{
// Create a vector to store the power_spectrum values
rvector<double> power_spectrum_val(fhat.size());
for (int i = 0; i < fhat.size(); i++)
{
// Compute the power spectrum for every k as F_... | ALGO | 0.904429 | 5.057745 |
90668bf0-3174-49d0-a02d-edf227de8db2 | connorwang38/CodeForces-Solutions | CodeForces-B/1385B.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int t; cin >> t;
while (t--) {
int n; cin >> n;
int array[2 * n] = { 0 };
vector <int> ans;
for (int i = 0; i < 2 * n; i++) {
bool test = true;
int c; cin >> c;
... | ALGO | 0.99985 | 3.542357 |
13858f0e-8c39-4db0-92ce-581f48a0210f | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_711_15.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long int a, t,b;
cin>>a>>b;
t=(b*(pow((b-1),(a-1))));
cout<<t;
return 0;
} | ALGO | 0.99957 | 4.26998 |
96533685-bb18-494b-aa48-a4dabb2e83a9 | NandanKumarT/project | 11_extended_euclidean.cpp | #include<iostream>
using namespace std;
void xEuclidean(int a, int b,int &gcd,int &x_value, int &y_value)
{
int old_x = 1, x = 0;
int old_y = 0, y = 1;
int q, r;
while (b!=0){
q = a / b;//quotient
r = a % b;//remainder
int temp = x;
x = old_x - q * x;
old_x = tem... | ALGO | 0.999839 | 3.797055 |
eda675db-4e28-4553-8e2f-8285797b39d1 | mouton2319/AtCoder | AtCoder_Beginner_Contest_052/A-TwoRectangles/A-TwoRectangles/A.cpp | #include <iostream>
int main() {
int A, B, C, D;
std::cin >> A >> B >> C >> D;
if (A * B < C * D) {
std::cout << C * D;
}
else {
std::cout << A * B;
}
} | ALGO | 0.999494 | 4.354417 |
3422d9dc-c70c-4f23-ba62-7007fcd7b798 | Liu0813/chombo | releasedExamples/EBAMRCNS/src/EBPlanarShockSolverBC.cpp | #ifdef CH_LANG_CC
#endif
#include "BoxIterator.H"
#include "EBPlanarShockSolverBC.H"
#include "NeumannViscousTensorDomainBC.H"
#include "DirichletViscousTensorDomainBC.H"
#include "NeumannViscousTensorDomainBC.H"
#include "EBArith.H"
#include "Stencils.H"
#include "DirichletViscousTensorEBBC.H"
#include "NeumannVisc... | ALGO | 0.973052 | 5.856217 |
6f0fa6d8-980d-45ca-ae71-4e59685ad04a | Mohammad8200/Phone-Book | phone(2).cpp | #include<iostream>
#include<string>
#include<iomanip>
#include<cstdlib>
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
void Menu();
class Person
{
protected:
string Name;
string Family;
string PhoneNumber;
string Address;
string Email;
public:
Person() {};
void... | TOOL | 0.918134 | 3.604586 |
d7a07d16-b557-4dcd-90db-32a2adc28520 | rickydtran/dijkstra_fpga | src/sw/dijkstra.cpp | /**
RICKY TRAN
UNIVERSITY OF FLORIDA
DIJKSTRA IMPLEMENTATION
**/
#include "dijkstra.h"
#include <limits.h>
#include <iostream>
#include <vector>
#include "Graph.h"
#include "MinHeap.h"
#include "fiboqueue.hpp"
void print_path(unsigned prev[], unsigned dst, unsigned src) {
if (dst == src) {
std::cout << ds... | ALGO | 0.99994 | 5.042168 |
42555568-0f3a-4eef-8263-4a0ac90b37d9 | koosaga/olympiad | Library/USACO-master/Other Implementations/06 - DP/HamilPath (12.2).cpp | /**
* Description: computes number of paths from N-2 to N-1 which
* pass through each of the cities 0 to N-1 exactly once, mod 10^9+7
* Time: O(N^22^N)
* Source: own
* Verification: CSES Hamiltonian Flights
* https://cses.fi/problemset/task/1690/
*/
int N;
bool adj[20][20];
mi dp[18][1<<18];
mi solve() {
... | ALGO | 0.999897 | 4.382531 |
1b58e7cb-99ec-477c-a6ef-8bcc38168a0d | ishandutta2007/codeforces | romka/normal/73/D.cpp | #include <cstdio>
#include <vector>
#include <memory.h>
#include <cstring>
#include <ctime>
#include <cmath>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
#define forn( i,n ) for ( int i=0; i<(int)(n); i++ )
#define pb push_back
typedef long long ll;
typedef long double ld;
typedef pair<int,i... | ALGO | 0.999962 | 4.178569 |
a3dabff2-f2a0-4369-91b4-750abaabb169 | UVARocketry/SpaceportAmericaCup23-24 | kalman_rocket/eigen/unsupported/test/BVH.cpp | #include "main.h"
#include <Eigen/StdVector>
#include <Eigen/Geometry>
#include <unsupported/Eigen/BVH>
namespace Eigen {
template<typename Scalar, int Dim> AlignedBox<Scalar, Dim> bounding_box(const Matrix<Scalar, Dim, 1> &v) { return AlignedBox<Scalar, Dim>(v); }
}
template<int Dim>
struct Ball
{
EIGEN_MAKE_ALIGN... | TEST | 0.984564 | 6.629425 |
45eaf69c-96aa-4e73-b792-cd5cfaf92983 | MUMINUR-RASHID/WEEKLY-PRACTICE | WEEK-5/B_Remove_Prefix.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int t; cin>>t;
while(t--)
{
ll n;
cin>>n;
map<ll,ll>mp;
ll an=0;
for(ll i=1;i<=n;i++)
{
ll x; cin>>x;
if(mp.find(x)==mp.end()) mp[x]=i;
else
... | ALGO | 0.999816 | 4.474232 |
cbcab009-d1c0-482a-8083-8b8a030b4a2c | ROKORORI/codetree-TILs | 240130/구구단 만들기/print-multiplication-table.cpp | #include <iostream>
using namespace std;
int main() {
// 여기에 코드를 작성해주세요.
int a, b;
cin >> a >> b;
for (int i = 1; i <= 9; i++) {
for (int j = b; j >= a; j -= 2) {
cout << j << " * " << i << " = " << j * i;
if (j != a) {
cout << " / ";
}
... | ALGO | 0.999583 | 4.268446 |
09131931-373a-42d2-a7cf-099c883ea2e8 | minhsien0326/TICG | lammps_src/OPENMP/pair_lj_smooth_omp.cpp | // clang-format off
/* ----------------------------------------------------------------------
Contributing author: Axel Kohlmeyer (Temple U)
------------------------------------------------------------------------- */
#include "pair_lj_smooth_omp.h"
#include "atom.h"
#include "comm.h"
#include "force.h"
#include ... | ALGO | 0.999615 | 7.335766 |
5f3e0c55-24e3-490a-b3b6-d528f0917b6b | kamrulhasanrony/URI-Online-Judge-Solutions | 1066.cpp | /* 1066 - Even, Odd, Positive and Negative */
#include<stdio.h>
int main()
{
int array[5];
int i,sum=0,odd=0,pos=0,neg=0;
for(i=0; i<5; i++)
{
scanf("%d",&array[i]);
}
for(i=0; i<5; i++)
{
if((array[i])%2==0)
{
sum=sum+1;
}
}
for(i=0; i<5... | ALGO | 0.999432 | 4.324602 |
3826567e-a243-4fff-a2de-c8100638fe8f | TheJuliana/labs | lab_16/functions.cpp | #include "functions.hpp"
namespace fn{
int Medium(int a, int b, std::vector<int> & set) {
return ((rand()*rand())%(b-a+1))+a; //32767*32767=1 073 676 289 - необходимое максимально возможное число, так как max n = 1 000 000
};
void QuickSort(int a, int b, std::vector<int> & set) {
if (a>=b) {... | ALGO | 0.998755 | 4.375988 |
8624f61d-c433-45bc-add6-fbf7bdc6c716 | motoq/misc | cpp/par_xform/xform.cpp | #include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <execution>
#include <ishoot.h>
#include <m14.h>
#include <m14e2.h>
/**
* Demonstrates the use of parallel processing via std::transform. A
* vector of configuration settings is accessed in parallel with a
* vector of point... | TOOL | 0.996716 | 7.611096 |
04a92800-93d7-49fc-ac62-49221c067018 | themanya1112/HealthMate | 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 |
457a3efa-0b17-40af-99d7-7d5d4fe3672d | buptrh/leetcode | Round1/754. Reach a Number.cpp | class Solution {
public:
int reachNumber(int target) {
target = abs(target);
queue<int> dp;
dp.push(0);
int count = 1;
int sum = 0;
while(dp.size() > 0) {
int size = dp.size();
for(int i = 0; i < size; i++) {
int v = dp.front();... | ALGO | 0.999987 | 4.875838 |
75bbc334-d65f-4386-93af-cedc8f360ae7 | Arnol12157/ACM-ICPC-EMI-2017 | Libros/ProblemSet EMI/Problema 5 - La granja/la_granja.cpp | #include<cstdio>
#include<iostream>
#include<cstring>
#include<climits>
using namespace std;
int main()
{
freopen("granja.input", "r", stdin);
freopen("output.txt", "w", stdout);
long long a, b;
while(scanf("%llu %llu", &a, &b), (a || b))
{
long long vaca, gall;
vaca = b / 2 - a;
... | ALGO | 0.99994 | 3.934246 |
c4b846b3-9ea7-412c-99e1-a847fd3a06cd | KarlaSalamun/ML_basics | genetic_algorithm/TransferFunction/Selection/TournamentSelection.cpp | //
// Created by karla on 13. 11. 2019..
//
#include <cstdlib>
#include <algorithm>
#include <iterator>
#include <random>
#include "TournamentSelection.h"
template <typename T>
void TournamentSelection<T>::get_members(std::vector<T> &population, std::vector<T> &members )
{
std::vector<T> rand_members;
// std:... | ALGO | 0.996802 | 5.024868 |
1a7d0ba7-6be6-4b8a-982b-6c0e40908bc9 | ary-an-sahu/DSA-Questions | 1008-binary-tree-cameras/binary-tree-cameras.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999874 | 6.945483 |
85f77751-5174-451a-9070-fb7bcc04bcee | jpmg/yago-draughts | src/Business/Game.cpp | /*********************\
| |
| Game.cpp v0.1 |
| 2013-08-12 |
| |
\*********************/
#include "Game.h"
#define GET_ADDRESS(x, y) (x) * 5 + (y) / 2
using namespace std;
Game::Move::Move(short numColumn, short numRow)
: x(numColumn), y(numRow) {}
Game::G... | ALGO | 0.998985 | 4.110346 |
67c32927-7ad4-4a66-a54d-db25f6d428ec | icpcvn/icpcvn.github.io | _site/2017/regional/K/Nguyen.cpp | // Author: Pham Cao Nguyen
// Code submit trong ky thi.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 1e5 + 5;
const int magic = 200;
struct state {
int pos[maxn], moved[maxn];
int max_time, min_time;
vector<int> affected;
vector<pair<... | ALGO | 0.999627 | 4.339927 |
03f50e0f-0b2c-477e-b5a6-50e6f2693bad | dyanii/SecuritySW_ | gg.cpp | // rsa - crt
#include <gmpxx.h>
#include <iostream>
mpz_class RSA_decrypt_CRT(RSA_SK sk, mpz_class ct)
{
mpz_class m1, m2;
mpz_class M1_inv, M2_inv;
mpz_class msg;
m1 = powm(ct, sk.d, sk.p);
m2 = powm(ct, sk.d, sk.q);
M1_inv = mod_inv(sk.q, sk.p);
M2_inv = mod_inv(sk.p, sk.q);
msg = (... | ALGO | 0.999833 | 5.52504 |
2b1d4a79-34fb-4208-987d-1aa75eca142f | jeete121/Coding | Programs/Practice/Prac/GraphAlgorithms/strong_number.cpp | #include <bits/stdc++.h>
using namespace std;
int fact(int n)
{
if(n==1||n==0)
return 1;
return n*fact(n-1);
}
//function to check for
//strong number
bool isStrong(int num)
{
int temp=num;
int sum=0;
while(num>0)
{
sum+=fact(num%10);
num=num/10;
}
if(temp==su... | ALGO | 0.999924 | 4.452344 |
3de0d214-df63-4642-8024-139e1bc94f06 | shivangstreak/comp | Practise/More/Spoj/ABCDEF.cpp | #include<bits/stdc++.h> // Binary-search ...
using namespace std;
#define pb push_back
#define ll long long
int a[105];
int main(){
int n;scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
vector<int>v1,v2;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
for(int k=0;k<n;k++){
v1.pb((a[i]*a[j])+a[k... | ALGO | 0.999983 | 3.516768 |
fb00abc5-b5eb-46bf-a23a-42b919c727e2 | Rotciv004/Data-Structures-and-Algorithms | Bag/Bag.cpp | #include "Bag.h"
#include "BagIterator.h"
#include <algorithm>
#include <iostream>
Bag::Bag(int max) {
this->capacity = max; // Initial capacity
length_U = 0;
length_P = 0;
U = new TElem[this->capacity];
P = new TElem[this->capacity];
}
/*Best Case: O(1) - When the bag is created with a specific c... | ALGO | 0.981985 | 6.021436 |
4e838cf2-1d66-46ed-9fb9-1b4192616a93 | Shrutijaiswal1989/CodeForces-Mater-in-cpp | 1084D.cpp | #include<bits/stdc++.h>
#include<stdio.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define ll long long
#define scl(n) scanf("%lld",&n)
#define scll(n, m) scanf("%lld%lld",&n, &m)
#define scc(c) scanf("%c",&c)
#define fr(i,... | ALGO | 0.999694 | 3.762578 |
d4e18469-afc4-4e98-a273-cfc7cb97cbd6 | imtal1741/Test-Task | My project/Library/PackageCache/com.unity.ide.visualstudio@2.0.11/Editor/COMIntegration/COMIntegration~/COMIntegration.cpp | #include <iostream>
#include <sstream>
#include <string>
#include <filesystem>
#include <windows.h>
#include <shlwapi.h>
#include "BStrHolder.h"
#include "ComPtr.h"
#include "dte80a.tlh"
constexpr int RETRY_INTERVAL_MS = 150;
constexpr int TIMEOUT_MS = 10000;
// Often a DTE call made to Visual Studio can fail after ... | TOOL | 0.950609 | 6.947423 |
2e3d72c3-0b89-462e-a0f1-ddaa33a35ea1 | LokeshSingh07/Leetcode-POTD-2024 | November-2024/4_string_compression_iii.cpp | // 3163. String Compression III
class Solution {
public:
string compressedString(string word) {
string comp = "";
int n = word.length();
int i = 0;
while(i < n) {
int count = 0;
char ch = word[i];
while(i < n && count < 9 && word[i] == ch) {
... | ALGO | 0.999991 | 5.978011 |
14a3234c-8fb5-448a-aae0-da84ce6de21d | dhnesh12/codechef-solutions | 03-CodeChef-Medium/162--K Perfect Matchings.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 305;
int tc, n, m, k;
int vi[N];
set<int> g[N];
void Dfs(int step) {
if (k < 0) return;
if (step == n) {
--k;
return;
}
int x = 0;
for (int i = 1; i <= 2 * n; ++i)
if (!vi[i] && (!x || g[i].size() < g[x].size())) x = i;
vi[x] = 1;
... | ALGO | 0.999966 | 4.663447 |
935d7423-135a-4c42-9bca-1b1b7f52e059 | rockyhappy/codeforces | New Questions/BeautifulSequence.cpp | /**
* This is a codeforces question and the solution for the same
* the question link for the same is
*
*/
#include<iostream>
#include<map>
#include<vector>
#include<math.h>
using namespace std;
#define endl '\n'
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
int main()
{
#ifnd... | ALGO | 0.999733 | 4.146009 |
4c39cbad-bf6e-450c-a337-43e306b6b7b5 | Shashwat1524/ESP_MOCAP_Drone_Flight_Controller | managed_components/espressif__eigen/eigen/doc/snippets/JacobiSVD_basic.cpp | MatrixXf m = MatrixXf::Random(3,2);
cout << "Here is the matrix m:" << endl << m << endl;
JacobiSVD<MatrixXf> svd(m, ComputeThinU | ComputeThinV);
cout << "Its singular values are:" << endl << svd.singularValues() << endl;
cout << "Its left singular vectors are the columns of the thin U matrix:" << endl << svd.matrixU(... | ALGO | 0.999828 | 3.463409 |
abc42928-f1ce-4a30-92a2-b331eafc3ee4 | simransidhu250/Challenge75 | pattern13.cpp | #include <iostream>
using namespace std;
int main(){
int n=4;
for(int i=1; i<=n; i++){
for(int j=n-i; j>=1; j--){
cout<<" ";
}
for(int j=1; j<=i; j++){
cout<<"* ";
}
for(int j=2; j<=i; j++){
cout<<"* ";
}
cout<<endl;
... | ALGO | 0.999889 | 3.655873 |
8149a7d7-6a01-4b09-a842-b52745b18cad | yiminyangguang520/Thread | Cpp-Concurrency-in-Action/SourceCode/listing_8.12.cpp | class barrier
{
unsigned const count;
std::atomic<unsigned> spaces;
std::atomic<unsigned> generation;
public:
explicit barrier(unsigned count_):
count(count_),spaces(count),generation(0)
{}
void wait()
{
unsigned const my_generation=generation;
if(!--spaces)
{... | TOOL | 0.961679 | 4.360555 |
9e1785f5-b8d6-4a1b-8e0a-431409f27780 | hyuncheollee/csci135 | textbook/3.5.cpp | /*
Author: Hyuncheol Lee
Course: CSCI135
Professor: Genady Maryash
Assignment: 3.5
This program will read 3 integers and tell you if they either in increasing, decreasing or no order at all
*/
#include <iostream>
using namespace std;
int main() {
cout << "Enter three integers\n";
int first, second, third;
... | ALGO | 0.999816 | 4.950665 |
7da272f4-773b-44c2-95b7-7f5de6e71d1c | ntxq/PS-Baekjoon | 1000~1999/1927.cpp | #include <functional>
#include <iostream>
#include <queue>
#include <vector>
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
int cases;
std::cin >> cases;
std::priority_queue<int, std::vector<int>, std::greater<int>> pq;
for (int x; std::cin >> x;) {
if (x)
... | ALGO | 0.999922 | 4.787378 |
abf293ce-d9ac-487e-ab4d-b00fde97af6a | ishandutta2007/codeforces | johnchen902/normal/913/A.cpp | #include <cstdio>
using namespace std;
int solve(int n, int m) {
int p2n = 1;
for (int i = 0; i < n; i++) {
p2n *= 2;
if (p2n > m)
return m;
}
return m % p2n;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
printf("%d\n", solve(n, m));
} | ALGO | 0.999962 | 4.247839 |
d123ee84-b99f-4f31-96fd-0e15d230acc4 | BenGJ10/Leetcode-Tracker-CPP | Two Pointers/80_Remove_Duplicates_Sorted_ArrayII.cpp | /*
LeetCode: 80. Remove Duplicates from Sorted Array II
Link: https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/
Approach:
- The array is sorted, so duplicates appear consecutively.
- We want each element to appear **at most twice**.
- Use a two-pointer approach:
1. The `counter` pointer represe... | ALGO | 0.999969 | 7.664759 |
4b5dfb0f-8994-49d1-bc92-9c1cd53b9ad9 | misiek02/PRJ-1 | src/main.cpp | #include "Array.h"
#include "adjacencyList.h"
#include "binary_tree.h"
#include "bubblesort.h"
#include "heapSort.h"
#include "insertsort.h"
#include "list.h"
#include "min_heap.h"
#include "priority_queue.h"
#include "queueTab.h"
#include "singly_linked_list.h"
#include "stackList.h"
#include "stackTab.h"
#include "Di... | ALGO | 0.997884 | 4.256147 |
8e4f8989-63a2-4565-94c0-1c4b169b429d | divyang9575/CP | implementation/Playlist.cpp | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define PI 3.1415926535897932384626433832795
#define endl '\n'
#define int long long int
#define vi vector<int>
#define all(a) a.begin(), a.end()
#define vpi vector<pair<int, int>>
#define pb push_back
#define pi pair<int, int>
#define ff first
#define... | ALGO | 0.999966 | 4.951921 |
1116229a-9293-45ff-bb4d-693e9841474f | s-uryansh/Leetcode | map/two_sum.cpp | #include<iostream>
#include<map>
using namespace std;
void two_sum(int num[] , int target, int size){
map<int,int> numMap;
for (int i = 0; i < size; i++) {
int complement = target - num[i];
if (numMap.find(complement) != numMap.end()){
cout << "[" << numMap[complement] << "," << i << "]" ... | ALGO | 0.998404 | 5.507922 |
1f621cd2-7789-402b-a6cc-82e2c6aec5e8 | weizhenhuan/acWing | 算法笔记/算法笔记/Bellman-Ford.cpp | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1000;
int n;
struct Node {
int v, w;
};
vector<Node> Adj[maxn];
int d[maxn];
bool Bellman(int s) {
fill(d, d+maxn, INT_MAX);
for (size_t i = 0; i < n-1; i++) {
for (size_t u = 0; u < n; u++) {
for (size_t j = 0; j < Adj[u].size(); i++) {
... | ALGO | 0.997601 | 4.208307 |
82e4c726-e72a-46b6-b260-f882c6674f65 | abhigyanpatek/DSA | Prefix Sum/2270. Number of Ways to Split Array.cpp | class Solution {
public:
int waysToSplitArray(vector<int>& nums) {
long long rightSum = accumulate(nums.begin(), nums.end(), 0LL), leftSum = 0, ans = 0;
for(int i = 0; i < nums.size()-1; i++){
leftSum += nums[i];
rightSum -= nums[i];
ans += leftSum >= rightSum;
... | ALGO | 0.999873 | 5.701064 |
ac8dd473-6e6a-4846-83eb-6f68a8ea13a2 | sarwar-asik/pthn-data-structure | week-4(Stack)/assingment-3/3.Is_It_Valid.cpp | #include<bits/stdc++.h>
using namespace std;
// https://www.hackerrank.com/contests/assignment-03-a-basic-data-structure-a-batch-06/challenges/is-it-valid-1-1/problem
int main() {
// main code here
long long T ;
cin >> T;
while(T--){
string S;
cin >> S;
stack <char> testStack;
// l... | ALGO | 0.999759 | 5.509238 |
3006ed50-71e3-4ffd-a4ea-63e25766931a | anuragsingh7827/Leetcode-Problems | Find All Four Sum Numbers - GFG/find-all-four-sum-numbers.cpp | // { Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function template for C++
class Solution{
public:
// arr[] : int input array of integers
// k : the quadruple sum required
vector<vector<int> > fourSum(vector<int> &arr, int k) {
// Your code g... | ALGO | 0.999753 | 5.064003 |
466b21b1-8a5c-4b9d-9864-4a88fefacfa9 | PriyabrataMo/codechef | Average_Number.cpp |
#include <bits/stdc++.h>
using namespace std;
#include<string.h>
int main() {
int t;
cin>>t;
while(t--){
int n,k,v;
cin>>n>>k>>v;
int x = 0;
for(int i = 0;i<n;i++){
int f;
cin>>f;
x = x+f;
}
int req;
int sum = 0;
... | ALGO | 0.999949 | 3.546869 |
85174b1b-44f2-42bc-8534-e7f442cee855 | MahinAshraful/CodeWatch_Data | sample-data/p00003/s042092207.cpp | #include<iostream>
#include<vector>
using namespace std;
int main(){
int a,b,c,N;
cin >> N;
//vector<int> v;
//while (cin >> a >> b >> c){
//v.push_back(a,b,c);
// }
//int x = a + b;
//int y = b + c;
//int z = c + a;
//if (x => c || y => a || z => b){
//cout << "NO" << endl;
//} else if(x < c |... | ALGO | 0.99967 | 3.922307 |
f4ef9395-3228-4bab-a2d4-07e0181c0a50 | raincross7/code-similarity | codes/train_code/problem100/problem100_477.cpp | #include<iostream>
#include<math.h>
#include<string>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
int main(){
int i,j,k;
int bg[3][3];
int ans[3][3]={0};
rep(i,3){
rep(j,3){
cin>>bg[i][j];
}
}
int N;
cin>>N;
int b[N];
rep(i,N){
cin>>b[i]... | ALGO | 0.999987 | 3.246106 |
19670d6d-4d96-486b-abc2-73f76244df8b | wannabetolkien/CP-Codes | D_Subtract_Min_Sort.cpp | /* Nabeel Akhter - Bismillah */
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define lint long long int
#define mod 1000000007
void solve(){
lint n;
cin >> n;
vector<lint> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool isPossibl... | ALGO | 0.999454 | 4.682597 |
9c50566f-cb19-4194-a013-cd3cef27ccd7 | SamuellH12/Competitive-Programming-Algorithms | Solutions/OBI/Baralho - ps 2021 f1.cpp | #include <bits/stdc++.h>
#define optimize ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ALL(x) x.begin(), x.end()
#define endl "\n"
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define MAXN 110
#define INF 0x3f3f3f3f
#define debug cout<<"ate aqui ok\n"
using namespace std;
... | ALGO | 0.995283 | 3.608345 |
299bdbc9-680a-49ae-8144-b964dd0cbd51 | DayAlgorithm/Kwak-Dong-Geon | 7. 일/17142(baekjoon).cpp | #include <bits/stdc++.h>
#define FastIO ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)
using namespace std;
const int dy[] = {0, 0, 1, -1};
const int dx[] = {1, -1, 0, 0};
int n, m;
int board[51][51];
vector<pair<int, int>> virus;
vector<int> chose;
int emptyCnt = 0;
int visited[51][51];
queue<pair... | ALGO | 0.999681 | 4.729732 |
21ba6d1d-939b-4637-8358-0535ee724434 | jmlee1413/unrealCpp | teacher/Day03/Step02/Step01/Step01.cpp | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "Util.h"
//int main()
//{
// FILE* fp;
// FILE* fpout;
// int total = 0;
// char Buffer[1024];
//
// fp = fopen("c:/Data/data.txt", "r");
// fpout = fopen("c:/Data/output.txt", "w");
//
// fgets(Buffer, 80, fp);
// while (strlen(Buffer) > 0)
// {
// ... | ALGO | 0.988304 | 3.638318 |
87a4d827-36ba-4666-8f40-ed5ecfa8a02e | suhanikalra/practice-problems | 2032-largest-odd-number-in-string/2032-largest-odd-number-in-string.cpp | class Solution {
public:
string largestOddNumber(string num) {
int n= num.size()-1;
while(n>=0){
if((num[n]-'0')%2==0)n--;
else return num.substr(0, n + 1);
}
return "";
}
}; | ALGO | 0.999912 | 6.112278 |
2b7fb6e4-8df0-44f6-87b8-e7ca7e5cd24f | AnasImloul/Leetcode-Solutions | scripts/algorithms/C/Count Pairs Of Nodes/Count Pairs Of Nodes.cpp | class Solution {
vector<int> st;
public:
void update(int tind,int tl,int tr,int ind,int val){
if(tl>tr)
return;
if(tl==tr){
st[tind]+=val;
return;
}
int tm=tl+((tr-tl)>>1),left=tind<<1;
if(ind<=tm)
update(left,tl,tm,ind,val)... | ALGO | 0.999974 | 5.034992 |
8a26eec6-9b2c-413d-946e-8dc222f9f9bd | CroxxN/algorithms | CodeForces/1833a.cpp |
/*
User: crox-x
LANG: C++
Time: 1685538800
*/
#include <bits/stdc++.h>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string s;
cin >> s;
int ... | ALGO | 0.999774 | 4.350767 |
3b91c025-552e-451d-b206-7991e35435e0 | Pranav-Rustagi/Problem-Solving | 653-two-sum-iv-input-is-a-bst/653-two-sum-iv-input-is-a-bst.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999978 | 6.144537 |
6370eee4-6409-41e5-9f4a-22ae0ffca2dd | michalosiewicz/Loty | LOTY(AEI)/Definicje.cpp | #include<iostream>
#include<fstream>
#include<cstdlib>
#include"Deklaracje.h"
using namespace std;
void otworz_plik(fstream& plik, char** argv) {
plik.open(argv[1], ios::in);
if (plik.good())
cout << "Udalo sie otworzyc plik z danymi." << endl;
else
{
cout << "Nie udalo sie otworzyc pliku z danymi." << endl;
... | TOOL | 0.972472 | 3.495826 |
8d847857-778e-4853-99f6-fcdb7a3c3c61 | newcleanbird/Agorithm-question-bank | 华为od算法题/038 全量和已占用字符集.cpp | /*
038 全量和已占用字符集.cpp
题目描述
给定两个字符集合，一个是全量字符集，一个是已占用字符集，已占用字符集中的字符不能再使用。
要求输出剩余可用字符集。
输入描述
输入一个字符串 一定包含@，@前为全量字符集 @后的为已占用字符集
已占用字符集中的字符一定是全量字符集中的字符
字符集中的字符跟字符之间使用英文逗号隔开
每个字符都表示为字符+数字的形式用英文冒号分隔，比如a:1标识一个a字符
字符只考虑英文字母，区分大小写
数字只考虑正整型 不超过100
如果一个字符都没被占用 @标识仍存在，例如 a:3,b:5,c:2@
输出描述
输出可用字符集
不同的输出字符集之间用回车换行
注意 输出的字符顺序要跟输入的一致... | ALGO | 0.991454 | 4.190605 |
581350d7-4f7a-4797-a76a-10b9615cc00b | leekensei/PS_Programmers | Lv1/가운데글자가져오기.cpp | //
/*
ܾ s ڸ ȯϴ Լ, solution . ܾ ̰ ¦ αڸ ȯϸ ˴ϴ.
ѻ
s ̰ 1 ̻, 100 ƮԴϴ.
*/
#include <iostream>
#include <string>
using namespace std;
string solution(string s) {
string answer = "";
if (s.length() % 2 == 0) {
answer = s.substr((s.length() / 2) - 1,1)+
s.substr(s.length() / 2,1);
}
else {
answer = s[s... | ALGO | 0.999903 | 4.310964 |
ac753d78-2dc9-4601-a8a5-bc53081e3d4d | stamcenter/llvm-zeno | llvm/lib/IR/InlineAsm.cpp | #include "llvm/IR/InlineAsm.h"
#include "ConstantsContext.h"
#include "LLVMContextImpl.h"
#include "llvm/ADT/StringRef.h"
#include "llvm/IR/DerivedTypes.h"
#include "llvm/IR/LLVMContext.h"
#include "llvm/IR/Value.h"
#include "llvm/Support/Casting.h"
#include "llvm/Support/Compiler.h"
#include <algorithm>
#include <cass... | TOOL | 0.893254 | 7.588194 |
21d91b89-1d0e-4efb-93ed-1ccfefb2795c | pyrovski/scalasca | scout/src/Quantile.cpp | #include "Quantile.h"
using namespace std;
using namespace scout;
/*
*---------------------------------------------------------------------------
*
* class Quantile
*
*---------------------------------------------------------------------------
*/
//--- Constructors & destructor --------------------------------... | ALGO | 0.997207 | 3.92436 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.