uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
477dc35b-30a5-41cb-b697-2736c95e637f | yoon20002000/DataStructure | Pracs/Prac16/Sort/QuickSort/Quick16.cpp | #include "Quick16.h"
#include <algorithm>
#include <filesystem>
int Quick16::partition(int* arr, int low, int high)
{
int pivotIndex = low;
int pivotValue = arr[low];
for (int l = low + 1; l <= high; ++l)
{
if (arr[l] < pivotValue)
{
++pivotIndex;
std::swap(arr[... | ALGO | 0.998385 | 5.631001 |
2321fd78-da75-44ce-956c-2b9e5df6bd2d | xenharmonic/Cpp-Learning-Progress | rock_paper_scissors/rock_paper_scissors.cpp | #include <iostream>
#include <vector>
using namespace std;
string player_choose() {
while (true) {
cout << "rock, paper, scissors?\n";
string choice;
cin >> choice;
if (choice != "rock" && choice != "paper" && choice != "scissors") {
cout << "Not a valid move, try again... | ALGO | 0.945894 | 4.559228 |
fd1e2579-f713-4416-be4b-a1d8465049d9 | RIYANSHGARG/DSA | DSA1/5. Priority queue/InBuiltPQ.cpp | #include <iostream>
#include <queue>
using namespace std;
int main()
{
priority_queue<int> p;
p.push(10);
p.push(50);
p.push(30);
p.push(20);
p.push(5);
// cout<<p.pop()<<endl;
cout << p.top() << endl;
p.pop();
cout << p.top() << endl;
cout << p.empty() << endl;
cout <<... | ALGO | 0.991573 | 3.855506 |
4a812d2a-7a12-439d-b7f1-67f136a78069 | Moyeon7/sem3 | OOPS/Expt9/92.cpp | #include<iostream>
using namespace std;
template<class T>
class vector{
T *v; int size;
public:
vector(T a){
size=a;
v=new T[size];
for(int i=0; i<size; i++){
v[i]=0;
}
}
void getdata();
void modify(T c);
v... | ALGO | 0.996853 | 3.256684 |
6c55b524-cad9-4bf7-bdd9-79dc6e7455d9 | Abhishek-Verma0/awesome-Leetcode-Daily | Leetcode2025/June/386-LexicographicalNumbers.cpp | class Solution {
public:
// This function generates numbers from 1 to n in lexicographical (dictionary) order
vector<int> lexicalOrder(int n) {
vector<int> res; // Vector to store the result
// Start DFS from 1 to 9, because numbers can't start with 0
for (int i = 1; i <= 9; i++) {
... | ALGO | 0.999261 | 7.204411 |
0ab96b5a-faa9-457b-bcdb-d3ef59886959 | Smorodov/Multitarget-tracker | src/Detector/BackgroundSubtract.cpp | #include "BackgroundSubtract.h"
#include <tuple>
//----------------------------------------------------------------------
//
//----------------------------------------------------------------------
BackgroundSubtract::BackgroundSubtract(BGFG_ALGS algType, int channels)
:
m_channels(channels),
m_algType... | TOOL | 0.901953 | 6.101321 |
82c80f5b-0555-4a28-8d6e-8d63e99383c7 | SuEric/ADA | ADA/TablaHash.cpp | #include "TablaHash.h"
TablaHash::TablaHash() {
tam = 100;
tabla.reserve(tam);
for (int i = 0; i < tam; i++)
tabla[i] = *new Lista();
}
TablaHash::TablaHash(int _tam) {
tam = _tam;
tabla.reserve(tam);
for (int i = 0; i < tam; i++)
tabla[i] = *new Lista();
}
TablaHash... | ALGO | 0.950738 | 4.151223 |
8b19a75e-5f5c-49c3-b1b3-84b63eb4abdf | sahilwep/DSA-Workspace | DP-Aditya-Verma/06_Identification_of_Knapsack_Problems_and_Introduction.cpp | /*
// 6 Identification of Knapsack Problems and Introduction
// Knapsack 0-1:
* Like In Earlier, example we are given item that has some weight & value, Does'nt matter we are given value or not, if any question given with some choice, & we have a certain fix capacity, we can use knapsack.
* Whenever we are... | ALGO | 0.999999 | 5.20326 |
12d1f4e1-2e3d-46a7-afc8-ce7a285abced | tamofplease/atcoder_abc | abc137/d/main.cpp | #include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
#define ll int64_t
const int MOD = 1000000007;
using P = pair<int, int>;
bool comp(const P& a, const P& b) {
if (a.... | ALGO | 0.99968 | 4.118516 |
08fe08b7-6b85-409f-8239-8b03f366050e | saurabhraj042/placement-prep | leetcode/strings/139.word-break.cpp | class Solution {
public:
bool wordBreak(string s, vector<string>& wordDict) {
unordered_set<string> a;
for(auto x:wordDict) a.insert(x);
vector<int> dp(size(s),-1);
return soln_1(0,s,a,dp);
}
bool soln_1(int start,string s,unordered_set<string> &a,vector<int> &d... | ALGO | 0.999749 | 6.052002 |
84503e38-dead-4570-afe6-c5c7d5153112 | medisp/CarND-MPC-Project | src/Eigen-3.3/doc/examples/tut_arithmetic_matrix_mul.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
Matrix2d mat;
mat << 1, 2,
3, 4;
Vector2d u(-1,1), v(2,0);
std::cout << "Here is mat*mat:\n" << mat*mat << std::endl;
std::cout << "Here is mat*u:\n" << mat*u << std::endl;
std::cout << "Here is u^T*mat:\n" << u.transpo... | ALGO | 0.998531 | 3.818773 |
16dfe21d-f37c-4740-b313-bb2fa35a0a58 | Yavuz7/Quake4RACMod | mpgame/ai/Monster_Fatty.cpp | /*
================
Monster_Fatguy.cpp
AI for the fat guy on the putra level
================
*/
#include "../../idlib/precompiled.h"
#pragma hdrstop
#include "../Game_local.h"
#include "../Projectile.h"
typedef struct monsterFattyChain_s {
jointHandle_t orientationJoint;
jointHandle_t attackJoint;
bool ... | TOOL | 0.868932 | 5.504882 |
dd85c43b-3350-4a03-8987-d9083035be59 | yin-roc/Cprimerplus_code | test.cpp | #include <iostream>
int main() {
std::string x, y, z;
std::cin >> x >> y >> z;
// 问题1：x、y、z三个变量中各取1个字符组合成新字符电的组合数量
int total_combinations_1 = x.size() * y.size() * z.size();
// 问题2：x、y、z每2个变量中各取1个字符组合成新字符毕的组合数量
int total_combinations_2 = x.size() * y.size() + x.size() * z.size() + y.s... | ALGO | 0.999225 | 4.15536 |
25a20370-9003-415e-abe8-b9b2dba41749 | SatGit1997/BMI_Calculator | 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 |
451d439f-0f79-4922-854a-e2fa53b7220e | antonioalmeida/feup-cal | src/MarketDeliverySystem.cpp | #include <map>
#include "MarketDeliverySystem.h"
#include "matcher.h"
MarketDeliverySystem::MarketDeliverySystem() {
TRUCK_CAPACITY = 10;
gv = NULL;
}
MarketDeliverySystem::MarketDeliverySystem(string &nodesFile, string &edgesFile) {
gv = NULL;
fillColorMap();
ifstream nodes, edges;
string line;
TRUCK_CAPACIT... | ALGO | 0.997113 | 3.156159 |
f4076ad9-1a09-4fd6-bfd6-8fba2019a8ea | kash1sh/practice_ques_cp | C_Phoenix_and_Towers.cpp |
// #include <bits/stdc++.h>
// #define ll long long
// #define pb push_back
// #define vll vector<ll>
// #define vpll vector<pair<ll, ll>>
// #define fo(i, k, n) for (ll i = k; i < n; i++)
// #define fo1(i, k, n) for (ll i = k; i <= n; i++)
// #define Endl endl
// #define ff first
// #define ss second
// #define setb... | ALGO | 0.999993 | 4.050099 |
0788d4a0-f8c3-4e84-b474-67ec94c4da1f | QTune1603/SPOJ | FIBOIT.CPP | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main()
{
int n;
cin >> n;
int f1 = 0, f2 = 1, res;
for (int i = 2; i <= n; ++i)
{
res = (f1 + f2) % mod;
f1 = f2;
f2 = res;
}
cout << res;
return 0;
} | ALGO | 0.999965 | 4.625718 |
b80fb681-a55b-4d14-98d9-7f9ec539f345 | getoxdev/SDE_Interview_Problems | Day 20-26/Day 20/Q4.cpp | #include<bits/stdc++.h>
#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
using namespace std;
//Check if a Binary Tree is a BST or not
struct Node {
int data;
Node *left;
Node *right;
Node(int val) {
data = va... | ALGO | 0.999637 | 4.448966 |
2d013429-c2f0-49a1-91a0-3565c6bea5c2 | Mustafa-Mohamed26/competitive_programming | CodeForces/122A_Lucky Division/main.cpp | #include <iostream>
#include <cmath>
#include <set>
using namespace std;
bool isLucky(int num) {
while (num > 0) {
int digit = num % 10;
if (digit != 4 && digit != 7) {
return false;
}
num /= 10;
}
return true;
}
bool isAlmostLucky(int n) {
for (int i = 1... | ALGO | 0.999754 | 5.43485 |
a002d474-7c7f-47ea-bfd2-6e6865461621 | sumit-kakde/LeetCode-Problems | 0081-search-in-rotated-sorted-array-ii/0081-search-in-rotated-sorted-array-ii.cpp | class Solution {
public:
bool search(vector<int>& nums, int target) {
int low=0;
int high=nums.size()-1;
while(low <=high){
int mid=low +(high-low)/2;
if(nums[mid]==target)return true;
if (nums[low]==nums[mid] && nums[mid]==nums[high]) {
lo... | ALGO | 0.999991 | 6.167795 |
16226717-8713-457f-9cc5-99e9f231b975 | linux4life798/llvm-project-ci-test | lldb/test/API/tools/lldb-dap/instruction-breakpoint/main.cpp | #include <stdio.h>
#include <unistd.h>
int function(int x) {
if (x == 0) // breakpoint 1
return x;
if ((x % 2) != 0)
return x;
else
return function(x - 1) + x;
}
int main(int argc, char const *argv[]) {
int n = function(2);
return n;
} | ALGO | 0.999256 | 4.729483 |
fb03e8cb-f8f1-48d0-99a4-b4929054c7a7 | gajendra0180/LeetCode | 2491-divide-players-into-teams-of-equal-skill/2491-divide-players-into-teams-of-equal-skill.cpp | class Solution {
public:
long long dividePlayers(vector<int>& skill) {
int s=0;
for(auto i:skill){
s+=i;
}
s/=skill.size()/2;
sort(skill.begin(),skill.end());
long long i=0,j=skill.size()-1,ans=0;
while(i<j){
if(skill[i]+skill[j]!=s)
... | ALGO | 0.999985 | 5.298045 |
7437e4df-fff1-48da-8d5b-95a063b196d9 | rimo02/Leetcode | Sorting/quickSort.cpp | #include <iostream>
#include <vector>
using namespace std;
void printarr(vector<int> &arr)
{
for (int i = 0; i < arr.size(); i++)
{
cout << arr[i] << " ";
}
cout << endl;
}
int Partition(vector<int> &arr, int lb, int ub)
{
int pivot = arr[lb];
int start = lb;
int end = ub;
while ... | ALGO | 0.999976 | 5.1561 |
2ca9b341-cff5-4113-9de2-c33d544117cd | MLops34/DSA-Preparation | Data-Structures& Algorithm/Recursion/PatternID.cpp | class Solution {
public:
bool matchesPattern(string &pattern, string &num){
for(int i=0;i<pattern.size();i++){
if(pattern[i]=='I' && num[i] > num[i+1]|| pattern[i]=='D' && num[i] < num[i+1]) return false;
}
return true;
}
string smallestNum... | ALGO | 0.999956 | 6.325645 |
cd91db37-5e2a-4975-8ef4-73a234a01f08 | obiwac/freebsd-s0ix | contrib/llvm-project/llvm/lib/Support/IntEqClasses.cpp | #include "llvm/ADT/IntEqClasses.h"
#include <cassert>
using namespace llvm;
void IntEqClasses::grow(unsigned N) {
assert(NumClasses == 0 && "grow() called after compress().");
EC.reserve(N);
while (EC.size() < N)
EC.push_back(EC.size());
}
unsigned IntEqClasses::join(unsigned a, unsigned b) {
assert(NumC... | ALGO | 0.977029 | 6.404566 |
d7e56544-76ee-439b-ad75-3436596c83a5 | Cillebokin/ProAlgorithm | code/src/03_MoveZeroes.cpp | #include "../include/03_MoveZeroes.h"
#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
using namespace std;
void MoveZeroes(vector<int>& nums)
{
int reSize = nums.size();
vector<int>::iterator it = remove(nums.begin(), nums.end(), 0);
nums.erase(it, nums.end());
reSize -= nums.size()... | ALGO | 0.998762 | 5.811501 |
101cabb9-f40f-451e-83ee-f3a00582a217 | ishandutta2007/codeforces | shadowlight/normal/1574/B.cpp | #include <bits/stdc++.h>
#define ll long long
#define db long double
#define ull unsigned long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
using namespace std;
#define pper(a) cerr << #a << " = " << a << endl;
void per() { cerr << endl; }
template... | ALGO | 0.999972 | 4.403229 |
adc14e50-fb18-4944-a838-72fe476ae8c2 | nilsmo1/Codeforces | A/IsYourHorseshoeOnTheOtherHoof.cpp | #include <iostream>
#include <set>
using namespace std;
using ll = int64_t;
#define endline '\n';
int main() {
ll s1, s2, s3, s4;
set<ll> shoes;
cin >> s1 >> s2 >> s3 >> s4;
shoes.insert(s1);
shoes.insert(s2);
shoes.insert(s3);
shoes.insert(s4);
cout << 4 - shoes.size() << endline;
... | ALGO | 0.999139 | 4.253321 |
dbac023f-c407-43dd-9dc4-ac8c76f931b3 | lesley-zhang/essential_c- | Essential_CPP-main/chapt3/3_02.cpp | #include <iostream>
#include <vector>
#include <list>
#include <string>
using namespace std;
template<typename ItType, typename elemType>
ItType find(ItType first, ItType last, const elemType & value)
{
for(; first != last; ++first)
{
if(*first == value)
return first;
}
return last;... | TOOL | 0.972872 | 3.946163 |
5a8d5b1e-a6d0-4a25-8472-15936393b775 | Subzero-10/leetcode | .history/56.merge-intervals_20200727164145.cpp | /*
* @lc app=leetcode id=56 lang=cpp
*
* [56] Merge Intervals
*
* https://leetcode.com/problems/merge-intervals/description/
*
* algorithms
* Medium (38.08%)
* Likes: 4392
* Dislikes: 297
* Total Accepted: 614.7K
* Total Submissions: 1.6M
* Testcase Example: '[[1,3],[2,6],[8,10],[15,18]]'
*
* Give... | ALGO | 0.999997 | 6.102522 |
a72f7cb4-dee3-4987-aa00-0302e4b15464 | Yash-Oza-ui/DSA-LAB-MAP | longest-consecutive-sequence.cpp | class Solution {
public:
int longestConsecutive(vector<int>& nums) {
unordered_set<int> numSet(nums.begin(), nums.end());
int longest = 0;
for (int num : numSet)
{
if (numSet.find(num - 1)==numSet.end())
{
... | ALGO | 0.999891 | 5.572985 |
ed2fe930-a1e0-4ede-b133-8f967e43cbd7 | ishita37381/CrackYourPlacement | day 16/Find the City With the Smallest Number of Neighbors at a Threshold Distance.cpp | class Solution {
public:
int findTheCity(int n, vector<vector<int>>& edges, int distanceThreshold) {
vector<vector<int>>dist(n,vector<int>(n,1000000000));
for(int i=0;i<n;i++){
dist[i][i]=0;
}
for(auto it:edges){
dist[it[0]][it[1]]=it[2];
dist[it[1... | ALGO | 0.999995 | 6.20749 |
2561b79f-b05f-4a52-9655-c4045e92a1a1 | arturo-olvrs/ED | Práctica 01/Búsqueda_Lineal.cpp | #include <iostream>
#include <ctime> // Recursos para medir tiempos
#include <cstdlib> // Para generación de números pseudoaleatorios
using namespace std;
/**
* @brief Función que implementa la búsqueda lineal en un vector.
* @param v Vector en el que se realiza la búsqueda.
* @param n Número de elementos del v... | ALGO | 0.992162 | 4.557276 |
2f544d8e-a14d-4517-89b6-941b8fa15f36 | yashdkadam/CrackYourPlacement | stacks_and_queues/rotten-oranges.cpp | class Solution
{
public:
//Function to find minimum time required to rot all oranges.
int orangesRotting(vector<vector<int>>& grid) {
int n = grid.size();
int m = grid[0].size();
queue<pair<pair<int, int>, int>> q;
int vis[n][m];
for(int i = 0; i < n; i++){
... | ALGO | 0.999875 | 6.059318 |
99d545fd-b8fa-461e-8bcc-c3ed0efec7e3 | sanyukta001/cppPrograms | Stack/stack_m.cpp | #include "stack.h"
int main()
{
Stack ob;
ob.init(5);
for(int i = 1; i < 5; i++)
ob.push(5*i);
ob.display();
ob.push(25);
ob.push(30);
ob.display();
item x = ob.pop();
if(x != -99999)
cout<<"The poped item is "<<x<<endl;
ob.display();
return 0;
} | ALGO | 0.990385 | 3.992092 |
5f14d73f-e97d-48cc-9c9f-2ca6759409dc | DexterSamir/CodeVentures | Toph/Remove duplocates.cpp | #include <bits/stdc++.h>
using namespace std;
//Author: Ezio Sam
/* Shorthands */
#define ll long long
#define pb push_back
#define mp make_pair
#define sp ":"
#define cs "Case #"
#define fi first
#define sn second
#define po(x) x*x
/* STL */
#define vi vector<int>v
#define pii pair<int,int>
#define pll pair<ll,ll>
#... | ALGO | 0.999478 | 3.529825 |
1425c6ad-1d62-4bb9-9c90-9117c885f2fd | itiut/sutra-copying | algorithm-wo-manabou/01/01_04.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool contsins(int v, vector<int> vs) {
int low = 0;
int high = vs.size() - 1;
while (low < high) {
int mid = (low + high) / 2;
if (vs[mid] < v) {
low = mid + 1;
} else if (vs[mid] > v) {
... | ALGO | 0.999349 | 5.258015 |
02221522-e207-4862-9b55-9c6c5e4f64ba | JohnDoe86/LC_Solution | cpp/429.narraylevelorder.cpp | /*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val) {
val = _val;
}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public:
vector<vector<int>> levelOr... | ALGO | 0.999984 | 6.104253 |
6f8bab91-2e32-4038-888d-c6afbd818d3b | suncongxd/ReCFA | src/folding/greedy.cpp | #include "fold-api.hpp"
#include <iostream>
#include <stdio.h>
#include <string.h>
#define BOUND 32 // BOUND窗口最大长度
#define BUFFSIZE 1024 * 10 // BUFFSIZE的大小
#define LEN 2048
/*
运行指令: ./fold 待去重的文件名
输出结果为去重后的文件
*/
using namespace std;
void printArray(int array[], int start, int sz);
void arraycopy(int *a, ... | TOOL | 0.948568 | 3.801399 |
fc2761f7-ec82-48f0-805c-3dd587655e5b | sinian666/code_102_5 | cpp_副本12/chapter_tree/binary_search_tree.cpp | /**
* File: binary_search_tree.cpp
* Created Time: 2022-11-25
* Author: Krahets (<EMAIL>)
*/
#include "../utils/common.hpp"
/* 二叉搜索树 */
class BinarySearchTree {
private:
TreeNode *root;
public:
BinarySearchTree(vector<int> nums) {
sort(nums.begin(), nums.end()); // 排序数组
ro... | ALGO | 0.999931 | 6.349885 |
ba7aae88-cb71-4109-8fb6-3e5b2be82e61 | yyatsuo/atcoder | abc028/c.cpp | #include <bits/stdc++.h>
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(int i=0; i<n; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
template<class T> inline bool chmax(T& a, T ... | ALGO | 0.999951 | 4.638722 |
424c1c7e-f34a-4a32-ac4a-611119109089 | badhon1512/Algorithms | CW/More/count.cpp | #include<iostream>
//#include<algorithm>
using namespace std;
void display(int *array, int size) {
for(int i = 1; i<=size; i++)
cout << array[i] << " ";
cout << endl;
}
int getMax(int array[], int size) {
int max = array[1];
for(int i = 2; i<=size; i++) {
if(array[i] > max)
max = array[... | ALGO | 0.999951 | 4.458205 |
cc2447eb-e5a8-4a24-9d88-5101a81ad935 | blras/Programmers | 프로그래머스/1/12977. 소수 만들기/소수 만들기.cpp | #include <vector>
#include <iostream>
using namespace std;
int solution(vector<int> nums)
{
vector<bool> p;
for (int i = 0; i < 3000; i++)
{
p.push_back(false);
}
vector<int> prime;
prime.push_back(2);
prime.push_back(3);
prime.push_back(5);
p[2] = true;
p[3] = true;
... | ALGO | 0.999812 | 4.729891 |
b157ea8c-8242-47c9-bdd9-a0fc300fa8eb | dreadcraftteam/Team-Conflict | src/utils/vrad/trace.cpp | //=============================================================================
#include "vrad.h"
#include "trace.h"
#include "Cmodel.h"
#include "mathlib/vmatrix.h"
//=============================================================================
class CToolTrace : public CBaseTrace
{
public:
CToolTrace() {}
Vecto... | ALGO | 0.995624 | 6.159751 |
5b71b1ed-df66-4904-a677-95de08c82608 | abdurrahim22053/Problems-with-C-Plus-Plus-Language | C++ Learning/factorialsum.cpp | #include<iostream>
using namespace std;
int main (){
int n,fact=1,sum=0;
cout<<"Enter a number:"<<endl;
cin>>n;
for(int i=1;i<=n;i++){
fact=fact*i;
sum=sum+fact;
}
cout<<"The summation of the series is="<<endl<<sum<<endl;
return 0;
} | ALGO | 0.999905 | 3.92738 |
1088af19-d49e-481b-b93e-7d62c634c8a0 | sam41290/SAFER | src/disasm/disasm.cpp | #include "disasm.h"
#include "globals.h"
#include <dis-asm.h>
#include <stddef.h>
#include <stdarg.h>
void
DisasmEngn::createInsCache(uint64_t code_start, uint64_t code_end) {
//Performs linear disassembly of a code block between two code pointers and
//stores the result instruction cache.
//This cache will be u... | TOOL | 0.947343 | 4.769083 |
459643a4-0006-49bd-a827-69d3261661c5 | xu-wang11/GSkyline | GSkyline/gskyline.cpp | #include "gskyline.h"
#include <fstream>
#include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
bool comparePoint(Point* a, Point* b)
{
return (*a < *b);
}
bool comparePointByLayer(Point* a, Point* b){
return a->layer < b->layer;
}
GSkyline::GSkyline(string filename)
{
this->load(fi... | ALGO | 0.998328 | 3.146022 |
411965b9-6a19-4320-91ec-83a08290cfd3 | ayush-kumar774/Competitive-Programming | Codeforces/A. Sereja And Dima.cpp | // https://codeforces.com/problemset/problem/381/A
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fast ios_base::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0) ;
#define endl '\n'
void solve()
{
int n ;
cin >> n ;
vector<int> v ;
for(auto &x : v) cin >> x ;
int Se... | ALGO | 0.999942 | 3.948914 |
e047646d-7efc-49db-9eb2-f2888eabb065 | Delta-Robotics-Inc/TF-Node-Firmware | test/test-cpp/TrainingTest.cpp | /*=============================================================================
* A test script for the GradientTracker class.
* This script adds data to the tracker, then finds the local minimum of that data
*=============================================================================*/
#include "GradientTracker.cpp... | ALGO | 0.862805 | 5.728859 |
c7bc1bf7-1dc5-4397-91a5-0c9bb19c70bc | fuzhanmeng/cpp | bookcodes/chapter16/vect1.cpp | // vect1.cpp -- introducing the vector template
#include <iostream>
#include <string>
#include <vector>
const int NUM = 5;
int main()
{
using std::vector;
using std::string;
using std::cin;
using std::cout;
using std::endl;
vector<int> ratings(NUM);
vector<string> titles(NUM);
cout << ... | ALGO | 0.988507 | 4.581243 |
cbd1b87e-f793-4fa1-9119-c72b1aaac3a5 | neerajkabir/DSP_codes_cpp | signal_convolution/signal_conv_algo/main.cpp | #include <iostream>
#include<fstream>
#define SIG_LENGTH 320
#define IMP_LENGTH 29
using namespace std;
extern double InputSignal_f32_1kHz_15kHz[SIG_LENGTH];
extern double Impulse_response[IMP_LENGTH];
double output_signal[SIG_LENGTH+IMP_LENGTH];
//void convolution(double *sig_src_arr, double *sig_dest_arr, double *im... | ALGO | 0.985715 | 3.911648 |
c581543a-6a65-4b38-9444-608411939b5e | GusteSL/SingleDog | 1291.顺次数.cpp | /*
* @lc app=leetcode.cn id=1291 lang=cpp
*
* [1291] 顺次数
*/
// @lc code=start
class Solution {
public:
vector<int> sequentialDigits(int low, int high) {
}
};
// @lc code=end
| ALGO | 0.999734 | 5.810761 |
adcaa5d1-9654-43a7-9240-d45929989f3a | ifradK/Competitive-Programming-Solutions | C++ Programs/IUT long contest (Number Theory)/X.cpp | #include<iostream>
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
using namespace std;
long long phi[1000002], ans[1000002];
void ETF()
{
for(long long i=1; i<=1000000; i++)
{
phi[i]=i;
}
for(long long i=2; i<=1000000; i+... | ALGO | 0.999947 | 4.595871 |
7fc835df-dddf-499a-bb10-607114d055d7 | seunghyukcho/algorithm-problems-solved | USACO/money.cpp | /*
ID : choseun1
TASK : money
LANG : C++11
*/
#include<iostream>
#include<vector>
using namespace std;
long long D[10002];
vector<int> coin;
int v, n;
int main(){
freopen("money.in","r", stdin);
freopen("money.out","w", stdout);
cin >> v >> n;
for(int i = 0; i < v; i++){
int num;
cin >> num;
coin.push_ba... | ALGO | 0.999872 | 3.85017 |
d3a69818-b145-4d49-b49b-eb2746f085ed | codulluiandrei/pbinfo | pbinfo-3200/main.cpp | #include <iostream>
using namespace std;
long long int n, k, x;
long long int nrcif = 0, scif = 0, r1, r2, rest;
int main() {
cin >> n >> k;
if (k == 1) rest = n % 72;
else { x = n;
while(x != 0) {
nrcif++;
scif = scif + x % 10;
x = x / 10;
} scif = scif *... | ALGO | 0.999776 | 3.532788 |
4e8de353-fa59-4056-a29e-c587eae7cd98 | mandalsudipti/competitive_programming | codeforces/RPD and rap sheet.cpp | #include<bits/stdc++.h>
using namespace std ;
int main()
{
int T ;
cin>>T;
while(T--)
{
int n , k , r;
cin>>n>>k;
for(int i = 1 ; i <= n ; i++)
{
long long int query ;
if(i == 1)
query = 0 ;
else
... | ALGO | 0.999418 | 3.051341 |
5d25c651-2be8-46c5-b8d3-0d9e71bffbf7 | AkashCherukuri/CC | Solns/Chap1/Ad-Hoc/test.cpp | # include "bits/stdc++.h"
# include <cmath>
# include <algorithm>
# include <cstring>
# include <cstdio>
# define vi vector<int>
# define vvi vector<vi>
# define pi pair<int, int>
# define vii vector<pi>
# define rep(i,a,b) for(int i=a; i<b; i++)
# define ll long long int
# define fast ios_base::sync_with_stdio(false)... | ALGO | 0.998645 | 3.340144 |
82a39e96-4620-4eaf-b372-1effc84b66e4 | kranthivarm/leetcodeDaily | 1488-sort-integers-by-the-power-value/sort-integers-by-the-power-value.cpp | class Solution {
public:
int recursion(int n,unordered_map<int,int>&con){
// cout<<n<<" ";
if(con[n]>0)return con[n];
if(n%2)con[n]=recursion((3*n)+1,con)+1;
else con[n]=recursion(n/2,con)+1;
return con[n];
}
int getKth(int lo, int hi, int k) {
unordered_ma... | ALGO | 0.999986 | 4.86432 |
5b61ca37-32e9-4821-b48b-c583dc37bc01 | Vijay1770/Top-100-codes | 34_vovel_con_dig_spa.cpp | #include <iostream>
using namespace std;
int main()
{
char line[100];
int vowels, consonants, digits, spaces;
vowels = consonants = digits = spaces = 0;
cout << "Enter a line of string: ";
cin.getline(line, 150);//if we are using cin>>str they only take the input before the spaces...
// stri... | ALGO | 0.978623 | 3.584653 |
fab9d735-9dd1-4dd6-811d-39cbb374b989 | AruMoon/source-engine-dedicated | particles/particle_sort.cpp | #include <algorithm>
#include "tier0/platform.h"
#include "tier0/vprof.h"
#include "particles/particles.h"
#include "psheet.h"
// memdbgon must be the last include file in a .cpp file!!!
#include "tier0/memdbgon.h"
static ALIGN16 ParticleRenderData_t s_SortedIndexList[MAX_PARTICLES_IN_A_SYSTEM] ALIGN16_POST;
enum EP... | ALGO | 0.96771 | 5.794809 |
b2afe0af-d968-4377-9015-17ec1f7d94ac | KeyWaveTree/Algorithm-c-and-cpp | 1.Algorithm/baekjoon/Legacy/e2/덩치.cpp | #include<iostream>
#include<vector>
using namespace std;
typedef struct body
{
int weght;
int height;
};
body people[50];
int main()
{
int lank[50] = { 0 };
int i,j;
int n;
int cnt;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> people[i].weght;
cin >> people[i].height;
lank[i] = 1;
}
for (i = 0; i <... | ALGO | 0.999978 | 3.655304 |
48ff171d-83b9-40f8-9b44-97a4b82d1595 | mustakimur/OS-CFI | llvm-src/lib/CodeGen/LoopTraversal.cpp | #include "llvm/CodeGen/LoopTraversal.h"
#include "llvm/ADT/PostOrderIterator.h"
#include "llvm/CodeGen/MachineFunction.h"
using namespace llvm;
bool LoopTraversal::isBlockDone(MachineBasicBlock *MBB) {
unsigned MBBNumber = MBB->getNumber();
assert(MBBNumber < MBBInfos.size() && "Unexpected basic block number.");
... | ALGO | 0.999008 | 7.627181 |
d1be558f-6237-46b5-bc56-606e6c723d85 | zzywhu/FastLVMapping | src/calib.cpp | #include "calib.h"
#include "ImageProcess/imageprocess.h"
#include "signal_handler.h"
#include <algorithm>
#include <chrono>
#include <cmath>
#include <filesystem>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <nav_msgs/Path.h>
#include <pcl/io/pcd_io.h>
#include <pcl/kdtree/kdtree_flann.h>
#includ... | TOOL | 0.856564 | 6.150471 |
b29a3b38-e9ca-4437-95ef-71a02590e3d8 | GomHyeok/Algorithm_Study | BOJ코드/11058.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
using namespace std;
long long buffer;
int n;
long long dp[101];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n;
dp[1] = 1;
dp[2] = 2;
dp[3] = 3;
dp[4] = 4;
dp[5] = 5;
... | ALGO | 0.999977 | 4.058264 |
61dc8b30-d222-48ce-80f7-426c69b572fc | helianthuswhite/Opencv-notes | LearningOpenCV_Code/cv_yuv_codebook.cpp | ////////YUV CODEBOOK
// Gary Bradski, July 14, 2005
#include "cv_yuv_codebook.h"
//GLOBALS FOR ALL CAMERA MODELS
//For connected components:
int CVCONTOUR_APPROX_LEVEL = 2; // Approx.threshold - the bigger it is, the simpler is the boundary
int CVCLOSE_ITR = 1; // How many iterations of erosion and/or dialation... | ALGO | 0.992671 | 3.730649 |
39c4bb8a-0a4d-40ab-931d-54188f50366a | jujujunaid/Data-structures-using-c- | Leetcode Daily challenge/Leetcode_2336.cpp | class SmallestInfiniteSet {
public:
int ans;
set<int>st;
SmallestInfiniteSet() {
ans=1;
}
int popSmallest() {
if(st.size()){
int a=*st.begin();
st.erase(a);
return a;
}
else{
ans++;
return ans-1;
}
}
void addBack(int num) {
... | ALGO | 0.99975 | 5.07554 |
4f4a7aea-ce43-497c-93f5-381d0ab5e50d | ReemaAsker/Nibras_test | 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 |
c15d77a2-c54a-4950-99ae-2c0b5d1ec193 | auduongtansang/SnakeGame | Source/Source/Snake.cpp | #include "Snake.h"
#include <conio.h>
void SnakeInitialize(Snake &snake)
{
/*snake.length = 1;
snake.node = new COORD{ 1,1 };
snake.status = RIGHT;*/
snake.length = 5;
snake.node = new COORD[5];
snake.node[0] = { 5,1 };
snake.node[1] = { 4,1 };
snake.node[2] = { 3,1 };
snake.node[3] = { 2,1 };
snake.node[4]... | TOOL | 0.970819 | 4.872602 |
e85d1cc4-dc94-4d62-9780-7fce8f0d0f2a | ttamx/Competitive-Programming | JOI/JOISC2024/day3/tower/tower.cpp | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N=2e5+5;
const ll INF=1e18;
int n,q;
ll d,a,b;
int p[N];
ll ans[N];
ll pos=0,cost=0;
ll l[N],r[N];
vector<pair<ll,int>> qr;
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
cin >> n >> q;
cin >> d >> a >> b;
for(int i... | ALGO | 0.999931 | 3.848034 |
3acc30b2-3c0f-4145-aef7-6bd982b50b30 | rathi062/codes | hackerearth/zoomcar1.cpp | #include<iostream>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>
using names... | ALGO | 0.999878 | 3.543143 |
e232fde8-af3d-4ef9-ba21-6261a4ebcd74 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_5116_12.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 3;
long long n, h, a[N];
vector<long long> v;
bool check(int num) {
v.clear();
for (int i = 1; i <= num; i++) {
v.push_back(a[i]);
}
sort(v.begin(), v.end());
long long all = 0;
for (int i = v.size() - 1; i >= 0; i -= 2) {
all += v[i]... | ALGO | 0.999942 | 4.366395 |
86c2ed99-27af-44f9-b3a4-0d3d55e71dd2 | raynnersc/ics_project | src/systemc/tests/systemc/misc/user_guide/chpt5.1/accumulator.cpp | /*****************************************************************************
accumulator.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/************************************************************************... | ALGO | 0.995922 | 5.740953 |
7cb09a57-9c00-43e9-a0e3-861dbeade722 | LingMi-sama/KongDongKnight | Hollow-Knight/Library/PackageCache/com.unity.ide.visualstudio@2.0.14/Editor/COMIntegration/COMIntegration~/COMIntegration.cpp | #include <iostream>
#include <sstream>
#include <string>
#include <filesystem>
#include <windows.h>
#include <shlwapi.h>
#include "BStrHolder.h"
#include "ComPtr.h"
#include "dte80a.tlh"
constexpr int RETRY_INTERVAL_MS = 150;
constexpr int TIMEOUT_MS = 10000;
// Often a DTE call made to Visual Studio can fail after ... | TOOL | 0.931778 | 6.969462 |
69aeab68-4159-4fe6-bcbb-2abdcbfae817 | Arastoa/BOJ | BOJ_4355/answer.cpp | #include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int euler(int n);
int main() {
while (true) {
int data; cin >> data;
if (!data) break;
cout << euler(data) << endl;
}
return 0;
}
int euler(int n) {
int sqrtn = sqrt(n);
... | ALGO | 0.999947 | 3.881258 |
eda2946c-cd39-4235-ac69-742925c735c7 | harshit-sharmaaa/Data-Structures-Algorithms | Assignment6(Linked List)/KthElementFromLast.cpp | #include <iostream>
using namespace std;
class Node
{
public:
int data;
Node *next;
Node(int d)
{
data = d;
next = NULL;
}
};
// insert at end
void insertAtEnd(Node *&head, Node *&tail, int d)
{
Node *n = new Node(d);
if (head)
{
tail->next = n;
tail = ... | ALGO | 0.999953 | 4.330333 |
a20ab4e8-4c34-479f-99ab-5fafb42e195a | harsh0045/CP31-Sheet | Rating-1600/D_Shocking_Arrangement.cpp | #include <bits/stdc++.h>
using namespace std;
#define pi (3.141592653589)
#define mod 1000000007
#define pb push_back
#define is insert
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define min3(a, b, c) min(c, min(a, b))
#define min4(a, b, c, d) min(d, min(c, min(a, b)))
#de... | ALGO | 0.999573 | 3.800152 |
be376885-a4a5-4cb9-ae77-a0d876bee09b | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_3411_10.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
set<int> s;
vector<int> v;
for (int i = 0; i < n; i++) {
int z;
cin >> z;
s.insert(z);
v.push_back(z);
}
int maxi = 1;
int a, b;
for (long long int i = 2; i <= 2000000001; i *= 2) {
for (int j = 0; j < n; j... | ALGO | 0.999888 | 3.231979 |
60d4dc02-9036-483c-823b-0a96019f9203 | DerpFest-Devices/hardware_samsung_slsi-linaro_exynos | libvision/kernel/vpu/ExynosVpuKernelFastCorners.cpp | #define LOG_TAG "ExynosVpuKernelFastCorners"
#include <cutils/log.h>
#include <stdlib.h>
#include "ExynosVpuKernelFastCorners.h"
#include "vpu_kernel_util.h"
#include "td-binary-fastcorners.h"
namespace android {
using namespace std;
static vx_uint16 td_binary[] =
TASK_test_binary_fastcorners_from_VDE_DS;
v... | ALGO | 0.95258 | 6.330024 |
40a74928-dde5-4657-81c1-5b9cf8e717b8 | anicanor/NewProject02 | evalPoly.cpp | //Aaron Nicanor
//Header Files
#include "Node.h"
#include "Polynomial.h"
//Libraries
#include<iostream>
#include<utility>
#include<sstream>
#include<vector>
#include<string>
using namespace std;
//function to seperate numbers from user input
vector<int> split(const string& s, char delimiter)
{
vector<int> to... | ALGO | 0.967574 | 4.687605 |
cda95089-cb42-4da4-a16e-ecf95d5d9c21 | igarcica/PicknPlace | ROSPlan/rosplan_knowledge_base/src/VALfiles/instantiationConstraint.cpp | #include <cstdio>
#include <iostream>
#include <fstream>
#include "ptree.h"
#include <FlexLexer.h>
#include "TIM.h"
#include "instantiation.h"
#include "SimpleEval.h"
#include "DebugWriteController.h"
#include "typecheck.h"
using std::ifstream;
using std::cerr;
using namespace VAL1_2;
namespace Inst {
bool varFree(... | TOOL | 0.968113 | 5.347207 |
062b36c7-9cf1-4b55-be98-69807d7e0105 | ericgong2005/LeetCode | Interview150/01-Array_And_String/012-Insert_Delete_GetRandom.cpp | #include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
class RandomizedSet {
public:
unordered_map<int, int> ToIndex;
vector<int> Store;
RandomizedSet() {
}
bool insert(int val) {
if(ToIndex.find(val) == ToIndex.end()){
ToIndex.insert({val, St... | ALGO | 0.986305 | 6.035566 |
13ba163f-c6d9-46ab-910d-e59d1ea3dc4c | alstn1234/CodingTest | 프로그래머스/unrated/140108. 문자열 나누기/문자열 나누기.cpp | #include <string>
#include <vector>
using namespace std;
int solution(string s) {
int answer = 0;
char val = '-';
int a = 0;
int b = 0;
for(int i = 0; i < s.length(); i++){
if(val == '-'){
val = s[i];
a++;
}
else{
if(s[i] == val)
... | ALGO | 0.999721 | 4.801019 |
3947fa1c-d52d-4f5e-8719-46ec56d820e0 | 15pengyi/Art_of_Algorithm | 20_leet_code/leetcode_300_Longest_Increasing_Subsequence.cpp | #include <vector>
#include <map>
#include <string>
#include <limits>
using namespace std;
class Solution
{
public:
int lengthOfLIS(vector<int> &nums)
{
vector<int> s(0);
for (int i = 0; i < nums.size(); ++i)
{
auto it = lower_bound(s.begin(), s.end(), nums[i]);
... | ALGO | 0.999982 | 6.0673 |
ad423725-2a52-4f93-be33-d775a89c5b55 | Yashgabani845/hiring-portal | hiring-portal/Backend/temp/1c931ah.cpp | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = a + b;
cout << sum << endl;
return 0;
}
| ALGO | 0.959048 | 4.449809 |
04787f4c-8b1c-4a6a-a742-80041e645ba7 | gkichaev/PAINTOR_V3.0 | eigen/doc/examples/DenseBase_middleRows_int.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
int main(void)
{
int const N = 5;
MatrixXi A(N,N);
A.setRandom();
cout << "A =\n" << A << '\n' << endl;
cout << "A(2..3,:) =\n" << A.middleRows(2,2) << endl;
return 0;
}
| ALGO | 0.965825 | 3.307581 |
aeb48bc1-9562-45f7-8b8d-55af3af5696b | HKS07/DSA_Questions | 1143-longest-common-subsequence/1143-longest-common-subsequence.cpp | class Solution {
public:
int help( string &s1, string &s2, int i, int j, vector<vector<int>> &dp )
{
if( i == 0 || j == 0 ) return 0;
if( dp[i][j] != -1 ) return dp[i][j];
if( s1[i-1] == s2[j-1] ) return dp[i][j] = 1 + help(s1,s2, i-1,j-1,dp);
else
{
... | ALGO | 0.999986 | 5.846823 |
183957b0-6a79-410c-88fc-3d07891285aa | hang245141253/data_structure | mentu/day5/heap_algorithms.cpp | // heap_algorithms.cpp
#include <iostream>
#include <vector>
#include <algorithm>
// 用于演示STL堆算法的示例程序
int main() {
// 构建堆
{
std::vector<int> vec = {3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5};
// 将vec中的元素转换为堆
std::make_heap(vec.begin(), vec.end()); // 第三个参数默认是less<int>()，小于号构建大根堆
std::cou... | ALGO | 0.999745 | 5.247357 |
8d333faf-8b9d-40fb-b733-71b0cab79ecd | towhid1zaman/Different_OnlineJudge_Solutions | UVA_Solutions/DS+Math+STL/Do Your Own Homework UVA - 11917 .cpp |
// </> : towhid1zaman
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;... | ALGO | 0.999172 | 3.614145 |
fa77e0f8-63ce-4956-86b2-361d4e86d0af | carlosedubarreto/CEB_4d_Humans | pytorch3d/csrc/point_mesh/point_mesh_cpu.cpp | #include <torch/extension.h>
#include <array>
#include <limits>
#include "utils/geometry_utils.h"
#include "utils/vec3.h"
// - We start with implementations of simple operations on points, edges and
// faces. The hull of H points is a point if H=1, an edge if H=2, a face if H=3.
template <typename T>
vec3<T> ExtractP... | ALGO | 0.999184 | 6.864937 |
e61b82e0-68fc-493f-9193-5d6a9d308e6f | ishandutta2007/codeforces | lhic/normal/792/A.cpp | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <queue>
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef long double... | ALGO | 0.99983 | 3.594535 |
6a5c6b15-5b07-45d6-b3d3-4e1b31c6d685 | alexandraback/datacollection | solutions_5644738749267968_0/C++/Iskandar/Deceitful.cpp | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int T, N;
vector<double> naomi;
vector<double> ken;
double curr;
cin >> T;
for (int i = 1; i <= T; i++) {
int deceit = 0, normal = 0;
naomi.clear();
ken.clear();
cin... | ALGO | 0.999713 | 3.700599 |
5940519e-c58b-4419-acee-a095d83b7d0d | kacper-filipiak/ModernCppChallengeWithTDDSolutions | MathProblems/4/PrimeFinder.cpp | #include "PrimeFinder.h"
#include <functional>
bool PrimeFinder::isPrime(const int& num)
{
auto isPrimeNumber = true;
auto divided = num;
if(num > *primes.begin())
{
for(int i = *primes.begin(); i < divided; i++)
{
if(isPrime(i))
{
primes.insert(primes.begin(), i);
if(num %... | ALGO | 0.999656 | 5.39491 |
93acca6b-5bc5-4692-bae4-e6e0b90d8670 | izlyforever/cf | contest/1671/d/d.cpp | #include <bits/stdc++.h>
#define cerr(x) std::cerr << (#x) << " is " << (x) << '\n'
using LL = long long;
void solve() {
int n, k;
std::cin >> n >> k;
std::vector<int> a(n);
for (auto &x : a) std::cin >> x;
auto f = [&](int x) {
int mn = std::min(abs(a[0] - x), abs(a.back() - x));
for (int i = 0; i <... | ALGO | 0.999183 | 4.975859 |
def74d31-b9bf-46de-af09-c6989d4cab08 | Arshjeet-Singh/DSASheet2022 | Graph/Alien Dictionary.cpp | //{ Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution{
public:
void dfs(int node,unordered_map<int,list<int>> &adj,vector<bool> &vis,stack<int> &s)
{
vis[node]=1;
for(auto i:ad... | ALGO | 0.999984 | 5.675528 |
986213a9-c25a-474f-9c9f-c1c96e7c115a | rajkumargautam1/C_PLUS_PLUS-march | c++/Character/checkcharacter.cpp | #include<iostream>
using namespace std;
int main(){
char ch;
cout<<"enter the character"<<endl;
cin>>ch;
if(ch>='A' and ch<='Z'){
cout<<ch<<"is an upper case letter"<<endl;
}
if(ch>='a' and ch<='z'){
cout<<ch<<"is an lower case letter"<<endl;
}
else if (ch>=0 and ch>=9){... | TOOL | 0.934872 | 3.426833 |
b2607524-7569-4e96-88f5-df9066a8cf68 | CyberSleeper/competitive-programming | Templates/Fenwick_Tree.cpp | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define debug(x) cout << "Line " << __LINE__ << ", " << #x << " is " << x << endl
#define BP(x) __builtin_popcount(x)
#define fi first
#define se second
#define mp make_pair
#define pb ... | ALGO | 0.999535 | 4.037962 |
ea0f2e0b-4b18-47f5-83b9-a9bdf8f918ef | doomsday861/Allofit | shortestroutesall.cpp | /**
* shortest route
**/
#include<bits/stdc++.h>
#define ll long long
#define testcase ll t;cin>>t;while(t--)
#define pb push_back
#define fi first
#define se second
#define vll vector<ll>
#define for0(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i)
#define run ios_base::syn... | ALGO | 0.999974 | 4.351768 |
bb5951a7-9855-47d0-b07e-c8c22bef5788 | HossainMaruf/Online-Judge-Solution | URI/1002 - Area of a Circle.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
double R;
cin>>R;
cout<< "A=" << fixed << setprecision(4) << 3.14159 * R * R << endl;
} | ALGO | 0.982921 | 3.993116 |
a3458239-0d32-4b04-9f91-4c86be2bfdec | spinos/aphid | shared/pbd/ShapeMatchingContext.cpp | #include "ShapeMatchingContext.h"
#include <math/ConjugateGradient.h>
#include "ShapeMatchingProfile.h"
namespace aphid {
namespace pbd {
ShapeMatchingContext::ShapeMatchingContext() :
m_lhsMat(0),
m_cg(0),
m_stiffness(500.f)
{}
ShapeMatchingContext::~ShapeMatchingContext()
{ clearConstraints(); }
void ShapeMatchin... | ALGO | 0.998412 | 4.484857 |
6041b74f-645c-4284-9852-64fecea5cb9f | RSH-Arm/Opencv-Tracing-Puck | Opencv Tracing Puck/tracking.cpp |
#include "tracking.h"
#include <chrono>
//#include <my/multi_buffers/MultiBuffers.h>
using namespace std;
using namespace cv;
///
/// Class --TrackingPucks-- Begin
///
TrackingPucks::TrackingPucks(cv::VideoCapture& video_, int sections_)
{
//*** Initialization ***
_FPS = video_.get(CAP_PROP_FPS);
_STOP = video_.g... | TOOL | 0.93332 | 4.564931 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.