uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
8627c647-7edd-45e1-89fe-502b27681e3c | Md-Merazul-Islam/Codeforces-1000-problems-Solving | A_A_Gift_From_Orangutan.cpp |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define PI 3.14159265359
#define dmin 1e-9
#define dd double
#define ll long long
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define pb push_back
#define vi... | ALGO | 0.999918 | 4.723877 |
60bf9907-9d00-41ec-a877-1af316d27d7b | smitdylan2001/HKU_CppBasic | SimonSays/SimonSays/SimonSays.cpp | #include <iostream>
#include <stdlib.h>
#include <chrono>
#include <thread>
int answer;
bool isHardMode;
int timer;
bool isCorrect;
int simonNumber;
//count how many numbers are in the integer
int countDigit(long long n){
int count = 0;
while (n != 0) {
n = n / 10;
++count;
}
return co... | TOOL | 0.863991 | 3.698811 |
bd18deef-95e1-4b92-9921-855ad049e90a | akamya997/PracticeCode | 201904_practice/2019_4/fuck/i.cpp | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[33;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
te... | ALGO | 0.999942 | 4.970238 |
44a3b96b-2142-4704-82d5-e99d3f777e05 | son-of-Altay/leetcode | 78.Subsets/solution2.cpp | class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
int len = nums.size();
int i,j;
int maxx = 1<<len;
vector<vector<int>> res;
for(i = 0;i<maxx;i++)
{
vector<int>temp;
j = i; //在想象的时候，就把它想成32位数字来考虑
... | ALGO | 0.999946 | 5.8755 |
92cbcb8a-f255-4bd6-8e21-a3f08232ed49 | waezone/HLKaizo | game_shared/bot/bot_util.cpp | // Author: Michael S. Booth (<EMAIL>), 2003
#include "extdll.h"
#include "util.h"
#include "cbase.h"
#include "player.h"
#include "bot.h"
#include "bot_util.h"
#include "bot_profile.h"
#include "nav.h"
static short s_iBeamSprite = 0;
//--------------------------------------------------------------------------------... | TOOL | 0.952263 | 4.223537 |
5d53a0d8-8f34-4558-88f4-8564bcf4a898 | sarthakvk/cses | Sorting-and-Searching/tickets.cpp | /*
* Problem: Concert Tickets
* Link: https://cses.fi/problemset/task/1091
* Author sarthak<<EMAIL>>
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
multiset<int> t;
vector<int> c;
for (int i = 0; i < n; i++) {
... | ALGO | 0.999988 | 4.217897 |
2bd2bc11-e56e-495c-9b20-6449a7cfcc80 | ishandutta2007/codeforces | xay5421/normal/1305/G.cpp | #include<cstdio>
#include<cassert>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;
const int N=262150;
int n,a[N],b[N],fa[N],sz[N];
LL ans;
int fd(int k1){return fa[k1]==k1?k1:fa[k1]=fd(fa[k1]);}
int mer(int k1,int k2){
if((k1=fd(k1))==(k2=fd(k2)))return 0;
int res=(sz[k1]==1?b[k1]:1)+... | ALGO | 0.999934 | 3.518667 |
11f6c31d-990c-4520-bcfd-2fed8bb01778 | Dice101mahi/CP | guess_the_maximum.cpp | #include <bits/stdc++.h>
using ll = long long;
#define fn(i, m, n) for(int (i) = (0) ; (i) < (m) ; (i)+=(n))
#define f(i, m) for(int (i) = (0) ; (i) < (m) ; (i)++)
using namespace std;
void init_code(){
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
... | ALGO | 0.999871 | 4.254722 |
7a66acee-dccf-4cfc-b225-92fb0907a510 | runtimeverification/rv-predict | examples/maximal/example2.cpp | #include <thread>
#include <mutex>
using namespace std;
mutex l;
unsigned char x,y,z;
void thread1() {
l.lock();
y = 1;
x = 1;
if (x == 2) {
z = 1;
}
l.unlock();
}
void thread2() {
this_thread::yield();
l.lock();
x = 2;
l.unlock();
y = 2;
}
int main() {
thread t1(thread1);... | ALGO | 0.993851 | 4.401283 |
a2be3945-3b65-4360-aa08-8f1f5ad7fee9 | asoderlind/TDDD95 | shortestpath3/g4g.cpp | // A C++ program for Bellman-Ford's single source
#include <iostream>
// shortest path algorithm.
using namespace std;
// a structure to represent a weighted edge in graph
struct Edge
{
int src, dest, weight;
};
// a structure to represent a connected, directed and
// weighted graph
struct Graph
{
// nNodes-... | ALGO | 0.999964 | 5.416618 |
d5c945b6-1a7e-490b-a813-f4e66d790934 | subhanu777/placement_prep | 01_array/3_second_largest_efficient.cpp | #include<iostream>
using namespace std;
int second_largest(int *arr, int n);
int main()
{
int n,arr[100];
cout<<"Input number of elements:\n";
cin>>n;
cout<<"Enter the elements:\n";
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int x= second_largest(arr,n);
if(x==-1)
cout<<"s... | ALGO | 0.999639 | 4.414197 |
1ea24a9a-7b79-4771-916c-8c75ce3959c3 | hussynnawaz/C-Programs | Binary and Decimal Conversion/Binarytodecimal.cpp | //Learnprogramo - programming made simple
#include <iostream>
#include <cmath>
using namespace std;
int convertBinaryToDecimal(long long);
int main()
{
long long n;
cout << "Enter a binary number: ";
cin >> n;
cout << n << " in binary = " << convertBinaryToDecimal(n) << "in decimal";
return 0;
}
int... | ALGO | 0.986706 | 5.264994 |
6e0e553c-3e6d-467f-8349-ec066dbd7c5b | penkin1993/algo | ex_6_2/main.cpp | /*
Задача 6. Порядок обхода (3 балла)
Дано число N < 106 и последовательность целых чисел из [-231..231] длиной N.
Требуется построить бинарное дерево, заданное наивным порядком вставки.
Т.е., при добавлении очередного числа K в дерево с корнем root,
если root→Key ≤ K, то узел K добавляется в правое поддерево root;
ина... | ALGO | 0.999908 | 5.967536 |
be7589dc-8658-4726-ba98-4f359831caab | adesolasamuel/Mandelbrot-Set-Fractal | FractalCreator.cpp | #include <iostream>
#include "FractalCreator.h"
#include "Zoom.h"
#include "RGB.h"
#include "assert.h"
namespace sam {
void FractalCreator::addRange(double rangeEnd, const RGB &rgb) {
m_ranges.push_back(rangeEnd * sam::Mandelbrot::MAX_ITERATIONS);
m_colors.push_back(rgb);
if (m_bGotFirstRange) {
m_rangeTotal.pu... | ALGO | 0.937138 | 5.291398 |
8543051c-d492-404e-97cf-241b6140d9f0 | Log-in-off/leetcode | 875_koko_eating_bananas/main.cpp | #include <iostream>
#include <cassert>
#include <vector>
/*
https://leetcode.com/problems/koko-eating-bananas/description/
*/
class Solution {
public:
int minEatingSpeed(std::vector<int>& piles, int h) {
int low = 1;
int high = piles[0];
for(auto val:piles)
{
high = std... | ALGO | 0.999859 | 6.080279 |
e03fbba1-e20a-4539-945b-8292ccb40d51 | Noobgods/ProblemSolving_ | JunHyun_Park/BOJ/10448_유레카이론.cpp | #include<cstdio> // 10448 유레카이론 [브루트포스]
int T, N, i, j, k, tree[45];
int main(){
for(i = 1; i<=44; i++)
tree[i] = (i * ( i + 1) )/2;
for(scanf("%d", &T); T--;){
scanf("%d", &N);
bool c = true;
for(i = 1 ; i <= 44 && c; i++){
for(j = 1; j <= 44 && c; j++){
for(k =1; k<= 44 && c; k++){
if(N == tree[... | ALGO | 0.999944 | 3.893999 |
09123de1-ff42-4fd9-b8cc-4352362d5c7f | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_8883_7.cpp | #include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void chkmax(T& x, U y) {
if (x < y) x = y;
}
template <typename T, typename U>
inline void chkmin(T& x, U y) {
if (y < x) x = y;
}
int x[11];
void out(int l, int b) {
char p = 'a';
if (b == 0) p = 'b';
for (int i = 0; i < l... | ALGO | 0.999876 | 3.268955 |
1249dd57-d5cb-417f-b25a-bfc521bdf6c9 | aryarajnishu/DSA-leetcode | 118.cpp | #include<iostream>
#include<vector>
#include<math.h>
#include <algorithm>
using namespace std;
int factorial(int n){
int pro =1;
for(int i=1 ; i<=n ;i++){
pro = pro *i;
}
return pro;
}
int ncr(int n , int r){
return factorial(n)/(factorial(n-r)*factorial(r))... | ALGO | 0.999938 | 4.620708 |
8edbcbfb-bf2f-496e-a82f-221f365cae64 | sarvex/leetcode-lol-code | solution/1300-1399/1340.Jump Game V/Solution.cpp | class Solution {
public:
int maxJumps(vector<int>& arr, int d) {
int n = arr.size();
vector<int> idx(n);
iota(idx.begin(), idx.end(), 0);
sort(idx.begin(), idx.end(), [&](int i, int j) { return arr[i] < arr[j]; });
vector<int> f(n, 1);
for (int i : idx) {
... | ALGO | 0.999952 | 5.90144 |
909bfb79-d565-4d8a-98e4-925d01477194 | Ing-Martin-Alvarez/Videojuego-Matematizate | Library/PackageCache/com.unity.ide.visualstudio@2.0.12/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.963735 | 6.961219 |
10b5c6c2-2e0f-41d4-99f2-993dcb55bebb | rudrab06/Codechef-Solutions- | Practice makes us perfect.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int a[4];
for(int i=0;i<4;i++){
cin>>a[i];
}
int week=0;
for(int i=0;i<4;i++){
if(a[i]>=10){
week++;
}
}
cout<<week<<endl;
} | ALGO | 0.999409 | 3.991009 |
48b816cc-e5c1-4746-84e8-99c1aa4e08de | lakshmancodes/My-Learning-DSA | tree_series/levelorder_trav.cpp | /*#include<iostream>
#include<vector>
#include<queue>
using namespace std;
struct Node
{
int data;
Node *left;
Node *right;
Node(int val)
{
data=val;
left=nullptr;
right=nullptr;
}
};
void levelorder(vector<vector<int>>arr,Node*root)
{
vector<vector<int>> smallds;
... | ALGO | 0.999939 | 4.815609 |
78570a06-d33d-4272-9d57-6b523e3fd564 | AbuHorairaTarif/UvaProject | UVA/640.cpp | #include <stdio.h>
#define MAX 1000000
int self_num[MAX];
void genarator()
{
unsigned long long int i,j,k,sum;
for(i=0;i<=MAX;i++)
{
sum=i;
j=i;
while(j>=10)
{
sum+=j%10;
j=j/10;
}
sum+=j;
self_num[sum]=1;
}
}
int main()
{
... | ALGO | 0.998928 | 4.473858 |
ad527000-0adc-44b8-8f9f-023607dee3f2 | bronzehyeon/Algorithm | 프로그래머스/4/1843. 사칙연산/사칙연산.cpp | #include <vector>
#include <string>
#include <iostream>
using namespace std;
int solution(vector<string> arr)
{
int answer = -1;
int N = arr.size() / 2 + 1;
vector<int> num;
vector<bool> op;//true -> 덧셈, false -> 뺄셈
for(int i = 0; i < arr.size(); i++){
if(i % 2){//홀수 -> 연산자
if(... | ALGO | 0.999966 | 5.000139 |
d5826d29-c7f9-416a-a5d1-48efd637fe27 | sarvex/leetcode-chef | solution/0900-0999/0993.Cousins in Binary Tree/Solution.cpp | /**
* Definition for a binary tree node.
* 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), l... | ALGO | 0.999992 | 6.15935 |
ff82c5be-4b02-441e-8a11-45ba0e6e8190 | ljsman/cpp_projects | boost_1_73_0/libs/graph/example/weighted_matching_example.cpp | #include <iostream>
#include <vector>
#include <string>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/maximum_weighted_matching.hpp>
using namespace boost;
typedef property< edge_weight_t, float, property< edge_index_t, int > >
EdgeProperty;
typedef adjacency_list< vecS, vecS, undirectedS, no_pr... | ALGO | 0.99965 | 5.705863 |
a2d23b2c-fc70-4a79-99aa-2f218291b50a | ishandutta2007/codeforces | -is-this-fft-/normal/617/B.cpp | #include <iostream>
#include <vector>
using namespace std;
int main () {
vector<int> nutpos;
int length;
cin >> length;
for (int i = 0; i < length; i++) {
int piece;
cin >> piece;
if (piece == 1) {
nutpos.push_back(i);
}
}
if (nutpos.size() == 0) {
cout << 0 << endl;
} else... | ALGO | 0.99999 | 3.829165 |
799d8471-1416-4bda-8eec-c14d6a02279b | seongsukim-ml/Competent-programming | seongsu/Problems/AS-ENDIANS_01.cpp | #include <iostream>
#include <string>
#include <bitset>
using namespace std;
int main() {
int T;
cin >> T;
for(; 0 < T; T--) {
unsigned int num;
cin >> num;
string list1("");
unsigned int mask = 1;
for(int i = 0; i < 32; i++) {
if((mask&num) == 0)
... | ALGO | 0.999432 | 5.355803 |
a8e7b153-9b0e-465c-a91e-c18a4b990bd5 | lizr2004/Coding | contest/20171031/disk/disk.cpp | #include <iostream>
#include <stdio.h>
// #include <math.h>
int arr[512000];
int pow(int a,int b)
{
int sum=1;
for(int x=1;x<=b;x++) sum*=a;
return sum;
}
int main()
{
freopen("disk.in","r",stdin);
freopen("disk.out","w",stdout);
int n,m;
scanf("%d%d",&n,&m);
for(int a=1;a<=n;a++)
scanf("%d",arr+a);
while(... | ALGO | 0.999523 | 4.460411 |
d2fb4def-4deb-42d4-b78f-aab697d722e2 | SkydevilK/BOJ | C++/동적계획법1/계단_오르기.cpp | // BOJ 2579
#include <iostream>
#include <algorithm>
using namespace std;
int N, score[300], dp[300];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> N;
for (int idx = 0; idx < N; ++idx) {
cin >> score[idx];
}
for (int idx = 0; idx < N; ++idx) {
int case1 = score[idx], c... | ALGO | 0.999984 | 4.23728 |
cb7dd5e9-cfdf-45c5-afde-ec5f579dcb8e | Aman-Manwani/MY-LEETCODE-DAILY-SUBMISSIONS | 94-binary-tree-inorder-traversal/94-binary-tree-inorder-traversal.cpp | /**
* Definition for a binary tree node.
* 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), l... | ALGO | 0.9999 | 6.412741 |
45f12b4a-a452-4c9b-9fb5-e96cfad5c6de | quocdung2603/ALL_OF_C | CodeForces/A_Diversity.cpp | #include <bits/stdc++.h>
using namespace std;
#define nl << '\n'
#define fi first
#define se second
#define vd vector<double>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vtr vector<string>
#define yes cout << "YES"
#define no cout << "NO"
#define int long long
#define ld long double
#define bb pus... | ALGO | 0.999832 | 4.08541 |
edcbca13-2aa1-4010-8fdd-9dc85febab0d | manikanta2901/ubuntu | .history/codingChallenges/cpp/randomCha/CodeSept/ChefAndFriendShip_20200912164603.cpp | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
void dfs(int v) {
visited[v] = true;
for (int u : adj[v]) {
if (!visited[u]){
cout << u << " ";
dfs(u);
}
}
cout << endl;
}
int main(){
int m ,n;
cin >> m >> n;
vector<int>arr[n];
fo... | ALGO | 0.999942 | 3.913004 |
b760ebcc-6f63-4aa1-9788-314781a5ba37 | rachit0045/LEARNING-DSA | ARRAY 2.0/FUNDAMENTAL OF ARRAY/WORKSHEET-2/question3.cpp | // Given an array, predict if the array contains duplicates or not.
#include <iostream>
using namespace std;
int main()
{
int n;
cout << "Enter the size of array : ";
cin >> n;
cout << "Enter the element of array : " << endl;
int arr[n];
for (int i = 0; i < n; i++)
{
cin >> arr[i];
... | ALGO | 0.991552 | 5.734795 |
716065af-35d9-44bd-adf4-d0b07831016c | GoldAndRabbit/leetcode | code/206.ReverseLinkedeList.cpp | /*
Reverse a singly linked list.
click to show more hints.
Hint:
A linked list can be reversed either iteratively or recursively. Could you implement both?
tree pointers
recursive way
*/
/*
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NU... | ALGO | 0.999938 | 5.609025 |
608880bb-c78d-4856-a80e-779efa52df5f | aax1n/3rdparty | opencv-3.4.1/3rdparty/carotene/src/dot_product.cpp | #include "common.hpp"
namespace CAROTENE_NS {
f64 dotProduct(const Size2D &_size,
const u8 * src0Base, ptrdiff_t src0Stride,
const u8 * src1Base, ptrdiff_t src1Stride)
{
internal::assertSupportedConfiguration();
#ifdef CAROTENE_NEON
Size2D size(_size);
if (src0Stride == src1S... | ALGO | 0.99253 | 6.430774 |
f41ecc16-820f-4985-9546-38a645a3eb47 | heisenberg01010/Competitive-Programming-Solved-Problems | CodeChef/ECAUG201.cpp | #include <iostream>
#include <boost/math/common_factor.hpp>
using namespace std;
int main()
{
long long t, n, m;
cin >> t;
while(t-- && n >=2 && m <= 1e7)
{
cin >> n >> m;
cout << boost::math::lcm(n, m) << endl;
}
return 0;
} | ALGO | 0.999991 | 4.910232 |
1cd50665-636e-421b-a423-aab7ea4776a4 | mikesayer/mikesayer-ardupilot | libraries/Filter/LowPassFilter.cpp | //
/// @file LowPassFilter.cpp
/// @brief A class to implement a low pass filter without losing precision even for int types
/// the downside being that it's a little slower as it internally uses a float
/// and it consumes an extra 4 bytes of memory to hold the constant gain
#include "LowPassFilter.h... | TOOL | 0.981399 | 5.459754 |
46ba268c-c6ea-44ba-bd91-6ba8ace503a3 | 100ballovby/sat_4pm_2223 | 16_функции_0801/01_функции_и_строки.cpp | #include <iostream>
#include <string>
using namespace std;
int power(int n, int exp) {
int res = 1;
for (int i = 0; i < exp; i++) {
res *= n;
}
return res; // вернуть фактическое значение переменной res
}
string change_even(string str) {
for (int i = 0; i < str.length(); i+=2) {
i... | ALGO | 0.993312 | 4.717799 |
2fb444be-a69b-4d43-be2f-33b07cb6204c | slack2450/csgo-dma-overlay | dma/boost_1_69_0/libs/graph/example/dave.cpp | #include <boost/graph/adjacency_list.hpp>
#include <boost/graph/visitors.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/graph_utility.hpp>
using namespace std;
using namespace boost;
/*
This example does a best-first-search (using dijkstr... | ALGO | 0.999943 | 5.580591 |
7dc36ae0-0b8c-4ab0-bc29-0a60518d6b92 | parthlathiya12/Codechef-Submissions | 17_3_MARCH17/XENTASK.cpp | #include <bits/stdc++.h>
using namespace std;
#define forall(i,a,b) for(int i=a;i<b;i++)
#define miN(a,b) ( (a) < (b) ? (a) : (b))
#define maX(a,b) ( (a) > (b) ? (a) : (b))
#define ll long long int
#define llu long long unsigned
#define mod 1000000007
int main()
... | ALGO | 0.999978 | 3.478576 |
7002d5bd-b1c9-4e9a-8639-fe49009f93b8 | TAMU-RED-AVI/TAMU-RED-Avionics | GUI/QtDev/Eigen/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_broadcast_simple_rowwise.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::MatrixXf mat(2,4);
Eigen::VectorXf v(4);
mat << 1, 2, 6, 9,
3, 1, 7, 2;
v << 0,1,2,3;
//add v to each row of m
mat.rowwise() += v.transpose();
std::cout << "Broadcasting result: " << std::... | ALGO | 0.997009 | 4.296038 |
e2128789-1204-4ce3-983a-39407fa7fca5 | JamesMax314/FPM_Code | C++/include/dlib-19.17/dlib-19.17/examples/hough_transform_ex.cpp | /*
This is an example illustrating the use of the Hough transform tool in the
dlib C++ Library.
In this example we are going to draw a line on an image and then use the
Hough transform to detect the location of the line. Moreover, we do this in
a loop that changes the line's position slightly eac... | ALGO | 0.94292 | 7.122585 |
7a6b2049-0744-4351-afff-9d6b560e5e8a | sigma-asif/OS | non preemptive sjf.cpp | #include<bits/stdc++.h>
using namespace std;
struct process{
string name;
int at, bt;
};
// List of processes
vector<process> pro = {
{"P1", 0, 7}, //name, at , bt
{"P2", 2, 4},
{"P3", 4, 1},
{"p4", 5, 4}
};
bool compareByAT(const process &p1, const process &p2){
return p1.at < p2.at; // ... | ALGO | 0.999875 | 4.363201 |
6b39e568-2b66-45a0-b2a4-557cf0b1ef3a | Pyeongtaek-Algorithm-Study/Baekjoon | Dynamic Programming/2579번 - 계단오르기/solve.cpp | #include <bits/stdc++.h>
using namespace std;
int arr[301], dp[301];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
for(int i=0;i<N;i++) {
cin >> arr[i];
}
dp[0] = arr[0];
dp[1] = arr[0]+arr[1];
dp[2] = max(arr[0]+arr[2], arr[1]+arr[2]);
for(int ... | ALGO | 0.999972 | 4.573328 |
1a10e1d7-1b66-4c43-903c-2f44d46562a3 | allenvarughese22/learning_cpp | Robert Lafore Ch 1-7/swap_struct.cpp | #include <iostream>
using namespace std;
struct time
{
int hrs;
int mins;
int sec;
};
int main(){
time t1,t2;
t1 = {5,4,3};
t2 = {9,8,7};
void swap_struct(time&,time&);
cout<<"before swap"<<endl;
cout<<"the t1 time is"<<t1.hrs<<":"<<t1.mins<<":"<<t1.sec<<endl;
cout<<"the... | ALGO | 0.98186 | 3.777666 |
0c054936-dec4-4996-8c45-7814cb87621c | rongrong1314/minicar | navigation-melodic/base_local_planner/src/simple_scored_sampling_planner.cpp | #include <base_local_planner/simple_scored_sampling_planner.h>
#include <ros/console.h>
namespace base_local_planner {
SimpleScoredSamplingPlanner::SimpleScoredSamplingPlanner(std::vector<TrajectorySampleGenerator*> gen_list, std::vector<TrajectoryCostFunction*>& critics, int max_samples) {
max_samples_ = ma... | ALGO | 0.999016 | 5.940624 |
386e9ae7-9496-4c1c-a3be-3ef3583d4448 | priyal29/codePractice | arrays/rotateArray_noExtraSpace.cpp | /*Given an unsorted array arr[] of size N, rotate it by D elements (clockwise).
Input:
The first line of the input contains T denoting the number of testcases. First line of eacg test case contains two space separated elements, N denoting the size of the array and an integer D denoting the number size of the rotation... | ALGO | 0.999491 | 5.000225 |
fe5f6e46-92dc-4d6b-886e-50e4c874af52 | Vghxv/LeetStreak | cplusplus/530.cpp | /**
* Definition for a binary tree node.
* 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), l... | ALGO | 0.999969 | 6.703507 |
a7c0730e-55bd-4b3d-8cf6-0704bb4f415b | hplytnikas/ci_test | src/estimation/lap_counter/src/lap_counter.cpp | #include "lap_counter.h"
using std::placeholders::_1;
LapCounter::LapCounter() : Node("lap_counter") {
tf_buffer_ = std::make_shared<tf2_ros::Buffer>(this->get_clock());
tf_listener_ = std::make_unique<tf2_ros::TransformListener>(*tf_buffer_);
// Create a publisher for the lap count
lap_counter_pub_ = this->... | TOOL | 0.886951 | 6.921495 |
01043f2a-f9e3-42ba-b4cf-57058bba811a | kpgng/interview-prep | leetcode/bloomberg/categories/arrays/container_with_most_water.cpp | /*
Given array of heights, find max water container can store
Ex. height = [1,8,6,2,5,4,8,3,7] -> 49, (8 - 1) x min(8, 7)
2 pointers outside in, greedily iterate pointer w/ lower height
Time: O(n)
Space: O(1)
*/
class Solution {
public:
int maxArea(vector<int>& height) {
int i = 0;
... | ALGO | 0.999964 | 7.139701 |
7cfd5cb9-493d-4d29-b11b-055ba9454f8d | trendo-dev/trendo | src/bip38.cpp | #include "bip38.h"
#include "base58.h"
#include "hash.h"
#include "pubkey.h"
#include "util.h"
#include "utilstrencodings.h"
#include <openssl/aes.h>
#include <openssl/sha.h>
#include <secp256k1.h>
#include <string>
/** 39 bytes - 78 characters
* 1) Prefix - 2 bytes - 4 chars - strKey[0..3]
* 2) Flagbyte - 1 byte -... | ALGO | 0.995689 | 7.454368 |
2791222c-a306-4c81-8065-b1c74b7d389f | shreyaa2506/DSA_Problems | Heaps/KthsmallestelementInUnsortedArray.cpp | int kthSmallest(int arr[], int l, int r, int k) {
priority_queue<int>pq;
for(int i =l;i<k;i++){
pq.push(arr[i]);
}
for(int i =k;i<=r;i++){
if(arr[i]<pq.top()){
pq.pop();
pq.push(arr[i]);
}
... | ALGO | 0.999991 | 4.92073 |
8572101e-4d3e-4823-984a-7825f95170c9 | keshavrj/Codes | c++/Algorithm/DP/Knapsack_recursive.cpp | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int knapsack(int wt[], int val[], int w, int n)
{
//base condition(smallest possible case):
if(n==0 || w==0)
return 0;
// choice:
if(wt[n-1]<=w)
return max(val[n-1]+knapsack(wt,val,w-wt[n-1],n-1),knapsack(wt,val,w,n-1));
// else
return kn... | ALGO | 0.999985 | 4.286285 |
4770232c-888a-4e22-a940-4330f5beb63a | ishandutta2007/codeforces | pigstd/normal/576/E.cpp | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
//#define int long long
#define pb push_back
#define mp make_pair
#define ins insert
#define x first
#define y second
#define WT int TT=read();while(TT--)
#define NO puts("NO");
#define YES puts("YES");
#define l(x) tt[(x)].tl
#define r(x) tt[(x)]... | ALGO | 0.999979 | 3.683107 |
5553fe88-a1e0-4d27-8a84-9437f3df8b9d | MartHage/AoC23 | Day 05/part2.cpp | #include "util.hpp"
struct Interval
{
ll d;
ll s;
ll l;
};
bool in(Interval inter, ll test)
{
return (inter.s <= test && test < inter.s + inter.l);
}
ll transfer(Interval inter, ll test)
{
if (in(inter, test))
{
return test - inter.s + inter.d;
}
else
{
return test... | ALGO | 0.997269 | 3.876729 |
fc6bb6c1-5e28-443a-ba9e-cc98cb89571a | sjm150/ps | baekjoon/17182/solution.cpp | #include <bits/stdc++.h>
using namespace std;
int dst[10][10];
int main() {
cin.tie(0); ios_base::sync_with_stdio(0);
int n, k; cin >> n >> k;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> dst[i][j];
}
}
for (int k = 0; k < n; k++) {
for (int... | ALGO | 0.999993 | 3.882733 |
43c8ddc8-5656-4220-b86d-cd0fa1b0b186 | Akash535/All-Cpp-Programs | +-evenodd.cpp | #include<iostream>
using namespace std;
int main(){
int a[25],i;
cout<<"Enter the 25 nos in array :\n";
for(i=1;i<=5;i++){
cin>>a[i];
}
cout<<"Array is :\n";
for(i=1;i<=5;i++){
cout<<a[i]<<" ";
}
cout<<"\neven element:\n";
for(i=1;i<=5;i++){
if(a[i]%2==0)
... | ALGO | 0.998217 | 3.337663 |
eec5f7de-8b90-4164-b7cd-b3ba954cb854 | MaggieSalak/algorithmic-challenges | uva/friends.cpp | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int dfs(int cur, map<int, vector<int>>& m, vector<bool>& visited) {
visited[cur] = true;
int res = 1;
for (auto neigh: m[cur]) {
if (!visited[neigh]) {
res += dfs(neigh, m, visited);
}
}
return res;
}
int main() {
// your code go... | ALGO | 0.999869 | 5.21237 |
26da2e60-5712-4dcc-87f2-9bd6448acd0f | physical-attack/2020cce | week07/09160234 7-3 .cpp | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
int compare( const void * p1, const void * p2 ){
char * s1 = (char*) p1;
char * s2 = (char*) p2;
return strcmp( s1, s2);
}
char line[4][10]={"decline","proper","majority","bullet"};
int main()
{
int n=4;
qsort( line, n, sizeof(char[10]), c... | ALGO | 0.997765 | 3.615029 |
bfad7b51-3f3b-480b-8432-843cdbc1524b | stevenwadet/assign3ST | cmake-build-debug/main.cpp | //
// Created by Steven Turner on 11/4/24.
//
#include <iostream>
#include "queueStructure.h"
int main() {
CircularQueue<int> intQueue; // Create a queue of integers
// Push 10 values into the queue
intQueue.push(5);
intQueue.push(2);
intQueue.push(8);
intQueue.push(1);
intQueue.push(7);
... | ALGO | 0.999606 | 4.829837 |
d0770c69-c93c-4b98-941a-bba623e30f44 | kernelpanic77/algorithms | graphs/codechef_graphs/fam_tree.cpp | #include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long int
vector<vector<int>> graph;
vector<int> weight;
int ans = -1e18;
int ans2 = -1e18;
int n;
int dfs(int src, vector<bool>& visited) {
visited[src] = 1;
int minn = 1e18;
... | ALGO | 0.999938 | 3.956617 |
dce46bca-5011-40b7-8ead-c1bdc50e5d32 | willing827/lyCommon | include/sqthird/soui/third-part/skia/src/pathops/SkPathOpsCommon.cpp | #include "SkAddIntersections.h"
#include "SkOpEdgeBuilder.h"
#include "SkPathOpsCommon.h"
#include "SkPathWriter.h"
#include "SkTSort.h"
static void alignMultiples(SkTArray<SkOpContour*, true>* contourList,
SkTDArray<SkOpSegment::AlignedSpan>* aligned) {
int contourCount = (*contourList).count();
for (... | ALGO | 0.999493 | 4.290224 |
616dde67-a669-4ddd-9b84-41de1d6f2e0a | alexdelli/skr_mini_v2_lk4 | Marlin/src/gcode/bedlevel/abl/G29.cpp | /**
* G29.cpp - Auto Bed Leveling
*/
#include "../../../inc/MarlinConfig.h"
#if HAS_ABL_NOT_UBL
#include "../../gcode.h"
#include "../../../feature/bedlevel/bedlevel.h"
#include "../../../module/motion.h"
#include "../../../module/planner.h"
#include "../../../module/stepper.h"
#include "../../../module/probe.h"
#... | ALGO | 0.976214 | 7.785397 |
1b02ae84-940e-40dd-a3ba-1672a0b81361 | ehyeok9/Algorithm | CodeUp/1001-1100/1014.cpp | #include <iostream>
using namespace std;
int main(){
char a,b;
scanf("%c %c", &a, &b);
printf("%c %c", b, a);
return 0;
} | ALGO | 0.997651 | 3.027794 |
1a198d12-4af3-4a5b-8fb8-c76e69d74e7b | pangbo13/Courses | CS241 问题求解与实践/week12/problem1/main.cpp | #include "std_lib_facilities.h"
#include<queue>
using namespace std;
struct task{
int pid;
int priority;
int start_time;
bool started;
queue<int> time_split;
task(string& input){
started = false;
int i = 0;
bool get_starttime = false;
while(input[i]){
... | ALGO | 0.999775 | 3.863265 |
6efd9de4-5355-42d9-9cb7-38b124fff658 | B20DCCN528/C- | soco3uocso.cpp | #include <iostream>
#include <math.h>
using namespace std;
int prime[100001];
void sieve(){
for(int i = 0; i <= 100000; i++){
prime[i]=1;
}
prime[0]=prime[1]=0;
for(int i = 2; i <= sqrt(100000); i++){
if(prime[i]){
for(int j = i*i; j <= 100000; j += i ){
prime[j] = 0;
}
}
}
}
int main() {
int t... | ALGO | 0.999815 | 4.514074 |
c602a495-727b-4ee7-972b-46d4d670bf3a | Jinyeong-7369/LeetcodeProblem | Is_Subsequence.cpp | class Solution {
public:
bool isSubsequence(string s, string t) {
// ߿ϴ
int matchCount = 0;
int basisIdx = 0;
for (auto a : s)
{
for (int i = basisIdx; i < t.length(); i++)
{
if (a == t[i])
{
matchCo... | ALGO | 0.999854 | 6.082684 |
a1af4dba-e10a-48e3-94e3-1f6a727b9c54 | wazidu/solved-problems | code force team.cpp | #include <iostream>
#include<stdio.h>
using namespace std;
int main()
{
int i,j,k,l,m,n,count=0;
cin>>l;
for(i=0;i<l;i++)
{
cin>>j>>k>>m;
n=j+k+m;
if(n>=2)
{
count++;
}
else
continue;
}
cout<<count<<endl... | ALGO | 0.999681 | 3.357938 |
ca8b2d3a-eed5-419f-bc99-931e45c93057 | omN1gb/frameworks_base | media/libstagefright/codecs/amrnb/enc/src/levinson.cpp | /*
------------------------------------------------------------------------------
Pathname: ./audio/gsm-amr/c/src/levinson.c
Funtions: Levinson_init
Levinson_reset
Levinson_exit
Levinson
------------------------------------------------------------------------------
MODULE DESCRIPTI... | ALGO | 0.998827 | 6.290952 |
03f900f8-fda0-4d14-aa29-ba7412773ab0 | MRDGH2821/Code-Dump | Student Programs/Sample Programs/ch10/virahankaloop.cpp | #include <simplecpp>
int VirahankaByLooping(int n) // Program to compute Virahanka number V_n
{
int v1 = 1, v2 = 2; // v1 = V_1, v2 = V_2
if (n == 1)
return v1;
else if (n == 2)
return v2;
else
{
int vi = v1, viplus1 = v2, viplus2;
repeat(n - 2) // Plan:
{ ... | ALGO | 0.999991 | 5.161764 |
0d578c76-6164-4fed-ae30-12b5cbd3153e | taptipalit/llvm12 | clang-tools-extra/clang-tidy/ClangTidyOptions.cpp | #include "ClangTidyOptions.h"
#include "ClangTidyModuleRegistry.h"
#include "clang/Basic/LLVM.h"
#include "llvm/ADT/SmallString.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/Errc.h"
#include "llvm/Support/FileSystem.h"
#include "llvm/Support/MemoryBufferRef.h"
#include "llvm/Support/Path.h"
#include "llvm/S... | TOOL | 0.960413 | 7.354198 |
fb4e9599-9b4a-4d59-8b48-8600ce2de604 | BOBWang1117/Tangram-Matching-and-Recognition | code/tangram.cpp | #include "tangram.h"
#include<algorithm>
using namespace std;
void printVector(vector<Point> needPrint)
{
for (unsigned int j = 0; j < needPrint.size(); j++)
{
//if (needPrint[j].coordinate_X == 3 && needPrint[j].coordinate_Y == 1)
{
cout << "coordinate: " << needPrint[j].coordina... | ALGO | 0.994347 | 3.177486 |
06763091-5158-4d95-baea-8689350836b0 | Compiler-Dependency-Analysis/llvm-levioso | llvm/lib/CodeGen/MachineBasicBlock.cpp | #include "llvm/CodeGen/MachineBasicBlock.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/CodeGen/LiveIntervals.h"
#include "llvm/CodeGen/LiveVariables.h"
#include "llvm/CodeGen/MachineDominators.h"
#include "llvm/CodeGen/MachineFunction.h"
#include "llvm/CodeGen/MachineInstrBuilder.h"
#include "llvm/CodeGen/Machine... | TOOL | 0.883405 | 7.514927 |
a3c73dfe-eefc-4270-805e-72ecf77a8533 | Xilinx/llvm-aie | llvm/lib/Transforms/Vectorize/SandboxVectorizer/VecUtils.cpp | #include "llvm/Transforms/Vectorize/SandboxVectorizer/VecUtils.h"
namespace llvm::sandboxir {
unsigned VecUtils::getFloorPowerOf2(unsigned Num) {
if (Num == 0)
return Num;
unsigned Mask = Num;
Mask >>= 1;
for (unsigned ShiftBy = 1; ShiftBy < sizeof(Num) * 8; ShiftBy <<= 1)
Mask |= Mask >> ShiftBy;
r... | TOOL | 0.868321 | 7.259639 |
69d7c61b-ec42-4f02-898b-9b9e48f48b64 | eizadhamdan/leetcode_solutions | Medium/669-trim_a_binary_search_tree.cpp | /**
* Definition for a binary tree node.
* 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), l... | ALGO | 0.999988 | 6.784616 |
2d6ac8a1-8a42-4874-bee9-4b7e1d158d5b | codejoydo/codeforces | 196c.cpp | //joyneel
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> II;
typedef vector< II > VII;
typedef vector<int> VI;
typedef vector< VI > VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a... | ALGO | 0.999991 | 4.145177 |
341b277a-5e5a-4bd1-97cc-68102340ab1b | josh1248/cp-training | kattis/2025/04/04_26_pqr_easy/permutedarithmeticsequence.cpp | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef long long ll;
#define sz(x) ((int)size(x))
#define all(x) begin(x), end(x)
#define rep(i, a, b) for (int i = a; i < (b); i++)
int main() {
ios_base::sync_with_stdio(false);
... | ALGO | 0.999857 | 4.569283 |
b391e4a8-572c-4f1e-b09a-8fcc0762cbdd | igoingdown/leetcode | acm/bupt-acm-test-2-b/b.cpp | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <unordered_set>
using namespace std;
int main(void) {
ifstream infile;
infile.open("test.txt");
int t;
infile >> t;
while (t--) {
int n;
infile >> n;
vector<string> v;
char c;
infile.get(c);
for (int i = 0; i < 2; i+... | ALGO | 0.999315 | 3.902152 |
023cfb28-5c47-4a2c-9e01-066af3e31e99 | loyinglin/Codeforces | 1831/D/Codeforces/main.cpp | /************************** 题解 **********************
[题目链接](https://codeforces.com/contest/1831/problem/D)
**题目大意：**
有两个长度为n的整数数组a和b；
现在想要找到所有的(i, j)组合，满足 1≤𝑖<𝑗≤𝑛 且 𝑎𝑖⋅𝑎𝑗=𝑏𝑖+𝑏𝑗 .
**输入：**
第一行，整数𝑡 表示t个样例 𝑡 (1≤𝑡≤10000)
每个样例2行
第一行整数𝑎1,𝑎2,…,𝑎𝑛(1≤𝑎𝑖≤𝑛)
第二行整数𝑏1,𝑏2,…,𝑏𝑛 (1≤𝑏𝑖≤𝑛 )
**... | ALGO | 0.999797 | 4.628502 |
9af09e5e-daf6-483a-aefc-49863d51c0cd | Beisenbek/PP1_2020_FALL | w1/g2/2.cpp | #include <iostream>
using namespace std;
int main(){
int x;
cin >> x;
cout << x * 2;
return 0;
} | TOOL | 0.892909 | 3.34171 |
c1a9c7c0-920b-4f91-93e5-69d1bbd01a68 | oussamakhadraoui/c-learning | dp/516. Longest Palindromic Subsequence.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int dp[1001][1001];
int rec(int i ,int j ,string &s){
if(i>j)return 0;
if(dp[i][j]!=-1)return dp[i][j];
int take=0;
int take2=0;
if(s[i]==s[j]){
if(i==j)take= 1+rec(i+1,j-1,s);
... | ALGO | 0.999993 | 5.628067 |
8e06a554-94b0-42e0-a938-00503fe8ebe3 | Kazava/rtstereo | src/reconstruction3D.cpp | #include <opencv2/opencv.hpp>
#include "pointGrey.hpp"
#include "reconstruction3D.hpp"
double calcReprojectionError(const cv::Mat& X, const std::vector<cv::Mat>& M, const std::vector<cv::Point2d>& pt2D)
{
double averageError = 0;
for(unsigned int i = 0 ; i < M.size() ; i++)
{
//printMatrix("M",*M[i... | ALGO | 0.998065 | 5.136837 |
10e3159a-57d6-4e52-ab74-17eb33c46825 | hajimeIppo-cmd/cp-codes | Baekjoon OJ/13000-13999/13752.cpp | #include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
for (int test = 0; test < n; test++) {
int sam;
scanf("%d", &sam);
for (int i = 0; i < sam; i++)
printf("=");
printf("\n");
}
return 0;
}
/*
ع :
:
:
: 1.
2.
*/
////////////////////////////////////////... | ALGO | 0.998544 | 3.628292 |
31c44a68-3266-4f47-8156-84ef13882ef5 | Altaaaaaaa/Face-detection | opencv-master/modules/dnn/src/layers/recurrent_layers.cpp | #include "../precomp.hpp"
#include <iostream>
#include <iterator>
#include <cmath>
#include <opencv2/dnn/shape_utils.hpp>
namespace cv
{
namespace dnn
{
template<typename Dtype>
static void tanh(const Mat &src, Mat &dst)
{
MatConstIterator_<Dtype> itSrc = src.begin<Dtype>();
MatIterator_<Dtype> itDst = dst.be... | ALGO | 0.950718 | 6.979088 |
1933d52b-b186-47de-86c9-93519be82827 | ishandutta2007/codeforces | purplecrayon/normal/1139/A.cpp | #include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define sz(v) (int)v.size()
#define ar array
// #define f fi... | ALGO | 0.999934 | 4.326136 |
4b5dbae0-8097-4313-8fe6-8d18792feb94 | gabrielmmf/competitive-programming | beecrowd/Hooligan.cpp | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define endl '\n'
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define f first
#define s seco... | ALGO | 0.999977 | 4.296648 |
7e823c8c-c7c3-4716-b64a-5f8156d3334a | Zovube/Tasks-solutions | Project_Euler/001/sol.cpp | // count the answer using the fact that numbers form arithmetic progression
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
#ifdef LOCAL
freopen("xxx.in", "r", stdin);
freopen("xxx.out", "w", stdout);
#else
//freopen("xxx.in", "r", std... | ALGO | 0.999843 | 4.025383 |
b00cca09-744f-44b8-81d5-3fe3ac4117fe | JustAG7/Competitive_Programming | Others/VNOJ/VNOICup2023/C.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define nl '\n'
void solve(){
int n;
cin >> n;
vector<int> a(n),b(n);
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<n;i++) cin >> b[i];
sort(all(a));... | ALGO | 0.999931 | 4.082937 |
425db3c3-4759-45d5-80ea-4fb03c8c6f9d | Babita1947/A_to_Z_Striver | SlidingWindow_TwoPointer/Q_11.cpp | //1248. Count Number of Nice Subarrays
#include<bits/stdc++.h>
using namespace std;
class Solution {
int atMost(vector<int>& nums, int goal){
if(goal < 0)
return 0;
int l = 0, r = 0, sum = 0 , cnt = 0;
while(r < nums.size()){
sum += nums[r]%2;
while(sum >... | ALGO | 0.999988 | 5.165348 |
33174e8b-6015-4c2e-96f5-0f69fa3e45d3 | nazibur175/C- | Max_Nutrition.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define test int t; cin>>t; while(t--)
void solve(){
test{
int n;
cin>>n;
//vector<pair<int,int>>a;
vector<pair<int,int>>b;
map<int,int>a;
for(int i=0;i<n;i++){
int x;
cin>... | ALGO | 0.999976 | 3.918735 |
e956805b-4134-4548-80d1-8e1f5599c04f | OUNAVCON/imxRT1060_example | sdk/middleware/openh264/codec/decoder/core/src/parse_mb_syn_cavlc.cpp | #include "parse_mb_syn_cavlc.h"
#include "decode_slice.h"
#include "error_code.h"
#include "mv_pred.h"
namespace WelsDec {
#define MAX_LEVEL_PREFIX 15
typedef struct TagReadBitsCache {
uint32_t uiCache32Bit;
uint8_t uiRemainBits;
uint8_t* pBuf;
} SReadBitsCache;
void GetNeighborAvailMbType (PWelsNeighAvail p... | ALGO | 0.994078 | 3.685082 |
aaa03637-6382-442d-b1c7-483dfc8d2ee9 | jackandjoke/C-plus-plus-exercises | 11/11.32.cpp | #include<map>
#include<string>
#include<iostream>
using std::multimap;
using std::string;
using std::cin;
using std::cout;
int main(){
multimap<string,string> mmp;
mmp.insert({{"jac","play3"},{"jac","todo"}});
mmp.insert({"b","c3"});
mmp.insert({"a","j1"});
mmp.insert({"a","b2"});
mmp.insert({... | TOOL | 0.908696 | 4.191481 |
91a6e66e-0124-4f53-832a-20b7620adb56 | Bryaan159/LabosFunda | LAB-5/EJErcicio2(Lab5).cpp | #include <iostream>
using namespace std;
int main();
{
int Hora, Minutos, Segundos;
cout<<"Ingrese el valor de hora: "<<endl; cin>>Hora;
cout<<"Ingrese el valor de minutos: "<<endl; cin>>Minutos;
cout<<"Ingrese el valor de segundos: "<<endl; cin>>Segundos;
do
{
cout<<"Ingrese el va... | ALGO | 0.918513 | 3.104039 |
5d5d1e95-d158-49b6-98fb-70a6445d185e | StanfordVL/bullet3 | examples/SharedMemory/plugins/stablePDPlugin/SpAlg.cpp | #include "SpAlg.h"
#include <iostream>
cSpAlg::tSpVec cSpAlg::ConvertCoordM(const tSpVec& m0, const tVector& origin0, const tVector& origin1)
{
return ConvertCoordM(m0, origin0, origin1, tMatrix::Identity());
}
cSpAlg::tSpVec cSpAlg::ConvertCoordM(const tSpVec& m0, const tVector& origin0, const tMatrix& R0,
... | ALGO | 0.997355 | 6.020428 |
e71791be-cac6-4447-b639-9c525ac635ce | sottorivalab/FORECAST_image_tiling | code/image_tiles/3rdparty/OpenCV-4.1.2/modules/features2d/src/kaze/fed.cpp | /**
* @file fed.cpp
* @brief Functions for performing Fast Explicit Diffusion and building the
* nonlinear scale space
* @date Sep 15, 2013
* @author Pablo F. Alcantarilla, Jesus Nuevo
* @note This code is derived from FED/FJ library from Grewenig et al.,
* The FED/FJ library allows solving more advanced problem... | ALGO | 0.99984 | 5.226607 |
8afee5d3-923a-4f4d-89fb-c6645f6beaf9 | rohitrajpurohit17/DSA-in-Cpp | 01Basics/11_passByValueFun.cpp | #include<iostream>
using namespace std;
// It's send Copy to function means it not change the value on num1 and num2
// taken down from user
// pass by value
void swapFun(int num1, int num2){
int temp = num1;
num1 =num2;
num2= temp;
cout << num1 << " " << num2 << " In process"<<endl;
}
int main... | ALGO | 0.999144 | 4.199726 |
40b4f2a6-6819-4dde-8814-a8d21c11a19a | EuihyeonO/CppStudy | CodingTest/CodingTest/18222.cpp | //#include <iostream>
//#include <vector>
//#include <cmath>
//
//void Init()
//{
// std::ios::sync_with_stdio(false);
// std::cin.tie(nullptr);
// std::cout.tie(nullptr);
//}
//
//int Recursive(long long x)
//{
// if (x == 0)
// {
// return 0;
// }
// else if (x == 1)
// {
// return 1;
// ... | ALGO | 0.999962 | 4.837239 |
6cbd2270-ed57-4fb5-9ca4-a2f516337a58 | honey0632/Leetcode-2024-Daily | 09-03-2024.cpp | // 1945. Sum of Digits of String After Convert
// https://leetcode.com/problems/sum-of-digits-of-string-after-convert/
#include<bits/stdc++.h>
using namespace std;
class Solution {
public:
int getLucky(string s, int k) {
string number = "";
for (char x : s) {
number += to_string(x - 'a... | ALGO | 0.998979 | 5.616712 |
9c21e325-c82a-413e-a6cf-e96f2d4b7f29 | ampfibi1/Regular_problem_solve | TLE/E_Div_2_174.cpp | #include <bits/stdc++.h>
using namespace std;
#define mt int main(){ios::sync_with_stdio(0); cin.tie(0);int t ;cin>>t ;while(t--)solve();}
#define ll long long
#define rd(type, x) type x; cin >> x;
#define rda(type, arr, n) vector<type> arr(n); for(type &x: arr) cin >> x;
#define prnt(type, arr) for(type &x: arr) co... | ALGO | 0.999928 | 3.571084 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.