uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
cf96fd55-8e2d-4216-9762-01658cdb6583 | manikanta2901/ubuntu | .history/SRM/elab/DataStructures/Queue/Q21_20201101160037.cpp | #include <stdio.h>
int main()
{
int array123 [100];
long int N,i;
long long int prod;
scanf("%li",&N);
long int big,bigger,biggest,temp;
for(i=0;i<N;i++)
{
scanf("%li",&array123[i]);
}
printf("-1\n-1\n");
big=array123[0];
bigger=array123[1];
if(array123[0]>bigger)
... | ALGO | 0.999971 | 3.105084 |
19b1c300-96d7-43fe-8c56-e4c2f0aa4aab | LavishGulati/LeetCode | Sort/MinimumSubsequenceInNon-IncreasingOrder.cpp | // Solution 1 -- O(nlogn) time and O(1) space
#define all(x) x.begin(), x.end()
#define pb push_back
class Solution {
public:
vector<int> minSubsequence(vector<int>& nums) {
sort(all(nums));
int sum = 0, n = nums.size();
for(int i = 0; i < n; i++){
sum += nums[i];
}
... | ALGO | 0.999979 | 5.94248 |
20b3f08c-0369-49d2-8def-fe2380185c7b | cyrilmaitre/white_hole | lib/boost/boost_1_54_0/libs/math/tools/igamma_temme_large_coef.cpp | #include <boost/math/bindings/rr.hpp>
#include <boost/math/special_functions/log1p.hpp>
#include <boost/math/special_functions/erf.hpp>
#include <boost/math/constants/constants.hpp>
#include <map>
#include <iostream>
#include <iomanip>
using namespace std;
using namespace NTL;
using namespace boost::math;
//
// This ... | ALGO | 0.999417 | 4.62516 |
d092aa0e-15ad-4e1e-8f83-0d045f2ced19 | Deificz/Coding-Problems- | Combining Two Linked List.cpp | #include <stdio.h>
#include <stdlib.h>
/* Linked list node */
struct Node {
int data;
struct Node* next;
};
/* Function to create a new node with given data */
struct Node* newNode(int data)
{
struct Node* new_node
= (struct Node*)malloc(sizeof(struct Node));
new_node->data = data;
new_node->next = NULL;
retu... | ALGO | 0.999917 | 5.429363 |
f0491e7f-8a54-4151-893e-068424867371 | Pratik-Garud/CPP | tempCodeRunnerFile.cpp | // // problem => 01
// #include<iostream>
// using namespace std;
// int main(){
// int n,m;
// cout<<"Enter the number of Rows: ";
// cin>>n;
// cout<<"Enter the number of Columns: ";
// cin>>m;
// cout<<"Enter the elements of the array: ";
// int arr[n][m];
// for(int i=0;i<n;i++){
/... | ALGO | 0.993235 | 3.509866 |
a925f69d-467c-43cd-b280-961646a0631b | Ray2sk8/AtCoder_ABC | 101-200/116/B/ans.cpp | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
// #pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio... | ALGO | 0.999959 | 4.146859 |
52c2553a-a7de-453b-aff4-c83ae8a12d72 | HPC-AI-Team/lammps-fugaku-threadpool-sc23 | src/OPENMP/pair_lj_class2_coul_cut_omp.cpp | // clang-format off
/* ----------------------------------------------------------------------
Contributing author: Axel Kohlmeyer (Temple U)
------------------------------------------------------------------------- */
#include "pair_lj_class2_coul_cut_omp.h"
#include "atom.h"
#include "comm.h"
#include "force.h"
... | ALGO | 0.999231 | 7.197736 |
aae30463-33a3-4461-a2ea-a13d7544fed7 | jinzcdev/PTA | PAT_(Basic_Level)_Practice_(中文)/编程题/1101 B是A的多少倍.cpp | // https://pintia.cn/problem-sets/994805260223102976/exam/problems/type/7?problemSetProblemId=1478634052026146816
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
int d;
cin >> a >> d;
b = a.substr(a.length() - d) + a.substr(0, a.length() - d);
printf("%.2f", stod(b) / stod(a)... | ALGO | 0.99812 | 3.260601 |
66b1fbfa-3980-407b-9337-58629bfac687 | leihhang/daily_study- | leetcode/code/两数之和.cpp | class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int,int> m;
for(int i=0;i<nums.size();i++)
{
auto it = m.find(target-nums[i]);
if(it!=end(m))
{
return vector<int>{it->second,i};
}
... | ALGO | 0.999942 | 6.304512 |
e66519c3-6d6a-427e-81ee-9c85f90b1dc5 | MahbubHossainFaisal/Problem-Solving | Heap/Basics/Min-Heap.cpp |
#include<bits/stdc++.h>
using namespace std;
void display(int arr[])
{
cout<<"Max Heap: ";
for(int i=1;i<=7;i++)
{
cout<<arr[i]<<" ";
}
}
//Time complexity of this insert function will be nlog(n)
void Insert(int arr[],int n)
{
int temp,i=n;
temp=arr[n]; //storing the last element val... | ALGO | 0.999875 | 3.867827 |
034f569b-5bab-43a4-b9bb-0a74318e955a | snibug/algorithms | longest_increasing_subsequence.cpp | #include <vector>
#include <algorithm>
#include <utility>
using namespace std;
// returns indices of Longest Increasing Subsequence
// (strict = true) is tested
template<typename T>
vector<int> solveLIS(const vector<T> &dat, bool strict = true) {
int n = dat.size();
vector<pair<T, int>> st;
st.reserve(n);
vec... | ALGO | 0.999951 | 4.539337 |
c788536f-845d-4148-ab0e-3c5f95ce517a | jccarvalhosa/maratona | codeforces/abbyy/qualifying/b.cpp | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int root[1001], child[1001], valid[1001];
int main() {
int n, i, j, v, x, pos, t, flag;
cin>>n>>x;
vector<int> num;
for(i=1;i<=n;i++) {
cin>>v;
if(!v) root[i]=1;
else child[v] = i;
}
for(i=1;i<=n;i++) if(root[i]) {
t=0;
flag=... | ALGO | 0.999992 | 3.250885 |
7dd64dac-70d6-4e6d-9a9f-fa8d60f4763c | kuailedeguisu/GeneralKnowledgeSummary | CPlusPlus/Cpp_Primer_5th-master/Cpp_Primer_5th-master/C++Primer第五版课本源代码/3/arrayScores.cpp | #include <cstddef>
using std::size_t;
#include <vector>
using std::vector;
#include <iostream>
using std::cin; using std::cout; using std::endl;
int main ()
{
vector<unsigned> grades;
// count the number of grades by clusters of ten:
// 0--9, 10--19, . . . 90--99, 100
const size_t sz = 11;
unsigned scores[sz] ... | TOOL | 0.951282 | 4.630488 |
aeee7019-8fc5-4faf-9edd-a72f9ee1044d | maxywb/vsipl | sourceryvsipl++-2.3/share/sourceryvsipl++/benchmarks/expr/vmul_c.cpp | /** @file benchmarks/vmul.cpp
@author Jules Bergmann
@date 2006-01-23
@brief VSIPL++ Library: Benchmark for vector multiply using C arrays.
*/
/***********************************************************************
Included Files
****************************************************************... | TEST | 0.899232 | 5.080367 |
ba0d5384-0ef5-493e-882a-64817f3a55aa | shreyansh012/LeetCode | 1945-sum-of-digits-of-string-after-convert/1945-sum-of-digits-of-string-after-convert.cpp | class Solution {
public:
int getLucky(string s, int k) {
string ans;
for(int i=0;i<s.size();i++){
ans+=to_string(s[i]-96);
}
int an;
while(k){
an=0;
for(int i=0;i<ans.size();i++)
{
an+=ans[i]-'0';
... | ALGO | 0.999931 | 6.182743 |
ef382451-49dc-44df-adfa-f43b02ea4110 | raincross7/code-similarity | codes/train_code/problem134/problem134_171.cpp | #include <iostream>
#include <string>
using namespace std;
int lcs(string s1, string s2) {
int c[1005][1005];
int m = s1.length();
int n = s2.length();
s1 = " " + s1;
s2 = " " + s2;
int max1=0;
for (int i = 0; i <= m; i++) {
c[i][0] = 0;
}
for (int i = 0; i <= n; i++) {
... | ALGO | 0.999964 | 4.616588 |
bd000bf5-a72b-4d17-9262-4b67bc155ecc | Sohini-Purkait/DSA-Supreme-3.0 | 2-D Array/colSum.cpp | #include<iostream>
using namespace std;
int printColSum(int arr[][4], int rowSize, int colSize){
for(int col = 0; col < colSize; col++){
int sum = 0;
for(int row = 0; row < rowSize; row++){
sum += arr[row][col];
}
cout << sum << endl;
}
}
int main(){
int arr[... | ALGO | 0.990715 | 4.143914 |
ac69ede9-eb1e-41b1-95a4-547c7cd591b8 | harshit2017/hackerBlocks | von_neuman_loves_binary.cpp | //von_neuman_loves_binary.cpp
#include <iostream>
//#include <cstring>
//#include <algorithm>
using namespace std;
void input(int c[], int N)
{
for (int i = 0; i < N; ++i)
{
cin >> c[i];
}
}
void decimal(int a[], int N)
{
for (int i = 0; i < N; ++i)
{ int dec = 0, base = 1;
while (a[i] > 0)
{ int rem = a[... | ALGO | 0.999889 | 4.638821 |
f2cff9dd-5faa-40b2-9679-acc6f53e5f6c | prathamJaiswal1/Striver-TCS-NQT-sheet-Solution-on-array-and-sorting-section | Tcs Nqt Pyq solution - Striver sheet/4.cpp | /*
Problem Statement: You are given an array. The task is to reverse the array and print it.
Example 1:
Input: N = 5, arr[] = {5,4,3,2,1}
Output: {1,2,3,4,5}
Explanation: Since the order of elements gets reversed
the first element will occupy the fifth position, the second element occupies the fourth position and so ... | ALGO | 0.999954 | 5.660286 |
5aed7d6b-0ede-44ba-8f42-ff1bd4026042 | thakralishaan/Leetcode | 0058-length-of-last-word/0058-length-of-last-word.cpp | class Solution {
public:
int lengthOfLastWord(string s) {
int ans=0;
for(int i=s.size()-1; i>=0;i--){
if(s[i]==' ' && ans>0){
return ans;
}
if(s[i]!=' '){
ans++;
}
}
return ans;
}
}; | ALGO | 0.999655 | 5.515632 |
7a291c38-b574-474a-aef9-cb6e0cd76e62 | MahinAshraful/CodeWatch_Data | sample-data/p00011/s815019776.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int w, n, a, b;
char c;
cin >> w >> n;
vector<int> v(w);
for (int i = 0; i < w; i++) {
v[i] = i+1;
}
for (int i = 0; i < n; i++) {
cin >> a >> c >> b;
a--; b--;
swap(v[a], v[b]);
}
for (int &... | ALGO | 0.99999 | 3.605825 |
9ea63d76-4e4a-47b9-b17a-46528b801df2 | 00light00/PAT | Advanced/A1102.cpp | #include<bits/stdc++.h>
using namespace std;
const int MAX = 30;
struct node {
int val;
int lc, rc;
}tree[MAX];
int visit[MAX];
vector<int> leans, inans;
void leorder(int root, int n) {
leans.push_back(root);
for (int i = 0; i < n; i++) {
int p = leans[i];
if(tree[p].rc!=-1)
leans.push_back(tree[p].rc);
... | ALGO | 0.99993 | 3.661812 |
f02594d7-0477-4286-bb6d-646a8f39da6e | luowanqian/LeetCode | 101-200/141_LinkedListCycle/solution1.cpp | #include <iostream>
#include "List.h"
using namespace std;
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
bool hasCycle(ListNode *head) {
if (head == NULL)
re... | ALGO | 0.999252 | 4.803573 |
f9cd4b91-ba33-44fe-a107-b9976b98a772 | Johannyjm/c-pro | AtCoder/asa/2020/asa1229/c.cpp | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i < (n); ++i)
using namespace std;
using ll = long long;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int res = k;
rep(i, n-1) res *= k-1;
cout... | ALGO | 0.999971 | 3.564515 |
ee42329a-2b7e-4c31-9c21-9f7ae978cbfe | Saharsh979/CP-Algorithms | Striver SDE DSA Sheet/DAY 5 .4 Delete Nth node from end.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:
ListNode *removeNth... | ALGO | 0.999975 | 6.063812 |
a00bdc3a-efbe-4155-9a38-6fbad05b9fbc | Isaquehg/algorithms_and_data_structures | Sorting_Algorithms/Bubble_Sort.cpp | #include <iostream>
using namespace std;
void Bubble_Sort(int vetor[], int tam){
int i, j;//contadores
int trab;//transicao
int limite;//limita a analise da troca
bool troca = true;//verifica se e necessario trocar
//ordenando
limite = tam - 1;
while(troca){
troca = false;
... | ALGO | 0.999913 | 3.91929 |
9b72ed35-8feb-4f83-ada4-1d82184680aa | wjdansrl7/Coding-Test | inflearn/re_ch7/7_4해설.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
int n, m, s, e;
vector<pair<int, int>> graph[10001];
int Can(int mid)
{
vector<int> ch(n + 1, 0);
queue<int> Q;
ch[s] = 1;
Q.push(s);
while (!Q.empty())
{
int v = Q.front();
Q.pop()... | ALGO | 0.999834 | 4.278912 |
9d741a9d-0686-478f-8df6-bad47b105465 | ljw020711/Problem_Solving | 정렬I/11650.cpp | #include <iostream>
#include <vector>
using namespace std;
int n;
vector<pair<int, int>> coordinate;
vector<pair<int, int>> tmp;
void merge(int st, int en)
{
int mid = (st + en) / 2;
int a_idx = st;
int b_idx = mid;
for(int i = st; i < en; i++)
{
int x_a = coordinate[a_idx].first;
int y_a = coordi... | ALGO | 0.999995 | 5.192771 |
a35cfa8b-2078-43fb-84c4-f0153ecaecf0 | Hypn0tised-ysy/stock-project | eigen-3.4.0/bench/quat_slerp.cpp | #include <iostream>
#include <Eigen/Geometry>
#include <bench/BenchTimer.h>
using namespace Eigen;
using namespace std;
template<typename Q>
EIGEN_DONT_INLINE Q nlerp(const Q& a, const Q& b, typename Q::Scalar t)
{
return Q((a.coeffs() * (1.0-t) + b.coeffs() * t).normalized());
}
template<typename Q>
EIGEN_DONT_INL... | ALGO | 0.987623 | 6.263251 |
41d4d2fd-7137-4ab4-a9cc-b0b4667899c6 | asmit404/DSA | Strings/Check for Anagram.cpp | #include <iostream>
#include <unordered_map>
#include <string>
using namespace std;
bool checkAnagram(const string &s1, const string &s2)
{
// If lengths of the strings are not equal, they cannot be anagrams
if (s1.length() != s2.length())
return false;
// Create a hash map to count occurrences of... | ALGO | 0.999903 | 6.655717 |
263471a9-f03e-409d-a5f1-e329a403c91f | domschrei/maxpre-mallob | src/LS.cpp | void Preprocessor::tryLSBCE(int lit, hashset<int>& deletedClauses, hashset<int>& touchedList, vector<pair<int, int> >& blockedClauses) {
for (int c1i : pi.litClauses[lit]) {
if (deletedClauses.count(c1i)) continue;
const vector<int>& c1 = pi.clauses[c1i].lit;
bool f = false;
for (int c2i : pi.litClauses[litNeg... | ALGO | 0.999136 | 4.666233 |
6b215488-07d0-44d2-898e-dea578a7fd72 | cacti23/leetcode-buster | 0146-lru-cache/0146-lru-cache.cpp | class LRUCache {
public:
class Node {
public:
int key;
int val;
Node* prev;
Node* next;
Node(int _key,int _val) {
key = _key;
val = _val;
}
};
// delcare head and tail
Node* head = new Node(-1, ... | ALGO | 0.999621 | 6.273737 |
ace0bdc3-e8c8-46e2-98f1-a34755577f1f | lauralima6/edb-trabalho1 | exer2.cpp | #include <iostream>
#include <vector>
using namespace std;
int buscaBinariaIterativa(vector<int>& A, int chave) {
int esquerda = 0;
int direita = A.size() - 1;
while (esquerda <= direita) {
int meio = esquerda + (direita - esquerda) / 2;
if (A[meio] == chave) {
return meio;
... | ALGO | 0.999883 | 6.164488 |
4907afb1-6fd2-492f-b1f6-eaece5550bef | rv-smx/gem5 | src/systemc/tests/systemc/misc/cae_test/general/control/loop/while_fsm/while_fsm.cpp | /*****************************************************************************
while_fsm.cpp --
Original Author: Rocco Jonack, Synopsys, Inc., 1999-07-29
*****************************************************************************/
/****************************************************************************... | ALGO | 0.984224 | 3.464247 |
92286169-d99d-4976-8248-c9d673310ec1 | MaheshChowdary2004/CRYPTO | RSA ALGORITHM.cpp | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
// Function to calculate Greatest Common Divisor (GCD)
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// Function to check if a number is prime
int isPrime(int n) {
if (n <= 1)
return 0; // Not a prime number
... | ALGO | 0.99995 | 4.941528 |
58d81db2-f563-431d-b1b6-6c134c5595bb | drshn-k/LeetCode-Problems | 0783-minimum-distance-between-bst-nodes/0783-minimum-distance-between-bst-nodes.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.999974 | 6.821957 |
162df859-f8dc-4eba-add2-0ac43e3eafc6 | emptysky2022/algorithm | algorithm/number_10757.cpp | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<sstream>
using namespace std;
int main(){
string A, B;
vector<string> addResult;
int digitCheck = 0, res;
cin >> A >> B;
int pushZeroCount = max(A.length(), B.length()) - min(A.length(), B.length());
reverse(A.be... | ALGO | 0.999997 | 4.714862 |
9df634ce-536e-474b-8c12-ab77d116fb0b | SMiles02/CompetitiveProgramming | Codeforces/CF 1400 - 1499/CF1479/CF1479B/CF1479B/CF1479B1.cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> nextO[100001];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n,x=0,y=0,ans=0;
cin>>n;
int a[n];
nextO[n].push_back(n);
for (int i=0;i<n;++i)
{
cin>>a[i];
nextO[i].push_back(n);
}
for (int i=n-1;i... | ALGO | 0.999963 | 4.038523 |
e19ae993-4f1c-47d4-a0aa-d5609a14fa98 | raincross7/code-similarity | codes/train_code/problem457/problem457_264.cpp | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
const double PI = 3.1415926535;
ll... | ALGO | 0.999967 | 3.648062 |
fb6a0781-b652-402d-9f9e-e63e34c4fa54 | Rohan2309/dsa450 | striver/graph/copyGraph.cpp | #include <bits/stdc++.h>
using namespace std;
class Node {
public:
int val;
vector<Node*> neighbors;
Node() {
val = 0;
neighbors = vector<Node*>();
}
Node(int _val) {
val = _val;
neighbors = vector<Node*>();
}
Node(int _val, vector<Node*> _neighbors) {
... | ALGO | 0.99997 | 5.599806 |
281c804c-0c5a-433a-b98b-f6e114039730 | ishandutta2007/codeforces | -is-this-fft-/normal/185/A.cpp | #include <iostream>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
struct Modint {
ll val;
Modint (ll _val = 0)
: val(_val % MOD) {}
Modint operator+ (Modint other) const {
return Modint(val + other.val);
}
void operator+= (Modint other) {
val += other.val;
val %... | ALGO | 0.999989 | 4.105077 |
a2a890fd-856e-4310-b3e7-b3d5bd82e8bf | thermotools/lammps_mie_fh | src/npair_half_bin_newtoff.cpp | // clang-format off
#include "npair_half_bin_newtoff.h"
#include "neigh_list.h"
#include "atom.h"
#include "atom_vec.h"
#include "molecule.h"
#include "domain.h"
#include "my_page.h"
#include "error.h"
using namespace LAMMPS_NS;
/* ---------------------------------------------------------------------- */
NPairHalfB... | ALGO | 0.998467 | 6.158107 |
d744630f-6aeb-4c59-967f-39299e12fcf1 | MichaelLazarevic/FolioWork | Year 1 - 3 Programming Assignments/Source.cpp | // Assignment 1.
// Created 27/10/15
#include <iostream>
#include <ctime>
#include <limits>
using namespace std ;
void instructions()
{
// Subprogram to output instructions for user.
cout << "There are twenty one coins." << endl;
cout << "You and the computer take turns to pick up the coins." << endl;
cout <... | ALGO | 0.991824 | 4.668102 |
a86b25c9-5669-403b-a1cb-f28682c7e874 | Twilight-Dream-Of-Magic/Algorithm_OaldresPuzzleCryptic | Template/extra/eigen/test/sparseLM.cpp | #include "main.h"
#include <Eigen/LevenbergMarquardt>
using namespace std;
using namespace Eigen;
template <typename Scalar>
struct sparseGaussianTest : SparseFunctor<Scalar, int>
{
typedef Matrix<Scalar,Dynamic,1> VectorType;
typedef SparseFunctor<Scalar,int> Base;
typedef typename Base::JacobianType JacobianT... | TEST | 0.953736 | 6.154785 |
94ce4aea-2b6a-4b51-8a30-8539db53be86 | MahinAshraful/CodeWatch_Data | sample-data/p00018/s056241734.cpp | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[5];
for (int i = 0; i < 5; i++){
cin >> a[i];
}
sort(a, a + 5);
for (int i = 4; i > 0; i--){
cout << a[i] << " ";
}
cout << a[0]<<endl;
} | ALGO | 0.999961 | 3.177395 |
33cb2097-589a-4760-ac27-9e0fd1a333d8 | jasonzhao3/WordHunter | OpenCV/extract_text.cpp | /**
* Extract_text
* -------------------------------------
* Author: Yang Zhao (<EMAIL>)
* Author2: Shuo Liu
* Mentor: David Chen & Sam Tsai
* -------------------------------------
*/
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <string>
#include <math.h>
#include "OCR.h" //opencv als... | TOOL | 0.98344 | 4.429203 |
11196b5b-aaa9-4467-8afe-843197d5120f | duy-debug/dsa | Algorithm/Search/Ma_Nguon/bai1-1.cpp | #include <stdio.h>
#include <stdlib.h>
#define M 6 // Kich thuoc bang bam
// Dinh nghia cau truc Node cho bang bam
struct Node {
int key;
struct Node *next;
};
typedef struct Node Node;
// Khoi tao bang bam
void init(Node *B[]) {
for (int i = 0; i < M; i++) {
B[i] = NULL; // Tat ca vi tri deu NUL... | ALGO | 0.999959 | 5.023691 |
42c7fa33-fa24-4f44-b9e6-8494ef8670d7 | b3xul/Systems_Programming_2022 | Exams/Challenge.cpp | // This is a personal academic project. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++, C#, and Java: http://www.viva64.com
//
// Created by bexul on 15/01/22.
//
// This is a personal academic project. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++, C... | ALGO | 0.970534 | 5.370426 |
f63af33a-71a2-4754-87b1-5176007bbc5e | uayanaksha/codeforces | 1722/b/main.cpp | #include <bits/stdc++.h>
using namespace std;
int main(void){
int t;
cin >> t;
while(t--){
int n;
bool isConsidered = true;
string s1, s2;
cin >> n >> s1 >> s2;
for(int i{}; i < n; i++){
if(s1[i] == s2[i]) continue;
if((s1[i] == 'G' && s2[i] == 'B') ||
(s1[i] == 'B' && s2... | ALGO | 0.999237 | 4.360172 |
72c1da6d-a4c5-47b6-a0eb-166180085e33 | HyoungHoKim/webserv_prac | src/ServerConfig.cpp | #include "ServerConfig.hpp"
ServerConfig::ServerConfig() : autoindex(false), status_code(0), max_body_size(0)
{
}
ServerConfig::~ServerConfig()
{
}
bool ServerConfig::isValidDirective(std::string temp)
{
if (!temp.compare("listen") ||
!temp.compare("location") ||
!temp.compare("root") ||
!temp.compare("method... | WEB | 0.933866 | 4.033009 |
de433eed-05a0-46a7-84b8-80159583498c | nikagokh/finalProject | finaluri.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main() {
float x1, y1, x2, y2;
cout << "Enter the coordinates of point A(x1,y1): ";
cin >> x1 >> y1;
cout << "Enter the coordinates of point B(x2,y2): ";
cin >> x2 >> y2;
float dAB = sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y... | ALGO | 0.999013 | 4.351835 |
9e9c583d-6d8b-4516-be25-46ed3b106a41 | iamss0/week_6_assignment_2 | week_6_assignment_2_a3.cpp | // Write a program to print the matrix in wave form.
#include<iostream>
using namespace std;
int main(){
int m,n;
cout<<"Enter no. of col matrix: ";
cin>>n;
cout<<"Enter no. of row matrix: ";
cin>>m;
int a[m][n];
cout<<endl<<"rnter elements for the matrix:"<<endl;
for(int i =0; i<n;i++)... | ALGO | 0.997974 | 3.893829 |
7cb8477f-e92d-4d78-b0fb-a52d6034aef7 | AlexanderDev2004/CPP_Alex | rumus kerucut.cpp | #include <iostream>
using namespace std;
int main (){
float v, r, s, t, Lp;
const float phi = 3.14;
cout<< "Alexander agung raya"<<endl;
cout<< "X TKJ-1"<<endl;
cout<< "6"<<endl<<endl;
cout<<"Volume kerucut"<<endl;
cout<<"inputkan r : " <<endl;
cin>> r;
cout<<"inputan t : "<<endl;
cin>> t;
cout<< "inpu... | ALGO | 0.989918 | 3.605696 |
13791339-0bf9-407a-9891-73a557753476 | suziinee/Backjoon | 삼성 코테 기출/예술성.cpp | #include <iostream>
#include <vector>
using namespace std;
#define MAXN 29
int N;
int map[MAXN][MAXN];
int back[MAXN][MAXN];
struct GROUP {
int y, x; //시작 위치
int n; int cnt; int cur; //원래 숫자, 그룹 크기, 현재 번호
};
vector<GROUP> group;
int side_count[950][950]; //[중심 그룹][인접 그룹]
const int dx[] = { 0, 1, 0, -1 };
const int... | ALGO | 0.999968 | 4.165316 |
b3f4cb97-b274-4af3-9aab-637493b55a32 | abbash77/DSA | 1162-as-far-from-land-as-possible/1162-as-far-from-land-as-possible.cpp | class Solution {
public:
int maxDistance(vector<vector<int>>& grid) {
int n=grid.size();
int m=grid[0].size();
int z=0;
queue<pair<pair<int,int>,int>> q;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(grid[i][j]==1){
q.push({{i,... | ALGO | 0.99993 | 5.486754 |
25241704-3aee-493b-9214-b2366c8e2d8d | steward-fu/sdl2 | swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/DDG.cpp | using namespace llvm;
static cl::opt<bool>
CreatePiBlocks("ddg-pi-blocks", cl::init(true), cl::Hidden, cl::ZeroOrMore,
cl::desc("Create pi-block nodes."));
#define DEBUG_TYPE "ddg"
template class llvm::DGEdge<DDGNode, DDGEdge>;
template class llvm::DGNode<DDGNode, DDGEdge>;
template class llvm... | TOOL | 0.858132 | 7.939373 |
995c270f-edb2-421e-91c1-25faa26ccc19 | silverwhere/Self-Driving-Car-Nanodegree---Udacity | Project 7 - Highway Driving Path Planning/src/Eigen-3.3/unsupported/doc/examples/MatrixLogarithm.cpp | #include <unsupported/Eigen/MatrixFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
using std::sqrt;
MatrixXd A(3,3);
A << 0.5*sqrt(2), -0.5*sqrt(2), 0,
0.5*sqrt(2), 0.5*sqrt(2), 0,
0, 0, 1;
std::cout << "The matrix A is:\n" << A << "\n\n";
std::cout << "... | ALGO | 0.998278 | 3.621207 |
12515415-b589-49a9-883d-f386f155f155 | LuisNav6/codigos-c- | eleva1/eleva1/main.cpp | //
// main.cpp
// eleva1
//
// Created by Luis Navarrete on 24/02/21.
//
#include <stdio.h>
//programa que eleva una base a una potencia utilizando una formula de procesamiento recursiva
//version 1
int eleva(int,int);
int main(){
int base, exponente, resultado;
printf("\nDame una base:");
scanf("%d",&b... | ALGO | 0.998371 | 4.187747 |
51dc5805-4f98-43b9-9795-c54f66077c16 | DysonHoang/Tin-Hoc | bachlieucoder/Ctc9.cpp | // Good wine must be aged for a long time...
// Hoang Duc Anh
#include <bits/stdc++.h>
#define Mx 10000000
#define ll long long
using namespace std;
int max1 = INT_MIN;
int min1 = INT_MAX;
bool ktnt(int x)
{
if (x < 2)
return 0;
for (int i = 2; i <= sqrt(x); i++)
if (x % i == 0)
retu... | ALGO | 0.999831 | 4.476431 |
fa2d82f2-6355-4c31-a901-a2d99820e53b | Mumbaikar007/Code | Logics/CallByReference.cpp | # include <iostream>
using namespace std;
void Increase( int *number){
cout << "Address: " << number << endl;
cout << "Value: " << *number << endl;
cout << "Increase: " << ++(*number) << endl;
}
int main(){
int a = 5;
Increase(&a);
cout << "Main's a: " << a << endl;
return 0;
} | ALGO | 0.987366 | 3.854621 |
cc9ed727-3f4c-46f2-8408-8a28eaec9937 | MrCryptoBeast/bitcoin.worldwideweb.digital | src/merkleblock.cpp | #include <merkleblock.h>
#include <hash.h>
#include <consensus/consensus.h>
std::vector<unsigned char> BitsToBytes(const std::vector<bool>& bits)
{
std::vector<unsigned char> ret((bits.size() + 7) / 8);
for (unsigned int p = 0; p < bits.size(); p++) {
ret[p / 8] |= bits[p] << (p % 8);
}
return... | ALGO | 0.999415 | 6.296853 |
e9c8bfb9-dcc5-482a-b508-9a0a76cfde3f | infinitex-tech/Oasis | EOS-dApp-development-tutorial-part-2/contracts/libc++/upstream/test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy.pass.cpp | // <algorithm>
// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter, class T>
// requires HasEqualTo<InIter::value_type, T>
// OutIter
// remove_copy(InIter first, InIter last, OutIter result, const T& value);
#include <algorithm>
#include <cassert>
#include "test_iterators.h"
tem... | TEST | 0.942464 | 6.513431 |
991d7ccb-7695-49c1-bc83-007543910704 | gagolews/datafusion | source-codes/cgal_qp_solver.cpp | /*** R
#' @title CGAL Quadratic Programming Solver
#' @author Marek Gagolewski
#' @description An R interface to the CGAL library QP solver.
#' Minimizes \eqn{ 0.5 x^T D x + c^T x + c0 }
#' subject to
#' \eqn{ Ax >=< b },
#' \eqn{ l <= x <= u }
#' with respect to \eqn{ x = (x_1, ..., x_n) }.
#'
#' @det... | ALGO | 0.999967 | 6.241989 |
73c68817-975f-4119-8279-9e3cea4b4f23 | LovroLulic/OOP-vjezbe | VJ8/Racunala.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
using namespace std;
class Racunalo {
protected:
string os;
public:
Racunalo(string operativniSistem) : os(operativniSistem) {}
virtual string getOS() const {
return os;
}
virtual ~Racunalo() {}
};
... | TOOL | 0.983212 | 5.858109 |
c172286c-574c-4126-a0ad-0ad638531371 | quachthetruong/LeetCode | c++/779_K-thSymbolinGrammar.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
int kthGrammar(int n, int k)
{
if (n == 1 || k == 1)
{
return 0;
}
int x = kthGrammar(n - 1, (k + 1) / 2);
if (x == 1)
{
if (k % 2 == 0)
{
re... | ALGO | 0.999993 | 5.093198 |
f4fae4ad-0e04-4f79-8ded-639fb9f04995 | AritraGanguly/DailyDSA | Arrays/Searching/CountInversion.cpp | #include <bits/stdc++.h>
using namespace std;
int countInversion(int ar[], int size)
{
int l = 0;
int h = size - 1;
int c = 0;
int cinvs = 0;
while (l < h)
{
cinvs++;
if (ar[l] > ar[h])
c++;
h--;
if (h == l)
{
h = size - 1;
... | ALGO | 0.999846 | 4.293746 |
418b5714-8f64-42ff-a847-9bbf527e5ee1 | ishandutta2007/codeforces | anz/normal/1328/E.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) { for (; b; a %= b, swap(a, b)); return a; }
int n, m;
vector <int> graph[200001];
int par[200001][20];
int lv[200001];
void DFS(int v, int p, int l)
{
//cout << "V : " << v ... | ALGO | 0.999992 | 4.817649 |
6f69ab72-a1d9-4c21-b330-ea902eb0daac | ishandutta2007/codeforces | ssrs_/normal/1736/C1.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
for (int i = 0; i < t; i++){
int n;
cin >> n;
vector<int> a(n);
for (int j = 0; j < n; j++){
cin >> a[j];
a[j]--;
a[j] -= j;
}
vector<vector<int>>... | ALGO | 0.999909 | 4.137426 |
d426791c-90ce-4e0d-8bc0-5c5f17589a13 | Ramcharan10122005/GFG | Difficulty: Medium/Sorting Elements of an Array by Frequency/sorting-elements-of-an-array-by-frequency.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
// Complete this function
// Function to sort the array according to frequency of elements.
vector<int> sortByFreq(vector<int>& arr) {
unordered_map<int, int> mp;
for (int n : arr) ... | ALGO | 0.999962 | 6.205157 |
08d94782-ab59-4d96-acbd-063f1b364ccb | RottenKiwi2004/EGCI211 | LinkedList/circular.cpp | #include <iostream>
using namespace std;
#include "circular.h"
int main() {
CircularLL ll;
ll.insertNode(10);
ll.insertNode(20);
ll.insertNode(30);
ll.insertNode(40);
ll.insertNode(50);
ll.insertNode(60);
ll.printLoop(1);
} | ALGO | 0.997802 | 3.592438 |
d1e3ea3a-9645-4780-bcf3-f6fee1252679 | Sy0307/Self_Practice_For_Algorithm | ABC/ABC 264/D.cpp | #include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 1e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define ford(i, a, ... | ALGO | 0.99976 | 4.279377 |
b3581d91-e71c-49ee-b1ab-981965f3dc61 | murtuCodeRed/CC | codeforces/cat1p.cpp | #include <bits/stdc++.h>
using namespace std;
void solve()
{
int n,i,j,len,k;
cin>>n;
if(n%2==0)
{
for(i=2,j=1;i<=n && j<=n;i+=2,j+=2)
{
cout<<i<<" "<<j<<" ";
}
}
else
{
cout<<3<<" ";
for(i=1,j=2;i<=n && j<=n;i+=2,j+=2)
{
... | ALGO | 0.99956 | 3.797261 |
dae1bfed-df7c-4cbc-b68a-373cacb8171a | rishabhrkr/geeksforgeeks_POTD | Queue Reversal.cpp | class Solution
{
public:
void helper(queue<int> &q){
if(q.size() == 0)
return;
int x = q.front();
q.pop();
helper(q);
q.push(x);
}
queue<int> rev(queue<int> q)
{
helper(q);
return q;
}
};
| ALGO | 0.999861 | 5.507467 |
ccac1723-a3fe-412e-a520-2557f09264df | sarvex/leetcode-nushell | solution/1000-1099/1058.Minimize Rounding Error to Meet Target/Solution.cpp | class Solution {
public:
string minimizeError(vector<string>& prices, int target) {
int mi = 0;
vector<double> arr;
for (auto& p : prices) {
double price = stod(p);
mi += (int) price;
double d = price - (int) price;
if (d > 0) {
... | ALGO | 0.999835 | 5.006067 |
fc8ee83c-055f-400f-b599-634fb7764419 | LS-01/HZOJ | easy/id_117.cpp | /*************************************************************************
> File Name: id_117.cpp
> Author: ls
> Mail:
> Created Time: Fri 09 Oct 2020 11:52:39 PM CST
************************************************************************/
#include <iostream>
using namespace std;
int is_back(int n){
int m... | ALGO | 0.999913 | 4.945657 |
3a00c0a7-f2bb-4929-901d-4192f6a8db33 | MazenMDev/Competitive-Programming | Learn/Loops/Shape3.cpp | #include <bits/stdc++.h>
using namespace std;
void fast_io() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
int main() {
fast_io();
int64_t number;
cin >> number;
for... | ALGO | 0.999909 | 3.811816 |
8485404b-21c2-4085-89b0-5e70066b4155 | Tahsin000/COMPETITIVE-PROGRAMMING | URI/C++/1866.cpp | #include <bits/stdc++.h>
using namespace std;
#define fr(i, n) for (ll i=0; i<n; i++)
#define frr(n, i) for (ll i=n-1; i>=0; i--)
#define ll long long int
vector<int> getvStr(string str)
{
int t =0;
std::vector<int> re;
for (int i=0; i<str.size(); i++)
{
if (str[i] != ' ')
{
t = t * 10 + ( str[i] - '0');
... | ALGO | 0.999821 | 4.299009 |
e7cacc50-9dbe-43de-aa17-0edf14aaa7e9 | thanhtoan1742/CSES | Graph Algorithms/Round Trip II/main.cpp | #include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 100;
#define sqr(a) ((a) * (a))
#define minimize(a, b) a = min((a), (b))
#define maximize(a, b) a = max((a), (b))
struct UW {
int u;
long long w;
UW(int _u = 0, long long _w = 0)
: u(_u), w(_w) {}
bool operator<(const UW& oth... | ALGO | 0.999949 | 4.435404 |
76e7362e-a145-4be2-b503-2799a0c8f138 | hdravna/CommDet | LinkPrediction/Snap-2.3/snap-core/cncom.cpp | /////////////////////////////////////////////////
// Connected Components
void TCnCom::Dump(const TCnComV& CnComV, const TStr& Desc) {
if (! Desc.Empty()) { printf("%s:\n", Desc.CStr()); }
for (int cc = 0; cc < CnComV.Len(); cc++) {
const TIntV& NIdV = CnComV[cc].NIdV;
printf("%d : ", NIdV.Len());
for (... | ALGO | 0.879486 | 4.539271 |
67331389-08bd-4b79-ae45-3529a5f2a157 | thundercumt/practices | simple/3-6.cpp | #include <iostream>
using namespace std;
//@requires m > 0 && n > 0
int gcd(int m, int n) {
if (m < 0 || n < 0) exit(-1);
if (n > m) return gcd(n, m);
if (n == 0) return m;
int r = m % n;
return gcd(n, r);
}
int main() {
int m, n;
while(cin >> m >> n) {
cout << gcd(m, n) << endl;
}
}
| ALGO | 0.999811 | 4.934922 |
a54b9a5d-a4f7-4e0f-aa23-a5230a7835c0 | paul2705/OI | OJ/lougu/P2842.cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
ll a,b;
ll mod_pow(ll a,ll b,ll mod){
a%=mod; ll ans=1;
while (b){
if (b&1) ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
int main(){
scanf("%lld%lld",&a,&b);
print... | ALGO | 0.999972 | 4.388594 |
b128f59e-0981-4864-91d5-30047de3ee07 | prabhxjottsingh/leetcode-practise-problems | String/Defanging an IP Address.cpp | //Tags: String
//Difficulty: Easy
//Problem Link: https://leetcode.com/problems/defanging-an-ip-address/
//Time Complexity: O(n) (time complexity of push_back function is O(1))
//Solution (I thought)
class Solution
{
public:
string defangIPaddr(string address)
{
string defangedIPaddr = "";
i... | ALGO | 0.923104 | 6.426455 |
54754622-eb31-44c3-937f-616256f11407 | manishsaini6421/leetcode-solutions | 234-palindrome-linked-list/234-palindrome-linked-list.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:
bool isPalindrome(Lis... | ALGO | 0.999797 | 5.843449 |
a88057ae-4320-4bef-b91e-d145ad802845 | ShabbirHasan1/samples-sandbox | DirectProgramming/C++/CombinationalLogic/MandelbrotOMP/src/mandelbrot.cpp | // Each of these methods calculate how deeply numbers on a complex plane remains
// in the Mandelbrot set. On top of the serial/scalar version, there is a
// cilk_for version, a pragma simd version, and a combined cilk_for/pragma simd
// version
#include "mandelbrot.hpp"
#include <complex>
#ifdef __INTEL_COMPILER
#in... | ALGO | 0.999792 | 6.951361 |
57108dfd-8085-499f-a71d-4de5c5ba23d2 | Nhypocrite/XJTU_Computer_Graphics_2021_lab02 | extern/libigl/include/igl/min.cpp | #include "min.h"
#include "for_each.h"
#include "find_zero.h"
template <typename AType, typename DerivedB, typename DerivedI>
IGL_INLINE void igl::min(
const Eigen::SparseMatrix<AType> & A,
const int dim,
Eigen::PlainObjectBase<DerivedB> & B,
Eigen::PlainObjectBase<DerivedI> & I)
{
const int n = A.cols();
... | ALGO | 0.999752 | 4.413821 |
77faa1d3-de82-4090-adcf-123ed387f7b9 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_1409_5.cpp | #include <bits/stdc++.h>
using namespace std;
map<int, int> xha, yha;
map<pair<int, int>, int> yox;
int main() {
ios_base::sync_with_stdio(false);
long long n, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
ans += (xha[a]++) + (yha[b]++) - (yox[make_pair(a, b)]++);
}
c... | ALGO | 0.999784 | 4.122902 |
e7ab2106-296e-4719-9fff-a1b8ca73f13e | Alok-2004/Data_structure_and_algo | Vector/sortZeroesandOne.cpp | // M-1 two pass method
/*
#include<iostream>
#include<vector>
using namespace std;
void sort01(vector<int>&v)
{
int n = v.size();
int noo = 0;
int noz = 0;
for(int i = 0; i<n; i++)
{
if(v[i] == 0) noo++;
else noz++;
}
for(int i = 0; i<n; i++)
{
if(i<noz) v[i]... | ALGO | 0.999787 | 4.280559 |
4d6ff4e2-8f04-47e0-b8ee-0e70fea70c52 | Ayushluthra2001/Codeforces | B - Card Game.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a1, a2, b1, b2;
cin >> a1 >> a2 >> b1 >> b2;
int count = 0;
int x = 0, y = 0;
if (a1 > b1) x++;
if (a2 > b2) x++;
if (b1 > a1) y++;
if (b2 > a2... | ALGO | 0.999719 | 3.986711 |
35d90fe0-e021-4f08-b9a7-b8d954b3bb6a | file-citas/via | llvm/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/unary_transform.pass.cpp | // <algorithm>
// template<InputIterator InIter, class OutIter,
// Callable<auto, const InIter::value_type&> Op>
// requires OutputIterator<OutIter, Op::result_type> && CopyConstructible<Op>
// constexpr OutIter // constexpr after C++17
// transform(InIter first, InIter last, OutIter result, Op op);
... | TEST | 0.926846 | 7.179457 |
cfe0c348-3da3-4aef-8503-94b6440eecf3 | clippy8/EnhancerForScannedImages | answers/1. Course Intro and OpenMP/pi_monte_carlo.cpp | #include <iostream>
#include <omp.h>
#include <random>
int main() {
int n = 100000000;
int total_hits = 0;
auto start_time = omp_get_wtime();
#pragma omp parallel
{
// Jeder Thread bekommt seinen eigenen Generator
unsigned int seed = omp_get_thread_num();
std::default_random_engine re(seed);
s... | ALGO | 0.999941 | 5.847417 |
156c3cf6-f0ec-48de-84c4-abaa0abacc91 | anujadurgade/DSA | DSA 3.cpp | #include <iostream>
using namespace std;
class Queue
{
int *q, front, rear;
int count;
int size;
public:
Queue(int size);
bool isFull();
bool isEmpty();
void enQueue(int item);
int deQueue();
int top();
void display();
void demo();
int menu();
};
Queue::Queue(int size)
{
front = 0;
rear = -1;
count =... | ALGO | 0.993923 | 4.037907 |
13c0498c-8584-42c2-925c-02ddbb40a36e | IliyanMihaylov/DNA_compression | shano/src/ShannonFano.cpp | #include "ShannonFano.h"
ShannonFano::ShannonFano(string text)
{
this->text = text;
this->fTable = new vector<ReferenceSymbol>();
}
ShannonFano::~ShannonFano()
{
fTable->clear();
delete tree;
for (auto i = codeEntity->begin(); i != codeEntity->end(); i++)
{
delete i->second;
}
}
string ShannonFano::Encode... | ALGO | 0.998054 | 4.166484 |
2108f638-de5e-48b7-af00-55601fa9822c | kaziabdullahfuad/Codeforces-Grind | 800 lvl problems/yetanotherpermdiv2c.cpp | #include<iostream>
#include<string>
#include<vector>
using namespace std;
void printVector(vector<int>v1){
vector<int>::iterator it;
for(it=v1.begin();it!=v1.end();it++){
cout<<*it<<" ";
}
cout<<endl;
}
void print2dvec(vector<vector<int>> v2){
for(auto row:v2){
for(auto col:row){
cout<<col<<" ";
}
... | ALGO | 0.999905 | 4.400635 |
c368a8bd-07a9-4cba-b0a3-e40911c61bba | kapil2570/leetcode-problems | 231-power-of-two/power-of-two.cpp | class Solution {
public:
bool isPowerOfTwo(int n) {
return n>0 && (n & (n-1)) == 0;
}
}; | ALGO | 0.996051 | 6.393394 |
ae037bf4-c41f-4afd-b5c5-4c76b213c08b | akshay0077/DSA | Searching_Sorting/pivot.cpp | #include <bits/stdc++.h>
using namespace std;
int getPivot(int arr[], int size)
{
int s = 0;
int e = size - 1;
int mid = s + (e - s)/2;
while(s < e)
{
// when your ele is lie in 1st line to plus mid into 1 s.
if(arr[mid] >= arr[0])
{
s = mid + 1;
}
... | ALGO | 0.999957 | 5.242888 |
d7727ca9-d569-4b0a-89a8-b90095950617 | Paradoxicaly/CompetitiveProgramming | Educational Codeforces Round 180 (Rated for Div. 2)/C_Coloring_Game.cpp | /*
Derrick (Tomato_Cultivator)
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define fi first
#define se second
#define all(x) begin(x), end(x)
#define sz(x) ((int)(x).size())
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rng(i,a,b) for (int i = (a); i < (b); ++i... | ALGO | 0.999773 | 5.181656 |
f27024e0-8476-41c0-bcf5-f9c30a9ed3c1 | AhmadKris/flutter_ahmad-krisdiantoro | 19_Dialog Bottom Sheet/praktikum/dialog_bottom_sheet/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.997971 | 6.786404 |
a61db4e0-6bfe-43f4-8a93-8147f31f4a56 | techchrism/kattis-solutions | solutions/a-new-alphabet.cpp | // Problem https://open.kattis.com/problems/anewalphabet
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <... | ALGO | 0.999618 | 4.080133 |
cf7f0748-c2f8-49d6-898c-e59497553477 | archbirdplus/mesa | src/amd/compiler/aco_lower_to_hw_instr.cpp | #include "aco_builder.h"
#include "aco_ir.h"
#include "common/sid.h"
#include <map>
#include <vector>
namespace aco {
struct lower_context {
Program* program;
Block* block;
std::vector<aco_ptr<Instruction>> instructions;
};
/* Class for obtaining where s_sendmsg(MSG_ORDERED_PS_DONE) must be done in a Prim... | TOOL | 0.963567 | 7.135587 |
310a33b0-3354-407f-9dab-f024e6d5dbb0 | Romu-ua/Atcoder | ABC/241/A.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(10);
for (int i = 0; i < 10; i++) {
cin >> a[i];
}
cout << a[a[a[0]]] << endl;
return 0;
} | ALGO | 0.99929 | 3.62137 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.