uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
05807563-a1b2-4808-a8b1-01a4da97c749 | annalaurams/Competitive-Programming | Code/Beecrowd/Funções.cpp | #include <bits/stdc++.h>
using namespace std;
#define _ ios_base::sync_with_stdio(0); cin.tie(0);
#define endl '\n'
int id = 0;
double r(double x, double y) {
double asw = pow((3 * x), 2) + pow(y, 2);
return asw;
}
double b(double x, double y) {
double asw = (2 * pow(x, 2)) + pow((5*y), 2);
ret... | ALGO | 0.999968 | 4.614812 |
638d07b7-89ce-43e0-a8fe-5e1fd90fc44a | Aas11223/Leet_Code | 2470-removing-stars-from-a-string/removing-stars-from-a-string.cpp | class Solution {
public:
string removeStars(string s) {
stack<char> st;
for(int i=0;i<s.size();i++){
if(s[i]!='*') st.push(s[i]);
else if(!st.empty()) st.pop();
}
string ans;
while(!st.empty()){
ans+=st.top();
st.pop();
... | ALGO | 0.999962 | 6.1236 |
63074871-949e-40ec-ae72-0c00defc0b3b | banacer/temp.predictor | src/source.cpp | #include <iostream>
#include <fstream>
#include <cmath>
#include <ctime>
#include <random>
//#include <gsl/gsl_math.h>
//#include <gsl/gsl_fit.h>
#define temp_fsize 60
#define class_size 10
#define height 10.0 // ft
#define width 8.0 // ft
#define gravity 32.2 ... | ALGO | 0.997911 | 3.074878 |
d334fc4f-1356-4cb0-abc3-8c457ca30f66 | EmVanDy-dev/Cpp | semester1/exercise_w4_w5.cpp | #include<iostream>
#include<vector>
using namespace std;
class Array{
public:
int arr[50]={0},arr_size,element;
int countArray=0;
void Insert(){
cout<<"enter the Size for Array: ";cin>>arr_size;
cout<<"Enter "<<arr_size<<" Array Elements: ";
for(int i=0;i<arr_size;i++){
... | ALGO | 0.999647 | 3.553746 |
45e2cb6d-9609-443f-baa6-8573d5d9865a | Rost585/programacion1f2025 | main (11).cpp | #include <iostream>
using namespace std;
int main()
{
//Declarar una variable entera
int x = 6;
int y = 2;
int z = 3;
int operacion = (x + (y / z)) / (x + (y / z));
cout << "el valor de la operacion es: " << operacion << endl;
} | TOOL | 0.948886 | 3.036624 |
b4654aa1-a3e0-43be-9933-d9f6ddc17bb6 | teammymul/My-work. | POSN/C2T16.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n;cin>>n;
long long int d[n];
for(int i = 0 ; i < n ; ++i){
cin>>d[i];
}
for(int i = 0 ; i < n ; ++i){
long long int crr = d[i];
int L = i-1;
int R = i+1;
... | ALGO | 0.999996 | 3.837239 |
bdaaae8c-d6df-47f6-8a7d-fa3621c1035f | 747745124/LeetCode_Daily | 22.generateParentheses.cpp | #include "header.hpp"
class Solution {
public:
vector<string> generateParenthesis(int n) {
}
}; | ALGO | 0.999832 | 5.67258 |
18f04005-a1fb-40ef-8b86-a317601eb3c3 | oneapi-src/SYCLomatic | llvm/lib/ProfileData/SampleProfReader.cpp | #include "llvm/ProfileData/SampleProfReader.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/StringRef.h"
#include "llvm/IR/Module.h"
#include "llvm/IR/ProfileSummary.h"
#include "llvm/ProfileData/ProfileCommon.h"
#include "llvm/ProfileData/SampleProf.h"
#include "llvm/Support/Comman... | TOOL | 0.910905 | 4.41223 |
bfac57d7-5679-4f7d-8ee9-fe73b8e40be6 | trungdangtapcode/Competitive-Programming-Notebook | archived/firstyear_laptop/1901D.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int > ii;
const int maxN = 2e5+5;
int n, a[maxN];
void check(){
multiset<int> ms;
for (int i = 1; i <= n; i++){
ms.insert(a[i]+i-1);
ms.insert(a[i]);
}
int res = 1e18;
for (int i = 1; i <= n; i++){
ms.erase(ms.find(a[i]+i-1... | ALGO | 0.999944 | 3.604413 |
67b746d6-bb24-41eb-ac69-cf2fbcb91622 | Sahil-Badkul/StriverSDESheet60DaysChallenge | Day4/longestConsecutive.cpp | #include<bits/stdc++.h>
using namespace std;
class Solution {
public:
int longestConsecutive(vector<int>& nums) {
// BF-> sorting
// Optimanl -> set
// TC : O(N), SC : O(N)
set<int> s;
for(auto &num : nums){
s.insert(num);
}
int maxLen = 0;
... | ALGO | 0.999941 | 5.042715 |
0182cc99-6b04-4030-b1cd-9fbde85c787e | deanpr02/MazeGeneration | dependencies/glm/test/core/core_func_integer_find_lsb.cpp | // This has the programs for computing the number of trailing zeros
// in a word.
// Max line length is 57, to fit in hacker.book.
#include <cstdio>
#include <cstdlib> //To define "exit", req'd by XLC.
#include <ctime>
int nlz(unsigned x) {
int pop(unsigned x);
x = x | (x >> 1);
x = x | (x >> 2);
x = ... | ALGO | 0.998988 | 5.182202 |
f7010639-b7ec-4d6b-bc5b-4575e50a41a6 | jahirbd350/XPSC-04 | Week-03/Day-02/D_Double_Strings.cpp | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int t;
cin>>t;
while (t--)
{
int n;
cin>>n;
string s[n];
map<string,bool> mp;
for(int i=0; i<n; i++){
cin>>s[i];
mp[s[i]]=true;
}
for(int i=0; i... | ALGO | 0.999824 | 3.915954 |
18d1fa2e-f01c-4033-bcca-70fd2dd56b4e | ducks-github/DuckBucks | src/key.cpp | #include "key.h"
#include <openssl/ecdsa.h>
#include <openssl/rand.h>
#include <openssl/obj_mac.h>
#include <vector>
#include "util.h"
namespace {
class CECKey {
private:
EC_KEY *pkey;
public:
CECKey() {
pkey = EC_KEY_new_by_curve_name(NID_secp256k1);
if (!pkey) throw key_error("CECKey::CECKe... | TOOL | 0.94524 | 7.44742 |
afab77e6-ed25-413f-b666-8d149e5c3add | Fydcoin/FYDCoin | src/rpcdump.cpp | #include "bip38.h"
#include "init.h"
#include "main.h"
#include "rpc/server.h"
#include "script/script.h"
#include "script/standard.h"
#include "sync.h"
#include "util.h"
#include "utilstrencodings.h"
#include "utiltime.h"
#include "wallet.h"
#include <fstream>
#include <secp256k1.h>
#include <stdint.h>
#include <boo... | WEB | 0.943992 | 6.088486 |
fa59ccb0-563f-4bfb-beae-d0221f50b5f3 | kimdy003/AlgorithmStudy | Programmers/2018_kakao_3차/2_n진수_게임.cpp | //n진수 게임
#include <string>
#include <vector>
using namespace std;
string change(int n, int num){
string temp = "";
string code[] = {"0","1","2","3","4","5","6","7","8","9","A","B","C","D","E","F"};
while(num/n != 0){
temp = code[num%n] + temp;
num /= n;
}
temp = code[num%n] + tem... | ALGO | 0.999219 | 5.302229 |
92624cdd-0a0e-49ed-859a-730262350211 | furtherun/PATest | PAT_Basic/1085 PAT单位排行 (25分).cpp | /*
1085 PAT单位排行 (25分)
*/
#include<iostream>
#include <algorithm>
#include <string>
#include <unordered_map>
#include <cmath>
#include <vector>
using namespace std;
struct School{
string name;
double weightTotal;
int cnt;
School(string n, double w, int c) : name(n), weightTotal(w), cnt(c) { }
School... | ALGO | 0.997463 | 3.830736 |
ddf628da-ce5b-403e-b947-830565525e1f | siva1729/Algos_DataStructs | StacksAQueues.cpp | #include <iostream>
#include <unordered_set>
#include <new>
#include <stack>
#include <array>
using namespace std;
#if 1
class Node {
public:
int data;
int length = 0;
Node* next;
public:
Node(int d) : data(d), next(NULL) {}
void Append(int d) {
//cout << "\nAppend node\n";
Node* nnode = new Node(d);
... | ALGO | 0.999709 | 4.946607 |
805ed915-c674-4e24-8300-91851807fe2c | GautamKJ/LeetCode | Longest Bitonic subsequence - GFG/longest-bitonic-subsequence.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
int solve(vector<int>&nums)
{
int n=nums.size();
vector<int>dp1(n,1),dp2(n,1);
for(int i=0;i<n;i++)
{
for(int prev=0;prev<i;prev++)
{
if(nu... | ALGO | 0.99968 | 6.039573 |
bdfe8a6c-0c1a-4e01-8490-65a66e5dd675 | ishandutta2007/codeforces | he_ren/normal/1367/D.cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
const int MAXN = 50 + 5;
char s[MAXN];
int b[MAXN];
char ans[MAXN];
int cnt[30 + 5];
void solve(void)
{
int m;
scanf("%s%d",s+1,&m);
int n = strlen(s+1);
for(int i=1; i<=m; ++i)
scanf("%d",&b[i]);... | ALGO | 0.999979 | 3.782658 |
1d1fd44f-fc02-411c-a3a3-d754fe77c1b3 | mishamsk13/lab-algoritmi | laba7/task1.cpp | #include <iostream>
#include <vector>
#include <algorithm>
// Структура для представления заявки на лекцию
struct Lecture {
int start; // Время начала лекции
int end; // Время окончания лекции
};
// Функция сравнения для сортировки заявок по времени окончания
bool compareLectures(const Lecture& a, const L... | ALGO | 0.999948 | 6.260659 |
3ecc2733-5aef-4b39-97f4-e0be23346eac | dhuamanilu/programacion | 385/385B.cpp | #pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<ll> vll;
#define FOR(i, a, b) for (long long i=a; i<(b); i++)
#define FOR... | ALGO | 0.999339 | 4.092171 |
01033888-a2ce-4f8f-b2f3-93a7a9e18b4b | iamsandeepshekhawat/Leetcode-Submission | 3372-longest-strictly-increasing-or-strictly-decreasing-subarray/longest-strictly-increasing-or-strictly-decreasing-subarray.cpp | class Solution {
public:
int longestMonotonicSubarray(vector<int>& nums) {
int n =nums.size();
int longest = 1;
int strictly_increasing = 1;
int strictly_decreasing = 1;
for(int i=1;i<n;i++){
if(nums[i]>nums[i-1]) strictly_increasing++;
else ... | ALGO | 0.999816 | 6.152455 |
d2138071-2954-407c-b3a1-7c50836ba020 | logicaldecisions/ldw80 | ldwdll/source/sufrng.cpp | #include <dllprecompile.h>
//#include <precompile.h>
#include <sufrng.h>
#include <iostr.h>
#include <typenum.h>
#include <miscfuncts.h>
sufrng *makesufrng(double minl,double maxl,double minu,double maxu){
return new sufrng(minl,maxl,minu,maxu);
}
sufrng::sufrng(double minl,double maxl,double minu,double maxu){
... | ALGO | 0.998743 | 4.228732 |
548a6fe4-b690-42ea-b5f3-38fb19d92272 | iamsiamhossen/XPSC-SOLVE | Week 3/Day-5/D_Line.cpp | /**
* Author: iamsiamhossen
* Created: 02-04-2024 10:40:16
**/
#include <bits/stdc++.h>
#define fastread() (ios_base::sync_with_stdio(0), cin.tie(0))
#define endl "\n"
#define ll long long int
#define pb push_back
#define ld long double
#define pi pair<ll, ll>
#define checkmate return 0;
using namespace std;
int ma... | ALGO | 0.999978 | 5.311624 |
2b8249e1-3111-40d0-9d07-1811426badd1 | khoister/programming_sandbox | trie/trie.cpp | // To build: g++ -std=c++11 trie.cpp
#include <memory>
#include <iostream>
#include <fstream>
#include <string>
#include <assert.h>
#include <vector>
#include <map>
using namespace std;
class TrieNode;
typedef std::shared_ptr<TrieNode> TrieNodePtr;
class TrieNode
{
public:
TrieNode(char _c = 0): c(_c), ... | ALGO | 0.998574 | 6.07801 |
854d52d6-4d5e-40c6-afb0-024d52890b9f | Princeofsyntax/leetcode | 2707-merge-two-2d-arrays-by-summing-values/merge-two-2d-arrays-by-summing-values.cpp | class Solution {
public:
vector<vector<int>> mergeArrays(vector<vector<int>>& nums1, vector<vector<int>>& nums2){
vector<vector<int>>ans;
int m = nums1.size();
int n = nums2.size();
int i = 0, j = 0;
while(i < m && j < n){
if(nums1[i][0] < nums2[j][0]){
... | ALGO | 0.999958 | 5.719581 |
14fa19c0-ae11-4789-a22b-c3b362ad692f | sybui2004/DSA---PTIT | DSA - PTIT code by C++/DSA01016 - PHAN TICH SO 1.cpp | /*Author: Bùi Thái Sỹ B22DCCN702 from ProPTIT with love
DSA01016 - PHAN TICH SO 1
*/
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define pb push_back
#define ll long long
#define FORU(i, a, b) for (int i = a; i < b; i++)
#... | ALGO | 0.999591 | 4.866336 |
47a7739b-9956-422e-859d-6cee4cb3393b | pingchungchang/CP | ABC235E.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
const int mxn = 2e5+10;
int n,q,m;
struct Q{
int a,b,w,tp;
Q(){}
bool operator<(Q b)const{
return w<b.w;
}
};
vector<Q> req;
int a... | ALGO | 0.999954 | 4.317082 |
75548013-8b85-487c-abb6-c9cb00e37557 | vanshaj2000/DSA-Resources | DP/LIS.cpp | //Both approaches i.e. DP and Binary Search(nlogn-Most Efficient)
#include<bits/stdc++.h>
using namespace std;
int ceilInd(vector<int> &tail,int l,int r,int x)
{
while(r>l)
{
int n=l+(r-l)/2;
if(tail[n]>=x)
r=n;
else
l=n+1;
}
return r;
}
int main()
{
int n;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;... | ALGO | 0.999997 | 4.569853 |
8450ee16-617b-45b5-98f6-23314dd922b7 | Sunghyun1320/algorithm | cpp/samsung/samsung/LCA.cpp | #if 0
#define _CRT_SECURE_NO_WARNINGS
#define MAX_DEPTH 10000
#define LOG 15
#include<iostream>
struct Stack {
int* data;
int size;
int capasity;
Stack(int init = 2) : size(0), capasity(init) {
data = new int[init];
}
~Stack() { delete[] data; }
void resize(int new_capa) {
int* new_data = new int[new_ca... | ALGO | 0.999763 | 4.362288 |
d5013d60-1e72-4c95-94da-9cc7cc1d27f3 | piyush-24/Data-Structures-and-Algorithms | 216-combination-sum-iii/216-combination-sum-iii.cpp | class Solution {
public:
vector<vector<int>> ans;
void rec(int index,vector<int> ds, int k, int n)
{
if(ds.size()>k || n<0)
return;
if(ds.size()==k && n==0)
ans.push_back(ds);
for(int i=index;i<=9;i++)
{
ds.push_back(i);
rec(i+1... | ALGO | 0.999978 | 6.494725 |
46c916cd-899f-431d-b92f-ab3e9f6c30f5 | ubukulov/state_management | fb/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.998197 | 6.786404 |
8fe560b9-c43a-4a36-9649-a073c186153c | Alfon-III/FAL | 396 Orquesta/396 Orquesta/Source.cpp | #include <iostream>
#include <algorithm>
using namespace std;
int v[100000];
int max_elem(int v[], int n) {
int max = v[0];
for (int i = 0; i < n; i++) {
if (v[i] > max) {
max = v[i];
}
}
return max;
}
int resuelve(int v[], int n, int p) {
if (p == 0) {
return max_elem(v, n);
}
int i = 0;
while (i ... | ALGO | 0.99976 | 4.097173 |
b28ae62c-6f66-4141-8f26-3d77b7fd51ba | DenysGusti/university | _Programming/task_1_1.cpp | // Надрукувати найбільшу цифру двоцифрового числа, яке вводиться користувачем.
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int first_digit = n / 10, second_digit = n % 10;
cout << (first_digit > second_digit ? first_digit : second_digit) << endl;
return 0;
} | ALGO | 0.990458 | 5.59604 |
946a22e5-85f2-4adf-a8b3-7c78b41692b7 | jsvaldezv/pitch-shifter-audio-plugin | Source/PluginProcessor.cpp | #include "PluginProcessor.h"
#include "PluginEditor.h"
PitchShifterAudioProcessor::PitchShifterAudioProcessor()
#ifndef JucePlugin_PreferredChannelConfigurations
: AudioProcessor (BusesProperties()
.withInput ("Input", juce::AudioChannelSet::stereo(), true)
.with... | ALGO | 0.888073 | 5.51085 |
2d20db86-c8f2-4095-9668-54b43a2682bd | walkccc/LeetCode | solutions/3178. Find the Child Who Has the Ball After K Seconds/3178.cpp | class Solution {
public:
int numberOfChild(int n, int k) {
// the time for the ball to return to 0
const int roundTime = 2 * (n - 1);
const int pos = k % roundTime;
return pos < n ? pos : roundTime - pos;
}
};
| ALGO | 0.999958 | 6.065032 |
9e7cf845-4715-44ba-9e14-b9f318836bcc | huangww/chromosome | code/topo.cpp | #include "topo.hpp"
#include "input.hpp"
#include "ultilities.hpp"
#include <algorithm>
#include <iostream>
#include <fstream>
#include <iomanip>
Topo::Topo()
{
initFlag = 0;
link = nullptr;
nPair = nullptr;
linkPair = nullptr;
g = nullptr;
gSparse = nullptr;
}
Topo::~Topo()
{
delete2DArr... | ALGO | 0.99534 | 3.511053 |
3060da9e-f493-4877-b866-12666271e082 | sachin3059/cses_problems | graph/shortestRoutes1.cpp | //jai bajrang bali
#include<bits/stdc++.h>
using namespace std;
#define Sachin_3059 ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long
const int MOD = 1e9 + 7;
const int N = 1e5 +1;
const int INF = 1e18;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1... | ALGO | 0.99999 | 4.310948 |
9ad538f7-3779-453a-9077-94403e3bf09b | Teddygat0r/CSES | Introductory_Problems/Grid_Paths/Grid_Paths.cpp | //Not my code, spent 4 hours realizing i messed up a tiny logic error and by that time i had moved so many things around I gave up.
//Source: https://github.com/Jonathan-Uy/CSES-Solutions/blob/main/Introductory%20Problems/Grid%20Paths%20I.cpp
#include <bits/stdc++.h>
using namespace std;
const int N = 7;
int ans;
... | ALGO | 0.999891 | 4.129431 |
0873fdff-779f-4908-8bb7-a370c01d58cb | niu0217/Code | CPP/base/thread/thread_rwlock.cpp | /* ************************************************************************
> File Name: thread_rwlock.cpp
> Author: niu0217
> Created Time: Sat 29 Jun 2024 10:20:58 AM CST
> Description: 8个线程操作同一个全局变量，3个线程不定时写同一个全局资源，5个线程不定时读同一全局资源
************************************************************************... | ALGO | 0.988617 | 4.466323 |
6325b784-e6f5-483b-a7a1-e8d45d2adc4e | mtawaken/gits | careercup/1/1.1/main.cpp | #include<iostream>
#include<string>
#include<string.h>
using namespace std;
bool test(string& a){
char check[256];
memset(check,0,256);
for(string::size_type i=0;i<a.length();i++){
if(check[(int)a[i]]!=0){
return false;
}else{
check[(int)a[i]]=1;
}
}
return true;
}
bool test2(string& a){
//assume only... | ALGO | 0.999567 | 3.313283 |
590301db-df3b-4e2a-a9b1-0798e0ce31e4 | Aryaman028/LeetCode_Problems | 2681-put-marbles-in-bags/2681-put-marbles-in-bags.cpp | class Solution {
public:
long long putMarbles(vector<int>& weights, int k) {
vector<int>pairSum;
//Done in the diary IMP questions;
for(int i = 0; i < weights.size() - 1; i++){
pairSum.push_back(weights[i] + weights[i+1]);
}
int n = pairSum.size();
sort... | ALGO | 0.999902 | 5.385283 |
03efb590-f7ed-4202-816b-b7765c892a6f | raincross7/code-similarity | codes/train_code/problem269/problem269_43.cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int co... | ALGO | 0.999758 | 4.081974 |
b5aa886b-632b-40ea-922e-869bd3eb2098 | Babasaheb-Bhalekar/CrackYourPlacement | Array/Q4_Set Matrix Zeroes.cpp | #include <bits/stdc++.h>
using namespace std;
/// @brief using unordered set
class Solution
{
public:
void setZeroes(vector<vector<int>> &matrix)
{
unordered_set<int> rows, cols;
for (int i = 0; i < matrix.size(); i++)
{
for (int j = 0; j < matrix[0].size(); j++)
{
if (matrix[i][j]... | ALGO | 0.999606 | 6.316392 |
dcf5a52f-f6c6-4573-919e-af047c2e2a43 | Jackarain/avpn | third_party/boost/libs/units/example/radar_beam_height.cpp | /**
\file
\brief radar_beam_height.cpp
\details
Demonstrate library usage for user test cases suggested by Michael Fawcett.
Output:
@verbatim
//[radar_beam_height_output
radar range : 300 nmi
earth radius : 6.37101e+06 m
beam height 1 : 18169.7 m
beam height 2 : 9.81085 nmi
beam height 3... | TOOL | 0.984095 | 6.476834 |
2cda2bef-48a0-4b9e-a435-c1108b3f5d6c | maromcik/FaceRecognition | opencv/opencv-4.x/3rdparty/carotene/src/magnitude.cpp | #include "common.hpp"
#include "vtransform.hpp"
#include <cmath>
namespace CAROTENE_NS {
#ifdef CAROTENE_NEON
namespace {
struct Magnitude
{
typedef s16 type;
void operator() (const int16x8_t & v_src0, const int16x8_t & v_src1,
int16x8_t & v_dst) const
{
int16x4_t v_src0_p = vget... | ALGO | 0.998827 | 6.697874 |
197e0b13-ce1f-4350-be2b-35e4cd0d4ed4 | omar-ahmed-9/Embedded-Linux-Tasks | C++/01/task2.cpp | #include <iostream>
int main(){
int x,y,z;
std::cout<<" Please Enter 3 Numbers : "<<std::endl;
std::cin>>x>>y>>z;
int largest = std::max(z,std::max(x,y));
std::cout<<"The Maximum Values= "<<largest<<std::endl;
} | ALGO | 0.99452 | 3.964767 |
eda66e7d-e82b-46aa-8064-a79a6daed82c | caoahn/CodePTIT-DSA | gi z troi.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
char c;
int n;
char x[1005];
void Try(int i, char h) {
for (char j = h; j <= c; j++) {
x[i] = j;
if (i == n) {
for (int k = 1; k <= n; k++)
cout << x[k];
cout << endl;
} else Try(i + 1, j);
}
}
int main()
{
cin >> c >> n;
Try(1, 'A... | ALGO | 0.999445 | 3.592015 |
fccd4fa5-a2c2-4a74-8a43-b99b561138dd | dernDren161/DataStructuresAndAlgorithms | HackerEarth/BitMasking/Subsets.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// Problem Link: from Hackerearth theory on BitMaking
void call(char arr[], int num){
for(int i = 0; i< (1<<num); i++){
for(int j = 0; j< num; j++){
if(i & (1<<j)){
cout << arr[j] << " ";
}
}
cout << endl;
}
}
int... | ALGO | 0.999966 | 3.810028 |
1765b070-7e74-49bc-ba58-1ae233accfab | navjotdadwal/MainCPCodeLibrary | NumberTheory/CRT/main.cpp | #include<bits/stdc++.h>
using namespace std;
using T = __int128;
// ax + by = __gcd(a, b)
// returns __gcd(a, b)
T extended_euclid(T a, T b, T &x, T &y) {
T xx = y = 0;
T yy = x = 1;
while (b) {
T q = a / b;
T t = b; b = a % b; a = t;
t = xx; xx = x - q * xx; x = t;
t = yy; yy = y - q * yy; y = t... | ALGO | 0.999936 | 4.48841 |
e8291d61-c1e6-461f-867b-d548efed47c1 | priojeetpriyom/competitive-programming | CONTESTS/MU/IT FEST 2015/TeamPentagon/final2.cpp | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | ALGO | 0.999919 | 3.499286 |
1b21d245-81dd-4727-a807-378ba86aef7e | The1one1/code | A_Minimums_and_Maximums.cpp | #include<bits/stdc++.h>
using namespace std;
#define inout freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define int long long
signed main(){
int t; cin >> t;
while(t--){
int l1, r1, l2, r2;
cin >> l1 >> r1 >> l2 >> r2;
if(l2 <= l1 and l1 <= r2){
cout << ... | ALGO | 0.999648 | 3.184158 |
6090bdb8-19e5-47ac-b573-ee93c98fda11 | rdstihz/Learning-and-Coding | src/LYD-BOOK/LYD-CH4/ACW218.cpp | #include <bits/stdc++.h>
using namespace std;
const double INF = 1e12;
double dp[15][15][15][15][5][5];
bool vis[15][15][15][15][5][5];
int A, B, C, D;
double dfs(int a, int b, int c, int d, int x, int y) {
if (vis[a][b][c][d][x][y])
return dp[a][b][c][d][x][y];
double& res = dp[a][b][c][d][x][y];
... | ALGO | 0.999833 | 3.873866 |
c9832795-3d15-4c54-ab4d-092eaadd8ced | pokaa3a/LeetCode | problems/0301_Remove_Invalid_Parentheses.cpp | #include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <queue>
#include <stack>
#include <sstream>
#include <cmath>
#include <numeric>
using namespace std;
struct TreeNode {
int val;
TreeNode* left;
TreeNode* right;
TreeNode(... | ALGO | 0.996233 | 5.075152 |
6ed22bb9-c4d6-4816-b7bd-f48e55e0b6c0 | luwei0917/GlpG_Nature_Communication | src/USER-OMP/neigh_half_bin_omp.cpp | #include "neighbor.h"
#include "neighbor_omp.h"
#include "neigh_list.h"
#include "atom.h"
#include "atom_vec.h"
#include "molecule.h"
#include "comm.h"
#include "domain.h"
#include "my_page.h"
#include "error.h"
using namespace LAMMPS_NS;
/* ----------------------------------------------------------------------
bi... | ALGO | 0.999598 | 6.087469 |
ece36ea6-e0a4-47d9-a5d9-0a744e646b20 | ghamerly/fast-kmeans | src/python-bindings/py_compare.cpp | /* CompareKmeans wrapper. The comment at the beginning of each function
* definition demonstrates its usage in Python.
*/
#include "py_compare.h"
#include "py_assignment.h"
#include "py_dataset.h"
// Compare instance object
/*
typedef struct {
PyObject_HEAD
CompareKmeans *instance;
// TODO get_center... | TOOL | 0.913276 | 6.526903 |
b194f4c0-3952-4bc6-85a5-9be976432c4f | mohamedelsayed154/ProblemSolvingForBeginners | Problem#13.cpp | /*
Write a program to read a number and print a inverted pattern as follows ?
input : 3 input : 5
output :
1 output :
22 1
333 22
333
4444
... | ALGO | 0.998905 | 5.50967 |
c11864c2-1dfe-461f-984f-7f5007550d95 | edisonhello/OnlineJudge | TIOJ/1840_bs.cpp | #include <bits/stdc++.h>
using namespace std;
const int maxn = 5e4 + 10, maxq = 1e4 + 10;
int ans[maxq], a[maxn], tmp[maxq + maxn];
struct query {
int id, t, l, r, k, sum;
query(int a, int b, int c, int d, int e, int f) {
id = a; t = b;
l = c; r = d;
k = e; sum = f;
}
query op... | ALGO | 0.999873 | 4.183411 |
3a2ac9ad-6690-4cfa-8ddb-d896afe6011a | UuVasya/OmGTU | AlgorithmizationAndProgramming/10.11.2023_Array[][]/10.11.2023_Array[][]/Main.cpp |
#include <iostream>
#include <string>
#include "Source.h"
int main()
{
setlocale(LC_ALL, "Rus");
int Lines = 5;
int Columns = 5;
std::string Vvod;
std::cout << "Number of lines = ";
std::getline(std::cin, Vvod);
Lines = stoi(Vvod);
//Vvod.clear();
std::cout << "Number of Columns = ";
std::getline(std::... | ALGO | 0.995512 | 3.481204 |
c2a04483-d7df-46e2-aff6-c13c9d868c44 | yifeiwang-ep/ACM | summer_train/dp/nengliangxiangliang.cpp | /********************************************************************
* File name: nengliangxiangliang.cpp
* Author: Sequin
* mail: <EMAIL>
* Created Time: 四 8/10 19:41:11 2017
*************************************************************************/
#include <iostream>
#include <algorithm>
#include <string.h>
using ... | ALGO | 0.999769 | 3.483374 |
593fe27c-899f-427b-bc4c-029d3a1794f6 | ankitpnwr/Placement_Class | Day _13/Q2AnyBaseToDeci.cpp | #include <bits/stdc++.h>
using namespace std;
int convertToBase(int n, int b){
int res;
int p = 1;
while(n>0){
int dig = n % b;
n = n / b;
res += dig *p;
p = p * b;
}
return res;
}
int main()
{
int n, b;
cin >> n >> b;
if(n != 0){
cout << ... | ALGO | 0.999559 | 5.016323 |
897acc58-d923-46fa-9437-c3897613da5d | municola/numerical-methods | exercise4/test.cpp | #include <iostream>
#include <limits>
#include <eigen3/Eigen/Dense>
#include <eigen3/Eigen/Sparse>
using namespace std ;
using namespace Eigen;
int solve_triang(int n){
MatrixXd A = MatrixXd::Zero(n,n);
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
A(i,j) = 2;
}
}
FullPivLU<MatrixXd> lu(A);... | ALGO | 0.999528 | 3.218032 |
0977e4ac-aa4f-4623-ac40-aab4541ce2ce | Mohito-p/DSA2.0 | linked list/Questions/NodewherethecycleBegin.cpp | class Solution {
public:
ListNode *detectCycle(ListNode *head) {
ListNode* slow=head;
ListNode* fast=head;
while(fast!=NULL && fast->next!=NULL){
slow=slow->next;
fast=fast->next->next;
if(fast==slow){
ListNode* t=head;
while(... | ALGO | 0.999966 | 5.480026 |
a52046ee-2cfa-47a5-aa89-08273792ee1c | rmccormick314/Coursework | CS450/CS450_a5_rlm443/crazy_scientist_v4_rlm443.cpp | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <omp.h>
const int SIZE = 50;
const int totalThreads = 2;
struct arguments {
pthread_mutex_t* lock;
int tid;
int* counterOne;
int* counterTwo;
double* endTime;
};
double mat[SIZE][SIZE];
double do_crazy_computat... | ALGO | 0.999776 | 3.852115 |
4f37fea3-2ae8-4895-b947-c36737fd4ab6 | Salatiktik/Daniil_Litvinets_153503_da | Lab 5/t.add1test/pch.cpp | //
// pch.cpp
//
#include "pch.h"
int F_function(int n)
{
if (n % 10 > 0)
{
return n % 10;
}
else if (n == 0)
{
return 0;
}
else if (n % 10 == 0)
{
return F_function(n / 10);
}
}
long long S_function( long long int p, long long int q)//
{
int qwe = 0;
long long sum = 0;
for (long long i = p; i <= q... | ALGO | 0.996318 | 3.966054 |
cf4126ca-62de-4e94-8109-063b6e3b2858 | MD-SIFAT-AHAMED/Data_Structure_with_CPP | Assignment 2/Queries.cpp | #include <bits/stdc++.h>
using namespace std;
class Node
{
public:
int val;
Node *next;
Node(int val)
{
this->val = val;
this->next = NULL;
}
};
void insert_head(Node*&head,Node*&tail,int val)
{
Node*newNode=new Node(val);
if (head == NULL)
{
head = newNode;
... | ALGO | 0.999914 | 3.669982 |
a7cd2e01-7f61-4769-8b27-df6cef07ed20 | Himalay12/git-github | codeforces.cpp | #include<bits/stdc++.h>
const int MOD=998244353;
using namespace std;
int main(){
int n,k;cin>>n>>k;
int p[n];
for(auto& i:b) cin>>i;
sort(a,a+n);
int sum=0;
for(int i=1;i<=k;i++){
sum+=p[n-i];
}
int m=n-k;
if(m>=0){
}
return 0;
}
//0 1 2 0... | ALGO | 0.999976 | 4.200295 |
675cb9ca-b327-4c9f-bbdd-1150d177a804 | CepkaN/Le-Devoir-22 | Le Devoir 22/Le Devoir 22.cpp | #include<iostream>
#include<cstdlib>
#include<ctime>
template<typename T>
void riemp(T bloc[], const int cif) {
srand(time(NULL));
for (int i = 0; i < cif; i++)
bloc[i] = rand() % 15;
}
template<typename T>
void aff(T bloc[], const int cif) {
std::cout << '[';
for (int i = 0; i < cif; i++)
std::cout << bloc[i]... | ALGO | 0.99955 | 3.508735 |
b708a253-4226-4ee8-8f25-c103900a0a1a | ishandutta2007/codeforces | burnoutag7/normal/1606/A.cpp | #include<bits/stdc++.h>
using namespace std;
void mian(){
string s;
cin>>s;
s.front()=s.back();
cout<<s<<'\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T;
cin>>T;
while(T--)mian();
return 0;
} | ALGO | 0.999492 | 3.883836 |
da45a3d2-913e-4fc6-ac01-479dd68b96b4 | nextgis/nextgis_installer | qtifw/src/libs/7zip/unix/CPP/Windows/FileFind.cpp | // Windows/FileFind.cpp
#include "StdAfx.h"
#include "FileFind.h"
#include "FileIO.h"
#include "../Common/StringConvert.h"
#ifndef _UNICODE
extern bool g_IsNT;
#endif
#include <sys/stat.h>
#include <unistd.h>
#include <errno.h>
#ifdef ENV_HAVE_LSTAT
extern "C"
{
int global_use_lstat=1; // default behaviour : p7z... | TOOL | 0.98614 | 4.694692 |
4984ae46-5a3f-45de-8448-eed29500cefd | jscslg/Competitive-Programming | archive/Codeforces/edu_98/A.cpp | /*
~~~JsCode~~~
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ldb long double
#define uniquefy(v) v.resize(unique(v.begin(), v.end()) - v.begin())
#define pb push_back
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define tr(i,a) for(auto& i:a)
//#define int ll
#d... | ALGO | 0.999798 | 4.547668 |
90a67d44-de5b-4d88-b674-d181afc40665 | Xwyzworms/ProblemSolving | codechef/Compete/BasicProgramming/chefAndStockPrices.cpp | #include<iostream>
int main()
{
int t;
std::cin>>t;
while(t--)
{
float s,a,b,c;
std::cin>>s>>a>>b>>c;
s = s + (c*s)/100;
if(s>=a && s<=b)
{
std::cout<<"Yes\n";
}
else {
std::cout<<"No\n";
}
}
return 0;
}
| ALGO | 0.998935 | 3.312321 |
5347bd1e-0060-4f92-a5b5-888b9b042fb1 | Sujoy-BUET/OOP-108 | CPP/Offline 1/Offline1.cpp | #include<iostream>
#include<cstdlib>
using namespace std;
class Fraction{
int numerator;
int denominator;
int Gcd(int a,int b){
if(b==0) return a;
return Gcd(b,a%b);
}
public:
void set_numerator(int a){
numerator = a;
}
void set_denominator(int a){
denomi... | TOOL | 0.870938 | 4.406545 |
751f78e6-27e0-4336-8b3d-bcc4425e277e | sarvex/leetcode-nushell | lcof/面试题34. 二叉树中和为某一值的路径/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.999915 | 6.381255 |
06c79523-1d1d-4dc3-9541-a3e77e07fbc8 | m1tRy/cs-lab03 | lab03/Source.cpp | #include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include "histogram.h"
using namespace std;
const size_t SCREEN_WIDTH = 40;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 5 - 2;
vector<double> input_numbers(size_t count) {
vector<double> result(count);
for (size_t i = 0; i < count; i++) {
st... | TOOL | 0.911314 | 5.784276 |
c152f37d-f0a3-4d69-9a3c-6ae367738308 | khimzd/TranKhacKhiem_C | Programming Challenges chapter 13/13.10.cpp | #include <iostream>
using namespace std;
class NumberArray {
private:
double* array;
int size;
public:
NumberArray(int s) {
if (s <= 0) {
cout << "Invalid array size!" << endl;
exit(1);
}
size = s;
array = new double[size];
}
~NumberArray()... | ALGO | 0.993538 | 5.996995 |
95f7aa21-98da-4a3c-8aa5-d76ed6bd7204 | llenroc/CP | LeetCode/tags/tree/count-complete-tree-nodes.cpp |
#include<bits/stdc++.h>
using namespace std;
/**
* 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 ... | ALGO | 0.999871 | 6.468607 |
02816be2-4c70-4182-800a-a5f1491773a2 | NCTU-PCCA/NCTU_Oryx | Graph/MMC.cpp | #include <stdio.h>
#include <iostream>
#include <vector>
using namespace std;
//---codebook test=Graph/MMC
/*---codebook desc
\paragraph{Remark}
The testcase of the snippet has been modified
*/
//---codebook start
#define MAXN 5005
#define INF 2147483647000
#define eps 1e-9
#define ll long long int
struct edge {
int... | ALGO | 0.99989 | 4.60328 |
3db2f3ad-875b-4467-bf3e-ee908ff19954 | yadsasusi/LeetCode-Sol | solutions/1772. Sort Features by Popularity/1772.cpp | class Solution {
public:
vector<string> sortFeatures(vector<string>& features,
vector<string>& responses) {
vector<string> ans;
vector<pair<int, int>> featCount; // {i: count[features[i]]}
unordered_map<string, int> count;
for (const string& res : responses) {
is... | ALGO | 0.997804 | 6.645913 |
6735a631-03c4-4b18-bea5-56e3dd7dad4c | lunastorm/wissbi | 3rd_party/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/sort.pass.cpp | // <forward_list>
// void sort();
#include <forward_list>
#include <iterator>
#include <algorithm>
#include <vector>
#include <cassert>
void test(int N)
{
typedef int T;
typedef std::forward_list<T> C;
typedef std::vector<T> V;
V v;
for (int i = 0; i < N; ++i)
v.push_back(i);
std::ran... | TEST | 0.973618 | 4.92435 |
2012ffc2-903d-4c6a-a8b9-b22a3c23c625 | yaesoubilab/SimulationLib | SimulationLib/src/Config.cpp | #include "Config.h"
#include "ReadParam.h"
#include <cstdio>
#include <iostream>
#include <boost/filesystem.hpp>
// Marcus: Explain what these macros are used for
// Eyal: Stringification.
// This allows me to say "fdaso" ST(BAR) "adf", and have it turn into
// "fdaso" "12" "adf" in the preprocessor (if BAR expands to... | CONFIG | 0.863734 | 5.879908 |
50715093-3a24-4c1d-abce-d0ab85df53d8 | ishandutta2007/codeforces | maroonrk/normal/1086/B.cpp | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll=int64_t;
#define int ll
#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(),x.end()
auto& errStream=cerr;
#ifdef LOCAL
#def... | ALGO | 0.999593 | 3.582453 |
e93aeee8-9575-49af-a05f-551f7267a63e | Andwerpz/Competitive-Programming-Practice | - cpp -/devuandbirthdaycelebration.cpp | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
// typedef __int128 lll;
// typedef __float128 lld;
using namespace std;
//Codeforces - 439E
//didn't think this solution would run in time. Complexity is around q * n^2/3 * log(n).
//ig the n^2/3 part is probably overestimation, it's probably cl... | ALGO | 0.999922 | 5.805728 |
57099531-eb34-4520-9d44-d4c0423a5514 | SaiAnvesh493/DSA0184_object_oriented_programming_with_C- | Multipication_table.cpp | #include<iostream>
using namespace std;
int main()
{
int n,i;
cout<<"Enter the number";
cin>>n;
for(i=1;i<=10;i++)
{
cout<<n<<"*"<<i<<"="<<(n*i)<<"\n";
}
return 0;
}
| ALGO | 0.997982 | 3.190047 |
c8ae86ba-1be0-48ac-80ab-d79ef2a99afb | svanegas/programming_solutions | URI/1027 - Critical Wave/1027.cpp | #include <bits/stdc++.h>
using namespace std;
struct point {
int x, y;
point() {}
point(int _x, int _y) : x(_x), y(_y) {}
bool operator < (const point &than) const {
if (x < than.x) return true;
else if (x == than.x) return y < than.y;
else return false;
}
};
const int MAXN = 1005;
int dp[MAX... | ALGO | 0.999491 | 5.001392 |
726e9fd3-1f47-4c2a-a663-f1b710e89790 | yuyu0830/baekjoon | solved/1918.cpp | // 스택 골드 2 후위 표기식 https://www.acmicpc.net/problem/1918
#include <iostream>
#include <stack>
#include <string>
using namespace std;
bool f(char c) {
if (c == '+' || c == '-') return true;
return false;
}
bool ff(char a, char b) {
if (f(a) && (b == '*' || b == '/')) return true;
return false;
}
int ma... | ALGO | 0.999973 | 4.937723 |
dfbd6c81-d74a-4eb1-ab88-19cd4823a91c | SWEG-2015EC-Batch/Code-Warrior | ETS1303_15_TESFAMICHAEL_TAFERE/Activity 3.1/Printing patterns/Print numbers from 10 through 49.cpp | //Printing numbers from 10 up to 49
#include <iostream>
using namespace std;
int main() {
int count = 10;
for (int i = 1; i <= 5; ++i) {
for (int j = 1; j <= 8; ++j) {
cout << count << "\t";
++count;
if (count > 49) {
break; // Stop printing if coun... | ALGO | 0.995621 | 4.008232 |
7742d759-1a82-489d-b79b-ce3491390a3b | yuann3/eatcode | 2415-reverse-odd-levels-of-binary-tree/2415-reverse-odd-levels-of-binary-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.999996 | 5.969555 |
e37b32e0-b122-46b2-ac22-f22c010acbd8 | MahendraDani/problem-solving | src/day-50/a110.cpp | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int cnt = 0;
for(int i=0;i<s.size();i++){
if(s[i]=='4' || s[i]=='7'){
cnt++;
}
}
if(cnt==4 || cnt==7){
cout << "YES\n";
}else{
cout << "NO\n";
}
return 0;
}
| ALGO | 0.999093 | 3.915262 |
4b2175a2-6ed7-46b8-81fe-438174f2d2e8 | Krish-Parekh/Data-Structure-And-Algorithm | Array/RemoveDuplicatesFromSortedArray.cpp | /**********************************************************************************
*
* Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the * elements should be kept the same.
*
* Since it is impossib... | ALGO | 0.99993 | 6.703605 |
59d6aa99-2193-41e4-b037-48a291bddff6 | sakib-mustafa-ak/Codeforces-Solutions | 9A.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define Start ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define ff first
#define ss second
#define pb push_back
#define pr pair<int,int>
void solve(){
in... | ALGO | 0.99978 | 4.491889 |
f8c947b0-17cd-445e-9b1a-6dc16d4deab2 | aryandelwadia/Coding-Questions | GeeksForGeeks/Kth Smallest.cpp | //link
//https://www.geeksforgeeks.org/problems/kth-smallest-element5635/1
//{ Driver Code Starts
// Initial function template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function template for C++
class Solution {
public:
// arr : given array
// k : find kth smalles... | ALGO | 0.999907 | 5.276644 |
1a31dd4b-c9c5-4a49-9171-e77af3c3ad17 | bak3839/baekjoon_cpp | 프로그래머스/lv2/118667. 두 큐 합 같게 만들기/두 큐 합 같게 만들기.cpp | #include <string>
#include <vector>
using namespace std;
int solution(vector<int> queue1, vector<int> queue2) {
int cnt = 0;
long long sum1 = 0, sum2 = 0, target;
int size1 = queue1.size(), size2 = queue2.size(), idx1 = 0, idx2 = 0, max_cnt = size1 + size2;
for(int i = 0; i < queue1.size(); i++) ... | ALGO | 0.999969 | 4.381806 |
e7045abc-0e16-4083-bedb-b30c08c643ac | Kawser-nerd/CLCDSA | Source Codes/CodeJamData/10/63/11.cpp | // progc.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <vector>
#include <string>
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <fstream>
#include <algorithm>
#include <sstream>
#include <map>
#include <ctime>
#include <cassert>
using namespace std;
... | ALGO | 0.999943 | 3.825765 |
bb7374b7-1634-443d-95e8-92f47aeae885 | sujalgera01/Lets-LeetCode-with-Me | 820-short-encoding-of-words/820-short-encoding-of-words.cpp | class Solution {
public:
int minimumLengthEncoding(vector<string>& words) {
set<string> s1(words.begin(),words.end());
set<string> s2(words.begin(),words.end());
for(auto word: s1){
for(int i=1;i<word.size();i++){
s1.erase(word.substr(i));
}
... | ALGO | 0.999957 | 5.749418 |
fed0a935-8cd3-4ea3-a408-b15d8d4a4d1c | CodeTrans-Research/RefuTra | result/translate/chatgpt/java2cpp/c++_eval/FIRST_UPPERCASE_LETTER_IN_A_STRING_ITERATIVE_AND_RECURSIVE.cpp | #include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
char f_gold ( string str ) {
for ( int i = 0;
i < str . length ( );
i ++ ) if ( isupper ( str [ i ] ) ) return str [ i ];
return 0;
}
char f_filled(stri... | ALGO | 0.995312 | 5.233655 |
ae887c79-756b-4bb9-a20e-557610f30fe6 | sarandia/lockfreebst | test/bigfat/ptest.cpp | #include <iostream>
#include <set>
#include <iterator>
#include "tree.h"
#include "treeprinter.h"
#include <pthread.h>
#include <ctime>
using namespace lock_free_rbtree;
using namespace std;
int insert_start1 = 1;
int insert_end1 = 50000;
int delete_start1 = 10000;
int delete_end1 = 50000;
int insert_start2 = 50001... | ALGO | 0.943557 | 3.846956 |
bed3ee17-7cb4-4df4-81b0-0b68d7fc8e34 | ramim2219/total_problem_solved | DP/2d dp/ninjaTraining.cpp | #include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
int main()
{
fast;
int n,m;
m=3;
cin>>n;
vector<vector<int>>grid(n,vector<int>(3));
for(int i=0;i<n;i++)
for(int j=0;j<3;j++)
c... | ALGO | 0.999933 | 3.756931 |
2fa2d788-a34c-4b82-98ce-102ec3e34713 | dxx-rebirth/dxx-rebirth | similar/main/fireball.cpp | /*
*
* Code for rendering & otherwise dealing with explosions
*
*/
#include <algorithm>
#include <numeric>
#include <random>
#include <ranges>
#include <optional>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "dxxerror.h"
#include "maths.h"
#include "vecmat.h"
#include "gr.h"
#include "3d.h"... | TOOL | 0.989062 | 4.310599 |
8fbb58e0-967e-4736-8372-40337b865d1e | prakhar-5447/dsa_leetcode | third_maximun_number.cpp | // https://leetcode.com/problems/third-maximum-number/description/
#include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
int thirdMax(vector<int> &nums)
{
int first, second, third;
first = second = third = INT_MIN;
int count = 0;
int len = nums.size();
... | ALGO | 0.999976 | 5.668531 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.