uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
c28d8def-bfc7-4b3a-9a34-92217f6523a7 | raincross7/code-similarity | codes/train_code/problem078/problem078_375.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { c... | ALGO | 0.999998 | 4.375628 |
ac21dfa8-5687-47e3-ab37-199b0e31b410 | ishandutta2007/codeforces | shayan.p/normal/776/E.cpp | // Believe in yourself...
#include<bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define F first
#define S second
#define sz(c) (c).size()
#define REP(i,n) for(ll i=0;i<n;i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll ... | ALGO | 0.999991 | 3.81352 |
6ec78137-1158-44ff-b1ae-61ec43f8db79 | jayesh-kaza/LeetCode | cpp/617_Merge_Binary_Trees.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if (t1 == NULL)
return t... | ALGO | 0.999992 | 6.24334 |
91c4b37b-bb45-4026-94e5-ca4c963606a0 | saidarsannbr/Cpp-Code-Repo-for-Reference | lec_28_b_.cpp | #include<iostream>
using namespace std;
// Giving a foward declarrion of class c2
class c2; // Not requird actually ?
class c1{
int val1;
// Giving friend function declaration.
friend void exchange(c1 &, c2 &); // Take efernce of c1 and c2;
public :
void indata(int a){ // takes and input data... | TOOL | 0.945841 | 4.941869 |
c35f29ce-8fa7-462c-a9c0-e836388ee8c1 | brccabral/Cpp_Raylib_Libtorch_AIGames | examples/birdy/BirdyGame.cpp | #include <algorithm>
#include <cstdio>
#include <random>
#include "BirdyGame.h"
BirdyGame::BirdyGame(size_t num_birds)
{
gravity = BIRD_GRAVITY;
speed_x = GAME_INIT_SPEEDX;
jump_force = BIRD_JUMP_FORCE;
birds.resize(num_birds);
load_textures();
reset();
}
BirdyGame::~BirdyGame()
{
unload_... | ALGO | 0.969088 | 6.054349 |
1ba7fe35-3dd7-481f-bc05-cbb4ad10efc9 | xmoonanx/C-Cpp_Backjoon | 1926.cpp | #include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
int N, M, arr[501][501], chk[501][501];
int dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int dfs(int y, int x)
{
int re = 1;
chk[y][x] = 1;
for (int i = 0; i < 4; i++)
{
int yy = y + dir[i][0], xx = x + dir[i][1]... | ALGO | 0.999894 | 4.638593 |
fb4ee3a7-540e-49a5-97a1-ff2c7b20f31e | Apurba94/10-Years-of_Competitive-Programming-Resources-Collection | Codeforces From 2011-2023/1335A-CandiesAndTwoSisters.cpp | #include <cstdio>
int main(){
long t; scanf("%ld", &t);
while(t--){
long n; scanf("%ld", &n);
printf("%ld\n", (n - 1) / 2);
}
return 0;
}
| ALGO | 0.999485 | 4.517038 |
64fb1885-b50b-4d11-b78b-9af59fe63344 | sarvex/leetcode-php | solution/0700-0799/0779.K-th Symbol in Grammar/Solution.cpp | class Solution {
public:
int kthGrammar(int n, int k) {
return __builtin_popcount(k - 1) & 1;
}
}; | ALGO | 0.999985 | 6.258475 |
9cf453d1-4441-4d00-855c-c56ed065b266 | saloni-jaiswal-dev/cpp | 224B - Array.cpp | //contest: Codeforces Round #138 (Div. 2), problem: (B) Array, Accepted .
#include<iostream>
#include<cmath>
#include<set>
using namespace std;
set<int>F,L;
int main()
{
int n,m,f,l;
cin>>n>>m;
int a[n];
bool first=false , last=false;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=... | ALGO | 0.999994 | 4.004188 |
f2c68e28-e4d0-4be4-baa3-5a78e932cad1 | venkatanasuri/C-programs | Day19(3).cpp | #include <stdio.h>
int main() {
int n, i, factorial;
factorial = 1;
i = 1;
printf("Enter a positive integer: ");
scanf("%d", &n);
while (i <= n) {
factorial *= i;
i++;
}
printf("The factorial of %d is %d.\n", n, factorial);
}
| ALGO | 0.999699 | 5.166826 |
5a534b87-36e7-4d71-9bc9-71aa5470617e | asmitamitra/algorithmcodes | competitive/lucklena.cpp | #include<iostream>
using namespace std;
typedef struct node
{
int t;
int l;
}node;
node list[100];
void find_min(int n)
{
int min=9999;
int pos;
for(int i=0;i<n;i++)
{
if(list[i].t==1 && min>list[i].l)
{
min = list[i].l;
pos = i;
}
}
l... | ALGO | 0.999967 | 3.133683 |
352add23-f701-40fb-ac6b-e57aa09d0aa5 | RahulkumarRV/algorithms_and_data_structure | stack/histograme.cpp | long long getMaxArea(long long arr[], int n){
vector<int> left(n), right(n);
stack<long long> st;
for(int i=0; i<n; i++){
if(st.empty()){
left[i] = 0; st.push(i);
}
else{
while(!st.empty() and arr[st.top()] >= arr[i]){
st.pop();
}
left[i] = st.empty() ? 0 : st.top() + 1;
st.push(i);
}
}
... | ALGO | 0.999834 | 5.531479 |
366bd824-0f0d-4835-bd77-a891adbb7393 | RinCloud/TrickCatcher | Datasets/TrickyBugs/GenProgs/dpp_generated_progs_cpp/p03336/p03336_num1_parsed.cpp | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string computeAndAdd(string a, string b, int k) {
int n = a.length();
int m = b.length();
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
while (k--) {
a += '0';
b += '0';
}
... | ALGO | 0.999982 | 4.836231 |
ffd8380d-1e9b-4994-863e-63cce5f0d67e | yp155136/codebook | contest/20190526/pE_1.cpp | #include <bits/stdc++.h>
using namespace std;
int dp[9][(1<<12)];
const int INF = 40000;
int count_bit(int x) {
int ret=0;
while (x) {
if (x&1) ++ret;
x>>=1;
}
return ret;
}
int mp[11][11];
int dx[8] = {1,1,1,0,0,-1,-1,-1};
int dy[8] = {1,0,-1,1,-1,1,0,-1};
bool okay(int mask,int k,i... | ALGO | 0.999351 | 4.4248 |
574ded16-39a8-4b6d-8b7d-95d3a9938acf | brodante/Surya | #3 Codechef/FLOW006.cpp | #include <bits/stdc++.h>
#define lli long long
#define foi(n) for(lli i=0;i<n;i++)
#define foj(n) for(lli j=0;j<n;j++)
#define test(T) lli T;cin>>T;while(T--)
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
test(n)
{
lli N,sum=0;
cin>>N;
while(N)
{
... | ALGO | 0.99971 | 4.85311 |
1c495ea9-bf90-4821-8e1a-50aec599630d | sngkr/MyProject | PAT/1016.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#define off 0
#define on 1
using namespace std;
int rate[25]; //费率
struct NODE
{
string name; //客户姓名
int month, day, minute, hour; //通话时间
int status; //当前通话状态
int time; //将时间... | ALGO | 0.985961 | 3.767166 |
7751c7f4-deff-43dd-922c-450d4f5faca9 | piyushh-guptaa/DSA | 0503-next-greater-element-ii/0503-next-greater-element-ii.cpp | class Solution {
public:
vector<int> nextGreaterElements(vector<int>& nums) {
int n = nums.size();
vector<int> output(n);
stack<int> st;
for(int i = 2*n-1; i>=0; i--){
while(!st.empty() && st.top() <= nums[i%n]){
st.pop();
}
if(i < ... | ALGO | 0.999869 | 5.48543 |
9f2855e2-2663-493e-813a-adc9c0ac7a35 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_7260_7.cpp | #include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > s[2];
int x, y;
bool inside(pair<int, int> p) {
int x1 = s[0][0].first, x2 = s[0][2].first;
int y1 = s[0][0].second, y2 = s[0][2].second;
if (x1 > x2) swap(x1, x2);
if (y1 > y2) swap(y1, y2);
return (x1 <= p.first && p.first <= x2 && y1 <= ... | ALGO | 0.999852 | 3.256535 |
2d1a2435-0503-4d04-b1a4-f1dcdab70e77 | kifah-s/Problem_Solving | Gammal_Tech_Academy/2_C++_Programming_Language/Exercises/Pro_101_Smart_Pointer_Program/Smart_Pointer_Program_V2.cpp |
/* >>> Smart Pointer Program ( Version 2 ) <<< */
/* >>> Create a template class for a smart pointer that can manage the lifetime of an object,
with methods to create and destroy the object, and to access its members. <<< */
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <set>... | TOOL | 0.850137 | 6.209397 |
80f4e2c7-094b-49eb-a37f-e768e4a9a455 | pcoulier/hbemfun | rsa.cpp | /* rsa.cpp
*
* Mattias Schevenels
* May 2009
*/
#include <string>
#include <stdlib.h>
#include "bigint.h"
#include <cstdio>
using namespace std;
/******************************************************************************/
void modpow(BigUnsigned b, BigUnsigned e, const BigUnsigned& m, BigUnsigned& r)
{
r ... | ALGO | 0.994793 | 5.567892 |
a554818f-7b42-4b35-b572-5222b3fbd1d7 | ishandutta2007/codeforces | rniya/normal/1292/C.cpp | #include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1e9+7;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R',... | ALGO | 0.999046 | 4.293901 |
1647f665-f292-4b67-9cf2-e77b34b0cd50 | leafeonia/leetcode | C++/code/269.cpp | class Solution {
public:
string alienOrder(vector<string>& words) {
vector<int> indeg(26, 0);
vector<set<int>> s(26);
vector<int> used(26, 0);
for (string word: words) {
for (char ch: word) {
used[ch - 'a'] = 1;
}
}
for (int i =... | ALGO | 0.999996 | 6.012006 |
b2c6c320-1699-489b-a7d4-0be5d5f66e12 | jingan-181/abacus-1-25 | source/module_hamilt_lcao/module_deltaspin/cal_h_lambda.cpp | #include "spin_constrain.h"
#include "module_base/timer.h"
#include "module_base/tool_title.h"
#include "module_base/global_function.h"
#include <algorithm>
template <>
void SpinConstrain<std::complex<double>, psi::DEVICE_CPU>::cal_h_lambda(
std::complex<double>* h_lambda,
const std::vector<std::complex<double... | ALGO | 0.948019 | 4.991424 |
646fe6a2-aaf0-4270-a020-733a6eac70da | arjunsolanki2612/LeetCode | 1155-number-of-dice-rolls-with-target-sum.cpp | /*
https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/description/?envType=daily-question&envId=2023-12-26
You have n dice, and each die has k faces numbered from 1 to k.
Given three integers n, k, and target, return the number of possible ways (out of the kn total ways) to roll the dice, so the sum of... | ALGO | 0.999998 | 6.599953 |
cdda811e-2fd1-4687-86d0-a9e579299aba | pradnyesh61/CP | LeetCode/106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal.cpp | // 16 March 2023
#include <bits/stdc++.h>
using namespace std;
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x),... | ALGO | 0.999988 | 5.978261 |
afbb6020-2b91-4711-bfd3-e4b92d285046 | Shiba0228/CPE-UVA- | uva948.cpp | //Fibonaccimal Base
//用費氏數列表示十進位數，因為表示方式有很多，所以規定任兩個被選中的項次不能在費氏數列中相鄰。
//sol
//初始化費氏數列：
//fib[0] = 1，fib[1] = 2，然後從 i = 2 開始，依次計算 fib[i] = fib[i-1] + fib[i-2]，即每項等於前兩項之和。
//費氏數列產生的是 {1, 2, 3, 5, 8, 13, ...}。
//處理測試用例：
//讀取測試數量 n，對每個測試用例讀取一個整數 in1。
//每計算 Fibonaccimal Base 表示：
//從最大的費氏數開始，逐項判斷是否可以用該費氏數來表示 in1 的一部分：
//從 fi... | ALGO | 0.999802 | 4.932766 |
6d3c3041-5215-4047-ae2f-fb299a34d3f9 | Saifur-Rahman03/Codes | Codes/Codeforces/451A.cpp | #include <iostream>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
if(n < m){
if (n % 2 == 0)
cout << "Malvika" << endl;
else
cout << "Akshat" << endl;
}
if (m % 2 == 0)
else{
cout << "Malvika" << endl;
else
cout << "Akshat" << endl;
}
return 0;
}
| ALGO | 0.999907 | 3.136207 |
155e4c18-5760-4f77-9bdb-4c493656ea7d | sgtpepperpt/apdcDB | server/libs/mysql-src/storage/ndb/src/kernel/vm/ndbd_malloc_impl.cpp | #include "ndbd_malloc_impl.hpp"
#include <ndb_global.h>
#include <EventLogger.hpp>
#ifndef UNIT_TEST
extern EventLogger g_eventLogger;
#else
extern EventLogger g_eventLogger;
#endif
static int f_method_idx = 0;
#ifdef NDBD_MALLOC_METHOD_SBRK
static const char * f_method = "SMsm";
#else
static const char * f_method = ... | TOOL | 0.880104 | 4.843982 |
6c56574f-0307-4deb-ac7f-b6042d21e031 | bckd00r/LViewPlus | LViewPlus/Utils.cpp | #include "Utils.h"
#include <algorithm>
#include <cmath>
#include <thread>
#include <ctime>
#include <string>
#include <fstream>
#include <process.h>
#include <Windows.h>
#include <iostream>
DWORD Mem::ReadDWORD(HANDLE hProcess, DWORD addr) {
DWORD_PTR ptr = NULL;
SIZE_T bytesRead = 0;
ReadProcessMemory(hProcess, ... | TOOL | 0.86944 | 3.69762 |
c4135733-dd7a-4a91-aad1-11aa2e823cd2 | schukark/formal_languages | dfa2re_task/task.cpp | #include "api.hpp"
#include <string>
#include <map>
#include <iostream>
#include <vector>
#include <unordered_set>
#include <regex>
std::map<std::string, std::map<std::string, std::string>> new_edges;
void transform_to_custom(DFA& d) {
for (const auto& state: d.get_states()) {
for (const auto& symbol: d.get_alphab... | ALGO | 0.999483 | 5.352411 |
d2314b7d-b379-4151-847d-c5bd2bc0c32d | samadpr/Flutter_class_all | Flutter_UI_basic_class/counter_sample/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.99787 | 6.783336 |
0ca0dae5-9427-4118-964b-660c27ecc919 | Hizeal/Cprogram | Documents/Github/practice10_3.cpp | #include<iostream>
#include<vector>
#include<numeric>
int main(){
std::vector<int> nums = {1,2,3,4,5,6,7};
std::cout << std::accumulate(nums.cbegin(),nums.cend(),0);
} | ALGO | 0.99895 | 4.980699 |
02a57245-15e5-49a3-bcc9-147553449f99 | gavinmacaulay/collpen | code_JC/toolboxes/toolbox_wavelets/mex/perform_lifting_transform.cpp | #include "mex.h"
#include "config.h"
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include "perform_79_transform.h"
/* Global variables */
int n, p; // size
int dir = 1;
int Jmin = 0;
double* y = NULL;
double* x = NULL;
void mexFunction( int nlhs, mxArray *plhs[],
... | ALGO | 0.99925 | 4.807872 |
ec68935b-c1c2-4e1f-9913-e5cf76ac0340 | shrish789/CP | Algorithm/meetinthemiddle.cpp | //Maximum subset sum less than or equal to s
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define alpha ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define ff first
#define... | ALGO | 0.999979 | 3.955011 |
58c15710-7a59-47e0-8c1a-c163dc3f1f8a | bone204/TourGuideApp | 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.998757 | 6.771107 |
3811cd18-1c55-4e2e-bb89-39a031a3394f | highya/ztb-leetcode | Week5/Maximum-Subarray/fangjinzhang.cpp | class Solution {
public:
int maxSubArray(int A[], int n) {
int max = INT_MIN, i;
for (i = 0; i < n; ++i){
if (A[i] > max) max = A[i];
}
if (max <= 0) return max;
for (i = 0; i < n; ++i){
if (A[i] > 0) break;
}
max = A[i];
... | ALGO | 0.999943 | 5.51704 |
bd3dd261-f65b-41ea-aa31-2657e4589037 | 2B-people/IntelligentCar | old_racecar/robot_localization/src/filter_base.cpp | #include "robot_localization/filter_base.h"
#include "robot_localization/filter_common.h"
#include <iomanip>
#include <iostream>
#include <limits>
#include <sstream>
#include <vector>
namespace RobotLocalization
{
FilterBase::FilterBase() :
accelerationGains_(TWIST_SIZE, 0.0),
accelerationLimits_(TWIST_SIZE... | TOOL | 0.928843 | 7.258933 |
f9556dcb-479c-41ef-9089-abd2577530e6 | ishandutta2007/codeforces | tzc_wk/normal/1153/F.cpp | //Coded by tzc_wk
/*
D P
l l
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define fz(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define foreach(it,v) for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define all(a) a.begin(),a.end()
#define g... | ALGO | 0.999962 | 3.497195 |
ff8a9d78-0281-4a88-8416-e2839dc4be92 | nikitapastuhov16/Polyakov_Labs | Source codes/16F.cpp | #include <iostream>
#include <set>
#include <string>
using namespace std;
bool contains(string str, char find)
{
for(int i = 0; i < str.size(); i++) if(str[i] == find) return true;
return false;
}
int main()
{
set<char> numbers, latinLetters;
for(char i = '0'; i <= '9'; i++) numbers.insert(i);
for(c... | ALGO | 0.999925 | 4.089967 |
0cdfdb08-b118-42d7-a250-3dd1cad10f5a | Oxeus/Computer-Science-Education- | cs161/Assignments/Assignment05/a05.cpp | /*******************************
Programmer: Adam La Fleur
Assignment: #5 - Target Practice
Sources: None
*******************************/
#include <iostream>
#include <string>
#include <cstdlib>
#include <ctime>
using namespace std;
// Function firePhaser. No parameters. Returns the amount of damage,
// 0 for a mi... | TOOL | 0.879659 | 6.580686 |
1524d9bb-478e-435e-a1d7-6f5bb4c0c50e | Hanif2301082009/PUSTAKA_2301082009 | pustaka_2301082009/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.998487 | 6.76775 |
7a15f9a4-83c5-4bd8-9f93-1736ed5af116 | veerko/dsa-master | BinarySearch/medium/sum-of-four-sum.cpp | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <iterator>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <unordered_map>
#include <unordered_set>
using namespace std;
void abhisheknaiidu()... | ALGO | 0.999961 | 4.307738 |
e1a39b2b-2454-45aa-a187-44bc2d6b2b99 | Gauravkr0220/DataStructure | Dp phase 3/itereative/rec&iterative.cpp |
#include <bits/stdc++.h>
using namespace std;
using ll = long long ;
int dp[1010][1010];
int rec(int x,int y){
if(x==0&&y==0){
return 0;// no stone to take
}
if(dp[x][y]!=-1) return -1;
int ans=0;
for(int z=0;z<x;z++){
if(rec(z,y)==0){
ans=1;
break;
... | ALGO | 0.999897 | 3.946983 |
18b4a219-ed3a-49e5-8d67-4f72682a36bd | BoleynSu/CompetitiveProgramming | archives/problemset/vijos.org/1493.cpp | #include <iostream>
using namespace std;
int m,n;
int map[100][100];
unsigned F[100][100][100];
int K;
void get()
{
cin>>m>>n;
for (int i=1;i<=m;i++)
for (int j=1;j<=n;j++)
cin>>map[i][j];
K=m+n-1;
for (int k=2;k<K;k++)
for (int i=1;i<=m;i++)
for (int j=... | ALGO | 0.999743 | 3.261769 |
32ac7a41-b32a-44d7-baa1-730f388d7537 | QuangNguyenVinh/DigitalRace_SourceCode_2020 | DiRa_latest/team1004/src/DetectObstacle.cpp | #include "DetectObstacle.h"
Rect DetectObstacle::null = Rect();
DetectObstacle::DetectObstacle(string maskSrc)
{
if(show_val){
cvCreateTrackbar("value", "threshDepth", &value,255);
}
mask = imread(maskSrc, IMREAD_COLOR);
cvtColor(mask, mask, COLOR_BGR2GRAY);
}
DetectObstacle::~DetectObstacle(){}
Mat... | ALGO | 0.985784 | 4.851478 |
5b3293e3-9964-4dbb-89e6-04f62b38cc16 | NestZ/competitive-programming | AtCoder/A-500YenCoins.cpp | #include<bits/stdc++.h>
using namespace std;
//size_t f = string::npos
//make pair, tuple
int main(){
int k,x;cin >> k >> x;
if(500 * k >= x)cout << "Yes";
else cout << "No";
} | ALGO | 0.999841 | 3.376562 |
4781c7ca-2b2f-49a8-9eaf-0ce466b964f5 | GrootTheDeveloper/OLP-ICPC | 2025/C++/Codeforces/Round1017/C.cpp | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t; cin >> t;
while(t--) {
int n; cin >> n;
vector<vector<int>> a(n + 1, vector<int>(n + 1));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> a[i][... | ALGO | 0.999941 | 4.248971 |
715b4a74-155d-4e9a-bc1d-7847361049c4 | Mangomm/ffmpeg-build | windows64/extra/fdk-aac/libSACdec/src/sac_smoothing.cpp | /* -----------------------------------------------------------------------------
Software License for The Fraunhofer FDK AAC Codec Library for Android
© Copyright 1995 - 2018 Fraunhofer-Gesellschaft zur Förderung der angewandten
Forschung e.V. All rights reserved.
1. INTRODUCTION
The Fraunhofer FDK AAC Codec Lib... | ALGO | 0.999215 | 5.914566 |
d9ba9ef3-5062-4e6e-99a6-2ea59ab64ff0 | seo-bo/ProblemSolving | 백준/Gold/5577. RBY팡！/RBY팡！.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int>pii;
int main(void)
{
cin.tie(0)->sync_with_stdio(0);
int n = 0;
cin >> n;
vector<int>v(n+1);
vector<int>siz, per(n+1);
for(int i =1; i<=n;++i)
{
cin >> v[i];
}
int idx = 1, pre = -1, len = 0, ver = 0;
while(idx <= n)
{... | ALGO | 0.999984 | 3.846916 |
2e04dfa0-9ea0-40f5-a3a0-35004886099f | nathanathan/ODKScan-core | zxing/core/src/zxing/datamatrix/decoder/BitMatrixParser.cpp | #include <zxing/datamatrix/decoder/BitMatrixParser.h>
#include <zxing/common/IllegalArgumentException.h>
#include <iostream>
namespace zxing {
namespace datamatrix {
int BitMatrixParser::copyBit(size_t x, size_t y, int versionBits) {
return bitMatrix_->get(x, y) ? (versionBits << 1) | 0x1 : versionBits << 1;
}
Bi... | ALGO | 0.975632 | 4.443872 |
9774bd64-4d0a-4db8-8f60-c3d3dcf395ca | Aman4580/complete_c- | prime number math/SieveOfErathonesis.cpp | #include<bits/stdc++.h>
using namespace std;
void fillsieve( vector<bool> &sieve){
int n= sieve.size()-1;
for(int i=2;i<=sqrt(n);i++){
for(int j=i*2;j<=n;j=j+i){
sieve[j]=0;
}
}
}
int main(){
// Given an integer n, return the number of prime numbers that are strictly ... | ALGO | 0.999924 | 4.538547 |
fa30b064-8ef3-407d-99de-dcc0de10bbac | singh-saubhagya/Cpp-programs | PHASE_3/centeroftree.cpp | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
void dfs(int node,int pnt,vector<int> &depth,vector<int> &parent,vector<vector<int>> &g)
{
depth[node]=depth[pnt]+1;
parent[node]=pnt;
for(auto x:g[node]){
if(x!=pnt){
dfs(x,node,depth,parent,g);
}
}
}
signed main... | ALGO | 0.999907 | 4.597551 |
d183e411-9a51-4be1-bdaf-1d8e268306d1 | ufz/ogs | ProcessLib/CreateProcessData.cpp | #include <range/v3/algorithm/contains.hpp>
#include "BaseLib/Algorithm.h"
#include "BaseLib/ConfigTree.h"
#include "NumLib/ODESolver/TimeDiscretizationBuilder.h"
#ifdef USE_PETSC
#include "NumLib/ODESolver/PETScNonlinearSolver.h"
#endif // USE_PETSC
#include "CreateProcessData.h"
#include "NumLib/TimeStepping/CreateT... | ALGO | 0.990406 | 7.4205 |
ff8701d8-31cf-4d64-86f7-868fbd6a820a | qiaozishun4/CSP2024_BJ | BJ-Senior/answers/BJ-S01726/duel/duel.cpp | #include <bits/stdc++.h>
using namespace std;
int n,x,a[100005];
int main(){
freopen("duel.in","r",stdin);
freopen("duel.out","w",stdout);
scanf("%d",&n);
int maxn=0;
for(int i=1;i<=n;i++) scanf("%d",&x),maxn=max(maxn,(++a[x]));
printf("%d",maxn);
return 0;
}
| ALGO | 0.999936 | 3.647239 |
f64b27f2-9923-4332-a053-cb0bff293449 | richasingh-92/LEETCODE-PROBLEMS | 0211-design-add-and-search-words-data-structure/0211-design-add-and-search-words-data-structure.cpp | class WordDictionary {
vector<WordDictionary*> children;
bool isEndOfWord;
public:
// Initialize your data structure here.
WordDictionary(): isEndOfWord(false){
children = vector<WordDictionary*>(26, nullptr);
}
// Adds a word into the data structure.
void addWord(string word) {
... | ALGO | 0.999562 | 6.440492 |
1df93669-d07d-4292-9939-b3b9b83cccd6 | knavoid/just-algorithm | sw-expert-academy/D3/정곤이의 단조 증가하는 수.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
bool isMonotonousIncrease(int n) {
string str = to_string(n);
int len = str.length();
for (int i = 0; i < len - 1; i++)
if (str[i] > str[i + 1])
return false;
return true;
}
int main() {
int TC;
cin >> TC;
for (int t = 1; t ... | ALGO | 0.9999 | 4.784458 |
502ada57-977a-4285-959d-3c7f53fe8288 | Wilderscoin/WildersCoin | src/rpcprotocol.cpp | #include "rpcprotocol.h"
#include "util.h"
#include <stdint.h>
#include <boost/algorithm/string.hpp>
#include <boost/asio.hpp>
#include <boost/asio/ssl.hpp>
#include <boost/bind.hpp>
#include <boost/filesystem.hpp>
#include <boost/foreach.hpp>
#include <boost/iostreams/concepts.hpp>
#include <boost/iostreams/stream.... | WEB | 0.914534 | 7.632379 |
8eac8457-ac0f-4b9f-b399-4be728f3223e | SOFTK2765/PS | BOJ/17435.cpp | #include <bits/stdc++.h>
using namespace std;
int s_table[200001][19];
int main()
{
int m;
scanf("%d", &m);
for(int i=1;i<=m;i++)
scanf(" %d", &s_table[i][0]);
for(int i=1;i<=18;i++)
for(int j=1;j<=m;j++)
s_table[j][i] = s_table[s_table[j][i-1]][i-1];
int q;
scanf(... | ALGO | 0.999975 | 3.929169 |
fe4b2375-1750-460e-8d93-991d2ec31910 | wsyunine/ACM | 2023-2024/005 顺一顺/集训模拟赛/J.cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdlib>
#include<ctime>
#include<bitset>
#include<vector>
#include<climits>
#include<iomanip>
using namespace std;
#define N 100010
template<typename T>
inline ... | ALGO | 0.999959 | 3.595816 |
321a2350-11e1-4ad0-b001-e826b40f3446 | devminjae97/practice | Programmers/lv2_게임맵최단거리.cpp | #include <iostream>
#include<vector>
#include<queue>
using namespace std;
int lvl[100][100];
int dx[] = { 0, 0, 1, -1 };
int dy[] = { 1, -1, 0, 0 };
int solution(vector<vector<int> > maps)
{
queue<pair<int, int>> q;
int n = maps.size();
int m = maps[0].size();
int x, y;
q.push({ 0, 0 });
m... | ALGO | 0.999914 | 5.0563 |
5a45f8b9-16c8-415e-80d2-ea20bb86b0fb | Mantispraying/Leetcode | C++/692.top-k-frequent-words.cpp | #include <bits/stdc++.h>
using namespace std;
/*
* @lc app=leetcode id=692 lang=cpp
*
* [692] Top K Frequent Words
*/
// @lc code=start
/*
Given a set of strings we have to print top k frequent strings.
We have to return the array such that the string with highest frequency comes first and lower later.
If tw... | ALGO | 0.999984 | 6.303264 |
aa2eb4bd-c482-4f1f-ad0a-5fac61346a99 | theleancoder/DSA | Graphs/ConnectedComponents.cpp | #include<iostream>
#include<list>
using namespace std;
class Graph {
int V;
list<int> *adj;
public:
Graph(int V) {
this->V = V;
adj = new list<int>[V];
}
void addEdge(int u, int v) {
this->adj[u].push_back(v);
}
int getVertexCount() {
return this->V;
}
list<int>* getList() {
ret... | ALGO | 0.999157 | 5.610093 |
e3f742cf-6097-4fc8-b6bf-5a959bf61833 | shivgupta198922/CodeForces-Master-in-cpp | 437C The Child and Toy.cpp |
//! Bismillahi-Rahamanirahim.
/** ========================================**
** @Author: Md. Abu Farhad ( RUET, CSE'15)
** @Category:
/** ========================================**/
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
#define ll long long
#define scl(n) scan... | ALGO | 0.99996 | 3.659776 |
47fd3b5e-3cd1-46d2-baec-93fa22b98c3d | xuewuli/il2cpp-sgen | libil2cpp/mono/ThreadPool/threadpool-ms.cpp | #include "il2cpp-config.h"
#include <stdlib.h>
#define _USE_MATH_DEFINES // needed by MSVC to define math constants
#include <algorithm>
#include <cmath>
#include <complex>
#include "math.h"
#include "il2cpp-api.h"
#include "gc/GarbageCollector.h"
#include "gc/GCHandle.h"
#include "gc/WriteBarrier.h"
#include "icalls... | TOOL | 0.918186 | 6.026057 |
e678cabf-306a-4340-9ffa-a2c9387df3ad | tuantv89/DSA | contest_10/bai8.cpp | #include <bits/stdc++.h>
using namespace std;
int N, M;
int vis[1005];
vector<int> ke[1005];
vector<pair<int, int>> res;
void dfs(int u)
{
vis[u] = 1;
stack<int> st;
st.push(u);
while (!st.empty())
{
int t = st.top();
st.pop();
for (int i = 0; i < ke[t].size(); i++)
{
if (!vis[ke[t][i]])
{
vis[ke... | ALGO | 0.999922 | 4.816548 |
9e4a7be8-778e-4027-ae27-2ec9f8ef0b64 | nervmor/pdf_hit_detector | code/third/boost_1_58_0/libs/mpi/example/random_min.cpp | // An example using Boost.MPI's reduce() to compute a minimum value.
#include <boost/mpi.hpp>
#include <iostream>
#include <cstdlib>
namespace mpi = boost::mpi;
int main(int argc, char* argv[])
{
mpi::environment env(argc, argv);
mpi::communicator world;
std::srand(time(0) + world.rank());
int my_number = std... | ALGO | 0.999816 | 5.77526 |
656a4469-a273-456b-a70f-5f3d22c9c7b5 | ealtan/cpp_refresher | 1_to_20/12_arithmetic_ops.cpp | #include <iostream>
using namespace std;
int main() {
int numberOfShoes = 20;
cout << numberOfShoes << endl;
numberOfShoes = numberOfShoes + 1;
cout << numberOfShoes << endl;
numberOfShoes += 1;
cout << numberOfShoes << endl;
numberOfShoes++;
cout << numberOfShoes << endl;
... | ALGO | 0.857004 | 3.128784 |
7eb967c1-b7f0-41fc-92d9-63ea99a6d890 | catupper/AOJans | vol05/0580/fish.cpp | #include<iostream>
#include<set>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
struct square{
long long x1,y1,z1,x2,y2,z2;
};
vector<square> rippous;
set<long long> xs, ys, zs;
map<long long, long long>transx, transy, transz;
long long field[200][200][200];
long long xx[200], yy[200], zz... | ALGO | 0.9949 | 3.48078 |
82affa58-046b-4a86-bbe3-74e985ae4582 | harsh-kain/leetcode_problems | RichestCustomerWealth.cpp | #include<iostream>
#include<vector>
using namespace std;
int maximumWealth(vector<vector<int>>& accounts) {
int temp = accounts.size();
int max = 0;
for(int i = 0; i<temp; i++){
int sum = 0;
for(int j = 0; j<accounts[i].size(); j++){
sum += accounts[i][j];
}
if(su... | ALGO | 0.998099 | 4.61432 |
367d97d8-d748-4253-8189-bb5a2432e19b | KevinMathewT/Competitive-Programming | NNODN.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define F first
#define S second
#define fi(a, b) for(ll i=(a);i<=b;i++)
#define fj(a, b) for(ll j=(a);j<=b;j++)
#define fid(a, b) for(ll i=(a);i>=b;i--)
#define fjd(a, b) for(ll i=(a);i>=b;j--)
template<class T> ostream& operator<<... | ALGO | 0.999597 | 4.094277 |
d8cfdda8-172a-46df-b6a7-d890f3eb11c2 | erenik/FireflySpaceSimulator | src/Universe.cpp | /// Emil Hedemalm
/// 2015-12-13
/// A universe to be simulated...!
#include "Universe.h"
#include "Planet.h"
#include "Ship.h"
Universe universe;
Universe::~Universe()
{
}
/// Creates the universe.
void Universe::CreateUniverse(int solarSystemsToCreate, std::iostream & outputStream)
{
/// Creates solar systems.
f... | ALGO | 0.945944 | 3.702479 |
e95e9483-bf6f-48ca-9304-403c42072a08 | raincross7/code-similarity | codes/train_code/problem327/problem327_461.cpp | //インクルード(アルファベット順)
#include<algorithm>//sort,二分探索,など
#include<bitset>//固定長bit集合
#include<chrono>//実行時間計測
#include<cmath>//pow,logなど
#include<complex>//複素数
#include<deque>//両端アクセスのキュー
#include<functional>//sortのgreater
#include<iomanip>//setprecision(浮動小数点の出力の誤差)
#include<iostream>//入出力
#include<iterator>//集合演算(積集合,和集合,... | ALGO | 0.99915 | 3.616825 |
58ac494e-b20f-492d-9dd2-1c1aba73be0d | tjyu1999/dsa | graph/dfs.cpp | #include <vector>
#include <queue>
#include "graph.h"
void Graph::dfsHelper(Vertex *v, std::vector<int> &traversal) {
traversal.push_back(v->data);
v->visited = true;
ListNode *node = v->adj;
while (node != nullptr ) {
if (!node->vptr->visited)
dfsHelper(node->vptr, traversal);... | ALGO | 0.999976 | 6.16681 |
30c17fb6-768a-4117-be99-244ddd1193eb | outk/competitive-programming | AtCoder/C++/abc158e.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,p;
cin >> n >> p;
string s;
cin >> s;
} | ALGO | 0.999505 | 3.258293 |
6d8e7302-06ee-45ec-87e1-17f077bcbe40 | manikanta2901/ubuntu | .history/codingChallenges/cpp/Codechef/longChallenges/Year2021/January/aaa_20210105142448.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
int size,target;
cin >> size >> target;
vector<int>h;
for(int i = 0; i < size; i++)
}
return 0;
} | ALGO | 0.999515 | 3.348279 |
f106643f-c1e2-4eac-ac12-3cc1b6fe0384 | Peilin-Yang/leetcode | c++/zigzag_iterator.cpp | #include<vector>
#include<iostream>
using namespace std;
class ZigzagIterator {
private:
vector<int> _v1, _v2;
int len_v1, len_v2;
int cur_v1, cur_v2;
int cur_list = 0;
public:
ZigzagIterator(vector<int>& v1, vector<int>& v2) {
_v1 = v1;
_v2 = v2;
len_v1 = _v1.size();
... | ALGO | 0.999927 | 5.064296 |
cfa2e7ae-f04c-468f-a7cb-c2156faaa504 | foo-foo/epitech-projects | C++/cpp_bomberman/Game/Core/Srcs/Legend.cpp | //
// Legend.cpp for in /home/menich_a/rendu/cpp_bomberman/work_in_progress/v6
//
// Made by Anatole Menichetti
// Login <<EMAIL>>
//
// Started on Wed May 27 16:26:29 2015 Anatole Menichetti
// Last update Sat Jun 13 10:38:51 2015 Anatole Menichetti
//
#include "Legend.hpp"
#include <algorithm>
Legend::Legend(... | ALGO | 0.998713 | 3.72717 |
1a9e349b-7082-4eb1-a1ed-788747f98f4c | Abhishek9503/Code_ | DSA LOVE BABBAR/STL/Set.cpp | #include <iostream>
#include <set>
using namespace std;
int main()
{
set<int> s;
s.insert(5);
s.insert(5);
s.insert(5);
s.insert(5);
s.insert(1);
s.insert(1);
s.insert(7);
s.insert(7);
s.insert(3);
s.insert(3);
for (auto i : s)
{
cout << i << endl;
}
... | ALGO | 0.981815 | 3.363033 |
39ef4f49-6253-409d-83c9-bb5041062ec5 | harry536/Code-List | 0918-maximum-sum-circular-subarray/0918-maximum-sum-circular-subarray.cpp | class Solution {
public:
int maxSubarraySumCircular(vector<int>& A) {
int nonCircularSum = kadaneMaxSum(A);
int totalSum = 0;
for(int i=0;i<A.size();i++){
totalSum += A[i];
A[i] = -A[i];
}
int circularSum = totalSum + kadaneMaxSum(A);
... | ALGO | 0.999956 | 6.000485 |
bb6545e3-2351-4d91-94c3-80d8ef494892 | Keshari818/LeetCode | 0083-remove-duplicates-from-sorted-list/0083-remove-duplicates-from-sorted-list.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* deleteDupli... | ALGO | 0.999945 | 5.809684 |
8ff3e908-9ac7-4d10-872f-2ed343a80c64 | emanuel2700/TyJorgeTyAudante | Training_camp_2024/TC Arg 2024 - Competencia 6 -- Avanzado/I_Mahmoud_and_Ehab_and_the_message.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define pf push_front
#define debug(x) cout << #x << " = " << x << endl
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
... | ALGO | 0.999954 | 4.360799 |
f66819e1-2303-4a33-b3ff-21e0ba1ff5cc | nadamhmudd/assignment-2 | orca_share_media1541102062269.cpp | #include <iostream>
#include <BigDecimalInt.h>
using namespace std;
ostream& operator<< (ostream& out, BigDecimalInt bInt){
string str = "";
if(!bInt.is_positive)
str += '-';
str += bInt.m_number;
out << str << endl;
return out;
}
int main()
{
BigDecimalInt b1("123"), b2("123");
... | ALGO | 0.971817 | 5.129401 |
e476e0eb-2201-4a6b-bcaa-beae56c35157 | HarshGalav/Leetcode-Best-Practice | 2095-delete-the-middle-node-of-a-linked-list/2095-delete-the-middle-node-of-a-linked-list.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* deleteMiddl... | ALGO | 0.999911 | 5.883158 |
a2318a5c-b6d1-4e79-8b27-cd6f0b4cff11 | anipatil72/My_Competitive_Programming | 554.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define I_am_speed() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define vec vector<ll>
#define loop(x, start, end) for (int x = start; x < end; ++x)
void print(vector<ll> &v)
{... | ALGO | 0.999847 | 3.505842 |
48bf1f64-7767-4669-85b5-8609c4bf6913 | nokimono/ilocamp-3-solutions | grupa-srednia/tab.cpp | #include <bits/stdc++.h>
#define pc putchar
#define gc getchar
#define gcu getchar_unlocked
#define fi first
#define se second
#define pb push_back
#define mod ((ll)1e9 + 7)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
//=====================================================================... | ALGO | 0.999977 | 3.328459 |
19b33cc8-a58e-474d-a520-698ea706ff06 | mamariomiamo/indi-ftc | src/modules/control_allocator/ControlAllocation/ControlAllocationPseudoInverse.cpp | /**
* @file ControlAllocationPseudoInverse.hpp
*
* Simple Control Allocation Algorithm
*
* @author Julien Lecoeur <<EMAIL>>
*/
#include "ControlAllocationPseudoInverse.hpp"
void
ControlAllocationPseudoInverse::setEffectivenessMatrix(
const matrix::Matrix<float, ControlAllocation::NUM_AXES, ControlAllocation::N... | ALGO | 0.927225 | 6.059883 |
c66e7d5a-aacd-4867-8e66-57c83f03dfc7 | ronazf/Advent-of-Code | 2024/day3.cpp | #include <iostream>
using namespace std;
int main () {
int mulRes = 0;
string doStr = "do()";
string dontStr = "don't()";
bool enabled = true;
string mulStr = "mul(";
char charBet = ',';
char charEnd = ')';
char c;
string s;
while (cin >> c) {
s = s + c;
if (s ... | ALGO | 0.995144 | 3.968967 |
14ea9571-8af6-4384-bb27-4426ef4c7b29 | DVDemon/mai_oop_examples_public | examples/lection02_03/07_DynamicMemoryAllocation/main.cpp | #include <iostream>
int main(){
//How we've used pointers so far
//*
int number {22}; // Stack
int * p_number = &number;
std::cout << std::endl;
std::cout << "Declaring pointer and assigning address : " << std::endl;
std::cout << "number : " << number << std::endl;
std::cout << "p_number : " << p_numbe... | TOOL | 0.861978 | 3.670933 |
ed95a4de-6baf-4e52-9c4b-65bb4d82b609 | antaresz1026/Antaresz-s-algorithm-practice | src/insertionSort.cpp | /**
* @file insertionSort.cpp
* @author antaresz (<EMAIL>)
* @brief insertionSort实现
* @version 1.0
* @date 2024-09-13
*
* @copyright Copyright (c) 2024 antaresz
*
* @par 修改日志:
* <table>
* <tr><th>Date <th>Version <th>Author <th>Description
* <tr><td>2024-09-13 <td>1.0 <td>antaresz <td>添加注释
*... | ALGO | 0.998785 | 5.166431 |
057d6ee4-5d5a-4a81-8380-2f3477d24117 | sumity2021/DSA | 416-partition-equal-subset-sum/partition-equal-subset-sum.cpp | class Solution {
public:
bool f(vector<int>& nums, int target, int idx,vector<vector<int>>&dp){
if(target==0) return 1;
if(target<0 || idx==nums.size()) return 0;
if(dp[idx][target]!=-1) return dp[idx][target];
return dp[idx][target]=f(nums,target-nums[idx],idx+1,dp) || f(nums,target... | ALGO | 0.999972 | 5.861904 |
0938df49-046d-49a6-a35d-3523ef015065 | alexandraback/datacollection | solutions_2463486_0/C++/abhisar17/codejam-qr-c.cpp | #include <iostream>
#include <string>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <sstream>
using namespace std;
typedef long long LL;
#define VI vector<int>
#defi... | ALGO | 0.999275 | 3.889133 |
86876f84-48de-4de2-989a-01f2954b82ac | ishandutta2007/codeforces | hitman623/normal/1096/E.cpp | #include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define x first
#d... | ALGO | 0.999947 | 4.301778 |
d6960450-9790-44ea-9c41-8092fd9843d5 | TanushreeBorase/dsa-pathshala | diamondpattern.cpp | #include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
for(int i = 1;i<=n;i++){
for(int j = 1;j <=n - i;j++){
cout << " ";
}
for(int j = 1;j<= 2*i -1;j++){
cout << "*";
}
cout << endl;
}
for(int i = n;i>=1... | ALGO | 0.999947 | 3.65136 |
a91ed9f7-1f49-4a76-8539-88c6f38b8a34 | maryrsmcphee/SYDE-223-Labs | Lab2/lab2_drones_manager.cpp | /**
* LAB 2: Linked List Data Structure and C++ Inheritance
* Mary McPhee: 20717047
* Sammy Robens-Paradise: 20709541
*/
#include "lab2_drones_manager.h"
// creates new empty DronesManager
DronesManager::DronesManager() {
first = nullptr;
last = nullptr;
size = 0;
}
// Destroys instance and frees up ... | TOOL | 0.988221 | 5.054258 |
208d7b11-df6d-44c9-8487-7b7162e14df8 | Emir-Tuncbilek/F1-Tire-Strategy | neural-network/matrix.cpp | //
// Created by Emir Tuncbilek on 7/16/24.
//
#include "matrix.h"
/* utility function */
float generateRandomNeg1_1() {
std::random_device rd;
std::mt19937 gen(rd());
std::uniform_real_distribution<float> dis(-1.0, 1.0);
return dis(gen);
}
/* Static Methods */
Matrix Matrix::identity(const size_t& s... | TOOL | 0.97959 | 6.930404 |
2b523a06-720f-49bb-a548-dca2e753cbbb | 0xAriseAizen-404/Striver-A2Z-DSA-Solutions | Step 05 strings/Step 5.1 Basic and Easy String Problems/Rotate String/Rotate String.cpp | class Solution {
public:
bool rotateString(string s, string goal) {
if(s.size() != goal.size())
return false;
string xxx = goal + goal;
return xxx.find(s) != string::npos;
// if(s.size() != goal.size())
// return false;
// while(s != goal) {
//... | ALGO | 0.999959 | 5.511413 |
e40b5fa8-daf4-4cdc-9993-b05cfa3a0fbe | dhirajpatil2346/compitative | New folder/Minimum_Extraction_2.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
for (int q = 0; q < n; q++)
{
int info;
int size;
cin >> size;
int maxi;
vector<int> v;
vector<int> minimal;
for (int i = 0; i < size; i++)
{
signed lon... | ALGO | 0.999981 | 3.799242 |
72ec9e50-e628-4dc5-b7e5-4d3b1d53f6e4 | weathon/USACO | 2019/USACO_online/milk3.cpp | /*
ID: wguo6352
TASK: milk3
LANG: C++14
*/
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstdio>
using namespace std;
int av, bv, cv;
char tong[20000];
// int ans[20000];
int anstong[50];
// int anspointer = 0;
int vlist[3];
void solve(int a, int b, int c)
{
int list[3] = ... | ALGO | 0.999913 | 3.332839 |
4991fbae-47c5-4d8f-87a0-a27f8166fff2 | Venilcito/EstruturaDeDados | Lista 1 - migracao/exercicio 13.cpp | #include <iostream>
using namespace std;
int main(){
double vetor[10];
cout << "Digite 10 numeros: ";
for(int i = 0; i < 10; i++){
cin >> vetor[i];
}
cout << "Ordem inversa: ";
for(int i = 9; i >= 0; i--){
cout << vetor[i] << " ";
}
return 0;
} | ALGO | 0.995273 | 3.622184 |
33568cb6-79bb-4225-8a0c-7f23deb22abc | anonimo-iv/scilammps | src/EFF/compute_ke_atom_eff.cpp | // clang-format off
/* ----------------------------------------------------------------------
Contributing author: Andres Jaramillo-Botero
------------------------------------------------------------------------- */
#include <cstring>
#include "compute_ke_atom_eff.h"
#include "atom.h"
#include "update.h"
#include... | ALGO | 0.99672 | 5.681623 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.