uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
67e86cd1-b93e-435b-8df6-72c3601adeef | Rahamath17/rdkservices11 | UsbAccess/UsbAccess.cpp | #include "UsbAccess.h"
#include <unistd.h>
#include <mntent.h>
#include <regex>
#include <libudev.h>
#include <algorithm>
#include <mutex>
#include <fstream>
#include "libIBus.h"
#include "sysMgr.h"
#include "UtilsJsonRpc.h"
#include "UtilsIarm.h"
#define API_VERSION_NUMBER_MAJOR 1
#define API_VERSION_NUMBER_MINOR ... | TOOL | 0.978121 | 6.107073 |
b67351d9-d5bc-4a56-8790-4d4718e80937 | Shubham-017/DSA | insertnodeatbeg.cpp | #include<iostream>
using namespace std;
struct node {
int data;
struct node *next;
};
struct node *start = NULL;
void insert_at_beg(int);
void createlist(int);
void traverse();
int main () {
createlist(10);
createlist(20);
createlist(30);
// printf("list before insert function\n");
cout<<"list before ins... | ALGO | 0.999454 | 4.224691 |
69f19a9f-9340-40d5-9662-92f7d58a3af2 | spacefarers/cp | problems/USACO/2020-jan/g-1.cpp | #include <iostream>
#include <fstream>
#include <string>
#include <cstring>
#include <queue>
#include <set>
#include <cmath>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<pi... | ALGO | 0.99985 | 3.844108 |
e492887d-1d2e-49f2-884a-750dcebe26e4 | LearnProgramming/libastar | examples/n-puzzle/src/Puzzle.cpp | #include <algorithm>
#include <array>
#include <fstream>
#include <iostream>
#include <iterator>
#include <string>
#include <sstream>
#include <utility>
#include <vector>
#include "Puzzle.h"
#include "Tile.h"
using std::array;
using std::ifstream;
using std::istringstream;
using std::ostream;
using std::pair;
using st... | ALGO | 0.999444 | 6.499469 |
af6343e5-1a9d-4fcf-8b35-1df20f588d1e | KentoNishi/AlphaStar-CC41B-Spring20 | problem-set-7/checklist/main.cpp | /*
Cow Checklist
=============
Every day, Farmer John walks through his pasture to check on the
well-being of each of his cows. On his farm he has two breeds of
cows, Holsteins and Guernseys. His H Holsteins are conveniently
numbered 1...H, and his G Guernseys are conveniently numbered 1...G
(1 <= H <= 1000,1 <= G... | ALGO | 0.999773 | 4.500914 |
2e5b3735-faf7-4c7d-9d3f-21fead5668fe | fjarcticfox/blender | extern/bullet2/src/BulletCollision/CollisionShapes/btPolyhedralConvexShape.cpp | #if defined(_WIN32) || defined(__i386__)
#define BT_USE_SSE_IN_API
#endif
#include "BulletCollision/CollisionShapes/btPolyhedralConvexShape.h"
#include "btConvexPolyhedron.h"
#include "LinearMath/btConvexHullComputer.h"
#include <new>
#include "LinearMath/btGeometryUtil.h"
#include "LinearMath/btGrahamScan2dConvexHull... | ALGO | 0.992533 | 6.122885 |
5b5ca9d7-ad69-4983-8611-d58cb3cd9752 | Mohammad-Ashikul-Islam/Competitive_Programming | AtCoder/B - Roulette.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef double dl;
... | ALGO | 0.999983 | 3.748828 |
17bc9e3a-66e1-4100-85c9-07f37fb7f0d5 | ckj119940887/ann_gem5 | src/systemc/tests/systemc/misc/unit/data/datawidth_unsigned/truncation/datawidth.cpp | /*****************************************************************************
datawidth.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/**************************************************************************... | ALGO | 0.9685 | 5.331775 |
d36d3732-218a-43a6-96bd-35de1e69ae61 | coisin/Algorithms | DP/edit_distance.cpp | #include <bits/stdc++.h>
using namespace std;
string a, b;
int dp[100][100];
int edit_distance(int i, int j) {
if(dp[i][j] != -1) return dp[i][j];
if(i == 0) return j;
if(j == 0) return i;
if(a[i - 1] == b[j - 1]) return edit_distance(i - 1, j - 1);
return dp[i][j] = 1 + min(edit_distance(i - 1, j - 1), min(edi... | ALGO | 0.99999 | 4.239548 |
6539ab0d-11cf-442e-959f-974ffe63c935 | miguelAlessandro/CompetitiveProgramming | UVA/725_division.cpp | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace::std;
int n;
bool solution, map[11];
bool mapeo(int n, int m){
memset(map, false, sizeof map);
if(n < 10000 && m < 10000) return false;
if(n < 10000 || m < 10000) map[0] = true;
while(n > 0){
if(map[n%10]) return false;... | ALGO | 0.998154 | 3.715519 |
462f7071-3848-4e85-a062-c2ccaad68c70 | jayesh-kaza/LeetCode | cpp/709_To_LowerCase.cpp | class Solution {
public:
string toLowerCase(string str) {
for (int i = 0; i < str.length();i++) {
if (str[i] >= 'A' && str[i] <= 'Z') {
str[i] = str[i] + 32;
}
}
return str;
}
}; | ALGO | 0.855173 | 5.916833 |
8304d282-90ad-4427-a024-0bb1d1b76c75 | rockysingh2003/-GFG-Mastery-Blueprint | Array/FIND THE MAJORITY ELEMENT IN THE ARRAY THAT APPEARS MORE THAN N/3 TIMES/BETTER.CPP | #include <bits/stdc++.h>
using namespace std;
vector<int> majorityElement(vector<int> v)
{
int n = v.size();
vector<int> ans; //this will be our vector in which we are gonna store the vector...
map<int, int> myMap;
// calculating the floor value;
int minimum=(n/3)+1;
for (int i = 0; i < n... | ALGO | 0.999757 | 4.970643 |
c2791cdf-14a6-473e-8791-e1428596cae7 | saikatcodec/CP | Codeforces/A_Dragons.cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
// clang-format off
#define nl "\n"
#define ll long long
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#defin... | ALGO | 0.999981 | 4.718781 |
513c0452-a2ca-4572-930b-c41ccfff2a70 | NaeemAbdullahAkram/LeetCode | 2220-find-all-possible-recipes-from-given-supplies/2220-find-all-possible-recipes-from-given-supplies.cpp | class Solution {
public:
vector<string> findAllRecipes(vector<string>& recipes,
vector<vector<string>>& ingredients,
vector<string>& supplies) {
unordered_map<string, int> indegree;
unordered_map<string, vector<string>> adjList;
... | ALGO | 0.999963 | 6.077649 |
96090e29-8c25-4515-89f7-2d25c7e6c814 | yzcmf/Interview | LeetCode-Solutions/C++/falling-squares.cpp | // Time: O(nlogn)
// Space: O(n)
class Solution {
public:
vector<int> fallingSquares(vector<vector<int>>& positions) {
vector<int> result;
map<int, int> heights;
int maxH = heights[-1] = 0;
for (const auto& p : positions) {
auto it0 = heights.upper_bound(p[0]);
... | ALGO | 0.999978 | 6.327141 |
c0d6dc6d-e789-4550-b302-71c3a5c673d5 | canesche/challenge_problems | beecrowd/cpp/2533.cpp | #include <iostream>
#include <iomanip>
using namespace std;
int main() {
int m;
double n, c;
double sum_nc;
double sum_c;
while (cin >> m){
sum_nc = 0;
sum_c = 0;
for(int i = 0; i < m; i++){
cin >> n >> c;
sum_c += c;
sum_nc += n * c;... | ALGO | 0.998507 | 4.301685 |
fc4b1d4c-9e1a-4410-823e-d661905430b2 | SWEG-2016EC-Batch/Zen | ETS1557_ZEMEDKUN_WORKALEM/pattern 4b1.cpp | #include <iostream>
using namespace std;
int main() {
int n;
for (int row = 1; row <= 5; row++) {
for (int k = 5 - row; k >= 0; k--) {
cout << " ";
}
for (int col = 1; col <= row; col++) {
cout << char('1' + col - 1);
}
cout << endl;
}
r... | ALGO | 0.997981 | 3.722032 |
bf57019a-5d87-45d4-89a7-71ecdc3bd7c6 | rdacomp/Slic3rs | src/test/libslic3r/test_geometry.cpp |
#include <catch.hpp>
#include "Point.hpp"
#include "BoundingBox.hpp"
#include "Polygon.hpp"
#include "Polyline.hpp"
#include "Line.hpp"
#include "Geometry.hpp"
#include "ClipperUtils.hpp"
using namespace Slic3r;
TEST_CASE("Polygon::contains works properly", ""){
// this test was failing on Windows (GH #1950)
... | TEST | 0.901082 | 7.047649 |
85930091-0cc2-4f12-8d42-b96c71228628 | Keerthana-Sivalingamn/leetcode | 1-two-sum/two-sum.cpp | class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int i,j;
int l=nums.size();
for(i=0;i<l;i++)
{
for(j=(i+1);j<l;j++)
{
if(nums[i]+nums[j]==target)
return{i,j};
}
}
return... | ALGO | 0.99958 | 5.947047 |
04a4c969-3160-45d2-8b70-211a455891a3 | ishandutta2007/codeforces | fizzydavid/normal/1070/L.cpp | //by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long long ll;
const int mod=1e9+7;
//My i/o stream
str... | ALGO | 0.999581 | 3.429702 |
11a642cb-ff1d-4aaa-9335-1afa9a5d6310 | UO-OACISS/zerosum | src/post-processing/mpi_p2p_merge.cpp | /*
Utility to extract MPI P2P data from zerosum logs and
represent them as CSV files that a post-processing script
can utilize.
*/
/*
sentfile="sent.heatmap.csv"
rm -f $sentfile
for i in {000..512} ; do
echo ${i}
file="zs.${i}.log"
#for line in `grep "Sent " ${i}` ; do
grep "Sent " ${file} ... | DATA | 0.945368 | 4.543814 |
cc449ecf-c845-4ed9-b0fc-56aed109ced0 | Singh-Nitin-15/CP | CodeChef/Starters 199/C.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define YES cout << "YES\n"
#define NO cou... | ALGO | 0.999959 | 4.415932 |
3556f5e5-6030-4c62-bc31-f9cdeac922af | Thilo87/ProjectEuler | 1_Testprojekt/main.cpp | #include <iostream>
#include <vector>
#include <fstream>
#include <string>
#include <set>
using namespace std ;
int main()
{
double sqrt5 = 2.23 ;
double ausg = pow( sqrt5, 40 ) ;
cout << ausg << endl ;
double ausg2 = pow( 5., 20. ) ;
cout << ausg2 << endl ;
return 0 ;
} | ALGO | 0.999225 | 3.109369 |
6d3c8f0f-3cce-4730-8cc3-29e6d180dc7a | nathfavour/notpixelshot | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998733 | 6.76775 |
906ddbb5-0794-441e-a473-318fdd205790 | Ayusohm432/Coding | ProblemOfTheDay/Geeksforgeeks/2025/7. July/15.07.2025_Divisible by 13.cpp | /*
Problem Link: https://www.geeksforgeeks.org/problems/divisible-by-13/1
*/
/*Divisible by 13
Given a number represented as a string s (which may be very large), check whether it is divisible by 13 or not.
Examples:
Input : s = "2911285"
Output : true
Explanation: 2911285 ÷ 13 = 223945, which is a whole number wit... | ALGO | 0.999497 | 5.535657 |
353f705d-a7b7-47d0-b7cf-6ebc18e95cad | dirtyfilthy/llvm-project-14.0.6 | openmp/libomptarget/plugins/amdgpu/impl/impl.cpp | /*
* Data
*/
// host pointer (either src or dest) must be locked via hsa_amd_memory_lock
static hsa_status_t invoke_hsa_copy(hsa_signal_t signal, void *dest,
hsa_agent_t agent, const void *src,
size_t size) {
const hsa_signal_value_t init = 1;... | ALGO | 0.902824 | 6.52087 |
8a474e9d-c2c0-44f9-9c8e-5917061a50b1 | atlas25git/cses-problemSet | Day1/10TrailingZero.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int,int>
#define pb push_back
const int mod = 1e9 + 7;
const int N = 100005, M=22;
void solve(){
int i,j,k,n,m,ans=0,cnt=0,sum=0;
cin>>n;
for(i=5;i<=n;i*=5)an... | ALGO | 0.999826 | 4.146342 |
6f4bb8ea-1857-4d5c-a5d8-723aa46ce382 | ibaoger/pdfium | core/fpdftext/cpdf_linkextract.cpp | #include "core/fpdftext/cpdf_linkextract.h"
#include <wchar.h>
#include <vector>
#include "core/fpdftext/cpdf_textpage.h"
#include "core/fxcrt/fx_extension.h"
#include "core/fxcrt/fx_string.h"
#include "core/fxcrt/fx_system.h"
namespace {
// Find the end of a web link starting from offset |start| and ending at off... | TOOL | 0.861136 | 6.857703 |
8842d489-c9c7-4a64-8cfb-4d3c2b0561db | Es7evam/Problem-Solutions | Ladder1500-1599/17 - 160A - Twins.cpp | //31512132 2017-10-19 18:09:52 Estevam 160A - Twins GNU C++11 Accepted 30 ms 2000 KB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define fastcin ios_base::sync_with_stdio(false)
typedef long long ll;
const int INF = 0x3f3f3f3f;
const doubl... | ALGO | 0.999413 | 3.849684 |
06408910-2348-4f93-866e-c5313c2392b2 | FangBaiUTS/diff-gaussian-rasterization-w-pose-calib | third_party/glm/test/gtx/gtx_simd_mat4.cpp | ///////////////////////////////////////////////////////////////////////////////////
/// OpenGL Mathematics (glm.g-truc.net)
///
/// Copyright (c) 2005 - 2012 G-Truc Creation (www.g-truc.net)
/// Permission is hereby granted, free of charge, to any person obtaining a copy
/// of this software and associated documentatio... | TEST | 0.985793 | 6.515547 |
728894a6-cb96-42f9-9cc1-36efb3b9def2 | kimurash/typical90 | 043/main.cpp | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define arrout(a, s, n) rep(i, s, n)cout<<a[i]<<" "; cout<<endl;
#define vecout(v) for(auto elm : (v))cout<<elm<<" "; cout<<endl;
#define... | ALGO | 0.999751 | 4.064852 |
1644738c-04d6-4ce9-a06e-8eae38f844c8 | Meeperbunny/CompetitiveProgramming | archive/CF375/_F.cpp | #include <bits/stdc++.h>
using namespace std;
#define HEADER ios::sync_with_stdio(0);cin.tie(0);if (fopen("file.in", "r")) {freopen("file.in", "r+", stdin);};
#define all(v) v.begin(), v.end()
using ll = long long;
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T... | ALGO | 0.99997 | 4.416823 |
00223882-96cf-4758-95eb-b048daa33ac1 | ArijitWayne/Algorithms | Data Structures/disjointset/ConnectedComponent/ConnectedComponent.cpp | #include<iostream>
#include<vector>
using namespace std;
class DSU{
std::vector<int> parent;
int connected_component;
public:
DSU(int n){ parent = vector<int>(n,-1); connected_component = n; }
int findParent(int n){
if(parent[n] == -1)
return n;
parent[n] = findParent(parent[n]); //Path Compression
return... | ALGO | 0.999793 | 5.483939 |
ef519437-9971-4bb6-803b-423e970e1e3c | croko22/CCII-LAB | LAB (11)/4hanoi.cpp | #include <iostream>
#include "Nodo.h"
#include "Pila.h"
#include "Pila.cpp"
using namespace std;
void moverPieza(Pila *a, Pila *b){ //Movimiento de pieza entre dos pilas
cout<<"Moviendo "<<a->getHead()<<" de "<<a->getNombre()<<" a "<<b->getNombre()<<endl; //Informacion del mov
b->insertar(a->getHead());
a->eliminar... | ALGO | 0.999558 | 4.325321 |
fa394f66-696e-4d83-9602-d727c2eda2c1 | junlong-gao/recreations | src/code_practise/leetcode/cpp/00440.cpp | class Solution {
using ll = long long;
ll count(ll prefix, ll n) {
ll lo = prefix; ll hi = prefix;
ll ret = 0;
while (lo <= n) {
ret += min(hi - lo + 1, n - lo + 1);
lo = lo * 10;
hi = hi * 10 + 9;
}
return ret;
}
ll search(ll ... | ALGO | 0.999929 | 6.870343 |
f7020744-cfd7-4190-b551-396c85276395 | agatagc/Courses | CPP/CPP_From_Beginner_to_Beyond/Section_8/Equality.cpp | #include <iostream>
using namespace std;
int main()
{
bool equal_result {false};
bool not_equal_result {false};
// Example 1
// int num_1{}, num_2{};
// cout << boolalpha; // wil display true/false instead of 1/0 for booleans
// cout << "Enter two integers separated by a space: ";
... | ALGO | 0.956898 | 4.159617 |
e144c2f6-47c0-44ca-a398-5eaaea63078e | KazuakiTokunaga/competitive-programming | book/programming_contest_challenge/062_個数制限付き部分和.cpp | // i番目まででjを作る際に余る最大のi番目の個数でDPしていく
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#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 all(x) (x).begin(),(x).end()
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
... | ALGO | 0.999992 | 3.904594 |
5f9140ca-c26d-48bc-b7e6-893b0395b85a | dmitrytavern/university | ADS/lab7/lab7_1.cpp | // Lab #7
// Graphs.
//
// Create a program that implements the following operations for a graph:
// - Adding a vertex with a given number entered from the keyboard.
// - Adding an edge between specified vertices.
// - Removing a vertex with a given number from the graph.
// - Removing an edge between vertices specifie... | ALGO | 0.98815 | 5.139734 |
b1d15ced-052f-46ae-8d65-880f29e7256d | ghiringhelliluca/Numerical-Simulation-Laboratory | exercise_06/M(RT)^2/SOURCE/particle.cpp | /****************************************************************
*****************************************************************
_/ _/ _/_/_/ _/ Numerical Simulation Laboratory
_/_/ _/ _/ _/ Physics Department
_/ _/_/ _/ _/ Universita' degli Studi di Milano
_/ _/ ... | ALGO | 0.996512 | 5.443586 |
08c8c1ef-14af-44f4-9ba7-34826c5ce117 | sarvex/leetcode-java | solution/2200-2299/2286.Booking Concert Tickets in Groups/Solution.cpp | class Node {
public:
int l, r;
long s, mx;
};
class SegmentTree {
public:
SegmentTree(int n, int m) {
this->m = m;
tr.resize(n << 2);
for (int i = 0; i < n << 2; ++i) {
tr[i] = new Node();
}
build(1, 1, n);
}
void modify(int u, int x, int v) {
... | ALGO | 0.999954 | 5.199092 |
751a5b68-4ad2-4a0a-9d53-b1875a2bfce0 | bliscosque/CPPProblemsVSCode | CourseUdemy_DS_Alg/7-Recursion/1-climbing_ladder.cpp | //giving ladder containing N steps
//can jump 1,2,3 at each step
//find number of ways to climb
//N=4
//output=7
//O(3^N)-> 3 chamadas em cada recursao
#include <iostream>
using namespace std;
int countWays(int n) {
if (n<0) return 0;
if (n==0) return 1;
return countWays(n-1)+countWays(n-2)+countWays(n-... | ALGO | 0.999939 | 4.438668 |
6e0a01f3-0300-4319-a138-43752fb9ad85 | SMUG201911188CYS/c-_practice | 5_8.cpp | #include <iostream>
#include <cstring>
#include <string>
int main()
{
char word[100];
int word_count = 0;
std::cout << "영단어 입력 : " << std::endl;
std::cin >> word;
for (;std::strcmp(word, "done");) {
word_count++;
std::cout << word << std::endl;
std::cin >> word;
}
std::cout << "총 " << word_count;
} | TOOL | 0.870578 | 4.395215 |
2cda2701-5fee-4559-bf6a-65f3d5350c38 | ProgSoc/ProgComp2023 | problems/11-math-linter/solution.cpp | #include <iostream>
#include <string>
#include <vector>
#include <regex>
#include <algorithm>
using namespace std;
enum Expects
{
EXPRESSION,
OPERATOR,
MINUS,
CLOSING_BRACKET
};
vector<Expects> BEGIN_EXPR = {EXPRESSION, MINUS};
vector<Expects> AFTER_EXPR = {OPERATOR, CLOSING_BRACKET};
vector<Expects>... | ALGO | 0.999174 | 5.260276 |
0322d425-b723-4f15-a030-c28dd7c79c0c | GuacheSuede/MSSubmission1234567890 | submission/macd/boost_1_69_0/libs/graph/test/random_spanning_tree_test.cpp | // Authors: Jeremiah Willcock
// Andrew Lumsdaine
#include <boost/graph/random_spanning_tree.hpp>
#include <boost/graph/grid_graph.hpp>
#include <boost/array.hpp>
#include <boost/random.hpp>
#include <boost/property_map/shared_array_property_map.hpp>
#include <boost/property_map/dynamic_property_map.hpp>
#i... | ALGO | 0.95602 | 5.143466 |
c9842914-62ed-45fc-87c8-13c0d37aeb3c | kabsmeiou/cp-solutions | Rounds/Round 943(Div 3)/B.cpp | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int n, m;
cin >> n >> m;
string a, b;
cin >> a >> b;
int k = 0, j = 0;
for (int i = 0; i < n; i ... | ALGO | 0.999927 | 4.816315 |
4bac415f-5edb-4863-a509-918fe42b1f7c | aytona/DataStructs-Algorithms | ReviewLab/QuestionOneOne.cpp | // C++ Review Lab Exercises
// Class: Data Structures & Algorithms
// By: Christopher Aytona
#include <iostream>
using namespace std;
void Swap(int &n1, int &n2)
{
int temp = n1;
n1 = n2;
n2 = temp;
}
int main()
{
int i, y;
cout << "Input 2 interger values: ";
cin >> i >> y;
cout << "\nFirst value: "<< i << "... | ALGO | 0.990734 | 5.001823 |
e164b830-37d3-4481-a2c0-7dc1607a065c | evapavlinek/acceleratedCPP | ch4/student_grades_student_structure_separated.cpp | #include <algorithm>
#include <iomanip>
#include <ios>
#include <iostream>
#include <stdexcept>
#include <string>
#include <vector>
#include "./separate_compilation/grade.h"
#include "./separate_compilation/Student_info.h"
using std::cin; using std::setprecision;
using std::cout; using std::sort;
using std::domain_err... | TOOL | 0.892027 | 5.644384 |
8180e475-cff1-44ee-bb08-b458cba7ccf7 | gtkn/atcoder | ABC_318_D_2.cpp | //title
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define rep1(i,n) for (ll i = 1; i <= (n); ++i)
#define repr(i,n) for (ll i = (n)-1; i >= 0; --i)
#define rep1r(i,n) for (ll i = (n); i > 0; --i)
#define bit(n,k) ((n>>... | ALGO | 0.999976 | 4.008183 |
cbd64ee7-93a6-4fcf-9aad-07d098e71e68 | IDA-TUBS/lwW2RP | thirdparty/boost_1_73_0/libs/intrusive/example/doc_treap_set.cpp | using namespace boost::intrusive;
class MyClass : public bs_set_base_hook<> //This is a base hook
{
int int_;
unsigned int prio_;
public:
//This is a member hook
bs_set_member_hook<> member_hook_;
MyClass(int i, unsigned int prio) : int_(i), prio_(prio)
{}
unsigned int get_priority() co... | ALGO | 0.984339 | 5.071477 |
4dca6307-f755-4e90-b9be-23b25f11e356 | ab-atiq/Phitron_course | Competitive Programming/Basic C C++ Python Java/Basic C CPP/Array/array.cpp | #include <iostream>
using namespace std;
int main()
{
int arr[6] = {36, 26, 13, 67, 25, 63};
cout << "Initial Array: ";
for (auto n : arr)
{
cout << n << " ";
}
cout << endl;
return 0;
} | TOOL | 0.920835 | 3.972943 |
9c2ac7f8-ca9e-48cc-b884-fa5adafeab91 | CodeWithIsmail/Competitive-Programming | CodeChef/Rivalry.cpp | /// *** --- || In the name of ALLAH ||| --- *** ///
/// *** --- || Author: Code_with_Ismail ||| --- *** ///
#include <bits/stdc++.h>
using namespace std;
// Data Type:
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typede... | ALGO | 0.999956 | 4.295867 |
756ba89f-2d8d-4a26-b0d0-124ff29b41ff | kiliakis/blond-benchmark | histogram/benches/bench6.cpp | #include <stdlib.h>
#include <stdio.h>
#include "histogram.h"
#include "utils.h"
#include <vector>
#include <random>
#include <chrono>
// #include <PAPIProf.h>
#include <omp.h>
#include <string>
#include <algorithm>
using namespace std;
int main(int argc, char const *argv[])
{
int n_turns = 50000;
int n_partic... | ALGO | 0.969685 | 4.404866 |
8620904c-96e8-472b-a9ad-10ed5f66396f | awdevmyid/program | DAY-13/Longest Common Subsequence(Memoisation).cpp | #include <bits/stdc++.h>
#define lli long long int
#define endl "\n"
#define MAX 10005
#define MOD 1000000007
using namespace std;
int dp[MAX][MAX];
int LCS(string s1, string s2, int n, int m){
if((n==0) || (m==0)) return 0;
if(dp[n][m] == -1)
{
if(s1[n-1] == s2[m-1])
dp[n][m] = 1 + LCS(s1,s2,n-1,m-1);
e... | ALGO | 0.999992 | 4.635964 |
aec6e745-9c61-4cc3-8eb3-d6f16f78920b | antEater3005/DSA-Questions | Questions/Target_pair_sum.cpp | /*You are given a list of songs where the ith song has a duration of time[i] seconds.
Return the number of pairs of songs for which their total duration in seconds is divisible by 60. Formally, we want the number of indices i, j such that i < j with (time[i] + time[j]) % 60 == 0.*/
#include <bits/stdc++.h>
using names... | ALGO | 0.999563 | 5.372371 |
5a4feba5-18b7-4d37-93af-759cfdc9f746 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_test_36_10.cpp | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
void SADIEM() {
std::ios_base::sync_with_stdio(NULL);
cin.tie(0);
cout.tie(0);
}
bool iscomposite(int x) {
if (x < 2 || (x != 2 && !(x & 1)) || (x != 3 && !(x % 3)) ||
(x != 5 && !(x % 5)))
return true;
for (int i = 7; i <=... | ALGO | 0.999936 | 4.330759 |
28d4384a-c3a6-486c-b04f-b13398347da0 | harshagrwl/Competitive-Programming | Codeforces/swords.cpp |
#include <bits/stdc++.h>
using namespace std ;
#define M 1000000007
#define loop(i,n) for(int i = 0;i < int(n);i++)
#define All(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define each(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
typedef long long ll;
typedef vector<... | ALGO | 0.999931 | 3.561926 |
5346cf29-67f1-4d9f-ad15-22a5f2de246f | Felipe-teodoro05/data-structures-C-Python | C/Árvores/Arvore_RN.cpp | // Programa que implementa uma árvore rubro negra//
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
// Declaracao da estrutura do no
struct no{
int numero;
int cor; // 1 vermelho 0 preto
struct no*esquerda;
struct no*direita;
};
// função que indica se o nó é vermelho
int vermelho(struct no*raiz){
if... | ALGO | 0.999843 | 4.669338 |
5e0f8c8d-471c-4c95-ae2b-09ae7896459f | pujakkar/Pujak | BST5.cpp | #include<bits/stdc++.h>
using namespace std;
struct node{
int data;
node* left;
node* right;
node(int val){
data=val;
left=NULL;
right=NULL;
}
};
node* buildBST(int array[],int start,int end){
if(start>end){
return NULL;
}
int mid=start+(end-start)/2;
... | ALGO | 0.999989 | 5.154139 |
b2f49ab9-9b53-49c8-b2bd-4f262e4f772d | xjka/CoreTracking | src/leap_frog.cpp | #include "utilities.hpp"
std::vector<fof_arg> fof_args(3);
std::mutex tr_mutex;
std::mutex p_mutex;
std::mutex fof_mutex;
std::array<std::atomic<bool>,8> kill = {false,false,false,false,false,false,false,false};
std::array<std::condition_variable,8> cvar;
CalcArgs glob_args, glob_tr_args, glob_tr_args2;
std::array<std... | ALGO | 0.99917 | 4.153796 |
39a7d344-80e1-4eb2-9a3b-9092dcb448cb | pablomuniz/QuasarQuant | ql/pricingengines/vanilla/fdhestonhullwhitevanillaengine.cpp | /* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
#include <ql/methods/finitedifferences/meshers/fdmblackscholesmesher.hpp>
#include <ql/methods/finitedifferences/meshers/fdmblackscholesmultistrikemesher.hpp>
#include <ql/methods/finitedifferences/meshers/fdmhestonvariancemesher.hpp>
#inc... | ALGO | 0.99855 | 7.584423 |
ae2a2981-ecb6-4fea-bbec-f2bf692768c2 | GuiSilva77/fatec_aulas_prog | alg_log_prog/Aula 10/ex01_01/ex01.cpp | #include <stdio.h>
int isOne(int a)
{
if (a < 0)
return 0;
else
return 1;
}
int main()
{
int a;
printf("Insira um numero: ");
scanf("%d%*c", &a);
printf("%d", isOne(a));
}
| ALGO | 0.965049 | 3.255139 |
3bda1af2-d157-4272-aad7-aa1ff6d153f4 | Jovan11111/LeetCode | Old/LeetCode/LevelOrderMaxElem_515.cpp | #include <vector>
#include <queue>
//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)... | ALGO | 0.999981 | 6.264132 |
19260dfc-7c87-443d-9366-15de1d1a095a | ohwada/MAC_cpp_Samples | OpenCV/samples/tutorial_code/ShapeDescriptors/generalContours_demo2.cpp | /**
* @function generalContours_demo2.cpp
* @brief Demo code to obtain ellipses and rotated rectangles that contain detected contours
* @author OpenCV team
*/
#include "opencv2/imgcodecs.hpp"
#include "opencv2/highgui.hpp"
#include "opencv2/imgproc.hpp"
#include <iostream>
using namespace cv;
using namespace std;... | ALGO | 0.997765 | 7.74176 |
bc9688e5-41b5-459d-9b1c-fb44513d9948 | CakeForest/noip | 2016上课/test/10.20考试/src/NK_SuperGate/choose.cpp | #include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int maxn=2e5+5,inf=0x3f3f3f3f;
int n,m,s[maxn],f[1005][1005];
inline void _read(int &x){
char t=getchar();bool sign=true;
while(t<'0'||t>'9')
{if(t=='-')sign=false;t=getchar();}
for(x=0;t>='0'&&t<='9';t=getchar())x=x*10... | ALGO | 0.999944 | 3.73945 |
cd8e75a7-87be-41fb-9216-d3ffcc57441a | Sarjador/Ender3_V4.2.2_Marlin-bugfix-2.0.x_BLTouch_and_FilamentSensor | buildroot/share/PlatformIO/variants/MARLIN_F103Vx/variant.cpp | #include "pins_arduino.h"
#ifdef __cplusplus
extern "C" {
#endif
// Digital PinName array
const PinName digitalPin[] = {
PA_0, //D0
PA_1, //D1
PA_2, //D2
PA_3, //D3
PA_4, //D4
PA_5, //D5
PA_6, //D6
PA_7, //D7
PA_8, //D8
PA_9, //D9
PA_10, //D10
PA_11, //D11
PA_12, //D12
PA_13, //D... | CONFIG | 0.92431 | 3.751779 |
f49ef4bf-ead4-423c-9464-fa7c9a890f5e | devrz45/argos-coevolution | loop_functions/co_evolution_loop_functions/co_evolution_loop_functions.cpp | #include "co_evolution_loop_functions.h"
/****************************************/
/****************************************/
CCoEvolutionLoopFunctions::CCoEvolutionLoopFunctions() :
m_unCurrentTrial(0),
m_pfControllerParams(new Real[PREY_GENOME_SIZE]),
m_pcRNG(NULL),
countKilled(0) {}
/****************... | ALGO | 0.998597 | 3.504346 |
51404ae9-c5b9-4498-bd96-80718fec67c7 | gagandeepahuja09/Trees | LeetCode/Sum Of Distances In Tree.cpp | class Solution {
public:
vector<unordered_set<int>> tree;
vector<int> ret;
vector<int> count;
int ans = 0;
void dfs(int root, int prev) {
for(auto i : tree[root]) {
if(i == prev)
continue;
dfs(i, root);
count[root] += count[i];
... | ALGO | 0.999961 | 5.572753 |
c8dba073-5685-4bd1-baa9-82eb7b2b656b | Tobiasz931/MISS-grupa-mierci | miss_lab1_domi.cpp | #include <stdio.h>
#include <gmpxx.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <sstream>
std::string fixed(mpf_class x, int prec)
{
std::ostringstream ss;
ss << std::fixed;
ss << std::setprecision(prec);
ss << x;
std::string str = ss.str();
return str.subs... | ALGO | 0.983414 | 3.075979 |
48e9bf99-dae9-42b2-b028-058ab3e08045 | vinshaviswanath/Task_7 | 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.998809 | 6.763549 |
91d29a20-ed39-41da-b312-8844a28589b5 | YaneZhekov/Cpp_Basics_03-04_Conditional_Statements | Extra 2.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
int normalTimePlayedPerYear = 30000; // in minutes
int restDays;
cin >> restDays;
int workDays = 365 - restDays;
int playAmountOnWorkDays = workDays * 63;
int playAmountOnRestDays = restDays * 127;
int totalPla... | ALGO | 0.99959 | 3.779471 |
5cf94c22-c58c-4b1e-80d6-5b07536f3c16 | AmnanBK/materi-struktur-data | linkedListOperations.cpp | #include <stdlib.h>
#include <iostream>
using namespace std;
// Create a Node
struct Node {
int data;
struct Node* next;
};
void insertAtBeginning(struct Node** headRef, int newData) {
// Allocate memory to a node
struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
// Insert the data
newNode->da... | ALGO | 0.999925 | 5.208919 |
0e2599bc-70df-4e06-8e22-ab1f61239b2c | KitauraHiromi/atcoder | ABC119/c.cpp | #include <bits/stdc++.h>
#include <iostream>
#include <utility> // pair
#include <string>
#include <vector>
#define MAX_N 8
#define INF 1000000001
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define REP(i, n) for(int i=0; i<n; i++)
#define RER(i, n) for(int i=n-1; i>=0; i--)
#define ALL(v) v.begin() v.end()
#define pb ... | ALGO | 0.999912 | 3.546355 |
a4c7dfbb-51fc-4f00-97ee-dd9ecf4cba97 | RunAtTekky/cpp | ACD/1200/489B.cpp | /*
RunAt - grey
*/
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef int long long ll;
#define printnl(a) cout << a << "\n";
void solve() {
ll boys;
cin >> boys;
vector<ll> boySkill(boys);
for (auto &i : boySkill) cin >> i;
ll girls;
cin >> girls;
... | ALGO | 0.999905 | 3.830635 |
10dc96d0-c565-4efe-ab66-9f7398ac0b00 | nitish9592/learnings | dp/knapsack_spaceOptimization.cpp | // Knapsack Problem - Space Optimized Version
// This code implements the 0/1 Knapsack problem using space optimization.
// It uses a single-dimensional DP array to reduce space complexity from O(nW) to O
// (W), where n is the number of items and W is the maximum weight capacity.
#include <bits/stdc++.h>
using namespa... | ALGO | 0.999999 | 6.725849 |
d5bab9fd-3dec-4bd0-a3b1-f5e2388115d9 | iamnelsonizah/calculator-App-flutter | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.9988 | 6.76073 |
84ae8035-e6a9-45f1-ac5c-62f373125ece | zkluo/-offer | 调整数组的顺序使奇数位于偶数前面/adjust_array.cpp | /*
* 题目描述
* 输入一个整数数组，实现一个函数来调整该数组中数字的顺序，使得所有的奇数位于数组的前半部分，所有的偶数位于数组的后半部分，并保证奇数和奇数，偶数和偶数之间的相对位置不变
*/
//思路：创建奇数数组和偶数数组，最后合并在一起
class Solution {
public:
void reOrderArray(vector<int> &array) {
vector<int> odd;
vector<int> even;
for (int i=0; i<array.size(); i++) {
if (array[i] % 2... | ALGO | 0.999912 | 5.081733 |
b5ad742d-be24-4d11-be63-ef13fcc1a534 | ospinalucas15/practica-1 | ejercicio10.cpp | #include <iostream>
using namespace std;
int ejercicio10(){
int n = 0;
int count = 0;
int isPrime = 0;
bool flag = true;
int i = 1;
cout << "Ingrese un numero entero: ";
cin >> n;
while (flag == true) {
++i;
count = 0;
for (int j = i; j > 0; --j){
... | ALGO | 0.999606 | 3.496995 |
e03a5ecb-a8c2-4038-94d1-b0acb5daa9bd | nirmit06/spcc | exp3.cpp | #include <bits/stdc++.h>
using namespace std;
// Function to remove left recursion from a production rule
void removeLeftRecursion(string nonTerminal, vector<string> productions) {
// Split the productions into those with and without left recursion
vector<string> alpha, beta;
for (int i = 0; i < production... | ALGO | 0.999918 | 5.187183 |
5d86722e-fc96-4489-8b29-28b8c7018b66 | NicoLP04/NeuralNetwork | neuralNetwork.cpp | #include "neuralNetwork.h"
NeuralNetwork::NeuralNetwork(LossFunction lossFunction) { mLossFunction = lossFunction; }
NeuralNetwork &NeuralNetwork::addLayer(Layer *layer) {
mLayers.push_back(layer);
return *this;
}
std::vector<double> NeuralNetwork::forward(std::vector<double> input) {
for (Layer *layer :... | ALGO | 0.978402 | 4.597689 |
2de4b8a6-615e-463f-95ee-4793e7d05933 | TimothyHorscroft/competitive-programming | codeforces/1278/e.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, l, r) for (int i=(l); i<(r); ++i)
#define RREP(i, r, l) for (int i=(r); i>(l); --i)
#define vi vector<int>
#define vb vector<bool>
#define pii pair<int,int>
#define tiii tuple<int,int,int>
#define tiiii tuple<int,int,int,int>
#define po... | ALGO | 0.999916 | 4.078066 |
4371e2d0-0454-4af8-af95-50d56022d6ea | Jim-CSE/code | Network security lab/affine.cpp | #include<bits/stdc++.h>
using namespace std;
// Function to find the multiplicative inverse of a key in mod 26
int MI(int key) {
for (int i = 1; i <= 26; i++) {
if ((key * i) % 26 == 1)
return i;
}
cout << "Invalid multiplicative key" << endl;
return -1;
}
// Function to encrypt th... | ALGO | 0.999361 | 5.503882 |
a494f795-1a7c-4134-8a1d-3ecec998973a | phumipatc/C_Competitive_Programming | C++ - 2560/2_4_Camp/Rush_10/RT_Mushroom.cpp | /*
Task :
Author : Phumipat C.
School : RYW
Language: C++
*/
#include<bits/stdc++.h>
using namespace std;
int row[100005],col[100005],tilt1[200005],tilt2[200005];
int main(){
int n,k,x,y;
scanf("%d %d",&n,&k);
for(int i=1;i<=n;i++){
scanf("%d %d",&x,&y);
row[x]++;
... | ALGO | 0.999982 | 3.746653 |
36d03a00-8829-4358-84dc-9bd4f109e49c | kogehipo/atcoder | ABC351-400/ABC351/D.cpp | #include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define range(i, s, e) for (int i = (s); i <= (int)(e); i++)
#define all(a) begin(a), end(a)
// . 通路
// # 磁石
// @ 磁石隣接
int main()
{
int H, W;
cin >> H >> W;
ve... | ALGO | 0.999919 | 4.720358 |
e03b7b0c-fb74-4bbf-a146-6ab379fa66c5 | n3wzd/Programmers | 2020 KAKAO BLIND RECRUITMENT - 블록 이동하기.cpp | #include <vector>
#include <queue>
struct Node { int x, y, a; };
using namespace std;
int N, M, dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };
int dist[102][102][2]; // 0: hor, 1: ver
vector<vector<int>> board;
queue<Node> q;
bool isSafe(int x, int y) { return !(x < 0 || x >= M || y < 0 || y >= N || board[y][x]); }
... | ALGO | 0.999968 | 4.94623 |
708d8129-bebe-46cf-afe1-3644186a2eca | Pilleteer/Problem_Solving | week03/jumpoint.cpp | #include<iostream>
#include<utility>
#include<list>
#include<vector>
#include<math.h>
using namespace std;
vector<int> adj[1010];
vector<pair<int,int>> node;
int passed[1010];
int layer[1010];
void init(int n){
for(int i=0;i<n;i++){
passed[i]=0;
layer[i]=-1;
}
}
int distcal(pair<int,int> x,pair<... | ALGO | 0.999708 | 3.797989 |
e8b57a64-0bcb-433e-b905-14cba4106073 | KeyMaker13/C-plus-plus | OpenGLSuperBible/sb6code_2013_11_10/src/prefixsum/prefixsum.cpp | #include <sb6.h>
#include <vmath.h>
#include <shader.h>
#include <cstdio>
#define NUM_ELEMENTS 2048
static inline float random_float()
{
static unsigned int seed = 0x13371337;
float res;
unsigned int tmp;
seed *= 16807;
tmp = seed ^ (seed >> 4) ^ (seed << 15);
*((unsigned int *) &res) = ... | ALGO | 0.921377 | 5.492362 |
da23d9c8-30dd-4d91-b2a7-1ddab384f282 | zenyxqord/zenyx | src/llmq/quorums.cpp | #include <llmq/quorums.h>
#include <llmq/quorums_blockprocessor.h>
#include <llmq/quorums_dkgsession.h>
#include <llmq/quorums_dkgsessionmgr.h>
#include <llmq/quorums_utils.h>
#include <evo/specialtx.h>
#include <masternode/activemasternode.h>
#include <chainparams.h>
#include <masternode/masternode-sync.h>
#include ... | TOOL | 0.958498 | 6.513804 |
e356177e-8738-4072-9b55-af0d5c11f528 | mochdzulfiqri/Tugas-1 | Pengkondisian Nilai.cpp | #include<iostream>
using namespace std;
int main(){
int nilai;
cout<<"Masukan Nilai :";
cin>>nilai;
if(nilai >=80 & nilai <=100){
cout<<"Nilai A"<<endl;
}else if(nilai >=68 & nilai <=79){
cout<<"Nilai B"<<endl;
}else if(nilai >=56 & nilai <=67){
cout<<"Nilai C"<<endl;
}else if(nilai >=45 & nilai <=55){
... | ALGO | 0.993347 | 3.53823 |
bdf94d71-e28b-4a98-bdb7-eff6c426e212 | floy-dev/university | course-2-1/c++/lab1/main.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main() {
cout << "Введите значение x: ";
double x, y, numerator, denominator;
cin >> x;
if (x == 0 || abs(x) == 2) {
cout << "Значение x = " << x << " вне ОДЗ" << endl;
}
else
{
numerator = sin(x) + (1 / x);
... | ALGO | 0.996059 | 4.471751 |
c431224b-fe03-4a9b-8b4b-d05797c30b55 | Ritika1533/Coding-Challenges | STLbyLuv/Queue/queue.cpp | #include<iostream>
#include<queue>
using namespace std;
int main(){
queue<string> q;
q.push("a");
q.push("b");
q.push("c");
q.push("d");
q.push("e");
while(!q.empty()){
cout<<q.front()<<endl;
q.pop();
}
}
/*
a
b
c
d
e
*/ | ALGO | 0.995528 | 3.305293 |
c49ba230-986a-4de7-9d91-67a481a43b04 | zy15662UNUK/cpp_multithreading | 110promise_exception.cpp | #include <iostream>
#include <cmath>
#include <iomanip>
#include <thread>
#include <future>
using namespace std;
double calculatePi(int term)
{
if (term < 1)
{
throw runtime_error("term should > 1");
}
double sum = 0.0;
for (int i = 0; i < term; ++i)
{
int sign = pow(-1, i);
... | ALGO | 0.999334 | 5.535582 |
d657d2d1-282f-4fac-885b-ac0654d126c8 | andrewstalin/contest | 0442-find-all-duplicates-in-an-array/0442-find-all-duplicates-in-an-array.cpp | class Solution {
public:
vector<int> findDuplicates(vector<int>& nums) {
std::vector<int> res(nums.size(), 0);
for (int i = 0; i < nums.size(); ++i) {
++res[nums[i] - 1];
}
int l = -1;
int r = 0;
while (r < res.size()) {
... | ALGO | 0.99997 | 6.194683 |
2ab561cf-a6bf-4bac-8b44-1f0b36e37d6d | Kawser-nerd/CLCDSA | Source Codes/AtCoder/arc026/C/2763609.cpp | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace... | ALGO | 0.999896 | 4.515978 |
b9905c84-afa6-448e-9f9a-f05864902675 | Wadud-Code-Show/Algorithm-CSE---2202- | Dynamic Programming/LCS_Recursive.cpp | // C++ implementation of Top-Down DP
// of LCS problem
#include <iostream>
#include <vector>
using namespace std;
// Returns length of LCS for s1[0..m-1], s2[0..n-1]
int lcs(string &s1, string &s2, int m, int n, vector<vector<int> > &memo) {
// Base Case
if (m == 0 || n == 0)
return 0;
// Already... | ALGO | 0.999988 | 6.230664 |
eaaecf7f-d0f9-47ed-8b36-3366c4bb0e87 | ReshmanthCH/dsalab2 | lab8/8a.cpp | #include <iostream>
using namespace std;
int main(){
int size;
cout<<"Enter the size of the array:";
cin>>size;
int arr[size];
for (int i=0;i<size;i++){
int val;
cout<<"Enter number:";
cin>>val;
arr[i]=val;
}
int index=0;
for (int i=1;i<size;i++){
... | ALGO | 0.99993 | 3.275906 |
15aa2124-0a0f-4a36-8cfb-f994c454002a | ravireddy07/cpp-book | src/Code-Chef/APL3_AnAppleADay.cpp | #include <iostream>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
cin>>t;
while(t--) {
cin>>n;
vector<int> ar(n);
fill(ar.begin(), ar.end(), 0);
int count, sum=0;
for(int i=0;i<n;i++) {
cin>>ar[i];
sum += ar[i];
}
float a ... | ALGO | 0.999351 | 4.088299 |
9bd42012-a066-4687-9227-19354085fff8 | Doveqise/Cloud | Codes/C++/2962.cpp | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e2 + 5;
int f[maxn][maxn], l[maxn];
int n, m, x, y, ans = maxn * maxn;
bool gauss()
{
bool flg = 1;
for (int i = 1; i <= n; i++)
{
int k = i;
while (k <= n && !f[k][i])
k++;
if (k > n)
{
f... | ALGO | 0.999985 | 4.079504 |
ef33d79f-f4f2-4323-a0f1-5c30bc93ec70 | flowerDuo/GES-GSP-Stitching | Code/Stitching/.vshistory/Parameter.cpp/2021-04-13_19_55_54_610.cpp | #include "Parameter.h"
vector<string> getImageFileFullNamesInDir(const string& dir_name) {
DIR* dir;
struct dirent* ent;
vector<string> result;
const vector<string> image_formats = {
".bmp", ".dib",
".jpeg", ".jpg", ".jpe", ".JPG",
".jp2",
".png", ".PNG"
".pbm", ".pgm", ".ppm",
".sr", ".ras",
".tiff... | DATA | 0.873132 | 3.411867 |
3149a8bb-f8cd-4246-bfcf-61dbbe3fe86e | Mulab11/cntt2016-hw1 | TC-SRM-555-div1-255/mhy.cpp | #include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <typeinfo>
#include <fstream>
using namespace std;
class CuttingBitString {
public:
int dp[55];
bool ok(long long x){
... | ALGO | 0.999871 | 4.906428 |
14df2d15-6c7b-45b7-9b12-268e2f368d34 | sikanderkhursheed/RadixSort | radixsort/radixsort.cpp | #include<stdio.h>
#include<conio.h>
int i,j,n,k,exp;
int a[100],b[100],c[100];
void Radixsort();
void main()
{
printf("Enter total no of elements\n");
scanf("%d",&n);
printf("Enter values\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
Radixsort();
printf("After radix sort:\n");
for(i=0;i<n;i++)
{
printf("%d\n",a[i]);
}
... | ALGO | 0.99997 | 3.841738 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.