uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
1a576670-a61d-4e2b-a38b-2110e18a3dda | sarvex/leetcode-raku | solution/2100-2199/2114.Maximum Number of Words Found in Sentences/Solution.cpp | class Solution {
public:
int mostWordsFound(vector<string>& sentences) {
int ans = 0;
for (auto& s : sentences) {
int cnt = 1 + count(s.begin(), s.end(), ' ');
ans = max(ans, cnt);
}
return ans;
}
}; | ALGO | 0.999749 | 6.038869 |
46b21aeb-5e3e-4dac-9c2c-dacf86b7ba6a | arifparvez14/Basic-and-competetive-programming | Online-Judge-Solution/Codeforces Solutions/172(A.Word Capitalization).cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
int i;
while(cin>>s)
{
if(s[0]>='a' && s[0]<='z')
s[0]=s[0]-32;
cout<<s<<endl;
}
return 0;
}
| ALGO | 0.996204 | 3.850324 |
68275163-c6f3-4566-bfb7-c03a3aafaad6 | A01365532/Evidencia1 | ActIntegradora4/Graph.cpp | #include "Graph.h"
Graph::Graph() {
adjList.clear();
}
Graph::~Graph() {
adjList.clear();
}
// O(n)
void Graph::split(std::string line, std::vector<int> & res) {
size_t strPos = line.find(" ");
size_t lastPos = 0;
while (strPos != std::string::npos) {
res.push_back(stoi(line.substr(lastPos, strP... | ALGO | 0.999363 | 4.465021 |
491d16f6-a73c-461a-a720-1ad3cc42993c | mrhruthik/csa0336 | Queue operation such as enqueue,dequeue.cpp | #include <stdio.h>
#define MAX_SIZE 100
int queue[MAX_SIZE];
int front = -1;
int rear = -1;
int isEmpty() {
return front == -1 && rear == -1;
}
int isFull() {
return rear == MAX_SIZE - 1;
}
void enqueue(int data) {
if (isFull()) {
printf("Queue is full. Cannot enqueue.\n");
return;
} el... | ALGO | 0.99641 | 5.050365 |
043f3c7c-5b7d-456e-9782-6e871e41c5fa | jatinvish-01/DSA-War | 02 Patterns Problems/0021- Alphabet Triangle Pattern/Alphabet_Triangle.cpp | #include <iostream>
using namespace std;
void printAlphabetTriangle(int n){
//Outer loop
for(int i = 1; i<=n; i++){
char ch = 'A';
for(int j = 1; j<=i; j++){
cout << ch;
ch++;
}
cout << endl;
}
}
int main(){
i... | ALGO | 0.999153 | 4.257928 |
91a6b064-d81c-4d22-b710-3d8f74573cc9 | ChickenBenny/NCKU-HomeWork | Algorithm (Cpp)/p28.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
void decrease_search(vector<int> &arr);
int main(){
int n, x;
vector<int> arr;
cin >> n;
for(int i = 0;i < n;i ++){
cin >> x;
arr.push_back(x);
}
decrease_search(arr);
}
void de... | ALGO | 0.999986 | 4.397423 |
dabb2b1e-1ae4-4e1b-b367-a00a7cfbe20a | darmie/go-kinc | Backends/System/Windows/Libraries/OculusSDK/Logging/src/internal/Logging_Tools.cpp | #ifdef _MSC_VER
#pragma warning(disable: 4530) // C++ exception handler used, but unwind semantics are not enabled
#endif
#include "Logging_Tools.h"
#include <assert.h>
#include <time.h>
#include <chrono>
#include <codecvt>
#include <vector>
#if defined(_MSC_VER)
#include <filesystem> // Pre-release C++ fil... | TOOL | 0.898363 | 4.263859 |
ff8fafca-ed5c-4cf6-bb60-e6c13b86f750 | mushfiq-906/cp__training | Codeforces__Problems/contest/1325/c/73249157_wrong_answer_3.cpp | // Author : Abdallah Hemdan
// For Hassanosama, ICPC next year ISA.
/*Dear online judge:
* I've read the problem, and tried to solve it.
* Even if you don't accept my solution, you should respect my effort.
* I hope my code compiles and gets accepted.
* ___ __
* |\ \|\ \
* \ \ \_\ \
* \ \ ___ \emdan
* \ \ ... | ALGO | 0.999415 | 3.969387 |
e333547a-dd6c-4bda-9646-03bc323debf6 | ishandutta2007/codeforces | akulyat/normal/1603/A.cpp | #include <bits/stdc++.h>
#pragma GCC optimize ("O3", "unroll-all-loops")
#pragma GCC target ("sse4.2")
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
ifstream in;
ofstream out;
const long long kk... | ALGO | 0.999819 | 4.495225 |
b712aa98-638d-4e9d-9a79-fcec5c9fcf1f | bitcoindx/bitcoindx | src/addrdb.cpp | #include <addrdb.h>
#include <addrman.h>
#include <chainparams.h>
#include <clientversion.h>
#include <cstdint>
#include <hash.h>
#include <logging/timer.h>
#include <netbase.h>
#include <random.h>
#include <streams.h>
#include <tinyformat.h>
#include <univalue.h>
#include <util/settings.h>
#include <util/system.h>
C... | TOOL | 0.879198 | 7.666897 |
8e3c94bb-f94b-487c-848c-8db38a88256c | ishandutta2007/codeforces | ormlis/normal/1671/C.cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define r... | ALGO | 0.999716 | 4.022468 |
1a5c4aca-6dd8-462f-8a61-ab9ff1d908e5 | franedsandi/expense_tracker | 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 |
b180b71b-6e64-49bc-b569-382509c40147 | jayin92/competitive-programming | contest/atcoder_abc219/pB.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, ... | ALGO | 0.999775 | 4.130805 |
8b163fc7-2045-476c-9027-05b68a83d5e3 | Mohamed-Kamal-Ayad/leetcode-solutions | 907-koko-eating-bananas/koko-eating-bananas.cpp | class Solution {
public:
int minEatingSpeed(vector<int>& piles, int h) {
sort(piles.begin(), piles.end());
long int hours = 0;
int res = INT_MAX;
int low = 1, high = piles[piles.size() - 1];
while (low <= high) {
int mid = low + (high - low) / 2;
for (... | ALGO | 0.999959 | 6.125657 |
0016eb5c-50d4-41d0-a1e5-b48c11337338 | mrsyaban/Praktikum-OOP-2023 | responsi-1/6/BigNumber.cpp | #include "BigNumber.hpp"
#include <iostream>
using namespace std;
const int BigNumber::max_digit = 20;
BigNumber::BigNumber() {
this->digit = new int[BigNumber::max_digit];
}
BigNumber::BigNumber(int number) {
this->digit = new int[BigNumber::max_digit];
for (int i = 0; i < BigNumber::max_digit; i++) {
thi... | ALGO | 0.996119 | 4.648482 |
027d80d3-d0fd-4c7d-be46-99b121c3552b | Mayurdhamgunde/DSA-Cplusplus | Week 16/stack - 2/StockSpan.cpp | #include<iostream>
#include<stack>
using namespace std;
int main(){
int arr[] = {100,80,60,81,70,60,75,85};
int n = sizeof(arr)/sizeof(arr[0]);
int pgi[n];
stack<int> st;
pgi[0] = 1;
st.push(0);
for(int i=1;i<n;i++){
while(st.size()>0 && arr[st.top()]<=arr[i]){
st.pop();
... | ALGO | 0.999989 | 4.180339 |
1ee6083d-566c-45fa-9797-0198ae324a69 | jyotsnatiwary/Data-structures-algo | coding-ninjas/linked list 2/Reverse LL (Recursive).cpp | /*Code : Reverse LL (Recursive)
Send Feedback
Given a singly linked list of integers, reverse it using recursion and return the head to the modified list.
Note :
No need to print the list, it has already been taken care. Only return the new head to the list.
Input format :
The first line contains an Integer 't' which ... | ALGO | 0.999291 | 5.179997 |
1d427eca-c39b-46ac-9bc6-3fde05e2da69 | mervejss/KTUN | Hafta2_Soru2.cpp | #include <stdio.h>
#include <math.h>
//2- Kullanc tarafndan girilen sayya kadar olan ift saylarn toplamn
//ve ortalamasn ekrana yazdran program kodunu yaznz.(for dngs kullannz)
int main(){
baslangic:
int sayi,cevap,ciftSayac=0,toplam=0;
printf("Bu programda,\nGirdiginiz sayiya kadar olan cift sayilarin toplamini... | ALGO | 0.977472 | 3.270518 |
10182e0f-ce01-40f7-8652-fe82a4c7432d | gbdsantos/recognition-faces-and-objects | dlib-19.10/examples/kcentroid_ex.cpp | /*
This is an example illustrating the use of the kcentroid object
from the dlib C++ Library.
The kcentroid object is an implementation of an algorithm that recursively
computes the centroid (i.e. average) of a set of points. The interesting
thing about dlib::kcentroid is that it does so in a ker... | ALGO | 0.981738 | 7.037737 |
e41eafae-22c7-4437-973d-10d28b8b2275 | trofiv-IFMO/IFMO-C-Basics | Лабораторные/10/lab10/lab10/lab10.cpp | // Course: Programming technologies (ANSI C)
// Lab 10. Functions.
// Student: Trofimov V.A. Group: 1511
// Teacher: Povishev V.V.
// Created 04.09.2012 Modified: 01.10.2012
// Description: Program entry point.
#include <stdio.h>
#include <stdlib.h>
int gcd (int a, int b) {
return b ? gcd (b, a % b) : a;
}
int lcm(... | ALGO | 0.990379 | 4.137091 |
c0ac0dc1-6ee7-4d62-b9c6-2dc9b6552aca | Shashank58/TextExtraction | libraries/tess-two/jni/com_googlecode_tesseract_android/src/ccstruct/split.cpp | /*----------------------------------------------------------------------
I n c l u d e s
----------------------------------------------------------------------*/
#include "split.h"
#include "coutln.h"
#include "tprintf.h"
#ifdef __UNIX__
#include <assert.h>
#endif
/*-------------------------------------... | TOOL | 0.990221 | 5.885362 |
bedfc95f-87a1-428a-af8f-0584a8f3c269 | Adityasinghvats/CPP---code | 12_recursionbasics/05maze.cpp | #include<iostream>
using namespace std;
// sr-> start row , sc->start column
int maze(int sr,int sc,int er,int ec){
if(sr>er || sc>ec) return 0;
if(sr==er && sc==ec) return 1;
int rightWays = maze(sr,sc+1,er,ec);
int downWays = maze(sr+1,sc,er,ec);
return rightWays+downWays;
}
// Using only 2 vari... | ALGO | 0.999553 | 4.404787 |
c7faaba1-fe71-45e3-93a8-f8138ff0f1cd | ZYLZhuPP/OI | Luogu/P9120.cpp | #include<bits/stdc++.h>
using namespace std;
#define rFor(i, r, l) for (int i = (r); i >= (l); --i)
#define For(i, l, r) for (int i = (l); i <= (r); ++i)
const int N = 5e4 + 5;
template<class C> inline bool cmin(C &x, const C &y) { return y<x? x=y, 1: 0; }
template<class C> inline bool cmax(C &x, const C &y) { return ... | ALGO | 0.999953 | 3.560361 |
be6780aa-711a-4a71-b7e6-c1bea6009ebb | MashyBasker/college-codes | sem5/compiler-design/assign1/asgn-0-6.cpp | #include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <unordered_set>
using namespace std;
// Set of C++ keywords to ignore
unordered_set<string> keywords = {"alignas", "alignof", "and", "and_eq", "asm",
"auto", "bitand", "bitor", "bool", "break",
"case", "catch", "char",... | ALGO | 0.99916 | 3.783304 |
b9f1bade-c270-40ac-aff5-92a811d31df1 | kit-algo/flow-cutter | file_utility.cpp | #include "file_utility.h"
#include <stdexcept>
#include <cctype>
#include <limits>
#include <sstream>
#ifndef _WIN32
#include <linux/limits.h>
#include <string.h>
#include <errno.h>
#include <sys/stat.h>
#include <stdlib.h>
#else
#include <windows.h>
#endif
std::time_t file_last_modified(const std::string&file_name){... | TOOL | 0.870517 | 6.118934 |
2c0af738-4378-4d15-a557-0a803d87b0ba | aflah201/belajar-cpp | 10. Increment Decrement/incrementDecrement.cpp | #include <iostream>
using namespace std;
int main()
{
int a, b;
cout << "Contoh Increment" << endl;
cout << "Masukkan Nilai : ";
cin >> a;
cout << " " << endl;
cout << "Nilai Awal : " << a << endl;
cout << "Nilai Increment (+1) : " << a++ << endl;
cout << "Nilai Hasil ... | ALGO | 0.982305 | 4.233095 |
2fe0dc2b-a77a-410c-ac51-6f4f4aa712f0 | ItaiiCadena/poo_1 | exercises/Plantillas/e_numMaxMin.cpp | #include <iostream>
using namespace std;
///Creacion de funciones con plantillas
template <class m>
m numeroMinimo(int tam, m arreglo[]) // funcion que devuelve el valor minimo de un arreglo
{
m minimo; // almacenara el valor minimo
minimo = arreglo[0]; // se iguala a la primera posicion del arreglo
for(int i=0; i ... | ALGO | 0.999021 | 4.115252 |
80161806-2430-420d-8a85-c0e54fc7ecfd | sk10salman/PLACEMENT_ALL_TOPICS_DATA_STRUCTURE_AND_ALGO | linkedlist/Delete_node_withot_given_head_pointer.cpp | void deleteNode(Node *node)
{
// Your code here
struct Node* temp = node->next;
// Copy data of the next node to current node
node->data = node->next->data;
// Perform conventional deletion
node->next = node->next->next;
free(temp);
}
| ALGO | 0.994854 | 4.450813 |
d9727f4f-2a6b-4346-ac56-7112dc8904b9 | Turbold1125/SomeoneCanBeUse | C++/lab5/lab5-6.cpp | #include<stdio.h>
int main(){
int n,sum;
printf("n=");
scanf("%d",&n);
while(n>0){
sum=sum+(n%10);
n=n/10;
}
printf("sum=%d",sum);
}
| ALGO | 0.999842 | 3.354124 |
eb92ab34-c3c9-46f3-a9cc-ee7cb5e0251d | leviethang2509/dd | chuong 5/bt2.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
ifstream doc_file("songuyen1.txt");
if(doc_file .is_open())
{
vector<int>dayso;
int so;
while(doc_file>>so)
{
dayso.push_back(so);
}
sort(dayso.begin(),dayso.end());
ofstream ghi_file("songuyen1.txt");
for(int i=0;i<dayso.size();i++)
... | ALGO | 0.997187 | 3.159215 |
442f990a-d92d-4e6c-9b9b-1621fa1086df | AndyEagling/Quadratic-Polynomial-CW | Quadratic.cpp | #include "Quadratic.h"
#include <iostream>
using namespace std;
Quadratic::Quadratic(int coefficientA, int coefficientB, int coefficientC) {
/** update the values of the variables **/
coefficient[0] = coefficientA;
coefficient[1] = coefficientB;
coefficient[2] = coefficientC;
}
Quadratic::Quadratic() {
}
/**... | ALGO | 0.9168 | 4.304125 |
8effb263-a9a4-4a80-bbb8-712802d72542 | chocoluffy/leetcode-cpp | EPI/notes/【DP-dynamic-subproblems】return-all-possible-word-break/solution.cpp | // compared to normal dp problem, each case is associated with all prev subproblems! thus need to cache the result.
// following is the dynamic programming version.
for(int i = 0; i < s.size(); i++) {
vector<string> res;
for(int j = 0; j < size(); j++) {
if (dp[j].size() > 0 && dict.find(s.substring(j+1, i)) !=... | ALGO | 0.999856 | 5.818802 |
db77e7fd-fe7f-483d-ba1d-4e63febba063 | FlashSnail/Sohu | SohuOnlineTest1/SohuOnlineTest1/SohuOnlineTest1.cpp | // SohuOnlineTest1.cpp : ̨Ӧóڵ㡣
//
#include "stdafx.h"
#include <iostream>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
int target;
int num;
int s;
int sum = 0;
vector<int> se... | ALGO | 0.999858 | 3.616881 |
c21b5db1-8d5e-4f22-984a-46cc926e1360 | LeHuuNguyen20020457/GameSDL | CommonFunc.cpp |
#include "stdafx.h"
#include "CommonFunc.h"
bool SDLCommonFunc1::CheckCollision(const SDL_Rect& object1,const SDL_Rect& object2)
{
int left_a = object1.x;
int right_a = object1.x + object1.w;
int top_a = object1.y;
int bottom_a = object1.y + object1.h;
int left_b = object2.x;
int right_b = object2.x + o... | TOOL | 0.951002 | 5.070653 |
e7b8e87d-bb35-4632-8518-8cd66dd859f0 | alinabi19/Cplus-plus-STL | Code/5 stack/checkForBalancedParenthesis.cpp | #include<iostream>
#include<string>
#include<stack>
using namespace std;
// walkccc site way-------------
// int pop(stack<char>& stack) {
// const int c = stack.top();
// stack.pop();
// return c;
// }
// bool isValid(string s) {
// stack<char> stack;
// for (const char c : s)
// if (c ==... | ALGO | 0.998618 | 5.696181 |
4ce362b5-2e72-4a3e-9579-282b579ed7f3 | Dblaze47/Problems-Solved---Category-Beginner | UVA11192.cpp | #include<iostream>
using namespace std;
int main(){
int x, i, len, lene, j, temp, mo;
string str;
while(cin>>x && x!= 0){
cin>>str;
len = str.size();
lene = len/x;
for(i= 0; i<=len-lene; i++){
mo = (i+lene)-1;
for(j=mo; i<j; i++, j--){
... | ALGO | 0.99999 | 3.281196 |
dbed41f6-406e-4499-a810-c5e40635f2f9 | nazmul-me/Online-Judge | uri/1143.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
scanf("%d%d",&a,&b);
for (int i = 1; i <=b;i++)
{
if(i%a==0) printf("%d\n",i);
else printf("%d ",i);
}
return 0;
}
| ALGO | 0.999869 | 3.038959 |
1f314476-bf0f-4728-ac21-0f7078cfd6b6 | SanjitSG/DSA-Practice | 1-Learn-the-basics/6-Lecture-six-hashing/4-highest-lowest-freq-ele.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
// pre-compute
unordered_map<int, int> hash;
for (int i = 0; i < n; i++)
{
hash[arr[i]]++;
}
int q;
cin >> q;
int l_value = INT_MAX;
int h_v... | ALGO | 0.999831 | 4.404096 |
e16fb385-6994-4f54-b62f-f488f1cdc43e | phazon0/TDDD86-algorithm-labs | lab8/trailblazer/src/trailblazer.cpp | /*
* File: trailblazer.cpp
* ------------
* This is the source file for the handling pathfinding in BasicGraph
* The file implements four different pathfinding algorithms
* DFS, BFS, Dikjstra and A*
* author: ludin609 & ferpe211
* since: 10/12/2024
*/
#include "costs.h"
#include "pqueue.h"
#include "trailblaze... | ALGO | 0.99995 | 4.213358 |
66327c79-967e-439d-8e5a-ef9aa398de6d | Xan-ca/CF-Submissions | Practice-C/P163.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF (ll)1e18
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve()
{
ll n;
cin>>n;
vector<ll>v;
v.assign(n,0);
for(ll i=0;i<n;i++)cin>>v[i];
ll mx=v[n-1];
ll res=0;
for(ll i=n-1... | ALGO | 0.999906 | 3.918243 |
4426092a-ec6b-4b01-a264-b43f5831f93a | dseftu/Pathfinding | Pathfinding/Pathfinding.ConsoleApplication/PathfindingConsoleApplication.cpp | #include "pch.h"
#include <GridHelper.h>
#include "BreadthFirstSearch.h"
#include "GreedyBestFirstSearch.h"
#include "DijkstrasAlgorithm.h"
#include "AStar.h"
#include <iostream>
using namespace std;
using namespace Library;
void DrawGrid(int32_t graphWidth, int32_t graphHeight, std::shared_ptr<Library::Node> start,... | ALGO | 0.99901 | 3.619898 |
f0fcb228-2687-457f-b37d-2a91eee5326f | GopherTeen/OJ_Code | Problems/Codeforces/2001-2100/2009/D_Satyam_and_Counting.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
static constexpr int MOD = 1'000'000'007;
/*
0 <= y <= 1
*/
void solve() {
int n;
cin >> n;
vector<array<int, 2>> vis(n + 1);
vector<int> r(2);
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
... | ALGO | 0.999316 | 5.071996 |
2d1c44fc-a7b8-4f13-a4ff-9b91925390f4 | Starboomboom37183/C_programming | 剑指offer/20170327/20170327/3.cpp | //#include<iostream>
//using namespace std;
//int main(){
// int N;
// cin>>N;
// int *a = new int[N];
// for(int i=0;i<N;i++){
// cin>>a[i];
// }
// int count = 0;
// for(int i=0;i<N-2;i++){
// for(int j=i+1;j<N-1;j++){
// for(int k =j+1;k<N;k++){
// if(a[i]+a[j]>a[k]&&a[i]+a[k]>a[j]&&a[j]+a[k]>a[i]){
// //... | ALGO | 0.999753 | 3.933986 |
3b507cac-fad4-4126-a4ef-a81b50122824 | Drink7/LeetCode | 0435-non-overlapping-intervals/0435-non-overlapping-intervals-08-03-2025-23-46-08.cpp | class Solution {
public:
int eraseOverlapIntervals(vector<vector<int>>& intervals) {
// sort by end time
// tracking end time
// if interval start time <= end time, cnt++ (need to remove)
// TC: O(nlogn)
// SC: O(1)
sort(intervals.begin(), intervals.end(), [](auto con... | ALGO | 0.999922 | 6.270467 |
e0a3f029-6b5a-4281-bf50-831f948a02ae | ishandutta2007/codeforces | potassium/normal/1509/B.cpp | #pragma GCC optimize ("O3", "unroll-loops")
// #pragma GCC target ("avx2")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define disti... | ALGO | 0.999934 | 4.783483 |
2950d93b-9567-4ba7-8c6f-389e86dee889 | darkwuta/-CSC417-Assignment | Assignment2/extern/libigl/tutorial/505_MIQ/main.cpp | #include <igl/avg_edge_length.h>
#include <igl/barycenter.h>
#include <igl/comb_cross_field.h>
#include <igl/comb_frame_field.h>
#include <igl/compute_frame_field_bisectors.h>
#include <igl/cross_field_mismatch.h>
#include <igl/cut_mesh_from_singularities.h>
#include <igl/find_cross_field_singularities.h>
#include <igl... | ALGO | 0.936474 | 5.777727 |
05711706-1a29-451f-bc1b-46133288c53f | martinbudden/SuperSlicer | src/libigl/igl/snap_to_canonical_view_quat.cpp | #include "canonical_quaternions.h"
#include "normalize_quat.h"
#include <cstdio>
#include <cassert>
// Note: For the canonical view quaternions it should be completely possible to
// determine this anaylitcally. That is the max_distance should be a
// theoretical known value
// Also: I'm not sure it matters in this c... | ALGO | 0.99372 | 6.592291 |
22efd198-6ce9-4627-aed8-574d8975058e | Ludophonic/JigLib | collision/src/colldetectcapsulebox.cpp | using namespace std;
using namespace JigLib;
//==============================================================
// tCollDetectCapsuleBox
//==============================================================
tCollDetectCapsuleBox::tCollDetectCapsuleBox()
:
tCollDetectFunctor("CapsuleBox", tPrimitive::CAPSULE, tPrimitive::... | ALGO | 0.986153 | 5.88361 |
2d668bb4-ef00-47b2-bcd3-d091f298493d | convict-git/sport_coding | old_practise/Hackerrank/tlecc2/2/2.cpp | #include <iostream>
#include <iomanip>
#include <functional>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#i... | ALGO | 0.999874 | 3.61635 |
5c0f0647-73f1-4e74-ad6a-41572fbe279b | Shunli-Wang/TECH-NoteSystem | 2_数据结构与算法部/06_动态规划/01_最大子数组和_力扣053.cpp | // https://leetcode.cn/problems/maximum-subarray/
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
// 本质还是在打表，但是因为不用记录所以简化为for循环
int maxSubArray(vector<int>& nums) {
int ans = nums[0];
int preMax = 0; // 初始状态是max(x+0, x)不会出错
for (int x : nums) {
... | ALGO | 0.999949 | 5.387794 |
90ec7eb7-cef9-4518-838e-88dc87a22416 | lcheng-ENME202/cpp-lecture-notes | 5d_bubbleSort.cpp | // ENME 202
// 5d_bubbleSort.cpp
// Example: bubble sorting
#include <iostream>
using namespace std;
void bubbleSort(float*, int);
void fillRandArray(float*, int);
void displayArray(float*, int);
int main(void) {
srand(time(NULL));
int n = rand()%10 + 5; // random array size from 5-14
float* a = new float[n... | ALGO | 0.99983 | 5.598641 |
7d32c961-bbca-4e8a-9e89-27c41f17733d | pradnyesh61/CP | LeetCode/46_Permutations.cpp | // 7 March 2023
#include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
void per(int idx, int n, vector<int> &nums, vector<vector<int>> &ans)
{
if (idx == n)
{
ans.push_back(nums);
return;
}
for (int i = idx; i < n; i++)
{
... | ALGO | 0.99999 | 6.002963 |
bc0e5f59-370e-40d5-b0e3-255d0e315f86 | meqdadhn/mini_project | 3rd_party/Eigen-3.3.7/doc/examples/class_CwiseUnaryOp.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
// define a custom template unary functor
template<typename Scalar>
struct CwiseClampOp {
CwiseClampOp(const Scalar& inf, const Scalar& sup) : m_inf(inf), m_sup(sup) {}
const Scalar operator()(const Scalar& x) const { return x<m_... | ALGO | 0.960922 | 6.417363 |
9ba14b24-7a8d-4f33-82b2-b7b0b53c7ee5 | arafatkatze/Competitive-Coding- | Graph/dfs_varients/euler_tour.cpp | #include <bits/stdc++.h>
using namespace std;
#define INF (int)1e9
#define forall(i,a,b) for(int i=a;i<b;i++)
#define bitcount __builtin_popcount // counts 1 eg- 1101 has value 3
// with bitcount be careful with data types
// Useful container manipulation / tr... | ALGO | 0.999984 | 4.149248 |
85401b6f-fa85-4434-ba7a-1747703b8d89 | jsilvela/morphological-image-processing | region-ops.cpp | /**********************************
region-ops.cpp
Basic operations on regions of pixels
Jaime Silvela
January 2000
**********************************/
#include <stack>
#include <iostream>
#include <assert.h>
#include "image.hpp"
bool VERBOSE = false;
bool BREADTH_FIRST = true;
const int SMALLEST_WHITE_REGION = 1000... | ALGO | 0.965855 | 6.635022 |
d3349e76-7b28-419a-b62c-ea63d244f58d | AhmedGhazala2000/ToDo-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.9988 | 6.76073 |
0affdf48-0645-4907-afa9-e4c0f023ffb5 | WKolodziejski/AOM-AV1 | av1/encoder/william/robust/LMedS.cpp | #ifndef __RTL_LMEDS__
#define __RTL_LMEDS__
#include "RANSAC.cpp"
#include <algorithm>
namespace RTL {
template <class Model, class Datum, class Data>
class LMedS : virtual public RANSAC<Model, Datum, Data> {
public:
explicit LMedS(Estimator<Model, Datum, Data> *estimator)
: RANSAC<Model, Datum, Data>(estim... | ALGO | 0.998068 | 6.118595 |
b641fef7-45d1-4710-8a7b-4adc7b9f55d4 | yyytir777/Codes | C++/Baekjoon/30804.cpp | #include <bits/stdc++.h>
#define MAX 200002
using namespace std;
int fruit[12] = {0,};
int arr[MAX];
int max_cnt = 0;
int fruitSize() {
int cnt = 0;
for(bool tmp : fruit) {
if(tmp) cnt++;
}
return cnt;
}
int main() {
int n;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> arr... | ALGO | 0.999977 | 4.86022 |
07ed1779-06c5-4c43-9f38-443a21d0bf69 | HyungJunGoo/AlgorithmProblems | Programmers/lv2/Kth_number.cpp | #include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
vector<int> solution(vector<int> array, vector<vector<int>> commands) {
vector<int> answer;
int len = array.size(); // 7
for(auto v : commands){
vector<int> temp = array;
int start, end, k;
... | ALGO | 0.999976 | 5.178441 |
3559bedf-a5db-47f8-809c-68cdda354d54 | hajar-aswad/PMS | 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 |
1da1fe07-2ea8-470f-aebd-08f05e85f5a0 | manikanta2901/ubuntu | .history/codingChallenges/cpp/Codechef/longChallenges/Year2021/January/AndOrGame_20210108163635.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.99997 | 3.694395 |
0789599b-cc38-48cb-83f0-5dc975ce9fb8 | yellowHatpro/Codes-Practice | Leetcode/389_FindTheDifference.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
char findTheDifference(string s, string t) {
sort(s.begin(), s.end());
sort(t.begin(), t.end());
for (int i = 0; i < s.length(); ++i)
{
if (s[i]!=t[i])
{
return t[i];
... | ALGO | 0.999948 | 5.55566 |
48287c60-17de-4f36-aa08-20a2c81fc99c | jh11240/baekjoon_online_judge | Union_Find/백준1717(집합의표현).cpp | #include<iostream>
using namespace std;
int parent[1'000'001];
int GetParent(int a) {
if (parent[a] == a) return a;
else
return parent[a] = GetParent(parent[a]);
}
void AddGroup(int a, int b) {
//b의 root의 parent를 a 로 묶어버리기
a = GetParent(a);
b = GetParent(b);
parent[b] = a;
}
bool IsSameGroup(int a, int b... | ALGO | 0.999996 | 4.30926 |
f74614ca-282f-4735-9aec-2c2a5c2ee404 | dddql/cpp | Data_structure/Queue/P1540.cpp | #include <cstdio>
#include <queue>
using namespace std;
int M, N, tmp, ans;
bool find[1050];
queue<int> mem;
int main()
{
scanf("%d%d", &M, &N);
for (int i = 1; i <= N;i++){
scanf("%d", &tmp);
if(find[tmp])
continue;
else{
if(mem.size()>=M){
find... | ALGO | 0.999935 | 3.188725 |
382aedee-4987-4b55-8413-2e3330776753 | daiwb/Algorithm | TopCoder/Tournaments/TCO14/R1A/EllysScrabble.cpp | // BEGIN CUT HERE
// END CUT HERE
#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 <string>
#include <cstring>
using namespace std;
// BEGIN CU... | ALGO | 0.999943 | 4.916784 |
713ddac5-0bb5-4966-85ee-144e6cf51514 | arnavarora1710/Competitive_Programming | Codeforces/1987B.cpp | // https://codeforces.com/contest/1987/problem/B
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pi;
#define f first
#define s second
#define mp make_pair
#define MULTI_TEST (1)
const int maxn = 2e5 + 5, ... | ALGO | 0.999892 | 4.768033 |
b8c2c80d-9795-4a6b-8324-0993d3cbc219 | harshit-jain52/CP_DSA | atcoder/abc361_d.cpp | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef pair<int,int> pii;
const int M = 1e9+7;
const int N = 14;
const ll INF = 1e15;
#define F first
#define S second
vector<vector<ll>>dist((1<<N),vecto... | ALGO | 0.999912 | 4.06495 |
a4f61bcd-f7be-404c-9887-0b4a3f8611f5 | Suraj-Dhankad2025/DSA-Problems-Leetcode | 3055-maximum-odd-binary-number/maximum-odd-binary-number.cpp | class Solution {
public:
string maximumOddBinaryNumber(string s) {
string ans="";
int one=0,zero=0;
for(auto i:s){
if(i=='0'){
zero++;
}
else{
one++;
}
}
while(one>1){
ans+='1';
... | ALGO | 0.999996 | 5.801518 |
7da88dba-7069-4d16-a7ee-2e3e2198a178 | HyeonGiMin/CodingTest | Programers/LV2/42746.cpp | //가장 큰 수
//https://school.programmers.co.kr/learn/courses/30/lessons/42746
//reference: https://velog.io/@dianestar/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4-%EA%B0%80%EC%9E%A5%ED%81%B0%EC%88%98
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
bool cmp(const string& a, const ... | ALGO | 0.99993 | 6.142272 |
44bfad77-1844-4a04-b913-7f03ebfefd83 | vishal7015s/DSA-SUPREME-4.0 | patterns/rhombus.cpp | #include<iostream>
using namespace std;
int main() {
int n;
cout<<"Enter the value of n: "<<endl;
cin>>n;
for(int i=1; i<=n; i++){
for(int j=1; j<=n-i; j++){
cout<<" ";
}
for(int j=1; j<=n; j++){
cout<<"* ";
}
cout<<endl;
}
retu... | ALGO | 0.999833 | 3.723924 |
eec56702-55c1-4609-8e7a-32b7b0076726 | bioexcel/bioexcel-exascale-co-design-benchmarks | GROMACS/nonbonded_benchmark/gromacs_source_code/src/gromacs/linearalgebra/gmx_lapack/dlasd0.cpp | #include "../gmx_lapack.h"
void
F77_FUNC(dlasd0,DLASD0)(int *n,
int *sqre,
double *d__,
double *e,
double *u,
int *ldu,
double *vt,
int *ldvt,
int *smlsiz,
int *iwork,
double *work,
int *info)
{
int u_dim1, u_offset, vt_dim1, vt_offset, i__1, i__2;
int i__, j, m, i1, ic, lf, nd, ll, nl, n... | ALGO | 0.999493 | 5.288697 |
618b25e1-8205-4591-89bc-ed006cd58d71 | dheerwani/competetive_coding | Stack_queue/largest_rectangle_in_histogram.cpp | class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
stack<int> s;
int area{0};
int maxArea{0};
int i=0;
for(i=0;i<heights.size();)
{
if(s.empty() == true || heights[s.top()] <= heights[i])
{
s.push... | ALGO | 0.999882 | 5.88999 |
7dd28c0d-f3ea-4ecd-9110-41017b28e86b | lhy-loveworld/LeetCode | 3_Math/#469_ConvPoly*.cpp | //#469. Convex Polygon
//Medium
//Method: cross product can be used to determine the relative direction of two vectors. x1y2 - x2y1
//Complexity: time O(n); space O(1)
class Solution {
public:
bool isConvex(vector<vector<int>>& points) {
if (points.size() < 3) return false;
if (points.size() == 3) ... | ALGO | 0.999956 | 6.134112 |
72c83d94-1b7a-4a82-8e04-34a4323251b2 | yliu-cs/ACM | HDU/HDU-2003.cpp | #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <set>
#include <map>
using namespace std;
#define mem(a,b) memset(a,b,s... | ALGO | 0.998181 | 3.771389 |
487e4f4f-2a20-4345-8ddb-093cbcf66ad5 | ryabich/cpp_programming | red_project/parse.cpp | #include "parse.h"
string_view Strip(string_view s) {
while (!s.empty() && isspace(s.front())) {
s.remove_prefix(1);
}
while (!s.empty() && isspace(s.back())) {
s.remove_suffix(1);
}
return s;
}
vector<string_view> SplitBy(string_view s, char sep) {
vector<string_view> result;
... | TOOL | 0.884737 | 5.506286 |
f320c7a2-cc0a-4957-8118-2b779cde3943 | VallabhPatil3078/DSAL | assign2.cpp | #include<bits/stdc++.h>
using namespace std;
class Node{
int data;
Node* left;
Node* right;
public:
Node(){
data = 0;
left = NULL;
right = NULL;
}
Node(int data){
this->data = data;
this->left = NULL;
this->right = NULL;
}
friend... | ALGO | 0.999807 | 4.154444 |
d205a5d7-5033-4059-9a98-fb5a2f0fcc66 | Mortpwr/openRUC | 程序设计/yoj/p292.cpp | #include<stdio.h>
#include<cmath>
double f(double x){
if(x <= 1 and x >= -1) return -x-1;
else return 1/(1+x*x);
}
int main(){
double a = 0;
scanf("%lf", &a);
double m = f(f(a));
printf("%.2lf", m);
return 0;
} | ALGO | 0.992621 | 3.314687 |
c5ad1488-2e51-45cc-8615-d2ce54b74d26 | Jazz-45/LeetCode | 0138-copy-list-with-random-pointer/0138-copy-list-with-random-pointer.cpp | /*
// Definition for a Node.
class Node {
public:
int val;
Node* next;
Node* random;
Node(int _val) {
val = _val;
next = NULL;
random = NULL;
}
};
*/
class Solution {
public:
void insertInBetween(Node* head){
Node* temp=head;
while(temp){
... | ALGO | 0.999485 | 5.159713 |
ffa07cbc-2688-484c-8728-6c83e21f424c | luwei0917/GlpG_Nature_Communication | src/CORESHELL/pair_buck_coul_long_cs.cpp | /* ----------------------------------------------------------------------
Contributing author: Hendrik Heenen (<EMAIL>)
------------------------------------------------------------------------- */
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "pair_buck_coul_long_cs.h"
#inclu... | ALGO | 0.997714 | 4.74932 |
caa1f573-8925-47ac-84f6-2d4df1cf5c96 | TriPhan0511/fundamentals-of-cpp-programming | chap-12-sorting-and-searching/flexibleintsort.cpp | #include <iostream>
#include <vector>
using std::cout;
using std::cin;
using std::vector;
/**
* less_than(a, b)
* Returns true if a < b; otherwise, returns false.
*/
bool less_than(int a, int b)
{
return a < b;
}
/**
* greater_than(a, b)
* Returns true if a > b; otherwise, returns false.
*/
bool greater_th... | ALGO | 0.999959 | 5.439602 |
777902df-daa1-4994-8370-85ae82945a9c | sourabh067/practice-problems | 2Darray/initializion.cpp | #include <iostream>
using namespace std;
int main() {
// 2Darrays or matrix or grid
// ways of initializaton
// way 1
int grid[2][3] = {{7,2,3},{0,1,6}};
// way 2
int mat[2][2];
mat[0][0] = 14;
mat[0][1] = 13;
mat[1][0] = 12;
mat[1][1] = 11;
// way 3
int m... | TOOL | 0.909155 | 3.05033 |
eb3a19c3-462b-4582-a527-477add35d274 | HackersUOP/codeBase | codeBase/CodeJam/2012/2012_3_A/2012_3_A.cpp | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cfloat>
using namespace std;
typedef pair<int, double> pr;
bool pairCompare(const pr &one, const pr &two) {
if (one.second == two.second) return one.first < two.first;
return one.second < two.second;
}
int ma... | ALGO | 0.99953 | 3.157406 |
aa9f6a33-8504-4407-b5c4-5852ef220072 | DragonBackGames/BookCocos2DX | CHAPTER_8/Template/TapAPlane/cocos2d/cocos/storage/local-storage/LocalStorageAndroid.cpp | /*
Local Storage support for the JS Bindings for iOS.
Works on cocos2d-iphone and cocos2d-x.
*/
#include "LocalStorage.h"
#include "CCPlatformMacros.h"
#if (CC_TARGET_PLATFORM == CC_PLATFORM_ANDROID)
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "jni.h"
#include "jni/JniHelper.h"
USING_NS_C... | TOOL | 0.921023 | 6.221775 |
d743df48-d24d-4e82-a23e-66ec73973a6f | Iman-Howlader/Competitive-Programming | BootCamp-S16/LightOJ-Beg/B_Homework.cpp | /**
* Author : iman321
* Created: 2024-02-16 22:28:59
**/
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define nl '\n'
#define ll long long
#define all(x) x... | ALGO | 0.999962 | 3.95124 |
0369646a-ecb5-447f-b83a-589f99c40583 | chiaminchuang/Leetcode | Medium/553-Optimal Division/533.cpp | class Solution {
public:
string optimalDivision(vector<int>& nums) {
if(nums.size() == 1)
return to_string(nums[0]);
else if(nums.size() == 2)
return to_string(nums[0]) + "/" + to_string(nums[1]);
string res = to_string(nums[0]) + "/(" + to_string(nums[1]);
... | ALGO | 0.999038 | 6.161556 |
c6d488fb-55d1-427f-b0bc-271f8f62db2e | Abhishekkumarr2001/C-CPP-Programming | MinimumandMaximuminArray.cpp | // Program To Find Maximum/Minimum Value Among Array Elements
#include<iostream.h>
#include<conio.h>
void main()
{
int a[10],small,large;
cout<<"\nEnter array elements :";
for(int i=0;i<10;++i)
cin>>a[i];
small=a[0],large=a[0];
for(i=1;i<10;++i)
{
... | ALGO | 0.99907 | 3.517207 |
d33573d0-da52-47b0-93d4-e59e8112958f | SatakeIsao/CrazyDelivery_stk | GameTemplate/k2EngineLow/ExEngine/Photon/Demos/etc-bin/cocos2d/cocos/math/MathUtil.cpp | #include "math/MathUtil.h"
#include "base/ccMacros.h"
#if (CC_TARGET_PLATFORM == CC_PLATFORM_ANDROID)
#include <cpu-features.h>
#endif
//#define USE_NEON32 : neon 32 code will be used
//#define USE_NEON64 : neon 64 code will be used
//#define INCLUDE_NEON32 : neon 32 code included
//#define INCLUDE_N... | TOOL | 0.964202 | 6.360316 |
d7f0a665-7cc9-4ff8-87b3-4b9cdb7b1da8 | jagadeeshnelaturu/codeforces_solutions | 509B.cpp | #include <iostream>
#include <climits>
int main() {
int n, k;
std::cin >> n >> k;
int *values = new int[n], min = INT_MAX, max = INT_MIN;
for(int i = 0; i < n; ++i) {
std::cin >> values[i];
min = std::min(min, values[i]);
max = std::max(max, values[i]);
}
int temp;
if(max - min > k) {
std... | ALGO | 0.99999 | 3.615018 |
3695a805-5508-4951-a0f7-6ff2e6c98ae4 | sung2708/MyHackerRank_Problem | algorithms/birthdayCakeCandles.cpp | #include <bits/stdc++.h>
using namespace std;
int birthdayCakeCandles(vector<int> candles)
{
unordered_map<int, int> m;
for (int i = 0; i < candles.size(); i++)
{
m[candles[i]]++;
}
int cnt = 0;
int maxHeight = 0;
for (auto pair : m)
{
if (maxHeight < pair.first)
... | ALGO | 0.999694 | 5.126573 |
b51d3dea-ea05-48b6-9330-92a198ea92ed | Gayatri511/codsoft | 3rdtask.cpp | #include <iostream>
char board[3][3] = { {'1', '2', '3'}, {'4', '5', '6'}, {'7', '8', '9'} };
char currentPlayer = 'X';
void displayBoard() {
std::cout << "\n";
std::cout << " " << board[0][0] << " | " << board[0][1] << " | " << board[0][2] << "\n";
std::cout << "---|---|---\n";
std::cout << " " << bo... | ALGO | 0.984168 | 6.880526 |
5210cd05-a7cb-4ead-84f4-0f6cdcf2fd26 | bytedance/terark-zip | 3rdparty/boost-include/libs/graph/example/graph.cpp | #include <boost/graph/adjacency_list.hpp>
using namespace boost;
using namespace std;
typedef property<vertex_color_t, default_color_type,
property<vertex_distance_t,int,
property<vertex_degree_t,int,
property<vertex_in_degree_t, int,
property<vertex_out_degree_t,int> > > > > VertexPropert... | ALGO | 0.992263 | 5.325485 |
fd31ab9b-0407-4009-8107-c9aa6f833175 | QuadDarv1ne/maestro7it_education | leetcode/Medium/cpp/238. Product of Array Except Self.cpp | /**
* https://leetcode.com/problems/product-of-array-except-self/?envType=study-plan-v2&envId=top-interview-150
*/
#include <vector>
using namespace std;
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
int n = nums.size();
vector<int> answer(n);
// Префиксный... | ALGO | 0.999975 | 6.665041 |
1428094c-a94c-4420-9237-0b9d184b6da2 | Sunsun24/MRS | libraries/AP_Soaring/ExtendedKalmanFilter.cpp | #include "ExtendedKalmanFilter.h"
#include "AP_Math/matrixN.h"
float ExtendedKalmanFilter::measurementpredandjacobian(VectorN<float,N> &A, float Px, float Py)
{
// This function computes the Jacobian using equations from
// analytical derivation of Gaussian updraft distribution
// This expression gets used... | ALGO | 0.99869 | 6.373178 |
1a7c4643-4438-44c7-8360-ee3c139cbbb7 | YulMakabula/Informatyka | RekurencjaZad1.cpp | #include <iostream>
using namespace std;
int GetNumberFromUser() {
int n;
cout << "Podaj liczbe: ";
cin >> n;
return n;
}
int CalculateSumRecursive(int n) {
if (n == 1)
return 1;
else
return n + CalculateSumRecursive(n - 1);
}
void DisplayResult(int n, int suma) {
cout << "Suma liczb ... | ALGO | 0.999605 | 4.931543 |
49e1817e-1391-4507-be65-9415b703efec | uncle-lu/CSES-Solutions | code/1637.cpp | #include <algorithm>
#include <cstdio>
#include <cstring>
const int N = 1e6 + 10;
int F[N], n;
bool has(int x, int t) {
while (x != 0) {
if (x % 10 == t)
return true;
x /= 10;
}
return false;
}
int main() {
scanf("%d", &n);
memset(F, 0x7f, sizeof(F));
F[0] = 0;
... | ALGO | 0.999739 | 4.557104 |
93e3056d-2ba4-4cfd-94cf-bde8cf988734 | walkccc/LeetCode | solutions/1391. Check if There is a Valid Path in a Grid/1391.cpp | class Solution {
public:
bool hasValidPath(vector<vector<int>>& grid) {
const int m = grid.size();
const int n = grid[0].size();
// g := upscaled grid
vector<vector<bool>> g(m * 3, vector<bool>(n * 3));
for (int i = 0; i < m; ++i)
for (int j = 0; j < n; ++j)
switch (grid[i][j]) {
... | ALGO | 0.999938 | 6.36953 |
be937871-bd38-49d4-a965-5d45572f6fc2 | cbjddd/Data-Structures-And-Algorithms | SqStack.cpp | #include <iostream>
using namespace std;
typedef char SElemType;
typedef int Status; /* StatusǺֵͣΪִн״̬룬ERROROKTRUEFALSE*/
# define MAXSIZE 20
# define ERROR 0
# define OK 1
# define TRUE 1
# define FALSE 0
typedef struct /* ַ˳ջ */
{
SElemType data[MAXSIZE];
int top;
}SqStack;
typedef struct//˳ջ
{
int data[MAXSIZ... | ALGO | 0.984598 | 3.379277 |
64fcb589-e9c4-45cf-9515-8665ea25004d | YoonJunHyeok/PS | 프로그래머스/3/118668. 코딩 테스트 공부/코딩 테스트 공부.cpp | #include <string>
#include <vector>
#include <climits>
#include <algorithm>
#define alp_req 0
#define cop_req 1
#define alp_rwd 2
#define cop_rwd 3
#define cost 4
using namespace std;
int dp[152][152];
int solution(int alp, int cop, vector<vector<int>> problems) {
int max_alp = -1, max_cop = -1;
for(au... | ALGO | 0.998857 | 4.372019 |
6e1b0253-30e4-48e4-815e-f8fd5c7785a5 | Transference-OperatorHaven/Programming-Fundamentals-Assessment-1 | Assessment 1/task-5/main.cpp | #include <iostream>
#include <string>
using namespace std;
string userInput;
bool capitaliseNextCharacter = true;
int alphaChecker = 0;
bool inputLoop = true;
void main()
{
//Make a program which converts any given string to sentence case. For example:
// Please enter some text: hello this is a sentence. an... | TOOL | 0.992693 | 4.634768 |
e1258d3a-7645-4abe-b205-5ba432505390 | alioth-aosp/frameworks_av | media/libeffects/lvm/lib/Common/src/LVC_MixSoft_1St_2i_D16C31_SAT.cpp | /**********************************************************************************
INCLUDE FILES
***********************************************************************************/
#include <system/audio.h>
#include "LVC_Mixer_Private.h"
#include "VectorArithmetic.h"
#include "ScalarArithmetic.h"
/*************... | ALGO | 0.990218 | 6.278666 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.