uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
0835601e-ba2e-4b12-a776-3d0015049bbc | SummerS-tars/CodeServerCodeStore | CodeDocuments/codes/1_1cpp_basicgrammar/5characterstring/16example6.cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
string str , substr ;
while ( cin >> str >> substr )
{
int max = str [ 0 ] , d = 0 ;
for ( int i = 1 ; i < str.size() ; i ++ )
if ( max < str [ i ] )
max = str [ i ] , d = i ;
//此... | ALGO | 0.999518 | 3.194799 |
84399963-22e2-418c-88d1-02b40d675db0 | Hifza-Khalid/OOP_Odyssey | SmartVehicleManagementSystem.cpp | #include <iostream>
#include <vector>
using namespace std;
// Abstract class - Vehicle (Abstraction)
class Vehicle {
protected:
string brand;
int year;
public:
// Constructor to initialize brand and year
Vehicle(string b, int y) : brand(b), year(y) {}
// Pure virtual function (abstract method) fo... | TOOL | 0.888286 | 7.451883 |
ac9c0c13-14db-4740-9fbe-99dee47c02a1 | peternjuguna03/task | Fibonacci.cpp |
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> holdNums;
int first = 0;
int second = 1;
int Fibonacci;
cout << first << endl; // printing the first number
while (second <= 100) {
Fibonacci = first + second; // sequence to add the numbers as we l... | ALGO | 0.999898 | 4.545564 |
bf7e31e0-caca-4a11-8647-bc94878ff890 | tjsdn3065/data_structure_and_algorithm | 수정된 에이스타/Priority_Queue.cpp | #include "Priority_Queue.h"
void Exchange(VERTEX& ref1, VERTEX& ref2)
{
VERTEX temp = ref1;
ref1 = ref2;
ref2 = temp;
}
Priority_Queue::Priority_Queue(VERTEX* ptr) :Q(ptr), Q_heapsize(0) {}
VERTEX* Priority_Queue::Get_Q()
{
return Q;
}
int Priority_Queue::Get_Q_heapsize()
{
return Q_heapsize;
}
bool Priority_Q... | ALGO | 0.999677 | 4.399112 |
eb9927a3-8b71-490d-8fdd-7d0094892bbb | LukeLee233/Garbarge-Distribution | Simulink/Simulink/Worker.cpp | #include "Simulink.h"
Worker::Worker(Rubbish r):now_rubbish(r)
{
worker_id = 0;
start_moving_time = 0;
busy = false;
position.x = 0;
position.y = 0;
treated_num = 0;
each_work_time = 0;
total_work_time = 0;
}
void Worker::ShowTreatedID()
{
if (treated_rubbish_id.size() == 0)
std::cout << "worker " << worke... | TOOL | 0.909884 | 3.564034 |
cbe350c0-b051-4480-b718-12998e7add95 | manikanta2901/ubuntu | .history/SRM/elab/DAA/SearchingTechniques/HighestMark_20210129154426.cpp | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
class Details{
public:
string name,mark;
};
bool comparator(const Details& lhs, const Details& rhs) {
return lhs.key < rhs.key;
}
int main(){
int t;
cin >> t;
vector<Details> number;
while(t--){
Details obj;
... | ALGO | 0.999145 | 4.147567 |
324e5912-3b41-42fd-800b-119a23413ec8 | luckylukezzz/Sorting-Algorithms | Time Calc/quicksort.cpp |
#include <ctime>
#include <iostream>
using namespace std;
int partition(int arr[], int start, int end)
{
int pivot = arr[start];
int count = 0;
for (int i = start + 1; i <= end; i++) {
if (arr[i] <= pivot)
count++;
}
int pivotIndex = start + count;
swap(arr[pivotIndex... | ALGO | 0.999529 | 5.495845 |
4ed5f664-e0d9-48e6-9f49-9e2d695037db | PedroHMNobrega/Programming-Problems | URI/Strings/1255.cpp | //Frequência de Letras
//Assunto: Map/ String;
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define loop(i, a, b) for(int i = a; i < b; i++)
#define loopBack(i, a, b) for(int i = a; i >= b; i--)
#define INF INT_MA... | ALGO | 0.999981 | 4.778355 |
f366a0d5-2f86-4474-b530-f1493c160628 | ArshanKhanifar/mlx-swift-flat | Source/Cmlx/mlx/examples/cpp/logistic_regression.cpp | #include <chrono>
#include <cmath>
#include <iostream>
#include "mlx/mlx.h"
#include "timer.h"
/**
* An example of logistic regression with MLX.
*/
using namespace mlx::core;
int main() {
int num_features = 100;
int num_examples = 1'000;
int num_iters = 10'000;
float learning_rate = 0.1;
// True paramet... | DATA | 0.946961 | 5.200509 |
ba284e86-f29e-4dc4-a601-ca2f32f26921 | yellowweak/atcoder | ABC/ABC239/B.cpp | #include <bits/stdc++.h>
using namespace std;
// BEGIN LIB
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
#define print_grid(x) for(auto &r:x){for(auto &c:r)cout<<c<<" ";cout<<endl;}cout<<endl;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define ... | ALGO | 0.999559 | 3.789666 |
bed9c4e7-c3bb-4df5-8893-85801a511c8a | moupiya0125/DSA | Patterns/pattern2.cpp | #include <bits/stdc++.h>
using namespace std;
void pattern2(int n)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j <=i; j++)
{
cout << "* ";
}
cout << endl;
}
}
int main()
{
int n;
cin>> n;
pattern2(n);
} | ALGO | 0.999966 | 4.042171 |
fd37b747-37b3-423b-853f-a74eec5f60a5 | Leavaway/csnotes | os/Banker's_algorithm.cpp | #include <iostream>
#include <vector>
int rows = 5;
int cols = 3;
std::vector<std::vector<int>> max_matrix(rows, std::vector<int>(cols, 0));
std::vector<std::vector<int>> allo_matrix(rows, std::vector<int>(cols, 0));
std::vector<std::vector<int>> need_matrix(rows, std::vector<int>(cols, 0));
std::vector<int> Available... | ALGO | 0.999903 | 4.810182 |
f0cc83d8-a840-4226-ae98-60a85c1e9a49 | tedoreve/PLUTO | PLUTO/Lib/Chombo-3.2/lib/src/AMRTools/NodeDotProduct.cpp | #ifdef CH_LANG_CC
#endif
// NodeDotProduct.cpp
// petermc, 11 June 2003
#include "NodeDotProduct.H"
#include "NodeSetOperations.H"
#include "NodeDotProdF_F.H"
#include "NamespaceHeader.H"
// ---------------------------------------------------------
Real
DotProductNodes(const BoxLayoutData<NodeFArrayBox>& a_dataOne,... | ALGO | 0.997338 | 6.675165 |
fc3ac59d-9d6c-4f58-b2fd-d63a514bdf7f | rifatbroh/Daily_Update | week 11/Day_2/B_378_QAQ_and_Mocha_s_Array.cpp | /*
MD Rifat Hossain
Institute:- BAIUST
Country:- BANGLADESH
*/
#include<bits/stdc++.h>
using namespace std;
#define OLD_MAXTAN \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define ld long double
#define yes "YES"
#define n... | ALGO | 0.999617 | 4.109475 |
0ed05798-cfb3-4c10-b7b4-b0cd9e0242b2 | ishandutta2007/codeforces | monogon/normal/675/C.cpp |
#include <bits/stdc++.h>
#define ll long long
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int, int>
#define rep(i, a, b) for(int i = (a); i < (b); i++)
using namespace std;
template<typename T>
using minpq = priority... | ALGO | 0.999826 | 3.790925 |
04b188ad-a8ef-4873-b1fa-16baab0a1f03 | AnkurKumarKasana/leetcode | 0001-two-sum/0001-two-sum.cpp | class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int n=nums.size();
unordered_map<int,int> m;
for(int i=0;i<n;i++){
int compliment= target-nums[i];
if(m.count(compliment)){
return {m[compliment],i};
}
... | ALGO | 0.999849 | 6.251216 |
bdade6b7-a8c2-4b04-814f-9b03f953b62f | LowPolyCount/LowPolyCount-Raytracer | lib/boost_1_57_0/libs/math/example/binomial_quiz_example.cpp | // binomial_examples_quiz.cpp
// Simple example of computing probabilities and quantiles for a binomial random variable
// representing the correct guesses on a multiple-choice test.
// source http://www.stat.wvu.edu/SRS/Modules/Binomial/test.html
//[binomial_quiz_example1
/*`
A multiple choice test has four possibl... | ALGO | 0.992935 | 5.941476 |
8430351d-050c-4998-8bcc-e0c155b6e35c | latture/pallas-solver | ext/eigen/doc/examples/DenseBase_middleRows_int.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
int main(void)
{
int const N = 5;
MatrixXi A(N,N);
A.setRandom();
cout << "A =\n" << A << '\n' << endl;
cout << "A(2..3,:) =\n" << A.middleRows(2,2) << endl;
return 0;
}
| ALGO | 0.963384 | 3.307581 |
6d04f336-49b8-4d17-bdff-8ac4c75b094f | rajvipani/Image-Segmentation-Using-Max-Flow | src/PushRelabel.cpp | #include "PushRelabel.hpp"
PushRelabel::PushRelabel(vector<map<int, array<int,2>>> flow_graph) {
image_flow_graph = flow_graph;
graph_source = flow_graph.size() - 2;
graph_sink = flow_graph.size() - 1;
segmentedImage.resize(flow_graph.size());
excess.resize(flow_graph.size());
height.resize(fl... | ALGO | 0.999844 | 4.399562 |
300d06ef-f3f7-482d-b862-0f6ed7d48cf2 | Heliannl/pat_code | U3_1C.cpp | #include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
using namespace std;
int main(){
long long a, b;
while(scanf("%ld%ld", &a, &b)!=EOF){
int sum1=0, sum2=0;
for (int n = 1e8; n>0; n/=10){
sum1+=a/n;
sum2+=b/n;
a%=n;
b%=n;
}
printf("%d\n", sum1*sum2);
}
return 0;
}
| ALGO | 0.999876 | 3.971478 |
b52a17de-2a66-408f-aece-722c8156dd67 | sanjaikrp/DSA | Rabin Miller Primality Test/rabin_miller.cpp | #include <bits/stdc++.h>
#include <iostream>
#include <list>
#include <limits.h>
#include <cstdio>
#include <map>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <string.h>
using namespace std;
#define s(n) scanf("%lld",&n)
#define sc(n) scanf("%c",&n)
#d... | ALGO | 0.999258 | 3.522447 |
913401bb-f00f-4fb2-9101-340ac8350ab7 | manikanta2901/ubuntu | .history/SRM/placementPractice/HackerRank/DataStructure/InsertingNodeInDoublyLL_20210310223359.cpp | #include<bits/stdc++.h>
using namespace std;
struct Node{
int data;
struct Node* next = NULL;
struct Node* prev = NULL;
};
void printList(struct Node *a){
Node *last;
cout << "Iterate from front : ";
while(a != NULL){
cout << a->data << " ";
last = a;
a = a->next;
}... | ALGO | 0.999737 | 4.663936 |
0fc7b4d5-da3f-44b8-817b-807aa93a5e89 | anshika3112/leet_code | Q 2264 largest 3 digit number.cpp | class Solution {
public:
string largestGoodInteger(string num) {
int ans = -1; // to store what chars merge into
string strAns = ""; // to store the value to return
for (int i = 2; i < num.size(); ++i) { // go through from the third
if (num[i] == num[i - 1] && num[i] == num[i - 2... | ALGO | 0.999907 | 6.071311 |
756ac239-a410-4c17-9c24-26702b140505 | ishandutta2007/codeforces | jiangly/normal/1365/A.cpp | #include <iostream>
#include <numeric>
#include <algorithm>
#include <functional>
#include <vector>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int t;
std::cin >> t;
while (t--) {
int n, m;
std::cin >> n >> m;
std::vector<std::vector<int>> a(n, std::... | ALGO | 0.999973 | 5.249507 |
543e0090-cb92-47c6-a0c8-bd23ed9569ec | benMcChesney/KinectHacks | ofxKinectBox2D/src/src/lib/Box2D/Source/Collision/Shapes/b2EdgeShape.cpp | #include "b2EdgeShape.h"
b2EdgeShape::b2EdgeShape(const b2Vec2& v1, const b2Vec2& v2, const b2ShapeDef* def)
: b2Shape(def)
{
b2Assert(def->type == e_edgeShape);
m_type = e_edgeShape;
m_prevEdge = NULL;
m_nextEdge = NULL;
m_v1 = v1;
m_v2 = v2;
m_direction = m_v2 - m_v1;
m_length = m_direction.Normalize(... | ALGO | 0.998481 | 7.691722 |
8739819b-fef6-465f-9e32-5b1d3aa60dbd | sj1705/DSA | leetcode questions/0118-pascals-triangle/0118-pascals-triangle.cpp | class Solution {
public:
vector<int> genrow(int n)
{
vector<int>ansRow;
long long ans=1;
ansRow.push_back(ans);
for(int i=1;i<n;i++)
{
ans=ans*(n-i);
ans=ans/i;
ansRow.push_back(ans);
}
return ansRow;
}
vector<ve... | ALGO | 0.999983 | 5.396402 |
8d372645-c95c-45f3-9871-4e694b8322e9 | gergelyszigeti/CPP_tinies | primes.cpp | #include <limits>
#include <string>
#include <stdio.h>
bool isPrime(unsigned int value)
{
// see wikipedia, primality test
//if (value == 2 || value == 3) return true;
if ((value % 2) == 0 || (value % 3) == 0) { return false; }
// up to 25 these two ifs (here one if) above work well
// from 25, we need a fo... | ALGO | 0.999476 | 4.72454 |
25d8943b-0385-4996-b65a-6e91d4a5c807 | BlenderVR/blender | intern/cycles/util/util_md5.cpp | /* Minor modifications done to remove some code and change style. */
#include "util_md5.h"
#include "util_path.h"
#include <string.h>
#include <stdio.h>
CCL_NAMESPACE_BEGIN
#define T_MASK ((uint32_t)~0)
#define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
#define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
#define T3 0x... | ALGO | 0.94159 | 6.693513 |
0adfc56a-3f0b-46c8-bf2b-323b9c6f9e06 | aayambhatt/DSA | 05-LinkedList/LL-Questions/Reverse-Nodes-K-Groups.cpp | #include<iostream>
using namespace std;
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* reverseKGroup(ListNode... | ALGO | 0.999976 | 5.074199 |
6a64ba48-2241-414f-92ae-fc0f92286cd5 | DarshanPatel38/582Assignment2 | extern/bullet2/src/BulletCollision/BroadphaseCollision/btSimpleBroadphase.cpp | #include "btSimpleBroadphase.h"
#include "BulletCollision/BroadphaseCollision/btDispatcher.h"
#include "BulletCollision/BroadphaseCollision/btCollisionAlgorithm.h"
#include "LinearMath/btVector3.h"
#include "LinearMath/btTransform.h"
#include "LinearMath/btMatrix3x3.h"
#include "LinearMath/btAabbUtil2.h"
#include <ne... | TOOL | 0.857144 | 6.866664 |
3e8c8780-d45a-48f4-b680-278386ab8114 | calubtus/gem5_cache_partitioning | src/systemc/tests/systemc/misc/sim_tests/srlatch/nor.cpp | /*****************************************************************************
nor.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/*****************************************************************************
... | ALGO | 0.990628 | 6.382857 |
4f598d9e-7829-4766-832f-72b8264e9731 | kazunetakahashi/atcoder | 2018/0804_mujin-pc-2018/A.cpp | /**
* File : A.cpp
* Author : Kazune Takahashi
* Created : 2018-8-4 21:01:55
* Powered by Visual Studio Code
*/
#include <iostream>
#include <iomanip> // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) ... | ALGO | 0.999386 | 3.154736 |
988d72e9-aca2-407b-9bdd-763a245b2cc3 | yinzixuan126/my_udacity | CarND-MPC-Project/src/Eigen-3.3/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.999455 | 4.186114 |
c934daec-ed49-4a0d-a6ac-4e594072f7e8 | e253/openclc | third_party/llvm/tools/llvm-opt-report/OptReport.cpp | #include "llvm-c/Remarks.h"
#include "llvm/ADT/StringExtras.h"
#include "llvm/Demangle/Demangle.h"
#include "llvm/Remarks/Remark.h"
#include "llvm/Remarks/RemarkFormat.h"
#include "llvm/Remarks/RemarkParser.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Error.h"
#include "llvm/Support/ErrorOr.h"
#inclu... | TOOL | 0.983954 | 7.795946 |
24fdcbdd-e572-40b3-b280-7e15a530e22a | aayushipriya03/dsa | Arrays/rotateimage.cpp | void rotate(vector<vector<int>>& matrix) {
int n=matrix.size();
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
swap(matrix[i][j],matrix[j][i]);
}
}
for(int i=0;i<n;i++){
int low=0,high=n-1;
while(low<=high){
... | ALGO | 0.999948 | 5.561699 |
be7695b0-002b-4fb7-bdcb-9875a101e83b | hsuzyu/2020CCE | week12/3.三數最小.cpp | #include <stdio.h>
int f(int a, int b, int c)
{
int n;
n=a;
if(n>b) n=b;
if(n>c) n=c;
return n;
}
int main()
{
int a, b, c;
scanf("%d%d%d",&a ,&b ,&c);
printf("%d\n",f(a, b, c));
}
| ALGO | 0.999847 | 4.025657 |
f427c591-4f99-4b07-ba2e-49a2cda6286d | Gon20000/my-cpp-journey | cp/iiot/round 1/intervals.cpp | // NOTE: it is recommended to use this even if you don't understand the following code.
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
// uncomment the two following lines if you want to read/write from files
// ifstream ci... | ALGO | 0.999412 | 4.681384 |
9555bf82-e3f2-4683-a2f1-769392435d6f | danielwiratman/learn-cpp | leetcode/287-find-the-duplicate-number/main.cpp | #include <algorithm>
#include <vector>
#include <string>
#include <logger.h>
using namespace std;
auto &l = Logger::get();
// INVALID SOLUTION
// Just read that one of the requirements is to not modify the nums array.
// Basically means SORTING IS ILLEGAL
class SolutionWrong
{
public:
int
findDuplicate(vector<in... | ALGO | 0.999922 | 5.651944 |
01dcbf2f-dd34-4dcc-a255-6ad83cdeba7a | Nakib-Arman/CSE318---ArtificialIntelligence | 4.DecisionTree/.history/decision_tree_20250705151135.cpp | #include<bits/stdc++.h>
using namespace std;
class node {
string label;
vector<node*> children;
node* parent;
node(string label){
this->label = label;
this->parent = NULL;
}
};
float getEntropy(vector<vector<string>>& dataset,unordered_set<string>& decisions)
{
float entropy=0... | ALGO | 0.994287 | 5.426916 |
f1f591ae-ef42-45bc-912d-8d786ac4b1ba | Anqi-debug/NYUBridge_HW | week17/ac9670_hw17.cpp | /*
INSTRUCTIONS
In this assignment, it is required that you fill out areas under comments labeled as "TODO" appropriately based on the accompanying directions.
You are also required to follow any directions accompanying comments such as "NOTE".
You can add/modify code anywhere, with the exception of the provided "main... | ALGO | 0.994559 | 6.055405 |
3d52828c-ba13-4b3f-afa7-c739ab925fa5 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_2459_4.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 200010;
struct data {
int x;
long long w;
data() {}
data(int x, long long w) : x(x), w(w) {}
};
data q[N];
int h, t;
long long a[N], b[N];
long long sa[N], sb[N], sd[N];
long long c[N];
int main() {
int i, l, r;
int n;
long long C;
long long w,... | ALGO | 0.999955 | 3.258392 |
79d767eb-042b-4bd1-9625-74c1caca45e7 | srishabh5/coding_cpp | 4_recursion_2/subsequences/subsequences.cpp | #include<iostream>
//using namespace std;
//we are returning the number of strings in the ouput array
int subsequence(std::string input, std::string output[]){
//base case
if(input.empty()){
output[0] = "";
return 1;
}
//recursive call
std::string substring = input.substr(1);//we wan... | ALGO | 0.99998 | 5.328313 |
c712ea91-6598-4fac-b81e-e81d623e9480 | mertturkmenoglu/cpp | src/stl/algorithm/Modifying/E019_Remove/main.cpp | /**
* remove() example
* g++ main.cpp -std=c++17 -Wall -Wextra -Wnon-virtual-dtor -pedantic -g -o main
* valgrind --leak-check=yes -v ./main
*/
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
int main() {
std::vector<int> vector = { 1, 1, 2, 3, 5, 8 };
std::vector<int>::iter... | TEST | 0.880397 | 4.394211 |
a697bede-337d-4283-bd0f-d226671e6fb8 | chrisstump64/StumpChris_CSC5_41202 | Homework/Assignment1/Gaddis_8thed_Chap2_Prob18/main.cpp | /*
Author: Christopher Dean Stump
Created on January 6, 2016, 11:00 AM
Purpose: Calculate energy drinkers
*/
// System Libraries
#include <iostream>
using namespace std;
// User Libraries
// Global Constants
const char CNVPERC=100;
// Function Prototypes
// Execution Begins Here
int main(int argc, cha... | ALGO | 0.852777 | 4.681159 |
49d3b4c5-2916-4266-9b4f-859aa17fe0ca | andersonsc00/LPRO-Lista-For | q13.cpp | #include <stdio.h>
#include <stdlib.h>
int main () {
int cont, ent = 0, par, soma = 0;
scanf("%d", &cont);
for (int i=0; i<cont; i++) {
scanf("%d", &ent);
for (int i=0; i<10; i++) {
par = ent + i;
if(par % 2 == 0) {
soma += par;
}
... | ALGO | 0.999775 | 4.362908 |
d8a4bf42-47e7-410f-9dde-c9731e17d315 | marcjal/PGCCHIB_CliqueTriangulos_MarceloOrellana | src/GameColorMatch.cpp | // GameColorMatch.cpp
// Jogo de “Color Match”: o usuário clica em um retângulo para escolher sua cor,
// e todos os retângulos cuja cor seja similar (distância Euclidiana em RGB ≤ limiar)
// são removidos. Cada clique conta como uma tentativa; pontos = número de retângulos removidos.
#include <glad/glad.h>
#include <... | ALGO | 0.888596 | 6.588809 |
5b18a892-70ff-4e9f-9552-4ae25819a9f7 | hari5347/CP | Leetcode/3sum-closest.cpp | // https://leetcode.com/problems/3sum-closest
#include<bits/stdc++.h>
using namespace std;
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int l;
int r;
int sum;
int tsum = 1000000000;
vector <vector<int>> res;
sort(nums.begin(), nums.end()); // [0 1 1 1]
... | ALGO | 0.999979 | 5.962897 |
86154930-e015-4baf-be53-0f3c2204a651 | htner/hieroglyph | src/backend/gporca/libgpopt/src/operators/CPhysicalInnerNLJoin.cpp | #include "gpopt/operators/CPhysicalInnerNLJoin.h"
#include "gpos/base.h"
#include "gpopt/base/CCastUtils.h"
#include "gpopt/base/CDistributionSpecHashed.h"
#include "gpopt/base/CDistributionSpecNonSingleton.h"
#include "gpopt/base/CDistributionSpecReplicated.h"
#include "gpopt/base/CUtils.h"
#include "gpopt/operators... | ALGO | 0.996939 | 6.604235 |
cc86d721-c375-4db8-a623-b6bea7a7dd90 | aanandrautt/OpenSees-for-fire | SRC/convergenceTest/CTestFixedNumIter.cpp | // $Revision: 1.1 $
// $Date: 2005-12-15 00:13:51 $
// $Source: /usr/local/cvs/OpenSees/SRC/convergenceTest/CTestFixedNumIter.cpp,v $
// Written: Andreas Schellenberg (<EMAIL>)
// Created: 09/05
// Revision: A
//
// Purpose: This file contains the class implementation of CTestFixedNumIter.
//
// What: "@(#) CTestFixed... | TEST | 0.921228 | 6.133644 |
814b6f7b-b1f0-4291-bd13-854a5f6b8f4e | trinhminhtriet/leetcode | solutions/2600-2699/2681.power-of-heroes/Solution.cpp | class Solution {
public:
int sumOfPower(vector<int>& nums) {
const int mod = 1e9 + 7;
sort(nums.rbegin(), nums.rend());
long long ans = 0, p = 0;
for (long long x : nums) {
ans = (ans + (x * x % mod) * x) % mod;
ans = (ans + x * p % mod) % mod;
p =... | ALGO | 0.999983 | 6.108001 |
1c97f3ca-aa2d-4d19-8016-ef7bd8ba17ff | arm/arm-toolchain | libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection.pass.cpp | // <algorithm>
// template<InputIterator InIter1, InputIterator InIter2, typename OutIter>
// requires OutputIterator<OutIter, InIter1::reference>
// && OutputIterator<OutIter, InIter2::reference>
// && HasLess<InIter2::value_type, InIter1::value_type>
// && HasLess<InIter1::value_type, InIte... | TEST | 0.982911 | 6.582528 |
5acf0dc4-a278-4498-a28a-e2348f5b2b1c | quyifei23/gem5-CXL | gem5/src/systemc/tests/systemc/misc/gnats/pr-233/pr-233.cpp | /*****************************************************************************
pr-233.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/*****************************************************************************... | ALGO | 0.982374 | 4.505069 |
896b5003-2c87-48ac-b340-3243c1d0802a | SiddharthMaverick/CodeForces_Solutions | q313b.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
string st;
cin>>st;
int len=st.length();
vector<int>v(len+1);
int c=0;
for(int i=0;i<len-1;i++)
{
if(st[i]==st[i+1])
{
c++;
}
v[i+2]=c;
}
int q;
cin>>q;
for(int i=0;i<q;i+... | ALGO | 0.99996 | 4.378025 |
1bb2e22c-7ca3-4508-93ed-642c8246f533 | zhmjsnl/CLR | tour.cpp | #include <fstream>
#include "tour.h"
#include "tsp.h"
using namespace std;
void tour::dfs(int x, int num, vector<vector<int> > &GG) {
int i;
sEuler.node[++sEuler.top] = x;
for (i = 0; i < num; i++) {
if (GG[i][x] > 0) {
GG[i][x]--;
GG[x][i]--; //deleting this edge
... | ALGO | 0.999928 | 3.346377 |
6935f2c5-e561-496c-941f-c61f4aa8c8fe | leggedrobotics/rsl_panoptic_mapping | dynamic_mapping/thirdparty/eigen/doc/examples/class_FixedVectorBlock.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
template<typename Derived>
Eigen::VectorBlock<Derived, 2>
firstTwo(MatrixBase<Derived>& v)
{
return Eigen::VectorBlock<Derived, 2>(v.derived(), 0);
}
template<typename Derived>
const Eigen::VectorBlock<const Derived, 2>
firstTwo(c... | TOOL | 0.972245 | 5.200637 |
089035de-8199-4a31-a419-64ce36b83a6d | me-vikskr/CSES_Solutions | DP/7_book_shop.cpp | #include<bits/stdc++.h>
using namespace std;
// int f(int ind, int money, vector<int>& prices, vector<int>& pages, vector<vector<int>>& dp){
// //base case
// if(ind==0){
// if(prices[0]<=money) return pages[0];
// return -1e8;
// }
// if(dp[ind][money]!=-1) return dp[ind][money];
// ... | ALGO | 0.999986 | 4.6913 |
f83b9f2c-62ed-40ed-b565-37d01ed14600 | hasnat0006/CP_SOLUTION | YouKnowWhoAcademy/Phase 02/2. Basic Math and Again Number Theory/24. Joty_and_Chocolate.cpp | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vf(v) (v).begin(), (v).end()
#define vr(v) (v).rbegin(), (v).rend()
const ll mod = 1e9 + 7;
const ll inf = 1e18;
void solve() {
ll n, a, b, p, q;
cin >> n >> a >> b >> p >> q;
ll divByBoth = n / lcm(a, b... | ALGO | 0.999914 | 4.747758 |
06750861-a87f-46c6-8829-7d172dd32057 | shishirRsiam/LeetCode-Solve | 2411. Smallest Subarrays With Maximum Bitwise OR.cpp | class Solution {
public:
vector<int> countBit;
long getOr()
{
string bit;
for(int i = 32; i >= 0; i--)
bit += countBit[i] ? '1' : '0';
return stoll(bit, NULL, 2);
}
void addedToCountBit(int num)
{
bitset<33>bit(num);
for(int i = 0; i < 33; i++)... | ALGO | 0.999916 | 5.637665 |
1af8b9e0-69f1-4823-9a2b-66713a0edd28 | fatin99/Leetcode | Medium/Backtracking/Subsets/Solution.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
vector<vector<int>> output;
vector<vector<int>> subsets(vector<int>& nums) {
sort(nums.begin(), nums.end());
//backtrack({}, nums);
backtrack2({}, nums, 0);
return output;
}
void backtrack(vecto... | ALGO | 0.999987 | 5.733007 |
4e783f2e-9083-492f-85a1-ddf1fe3c6d54 | Lydxn/Competitive-Programming | DMOJ/Woburn/wc15fs2.cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> plli;
typedef pair<int, ll> pill;
typedef pair<pa... | ALGO | 0.999993 | 4.907623 |
4c9a884d-6b47-4328-843d-5376949145c6 | OneginForte/Marlin-2.0.x-SKR-E3-DIP | 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.870796 | 4.373273 |
1c2b7af4-4e40-4a98-b1e0-25023f557c44 | Tphuong612/DSA | DSA anh loc/9. sap xep tim kiem/bai 17 cap so co tong bang k dung binary_search.cpp | #include <bits/stdc++.h>
using namespace std;
int first(int a[], int l, int r, int x){
int res=-1;
while(l<=r){
int m=(l+r)/2;
if(a[m]==x){
res=m;
r=m-1;
}
else if(a[m]<x){
l=m+1;
}
else r=m-1;
}
return res;
... | ALGO | 0.999955 | 4.433188 |
f5878e62-94a2-4785-9960-f715116ac0f8 | Harsh-Prasad09/DSA | 1910. Remove All Occurrences of a Substring.cpp | class Solution {
public:
string removeOccurrences(string s, string part) {
while(s.length() >= part.size() && s.find(part) < s.length()){
s.erase(s.find(part), part.length());
}
return s;
}
};
| ALGO | 0.997025 | 6.125669 |
07e5c331-37d2-440d-a29e-7977e09c2329 | RadhikaMulay20/LeetCode | 241-different-ways-to-add-parentheses/different-ways-to-add-parentheses.cpp | class Solution {
public:
// Function to check whether the character is a number or not
bool isNum(char c) {
return c <= '9' && c >= '0';
}
// DP Table
vector<int> dp[21][21];
vector<int> solve(int i, int j, string &exp) {
// if number is of single digit
if (j == i) r... | ALGO | 0.999984 | 5.77631 |
8f19040f-41e6-4229-9cb4-fc9831d9414d | Sachit0786/LeetCode | 136-single-number/single-number.cpp | class Solution {
public:
int singleNumber(vector<int>& nums) {
int ans = nums[0];
for(int i=1; i<nums.size(); i++)
{
ans = ans ^ nums[i];
}
return ans;
}
}; | ALGO | 0.999958 | 5.577601 |
d76cf110-fffa-48fd-9053-e2b4147e37d7 | TCGBench/TCGBench | data/human_performance_code/human_performance_code_noip/P1525/ac_2.cpp |
#include <iostream>
#include <cstring>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
#define MAXN 20010
// c怨气值——》c事件
// 看最大的事件值
// 大脑在分崩离析
// 一个并查集的事件值为最大的仇恨值
// 找到最优分法//只有两座监狱
// 每次把仇恨值最大的两人分到两个监狱
// 检查放入两种可能的结果，选择最优结果，两个可能的对应关系数据都勾掉，
int p[MAXN], idx, ey[MAXN];
struct Num
{ // 两人的仇恨值... | ALGO | 0.999977 | 3.967959 |
9eb58926-68ae-4d58-8446-3cf7573fb629 | alexoliveiramartins/competitive-programming | usaco/mixingMilk.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int b1, b2, c, n, t;
vector<int> capacity(3);
vector<int> milk(3);
cin >> n;
for(int c = 0; c < n; c++){
cin >> capacity[c] >> milk[c];
}
for(int c... | ALGO | 0.999977 | 3.252261 |
790d7513-b877-441a-bc08-da7385104cc2 | ishandutta2007/codeforces | gyh20/normal/632/E.cpp | #include<bits/stdc++.h>
#define re register
using namespace std;
inline int read(){
re int t=0;re char v=getchar();
while(v<'0')v=getchar();
while(v>='0')t=(t<<3)+(t<<1)+v-48,v=getchar();
return t;
}
namespace R{
int p,w,nn;
struct cpp{
int a,b;
cpp(int a=0,int b=0):a(a),b(b){}
cpp operator * (const cpp &x)... | ALGO | 0.999974 | 3.332448 |
6c316ad4-d45f-4221-beab-a27d78b6d12c | bigrabbit1998/Analysis | JetSeparation.cpp | #include "fjClustering.h"
#include "JetSeparation.h"
using namespace std;
typedef vector<fastjet::PseudoJet> Pseudovector;
typedef vector<Pythia8::Particle> Particlevector;
bool debug(false);
//default constructor
JetMatching::JetMatching()
{
cout<<"constructor called for JetMatching"<<endl;
}
//clear information ... | ALGO | 0.929752 | 4.900102 |
92b7d4b1-efa8-4e6b-ae1f-2721dc9721bb | allwinner-ics/platform_frameworks_base | media/libstagefright/codecs/m4v_h263/dec/src/get_pred_outside.cpp | /*
------------------------------------------------------------------------------
INPUT AND OUTPUT DEFINITIONS
Inputs:
xpos = x half-pixel of (x,y) coordinates within a VOP; motion
compensated coordinates; native data type
ypos = y half-pixel of (x,y) coordinates within a VOP; motion
co... | ALGO | 0.999719 | 6.728376 |
08da3ccc-c17e-4e1a-a569-913efce59d91 | labgeek/competitive_programming | hackerrank/printReverse.cpp | #include <cstdlib>
#include <algorithm>
#include <iostream>
using namespace std;
void printReverse(int array[], int size)
{
int output[size];
for(int j = 0; j <size; j++)
{
output[j] = array[size-j-1];
}
for(int i = 0; i< size; i++)
{
cout << output[i] << " ";
}
}
int main()
{
int n;
cin >> n;
int num[... | ALGO | 0.999697 | 4.641624 |
757cd77c-274c-48ce-8208-5309a12b784c | ranahamid/CSELAB | CSE_LAB-3rd year/302/old/link state routing-wrong/link state routing.cpp | #include<iostream>
#include<cstdlib>
#include<iomanip>
// #define n 4 //number of node
using namespace std;
int min(int a,int b)
{
return(a<b?a:b);
}
int main()
{
int n; int name[100][100];
cout<<"How many nodes?"<<endl;
cin>>n;
cout<<endl;
int Q[n][n];
int i,j,k,temp=0;
int w[n][n];
cout<<"Input the m... | ALGO | 0.999951 | 3.068633 |
06b83977-be1c-4832-8087-37da61601047 | yash-vrdhan/cses-problems | Introductory Problem/coinPile.cpp | #include <iostream>
#include <string>
using namespace std;
int main(){
long long int t,x,y;
cin >> t;
for (long long int i=0; i<t; i++){
long long int x,y;
cin>>y>>x;
while(x!=0 || y!=0){
if (y>x){
y=y-2;
x=x-1;
}
else if(x==y){
... | ALGO | 0.999832 | 4.02608 |
2f7db08c-e766-4f27-bfd0-2ac211fed991 | Evraa/Algorithms | Min path Dijkstra/Dijkstra.cpp | // Program to find Dijkstra's shortest path using
// priority_queue in STL
#include <bits/stdc++.h>
#include <iostream>
#include <list>
#include <vector>
using namespace std;
# define INF 0x3f3f3f3f
// iPair ==> Integer Pair
typedef pair<int, int> iPair;
// This class represents a directed graph using
// adjac... | ALGO | 0.999825 | 3.411482 |
bfc5b612-cb1b-4e8f-b3a0-7dcf3ecba76c | pnisarg/ABSA | tools/CRF++-0.58/encoder.cpp | #if defined(_WIN32) && !defined(__CYGWIN__)
#define NOMINMAX
#include <windows.h>
#endif
#include <algorithm>
#include <fstream>
#include "param.h"
#include "encoder.h"
#include "timer.h"
#include "tagger.h"
#include "lbfgs.h"
#include "common.h"
#include "feature_index.h"
#include "scoped_ptr.h"
#include "thread.h"
... | DATA | 0.996252 | 6.531411 |
df36e806-008b-4039-953b-ae8409619527 | triSYCL/sycl | llvm/lib/FuzzMutate/IRMutator.cpp | #include "llvm/FuzzMutate/IRMutator.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SmallSet.h"
#include "llvm/Analysis/TargetLibraryInfo.h"
#include "llvm/Bitcode/BitcodeReader.h"
#include "llvm/Bitcode/BitcodeWriter.h"
#include "llvm/FuzzMutate/Operations.h"
#include "llvm/FuzzMutate/Random.h"
#include "llvm/Fu... | ALGO | 0.90915 | 7.819561 |
fdf374ac-4564-4b26-bcfd-adbd1a8f79ba | ishandutta2007/codeforces | summitwei/normal/935/B.cpp | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
int main(){
int N;
cin >> N;
string dirs;
cin >> dirs;
int count = 0;
bool currUp; //currently we are on the top one if true and vice versa
if(dirs[0] == 'U'){
cu... | ALGO | 0.999898 | 3.783582 |
5f05d823-570c-453a-9ad9-6d3ea33f0179 | Subrojyoti/Data-Structures-and-Algorithms | Sorting Algos/selection_sort.cpp | #include <iostream>
using namespace std;
template<class T>
void selection_sort(T arr[], int n){
for(int i = 0; i < n-1; i++){
int mini = i;
for(int j = i + 1; j < n; j++){
if(arr[mini] > arr[j])
mini = j;
}
swap(arr[i], arr[mini]);
}
}
template<class... | ALGO | 0.999836 | 4.95202 |
4eb34382-9b2e-4091-87e5-ecd65ea54901 | rstancioiu/Uva-online-judge | Volume100/10003 - Cutting Sticks/10003.cpp | // Author: Stancioiu Nicu Razvan
// Problem: http://uva.onlinejudge.org/external/100/10003.html
#include <cstdio>
#define N 64
inline int MIN(int a,int b){return (a>b)?b:a;}
int l,n;
int cuts[N];
int sum;
int m[N][N];
int main()
{
while(scanf("%d",&l)==1 && l!=0)
{
scanf("%d",&n);
for(int i=1;i<=n;++i)
sca... | ALGO | 0.999823 | 3.256966 |
d1a994c3-c74d-4194-b832-34d1b57bf81a | manncodes/contest | 1361/d/d.cpp |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> x(n);
vector<int> y(n);
vector<double> d(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
d[i] = sqrt((double) ((long long) x[i] * x[i] + (long long) ... | ALGO | 0.999955 | 4.312086 |
8375e179-b3f3-4bfe-9a26-0d53b7b48d93 | 0xedb/algo-ds | c++/leetcode/701. Insert into a Binary Search Tree.cpp | /**
* 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:
TreeNode *insertIntoBST(TreeNode *root, int val)
{
TreeNode *cur = root;
while (cur)
... | ALGO | 0.999993 | 6.442801 |
27cf8957-dfa3-45e6-8946-d41d410cb56d | archeos/bundler-archeos | src/Distortion.cpp | /* Distortion.cpp */
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "Distortion.h"
#include "matrix.h"
#include "sfm.h"
#include "vector.h"
void InvertDistortion(int n_in, int n_out, double r0, double r1,
double *k_in, double *k_out)
{
const int NUM_SAMPLES = 20;
... | ALGO | 0.999258 | 5.276289 |
96854e43-bc10-4cb8-804c-bf4d4c39dfad | aksamota/codechef-practice | Practice/beginner/OMWG.cpp | #include<iostream>
using namespace std;
int main()
{
int t, n, m, total;
cin >> t;
for (int i=0; i<t; i++)
{
cin >> n >> m;
total = ((n-1) + (m-1) + ((n-1) * (m-1) * 2));
cout << total << endl;
}
return 0;
} | ALGO | 0.999839 | 4.333526 |
1563ec25-3090-4709-825b-7eb28e9575fc | llynn97/Algorithm | 백준/2931cpp.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
using namespace std;
char ch[7] = { '|','-','+','1','2','3','4' };
int r, c;
int dy[4] = { 0,0,1,-1 };
int dx[4] = { 1,-1,0,0 };
char map[26][26];
char map2[26][26];
bool check[26][26];
int mx, my, zx, zy;
int ans = 0;
int c... | ALGO | 0.999924 | 3.059994 |
81151822-dc52-423d-b80d-5fb282e83b79 | rajvardhanshinde/DSA | Star patterns/Half_side_pyramid.cpp |
// *
// * *
// * * *
// * * * *
// * * * * *
#include<iostream>
using namespace std;
int main(){
int row,col;
for(row=0;row<5;row++){
for(col=0;col<row+1;col++){
cout<<"* ";
}
cout<<endl;
}
return 0;
}
// [ In the below code nr are no_of_rows.
// You can print no... | ALGO | 0.9997 | 4.220006 |
62bc1c9c-638e-4e88-a4d7-0777ac10f222 | BruceXcluding/Vitis_Libraries | vision/L2/tests/aie/addweighted/16bit_aie_8bit_pl/graph.cpp | #include "graph.h"
PLIO* in1 = new PLIO("DataIn1", adf::plio_128_bits, "data/input1.txt");
PLIO* in2 = new PLIO("DataIn2", adf::plio_128_bits, "data/input2.txt");
PLIO* out1 = new PLIO("DataOut1", adf::plio_128_bits, "data/output.txt");
// connect dataflow graph to simulation platform
simulation::platform<2, 1> platf... | ALGO | 0.994073 | 5.067796 |
e03c462a-44df-4c24-aed1-f34a04c550ab | shubhansu-kr/CSE329-Prelude-to-CompetitiveProgramming | BackUp/00_KMP.cpp | // KMP string matching algorithm
// https://practice.geeksforgeeks.org/problems/last-match1928/1
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
vector<int> findLCS(string &s){
int n = s.length();
vector<int> lcs(n, 0);
... | ALGO | 0.999971 | 6.029614 |
58340fdf-7e92-46ca-b5ad-48a8f25f2b6c | Johannyjm/c-pro | AtCoder/othercontests/past202005/b.cpp | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m, q;
cin >> n >> m >> q;
vector<int> prob... | ALGO | 0.999285 | 3.956294 |
d5efe16e-d35a-4b1b-ba0c-de407816ba8c | navinkrnirala76/LeetCode-Practice | Minimum Number of Taps to Open to Water a Garden.cpp | class Solution {
public:
int minTaps(int n, vector<int>& r) {
// dp[i] is the min number of tapes to water area from 0 to i
vector<int> dp(n+1,n+2); // Initialize with max
dp[0] = 0; // minimum tapes needed to water area 0 is 0(basically no area)
for(int i=0;i... | ALGO | 0.999986 | 5.927329 |
533475eb-2f8b-4738-bbce-9e9ef122a707 | Princeofsyntax/leetcode | 1227-number-of-equivalent-domino-pairs/number-of-equivalent-domino-pairs.cpp | class Solution {
public:
int numEquivDominoPairs(vector<vector<int>>& dominoes) {
unordered_map<int, int>mp;
int ans = 0;
for (auto& d : dominoes) {
int key = min(d[0], d[1]) * 10 + max(d[0], d[1]);
ans += mp[key];
mp[key]++;
}
return ans... | ALGO | 0.999888 | 6.867817 |
85d6f70d-977d-4f1f-8111-622c88ff35b6 | samimans2000/C-C- | ex5/Filters.cpp |
#include <iostream>
#include "Matrix.h"
/**
* helper for convolution
* @param small
* @param smallMiddleX
* @param smallMiddleY
* @param r
* @param c
* @param image
* @param res
*/
void
calcConvVal(const Matrix &small, int smallMiddleX, int smallMiddleY, int r, int c, const Matrix &image, Matrix &res)
{
... | ALGO | 0.99801 | 4.964233 |
3b0040cd-f5b6-442d-9cca-db97828d893e | LatikovAR/Triangles_for_Stognii | geometry_base.cpp | #include <cmath>
#include <cassert>
#include "geometry.h"
namespace geometry {
//--------------------------------------point-------------------------------------
point& point::operator+=(const vec& v)& {
x_ += v.x();
y_ += v.y();
z_ += v.z();
return *this;
}
point operator+(const point& p, const ve... | TOOL | 0.928606 | 5.254193 |
0f4c2e7a-63fd-41f1-b3ba-f77497784a89 | Antoniomondejar/CompetitiveProgramming | simulaciones/23_08_23/a.cpp | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define fst first
#define snd second
#define str string
#define fore(i,a,b) for(int i=a,thxMat=b;i<thxMat;++i)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0)... | ALGO | 0.999689 | 3.35708 |
10edc65d-bc95-40aa-8727-d22a5c50219f | danielalejandroalanis/flutter-material3-widgets | 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.998733 | 6.76775 |
3ea385ee-8f87-4d82-bfbc-776ac956f581 | ishandutta2007/codeforces | kiyoshi0205/normal/1627/B.cpp | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// nam... | ALGO | 0.999474 | 4.323243 |
388ab481-c713-4239-804b-5309e3ca9d1c | rtsv/Comptetive-Programminng | Maths/Count No of Set Bits.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x = 5;
int y = 1;
int count = 0;
while(x>0)
{
if(x&y != 0)
count++;
x = x>>1;
}
cout<<count;
}
| ALGO | 0.999938 | 4.133595 |
de5381db-1b0a-4b50-9421-dfea95f64282 | raincross7/code-similarity | codes/train_code/problem213/problem213_10.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define RE... | ALGO | 0.999871 | 3.72302 |
f260f64e-3493-4163-b89e-e003e27c265e | jinxiaoye1987/RyzomCore | nel/src/3d/camera_col.cpp | #include "std3d.h"
#include "nel/3d/camera_col.h"
#include "nel/misc/matrix.h"
#include "nel/misc/triangle.h"
using namespace std;
using namespace NLMISC;
namespace NL3D {
// ***************************************************************************
const float NL3D_CameraSmoothRadiusFactor= 4;
const float NL3D_Cam... | ALGO | 0.993582 | 7.189685 |
945b8711-8c1f-4aab-84e7-3e24473d8134 | EPFL-LGG/Cshells | ext/elastic_rods/3rdparty/libigl/include/igl/ceil.cpp | template < typename DerivedX, typename DerivedY>
IGL_INLINE void igl::ceil(
const Eigen::PlainObjectBase<DerivedX>& X,
Eigen::PlainObjectBase<DerivedY>& Y)
{
using namespace std;
//Y = DerivedY::Zero(m,n);
//#pragma omp parallel for
//for(int i = 0;i<m;i++)
//{
// for(int j = 0;j<n;j++)
// {
// Y... | ALGO | 0.986246 | 5.300989 |
2820c8b5-0932-444c-ae52-33919f7f1421 | shirpaltman/CPP_EX4_24 | Demo.cpp | /*
Author:Shir Altman
ID:325168870
Email: <EMAIL>
*/
#include <iostream>
#include <memory>
#include <string>
#include "node.hpp"
#include "tree.hpp"
#include <SFML/Graphics.hpp>
#include "TreeVisualIzer.hpp"
#include "Complex.hpp"
using namespace std;
using namespace sf;
int main()
{
Tree<double> tree; // Binary... | ALGO | 0.987865 | 5.90563 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.