uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
b1a0299c-70a8-4521-8647-a63d72248655 | SigalHu/AlgorithmPractice | FillOperator.cpp | #include <iostream>
#include <array>
#include <sstream>
#include <regex>
using namespace std;
bool getResult(string eval,double *result){
stringstream ss;
double dbl;
smatch resm;
regex rep("[+-]?\\d+(\\.\\d+)?");
regex_search(eval,resm,rep);
ss<<resm.str();
ss>>*result;
ss.clear();
... | ALGO | 0.999625 | 3.62135 |
f2e063f8-43d6-46d0-ae6a-e4a3cfa31b07 | sarvex/solution-cpp | 0007.reverse_integer.cpp | #include <limits>
class Solution {
public:
auto reverse(int x) {
auto result = 0;
for (; x; x /= 10) {
if (result < std::numeric_limits<int>::min() / 10 or result > std::numeric_limits<int>::max() / 10) {
return 0;
}
result = result * 10 + x % 10;
}
return result;
}
};
| ALGO | 0.999672 | 6.094414 |
1d89bf30-aa41-47bc-a39e-0f1fba89bd12 | stm32-hotspot/STM32WB-ZB-RUC-WindowCovering | Drivers/CMSIS/NN/Examples/IAR/iar_nn_examples/NN-example-gru/arm_nnexamples_gru.cpp | /**
* @ingroup groupExamples
*/
/**
* @defgroup GRUExample Gated Recurrent Unit Example
*
* \par Description:
* \par
* Demonstrates a gated recurrent unit (GRU) example with the use of fully-connected,
* Tanh/Sigmoid activation functions.
*
* \par Model definition:
* \par
* GRU is a type of recurrent neura... | ALGO | 0.915252 | 7.471897 |
a7b58612-b797-49d1-a116-2a31f8c1cdf9 | Yaro2709/AlgoProblems | 10/479A.cpp | #include <iostream>
using namespace std;
int a[3];
int change(int i)
{
if (i == 0) return a[i];
int c1 = a[i] * change(i - 1);
int c2 = a[i] + change(i - 1);
return max(c1, c2);
}
int main()
{
cin >> a[0] >> a[1] >> a[2];
int c1 = change(2);
swap(a[0], a[2]);
int c2 = change(2);
... | ALGO | 0.999949 | 3.671766 |
c0c83c8e-337a-47df-b244-19543c5f9bbb | Simon-0801/CodeHome | 专题练习/线段树/HDU1698.cpp | #include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <cstdio>
#include <map>
#include <iomanip>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
//#define INF 0x3f3f3f3f
using namespace std;
const int maxn=1e5+5;
con... | ALGO | 0.999662 | 3.592099 |
3df44dd0-472a-4859-9af6-b84d68576aa7 | Psychim/codeforces | 459div2/c.cpp | #include<bits/stdc++.h>
using namespace std;
const int maxn=5e3+10;
string s;
int dp[maxn][maxn];
int cnt=0;
bool check(int i,int j){
if(s[i]=='('){
if(s[j]!='(')
return true;
}
else if(s[i]=='?'){
if(s[i]!='(')
return true;
}
return false;
}
int main(){
c... | ALGO | 0.999851 | 3.417841 |
230ead5d-fbee-43f2-9378-4c3fe144653e | liusheng198933/sdnsim | sdnsim/sdnsim/main.cpp | #include <iostream>
#include "sdnsim.h"
#include<list>
#include<deque>
#include"model3.h"
#include "attacker.h"
#include <set>
#include <vector>
#include<cmath>
#include<bitset>
#include "autopara.h"
/*StateType clear_bit(StateType u,int b){
StateType t=(1<<(b-1));
t=~t;
return u&t;
};
StateType set_bit(StateType ... | ALGO | 0.999614 | 3.260349 |
455c8ce5-b2d0-4083-b05f-a06e433fcfd0 | Jaanvi/leetcode | 0026-remove-duplicates-from-sorted-array/0026-remove-duplicates-from-sorted-array.cpp | class Solution {
public:
int removeDuplicates(vector<int>& nums)
{
int size=nums.size();
if(size<=1)
{
return size;
}
vector<int>ans;
ans.push_back(nums[0]);
for(int i=1;i<size;i++)
{
if(nums[i]!=nums[i-1])
{
... | ALGO | 0.999886 | 6.246287 |
1cf3e261-afe0-4a3b-89b2-6e50d4b23591 | project-asgard/kronmult | kronmult3_batched.cpp | #include "kronmult3_batched.hpp"
void kronmult3_batched(
int const n,
double const Aarray_[],
double Xarray_[],
double Yarray_[],
double Warray_[],
int const batchCount )
{
#ifdef U... | ALGO | 0.972117 | 5.568538 |
201a6e0b-0e35-45ee-a10c-c154f434ed30 | Sezalsaundarya11/LeetCode-Cpp | 0240-search-a-2d-matrix-ii/0240-search-a-2d-matrix-ii.cpp | class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int row = matrix.size();
int col = matrix[0].size();
int rowIndex = 0;
int colIndex = col-1;
while(rowIndex < row && colIndex>=0){
int element = matrix[rowIndex][colIndex];
... | ALGO | 0.99995 | 6.068093 |
887e7d4c-a6c7-4a15-aded-0b7ad2f52e5e | Santiago25k/Analista-Funcional-de-Sistemas | C++/archivos_de_clase/ejercicios/ej_8.cpp | //!Suma de Números Naturales
//Crea un programa que pida al usuario un número n y luego calcule la suma de los primeros n números naturales (1 + 2 + 3 + ... + n).
#include <iostream>
using namespace std;
int main () {
int numeros;
int suma = 0;
int contador = 1;
cout << "Ingresa un numero para calcula... | ALGO | 0.983952 | 3.562329 |
d82cc457-531f-4f29-9f7f-58a3aaa7b28e | jinxes61/AI-bashuma | IDA_star+估价函数2.cpp | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<string>
#include<set>
#include<map>
using namespace std;
char str[10];
int a[10], tar[10] = {1, 2, 3, 8, 0, 4, 7, 6, 5}, ans;
int pos[10] = {0, 1, 2, 5, ... | ALGO | 0.999725 | 3.583675 |
6d30f723-af7c-47c9-bcc6-7cf2d0b7c6ba | Hakka-Man/leetcodeDaily | Alan/707.DesignLinkedList.cpp | class MyLinkedList {
private:
struct Node{
int datum;
Node* next;
Node* prev;
};
Node* head;
Node* tail;
public:
MyLinkedList(): head(nullptr), tail(nullptr) {
}
int get(int index) {
Node* now = head;
if(!now){
return -1;
... | ALGO | 0.99973 | 5.424566 |
5a9ee2ca-01da-4827-a818-67865888e465 | jtiger0303/BaekJoonAlgo | BOJ6593.cpp | #include <iostream>
#include <cstring>
#include <queue>
using namespace std;
int l, r, c, cnt;
bool flag;
char field[31][31][31];
int fieldcount[31][31][31];
int visit[31][31][31];
int dx[6] = { 1,-1,0,0,0,0 };
int dy[6] = { 0,0,1,-1,0,0 };
int dz[6] = { 0,0,0,0,1,-1 };
void bfs(int x, int y, int z) {
queue<pair<pai... | ALGO | 0.99977 | 4.141926 |
42d9404e-e399-4c37-9cb8-35337e63ba6d | belikeakash/Leetcode | 264-ugly-number-ii/264-ugly-number-ii.cpp | class Solution {
public:
int nthUglyNumber(int n) {
priority_queue<long long, vector<long long>, greater<long long>>s;
s.push(1);
long long x = 1;
if(n==1) return 1;
for(int i=0;i<n;i++) {
x = s.top();
while(!s.empty() && s.top()==x) {
... | ALGO | 0.999997 | 5.642175 |
0a0a0f4d-515b-41b2-92ba-c71d98e1643b | rajyan/AtCoder | ABC/ABC155/D.cpp | //#include <cassert>
//#include <cstdio>
//#include <cmath>
//#include <iostream>
//#include <iomanip>
//#include <sstream>
//#include <vector>
//#include <set>
//#include <map>
//#include <queue>
//#include <numeric>
//#include <algorithm>
//
//using namespace std;
//using lint = long long;
//constexpr int MOD = 10000... | ALGO | 0.999965 | 4.525211 |
7ef9e351-8508-435e-a932-e088293c5e03 | rafi67/Problem | A_Insomnia_cure.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, l, m, n, d,
damageDragonCount = 0;
scanf("%d %d %d %d %d", &k, &l, &m, &n, &d);
for(int i=1; i<=d; i++)
if(i%k==0 || i%l==0 || i%m==0 || i%n==0) damageDragonCount++;
printf("%d\n", damageDragonCount);
return 0;... | ALGO | 0.999723 | 3.412328 |
ba45e520-f7ea-42f8-b5f6-85ae731defd6 | pradeeppatwa/6companies30days | Adobe/code08.cpp | // Implement Atoi
int atoi(string str) {
//Your code here
int ans=0;
int n=str.size();
bool check=0;
if(str[0]=='-')
check=1;
else{
ans=ans*10 + (str[0]-'0');
}
if(n==1 && check==0)
return ans;
else if(n==1 && check==1)
... | ALGO | 0.989168 | 4.936559 |
394f2a02-664f-47cd-ab79-bee31e2ee0cc | cpedrohenrique1/recursividade | iterativo.cpp | #include "iterativo.h"
namespace Pedro{
iterativo::iterativo()
{
}
QString Pedro::iterativo::imprimir(int n)
{
QString saida = "";
for (int i = 1; i <= n; i++)
{
saida += QString::number(i) + ", ";
}
return saida;
}
QString Pedro::iterativo::par(int n)
{
QString saida = "";
for ... | ALGO | 0.996775 | 4.7452 |
412ca0d6-b225-4abe-bef5-370a7b2f8884 | zep1994/OpenCV | opencv-4.7.0/opencv-4.7.0/modules/imgproc/src/cornersubpix.cpp | #include "precomp.hpp"
void cv::cornerSubPix( InputArray _image, InputOutputArray _corners,
Size win, Size zeroZone, TermCriteria criteria )
{
CV_INSTRUMENT_REGION();
const int MAX_ITERS = 100;
int win_w = win.width * 2 + 1, win_h = win.height * 2 + 1;
int i, j, k;
int max_i... | ALGO | 0.999906 | 5.728745 |
1de16c35-ccc2-4142-b46d-bee2e01f9aa0 | mashruf99/AlgorithmSolve | coin_change_unbounded.cpp | // MASHRUF's work
// Here I Have n number of elements and needed to find if I can make s using those n elements
// I've to show how many way there to do so
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define mp make_pair
#define no cout<<"NO"<<'\n'
#define ... | ALGO | 0.999887 | 3.398448 |
a3a1076b-288d-41ca-948e-a36b4dc5921b | sachinprasanna7/DSA-Everyday | Day 40/HouseRobber2.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution {
private:
int solve(vector <int> &nums){
int succ2 = 0;
int succ1 = 0;
int i = nums.size() - 1;
while(i >= 0){
int include = succ2 + nums[i];
int e... | ALGO | 0.999786 | 5.483046 |
28e9e8ee-374e-453a-ba6a-ee3a7af6e31e | u0empty/algorithm | BOJ/창문닫기.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
for (int i = 1; i <= sqrt(n); i++) {
if (i * i > n) break;
cnt++;
}
cout << cnt;
return 0;
} | ALGO | 0.999745 | 4.33496 |
5cd9ddf2-dbb9-41d0-98e6-3a2a78170015 | samnoggle/CSF2 | Unit 3/Mulch/Source.cpp | #include <iostream>
using namespace std;
int main()
{
//declare variables
int gardenArea[6];
int num, sum;
int scoopsneeded, cost;
for (int x = 0; x <= 4; x++)
{
cout << "Enter the area of the garden.";
cin >> num;
sum = sum + num;
}
cout << sum;
}
/////////////////////////
| ALGO | 0.989188 | 3.713871 |
877e0e1e-2934-4a1e-9aed-cdb19bf3dab3 | HeCraneChen/500.111.40_exploring_laplacian_graphics_course | week3/libigl/include/igl/isolines.cpp | #include "isolines.h"
#include <vector>
#include <array>
#include <iostream>
#include "remove_duplicate_vertices.h"
template <typename DerivedV,
typename DerivedF,
typename DerivedZ,
typename DerivedIsoV,
typename DerivedIsoE>
IGL_INLINE void igl::isolines(
const Eigen::MatrixBase<Deriv... | ALGO | 0.932855 | 5.885003 |
b6e2d166-ffa1-41f1-b409-2c18f29f6b49 | aredjil/euler_project | problem_930/.history/src/main_20250209184709.cpp | #include "gather.hpp"
std::random_device dv;
std::mt19937 gen(dv());
void step(std::vector<int> &balls, std::vector<int> &bowls, std::mt19937 &gen)
{
int m = balls.size();
int n = bowls.size();
int rd_ball;
int rd_dir;
// Choosing a random ball
std::uniform_int_distribution<int> choose_ball(0... | ALGO | 0.999858 | 5.025048 |
6ea7828e-f022-436d-872a-04f224bc4c79 | ibayashi-hikaru/allegro-legato | lammps/src/KOKKOS/min_kokkos.cpp | // clang-format off
/* ----------------------------------------------------------------------
Contributing author: Stan Moore (SNL)
------------------------------------------------------------------------- */
#include "min_kokkos.h"
#include "angle.h"
#include "atom_kokkos.h"
#include "atom_masks.h"
#include "bon... | ALGO | 0.981825 | 6.425616 |
cb8588f2-9583-45ee-8cc3-1b7467994dc1 | ElectraProtocol/OmniXEP | src/crypto/siphash.cpp | #include <crypto/siphash.h>
#define ROTL(x, b) (uint64_t)(((x) << (b)) | ((x) >> (64 - (b))))
#define SIPROUND do { \
v0 += v1; v1 = ROTL(v1, 13); v1 ^= v0; \
v0 = ROTL(v0, 32); \
v2 += v3; v3 = ROTL(v3, 16); v3 ^= v2; \
v0 += v3; v3 = ROTL(v3, 21); v3 ^= v0; \
v2 += v1; v1 = ROTL(v1, 17); v1 ^= v... | ALGO | 0.999732 | 6.872156 |
8ab9689d-35bf-4d72-a266-f7a050d9a0e5 | elixered/leetcode | 290-word-pattern/290-word-pattern.cpp | class Solution {
public:
bool wordPattern(string pattern, string s) {
unordered_map<char,string> pat;
unordered_map<string,char> match;
stringstream ss(s);
string word;
int i=0;
while(getline(ss,word,' '))
{
char c = pattern[i];
if(pat.... | ALGO | 0.9994 | 6.324912 |
1e0f2a73-be2f-40fa-953e-72976c05b0a1 | ahsanauddry027/CSE221_Lab01 | MergeSort.cpp | #include <iostream>
using namespace std;
void mergeSort(int arr[], int start, int mid, int end)
{
int size1 = mid - start + 1;
int size2 = end - mid;
int temp1[size1];
int temp2[size2];
for (int i = 0; i < size1; i++)
{
temp1[i] = arr[start + i];
}
for (int i = 0; i < size2; ... | ALGO | 0.99995 | 4.725666 |
dd09bc4c-9772-477e-af98-e10a6d1d9761 | JpKarwa/PW-Skills-PPT-program | Arrays/Assignment 7/5.cpp | /*
Given a string s and an integer k, reverse the first k characters for every 2k characters counting from the start of the string.
If there are fewer than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and leave the othe... | ALGO | 0.999937 | 6.146373 |
79550e7e-7062-4a4c-a776-7c6179680333 | bryanoliveira/programming-marathon | uri/1799.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, totaldist;
map<string, vector<string> > graph;
cin >> n >> m;
while(m--) {
string a, b;
cin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
priority_queue< pair<int, strin... | ALGO | 0.999584 | 4.134686 |
052b9476-ee81-4fc9-8942-7c14c1623c78 | SaraCmque/RLE-compression-algorithm | src/rle.cpp | #include "rle.h"
#include <fcntl.h> // Para open()
#include <unistd.h> // Para read(), write() y close()
#include <iostream> // Para std::cerr
// Función para comprimir usando Run-Length Encoding (RLE)
std::string comprimirRLE(const std::string& texto) {
std::string comprimido;
int longitud = text... | ALGO | 0.983762 | 4.374105 |
a83fb2c9-4fd7-431d-a411-920c771fbc73 | halkuponthegale/Detention | helloworld/include/Box2D/Collision/b2CollideCircle.cpp | #include <Box2D/Collision/b2Collision.h>
#include <Box2D/Collision/Shapes/b2CircleShape.h>
#include <Box2D/Collision/Shapes/b2PolygonShape.h>
void b2CollideCircles(
b2Manifold* manifold,
const b2CircleShape* circleA, const b2Transform& xfA,
const b2CircleShape* circleB, const b2Transform& xfB)
{
manifold->pointCou... | ALGO | 0.999308 | 7.760263 |
079fa7de-fa05-4731-8152-4220a4f698fd | LordRonz/cp-solutions | codeforces/1350A.cpp | #include <bits/stdc++.h>
using namespace std;
#define MAX(a,b,c) max(a,max(b,c))
#define MIN(a,b,c) min(a,min(b,c))
#define MP make_pair
#define FOR(x, a, b) for(int x = a; x < b; ++x)
typedef pair<int, int> pii;
//0xACCE97ED;
int smallestDivisor(int n) {
if (n % 2 == 0)
return 2;
for (int i = 3; ... | ALGO | 0.999944 | 3.896976 |
de5152b5-469f-4bea-9c62-ff85f51a6fa1 | deanindaeyong/codetree-TILs | 240723/문자열의 특정 위치 찾기 2/find-specific-location-in-spring-2.cpp | #include <iostream>
using namespace std;
int main() {
// 여기에 코드를 작성해주세요.
char a;
int cnt=0;
cin>>a;
string c[5] ={"apple","banana","grape","blueberry","orange"};
for(int i=0;i<5;i++){
for(int j=2;j<4;j++){
if(c[i][j]==a){
cout<<c[i]<<endl;
... | ALGO | 0.996422 | 4.100087 |
7419a654-8b96-4ce9-aa43-b55f91b67a7c | sarvex/leetcode-matlab | solution/0800-0899/0872.Leaf-Similar Trees/Solution.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.999922 | 6.647254 |
e048fa0c-6527-4420-83fc-ffefca0fc76e | ritesend/leetcode | 0916-word-subsets/0916-word-subsets.cpp | class Solution {
public:
vector<string> wordSubsets(vector<string>& mainWords, vector<string>& requiredWords) {
int maxCharFreq[26] = {0};
int tempCharFreq[26];
for (const auto& word : requiredWords) {
memset(tempCharFreq, 0, sizeof tempCharFreq);//To Set Temp freq all t... | ALGO | 0.999777 | 6.583478 |
49c0dba7-3498-4625-b4a6-d93a9cd1aa16 | AbdulKarimBukhshAnsari/DSA_Labs | Lab 6/question3.cpp | #include <iostream>
using namespace std;
class Deque {
int* array;
int front;
int rear;
int size;
int capacity;
public:
Deque(int cap) {
capacity = cap;
array = new int[capacity];
front = -1;
rear = -1;
size = 0;
}
~Deque() {
delete[] ar... | ALGO | 0.997563 | 5.795793 |
65642386-292b-4b0b-b53a-7d04816b1422 | NekoRolly/Soluciones | Tester/good_solution.cpp | // Juguemos a las atrapadas hasta que la muerte nos separe
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int N = 2e5+4;
const ll infll = 1e18+4;
const int inf = 1e9;
const int mod = 1e9+7;
int arr[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};... | ALGO | 0.999351 | 3.706818 |
a4a33451-71a2-4bb9-a04c-0cad0cb6c04a | Aladin-Saleh/Moteur-Graphique-Physique | CapsEngine/ThirdParty/Bullet3/src/Bullet3OpenCL/NarrowphaseCollision/b3ContactCache.cpp | #if 0
#include "b3ContactCache.h"
#include "Bullet3Common/b3Transform.h"
#include "Bullet3Collision/NarrowPhaseCollision/shared/b3Contact4Data.h"
b3Scalar gContactBreakingThreshold = b3Scalar(0.02);
///gContactCalcArea3Points will approximate the convex hull area using 3 points
///when setting it to false, it w... | ALGO | 0.991248 | 6.487961 |
43382261-b1c3-4c8e-b1a1-5435ae9a82a0 | instar-robotics/alexandria | lib/arithmetic/arithmetic.cpp | #include "arithmetic.h"
REGISTER_FUNCTION(MSum);
REGISTER_FUNCTION(SSum);
REGISTER_FUNCTION(MSSum);
REGISTER_FUNCTION(MMSub);
REGISTER_FUNCTION(MSSub);
REGISTER_FUNCTION(SSSub);
REGISTER_FUNCTION(MMul);
REGISTER_FUNCTION(SMul);
REGISTER_FUNCTION(MSMul);
REGISTER_FUNCTION(MMDiv);
REGISTER_FUNCTION(MSDiv);
REGISTER_FUNC... | ALGO | 0.970477 | 6.060371 |
28e5b3e6-31c1-43b1-9900-60052e199ff7 | islamWalied/problem_solving | codeforces/assuit sheet/sheet#3 (array)/P. Minimize Number.cpp | #include <iostream>
const long long N = 1e5;
using namespace std;
int main(){
long long a;
cin >> a;
long long arr[a];
for (int i = 0; i < a; ++i) {
cin >> arr[i];
if (arr[i] % 2 != 0) {
cout << 0;
return 0;
}
}
int c = 0, flag = 0;
while (fla... | ALGO | 0.999977 | 4.257639 |
8c1737a2-e0dc-492d-9333-7e083684d469 | raincross7/code-similarity | codes/train_code/problem270/problem270_442.cpp | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,... | ALGO | 0.999795 | 3.54027 |
11bb1e54-3ad8-4b10-9217-c5fd147cbd92 | VigKillian/projet_mosaique | src/couleur_moyen.cpp | // test_couleur.cpp : Seuille une image en niveau de gris
#define NB_BASE_DE_DONNEE 9765
#include <stdio.h>
#include "image_ppm.h"
#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <cmath>
#include <float.h>
#include <fstream>
using namespace std;
#include <atomic>
std::atomic<float> pr... | ALGO | 0.936814 | 3.579222 |
f92e17c0-9690-4318-bb9f-19a240d9b38a | ishandutta2007/codeforces | geothermal/normal/1393/E1.cpp | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<l... | ALGO | 0.999979 | 4.44105 |
0603d445-57b0-4e8d-927e-0ffbe3d79b36 | Atharva961/LeetCode-submissions | 0547-number-of-provinces/0547-number-of-provinces.cpp | class Solution {
public:
void bfs(vector<vector<int>>& adj, int n, vector<int>& visited)
{
queue<int> q;
q.push(n);
visited[n] = 1;
while(!q.empty())
{
int f = q.front();
q.pop();
for(int i:adj[f])
{
if(!visi... | ALGO | 0.999994 | 6.182939 |
f2476596-cc70-44a5-a90c-72afdc8f30e1 | Mr-Ye-Cao/Rice-ICPC-Club-Fall-2021 | week1/train1/sort.cpp | #include <bits/stdc++.h>
int main(){
// often time one wants to break a tie
// it is very useful to construct a pair & sort
std::vector<pair<int,int> > vec_pair;
vec_pair.push_back(std::make_pair(1,2));
vec_pair.push_back(std::make_pair(1,1));
std::sort(vec_pair.begin(),vec_pair.end());
cout<<... | ALGO | 0.999854 | 4.219562 |
ec26a6fb-d94c-4c3b-b3d3-48b978ed5b6a | armandocodigos/0122FP-UCA | arreglo_usuario.cpp | #include <iostream>
using namespace std;
int main(void){
//Solicitar cantidad de casillas para mi arreglo
int tamanio = 0;
cout << "Cantidad de enteros a almacenar: ";
cin >> tamanio;
//Declarar mi arreglo con dicha cantidad de casillas
int enteros[tamanio];
//Recorrer mi arreglo, casilla... | ALGO | 0.894167 | 3.38434 |
66bf417d-942a-4384-99b7-c7df93235d3e | Nisiyama-Suzune/TGoP | src/graph/hopcoft_karp.cpp | #include "basic.cpp"
#ifndef __GRAPH_HOPCOFT_KARP
#define __GRAPH_HOPCOFT_KARP
namespace graph {
/* Hopcoft-Carp algorithm :
unweighted maximum matching for bipartition graphs with complexity O (m * n^0.5).
struct hopcoft_carp :
Usage : solve () for maximum matching. The matching is in matchx and matchy.
... | ALGO | 0.999717 | 4.861039 |
35792f25-2960-4282-9d4b-7767a04682ac | ltqusst/hello | hello_ocl/run_myGEMM.cpp | /*
* run_myGEMM.c
*
* Created on: Sep 14, 2017
* Author: hddls
*/
#include <stdio.h>
#include <stdlib.h>
#include <CL/cl.h>
#include "utils.h"
#include <sys/time.h>
// Repeat all kernels multiple times to get an average timing result
#define NUM_RUNS 10
// Size of the matrices - K, M, N (squared)
#define S... | ALGO | 0.953856 | 5.904902 |
209d373c-c558-4f21-8ccf-9bad516e1706 | sanjanprakash/LeetCode | merge2binarytrees.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 *auxMerger(TreeNode *r1, TreeNode *r2) {
if (r1 && !r2)
return r1;... | ALGO | 0.99999 | 6.231029 |
2b04a170-bba8-4229-990f-252e6b6aa5e9 | kayapn/cpp-test | atcoder-test/OLD002.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int cnt = 0;
if (s[0] == '1') cnt ++;
if (s[1] == '1') cnt ++;
if (s[2] == '1') cnt ++;
cout << cnt << endl;
}
| ALGO | 0.999707 | 3.675179 |
cd4925bf-f977-4702-b729-82fa896d2252 | google-ar/jetpack-xr-natives | third_party/filament/libs/geometry/src/SurfaceOrientation.cpp | #include <geometry/SurfaceOrientation.h>
#include "filament/libs/utils/include/utils/Panic.h"
#include "filament/libs/utils/include/utils/debug.h"
#include "filament/libs/math/include/math/mat3.h"
#include "filament/libs/math/include/math/norm.h"
#include <vector>
namespace filament {
namespace geometry {
using na... | TOOL | 0.976765 | 7.923679 |
2a6dc6a6-a2c3-46b7-bf39-c95030705b86 | zeguilherme1/competitive_programming | estojo.cpp | #include <bits/stdc++.h>
using namespace std;
#define matrix vector<vector<int>>
int n;
bool verificar(matrix const &matriz){
for(int i = 0; i + 1 < n; i++){
for(int j = 0; j + 1 < n; j++){
if(matriz[i][j] >= matriz[i+1][j] || matriz[i][j] >= matriz[i][j+1]){
return false;
}
}
}
return true;
}
void r... | ALGO | 0.999912 | 3.973647 |
1ee0b4fc-6d17-49ad-b283-ab6415fb823a | DockDockGo/ddg_multi_robot_planner | src/MutexReasoning.cpp | #include "MutexReasoning.h"
#include "ConstraintPropagation.h"
shared_ptr<Conflict> MutexReasoning::run(const vector<Path*> & paths, int a1, int a2, CBSNode& node, MDD* mdd_1, MDD* mdd_2)
{
clock_t t = clock();
if (a1 > a2)
{
std::swap(a1, a2);
std::swap(mdd_1, mdd_2);
}
auto conflict = findMutexConflict(path... | ALGO | 0.999478 | 5.286578 |
b7eb611f-bae1-45d3-a01c-7accd1035044 | xukaituo1994/PAT | 1001: A+B Format.cpp | #include <iostream>
using namespace std;
void format(int a);
int main()
{
int a, b;
cin >> a >> b;
format(a + b);
}
void format(int a)
{
if (a < 0) {
cout << "-";
a = -a;
}
if (a / 1000 > 0) {//a >= 1000, a's bits >= 4
format(a / 1000);
printf(",%03d", a % 1000);
} else {
cout << a;
}
}
| ALGO | 0.999061 | 4.032743 |
c10c605f-5b67-45a0-81bb-cad344109d94 | jaiesh-pahlajani/data_structures_and_algos | dynamic_programming/p4_unbounded_knapsack.cpp | #include<iostream>
#include<stdio.h>
#include<stdio.h>
using namespace std;
int unboundedKnapsack(int wt[], int val[], int n, int w) {
/*
Knapsack problem where the same item can be repeated multiple times
*/
int dp[100][100]={0};
for(int i=1; i<=n; i++) {
for(int j=1;j<=w;j++) {
... | ALGO | 0.999988 | 4.336854 |
a7ea1979-34cd-485e-b07c-f6016dd03760 | ThanakritW/ocom2021 | 51_mushroomphobia/tempCodeRunnerFile.cpp | #include<bits/stdc++.h>
using namespace std;
multiset<long long> s;
long long n,l,h,t,x,y,m;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> l >> h;
for(int k=0;k<n;k++){
cin >> m;
for(int i=0;i<m;i++){
cin >> t;
s.insert(t);
}
... | ALGO | 0.999659 | 3.437125 |
74d4e800-5b29-4b9b-8841-8a190698296a | valber-8/geosci | lmp/alt/USER-CUDA/pair_gran_hooke_cuda.cpp | /* ----------------------------------------------------------------------
Contributing author: Paul Crozier (SNL)
------------------------------------------------------------------------- */
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include "pair_gran_hooke_cuda.h"
#include "pair_gra... | ALGO | 0.994464 | 6.032613 |
61bcf62b-b8f5-4cbe-a1a4-fad5d60861d5 | adityaraj0109/Competitive-Programming-DSA | FINAL450/Max Min.cpp | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
void debugMode()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int findSum(int A[], int N)
{
int min=INT_MAX;
int max=INT_MIN;
for (int i = 0; i < N; i++)
{
if... | ALGO | 0.998605 | 4.146547 |
593ca016-a008-4ae7-b869-7bb0247f34f0 | manikanta2901/ubuntu | .history/codingChallenges/cpp/Codechef/longChallenges/August/smallestKmp_20200809135635.cpp | #include<bits/stdc++.h>
#include<vector>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<iterator>
#include<string>
#include<map>
#define vv vector
#define F first
#define S second
#define MP make_pair
#define EXECUTE_FASTER ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define printM... | ALGO | 0.999975 | 4.192278 |
430ba305-8308-433a-930d-0d8fe6fd735b | okejka1/PEA_PROJECT | main.cpp | #include <iostream>
#include "structures/Graph.h"
//#include "algorithms/BruteForce.h"
//#include "testers/AutomaticTester.h"
//#include "utils/FileRandomizer.h"
//#include "utils/Timer.h"
//#include "algorithms/DP.h"
//#include "algorithms/BB.h"
#include <string>
//void waitForResponse() {
// std::cout << std::end... | ALGO | 0.988643 | 3.092465 |
57932b70-85f5-438f-977d-08bdd68c12fb | Snehasish321/design-analysis | jobSchedule.cpp | #include <iostream>
#include <algorithm>
using namespace std;
struct Job {
char id;
int deadline, profit;
};
// Comparison function to sort jobs by profit (descending)
bool compare(Job a, Job b) {
return a.profit > b.profit;
}
int main() {
// Input: list of jobs
Job jobs[] = {
{'A', 2, 10... | ALGO | 0.999996 | 6.426356 |
353edc42-d6a0-49f7-83b8-9be36ff27411 | 0xUvaish/LeetHub | 131-palindrome-partitioning/131-palindrome-partitioning.cpp | class Solution {
public:
bool check(string s , int l ,int r)
{
while(l<=r)
{
if(s[r]!=s[l])
return false;
l++;
r--;
}
return true;
}
void helper(string s ,int l ,int n,vector<string> temp,vector<vector<string>> &ans){
... | ALGO | 0.999951 | 6.292756 |
84d04105-a874-4c0f-a1c3-504421d6cbc1 | ishandutta2007/codeforces | jjang36524/normal/1288/B.cpp | #include <iostream>
using namespace std;
#define int long long
int N, M, T;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> T;
while (T--)
{
cin >> N >> M;
int i=0;
int t = 9;
while (1)
{
if (t > M)
break;
t = t * 10 + 9;
i++;
}
cout << N * i << '\n';
}
} | ALGO | 0.999819 | 4.5992 |
d8a6d081-4b63-45f4-8a16-a6d11d1e60fd | Kaashish1111/cpp-basics | patterns/star_rohmbus.cpp/p1.cpp | // *****
// *****
// *****
// *****
// *****
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
cout << "* " << " ";
}
cout << endl;
}
return 0;
} | ALGO | 0.999679 | 3.54841 |
93a48ce8-3d3c-44ac-8394-8c860e6a1ac2 | VanshRuhela/Practice | Graph/TopologicalSort/topologicalSorting.cpp | /*=============================================================================
# PROBLEM: Topological Sorting
=============================================================================*/
#include <bits/stdc++.h>
using namespace std;
class Graph {
int V;
list<int>* adj;
void topologicalSortU... | ALGO | 0.999997 | 5.701061 |
6ab63a8d-33d4-4329-93d1-60a5ae1a2717 | Jared-Ma/NeetCode-Solutions | 25 - 3Sum/main.cpp | #include <algorithm>
#include <iostream>
#include <vector>
class Solution {
public:
static std::vector<std::vector<int>> threeSum(std::vector<int>& nums) {
std::sort(nums.begin(), nums.end());
std::vector<std::vector<int>> triplets {};
int n = static_cast<int>(nums.size());
for (int i = 0; i < n; ++i) {
... | ALGO | 0.999745 | 5.742399 |
7d21a2dc-1da8-48d6-b5f6-98985b838773 | kush1jpeg/Steganography-x-CPP | bin.cpp | #include "cpp.h"
#include <iostream>
#include <vector>
using namespace std;
vector<int> toBinary(string msg)
{
vector<int> Store;
cout << endl ;
for (char ch : msg)
{
vector<int> binary(8);
for (int i = 7; i >= 0; i--)
{
binary[i] = ch % 2; //% of ascii of ch;
... | TOOL | 0.96108 | 4.297374 |
1b3965f3-314c-43e6-b5b3-635a22c11736 | amtommy/LeetCode_C-plus-plus | 0268_Missing_Number/sorting/missing_number.cpp | class Solution {
public:
int missingNumber(vector<int>& nums) {
if(nums.size() == 1){
if(nums[0] == 0) return 1;
else if (nums[0] == 1) return 0;
}
sort(nums.begin(), nums.end()); // T:O(NlogN)
for(int i = 1; i < nums.size(); i++){ // T:O(N)
if(nu... | ALGO | 0.99999 | 5.774561 |
56be6be3-e17d-4a78-9cf9-889c84c40aa9 | Yashu3624/DSA-LEETCODE-GFG | Boundary traversal of matrix - GFG/boundary-traversal-of-matrix.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
//Function to return list of integers that form the boundary
//traversal of the matrix in a clockwise manner.
vector<int> boundaryTraversal(vector<vector<int> > matrix, int n, int ... | ALGO | 0.999909 | 5.8304 |
bd21a4fb-c719-48c7-8e3f-d5c066e5b9c3 | LeTienIT/Ky_Thuat_Do_Hoa | 4cohen.cpp | #include <iostream>
#include<math.h>
#include<conio.h>
using namespace std;
string phia[]={"duoi","tren","phai","trai"};
struct diem
{
float x, y;
};
struct cuaso
{
float Xmin,Ymin,Xmax,Ymax;
};
struct C
{
int ma[4];
};
class Tien
{
private:
diem P[2];
diem giao[2];
cuaso W;
C c[2];
public:
void nhap()
{
c... | ALGO | 0.998124 | 3.178576 |
63265574-27aa-44d6-bac0-287a0e243d9b | Saif502/CP_Hunter | C & c++ code/Codeforces/1428a.cpp | #include<bits/stdc++.h>
#include<iostream>
#include<math.h>
#include<string.h>
#define ll long long int
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
ll m,n,c=0,k=0,a=0,b=0,temp,MAX=0,MIN=999999999;
cin>>m>>n>>a>>b;
if(m==a)
{
cout<<abs(n-b)<... | ALGO | 0.99984 | 3.700289 |
b5cc590f-bdf6-4d3d-8c48-8f49bc8d0335 | pa-gm/android_frameworks_av | media/libmedia/StringArray.cpp | //
// Sortable array of strings. STL-ish, but STL-free.
//
#include <stdlib.h>
#include <string.h>
#include <media/StringArray.h>
namespace android {
//
// An expanding array of strings. Add, get, sort, delete.
//
StringArray::StringArray()
: mMax(0), mCurrent(0), mArray(NULL)
{
}
StringArray:: ~StringArray(... | TOOL | 0.971086 | 6.43154 |
ee5a928a-2ce4-4a10-b35c-b2e53ca43748 | hackerkid/LightOJ-Solutions | 1033-Generating-Palindromes.cpp | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int pali(string x, string y)
{
int a[110][110];
memset(a, 0, sizeof(a));
for (int i = x.length(); i >= 0; i--) {
for (int j = y.length(); j >= 0; j--) {
if(i == x.length() or j == y.length()) {
a[i][j] = ... | ALGO | 0.999778 | 4.132602 |
2e1b844e-c3e2-4130-acd4-45e3e8c058a7 | gpoussel/copro-plus | codeforces/problems-13xx/1312/A.cpp | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numbers>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define nl '\n'
#define de... | ALGO | 0.9996 | 5.833447 |
15500032-7e9e-41dd-a7b6-b4273758f73f | fieryprofessor/My_CPP_Codes | 07-functions/square.cpp | #include<iostream>
using namespace std;
int square(int num){
return(num*num);
}
int main(){
for(int i=1;i<=5;i++)
{
cout<<square(i)<<" ";
}
return 0;
} | ALGO | 0.991445 | 3.629936 |
1ca90051-7e0b-4606-9d6c-11d15fb17fbf | Sillyplus/Solution | Timus/1582.cpp | /*******************************************************************************
> File Name: 1582.cpp
> Author: sillyplus
> Mail: <EMAIL>
> Created Time: Thu Apr 16 00:03:37 2015
*******************************************************************************/
#include <iostream>
#include <cstdio>
using namespa... | ALGO | 0.998836 | 3.558761 |
10e2c679-0fa8-42d2-9b31-a78c66383220 | dicabreras/Coding-Problems-CP- | CodeForces/Contests/Div 4/Good Kid.cpp | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]){
int t;
cin>>t;
while(t--){
int n, min = 9, ans = 1; cin>>n;
int a[n];
for(int i = 0; i<n; i++){
cin>>a[i];
if(a[i]<min) min = a[i];
}
bool flag = false;
... | ALGO | 0.999993 | 5.004097 |
89193fef-6edb-43b3-9d8b-aff201560b28 | DavidBarbera/MathTeam | octet-master/octet/open_source/bullet/BulletCollision/NarrowPhaseCollision/btPersistentManifold.cpp | #include "btPersistentManifold.h"
#include "LinearMath/btTransform.h"
btScalar gContactBreakingThreshold = btScalar(0.02);
ContactDestroyedCallback gContactDestroyedCallback = 0;
ContactProcessedCallback gContactProcessedCallback = 0;
///gContactCalcArea3Points will approximate the convex hull area using 3 points
... | ALGO | 0.987404 | 6.886747 |
2766082e-de02-42b3-8df4-bee790b1450f | ASHWANIKUMARGUPTA14830/C_PLUS_PLUS_COURSE | RATIONAL_OPERATOR_NOT_EQUAL_TO.CPP | #include <iostream>
int main() {
int num1 = 10;
int num2 = 7;
bool isNotEqual = (num1 != num2);
std::cout << "Are the numbers not equal? " << isNotEqual << std::endl;
return 0;
}
| ALGO | 0.986037 | 4.546923 |
1abcb2d9-ca5a-4ec9-a2e0-e7a6d072064c | Festusmastermind/ProgrammingC- | MY C++ prog/array/3 by 4 summation.cpp | #include <iostream>
using namespace std;
main()
{
// declaration section
int mymatrix_A[3][4]={{3,1,4,8},{5,2,6,7},{9,1,5,8}};
int mymatrix_B[3][4]={{2,3,4,5},{5,7,9,8},{1,4,3,2}};
int mymatrix_C[3][4];
int mymatrix_C2[3][4];
// this first section to output the A matrix
cout<<"\n\n\t***SIMPLE ... | ALGO | 0.999014 | 3.814743 |
10b20f94-0e94-4715-961f-5c3d9d2d18e5 | Alemediii/Fundamentals-of-Programming | examsPractice/2nd partial/CPPFILES/07.endInSufPre.cpp | #include <iostream>
#include <array>
#include <string>
const int N = 15;
using namespace std;
typedef array<string, N> Words;
Words readWords(int& size);
void showWords(Words w, int size);
Words onlyPrefix(Words& w, string a, int& pos, int size);
int main() {
int size = 0, pos = 0;
Words w = readWords(size)... | TOOL | 0.98882 | 4.410868 |
ca18a6b5-d77c-44ba-903b-059a6192cf25 | G3rkul3s/MultiLeap-Computer-Animation-Lab | eigen-3.4.0/unsupported/doc/examples/PolynomialSolver1.cpp | #include <unsupported/Eigen/Polynomials>
#include <vector>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
typedef Matrix<double,5,1> Vector5d;
Vector5d roots = Vector5d::Random();
cout << "Roots: " << roots.transpose() << endl;
Eigen::Matrix<double,6,1> polynomial;
roots_to_mo... | TEST | 0.998832 | 4.668283 |
3b8f7625-0282-416a-941f-30d9edf1cfde | simplefoc/Arduino-FOC-drivers | src/encoders/linearhall/LinearHall.cpp | #include "LinearHall.h"
// This function can be overridden with custom ADC code on platforms with poor analogRead performance.
__attribute__((weak)) void ReadLinearHalls(int hallA, int hallB, int *a, int *b)
{
*a = analogRead(hallA);
*b = analogRead(hallB);
}
LinearHall::LinearHall(int _hallA, int _hallB, int _pp... | TOOL | 0.870464 | 6.411033 |
7d35135f-3128-48cf-b83c-9d876a9d917b | Rafi-Shariar/XPSC | Sheet/week_7/day 02 sat/B_3_palindrome.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int n; cin>>n;
if(n==1) cout<<"a"<<endl;
else if(n==2) cout<<"aa"<<endl;
else if(n==3) cout<<"bba"<<endl;
else
{
int c=0; bool ok = true;
for (int i = 1; i <= n; i++)
{
if(ok) {
cou... | ALGO | 0.999845 | 3.320148 |
154b1b1c-1223-479a-bd69-c2a3671e8855 | MrContreras-Coronel/ViaSonicaMobile | 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 |
75a5410d-6f11-4935-b8d4-348c6d9a9fb2 | sanjiv0286/Leetcode-Problem-Submissions | 2572-append-characters-to-string-to-make-subsequence/2572-append-characters-to-string-to-make-subsequence.cpp | class Solution {
public:
int appendCharacters(string s, string t) {
int n = s.size();
int m = t.size();
int j = 0;
int ans = 0;
for (int i = 0; i < n && j<m; i++) {
if (t[j] == s[i]) {
j++;
}
}
return m - j;
}
}; | ALGO | 0.999964 | 6.177471 |
22ade73f-1a30-4d9f-a2f6-6858073ea760 | jianmingwu/leetcode | twoSum/twoSum.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
vector<int> twoSum(vector<int> &numbers, int target) {
vector<int> v(numbers.size());
vector<int> w(numbers.begin(), numbers.end());
vector<int> vi;
int i, j;
sort(w.beg... | ALGO | 0.999911 | 5.872239 |
8a4afbce-6dfb-4c79-8674-7fb35b20ab4b | saywoo/competitive-programming-note | source/math/catalan-number.cpp |
// 길이 2n 괄호 문자열의 경우의 수
// n+2각형 → n개 삼각형으로 분할하는 경우의 수
// 일반항 : C_n = 1/(n+1) * (2n)C(n)
#include <bits/stdc++.h>
#define MOD 987654321
using namespace std;
typedef long long ll;
ll dp[12345] = {0};
int main(){
int N;
cin >> N;
dp[0] = 1;
for(int i=1; i<=N; i++){
for(int j=0; j<i; j++){
dp[i] += (dp[j]*dp... | ALGO | 0.999991 | 4.715017 |
bf659b00-787b-45b3-9b29-0de6c56d29e3 | bijuli74/CodingNinjas-Competitive-Programming-2023 | Introduction/sorting-searching/insertion sort.cpp | void insertionSort(int *a, int n){
for(int i=1; i<n; ++i){
int cur=a[i], j;
for(j=i-1; ~j; --j){
if(a[j]>cur) a[j+1]=a[j];
else break;
}
a[j+1]=cur;
}
}
| ALGO | 0.999983 | 4.698746 |
e960960d-6023-475e-aee3-d35941399a5c | quangduybk95/Code-C | Cbasic/FinalTest/File17/Bai17.cpp | #include<iostream>
#include<conio.h>
#include<fstream>
using namespace std;
int A[100][100],n,cx[100];
void nhap(){
fstream fi;
fi.open("De_17.txt",ios::in);
fi>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++) fi>>A[i][j];
fi.close();
}
void DFS(int u){
cx[u]=0;
for(int v=0;v<n;v++){
if(cx[v]==1&&A[u][v]==1)
... | ALGO | 0.999955 | 3.182949 |
bc6cbab0-46de-4352-9103-343f4074bf87 | vriddhi1203/GFG_and_Leetcode_solutions | sum_of_all_submatrices_of_given_matrix.cpp | //..............O(N2) solution............//
#include <bits/stdc++.h>
using namespace std;
int main(){
int m,n;
cin>>m>>n;
int arr[m][n];
for(int i=0;i<m;i++){
for(int j=0;j<n;j++)
cin>>arr[i][j];
}
int sum=0;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
sum+=((i+1)*(j+1)*(n-j)*(m-i)*arr[i][j]); //... | ALGO | 0.999979 | 3.854904 |
964db606-5d10-49cc-8b06-fe65675a7928 | alexvonduar/Zynq-Book-Tutorial-Source | sources/hls/tut3C/matrix_mult_test.cpp | #include <iostream>
#include "matrix_mult.h"
using namespace std;
int main(int argc, char **argv)
{
mat_a in_mat_a[5][5] = {
{0, 0, 0, 0, 1},
{0, 0, 0, 1, 0},
{0, 0, 1, 0, 0},
{0, 1, 0, 0, 0},
{1, 0, 0, 0, 0}
};
mat_b in_mat_b[5][5] = {
{1, 1, 1, 1, 1},
{0, 1, 1, 1, 1},
... | TEST | 0.968475 | 5.239229 |
b3528d54-e28c-463f-9d2f-b73835127915 | markbb1957/FFalconSource | src/graphics/3dlib/math.cpp | /*
Note:
----
New Matrix --> Old Matrix ==> new M(i),(j) = old M(i-1),(j-1)
new M11 = old M33 new M12 = old M31 new M13 = old M32
new M21 = old M13 new M22 = old M11 new M23 = old M12
new M31 = old M23 new M32 = old M21 new M33 = old M22
Inverse matrix:
New Matrix --> Old Matrix ==> new M(i),(j) = old M(i+... | ALGO | 0.979479 | 5.616121 |
cb20a710-076b-414b-9c76-d0f8463bc67b | chriswengqi/kattis | chess/chess.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<char> vc;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<dou... | ALGO | 0.999006 | 5.138188 |
3eef2b2c-4686-448f-a38a-1b02a2833b52 | llvm/llvm-project-staging | clang/lib/Sema/SemaConcept.cpp | #include "clang/Sema/SemaConcept.h"
#include "clang/Sema/Sema.h"
#include "clang/Sema/SemaInternal.h"
#include "clang/Sema/SemaDiagnostic.h"
#include "clang/Sema/TemplateDeduction.h"
#include "clang/Sema/Template.h"
#include "clang/Sema/Overload.h"
#include "clang/Sema/Initialization.h"
#include "clang/Sema/SemaInterna... | ALGO | 0.987338 | 7.871264 |
00c99d21-06d6-4372-a9bb-18cf5115a27f | brad0/x265_git | source/common/lowpassdct.cpp | #include "common.h"
#include "primitives.h"
using namespace X265_NS;
/* standard dct transformations */
static dct_t* s_dct4x4;
static dct_t* s_dct8x8;
static dct_t* s_dct16x16;
static void lowPassDct8_c(const int16_t* src, int16_t* dst, intptr_t srcStride)
{
ALIGN_VAR_32(int16_t, coef[4 * 4]);
ALIGN_VAR_32(... | ALGO | 0.942603 | 5.029362 |
2ac2b9cb-20d3-44bf-883c-48f0b078c399 | Yadhu-S/BulletPhysicsPlugin | Source/ThirdParty/BulletPhysicsEngineLibrary/bullet3/examples/ThirdPartyLibs/BussIK/Node.cpp | /*
*
* Mathematics Subpackage (VrMath)
*
*
* Author: Samuel R. Buss, <EMAIL>.
* Web page: http://math.ucsd.edu/~sbuss/MathCG
*
*
This software is provided 'as-is', without any express or implied warranty.
In no event will the authors be held liable for any damages arising from the use of this software.
Permission is gr... | ALGO | 0.880524 | 5.60138 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.