uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
f52b25b1-373d-4cf9-99ab-53b594befb10 | PedroGLeme/POO-Listas | lista04/ex9.cpp | #include <iostream>
#include <vector>
#include <string>
using namespace std;
vector<double> notas(const string& s){
vector<double> notas_ret;
int i= 0;
while (i< s.size()){
while (i< s.size() && s[i]!= ','){ i++;}// acha a primeira virgula
i++; //pula a virgula
//le o numero
... | TOOL | 0.989155 | 4.370202 |
ee12ef7c-c00b-48ae-8c04-0b7a368cb6fd | pathakshubham21/CP-Coding | DSA Topics/Recursion/Array_permutation.cpp | #include<iostream>
#include<vector>
using namespace std;
void permutation(vector<int>&vec, vector<vector<int> >&result, int itr)
{
if(itr>=vec.size())
{
result.push_back(vec);
return;
}
for(int i=itr;i<vec.size();i++)
{
swap(vec[itr],vec[i]);
permutation(vec,result,... | ALGO | 0.999988 | 4.732479 |
49eec5e8-e128-4f46-9a57-5e57be7569f5 | shashank3107/whatsapp_clone | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998693 | 6.797273 |
375e08df-87cd-439f-a459-cb926aa45268 | MuriloApa/maratona_programacao | 2715-dividindo_os_trabalhos.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> tarefas;
int i, n, aux;
long long int rangel, gugu;
vector<int>::iterator comeco, fim, parada;
while(cin >> n){
for(i = 0; i < n; i++){
cin >> aux;
tarefas.push_back(aux);
}
comeco = tarefas.begin();
fim = tarefas.end();
fi... | ALGO | 0.999839 | 3.854568 |
78e06249-685f-4600-a501-16e9543f171a | bupt-pris/opencv-mirror | modules/imgproc/src/accum.cpp | #include "precomp.hpp"
namespace cv
{
template<typename T, typename AT> void
acc_( const T* src, AT* dst, const uchar* mask, int len, int cn )
{
int i = 0;
if( !mask )
{
len *= cn;
#if CV_ENABLE_UNROLLED
for( ; i <= len - 4; i += 4 )
{
AT t0, t1;
t0 =... | ALGO | 0.997176 | 6.846273 |
ba8c26e7-a3bf-4eb4-970b-35502a95d70d | Ash0369/LeetCode | 1791.cpp | class Solution
{
public:
int findCenter(vector<vector<int>>& edges)
{
int n=edges.size()+1;
vector<int>count(n+1,0);
for(int i=0;i<edges.size();i++)
{
for(auto x:edges[i])
{
count[x]++;
}
}
for(int i=0;i<count.... | ALGO | 0.999784 | 5.504631 |
b9ea423c-df8b-4950-abca-4863446411d8 | Tahmid999/DSA_cpp | problems/coding_ninjas/aggressive_cow.cpp | /*
Problem statement
You are given an array 'arr' consisting of 'n' integers which denote
the position of a stall.
You are also given an integer 'k' which denotes the number of
aggressive cows.
You are given the task of assigning stalls to 'k' cows such that the
minimum distance between any two of them is the maxi... | ALGO | 0.99994 | 5.131074 |
48884249-2232-4801-bde9-c882d6216751 | yakirhelets/234901_CP | HW2/icpc_4299.cpp | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
using namespace std;
using ii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vii = vector<ii>;
using vvii = vector<vii>;
const int INF = 1e9;
/********** Floyd-Warshall **********/
// input: weighted directed gra... | ALGO | 0.998888 | 3.841376 |
d69b735d-797b-41d2-bafd-e164a768c7fb | SonuLohani-1/LeetcodeProblems | LeetCode150/56.cpp | #include<bits/stdc++.h>
using namespace std;
// This is the soltuion of the problem 56, Merge Intervals on leetcode.
// https://leetcode.com/problems/merge-intervals/
// The idea is to sort the intervals according to their starting time.
// Then we will iterate over the intervals.
// If the current interval's startin... | ALGO | 0.999992 | 6.007455 |
15a3e73e-34b0-4fd7-ab6a-510e3c3190d2 | AvadheshChamola/LeetCode | 713_Subarray_Product_Less_Than_K.cpp | /*
713. Subarray Product Less Than K
Medium
Given an array of integers nums and an integer k, return the number of contiguous subarrays where the product of all the elements in the subarray is strictly less than k.
Example 1:
Input: nums = [10,5,2,6], k = 100
Output: 8
Explanation: The 8 subarrays that have product l... | ALGO | 0.999924 | 6.126372 |
2696cb03-5df5-4ab3-9a11-cec2a2b92795 | Arin016/DSA | Dynamic Programming II/LISformII.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
int mod = 1e9+7;
int n;
vector<int> a, dp;
// staring form: best ans starting at level
int rec(int level) {
// base case
if (level == n) return 0;
// cache check
if (dp[level] != -1) return dp[level];
// compute
int ans =... | ALGO | 0.999986 | 4.281135 |
e3308895-9f66-4c38-b071-3f345a653adf | ishandutta2007/codeforces | cheetose/normal/1203/F1.cpp | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c... | ALGO | 0.999995 | 3.904402 |
931355f8-6c54-4922-9dd3-20a92030961d | msalyzyn/libcxx | test/std/containers/associative/multiset/lower_bound.pass.cpp | // <set>
// class multiset
// iterator lower_bound(const key_type& k);
// const_iterator lower_bound(const key_type& k) const;
#include <set>
#include <cassert>
#include "test_macros.h"
#include "min_allocator.h"
#include "private_constructor.hpp"
int main()
{
{
typedef int V;
typedef std... | TEST | 0.969906 | 4.899806 |
9ed1fa0d-65a0-4ba2-bb8a-24b5d4fbf2ef | rootoverswapno/All-Programming- | two pinter/string_Palindrome.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int lo =0;
int hi=s.size()-1;
bool ok=false;
while(lo<=hi)
{
if(s[lo]!=s[hi])
{
ok=true;
break;
}
else{
lo++;
hi--;
}
}
if(!ok)
{... | ALGO | 0.999328 | 4.027027 |
5f205599-e650-4f0d-9800-e54c2dad4825 | ElyesBelgouthi/CP-Learning | C/Vasilije in Cacak.cpp | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int t,n,k,x;
cin >> t;
for(int j=0; j<t; j++)
{
cin >> n >> k >> x;
}
}
| ALGO | 0.99898 | 3.292504 |
4ce26195-266d-4f56-ad5a-c21945efc888 | ishandutta2007/codeforces | oyjason/normal/1088/B.cpp | #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define M
using namespace std;
int read(){
int nm=0,fh=1;char cw=getchar();
for(;!isdigit(cw);cw=getchar()) if(cw=='-') fh=-fh;
for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
return nm*fh;
}
int n,m,x,p... | ALGO | 0.999979 | 3.319623 |
018c3c98-8a08-4d15-908d-9641d626c76f | Arif-Rahman-Sikder/Competitive-Programming | Module 1/VjudgeS.cpp | #include <bits/stdc++.h>
//[-(~TheHonestGuy~)-]
using namespace std;
int main()
{
int t;
cin >> t;
int x = 20, y=0;
while (t--)
{
int n;
cin >> n;
if (n <= x)
{
y = n/2;
cout << y << " " << n-y << endl;
}
else
{
... | ALGO | 0.999746 | 3.986495 |
dba4990c-6094-49a8-ae85-281f63c7ba29 | mustakimur/CFI-LB | llvm-project/llvm/tools/llvm-cov/CoverageExporterJson.cpp | //===----------------------------------------------------------------------===//
//
// The json code coverage export follows the following format
// Root: dict => Root Element containing metadata
// -- Data: array => Homogeneous array of one or more export objects
// -- Export: dict => Json representation of one Cove... | TOOL | 0.902142 | 7.714692 |
a5073cce-e57b-4829-8abf-e327c62943d5 | uciz16470/2020cce | 0326/0326.cpp | #include <stdio.h>
#include <string.h>
char line[100][10];
int main()
{
int N;
scanf("%d",&N);
for(int i=0; i<N; i++){
scanf("%s",line[i]);
}
char temp[10];
for(int i=0; i<N; i++){
for(int j=i+1; j<N; j++){
if(strcmp(line[i],line[j])>0){
strcpy(temp,line[i]);
strcpy(line[i],line[j]);
strcpy(lin... | ALGO | 0.999982 | 3.336895 |
8a1bca22-9ef3-4aa7-8ae9-a9537e75db0b | webplusai/thc-pivx | src/libzerocoin/Coin.cpp | /**
* @file Coin.cpp
*
* @brief PublicCoin and PrivateCoin classes for the Zerocoin library.
*
* @author Ian Miers, Christina Garman and Matthew Green
* @date June 2013
*
* @copyright Copyright 2013 Ian Miers, Christina Garman and Matthew Green
* @license This project is released under... | TOOL | 0.950236 | 6.11468 |
fa72240f-853d-47b8-bc5d-1b66789522ca | kirollosatef/problem-solving | codeforces/struct_and_function.cpp | #include <iostream>
#include <string>
using namespace std;
struct window
{
float length;
float width;
};
window collect(window es1, window es2);
int main()
{
window x, y, z;
cout << "enter x length & width\n";
cin >> x.length >> x.width;
cout << "enter y length & width\n";
cin >> y.length >> y.width;
//... | ALGO | 0.937788 | 3.369701 |
873549fd-3482-437a-be4f-c7e2ab56f3e9 | ria28/Data-Structures-And-Algorithms | Arrays/Practice/3Sum.cpp | #include <iostream>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <queue>
#include <climits>
#define ll long long
using namespace std;
#define f_loop(i, s, e) for (int i = s; i < e; i++)
#define f_long(i, s, e) for (long long i = s; i < e; i++)
#defi... | ALGO | 0.999963 | 5.312095 |
a76c4a1b-54e7-4399-8e2a-49ac72acb54b | coughlinw97/programming-assignments | TestScores.cpp | // William Coughlin
#include <iostream>
#include <iomanip>
#include <string>
void SortArrAscending(double*, std::string*, const int);
double Average(double*, const int);
void DisplayArr(const double*, const std::string*, const int);
int main() {
int numScores;
std::cout << "Enter the number of scores you wish to... | ALGO | 0.972675 | 6.381609 |
02a5a62c-efbe-41f6-9e05-9c6d866fee1e | Samspei01/CP | Codeforces/B. Substrings Sort.cpp | // Link: https://codeforces.com/contest/988/problem/B
#include <bits/stdc++.h>
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
typedef long long ll;
#define ordered_set tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
#include <ext/pb_ds/assoc_container.hpp>
#in... | ALGO | 0.99999 | 3.93937 |
4a0de091-b374-4250-86cb-b14c7cf74a9c | arn4/CompetitiveProgrammingCourse | Lezione_10-15/Circular_RMQ.cpp |
/* Luca Arnaboldi
*
* Competitive Programming and Contest, a.a. 2018-2019
*/
/* SOLUTION DESCRIPTION:
* The solution implement a segment tree with lazy update on the array A
* for answering to queries on intervals efficently. Circular queries that
* are handled slpittting in two queries on the array.
*
*/
#... | ALGO | 0.999977 | 5.220551 |
4ef9e6e2-0ec8-4d03-9128-1df11e45edd6 | ArtemPustunniy/ITMO_Algorithms | lab №11/5.cpp | #include "iostream"
# include <algorithm>
# include <cstring>
# include <vector>
using namespace std;
const int N_MAX = 2001;
struct Edge
{
int to, next;
};
int n, m, e;
vector <int> g[N_MAX + 10];
int opp[N_MAX + 10];
bool vis[N_MAX + 10];
bool vx[N_MAX + 10], vy[N_MAX + 10];
void addEdge(int x, int y)
{
... | ALGO | 0.999978 | 3.405555 |
855ec701-4ee6-4bf6-aed9-bb100d0485dc | pushkarNath007/DSA_GFG_1 | ARRAY REVISON 2/480 Ques Repeat/subarray_with_sum_divisible_by_k.cpp | #include<bits/stdc++.h>
using namespace std;
int max_length_subarray_divisible_by_k(int *arr,int n,int k){
unordered_map<int,int>ans;
ans[0]=-1;
int sum=0;
int count=0,maxcount=0;
for(int i=0;i<n;++i){
sum+=arr[i];
int rem=sum%k;
if(rem<0) rem+=k;
if(ans.find(rem)!=an... | ALGO | 0.99997 | 4.55107 |
f3f014ee-3894-4fab-b3be-d1d5dca8e1f6 | debbrotokumark/Happy-Vacation-Bigmod-Trivial-Sorting- | BI - What is the Median?.cpp | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int v[10001];
int i=0;
int m;
int main()
{
int m;
while(cin>>m){
v[i]=m;
sort(v,v+i+1);
int mid=(i+1)/2;
if((i+1)%2!=0){
cout<<v[mid]<<endl;
}
else if((i+1)%2==0){
m=(v[mid]+v[mid-1])/2;
cout<<m... | ALGO | 0.999904 | 3.583588 |
a7d75646-ec05-4ef8-b596-e41c7d347ea4 | JustHoang/IINT1306_CAU_TRUC_DU_LIEU_VA_GIAI_THUAT_HK20222 | CONTEST 1/CTest001. TIM SO LON NHAT.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
long long x; long long ans = -1;
while(cin>>x) ans = max(ans, x);
cout<<ans;
} | ALGO | 0.998762 | 3.546453 |
0f91d9f0-8b67-4d71-a97f-55a6d9deea13 | vukasinjokic/chessEngine | chessEngine/chessEngine/MoveGenerator.cpp | #include "MoveGenerator.h"
#include "Board.h"
#include "PrecomputedMoveData.h"
#include "BitBoardUtility.h"
#include "Move.h"
std::vector<class Move> MoveGenerator::moves;
bool MoveGenerator::isWhiteToMove;
int MoveGenerator::friendlyColour;
int MoveGenerator::opponentColour;
int MoveGenerator::friendlyKingSquare;
int... | ALGO | 0.986085 | 5.878089 |
69456a62-98ed-406a-8933-6671d32618d9 | AKASHCS50/C-CPP-Practice | Dynamic Programming/0-1Knapsackmemo.cpp | // O(n*W)
#include <bits/stdc++.h>
using namespace std;
int knapsackMemo(int[], int[], int, int, vector<vector<int> >);
int main()
{
int n, W, i, maxm;
printf("Enter the number of items ");
scanf("%d", &n);
int wt[n], val[n];
vector<vector<int> > dp(W + 1, vector<int>(n + 1, -1));
printf("E... | ALGO | 0.999993 | 4.333864 |
f581e6cf-3839-4598-869c-64f67c8f86a1 | 2745518585/code | AGC010D.cpp | #include<cstdio>
#include<algorithm>
using namespace std;
const int N=1000001;
int n,a[N];
int gcd(int a,int b)
{
if(b==0) return a;
return gcd(b,a%b);
}
bool solve()
{
int s1=0,s2=0;
bool u=false;
for(int i=1;i<=n;++i)
{
if(a[i]%2==1) ++s1;
else ++s2;
if(a[i]==1) u=true;... | ALGO | 0.999993 | 4.238201 |
da49c360-32fe-4754-97f1-c7019d190305 | martin0327/LeetCode | 1855-maximum-distance-between-a-pair-of-values/1855-maximum-distance-between-a-pair-of-values.cpp | class Solution {
public:
int maxDistance(vector<int>& a, vector<int>& b) {
int n = a.size(), m = b.size();
int i=0, j=0, ans=0;
while (i<n) {
if (i<n && j<m && i<=j && a[i] <= b[j]) ans = max(ans, j-i);
if (i>=j || (j < m && a[i]<=b[j])) j++;
else i++;
... | ALGO | 0.999976 | 5.567932 |
58c400a3-54cd-4ed3-86c5-f2a3e0b8f855 | smyy1001/bilkent_cs201 | Spring23/exercises/test4.cpp | #include <iostream>
#include <string>
using namespace std;
void fun(string& x, string y) {
x.erase(0,2);
x.insert(2, y.substr(1,2));
x.append("***");
cout << "x: " << x << endl;
y += x[0];
y[2] = 'e';
cout << "y: " << y << endl;
}
int main() {
string s1 = "python", s2 = "java";
c... | ALGO | 0.996918 | 4.365514 |
70d0ddff-2a60-40a4-81b7-c0e49b66ee60 | antenna-one/DReaM | tags/dream-1.17/src/matlib/MatlibStdToolbox.cpp | #include "MatlibStdToolbox.h"
#include "../GlobalDefinitions.h"
/* The mutex need to be application wide,
only the execution routines are thread-safe */
static CMutex* mutex = NULL;
#define MUTEX_LOCK() mutex->Lock()
#define MUTEX_UNLOCK() mutex->Unlock()
#ifdef HAVE_FFTW3_H
# define PLANNER_FLAGS (FFTW_ESTIMATE |... | ALGO | 0.999908 | 3.733954 |
cb92d341-5cbb-4c2d-8bf1-6a3f2046b532 | ohtuna/Algorithm | BOJ/10834.cpp | #include<iostream>
using namespace std;
int Change_Rotate(int r, int cur_r)
{
if(r == 0) return cur_r;
return (cur_r+1)%2;
}
int main()
{
int n;
cin >> n;
int cur_rotate = 0;
long long ansA = 0;
long long ansB = 0;
for(int i =0; i<n; i++)
{
long long a, b, r;
ci... | ALGO | 0.999948 | 3.542637 |
d6848413-b871-4e6c-a587-70a82076a5b8 | aczwink/StdPlusPlus | src/Compression/HuffmanDecoder.cpp | //Class header
#include <Std++/Compression/HuffmanDecoder.hpp>
#include <Std++/Streams/Bitstreams/BitInputStreamBitReversed.hpp>
#include <Std++/Debug.hpp>
//Namespaces
using namespace StdXX;
//Constants
const int16 STATE_INVALID = 0; //0 is fine because no node can have the root as child
/*
This algorithm maps a tre... | ALGO | 0.999636 | 5.704119 |
eb986254-d70d-4bb7-a871-fead8eeee0f0 | roy7077/POTD-Leetcode | 1043. Partition Array for Maximum Sum.cpp |
// MEMOIZATION
class Solution {
public:
int help(vector<int>& arr,int i,int& k,vector<int>& memo)
{
//base case
if(i>=arr.size())
return 0;
//memo check
if(memo[i]!=-1)
return memo[i];
//recursive calls
//and small calculatio... | ALGO | 0.999913 | 5.632129 |
61d02b6d-6797-4e1c-b675-33c27b39d242 | al-amin-bhuiyan/Leetcode-Solution | 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.cpp | class Solution {
public:
int isPrefixOfWord(string str, string s) {
stringstream ss(str);
string word;
int wordIndex = 1;
while (ss >> word) {
if (word.find(s) ==0) {
return wordIndex;
} wordIndex++;
}
return -1;
}
}; | ALGO | 0.999414 | 5.376567 |
48487ea6-3efc-4df1-b8a2-1dfdd7522077 | dj140/RC_CTRL | Transmitters/Software/Libraries/DigitalFilter/examples/adc_filter.cpp | #include "DigitalFilter.h"
/*ֵ˲ȡ13ȥֵСֵʣƽ*/
FilterAverage<uint16_t> ADC_FA(13);
/*ͻ˲ȥ50µIJ*/
FilterHysteresis<uint16_t> ADC_FH(50);
/*ADC*/
#define Sampling_Pin PA0
void setup()
{
pinMode(Sampling_Pin, INPUT_ANALOG);
Serial.begin(115200);
}
void loop()
{
uint16_t adc_val = analogRead(Sampling_Pin);
... | TOOL | 0.904842 | 3.10434 |
d2819817-ea79-4e96-8d2b-901bf7a40f44 | viniscoelho/beecrowd | 1581.cpp | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define MAXV 200100
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long int64;
typedef pair<int, string> is;
int readInt()
{
bool minus = false;
int result = 0;
char ch;
ch = getchar_unlocked();
... | ALGO | 0.994855 | 4.231483 |
716ba093-dafd-4cdd-9f8e-02142a9ffe90 | paperfrog1228/Algorithm | Baekjoon/1969_DNA.cpp | #include<stdio.h>
int n,m,min,t,d;
char s[1004][55],ans[55];
int main(){
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%s",s[i]);
for(int i=0;i<m;i++){
int a[27]={0,},max=0,max_i=0;
for(int j=1;j<=n;j++){
a[s[j][i]-'A']++;
t=a[s[j][i]-'A'];
if(t>=... | ALGO | 0.999997 | 3.118742 |
a655c444-d7c8-448c-aefc-27eec640e10b | zavik001/contest-coding | Codeforces/D - Tandem repeats/123321.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long t;
std::cin >> t;
for (long long j = 0; j < t; j++)
{
string s;
std::cin >> s;
int n = s.size();
bool SubString[n][n];
// Initialize the SubString matrix
for (int i = 0; i < n; i... | ALGO | 0.999894 | 3.774918 |
f76b6a2c-b458-4d67-bd9e-d3d5a038f875 | kysvamsi/Codeforces | 1931D.cpp | #include<bits/stdc++.h>
#define int long long
#define f(i,a,b) for (int i=a;i<b;i++)
#define all(a) a.begin(),a.end()
#define vint vector<int>
#define mint map<int,int>
#define sint set<int>
#define qint queue<int>
#define pb push_back
#define pf push_front
const int MOD = 1e9 + 7;
using namespace std;
void solve(){
... | ALGO | 0.999776 | 3.962161 |
631f5cd5-4e14-4786-8f7f-9e1d88158075 | akhilsharmaa/Competitive-Programming | GeekForGeeks/Negative every window/negetive.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
vector<ll> printFirstNegativeInteger(ll arr[], ll n, ll k) {
queue<int> que;
vector<ll> res;
for (int i = 0; i < k-1; i++)
if(arr[i] < 0)que.push(arr[i]);
int i = k-1;
while (i < n){
... | ALGO | 0.99999 | 4.173046 |
9d6587a3-524c-4e2b-947d-0079f65ae16b | marlon214/CS202.assn3 | main.cpp | #include "crop.h"
#include "garden.h"
#include <iostream>
#include <time.h>
#include <cstdlib>
#include <string>
using namespace std;
//Function prototypes
void fillGarden(Garden* garden, int width, int height);
int readInt();
int main(int argc, char** argv)
{
unsigned int seed = 400805; //Variable to hold the see... | TOOL | 0.946805 | 5.487005 |
9539f0cf-6341-41f3-ae18-43bf93d53977 | StanimirKD/palindrome | 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 |
a8dde49f-aed1-4b1e-bfe8-d030d70249e3 | pnnv/hyprland-dotfiles | VSCodium/User/History/-41637750/VoO2.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void snu() {
int n; cin >> n;
vector <int> v(4);
for(auto &i: v) {
cin >> i;
}
for(int _ = 0; _ < 2; ++_) {
int a = max(v[0] - (n - 2), 0), b = max(v[2] - (n - 2), 0);
if(a < b) swap(a, b);
if(a == b) {
if(a == 1 && v[1] + v[3] < 2 &... | ALGO | 0.999939 | 3.828719 |
e5bd4e3a-82cc-4829-8da1-7ea164c90ca1 | naveengitboi/cp | codes/lcPOTD/october/07minLenAfterSubStrRemoval.cpp | #include <bits/stdc++.h>
using namespace std;
//2696 leetcode
//
//
//my appraoch to this problem
int minLength(string s){
while(true){
int i = 0;
int n = s.length();
string newS = "";
bool seen = false;
while(i < n -1){
string temp ="";
temp += s[i]... | ALGO | 0.999823 | 5.658729 |
b0ed3bd2-1d4e-4a78-acde-334c20f92cdc | MRYoungITO/C-11 | 项目15_类模板/项目15_类模板/类模板定义和调用.cpp | #include <iostream>
using namespace std;
// ̳иģĽ
// 1.һ, ģ, ̳ͨе÷
// 2.һ, ģ, ̳ʱʵͲ
// 3. ģ, ͿԴݵ
//class B {
//public:
// B(int b) {
// this->b = b;
// }
//
//private:
// int b;
//};
template <typename T>
class A /*: public B*/
{
public:
A(T t = 0); /*: B(0)*/
// Աֵ
T& getT();
A operator+(const A& other);
void ... | ALGO | 0.983882 | 3.806328 |
afcc3915-8f05-4d83-9a16-3ab670f33d96 | sanjeevWeb/latest_gfg | Difficulty: School/Reversing the vowels/reversing-the-vowels.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
string modify (string s)
{
//code here.
int i = 0;
int j = s.size() - 1;
while(i <= j){
if((s[i] == 'a' || s[i] == 'e' |... | ALGO | 0.999555 | 6.093466 |
883a6856-a478-415d-8130-43e9bc8eb8cf | soumanpaul/Daily-LeetCode | 323-number-of-connected-components-in-an-undirected-graph/323-number-of-connected-components-in-an-undirected-graph.cpp | class UnionFind{
private:
vector<int> root;
vector<int> rank;
int count;
public:
UnionFind(int sz): root(sz), rank(sz){
for(int i =0; i < sz; i++){
root[i] = i;
rank[i] = i;
}
count = sz;
}
void U... | ALGO | 0.999991 | 5.961858 |
df173f95-68e6-463c-b123-8fbddeb3b6cf | dfmoura/C-- | UberHub/neps/somaFacil.cpp | #include <iostream>
using namespace std;
int main(){
// Lendo a entrada do exercício
int A, B;
cin >> A >> B;
// Seu código vai aqui
cout << A + B << endl;
return 0;
} | ALGO | 0.996218 | 3.866055 |
a6225fcd-6244-47ca-a281-41c891dd5002 | lomrormaheshIITB/coursera | algorithm toolbox/week6_dynamic_programming6/knapsack.cpp | #include <iostream>
#include <vector>
using std::vector;
int optimal_weight(int W, const vector<int> &w) {
//write your code here
int N = w.size();
// int gold[W+1][N+1];
int n = N+1;
int wt = W+1;
vector<int> gold(n * wt);
int remaining_weight = W;
// for(int i=0; i<=W; i++) gold[i][0] = 0; // no... | ALGO | 0.999995 | 5.246858 |
37c02b20-8acf-4739-8f97-627abd3c4bf3 | ishandutta2007/codeforces | potassium/normal/1355/B.cpp | #pragma GCC optimize ("O3", "unroll-loops")
//#pragma GCC target ("avx2")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(x) x.... | ALGO | 0.99993 | 4.535891 |
dab916ba-194c-4de5-b457-9b1e8c63b060 | Ilic02/AISP | Usmeni/18-Strukture-podataka-sa-asocijativnim-pristupom/implemetacija_mape.cpp | // Implementacija mape preko uredjenog binarnog drveta
#include <iostream>
using namespace std;
struct cvor{
string kljuc;
int vrednost;
cvor *levo, *desno;
};
cvor *napravi_cvor(const string &kljuc, int vrednost){
cvor *novi = new cvor();
novi->kljuc = kljuc;
novi->vrednost = vrednost;
n... | ALGO | 0.999485 | 4.028548 |
64396619-56d6-4833-8c15-ce195a224ca9 | MOHAMMED-SAMEE/leetcode-problems | Power-of-Three.cpp | class Solution {
public:
bool isPowerOfThree(int n) {
if(n==1) return true;
if(n<1 || n%3!=0) return false;
return isPowerOfThree(n/3);
}
}; | ALGO | 0.99919 | 6.01658 |
31fe5475-cb31-4959-acf9-23f6ec7db441 | NAGAVENIGOWDA/My_Placement_prep_DSA | max-circular-subarray-sum.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
// arr: input array
// num: size of array
int circularSubarraySum(int arr[], int num){
int maxKadane = kadane(arr, num);
// Step 2: Find the total sum of the array
int to... | ALGO | 0.999967 | 6.350028 |
3136f338-cc01-4008-a6fb-50a4f06bcba9 | abhiXsliet/Solved-DSA-Problems | GFG POTD/021-August-2025/005-string-palindromic-ignoring-spaces.cpp | // https://www.geeksforgeeks.org/problems/string-palindromic-ignoring-spaces4723/1https://www.geeksforgeeks.org/problems/string-palindromic-ignoring-spaces4723/1
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
// TC : O(N)
// SC : O(1)
bool isPalinSent(string &s) {
int n =... | ALGO | 0.998879 | 5.798701 |
66ad7e7a-cc47-4494-975d-e57a37d16c09 | sravya273/DataStructures | Graphs/TopologicalSort.cpp | //Detect cycle in a undirected graph
#include <bits/stdc++.h>
using namespace std;
bool topologicalSort(vector <vector<int>> &g, vector <bool> &done, stack <int> &s, int src)
{
done[src] = true;
for(int i=0;i<g[src].size();i++)
{
if(!done[g[src][i]])
topologicalSort(g,done,s,g[src][i]);
... | ALGO | 0.999998 | 5.242753 |
d7cca373-6167-474a-a10e-4a994dd9c055 | ishandutta2007/codeforces | crackersamdjam/normal/1314/A.cpp | #include <bits/stdc++.h>
#define gc getchar()
#define pc(x) putchar(x)
template<typename T> void scan(T &x){x = 0;bool _=0;T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;}
template<typename T> void printn(T n){bool _=0;_=n<0;n=_?-n:n;char snum[65... | ALGO | 0.999937 | 3.455557 |
6919143f-ab5b-4ab9-b83b-d750ecb84fc4 | dmichael/marionette | stk/BeeThree.cpp | /***************************************************/
/*! \class BeeThree
\brief STK Hammond-oid organ FM synthesis instrument.
This class implements a simple 4 operator
topology, also referred to as algorithm 8 of
the TX81Z.
\code
Algorithm 8 is :
1 --.
... | TOOL | 0.94379 | 5.509254 |
f60abeb9-106b-4174-b306-d5a372de0bab | CiaranWelsh/libsemsim2 | semsim/omex/SBMLOmex.cpp | # include "omex/SBMLOmex.h"
# include "sbml/SBMLImporter.h"
# include "rdf/RDFReader.h"
# include "combine/combinearchive.h"
# include "combine/knownformats.h"
# include "combine/omexdescription.h"
namespace semsim {
SBMLModel importSBMLOmex(const std::string& archive_path, const std::string& model_entry_path, co... | TOOL | 0.917998 | 6.487649 |
4a552fcf-5da8-4bbb-9fb4-2f5865c7aa0a | hylTianMeng/PreCode | c++/codeforces/EDU125/E.cpp | #include<bits/stdc++.h>
#define mset(a,b) memset((a),(b),sizeof((a)))
#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define dec(i,l,r) for(int i=(r);i>=(l);i--)
#define inc(a,b) (((a)+(b))>=mod?(a)+(b)-mod:(a)+(b))
#define sub(a,b) (((a)-(b))<0?(a)-(b)+mod:(a)-(b))
#define mul(a,b) 1ll*(a)*(b)%mod
#define sgn(a) (((a)&1... | ALGO | 0.999977 | 3.109892 |
eedb339a-fbd9-4991-a110-6ef92b62a759 | aditi2802/LeetCode | Common elements - GFG/common-elements.cpp | // { Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
vector <int> commonElements (int A[], int B[], int C[], int n1, int n2, int n3)
{
//code here.
vector<int> v;
int i = 0, j = 0, k = 0;
... | ALGO | 0.999748 | 4.887292 |
63076c38-7ef0-480d-8141-29a4a773cb7c | AditiKini/DataStructure-using-cplusplus | Lect63/BalancedTreeORNot2.cpp | class Solution{
public:
//Function to check whether a binary tree is balanced or not.
pair<bool, int> isBalancedFast(Node *root){
// Your Code here
if(root == NULL){
pair<bool, int> p(true, 0);
return p;
}
pair<bool,int> left = is... | ALGO | 0.99994 | 6.340592 |
8641cf03-9e06-45ae-8f93-c95fad7f66f2 | ishandutta2007/codeforces | ytkn/normal/1400/A.cpp | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x... | ALGO | 0.999835 | 3.969811 |
8bbac29a-c930-4ce4-92c7-a77ab913ab54 | RS-MS03/Cryptool2 | LibSource/ExtendedNTL/src/mat_GF2E.cpp |
#include <NTL/mat_GF2E.h>
#include <NTL/vec_GF2XVec.h>
#include <NTL/vec_long.h>
#include <NTL/BasicThreadPool.h>
NTL_START_IMPL
//===========================================================
#define PAR_THRESH (40000.0)
static double
GF2E_SizeInWords()
{
return GF2E::WordLength();
}
static
void mul_aux(Mat<GF2... | ALGO | 0.999721 | 4.374848 |
4a781f05-e158-4046-9202-222317527abe | katten23cool/OPB200 | Vecka 2/Workshop/Workshop.cpp | #include <iostream>
#include <list>
#include <vector>
#include "funktion.h"
using namespace std;
int main()
{
vector<int> dagspriser = { 2,1,2,3,5,6,4 ,3,4,5,6,7,8, 5,4,3,2,5,6,4 };
int langd = 0;
int temp = 0;
int last = 0;
for (int tal : dagspriser) {
if (tal > last)
temp... | ALGO | 0.977985 | 4.126848 |
8b7151f2-dd47-47a5-843c-cf29e85a0ec9 | UnnamedOrange/OI | Problems/Contest 3/data/prefix/gen.cpp | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cassert>
#include <cctype>
#include <climits>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset... | TEST | 0.938353 | 3.069868 |
b4cc8dce-c80b-4588-bace-9336f5ff2ac1 | balvind3r/leetcode | 0009.PalindromeNumber.cpp | //Given an integer x, return true if x is palindrome integer.
//An integer is a palindrome when it reads the same backward as forward.
class Solution {
public:
long int reverseNumber(int j){
long int reverse=0;
long int remainder;
while (j!=0){
remainder=j%10;;
... | ALGO | 0.999911 | 5.20757 |
e5f5052e-1f22-41be-87be-8f2a03f239e2 | Ddelval/Competitive-programming | CodeForces/Contests/20210826/B.cpp | // B.cpp
// Created by David del Val on 26/08/2021
//
//
// https://github.com/Ddelval/Competitive-programming/blob/master/template.cpp
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#ifdef DEBUG
#define db(x) x
#define e... | ALGO | 0.999946 | 5.442789 |
5af91cca-f3c7-486d-b70a-a2bc6f586890 | MansoorMuhammad/c-codes | sumofTwoNo.cpp | #include<iostream>
using namespace std;
int main(){
int a, b, c;
cout<<"Enter 1st no :"<<endl;
cin>>a;
cout<<"Enter 2nd no :"<<endl;
cin>>b;
c = a+b;
cout<<"The result is = "<<c<<endl;
} | ALGO | 0.981642 | 3.333101 |
b0e742f9-91c3-4690-a874-4895c84416b2 | sarnold/cbmc | src/goto-symex/rewrite_union.cpp | /*******************************************************************\
Module: Symbolic Execution of ANSI-C
Author: Daniel Kroening, <EMAIL>
\*******************************************************************/
#include <util/std_expr.h>
#include <util/std_code.h>
#include <util/expr_util.h>
#include <util/byte_oper... | TOOL | 0.918542 | 4.230006 |
32f64cf2-ea0e-480c-bb61-d6855e3ad1f1 | Sofiuia/-0 | deque.cpp | #include <iostream>
using namespace std;
enum Color { RED, BLACK };
struct Node {
// Потрібно знати: класи, вказівники, умовні оператори, рекурсію, enum.
int data;
Color color;
Node *left, *right, *parent;
Node(int data) : data(data), color(RED), left(nullptr), right(nullptr), parent(nullptr) {}
... | ALGO | 0.99818 | 5.409646 |
991bdb9b-431e-4258-92a9-a60c17ef58df | heyuanYao-pku/Control-VAE | ThirdParty/eigen-3.3.8/bench/sparse_trisolver.cpp |
//g++ -O3 -g0 -DNDEBUG sparse_product.cpp -I.. -I/home/gael/Coding/LinearAlgebra/mtl4/ -DDENSITY=0.005 -DSIZE=10000 && ./a.out
//g++ -O3 -g0 -DNDEBUG sparse_product.cpp -I.. -I/home/gael/Coding/LinearAlgebra/mtl4/ -DDENSITY=0.05 -DSIZE=2000 && ./a.out
// -DNOGMM -DNOMTL
// -I /home/gael/Coding/LinearAlgebra/CSparse/... | ALGO | 0.997584 | 4.866787 |
ad3a6821-426b-41e5-b5fa-4038cbea2236 | IIIIIIIIIU/onlysky | 4474.cpp | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
typedef unsigned long long ll;
const ll mod=998244353;
const int maxn=1e4+5;
const int INF=0x3f3f3f3f;
struct node
{
int size;
ll Hash;
bool operator<(const node &tmp)const
{
if(size==tmp.size)
return Hash<tmp.Hash;
return s... | ALGO | 0.999887 | 3.939762 |
bea5512c-a5de-4613-a1ef-8b7519f25b13 | MustangYM/ShelbyObfuscator | libcxx/test/std/algorithms/alg.nonmodifying/alg.count/ranges.count.pass.cpp | // <algorithm>
// UNSUPPORTED: c++03, c++11, c++14, c++17
// template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity>
// requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
// constexpr iter_difference_t<I>
// ranges::count(I first, S last, const T& value, P... | TEST | 0.921358 | 7.240096 |
05758d46-051e-4959-b505-3951cb087442 | 1337DaKL/Bai_Tap_C_Plus_Plus | baitaphacker28tech/sapxeptimkiem/sapxepchen.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n;
cin >> n;
ll a[n];
for (auto &it : a)
{
cin >> it;
}
for (int i = 1; i < n; i++)
{
int pos = i - 1;
ll x = a[i];
while (pos >= 0 && a[pos] > x)
{
a[po... | ALGO | 0.999922 | 3.895082 |
241ddc1e-ffb1-45c3-af79-947f29b5bb0f | ToxicPie/codebook | content/math/number-theory/tonelli-shanks.cpp | int legendre(Mod a) {
if (a == 0) return 0;
return (a ^ ((MOD - 1) / 2)) == 1 ? 1 : -1;
}
Mod sqrt(Mod a) {
assert(legendre(a) != -1); // no solution
ll p = MOD, s = p - 1;
if (a == 0) return 0;
if (p == 2) return 1;
if (p % 4 == 3) return a ^ ((p + 1) / 4);
int r, m;
for (r = 0; !(s & 1); r++) s >>= 1;
Mod ... | ALGO | 0.999896 | 3.599888 |
6f199576-4b57-4fc7-8500-94f6f2550d8f | shahidul-brur/OnlineJudge-Solution | Codeforces (volume 2)/714_A - Meeting of Old Friends.cpp | #include<bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vii;
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define F(i, a, b) for(int i=a;i<=b;i++)
#define Fr(i, b, a) for(int i=b;i>=a;i--)
#define pi acos(-1)
#defi... | ALGO | 0.999737 | 3.167059 |
103bc31c-0369-423e-a0b1-3450a8fb78a8 | Sarthak-Gupta345/DAA-lab-mannual | week 1/binary search.cpp | #include <iostream>
using namespace std;
void binary_s(int arr[],int l,int h,int key)
{
int comparison=0;
bool flag=0;
while(l<=h)
{
comparison++;
int mid=l+(h-l)/2;
if(arr[mid]==key){
flag=1;break;
}else if(arr[mid]>key)
h=mid-1;
else l=mi... | ALGO | 0.999795 | 4.17536 |
daacac0a-6db3-4b92-82c3-8ca6dcd6f2b5 | Gxt0929/My-homework | 部分背包问题.cpp | #include<iostream>
#include<algorithm>
#include<bits/stdc++.h>
using namespace std;
struct coin{
int m;
int v;
}a[110];
bool cmp(coin a,coin b)
{
//判断单价
//也可以比较性价比
return a.m * b.v < a.v * b.m;
}
int main()
{
int n,t;//t背包容量
cin>>n>>t;
for(int i = 0;i<n;i++)
{
cin>>a[i].m>>a[i].v;
}
sort(a,a+n,cmp);... | ALGO | 0.999807 | 4.295899 |
bd684d3b-de26-40d1-88c5-7706a8dd873f | OzzieIsaacs/winmerge-qt | ext/boost_1_70_0/libs/graph/example/fr_layout.cpp | // Authors: Douglas Gregor
// Andrew Lumsdaine
#include <boost/graph/fruchterman_reingold.hpp>
#include <boost/graph/random_layout.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/topology.hpp>
#include <boost/lexical_cast.hpp>
#include <string>
#include <iostream>
#include <map>
#include... | ALGO | 0.998234 | 5.374009 |
9b4cb176-412e-42ca-af62-4f14e4a8be90 | andreiarnautu/Algorithmic-Problems-Part-3 | balls_of_steel.cpp | /**
* Worg
*/
#include <vector>
#include <iostream>
#include <algorithm>
bool close(std::pair<int, int> a, std::pair<int, int> b, int k) {
return std::abs(a.first - b.first) + std::abs(a.second - b.second) <= k;
}
int main() {
int tests; std::cin >> tests;
for (int test = 0; test < tests; test++) {
... | ALGO | 0.999873 | 4.901606 |
c6ac704e-edb7-4931-8992-c19861a7df3c | hjiang13/LLMs-in-IR | processed_data/DecompiledResuts_Human_x_164_O1/GPT4o_Human_x_164_O1_decompiled/CPP_161.cpp | ```cpp
#include <string>
void solve(std::string &result, const std::string &input) {
size_t len = input.length();
if (len == 0) return;
char *res = new char[len + 1];
size_t i = 0;
for (size_t j = 0; j < len; ++j) {
char ch = input[j];
if (ch >= 'A' && ch <= 'Z') {
res... | ALGO | 0.99872 | 6.711621 |
117f4c80-ff30-4a9e-827f-6d9562505106 | braydonwang/Leetcode-Solutions | 16-3sum-closest/16-3sum-closest.cpp | class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(),nums.end());
int ans = INT_MAX, ret = 0;
int a = 0, b = 1, c = nums.size()-1;
while (a < nums.size()-2) {
while (b < c) {
int sum = nums[a] + nums[b] + nums[c];... | ALGO | 0.999997 | 6.245771 |
c080f678-ec2e-452c-b8b1-05865a08d62b | kennent/for_scsc_code_save2 | trie.cpp | #include <bits/stdc++.h>
#define MOD 1'000'000'007
using namespace std;
using ll = long long;
using pii = pair<int, int>;
struct Trie {
vector<pair<char, Trie*>> ch;
// unsigned short cnt = 0;
int g, cnt = 0;
bool end;
Trie(): end(false) {}
// Trie(): g(0), end(false), root(false) {}
~Trie() { for (auto... | ALGO | 0.999967 | 4.538117 |
68981ebe-eeb5-4583-a423-5fbfaf6f543a | nglong14/CP | cspm_3/school.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
const int maxn = 1e5 + 7;
int n, m, k, X;
vector<pii> g[maxn];
int l[maxn], tr[maxn];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
if (fopen("SCHOOL.INP", "r"))
{
freopen("SCHOOL.INP", "r", stdin);
... | ALGO | 0.999938 | 4.048268 |
4fe2cb30-b5ac-4572-8520-dfd8d13d5d28 | hkumariitr/dsalgo | 0008-string-to-integer-atoi/0008-string-to-integer-atoi.cpp | class Solution {
public:
int myAtoi(string s) {
if(s.empty()){
return 0;
}
int i =0;
int zero = 0;
bool sign = 1;
while(s[i]== ' '){
i++;
}
if(i == s.size()){ return 0;}
while(s[i]== 0){
i++;
zero... | ALGO | 0.999449 | 5.320302 |
1911eed4-5058-4245-8cd8-570968c9f46e | RishabhSkr/GFG_problems | Difficulty: Medium/Find the number of islands/find-the-number-of-islands.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
// Function to find the number of islands.
int n ,m;
bool isSafe(int i,int j,vector<vector<char>>&grid){
if(i<0 || i>=n || j<0 || j>=m || grid[i][j]=='0')return false;
retur... | ALGO | 0.999878 | 7.013366 |
58454462-c5fb-4449-b426-590c00c7b53b | harishkrupo/Bplus-Tree | main.cpp | #include<iostream>
#include<fstream>
#include<sstream>
#include<cstdio>
#include<pthread.h>
#include "btree.h"
#define MAXFILES 100
#define TLOG(format, ...) \
printf("Thread %lu: " format, id, __VA_ARGS__)
std::ifstream fs[MAXFILES];
pthread_t threads[MAXFILES];
struct BTree *tree = NULL;
void *run_thread(voi... | TOOL | 0.953028 | 4.194641 |
bad112ff-6f1c-4a49-9b48-5acf5040ccaf | nileshleve/CPPCompCoding | elitmusq2.cpp | #include <bits/stdc++.h>
using namespace std;
/*
Other soln is dp
i.e.
dp[i] = dp[i-1] + dp[i - 3]
*/
long long int ans = 0;
int traverse(long long int src, long long int check, long long int dest, string str){
if(src == dest){
cout<<str<<endl;
ans++;
return 1;
}
else if(src > dest){
return 0;
}
else... | ALGO | 0.999804 | 4.336622 |
c8ffcc42-70a8-4eb4-9ec5-2c834f52f567 | PRATYUSH0077/DSAlgo | 3629-total-characters-in-string-after-transformations-i/3629-total-characters-in-string-after-transformations-i.cpp | class Solution {
public:
int lengthAfterTransformations(string s, int t) {
int ans=0,M=1e9+7;
vector<int> freq(26,0);
for(auto it:s){
freq[it-'a']++;
}
for(int i=1;i<=t;i++){
int temp_a=0,temp_b=0;
if(freq[25]>0){
temp_a=fre... | ALGO | 0.999992 | 6.424067 |
f267bc16-a45c-429b-a10d-bcb4f596e18e | aa-ryan/Comp-Prog | 1409.cpp | #include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
void solve()
{
int a, b, t, k, n;
std::cin >> a >> b >> t >> k >> n;
long long int ans = 1e18;
for (int i = 0; i < 2; ++i) {
int da = std::min(n , a-t);
int db = std::min(n-da, b-k);
ans = std::min(ans, (... | ALGO | 0.999806 | 3.678608 |
b3f20caf-d3a1-47c7-8d0e-b63987d28770 | SumitVadhava/CSE---Semester-1 | Lab G-305/Lab 04/A/4-A(3).cpp | #include<Stdio.h>
int main(){
float a,b;
printf("Enter Number=");
scanf("%f",&a);
printf("Enter Number=");
scanf("%f",&b);
printf("Addtion=%f",a+b);
return 0;
}
| TOOL | 0.858788 | 3.042273 |
d910276e-fd8b-4126-b58e-bc803d5ed0d5 | Arianne-CSC/Tarefas_LPR | Aula7/Exercício1-Aula7.cpp | #include <iostream>
using namespace std;
int num;
int invertido (int numero){
int numero_reverso = 0;
while (numero > 0){
int ultimoDigitado = numero % 10;
numero_reverso = ultimoDigitado + numero_reverso * 10;
numero = numero / 10;
}
ret... | ALGO | 0.988705 | 4.687668 |
c439410b-b967-43f6-aa1e-38aa29b4bd87 | bosoni/qeng | 3rdparty/bgfx_common/entry/dialog.cpp | #include <bx/allocator.h>
#include <bx/filepath.h>
#include <bx/string.h>
#include <bx/readerwriter.h>
#include <bx/process.h>
#include "dialog.h"
#if BX_PLATFORM_WINDOWS
typedef uintptr_t (__stdcall *LPOFNHOOKPROC)(void*, uint32_t, uintptr_t, uint64_t);
struct OPENFILENAMEA
{
uint32_t structSize;
void* ... | TOOL | 0.88026 | 6.306376 |
9d7ee415-e34e-418e-a2f0-ad4306c210e4 | suraj0955/beaglebone | frameworks/av/media/libstagefright/codecs/amrnb/dec/src/d2_11pf.cpp | /*
------------------------------------------------------------------------------
Pathname: ./audio/gsm-amr/c/src/d2_11pf.c
Functions:
Date: 01/28/2002
------------------------------------------------------------------------------
REVISION HISTORY
Description: Modified to place file in the correct template... | ALGO | 0.99953 | 6.461542 |
ea8d300a-4d8e-4bce-8ba1-fc7e959dd25d | prathamesh7255/CSES-solutions | 1. Sorting and Searching/5. Restaurant Customers.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<pair<int,int>>time;
int x,y;
for(int i=0;i<n;i++){
cin>>x>>y;
time.push_back({x,1});
time.push_back({y,-1});
}
sort(time.begin(),time.end());
int ct=0,max_ct=0;
for... | ALGO | 0.999886 | 4.011284 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.