uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
ff81a5d3-2441-4600-920c-50b27b0fb8be | ahmedsaed/MUST-CS | CS101/week 11/Sheet 8/question5.cpp | #include <iostream>
using namespace std;
int main()
{
int count;
int alpha[5];
alpha[0] = 5;
for (count = 1; count < 5; count++)
{
alpha[count] = 5 * count + 10;
alpha[count - 1] = alpha[count] - 4;
}
cout << "List elements: ";
for (count = 0; count < 5; count++)
... | ALGO | 0.998534 | 3.00385 |
3d2708fe-40be-40c7-8ba2-6d095b4bde80 | qixianbd/partition_wqm | da_cfg.cpp | #include "da_cfg.h"
#include "spmt_utility.h"
#include "misc.h"
#include "min_cut_fun.h"
/*
*da_cfg::da_cfg() --- constructor of cfg contains data analysis
*/
da_cfg::da_cfg(tree_block *b, boolean build_blocks, boolean break_at_call,
boolean keep_layout) :
cfg(b, build_blocks, break_at_call, keep_layout) {
liv... | ALGO | 0.91313 | 3.435442 |
a936c967-d94a-4827-854e-38663800debc | Narendra-GTHBb/KELAS-X | CPP/2024-09-04-2/main.cpp | #include <iostream>
void printTriangle (int rows) {
for (int i = 1; i <= rows; ++i) {
// Print spaces
for (int j = 1; j <= rows - i; ++j) {
std::cout << " ";
}
// Print stars
for (int k = 1; k <= (2 * i - 1); ++k ) {
std::cout <<... | ALGO | 0.994414 | 4.967872 |
e9cef70d-7098-461e-b8c0-eaf80df76ace | Sinjiniroy15/-6Companies30Days | unsortedsubarray.cpp | #include<bits/stdc++.h>
using namespace std;
class Solution {
public:
int findUnsortedSubarray(vector<int>& nums) {
int n = nums.size();
int end = -1,start =-1;
int maxi = nums[0], mini = nums[n-1];
for(int i=1;i<n;i++)
{
maxi = max(maxi, nums[i]);
if(nu... | ALGO | 0.999942 | 5.552428 |
260ab329-dd49-4b64-bcf2-4c8fddf29208 | ozkalt/NeredeYesek | main.cpp | #include <iostream>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <stdio.h>
#include "mysql_connection.h"
#include <cppconn/driver.h>
#include <cppconn/exception.h>
#include <cppconn/resultset.h>
#include <cppconn/statement.h>
using namespace std;
class cafe{
public:
int id; ... | DATA | 0.963801 | 3.440264 |
3c083604-2ce5-4ccf-a993-466af34b965e | ishandutta2007/codeforces | depth_first_search/normal/1190/C.cpp | #include<bits/stdc++.h>
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int&
#define I inline
#define W while
#define N 100000
using namespace std;
int n,k,a[N+5],Mn[2],Mx[2],lst[N+5][2],nxt[N+5][2];
int main()
{
... | ALGO | 0.999947 | 3.147862 |
1d99776f-425d-4154-a666-97ac50419da8 | roger21gm/GOS | src/api/encoders/glucoseapiencoder.cpp | #include "glucoseapiencoder.h"
#include <iostream>
using namespace Glucose;
GlucoseAPIEncoder::GlucoseAPIEncoder(Encoding * enc) : APIEncoder(enc){
this->lastVar = 0;
this->lastClause = -1;
s = new SimpSolver();
s->use_simplification = false;
s->use_elim = false;
s->verbosity=0;
s->showModel=false;
s->vbyte... | ALGO | 0.917378 | 5.722744 |
e3c8e8b6-482c-4df7-9668-662e56959227 | CDPS/Competitive-Programming | Codeforces/Practice/307092 B Number of Smaller.cpp | #include <bits/stdc++.h>
using namespace std;
const int oo = 2e9;
int a[100001],b[100001];
int n,m,x;
int main(){
cin >> n >> m;
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<m;i++) cin >> b[i];
a[n] = b[m] = oo;
int i = 0, j = 0;
while(i <n || j <m ){
if(a[i] < b[j] ) i++;
... | ALGO | 0.999944 | 3.677495 |
ecda2166-628d-4629-974b-d1d03d5759ce | falekunal/DSA | codes/two_1d_vector_to_2D_vector.cpp | #include <iostream> // for input output function
#include<vector> // for creating vector
#include <algorithm> //for sorting
using namespace std;
int main() {
// declaring size of 2d vector
int num_row = 4;
int num_col = 2;
// declaring first one dimesional vector
vector<int>vect1 {3,4,5,6};
... | ALGO | 0.999231 | 5.066706 |
f6523d51-8c36-43ee-b62d-64b06e4c50e6 | webappsdk/granada | Release/src/granada/util/file.cpp | #include "granada/util/file.h"
namespace granada{
namespace util{
namespace file{
PropertyFile::PropertyFile(const std::string& file_path){
properties_ = ParseConfigurationFile(file_path);
}
const std::string PropertyFile::GetProperty(const std::string& name){
auto it = proper... | TOOL | 0.889809 | 6.310103 |
00b870b3-bd1a-4087-8ace-39f90c38d8f7 | rahulwilful/dataStructuresInCpp | 23.HashMap/HM-manual-implimantation.cpp | #include<bits/stdc++.h>
using namespace std;
template<typename T>
class mapnode{
public:
string key;
T value;
mapnode* next;
mapnode(string key , T value)
{
this->value = value;
this->key = key;
next = NULL;
}
~mapnode()
{
delete next;
}
};
temp... | ALGO | 0.997922 | 4.153135 |
4ed1a684-3347-43bd-bdd3-115aa820839c | gulshanrana10/Leetcoding | 34-find-first-and-last-position-of-element-in-sorted-array/find-first-and-last-position-of-element-in-sorted-array.cpp | class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
vector<int> ans = {-1, -1};
if (nums.empty()) {
return ans;
}
int n = nums.size(), l = 0, r = n - 1;
while (l < r) {
int m = l + (r - l) / 2;
if (nums[m] < targ... | ALGO | 0.999959 | 6.664359 |
dcffc575-a3cd-4bc3-900e-e64e577d1fe7 | MalibuCoinDeveloper/MalibuCoin | src/zerocoin/Accumulator.cpp | /**
* @file Accumulator.cpp
*
* @brief Accumulator and AccumulatorWitness classes for the Zerocoin library.
*
* @author Ian Miers, Christina Garman and Matthew Green
* @date June 2013
*
* @copyright Copyright 2013 Ian Miers, Christina Garman and Matthew Green
* @license This project is... | TOOL | 0.91686 | 6.519381 |
a26da520-e4be-44fe-b943-eef6e665d1a9 | vickykumar123/Data-Structure-And-Algorthim | Queue/first_letter_to_appear_twice.cpp | /*
Input: s = "abccbaacz"
Output: "c"
Explanation:
The letter 'a' appears on the indexes 0, 5 and 6.
The letter 'b' appears on the indexes 1 and 4.
The letter 'c' appears on the indexes 2, 3 and 7.
The letter 'z' appears on the index 8.
The letter 'c' is the first letter to appear twice, because out of all the letters ... | ALGO | 0.999895 | 5.556585 |
11bbd3ec-83ab-4890-8dfe-c714d42f8053 | huah1600/labbe4 | labbe4/MailBox.cpp | #include "MailBox.h"
#include <algorithm>
MailBox::MailBox(size_t size) :mail(size)
{
}
void MailBox::push(const Email& email)
{
mail.push_back(email);
}
std::vector<Email>::iterator MailBox::begin()
{
return mail.begin();
}
std::vector<Email>::iterator MailBox::end()
{
return mail.end();
}
void MailBox::sortWh... | TOOL | 0.895594 | 4.802639 |
aff1b8a4-5669-475a-9217-9cdd604ed257 | DenizIsikli/LeetCode-CPP | Problemsets/Problems/MaximumStrongPairXORI.cpp | #include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
int maximumStrongPairXor(vector<int>& nums) {
int ans=0;
sort(nums.begin(),nums.end());
for(int i=0;i<nums.size();i++){
for(int j=i;j<nums.size()&&nums[j]<=2*nums[i];j++){
ans=m... | ALGO | 0.999847 | 5.207651 |
8e7119c5-ad27-4c5f-b893-0b5ada77600c | Eileen-Yu/cheatsheet | graph/min-cost-to-connect-all-points.cpp | // https://leetcode.com/problems/min-cost-to-connect-all-points/
// 1. Prim's algorithm to find the Minimum Spanning Tree
// (min cost to connect all nodes)
// step:
// 1. push start node into pq
// 2. select the unvisited node with the min cost from pq
// 3. if it's not visited:
// 3.1 mark it as visited, and add... | ALGO | 0.999941 | 6.112068 |
812de10b-2028-46b2-beb5-59275f6955aa | ku-ra/leetcode-solutions | leetcode-solutions/11_container_with_most_water_unfinished.cpp | #include "template.h"
class Solution {
public:
int maxArea(vector<int>& height) {
}
}; | ALGO | 0.999698 | 6.57644 |
cb2fd6a2-fc25-4027-b636-a01ac206feee | Wayne1895/C_practice | vector_max.cpp | #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
vector <int> array;
cout<<"輸入數字個數"<<endl;
int n;
cin>>n;
cout<<"輸入"<<n<<"個數字"<<endl;
for(int i = 1;i<=n;i++){
int num;
cin>>num;
array.push_back(num);
}
vector<int>::iter... | ALGO | 0.999092 | 4.152584 |
28afc07c-03a8-49fe-8206-029819efca36 | jackkolokasis/teraheap | jdk17u067/src/hotspot/share/utilities/copy.cpp | #include "precompiled.hpp"
#include "utilities/copy.hpp"
#include "runtime/sharedRuntime.hpp"
#include "utilities/align.hpp"
#include "utilities/copy.hpp"
// Copy bytes; larger units are filled atomically if everything is aligned.
void Copy::conjoint_memory_atomic(const void* from, void* to, size_t size) {
uintptr_t... | TOOL | 0.949375 | 7.537454 |
c3dd3cd3-f36d-4ec6-9320-9bfb3099c142 | MrRun2020/UE426 | Engine/Source/Runtime/Engine/Private/Rendering/BurleyNormalizedSSS.cpp | /*=============================================================================
BurleyNormalizedSSS.cpp: Compute the transmition profile for Burley normalized SSS
=============================================================================*/
#include "Rendering/BurleyNormalizedSSS.h"
// estimated from the sampling i... | ALGO | 0.953861 | 4.372484 |
5efd1f48-262d-497c-85e4-f92329cf7211 | rdkcentral/subtec-app | test/utils/utils.cpp | #include "utils.h"
/**
* @brief Extracts filename from given file path
*
* This function takes a file path as input and returns the filename.
* It handles both forward slashes ('/') and backslashes ('\')
* as path separators.
*
* @param filePath Full file path
* @return A std::string containing the filename. ... | TOOL | 0.88508 | 6.304338 |
442e8296-26de-4d47-af2c-da38d5eee654 | dibendughosal/CPP | findGCD.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int num1,num2;
cin>>num1>>num2;
for(int i = min(num1, num2);i>1;i--){
if (num1%i==0 && num2%i==0)
{
cout<<"The GCD of "<<num1<<" and "<<num2<<" is "<<i<<endl;
break;
}
}
} | ALGO | 0.999955 | 4.730841 |
593e722b-a0e9-4309-a007-af0a90bd164a | SiddiqueSahb/DSASeries | DSA Series/Intro/swapAltinArray.cpp | // Online C++ compiler to run C++ program online
#include <iostream>
#include<math.h>
using namespace std;
void swapAlternate(int arr[],int n){
for(int i = 0;i<n;i+=2){
if(i+1<n){
swap(arr[i],arr[i+1]);
}
}
}
void printArray(int arr[],int n){
for(int i = 0;i<n;i++){
cout<<arr[i]<<" ";
... | ALGO | 0.999826 | 4.849727 |
b914ef7d-f8fc-41d4-8905-13f27fccaa5b | sarvex/leetcode-cyber | solution/2000-2099/2067.Number of Equal Count Substrings/Solution.cpp | class Solution {
public:
int equalCountSubstrings(string s, int count) {
int ans = 0;
int n = s.size();
int cnt[26];
for (int x = 1; x < 27 && count * x <= n; ++x) {
int m = count * x;
memset(cnt, 0, sizeof cnt);
int y = 0;
for (int i =... | ALGO | 0.999987 | 5.535226 |
c14606ec-845a-4e0c-9945-250fd6af79b8 | josuerom/Competitive-Programming | Contests/CodeForces/Solved-Problems23/1713D_Tournament_Countdown.cpp | /**
* author: josuerom
* created: 29/11/22 19:56:29
**/
#include <bits/stdc++.h>
#define sz(a) ((int)a.size())
using namespace std;
int query(int &a, int &b) {
cout << "? " << a << " " << b << endl;
int cmp; cin >> cmp;
return cmp;
}
void ans(int &x) {
cout << "! " << x << endl;
}
void solve() {
... | ALGO | 0.999819 | 4.442618 |
a33fd152-0a5e-4d59-94da-4f38ace67a83 | SAKTHISPARROW/Placement-Preparation | Leet-Coder/Array/buysell.cpp | #include <iostream>
#include <vector>
#include <climits>
using namespace std;
int main()
{
vector<int> prices = {7, 1, 5, 3, 6, 4};
int n = prices.size();
int minp = INT_MAX, pro = 0;
for (int i = 0; i < n; i++)
{
minp = min(minp, prices[i]);
pro = max(pro, prices[i] - minp);
... | ALGO | 0.999483 | 3.614813 |
fb39d206-7b60-498c-9938-704540a4f562 | Saurabh19091/c-program | sum.cpp | #include <iostream>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int sum=0;
for(int i=n;i<=m;i++){
sum=sum+i;
}
cout<<sum;
return 0;
}
| ALGO | 0.999716 | 3.286693 |
ecbaa370-9eef-4e54-9190-51420c37831a | Anikcsejnu/cpp-problem-solving | C++/Devskill/15B.cpp |
#include <bits/stdc++.h>
using namespace std;
int main()
{
set<string>s;
string str;
int m, n;
cin>>m>>n;
for(int i = 0;i<m+n;i++)
{
cin>>str;
s.insert(str);
}
int l = s.size();
if(m > n)
{
printf("YES\n");
}
else if(m==n)
{
if(l%2=... | ALGO | 0.999937 | 3.72197 |
1c5a9c8e-50e9-4464-a766-41dc4cfa6172 | iamzzj/JniEnvCpp | cpp/main_cc10.cpp | #include <iostream>
#include <map>
#include <vector>
using namespace std; //命名空间，java中的内部类
class Person {
private:
string name;
public:
Person(const string &name) : name(name) {
cout << "Person(const string &name)" <<endl;
this->name = name;
}
~Person(){
cout << "~Person" <<end... | TOOL | 0.9301 | 3.999509 |
70010749-b8cf-406a-999f-6ebd8108ab0f | Anggerdhismakusuma/Algorithm-and-Programming | Binary Search/A.cpp | #include <stdio.h>
int binarySearch(int arr[], int n, int target) {
int left = 0, right = n - 1, result = -1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] == target) {
result = mid;
right = mid - 1;
} else if (arr[mid] < target) {
... | ALGO | 0.999986 | 5.05662 |
48624349-e20c-451d-a7b3-ea5369812259 | ishandutta2007/codeforces | aropan/normal/1609/F.cpp | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define sz(v) ((int)(v).size())
#define vec1d(x) vector<x>
#define vec2d(x) vector<vec1d(x)>
#define vec3d(x) vector<v... | ALGO | 0.999931 | 4.160603 |
4131fb18-0634-4633-a505-8acb2716141e | kevinmj12/Algorithm_BOJ | 백준(풀이용)/Gold5/2565_전깃줄.cpp | #include <iostream>
#include <algorithm>
using namespace std;
#define MAX 501
int line[MAX];
int dp[MAX];
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int numLines;
cin >> numLines;
// line, dp 초기화
for (int i = 1; i < MAX; i++){
line[i] = 0;
dp[i] =... | ALGO | 0.999619 | 4.625902 |
8cf2d154-60a2-49ac-9716-9914b670ff14 | Zapryanovx/FMI_2023_Introduction_to_Programming | 00_other_repos_tasks/exam_example_tasks_2020/08_reverse_part_of_array.cpp | //#include <iostream>
//
//void ConvertArr(long arr[], long S, long E);
//
//int main()
//{
//
// long arr[5] = {1, 2, 3, 4, 5};
//
// ConvertArr(arr, 2, 4);
//
// for (int i = 0; i < 5; i++)
// {
// std::cout << arr[i] << " ";
// }
// std::cout << std::endl;
//
// return 0;
//}
//
//void ConvertArr(long arr[], long ... | ALGO | 0.998139 | 4.332421 |
71bf4ff7-f934-445f-a06c-19566ce3dd29 | thepluck/CP-Training | Onlinejudges/oj.uz/JOI21_escape_route/escape_route.cpp | #include <bits/stdc++.h>
#include "escape_route.h"
namespace {
using namespace std;
using ll = long long;
template<class X, class Y>
bool cmin(X& a, const Y &b) {
return a > b ? a = b, 1 : 0;
}
const int N = 95;
using item = pair<ll, int>;
ll dis1[N][N][N];
vector<int> a... | ALGO | 0.997392 | 4.93996 |
7528fdc0-a49b-417c-98c3-d210eb6a7fd9 | jeterlab/ionic-mechanisms-underlying-bistability-in-spinal-motoneurons | boost/libs/graph/example/interior_pmap_bundled.cpp | #include <boost/config.hpp>
#include <iostream>
#include <algorithm>
#include <boost/graph/adjacency_list.hpp>
#include <boost/property_map/property_map.hpp>
#include <string>
using namespace std;
using namespace boost;
/*
Interior Property Map Basics
An interior property map is a way of associating properties
... | ALGO | 0.99977 | 5.051438 |
3706f644-495e-44af-bf48-df9e3c62ff0a | itlezy/eMule-mods-archive | eMule-0.50a-MorphXT_v12.3_src_and_libs/srchybrid/SearchList.cpp | #ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
#define SPAMFILTER_FILENAME _T("SearchSpam.met")
#define STOREDSEARCHES_FILENAME _T("StoredSearches.met")
#define STOREDSEARCHES_VERSION 1
///////////////////////////////////////////////////////////////////////////////
// ... | TOOL | 0.872803 | 5.516966 |
1a47dc86-b281-4a72-8b24-a33d677c7276 | triSYCL/sycl | libcxx/benchmarks/algorithms/lower_bound.bench.cpp | #include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include "common.h"
namespace {
template <class ValueType>
struct LowerBound {
size_t Quantity;
mutable std::mt19937_64 rng { std::random_device{}() };
void run(benchmark::State& state) const {
runOpOnCopies<ValueType>(state, Quan... | TEST | 0.984332 | 5.404838 |
81b643bc-9b4e-4704-bf77-dd4784c9e6f7 | Kubek-3/shop_app | shop_app/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.99841 | 6.76073 |
7c2c833f-4a43-457d-9b19-2cdc04e1a2ac | RadonX/Computer-Animation | Theme1Milestone1/include/eigen/doc/snippets/SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType.cpp | MatrixXd X = MatrixXd::Random(5,5);
MatrixXd A = X + X.transpose();
cout << "Here is a random symmetric 5x5 matrix, A:" << endl << A << endl << endl;
SelfAdjointEigenSolver<MatrixXd> es(A);
cout << "The eigenvalues of A are:" << endl << es.eigenvalues() << endl;
cout << "The matrix of eigenvectors, V, is:" << endl << ... | ALGO | 0.99984 | 3.056724 |
4ef87d0a-45c3-463d-9b02-6a278e6fa4f4 | JackLee1230/Database | common.cpp | #include <climits>
#include <vector>
#include "common.h"
#include "Field.h"
#include "physicalOP.h"
#include "Tuple.h"
#include "Relation.h"
Qtree::Qtree( enum Qtree_TYPE t, Qtree *p){
type = t;
left = NULL;right = NULL;parent = p ;
}
Qexpression::Qexpression(){
type = Qexp_ILLEGAL ;
str = "";
number = INT_MIN ;
... | TOOL | 0.921502 | 3.890109 |
10dbf03b-1da1-4df4-a82b-ef78b3362cb0 | GustavoPereira-Dev/Estudos-em-Cpp | Recursiva/PesquisaBinaria.cpp | #include <iostream>
using namespace std;
void lerVetor(int vt[], int i);
int pesquisaBinaria(int vt[], int inicio, int fim, int vProc);
void bSort1(int vt[], int i);
void bSort2(int vt[], int i, int j);
int main() {
int vt[20] = {0};
lerVetor(vt, 19);
int vProc;
cout << "Digite o valor procurado ... | ALGO | 0.999772 | 4.920382 |
f0f5a40e-eb38-4df6-842c-5ef354991019 | GuacheSuede/MSSubmission1234567890 | submission/bollinger/boost_1_69_0/libs/graph/test/dijkstra_heap_performance.cpp | // Authors: Douglas Gregor
// Andrew Lumsdaine
#ifndef BOOST_GRAPH_DIJKSTRA_TESTING_DIETMAR
# define BOOST_GRAPH_DIJKSTRA_TESTING
#endif
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/dijkstra_shortest_paths_no_color_map.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boo... | TEST | 0.943326 | 6.536414 |
62c8997a-c4c0-4245-939e-20b65c74b749 | umairgillani93/cses-problemset | reps.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int c;
int best;
c = 0;
best = 0;
cin >> s;
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == s[i + 1]) {
c += 1;
}
else {
best = max(c, best);
c = 0;
}
}
best = max(c, best) + 1;
cout << best << ... | ALGO | 0.99988 | 3.791345 |
cb3cae82-2c6f-42d0-a0e3-3789571b2a95 | Kausthubdhar/Leetcode_Solutions | Medium/39-Combination-Sum.cpp | class Solution {
public:
void fun(int idx,vector<int> temp, vector<int>& candidates,int sum, int target,vector<vector<int>>& res){
if(idx >= candidates.size() || sum > target) return;
if(sum == target){
res.push_back(temp);
return;
}
temp.push_back(candidates[... | ALGO | 0.999986 | 6.614412 |
2820834f-61e8-4677-8daa-98013f842cc3 | Zacharoni/Senior-Design-ALPR | src/openalpr/result_aggregator.cpp | #include "result_aggregator.h"
using namespace std;
using namespace cv;
namespace alpr
{
ResultAggregator::ResultAggregator(ResultMergeStrategy merge_strategy, int topn, Config* config)
{
this->prewarp = new PreWarp(config);
this->merge_strategy = merge_strategy;
this->topn = topn;
this->config =... | ALGO | 0.996512 | 4.867614 |
265c2f76-7d23-4bde-b55d-779c5ff359cb | rsotani/AtCoder | Others/codeFlyer/OpenContest/A.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int ans = 100;
for (int i=0; i<N; i++){
int p,count = 0;
cin >> p;
while (p){
if (p%10 != 0) break;
count++;
p /= 10;
}
ans = min(count,ans);
}
cout << ans << endl;
}
| ALGO | 0.999412 | 4.02451 |
5c2155d1-8f41-40be-8b93-9daf3c0130be | cubercsl/The-road-to-ACMer | Codeforces/915/915D.cpp | #include <bits/stdc++.h>
using namespace std;
#define clr(a, x) memset(a, x, sizeof(a))
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define X first
#define Y second
#define fastin \
ios_base::sync_with_stdio(0); \
cin.tie(0);
typedef long long ll;
typedef long double ld;
typed... | ALGO | 0.999986 | 5.035259 |
eee2a309-4974-423b-a260-4bfc6a62c74b | jaimit25/Cpp_dsa | Apna College/KadeneAlgo.cpp | #include <iostream>
using namespace std;
int maxSumSubArray(int A[], int n)
{
int maxSum = 0;
int currSum = 0;
for (int i = 0; i < n; i++)
{
currSum = currSum + A[i];
if (currSum > maxSum)
{
maxSum = currSum;
}
if (currSum < 0)
{
currSum = 0;
}
}
return maxSum;
}
int main()
{
int A[] = ... | ALGO | 0.999533 | 5.712468 |
1f1b40c1-838d-4029-9ca2-d3c8a136ff00 | Dfkuaid/My_Files | cpp/Competition/ZROI/21NOIP/04/b.cpp | #define DEBUG
#include <bits/stdc++.h>
#define ll long long
#define mset(l, x) memset(l, x, sizeof(l))
using namespace std;
const int N = 4010;
const int INF = 0x3fffffff;
template <typename T> inline void read(T &x) {
x = 0; int f = 1; char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = ... | ALGO | 0.999984 | 3.935497 |
6055ef2f-0baf-4a50-a5a6-3bd51a8209b1 | Pan-HD/Pro_Graph_kLab_Main | Backup_Files/Files_1007/kiru.cpp | #include <opencv2/opencv.hpp>
#include <iostream>
#include <iomanip> // for std::setprecision
/*
Function: 精度と再現率の調和平均を取ることで、両者のバランスを取った指標として機能します。
調和平均を取ることで、片方だけが高くてもF値は高くなりません。
*/
double calculateF1Score(double precision, double recall) {
if (precision + recall == 0) return 0.0;
return 2.0 * (precision * re... | TOOL | 0.957394 | 5.547379 |
5d8f897b-83fb-446b-9dd4-a1b1879dd9b8 | Dan-code-cmd/GameEngine | DemoEngine/DemoEngine/Middleware/bullet3-master/Extras/ConvexDecomposition/splitplane.cpp | #include "float_math.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <float.h>
#include <math.h>
// http://codesuppository.blogspot.com
//
// mailto: <EMAIL>
//
// http://www.amillionpixels.us
//
#include "splitplane.h"
#include "ConvexDecomposition.h"
#include "cd_vector.h"... | ALGO | 0.998568 | 6.29748 |
f3164acb-d071-4a04-bf62-61dced03096b | ErenBeykent/Tree-List-Pointers | MergeSort.cpp | #include <iostream>
using namespace std;
void divide(int dizi[],int l,int m,int r){
int n1=m-l+1;
int n2=r-m;
int L[n1];
int R[n2];
for(int i=0;i<n1;i++){
L[i]=dizi[l+i];
}
for(int j=0;j<n2;j++){
R[j]=dizi[m+1+j];
}
int i=0,j=0;
int k=l;
while(i<n1 && j<n2){
if(L[i]<=R[j])
{
dizi[k]=L[i];
i+... | ALGO | 0.999876 | 4.175795 |
c4bca609-fa0d-4b4a-a07c-596428e30811 | Baejinho03/CPP | [13]합과_평균.cpp | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b; // Է
cout << fixed; // Ҽ Ʒ ù° ڸ
cout.precision(1);
cout << a + b << " " << (float) (a + b) / 2; // Է¹ a,b հ
return 0;
} | ALGO | 0.990017 | 3.733131 |
273001e9-49a1-41ff-a339-50e8c8d762ae | moo1o/AlgorithmPractice | Baekjoon/14891.cpp | //N 0, S 1
//ȸȽ K , ð 1, ݽð -1
#include <iostream>
#include <bitset>
#include <queue>
using namespace std;
int state[5];
int K;
queue<pair<int, int>> input;
int mov[5];
void print() {
for (int i = 1; i < 5; i++)
cout << bitset<8>(state[i]) << endl;
printf("\n");
}
void init() {
for (int i = 1; i < 5; i++) {
... | ALGO | 0.999967 | 3.980588 |
5f543708-8122-4312-9ef7-40296b147049 | suraj101998/LeetCodeSolutions | 0000-0099/0060.Permutation Sequence/Solution.cpp | class Solution {
public:
string getPermutation(int n, int k) {
string ans;
bitset<10> vis;
for (int i = 0; i < n; ++i) {
int fact = 1;
for (int j = 1; j < n - i; ++j) fact *= j;
for (int j = 1; j <= n; ++j) {
if (vis[j]) continue;
... | ALGO | 0.999994 | 6.572017 |
63173fac-06eb-4b78-adcf-d5a03622643a | iitpparshant/cp_practice | codeforcepractice/1850F.cpp | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n];
vector<long long>mp(n+1,0),mx(n+1,0);
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]<=n){
mp[a[i]]++;
}
}
for(int i=1;i<=n;i++){
f... | ALGO | 0.999951 | 3.965544 |
1fcad16a-3509-4ca7-af2b-d0a92a901831 | roviery/TLXTOKI_PemrogramanDasar | 05. Percabangan/5F. Floor dan Ceiling.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main(){
float n;
cin >> n;
cout << floor(n) << " " << ceil(n) << endl;
return 0;
} | ALGO | 0.998846 | 4.814047 |
6f31436c-f94e-4777-b2a3-81294af93267 | sudoker0/cpp-coding-stuff | 2024-08-14/problem.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, a, b, _min, _max;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> n >> a >> b;
if (a + b <= n) {
_max = a;
} else {
_max = n - b;
}
_min = max(a - b, 0);
cout << _min... | ALGO | 0.999544 | 3.809774 |
044e04e6-2848-476c-a6f2-0a2fe53257b7 | lecaobaophuc0912/kawacoin | src/bloom.cpp | #include "bloom.h"
#include "primitives/transaction.h"
#include "hash.h"
#include "script/script.h"
#include "script/standard.h"
#include "random.h"
#include "streams.h"
#include <math.h>
#include <stdlib.h>
#define LN2SQUARED 0.4804530139182014246671025263266649717305529515945455
#define LN2 0.693147180559945309417... | ALGO | 0.951943 | 7.139627 |
02a5e780-5aae-42ea-ab9c-fae55e85be49 | followmsi/platform_frameworks_av | media/libstagefright/codecs/amrwb/src/low_pass_filt_7k.cpp | /*
------------------------------------------------------------------------------
Filename: low_pass_filt_7k.cpp
Date: 05/08/2004
------------------------------------------------------------------------------
REVISION HISTORY
Description:
--------------------------------------------------------------------... | ALGO | 0.999876 | 5.47722 |
c5b32928-12c5-413a-accd-6e0dc75e6005 | Yuelong-Yu/ERFNet-Caffe | caffe-erfnet/src/caffe/layers/concat_layer.cpp | #include <vector>
#include "caffe/layers/concat_layer.hpp"
#include "caffe/util/math_functions.hpp"
namespace caffe {
template <typename Dtype>
void ConcatLayer<Dtype>::LayerSetUp(const vector<Blob<Dtype>*>& bottom,
const vector<Blob<Dtype>*>& top) {
const ConcatParameter& concat_param = this->layer_param_.c... | ALGO | 0.860813 | 7.605506 |
ae2c3e30-1cff-4f41-b7b7-b81b056d0eab | marunemo/2021_PPS | Week1/4-2_최윤성_20210711.cpp | #include <iostream>
using namespace std;
int main() {
string n1, n2;
cin >> n1 >> n2;
string result = "";
int len1 = n1.length(), len2 = n2.length();
int carry = 0;
for(int i = 1; (len1 - i >= 0) || (len2 - i >= 0); i++) {
int num1 = (len1 - i < 0)?0:n1[len1 - i] - '0';
int num... | ALGO | 0.999975 | 4.656437 |
0f7f493d-7528-4118-ae35-154d3b64eca1 | BinomialSheep/Competitive | AtcoderContest/ARC160/A.cpp | #pragma region header
#include <bits/stdc++.h>
// デバッグ用マクロ：https://naskya.net/post/0002/
#ifdef LOCAL
#include <debug_print.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using vi = vector<int>... | ALGO | 0.999998 | 4.925871 |
41f94eff-09bb-46b5-8ad8-3b476572e4ef | prasantdas/COMPETITIVE-PROGRAMMING | binary_lifting_N_arry_tree.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
unordered_map<int,vector<int>> g;
int uptable[200001][30];
void binary_lifting(int src,int par){
uptable[src][0]=par;
for(int i=1;i<30;i++){
if(uptable[src][i-1]!=-1){
uptable[src][i]=uptable[uptable[src][i-1]][i-1];
... | ALGO | 0.99998 | 4.338711 |
0e81ef09-0a36-425f-9a2c-f75b60c3a486 | zhuango/leetCode | lintcode/diffBT.cpp | #include <vector>
using namespace std;
class Solution {
public:
/**
* @param n: An integer
* @return: An integer
*/
int numTrees(int n) {
// write your code here
vector<int> dp(n + 1, 0);
dp[0] = 1;
dp[1] = 1;
for(int i = 2; i <= n; ++i)
{
... | ALGO | 0.999998 | 6.434726 |
604f9dfd-c42f-4477-93df-535c7c0b60ee | Goinggit/opencv_learn_ | opencv_test/opencv_test/findcontours.cpp | #include <iostream> // for standard I/O
#include <string> // for strings
#include <opencv2/core/core.hpp> // Basic OpenCV structures (cv::Mat)
#include <opencv2/highgui/highgui.hpp> // Video write
#include "opencv2/imgproc/imgproc.hpp"
using namespace std;
using namespace cv;
Mat findcon_src; Mat findcon... | ALGO | 0.965652 | 4.471797 |
44006885-67ad-4a4e-a765-8f55780a709e | Gokulkrishnanrg2004/Super_dream_batch_training | 198-house-robber/house-robber.cpp | class Solution {
public:
int rob(vector<int>& nums)
{
if(nums.size() == 1) return nums[0];
vector<int>dp(nums.size());
dp[0] = nums[0];
dp[1] = max(nums[0],nums[1]);
for(int i = 2;i<nums.size();i++)
{
dp[i] = max(dp[i-1],dp[i-2]+nums[i]);
... | ALGO | 0.99975 | 5.925061 |
76d4d752-bf0e-4ce9-9583-aa0565cc4e5c | Tayebbb/Competitive-Programming | CodeForces/2046-A.cpp | #include <bits/stdc++.h>
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define ll long long int
#define pb push_back
#define kachao ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
void solve()
{
ll n;
cin >> n;
vector<ll> a(n), b(n);
for (auto &... | ALGO | 0.999952 | 4.741429 |
ad907fe8-b284-482a-b6d8-96fd0e0d68ad | JeremyJb134/Projects | Patient_Information_Heaps/driver.cpp | // CMSC 341 - Fall 2023 - Project 3
#include "pqueue.h"
#include <math.h>
#include <algorithm>
#include <random>
#include <vector>
using namespace std;
// Priority functions compute an integer priority for a patient. Internal
// computations may be floating point, but must return an integer.
int priorityFn1(const P... | ALGO | 0.998605 | 5.327443 |
1246d0b6-d265-4590-ba6f-087acc620620 | nazarchukdana/checkers-jni | c++/library.cpp | #include <vector>
#include <cstdlib>
#include "Game.h"
const int EMPTY = 0;
const int WHITE_CHECKER = 1;
const int BLACK_CHECKER = 2;
const int WHITE_KING = 3;
const int BLACK_KING = 4;
const int BOARD_SIZE = 8;
class Game{
private:
int whiteScore;
int blackScore;
int currentPlayer;
int clickedRow;
... | ALGO | 0.988976 | 5.43817 |
613bc868-7f1a-4cac-b935-c5eb39b32beb | prakashn27/Online-judges | CodeChef/REMISS.cpp | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int t, num1, num2;
cin>>t;
while(t--){
cin>>num1>>num2;
cout<<std::max(num1,num2)<<" "<<num1+num2<<"\n";
}
return 0;
}
| ALGO | 0.99973 | 4.643915 |
884cce3c-1fec-429b-9474-375bf2cff7f1 | AkankshRakesh/leetcode-solutions | 670. Maximum Swap.cpp | class Solution {
public:
int pow10[9] = {1, 10, 100, 1000, 10000,
100000, 1000000, 10000000, 100000000};
inline int swapInc(int x, int i, int y, int j){
if(x<=y) return 0;
return (x-y)*(pow10[j]-pow10[i]);
}
int maximumSwap(int num) {
if (nu... | ALGO | 0.999846 | 5.838716 |
2d64fd38-bd1d-48af-93d7-c9b7577a4c63 | Micronet-Ltd/sc600-android-external | libcxx/test/std/containers/sequences/vector.bool/emplace_back.pass.cpp | // UNSUPPORTED: c++98, c++03, c++11
// <vector>
// vector.bool
// template <class... Args> reference emplace_back(Args&&... args);
// return type is 'reference' in C++17; 'void' before
#include <vector>
#include <cassert>
#include "test_macros.h"
#include "min_allocator.h"
int main()
{
{
typedef std::ve... | TEST | 0.908639 | 5.517226 |
5e1f9636-5cee-4739-99d3-ec22c0d54836 | Azura-yuwi/Code | NOIP/2004/BugEating.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define f first
#define s second
int n;
int n1[26];
int n2[26];
int n3[26];
int eq[26];
vector<int> pos[26];
vector<int> ord;
bool oc[26];
bool fin;
void evaluate()
{
int carry = 0;
bool work = true;
... | ALGO | 0.99999 | 4.452343 |
2f1240d4-fd93-4819-83e9-9f0541ee6ec0 | ishandutta2007/codeforces | yongaron/normal/1338/A.cpp | #include<iostream>
using namespace std;
int n, t;
long long a[123456];
int main(int argc, char const *argv[]) {
cin>>t;
while(t--)
{
cin>>n;
long long ma = -1e9;
long long maxdif = 0;
for(int i = 0; i < n; i++)
{
cin>>a[i];
maxdif = max(maxdif, ma-a[i]);
ma = max(a[i], ma)... | ALGO | 0.999867 | 4.308511 |
7257ace9-c720-4b81-b823-5c4e0d35386f | cremmy/tatapp | engine/math/collision/test2d.cpp | /*
* test2d.cpp
*
* Created on: 30 lip 2017
* Author: crm
*/
#include "test2d.h"
#include "../geometry/aabb.h"
#include "../geometry/ball.h"
#include "../geometry/basefigure.h"
#include "../geometry/box.h"
#include "../geometry/capsule.h"
#include "../geometry/line.h"
#include "../geometry/mesh.h"
#include... | TEST | 0.898584 | 5.555905 |
d0ab1489-f641-4dc4-af84-a6d8a7381b6d | nmorenoch/LHMM | lammps-29Oct20/src/USER-DRUDE/fix_drude.cpp | #include "fix_drude.h"
#include <cstring>
#include <map>
#include "atom.h"
#include "comm.h"
#include "modify.h"
#include "error.h"
#include "memory.h"
#include "molecule.h"
#include "atom_vec.h"
#include <set>
#include <vector>
using namespace LAMMPS_NS;
using namespace FixConst;
/* -------------------------------... | TOOL | 0.925697 | 5.459312 |
eee43d81-b80d-4e91-a18e-b7ccea4d2574 | Sean0628/competitive_programming | atcoder/abc/abc059/b.cpp | #include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define out(arg) cout << (arg) << endl
using ll = long long;
using P = pair<int, int>;
using mint = modint1000000007;
void chmax(ll& a, ll b) { a = max(a, b); }
void chmin(ll& a,... | ALGO | 0.99999 | 5.227933 |
261b2a8d-ffec-459c-9f47-042dc1065d73 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_10657_8.cpp | #include <bits/stdc++.h>
using namespace std;
typedef int P[5005];
const double eps = 1e-8;
int n, m;
P u, v, w;
double Ans, mul, mtx[105][105];
inline void gs(int n) {
for (int i = 1; i < n; ++i) {
for (int k = i; k < n; ++k)
if (!(fabs(mtx[k][i]) < eps)) {
for (int j = 1; j <= n; ++j) swap(mtx[i][... | ALGO | 0.999978 | 3.675077 |
528ab3d4-815a-4aa2-bc61-1e4dd3ac504a | dosimpact/BOJ_PS | basic/11057.cpp | //https://www.acmicpc.net/problem/11057
#include <iostream>
#include <tuple>
#include <queue>
#include <algorithm>
#include <deque>
#include <vector>
#include <string>
#include <stack>
#define SIZE 10007
using namespace std;
long long d[1001][10];
int main()
{
int n;
cin >> n;
for (int i = 0; i <= 9; i++)
... | ALGO | 0.999924 | 4.565197 |
c5fb7efa-9a97-4e52-9584-7888396caed8 | RogelRC/Competitive-Programming | The Great Julya Calendar.cpp | #include <bits/stdc++.h>
using namespace std;
long long mayor(long long n){
long long temp = -1;
while(n > 0){
temp = max(temp, n % 10);
n /= 10;
}
return temp;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long num, sol = 0;
cin >> num;
... | ALGO | 0.999693 | 4.761211 |
947fbd67-a516-44ce-8311-b028d36434c0 | mcknight99/CPSC-coursework | Personal/advent-of-code-2024/day-1/day1.cpp | // Samuel Pupke
// Date: Dec 1 2024
// Description: Advent of Code 2024 Day 1
#include <iostream>
#include <fstream>
#include <vector>
#include <sstream>
#include <algorithm>
int main()
{
std::ifstream file("input.txt");
// we have to sort both lists from lowest to highest value
// so we need two vectors:... | ALGO | 0.999298 | 6.038371 |
02b302da-c43c-487f-8ab5-a01d2d2b7834 | jih189/fixtureless_fixturing_place_and_pick_re-grasping | OpenGR_4pcs/3rdparty/Eigen/doc/examples/matrixfree_cg.cpp | #include <iostream>
#include <Eigen/Core>
#include <Eigen/Dense>
#include <Eigen/IterativeLinearSolvers>
#include <unsupported/Eigen/IterativeSolvers>
class MatrixReplacement;
using Eigen::SparseMatrix;
namespace Eigen {
namespace internal {
// MatrixReplacement looks-like a SparseMatrix, so let's inherits its trai... | ALGO | 0.998008 | 6.161131 |
9a9721da-df2c-440e-91ad-9c3598c58cf5 | be-in/csad | csad/btext/tesselator/priorityq.cpp | /*
** Author: Eric Veach, July 1994.
**
*/
#include "priorityq.h"
#include "memalloc.h"
#include "tessmesh.h"
/* Include all the code for the regular heap-based queue here. */
#include "priorityq-heap.h"
/* Now redefine all the function names to map to their "Sort" versions. */
#include "priorityq-sort.h"
OPTIMIZ... | ALGO | 0.999806 | 5.844918 |
4a4d1724-e399-48c7-ad59-203edcaa5212 | ishandutta2007/codeforces | cheissmart/normal/1354/A.cpp | #include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << " is " << x << endl
#define int ll
using namespa... | ALGO | 0.999815 | 3.547641 |
7f02aed2-e356-4474-a867-81ee6318975a | graceemlin/codeforces | 2049/2049b.cpp | #include <bits/stdc++.h>
#include <climits>
using namespace std;
int main(int argc, char* argv[]) {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
string s;
cin >> s;
if (s[0] == 's') {
s[0] = '.';
}
if (s.back() == 'p') {
s.ba... | ALGO | 0.999616 | 4.013377 |
7a145818-43a0-4907-bbc6-a4cd1c014583 | PritiShaw/OOPLAB | assignment5.cpp | #include<iostream>
#include<cmath>
using namespace std;
class array{
int size;
int *p;
public :
array(int n){
size=n;
p=(int *) malloc(size*sizeof(int));
for(int i=0;i<size;i++)
p[i]=0;
}
array(const array &object){
size=object.size;
p=(int *)malloc(size*sizeof(int));
for(int i=0;i<siz... | TOOL | 0.987436 | 3.362045 |
a9488808-b871-4aa5-afb0-fc88a463bdbd | HaraldZealot/MyModules | RingOnList/ring.cpp | #include <cstring>
#include "ring.h"
namespace hzw
{
//! \privatesection
// The crack-safe methodology is present in this module:
// no traces of data stay in memory aposteriory.
class RingVoid::RingImplementation
{
public:
RingImplementation(FuncCompare cmp, FuncConstructor ctor, FuncDestruc... | TOOL | 0.980197 | 5.581983 |
519d6edb-7c30-4f78-b97a-5accb166f54a | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_4291_9.cpp | #include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n;
cin >> n;
string s, t;
cin >> s;
t = s;
vector<long long int> ans;
for (__typeof(n - 1) i = (0) - ((0) > (n - 1));
i != (n - 1) - ((0) > (n - 1)); i += 1 - 2 * ((0) > (n - 1))) {
if (t[i] != 'B') {
t[i] = 'B';
... | ALGO | 0.999923 | 3.870212 |
76255051-476a-46e7-a1c2-3828d15ea350 | ishandutta2007/codeforces | doped.silicon/normal/1138/D.cpp | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef gp_hash_table<long long, long long> umap;
#define fr(i,a,b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i,a,b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep... | ALGO | 0.999996 | 3.466617 |
30d3b04f-536b-43e3-8b47-172a1938a5b2 | UbiquitousLearning/Benchmark-On-Device-Training | tools/converter/source/optimizer/TemplateMerge.cpp | #include "TemplateMerge.hpp"
#include <set>
namespace MNN {
namespace Express {
bool TemplateMerge::onExecute(const std::vector<VARP>& outputs, PassPriority priority) {
if (mPriorities.size() <= priority) {
return false;
}
bool hasChange = false;
do {
hasChange = false;
for (cons... | ALGO | 0.975759 | 4.702854 |
f5036371-531c-43d9-83f4-3fc35c7c3e51 | raincross7/code-similarity | codes/train_code/problem239/problem239_387.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
string A="keyence";
string S;cin>>S;
int a=S.size()-7;
bool ans=0;
for(int i=0;i<7;i++){
string SS = S;
SS.erase(i,a);
if(A==SS){
ans=1;
break;
}
}
if(ans)cout<<"YES"<<endl;
... | ALGO | 0.999954 | 3.768759 |
ec2014a8-5738-4b31-9fd1-db4eed7231e2 | waseemnabi08/OOP-Lab-CEME-NUST- | Lab6/hugeint.cpp | #include <iostream>
using namespace std;
class HugeInteger {
private:
int arr[40];
public:
HugeInteger() {
for (int i = 0; i < 40; i++) {
arr[i] = 0;
}
}
HugeInteger(int size, int arrr[]) {
for (int i = 0; i < 40; i++) {
if (i < 40 - size) {
... | ALGO | 0.998197 | 4.106578 |
8153054e-90e0-442b-90be-3ba143ad4664 | shixuansun/ProjectForLearning | LeetCode/LeetCode/TwoSum.cpp | #include <vector>
#include <map>
using namespace std;
vector<int> twoSum(vector<int> &numbers, int target)
{
vector<int> retVec;
map<int, int> orderedNumbers;
map<int, int>::iterator iter;
for (int i = 0; i < numbers.size(); ++i)
{
iter = orderedNumbers.find(target - numbers[i]);
if... | ALGO | 0.999892 | 5.813392 |
6860b678-7143-45e0-881b-a33f24e5565f | xuyangustc/cavity_design | src/integrateddesign/src/polarenergy.cpp | /*
* polarenergy.cpp
*
* Created on: Jun 28, 2018
* Author: xuyang
*/
#include "integrateddesign/polarenergy.h"
#include "sd/nnterm.h"
using namespace NSPproteinrep;
using namespace NSPgeometry;
using namespace NSPdstl;
using namespace NSPsd;
void NSPproteinrep::extractcrd_cc(std::string fnin, std::string f... | ALGO | 0.996367 | 3.90761 |
f36fab1d-2326-490e-aa9f-bb2141f96f97 | EstanisVictor/MaratonaProgramacao | Training_11-05-22/F.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int ham;
cin >> ham;
int dog;
cin >> dog;
int hum;
cin >> hum;
int elf;
cin >> elf;
double d1 = (double)dog / 7;
double h1 = (double)hum / (7 * 7);
double e1 = (double)elf / (7 * 7 * 7);
if (ham > d1 && ham > ... | ALGO | 0.999639 | 4.231045 |
2a0c0772-d452-4e97-af4e-3e58478aded6 | vinodkr09/Cpp-Code | 03_2D_Array/05_Row_wise_Sum.cpp | #include<iostream>
using namespace std;
// to print Row wise sum function
void printSum(int arr[][3], int row, int col){
cout<<"Printing the row sum"<<endl;
for(int row=0; row<3; row++){
int sum = 0;
for(int col=0; col<3; col++){
sum +=arr[row][col]; // += is compound assignment o... | ALGO | 0.999254 | 3.774415 |
b452c354-071f-4197-a24d-182f09b64e51 | jeong-hyeonHwang/Algorithm | Steps/ETC/prob_2743.cpp | //2022.02.07
#include <iostream>
#include <string>
using std::cin;
using std::cout;
using std::string;
int main()
{
string str;
cin >> str;
cout << str.size();
} | ALGO | 0.936811 | 3.431496 |
3c71723b-8f90-4af5-ad2f-10099b8c667d | Shailendra-Chaudhary/Turing_ | 355108_Turn_1_Model_A.cpp | #include <iostream>
#include <vector>
#include <ctime>
#include <cstdlib>
// Simple function to simulate gameplay logic
void gameLogic(std::vector<int>& data) {
for (size_t i = 0; i < data.size(); ++i) {
data[i] *= 2; // Performing some operation on each element
}
}
int main() {
const size_t DATA_... | ALGO | 0.941843 | 7.12954 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.