uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
d317166b-ac29-4d9f-8d7c-b677959df014 | ElektraInitiative/libelektra | src/libs/tools/src/merging/interactivemergestrategy.cpp | /**
* @file
*
* @brief Implementation of InteractiveMergeStrategy
*
* @copyright BSD License (see LICENSE.md or https://www.libelektra.org)
*
*/
#include <helper/keyhelper.hpp>
#include <merging/interactivemergestrategy.hpp>
#include <merging/onesidestrategy.hpp>
using namespace std;
using namespace kdb::tools... | TOOL | 0.984107 | 7.043989 |
06598ae7-63d3-48b0-8baf-11c0d4a130c3 | TheVareno/ont-polyA-detection | model_building/polyA_model/polyA.cpp |
// author: Jannes Spangenberg, Hadi Vareno
// e-mail: <EMAIL>, <EMAIL>
// github: https://github.com/JannesSP, https://github.com/TheVareno
// website: https://jannessp.github.io
#include <iostream>
#include <iomanip>
#include <fstream> // file io
#include <sstream> // file io
#include <string>
#include <map> // dict... | ALGO | 0.999154 | 3.257171 |
c6f9e5ad-9739-468a-81a1-04f79c733f17 | anshulgera17/sunbeam_practise | C++/Day_9.14/Main.cpp | #include<iostream>
using namespace std;
class Point
{
private:
int xPosition;
int yPosition;
public:
Point( void )
{
this->xPosition = 0;
this->yPosition = 0;
}
Point( int xPosition, int yPosition )
{
this->xPosition = xPosition;
this->yPosition = yPosition;
}
void printRecord( void )
{
cout<<"X Po... | TOOL | 0.93803 | 3.926304 |
7cd45183-df20-47b6-a512-bfb78f0b64ec | kpjgit/study | baek/hash/learning1.cpp | //-1 chaining
#include <bits/stdc++.h>
const int M = 1000003;
const int a = 1000;
const int MX = 500005; // 최대 삽입 횟수
int head[M];
int pre[MX];
int nxt[MX];
std::string key[MX];
int val[MX];
int unused = 0;
int my_hash(std::string& s){
int h = 0;
for(auto x : s)
h = (h * a + x) % M;
return h;
}
... | ALGO | 0.99875 | 5.320669 |
994c547f-6d51-4a89-9b52-80a5c7aa27fa | OteIan/Cpp_learning | Class/Class_Assignments/Assignment_5/4-linked_list.cpp | #include <iostream>
#include <cctype>
#include <chrono>
using namespace std;
using namespace chrono;
struct list {
char data;
list* next;
list(char val) : data(val), next(nullptr) {}
};
void normalize(const char* input, list*& head, int& size) {
list* current = nullptr;
for (int i = 0; input[i] ... | ALGO | 0.999205 | 6.624322 |
648162d7-9ee6-4fe1-996d-8fa612b067ca | Al1a123/demo-glsl | Spline3D/Interpol.cpp | // Interpol.cpp: implementation of the CInterpol class.
//
//////////////////////////////////////////////////////////////////////
#include "Interpol.h"
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
///////////////////////////////////////////////////////////////////... | TOOL | 0.883413 | 3.969295 |
e9db2adf-b038-49f9-8090-b448e4bad3b3 | vtrevisa/CPP | 09/ex01/src/classes/RPN.cpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* RPN.cpp :+: :+: :+: ... | ALGO | 0.899276 | 6.513594 |
706b3595-ef3f-4dd7-965d-aef6a606fa2d | uyongw/mkl-dnn | src/ocl/jit_gen9_common_convolution.cpp | #include "common/c_types_map.hpp"
#include "common/math_utils.hpp"
#include "common/mkldnn_thread.hpp"
#include "common/mkldnn_traits.hpp"
#include "common/type_helpers.hpp"
#include "ocl/jit_gen9_common_convolution.hpp"
namespace mkldnn {
namespace impl {
namespace ocl {
using math::saturate;
template <data_type_t... | ALGO | 0.985673 | 5.111696 |
15b168fe-6ad2-4f7c-9600-59b32d44659c | hoangvantuan123/TH_CTDLGT_laptrinhC | thctdlgtbai16.cpp |
//De:
/*Bài 16(thctdlgtbai16.cpp): Cài đặt ngăn xếp sử dụng cấu trúc lưu trữ phân tán với phần tử dữ liệu
là số nguyên. Ứng dụng ngăn xếp cho bài toán tìm và đưa ra các số nguyên tố nhỏ hơn n theo thứ tự
giảm dần.
*/
#include<iostream>
#include<stdio.h>
#include<math.h>
struct node{
int infor;
node *link;
};
... | ALGO | 0.999821 | 3.871706 |
1e493dc8-6593-490a-bf1c-840f148257d4 | ishandutta2007/codeforces | errorgorn/normal/1624/G.cpp | // Super Idol
//
//
//
// 105C
//
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#defin... | ALGO | 0.999945 | 4.937408 |
84bdd74e-7c71-421a-88b8-d7376eb39dc9 | Wiktor1288/Lab00 | main.cpp | #include <iostream>
#include<algorithm>
#include "RandomNumberGenerator.h"
#include "Zadania.hpp"
void DataGeneration(Task *pointer1,int size1, int SeedVa);
void CalculateData(Task *pointer1,int size1,int *orderTask);
void SortOfTasks(Task *pointer1, int size1,int *OrderTask);
int main(){
auto SeedValue=0, Number... | TOOL | 0.965786 | 3.610946 |
544d391f-c7ce-40c5-be48-8627a0339c66 | BarronWill/AI-Practice | DFS_BFS_SEARCH.cpp | #include<iostream>
#include<algorithm>
#include<vector>
#include<string.h>
#include<queue>
#include<fstream>
#include<math.h>
using namespace std;
const int sz = 9;
const int mx = 1000000;
int parent[sz];
bool mark[sz] = {};
void trace(int root, int goal){
vector<int> arr;
arr.push_back(goal);
while(goal ... | ALGO | 0.999805 | 3.602084 |
891ec6a5-cb64-46ff-9342-0b7359297c2f | phil2988/workout_application | 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 |
a5832e43-dd4b-4c07-a67d-d32259a8867f | yuri044/Data_Structure | Divide_Conquer/example1.cpp | #include<iostream>
using namespace std;
template<typename T>
T sumArray(const int array[], int start, int end)
{
if(start > end)
{
return 0;
}
else if (start == end)
{
return array[start;]
}
else
{
int mid = (start + end ) / 2;
return sumArray(array, ... | ALGO | 0.992407 | 5.341463 |
83d30c1f-c010-441b-8378-cc49a54c5a90 | yyymouse/RM | 速控/eigen-3.4.0/bench/sparse_product.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 -DCSPARSE
// -I /home/gael/Coding/LinearAlgebr... | ALGO | 0.993219 | 4.164869 |
3bff312b-4f97-4158-b90c-35254946f4cf | leoni05/PS | BOJ/5000/5015.cpp | #include <stdio.h>
#include <algorithm>
#include <vector>
#include <memory.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string.h>
#include <string>
#include <math.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
char p[105];
char str[105];
int ... | ALGO | 0.99993 | 3.650142 |
59ec6b0b-29f0-45b4-ae52-60f90dc14bad | sharmilidas33/MyDsaCodes | Insertion Sort.cpp | #include<stdio.h>
void printArray(int *A, int n){
for(int i=0;i<n;i++){
printf("%d ",A[i]);
}
printf("\n");
}
void insertionSort(int *A, int n){
int key, i, j;
for(i=0;i<=n-1;i++){
key= A[i];
j=i-1;
while(j>=0 && A[j]>key){
A[j+1]=A[j];
j--;
}
A[j+1]=key;
}
}
int main(){
int A[]={3,6,2,1,4,9... | ALGO | 0.999959 | 4.36024 |
f422f012-23c9-49ed-a581-d11c707cb4b5 | xuanquynh3005/Code_CPP_PTIT | CPP0227 - IN MA TRẬN - 1.cpp | #include<iostream>
#include<vector>
using namespace std;
int main() {
int t; cin >> t;
while (t--) {
int n; cin >> n;
int M[101][101];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> M[i][j];
for (int i = 0; i < n; i++) {
if(i%2==0)
for (int j = 0; j < n; j++) {
cout << M[i][j... | ALGO | 0.999775 | 3.44559 |
db5f33eb-88d2-427d-a83c-148a4e066968 | KshitijShinde/competitive-programming-using-c- | expt 4 sorted/main.cpp | #include <bits/stdc++.h>
using namespace std;
bool isSorted(const vector<int> arr)
{
for (int i = 1; i < arr.size(); i++)
if (arr[i - 1] > arr[i])
return false;
return true;
}
int main()
{
vector<int> arr = { 10, 23, 23, 45, 78, 88 };
cout << (isSorted(arr) ? "Yes\n" : "No\n");
return 0;
} | ALGO | 0.999896 | 4.339797 |
62ab3a83-b29d-4d0a-9ee5-87b8a304f4bb | abdullahmeen/smarthens | week3/totaldigits.cpp | #include<iostream>
using namespace std;
void totaldigits(int num,int count);
int main()
{
int n,c;
totaldigits(n,c);
return 0;
}
void totaldigits(int num,int count)
{
count=0;
cout<<"enter a num : ";
cin>>num;
while(num!=0)
{
num = num/10.0;
count ++;
}
cout<<"to... | ALGO | 0.998925 | 3.454905 |
bf817e73-7cf0-4242-9ec9-5648e1a1381f | petergartland/DataStructures | chapter5/hash.cpp | #include <iostream>
#include <string>
//#include "chainhashing.h"
#include <list>
//#include "linearhash.h"
#include <stdlib.h>
#include <time.h>
#include <fstream>
#include <math.h>
using namespace std;
int hashFunct(const std::string & key, int tableSize)
{
int ret = 0;
for (int i = 0; i < key.length(); i++)
{
... | ALGO | 0.997252 | 4.342188 |
4eb0e4d9-cd51-4044-8f31-9263491c21ba | HarshGalav/Leetcode-Best-Practice | 3227-Vowels-Game-in-a-String.cpp | class Solution {
public:
bool isv(char i){
if(i=='a'|| i=='e' || i=='o'|| i=='i'||i=='u'){
return true;
}
return false;
}
bool doesAliceWin(string s) {
int vo=0;
for(auto i:s){
if(isv(i)){
vo++;
}
}
i... | ALGO | 0.999706 | 5.468694 |
a424e117-b935-4a48-81f6-2b3cfaca6164 | Simmi-aggarwal16/cb_lectures | 01 - December/Lecture 06/011CountCharacterTypes.cpp | #include<iostream>
using namespace std;
int main() {
int lCount = 0; // to track the no. of lowercase letters
int uCount = 0; // to track the no. of uppercase letters
int dCount = 0; // to track the no. of digits
int sCount = 0; // to track the no. of speical symbols
int wCount = 0; // to track the no. of whit... | TOOL | 0.898096 | 3.818775 |
ba6efe9f-5af9-4bc1-9155-7ec4b683b8ee | mamarezatajik/Competitive-Programming | Traning/32.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
mt19937_64 rng((unsigned ll) chrono::steady_clock::now().time_since_epoch().count());
#define F first
#define S second
#define len(a) ... | ALGO | 0.999985 | 4.170801 |
fd8698f7-c031-479c-b5f5-9fd1a74c37cb | amity874/DsaInteviewPrep | SearchingSorting/Lecture10/scholarship.cpp | #include<bits/stdc++.h>
bool possible(int mid,int n,int m,int x,int y){
int res=(m+(std::abs(n-mid))*y);
return res>=x*mid;
}
int binarySearch(int n,int m,int x,int y){
int lo=0;
int hi=n;
int ans=0;
while(lo<=hi){
int mid=lo+(hi-lo)/2;
if(possible(mid,n,m,x,y)){
lo=m... | ALGO | 0.999791 | 3.714479 |
f7c28e41-0c69-42a3-aa26-d78dc47d0caf | Roaring0202/Perspective | cpp/perspective/src/cpp/sort_specification.cpp | #include <perspective/first.h>
#include <perspective/base.h>
#include <perspective/sort_specification.h>
namespace perspective {
t_sortspec::t_sortspec(const std::string& column_name, t_index agg_index, t_sorttype sort_type)
: m_colname(column_name)
, m_agg_index(agg_index)
, m_sort_type(sort_type)
, ... | TOOL | 0.926434 | 6.302659 |
e609107a-5c19-47a7-b51e-eee4d94b4348 | mgordenko/c_plus_plus_course | 2024_2025_2nd_sem_en/week3/05_06_sem/problem6_sum/main.cpp | ///////////////////////////////////////////////////////////////////////////////
/// \file
/// \brief Main module for a Problem: Pointers - Sum of Two Numbers
/// \version 0.1.0
/// \date 22.01.2022
///
/// TASK DESCRIPTION
///
/// Write a program that reads two integers from the standard input and calcula... | ALGO | 0.992618 | 5.36415 |
30f7f7c1-19ad-4a79-9326-cfe6ef497efb | utia-econometrics/sddp | source/alglib/alglibmisc.cpp | #include "stdafx.h"
#include "alglibmisc.h"
// disable some irrelevant warnings
#if (AE_COMPILER==AE_MSVC)
#pragma warning(disable:4100)
#pragma warning(disable:4127)
#pragma warning(disable:4702)
#pragma warning(disable:4996)
#endif
using namespace std;
///////////////////////////////////////////////////////////////... | ALGO | 0.982125 | 4.496488 |
31e86f91-34e7-4a5c-8902-6fcdc0166a05 | Ishikajain02/Codeforces-Contests | Contest 939 Div 3/A_Maximize.cpp | #include<iostream>
using namespace std;
int gcd(int val1,int val2){
int mini=min(val1,val2);
int ans=0;
for(int i=1;i<mini;i++){
if(val1%i==0 && val2%i==0){
ans=i;
}
}
return ans;
}
int main(){
int t;
cin>>t;
while(t--){
int x;
cin>>x;
... | ALGO | 0.999955 | 4.267787 |
aa8faec8-6f5e-4d9a-9db6-d4baf6a96b50 | IllusionMZX/Mio_arduino | Libraries/libraries/FastLED/src/noise.cpp | #define FASTLED_INTERNAL
#include "FastLED.h"
#include <string.h>
FASTLED_NAMESPACE_BEGIN
#define P(x) FL_PGM_READ_BYTE_NEAR(p + x)
FL_PROGMEM static uint8_t const p[] = {
151, 160, 137, 91, 90, 15, 131, 13, 201, 95, 96, 53, 194, 233, 7, 225,
140, 36, 103, 30, 69, 142, 8, 99, 37, 240, 21, 1... | ALGO | 0.99065 | 5.949927 |
798d2593-de84-4c0a-8306-5708deb8b330 | Dyyt587/OCS2_ROS2 | ocs2_robotic_examples/ocs2_perceptive_anymal/ocs2_switched_model_interface/src/terrain/PlanarTerrainModel.cpp | //
// Created by rgrandia on 29.04.20.
//
#include "ocs2_switched_model_interface/terrain/PlanarTerrainModel.h"
namespace switched_model {
PlanarTerrainModel::PlanarTerrainModel(TerrainPlane terrainPlane) : terrainPlane_(terrainPlane), sdf_(std::move(terrainPlane)) {}
TerrainPlane PlanarTerrainModel::getLocalTerrai... | ALGO | 0.986195 | 7.53932 |
13324f47-41ab-43f2-8a10-fc5c11ffe9f1 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_12206_10.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
vector<int> ans;
long long int sum = 0;
long long int counter = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
sum += p;
v.push_back(p);
}
for (int i = 0; i < v.size(); i++) {
long int q =... | ALGO | 0.999971 | 3.448503 |
8af34da1-6f17-45d2-b3d6-c95d06cad804 | tridhapuku/DSP_MLIR | mlir/lib/Dialect/Vector/Transforms/VectorDistribute.cpp | #include "mlir/Dialect/Affine/IR/AffineOps.h"
#include "mlir/Dialect/Arith/IR/Arith.h"
#include "mlir/Dialect/MemRef/IR/MemRef.h"
#include "mlir/Dialect/SCF/IR/SCF.h"
#include "mlir/Dialect/Vector/IR/VectorOps.h"
#include "mlir/Dialect/Vector/Transforms/VectorDistribution.h"
#include "mlir/IR/AffineExpr.h"
#include "ml... | ALGO | 0.974167 | 7.401244 |
5246def8-bc13-4036-904d-66d3d23963f8 | Mahanth-Maha/My_CPP | Competitive Programming/mod3_Array/Easy_4_removeDuplicates.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
// remove duplicates in sorted Array inplace
void remove_dups(vector<int> &v){
int prev = v[0] , j = 1;
for(int i = 1; i < v.size(); i++){
if(prev != v[i])
v[j++] = v[i];
prev = v[i];
... | ALGO | 0.999888 | 3.841134 |
908dd85f-0b6f-4c15-983e-6e84526d8993 | sarvex/leetcode-julia | solution/2100-2199/2174.Remove All Ones With Row and Column Flips II/Solution.cpp | class Solution {
public:
int removeOnes(vector<vector<int>>& grid) {
int m = grid.size(), n = grid[0].size();
int state = 0;
for (int i = 0; i < m; ++i)
for (int j = 0; j < n; ++j)
if (grid[i][j])
state |= (1 << (i * n + j));
queue<int>... | ALGO | 0.999889 | 6.069195 |
e9cb8117-f7b0-433a-b3be-177f369697df | CodeBySushant/SolvedLeetcode | leetcode-main/leetcode-main/solution/1800-1899/1868.Product of Two Run-Length Encoded Arrays/Solution.cpp | class Solution {
public:
vector<vector<int>> findRLEArray(vector<vector<int>>& encoded1, vector<vector<int>>& encoded2) {
vector<vector<int>> ans;
int j = 0;
for (auto& e : encoded1) {
int vi = e[0], fi = e[1];
while (fi) {
int f = min(fi, encoded2[j][... | ALGO | 0.999961 | 5.087219 |
3fb1c756-4cc3-4bce-b48d-4c2f83cabb6d | Corycle/OI-Codes | Bashu OnlineJudge/6140.cpp | /*====Corycle====*/
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<cstdio>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<map>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int... | ALGO | 0.999867 | 3.686341 |
14b9ee21-5a4c-4e9e-8a06-51aab6470f43 | aryaratan/Leetcode-Solutions | Column name from a given column number - GFG/column-name-from-a-given-column-number.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
string colName (long long int n)
{
// your code here
string s = "";
while(n){
n--;
s.push_back('A' + n%26);
n /= 26;
... | ALGO | 0.999864 | 5.668089 |
6940da31-2f13-4aca-9cb1-ee31bd0711c2 | ps2dev/ps2sdk-ports | sdlmixer/src/smpeg/video/motionvector.cpp | /*
* motionvector.c --
*
* Procedures to compute motion vectors.
*
*/
#include "util.h"
#include "video.h"
#include "proto.h"
/*
Changes to make the code reentrant:
deglobalize curVidStream
Additional changes:
none
-<EMAIL> (Loring Holden)
*/
/*
*-------------------------------------... | ALGO | 0.99953 | 6.467131 |
f2aaf237-9469-4b0b-bde3-4f21d905c95f | zhzh2001/Learning-public | test/newtest3day1/src/std/fact/fact_multithread.cpp | #include<fstream>
#include<cmath>
#include<thread>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
const long double huge=1e4000L;
const int len=4000;
void calc(int l,int r,long double& ans,int& cnt)
{
ans=1.0L;
cnt=0;
for(int i=l;i<=r;i++)
{
ans*=i;
if(ans>huge)
{
cnt++;
ans/=h... | ALGO | 0.999347 | 3.496193 |
ad19f8b7-6338-47ef-97f2-dccfdc793c4a | Praveenkumar07007/DSA | stacks/postfixevaluation.cpp | #include<iostream>
#include<stack>
using namespace std;
int solve(int val1, int val2,char ch){
if(ch=='+') return val1 + val2;
else if(ch=='-') return val1 - val2;
else if(ch=='*') return val1 * val2;
else return val1/val2;
}
int main()
{
string s="79+4*8/3-";
stack<int> val;
for(int i=0;i<... | ALGO | 0.999896 | 4.017021 |
d70f1f3a-6f63-4ff5-9aaf-9b13fd2b1269 | Erfaniaa/introduction-to-programming-course | Homework5/9.cpp | #include <iostream>
using namespace std;
int main()
{
int n;
//baraye cheshmak zadan (emtiazi):
cout << "\033[5;32;40m";
//range text ham sabz mishe.
//tooye gnome-terminale man kar nakard. tooye xterm kar mikone vali.
cin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= i - 1; j++)
cout << " ";... | ALGO | 0.999699 | 3.983545 |
5a452af0-3b84-442c-a40a-0c40412abba7 | Unmesh100/OOPs_in_CPP | error-handling/error-handling.cpp | #include <iostream>
#include <iomanip>
class InsufficientFundsException : public std::exception {
public:
const char* what() const throw() {
return "Insufficient money for withdrawal";
}
};
class BankAccount {
private:
double balance;
public:
BankAccount(double initialBalance) : balance(initi... | TOOL | 0.876155 | 6.077132 |
d3309a59-4d86-489a-a738-68157f62497c | ishandutta2007/codeforces | intercept/normal/1457/D.cpp | #include<bits/stdc++.h>
using namespace std;
const int M=1e5+9;
int n;
int a[M],b[M],c[M];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i){
scanf("%d",&a[i]);
a[i]^=a[i-1];
}
if(n>64){
printf("1");
return 0;
}
for(int len=1;len<=n;++len){
for(int l=1;l<=n;++l){
int r=l+len;
if(r>n)break;
fo... | ALGO | 0.999954 | 3.559458 |
8e16a04f-9242-485a-8b61-18c053ccd6cc | BSzili/aros-stuff | unrar/blake2sp.cpp | #define PARALLELISM_DEGREE 8
void blake2sp_init( blake2sp_state *S )
{
memset( S->buf, 0, sizeof( S->buf ) );
S->buflen = 0;
blake2s_init_param( &S->R, 0, 1 ); // Init root.
for( uint i = 0; i < PARALLELISM_DEGREE; ++i )
blake2s_init_param( &S->S[i], i, 0 ); // Init leaf.
S->R.last_node = 1;
S->S[PA... | ALGO | 0.965704 | 4.584618 |
ca3ff028-1cdb-4515-9b39-a5197512a87a | BzhangURU/LeetCode-cpp | T488_Zuma_Game.cpp | /*Think about Zuma Game. You have a row of balls on the table, colored red(R), yellow(Y), blue(B), green(G), and white(W).
You also have several balls in your hand.
Each time, you may choose a ball in your hand, and insert it into the row (including the leftmost place and rightmost place).
Then, if there is a group ... | ALGO | 0.999834 | 4.920042 |
f8a60480-d066-42e2-b92e-9b0e4cce6f93 | sripadma-git/Leetcode-solutions | 0075-sort-colors/0075-sort-colors.cpp | class Solution {
public:
void sortColors(vector<int>& nums) {
vector<int>v(3);
for(int i:nums){
v[i]++;
}
int j = 0;
for(int i=0;i<3;i++){
while(v[i]){
nums[j] = i;
j++;
v[i]--;
}
}
... | ALGO | 0.999866 | 6.067625 |
3562c534-d0b2-4b80-b5c0-7d50b0913b4b | alvaro9rqc/programacion-competitiva | varios/racso/dynamic_p/b.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define endl '\n'
#define dbg(x) cerr << #x << " = " << (x) << endl;
#define raya cerr << " ==================== " << endl;
#define FOR(i, a, b) for (auto i = a; i < (b); ++i)
#d... | ALGO | 0.999767 | 4.416126 |
df738a98-ec8e-4f02-a48e-baf9063d8391 | youngsam-byun/my-notes.github.io | leetcode/src/test/java/Dynamic_Programming/629.K-Inverse-Pairs-Array/629.K Inverse Pairs Array.cpp | class Solution {
public:
int kInversePairs(int n, int k)
{
auto dp=vector<vector<int>>(n+1,vector<int>(k+1,0));
const int mod = pow(10, 9) + 7;
for (int i=1; i<=n; i++)
dp[i][0]=1;
for (int i=2; i<=n; i++)
for (int j=1; j<=k; j++)
... | ALGO | 0.999929 | 5.962344 |
ce043aa4-0b02-44eb-87d1-445b8c3b1041 | MEG46/ConversionBetweenTemperatureUnits | ConversionBetweenTemperatureUnits/C++/ConversionBetweenTemperatureUnitsc.cpp | #include <iostream>
using namespace std;
float celtofah(float c){
float result=(c*1.8)+ 32;
return result;
}
float celtokel(float c){
float result=c+273.15;
return result;
}
float celtoreu(float c){
float result=0.8*c;
return result;
}
float fahtocel(float c){
float result=5*(c-32) / 9.0;
... | TOOL | 0.949958 | 3.939357 |
c872689e-f9f6-4f9d-8ada-93f9cf9904d8 | AlexJMercer/DataStructures-Algorithms | LeetCode_Practice/C++_Solutions/Strings/_3_LongestSubstringWithoutRepeatChar.cpp | #include <iostream>
#include <map>
using namespace std;
class Solution {
public:
int lengthOfLongestSubstring(string s) {
if (s == "")
return 0;
int count = 0, j = 0, len = s.length();
map<char, int> mp;
for (int i=0; i < len; i++)
{
char c = s[i];... | ALGO | 0.999902 | 5.695486 |
45126cfd-f228-466f-ab8c-1a50716f6b97 | Rohit--Sharma/CompetitiveCoding | LeetCode/151_ReverseWordsInAString.cpp | #include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <stack>
#include <map>
#include <queue>
#include <list>
#include <algorithm>
using namespace std;
class Solution {
public:
void reverseWords(string &s) {
string res = "";
int i = 0, j = s.size() - 1... | ALGO | 0.999934 | 4.979641 |
9e73e534-ccec-4e8d-aa81-d39175be4858 | Ch-Lokesh/cp_practice | cf_147.cpp | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define int long long
void solve()
{
int n, x;
cin >> n >> x;
vector<pair<int, int>> p;
for (int i = 0; i < n; i++)
{
int a;
cin >> a;
p.push_back({a, i});
}
sort(p.begin(), p.end());
int start... | ALGO | 0.999967 | 4.476103 |
195f7f1c-2436-4021-8a5a-7e7420e25276 | snewptl/stationaryTraveller | old-memory/Codeforces Round #814 (Div. 2)/E.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int>pii;
typedef double db;
const int maxn=2e5+5;
const ll mod=998244353;
const double eps=1e-10;
int k,c[maxn],idx;
struct block{
ll a[105];
int dep,lst;
};
queue<block>q;
ll fib[105],sum,pre[105];
bool final(block cur){
so... | ALGO | 0.999958 | 4.11008 |
f43463c7-3511-4954-a607-8f5599eb0753 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_10290_3.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a=floor(sqrt(n));
cout<<a*a;
return 0;\\
11
| ALGO | 0.999579 | 4.312952 |
bcac77ba-73fa-4007-bf25-af02f75c75c3 | myeongjin1115/baekjoon | 2447.cpp | // https://www.acmicpc.net/problem/2447
#include <iostream>
using namespace std;
bool field[6561][6561] = {false};
void fillField(int n, int x, int y) {
if (n == 3) {
for (int i = y; i < n + y; i++) {
for (int j = x; j < n + x; j++) {
if (i != y + n / 3 || j != x + n / 3) field[i][j] = true;
}
}
}
e... | ALGO | 0.999985 | 4.052849 |
8166242b-4a13-4504-8367-bb6885663180 | swe-train/fineanmol__hacktoberfest2022 | Program's_Contributed_By_Contributors/C++ Programs/linkedlist/middlelist.cpp | #include<bits/stdc++.h>
using namespace std;
class Node {
public:
int val;
Node* next;
};
int main()
{
Node* head = new Node();
Node* one = new Node();
Node* two = new Node();
Node* three = new Node();
Node* four = new Node();
head->val = 5;
one->val = 2;
two->val = 3;
three->val = 1;
four->val = 4;... | ALGO | 0.99996 | 3.831954 |
03855ddd-090e-49e5-be6d-4e1c8ce69a81 | DeligientSloth/LeetCode | C++写题目/排列组合/78.Subsets.cpp | class Solution {
public:
vector<vector<int>> retS;
void subsetshelper(vector<int>& nums,int start,vector<int> B){
if(start>=nums.size()){
retS.push_back(B);
return;
}
subsetshelper(nums,start+1,B);
B.push_back(nums[start]);
subsetshelper(nums,start... | ALGO | 0.999959 | 6.092845 |
115b3516-bad4-40c4-a148-89688bbbaa1c | Daeon97/air_monitor | 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 |
abe51a14-93a8-4669-9fde-8fc74530f3db | manaovella/zysh101 | src/sdk/iowa/LowPassRoots.cpp |
/*
By Daniel Klostermann
Iowa Hills Software, LLC IowaHills.com
If you find a problem, please leave a note at:
http://www.iowahills.com/feedbackcomments.html
May 1, 2016
This code calculates the roots for the following filter polynomials.
Butterworth, Chebyshev, Bessel, Gauss, Adjustable Gauss, Inverse Chebys... | ALGO | 0.99977 | 3.950817 |
0131d603-53bc-4ba0-88b2-40fd844f05b5 | Rishi01Prince/DSA_with_Rishi | Stack/Next_Greater_Element.cpp | #include <bits/stdc++.h>
using namespace std;
void solve()
{
int n;
cin >> n;
int arr[n];
int ngrea[n];
stack<int> st;
st.push(n - 1);
ngrea[n - 1] = -1;
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
for (int i = n - 2; i >= 0; i--)
{
while ((st.empty... | ALGO | 0.999932 | 4.164387 |
6b3c7522-8ecc-4800-ba52-f45a83338918 | safrastyan/PuzzlingClarity | resources/cp/LeetCode/79. Word Search.cpp | class Solution {
public:
bool rec(std::vector<std::vector<char>>& a, std::vector<std::vector<char>>& mark, int r, int c, int len, const std::string& word)
{
if (len == word.size()) {
return true;
}
static int px[] = {0, 0, 1, -1};
static int py[] = {1, -1... | ALGO | 0.999926 | 6.128431 |
d8d0f5cb-0c89-4c33-a9d8-2074e70e9033 | TomaMata21/shoesapp | 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 |
50c0efa7-4d8a-4ba1-8971-dab150cf3b68 | Iskachun/randome-cpp-koder | 11.cpp | #include <iostream>
#include <string>
typedef long long ll;
using namespace std;
int main(){
int t; cin >> t;
string ans = "";
while (t--) {
string s; cin >> s;
int n = s.size();
int pos; cin >> pos;
int tot = n;
while (tot < pos) {
string mn = s;
... | ALGO | 0.999947 | 3.806597 |
218cd210-6340-46a2-83fc-5b65c1f7d322 | heavenMOJANG/ICPC | .history/2024牛客多校/牛客多校10/H_20240815162933.cpp | #pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define int long long
using namespace std;
constexpr int INF = 0x7fffffff;
constexpr int MOD = 998244353;
int fastPow(int a, int x) {
int res = 1;
while (x) {
if (x & 1) res = res * a % MOD;
... | ALGO | 0.999974 | 5.42485 |
9f19d997-f1a6-4182-8782-06c30422a8eb | vidsinghal/Cornucopia | HashEnabledLLVM/libcxx/test/std/algorithms/alg.nonmodifying/alg.count/count.pass.cpp | // <algorithm>
// template<InputIterator Iter, class T>
// requires HasEqualTo<Iter::value_type, T>
// constexpr Iter::difference_type // constexpr after C++17
// count(Iter first, Iter last, const T& value);
#include <algorithm>
#include <cassert>
#include "test_macros.h"
#include "test_iterators.h"
#if TE... | TEST | 0.957131 | 6.945495 |
278194c9-ef72-463b-83d1-ddf7315268b1 | Fahrizalky/activity2_095 | latihan3.cpp | #include <iostream>
using namespace std;
double P, L;
void input(){
cout <<"Masukkan Panjangnya = ";
cin >> P;
cout << "Masukkan Lebarnya = ";
cin >> L;
}
double proses(){
return P*L;
}
double proses2 (double a, double b){
return a*b;
}
void output(){
cout <<"Luasnya = " << proses();
... | TOOL | 0.968498 | 3.757539 |
590bb987-84be-4e94-a230-4769965d263d | DvDC13/OceanMarcher | main.cpp | #include <iostream>
#include <chrono>
#include <algorithm>
#include <limits>
#include "Image.h"
#include "Ray.h"
#include "Scene.h"
#include "Hit.h"
#include "Ocean.h"
Utils::Color3 envColor(const Utils::Vector3& direction, double frame, double threshold)
{
double t = (std::sqrt(std::abs(direction.getY())));
... | ALGO | 0.89687 | 5.562378 |
8fd4daa0-51cb-4b93-be5a-6d4b2a073f7f | shmodwalker/kazucoin | src/bitcoinrpc.cpp | #include "init.h"
#include "util.h"
#include "sync.h"
#include "ui_interface.h"
#include "base58.h"
#include "bitcoinrpc.h"
#include "db.h"
#include <boost/asio.hpp>
#include <boost/asio/ip/v6_only.hpp>
#include <boost/bind.hpp>
#include <boost/filesystem.hpp>
#include <boost/foreach.hpp>
#include <boost/iostreams/con... | WEB | 0.963869 | 4.438099 |
a82ac3b4-f817-45d0-aed6-267102628e34 | kingarthur11/leetcode | solution/0100-0199/0101.Symmetric Tree/Solution.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999966 | 6.873504 |
b71a2fed-22b6-465f-a39c-0848df5aac98 | keatoncscheible/cpp_101 | src/11__stl_algorithms/std_set_union.cpp | // File: std_set_union.cpp
// Description: This C++ program demonstrates the usage of the std::set_union algorithm from the C++ Standard Library.
// The std::set_union algorithm is used to compute the union of two sorted ranges and store the result in another range.
// In this example, we have... | ALGO | 0.999779 | 6.348944 |
f3d09c78-86bd-4225-b4a4-d3374cc32959 | mosteo/erlesim-docker | src/ardupilot/APMrover2/Steering.cpp | // -*- tab-width: 4; Mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*-
#include "Rover.h"
/*****************************************
* Throttle slew limit
*****************************************/
void Rover::throttle_slew_limit(int16_t last_throttle)
{
// if slew limit rate is set to zero then do not slew... | TOOL | 0.889459 | 5.878663 |
199658c4-c571-469f-84fc-95777a9147f8 | asquaree/Data-Structures | DP/ADITYA VARMA/Longest palindromic subsequence.cpp | //LONGEST PALINDROMIC SUBSEQUENCE
//X:
//Y:ABFCE
//aakashaggarwal
//aakanshagga
//choice-ok longest DP
#include<bits/stdc++.h>
using namespace std;
int recursion(string x,string y,int n,int m);
string topdown2(string x,string y,int n,int m);
string topdown1(string x,string y,int n,int m);
int main()
{
time_t sta... | ALGO | 0.99999 | 5.425342 |
1b73e885-06af-40bb-946a-a93c2741b4ea | ishandutta2007/codeforces | dotorya/normal/490/B.cpp | //*
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <time.h>
#include <math.h>
#include <string.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <char, char> pcc;
typedef pair <int, char> pic;
typedef set... | ALGO | 0.999937 | 3.458568 |
20a0dd0e-a8ed-4706-84f8-417fa6f60a92 | sritasngh/programming | codeforces/edu_cf_round-102/replacing_elements.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool flag=false;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--){
int n,d,temp;
cin>>n>>d;
int count=0;
vector<int>arr(n);
for (int i=0;i<n;i++){
cin>>arr[i];
}
sort(arr.... | ALGO | 0.999787 | 4.174124 |
afd2de64-40f3-46b7-b935-df247b70324d | cururux10/stadys | easywin32/week1_pratice2/RollingDice.cpp | #include "pch.h"
#include "tipsware.h"
#include "time.h"
#define _USE_MATH_DEFINES
#include "math.h"
NOT_USE_MESSAGE
#define MAX_TRY 10000
int main()
{
//srand(time(NULL));
SelectPenObject(RGB(0, 0, 0));
int hit = 0;
int miss = 0;
float relProb = 5.0 / 36.0;
float prob = 0;
// TODO
for (int i = 0; i < M... | ALGO | 0.988621 | 4.210978 |
58a41feb-9c6e-4e37-87e3-530e18ed320f | MasterIceZ/IMSO | icpc/cf/AngryMonk.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MxN = 100010;
int a[MxN];
inline void solve() {
int n, k;
cin >> n >> k;
int answer = 0ll;
for(int i=1; i<=k; ++i) {
cin >> a[i];
answer += 2 * (a[i] - 1);
}
answer += k - 1;
answer -= 2 * (*max_element(a + 1, a + k ... | ALGO | 0.999757 | 3.950136 |
eff1b64d-c5f0-4f44-93a2-5a379f2f3c6f | csienslab/icLibFuzzer | libcxx/test/std/containers/sequences/list/list.ops/merge_comp.pass.cpp | // <list>
// template <class Compare> void merge(list& x, Compare comp);
// If (&addressof(x) == this) does nothing; otherwise ...
#include <list>
#include <functional>
#include <cassert>
#include "test_macros.h"
#include "min_allocator.h"
int main(int, char**)
{
{
int a1[] = {10, 9, 7, 3, 1};
int a2[] ... | TEST | 0.916936 | 4.658856 |
ad2db254-449b-40c9-8bdb-9b85b7c18991 | alexandraback/datacollection | solutions_2458486_0/C++/aechavarria/d.cpp | using namespace std;
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
... | ALGO | 0.999564 | 3.577066 |
8434fa90-ca75-474b-92c9-bbaba6e25ed8 | mminos/Algorithm | baekjoon/1927.cpp | #include <bits/stdc++.h>
using namespace std;
int N, x;
vector<int> v;
int main(void)
{
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &x);
if (x == 0) {
if (v.empty()) printf("0\n");
else {
... | ALGO | 0.99999 | 4.27489 |
fbcccfb3-32d9-40c1-bea8-7d2d8f3111fd | khanadilgithub/GFG_DSA | Arrays/MaxSubarray.cpp | #include<iostream>
#include<math.h>
using namespace std;
//Naive solution
int maxsubarraySum(int arr[],int n)
{
int ans=arr[0];
for(int i=0; i<n; i++)
{
int curmx=0;
for(int j=i; j<n; j++)
{
curmx=curmx+arr[j];
ans=max(ans,curmx);
}
}
return... | ALGO | 0.999474 | 4.947748 |
b7c85424-1127-43a0-8d91-4ca2688a49c3 | Starry0/ACM | codeforces/494div3/c.cpp | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 5010;
int a[N], sum[N];
int main() {
int n, k, x;
scanf("%d%d",&n,&k);
for(int i = 1; i <= n; i ++) {
scanf("%d",&a[i]);
sum[i] = sum[i-1] + a[i];
}
double MAX = 0;
for(int i = 1; i <= n-k+1; i ++) {
for(int j = k+i-1; j <= n;... | ALGO | 0.998331 | 3.36408 |
3728241b-f960-4eb7-91f6-dc08af7c6161 | JonasGessner/ETH-Algolab-2019 | cantonal_courier.cpp | #include <iostream>
#include <vector>
// BGL include
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/push_relabel_max_flow.hpp>
using namespace std;
// Graph Type with nested interior edge properties for flow algorithms
typedef boost::adjacency_list_traits<boost::vecS, boost::vecS, boost::directedS> ... | ALGO | 0.999761 | 4.820769 |
f22967b2-f5e9-4b6a-b6b9-1448f4ff7c12 | BhargavaRam123/arraysproblems | twopointer.cpp | #include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<int> arr{1, -3, 2, -1, 5};
int start = 0, end = arr.size() - 1;
// for (int i = 0; i <= end;)
// {
// if (arr[i] < 0)
// {
// swap(arr[i], arr[start]);
// i++;
// start++;
... | ALGO | 0.999995 | 4.661443 |
38d126c5-c774-464b-ad3d-95f1949668c3 | Rajatbr22/Vector | uniqueNum.cpp | #include<iostream>
#include<vector>
using namespace std;
void unique(vector<int>& v1){
for(int i=0; i<v1.size(); i++){
bool flag = true;
for(int j=0; j<v1.size(); j++){
if(j == i) continue;
if(v1[i] == v1[j]){
flag = false;
break;
... | ALGO | 0.999478 | 4.794751 |
da77bcd4-1acf-430a-a035-afea3610c499 | ishandutta2007/codeforces | gary2005/normal/1508/D.cpp | /*
{
######################
# Author #
# Gary #
# 2021 #
######################
*/
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
... | ALGO | 0.999982 | 3.680656 |
ca207e82-7e42-4754-8d9d-787010b94ee6 | ishandutta2007/codeforces | atreus/normal/1023/B.cpp | #include <iostream>
#include <queue>
#include <stack>
#include <cstdlib>
#include <vector>
#include <cstring>
#include <cmath>
#include <unordered_set>
#include <map>
#include <deque>
#include <unordered_map>
#include <fstream>
#include <set>
#include <algorithm>
#include <iomanip>
#define fin cin
#define fout cout
#de... | ALGO | 0.999938 | 3.55606 |
22dd00db-b1a5-4e25-849e-118124c85621 | nikhil697/Daily-Leetcode | 442-find-all-duplicates-in-an-array/find-all-duplicates-in-an-array.cpp | class Solution {
public:
vector<int> findDuplicates(vector<int>& nums) {
vector<int> newone;
unordered_map<int,int>map;
for(auto i:nums){
map[i]++;
}
for(auto i:map){
if(i.second==2){
newone.push_back(i.first);
... | ALGO | 0.999944 | 5.859947 |
159a0b99-1ecf-47ae-aee2-60446db23a59 | flutterdartsece2027/flutter-final-projects-mohanprasathcsbs | 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 |
e0affcb3-7a66-443f-965a-87cc24d7b52a | mostpalon3/DSA | Leetcode/9_Palindrome.cpp | #include <climits>
#include <iostream>
class Solution {
public:
bool isPalindrome(int x) {
int min = INT_MIN;
int max = INT_MAX;
long long rev = 0;
int temp = x;
while (temp > 0) {
int ld = temp % 10;
rev = rev * 10 + ld;
temp /= 10;
... | ALGO | 0.999683 | 5.827034 |
1c31e72b-5887-47c3-9b08-5beb6dee0caa | ankushsingh24/Striver-SDE-Sheet | Binary Search/nth-root-of-a-number.cpp | int NthRoot(int n, int m)
{
// Write your code here.
int ans = -1;
int s = 1, e = m;
while(s <= e)
{
int mid = (e + s) / 2;
long long x = 1;
for (int i = 1; i <= n; i++)
{
x = x * mid;
if (x > 1LL * m)
break;
}
if (x == 1LL * m)
{
ans = mid;
... | ALGO | 0.999997 | 5.393506 |
ef0acf7b-5113-4175-9e4f-5f441c415d18 | peterschussheim/programming_principals_practice | src/ch23/ex2.cpp | // Add a multimap and have it hold subjects. Let the program take an input
// string from the keyboard and print out every message with that string as
// its subject.
#include <iostream>
#include <map>
#include <string>
#include "Mail.h"
//------------------------------------------------------------------------------... | TOOL | 0.876708 | 5.484878 |
ce12dfe0-5bc4-4a5a-8b72-eac90e107d06 | kshitijanand36/Important-programs | shortest_path_bfs_dfs.cpp | // Created by Kshitij Anand NSIT
#include <bits/stdc++.h>
//#include <ext/numeric>
//using namespace __gnu_cxx;
using namespace std;
#define int long long
#define pb push_back
#define P pair<int,int>
#define F first
#define S second
#define vi vector<int>
#define vc vector<char>
#define vb vector<bool>
#define all(x)... | ALGO | 0.999768 | 4.688641 |
a838024d-716b-4a92-be2f-c2753097a1aa | Tanbir-Hasan-247/competitive-programming | B_1_The_Strict_Teacher_Easy_Version.cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define sortAsc(a) sort(a.begin(), a.end())
#define sortDesc(a) sort(a.begin(), a.end(), greater<int>())
#define ll long long
#define YES "YES\n"
#define NO "NO\n"
#def... | ALGO | 0.999837 | 3.923057 |
8b963c3b-04ca-4ee0-8ee5-eb894c9854b5 | Saiyangodgoku1/start-450 | Step-03(Binary Search)/2d/05.median_of_row_wise_sorted.cpp | /*
QUESTION:
Given a 2D grid of integers mat, find the median of the matrix. Each row of the matrix is sorted in non-decreasing order.
Example:
Input:
matrix = [
[1, 3, 5],
[2, 6, 9],
[3, 6, 9]
]
Output:
5 // The median of the matrix is 5.
APPROACH:
1. Initialize low to INT_MAX and high to INT_MIN.
2. Adjust lo... | ALGO | 1 | 7.123593 |
ccf87bc4-4ca3-4a6c-9e6f-cc64bc40298d | mirceamaierean/coding-solutions | Infoarena/Arhiva de Probleme/iepuri2.cpp | #include <fstream>
#include <vector>
#include <bitset>
std::ifstream fin("iepuri2.in");
std::ofstream fout("iepuri2.out");
const int NMAX = 102;
const int MOD = 30011;
std::vector<int> g[NMAX];
int v[NMAX], dp[NMAX][NMAX], n, k, a, b;
std::bitset<NMAX> leaf;
void solve(int node)
{
for (int i = 1; i <= k; ++i)
... | ALGO | 0.999926 | 4.10454 |
833fbe34-82d3-4b8b-bdfa-fe4a4da3f17a | sofiarovaris/Maratona-2022 | Exercícios/numero_primo.cpp | #include <bits/stdc++.h>
using namespace std;
int64_t is_primo(int64_t n, int64_t d) {
if(d > 1) {
int64_t a = !(n%d);
//cout << "Divisao por " << d << ": " << a << endl;
if(a) {
if(d != n && d != 1) {
return 0;
}
}
return is_primo(n,... | ALGO | 0.999686 | 4.21893 |
756eeacd-3199-4fe9-a52f-8f528ce6b34c | santiortizm/Kioskito-JefeCocina | 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 |
c19ec5c8-71d1-46c6-8222-f8ba8e9d8bb4 | alalbiol/OpenCV_RTSP | modules/cudaoptflow/src/farneback.cpp | #include "precomp.hpp"
using namespace cv;
using namespace cv::cuda;
#if !defined HAVE_CUDA || defined(CUDA_DISABLER)
Ptr<FarnebackOpticalFlow> cv::cuda::FarnebackOpticalFlow::create(int, double, bool, int, int, int, double, int) { throw_no_cuda(); return Ptr<FarnebackOpticalFlow>(); }
#else
#define MIN_SIZE 32
/... | ALGO | 0.999414 | 7.628543 |
f6ab59bf-6f62-420e-8dd8-1165bce888e8 | whatalnk/cpsubmissions | atcoder/cpp/abc128/abc128_a/6123004.cpp | // Contest ID: abc128
// Problem ID: abc128_a ( https://atcoder.jp/contests/abc128/tasks/abc128_a )
// Title: A. Apple Pie
// Language: C++14 (Clang 3.8.0)
// Submitted: 2019-06-26 00:50:59 +0000 UTC ( https://atcoder.jp/contests/abc128/submissions/6123004 )
#include <algorithm>
#include <iostream>
#include <queue>
#... | ALGO | 0.99849 | 4.006843 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.