uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
901ac0e3-74d0-4c37-8d4a-6b96355d9122 | FDiot/code_tympan3 | Tympan/geometric_methods/AcousticRaytracer/Acoustic/ValidRay.cpp | #include "Engine/AcousticRaytracerConfiguration.h"
#include "Geometry/Cylindre.h"
#include "Geometry/Sphere.h"
#include "ValidRay.h"
#include "SpecularReflexion.h"
#include "Diffraction.h"
#include "DoNothing.h"
bool ValidRay::validRayWithDoNothingEvent(Ray *r, Intersection* inter)
{
vec3 impact = r->getPosition() + ... | ALGO | 0.982567 | 6.397803 |
24f0cc8e-b076-4bc4-9c39-ab247250977e | Sambasai/Optimizing-Bio-informatics | Optimization-of-Needleman-Wunsch-main/needlemanoptv2.cpp | #include <bits/stdc++.h>
#include <math.h>
#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include "helper.h"
#define loop(i, k, n) for (int i = k; i < n; i++)
using namespace std;
void Needleman_Wunsch_optv2(string &A, string &B, int match, int mismatch, int gap) {
... | ALGO | 0.999773 | 3.951346 |
b2a92dd6-2c9c-48ee-815a-140af8ba883c | IEEE-NITK/SummerProjects18 | CP/Assignment4-Bit_Manipulation_Bit_Masks/Neeraj/912B.cpp | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i <b; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
int main()
{ ios::sync_with_stdio(false);
long long n,k;
cin>>n >>k;
... | ALGO | 0.9998 | 3.521729 |
42f65c1b-2962-4335-8c73-3ca1cfb0b0dc | gouravdhar/interviewBit_CPP_Solutions | Palindrome_List.cpp | #define ln ListNode
ln* reverse(ln *mid){
ln *b =mid->next;
mid->next = NULL;
while(b!=NULL){
ln* temp = b->next;
b->next = mid;
mid = b;
b = temp;
}
return mid;
}
int Solution::lPalin(ListNode* A) {
if(A->next == NULL)
return 1;
ln *mid = A, *fst = A;... | ALGO | 0.99997 | 4.657836 |
165fdbc4-d3fb-42d4-8df9-8bb4683c051a | AmanParadkar/Data-Structure-and-Algorithms | Sorting algorithm/SelectionSort.cpp | #include<iostream>
using namespace std;
void SelectionSort(int A[],int n)
{
int i=0;
int j,k;
while(i<n)
{
j=k=i;
while(k < n)
{
if(A[k]<A[j])
j=k;
k++;
}
swap(A[j],A[i]);
i++;
}
}
int main()
{
int A[] ={6... | ALGO | 0.999926 | 4.373645 |
4942fd38-91b1-4d2f-aed7-bb2bf5cf0832 | compiler-tree-technologies/cil | clang/test/CXX/dcl.decl/dcl.fct.def/dcl.fct.def.general/p8.cpp | // RUN: %clang_cc1 -std=c++11 %s -verify
// expected-no-diagnostics
using size_t = decltype(sizeof(0));
template<typename T> struct check;
template<size_t N> struct check<const char[N]> {};
constexpr bool startswith(const char *p, const char *q) {
return !*q || (*p == *q && startswith(p + 1, q + 1));
}
constexpr bo... | TEST | 0.868303 | 6.935109 |
29791d70-e677-42da-bacd-8a91ba2b6c01 | ishandutta2007/codeforces | rng_xlb/normal/1119/D.cpp | #include<bits/stdc++.h>
#define debug(x) cerr<<#x<<" = "<<x
#define sp <<" "
#define el <<endl
#define fgx cerr<<"-----------------------------------"<<endl
#define LL long long
using namespace std;
namespace IO{
const int BS=(1<<23)+5; int Top=0;
char Buffer[BS],OT[BS],*OS=OT,*HD,*TL,SS[20]; const char *fin=OT+BS-1... | ALGO | 0.999634 | 3.415846 |
c7e368d8-9003-42d3-b26f-4059265e6108 | Raian-Tasnim/Data-Structure-Lab | Lab2(22-46331-1)HW.cpp | #include <iostream>
using namespace std;
int main()
{
int a[10],x,count=0;
cout<<"the elements are: ";
for(int i =0;i<10;i++)
{
cin>>a[i];
}
cout<<"which number you want? "<<endl;
cin>>x;
for(int i=0;i<10;i++)
{
if(a[i]==x)
count++;
}
cout<<x<<" "... | ALGO | 0.984671 | 3.45204 |
c97ff079-47cf-48f1-9073-f0a7ab8b8e72 | GYPpro/ACM | 1_Contests/CF-EDU161/C_Closest_Cities.cpp | #define _USE_IOSTREAM_
// #define _PRIV_TEST_
#ifndef _USE_IOSTREAM_
#define _USE_STDIO_
#endif
#ifdef _USE_IOSTREAM_
#include <iostream>
#endif
#ifdef _USE_STDIO_
#include <stdio.h>
#endif
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <vector>
#include <ma... | ALGO | 0.999976 | 4.462468 |
fa8761ad-ae0f-4c86-aa47-c6b8b2aa0c8c | Altu-Bitu-6/Altu-Bitu-JoYudam | 05_우선순위큐/필수/14235.cpp | #include <iostream>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<int> gifts;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (a == 0) {
if (gifts.empty()) {
cout << "-1" << endl;
} else {
... | ALGO | 0.999809 | 4.148922 |
2751f668-e14b-4347-9a2a-b06a5ec1bd35 | MuhammadAmitHasan/XPSC | Practices/Week 3/C_Premutation.cpp | // problem Link: https://codeforces.com/problemset/problem/1790/C
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int arr[110][110];
for (int i = 0; i < n; i++)
{
for (... | ALGO | 0.99988 | 3.718932 |
3dc98a47-3afc-43cd-8f4b-8b4568fbb67e | ishandutta2007/codeforces | laycurse/normal/1485/C.cpp | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S min_L(S a,T b){
return a<=b?a:b;
}
inline int my_getchar(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread(buf, 1, 1048576, stdin... | ALGO | 0.999776 | 3.799361 |
211ff45e-83d0-400d-a186-b1d5cd1a0511 | ZhangYW18/ACM-Templates | Graphs/Dijkstra.cpp | struct node {
int id; ll dist;
node(int id,int dist):id(id),dist(dist) {}
bool operator <(const node &x)const {
return dist>x.dist;
}
};
void dij(int n) {
mem0(visit);
priority_queue<node> pq;
meminf(dist);dist[1]=0;
pq.push(node(1,0));
while (!pq.empty()) {
// if (pq.top().dist>ans) break; 可能优化
... | ALGO | 0.999947 | 3.908999 |
3b21b506-fffc-4665-af99-8cff5ce70a9d | jeshi2/cisco_cpa_essential | final_cppe_test/quiz4.cpp | #include <iostream>
using namespace std;
int main()
{
int i = 8;
do
{
i--;
cout << i << endl;
} while (i);
return 0;
} | ALGO | 0.982079 | 3.143278 |
3ff8583a-d9ee-4e10-950f-6e599b3b11e0 | OtakuTotipotent/CPP | CPP-BasicPatterns/num-pyramid-clockwise.cpp | /*
example : 6.55
1
2 4
3 6 9
4 8 12 16
3 6 9
2 4
1
*/
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int n, i, j;
cout << "Enter range : ";
cin >> n;
for (i = 1; i < n + 1; i++)
{
for (j = 1; j <= i; j++)
cout << setw(4) << left << i * j;
cout <... | ALGO | 0.996722 | 3.857906 |
7375d440-8ac3-4f20-96a9-89437584321e | xifoxy/42Algorithm | W02/sgang/15657.cpp | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> tmp, num;
int n, m;
string answer;
void solution(int curIndex, int depth) {
if (depth == m) {
for (const auto &p : tmp)
answer += to_string(p) + ' ';
answer.back() = '\n';
return;
}
... | ALGO | 0.999928 | 4.641208 |
40b7171c-ac95-4b98-824f-4660381e2655 | 111360246/2.21-2.33 | 2.31/2.31/2.31/Source.cpp | #include <stdio.h>
#include <stdlib.h>
int main(void)
{
int s;
printf("number\tsquare\tcube\n");
for (int i = 0; i < 11; i++)
{
printf("%d\t", i);
s = i * i;
printf("%d\t", s);
s = i * i * i;
printf("%d\n", s);
}
return 0;
} | ALGO | 0.917388 | 3.208363 |
a5bd717a-5a94-4e2b-a132-80f4172509cb | swarajmhatre/DSA | C++/STL/Deque.cpp | #include<iostream>
#include <deque>
using namespace std;
int main()
{
deque <int> d;
d.push_back(1);
d.push_front(2);
for(int i:d){
cout<<i<<endl;
}
// d.pop_front();
cout<<"print first index element "<< d.at(1)<<endl;;
cout<<"front: "<<d.front()<<endl;
cout<<"back: "<<d.ba... | TOOL | 0.954302 | 4.04565 |
e98c94ba-bcd5-4662-a7f7-476fa5854640 | chawinkn/competitive-programming | Training/Day5/contest/HS_Mountains.cpp | #include <bits/stdc++.h>
using namespace std;
// Stack + Shortest path
int h[2000009];
vector<int> g[2000009], dist(2000009, 1e9);
queue<int> Q;
stack<int> st;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n, q;
cin >> n >> q;
int s=0;
for (int i = 1; i <= n; i++) {
cin >> h[i];
if (h[i]... | ALGO | 0.999969 | 3.904212 |
5c32dc33-414a-4361-ba65-ee50a07d6136 | BonGiorn0/CPP-Projects | OOPLabs/Lab5.1/CSet.cpp | #include <algorithm>
#include "CSet.hpp"
static const int RESIZE_VALUE = 5;
CSet::CSet():
counter(0), arr(NULL){};
CSet::CSet(const CSet &other){
counter = other.counter;
arr = new int[counter + counter % RESIZE_VALUE];
for(int i = 0; i < counter; i++){
arr[i] = other.arr[i];
}
}
CSet::C... | ALGO | 0.997871 | 4.643314 |
2c34d5b2-9ce7-4995-bbb2-c935b07598d6 | ilikeavocadoalot/CompetitiveProgramming | Hoc CTIN thay Van/KRUSKAL/main.cpp | #include <bits/stdc++.h>
using namespace std;
float kq;
typedef pair <float, pair <int,int>> edge;
vector <int> parent;
vector <edge> es;
void initset (int n)
{
parent.assign (n,0);
for (int i=0; i<n; i++)
parent[i]=i;
}
int findset (int i)
{
return (parent[i]==i)?i:(parent[i]=findset(parent[i]));
}... | ALGO | 0.999975 | 4.278774 |
93aed138-dd0a-40d2-8488-36c7bbc7a739 | antgwy/Competitive-Programming | AtCoder/abc345/A.cpp | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " is " << x << endl
typedef long long ll;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
bool check(string s) {
int n = s.length();
if (s[0] != '<' || s[n-1] != '>') return false;
for (int i = 1; i < n - 1; ++i) {
... | ALGO | 0.999965 | 3.370278 |
cf70518e-4b88-4445-ad2a-6c6f6291d0bc | MoisieievVasya/Interpreter-Implementation | variables.cpp | #include "pch.hpp"
string trim(const std::string& str) {
auto start = str.find_first_not_of(" \t");
auto end = str.find_last_not_of(" \t");
return start == std::string::npos ? "" : str.substr(start, end - start + 1);
}
string parseAndStoreVariable(std::unordered_map<std::string, int>& variables, const std... | TOOL | 0.964897 | 5.715228 |
c722d8c8-5475-4566-a267-db7963784341 | proteus-core/libra | libra-llvm/clang-tools-extra/pp-trace/PPTrace.cpp | #include "PPCallbacksTracker.h"
#include "clang/AST/ASTConsumer.h"
#include "clang/AST/ASTContext.h"
#include "clang/Basic/SourceManager.h"
#include "clang/Driver/Options.h"
#include "clang/Frontend/CompilerInstance.h"
#include "clang/Frontend/FrontendAction.h"
#include "clang/Frontend/FrontendActions.h"
#include "clan... | TOOL | 0.874221 | 7.613509 |
f69c5697-5353-4116-948c-194db821658e | jh27kim/Matterport3D_videos | habitat-sim/src/deps/eigen-git-mirror/bench/vdw_new.cpp | #include <iostream>
#include <Eigen/Core>
using namespace Eigen;
#ifndef SCALAR
#define SCALAR float
#endif
#ifndef SIZE
#define SIZE 10000
#endif
#ifndef REPEAT
#define REPEAT 10000
#endif
typedef Matrix<SCALAR, Eigen::Dynamic, 1> Vec;
using namespace std;
SCALAR E_VDW(const Vec &interactions1, const Vec &inter... | ALGO | 0.999665 | 3.519938 |
f138615f-c0b5-49ce-a59b-7dd316c1e0bd | ALK222/ED | Ejercicios_Colas/Menor-Al-Principio/main.cpp | // NO MODIFIQUES NADA DE LO QUE APARECE EN ESTE FICHERO
#include <iostream>
#include "pila.h"
using namespace std;
Pila<int> readStack();
void printStack(Pila<int>& stack);
void resuelveCaso();
int main(){
int numCases;
cin >> numCases;
for (int i = 0; i < numCases; i++)
resuelveCaso();
}
void resuelveCaso() {... | ALGO | 0.999246 | 4.624494 |
42d2d732-e51e-46b3-8b0d-f326acbaa30d | Jintow/CPP | CPP-09/ex02/PmergeMe.cpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* PmergeMe.cpp :+: :+: :+: ... | ALGO | 0.998036 | 5.259041 |
8725b7af-e9f4-4760-815e-d21c07dc20b7 | g-gisbert/Inpainting-Holes-In-Folded-Fabric-Meshes | deps/libIGL/include/igl/cr_vector_laplacian.cpp | #include <vector>
#include "orient_halfedges.h"
#include "doublearea.h"
#include "squared_edge_lengths.h"
template <typename DerivedV, typename DerivedF, typename DerivedE,
typename DerivedOE, typename ScalarL>
IGL_INLINE void
igl::cr_vector_laplacian(
const Eigen::MatrixBase<DerivedV>& V,
const Eigen::MatrixBas... | ALGO | 0.999176 | 5.852558 |
f94285ef-7101-4b10-bdc0-89afe7ad0801 | wuzongan/myproject | quick-3.6/cocos/3d/CCOBB.cpp | #include "3d/CCOBB.h"
NS_CC_BEGIN
#define ROTATE(a,i,j,k,l) g=a.m[i + 4 * j]; h=a.m[k + 4 * l]; a.m[i + 4 * j]=(float)(g-s*(h+g*tau)); a.m[k + 4 * l]=(float)(h+s*(g-h*tau));
static Mat4 _getConvarianceMatrix(const Vec3* vertPos, int vertCount)
{
int i;
Mat4 Cov;
double S1[3];
double S2[3][3];
S... | ALGO | 0.9944 | 6.009361 |
ad716579-3277-46c5-9f0b-46d528bccc12 | xlljoy/face_tracking | main.cpp | #include <iostream>
#include "MTCNN.h"
using namespace std;
using namespace cv;
int main() {
vector<string> model_file = {
"/home/xileli/Documents/program/MTCNN/model/det1.prototxt",
"/home/xileli/Documents/program/MTCNN/model/det2.prototxt",
"/home/xileli/Documents/program/MT... | DATA | 0.889139 | 3.292621 |
888d3614-919f-4207-98b0-bc05b3f579d1 | 42somoim/42somoim5 | gim/personal/backtracking/외판원_순회2.cpp | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 10 + 1
int N, ret = 10000001;
int arr[MAX][MAX];
int dp[MAX];
bool visit[MAX];
void make_min_ret(int idx) {
if (idx == N) {
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += arr[dp[i]][dp[i +... | ALGO | 0.999945 | 3.328291 |
db3a7c37-1817-4cad-b99d-358eed6b3858 | arvindadsafira/bonbin | menu.cpp | #include "novel.h"
#include "penulis.h"
#include "menu.h"
void AA(ListP &LP, adrP P, ListN LN) {
string nama;
bool f = false;
showP(LP);
cout<<"Masukkan nama penulis :"<<endl;
while (!f) {
cin>>nama;
if (nama=="stop") {
f = true;
} else {
P = createNe... | TOOL | 0.958735 | 3.070728 |
ed1f4e49-1b96-4fd0-9a6f-cc8bb7a67ab5 | FazeelUsmani/Leetcode | 02 February Leetcode Challenge 2021/24 scoreOfParantheses.cpp | class Solution {
public:
int scoreOfParentheses(string S) {
int ans = 0, bal = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '(')
bal++;
else {
bal--;
if (S[i-1] == '(') {
ans = ans + (1<<bal);... | ALGO | 0.99986 | 5.187871 |
074baebf-46ec-4220-80b4-f46a2c16f858 | healthyjk/ChinaChess | chessevaluation.cpp | #include "chessevaluation.h"
#include "chessdefine.h"
#include <QString>
#include <QSound>
#include <QDebug>
//˱ڲͬλõĸֵ
//ǹ֮ԽϽֵԽ
//ĸֵ
const int R_PAWN_ADD[10][9]=
{
{0,0,0,0,0,0,0,0,0},
{120,120,140,150,150,150,140,120,120},
{120,120,140,150,150,150,140,120,120},
{100,120,140,140,140,140,140,120,100},
... | ALGO | 0.989407 | 4.799032 |
f04684cc-23fd-4c55-a93b-0dfa9f013941 | kmjp/procon | csacademy/001-020/011/c.cpp | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... | ALGO | 0.999758 | 3.14667 |
be23e2d8-935f-4662-913c-9bf72c997e57 | KhoiBui16/28Tech_Code_Online | C++/Source Code C++ Contest/SapXepTimKiem/B38_LienHoanPhim.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool cmp(pair<int,int>a , pair<int,int> b)
{
return a.second < b.second;
}
int main()
{
int n ; cin >> n;
pair<int,int>a[n];
for(int i = 0 ; i < n;i++)
{
cin >> a[i].first >> a[i].second;
}
sort(a , a+ n , cmp);
... | ALGO | 0.999978 | 4.590637 |
7d14882b-d63f-47b5-9393-4664e359e202 | TaboraBenedict/PLD-007-CpE11S1 | Activity 1.3/Act 10.cpp | #include<stdio.h>
#include<iostream>
int main()
{
int j=31,f=29,m=31,a=30,m2=31,j2=30,j3=31,a2=31,s=30,o=31,n=30,d=31;
int DayQ1=j+f+m;
int DayQ2=a+m2+j2;
int DayQ3=j3+a2+s;
int DayQ4=o+n+d;
printf("Days in Q1 of the current year: %d\n", DayQ1);
printf("Days in Q2 of the current year: %d\n", DayQ2);
... | ALGO | 0.990118 | 3.425013 |
e72706a4-43b0-40fa-8076-03c62083a137 | mirriechimoyo/LAB-TASKS | LabTask 5/Question6.cpp | #include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
int countVowels(const string& text) {
int count = 0;
for (char c : text) {
if (tolower(c) == 'a' || tolower(c) == 'e' || tolower(c) == 'i' || tolower(c) == 'o' || tolower(c) == 'u') {
count++;
... | TOOL | 0.992486 | 5.570892 |
1b9e3977-8a75-47b5-acb8-741b4d065357 | zhouyuming/LeetCode | 301-400/leetcode395.cpp | #include <gtest/gtest.h>
int dfs(char* s, int l, int r, int k)
{
int cnt[26] = { 0 };
for (int i = l; i <= r; i++) {
cnt[s[i] - 'a']++;
}
char split = 0;
for (int i = 0; i < 26; i++) {
if (cnt[i] > 0 && cnt[i] < k) {
split = i + 'a';
break;
}
}
... | ALGO | 0.99949 | 5.667685 |
4cd6dcf8-3492-49f0-9133-6d9bc37d5e8e | ys-dirard/cpp | tessoku/ex/c13.cpp | #include <bits/stdc++.h>
#define rep(i,s,n) for(int i = s; i < n; i++)
#define ll long long
#define P pair<ll, ll>
using namespace std;
ll Power(ll a, ll b, ll m){
ll p = a;
ll ans = 1;
for(int i=0;i<30;i++){
ll wari = (1 << i);
if((b / wari) % 2 == 1){
ans = (ans * p) % m;
... | ALGO | 0.999964 | 3.638356 |
de482392-122f-4ab9-9023-474d189438ad | mshroom15/CODING_ALL | cp/cp lab 3/B_Ordinary_Numbers.cpp | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
int count = 0;
for (int len = 1; len <= 9; len++) {
for (int d = 1; d <= 9; d++) {
long long num = 0;
for (int... | ALGO | 0.999251 | 3.818071 |
c67a5dba-5fb0-41bf-a267-fc1e763d287a | icf/Code | C++ code/GpBCS_S.C.CPMC/SC_afqmcConstraintPathBP_4/include/LBFGSpp-master/Q.cpp | #include <Eigen/Core>
#include <iostream>
#include <LBFGS.h>
using Eigen::VectorXd;
using Eigen::MatrixXd;
using namespace LBFGSpp;
double foo(const VectorXd& x, VectorXd& grad)
{
const int n = x.size();
VectorXd d(n);
for(int i = 0; i < n; i++)
d[i] = i;
double f = (x - d).squaredNorm();
... | ALGO | 0.999986 | 5.20086 |
01c6a8f9-0cad-4851-b35b-930898e8881d | dhdhdh-stream/sorting | side_experiments/reward_signal_t2/measure.cpp | #include <chrono>
#include <iostream>
#include <map>
#include <thread>
#include <random>
#include "globals.h"
#include "scope.h"
#include "simpler.h"
#include "solution.h"
#include "solution_wrapper.h"
using namespace std;
int seed;
default_random_engine generator;
int main(int argc, char* argv[]) {
cout << "Star... | ALGO | 0.917369 | 5.141939 |
5e2bcf27-996c-4d41-a311-ce16afe05c66 | jyoti-2/Sample_Coding-Question | Tree/DFS.cpp | // Depth first traversal
// Inorder traversal of BST gives sorted arrys
// Preorder traversal is also used to get prefix expression on of an expression tree.
// Postorder traversal is also useful to get the postfix expression of an expression tree.
#include<bits/stdc++.h>
using namespace std;
struct Node{
int dat... | ALGO | 0.999781 | 5.688394 |
6699f28d-199f-4328-bf53-d95e14c624e5 | sammig6i/opencv-tutorial | opencv-4.9.0/modules/imgproc/src/rotcalipers.cpp | #include "precomp.hpp"
namespace cv
{
struct MinAreaState
{
int bottom;
int left;
float height;
float width;
float base_a;
float base_b;
};
enum { CALIPERS_MAXHEIGHT=0, CALIPERS_MINAREARECT=1, CALIPERS_MAXDIST=2 };
/*F//////////////////////////////////////////////////////////////////////////... | ALGO | 0.999803 | 5.713398 |
1e8bb112-3b6e-4d56-9d63-7b9ee24c0910 | AliFikry/final-graduation-project | 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 |
bc9f0707-69fb-45a5-b2fd-9d281ecc240e | louisfghbvc/ITSA | itsa 中文題庫/dp/[C_DP11-易] 排隊購票.cpp | // memorize. dfs
#include <bits/stdc++.h>
using namespace std;
int memo[55][55];
int dfs(int a, int b, int sum){
if(b == 0 || a == 0) return 1;
if(memo[a][b]) return memo[a][b];
int res = 0;
res += dfs(a-1, b, sum+50);
if(sum > 0) res += dfs(a, b-1, sum-50);
return memo[a][b] = res;
}
int main... | ALGO | 0.999871 | 4.492575 |
db2f55d9-2301-4d75-b025-66669b10244c | Oumllack/Flutter-Mobile-Hotel-Application | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.9988 | 6.76073 |
c01c7fd3-e03c-4dcd-a60b-c70d357d09f6 | SatyaSharma73/HashC- | valid_anagram.cpp | #include<iostream>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
int main(void){
string s="tea",t="eat";
map<char,int>mp1,mp2;
for(int i=0;i<=s.length();i++){
mp1[s[i]]++;
}
for(int i=0;i<=t.length();i++){
mp2[t[i]]++;
}
if(mp1==mp2){
cou... | ALGO | 0.999995 | 3.31692 |
7fe6bc8e-996f-493f-bd8c-7276ffe42277 | Cherubin62/gmsh | contrib/Netgen/libsrc/meshing/smoothing2.cpp | #include <mystdlib.h>
#include "meshing.hpp"
#include <opti.hpp>
namespace netgen
{
static const double c_trig = 0.14433756; // sqrt(3.0) / 12
static const double c_trig4 = 0.57735026; // sqrt(3.0) / 3
inline double CalcTriangleBadness (double x2, double x3, double y3,
double metricweight, ... | ALGO | 0.999245 | 5.077473 |
aba8398a-f130-4df5-8524-16765ba4dda8 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_12646_4.cpp | #include <bits/stdc++.h>
int main() {
int i, j, n, t = 1;
char s[105], s1[35];
scanf("%d", &n);
for (i = 0; i <= n; i++) scanf("%c", &s[i]);
if (n < 26)
printf("NO");
else {
for (i = 0; i < n; i++) {
if (s[i] >= 'A' && s[i] <= 'Z') {
s[i] = s[i] + 32;
}
}
s1[1] = s[1];
... | ALGO | 0.999963 | 3.962369 |
5cc51bc0-cd01-464e-95db-ad73e25b59b2 | ishandutta2007/codeforces | a_g/normal/1538/D.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 4e4;
bool is_prime[N];
vector<int> primes;
int wt(int x) {
int ans = 0;
for (int p: primes) {
if (p*p > x) break;
while (x%p == 0) {
ans++;
x /= p;
}
}
if (x != 1) ans++;
return ans;
};
int main () {
ios_base::sync_with_s... | ALGO | 0.999915 | 4.719786 |
5d8fe529-76dc-4159-92b3-90df07d98d07 | jimpei8989/APCSC-2021 | Arrays/array01.cpp | #include <iostream>
int main() {
int N;
std::cin >> N;
int fib[100] = {0, 1};
for (int i = 2; i <= 99; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
for (int i = 1; i <= N; i++) {
std::cout << fib[i] << (i == N ? "\n" : " ");
}
}
| ALGO | 0.999685 | 4.662891 |
aff76f78-d9fa-4e77-8d38-b13c9954b00e | JinwenPan/FEM | main.cpp | #include "set"
#include "iostream"
#include "vector"
#include "fstream"
#include "sstream"
#include "cmath"
#include "ColsammSource/Colsamm.h"
#include "iterator"
struct Vertex{
void add_neighbor(int new_id){
if (neighbors.empty()){
neighbors.push_back(id);
neighbors.push_back(new_id);
}
else {
for (s... | ALGO | 0.998664 | 3.813813 |
8b823950-e5ea-44c6-b7bc-8043926764b1 | jahid-cuet/Basic-Data-Structure | Module_21/convert_array_to_bst.cpp | #include <bits/stdc++.h>
using namespace std;
class Node
{
public:
int val;
Node *left;
Node *right;
Node(int val)
{
this->val = val;
this->left = NULL;
this->right = NULL;
}
};
Node *convert(int a[], int n, int l, int r)
{
if (l > r)
return NULL;
int mid ... | ALGO | 0.999967 | 4.645746 |
96c11f70-e94b-47e1-88af-b4baf13c38fc | Talustus/boost_src | libs/compute/example/opencv_sobel_filter.cpp | //---------------------------------------------------------------------------//
// About Sobel Filter:
// * Edge Filter - distinguishes the differrent color region
// * Finds the gradient in x and y-axes
// * Three step process
// -> Find x-axis gradient with kernel/matrix
// Gx = [-1 0 +1]
// ... | ALGO | 0.997542 | 6.967254 |
455b3437-8683-4da6-bf64-a96e469a9f38 | raincross7/code-similarity | codes/train_code/problem299/problem299_323.cpp | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | ALGO | 0.999916 | 3.99914 |
fbd64312-8f5e-4563-bec8-01a7f514f8b6 | nirdoshrawal009/Data-Structure-and-Algorithms | 16.5_recursion.cpp | #include<iostream>
#include<climits>
using namespace std;
/*
// Tiling problem same as fibonacci problem
int tilingProb(int n)
{
if (n == 0){
return 0;
}
if ( n == 1){
return 1;
}
return tilingProb(n-1) + tilingProb(n-2);
}
int main(){
cout<<tilingProb(4)<<endl;
return 0;
}
//friends pairin... | ALGO | 0.99991 | 4.353974 |
211ba1fe-0332-456b-9331-9045dc3c6911 | natdiv9/internews-app | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998859 | 6.785645 |
86216394-1758-44ff-aeb5-6b1e00f6a6e0 | Spardha-hash/Hacktoberfest2022 | c++ problems asked in interview/Half N by M(GFG).cpp | Given two values N and M. Give the value when N is halved M-1 times.
Example 1:
Input: N = 100, M = 4
Output: 12
Explaination: The sequence of numbers is
100, 50, 25, 12.
Example 2:
Input: N = 10, M = 5
Output: 0
Explaination: The sequence is 10, 5, 2, 1 and 0.
Your Task:
You do not need to read input or print anyt... | ALGO | 0.999996 | 6.020836 |
2f0a6d41-b554-4f69-aec3-aece0297146b | ishandutta2007/codeforces | krijgertje/normal/1616/G.cpp | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <climits>
#inclu... | ALGO | 0.999948 | 4.231113 |
bb2f616b-a3eb-445b-b641-137fb8106f53 | alexandruionascu/fmi | algo and data structures lab/lab7/facebook.cpp | #include<bits/stdc++.h>
#define in f
#define out g
#define MOD 666013
#define INF 1 << 30
using namespace std;
ifstream f("facebook.in");
ofstream g("facebook.out");
typedef struct Data {
int value;
int items;
};
vector<Data> H[MOD];
int n, k;
int minim = INF;
void insert(int x, int index) {
int key = ... | ALGO | 0.999954 | 3.885822 |
925a7b20-b21e-4cd7-b16f-573badbdb4fa | jmtc7/Autonomous_Driving_nanodegree_notes | part2-localization-path-planning-control-and-system-integration/module07-highway-driving/lesson09-behavior-planning/00_cost_function/cost.cpp | #include "cost.h"
#include <cmath>
double goal_distance_cost(int goal_lane, int intended_lane, int final_lane, double distance_to_goal)
{
// The cost increases with both the distance of intended lane from the goal
// and the distance of the final lane from the goal. The cost of being out
// of the goal lane... | ALGO | 0.998587 | 5.199927 |
dab4e667-6ded-49b8-875d-eea3e7306ff6 | ishandutta2007/codeforces | myungwoo/normal/93/E.cpp | #include <stdio.h>
#include <algorithm>
using namespace std;
typedef __int64 lld;
#define MAXP 300001
int K,seq[101];
lld N,D[101][MAXP];
lld dfs(int n,lld v)
{
if (!n) return v;
if (v < MAXP && D[n][v] != -1) return D[n][v];
lld ret=dfs(n-1,v)-dfs(n-1,v/seq[n]);
if (v < MAXP) D[n][v] = ret;
ret... | ALGO | 0.999845 | 3.283619 |
57dfb3ab-0063-4da1-bdde-c593c8609d0a | n0IQ/Competitive-Programming | codeforces/550/C.cpp | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < b; i++)
#define repR(i, a, b) for (int i = a; i >= b; --i)
#define all(x) (x).begin(), (x).end()
#define rall... | ALGO | 0.99954 | 3.562536 |
eb0abfff-df15-4f8a-a471-04a58ef97d38 | absorian/agla_matrix_oop | gnuplot_pipeline.cpp | #include <iostream>
#include <vector>
#include <iomanip>
#include <cmath>
#include <random>
using std::vector;
using std::istream;
using std::ostream;
using std::cin;
using std::cout;
#define matrix_error(s) cout << "Error: " << s << '\n'
template<typename T>
class augmented_matrix;
template<typename T>
class permu... | ALGO | 0.994752 | 3.88919 |
e0302d68-2b12-4241-9145-f5dcb556c173 | YamashitaYz/autoware | src/universe/autoware.universe/planning/behavior_velocity_intersection_module/src/object_manager.cpp | #include "object_manager.hpp"
#include <lanelet2_extension/utility/utilities.hpp>
#include <tier4_autoware_utils/geometry/boost_geometry.hpp>
#include <tier4_autoware_utils/geometry/boost_polygon_utils.hpp> // for toPolygon2d
#include <boost/geometry/algorithms/convex_hull.hpp>
#include <boost/geometry/algorithms/co... | TOOL | 0.937114 | 6.07444 |
41303147-686b-41ea-b950-8f53de81fdc2 | Asif-Abdullah01/Codeforces | B_Array_Reodering.cpp |
#include <bits/stdc++.h>
#define endl "\n"
#define nn (cout << "NO\n")
#define yy (cout << "YES\n")
#define ll long long
#define ull unsigned long long
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a / gcd(a, b)) * b)
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sz(v) v.size()
#define... | ALGO | 0.999481 | 4.485351 |
c0275830-74b1-4aa8-a552-34e43f73d111 | rollschild/2d-game-physics-engine | src/body.cpp | #include "body.h"
#include "graphics.h"
#include "shape.h"
#include "vec2.h"
#include <SDL2/SDL_image.h>
#include <SDL2/SDL_render.h>
#include <SDL2/SDL_surface.h>
#include <cmath>
#include <iostream>
#include <math.h>
// Remember to initialize the member variables in the _same_ order that they are
// declared. Otherw... | TOOL | 0.910061 | 6.191562 |
fd867e44-8be7-4dfb-8d18-6ae99cfa1953 | GustavoSousaPassos/programing | c99cpp/PedraPapelTesoura_SinglePlay.cpp | #include <iostream>
#include <cstdlib>
#include <ctime>
#include <clocale>
using namespace std;
int main()
{
string fPla,sPla;
int winner;
string cVal[3];
cVal[0] = "pedra";
cVal[1] = "papel";
cVal[2] = "tesoura";
setlocale(LC_ALL, "Portuguese");
cout << "Escolha a sua opo jogador: ";
cin >> fPla;
// Ge... | ALGO | 0.997505 | 4.025891 |
a028a38e-a78a-41d9-9a7e-bb217a0f148d | Shady924/Linked-List | src/CircularLinkedList.cpp | #include "CircularLinkedList.h"
#include <iostream>
using namespace std;
CircularLinkedList::CircularLinkedList() : head(nullptr) , size(0) {}
CircularLinkedList::~CircularLinkedList() {
if (head == nullptr) return;
Node* tail = head;
while (tail->next != head) {
tail = tail->next;
}
tail->next = nullptr;
N... | TOOL | 0.991138 | 3.799289 |
c6c0bbe6-088d-49a3-9712-22a90ec8be95 | Ownfos/Waffle | libraries/boost_1_72_0/libs/math/tools/hypergeometric_1F1_map_neg_b_fwd_recurrence.cpp | #define BOOST_ENABLE_ASSERT_HANDLER
#define BOOST_MATH_MAX_SERIES_ITERATION_POLICY INT_MAX
// for consistent behaviour across compilers/platforms:
#define BOOST_MATH_PROMOTE_DOUBLE_POLICY false
// overflow to infinity is OK, we treat these as zero error as long as the sign is correct!
#define BOOST_MATH_OVERFLOW_ERROR_... | ALGO | 0.997581 | 5.350344 |
fa557dd9-98fb-4ebf-bd3a-7e978c4f48de | bill2766/patGo | 未做（复杂）/1082/1082. Read Number in Chinese(25).cpp | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <map>
using namespace std;
string ddict[10]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};
string danwei[10] = {"","","Shi","Bai","Qian","Wan","Shi","Bai","Qian","Yi"};
string val;
int ssize;
string result = "";
int main... | ALGO | 0.999355 | 3.575511 |
18a67504-e1e4-4446-80f7-6fe461a597e3 | haxr369/systemprogrem_C | HW1_Dead_lock/HW1_Dead_lock.cpp | // 전역변수 없이 코드 짜보기
//************************************************************
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <windows.h>
typedef struct node {
int data;
struct node* pNext;
} Node;
typedef struct linkedList {
Node* pHead;
CRITICAL_SECTION critical_sec;
int dummy;
} LinkedList;... | ALGO | 0.995733 | 4.540123 |
e22bb574-696a-4da2-8a3f-9b5c0f53af25 | RelaxXx359/CPP-Projects | Basic/Array/AverageValue.cpp | #include <iostream>
using namespace std;
int main() {
int arr[7] = {-2, 15, 18, -7, 6, 7, 8};
double sum2 = 0;
int max = INT_MIN;
for (int i = 0; i <7; ++i) { // Програмата да изведе числото, което е с максимална разлика от средната стойност на въведените числа.
sum2 = sum2 + arr[i... | ALGO | 0.997917 | 4.064895 |
c6430587-40ca-4576-b06f-bcbebb19ef25 | danielm2402/numerical-analysis | bisection-method/main.cpp | #include <iostream>
#include "biseccion.h"
#include <cmath>
using std::cout;
using std::cin;
using std::endl;
int main() {
double a,b, tolerancia;
int intervalos, max_iter;
biseccion bis([](double x)->double {
return exp(-x) - log(x);
},"e^-x -ln(x)");
cout<<"Método de biseccion para la fun... | ALGO | 0.999947 | 4.64212 |
af5a9b52-d278-43c4-987b-966d5f37b357 | Stefanstud/leetcode-env | data/leetcode_solutions/solutions/0474. Ones and Zeroes/0474.cpp | class Solution {
public:
int findMaxForm(vector<string>& strs, int m, int n) {
// dp[i][j] := max size of the subset given i 0's and j 1's are available
vector<vector<int>> dp(m + 1, vector<int>(n + 1));
for (const string& s : strs) {
const int count0 = count(begin(s), end(s), '0');
const in... | ALGO | 0.999934 | 6.607366 |
e5ebc62a-158a-4913-a3a1-5d48cc4e43d1 | adarsh-place/CP | Codes 1/SPOJ_NAKANJ.cpp | #include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int vis[8][8];
int level[8][8];
int getX(string s)
{
return s[0] - 'a';
}
int getY(string s)
{
return s[1] - '1';
}
bool isValid(int x, int y)
{
return x >= 0 && y >= 0 && x < 8 && y < 8;
}
vector<pair<int, int>> movements
{
{-1, 2}... | ALGO | 0.999835 | 4.39325 |
00f4c960-999d-4246-9df6-03f4143a5c9b | Ankith-SR/LeetCode | 2836-neither-minimum-nor-maximum/2836-neither-minimum-nor-maximum.cpp | class Solution {
public:
int findNonMinOrMax(vector<int>& nums) {
int min = nums[0];
int max = nums[0];
for(int i = 0; i<nums.size(); i++){
if(nums[i] < min){
min = nums[i];
}
if(nums[i] > max){
max = nums[i];
}
... | ALGO | 0.999966 | 5.073492 |
f367c6c3-a3cd-4ace-9928-5286b68adb64 | dmkz/competitive-programming | contests/Advent-of-Code-2024/C.cpp | #include <bits/stdc++.h>
#define isz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
using namespace std;
void part1() {
std::string s;
for (std::string ss; std::getline(cin, ss); s += ss);
int p = 0, answ = 0;
while (p < isz(s)) {
p = (int)s.find("mul(", p);
if (p == -1)
... | ALGO | 0.999568 | 4.394806 |
6a77dce7-9f1b-4eee-afc7-60085fe24bd7 | ksgustafson/cme212-notes | 2016-01-29/src/ex3/sum.cpp | #include "sum.hpp"
double sum(double a, double b) {
double c = a + b;
return c;
}
| TOOL | 0.975644 | 5.270223 |
88450fdf-d7f2-4d94-972e-f83cc3bbcf10 | palilo815/ps | baekjoon/2000/2572.cpp | #include <bits/stdc++.h>
#define loop(i,n) for(int i=0;i<n;++i)
using namespace std;
const int max_N = 1000;
const int max_V = 500;
int DP[2][max_N];
char card[max_N];
vector<int> red[max_V + 1];
vector<int> green[max_V + 1];
vector<int> blue[max_V + 1];
int src, dst, V;
void solve(vector<int>* vt, int score) {
... | ALGO | 0.999477 | 4.473851 |
8c1ee190-975b-4a63-b249-f973f13098c4 | takveer/Ds_File | experiment6(1).cpp | #include<iostream>
using namespace std;
#define SIZE 50
char s[SIZE];
int top=-1;
push(char elem)
{
s[++top]=elem;
}
char pop()
{
return(s[top--]);
}
int pr(char elem)
{
switch(elem)
{
case '#': return 0;
case '(': return 1;
case '+':
case '-': return 2;
case '*':
case '/': ret... | ALGO | 0.999924 | 3.986598 |
228f053f-3f45-4367-9e1c-866dc406d613 | LourenzFrancisco/RestEaseMobile | 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 |
c219812b-e024-4edc-9e2c-d9374a912bd9 | 7-Mangodish/CPP-PTIT | CPP0315.cpp | #include<bits/stdc++.h>
#define ll long long
#define forl(i,a,b) for(int i=a; i<b; i++)
#define forb(i,a,b) for(int i=a; i<=b; i++)
using namespace std;
//tuong tu bai96
int main(){
int t;
cin >>t;
cin.ignore();
while(t--)
{
string s;
getline(cin,s);
string chk=s;
sort(chk.begin(),chk.end());
if(... | ALGO | 0.999621 | 3.644358 |
25513402-564d-41c2-b20d-b2d11fa91b51 | IShahnawazShaikh/c-program | pure_virtual.cpp | #include<iostream>
using namespace std;
class draw
{
protected:
int x;
public:
void input()
{
cin>>x;
}
virtual void area()=0;
};
class square:public draw
{
public:
void area()
{
cout<<"area="<<x*x;
}
};
class circle:public draw
{
public:
void area()
{
//cou... | ALGO | 0.971059 | 3.634796 |
32b80d0f-8994-485e-933a-a4666ccb9a86 | mos165/Crypto-Libs | TestPrograms/test_arm_sha512.cpp | #include <stdint.h>
#if (CRYPTOPP_ARM_NEON_HEADER)
# include <arm_neon.h>
#endif
int main(int argc, char* argv[])
{
// SHA512 hash
// https://developer.arm.com/architectures/instruction-sets/simd-isas/neon/intrinsics?search=SHA512
uint32x4_t w={0}, x={0}, y={0}, z={0};
w=vsha512hq_u64(x,y,z);
w=vsh... | ALGO | 0.873728 | 3.347966 |
91c9a449-23d3-40dd-9f9f-8816ee35eeab | NicoCieri10/qr_reader_hive2 | 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.998693 | 6.797273 |
cfb60a11-719c-4666-8a2e-0dd6ac8df83e | fj0rdingz/Competive_Programming | contests/abc145/abc145d.cpp | #include <cstdio>
#include <queue>
#include <iostream>
#include <bits/stdc++.h>
#include<stdio.h>
#include<string.h>
#include<fstream>
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.1... | ALGO | 0.999984 | 3.894968 |
46183eed-3152-415e-81f5-f1f82b614d43 | Sundaram04/CPP-Programming | CPP Notes/Functions/call_by_reference.cpp | /*
In call by reference, original value is modified because we pass reference (address).
Here, address of the value is passed in the function, so actual and formal arguments share the same address space.
Hence, value changed inside the function, is reflected inside as well as outside the function.
*/
#include <iostr... | TOOL | 0.998399 | 6.101098 |
e1d41c91-171f-490a-b16c-32112b60d525 | aszkiel71/uwr | informatyka [computer science]/[25-S] Algorytmika Praktyczna/list8/task5.cpp | #include <iostream>
#include <vector>
#include <climits>
#define elif else if
using namespace std;
#define ll long long
struct pairr {
int wejscie, wyjscie;
};
void dfs(int u, int p, const vector<vector<int>>& tree, vector<pairr>& prepostORDER, vector<int>& parent, int& time) {
prepostORDER[u].wejscie = time++... | ALGO | 0.999869 | 4.419836 |
0d37dbbf-7ef8-4526-bdd7-0f6d9f216637 | Prakhar-002/LEETCODE | 🍄 Daily Challenge 2025 🍳/🔬 Examine Thoroughly 🧬/01 Jan 🪼/14 - 01 - 2025 --- 2657. Find the Prefix Common Array of Two Arrays ☃️ 🍁 🍰 🎲 💖/🎲CPP - 2657. Find the Prefix Common Array of Two Arrays.cpp | //! https://github.com/Prakhar-002/LEETCODE
// Todo 💎 QUESTION NUMBER 2657
//? ⌚ Time complexity ➺ O(n) 👉🏻 n = len(A)
//? 🧺 Space complexity ➺ O(1)
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> findThePrefixCommonArray(vector<int>& A, vector<... | ALGO | 0.999929 | 6.743689 |
15c5be31-5a5a-4b55-9e74-8af58eab3b1f | lXVILLALOBOSXl/TECMM | Estructura de Datos/Data Structure/Trees/Binary Tree/main.cpp | /*
AUTOR: Luis Villalobos
CURSO: Estructura de Datos
PROGRAMA: Binary Tree Insertion
FECHA: 24 de Abril del 2023
*/
#include <iostream>
#include <time.h>
#include "tree.hpp"
using namespace std;
int main(int argc, char const *argv[])
{
srand((unsigned) time(nullptr));
int n = 100;
Tre... | ALGO | 0.996423 | 4.665531 |
26486648-523f-44e7-83b3-30175583b0dc | iam-Arman/Algorithms | Lexicographically_smallest_permutation.cpp | // Bismillahir Rahmanir Rahim //
// SHAHRIAR MAHMUD ARMAN //
// AUTHOR : iamarman //
#include<bits/stdc++.h>
//// ... | ALGO | 0.999867 | 3.800125 |
9a2ad58b-011b-45ad-bef0-5dd779f8bbb1 | xmg2024/Leetcode-Solutions | 0001-0500/0484-Find-Permutation/cpp-0484/main.cpp | /// Source : https://leetcode.com/problems/find-permutation/
/// Author : liuyubobobo
/// Time : 2022-05-30
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
/// Greedy
/// Time Complexity: O(n)
/// Space Complexity: O(1)
class Solution {
public:
vector<int> findPermutation(string... | ALGO | 0.999957 | 5.696976 |
a401c2f2-2797-428b-ac60-56df12efbed4 | niraj-kumar-r/dailyDSA | competitions/codeforces/r883d3/q2.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
char getGameResult(const vector<string> &field)
{
for (int i = 0; i < 3; i++)
{
if (field[i][0] == field[i][1] && field[i][1] == field[i][2] && field[i][0] != '.')
return field[i][0];
}
for (int i = 0; i < 3; i++)
... | ALGO | 0.999954 | 5.934855 |
87119694-8829-4537-8d35-9a61ab21fe88 | OmarAlaaeldein/ALViS | src/Modeller/ModellerExecutable/_main.cpp | #include "lungModelling.h"
#include "treeDepth.h"
#include <iostream>
#include <cstdlib>
#include <string.h>
#include "itkImage.h"
#include <itkImageFileWriter.h>
#include <itkImageFileReader.h>
#include <itkMetaImageIO.h>
#include <itkImageRegionIterator.h>
#include <CGAL/Surface_mesh.h>
#include <CGAL/Polygon_mesh_... | DATA | 0.945711 | 3.958455 |
542e9dd9-0ffb-4f9f-9ec0-970f495c5c96 | jikongabc/test-jikong | P2916.cpp | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <string>
#include <map>
#include <set>
#include <unordered_map>
#define inf 0x3f3f3f3f
using namespace std;
using LL = long long;
using ULL = unsigned long long;
typedef pair<int, int> PII;
const int... | ALGO | 0.999965 | 4.1085 |
32d32ecd-9121-4925-aba8-e891b26a79eb | varvelworld/PAT-Solution | PAT-Advanced-Level-Practise/1006/1006.cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
int number_student;
cin >> number_student;
string first_student_id, last_student_id;
string first_sign_in_time = "23:59:59", last_sign_out_time = "00:00:00";
for(int i = 0; i < number_student; ++i)
{
string student... | ALGO | 0.994532 | 4.12908 |
b53bf051-f118-4f3b-8bae-5d3fa5716d4e | alexandraback/datacollection | solutions_5648941810974720_0/C++/snake13/main.cpp | #include <iostream>
#include <string>
#include <set>
#include <vector>
using namespace std;
#define FILENAME "A-small-attempt0.in"
string solve(int test_number) {
string data;
cin >> data;
vector<int> letters(26, 0), count(10, 0);
for (int i = 0; i < data.size(); ++i) {
++letters[data[i] - 'A'];
}
i... | ALGO | 0.998856 | 3.980334 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.