uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
fba39550-a872-4c1b-a209-b2499b4d5e00 | wjddlsy/Algorithm | Baekjoon/baek_2110_공유기설치/main.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int N, C;
bool decision(vector<int>& position, long long dist) {
int installed=0;
long long limit=-1;
for(auto &pos:position){
if(limit<=pos) {
++installed;
limit=pos+dist;
}
}
re... | ALGO | 0.999989 | 4.636865 |
ba1f34ca-5800-47e0-9bf7-209667913dfb | thecreatorsir/coding-blocks-solutions | practice mix questions/help_rahul.cpp | #include<bits/stdc++.h>
using namespace std;
int search_binary(int *a,int key,int n){
int start = 0;
int end = n-1;
while(start<=end){
int mid = (start+end)>>1;
if(key == a[mid])
return mid;
else if(a[start]<=a[mid]){
if(key<=a[mid] and key>=a[start]){
end = mid -1;
}
else{
start = mid +... | ALGO | 0.999944 | 5.535578 |
e23c72c7-293f-4dc7-971c-20b8a15c46a6 | Macasten/EveryDayCode | src/challenges/leetcode/70-Climbing-Stairs.cpp | ////////////////////////////////////////////////////////////////////////////////
// c++ libraries
////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
////////////////////////////////////////////////////////////////////////////////
// Personal Helpers
/////////////... | ALGO | 0.999928 | 5.940722 |
3115bed1-9717-467b-a455-914ba094b873 | Pre1999/Shepherd_Cache | gem5-Fall2022/src/systemc/tests/systemc/misc/user_guide/chpt3.1/fsmr.cpp | /*****************************************************************************
fsmr.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/*****************************************************************************
... | ALGO | 0.997971 | 4.888353 |
ada2ee2e-dfff-4bce-a066-134a68736b75 | edsml-hs1623/Image-Processing-Application | src/EdgeDetection.cpp | /**
* @file EdgeDetection.cpp
*
* @brief Implementation of the EdgeDetection class for detecting edges in images.
*
* This file contains the implementation of the EdgeDetection class, which includes methods
* to apply various edge detection operators like Sobel, Prewitt, Scharr, and Roberts Cross.
* The class is... | TOOL | 0.932132 | 7.765142 |
5ab221ac-bb8b-4d5c-8f80-8879fc0cd472 | him40813/pix2qim | exLib/package_bgs/ck/LbpMrf.cpp | #include "LbpMrf.h"
#include "MotionDetection.hpp"
LbpMrf::LbpMrf() : firstTime(true), Detector(NULL), showOutput(true)
{
std::cout << "LbpMrf()" << std::endl;
Detector = new MotionDetection();
Detector->SetMode(MotionDetection::md_LBPHistograms);
}
LbpMrf::~LbpMrf()
{
std::cout << "~LbpMrf()" << std::endl;
... | ALGO | 0.914926 | 4.223986 |
3cbacdde-1b78-4ff3-882c-0b19ac2ea3d6 | decipher6/sofa | Sofa/framework/Helper/src/sofa/helper/set.cpp | #include <sofa/helper/config.h>
#include <string>
#include <iostream>
#include <sofa/helper/set.h>
#include <sofa/helper/logging/Messaging.h>
/// adding string serialization to std::set to make it compatible with Data
/// \todo: refactoring of the containers required
/// More info PR #113: https://github.com/sofa-fr... | TOOL | 0.866709 | 7.045028 |
45db7474-531a-467f-8cb8-ed35091f0965 | alexandraback/datacollection | solutions_5631572862566400_1/C++/pflueger/C.cpp | /* Date: 15 April 2016
* Comments:
*/
#include <fstream>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cassert>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define err(...) fprintf(stderr,__VA_ARGS__)
... | ALGO | 0.999319 | 4.319322 |
22f6b6fa-f6bf-4fed-8a27-501e6097882c | PandaStar12/Competitive-Programming | SPOJ&UVA/Imiona.cpp | #include <cstdio>
#include <string>
#include <tr1/unordered_map>
#include <vector>
#include <algorithm>
class PAIR
{
public :
int i;
std::string t;
PAIR( std::string a, int b )
{
i = b;
t = a;
}
};
bool... | ALGO | 0.994756 | 4.330116 |
3c48cccf-0b12-4e61-8c09-0c0ee740b6ef | Crave-Community-Project/Crave-Project | src/sync.cpp | #include "sync.h"
#include "util.h"
#include "utilstrencodings.h"
#include <stdio.h>
#include <boost/foreach.hpp>
#include <boost/thread.hpp>
#ifdef DEBUG_LOCKCONTENTION
void PrintLockContention(const char* pszName, const char* pszFile, int nLine)
{
LogPrintf("LOCKCONTENTION: %s\n", pszName);
LogPrintf("Loc... | TOOL | 0.96388 | 5.938954 |
b7f6be7b-6ea6-424f-96ea-580725356ed8 | log-ufpb/bfsp-collection | IG_VND2/src/Instance.cpp | #include "Instance.h"
#include <algorithm>
#include <cstdio>
#include <filesystem>
#include <fstream>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <string>
Instance::Instance(const std::filesystem::path &path) {
std::ifstream file(path);
if (!file) {
throw std::runtime_error(... | TOOL | 0.902434 | 5.457492 |
a5226d38-ab7e-4d7a-891c-37532b22c02a | nnguy/week3 | week3/ptr_arithmetic.cpp | #include <iostream>
using namespace std;
const int SIZE = 5;
int main() {
double x = 1.5;
//declare a pointer y and point it to x
double* y = &x;
//increase the value of x by 1 using the pointer
(*y)++;
double arr[SIZE] = { 2,4,6,8,10 };
///prints the element in index 1
cout << *(arr + 1) << endl;
... | ALGO | 0.963892 | 3.9968 |
9d8ed8c2-5c73-41e8-8e31-289527baa86f | Class-17/Programming_Contest_Challenge | Chapter.2/AOJ.0525.Osenbei.cpp | #include <cstdio>
#include <algorithm>
#define MAXN 10
#define MAXM 10000
int main() {
int N, M;
while (scanf("%d %d", &N, &M)) {
if (N == 0 && M == 0) break;
int mat[MAXN][MAXM], columns[MAXM] = {0};
for (int i = 0; i < N; ++i)
for (int j = 0; j < M; ++j)
s... | ALGO | 0.999918 | 4.319128 |
00d52edd-e280-4a99-9378-99aab796b120 | Minato0859/School-stuff | Fall 2023/C++ Programming for Science/9780135921050_IS_Source_Code/Gaddis-CPP_10e_SourceCode/Chapter 03/Pr3-8.cpp | // This program can be used to see how your system handles
// floating point overflow and underflow.
#include <iostream>
using namespace std;
int main()
{
float test;
test = 2.0e38 * 1000; // Should overflow test.
cout << test << endl;
test = 2.0e-38 / 2.0e38; // Should underflow test.
cout << test ... | TEST | 0.930235 | 5.312281 |
b22435fe-2cda-4211-bd41-cb04093a199c | mjyan0720/InvisiSpec-1.0 | ext/systemc/src/sysc/utils/sc_hash.cpp | /*****************************************************************************
sc_hash.cpp -- Implementation of a chained hash table with MTF
(move-to-front).
Original Author: Stan Y. Liao, Synopsys, Inc.
CHANGE LOG AT END OF FILE
**************************************************************... | ALGO | 0.953815 | 6.129114 |
1b40a371-2788-44b8-9c7e-ca885abca9e7 | PiyushDhamecha454/DSA | Recursion & Backtracking/merge.cpp | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int MOD = 1e9 + 7;
const int INF = LLONG_MAX >> 1;
vector<int> merge(vector<int>& v, int n, vector<int>& u, int m) {
vector<int> w(m + n);
int i = 0, j = 0, k = 0;
while (i < n && j < m) {
if (v[i] < u[j]) w[... | ALGO | 0.999974 | 3.379497 |
08db2625-3645-4f33-b93e-80694fce6bb2 | Shadman-Ahmed-Chowdhury/LeetCode-Problems-Solutions | Hash Table/path_crossing.cpp | // Problem link: https://leetcode.com/problems/path-crossing/description/
// My solution:
class Solution {
public:
bool isPathCrossing(string path) {
int x = 0, y = 0;
map<pair<int ,int> ,int > mp;
mp[{0, 0}]++;
for(int i = 0; i < path.size(); i++) {
if(path[i] == 'N')
... | ALGO | 0.999979 | 6.381956 |
a436ba0d-36af-4b6e-8870-f4b577757886 | NervanaSystems/eigen | doc/examples/Tutorial_ReductionsVisitorsBroadcasting_colwise.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::MatrixXf mat(2,4);
mat << 1, 2, 6, 9,
3, 1, 7, 2;
std::cout << "Column's maximum: " << std::endl
<< mat.colwise().maxCoeff() << std::endl;
}
| ALGO | 0.999848 | 3.779679 |
3f26f0f1-fd5a-497f-917b-643d822a2d2c | ishandutta2007/codeforces | egor.lifar/normal/916/D.cpp | /*
*/
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <b... | ALGO | 0.999221 | 3.765179 |
0b28052d-41cf-403a-a1dd-38e1e30ff840 | Giantpizzahead/comp-programming | USACO/Practice Problems/December 2022/Platinum/breakdown.cpp | /*
http://usaco.org/index.php?page=viewproblem2&cpid=1260
Solution:
Process queries in reverse order (add edges instead of removing).
Maintain dp2[a][b] = Min cost path using 2 edges from a to b. Also maintain min cost paths from 1 to each node using
3 or 4 edges, and min cost paths from each node to N using 3 or 4 ed... | ALGO | 0.999894 | 4.204091 |
067f689a-9919-490f-b816-b9bd4ffaffb2 | snandasena/cf-contests | cf671/a.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll gcd(ll a, ll b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
... | ALGO | 0.999914 | 4.642153 |
83a6b27a-02cc-4ccf-b302-a37ff7020db6 | ayeshazia99/Semester-3 | DS Lab/Lab 7/Task 3.cpp | #include<iostream>
using namespace std;
#include<iostream>
using namespace std;
class stack{
public:
int top;
char a[21];
stack(){
top=-1;
}
bool push(char x){
if(top>=(21-1)){
cout<<"Stack Overflow!";
return false;
}
else{
a[++top]=x;
return true;
return x;
}
}
char pop(){
if(top<0){
cout<<"Stac... | ALGO | 0.999835 | 4.056993 |
e969ff7d-3041-4a86-bcd2-c9a85e0e23f1 | carnato/Algo | LeetCode Non-Contest Solutions/#152 Maximum Product Subarray/Min_Max Approach (Fails).cpp | /* This solution assumes that atleast 1 posiitve element is present */
/* Fails on LeetCode */
class Solution
{
public:
int maxProduct(vector<int>& a);
};
int Solution :: maxProduct(vector<int>& a)
{
int max_ending_here = 1;
int min_ending_here = 1;
int max_so_far = INT_MIN;
for(int i=0; i<n; i+... | ALGO | 0.999953 | 5.533032 |
f7fba01a-83ca-43e0-bd31-177a93dcd372 | ellynhan/challenge100-codingtest-study | hall_of_fame/wi-seong-cheol/PGS/2018 KAKAO BLIND RECRUITMENT/[3차] n진수 게임.cpp | //
// [3차] n진수 게임.cpp
// wi-seong-cheol
//
// Created by wi_seong on 2023/03/06.
//
// 시간복잡도: O(nlogn)
// 최악시간: 500,000
// 난이도: Level 2
// Timer: 30m
// Url: https://school.programmers.co.kr/learn/courses/30/lessons/17687
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
string number ... | ALGO | 0.999519 | 6.257043 |
0091342a-6f67-407f-bb57-879b3404f23f | NguyenTrongAnh2002/code-cpp | LTHDT/toantu/toantudiem.cpp | #include <iostream>
using namespace std;
class DIEM{
private:
float x,y,z;
public:
DIEM(){
x=0; y=0; z=0;
}
DIEM(float x1,float y1,float z1){
x=x1;
y=y1;
z=z1;
}
DIEM operator+(DIEM B){
DIEM T;
T.x= x +... | ALGO | 0.964773 | 4.031286 |
0ddc5da5-b80f-4967-8aa0-04b22443a9b8 | SomenSin/LeetCode | 287-find-the-duplicate-number/find-the-duplicate-number.cpp | class Solution {
public:
int findDuplicate(vector<int>& nums) {
cycleSort(nums);
for(int i=0;i<nums.size();i++) {
if(nums[i] != i+1) {
return nums[i];
}
}
return 0;
}
void cycleSort(vector<int>& nums) {
int i=0,n=nums.size();
... | ALGO | 0.999989 | 5.861767 |
98239a41-f720-4cff-b7c5-f543f346d66d | Gongsta/competitive-programming | codeforces/143educational/C.cpp | #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <st... | ALGO | 0.999904 | 3.179859 |
415a4602-6b5b-45d8-b589-f6fdec11e612 | tachithanhdanh/Competitive-Programming | USACO/Contests/USACO Solutions/2017-18/Feb 2018/Bronze/hoofball.cpp | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
using ll = long long;
//vector
using vi = vector<int>;
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
#define rsz resize
#define pb push_back
//pairs
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
// loo... | ALGO | 0.999978 | 4.075155 |
0106c40d-55d2-488b-b7a1-db7343ee27ac | sidharth-sinhasane/lp2 | 2_A_Star.cpp | #include<iostream>
#include<cmath>
#include<limits.h>
using namespace std;
//A* alogrithm to solve 8 puzzle problem
//Global variable to keep track of number of moves taken
int g = 0;
void Print(int puzzle[]){
for(int i = 0; i < 9; i++){
if(i % 3 == 0) cout << '\n';
if(puzzle[i] == -1) cout << "... | ALGO | 0.999963 | 4.520277 |
cd622bd6-33bc-4a62-90a3-9cd6fbbb3d24 | fuentes-almeida/metaheuristic-algorithms-cpp | Tarea06_MetaH_GFuentes/Sudoku/Sudoku.cpp | #include "Sudoku.h"
#include <limits.h>
#include <set>
#include <iostream>
#include <fstream>
using namespace std;
const SudokuProblem *Sudoku::sudokuProblem=NULL;
int Sudoku::nInds = 0;
//constructor de un tablero de Sudoku
SudokuProblem::SudokuProblem(const string &fileName)
{
ifstream file(fileName.c_str());
if ... | ALGO | 0.998164 | 4.140924 |
6eff9bd9-140d-4862-a51d-8780b53c1a22 | zhalok/LeetCode-Submissions | 2131-longest-palindrome-by-concatenating-two-letter-words/2131-longest-palindrome-by-concatenating-two-letter-words.cpp | class Solution {
public:
int longestPalindrome(vector<string> &words) {
map<string, int> counter;
int ans = 0;
for (int i = 0; i < words.size(); i++) {
if (counter.size() == 0)
counter[words[i]]++;
else {
string temp = words[i];
reverse(temp.begin(), temp.end());
... | ALGO | 0.999968 | 5.754178 |
ea203093-a00b-40cf-ad38-ebd42c4890f1 | alexandraback/datacollection | solutions_5751500831719424_1/C++/rptynan/cle.cpp | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define LEN 110
int N;
struct str{
char s[LEN];
int sl, n[LEN];
};
int main(){
int TC;
scanf("%d",&TC);
for(int tc=1; tc<=TC; ++tc){
scanf("%d",&N);
str strs[LEN];
bool fail = 0... | ALGO | 0.999545 | 3.839858 |
6bf62495-a126-406b-be44-8bb7e5482e0e | ink19/LeetCode | 2021_08/1823/main.cpp | #include <vector>
class Solution {
public:
int findTheWinner(int n, int k) {
std::vector<int> quan(n, 0);
for (int loop_i = 0; loop_i < n; ++loop_i) {
quan[loop_i] = loop_i;
}
int begin = 0;
k -= 1;
while (quan.size() != 1) {
begin += k;
... | ALGO | 0.99999 | 6.182605 |
5203c66f-4ede-4f22-bb13-cb4dcbb1e415 | CoderOJ/contests | poi/29_2/arm/temp/temp.cpp | #include "/home/jack/cm/debug"
#include "/home/jack/cm/scanner"
#include "/home/jack/cm/util"
#include <cmath>
// #include "/home/jack/cm/intm"
// #include "/home/jack/cm/string"
cm::scanner<cm::optimal_reader> sc(stdin);
int64_t n, a, b;
__int128_t ans;
template <class int_t>
int_t pow(int_t a, int_t b)
{
return... | ALGO | 0.999619 | 4.157009 |
46d7f45b-9c97-4933-8c88-e13bf92ce69d | shubhi-115/Data-structure-and-algorithm-for-cp | Problems/DSU/GALACTIK.cpp | /* question link: https://www.codechef.com/problems/GALACTIK */
****************************************************************
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll nn,m,parent[100002],size[100002],cost[100002];
void makeset()
{
for(ll i=0;i<=nn;i++)
{
parent[i]=i... | ALGO | 0.999757 | 3.74994 |
7776e2f4-5da5-4942-b2d5-73631ed2c828 | IvanVinx/3221311416- | C.19.cpp | #include<stdio.h>
#include<stdlib.h>
typedef struct link{
int d;
struct link *next;
}ss;
ss *create(ss *L){
int n;
ss *p,*q=L;printf("Ԫ,-1β\n");
while(1){
scanf("%d",&n);
if(n==-1) break;
p=(ss *)malloc(sizeof(ss));
p->d=n;
p->next=NULL;
if(L==NULL){
L=p;
}else{
q->next=p;
}
q=p;
}
r... | ALGO | 0.999801 | 3.280337 |
12799039-9caf-40e9-a634-edabfe76e5fd | manshisharma1372/POTD_Streak | 0088-merge-sorted-array/0088-merge-sorted-array.cpp | class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i=m-1,j=n-1,k=m+n-1;
while(i>=0&&j>=0)
{
if(nums1[i]>nums2[j])
{
nums1[k]=nums1[i];
i--;
k--;
}
e... | ALGO | 0.999985 | 5.170352 |
e64c30ad-4d33-4ffc-8d3a-ea8fc1e10fa5 | rkftp/Kroocrew | 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 |
d900feff-cfaf-47d2-96f6-883e04ac1871 | csyang79/algorithms-and-oj | leetcode-algorithms/077. Combinations/combinations.cpp | //subset, dfs
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
vector<int> nums(n);
for (int i = 0; i < n; ++i)
nums[i] = i + 1;
vector<vector<int>> res;
vector<int> cur;
dfs(nums, 0, cur, res, k);
return res;
}
void dfs(vector<int>& nums, int start, vector<int>& cur, ve... | ALGO | 0.999989 | 5.714036 |
2982f1d8-6048-4198-9610-92984ea7632c | Jonathan2511/moviedb_provider | 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 |
91a56ab2-4648-4bbf-aeed-fb240d390963 | anuragpratap05/DSA | ARRAY AND STRING/array and string revision_2/class1/11. Container With Most Water.cpp | #include<bits/stdc++.h>
using namespace std;
class TreeNode
{
public:
int val = 0;
TreeNode *left = nullptr;
TreeNode *right = nullptr;
TreeNode(int val)
{
this->val = val;
}
};
int maxArea(vector<int> &height)
{
int s = 0;
int e = height.size() - 1;
int maxi = 0;
while... | ALGO | 0.999474 | 5.669442 |
8ac01576-bd9f-4f7a-b6a0-538f2df91a1b | DawidGlazik/Sim_World_CPP | Hogweed.cpp | #include "Hogweed.h"
#include "Field.h"
#include "Animal.h"
Hogweed::Hogweed() {
this->strength = 10;
this->age = 0;
}
Hogweed::Hogweed(World* world, coords xy) {
this->world = world;
this->xy = xy;
this->strength = 10;
this->age = 0;
}
Hogweed::Hogweed(World* world, coords xy, int age) {
this->world = world;... | TOOL | 0.900603 | 4.867243 |
d323a096-9989-4d47-82d0-6d33aaaee946 | devararendy/tcp_proxy | sdk/boost_1_77_0/libs/math/example/policy_ref_snip11.cpp | // Note that this file contains quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!
#include <iostream>
using std::cout; using std::endl;
// Setting (approximate) precision 25 bits in a single function call using make_policy.
//[policy_ref_snip11
#include <boost/math... | ALGO | 0.988703 | 4.634211 |
1804cec7-f266-4f3c-a520-5eaebb44edbc | upple/BOJ | src/8000/8980.cpp14.cpp | #include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
int t[2001];
priority_queue<pair<int, pair<int, int> > > pq;
int main()
{
int c, n, m, ans=0;
cin>>n>>c>>m;
while(m--)
{
int s, e, v;
cin>>s>>e>>v;
pq.push({-e, {-s, -v}});
}
while(pq.size())... | ALGO | 0.999755 | 4.069559 |
4f1cb54a-6cdb-4114-a367-c459394a6095 | Professor-Berni/android_frameworks_av | media/libstagefright/MediaCodecList.cpp | //#define LOG_NDEBUG 0
#define LOG_TAG "MediaCodecList"
#include <utils/Log.h>
#include <binder/IServiceManager.h>
#include <media/IMediaCodecList.h>
#include <media/IMediaPlayerService.h>
#include <media/MediaCodecInfo.h>
#include <media/stagefright/foundation/ADebug.h>
#include <media/stagefright/foundation/AMessa... | TOOL | 0.924953 | 7.398468 |
0129adf2-7aa1-4768-95ce-880e49c81c54 | SameerDiwakar/Data-Structures | Recursion/14_toh.cpp | #include <iostream>
using namespace std;
void toh(int n, int a , int b , int c){
if(n>0){
toh(n-1,a,c,b);
printf("(%d,%d)\n",a,c);
toh(n-1,b,a,c);
}
}
int main(){
toh(3,1,2,3);
return 0;
} | ALGO | 0.999789 | 4.410977 |
cf30561c-78ac-4d9b-bf15-ebb8ed3e65ef | tushar04mishra/coding | c++/cpp basics/saving.cpp | #include<bits/stdc++.h>
using namespace std;
class SavAcc
{
protected:
double Bal;
long AccNo;
void deposite()
{
cout<<"enter the amount to be deposited: ";
cin>>Bal;
}
void withdraw()
{
int WithAmt;
cout<<"enter the amount to be taken out: ";
cin... | TOOL | 0.941112 | 3.536614 |
05782e30-430b-40ff-9b33-e4f361f40c98 | Tanishsnghhh/32_Tanish_23_27_cplusplus_100prblm_hackathon_team_09_cpp- | 043PascalTriangle.cpp | //program to print a pascal triangle
// inlcuding requried header files
#include <iostream>
using namespace std;
// main function
int main() {
// input a number from user
int n;
cout << "Enter number: ";
cin >> n;
while (n <= 0) {
cout << "Invalid number" << endl;
cout << "Enter n... | ALGO | 0.997209 | 5.617277 |
bef48fdc-9545-45ab-9516-1533f6fd128c | fssouz/C | URI/1180 - Menor e Posição.cpp | #include <iostream>
using namespace std;
int main()
{
int N, menor, pos;
cin >> N;
int X [N];
for (int a=0; a<N; a++)
{
cin >> X[a];
if (X[a]<menor || a==0)
{
menor=X[a];
pos = a;
}
}
cout << "Menor valor: " << menor << endl;
cou... | ALGO | 0.999907 | 4.363166 |
58a9896c-fcd8-4e6d-addd-7596fb6e4050 | costashatz/whc | src/whc/dynamics/task/tasks.cpp | #include <whc/dynamics/task/tasks.hpp>
namespace whc {
namespace dyn {
namespace task {
// AccelerationTask
AccelerationTask::AccelerationTask(const dart::dynamics::SkeletonPtr& skeleton, const std::string& body_name, const Eigen::VectorXd& desired, const Eigen::VectorXd& weights)
... | TOOL | 0.880459 | 6.530704 |
b478b68d-2484-474c-a17b-a2cf0d40da89 | 0xm4yo/compro | atcoder/asakatsu/asakatsu20231212arc/C.cpp | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
#define rep(i, a, b) for(ll i=a; i<b; i++)
#define rrep(i, a, b) for(ll i=a; i>=b; i--)
#define all(a) (a).begin(), (a).end()
#define YesNo(bool) if(bool){cout<<"Yes"<<en... | ALGO | 0.999988 | 4.01764 |
4a63065e-3bb8-4e13-bd0e-2fdc19d69d5a | SubhradipMishra/DSA | 1250-longest-common-subsequence/longest-common-subsequence.cpp | class Solution {
public:
// int f (int i , int j , string& s , string& t , vector<vector<int>>& dp){
// if( i < 0 || j < 0 ) return 0 ;
// if(dp[i][j]!=-1) return dp[i][j] ;
// if(s[i] == t[j]) return dp[i][j] = 1 + f(i-1 ,j -1, s, t ,dp) ;
// return dp[i][j] = 0 + max(f... | ALGO | 0.999952 | 6.110527 |
711f924e-0716-4a0b-b55a-0809e76327a1 | MinuLoL/CppBOJ | Greedy/대회 or 인턴(2875).cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N,M,K;
cin>>N>>M>>K;
int wn;
int mn;
int cnt;
int num;
if((N/2)<=M)
{
wn=(N/2)*2;
cnt+=N-wn; //짝수가되면서 없어진 수 1or0
mn=N/2;
cnt+=M-mn; //N의 절반값이되면서 없어진 수
if(K<=cnt)
{
cout<<mn;
return 0;
}
else
{
K-=cnt;
if(K%3==... | ALGO | 0.999956 | 3.330986 |
83912d23-9925-48d2-8f6c-56b6c04130fd | kanhaiyasulay/Leetcode | 3629-total-characters-in-string-after-transformations-i/total-characters-in-string-after-transformations-i.cpp | class Solution {
public:
int mod = 1e9 + 7;
int lengthAfterTransformations(string s, int t)
{
vector<int> freq(26, 0);
for(auto ch:s )
freq[ch-'a']++;
while(t--)
{
vector<int> temp(26, 0);
for(int i=0; i<26; i++)
{
... | ALGO | 0.999975 | 6.304484 |
ed8d54c6-5caf-4593-ab46-8cd71febed7b | Naga-sirisha-A/leetcode | 1482-how-many-numbers-are-smaller-than-the-current-number/how-many-numbers-are-smaller-than-the-current-number.cpp | class Solution {
public:
vector<int> smallerNumbersThanCurrent(vector<int>& nums) {
vector<int>sortednums=nums;
sort(sortednums.begin(),sortednums.end());
unordered_map<int,int>mpp;
for(int i=0;i<sortednums.size();i++){
if(mpp.find(sortednums[i])==mpp.end()){
... | ALGO | 0.999991 | 5.964367 |
dd3b463e-37b4-4cdd-8db2-0ab77d2dfff0 | Raisul191491/Noob_C- | Unique Number.cpp | #include<bits/stdc++.h>
typedef long long ll;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define last freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define fr first
#define sc second
#define lcm(a,b) (a*b)/__gcd(a,b)
#d... | ALGO | 0.998911 | 4.399718 |
f2159ca5-60a3-4ac0-ba70-702df9f47ff3 | WIndki/Personal | data structure Lesson/StringAndMatrix/StringInsert2.cpp | #include <iostream>
using namespace std;
size_t strlen(const char *str)
{
size_t len = 0;
while (*str++)
{
++len;
}
return len;
}
char *strcpy(char *dest, const char *src)
{
char *ret = dest;
while ((*dest++ = *src++) != '\0')
;
return ret;
}
char *strcat(char *dest, c... | ALGO | 0.981185 | 4.104083 |
d670e559-bb0e-4508-8742-41c9f8cec302 | arpitsri3/CarND_Capstone_Code | ros/src/waypoint_follower/src/pure_pursuit_core.cpp | #include "ros/ros.h"
#include "pure_pursuit_core.h"
namespace waypoint_follower
{
void PurePursuit::callbackFromCurrentPose(const geometry_msgs::PoseStampedConstPtr &msg)
{
current_pose_.header = msg->header;
current_pose_.pose = msg->pose;
pose_set_ = true;
}//processing frequency
void PurePursuit::callbackFr... | ALGO | 0.996057 | 4.64271 |
2aee0037-e9d4-49fd-891e-7c33acfe0d1b | ishandutta2007/codeforces | emptyhope/normal/1497/B.cpp | #include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
if(... | ALGO | 0.999981 | 4.760357 |
bd28d6bb-15c5-4737-aac6-1fc82a1989b8 | julioCoutinho/URI | 1983.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
fstream f;
f.open("entrada.txt",ios::in);
double n,maior=-1,numero,x,mNum;
cin >> n;
while(n-->0)
{
cin >> numero >> x;
if(maior < x)
{
maior ... | ALGO | 0.999922 | 3.923677 |
26573a38-d664-47f5-a36e-0151224d9e23 | dong-won-shin/tiny_vins_mono | src/backend/estimator.cpp | #include <fstream>
#include <iostream>
#include <mutex>
#include "backend/estimator.h"
#include "utility/config.h"
namespace backend {
Estimator::Estimator()
: feature_manager_(),
optimizer_(&sliding_window_, &feature_manager_),
failure_detector_(&sliding_window_, &feature_manager_),
initialize... | ALGO | 0.874279 | 6.874635 |
1c73adef-7b75-407d-907b-2302ed20da6e | JenIsCoding/CS-SelfStudy | OOP using C++/Chap5/PointersExFromGitBook/Ex1.cpp | /* EX. 1 from https://erlerobotics.gitbooks.io/erle-robotics-cpp-gitbook/content/pointers/exercises_pointers.html
Write a program that asks the user to enter integers as inputs to be stored in the variables 'a' and 'b' respectively.
There are also two integer pointers named ptrA and ptrB.
Assign the values of 'a' and... | ALGO | 0.984385 | 4.046532 |
de5d6eb5-8911-4582-a3ae-1d678dd9be58 | fum-cs/cw2 | code/find_max-min/solution_13.cpp | // M. Amintoosi
// minmax_element
#include <iostream>
#include <limits>
#include <vector>
#include <algorithm>
using namespace std;
class Solution
{
public:
auto find_farthest(vector<int> v)
{
auto p = minmax_element(v.begin(),v.end());
return *p.second - *p.first;
// return *p->second ... | ALGO | 0.99984 | 4.830862 |
b9f5f50f-ce1c-4632-a2af-7d1dfa7c66cb | skandh1/second-sem-daa-programs | DP/floydWarshall.cpp | // C++ Program for Floyd Warshall Algorithm
#include<bits/stdc++.h>
using namespace std;
// Number of vertices in the graph
#define V 4
/* Define Infinite as a large enough
value.This value will be used for
vertices not connected to each other */
#define INF 99999
// A function to print the solution matrix
void prin... | ALGO | 0.999993 | 4.849686 |
0eadcace-483f-40c1-b99b-d91eccb5f312 | whitecy01/algorithm | Baekjoon/스택/2493(!).cpp | #include <stack>
#include <iostream>
#include <vector>
using namespace std;
int main(){
cin.tie(NULL);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
stack<pair<int, int> > pa;
int height;
for (int i = 0; i < n; i++)
{
cin >> height;
while (pa.empty() == 0)
{... | ALGO | 0.99999 | 3.884647 |
a2abf56b-ef92-4299-afd8-2feffea43513 | mollnn/bound-caustics | mts1/src/emitters/sun.cpp | #include <mitsuba/render/scene.h>
#include <mitsuba/core/bitmap.h>
#include <mitsuba/core/plugin.h>
#include <mitsuba/core/qmc.h>
#include "sunsky/sunmodel.h"
MTS_NAMESPACE_BEGIN
/* Apparent radius of the sun as seen from the earth (in degrees).
This is an approximation--the actual value is somewhere between
0.... | TOOL | 0.957354 | 7.4499 |
a4ec0262-d879-46de-a2dc-6752d2685582 | muhammad-araf/CPP | 02-Loops/CheckeredGrid.cpp | #include <iostream>
using namespace std;
int main() {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if ((i + j) % 2 == 0) {
cout << "1 ";
} else {
cout << "0 ";
}
}
cout << endl;
}
re... | ALGO | 0.999728 | 4.613375 |
3f2a7e8e-c253-4672-90ad-71c7b1c3a4d6 | Vishal-Ansari/LeetCode-Repo | 733. Flood Fill Easy.cpp | class Solution {
public:
void dfs(vector<vector<int>>& mat,int i,int j,int color,int r,int c,int cellColor){
//base case
if(i<0 || i>=r || j<0 || j>=c || mat[i][j] != cellColor){
return;
}
//update color of curr adjacent cell
mat[i][j] = color;
... | ALGO | 0.999752 | 6.336505 |
610dee65-ee79-49b6-aa74-20fa6217b84a | BBBBBbruce/PhysicsSimPro | external_lib/MFEM/mfem-4.3/fem/tmop/tmop_pa_w2_c0.cpp | #include "../tmop.hpp"
#include "tmop_pa.hpp"
#include "../linearform.hpp"
#include "../../general/forall.hpp"
#include "../../linalg/kernels.hpp"
namespace mfem
{
MFEM_REGISTER_TMOP_KERNELS(double, EnergyPA_C0_2D,
const double lim_normal,
const Vector &lim_dist,
... | ALGO | 0.999747 | 6.05695 |
5b5bb473-5bd0-4536-a822-9e74ba02ad86 | rdavydov/maya | ver-2009/devkit/mentalray/shaders/base/basereflect.cpp | #include <math.h>
#include <shader.h>
struct mr {
miColor input;
miColor reflect;
miBoolean notrace;
};
extern "C" DLLEXPORT int mib_reflect_version(void) {return(2);}
extern "C" DLLEXPORT miBoolean mib_reflect(
miColor *result,
miState *state,
struct mr *paras)
{
miBoolean ok;
miBoolean notrace;
miColo... | ALGO | 0.98841 | 4.962621 |
d640ae59-eb75-4fd6-9096-92d11aa30753 | anhtrung93/Z3-str-Regex | z3/lib/arith_eq_solver.cpp | #include"arith_eq_solver.h"
arith_eq_solver::~arith_eq_solver() {
}
arith_eq_solver::arith_eq_solver(ast_manager & m, params_ref const& p):
m(m),
m_params(p),
m_util(m),
m_arith_rewriter(m)
{
m_params.set_bool(":gcd-rounding", true);
// m_params.set_bool(":sum", true);
m_arith_rewriter.upd... | ALGO | 0.999792 | 5.199965 |
6fec8195-f444-4444-b7e4-f1e593ab0532 | Aashu1303/GfG | Medium/New Year Resolution/new-year-resolution.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function Template for C++
class Solution {
public:
int dp[370][2030];
//vector<vector<int>>dp;
bool solve(int coins[], int sum, int idx, int N)
{
if(sum != 0 && (sum%20 == 0 || sum%24 ... | ALGO | 0.998609 | 5.075887 |
27b6cfa4-0acc-4eb0-aebb-9df4a3e019c9 | TasnimAnas/100DaysOfCodes | Day 17/2.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.999886 | 6.26248 |
35be4cea-4cd0-485a-8a75-b3628fa61266 | hackybacky/my-leet | 0074-search-a-2d-matrix/0074-search-a-2d-matrix.cpp | class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int x) {
int n = matrix.size();
int m = matrix[0].size();
int l = 0 , r = n * m - 1;
while(l <= r){
int mid = (l + r)/2;
int col = mid % m;
int row = mid / m;
... | ALGO | 0.999979 | 5.949018 |
040c3ad0-b47f-43c0-947c-bbd5e913d0dd | leddits/flutter_application_1 | 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 |
fe77a509-5421-4457-b5cd-15608fd0d2c2 | itzsoumyadip/study-repo- | c++/ALGO/bubbleSort.cpp | #include<bits/stdc++.h>
#include<conio.h>
using namespace std;
void bubble_sort(int[], int);
int main() {
int n;
cout << "welcome to bubble sort" << endl;
cout << "Enter total no of element you want to enter " << endl;
cin >> n;
int a[n];
cout << "Enter the element " << endl;
for (int arr = 0; arr < n... | ALGO | 0.999633 | 3.369479 |
390a10ba-85f8-47f4-b69a-937a835381d1 | SnakeInLake/lab4 | 1zad1/mutex.cpp | #include <iostream>
#include <thread>
#include <mutex>
#include <chrono>
#include <vector>
#include <random>
#include <string>
using namespace std;
using namespace chrono;
string sharedString;
mutex sharedStringMutex;
char getRandomChar() {
static random_device rd;
static mt19937 gen(rd());
static unifor... | TOOL | 0.916658 | 6.398503 |
801e5b57-bb64-47ed-a489-9e74627f2036 | EscalanteRivas/ClaseFundamento | Soluciones/IF/exercise7.cpp | #include <iostream>
using namespace std;
// Declaración de función
string temperatura(int Temperatura);
int main() {
int tempera;
cout << "Ingrese la temperatura: ";
cin >> tempera;
string mensaje = temperatura(tempera);
cout << mensaje << endl;
return 0;
}
// Definición de función
string t... | TOOL | 0.897637 | 5.854391 |
e3de4198-7d4c-4f7a-838f-89021c1f5b82 | JolenLi/leetcode_train | String/7. Reverse Integer.cpp | //
// Created by Jolen on 2021/6/23.
//
//// dp
#include<vector>
#include<iostream>
#include<queue>
#include<unordered_map>
#include<stack>
#include<set>
#include<map>
#include<unordered_map>
using namespace std;
int reverse(int x) {
int rev = 0;
while (x != 0) {
if (rev < INT_MIN / 10 || rev > INT_M... | ALGO | 0.999358 | 4.498085 |
dd3f89f0-1181-49c7-a201-5a5090edbf81 | cho-hm02123/Algorithm_Study | Beakjoon/시뮬레이션/18808.cpp | #include <istream>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
#define X first
#define Y second
int s, g, k, ss, sg, cnt, num;
bool book[45][45];
int st[11][11];
vector <pair<int, int>> v;
void turn() {
int cst[11][11];
cnt++;
v.clear();
for... | ALGO | 0.999414 | 3.804189 |
0166e81a-b05f-4317-846f-f74539f0fb2e | Suryam1/GFG-DSA-CODES | Searching/First_Occurance.cpp | #include <bits/stdc++.h>
using namespace std;
int f(int a[],int n,int x){
int res=-1;
int low=0,high=n-1;
while(low<=high){
int mid=(low+high)/2;
if(a[mid]==x){
res=mid;
high=mid-1;
}
else if(a[mid]<x){
low=mid+1;
}
else{
... | ALGO | 0.999894 | 5.924628 |
be112eb8-fc3f-4e71-84d1-0d8a15a21709 | otavioon/COLA-2022-Tools | datasets/src/optz/codenet/4/p03700_s296424653.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ar array
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR... | ALGO | 0.998615 | 3.40411 |
9e44e9c2-8954-46eb-a763-796e1f4a2012 | ishandutta2007/codeforces | marcin_smu/normal/720/B.cpp | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define... | ALGO | 0.999911 | 4.08657 |
3be0e85f-eeb2-4eb2-804d-94561eaede52 | saadbenaissa/MADexamen | 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 |
5cae20d6-4545-4664-9cfa-d5354c4d2996 | jaywant0/DSA_AND_CPP_CODE | 12_STACK/8_ONLINE_STOCK_SPAM.cpp | #include <iostream>
#include<stack>
using namespace std;
stack<pair<int,int>> st;
stockspanner(){
}
int next(int price){
int span = 1;
while(!st.empty() && st.top().first <= price){
span += st.top().second;
st.pop();
}
st.push({price,span});
return span;
}
int main()
{
return ... | ALGO | 0.99762 | 4.560131 |
8716a43e-d45c-4fb6-92a5-19a4ab0ed2d7 | Jine99/.Algorithms | BaaarkingDog/0x0C/solutions/1941.cpp | // Authored by : heheHwang
// Co-authored by : BaaaaaaaaaaarkingDog
// http://boj.kr/b318d03bfd694a57be91322ff1dcd4ef
#include <bits/stdc++.h>
using namespace std;
bool mask[25];
string board[5];
int ans;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
... | ALGO | 0.999936 | 3.926646 |
32c39483-e25f-4299-bc9f-9de88ded7fb2 | Kibria2002/XPSC_Weekly_Practice | Week 04 Day 02/Long_Long.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
long long n, f = 1, sum = 0, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
sum += a... | ALGO | 0.999787 | 4.465716 |
2db22224-e18f-4484-a21d-7cadadd93d76 | ishandutta2007/codeforces | tanphatls987/normal/336/C.cpp | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define INPUT freopen("draft.inp","r",stdin)
#define OUTPUT freopen("draft.out","w",stdout)
#define FOR(i,l,r) for(auto i=l;i<=r;i++)
#define REP(i,l,r) for(auto i=l;i<r;i++)
#define FORD(i,l,r) for(auto i=l;i>=r;i--)
#define REPD(i,l,r) f... | ALGO | 0.999847 | 3.73239 |
4d281e5c-44eb-45f4-a05f-5be448a209a6 | VuDinhLongg/Competitive_Programming | DSA/DSA07008.cpp | // LonggVuz.
#include<bits/stdc++.h>
using namespace std;
// Noob C++
void End(){
cerr << "=> Thời gian code chạy: ";
cerr << (1.0 * clock() / CLOCKS_PER_SEC) << " giây" << string(27, '\t');
}
#define Sonic() ios_base::sync_with_stdio(false); cin.tie(NULL);
#define use(x) freopen(x".inp", "r", stdin); freopen(x... | ALGO | 0.999788 | 4.699375 |
fa645d53-62bb-448b-8c15-d9640eedbf44 | pr7prashant/Leetcode | 973-k-closest-points-to-origin/973-k-closest-points-to-origin.cpp | class Solution {
public:
vector<vector<int>> kClosest(vector<vector<int>>& points, int k) {
vector<vector<int>> res;
priority_queue<pair<double, vector<int>>> pq;
for (int i = 0; i < points.size(); i++) {
int x = points[i][0];
int y = points[i][1];
... | ALGO | 0.999999 | 6.234514 |
d15816fd-ec0b-407b-8a02-7df61e1da2e1 | DibyadyutiDas/dsa | data_structure/linklist/circular/reverse/o_reverse_linklist.cpp | #include <stdio.h>
#include <stdlib.h>
// Structure for a node
struct Node {
int data;
struct Node* next;
};
// Function to insert a node at the beginning of a circular linked list
void insert(struct Node** head, int data) {
// Allocate memory for new node
struct Node* newNode = (struct Node*)malloc(s... | ALGO | 0.999705 | 5.770276 |
09948f8d-2d87-442a-8122-8a07906a6bf1 | ishandutta2007/codeforces | septimelon/normal/1237/E.cpp | #include <algorithm>
#include <chrono>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long... | ALGO | 0.999998 | 4.333106 |
32fc0c74-4b77-4079-b515-abc57d0c0704 | AbdullahJ1445/Starcraft-2-Bot | LocationHandler.cpp | #pragma once
#include "sc2api/sc2_api.h"
#include "BasicSc2Bot.h"
#include "LocationHandler.h"
#include "sc2api/sc2_unit.h"
#include "sc2api/sc2_unit_filters.h"
#include "sc2api/sc2_interfaces.h"
#include "sc2api/sc2_typeenums.h"
MapChunk::MapChunk(BasicSc2Bot* agent_, sc2::Point2D location_, bool pathable_) {
// ... | ALGO | 0.935495 | 5.345214 |
a0144a09-dfda-4ed2-84f9-f6bc4f40fdac | globosco/A-modified-SOSD-platform-for-benchmarking-Branchy-vs-Branch-free-search-algorithms | competitors/PGM-index/lib/sdsl-lite/benchmark/indexing_locate/src/run_queries_sdsl.cpp | /*
* Run Queries
*/
#include <sdsl/suffix_arrays.hpp>
#include <string>
#include <stdlib.h>
#include "interface.h"
#include <stdio.h>
#include <string.h>
#include <unistd.h>
/* only for getTime() */
#include <sys/time.h>
#include <sys/resource.h>
#define COUNT ('C')
#define LOCATE ('L')
#define EXTRACT ('E')
... | ALGO | 0.856607 | 3.96179 |
ce00d53a-78eb-4c38-969a-61d087782e26 | AmrARaouf/algorithm-detection | graph-source-code/92-E/505608.cpp | //Language: GNU C++
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <math.h>
#include <iomanip>
#include <cmath>
#include <functional>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <set>
using namespace std;
long long a,b,s,N,M,A,B,r[123450];
#defi... | ALGO | 0.999965 | 3.938712 |
f564873e-c03f-4744-9cdc-9df9240e540b | krn-07/expenses_app | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998859 | 6.785645 |
4f59a935-fefa-4120-b2b2-1fce0f8c1a98 | firiexp/contest_log | codeforces/25A.cpp | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::... | ALGO | 0.999931 | 3.897187 |
40d15616-35c0-4d34-a3d6-4bead05efda4 | phines/acsimsep | ThirdParty/Coin-Bonmin/Ipopt/examples/ScalableProblems/LuksanVlcek4.cpp | #include "LuksanVlcek4.hpp"
#ifdef HAVE_CONFIG_H
#include "config.h"
#else
#include "configall_system.h"
#endif
#ifdef HAVE_CMATH
# include <cmath>
#else
# ifdef HAVE_MATH_H
# include <math.h>
# else
# error "don't have header file for math"
# endif
#endif
#ifdef HAVE_CSTDIO
# include <cstdio>
#else
# ifdef HAVE_S... | ALGO | 0.999362 | 5.950161 |
715783d1-7af8-4baa-8161-e426a84fdd08 | srymaker0/CODE | algorithm/走地图问题/02.oj535.cpp | /*************************************************************************
> File Name: 2.oj535.cpp
> Author:Yj_Z
> Mail:
> Created Time: Thu 21 Jan 2021 06:53:47 PM CST
************************************************************************/
#include <iostream>
using namespace std;
int n, m, sx, sy, ans = 1;... | ALGO | 0.9999 | 4.307319 |
4e46e549-f851-453b-a6f1-7c33d790f9c4 | said9246/Fellwo_Ship-DSA | 874-backspace-string-compare/backspace-string-compare.cpp | class Solution {
public:
bool backspaceCompare(string s, string t) {
return getFinal(s) == getFinal(t);
}
string getFinal(string str) {
string res;
for (char c : str) {
if (c == '#') {
if (!res.empty()) res.pop_back();
} else {
... | ALGO | 0.999854 | 6.410967 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.