uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
f43f1335-bdcb-472c-b808-4d60453533ab | Lakori4/ESTRUCTURAS-DE-DATOS-Y-ALGORITMOS | Teoría/T3-TIPOS ABSTRACTOS DE DATOS (TAD)/S5 - TAD Y TAD PILA/Hoja 4.cpp | // Santiago Valderrama
#include <iostream>
#include <vector>
#include "Hoja 4.h"
using namespace std;
// Inserta un elemento en la cima de la pila
void Stack::push(int num)
{
shared_ptr<Nodo> elem = make_shared<Nodo>(Nodo(num, nullptr));
if (front != nullptr)
{
elem->setNext(front);
}
fr... | ALGO | 0.998197 | 4.165552 |
51268060-f57b-423f-ad40-83c453246ba8 | yogeswari-123/computer-architecture-lab-work | binary to hexa decimal.cpp | PROGRAM:
#include <stdio.h>
int main() {
int num, binary_num, decimal_num = 0, base = 1, rem;
printf("Enter a binary number: ");
scanf("%d", &num);
binary_num = num;
while (num > 0) {
rem = num % 10;
decimal_num = decimal_num + rem * base;
num = num / 10;
base = base... | ALGO | 0.983726 | 5.419787 |
9067c7d9-8c25-4137-9a40-bec5cdb6b144 | csknk/Sorting-Algorithms | selection-sort.cpp | #include <iostream>
#include <vector>
std::vector<int> v{3,9,5,4,6,6,1};
void printVec(const std::vector<int>& v);
void selectionSort(std::vector<int>& v);
void swap(std::vector<int>& v, size_t a, size_t b);
int main()
{
printf("Selection Sort\n");
printVec(v);
selectionSort(v);
printVec(v);
return 0;
}
void s... | ALGO | 0.999643 | 5.34797 |
5b20d053-d4fe-4ade-845c-5749d881ecaa | abhishek18124/PPCPPJune2024 | Lecture 24/001PermutationSum.cpp | #include<iostream>
#include<vector>
using namespace std;
void generatePermutations(int t, const vector<int>& c, vector<int>& perm) {
// base case
if (t == 0) {
for (int i = 0; i < perm.size(); i++) {
cout << perm[i] << " ";
}
cout << endl;
return;
}
// recursion case
// generate permutations of... | ALGO | 0.999964 | 5.109087 |
782c5dc2-06d3-4caf-aaea-045da3c52404 | alexandrelea/oi-oj-codes | luogu/p2872/prog.cpp | // LG2872 - Building Roads S
// Code by Alexandre Lea
#include <bits/stdc++.h>
using namespace std;
const int N=1e3+5;
int n,m,fa[N];
double x[N],y[N],ans;
vector<pair<double,pair<int,int>>> edge;
int fn(int u){
return fa[u]=fa[u]==u?fa[u]:fn(fa[u]);
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;++i) cin>>x[i]>... | ALGO | 0.999929 | 4.205828 |
5fe6f419-0306-4f5b-bad2-b0100199d2cb | bsuvaan/Homework3_OOP | App3_17/App3_17.cpp | // App3_17.cpp : Этот файл содержит функцию "main". Здесь начинается и заканчивается выполнение программы.
//
#include <iostream>
#include <array>
#include <ctime>
using namespace std;
int SelectFromArray(int* arr_ind, int size)
{
srand(time(0));
int end = size - 1;
int start = 0;
int x = rand() % (e... | TOOL | 0.85708 | 4.252946 |
2a233cd5-c840-481a-9975-5473b9754af0 | BielMandelli/maratona-unioeste | obi/listas-2025/aula-3/light_switches.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio cin.tie(0)->sync_with_stdio(0)
#define endl '\n'
signed main() {
fastio;
ll t;
cin >> t;
while (t--)
{
ll n,k;
cin >> n >> k;
vector<ll> a(n);
ll start = -1;
for... | ALGO | 0.999525 | 4.187966 |
f4009303-6b56-4ec7-a49d-1b85aaceecf8 | ishandutta2007/codeforces | kriii/normal/351/A.cpp | #include <stdio.h>
int C[1000],S,A;
int abs(int x){return x < 0 ? -x : x;}
int main()
{
int N,i,x,y,u;
scanf ("%d",&N);
for (i=0;i<N*2;i++){
scanf ("%d.%d",&x,&y);
C[y]++; S += y;
}
A = 0x7fffffff;
u = N - C[0];
if (u < 0) u = 0;
for (y=N;y>=u;y--){
if (A > a... | ALGO | 0.999173 | 3.165977 |
ee248291-2703-4426-bf89-6150b9dca178 | ishandutta2007/codeforces | riadwaw/normal/150/A.cpp | #include <iostream>
#include <cstdio>
#include <set>
#include <vector>
#include <map>
#include <string>
#include <cstring>
#include <cmath>
#include <memory.h>
#include <algorithm>
#include <cstdlib>
#include <cassert>
using namespace std;
void solve();
#define pb push_back
#define mp make_pair
typedef long long li;
... | ALGO | 0.999883 | 3.369259 |
7578cf2e-5c6a-4bbb-bd4d-5f0433e9fba6 | FelipeFerraz4/Beecrowd | 4_estruturas_e_Bibliotecas/beecrowd_3484_c++_Turma_Dividida.cpp | #include <iostream>
#include <queue>
#include <climits>
using namespace std;
struct Node {
int value;
Node* leftNode;
Node* rightNode;
Node(int value) : value(value), leftNode(nullptr), rightNode(nullptr) {}
};
Node* insert(Node* root, int value) {
if (root == nullptr) {
return new Node(... | ALGO | 0.999938 | 5.760556 |
bf032ab5-5f62-4504-89f4-87685201dcc0 | SharifulCSECoU/Numerical-Method | Source Code/Generalized Newton-Raphson Method.cpp | #include<bits/stdc++.h>
using namespace std;
int degree;
float x,z,sum;
int arr[100];
double fun(double x)
{
sum=0;
z=degree;
for(int i=0;i<=degree;i++)
{
sum+=arr[i]*pow(x,z);
z--;
}
return sum;
}
double infun(double x)
{
sum=0;
z=degree;
for(int i=0;i<=degree;i++... | ALGO | 0.999944 | 3.069216 |
a58fbba6-ee87-47c3-b4eb-0ce73654ccde | Legion-zialot/s-xray16 | Externals/cryptopp/rw.cpp | // rw.cpp - originally written and placed in the public domain by Wei Dai
#include "pch.h"
#include "rw.h"
#include "asn.h"
#include "integer.h"
#include "nbtheory.h"
#include "modarith.h"
#include "asn.h"
#ifndef CRYPTOPP_IMPORTS
#if defined(_OPENMP)
static const bool CRYPTOPP_RW_USE_OMP = true;
#else
static const... | ALGO | 0.997103 | 7.772778 |
60a97410-cb20-47ec-a447-68609839968e | alexandraback/datacollection | solutions_2645486_0/C++/Savlik/main.cpp | #include <cstdlib>
#include <iostream>
#include <vector>
#include <sstream>
#include <iostream>
#include <fstream>
#include <algorithm>
#include <math.h>
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define sqr(x) ((x)*(x))
#define FOR(i,n) for (int i = 0; i < int(n); i++)
... | ALGO | 0.999652 | 3.55836 |
7272a006-cad9-488c-b80d-031541ca6b4d | LuisBarcenas14/Programacion-Competitiva | Otros/prueba sparse table sum.cpp | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int k = 16;
const int N = 1e5;
const int ZERO = 0; // ZERO + x = x + ZERO = x (for any x)
long long table[N][k + 1]; // k + 1 because we need to access table[r][k]
//int Arr[N];
int main()
{
int n, L, R, q;
int Arr[]={18,17,13,19,15,11,20... | ALGO | 0.99989 | 4.265127 |
1ed66d3a-d998-4fb8-b287-c23f9a92380f | yaskev/dinic | main.cpp | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
class ListGraph {
public:
~ListGraph() = default;
explicit ListGraph(int);
void AddEdge(int from, int to, int weight);
void AddOrUpdateEdge(int from, int to, int weight);
int VerticesCount() const { return static_cast<int>... | ALGO | 0.999945 | 5.012283 |
a881034f-0e02-42f7-89bb-769b4d440c34 | Mus2413/LeetCode | 441. Arranging Coins.cpp | class Solution {
public:
int arrangeCoins(int n) {
for (int i = 1;; i++)
{
n = n - i;
if (n < 0)
return i - 1;
else if (n == 0)
return i;
}
}
}; | ALGO | 0.999969 | 6.22546 |
947bdc53-f94f-40fa-8840-f8346dc457a0 | ozzing/boj | ALGO 가자 (스터디)/18주차/1504_특정한 최단 경로.cpp | #include <iostream>
#include <queue>
#include <functional>
#include <cstring>
using namespace std;
#define MAX 805
#define INF 0xffffff
int n, e, a, b, c, v1, v2;
vector<pair<int,int>> node[MAX];
unsigned long long dist[MAX];
void solve(int start){
for (int i=0;i<=n;i++) dist[i] = INF;
priority_queue<pair<int... | ALGO | 0.999593 | 4.145965 |
aaf43d9d-3b25-479b-8998-c25d225af5c6 | KaioGalvao/LinguagemC | Lista 2/exe5 sala.cpp | /* IF - ELSE
Ler 3 valores (A, B e C) e exibir os valores dispostos em ordem crescente.
*/
#include <stdio.h>
#include <locale.h>
#include <stdlib.h>
int main(){
setlocale(LC_ALL,"");
float a = 0, b = 0, c = 0;
printf("Entre com trs valores:\n");
scanf("%f %f %f", &a, &b, &c);
if(a==b &&... | ALGO | 0.999821 | 4.095472 |
9a55f6e0-3139-4bfe-a738-5ab7c7d73c22 | sneha423/DSA | c++/dll3.cpp | // given the head of a doubly linked list. the values of the
// linked list are sorted in increasing order.
// find if there exists a pair of distinct nodes such that sum of their values is x.
// return the pair in the form of [l,r] where l and r are the values stored in the 2 node pointed by pointers.
// if there are... | ALGO | 0.999997 | 5.125269 |
bb32827f-a4b1-413f-93de-8d6e49e7c9e3 | rijulsharma7/problemsolving | codeforces/1562 D1.cpp | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using mi = map<int, int>;
using ml = map<ll, ll>;
using umi = unordered_map<int, int>;
using uml = unordered_map<ll, ll>;
using pi = pair<int, int>;
using... | ALGO | 0.999875 | 4.194538 |
49af9a8b-f4c7-4953-b3ec-4c538306d187 | haitaibrowser/haitaibrowser | third_party/mesa/src/src/glsl/lower_mat_op_to_vec.cpp | /**
* \file lower_mat_op_to_vec.cpp
*
* Breaks matrix operation expressions down to a series of vector operations.
*
* Generally this is how we have to codegen matrix operations for a
* GPU, so this gives us the chance to constant fold operations on a
* column or row.
*/
#include "ir.h"
#include "ir_expression... | TOOL | 0.930953 | 7.351468 |
db1bdf58-5608-4727-b43e-e1f1b216b85c | sufykhan/Codeforces | 279-perfect-squares/279-perfect-squares.cpp | class Solution {
public:
int numSquares(int n) {
vector <int> dp(n+1, INT_MAX);
dp[0] = 0;
for(int sq=1; sq<=n; sq++) {
for(int i=1; i*i<=sq; i++) {
dp[sq] = min(dp[sq], dp[sq-(i*i)]+1);
}
}
return dp[n];
}
}; | ALGO | 0.99996 | 5.634079 |
63e71a0a-4ee2-41d2-92c9-f0ae7fb5ba71 | soonsoo3595/To_Win_Code_Test | 2468.cpp | #include <bits/stdc++.h>
using namespace std;
int N;
int arr[104][104];
int visited[104][104];
int dy[] = { -1, 0, 1, 0 };
int dx[] = { 0, 1, 0, -1 };
int answer = 1;
void go(int y, int x, int height)
{
visited[y][x] = 1;
for (int i = 0; i < 4; i++)
{
int ny = y + dy[i];
int nx = x + dx... | ALGO | 0.999628 | 4.539903 |
a5d7bc6f-db3c-49f2-93df-5cfd918eb8c7 | enuiii/Algorithms | sem_2/lab14.cpp | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
// Функция для вычисления хеша строки
unsigned long long calculateHash(const std::string& str, int start, int end, int prime) {
unsigned long long hashValue = 0;
for (int i = start; i <= end; ++i) {
hashValue = (hashValue * prime ... | ALGO | 0.999989 | 6.440509 |
519c9fd2-8deb-4126-bdd9-608556e8d7a9 | sathishkumarg5024/Data-Structures-and-Algorithm-Master-Course-Supreme-Batch | Functions_5th February 2023/Function_order.cpp | #include<iostream>
using namespace std;
int add(int a,int b); // function declaration
int main(){
cout<<add(2,3); // function invoke
return 0;
}
int add(int a,int b){ // function defintion
return (a+b);
} | TOOL | 0.990107 | 4.628286 |
de323f93-212a-454c-b364-af5d81b0402b | cdq9509/AlgoCpp101 | LongestPalindromicString.cpp | /*
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
Example:
Input: "babad"
Output: "bab"
Note: "aba" is also a valid answer.
Example:
Input: "cbbd"
Output: "bb"
*/
#include <vector>
#include <string>
#include <iostream>
using namespace std;
cl... | ALGO | 0.999862 | 6.023395 |
499910e1-770a-4c5c-b033-6c057ab2d5ee | RoblabWh/ROSHAN | src/firespin/particles/virtual_particle.cpp | //
// Created by nex on 11.06.23.
//
#include "virtual_particle.h"
VirtualParticle::VirtualParticle(int x, int y, double tau_mem, double Y_st,
double Y_lim, double Fl, double C0, double Lt)
{
for (double & i : U_) {
i = 0.0;
}
X_[0]... | ALGO | 0.987013 | 5.343869 |
e91912bd-29ff-4723-8ce6-57668dc71f47 | Shakibul-Islam/Codeforces | Code_Before_Git-Hub_Account/Prefix and Suffix Array.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define all(vsa) vsa.begin(),vsa.end()
#define f0_n for(int i=0;i<n;i++)
#define f0_n1 for(int iiii = 0;iiii<nnnn-1;iiii++)
#define f1_n for(int ii=1;ii<nn;ii++)
#define pb(a) push_back(a)
#define arraylength(v) end(v)-begin(v)
#define no cout<<"NO\... | ALGO | 0.999684 | 3.9578 |
4db3ac42-e893-4148-99ed-02d354298af3 | andreaswanninger/Kratos_conservative_levelset-contact_line | applications/PFEM2Application/custom_conditions/fixed_velocity_3d.cpp | // Project includes
#include "includes/define.h"
#include "custom_conditions/fixed_velocity_3d.h"
#include "pfem_2_application_variables.h"
#include "utilities/math_utils.h"
namespace Kratos
{
//************************************************************************************
//**********************************... | ALGO | 0.996982 | 4.230227 |
b9824898-0d9a-4125-a10d-a2c68e7f6a1a | Achiever-CN/Data_structure | src/year_month_day.cpp | #include <iostream>
using namespace std;
class Date
{
protected:
int year, month, day;
int days_month[12] = {31,28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
public:
Date(int n1, int n2, int n3);
void show();
};
//жǷ꣬·
Date :: Date(int n1,... | ALGO | 0.98922 | 3.798598 |
05f480cc-b574-4ffe-9b61-d34d47ae8871 | peacock08/CPP-Program | xaudoixung1.cpp | #include <bits/stdc++.h>
using namespace std;
int trengu(char s[], int n)
{
int mang[n][n], p, q, dis;
memset(mang, 0, sizeof(mang));
for (dis = 1; dis < n; ++dis)
for (p = 0, q = dis; q < n; ++p, ++q)
mang[p][q] = (s[p] == s[q]) ? mang[p + 1][q - 1] : (min(mang[p][q - 1], mang[p + 1][q... | ALGO | 0.999894 | 4.242929 |
bd8202ff-152e-4386-8636-c5cb004799a6 | yashparmar15/Cpp-Codes | Arithmetic_Slices_II.cpp | /*A sequence of numbers is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
For example, these are arithmetic sequences:
1, 3, 5, 7, 9
7, 7, 7, 7
3, -1, -5, -9
The following sequence is not arithmetic.
1, 1, 2, 5, 7
A zero-indexed a... | ALGO | 0.999734 | 5.558383 |
00ee9009-e4cd-4e9d-bb44-f2028dad8d56 | gitHubwhl562916378/opencv4.3 | opencv_contrib-4.3.0/modules/hfs/src/merge/merge.cpp | #include "../precomp.hpp"
#include "merge.hpp"
using namespace std;
namespace cv { namespace hfs {
Ptr<RegionSet> egb_merge(int num_vertices, int num_edges,
vector<Edge> &edges, float c, vector<int> size)
{
sort(edges.begin(), edges.end());
Ptr<RegionSet> regions(new RegionSet(num_vertices, size));
... | ALGO | 0.999753 | 5.019629 |
129cc3ba-53dd-439c-ab68-a8047822362a | Darian-Mello/ciencia_computcao | 1_semestre/If-algoritmos/exercícios1/seln35.cpp | #include <iostream>
using namespace std;
main(){
setlocale(LC_ALL,"portuguese");
int num;
cout << "informe o nmero: \n";
cin >> num;
if ((num % 2) == 0)
cout << "o numero par";
else
cout << "o numero impar";
}
| ALGO | 0.997458 | 3.522326 |
9a2f3be0-9970-4c93-ade5-2378144133d7 | elinorq/dsa | week3/SOURCE/algorithms/source/shakerSort.cpp | #include "../header/shakerSort.h"
template<class T>
void shakerSort(std::vector<T>& array, size_t& count_comparison)
{
//cài đặt hàm shakerSort
int start = 0; // biến giữ vị trí biên trái
int End = array.size() - 1; // biến giữ vị trí biên phải
// tương... | ALGO | 0.999782 | 4.638499 |
477bfbbf-44d8-437a-97b8-c98d34653b13 | liehendi11/cpsource | pot_game.cpp | #include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <cstring>
using namespace std;
vector<int> dpSum;
vector<int> num;
int dp[100][100];
int n;
void createDpSum()
{
int sum = 0;
for (int i=0; i<num.size(); i++)
{
sum += num[i];
dpSum.push_back(sum);
}
}
int findSum(int a, int b)
{
int left = ... | ALGO | 0.999951 | 3.780262 |
299fdf08-8d57-40b7-b758-c66df6cee4bc | nishikantparmariam/Data-Structures-and-Algorithms-C-CPP | dp/dp19.cpp | //BOX STACKING
#include <bits/stdc++.h>
using namespace std;
struct myComp {
bool operator()(const vector<int> &a, const vector<int> &b){
return (a[1]*a[2] < b[1]*b[2]);
}
};
bool myCompFunc(const vector<int> &a, const vector<int> &b){
return (a[1]*a[2] < b[1]*b[2]);
}
int main(){
vector<... | ALGO | 0.999659 | 3.921596 |
7b01783c-e3a9-4984-8461-451bc568ce70 | sahuankit010/LeetCode-Solutions | 12. Non Repeating Character - GFG/12.-non-repeating-character.cpp | // { Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
//Function to find the first non-repeating character in a string.
char nonrepeatingCharacter(string s)
{
//Your code here
int arr[26]={0};
for(int i=0;i<s.size();i... | ALGO | 0.999819 | 4.992647 |
4c534b70-ccb6-4ed4-9850-0002824f402a | SergeBychkov/Problems | HackerRank/Solved/Algorithms/Strings/SherlockAndTheValidString.cpp | //https://www.hackerrank.com/challenges/sherlock-and-valid-string/problem?isFullScreen=true
#include <print>
#include <vector>
#include <algorithm>
#include <ranges>
#include <numeric>
#include <chrono>
#include "print_utils.h"
#include "random_utils.h"
using namespace std;
namespace {
string isValid(string s) {
... | ALGO | 0.9999 | 5.362713 |
87c8e6eb-15df-40ba-9d85-45cb34b37c65 | ishandutta2007/codeforces | timsei/normal/841/B.cpp | #include<bits/stdc++.h>
using namespace std;
const int N = 2000005;
#define int long long
int n , a[N] , S[N];
int sum;
main() {
scanf("%lld",&n);
for(int i = 1;i <= n;i ++) scanf("%lld",&a[i]);
for(int i = 1;i <= n;i ++) S[i] = a[i] + S[i - 1];
if(S[n] % 2 == 1) {
puts("First");
return 0;
}
bool flag = 0... | ALGO | 0.999993 | 4.191465 |
94430cb0-d3eb-4810-995b-eaf1ccdaa09d | blcksec/usd | pxr/base/gf/matrix.template.cpp | {#
#include "pxr/pxr.h"
#include "pxr/base/gf/matrix{{ DIM }}d.h"
#include "pxr/base/gf/matrix{{ DIM }}f.h"
#include "pxr/base/gf/math.h"
#include "pxr/base/gf/ostreamHelpers.h"
#include "pxr/base/tf/type.h"
{% block customIncludes %}
{% endblock customIncludes -%}
#include <float.h>
#include <ostream>
PXR_NAMESPA... | ALGO | 0.947684 | 6.19402 |
bbe64444-923d-4dc9-afc5-3948487aeed3 | prince2398/CN_lab | 6.distanceVector/distanceVector.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cout<<"Enter the number of nodes in the network: ";
cin>>n;
vector<vector<int>> distTable(n+1, vector<int> (n+1, 10000));
for(int i=1; i<=n; i++){
int childs;
cout<<endl;
cout<<"Enter the number of nodes connec... | ALGO | 0.999753 | 4.182431 |
53551fa3-2f31-4234-b46a-1c7a4f77b9c5 | hzhuarry/Competitive-Programming | USACO/Training Pages/Chapter 2/Section 2.1/holstein.cpp | #/*
ID: hzhu7271
LANG: C++
TASK: holstein
*/
#include <bits/stdc++.h>
using namespace std;
int V, G, ans = 15;
int vitamins[25], type[15][25];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ifstream cin("holstein.in");
ofstream cout("holstein.out");
cin >> V;
for(int i=0; i<V; ++i)... | ALGO | 0.999993 | 3.464456 |
0c5896c5-3725-4e14-a415-42d8a6d330a2 | ishandutta2007/codeforces | aid/normal/949/D.cpp | #ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#else
#define eprintf(...) ;
#endif
#define sz(x) ((int) (x).size())
#define TASK "text"
const int inf = (int) 1.01e9;
con... | ALGO | 0.999907 | 3.8172 |
e4090253-9f96-45c7-a2d5-07f144ed5f80 | devkhan/SchoolOfCode | Devesh/Dynamic array stack.cpp | //Program to implement stack operations using dynamic arrays.
#include<iostream.h>
class stack
{
int *a;
int p,size;
public:
stack(int n)
{
size=n;
a= new int[size];
p=-1;
}
int push(int n)
{
if(p==(size-1))
return 0;
p++;
a[p]=n;
return 1;
}
int pop()
{
int ele;
if(p==-1)
return 0... | ALGO | 0.99886 | 5.235629 |
8042f275-19f9-4f9e-b74b-152819edd86b | Seyamalam/Codeforces | 1300-1500/1364 a. xxxxx.cpp | //Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
using namespace std;
int main()
{
fastread();
int t,n,x,a[100001];
cin>>t;
while(t--)
{
... | ALGO | 0.999771 | 3.462002 |
21244b06-c9e7-4d62-bd17-75c52bd49105 | mardecode/arbolito | arbol.cpp | #include "Arbol.h"
Arbol::Arbol(vector<string> e)
{
this->expresion = e;
}
void Arbol::borrar_ultimo(){
this->expresion.pop_back();
}
string Arbol::ultimo(){
return this->expresion.back();
}
Nodo * Arbol::next(Nodo * n){
if(this->is_operador(ultimo())){
if (is_binario(ultimo())){
... | ALGO | 0.999463 | 3.818319 |
4307d88f-243d-4e73-b2cd-c1161b83e90d | shreyshukla29/DSA-SHEET | Array Part- 3/Pow(x,n).cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
double myPow(double x, int n) {
double pow=1.0;
long long nn =n;
if(n<0) nn= -1*nn;
while(nn>0){
if(nn%2){
pow = pow*x;
nn =nn-1;
}else{
x = x*x;
nn= nn/2;
}
... | ALGO | 0.999628 | 5.15638 |
cca1a8fa-4e78-4cea-8cd4-747ca0f66e30 | romanus/UniversityLabs | Architecture of Computer System/ComputerSimulationModel/classes.cpp | #include "classes.h"
#include <iostream>
#include <string>
#include <math.h>
Register::Register()
{
this->InitializeComponents();
}
void Register::InitializeComponents()
{
for (int i = 0; i < N; ++i)
value[i] = 0;
}
void Register::SetValue(std::string value)
{
int num = std::stoi(value);
bool isMinus = (num < ... | TOOL | 0.862042 | 3.630679 |
3ec64439-5db0-45b1-beb1-96ae1f925c0f | ishandutta2007/codeforces | uwu/normal/1368/B.cpp | #include <bits/stdc++.h>
//#pragma GCC optimize ("Ofast")
using namespace std;
#define ms(x,a) memset(x,a,sizeof x)
typedef long long ll;
typedef pair<int,int> pii;
const int mod=1e9+7,seed=131,MAXN=0;
int main(){
cin.tie(0); cin.sync_with_stdio(0);
ll n; cin >> n;
ll tot=1;
ll arr[10]={1,1,1,1,1,1,1,... | ALGO | 0.999951 | 3.623288 |
c956671d-b392-4439-b61a-82d4c9de5b2a | TheTrustyPwo/CP | CodeBreaker/milkweed2.cpp | #include <bits/stdc++.h>
using namespace std;
#define range(it, start, end) for (int it = start; it < end; it++)
#define revrange(it, start, end) for (int it = start; it > end; it--)
#define setup() ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
const int dir1[4][2] = {{0,1}, {0,-1}, {1,0}, {-1,0}};
const i... | ALGO | 0.999732 | 3.934753 |
cb9b9164-5213-4d46-9d23-84a495f34d61 | batman-rises/Striver-s-A-to-Z-DSA-SHEET- | RECURSION/moderate/subsequences/with_sum_K.cpp | void solve(int i, vector<int> &ds, vector<vector<int>> &res, int sum, int k, vector<int> arr, int n)
{
if (sum > k)
return;
if (i == n)
{
if (sum == k)
{
res.push_back(ds);
}
return;
}
// pick
ds.push_back(arr[i]);
sum += arr[i];
solve... | ALGO | 0.999968 | 4.381679 |
35f4dfa2-0869-4d23-8215-c60182fb1a77 | Lesords/ACM | codeforces/contests/Div3/Codeforces Round #734 (Div. 3)/D2.cpp | #include<iostream>//ac
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<utility>
#include<algorithm>
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define ll long long
#define INF 0x3f3f3f3f
#define pi... | ALGO | 0.999889 | 3.66888 |
d2c95797-2df9-45b1-ae92-5d0275b4ceb8 | ttran293/practical_image_processing_course | 7_edge_detection/ImageProcessingLib -Sobel-EdgeDetection/src/ImageProcessing.cpp | #include "ImageProcessing.h"
using namespace std;
ImageProcessing::ImageProcessing(
const char *_inImgName,
const char *_outImgName,
int * _height,
int * _width,
... | TOOL | 0.903106 | 4.098575 |
71fbfc81-0b03-43dc-aaa6-fd6b2f8668d3 | showmic96/Online-Judge-Solution | SPOJ/HS12HDPW/16167091_AC_10ms_15360kB.cpp | // In the name of Allah the Most Merciful.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> get(int x)
{
vector<int>temp;
while(x){
temp.push_back(x%2);
x/=2;
}
if(temp.size()!=6)temp.push_back(0);
return temp;
}
int re(vector<int>v)
{
reverse... | ALGO | 0.999814 | 3.930043 |
c1476565-6d87-4016-92ac-9dd7ad148a77 | raincross7/code-similarity | codes/train_code/problem276/problem276_375.cpp | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int A,B,M;
... | ALGO | 0.999975 | 3.910625 |
3b051cd0-b096-4eb6-8ade-a766a68db4c7 | izenecloud/sf1r-lite | source/core/search-manager/ZambeziSearch.cpp | #include "ZambeziSearch.h"
#include "ZambeziFilter.h"
#include "ZambeziScoreNormalizer.h"
#include "SearchManagerPreProcessor.h"
#include "Sorter.h"
#include "QueryBuilder.h"
#include "HitQueue.h"
#include <la-manager/AttrTokenizeWrapper.h>
#include <la-manager/TitlePCAWrapper.h>
#include <query-manager/SearchKeywordOp... | ALGO | 0.979543 | 5.234891 |
3f2c4e9c-6a05-4a44-88a9-d49c996cfa83 | LeeHann/algorithm | Programmers/lv.0/배열의 유사도.cpp | #include <string>
#include <vector>
using namespace std;
int solution(vector<string> s1, vector<string> s2) {
int answer = 0;
for (int i=0; i < s1.size(); i++)
{
for (int j=0; j < s2.size(); j++)
{
if (s1[i] == s2[j])
answer++;
}
}
return answer;... | ALGO | 0.999262 | 4.813114 |
2ee3539a-40aa-4c10-9114-c92159da6c0d | junhyeongkim2/SW-Maestro-154algorithm | JH/DAY9/1406.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
int n;
cin >> s;
cin >> n;
stack<char>l;
stack<char>r;
for (int i = 0; i <s.length() ; ++i) {
l.push(s[i] );
}
while(n--){
... | ALGO | 0.999811 | 3.919015 |
be1f95c8-4b01-4f79-b888-488211ee333c | oguzhanertekin/Employee-Recording-System | src/CircularArrayLinkedList.cpp | #include "CircularArrayLinkedList.h"
#include <string>
CircularArrayLinkedList::CircularArrayLinkedList(){
current=0;
head=-1;
last=-1;
for (int i=0;i<MAX;i++) {
cnode[i].next=-1;
}
}
CircularArrayLinkedList::~CircularArrayLinkedList() {}
bool CircularArrayLinkedList::ifExist(int id){
... | TOOL | 0.972161 | 3.633208 |
e4dc2429-c804-43f5-a7b4-92dacc13120b | StavrosChryselis/hackerrank | Warmup/Compare the Triplets.cpp | /*
****************************************************************
****************************************************************
-> Coded by Stavros Chryselis
-> Visit my github for more solved problems over multiple sites
-> https://github.com/StavrosChryselis
-> Feel free to email me at <EMAIL>
****... | ALGO | 0.999762 | 3.665016 |
6b7f5ea7-62ff-4af0-94de-7533d6a91af2 | TuiTenVan/CTDL-GT | 06047.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int t; cin >> t;
while(t--){
int n; cin >> n;
long long a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a, a + n);
int ok = 0;
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
long long k = a[i] * a[i] + a[j] * a[j];
... | ALGO | 0.99992 | 4.524163 |
15d63672-a2b9-417b-a0b0-5ebfee7f5d7a | mvaisakh/external_skia | src/pathops/SkOpEdgeBuilder.cpp | #include "SkGeometry.h"
#include "SkOpEdgeBuilder.h"
#include "SkReduceOrder.h"
void SkOpEdgeBuilder::init() {
fOperand = false;
fXorMask[0] = fXorMask[1] = (fPath->getFillType() & 1) ? kEvenOdd_PathOpsMask
: kWinding_PathOpsMask;
fUnparseable = false;
fSecondHalf = preFetch();
}
// very t... | ALGO | 0.98302 | 7.248971 |
c1f8b807-7d5e-464a-830d-d527f44fa839 | nhywieza/acm-icpc | code/51nod/p1052.cpp | /*************************************************************************
> File Name: p1052.cpp
> Author: nhywieza
> Mail: <EMAIL>
> Created Time: 四 11/19 19:03:50 2015
************************************************************************/
#include <cstdio>
#include <cstring>
#include <cstdlib>
... | ALGO | 0.99999 | 3.463392 |
a28e9222-4303-4feb-8228-7700e8135405 | NurlanTanatar/AlgoDataStruct | lab2_c++/A.cpp | #include <iostream>
#include <string>
#include <map>
#include <set>
using namespace std;
string rm_space(string str)
{
string word = "";
for (auto x : str)
{
if (x == ' ')
{
return word;
word = "";
}
else {
word = word + x;
}
... | ALGO | 0.99944 | 4.401548 |
733b3da0-9ab6-448d-bafb-806ab9f784c0 | Jhosephu/02_ordenacion | InterSelecDir.cpp | #include <iostream>
using namespace std;
void intSelecDir (int, int);
nt main(){
int x[100], n;
cout<<"ingrese la cantidad de elementos para el arreglo: "; cin>>n;
cout<<"ingrese los numeros del arreglo: ";
for(int i=0; i<n; i++){
cin>> x[i];
}
intSelecDir(x, n);
return 0;
}
void intSelecDir (int, int){
i... | ALGO | 0.999467 | 3.870351 |
e136ded0-88ec-44ba-a277-703b36cc803a | aarindey/Leetcode-Solution-By-aarindey | 2218-maximum-value-of-k-coins-from-piles/2218-maximum-value-of-k-coins-from-piles.cpp | class Solution {
public:
int n;
int recurse(int i,int j,vector<vector<int>> &v,int k,vector<vector<int>> &dp)
{
if(i==n)
return 0;
if(k==0)
return 0;
if(j==0 && dp[i][k]!=-1)
return dp[i][k];
int ans=0;
if(j+1<v[i].size())
ans=... | ALGO | 0.999928 | 5.511065 |
5b0eb444-42a1-4010-8fcf-9ba64a400201 | GilMM27/OMI | Tareas/B/main.cpp | #include <iostream>
using namespace std;
int main()
{
long long a,b;
cin>>a>>b;
cout<<a*b;
return 0;
}
| ALGO | 0.967189 | 3.455718 |
cfeb4bb3-596f-4c18-9f01-7cce169bd402 | Venkatramanbehera/DSA-CPP | bitfor/output3for.cpp | #include <iostream>
using namespace std;
int main()
{
for (int i = 0; i <= 5; i++)
{
for (int j = i; j <= 5; j++)
cout << i << " " << j << endl;
}
} | ALGO | 0.989329 | 3.161901 |
b5f06435-05a7-4add-9ea9-5aa7a4927a7c | l5h6y7lhy/leetcode | 241-Different-Ways-to-Add-Parentheses/dynamic_programming.cpp | class Solution {
public:
vector<int> diffWaysToCompute(string expression) {
string num = "";
vector<int> nums;
for (int i = 0; i < expression.size(); i++) {
if (expression[i] >= '0' && expression[i] <= '9') {
num += expression[i];
}
else {... | ALGO | 0.999983 | 6.17907 |
4ca6dcac-1151-4fa7-8c23-b65c0d27e46c | Xiehuaiqi/Exercise_C | 类和面向对象/点与圆main.cpp | //
// Created by zx on 19-7-19.
//
//
// Created by zx on 19-7-19.
//
#include "point.h"
#include "circle.h"
//判断点与圆的关系
void isInCircle(Circle &c, Point &p){
int distance = (c.getCenter().getX() - p.getX()) * (c.getCenter().getX() - p.getX()) + (c.getCenter().getY() - p.getY()) * (c.getCenter().getY() - p.getY()... | ALGO | 0.996742 | 4.131658 |
6aee0511-61be-4efc-a3da-b6cb1dec3867 | paulo-cardoso71/Tarefas-Lddm | tarefa6/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.997683 | 6.786404 |
18365fa6-a8c0-42a7-a144-6f82270b8031 | akashiitj/dsaprogram | circularqueue.cpp | #include<iostream>
using namespace std;
int ml;
class cq
{
public:
int f=1,r=1,q[155555];
int addone(int no)
{
return((no%ml)+1);
}
int isempty()
{
if(f==r)return true;
else return false;
}
int isfull()
{
if (addone(r)==f)return true;
else fals... | ALGO | 0.996313 | 3.591988 |
432a74bf-e6be-4f80-8160-59531bec88b9 | HodongMan/professional-cpp-4th-ed | c22_code/13_Folding/03_sumValues.cpp | #include <iostream>
using namespace std;
template<typename T, typename... Values>
double sumValues(const T& init, const Values&... values)
{
return (init + ... + values);
}
int main()
{
cout << sumValues(1, 2, 3.3) << endl;
cout << sumValues(1) << endl;
return 0;
}
| ALGO | 0.990027 | 5.094596 |
5e8db53f-e05a-4b12-b8ea-a157b5f15285 | skJack/Leetcode | 排序/*（经典并归改）面试题51. 数组中的逆序对.cpp | /*
在数组中的两个数字，如果前面一个数字大于后面的数字，则这两个数字组成一个逆序对。输入一个数组，求出这个数组中的逆序对的总数。
示例 1:
输入: [7,5,6,4]
输出: 5
限制：
0 <= 数组长度 <= 50000
*/
class Solution {
public:
//方法一：暴力超时
int reversePairs1(vector<int>& nums) {
int len = nums.size();
int ans = 0;
for(int i=0;i<len;i++)
{
for(int ... | ALGO | 0.999968 | 5.03424 |
d5032cf9-5758-4d5e-8f3f-e1899d3a707c | anika107/contest | bacs_2018/vector_2d_s1.cpp | #include <bits/stdc++.h>
using namespace std;
vector <vector <int>> v;
vector <pair <int , int>> pr;
int main(){
int t;
cin >> t;
int cs = 0;
while(t --){
int n, s, e, e_max = 0, p;
int c = 0, cnt, cnt_min = INT_MAX;
cin >> n >> p;
int d = n;
//int f = 1;
while(n --){
cin... | ALGO | 0.999595 | 3.71262 |
689969f4-e32a-4f9d-adb3-4e65cfa2d052 | molloy-lab/Dollo-CDP | src/boost_1_80_0/libs/xpressive/perf/time_static_xpressive.cpp | #include "./regex_comparison.hpp"
#include <map>
#include <cassert>
#include <boost/timer.hpp>
#include <boost/xpressive/xpressive.hpp>
namespace sxpr
{
using namespace boost::xpressive;
// short matches
char const * sz1 = "^([0-9]+)(\\-| |$)(.*)$";
sregex rx1 = bol >> (s1= +range('0','9')) >> (s2= as_xpr('-')|' '|e... | TEST | 0.924137 | 5.561827 |
f8c46dc5-4138-475f-a16e-768e125ed324 | rakibulhasan044/DSA-Striver-Sheet | maths/cppCode/printAllDivisor.cpp | #include <iostream>
#include <vector>
// #include <algorithm>
using namespace std;
int main() {
int n = 36;
vector<int> ls;
for(int i = 0; i*i <= n; i++ ) {
if(n % i == 0) {
ls.push_back(i);
if(n / i != i) {
ls.push_back(n / i);
}
}
... | ALGO | 0.999613 | 3.841138 |
0b1bb311-fd36-4b0f-9b9d-0321f0a0c86c | manikanta2901/ubuntu | .history/random/trees/QuerySum_20200729143644.cpp | #include<iostream>
using namespace std;
#define n 10000
int n,arr[n],t[4 * n];
int main(){
cout << "Enter the size \n";
cin >> n;
cout << "Enter the elements of the array\n";
return 0;
} | ALGO | 0.980292 | 3.081398 |
4a4ecb00-702f-489b-b46b-cbc4a36b7b97 | Ziklon/algorithms | tju/2637.cpp | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | ALGO | 0.999789 | 4.012908 |
be123041-3bff-4148-b7ed-dc6ac9f60885 | yousuf-cse-bd/RandomCodes | GetLargestValueNaiveApproach.cpp | /**
* @file GetLargestValueNaiveApproach.cpp
* @author your name (<EMAIL>)
* @brief
* @version 0.1
* @date 2022-06-17
*
* @copyright Copyright (c) 2022
*
*/
#include <iostream>
using namespace std;
int getLargest(int Arr[], int n)
{
int largest = 0;
for(int i = 1; i<n; i++)
{
if(Arr[i] ... | ALGO | 0.999849 | 4.821546 |
27853a00-e13d-4100-86ef-4c32e0fb263f | Farhinarius/cplusplus-programs | Task from book/Algebraic_sum.cpp | // Algebra_summ;
// options;
#include <iostream>
#include <cmath>
#include <iomanip>
#include <string>
using namespace std;
//////////////////////////////////////////////////
int main()
{
/// - variables creation ///
int num; // number of elements in equation
int y = 0;
int x = 0; // init v... | ALGO | 0.975239 | 3.382416 |
433a5ba1-c3ad-4c38-859e-7d1873c53e94 | ankur-kayal/Contests | codeforces/1547/F.cpp | #include <bits/stdc++.h>
using namespace std;
#define nl '\n'
struct segment_change {
int64_t to_set;
static const int64_t SENTINEL = -1;
// Make sure that the default constructor is the identity segment_change
segment_change(int64_t _to_set = SENTINEL) : to_set(_to_set) {}
// resets to the SENT... | ALGO | 0.999496 | 5.314731 |
5288e3a8-c4e2-4416-b7b1-46cae899dda3 | Akash-Nimbalkar/CPP-Programming | 07_C++ Operator Overloading/4_Rational_Overloading.cpp | #include <iostream>
using namespace std;
class Rational
{
private:
int p;
int q;
public:
Rational(int p = 1, int q = 1)
{
this->p = p;
this->q = q;
}
int getP()
{
return p;
}
int getQ()
{
return q;
}
int setP(int p)
{
this->p =... | TOOL | 0.937288 | 5.092535 |
541525bc-075a-4691-80a8-ab7b762d7a5d | lisemi/CPP-Practice | 10-Design-Patterns/3-Interpreter .cpp | #include <iostream>
using namespace std;
// 解释器使用的一些全局信息
class Context {
public:
Context(int num) {
m_num = num;
}
int getNum() {
return m_num;
}
int getRes() {
return m_res;
}
void setNum(int num) {
m_num = num;
}
void setRes(int res) {
m_res = res;
}
private:
int m_num;
int m_res;
};
class Exp... | TOOL | 0.926054 | 4.437676 |
fce9153e-70ab-4fc1-ac99-3adf6afd7910 | ssj-gz/Competitive-Programming | hackerrank/determining-dna-health.cpp | #define SUBMISSION
#ifdef SUBMISSION
#define NDEBUG
#endif
#include <cmath>
#include <cstdio>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <memory>
#include <limits>
#include <cassert>
using namespace std;
/**
* ... | ALGO | 0.999027 | 5.577362 |
f24c1a16-4402-449f-a5cc-51bdaeb1ae96 | bankercoins/banker-coinsrc | src/miner.cpp | #include "txdb.h"
#include "miner.h"
#include "kernel.h"
#include "kernel_worker.h"
using namespace std;
//////////////////////////////////////////////////////////////////////////////
//
// BitcoinMiner
//
int64_t nReserveBalance = 0;
static unsigned int nMaxStakeSearchInterval = 60;
uint64_t nStakeInputsMapSize = 0... | ALGO | 0.997238 | 4.431594 |
f73517cf-cd0b-427a-904d-2787a4d7fb77 | orientnab/pathfinding | src/read_map.cpp | #include "graph.hpp"
#include "program_input.hpp"
#include "read_map.hpp"
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
char UNCROSSABLE_NODE = 'x';
void parse_file(const std::string& filename,
std::vector<std::vector<char>> & map_representation);
void build_graph(std::vec... | ALGO | 0.997551 | 4.585723 |
41401ec5-ba4c-4496-894c-2c8a8860af77 | VaishnavShelke/DS-Algo | Binary Trees/The sum of nodes in the longest path between root to leaf.cpp | #include <iostream>
#include <bits\stdc++.h>
#define N 9
using namespace std;
// The sum of nodes in the longest path between root to leaf
struct Node {
int data;
Node* left, *right;
};
Node* getNode(int data)
{
Node* newNode = (Node*)malloc(sizeof(Node));
newNode->data = data;
newNode->left = ... | ALGO | 0.999983 | 4.750258 |
9f6de42b-b92c-421b-a922-1e4d2129dfe3 | Ankit0225/Leetcode-and-gfg-solution | Substrings of length k with k-1 distinct elements - GFG/substrings-of-length-k-with-k1-distinct-elements.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function Template for C++
class Solution {
public:
int countOfSubstrings(string S, int K) {
// code here
unordered_map<char,int> mp;
int i=0,j=0,count=0,res=0;
while(j<S.length())
... | ALGO | 0.999721 | 6.2251 |
f473450b-0c6f-4247-9ac6-2e465fdc1c1a | arpy8/CPP_Journey | Code/important-algorithms/leap-year-check.cpp | #include <iostream>
using namespace std;
int main()
{
int year;
cout << "Leap Year checker!\n";
cout << "Enter year: ";
cin >> year;
if (year % 4 == 0)
if (year % 100 == 0)
if (year % 400 == 0)
cout << year << " is a leap year";
else
cout << year << " is not a leap year";
else
cout << yea... | ALGO | 0.991518 | 3.292714 |
6b5e9934-b34d-451e-b127-6262eed2867e | drameyjoshi/am | speed-dating/bgl4.cpp | #include <chrono>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/max_cardinality_matching.hpp>
#include "Partici... | ALGO | 0.972138 | 4.341515 |
b7d0c3af-a2be-4250-a7d9-4ffc1fa2cd44 | raynorpat/cake3 | code/libs/bullet/BulletCollision/Gimpact/gim_box_set.cpp | #include "gim_box_set.h"
GUINT GIM_BOX_TREE::_calc_splitting_axis(
gim_array<GIM_AABB_DATA> & primitive_boxes, GUINT startIndex, GUINT endIndex)
{
GUINT i;
btVector3 means(btScalar(0.),btScalar(0.),btScalar(0.));
btVector3 variance(btScalar(0.),btScalar(0.),btScalar(0.));
GUINT numIndices = endIndex-startIndex;... | ALGO | 0.99994 | 6.166751 |
198f402b-9f86-426d-9ff1-e15d286bd705 | sudipto0315/MyPrograms | C++Codes/vectors/countOddSumSequences.cpp | #include <iostream>
#include <vector>
using namespace std;
int countOddSumSequences2(vector<int>& arr) {
int count = 0;
int sum = 0;
for (int i = 0; i < arr.size(); i++) {
sum = 0; // Reset sum for each new sequence
for (int j = i; j < arr.size(); j++) {
sum += arr[j];
... | ALGO | 0.999846 | 5.64929 |
eb5a83af-ac68-40a7-8f40-ed48da30fb84 | ishandutta2007/codeforces | igori/normal/1473/D.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
int n, m;
cin >> n >> m;
string s;
cin >> s;
s = "0" + s + "0";
n += 2;
vector<int> pr(n), prmx(n), prmn(n);
vector<int> su(n), sumx(n), sumn(n);
for (int i = 1; i < n; i++)
{
if (s[i] =... | ALGO | 0.999994 | 4.110852 |
be75c1aa-3f51-4c72-962b-97111c3f6913 | slovoulo/InterIntel-Technologies-LTD | 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.998762 | 6.786404 |
812646a5-3aef-4ce4-930c-c9de71e002a7 | Himanshu07-debug/Competitive-Programming | 02-Time Complexity/Problem-12.cpp | // Once upon a time, bartender Decim found three threadlets and a pair of scissors.
// In one operation, Decim chooses any threadlet and cuts it into two threadlets, whose lengths are positive integers and their sum is
// equal to the length of the threadlet being cut.
// For example, he can cut a threadlet of length... | ALGO | 0.999968 | 5.312112 |
037c3b64-eac5-4209-95d9-01954d4a2cfb | Harsh23Kashyap/LeetCode | 213-house-robber-ii/213-house-robber-ii.cpp | class Solution {
public:
int rob(vector<int>& nums)
{
vector<int> m(nums.size()-1,0);
if(nums.size()==1) return nums[0];
if(nums.size()==2) return max(nums[0],nums[1]);
//HOUSE 1 to n-1
m[0]=nums[0];
m[1]=nums[1];
for(int i=2;i<nums.size()-1;i++)... | ALGO | 0.999914 | 5.335879 |
a7f14d40-1ff2-4983-9953-3ac51107fbc5 | seclab-ucr/IncreLux | KLEE/z3/src/test/interval.cpp | #include<cstdlib>
#include "math/interval/interval_def.h"
#include "util/dependency.h"
#include "util/mpq.h"
#include "ast/ast.h"
#include "util/debug.h"
#include "util/rlimit.h"
template class interval_manager<im_default_config>;
typedef im_default_config::interval interval;
static void display_preamble(std::ostream... | TEST | 0.918077 | 5.010561 |
9430ef56-592a-4a5d-a8a5-86d502ba6e39 | meldaw84/The-offecial-GROMACS-molecular-simulation-toolkit_2023.2 | src/gromacs/gmxana/cmat.cpp | #include "gmxpre.h"
#include "cmat.h"
#include <algorithm>
#include "gromacs/fileio/matio.h"
#include "gromacs/fileio/xvgr.h"
#include "gromacs/math/functions.h"
#include "gromacs/math/vec.h"
#include "gromacs/utility/futil.h"
#include "gromacs/utility/smalloc.h"
t_mat* init_mat(int n1, gmx_bool b1D)
{
t_mat* m... | ALGO | 0.99318 | 3.427392 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.