uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
58fdca40-0eb2-4c9e-866c-9e2a2949fcb4 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_12873_8.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, n, s, p;
cin >> k >> n >> s >> p;
cout << (k * (n + s - 1) / s + p - 1) / p;
return 0;
}
| ALGO | 0.999059 | 3.061198 |
91752fba-5ef4-425d-81a9-c63e7bdd10db | tschakravarty/clichouse-248 | src/Storages/MergeTree/MergeTreeIndexMinMax.cpp | #include <Storages/MergeTree/MergeTreeIndexMinMax.h>
#include <Interpreters/ExpressionActions.h>
#include <Interpreters/ExpressionAnalyzer.h>
#include <Interpreters/TreeRewriter.h>
#include <Parsers/ASTFunction.h>
#include <Poco/Logger.h>
#include <Common/FieldVisitorsAccurateComparison.h>
namespace DB
{
namespace... | TOOL | 0.985475 | 7.75675 |
3cb11380-dcb3-46f7-9e27-a7749391a532 | thisisyourfahi/CodeForces-Solutions | Difficulty 900/2102B.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
void solve() {
int n; cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
int median_value = abs(a[0]), median_required_position = (ceil) (n / 2.0) - 1;
for (int i = 0; i < n; i++) {
a[i] = abs(a[i]);
... | ALGO | 0.999911 | 5.44712 |
c5b0c905-4056-4a36-99dd-4d8268b5ca8c | UzairAsadBaig/Programming-Fundamentals | Lab 6,7,9/Assignment 6/t25.cpp | #include<iostream>
using namespace std;
struct vector
{
float x;
float y;
};
int main(){
int a[3]={23,12,10};
char b;
string s;
cout<<"Size of struct : " <<sizeof(vector )<<endl;
cout<<"Size of int : " <<sizeof(a )<<endl;
cout<<"Size of char : " <<sizeof(b)<<endl;
cout<<"Size of s... | ALGO | 0.911815 | 3.230306 |
9b34c442-d8e7-448b-b765-edfc10661553 | thevoid3301/AlgorithmStudy | leetcode/438.找到字符串中所有字母异位词.cpp | /*
* @lc app=leetcode.cn id=438 lang=cpp
*
* [438] 找到字符串中所有字母异位词
*/
// @lc code=start
class Solution {
public:
vector<int> findAnagrams(string s, string p) {
vector<int> a(26, 0), b(26, 0);
vector<int> res;
if(s.size() < p.size())
{
return {};
}
for(a... | ALGO | 0.999888 | 6.416825 |
be653b6a-47a4-48b4-ae44-f624e2ccbb90 | RomeshKTripathi/DSA | stack/previousGreater.cpp | #include<iostream>
#include<stack>
#include<vector>
using namespace std;
vector<int> previousGreater(vector<int> &v){
stack<int> s;
vector<int> res;
for(int i = 0;i<v.size();i++){
while(s.size() and s.top()<v[i])
s.pop();
if(s.size() == 0 ){
res.push_back(-1);
... | ALGO | 0.99998 | 4.58271 |
048fb76a-af5f-4b30-9130-abfcae979100 | SimLabQuantumMaterials/HybridHSDLA | flapw_opt/src/h_and_s_stripped.cpp | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <complex>
#include <omp.h>
#include "types4stripped.h"
#include "myCUDAwrapper.h"
extern "C" {
#include "timing.h"
}
#include <mkl_service.h>
#define NTHS 24
typedef std::complex<double> cx_double;
// declare some BLAS/LAPACK si... | ALGO | 0.997587 | 4.184746 |
cef1178d-4f62-4547-b8ca-2a866adba27b | ashrafulhc/30-Day-LeetCoding-Challenge | Week-2/Day13/solution-v1.cpp | class Solution {
public:
int findMaxLength(vector<int>& nums) {
unordered_map<int, int> mp;
int n = nums.size(), sum = 0, maxLen = 0;
if( n == 0 ) return 0;
mp[0] = -1;
for(int i=0; i<n; i++) {
sum += nums[i] ? 1 : -1;
if( mp.find(sum) != mp.end()... | ALGO | 0.999814 | 5.751013 |
9349ff89-398a-4995-8e97-e81c48899e07 | abhijeetaman007/Code-Practice-Backup | InterviewBit/#Practice/Daily/primeNumbers.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<bool> prime(n+1,true);
prime[0]=false;
prime[1]=false;
for(int i=2;i*i<=n;i++)
{
for(int j=i;i*j<=n;j++)
{
prime[i*j]=false;
}
}
for(int i=0;i<=n;i++)
{
if(prime[i])
cout<<i<<endl;
}
} | ALGO | 0.999838 | 4.133029 |
1283e8c0-2d99-41a3-a72f-7d799a32a468 | alexandraback/datacollection | solutions_5670465267826688_0/C++/Lia/main.cpp | #include <stdio.h>
using namespace std;
#define nmax 10005
int i, j, smn['z']['z'], sm, t, ii, l, x, lx, poz, sm1, sm2, sm3, semn[nmax];
char a['z']['z'], rap['z']['z'], c1, c2, pr, s[nmax], v[nmax], pr1, pr2, pr3;
bool rez;
void init()
{
a[1][1]=1; a[1]['i']='i'; a[1]['j']='j'; a[1]['k']='k';
a... | ALGO | 0.999992 | 3.495486 |
2097cb81-92f2-4008-b106-316a8d57986c | letmefly/gaga-cpp | lib/raknet/DependentExtensions/cat/src/math/montgomery/addsub/MonNegate.cpp | #include <cat/math/BigMontgomery.hpp>
using namespace cat;
void BigMontgomery::MonNegate(const Leg *in, Leg *out)
{
// -x = p - x, and handle borrow out by adding modulus
if (Subtract(CachedModulus, in, out))
while (Add(out, CachedModulus, out));
}
| ALGO | 0.881834 | 4.24231 |
e421b5bd-bd45-4558-ad61-a93eccd21283 | ashikurcmt126/problem-solving | GeeksforGeeks/Count number of elements between two given elements in array .cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int t;cin>>t;
while(t-->0){
int n;cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int p,q;cin>>p>>q;
int i;
for(i=0;i<n;i++){
if(a[i]==p){
break;
... | ALGO | 0.999945 | 3.970135 |
9f5875ea-9928-4b68-b565-2e158c9ab44c | Sandip-Kanzariya/GFG-LeetCode | Eventual Safe States - GFG/eventual-safe-states.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:
void dfs(int node, vector<int>& vis, vector<int>& topo, vector<int> adj[]) {
vis[node] = true;
for(int nbr: adj[... | ALGO | 0.999977 | 6.608651 |
ba24ac6b-7bf9-4e7f-848c-42f5181cf4a6 | sinnu2004/DSA | Linked list 2/sortlist.cpp | #include<iostream>
using namespace std;
class ListNode{
public:
int val;
ListNode* next;
ListNode(int val){
this->val = val;
this->next = NULL;
}
};
int main(){
ListNode* a = new ListNode(10);
ListNode* b = new ListNode(20);
ListNode* c = new ListNode(30);
ListNode* d... | ALGO | 0.998922 | 3.11045 |
d6c469e2-91b0-4723-bffb-45a51dfd87a9 | ItsKhuramShahzad/DataStructure | AVLTreeImplementation.cpp | // AVL Tree Implementation..
#include<iostream>
using namespace std;
class node {
public:
int data;
node* left; node *right;
int height;
node(int data){
this->data= data;
left= right= NULL;
height=0;
}
};
class AVLTree{
private:
//private data member and methods
node* root;
int TotalNodes... | ALGO | 0.999949 | 4.678198 |
a497ed53-29be-4904-882e-e2778fd7ed28 | ishandutta2007/codeforces | pacu/normal/91/A.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<vector<int> > occ;
int binSearch(int low,int high,int c,int x) //occ[c], first after x
{
if(low==high)
return low;
if((low+1)==high)
{
if(occ[c][low]>x) return low;
return high;
}
int mid = (low+high)/2;
if(occ[c][mid]>x)
... | ALGO | 0.999976 | 3.807424 |
0f20cba0-291e-44e5-9548-825647d0f334 | takumi152/atcoder | httf2020/httf2020a.cpp | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx")
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <functional>
#include <numeric>
#include <random>
#include <chrono>
#include <cstring>
#inclu... | ALGO | 0.999267 | 3.970443 |
4e3bc29f-ad0d-4338-889f-dc1e23f98af3 | pratikp2/Turing_Tasks | Task-499169/Turn1-ModelA.cpp | #include <iostream>
#include <cstring>
#include <mutex>
#include <thread>
#include <vector>
#include <chrono>
class Document {
private:
char content[1024]; // Character array for document content
std::mutex mtx; // Mutex for synchronizing access
public:
Document() {
strcpy(content, ""); // Initial... | TOOL | 0.987551 | 7.110591 |
a0a1fb77-e8f2-41c4-adc9-cb4b96e2bd8d | Afraz-M/cp-notebook | 1.cpp | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
namespace geo {
class Point {
public:
int x, y;
Point(int x, int y) : x(x), y(y) {}
double distance(const Point& o) const {
return sqrt((x - o.x) * (x - o.x) + (y - o.y) * (y -... | ALGO | 0.999921 | 5.260084 |
7ffa908b-c3b2-4c69-aa19-99f36edb6e0f | TRIQS/triqs | c++/triqs/gfs/transform/fourier_real.cpp | #include "../../gfs.hpp"
#include "./fourier_common.hpp"
namespace triqs::gfs {
namespace {
dcomplex I(0, 1);
inline dcomplex th_expo(double t, double a) { return (t > 0 ? -I * exp(-a * t) : (t < 0 ? 0 : -0.5 * I * exp(-a * t))); }
inline dcomplex th_expo_neg(double t, double a) { return (t < 0 ? I * ex... | ALGO | 0.999454 | 6.470551 |
0a5aaa67-5d44-4454-8347-5bb1d362af62 | vinayak0505/Data-Structures | Vertical Order Traversal of a Binary Tree.cpp |
#include "queue"
using namespace std;
// Definition for a binary tree node.
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *rig... | ALGO | 0.999998 | 5.78514 |
e8f65428-fb78-4eca-b072-5be862a290b3 | seclab-ucr/IncreLux | llvm/llvm-9.0.0.src/lib/Transforms/Utils/LoopUnrollAndJam.cpp | #include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/Analysis/AssumptionCache.h"
#include "llvm/Analysis/DependenceAnalysis.h"
#include "llvm/Analysis/InstructionSimplify.h"
#include "llvm/Analysis/LoopAnalysisManager.h"
#include "llvm/Analysis/LoopIterator.h"
#include "llvm/Analysis/LoopPas... | ALGO | 0.99831 | 4.137379 |
398985b9-5c2b-4614-9f00-992286a8373a | Alexander5421/PAT | practice/1143/main.cpp | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
void LCA(int u,int v,vector<int>preorder,vector<int>inorder){
// first locate the root;
int root = preorder[0];
int location;
if (u<root && v>root)
{
printf("LCA of %d and %d is %d", u, v, root);
... | ALGO | 0.999969 | 4.685233 |
db94889d-1ed4-46ad-949f-830197f3dcb0 | akamabhoi/neetCode | Graphs/CourseScheduleII.cpp | class Solution
{
public:
vector<int> findOrder(int numCourses, vector<vector<int>> &prerequisites)
{
// Create an adjacency list for the graph
unordered_map<int, vector<int>> graph;
for (auto course : prerequisites)
{
int u = course[1]; // Prerequisite course
... | ALGO | 0.999937 | 7.019166 |
4a68fd9a-0555-4937-94ac-eb016f3a7f32 | SrinivasuluCharupally/leetcode_questions_answers | 233_number-of-digit-one.cpp | // Count of 2s: Write a method to count the number of 1s between O and n.
// source book
// simple one : https://www.google.co.in/amp/s/www.geeksforgeeks.org/number-of-occurrences-of-2-as-a-digit-in-numbers-from-0-to-n/amp/
#include<iostream>
using namespace std;
int count2s(int number, int itr) {
int powe... | ALGO | 0.997652 | 4.217216 |
4c64fc0a-7d73-47c5-86bc-0494dfa3e76f | rkverma2022/Algorithm | 10_ND_Merge_Sort.cpp | // C++ program for Merge Sort
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
int SwapCount = 0;
int iterations = 0;
// Merges two subarrays of array[].
// First subarray is arr[begin..mid]
// Second subarray is arr[mid+1..end]
template <class T>
void merge(T array[], int const left, int... | ALGO | 0.99973 | 4.210466 |
c2a7d034-22d3-4bb9-9879-9f1574222293 | Zaid0/problem-solivng-cpp | Leet Code 75/p4 Can Place Flowers.cpp | #include <vector>
#include <iostream>
using namespace std;
class Solution {
public:
bool canPlaceFlowers(vector<int>& flowerbed, int n) {
int c = 0;
if (flowerbed.size() == 1 && flowerbed[0] == 0)
{
c +=1;
}
if (flowerbed.size() == 2)
{
... | ALGO | 0.999998 | 6.163747 |
08a74060-6f80-46f4-9ad2-a2b1cc32bc29 | XiYuanHuang/CS162 | lab1/prog.cpp | #include <iostream>
#include <string.h>
#include <cstdlib>
#include "mult_div.h"
#include <new>
using std::endl;
using std::cout;
using std::cin;
using namespace std;
bool isNonZeroInteger(char *row, char *col){
bool rowCheck = false;
bool colCheck = false;
for(int i = 0 ; i <strlen(row);i++){
if(row[i] > '0'... | TOOL | 0.869742 | 3.303656 |
7a2a0dd4-a106-4780-9a9d-a8494caf4831 | Bhavya333-web/Cpp | 06_while.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
while(cin>>A>>B){
cout<<A*A+2*A*B+B*B<<endl;
cout<<A+B<<endl;
}
}
| ALGO | 0.999275 | 3.982538 |
a50123c6-1ea2-413f-8586-0937b5a4a9db | IrwinYauri/clases-c- | hashTable.cpp | #include<iostream>
#include<list>
#include<utility>
#include<string>
using namespace std;
class HashTable{
private:
static const int hashGroups=10;
list<pair<int,string>> table[hashGroups];
public:
bool isEmpty() const;
int hashFunction(int key);
void insertItem(int ke... | ALGO | 0.997909 | 5.640906 |
c1bc3264-310e-4da4-a5dc-958254514004 | Neeraj-2625/leetcode | 19-jan-2025/solution.cpp | class Solution {
private:
bool isPoss(int i,int j,int n,int m){
if(i<0 || j<0 || i>=n || j>=m)
return false;
return true;
}
public:
int trapRainWater(vector<vector<int>>& height) {
int n = height.size();
int m = height[0].size();
vector<vector<int>... | ALGO | 0.999981 | 6.27578 |
8508c38f-199d-4569-b326-8914ef5c9f34 | ganghe74/algo | baekjoon/4539_반올림.cpp | #include <iostream>
using namespace std;
int solve(int n) {
int divisor = 10;
while (n > divisor) {
if (n%divisor >= divisor/2) n = n/divisor*divisor + divisor;
else n = n/divisor*divisor;
divisor *= 10;
}
return n;
}
int main() {
int n;
scanf("%d", &n);
while (n--)... | ALGO | 0.999855 | 4.786535 |
c15373f3-ad05-46c0-a813-02ad8749561f | AdityaVSM/Algorithms | 4 recursion/sum of n natural numbers/main.cpp | #include<bits/stdc++.h>
using namespace std;
int sum(int n){
if(n==0) return 0;
return n+sum(n-1);
}
int main(){
cout<<sum(5)<<endl;
return 0;
} | ALGO | 0.999936 | 4.212477 |
6d1c98a7-0512-45df-aa2b-fd44b0d6b3ba | piotrus04/juce_cmake_vscode_example | lib/JUCE/modules/juce_box2d/box2d/Collision/b2TimeOfImpact.cpp | #include "b2Collision.h"
#include "b2Distance.h"
#include "b2TimeOfImpact.h"
#include "Shapes/b2CircleShape.h"
#include "Shapes/b2PolygonShape.h"
#include <cstdio>
using namespace std;
int32 b2_toiCalls, b2_toiIters, b2_toiMaxIters;
int32 b2_toiRootIters, b2_toiMaxRootIters;
struct b2SeparationFunction
{
enum Type
... | ALGO | 0.999683 | 7.264768 |
3961484a-dc07-4d29-8baa-d04e3305f3d9 | rayfanaqbil/PEMROGRAMANIV_714220044 | Praktikum07/pertemuan07/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.998836 | 6.76775 |
688209e9-a502-454c-83a1-2e3cedf1aef6 | codeMYNK/DSA-CPP | Graphs/KruskalsAlgo.cpp | // GfG Problem : Minimum Spanning Tree (Medium)
/*
Given a weighted, undirected, and connected graph with V vertices and E edges, your task is to find the sum of the weights of the edges in the Minimum Spanning Tree (MST) of the graph. The graph is represented by an adjacency list, where each element adj[i] is a vecto... | ALGO | 0.999997 | 6.050126 |
c84796dc-b9ff-4222-8070-7ff5da04c365 | 1995hyz/DSA | DSA2/Project_2/dijkstra.cpp | #include <iostream>
#include <string>
#include <cstdlib>
#include <limits>
#include "hash.h"
#include "dijkstra.h"
using namespace std;
graph::graph(int size){
capacity = 0;
vertexTable = new hashTable(size);
}
int graph::checkExist(const string &id){
if(vertexTable->contains(id)){
return true;
}
else{
retu... | ALGO | 0.998174 | 3.729622 |
deff392a-274d-462c-9ace-c21878df819c | ugidol/atcoder | abc309/d.cpp | #include <bits/stdc++.h>
using namespace std;
pair<int,int> bfs(vector<set<int>> &node, int arg){
vector<int> dist(node.size(),-1);
queue<int> que;
que.push(arg);
dist[arg] = 0;
while( ! que.empty() ) {
int v = que.front();
que.pop();
set<int> &st = node[v];
for(auto itr : st){
if ( dis... | ALGO | 0.999862 | 3.721988 |
4e13a637-ac55-4d8e-bf09-06d5cb438f43 | ahmedabougabal/ITI_Python_and_PHP_Shadow_Interviews | group_anagrams.cpp | /*
link : https://leetcode.com/problems/group-anagrams/
*/
#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <string>
using namespace std;
//! if 2 words' sorting is the same, then they are anagrams :)
class Solution
{
public:
vector<vector<string>> groupAnagrams(vector<str... | ALGO | 0.999987 | 6.451901 |
ca6853cd-03d6-4d9e-915b-d7bd72740850 | Imran4424/LeetCode-Solutions | DynamicProgramming/Medium/213.HouseRobberII_TD.cpp |
class Solution {
int dp[101];
bool firstSelected;
int maxValue(int x, int y) {
if (x > y) {
return x;
}
return y;
}
int dpRob(vector<int>& nums, int index) {
if (index >= nums.size()) {
return 0;
}
if (i... | ALGO | 0.999983 | 5.894616 |
e984697a-a870-44e1-b32d-09cd84bdc13c | gaoneto/maratona | ECNA 2013/merge.cpp | #include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
const int N=1e3+10;
int ans, dp[N][8], v[N][3];
int main() {
int n, t=1;
while(scanf("%d", &n) && n) {
for(int i=0;i<3;i++) for(int j=1;j<=n;j++) scanf("%d", &v[j][i]);
for(int i=1;i<=n;i++) for(int mask=0;mask<8;m... | ALGO | 0.999869 | 3.68829 |
bd73e541-2818-47ea-a5e1-153a34f51f7d | hsh0128/algorithm | 이분 탐색(백준)/1920.cpp | #include <stdio.h>
#include <set>
#include <queue>
using namespace std;
set<int> record;
queue<int> result;
int main() {
int N, M, cache;
scanf_s("%d", &N);
for (int i = 0; i < N; i++) {
scanf_s("%d", &cache);
record.insert(cache);
}
scanf_s("%d", &M);
for (int i = 0; i < M; i++) {
scanf_s("%d", &cac... | ALGO | 0.999866 | 3.929895 |
f9228d10-1f1d-4a98-aa47-cc839bc47870 | itzraju5/CODEFORCES_SOLUTIONS | Codeforces_Solutions/1159_A.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
string s;
cin >> s;
int cnt_0(0), cnt_1(0);
for(int i=0; i<s.length(); i++){
if(s[i] == '+'){
cnt_1++;
}else if(s[i] == '-' a... | ALGO | 0.999972 | 4.489917 |
f5e9ca63-2009-40a7-a3f8-be327f15cf13 | ZeyadShawki/Multi_Threaded_Matrix_Multiplication | threads/main.cpp | #include <iostream>
#include <fstream>
#include "pthread.h"
#include <chrono>
using namespace std;
const int MAX_ROWS = 400;
const int MAX_COLS = 400;
struct ThreadData
{
int start_row;
int end_row;
int cols1;
int cols2;
int (*mat1)[MAX_COLS];
int (*mat2)[MAX_COLS];
int (*result)[MAX_COLS... | ALGO | 0.998542 | 5.235663 |
4822b00e-9a0c-4ab5-9372-fc6a83c4cc63 | Unknownmaster0/learning_DSA_concept | Linked_list_DSA/Delete_a_node_without_head_pointer.cpp | #include <iostream>
using namespace std;
class Node
{
public:
int data;
Node *next;
Node() {}
Node(int data)
{
this->data = data;
this->next = NULL;
}
};
void deleteNode(Node *del)
{
Node *temp = del->next->next;
del->data = del->next->data;
del->next = temp;
}
in... | ALGO | 0.993334 | 3.850779 |
125d185b-aacc-45c1-91b2-423a6ea5d409 | ElrheaDeSouza/CE-Coursework | SEM V/OS/Expt4/LwrNoHrPrrty.cpp | //3.Preemptive Priority Scheduling
//(Lower number, higher priority)
#include <iostream>
using namespace std;
int main()
{
int p[10]; // Array to store process numbers
int BT[10]; // Array to store burst times
int rem_BT[10]; // Array to store remaining burst times
int WT[10]; // Array ... | ALGO | 0.999997 | 4.657146 |
c94d2971-0956-49da-af29-48b5b0290ff7 | achrafoo2018/Competitive_Programming_Contests | hashcode/hashcode2022/solve.cpp | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<char> vchr;
typedef vector<string> vstr;
typedef vector<vi> vvi;
typedef vector<vchr> vvchr;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<v... | ALGO | 0.999778 | 3.611099 |
85a6f2b1-376b-4eb9-8480-faa468f53e15 | Meetkajavadra/locator | 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.998859 | 6.785645 |
416fe3cb-11f2-447d-8006-62a691c9a85c | daniyal-ahmad-khan/TV-APP_Logo-Detection | app/src/main/jni/eigen/bench/benchFFT.cpp | #include <iostream>
#include <bench/BenchUtil.h>
#include <complex>
#include <vector>
#include <Eigen/Core>
#include <unsupported/Eigen/FFT>
using namespace Eigen;
using namespace std;
template <typename T>
string nameof();
template <> string nameof<float>() {return "float";}
template <> string nameof<double>() {r... | TEST | 0.893587 | 6.391927 |
49fcc27b-86b8-47c6-ba31-9a649a71a215 | xiami2019/LeetCode | 总题库/31.NextPermutation.cpp | // 从数组末尾开始找第一个不符升序的位置，将后面的全部反序，再从当前位置往后扫描，直到
// 找到第一个大于该位置元素的元素
class Solution {
public:
void nextPermutation(vector<int>& nums) {
int numsLen = nums.size();
if (numsLen <= 1) return;
int index = numsLen - 1;
// 找出升序的开始的索引位置
while (index > 0 && nums[index] <= nums[index - 1... | ALGO | 0.999996 | 5.398839 |
89446102-31f4-4c20-84d3-fa8543f3ca48 | Wqxleo/C_plus | 作业13.A动物爱好者.cpp | #include <iostream>
using namespace std;
class Animal
{
public:
Animal()
{
}
~Animal()
{
}
void setAnimal(string name,int num)
{
m_name = name;
m_num = num;
}
int getNum() const
{
return m_num;
}
string getName() const
{
return m_... | ALGO | 0.997813 | 4.518247 |
b1a7edf7-b86f-437c-982f-a1f1ce5829ae | lbryio/lbrycrd-dependencies | boost_1_59_0/libs/numeric/interval/examples/findroot_demo.cpp | #include <boost/numeric/interval.hpp> // must be first for <limits> workaround
#include <list>
#include <deque>
#include <vector>
#include <fstream>
#include <iostream>
template<class T>
struct test_func2d
{
T operator()(T x, T y) const
{
return sin(x)*cos(y) - exp(x*y)/45.0 * (pow(x+y, 2)+100.0) -
c... | ALGO | 0.979401 | 5.272397 |
b1dd1a21-f86b-4214-8ad1-9042324cd103 | rile1036/acmicpc_algorithm | 11052.cpp |
#include <stdio.h>
#define Max(x, y) (((x) > (y)) ? (x) : (y))
int n;
int cost[1001];
int dp[1001];
int solve(int num)
{
int i;
if (num == 0) return 0;
if (dp[num]) return dp[num];
dp[num] = cost[num];
for (i = 1; i <= num; i++) {
dp[num] = Max(dp[num], cost[i] + ... | ALGO | 0.9999 | 3.881504 |
3b21663e-9bbc-426a-833a-e55080cc1823 | kanzure/brlcad | src/other/openNURBS/opennurbs_mesh_tools.cpp | /* $NoKeywords: $ */
#include "opennurbs.h"
/////////////////////////////////////////////////////////////////////////////
// SwapMeshEdge()
//
bool ON_Mesh::SwapEdge_Helper( int topei, bool bTestOnly )
{
ON_Mesh& mesh = *this;
const ON_MeshTopology& top = mesh.Topology();
const int F_count = mesh.m_F.Count()... | ALGO | 0.998771 | 6.09065 |
d8ab4b3e-3058-4218-badc-3372624bfeb8 | komal754/dsa_codes | Companies/accenture/firstreoccuringchar.cpp | #include<iostream>
#include<unordered_map>
#include<unordered_set>
using namespace std;
int main(){
string s;
cin>>s;
//using map
// unordered_map<char,int>ch;
// for(int i=0;i<s.size();i++){
// if(ch[s[i]]==0){
// ch[s[i]]++;
// }
// cout<<s[i];
// break;
// }
//using set
// unordered_set<char>ch;
//... | ALGO | 0.999887 | 3.401127 |
bb336d3d-2c9b-4468-8d37-a609b14503e7 | Rajesh3923/Geeks-For-Geeks | Medium/Array Pair Sum Divisibility Problem/array-pair-sum-divisibility-problem.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
bool canPair(vector<int> nums, int k) {
int n=nums.size() ;
if(n%2) return false ;
unordered_map<int, int> m;
for(int i=0; i<n; i++)
{
nums[i]=num... | ALGO | 0.999313 | 5.462131 |
5dfa4cc5-27f3-4cfa-be54-cb97d7c6ab84 | kalashpatil33/Leetcode-Daily | 2305-fair-distribution-of-cookies/2305-fair-distribution-of-cookies.cpp | class Solution {
public:
void solve(int j,vector<int> &ans,vector<int> &sum
,vector<int> &A,int k)
{
if(j==A.size())
{
int x=0;
for(auto it:sum)
{
// cout<<it<<" ";
x=max(x,it);
}
ans.push_back(x);
... | ALGO | 0.999964 | 4.9775 |
cfad9056-2b60-4f8c-9e46-d6c8aa2f6b94 | KevinMathewT/Competitive-Programming | MemoryManagementSystem.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Author - Kevin Mathew
// Birla Institute of Technology, Mesra
ll n, m, q, l[100010], r[100010], pre[100010];
vector<pair<ll, pair<ll, ll> > > pairs;
vector<pair<ll, pair<ll, ll> > > dist;
void te(){
pairs.clear();
dist.clear();
for(ll i=0;i<10... | ALGO | 0.999902 | 3.638836 |
9cc94742-bed6-417e-9ef7-ee59bdefe747 | yash291/Eye-Motion-Tracking | opencv-master/samples/cpp/tutorial_code/ImgProc/Smoothing/Smoothing.cpp | /**
* file Smoothing.cpp
* brief Sample code for simple filters
* author OpenCV team
*/
#include <iostream>
#include "opencv2/imgproc.hpp"
#include "opencv2/imgcodecs.hpp"
#include "opencv2/highgui.hpp"
using namespace std;
using namespace cv;
/// Global Variables
int DELAY_CAPTION = 1500;
int DELAY_BLUR = 100;
... | ALGO | 0.892052 | 5.340753 |
e8036da0-aa26-4b75-ae4a-051f9400d410 | GulSauce/codetree-TILs | 231123/배수의 개수 2/number-of-multipliers-2.cpp | #include <iostream>
using namespace std;
int main() {
int n;
int cnt = 0;
for(int i = 1; i <= 10; i++){
cin >> n;
if(n % 2 == 1)
cnt++;
}
cout << cnt;
return 0;
} | ALGO | 0.999846 | 4.0172 |
d39a1da3-45fd-464a-bf9f-e04bf94f49fc | arkokundu500/CP-Problems | 0110-balanced-binary-tree/0110-balanced-binary-tree.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999891 | 6.187588 |
50b217fd-0884-47b1-8b8b-ab3a03b6e18a | Hantao-Ye/Struggle-in-LeetCode-v2 | grind75/5.cpp | #include <string>
class Solution
{
public:
bool isPalindrome(std::string s)
{
for (int left = 0, right = s.size() - 1; left < right; left++, right--)
{
while (left < right && !isalnum(s[left]))
{
left++;
}
while (left < right && !i... | ALGO | 0.998563 | 6.216469 |
8e312b02-1608-42bd-899c-7d84a128af96 | sofdev-ms/Codeforces | #93-Educational/C.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll t;
cin >> t;
while (t--)
{
ll n;
cin >> n;
string s;
cin >> s;
map<int, int> count;
int sum[n];
sum[0] = 0;
for (int i = 0; i < n; i++)
{
... | ALGO | 0.999797 | 3.826781 |
dc25ed49-bc7f-4b72-bb09-f466d3f15482 | KADAMBHAKTI0219/BK-DSA | ElectricityBillAndMax_Min/Maxwith2numbers.cpp | #include <iostream>
using namespace std;
int main (){
int num1,num2;
cout << "Enter NUM1 and NUM2 : ";
cin >> num1 >> num2;
if(num1>num2){
cout << "NUM1 is Maximum";
}
else{
cout << "NUM2 is Maximum";
}
return 0;
} | ALGO | 0.997752 | 3.628814 |
d09f747c-b231-4d1f-a673-4701616828ab | simX/d2x-xl | dle-xp/render.cpp | // render.cpp
#include "stdafx.h"
#include <math.h>
#include "types.h"
#include "matrix.h"
#include "global.h"
#include "mine.h"
#include "segment.h"
#include "dlc.h"
#include "dlcdoc.h"
#include "mainfrm.h"
#include "mineview.h"
extern UINT8 side_vert[6][4];
int enable_delta_shading = 0;
//------------------------... | ALGO | 0.992529 | 5.013872 |
6b957f7c-993e-4442-a977-2d4648a5ca06 | chltkdgns1/Algorithm_first | Baseball.cpp | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t; cin >> t;
while (t--) {
int c = 0, d = 0;
for (int i = 0; i < 9; i++) {
int a, b;
cin >> a >> b;
if (a < b) d++;
else if (a > b) c++;
}
if (c < d) cout << "Korea" << "\n";
else if (c ... | ALGO | 0.999874 | 4.159374 |
a63edd41-a1bf-40af-93a5-ea7022ef684a | SHIELD-SKY/Practice-of-Date-Structures | 图论/Leagal or NOt/main.cpp | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
vector<int> edge[501];
queue<int> Q;
int main(int argc, const char * argv[]) {
int inDegree[501];
int n, m;
while (scanf("%d%d", &n, &m) != EOF) {
if(n == 0 && m == 0) break;
for(int i = 0; i < n; i++){
... | ALGO | 0.999962 | 4.602237 |
d374b1c4-f146-43dd-89bf-ea4c7c85fdce | afjaramilg/comp_prog | practice1/uva10305.cpp | // https://vjudge.net/problem/UVA-10305
// typedefs and such/-----------------
#include <bits/stdc++.h>
#define fi first
#define se second
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define for1(i, n) for (int i = 1; i <= (int)n; ++i)
#define fore(i, l, r) for (int i = (int)l; i <= (int)r; ++i)
#define ford(i... | ALGO | 0.999895 | 4.628768 |
91fe5849-188b-4d87-940d-e5babe882afa | ishandutta2007/codeforces | basic_string/normal/204/E.cpp | #include<bits/stdc++.h>
using namespace std;
const int N=200009;
char str[N];
int s[N],u[N],v[N],sa[N],h[N],t[N],id[N],cnt[N];
multiset<int>st;
basic_string<int>ad[N],dl[N];
long long ans[N];
int main(){
int*rk=u,*b=v,a,o,l,r,i,j,k=0,x,y,n=0,m=N-1;
scanf("%d%d",&a,&o);
if(o==1){
while(a--)scanf("%s",str+1),l=strle... | ALGO | 0.999462 | 3.697365 |
5ff842be-22d0-4823-911c-d0ae9d2bf474 | MalihaChy/Problem-Solving | CountingValleys.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
char c;
int pos=0, cnt=0;
for(int i=0;i<n;i++)
{
cin>>c;
if(c=='U')pos++;
else
{
if(pos>=0 && (pos-1)<0)cnt++;
pos--;
}
}
cout<<cnt<<endl;
}
| ALGO | 0.99969 | 3.462215 |
a8a040fa-5b1e-47a2-ad47-a727741dca67 | Pulkith/Competitive | CodeForces/1473/b/b.cpp | /**
* author: DespicableMonkey
* created: 07.04.2021 01:36:58
* Potatoes FTW!
**/
#include<bits/stdc++.h>
#if LOCAL
#include <DespicableMonkey/Execution_Time.h>
#include <DespicableMonkey/Debug.h>
#define debug_active 1
#endif
using namespace std;
#define pb push_back
#define f first
#define s secon... | ALGO | 0.999964 | 4.457275 |
f42037d1-532d-4e4f-9c4b-e5e9681016e7 | pineal/Model_Predictive_Controller | src/Eigen-3.3/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.993077 | 6.251058 |
3eaad230-baf0-4a49-a22a-2d9712fbfa3a | DeepF02/DSA-450 | LinkedList/deleteLoopINLL.cpp | // Write a program to Delect loop in a linked list.
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
struct Node *next;
};
// Node* head=NULL; // Global declaration of head
class LinkedList
{
public:
//Function to insert data in a linked list ITERATIVE.
Node *insert(Node *head, i... | ALGO | 0.999946 | 5.125813 |
34aed4b8-647c-402c-b522-5d0e36a23163 | hnelamir/CPP_Intermediate_Projects | 03_Task_Manager/src/main.cpp | #include "taskmanager.hpp"
#include <thread>
#include <iostream>
/*---------------------Main---------------------------------*/
int main(){
/*
Requirements:
1. Create a class called Process that has the following attributes:
- id (int)
- name (string)
- priority (in... | ALGO | 0.884918 | 4.315893 |
76e66ec9-7f32-4cae-99d4-99e55c4698d1 | angel-utn/laboratorio1-20232c | Clase 03/Viernes Virtual/Ejemplo02B/main.cpp | /*
Hacer un programa que simule tres operaciones de un cajero automático.
Debe solicitar el importe (negativo para extraccion, positivo para depósito)
El programa debe informar:
A- Si hubo al menos un deposito mayor a $50000
B- La cantidad de depósitos realizados
C- El total de dinero operado
... | TOOL | 0.86607 | 4.569572 |
a0d0b4ab-ff3c-45d9-802f-fd48857603a6 | sheeluofficial/practice | OthersCode/LeetCode-Solutions-master/LeetCode-Solutions-master/C++/number-of-unique-good-subsequences.cpp | // Time: O(n)
// Space: O(1)
class Solution {
public:
int numberOfUniqueGoodSubsequences(string binary) {
static const int MOD = 1e9 + 7;
int ends0 = 0, ends1 = 0;
bool has_zero = false;
for (const auto& b : binary) {
if (b == '1') {
ends1 = (ends0 + en... | ALGO | 0.999998 | 6.590298 |
42e0b7fe-8333-459f-a1c0-e202d2ea562c | codewalkerster/platform_frameworks_av | media/module/codecs/amrwb/dec/src/deemphasis_32.cpp | /*
------------------------------------------------------------------------------
Filename: deemphasis_32.cpp
Date: 05/08/2004
------------------------------------------------------------------------------
REVISION HISTORY
Description:
-----------------------------------------------------------------------... | ALGO | 0.999674 | 5.971553 |
001f52c5-90a3-4bc8-a77c-a5cd72048c57 | prsabahrami/competitive-programming | codeforces/715/C.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define SZ(x) (int) x.size()
#define F first
#define S second
int Pow(int a, int b, int md, int res = 1) {
for (; b; b >>= 1, a = 1ll * a... | ALGO | 0.999982 | 4.377824 |
dd2f3255-4764-4238-8445-508472ee956a | XiaYingyin/multicore-hashjoins | wisconsin-src/parser.cpp | #include "parser.h"
using namespace std;
int Parser::parseLine(char* line, const char** result) {
char* s=line; /**< Points to beginning of token. */
char* p=line; /**< Points to end of token. */
int ret = 0;
while (*s) {
while (*p!=_sep && *p) // while not separator or end-of-line
p++;
if (s!=p) // eats n... | TOOL | 0.864402 | 3.351944 |
d42187e5-5de5-40cd-a041-380accd8099f | MurguAdrian/Movie_2023 | 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.998859 | 6.785645 |
a86b0464-5529-445c-af76-a2e4fb64b613 | muskan300600/DSA | Array/19.skill_compare.cpp | #include <iostream>
using namespace std;
int main(){
int a[] = {4,2,7};
int b[] = {5,6,3};
int n = sizeof(a)/sizeof(a[0]);
int ca=0,cb=0;
for(int i=0;i<n;i++){
if(a[i]>b[i]){
ca++;
}
else if(a[i]<b[i]){
cb++;
}
}
cout<<ca<<endl;
co... | ALGO | 0.999749 | 3.490271 |
4765b83f-6b4f-4723-a304-2dac21809130 | Jh-jaehyuk/BOJ | BOJ/20000++/27000~/27111.cpp | //
// 27111.cpp
// BOJ
//
// Created by J213h on 8/21/24.
//
#include <bits/stdc++.h>
using namespace std;
int N;
int A[200001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N;
int ans = 0;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
... | ALGO | 0.999829 | 4.513011 |
614f1fd6-4c0b-4ee1-836e-b35662a4988b | sammiiT/leetcode | array/969. Pancake Sorting.cpp | //===類似題===
970. Powerful Integers
2234. Maximum Total Beauty of the Gardens
1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits
1738. Find Kth Largest XOR Coordinate Value
//===思路===
1. 遍歷數列,找到最大的數值
2. [0:最大數值的位置] 做reverse => (arr.begin(),arr.begin()+(i+1))
3. [0:n] 做reverse => (arr.begin(),arr.... | ALGO | 0.999957 | 5.640793 |
40e27caf-fe52-490b-855e-4143de4c02d3 | programming-653502/Halkin | 2/2.2.6.cpp | #include "stdafx.h"
#include "iostream"
#include "cmath"
#include "clocale"
#include "conio.h"
using namespace std;
bool int_check(char x[])
{
for (int i = 0; x[i] != '\0'; i++)
{
if (x[i] < '0' || x[i]> '9')
{
cout << "Ошибка ввода, введите еще раз" << endl;
return 0;
}
}
return 1;
}
int factorial(i... | ALGO | 0.999894 | 3.589057 |
95fc6bdb-f8e2-43ce-affd-a25e92591c91 | rugleb/explicit-difference-method | explicit difference scheme/main.cpp | #include "Method.h"
int main(int argc, char * argv[])
{
double findTime;
argc == 1 ? findTime = FIND_TIME_DEFAULT : findTime = atof(argv[1]);
Method * method = new Method(STEP_DEFAULT, STEP_DEFAULT, findTime);
method->initStartGrid();
method->initGrids();
method->showDynamicsPlot();
return 0;
}
| ALGO | 0.867226 | 3.72722 |
19e4f1ac-db91-4156-b4dd-24f11dab1964 | Raju-Lama/cpp | lamda/explicit return type/main.cpp | // Replace ___ with your code
#include<iostream>
using namespace std;
int main() {
// get integer inputs
int num1, num2;
cin >> num1 >> num2;
// get character input
char op;
cin >> op;
// lambda function with explicit return type 'double'
// capture all values with implicit capture ... | ALGO | 0.989552 | 5.36758 |
9e6feea8-35f9-477a-87b7-8da8dcbf096e | rizkisyaf/Bitwyre | src/model/TradingModel.cpp | #include "model/TradingModel.hpp"
#include <iostream>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <chrono>
namespace trading {
TradingModel::TradingModel() {
// Pre-allocate price history to avoid reallocations
price_history_.reserve(price_history_length_);
volatility_history_.reser... | DATA | 0.923265 | 7.542211 |
da8e0336-6aca-4b79-a054-21529620598b | stepanovanastya1104/bot | stockfish_15.1_linux_x64_popcnt/src/uci.cpp | #include <cassert>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include "evaluate.h"
#include "movegen.h"
#include "position.h"
#include "search.h"
#include "thread.h"
#include "timeman.h"
#include "tt.h"
#include "uci.h"
#include "syzygy/tbprobe.h"
using namespace std;
namespace Stockf... | ALGO | 0.983623 | 7.464976 |
6418241f-6de7-4f4b-8f11-34ccd709a724 | iamslash/learntocode | leetcode2/DiagonalTraverseII/a.cpp | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
// // Time Limit Exceeded
// // linear traversal
// // O(HW) O(HW)
// class Solution {
// public:
// vector<int> findDiagonalOrder(vector<vector<int>>& M) {
// vector<int> ans;
// int h = M.size(), w = M[0].size();
// for (in... | ALGO | 0.999988 | 5.685349 |
ab9b2507-0cc1-439a-b1c8-56c48004b923 | pirobtumen/project-euler | PE13/pe.cpp | /*
* Project Euler - Problema 13
*
* Alberto Sola
*
*/
#include <iostream>
#include <fstream>
using namespace std;
struct MeLlevo{
int digito;
int sobra;
};
class BigNumero{
/*
* Clase para trabajar con números de 50 dígitos.
*
* Almacena los números al revés.
*/
private:
static const int ... | ALGO | 0.99922 | 4.889884 |
00152fce-7649-4818-a9c6-14ef14b10db2 | talha-10xE/LLVM-Profiler | llvm/lib/CodeGen/DeadMachineInstructionElim.cpp | #include "llvm/ADT/PostOrderIterator.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/CodeGen/LiveRegUnits.h"
#include "llvm/CodeGen/MachineFunctionPass.h"
#include "llvm/CodeGen/MachineRegisterInfo.h"
#include "llvm/CodeGen/TargetSubtargetInfo.h"
#include "llvm/InitializePasses.h"
#include "llvm/Pass.h"
#include "llv... | ALGO | 0.945982 | 7.925383 |
00479ec9-dd9a-4972-9d9a-87a1b4b73d0a | Team-OctOS/platform_external_skia | src/effects/SkBlurMask.cpp | #include "SkBlurMask.h"
#include "SkMath.h"
#include "SkTemplates.h"
#include "SkEndian.h"
// This constant approximates the scaling done in the software path's
// "high quality" mode, in SkBlurMask::Blur() (1 / sqrt(3)).
// IMHO, it actually should be 1: we blur "less" than we should do
// according to the CSS and c... | ALGO | 0.992651 | 7.384378 |
25f3caad-d23a-4a4a-9e1e-2f632ed95aed | Monty05012002/LeetCode | Next Greater Element 2 - GFG/next-greater-element-2.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
vector<int> nextGreaterElement(int n, vector<int>& arr) {
// code here
stack<int>st;
for(int i=n-1;i>=0;i--){
st.push(arr[i]);
}
vector<int>ans;
... | ALGO | 0.99952 | 6.383343 |
a556c0be-f60a-4989-840b-621d053812d1 | Rafi-Shariar/XPSC | Sheet/week_8/day_2_ sat/B_Monsters.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int t; cin>>t;
while (t--)
{
int n,k;
cin>>n>>k;
vector<int>v(n);
for (int i = 0; i < n; i++)
{
cin>>v[i];
v[i]%=k;
if(!v[i]) v[i]=k;
}
... | ALGO | 0.999975 | 3.357376 |
da6d5cf9-e0ab-4db8-a5bb-e6e9a5915716 | fangda-cu/MultiTracker | LosTopos/LosTopos3D/edgesplitter.cpp | // ---------------------------------------------------------
//
// edgesplitter.cpp
// Tyson Brochu 2011
// Christopher Batty, Fang Da 2014
//
// Functions supporting the "edge split" operation: subdividing an edge into two shorter edges.
//
// ---------------------------------------------------------
#include <ed... | ALGO | 0.991444 | 7.422286 |
10c307dd-c681-42df-93ee-312c1a703a78 | navdeepsr110/DSA-Questions | Hashing/Hash1.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
int hash[13]={0};
for(int i=0;i<n;i++){
hash[arr[i]]++;
}
int q;
cin>>q;
while(q--){
int number;
cin>>number;
co... | ALGO | 0.999912 | 4.298316 |
ccc6b619-5361-4024-a7ee-48c2ad12fba6 | amamic1803/Algorithms-and-Data-Structures | Quicksort/C++/src/tests/tests.cpp | #include "quicksort.hpp"
#include "tests.hpp"
#include <algorithm>
#include <random>
#include <stdexcept>
#include <string>
#include <vector>
// NOLINTBEGIN(bugprone-exception-escape)
int main(const int argc, char *argv[]) {
if (argc != 2) {
return -2;
}
int problem_number = 0;
try {
p... | TEST | 0.891384 | 6.443861 |
afa5ed38-de46-4d01-8580-92cbf49a27c6 | oanoan16/Code-Cpp | ContestThaySon/SinhKeTiep/Bai1.cpp | #include <bits/stdc++.h>
#define faster() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int t;
int main()
{
faster();
cin >> t;
while (t--)
{
string s;
cin >> s;
int i=s.length()-1;
while (s[i]=='1' && i>=0)
i--;
if (i<0)
for (int j=0; j<s.length(); j++)
s[j]='0';
else... | ALGO | 0.999958 | 4.094683 |
e8843944-6360-4556-aa7c-9a78b9944f76 | enteguo/orb_vio | Thirdparty/g2o/g2o/core/marginal_covariance_cholesky.cpp | #include "marginal_covariance_cholesky.h"
#include <algorithm>
#include <cassert>
using namespace std;
namespace g2o {
struct MatrixElem
{
int r, c;
MatrixElem(int r_, int c_) : r(r_), c(c_) {}
bool operator<(const MatrixElem& other) const
{
return c > other.c || (c == other.c && r > other.r);
}
};
Ma... | ALGO | 0.9999 | 7.461662 |
3f38cc7d-00de-48ae-900f-6aab51e225e7 | shifasarthar/goldentouch22 | volumeofcube.cpp | #include<stdio.h>
int main()
{
int h,w,d,vol;
printf("\nEnter the Height:");
scanf("%d",&h);
printf("\nEnter the Width:");
scanf("%d",&w);
printf("\nEnter the Depth:");
scanf("%d",&d);
vol=h*w*d;
printf("The Volume of the cube is:%d",vol);
return 0;
}
| TOOL | 0.950316 | 3.35478 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.