uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
d76a7f7d-39bb-43ca-a886-74059b895b1f | chamip/codeRecord | newcoder/yqdead.cpp | #include <iostream>
#include <iomanip>
using namespace std;
int main(int argc, char const *argv[])
{
int dangerous;
int dead;
cin >> dangerous >> dead;
double res = double(dead) / dangerous * 100.0;
cout.setf(cout.showpoint);
cout.precision(3);
cout.setf(ios::fixed);
cout << res << "%" << endl;
// cout << fix... | ALGO | 0.980113 | 3.535487 |
245ce817-e78e-43e8-822a-a3ab0ab81041 | teseoch/CG-Summer-2025 | ext/eigen/bench/spbench/test_sparseLU.cpp | // Small bench routine for Eigen available in Eigen
// (C) Desire NUENTSA WAKAM, INRIA
#include <iostream>
#include <fstream>
#include <iomanip>
#include <unsupported/Eigen/SparseExtra>
#include <Eigen/SparseLU>
#include <bench/BenchTimer.h>
#ifdef EIGEN_METIS_SUPPORT
#include <Eigen/MetisSupport>
#endif
using namesp... | ALGO | 0.995014 | 4.273294 |
dc33a201-b511-4197-a2d7-bf6f8ff76bc5 | cssartori/programming-challenge | 941 - Permutations/941.cpp | //941 - Permutations - Carlo Sartori
#include <iostream>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <stdlib.h>
#define pb push_back
using namespace std;
typedef vector<int> vi;... | ALGO | 0.999859 | 4.230671 |
5eb565f3-7de6-402b-a767-1298f76a4662 | oxy-poo/icpc_practice | search_greedy/2048_game/a.cpp | #include <bits/stdc++.h>
using namespace std;
void solveSet(set<int> &a,int t){
if(!a.count(t)){
a.insert(t);
}
else{
a.erase(t);
t = t*2;
solveSet(a,t);
}
}
int main(){
int queries,sz;
cin >> queries;
auto print = [](const int& n) { std::cout << " " << n; };
while(queries--){
cin >> sz;
set<i... | ALGO | 0.999802 | 4.506473 |
fa947e99-edaa-4257-b412-a26cea3ab2f7 | SRIJAN-KUMAR7/Codeforces... | expression.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a,b,c;
cin>>a>>b>>c;
int r1=a+b+c;
int r2=a*b*c;
int r3=(a+b)*c;
int r4=a*(b+c);
int r5=(a*b)+c;
int r6=a+(b*c);
int Max=max({r1,r2,r3,r4,r5,r6});
cout<<Max<<endl;
return 0;
} | ALGO | 0.999728 | 3.709508 |
94125ab5-5b3d-47ae-94e0-035a2caef129 | lbv/pc-code | solved/u-w/unique-snowflakes/snowflakes.cpp | #include <cstdio>
#include <cstring>
#define Neg(m) memset(m, -1, sizeof(m))
typedef unsigned char u8;
typedef unsigned int u32;
//
// Hash Map
//
struct HashT {
int k, v;
HashT() {}
HashT(int K, int V): k(K), v(V) {}
bool operator==(const HashT &x) const { return k == x.k; }
};
#define HASHB (1<<15)
#define H... | ALGO | 0.99981 | 4.631272 |
98be7071-c956-49b6-a8cd-9caa86a8dc6c | DiegoCorrea/graphTheory | spoj_Uva/listThree/REUNIAO2.cpp | # include <iostream>
# include <vector>
# include <algorithm>
# include <stdio.h>
# define MAXVERTEX 101
# define VERTEXSTART 0
# define INFINITY 99999
void initialize(int resultanceMatrix[][MAXVERTEX], int size);
void printSolution(int result[][MAXVERTEX], int size);
int searchSolution(int resultanceMatrix[][MAXVE... | ALGO | 0.999717 | 3.887149 |
7beb9036-5f34-4367-aad0-2c92a871ff93 | keremerolce/C-Programin-Samples | C ile Bilgisayar Programlamaya Giriş/KarakterDizileriUygulama7/KarakterDizileriUygulama7/Source.cpp | #include <stdio.h>
#include <string.h>
char *strcev(char *dizi);
int main()
{
char karakterDizisi[50];
printf("Bir Karakter Dizisi Giriniz:");
fflush(stdout);
scanf("%s",karakterDizisi);
printf("Karakter Dizisi: %s\n",karakterDizisi);
printf("Karakter Dizisinin Tersi: %s\n",strcev(karakterDizisi));
return 0;... | ALGO | 0.996354 | 3.634677 |
8f75e5cf-49a4-4f63-9e5d-3cd1266cb31e | H-Shen/MyCodeCollection | Leetcode/2671/2671.cpp | class FrequencyTracker {
private:
unordered_map<int,int> num2freq;
unordered_map<int, unordered_set<int>> freq2nums;
public:
FrequencyTracker() {
}
void add(int number) {
if (num2freq.count(number) > 0) {
int oldFreq = num2freq[number];
++num2freq[number... | ALGO | 0.999482 | 6.498059 |
e42ca9f0-9bf4-4a73-8e93-b32ccf0ef6f9 | S-K-Siva/geeksforgeeks_problem_solving | practice/15Jan23/parity.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
int n;
cin>>n;
if(n%2 == 0) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
}
| ALGO | 0.999736 | 4.688008 |
9eb586fe-e67b-4d51-8113-e62a1846acf3 | DevashishPathrabe/LeetCode | LeetCode Solutions/Problems/970. Powerful Integers.cpp | class Solution {
public:
vector<int> powerfulIntegers(int x, int y, int bound) {
unordered_set<int> listOfPowerfullIntegers;
for(int xi=1; xi<bound; xi*=x){
for(int yj=1; xi+yj<=bound; yj*=y){
listOfPowerfullIntegers.insert(xi+yj);
if(y == 1){
... | ALGO | 0.99953 | 4.985853 |
4072ef70-a9be-43e1-9f12-48b8e472d696 | vishalakshisaraswat/LeetCode-75 | 1290-convert-binary-number-in-a-linked-list-to-integer/1290-convert-binary-number-in-a-linked-list-to-integer.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
int getDecimalValue(L... | ALGO | 0.999957 | 5.890477 |
cc3c93e6-4f00-4bb5-a33b-7dd63532d43a | Rito-492/Luogu | P1540.cpp | #include <bits/stdc++.h>
using namespace std;
int main () {
int m, n, word, ans = 0, q[1000], l = 0, r = 0;
bool flag;
cin >> m >> n;
for (int i = 1; i <= n; i++) {
cin >> word;
flag = false;
for (int j = l; j < r; j++)
if (q[j] == word) {
flag = true;... | ALGO | 0.999934 | 3.739943 |
5896563d-4d72-47bd-8f62-7d7309e7b0d8 | ishandutta2007/codeforces | emptysoulist/normal/1244/F.cpp | #include<bits/stdc++.h>
using namespace std ;
#define rep( i, s, t ) for( register int i = s; i <= t; ++ i )
#define re register
int gi() {
char cc = getchar() ; int cn = 0, flus = 1 ;
while( cc < '0' || cc > '9' ) { if( cc == '-' ) flus = - flus ; cc = getchar() ; }
while( cc >= '0' && cc <= '9' ) cn = cn * 10 + ... | ALGO | 0.999997 | 3.411062 |
e586752d-14aa-4f95-a88c-00f9271b78d5 | Andressalconstantino/URI-Beecrowd-Cpp | Beecrowd-1281.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cout << setprecision(2) << fixed;
int ct; cin >> ct;
for (int i=0; i<ct; i++){
int n; cin >> n;
map<string, float>food;
for (int j=0;j<n;j++){
string x; float y; cin >> x... | ALGO | 0.991606 | 3.970172 |
96f0835e-11ac-4bd4-852b-bcaa6033df9e | mjakuipers/TULIP-DevBoard | TULIP4041-P2/tracer.cpp | #include "tracer.h"
const char __in_flash()*mnemonics[] =
// const char *mnemonics[] =
// list of HP41 mnemonics, JDA style
// forced in FLASH to maximize SRAM
{
"NOP", // 000
"GO/XQ",
"A=0 @R",
"JNC +0",
"CLRF 3",
"GO/XQ",
"A=0 S&X",
"JC 0",
"SETF 3",... | ALGO | 0.947823 | 3.241327 |
565e2cd3-8b56-4a57-8f64-ce2984f31585 | NgTrDung/1000BaiC | Bai 26.cpp | //Bai 26: Tinh tch tat ca cac uoc so le cua so nguyen duong n
#include<iostream>
using namespace std;
int main()
{
int n,result=1;
cout<<"Nhap so nguyen duong n: ";
cin>>n;
for(int i=1;i<=n;i++)
{
if(n%i==0)
{
if(i%2!=0)
{
result*=i;
}
}
}
cout<<"Ket qua = "<<result<<endl;
return 0;
}
| ALGO | 0.999969 | 3.583323 |
ab21c92c-26b1-4c1c-b551-48ceb31f807d | almas-ashruff/DSASolutions | June/23 June/splitBinaryStringIntoSubstringWithEqual0and1.cpp | #include <bits/stdc++.h>
using namespace std;
// Give a binary string s, return the number of non-empty substrings that have the same number of
// 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively.
// Substrings that occur multiple times are counted the number of times they oc... | ALGO | 0.999938 | 5.650431 |
0809b8f7-08e0-4826-90f2-516f7f690116 | niteshcse14/Data_Structure-Algorithm | Desktop/programs/codechef/Killing_Monsters.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N_MAX = (1<<17) + 1;
const int MAX = (1e9) + 3;
const int mask = (1<<17)-1;
const int BIT = 18;
const int Q_MAX = (1<<18) + 1;
// To store how much died at that query.
int answer[Q_MAX];
// Height
int h[N_MAX];
// Query : x,y
int query[Q_MAX]... | ALGO | 0.999741 | 3.786447 |
e384ac2d-cb80-4fef-9ac0-75bc6d41649a | CrowChi/Data_Structure_Lab | Data St/16GraphStructAdjacency (2).cpp | #include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define MaxNode 4
/*
#define A 0
#define B 1
#define C 2
#define D 3
*/
char NodeName[MaxNode]= {'A','B','C','D'};
int s , e ;
int graph[MaxNode][MaxNode]={
{0,1,1,1},
{1,0,1,1},
{1,1,0,0},
{1,1,0,0}
};
struct Node
{
char info;
struct Node *next... | ALGO | 0.979538 | 3.341579 |
6f849e0e-2d08-4c00-830d-3a45fd16e0f3 | HarenKei/BOJ_Solved | Bronze/24416.cpp | #include<bits/stdc++.h>
using namespace std;
int n, reCnt = 1, dpCnt = 0;
int dp[41];
int fibo(int n) {
if(n == 1 || n == 2) {
return 1;
} else {
reCnt++;
return(fibo(n - 1) + fibo(n - 2));
}
}
void fibonacci(int n) {
dp[1] = dp[2] = 1;
for(int i = 3; i <= n; i++) {
... | ALGO | 0.99977 | 4.224478 |
5d4187b8-b242-41d6-93d4-6044ec52f42a | mirinta/leet_code | dynamic_programming/basic_I/1137_nth_tribonacci_number.cpp | #include <utility>
/**
* The Tribonacci sequence Tn is defined as follows:
*
* T0 = 0, T1 = 1, T2 = 1, and T(n+3) = T(n) + T(n+1) + T(n+2) for n >= 0.
*
* Given "n", return the value of T(n).
*
* ! 0 <= n <= 37
* ! The answer is guaranteed to fit within a 32-bit integer, ie. answer <= 2^31 - 1.
*/
class Solu... | ALGO | 0.999947 | 7.089221 |
77454ed7-c381-4a03-b302-1abb1a1ef837 | JSeungBeom/Data-structure | personal practice/personal practice/stack3.cpp | #include <iostream>
using namespace std;
struct node {
int data;
node* next;
};
class Stack {
private:
node* topNode;
int n;
public:
Stack() {
topNode = NULL;
n = 0;
}
int size() {
return n;
}
bool empty() {
return (n == 0);
}
void push(int data) {
node* newNode = new node;
newNode->data =... | ALGO | 0.999222 | 4.326998 |
50e17fa9-67e4-4c40-be1c-3b28d407870b | Mohammadkamrulhassan/CompetitiveProgramming | Codeforces/A_Pangram.cpp | //SOE_60
//03.01.2024
#include<bits/stdc++.h>
using namespace std;
int v[500] ; int cnt =0;
int main(void){
int x; cin >> x; string a; cin >> a;
for(int i=0; i<a.size(); ++i){
if(a[i] >= 'A' && a[i] <= 'Z') a[i] += 32; v[a[i]] = 1;
}
for(int i='a'; i<= 'z' ; ++i) if(v[i] == 1) cnt++;
cnt == 26 ? cout <... | ALGO | 0.999886 | 4.485963 |
6f6e6a92-72be-482c-99de-0a9e4783c1af | eduardogil11/Repositorio-Analisis-y-diseno-de-algoritmos-avanzados | Actividad 3.2 Implementación de Dijkstra and Floyd/main.cpp | /*
Daniel Cruz Arciniega A01701370
Eduardo Rodriguez A01274913
*/
#include <bits/stdc++.h>
using namespace std;
int INF = 99999;
/*
El algoritmo de Dijkstra
es de complejidad O(n²) en nuestra implementacion
*/
void Dijkstra(vector <int> &G, int x) {
printf("\nDijkstra: \n");
for(int d = 0; d < x; ++d)... | ALGO | 0.999815 | 3.901312 |
44124a4b-a3fd-42ad-b2c2-ac4d6b0cfa75 | vedesh95/competitve-programming | CSES/DP/Increasing Subsequence.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
set<int> s;
int main(){
int n;cin>>n;
vector<int> arr(n);
for(ll i=0;i<n;i++) cin>>arr[i];
vector<int> dp(n,1);
int ans=1;
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
if(arr[j]<arr[i]) dp[i]=ma... | ALGO | 0.999961 | 4.305696 |
b1403b5e-f083-4b6d-a254-8bd24b614125 | minereobot1/Bitcoinote-node-multihashing | crypto/cryptonote_core/cryptonote_basic_impl.cpp | #include "include_base_utils.h"
using namespace epee;
#include "cryptonote_basic_impl.h"
#include "string_tools.h"
#include "serialization/binary_utils.h"
#include "serialization/vector.h"
#include "cryptonote_format_utils.h"
#include "cryptonote_config.h"
#include "misc_language.h"
#include "common/base58.h"
#include... | TOOL | 0.906005 | 6.333661 |
8d9e17a2-02d4-42b9-96a5-7ae3ba7c67e4 | Manoj1075/CSA5794-FOC | Summing up squares of Odd numbers..cpp | #include<stdio.h>
int main()
{
int limit,i,sum=0;
printf("enter the limit:");
scanf("%d",&limit);
for (i=1;i<=limit;i=i+2)
{
sum=sum+i*i;
}
printf("sum of the squares of odd numbers from 1 to %d is %d\n",limit,sum);
return 0;
}
| ALGO | 0.99922 | 3.440498 |
13f78628-bd05-4c4d-9a39-2c812f5d757e | keisuke90/AtCoder | practice/abc270-a.cpp | #include <bits/stdc++.h>
#define rep(i, start, end) for(int i = start; i < end; i++)
using namespace std;
int main(){
int a, b;
cin >> a >> b;
// set<int> s;
// if(a == 7) {
// s.insert(1);
// s.insert(2);
// s.insert(4);
// } else if (a == 6) {
// s.insert(2);
... | ALGO | 0.999917 | 3.646046 |
8a9ffb57-af3d-46c9-b11e-f38f0c99a091 | Aaron3312/Actividad1datasinse | Pruebas_cpp/Algoritmos I/actividades/Act5.2/Act_5.2 (1).cpp | #include <iostream>
#include <list>
#include <cmath>
#include <vector>
#include <fstream>
#include <regex>
#include <vector>
#include <sstream>
#include <string>
#include <iterator>
using namespace std;
struct Nodo{
int port, acum;
vector <string> renglones;
Nodo(){port = -1; acum = 0; }
};
using namespa... | ALGO | 0.980537 | 4.215987 |
41eb7203-1c95-40c1-b1d9-379184f89cd7 | archetype2142/cpp-projects | cubify_self.cpp | #include <stdlib.h>
#include <iostream>
int main()
{
float cubify(float);
float x,y;
std::cout << "Enter a number to find it's cube: ";
std::cin >> x;
y = cubify(x);
std::cout << "\n The cube is " << y << std::endl;
return 0;
}
float cubify(float a)
{
float b;
b = a*a*a;
return (b);
} | TOOL | 0.959297 | 3.65837 |
44940889-c4f7-4676-8933-6487a01f3411 | nalply/crtmpserver | branches/1.0/sources/crtmpserver/src/crtmpserver.cpp | #include "netio/netio.h"
#include "configuration/configfile.h"
#include "protocols/protocolmanager.h"
#include "application/clientapplicationmanager.h"
#include "protocols/protocolfactorymanager.h"
#include "protocols/defaultprotocolfactory.h"
//This is a structure that holds the state
//between config re-reads/re-run... | WEB | 0.937596 | 5.708506 |
24fde84d-da79-4c6d-89c4-2108dd57edb6 | Tishat2247019/FALL-2022-2023 | PRE SEMESTER/DATA STRUCTURE LAB/All Code/Week-8/Selection_Sort.cpp | #include<iostream>
using namespace std;
int comp_no =0, swap_no = 0;
int main()
{
int n;
cout << "Please enter the size of an array: ";
cin >> n;
int a[n];
cout << "Please enter the elements of the array: ";
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
cout<<"\nUnsorted arra... | ALGO | 0.999494 | 3.777711 |
3ad2fc5c-306e-44d2-9075-d61b1f0dc8a4 | GuessEver/ACMICPCSolutions | Tyvj/1038/1038.cpp | #include <cstdio>
#include <algorithm>
const int N = 100000 + 10;
const int inf = 0x3f3f3f3f;
int n, m;
int val[N * 4];
void change(int p, int l, int r, int a, int c)
{
if(l == r && l == a)
{
val[p] = c;
return;
}
int m = (l + r) / 2;
if(a <= m) change(p*2, l, m, a, c);
else change(p*2+1, m+1, r, a, c);
va... | ALGO | 0.999994 | 4.299561 |
32670ced-f8da-41bd-9ab7-d5a59e8efcfa | PaulLandaeta/Algoritmica-1-2021 | Capitulo 4/divisiones.cpp | #include <bits/stdc++.h>
#define input freopen("in.txt","r",stdin)
#define output freopen("out.txt","w",stdout)
using namespace std;
vector<bool> primes(1000,true);
void sieve() {
primes[0] = primes[1] = false;
for(int i = 2;i < n; i++) {
if(primes[i]) {
for(int j = i+i; j < n ; j+= i ) {
... | ALGO | 0.999915 | 4.445114 |
664e691f-07fc-404b-bffb-87ee62a80daa | Prakhargenuine321/DSA-Journey | #1STL/16builtInPopcount.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
//__builtin_popcount() --> The function takes an unsigned integer as input parameter and returns the number of set bits(no. of 1's) present in that integer
int num = 7;
int count = __builtin_popcount(num);
cout << "No. of set bits: " << count <<... | ALGO | 0.999168 | 5.332689 |
481ad54f-8b72-4c88-a904-c7866eef791a | cunbidun/competitive_programming | archive/Codeforces - Codeforces Round #641 (Div. 2)/B. Orac and Models/solution.cpp | #include <bits/stdc++.h>
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define rf(i, a, b) for (int(i) = (a); (i) <= (b); (i)++)
#define rb(i, b, a) for (int(i) = (b); (i) >= (a); (i)--)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, ... | ALGO | 0.999676 | 4.272271 |
6815a326-5b53-463e-a97c-cac328678d96 | snjyjn/mastermind | mastermind.cpp | #include <iostream>
#include <algorithm>
#include <assert.h>
#include "spacefinder.h"
#include "mastermind.h"
using namespace std;
// The main solver class.
// Constructor - initialize it with a reference to the dictionary,
// so that it can get some basic stats from there.
Mastermind::Mastermind(Dictionary *d) {
... | ALGO | 0.999066 | 4.875501 |
3a991eb4-8965-45f7-8c36-2ad0540b98b2 | IamBikramPurkait/My-Competitive-Programming-Journey | #100DaysofDsAlgo/Day 1/printPrimeNoUptoN.cpp | // C++ program to print all primes smaller than or equal to n
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
bool flag = true;
vector<int> v;
cin >> n;
for (int i = 2; i < n; i++)
{
if (n % i != 0)
{
}
}
if (flag)
cout << ... | ALGO | 0.999827 | 4.421382 |
0f179c7b-af03-4197-b1a6-592efdfc8e47 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_4103_14.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, n, m, k, r, c, a[1000];
cin >> n >> m >> k;
for (int i = 1; i <= m; i++) {
a[i] = k;
}
for (int i = 1; i <= n; i++) {
cin >> r >> c;
if (a[r] >= c) a[r] = c;
}
for (int i = 1; i <= m; i++) {
sum += a[i];
}
if (sum ... | ALGO | 0.999919 | 3.442251 |
77b0ad64-28c0-4d37-b525-6dd151a8fbcf | bensapp/Stretchable-Models-for-Motion-Parsing | cps/thirdparty/OpenCV-2.0.0/src/cxcore/cxmathfuncs.cpp | #include "_cxcore.h"
namespace cv
{
static const int MAX_BLOCK_SIZE = 1024;
typedef CvStatus (CV_STDCALL * MathFunc)(const void* src, void* dst, int len);
#define ICV_MATH_BLOCK_SIZE 256
#define _CV_SQRT_MAGIC 0xbe6f0000
#define _CV_SQRT_MAGIC_DBL CV_BIG_UINT(0xbfcd460000000000)
#define _CV_ATAN_CF0 (-15.8... | ALGO | 0.998716 | 5.556131 |
a1a4b8bc-c160-48fd-9ec5-20ec7a217959 | MEIHUA955/algorigthm-study | LeetCode_C++/452_findMinArrowShots/test.cpp | #include <limits.h>
#include "gtest/gtest.h"
#include "gmock/gmock.h"
#include <cstdlib>
#include <iostream>
#include <string>
#include "solution.h"
using ::testing::_;
using ::testing::AtLeast;
using ::testing::Exactly;
using ::testing::Return;
using namespace testing;
using namespace std;
TEST(TEST, TEST)
{
S... | ALGO | 0.996436 | 5.769115 |
8a69588a-e658-43dc-81b7-50d668b43508 | AlienCowEatCake/ImageViewer | src/ThirdParty/OpenEXR/openexr-3.3.5/src/lib/OpenEXR/dwaLookups.cpp | //
// A program to generate various acceleration lookup tables
// for Imf::DwaCompressor
//
// NB: the pre-computed table itself has moved to the core library,
// being C-only
//
#include <cstddef>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <OpenEXRConfig.h>
#include <OpenEXRC... | ALGO | 0.966203 | 4.807858 |
a7f03d95-2613-4ef9-8030-282174b64709 | Namronaldo08102004/CSC10003-SortingProject | 22127275_22127280_22127465_22127475/SOURCE/Cpp_Files/[Huy]_Sorts.cpp | #include "../Header_Files/All.h"
//? Count comparisons
void heapifyComp(vector<int> &arr, int size, int pos, long long &comparisons)
{
int v = arr[pos];
bool isHeap = false;
while (++comparisons && (!isHeap && 2 * pos + 1 < size))
{
int j = 2 * pos + 1;
if (++comparisons && j < size - 1... | ALGO | 0.999873 | 4.721004 |
1f5464df-78c9-4cf8-909d-b9b12190350a | ewewrttt/8209230410- | 实验二题目三.cpp | #include<iostream>
using namespace std;
int main() {
float a = 0.1f;
float b = 0.2f;
float c = 0.3f;
FLAG:cout << "ֱߣ"<<endl;
cin >> a;
cin >> b;
cin >> c;
if (a + b > c&&b+c>a&&a+c>b) {
float d = a + b + c;
cout << "εܳΪ" << d << endl;
if (a == b || b == c || a == c) {
cout << "Ϊ" << endl;
}
else {... | ALGO | 0.995116 | 3.272849 |
eb055019-1e9a-48d6-b93c-57b7d4cc3326 | VanshRuhela/Practice | Graph/GraphTraversals/dfs.cpp | #include <bits/stdc++.h>
using namespace std;
template<typename T>
class Graph{
map<T, list<T> > l;
public:
void addEdge(int x, int y){
l[x].push_back(y);
l[y].push_back(x);
}
void dfs_helper(T src, map<T, bool> &visited){
// graph traversal
cout << src << " ";
... | ALGO | 0.999939 | 4.698682 |
9ed68d99-f2d3-493d-b75a-49cfecb02fc8 | peterisr/aoc2021 | 02a.cpp | #include <iostream>
#include <map>
using namespace std;
const map<string, pair<int, int>> COMMANDS = {
{"forward", {1, 0}},
{"up", {0, -1}},
{"down", {0, 1}},
};
int main() {
string cmd;
int arg, x = 0, y = 0;
while (cin >> cmd >> arg) {
x += COMMANDS.at(cmd).first * arg;
y += COMMANDS.at(cmd).seco... | ALGO | 0.998989 | 4.814604 |
189fe949-e0fe-4466-a8b8-fc24407d331c | chawinkn/competitive-programming | Programming.in.th/Passed/New/codecube_098.cpp | #include <bits/stdc++.h>
using namespace std;
int d[1000009], last[1000009];
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n, m, num, ans=0;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> d[i];
for (int j = 1; j <= m; j++) {
cin >> num;
if (j-last[num] >= d[num]) {
ans++;
last[n... | ALGO | 0.999897 | 3.671677 |
f67afbf4-2148-42c9-ba45-69db21f91f4b | hantwofish/recode | leetcode/leetcode/752_打开转盘锁.cpp | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
using namespace std;
class Solution {
public:
int openLock(vector<string>& deadends, string target)
{
string start ="0000";
queue<string> que;
set... | ALGO | 0.999862 | 5.870219 |
b8851ffe-33d1-48ae-b553-fa1112eb06a4 | amanaggarwal06/GFG | Majority Element - GFG/majority-element.cpp | //{ Driver Code Starts
//Initial template for C++
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution{
public:
// Function to find majority element in the array
// a: input array
// size: size of input array
int majorityElement(int a[]... | ALGO | 0.999872 | 5.708477 |
c60322dd-eeea-4bcb-958f-c7ab4629b424 | zunino/leetcode | 0017-letter-combinations-phone/letter-combos.cpp | /**
* LETTER-COMBOS.CPP
*
* https://leetcode.com/problems/letter-combinations-of-a-phone-number/
*
* Andre Zunino <<EMAIL>>
* 21 March 2021
*/
#include <bits/c++config.h>
#include <cstdint>
#include <map>
#include <string_view>
#include <string>
#include <vector>
#include <iostream>
using namespace std::stri... | ALGO | 0.998297 | 7.290054 |
7c6c3db7-1227-4f44-9c24-1a67e7c06564 | Jinalptl97/Flutter-Random-RollerDice | 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.998764 | 6.762122 |
e0995d58-5262-4337-82e8-b96ac42eefc9 | saleemaperidot/noteapp | noteapp/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.998318 | 6.783336 |
685906d9-3295-40ae-9769-1c699376b985 | Jeffbin/- | 排序算法/poj2388.cpp |
/*
* ķм
*
* ύ״̬ AC
*
* AC Memory: 264K Time: 47MS
*
* ⷽ1ù鲢a[n/2]м
*
* ⷽ2 ѡ
*
* 0
*
* ԭ ѡ
*
* ĵ ѡ
*/
#include <iostream>
using namespace std;
void merge(int a[], int l, int mid, int r)
{
int i = l;
int j = mid + 1;
int k = 0;
int ls[10000];
while (i <= mid && j <= r)
{
if (a[i] < a[j])
{
... | ALGO | 0.999974 | 4.329112 |
93333899-1321-4760-94cf-6d6ae7b34878 | namhai0510/C-- | C--/purple02A.cpp | #include<bits/stdc++.h>
using namespace std;
#define nothing ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#define endl "\n";
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
#define pb push_back
const ll oo = 1e13;
const ll modd = 1e9 + 7;
const ll maxn = 1e6 + 2;
... | ALGO | 0.999898 | 3.661815 |
2740cb01-f635-4f33-9210-545eb948dee9 | strange-suraj/LeetCode-Susbmission | Roman Number to Integer - GFG/roman-number-to-integer.cpp | //{ Driver Code Starts
// Initial template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution {
public:
int romanToDecimal(string &s) {
// code here
int ans = 0, n = s.length();
for(int i=0;i<n;i++){
if... | ALGO | 0.99987 | 6.932101 |
85e49fd5-5940-4e3e-a941-e3f601dcbd91 | rathoresuryansh196/basic-cpp | functions/functions.cpp | #include <iostream>
#include <cmath>
using namespace std;
/* Using Function Template */
template <class S>
S subtract(S x, S y) {
return abs(x - y);
}
// ...with 2 different data types.
template <class M1, class M2>
M1 findMin(M1 x, M2 y) {
return (x > y ? y : x);
}
/* Using Function Overloading */
int calcAv... | ALGO | 0.998595 | 6.120562 |
f6748f70-0275-4b20-9d49-79791d920b7a | meisamrf/racnn | racnn/libs/racnn.cpp | #include "racnn.h"
#ifdef AVX_AVX2
#include <immintrin.h>
#elif defined(ARM_NEON)
#include <arm_neon.h>
#endif
void copy3x3(const float *in, float *out, int x, int y, int width, int dim) {
const float *pin;
pin = &in[(x - 1 + (y - 1)*width)*dim];
for (int d = dim * 3; d > 0; d--) {
*out++ = *pin++;
}
pin = ... | ALGO | 0.999211 | 5.590984 |
7ef99fde-9937-4707-ad9f-40eb0c5b9ae6 | Roger-Sh/robotic_note | robotic_note/cpprobotics/3rdparty/matplotplusplus/examples/discrete_data/stem/stem_3.cpp | #include <cmath>
#include <matplot/matplot.h>
int main() {
using namespace matplot;
std::vector<double> x = linspace(0, 2 * pi, 50);
std::vector<std::vector<double>> Y(2);
Y[0] = transform(x, [](auto x) { return cos(x); });
Y[1] = transform(x, [](auto x) { return 0.5 * sin(x); });
stem(x, Y);... | TOOL | 0.870662 | 4.453951 |
38db5659-ffe2-484d-a218-d761b4106531 | ishandutta2007/codeforces | chen_zexing/normal/1538/B.cpp | #include <stdio.h>
#include <iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cmath>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <climits>
#include <set>
#include <unordered_map>
#include <time.h>
#include <map>
#include <stack>
#include <unordered_set>
#include <bitset... | ALGO | 0.99976 | 3.546754 |
076a9b31-9575-42c9-bf3b-cd6ff5c2b1ba | dvtrunggg/Nhap-Mon-Lap-Trinh | week8/bai3.cpp | #include <iostream>
using namespace std;
#define MAX 100
#include <vector>
#define Max(a, b) ((a > b) ? (a) : (b))
void Print(int a[], int size)
{
for (int i = 0; i < size; i++)
{
cout << a[i] << "\t";
}
}
//n là số cần tìm các ước
//a là mảng chứa các ước của n
void mangUoc(int a[], int &size, in... | ALGO | 0.998864 | 4.373108 |
b9ef63c9-a652-4a22-b04f-1718e8065ad9 | Mnaufal1203/daspro2022 | Tugas/Urutan 5 Bilangan/urutan nested if (fail, mumet debugging).cpp | //judul
//urutan 5 bilangan
//Muhammad Naufal Abdulmajid
//9 Okt 2022
#include <iostream>
using namespace std;
//kamus
int a, b, c, d, e;
char redo;
//deskripsi
main ()
{
awal:
cout << "Program Sederhana Urutan 5 Bilangan" << endl;
cout << "=====================================================... | ALGO | 0.999642 | 3.411188 |
bb3fdb88-ce3d-4b9f-b534-608040154f3b | cclarasol/solli_hw4 | aruco_ros/aruco_ros/src/simple_double.cpp | /**
* @file simple_double.cpp
* @author Bence Magyar
* @date June 2012
* @version 0.1
* @brief ROS version of the example named "simple" in the ArUco software package.
*/
#include <iostream>
#include <aruco/aruco.h>
#include <aruco/cvdrawingutils.h>
#include <ros/ros.h>
#include <image_transport/image_transport... | TOOL | 0.910457 | 6.705619 |
c73968f3-98d3-4d0a-9a17-2f58030dc787 | AbirChoudhury-26/SecondYearProgramming | STL/Set-question.cpp | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
multiset<int>ms;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
ms.insert(x);
}
for(auto it:ms)
cout<<it<<" ";
cout<<endl;
return 0;
}
| ALGO | 0.999643 | 3.92705 |
a93c4efb-fdb3-4992-89b6-b12deef42faa | CDPS/Competitive-Programming | Codeforces/Ladders/1300/96-Jzzhu and Sequences.cpp | #include <bits/stdc++.h>
using namespace std;
#define m 1000000007
int main(){
long a,b,n;
scanf("%ld %ld %ld",&a,&b,&n);
a = ( (a%m) + m)%m;
b = ( (b%m) + m)%m;
if( n%6==1){
printf("%ld",a);
}else if( n%6==2){
printf("%ld",b);
}else if ( n%6==3){
printf("%ld", (... | ALGO | 0.999932 | 4.218139 |
c1fa5266-59fe-4c3b-8362-aa1de6ffd9d7 | rishii3468/DSA | mergeSort/mergeSort.cpp | #include<iostream>
#include<vector>
using namespace std;
void merge(vector<int>& a,vector<int>& b,vector<int>& res){
int i = 0;
int j = 0;
int k = 0;
while(i<a.size() && j<b.size()){
if(a[i]<b[j]) res[k++] = a[i++];
else res[k++] = b[j++];
if(i==a.size()){
while(j<b.... | ALGO | 0.999991 | 4.853302 |
8bf4b2bd-53d9-49cc-a572-606bd0bff16e | srikumar947/effective-barnacle | LC/Apple/Medium/search_2D_matrix_2.cpp | /*
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
Integers in each row are sorted in ascending from left to right.
Integers in each column are sorted in ascending from top to bottom.
Consider the following matrix:
[
[1, 4, 7, 11, 15],
[2, ... | ALGO | 0.999995 | 6.943542 |
289d60ce-ac9a-49d6-9674-533e7b41fd5f | jaydeep-savaliya/__Cplus | count_set_bit.cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> countBits(int n){
vector<int> ans(n+1);
ans[0] = 0;
for(int i=1;i<=n;i++){
ans[i] = ans[i/2] + i%2;
}
// for(int i=0;i<=n;i++){
// ans[i] = __builtin_popcount(i);
// }
return ans;
}
int main(){
int n = 5;
vecto... | ALGO | 0.999938 | 4.367762 |
2bfd6cce-d406-4f75-9a39-e460d05f883d | Fisher87/leetcode | cplus/wiggle-subsequence.cpp | // Time: O(n)
// Space: O(1)
class Solution {
public:
int wiggleMaxLength(vector<int>& nums) {
if (nums.size() < 2) {
return nums.size();
}
int length = 1, up = 0;
for (int i = 1; i < nums.size(); ++i) {
if (nums[i - 1] < nums[i] && (up == 0 || up ... | ALGO | 0.999979 | 5.88276 |
bd1a6b32-ee2c-41a8-b0e0-9baa6bb888ce | FriskTheFallenHuman/source-sdk-2013-template | mp/src/vgui2/vgui_controls/FileOpenDialog.cpp | #define PROTECTED_THINGS_DISABLE
#if !defined( _X360 ) && defined( WIN32 )
#include "winlite.h"
#include <shellapi.h>
#elif defined( POSIX )
#include <stdlib.h>
#define _stat stat
#define _wcsnicmp wcsncmp
#elif defined( _X360 )
#else
#error
#endif
#undef GetCurrentDirectory
#include "filesystem.h"
#include <sys/stat... | TOOL | 0.904618 | 4.840674 |
b6f8247f-1e65-4969-8f44-d6bcc546ac10 | ishandutta2007/codeforces | sohsoh/normal/178/B2.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sep ' '
#define endl ... | ALGO | 0.999983 | 4.960155 |
4e89c6ae-f6d1-4d3f-9cf6-f21d4075ea01 | Regis-1/cpp-aoc-2021 | day8/main.cpp | #include "day8.hpp"
#include <iostream>
#include <numeric>
int main (int argc, char *argv[]) {
const std::string inputPath{"../data/day8/input.txt"};
std::cout
<< "The answer to Day 8 (part one) is: "
<< day8::countDigitsWithNSegments(day8::extractDisplayDigitsFromInputFile(inputPath), {2, 3, ... | ALGO | 0.989415 | 6.41369 |
c085b9ef-e2bf-401f-8329-7591bfcd3a43 | Amrinderdeep/DS | practical_2.cpp | #include <iostream>
using namespace std;
//To delete an element from an array
int deleteArray(int arr[], int capacity, int val){
int pos;
for (int i = 0; i<= capacity ; i++){
if (arr[i] == val){
pos = i;
break;
}
}
cout<<pos<<endl;
for (int i = pos; i ... | ALGO | 0.99842 | 4.616511 |
21a57f63-f18f-4cf7-95c3-10fbb659e10b | meherajmithun/problem-solving | codeforces/1760D.cpp | /*
IN THE NAME OF ALLAH
Author: Meheraj Mithun
Bangladesh University Of Business and Technology
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> v... | ALGO | 0.999596 | 4.817541 |
11ac60c4-53a4-4fcf-a3bd-3c31e266d3af | JDRaftKeeper/RaftKeeper | src/ZooKeeper/ZooKeeper.cpp | #include "ZooKeeper.h"
#include <functional>
#include "KeeperException.h"
#include "ZooKeeperImpl.h"
#include "pcg-random/pcg_random.hpp"
#include "Common/Exception.h"
#include "Common/StringUtils.h"
#include "Common/randomSeed.h"
#include "common/find_symbols.h"
#include "common/logger_useful.h"
#include <Poco/Net/N... | TOOL | 0.921572 | 7.045486 |
95539aff-2903-4191-ab8b-5a50dd960248 | thegamer1907/Code_Analysis | Graphs/782.cpp | #include<bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin>>n>>t;
string s;
cin>>s;
for(int j = 0; j < t; j++)
for(int i = 0; i < n; i++) {
if(s[i]=='B'&& s[i+1]=='G') {
swap(s[i], s[i+1]);
i++;
}
... | ALGO | 0.999853 | 3.394015 |
f0baf3c0-1ba6-4cfa-a752-5c532b5864ff | pnaskardev/Leetcode | 111. Minimum Depth of Binary Tree/prog.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
class TreeNode
{
public:
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)... | ALGO | 0.999893 | 6.147465 |
dde35456-f1c1-49f3-9c56-2ceae26ce8e3 | aditya-popli/DSA | Implement Queue using Stacks/solution.cpp | class MyQueue {
public:
stack<int> s;
MyQueue() {
}
void push(int x) {
if(this->s.empty()){
this->s.push(x);
return;
}
int top = this->s.top();
this->s.pop();
push(x);
this->s.push(top);
}
int pop() {... | ALGO | 0.999806 | 5.500948 |
036587c6-7c85-40a8-a2fb-b7a9ff6fc56a | lamwinglung/.lcpr | 2806.account-balance-after-rounded-purchase_20240612.cpp | /*
* @lc app=leetcode.cn id=2806 lang=cpp
* @lcpr version=30203
*
* [2806] 取整购买后的账户余额
*
* https://leetcode.cn/problems/account-balance-after-rounded-purchase/description/
*
* algorithms
* Easy (62.61%)
* Likes: 16
* Dislikes: 0
* Total Accepted: 12.9K
* Total Submissions: 18.9K
* Testcase Example: ... | ALGO | 0.970961 | 4.653351 |
63d3fb0c-f192-48ca-8dcb-bff690a23bf0 | sgvaidyas/C255_day3 | p11.cpp | #include <iostream>
using namespace std;
int main()
{
int n,i;
int a[100];
cout<<"Please enter a value for n ";
cin>>n;
cout<<"\n Enter the elements =\n";
for(i=0;i<n;i++)
cin>>a[i];
int temp=a[0];
for(i=0;i<n-1;i++)
{
a[i] = a[i+1];
}
a[n-1]=temp;
cout<<"\n element in the end = ";
for(i=0;i<n;i+... | ALGO | 0.999443 | 3.016233 |
f5832f27-20c5-4f71-8076-d55a580046dd | Xiaoyu0601-Wang/usrsdm_controller | uwsim_osgworks/src/osgwTools/TangentSpaceGeneratorDouble.cpp | // This code was taken from OSG v2.8.5 and modified to use double precision.
#include <osgwTools/TangentSpaceGeneratorDouble.h>
#include <osgwTools/Version.h>
#include <osg/Notify>
#include <osg/io_utils>
namespace osgwTools {
TangentSpaceGeneratorDouble::TangentSpaceGeneratorDouble()
: osg::Referenced(),
T_... | TOOL | 0.965864 | 6.367625 |
9ed2297e-809c-4cf3-aafa-2899aad396e8 | R2nin/projeto | c++/ExStrut04v01.cpp | #include <iostream>
#include <string>
using namespace std;
struct Aluno {
string nome;
float nota1;
float nota2;
};
int main() {
const int NUM_ALUNOS = 3;
Aluno alunos[NUM_ALUNOS];
// Leitura dos dados dos alunos
for (int i = 0; i < NUM_ALUNOS; i++) {
cout << "Digite o nome do al... | ALGO | 0.99915 | 6.612692 |
40dccf33-dfba-43b2-93be-5aa93e863ab0 | ishandutta2007/codeforces | redstar_13/normal/353/C.cpp | #include <bits/stdc++.h>
#define NN 100011
#define inf 1000000000000000LL
using namespace std;
typedef long long INT;
typedef pair<int, int> pii;
int a[NN], arr[NN];
INT sum[NN], tot[NN];
int main() {
int n,i,j;
cin>>n;
INT ans=0;
for(i=1; i<=n; i++) scanf("%d", a+i), sum[i]=sum[i-1]+a[i];
for(i=1; i<... | ALGO | 0.999751 | 3.046171 |
59e06af5-ac82-4923-ad31-48747c1935f7 | VishalSinghal96/DSA | patterns/pattern1.cpp | #include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int i=0;
while(i<n)
{
int j=0;
while(j<n){
cout<< "*"<<" ";
j=j+1;
}
cout<<endl;
i=i+1;
}
return 0;
} | ALGO | 0.999963 | 3.212909 |
67e4b241-aac2-42d3-83dd-157757024887 | shubhhtr/algo-toolbox | binarysearch.cpp | #include<iostream>
using namespace std;
int binarysearch(int* a, int n, int k){
int s=0;
int e=n-1;
int mid=s+(e-s)/2;
while(s<=e){
if(a[mid]==k){
return mid;
}
else if(a[mid]>k){
e=mid-1;
}
else{
s=mid+1;
}
mid... | ALGO | 0.999976 | 4.290473 |
eba4bc01-2b91-4343-92d2-02909b45b94e | IvelinStanchev/C-PlusPlus | LettersCount/main.cpp | #include <iostream>
#include <map>
using namespace std;
int main()
{
int n;
map<char, int> symbolsOccurrences;
cin>>n;
char symbols[n];
for (char i = 'a'; i <= 'z'; i++)
{
symbolsOccurrences[i] = 0;
}
cout<<"Enter "<<n<<" symbols"<<endl;
for (int i = 0; i < n; i++)
... | ALGO | 0.99913 | 3.289829 |
eb78789d-64c9-4845-888c-40c43f87fd84 | limyunkai19/competitive-programming-codes | UVa Online Judge Problem/739 - Soundex Indexing.cpp | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main()
{
int encode[26] = {0, 1, 2, 3, 0, 1, 2, 0, 0, 2, 2, 4, 5, 5, 0, 1, 2, 6, 2, 3, 0, 1, 0, 2, 0, 2};
string name;
int num_left, pre;
printf(" NAME SOUNDEX CODE\n");
while(cin >> name){... | ALGO | 0.993309 | 3.417565 |
baa322a7-ea30-4afd-ac7f-3c9db65fac4c | bbaJay749/Algorithm | BOJ_1600_말이 되고픈 원숭이.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <tuple>
using namespace std;
int K, W, H;
int temp;
int INF = 987654321;
int K_min = INF;
vector<pair<int, int> > pos_H = { { -1, -2 },{ -2, -1 },{ -2, 1 },{ -1, 2 },{ 1, -2 },{ 2, -1 },{ 2, 1 },{ 1, 2 } };
vector<p... | ALGO | 0.999172 | 4.023061 |
8c4327a2-106b-4dea-8616-eea137864d5d | VRER1997/OpencvWorkspace | chapter_07/three.cpp | //
// Created by c1over on 2019-07-07.
//
#include <vector>
#include <opencv2/opencv.hpp>
using namespace cv;
using namespace std;
int main(){
Mat srcImage = imread("3.jpg");
Mat tempImage, dstImage;
Canny(srcImage, tempImage, 50, 200);
cvtColor(tempImage, dstImage, COLOR_GRAY2BGR);
vector<Vec2f... | ALGO | 0.920897 | 4.072247 |
017e78d2-aa64-4729-bd7f-ba592a65327d | whitenightwu/caffe-quant-TI | tools/compute_image_mean.cpp | #include <stdint.h>
#include <algorithm>
#include <memory>
#include <string>
#include <utility>
#include <vector>
#include "gflags/gflags.h"
#include <glog/logging.h>
#include "caffe/proto/caffe.pb.h"
#include "caffe/util/db.hpp"
#include "caffe/util/io.hpp"
using namespace caffe; // NOLINT(build/namespaces)
using... | DATA | 0.918171 | 6.559195 |
0b72ffff-461d-4a5f-b677-e339e7798b99 | SebasGT08/Vison_Practica_3_1 | app/src/main/cpp/parte2.cpp | #include "parte2.h"
#include "LBP.cpp" // Incluir el archivo LBP.cpp
#include <android/log.h>
#include <android/asset_manager.h>
#include <vector>
#include <string>
#include <opencv2/opencv.hpp>
#include <cfloat>
#include <cmath>
#define LOG_TAG "PROYECTO_VISION"
#define LOGD(...) __android_log_print(ANDROID_LOG_DEBUG... | TOOL | 0.979994 | 3.782418 |
7512c6a1-d9d6-4477-ba91-4ab478132a96 | chunyang-wen/leetcode | MinimumPathSum.cpp | class Solution {
public:
int minPathSum(vector<vector<int> > &grid) {
if (grid.empty())
return 0;
int m = grid.size();
int n = grid[0].size();
int left,right;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
if (!i && !j)
... | ALGO | 0.999956 | 5.536512 |
04bdd86b-62c3-4ee3-9b44-ede48b5b5e28 | KatsuyaKikuchi/ProgrammingContestCpp | AtCoder/Virtual/20211030/A.cpp | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <iomanip>
#include <cmath>
#include <map>
#include <set>
using namespace std;
using ll = long long int;
using pll = pair<ll, ll>;
#define FOR(i, n, m) for(ll i = (m);(i)<(n);++... | ALGO | 0.99999 | 4.074449 |
2259da23-94d3-4212-819f-90bc37f16323 | KenilGondaliya/Learn-Cpp | 12_binarySearch/SquareRoot.cpp | #include <iostream>
using namespace std;
int squareRoot(int n)
{
int start = 0;
int end = n;
while (start <= end)
{
int mid = start + (end - start) / 2;
int square = mid * mid;
int ans = -1;
;
if (square == n)
{
return mid;
}
... | ALGO | 0.999983 | 4.313957 |
b4e5b1e5-f35d-4e3e-86ba-d850dce84e80 | TurakhiaLab/DP-HLS | kernels/global_affine/kernel_global_affine.cpp | #include "frontend.h"
// >>> Global Affine Implementation >>>
void GlobalAffine::PE::Compute(char_t local_query_val,
char_t local_reference_val,
score_vec_t up_prev,
score_vec_t diag_prev,
score_... | ALGO | 0.997699 | 4.327697 |
7b46b6fd-e1fe-4ce3-a07a-8a7bd0332a9e | deysanjay285/light_oj | 1245_Harmonic Number (II).cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll t,n,cases=1,rt,sum;
scanf("%lld",&t);
while(t--)
{
scanf("%lld",&n);
rt=sqrt(n);
sum=0;
for(ll i=1;i<=rt;i++)
sum=sum+n/i;
for(ll i=1;i<=rt;i++)
{
s... | ALGO | 0.999812 | 3.830083 |
62cb8e1c-6438-4a09-bfb3-79e2e3d06902 | ankivStar/Data-Structure-and-Algorithms | 14_Assignment_Trees/2_Node_with_max_child_sum.cpp | #include<iostream>
using namespace std;
#include <vector>
#include<queue>
#include "..\14__Trees\02__Tree_Node.h"
TreeNode<int> *takeInput(){
int rootData;
cin >> rootData;
TreeNode<int> *root = new TreeNode<int>(rootData);
queue<TreeNode<int> *> pendingNodes;
pendingNodes.push(root);
while(!... | ALGO | 0.999956 | 5.128266 |
b456759c-058c-42fd-aed7-af673bc5c21f | ishandutta2007/codeforces | mohamedabookail/normal/1512/B.cpp | /**
* author: Mohamed Abo Okail
* created: 1O/O4/2O21
**/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t; cin >> t;
while(t--... | ALGO | 0.99996 | 4.476534 |
78841caa-da3b-4009-b3f2-97153bd6a072 | Hanna111111/C-FOR- | Print all integers from A to B inclusive.cpp | /*
For40. Integers A and B are given (A <B). Print all integers from A to B inclusive;
in this case, the number A should be displayed 1 time, the number A + 1 should be displayed 2 times, etc.
*/
#include <iostream>
using namespace std;
int main()
{
int A,B;
cout << "Please, enter A: " << endl;
cin >>... | ALGO | 0.999221 | 3.792321 |
c3cf7bd3-1ea2-4582-86cd-202b568ce07d | SuperHellCat/https-github.com-EpicGames-UnrealEngine | Engine/Source/ThirdParty/ICU/icu4c-53_1/source/layout/IndicReordering.cpp | #include "LETypes.h"
#include "OpenTypeTables.h"
#include "OpenTypeUtilities.h"
#include "IndicReordering.h"
#include "LEGlyphStorage.h"
#include "MPreFixups.h"
U_NAMESPACE_BEGIN
#define loclFeatureTag LE_LOCL_FEATURE_TAG
#define initFeatureTag LE_INIT_FEATURE_TAG
#define nuktFeatureTag LE_NUKT_FEATURE_TAG
#define ak... | TOOL | 0.871185 | 6.084921 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.