uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
bce04fa8-2b38-420c-95b1-148733fe0373 | hargunmujral/Competitive-Programming | 3sum.cpp | #include <unordered_map>
#include <algorithm>
#include <set>
class Solution
{
public:
vector<vector<int>> threeSum(vector<int> &nums)
{
vector<vector<int>> out;
for (int i = 0; i < nums.size(); i++)
{
sort(nums.begin(), nums.end());
int front = i + 1;
... | ALGO | 0.99985 | 5.50237 |
3738d8c5-36f2-4c14-b706-43f535fbe1b2 | alexandraback/datacollection | solutions_5686275109552128_1/C++/Vasyl/b.cpp | //#pragma comment(linker, "/STACK:134217728")
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#includ... | ALGO | 0.999447 | 3.640704 |
377c87cb-d46a-4b8b-9c40-8d22a373f228 | ncn6mq/headless-rl | headlessrl/envs/rl/eigen-3.3.7/test/product_syrk.cpp | #include "main.h"
template<typename MatrixType> void syrk(const MatrixType& m)
{
typedef typename MatrixType::Scalar Scalar;
typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::ColsAtCompileTime, RowMajor> RMatrixType;
typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, Dynamic> Rhs1;
typedef M... | TEST | 0.891043 | 3.839271 |
d8b7d8ba-d501-4b42-af45-dcdeb28c3aa2 | Fraunhofer-AISEC/guarantee-llvm | libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/hash.pred.pass.cpp | // UNSUPPORTED: c++03, c++11, c++14
// XFAIL: libc++
// <functional>
// boyer_moore_horspool searcher
// template<class RandomAccessIterator1,
// class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>,
// class BinaryPredicate = equal_to<>>
// class boyer_moore_horspool_searc... | TEST | 0.862368 | 6.555166 |
ea31126c-5482-4419-ac06-fe9c18657598 | ishandutta2007/codeforces | xlk/normal/1110/C.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int q, x;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> x;
int b = 1;
while (b <= x) {
b *= 2;
}
if (b - 1 == x) {
for (int i = 2; i <= x; i++) {
if (x % i == 0) {
printf("%d\n", x / i);
break;
}
if (i * i > x) {
p... | ALGO | 0.999943 | 3.794396 |
ed0b6f86-e4c9-4272-8e8d-32d31ccdea14 | Trietptm-on-Coding-Algorithms/Leetcode-1 | cpp/332.cpp |
class Solution {
public:
vector<string> findItinerary(vector<pair<string, string>> tickets) {
for (auto ticket : tickets) {
targets[ticket.first].insert(ticket.second);
}
visit("JFK");
return vector<string>(route.rbegin(), route.rend());
}
private:
unordered_m... | ALGO | 0.99995 | 6.318273 |
b77214d1-c48c-4ee5-b5c7-4cb778592191 | adityaiiitv/Operating-Systems | page_replacement/lru.cpp | #include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int fr,num;
cout<<"ENTER THE NUMBER OF FRAMES: ";
cin>>fr;
int frame[fr];
for(int i=0;i<fr;i++)
{
frame[i]=-1;
}
cout<<"\nENTER THE NUMBER OF PAGES: ";
cin>>num;
int page[num];
cout<<"\nENTER THE ... | ALGO | 0.998819 | 3.097765 |
7fcc8f98-b02b-47b7-a270-4d8c38053b1f | GameDevSajib/Backdoor2025 | String_Use_In_Backdoor.cpp | #include<bits/stdc++.h>
#define ll long long
#define MX 100000
#define pb push_back
#define do {
#define done }
#define read std::cin>>
#define echo std::cout<<
#define start_ int main()
#define finish return 0;
using namespace std;
int temp[MX];
int num[MX];
int prime[MX];
int a[MX];
int b[MX];
int c[MX];
class Al... | ALGO | 0.999533 | 3.241014 |
855b67b0-79bf-4da0-bc7b-6d30b9b2d0cf | alexandraback/datacollection | solutions_1485490_0/C++/mRefaat88/c.cpp | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <cctype>
#include <algorithm>
#include <functional>
#include <cmath>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <stack>
#include <queue>
#include <map>
#include <set>
using namespace std;
#d... | ALGO | 0.999962 | 3.664551 |
2f337981-d66e-488e-84f2-ce4298ee9a84 | zjunior06/frameworks_av | media/libmedia/CharacterEncodingDetector.cpp | //#define LOG_NDEBUG 0
#define LOG_TAG "CharacterEncodingDector"
#include <utils/Log.h>
#include <media/CharacterEncodingDetector.h>
#include "CharacterEncodingDetectorTables.h"
#include <utils/Vector.h>
#include <media/StringArray.h>
#include <unicode/ucnv.h>
#include <unicode/ucsdet.h>
#include <unicode/ustring.h>... | TOOL | 0.885141 | 4.588943 |
11d57de7-0c9a-440b-9991-85b2ef564dd7 | krishal-pou/05-07-2024 | power.cpp | #include<iostream>
using namespace std;
int pow(int n){
if(n==0) return 1;
return 2*pow(n-1);
}
int main(){
int n;
cin>>n;
cout<<pow(n);
} | ALGO | 0.999895 | 4.313929 |
827c1ac0-1c40-4c8b-bb29-b94937a13aa2 | eodos/data-structures | btree/btree_test.cpp | #include "btree.hpp"
#include <iostream>
int main(int argc, char const *argv[])
{
Btree<int> tree = Btree<int>();
tree.insert(1);
tree.insert(2);
tree.insert(0);
tree.insert(-4);
tree.insert(3);
tree.print();
return 0;
} | ALGO | 0.993765 | 4.417583 |
46b700f9-4828-446c-ba55-b61b7549efeb | mbourn/routes | stree.cpp | // File Name: stree.cpp
// Coder: Bourn, Matthew
// Username: mbourn
#include <iostream>
#include <assert.h>
#include <string>
#include <vector>
using namespace std;
#include "stree.h"
/////////////////////////////////////////////////////////////////////////////////////
// C-tor
Str... | ALGO | 0.997518 | 4.026974 |
62c3dd05-73f0-4445-9764-3157e99bc9c7 | Coach-Academy/Spring-1-2024 | Level 2/CPU - Basic - L2 - C101/Practice/Week 02/L - Anton and Letters .cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
string s;getline(cin,s);
set<char>st;
for(int i=0;i<s.size();i++)
{
if(isalpha(s[i]))
{
st.insert(s[i]);
}
}
cout<<st.size()... | ALGO | 0.999372 | 4.17775 |
c66c7d2d-999e-4ec2-928e-6dcf83a8eb7b | tanuj-saini/Reminders | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.9988 | 6.76073 |
c5a5d88a-81b9-4e19-b420-0af6af8ae2c4 | MatthewDZane/UnrealQRCodeScanner | Source/ThirdParty/ZXingLibrary/Hololens/core/src/zxing/oned/ITFReader.cpp | // -*- mode:c++; tab-width:2; indent-tabs-mode:nil; c-basic-offset:2 -*-
#include <zxing/ZXing.h>
#include <zxing/oned/ITFReader.h>
#include <zxing/oned/OneDResultPoint.h>
#include <zxing/common/Array.h>
#include <zxing/ReaderException.h>
#include <zxing/FormatException.h>
#include <zxing/NotFoundException.h>
#include... | ALGO | 0.920224 | 6.339764 |
53e5a8b7-04cb-47db-9562-42d54bd2213e | aaman007/codeforces | Bear and Game.cpp | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
int n,a[100],mins=0;
cin >> n;
for(int i=0;i<n;i++)
cin >> a[i];
if(a[0]>15)
{
cout << "15" << endl;
return 0;
}
else
mins += a[0];
for(int i=0;i<n-1;i++)
{
if(a... | ALGO | 0.99989 | 3.656092 |
5cea4e46-9e53-4366-bf61-08328667f717 | y-lapeyre/M1-modelo | RungeKutta.cpp | #include <iostream>
#include <fstream>
#include <cmath>
// Définition de la fonction dérivée
double f(double t, double y) {
return 2*t - 1;
}
// Méthode RK1 (Euler)
double rk1(double f(double, double), double t, double y, double h) {
return y + h * f(t, y);
}
// Méthode RK4
double rk4(double f(double, double), d... | ALGO | 0.99998 | 4.350771 |
15f7d285-0139-4c2c-bc94-6a6250e0aca3 | Kudin-dima/C-_3 | n2.cpp | #include <iostream>
using namespace std;
int main()
{
setlocale(LC_ALL, "rus");
int a, b, c;
cout << " :\n";
cin >> a >> b >> c;
if (a << b >> c or c << b >> a)
cout << ": " << b;
else if (b << a >> c or c << a >> b)
cout << ": " << a;
else
cout << ": " << c;
return 0;
} | ALGO | 0.999762 | 3.509935 |
faca75df-fa8b-4d0b-a9c4-88f53592e9a2 | Serendipity565/CodeBackup | Luogu/test/P3865.cpp | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
ll a[100005] = {0};
ll f[100005][30] = {0};
void pre()
{
a[1] = 0;
a[2] = 1;
for (int i = 3; i <= 100004; i++)
{
a[i] = a[i / 2] + 1;
}
return;
}
int main()
{
ios::sync_with_stdio(false);
cin... | ALGO | 0.999968 | 4.118513 |
09de3961-4b77-4d6d-ba1f-2de8825e0acc | marcelozeballos/SPOJ---OBI | Circulos/main.cpp | #include <cmath>
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <sstream>
using namespace std;
#define inttochar(x) (char(x+'0'))
string turn(long long n)
{
string ans;
while(n > 0)
{
int dig = n%10;
ans += inttochar(d... | ALGO | 0.999847 | 4.171511 |
d24bbb58-d563-4c76-997e-01a10de4c99b | rahulyadav6/Decode-DSA-with-c- | 5_Strings/Assignment 2/1.reverse.cpp | //Input a string and concatenate with its reverse string and print it.
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
getline(cin,s);
string orig = s;
reverse(s.begin(),s.end());
cout<<orig+s;
} | ALGO | 0.999327 | 4.558207 |
1f04c3ba-8f14-4b53-98cd-b6fb161c5253 | raularreprinn/UgrMPBaseAlumnoRaul_Carlos | Kmer3/src/Kmer.cpp | /*
* Metodología de la Programación: Kmer0
* Curso 2023/2024
*/
/**
* @file Kmer.cpp
* @author Raúl Antonio Arredondo Principal <<EMAIL>>
* @author Carlos Romero García <<EMAIL>>
* Created on 1 March 2024, 19:00
*/
//@throw = excepción
#include "Kmer.h"
using namespace std;
Kmer::Kmer(int k)
{
if(k<=0)
... | TOOL | 0.851676 | 5.714634 |
56701771-9181-49e7-b4d9-b5eb182127d5 | cjlworld/OJ | Luogu/P5633.cpp | #include<set>
#include<map>
#include<queue>
#include<stack>
#include<ctime>
#include<cmath>
#include<bitset>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef ... | ALGO | 0.999915 | 3.918533 |
819ede19-c48a-4704-8433-a231e78fb4eb | Gohando/VSCodeProjects | oop_halin/oop_2_3.cpp | /*Написать программу. Пользовательский класс должен содержать:
- необходимые поля;
- конструктор с параметрами (исходные значения по умолчанию) для
создания объектов (new) и установки их начального значения:
LinearAlgorithm(...);
- деструктор ~ LinearAlgorithm(...);
- метод переустановки текущего состояния: void Set(.... | TOOL | 0.957539 | 5.21636 |
ce2250e4-ca9f-4bfc-80eb-ec0cdb6cebf3 | CodeTrans-Research/RefuTra | dataset/java2cpp2(BatFix)/cpp/MAXIMUM_PRODUCT_SUBARRAY_ADDED_NEGATIVE_PRODUCT_CASE.cpp | #include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int i;
int ans = INT_MIN;
int maxval = 1;
int minval = 1;
int prevMax;
for ( i = 0;
i < n;
i ++ ) {
if ( ... | ALGO | 0.999852 | 5.379852 |
769d88cf-c24d-4824-8682-949ba8d5b71d | SEU-ACAL/reproduce-MEEK-DAC-25 | Software/parsec/pkgs/libs/tbblib/src/examples/task_group/sudoku/sudoku.cpp | #include <cstdio>
#include <cstdlib>
#include "tbb/atomic.h"
#include "tbb/tick_count.h"
#include "tbb/task_scheduler_init.h"
#include "tbb/task_group.h"
#pragma warning(disable: 4996)
#define __TBB_LAMBDAS_PRESENT ( _MSC_VER >= 1600 && !__INTEL_COMPILER || __INTEL_COMPILER > 1100 && _TBB_CPP0X )
const unsigned BOA... | ALGO | 0.999552 | 6.16449 |
7e70341e-3b4f-4a8e-a41e-77ec12130198 | avinashyadav16/Codeforces-CodeSolution-And-OOPs | CodeforceSolution/236A_BoyOrGirl.cpp | /**
* @file: 236A_BoyOrGirl.cpp
* @author: Avinash Yadav
* @brief: https://codeforces.com/problemset/problem/236/A
* @date: 28-03-2024
*/
#include <bits/stdc++.h>
using namespace std;
int main()
{
string str;
cin >> str;
unordered_set<char> charSet;
for (char ch : str)
{
cha... | ALGO | 0.999536 | 5.047088 |
82015934-eeba-4660-855f-8e972c027502 | Brilliant-Developer1/DS_Assignment_3 | Valid_String.cpp | // #include<bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstd... | ALGO | 0.99964 | 5.363849 |
2cfb7d2f-bcb3-497d-a07b-a88de04c880d | gulshan0300/https---github.com-gulshan0300-cpp_question | array linear search.cpp | #include<iostream>
using namespace std;
int main() {
long long n,m,i;
cin>>n;
long long a[n];
for(i=0;i<n;i++){
cin>>a[i];
}
cout<<endl;
cin>>m;
for(i=0;i<=n;i++){
if(a[i]==m){
cout<<i<<" ";
}
else{
cout<<"-1"<<" "<<m;
}
}
return 0;
}
| ALGO | 0.999913 | 3.41504 |
d77d5234-37a0-47cf-a936-60ac5f59ca2e | nakib1948/Competitive-programming | C_Very_Easy_Task.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll i,j,x,y,z,count=0,sum=0,n,m;
cin>>n>>m>>z;
x=max(m,z);
y=min(m,z);
ll low=-1,high=x*n;
while(low+1<high)
{
ll mid=(low+high)/2;
sum=mid/y;
... | ALGO | 0.999873 | 3.112206 |
94025dd4-05e7-43cf-bc2f-777c9b86b4f2 | pankhurirastogi/Codechef-Problems-Solutions | FCTRl2.cpp | #include<iostream>
using namespace std;
int main()
{ int t;
cin<<t;
for(i=0;i<t;i++)
{
int n;
cin>>n;
for(j=1;j<=n;j++)
{
fact=fact*j;
}
cout<<fact;
}
return 0;
}
| ALGO | 0.999922 | 4.454529 |
7d342f61-2d5c-48b2-b082-6a7b46f2f94f | abdelrehman99/codeforces-solutions | Get an Even String.cpp | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define F first
#define FOR(i, n) for (int i = 0; i < (int)n; i++)
#define cin(v, n) \
for (int i = 0; i < (int)n; i++) \
cin >> v[i]... | ALGO | 0.999896 | 4.993772 |
8703e11e-8ad9-4d0c-9767-4b66850e54e3 | rayddteam/freebsd-pi | contrib/llvm/lib/Transforms/Utils/LowerSwitch.cpp | #include "llvm/Transforms/Scalar.h"
#include "llvm/Transforms/Utils/UnifyFunctionExitNodes.h"
#include "llvm/Constants.h"
#include "llvm/Function.h"
#include "llvm/Instructions.h"
#include "llvm/LLVMContext.h"
#include "llvm/Pass.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/Support/Compiler.h"
#include "llvm/Suppo... | TOOL | 0.972986 | 7.79715 |
c223651f-2c15-4a05-b703-120f34ac2ee5 | cosmoss-jigu/vip | llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.merge/merge.pass.cpp | // <algorithm>
// template<InputIterator InIter1, InputIterator InIter2, typename OutIter>
// requires OutputIterator<OutIter, InIter1::reference>
// && OutputIterator<OutIter, InIter2::reference>
// && HasLess<InIter2::value_type, InIter1::value_type>
// constexpr OutIter // constexpr after ... | TEST | 0.998397 | 6.931624 |
1c573ae8-ff16-40f3-ac19-ce937bb9c63a | arturo393/seism-detection | prosismic/lib/Filters/FilterTwoPole.cpp | #include "FilterTwoPole.h"
#ifdef ARDUINO_SAM_DUE
#define ARM_FLOAT
#endif
// The driven, damped harmonic oscillator equation is:
// http://en.wikipedia.org/wiki/Harmonic_oscillator)
//
// a + 2*ζ*ω0*v + ω0²*x = F(t)/m
//
// where the quality factor is related to the damping factor by
//
// Q = ½ζ
//
// It is u... | ALGO | 0.974404 | 5.289944 |
ce1bc9a7-d7ab-4980-bfe5-a3c693174e1f | idzharbae/Competitive-Programming | CF-1353/D.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vi;
struct segmentPriority
{
bool operator()(pair<int,int> a, pair<int,int> b)
{
int diffA = a.second - a.first, diffB = b.second - b.first;
if(diffA != diffB)
return diffA < diffB;
return a.first > b.... | ALGO | 0.999973 | 4.421927 |
2df7bb56-e2e6-4ab5-85b3-0469187239c2 | germanohn/competitive-programming | codeforces/lala2.cpp | #include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
vector<pair<int, int> > e;
vector<pair<int, int> > r;
int n;
scanf("%d", &n);
while(n--){
int x, y;
scanf("%d %d", &x, &y);
if(x > 0)
r.push_back(make_pair(x, y));
else
e.push_back(make_pair(-x, y));
}
... | ALGO | 0.999719 | 3.90554 |
2ae608df-95fb-43bc-b6e7-3218d52157ea | kotatsugame/library | math/linear_congruence.cpp | //require extgcd
#include<vector>
#include"../include/extgcd.hpp"
pair<long long,long long>linear_congruence(const vector<int>&A,const vector<int>&B,const vector<int>&M)
//find Ax=B mod M. NA=>(0,-1)
{
long long x=0,m=1;
for(int i=0;i<A.size();i++)
{
long long a=m*A[i],b=B[i]-x*A[i],u,v;
long long d=extgcd(a,(lo... | ALGO | 0.999819 | 3.866156 |
c971c3e8-be55-4a88-acad-181f1a065b6e | alexandraback/datacollection | solutions_1595491_1/C++/madura/main.cpp | #define PROBLEM "B"
//#define PROBLEM_ID "small-attempt0"
#define PROBLEM_ID "large"
#include<iostream>
#include<map>
#include<fstream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<sstream>
#include<list>
#include<set>
#include<algorithm>
#include<sstream>
using namespace std;
typedef stringstream ss;... | ALGO | 0.999372 | 3.292802 |
eea9eeba-b6e3-4007-a125-ca8120f0d6a1 | Kuliyalrashmi/DSA_Questions | FurthestBuildingYouCanReach.cpp | /* 17-Feb-2024
Leetcode Question no 1642 Furthest Building You Can Reach
You are given an integer array heights representing the heights of buildings, some bricks, and some ladders.
You start your journey from building 0 and move to the next building by possibly using bricks or ladders.
While moving from building... | ALGO | 0.999953 | 6.529273 |
ad853909-db48-4339-9845-f35a6fa6c6f4 | dayvidwang/USACO_practice | Gold/High_Card_Gold.cpp | /*
ID: dwang5766
TASK:
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
void printv(vector<int> a) {
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << "\n";
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("cardgame.in", "r", stdin); freopen("cardgame.out", "w", stdout);
... | ALGO | 0.999939 | 3.6373 |
3aafe283-295c-4a2e-9316-08002e10c2f0 | BCAPATHSHALA/DSA-SUPREME-2-0-NOTES | DSA SUPREME 2.0 CODES/16. CLASS CODE/HOMEWORK02.CPP | // ✅HW 02: Reverse Only Letters (Leetcode-917)
class Solution {
public:
string reverseOnlyLetters(string s) {
int start = 0, end = s.size()-1;
while(start <= end){
if(isalpha(s[start]) && isalpha(s[end])){
swap(s[start], s[end]);
start++, end--;
... | ALGO | 0.994651 | 6.579122 |
cd5493a8-e09a-4e18-879d-a437ed6f8f75 | tzupengwang/PECaveros | contest/WorldFinals/2014/f.cpp | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double type;
const double eps = 1e-8;
typedef pair<type,type> Pt;
typedef pair<Pt,Pt> Line;
typedef pair<Pt,type> Circle;
#define X first
#define Y second
#define O first
#define R second
Pt operator+( const Pt& p1 , ... | ALGO | 0.999904 | 4.193529 |
63f1d182-ef67-4711-b7c5-ca50e5b01818 | OuEmily/misis2023f-22-04-yuldasheva-e-d | prj.codeforces/1873a.cpp | #include <iostream>
#include <vector>
int main(){
int t = 0;
std::string x;
std::cin >> t;
std::vector<std::string> s;
while (t != 0) {
std::cin >> x;
s.push_back(x);
t--;
}
for(auto it = s.begin(); it != s.end(); ++it){
if(*it == "bca" || *it == "cab") {
... | ALGO | 0.999785 | 4.639391 |
f4b868a5-e6ca-4b46-9c7a-0253ae388420 | istoney/POJCode | 3255 - RoadBlocks.cpp | /*
======================================================================================
* File Name: 3255 - RoadBlocks.cpp
* Description: http://poj.org/problem?id=3255
* Author: Stoney
*
* Version: 1.0
* Submit Time: 2016-01-14 21:59:08
* Compiler: c++
* Run Time: 204... | ALGO | 0.999558 | 3.652477 |
20f00634-7967-4b2e-a24a-06949c53b672 | abhradeepbarman/dsa-supreme | 10- Stacks/Lec-1/one_array_two_stack.cpp | #include<bits/stdc++.h>
using namespace std;
class twoStacks
{
int size;
int* arr;
int top1;
int top2;
public:
twoStacks()
{
size = 1000;
arr = new int[size];
top1 = -1;
top2 = 1000;
}
twoStacks(int n)
{
size = n;
arr = n... | ALGO | 0.996343 | 4.495318 |
f22f0f77-4185-4356-a854-8711087f3674 | shubhjagani/skeleprint_ui | Supplementary Software/Mechaduino/z-axis/Mechaduino_01/Mechaduino_01/Controller.cpp | //Contains TC5 Controller definition
//The main control loop is executed by the TC5 timer interrupt:
#include <SPI.h>
#include "State.h"
#include "Utils.h"
#include "Parameters.h"
void TC5_Handler() { // gets called with FPID frequency
static int print_counter = 0; //this is used by... | ALGO | 0.893403 | 3.849915 |
0be3aeb2-c5cb-4864-890f-05c117dd5b56 | TWAnnoyingKid/ctry | UNIT5/U5P2.cpp | #include <stdio.h>
#include <stdlib.h>
main(){
float sum=0,s=1,k=1;
for(int i=1; i<=10; i++){
k = (k*i);
s = 1/k;
printf("1/%d!\t = %.8f\n",i,s);
sum = sum + s;
}
printf("%f\n", sum);
}
| ALGO | 0.999492 | 3.387855 |
dc093375-6188-425a-807e-d98903383da6 | pesnik/Programming_Book_Solves | beginning__recursion__Ashraful_Asad/Chapter_2__Pyramid/25.cpp | #include<bits/stdc++.h>
using namespace std;
// 1
// 2 2
// 3 3 3 3
void recursion3(int i, int j) {
if (i > j) {
cout << "\n";
return;
}
printf("%d ", j);
recursion3(i + 1, j);
}
void recursion2(int i, int j) {
if (i > j) {
return;
}
printf(" ");
recursion2(i + 1, j);
}
void recursion(int i, i... | ALGO | 0.999988 | 3.736108 |
ad37536b-f0de-4d43-99b4-f7114e5167ab | spencermcarthur/project-euler | src/0001_0050/46.cpp | #include "prime.hpp"
#include "problem.hpp"
#include "util.hpp"
#include <cassert>
#include <cmath>
#include <iostream>
#include <set>
class Problem : public Problem_<46, Problem> {
friend class Problem_<46, Problem>;
std::set<unsigned long> primes;
public:
Problem() { primes = get_n_primes_set(1'000); }
pri... | ALGO | 0.999574 | 5.900566 |
d093a304-e36f-47e0-8273-99e34c66768b | kushank1207/LeetCode-solution-CPP | Shortest Common Supersequence - GFG/shortest-common-supersequence.cpp | // { Driver Code Starts
//Initial template for C++
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution
{
public:
//Function to find length of shortest common supersequence of two strings.
int shortestCommonSupersequence(string X, string Y, i... | ALGO | 0.999948 | 6.208169 |
3af82104-bc2e-4eba-a9c6-01259146cb54 | bappi2097/ACM-Problem-Solving | URI/1116.cpp | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,y;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x>>y;
if(y==0)cout<<"divisao impossivel"<<endl;
else if(x==0)cout<<"0.0"<<endl;
else printf("%.1f\n",(double)x/y);
}
return 0;
}
| ALGO | 0.999164 | 3.666656 |
2d0019ec-a48c-478a-874a-c19946922cc6 | Omarabdul3ziz/lowlvl | psa/order.cpp | #include <iostream>
#include <string>
using namespace std;
int main () {
// take input.
string str1, str2;
cin >> str1;
cin >> str2;
// unit case
for (auto & c: str1) c = toupper(c);
for (auto & c: str2) c = toupper(c);
// check order.
if (str1==str2) cout << 0;
else if (str1>str2) cout << 1;
else cout << -1;
ret... | ALGO | 0.999997 | 3.672659 |
00000c86-42d5-412d-9b24-2e16bcf8a2ba | LHS-11/Algorithm | 3주차 - 완전탐색, 백트래킹/2529.cpp | #include<bits/stdc++.h>
using namespace std;
int k;
vector<char> oper;
vector<int> num;
int vis[10];
vector<string> ans;
void go(int n) { // 순열 문제 ( 모든 경우의 수 탐색 )
if (n == k + 1) {
int flag = 0;
for (int i = 0; i < num.size() - 1; i++) {
if (oper[i] == '<') {
if (num[i] > num[i + 1]) {
flag = 1; br... | ALGO | 0.999971 | 4.2588 |
585958de-ee49-4bef-889b-65de49f9b99e | dkhonker/sysu | 数据结构/数据结构实验课文件/EXP15-graph(BFS,Kruskal)/for_test/source/20354025/spanforest.cpp | #include<stdio.h>
#include<memory.h>
#include<stdlib.h>
const int maxn=5001;
int *A[maxn];
int *B[maxn];
bool visited[maxn];
int d[maxn], n, counter;
int f, r;
int list[maxn + 1];
int bfs(int u){
f = 0; r = 0;
visited[u]=true; list[r++] = u;
while (f < r){
u = list[f++];
for (int i=1; i<=d[u]; i++){
int ... | ALGO | 0.999656 | 3.378602 |
aeaf588c-9ace-420b-937b-3fbca6b0a65f | keqhe/leetcode | round3/linkedList/leetcode234.cpp |
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
//using stack is the first method
//the second method is to split the list into 2 and reverse the second part and check
str... | ALGO | 0.999918 | 5.865155 |
5afb9cc7-aeea-4a8f-aef1-c471a8dc930a | sabinleee/solve-problems | BOJ/C++/10000~11000/10808.cpp | #include<iostream>
#include<string>
#include<string.h>
using namespace std;
int main()
{
string str;
int alp[200] = { 0 };
cin >> str;
int length = str.length();
for (int i = 0; i < length ; i++)
{
int store = str[i];
alp[store]++;
}
for (int i = 97; i < 123; i++) {
cout << alp[i] << ' ';
}
} | ALGO | 0.999559 | 3.539037 |
91c718dc-bc2d-465d-a135-114fcf19042b | trungtipu/Algorithm-DataStructures | Basic/Part04-Stack-Queue-Deque/ph2.cpp | /*
https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=3359
*/
#include<iostream>
#include<string>
#include<deque>
using namespace std;
int main() {
int t=0;
while (1) {
int p,c;
cin>>p>>c;
if ((p==0) && (c==0)) return 0;
t++;
deque<int> q;
if (p>1000) p=1000... | ALGO | 0.999038 | 3.284781 |
b7a4a9d9-52a3-4b76-9126-a5e3dfb97cce | coolzhang666/Operating-System | Exercise/exercise2/exercise1_1.cpp | #include<stdio.h>
#include<stdlib.h>
#include<fcntl.h>
#include<unistd.h>
#include<sys/types.h>
#include<sys/stat.h>
#include<sys/wait.h>
#include<string.h>
int main()
{
int fid;
int pid1, pid2, i;
char str[50] = {0};
// 打开文件
fid = open("exercise1.txt", O_WRONLY|O_APPEND, 0777);
if ( fid < 0)
... | TOOL | 0.955517 | 3.051323 |
1afdd1ad-b1e0-456b-9a91-56375293e127 | ms-shakil/DSA1 | Bst (1).cpp | #include<iostream>
#include<stdio.h>
using namespace std;
class TreeNode
{
public:
int value;
TreeNode* left;
TreeNode* right;
public:
TreeNode(int data)
{
this->value = data;
this->left = this->right = NULL;
}
};
void preorder(TreeNode* root)
{
if(root!=NULL)
{
... | ALGO | 0.999985 | 4.426843 |
0d049243-8102-4d44-b537-18f3424aa9ab | ishandutta2007/codeforces | yousef_salama/normal/1267/I.cpp | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
const int N=205;
vector< pair<int,int> > v;
int n;
int mem[N][N];
int cmp(int x,int y)
{
if(mem[x][y]!=-1) return mem[x][y];
printf("? %d %d\n",x,y);
fflush(stdout);
char c;
scanf(" %c",&c);
mem[x][y]=(c=='<');
mem[y][x]=!mem[x][y];... | ALGO | 0.999938 | 3.213861 |
de473873-bb0a-4bbb-a653-37a40c291dac | llynv/CP-files | 616E.cpp |
/*
Code by: linvg
Created: 05.11.2024 20:52:58
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
string to_upper(string a) { for (int i = 0;i < (int)a.size();++i) if (a[i] >= 'a' && a[i] <= 'z') a[i] -= 'a' - 'A'; return a... | ALGO | 0.998549 | 4.814426 |
350fe13b-19ed-4982-97d8-1a07999e96d4 | KETI-iBMC/IBMC_CORE | energy/lib/eigen/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_colwise.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::MatrixXf mat(2,4);
mat << 1, 2, 6, 9,
3, 1, 7, 2;
std::cout << "Column's maximum: " << std::endl
<< mat.colwise().maxCoeff() << std::endl;
}
| ALGO | 0.999606 | 3.779679 |
21b855ce-02d5-4c63-ad80-e40ff8fdfbae | sumitmathur53/data_structure_and_algorithm | linked list/find a node in LL.cpp | #include<iostream>
using namespace std;
class node{
public:
int data;
node* next;
node(int data){
this->data = data;
next = NULL;
}
};
int find(node* head, int n){
int count =0;
node* temp = head;
while(temp!=NULL){
if(temp->data==n){
return count;
... | ALGO | 0.999978 | 4.50845 |
ec5559d0-85c9-4ad7-a17b-61d89506fd02 | INHA-CTP/Problem_Solution | BOJ/1000~10000/1015/1015_수열정렬.cpp | /*
Author : Hak kyu, Kim
Date : 19.04.02
*/
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <stack>
#include <cmath>
#include <time.h>
#include <unordered_map>
#define ll long l... | ALGO | 0.99995 | 3.599973 |
37744398-5db8-4736-b59f-3a6a7e12bceb | dodamce/DataStructure | 考研党数据结构必会代码/查找/3. 折半查找的递归算法.cpp | #include "../debug.hpp"
int dfs(vector<int> &vet, int val, int left, int right)
{
if (left > right)
return -1;
int mid = (left + right) / 2;
if (vet[mid] == val)
return mid;
if (vet[mid] > val)
return dfs(vet, val, left, mid - 1);
else
return dfs(vet, val, mid + 1, ... | ALGO | 0.999876 | 5.737508 |
3d7d224a-ec0b-471f-8822-40927a13d6b3 | shreejitverma/SDE-Interview-Prep | LeetCode/C++/counting-words-with-a-given-prefix.cpp | // Time: O(n * p)
// Space: O(1)
// string
class Solution {
public:
int prefixCount(vector<string>& words, string pref) {
return count_if(cbegin(words), cend(words),
[&pref](const auto& x) {
return x.compare(0, size(pref), pref) == 0;
... | ALGO | 0.999641 | 6.391443 |
09fa70c6-209d-4a1c-b739-3565a5e266ab | iffa28/BasicLayout_0092 | 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 |
55a782a8-4e7c-4cbb-abc3-e1009af30d41 | Ankit-Dhattarwal/C-plus-Plus- | Array_sum.cpp | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int arr[100];
for(int i = 0; i<n;i++){
cin>>arr[i];
}
for(int i = 0; i<n;i++){
cout<<arr[i]<<endl;
}
int sum = 0;
for(int i=0;i<n;i++){
sum = sum + arr[i];
}
co... | ALGO | 0.999671 | 3.692166 |
76790a9c-9887-4e59-ac30-6795c3eee05b | meetmeerahul/pro-chef | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998859 | 6.785645 |
86d07128-fad7-4143-9f09-f05661c92c35 | upple/BOJ | src/2000/2475.cpp14.cpp | #include<cstdio>
#define SQRT(x) x*x
using namespace std;
int main()
{
int ans=0, n;
for (int i = 0; i < 5; i++)
{
scanf("%d", &n);
ans += SQRT(n);
}
printf("%d\n", ans % 10);
return 0;
}
| ALGO | 0.999127 | 3.591353 |
290a92f5-926e-4c43-81ae-643fda3afe36 | MekhrubonT/Assembly-Course | memcpy-demo/memcpy-demo.cpp | #include <emmintrin.h>
#include <functional>
#include <iostream>
#include <cassert>
void copy_nt_asm(char* dst, char const* src, size_t N) {
const size_t step = 16;
auto copy_while = [&dst, &src, &N](const std::function<bool()> &pred) {
while (pred() && N > 0) {
*dst = *src;
dst... | ALGO | 0.991705 | 4.729629 |
cc0679ab-0e86-4654-8338-e3a13f31eb20 | ISF-H-BRS/SkinCam | Software/SkinCam/polygon.cpp | #include "assertions.h"
#include "polygon.h"
// ---------------------------------------------------------------------------------------------- //
using namespace SkinCam;
// ---------------------------------------------------------------------------------------------- //
static
auto intersect(int x, int y, const Ve... | ALGO | 0.997575 | 6.781678 |
16c5f61d-7d11-4b0d-bb88-6d5f4d30048d | ishangoyal13/fullstackDevelopment | C++/Random_programs/Palindrome-program-in-C++.cpp | #include <iostream>
using namespace std;
int main()
{
int n,r,sum=0,temp;
cout<<"Enter the Number=";
cin>>n;
temp=n;
while(n>0)
{
r=n%10;
sum=(sum*10)+r;
n=n/10;
}
if(temp==sum)
cout<<"Number is Palindrome.";
else
cout<<"Number is not Palindrome."; ... | ALGO | 0.999341 | 3.961837 |
8980b3e2-fc6a-48bb-a243-cba6fa14aa4b | tonymugen/align2bed | align2bed.cpp | /// Parsing DPGP
/** \file
* \author Anthony J. Greenberg
*
* Extracting SNPs from the DPGP .seq files. The variant table will be in the _plink_ BED format. Each chromosome is processed by its own thread in parallel.
*/
#include "sequence.hpp"
#include <vector>
#include <string>
#include <thread>
using std::vecto... | DATA | 0.951638 | 4.511722 |
30111eb2-14c4-4acd-abfa-a7b914c20142 | quicklers/opencv | modules/dnn/src/onnx/onnx_importer.cpp | #include "../precomp.hpp"
#include <opencv2/dnn/shape_utils.hpp>
#include <opencv2/dnn/layer_reg.private.hpp>
#include <opencv2/core/utils/fp_control_utils.hpp>
#include <opencv2/core/utils/logger.defines.hpp>
#undef CV_LOG_STRIP_LEVEL
#define CV_LOG_STRIP_LEVEL CV_LOG_LEVEL_VERBOSE + 1
#include <opencv2/core/utils/... | TOOL | 0.85383 | 6.815104 |
e6b39c5d-4b26-41f3-bef4-b2c2b54984e5 | ishandutta2007/codeforces | technite/normal/1340/B.cpp | //template start//
#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define pb push_back
#define forn(i, n) for(int i = 0; i < n; ++i)
#define forl(i, n) for(long long i=0;i<n;++i)
#define vi vector<int>
#define vl vector<ll>
#def... | ALGO | 0.999985 | 3.915579 |
079da387-f8fa-415f-9471-09b07b62789f | codingwill/competitive-programming | INC-2020-NikiBangjoUltraman/E2.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const ll BIG = 1e18 + 1;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
void solve();
ll fastpow(ll x, ll y, ll n = MOD)
{
x %= n;
ll ans = 1;
while (y > 0)
{
if (y & 1) ans = (ans * x) % n;
x = (x * x) % n... | ALGO | 0.99972 | 4.13839 |
bd080947-b818-4814-80a3-3be099a30ebc | Sanchez-Santiago/Universidad_year_2 | SEGUNDO SEMESTRE/INFO 2/PUNTEROS+/PUNTEROS/7.cpp | /*
Desarrollar un programa que declare e inicialice un vector tipo char con el abecedario.
Luego mostrar en pantalla el abecedario en mayuscula y minuscula, utilizando punteros.
Nota: la función para pasar a mayúscula es toupper() y a minúsculas es tolower().
Ejemplo: cadena[i] = tolower(cadena[i]); En código ASCII... | TOOL | 0.936505 | 4.971783 |
b246c3c2-06f6-4b7b-8d14-7cac199a1c32 | PrateekJain999/30-Days-of-code_HackerRank | Day_24.cpp | #include <cstddef>
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
class Node
{
public:
int data;
Node *next;
Node(int d){
data=d;
next=NULL;
}
};
class Solution{
public:
Node* re... | ALGO | 0.999952 | 5.081321 |
b79e541f-64a0-4b83-8fa7-6437a562ea5a | toamerse/OOP-ITSA | ITSA2_20.cpp | #include <iostream>
using namespace std;
int main()
{
int n;
bool boo;
cin >> n;
for (int i = n - 1; i > 1; i--)
{
boo = true;
for (int j = 2; j < i; j++)
{
if (i % j == 0)
{
boo = false;
break;
}
}... | ALGO | 0.999968 | 4.555691 |
88a6f547-933e-43db-aaab-8c27951b69f8 | jasleen1602/DSA-45Days-Collab-With-Arsh-Goyal | Day 6/delete_dup_sortedll.cpp | ListNode* deleteDuplicates(ListNode* head) {
ListNode* cur = head;
while(cur) {
while(cur->next && cur->val == cur->next->val) {
cur->next = cur->next->next;
}
cur = cur->next;
}
return head;
}
| ALGO | 0.999769 | 4.996539 |
7373da2a-b5f6-491a-b141-6a01349af438 | EasyDae/CodeTest | SWEA/D3/19113.cpp | #include<iostream>
#include<vector>
using namespace std;
int main(int argc, char** argv)
{
int test_case;
int T;
cin>>T;
for(test_case = 1; test_case <= T; ++test_case)
{
int n; cin >> n;
vector<int> vec(n*2), ans(n);
for (int i = 0; i < 2 * n; ++i)
cin >> vec[i];
for (in... | ALGO | 0.999522 | 3.542936 |
afcff07c-28c7-41cc-921d-0c2b47d43db1 | Nakib-Arman/CSE318---ArtificialIntelligence | 2105128/.history/2105128_20250722115939.cpp | #include<bits/stdc++.h>
using namespace std;
class Node {
int column_num;
string label;
unordered_map<string,Node*> children;
float threshold;
public:
Node(int column_num){
this->column_num = column_num;
this->label = "";
this->threshold = 0;
}
Node(string labe... | ALGO | 0.996951 | 4.916104 |
6a0a74c2-e715-45d5-9539-eefa49b1898b | PabloPC05/EstructuraDeDatos | DG_24.cpp | #include <cassert>
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
#include "bintree_2.h"
using namespace std;
// El coste de las tres funciones es O(n) lineal con respecto al numero de nodos del arbol,
// por lo que por las propiedades aritméticas de los costes asintóticos
// O(n) + O(n... | ALGO | 0.988949 | 5.29752 |
2d1dc786-06e2-48a7-81e1-5165c74f8aac | ishassan/ProblemSolving | UVa/10651 - Pebble Solitaire_DP.cpp | #include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
using namespace std;
#define fo(i,n) for(int i=0;i<(n);++i)
#define foo(i,m,n) for(int i=(... | ALGO | 0.999506 | 4.085989 |
7dac463f-907d-442b-be7c-ff11d3f84d7b | Lesmiscore/lesmicoin | src/script/ismine.cpp | #include <script/ismine.h>
#include <key.h>
#include <keystore.h>
#include <script/script.h>
#include <script/sign.h>
typedef std::vector<unsigned char> valtype;
namespace {
/**
* This is an enum that tracks the execution context of a script, similar to
* SigVersion in script/interpreter. It is separate however b... | ALGO | 0.971024 | 6.818017 |
ba7f9740-d3c0-439c-8925-8bafdd735014 | Ayush1724/Learning-cpp | reverse.cpp | #include <iostream>
using namespace std;
int main()
{ int arr[]={1,2,3,4,5,6,7,8,9,10};
int s=sizeof(arr)/4;
cout<<"Orignal array :- ";
for(int i=0;i<s;i++){
cout<<arr[i]<<" ";
}cout<<endl;
cout<<"Reverse of array :- ";
for(int i=s-1;i>=0;i--){
cout<<arr[i]<<" ";
}
return 0;
}
| ALGO | 0.989862 | 3.383659 |
87b27d58-ac55-400c-b4fd-12ea20dbad15 | carlosrojasmo/ASAP-RLFMindex | src/Asap.cpp | #include "Asap.h"
#include "bit_vectors.h"
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <utility>
#include <vector>
#include <unordered_map>
#include <tuple>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <sdsl/wavelet_trees.hpp>
#include <sdsl/vectors.hpp>
usin... | ALGO | 0.991199 | 3.584615 |
ed8ffeda-6ff8-4f40-87b0-dfe542e452a3 | hikjik/leetcode | solutions/maximal-square/test.cpp | #include <catch.hpp>
#include <solution.hpp>
TEST_CASE("Simple") {
struct TestCase {
std::vector<std::vector<char>> matrix;
int expected;
};
std::vector<TestCase> test_cases{
{
.matrix{{'1', '0', '1', '0', '0'},
{'1', '0', '1', '1', '1'},
{'1', '1', '... | TEST | 0.938791 | 6.642263 |
c04bc9bd-e88e-4211-bf1d-f3fc67467434 | YB73/DSA-QUES | 0352-data-stream-as-disjoint-intervals/0352-data-stream-as-disjoint-intervals.cpp | class SummaryRanges {
set<int> values;
public:
SummaryRanges() {}
void addNum(int value) { values.insert(value); }
vector<vector<int>> getIntervals() {
if (values.empty()) {
return {};
}
vector<vector<int>> intervals;
int left = -1, right = -1;
for (... | ALGO | 0.999604 | 6.354265 |
90f28105-7494-4588-90c6-bcc0c3609ebb | ishandutta2007/codeforces | keko37/normal/1539/E.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef pair <int, int> pi;
const int MAXN = 100005;
int n, m;
int k[MAXN], lo[MAXN][2], hi[MAXN][2], len[MAXN][2];
int dp[MAXN][2], doso[MAXN][2], sol[MAXN];
set <pi> st[2];
set <int> akt[2];
void calc () {
len[0][0] = len[0][1] = 1;
st... | ALGO | 1 | 3.341201 |
6b2d7b8e-3328-4735-83a9-0beac4045081 | stang1543/flutter-quiz-app-tutorial-main | flutter-quiz-app-tutorial-main/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.998478 | 6.76073 |
c8b75830-ced9-4adc-b126-ce2343bb1894 | rohandawg/2topic.github.io | vraj/InsertionSort.cpp | #include <iostream>
using namespace std;
void insertionSort(int arr[], int n) {
for (int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
void printArra... | ALGO | 0.999981 | 5.33981 |
988e8a28-f2dd-4665-be28-961ae9c40fbe | AriyaAhadyflutter/shoes_shop | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.9988 | 6.76073 |
68fc9774-fea2-46f2-a80c-0709a2a8b551 | liyuesolo/Wukong2024 | Projects/EoLRods/src/Scene.cpp | #include "../include/Scene.h"
#include "../include/Util.h"
#include "../include/HybridC2Curve.h"
static double ROD_A = 2.5e-4;
static double ROD_B = 2.5e-4;
void Scene::buildOneCrossSceneCurved(int sub_div)
{
int sub_div_2 = sub_div / 2;
auto unit_yarn_map = sim.yarn_map;
sim.yarn_map.clear();
sim.add... | ALGO | 0.910199 | 4.089522 |
313cba05-7dff-48ff-a4e4-347c89b4353b | oxygen-hunter/Flashboom | data/big-vul-100/add_attention_code/Phi/top0-100/minimum-number-of-visited-cells-in-a-grid-Solution2.minimumVisitedCells/177857_nan.cpp | plan_a (char const *filename)
{
char const *s;
char const *lim;
char const **ptr;
char *buffer;
lin iline;
size_t size = instat.st_size;
/* Fail if the file size doesn't fit in a size_t,
or if storage isn't available. */
if (! (size == instat.st_size
&& (buffer = malloc (size ? size : (size_t) ... | ALGO | 0.995214 | 4.66431 |
98965a70-eb0a-4f38-a589-bfb10979aa47 | duckdb/duckdb-odbc | src/duckdb/extension/core_functions/aggregate/regression/regr_sxy.cpp | // REGR_SXY(y, x)
// Returns REGR_COUNT(expr1, expr2) * COVAR_POP(expr1, expr2) for non-null pairs.
#include "core_functions/aggregate/regression/regr_count.hpp"
#include "core_functions/aggregate/algebraic/covar.hpp"
#include "core_functions/aggregate/regression_functions.hpp"
#include "duckdb/function/function_set.h... | ALGO | 0.947458 | 6.814418 |
65c00af2-a631-420a-8d1f-a756c8a7ba14 | sunbines/boost_demo | boost/libs/sort/example/reversestringsample.cpp | // See http://www.boost.org/libs/sort for library home page.
#include <boost/sort/spreadsort/string_sort.hpp>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include <iostream>
#include <fstream>
#include <string>
using std::string;
using namespace boost::sort::spreads... | ALGO | 0.991909 | 4.712266 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.