uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
7e792774-9d5d-41fa-9dc8-5de825fb7650 | cleancoin-dev/cleancoin | src/rpcdump.cpp | #include <iostream>
#include <fstream>
#include "init.h" // for pwalletMain
#include "bitcoinrpc.h"
#include "ui_interface.h"
#include "base58.h"
#include <boost/date_time/posix_time/posix_time.hpp>
#include <boost/variant/get.hpp>
#include <boost/algorithm/string.hpp>
#define printf OutputDebugStringF
using namesp... | TOOL | 0.932097 | 6.193941 |
6063f5f1-ed0b-4ea6-b991-f6fd061c562c | edge555/Online-Judge-Solves | Codeforces/672/A. Summer Camp.cpp | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pf printf
#define sf(num) scanf("%d",&num)
#define sff(num1,num2) scanf("%d %d",&num1,&num2)
#define rep(i,n) for(i=1;i<=n;i++)
#define rep0(i,n) for(i=0;i<n;i++)
#define reps(i,a,n) for(i=a;i<=n;i++)
#define pb push_back
#de... | ALGO | 0.998195 | 3.609932 |
50dd6305-1cae-46da-91e7-6added909d0a | mizan8102/dsa | 1.Pattern/InvertedPattern.cpp | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
for (int i = n; i >= 1; i--)
{
for (int j = 1; j <= i; j++)
{
cout << j;
}
cout << endl;
}
return 0;
} | ALGO | 0.99996 | 4.004196 |
3ed198b8-12af-499d-b2c0-e9ef6f4a73f4 | oustani-anas/cp_bootcamp | day01/practice.cpp |
#include <iostream>
#include <vector>
#include <string>
#define endl "\n"
/*
3 2 4 5 1 1 5 3
3 1
*/
void pr_sum(std::vector<long long> &arr, long long n, long long q)
{
long long a, b, sum;
std::vector<long long> prefixS(n + 1, 0);
for (long long i = 1; i <= n; i++)
{
prefixS[i] = ar... | ALGO | 0.999641 | 4.457172 |
aaeb7e12-c8e0-42bb-947a-4f672ea99d9a | Count-group/project1 | results/codes/深度学习/ChatGpt/P2613.cpp | #include <iostream>
#include <string>
using namespace std;
// 自己写的 gcd 函数（欧几里得算法）
long long gcd(long long a, long long b) {
return b == 0 ? a : gcd(b, a % b);
}
// 计算一个大整数（以字符串表示）对 m 的余数
long long modString(const string &s, long long m) {
long long rem = 0;
for (char c : s) {
rem = (rem * 10 + (c ... | ALGO | 0.999977 | 5.04098 |
7cd9adc5-e49a-425c-a4fe-1a204b2357a9 | xterrafunny/selection | Trie.cpp | #include "Trie.h"
#include <algorithm>
Trie::Trie() {
root_ = new TrieNode(nullptr, '\0');
}
Trie::~Trie() {
deleteSubtree(root_);
}
void Trie::addWord(const std::string &string) {
TrieNode *current_node = root_;
for (char c: string) {
if (current_node->transition.find(c) == current_node->transition.end(... | ALGO | 0.996963 | 5.906285 |
25ff0cd8-eb0c-4047-9393-ce20f18a8b6a | DHTHEFOOL/ZHAOLUSI | congsaid.cpp | #include<bits/stdc++.h>
using namespace std;
const long long N=1e6;
long long n,d,a[N],dem,ans=-1e9;
map<long long,long long>mp,f;
int main(){
ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
freopen("congsaid.Inp","r",stdin);freopen("congsaid.Out","w",stdout);
cin>>n>>d;
for(int i=1;i<=n;i++){
cin>>a[i];
mp[a[i]]++;... | ALGO | 0.999919 | 3.542475 |
fe5bf7bd-aea7-41ed-bfe3-cf777ab78dba | YoniKazovsky/CPSC-298 | authenticator.cpp | #include <iostream>
#include <cstring>
using namespace std;
int main()
{
const char k_cAuthenticatorCodeCharacter1 = 'E';
const char k_cAuthenticatorCodeCharacter2 = 'C';
const char k_cAuthenticatorCodeCharacter3 = 'A';
char in1;
cout<<"Enter the first character of the message code: ";
cin>> in... | ALGO | 0.993497 | 3.629751 |
967a6405-92ce-49a8-a632-769b0bad9973 | Dinakarluffy/ASTA-DSA-StriverCode | Algorithms_Striver/Greedy Algorithm/LemonadeChange.cpp | #include <bits/stdc++.h>
using namespace std;
bool lemonadeChange(vector<int> &arr)
{
int five = 0, ten = 0;
for (int bill : arr) {
if (bill == 5) {
five++;
} else if (bill == 10) {
if (five == 0)
return false;
five--;
ten++;
... | ALGO | 0.997718 | 5.153273 |
4985da32-e7f8-4a19-8461-8f105a1e7486 | IbrahimGaberOfficial/DataStructureAndAlgorithmsHomework | 01_DataStructure/10_Trie/01_insert.cpp | #include <bits\stdc++.h>
using namespace std;
class trie{
private:
static const int MAX_CHAR = 26;
trie *child[MAX_CHAR];
bool is_leaf{ };
public:
trie(){
memset(child, 0, sizeof(child));
}
void insert(string str, int idx){
if(idx == str.size()){
is_leaf = true;
... | ALGO | 0.999841 | 4.71304 |
eff9db86-d8e2-4fe0-9503-2e38df540cdf | ayushpratap27/DSA-NonStop | Strings/getLucky.cpp | #include<bits/stdc++.h>
using namespace std;
int getLucky(string s, int k) {
string temp;
for (char c : s) {
temp += to_string(c - 'a' + 1);
}
while (k > 0) {
long long int sum = 0;
for (char c : temp) {
sum += c - '0';
}
temp = to_string(sum);
... | ALGO | 0.999811 | 5.040348 |
c8d575e1-eb38-4a5f-9898-7f39bb92065a | ishandutta2007/codeforces | ugly2333/normal/762/B.cpp | #include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
int u[500005],p[500005];
long long su[500005],sp[500005],ss[500005];
int main()
{
char ch[10];
int a,b,c,m,i,j... | ALGO | 0.999314 | 3.091082 |
7c4864ff-cd15-49fe-8fdc-c468b2ca20b3 | ElvisRodriguez/Courses | CS151-Intro_To_Computing/Assignment_8/assignment_8_R.cpp | /*
//Name: Elvis Rodriguez
//Creation: 11/28/2017
//Version: 8.R
//Description: Displays all possible three letter arrangements of the letters of
the alphabet such that order does not matter and arrangements
cannot have repeating letters with ten (10) arrangements on each
li... | ALGO | 0.950766 | 5.501395 |
d5b4ada8-5c26-4363-b07e-d32be223a81f | adidevmohapatra/CSCE121 | hw_mountains_valleys/functions.cpp | #include <iostream>
#include "functions.h"
using std::cout;
using std::endl;
bool is_valid_range(int a, int b) {
// TODO(student): validate input range
if (((10<=a) && (a<10000) && (10<=b) && (b<10000)) && (a<=b)) {
return true;
}
else {
//cout<<" Invalid Input" << endl;
return false;
}
}
char classify_mv_... | ALGO | 0.994981 | 3.16858 |
023fd8b7-2f07-4d89-836d-0a92d2dc7422 | truongcongthanh2000/TrainACM-ICPC-OLP | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest/D.cpp | #pragma GCC diagnostic ignored "-Wunused-parameter"
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define INP "solve"
#define OUT "solve"
const long long INF_LL = 8e18;
const int INF = 1e9 + 100;
const int MOD = 1e9 + 7;
//const int Base = 311;9
const long double EPS = 1e-10;
const int BLOC... | ALGO | 0.999855 | 4.422181 |
60075864-6cb1-40a7-8122-c4be63bfbede | SSKsaan/Problem-Solving | XPSC/Weekly Problem Solves/w8s_g.cpp | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define endl "\n"
#define SSK ios_base::sync_with_stdio(0); cin.tie(0);
signed main()
{
SSK
int t; cin >> t;
while(t--)
{
int n; cin >> n;
string s; cin >> s;
int ans = n+1;
for(char c='a'; c<='z'; c... | ALGO | 0.999029 | 4.175056 |
b92644d1-91d9-4662-9fc2-274afa9ebca8 | andychuxiao/C-Premier | ch03/ex3_42.cpp | #include <iostream>
#include <vector>
using std::vector;
using std::cout;
using std::endl;
using std::begin;
using std::end;
int main()
{
vector<int> ivec{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
int int_arr[10];
for (int* i = begin(int_arr); i != end(int_arr); ++i)
*i = ivec[i - begin(int_arr)];
for ... | TOOL | 0.850533 | 3.345667 |
4f4955a2-a8b4-4a66-bc42-400839579095 | shuvo37/DSA | graph/SSC/stronglyConnected_kosaraju's.cpp | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
const int mx=1e5+2;
//unordered_map<int,vector<int>> adj,rev;
int v,n;
vector<int> adj[mx],rev[mx];
int curr;
bool vis[mx];
void dfs1(int node,stack<int>&st)
{
vis[node]=true;
for(auto x:adj[node])
{
... | ALGO | 0.999985 | 4.783392 |
1ad8cd2f-21c1-4b10-be92-8fcf0dd380da | cabbagecabbagecabbage/Competitive-Programming | Atcoder Solutions/abc217_d/26376888.cpp | #include <bits/stdc++.h>
using namespace std;
/*
problem: find the closest cut to the left and right of the mark (assuming 0 and L are cuts)
if we had an array or vector that stored the cuts in sorted order, we can binary search
how do we support updates?
.insert O(length of vector that stores the cuts)
binary sear... | ALGO | 0.999742 | 4.141122 |
9cb6ee7e-22b9-4759-a1ea-54000c4854cf | iscat123/myFirstRepo | 数据结构与算法/zcontain/排序算法/插入排序.cpp | #include "define.h"
//
//ֳɡ͡
//ĵһԪأ뵽
void insertSort(vector<int>& arr)
{
int size = arr.size();
for (int i = 1; i < size; ++i)
{
int j = i;
while (j >= 1 && arr[j] < arr[j - 1])
{
swap(arr[j], arr[j - 1]);
j--;
}
}
}
//ල ԲŻ
void unsupervision_insert_sort(vector<int>& arr)
{
int min = 0;
for (int... | ALGO | 0.99989 | 4.642423 |
03056722-1481-4daf-873e-4976b5c865dc | ishandutta2007/codeforces | magicspark/normal/1092/C.cpp | //By MagicSpark
/*
Problem:
Main Idea:
Status:
*/
#include<bits/stdc++.h>
#pragma optimize("Ofast")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-falign-functions")
#pragma ... | ALGO | 0.999805 | 3.271247 |
abcb50f7-3181-4438-aebe-04c042bf0605 | Akrobatik/ps | BaekJoon/12000/12789.cpp | // Title : 도키도키 간식드리미
// Link : https://www.acmicpc.net/problem/12789
// Time : 0 ms
// Memory: 2152 KB
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> arr(n), stk;
for (auto& e : arr) cin >> e;
for (int i = 1, ... | ALGO | 0.999954 | 5.294322 |
70e33b1d-b852-40c4-a196-ee52494ff85a | AditiSatsangi/Design-Analysis-of-Algorithm | Sorting/heap_sort.cpp | #include<iostream>
#include<vector>
#include<chrono>
#include<fstream>
#include<iomanip>
using namespace std;
void heapify(vector<int>& arr, int n, int i) {
int largest = i;
int left = 2 * i + 1;
int right = 2 * i + 2;
if (left < n && arr[left] > arr[largest])
largest = left;
if (right < ... | ALGO | 0.999631 | 5.6373 |
fc786cb6-dc58-4310-9a9b-facd3dc7ef94 | DeependraParmar/DSA | CodeStudios/Print like a wave.cpp | /*
#include <bits/stdc++.h>
vector<int> wavePrint(vector<vector<int>> arr, int nRows, int mCols)
{
vector<int> ans;
for(int i=0; i<mCols; i++){
if(i&1){
for(int j=nRows-1; j>=0; j--){
ans.push_back(arr[i][j]);
}
}
else{
for(int j=0; j... | ALGO | 0.999853 | 3.592656 |
49929958-6f01-41af-93cf-a1ca1d15e125 | Nikhilyadav02/LeetCode | stack.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
stack<char> s;
string a = "nikhil";
for(int i=0;i<a.length();i++)
{
char ch = a[i];
s.push(ch);
}
string ans = " ";
while(!s.empty())
{
char ch = s.top();
ans.push_back(ch);
s.pop();
}
cout<<ans;
return 0;
}
| ALGO | 0.999946 | 3.794333 |
bbb2a856-5389-45d1-b7af-88ab667d4b21 | xambert/Coding-Practice | Codes/climbStairs.cpp | int climbStairs(int n) {
if(n<3) return n;
int one=1,two=2,sum=0;
for(int i=3;i<=n;i++)
{
sum = one + two;
one = two;
two = sum;
}
return sum;
}
| ALGO | 0.999873 | 4.207807 |
74bffe28-db96-4209-ae41-101181a52598 | cvc5/cvc5 | src/theory/quantifiers/ematching/inst_match_generator_simple.cpp | #include "theory/quantifiers/ematching/inst_match_generator_simple.h"
#include "options/quantifiers_options.h"
#include "theory/quantifiers/ematching/trigger_term_info.h"
#include "theory/quantifiers/instantiate.h"
#include "theory/quantifiers/quantifiers_state.h"
#include "theory/quantifiers/term_database.h"
#include... | TOOL | 0.944679 | 6.311127 |
06435d5e-9933-4147-816e-6ced73f35586 | alsgkals2/Study | [C++]Programming Challenges/Railroads/Railroads.cpp | // Railroads.cpp : ܼ α մϴ.
//
#include "stdafx.h"
#include <iostream>
#include <string.h>
using namespace std;
/*int Partition(char** a, int left, int right) {
char* temp = new char[100];
int iTemp;
int first = left;
left++;
while (left < right) {
while (strcmp(a[left], a[first]) < 0 && left <= right... | ALGO | 0.999605 | 3.919045 |
1e1ba1c2-4e02-42ce-b06f-38e732554ba2 | henryzhuhr/interview-preparation | leetcode/string/151.反转字符串中的单词.cpp | /*
* @lc app=leetcode.cn id=151 lang=cpp
*
* [151] 反转字符串中的单词
*
* https://leetcode.cn/problems/reverse-words-in-a-string/description/
*
* algorithms
* Medium (51.81%)
* Likes: 899
* Dislikes: 0
* Total Accepted: 402.8K
* Total Submissions: 777.2K
* Testcase Example: '"the sky is blue"'
*
* 给你一个字符串 ... | ALGO | 0.999876 | 6.345445 |
38084eeb-6d0f-47e1-a63b-521bc44f70d8 | CodeTrans-Research/RefuTra | result/translate/transcoder/java2cpp/c++/MAXIMUM_NUMBER_SEGMENTS_LENGTHS_B_C.cpp | int f_gold ( int n , int a , int b , int c ) {
int dp [ n + 10 ] ;
memset ( dp , - 1 , sizeof dp ) ;
dp [ 0 ] = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( dp [ i ] != - 1 ) {
if ( i + a <= n ) {
dp [ i + a ] = max ( dp [ i ] + 1 , dp [ i + a ] ) ;
}
if ( i + b <= n ) {
... | ALGO | 0.999911 | 4.043079 |
293b63ae-4112-4409-bbc3-1a4a179331c0 | shahpranshu27/DSA_CPP | prog14.cpp | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int row=1;
while(row<=n){
int col=1;
// int value=row;
while(col<=row){
cout<<row-col+1;
// value+=1;
col+=1;
}
cout<<endl;
row+=1;
}
} | ALGO | 0.999945 | 3.746943 |
5de00a5c-16d9-4aa7-b15c-885ccf5f66d3 | dabbydoo/BabyPhoenix | SpriteLib3.0-ProjectSoul/SpriteLib3.0-Complete/SpriteLib3.0-Complete/include/Box2D/Collision/b2CollidePolygon.cpp | #include "Box2D/Collision/b2Collision.h"
#include "Box2D/Collision/Shapes/b2PolygonShape.h"
// Find the max separation between poly1 and poly2 using edge normals from poly1.
static float32 b2FindMaxSeparation(int32* edgeIndex,
const b2PolygonShape* poly1, const b2Transform& xf1,
const b2PolygonShape*... | ALGO | 0.999722 | 6.833144 |
00dcc0c8-06e7-4175-9cbd-e1480d51c7f9 | WashizuRyo/Competitive-programming | ABS/abc406/b.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
__int128 ans = 1;
ll keta = 1;
rep(i, k) keta *= 10;
rep(i, n) {
ans *= a[i];... | ALGO | 0.999967 | 4.194912 |
60afef67-4d2a-4136-bf39-a966e51a915a | chunag24/project_euler | 14_1/leetcode_967.cpp | /*************************************************************************
> File Name: leetcode_967.cpp
> Author:
> Mail:
> Created Time: Sat 3 Apr 15:22:35 2021
************************************************************************/
#include<iostream>
using namespace std;
class Solution{
public:
v... | ALGO | 0.999677 | 5.913599 |
dd1b633f-ea0b-45b8-b30a-cbe101534168 | songyoungeun/Algorithm_Study | BOJ/백트래킹/15651_N과M3.cpp | #include <iostream>
using namespace std;
int n, m, selected[10];
void input(){
cin >> n >> m;
}
void rec_func(int k){
cout << "1: " << k <<'\n';
if(k == m + 1){
for(int i = 1; i <= m; i++){
cout << selected[i] <<' ';
}
cout << '\n';
return;
}
for(int cand = 1; cand <= n; cand++){
selected[k] = ... | ALGO | 0.999788 | 3.26981 |
51b080c5-4328-4ad8-b9a9-ba7df95d034e | KDE/kpat | src/patsolve/klondikesolver.cpp | #include "klondikesolver.h"
// own
#include "../klondike.h"
#include "../kpat_debug.h"
/* Some macros used in get_possible_moves(). */
/* The following macro implements
(Same_suit ? (suit(a) == suit(b)) : (color(a) != color(b)))
*/
#define suitable(a, b) (COLOR(a) != COLOR(b))
#define PRINT 0
/* These two rout... | ALGO | 0.998178 | 5.783396 |
447c877d-7606-4a07-9f75-fce07cc270be | mihabor2002/Zach | Project2/Project2/Interpolation.cpp | #include "Interpolation.h"
#include "k_sredn.h"
//211 - Borovikov - Mikhail
float function(float x)
{
return exp(- x);
}
void print_itog(Point Z, float y)
{
ofstream f("interp_gnu.txt"), g("interp.txt");
g << Z.x << " " << Z.y << " " << y;
g.close();
g << "splot (x*x-y*y)/10+5, 'Point.txt'\n";
g... | ALGO | 0.998128 | 3.738715 |
55d4835d-9dd0-4700-85fb-120ce5b3d5a3 | RIYANSHGARG/DSA-Question-Sheet | 1. Striver_Arrays_1/4KadanesAlgo.cpp | // https://leetcode.com/problems/maximum-subarray/submissions/
#include <bits/stdc++.h>
using namespace std;
int bruteForce(vector<int> nums)
{
int sum = 0, maxi = nums[0];
if (nums.size() == 1)
return nums[0];
for (int i = 0; i < nums.size(); i++)
{
for (int j = i; j < nums.size(); j+... | ALGO | 0.999978 | 6.011125 |
7905152f-2521-4ea4-beab-b0f6df685881 | atharvshinde3113/Trees | 4.BST/4.InsertNode.cpp | /* o(h) tc o(h) sc
1. To insert a value 'val' into the BST, we start from the root node and traverse down the tree to find the appropriate position for insertion.
2. If the BST is empty (i.e., root is null), we create a new node with value 'val' and make it the root of the BST.
3. If the value of the current node is le... | ALGO | 0.99996 | 6.110764 |
0e4853fb-aab6-4657-b7ad-b56472aaf2b4 | OmkarBhostekar/leetcode | 167-two-sum-ii-input-array-is-sorted/167-two-sum-ii-input-array-is-sorted.cpp | class Solution {
public:
vector<int> twoSum(vector<int>& n, int t) {
int i=0,j=n.size()-1;
while(i<=j){
if(n[i]+n[j] == t){
return {i+1,j+1};
}else if(n[i]+n[j]>t){
j--;
}else {
i++;
}
}
r... | ALGO | 0.99983 | 6.35743 |
d9f01263-37c7-43d8-bb3a-6a95c8ccafdd | topcue/algorithm | 03_DynamicProgramming/02_coin1.cpp | #include <iostream>
#define MAX_SIZE 10000
using namespace std;
int arr[MAX_SIZE];
int lastCoin[MAX_SIZE]; // S[]: 이전에 추가된 코인의 종류.
int coinsUsed[MAX_SIZE]; // C[]: 이전에 추가된 코인의 개수.
/*
coins[]: 동전 종류
numDiffCoins: 동전 종류의 개수
change: 거스름돈
*/
void coinExchange(int coins[], int numDiffCoins, int change) {
/* coinsU... | ALGO | 0.999895 | 3.976196 |
231d1833-c0ad-4180-a966-051140d81aec | Mitch-Siegel/Advent-of-Code-2021 | day12/d12.cpp | /*
* Mitch Siegel
* Advent of Code 2021
* Day 12: Parts 1 and 2
* https://adventofcode.com/2021/day/12
*
*/
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
// data structure to keep track of caves, their size, and their connected caves
class Cave
{
public:
std::string name;
int b... | ALGO | 0.999004 | 5.31519 |
74b93d9e-79cc-44cd-9039-f609eba7660e | Tarun-S-B/APS | Portfolio_snippets/ford_fulkerson.cpp | // C++ program for implementation of Ford Fulkerson
// algorithm
#include <iostream>
#include <limits.h>
#include <queue>
#include <string.h>
using namespace std;
// Number of vertices in given graph
#define V 6
/* Returns true if there is a path from source 's' to sink
't' in residual graph. Also fills parent[] to... | ALGO | 0.999973 | 6.280166 |
f1a6b3e7-8836-47bf-a435-3d8045bfd1fd | njd48/cpptuts | ch_6_scope_duration_and_linkage/demo_globalvars.cpp |
//
#include <iostream>
// Declare a global variable
double g_x{};
const double g_G{ 6.67430e-11 }; // Newton
// It is conventional to use prefix g_
// for global variables
//=================================================================================
//=== Fncs ===
void setGravityEarth( )
{
g_x = 9.81;
... | ALGO | 0.981677 | 4.149157 |
20b42159-d0d6-46fe-8a8e-fe33b174503a | CadenQAQ/learncplucplus | palindrome.cpp | #include<iostream>
using namespace std;
bool IsPalindrome(int n)
{
if(n<0){return false;}
int div = 1;
while(n/div>=10)
{
div *=10;
}
while(n!=0)
{
int left = n/div;
int right = n%10;
if(left!=right)
{
return false;
}
n... | ALGO | 0.999743 | 4.209536 |
216fe6c7-cb26-4413-9180-c95ef9a528b6 | heyi1994/leetcode-daily | 20210309leetcode.cpp | //
// @birth: created by Melrose on 2021/3/9
// @version: 1.0.0
//
//给出由小写字母组成的字符串S，重复项删除操作会选择两个相邻且相同的字母，并删除它们。
//
//在 S 上反复执行重复项删除操作，直到无法继续删除。
//
//在完成所有重复项删除操作后返回最终的字符串。答案保证唯一。
//
//输入："abbaca"
//输出："ca"
//解释：
//例如，在 "abbaca" 中，我们可以删除 "bb" 由于两字母相邻且相同，这是此时唯一可以执行删除操作的重复项。之后我们得到字符串 "aaca"，其中又只有 "aa" 可以执行重复项删除操作，所以最后的字符串... | ALGO | 0.999413 | 6.650689 |
f7e3efa1-e6b4-4d40-a753-fedcd258aff1 | kaushikns/3d-multiscale-thrombosis-solver | palabos/examples/codesByTopic/couplings/coupleVelocityField.cpp | #include "palabos2D.h"
#include "palabos2D.hh"
#include "poiseuille.h"
#include "poiseuille.hh"
#include <vector>
#include <cmath>
#include <iostream>
#include <fstream>
#include <iomanip>
using namespace plb;
using namespace std;
typedef double T;
#define DESCRIPTOR descriptors::D2Q9Descriptor
template<typename T>... | ALGO | 0.995782 | 6.191356 |
2428aef5-9f2a-4eaf-9b71-c106d63f6ce7 | BenkangPeng/CrackTheAlgorithm | src-cpp/class025/heap_sort.cpp | // 测试链接：https://leetcode.cn/problems/sort-an-array/description/
// 当前结点索引为i
// 父结点索引为 (i - 1) / 2
// 左孩子：2i + 1 , 右孩子：2i + 2
#include<iostream>
#include<vector>
class heap{
private:
void swap(int& a , int& b){
int t = a;
a = b;
b = t;
}
public:
//heap_insert 、heapify时间复杂度为O(logN)
... | ALGO | 0.999938 | 4.930191 |
9d65771c-52a7-430a-94ae-b23985fcfb8d | libalf/libalf | finite-automata-tool/fateq.cpp | #include <unistd.h>
#include <iostream>
#include <fstream>
#include <istream>
#include <ostream>
#include <getopt.h>
#include <libalf/alf.h>
#include <libalf/serialize.h>
#include <amore++/amore.h>
#include <amore/global.h>
#include "amore_alf_glue.h"
using namespace std;
using namespace amore;
using namespace lib... | ALGO | 0.929965 | 5.547005 |
99234692-73ab-4168-ac8c-75ec2b941f73 | iamwangyabin/VIO-SLAM | week2/src/code_utils/src/cv_utils/pnp/linearpnp.cpp | #include <code_utils/cv_utils/pnp/linearpnp.h>
cv::Homography::Homography( const std::vector< Eigen::Vector3d >& pts_2,
const std::vector< Eigen::Vector3d >& pts_3 )
{
mat_tmp.resize( 2, 9 );
readPointsPlanar( pts_2, pts_3 );
solvePnP( );
}
void
cv::Homography::solvePnP( )
{
... | ALGO | 0.998593 | 5.507119 |
1f488452-0c73-470f-be0e-97ae664ea951 | Abunyawa/contests | 672/c2.cpp | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define vi vector<int>
#define vl vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#de... | ALGO | 0.999932 | 3.969014 |
ad06cf90-de3b-4f2f-9672-0cdefcc968fd | jacklin5168/LeetcodeLocal | cpp/106.construct-binary-tree-from-inorder-and-postorder-traversal.cpp | /*
* @lc app=leetcode id=106 lang=cpp
*
* [106] Construct Binary Tree from Inorder and Postorder Traversal
*
* https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description/
*
* algorithms
* Medium (50.68%)
* Total Accepted: 314.3K
* Total Submissions: 610.5K
* Testc... | ALGO | 0.999971 | 6.706051 |
d8230bb5-e416-4b17-b5e8-2914af5f93a6 | MariaSark/Maria_firs_sem | sarkisyan_m_s/0136a.cpp | // Example program
#include <iostream>
using namespace std;
int main()
{
int n, t;
cin >> n;
vector <int> a(n);
for(int i = 0; i < n; ++i){
cin >> t;
a[--t] = i + 1;
}
for(auto i: a)
cout << i << " ";
return 0;
}
| ALGO | 0.999794 | 3.696179 |
aa1e221d-d134-46b6-ba48-c729a6f697cd | manikanta2901/ubuntu | .history/codingChallenges/cpp/Codechef/longChallenges/Year2021/May/ModularEquation_20210513201142.cpp | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
int Modulo(int m,int a ,int b){
return (m % a) %b;
}
int main(){
int t;
cin >> t;
while(t--){
int n,m;
cin >> n >> m;
set< pair<int,int> > freq,guess;
for(int i = 1; i <= n; i++){
for(int j = i ... | ALGO | 0.99984 | 4.059598 |
ed69d5a5-38bd-42bb-9f1a-262ba8523ae8 | MuTou111/Cpp-Prime-Plus-Code | Session_05/example_08/Code_5_8_block.cpp | // block.cpp ------------- use a block statement
#include <iostream>
int main()
{
using namespace std;
cout << "The Amazing Account will sum and average ";
cout << "five numbers for you.\n";
cout << "Please enter five values:\n";
double number;
double sum = 0.0;
for(int i = 1; i <= 5; i++)
... | TOOL | 0.980484 | 3.1001 |
a8a01dd2-59d9-4c46-af61-ec8ecae1c445 | maspypy/library | test/3_yukicoder/1956.test.cpp | #define PROBLEM "https://yukicoder.me/problems/no/1956"
#include "my_template.hpp"
#include "other/io.hpp"
#include "nt/crt.hpp"
using T = uint16_t;
T dp[46][100001];
void solve() {
LL(N, M, C);
ll NC = min(C, N - C);
VEC(ll, A, N);
ll S = SUM<ll>(A);
vc<int> mods = {65536, 65535, 65533, 65531, 65527, 65521... | ALGO | 0.999713 | 4.229218 |
7a2786f5-c6bc-4268-bb43-964caf6e1f59 | Tobiskid2244/Emmanuel05 | src/mapping/PathDisplacements.cpp | #include "core/ActionWithValue.h"
#include "core/ActionPilot.h"
#include "core/ActionWithArguments.h"
#include "core/ActionRegister.h"
#include "tools/Matrix.h"
#include "PathProjectionCalculator.h"
//+PLUMEDOC ANALYSIS AVERAGE_PATH_DISPLACEMENT
/*
Accumulate the distances between the reference frames in the paths and... | ALGO | 0.984208 | 3.924859 |
d3e143b5-54f4-49a1-9b3f-f5e8d983fdf2 | AyushRaja5/DSA-GFG | SingleLinkedList/CircleLinkedList/CircleLinkedList.cpp | #include<iostream>
using namespace std;
struct node
{
int data;
node* next;
node(int val){
data = val;
next = NULL;
}
};
void push(node* &head, int val){
node* n = new node(val);
if(head==NULL){
n->next = n;
head= n;
return;
}
node* temp = ... | ALGO | 0.999733 | 3.773498 |
9dec1ad9-86a0-4837-a88c-35c6709de56d | devangi2000/Data-Structures-Algorithms-Handbook | Dynamic Programming/Maximum-Length-of-Pair-Chain-646.cpp | // You are given an array of n pairs pairs where pairs[i] = [lefti, righti] and lefti < righti.
// A pair p2 = [c, d] follows a pair p1 = [a, b] if b < c. A chain of pairs can be formed in this fashion.
// Return the length longest chain which can be formed.
// You do not need to use up all the given intervals. You can... | ALGO | 0.99999 | 5.597458 |
2c585387-54fe-4add-bdf3-fbcf4fc44bdc | 07012001Rahul/ardupilot_1 | libraries/AP_Common/tests/test_sorting.cpp | #include <AP_gtest.h>
/*
tests for AP_Common/sorting.cpp
*/
#include <AP_Common/AP_Common.h>
#include <AP_Common/sorting.h>
#include <stdlib.h>
#if CONFIG_HAL_BOARD == HAL_BOARD_SITL || CONFIG_HAL_BOARD == HAL_BOARD_LINUX
static int comp16(const uint16_t *v1, const uint16_t *v2) {
return int32_t(*v1) - int32... | TEST | 0.912952 | 7.448337 |
d4df2f70-a856-4155-be74-96bfc16cf861 | sachleen11/Leetcode-Problems | remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.cpp | class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int i = 1;
while(i < nums.size()){
cout << nums[i];
if(nums[i] == nums[i-1])
nums.erase( nums.begin() + i);
else
i++;
};
return nums.size();
}
}; | ALGO | 0.999605 | 5.940219 |
db886c47-28bc-45d3-bd62-31a7e4f68782 | TheLudway/competitive-programming | Aprendizaje/FreeCodeCamp/9CharManipulationStrings/9.2CStringManipulation/main.cpp | #include <iostream>
#include <cstring>
#define endl "\n";
int main(){
// std::strlen : Encontrar la longitud de una cadena
const char message1 [] {"The sky is blue."};
// Array decae en un puntero cuando se usa const char*
const char* message2 {"The sky is blue."};
std::cout << "message1 : " << me... | ALGO | 0.86751 | 3.216764 |
26f5412b-53e1-4df8-9570-1cd7bf195981 | AbrarKhan/Framework_av_AOSP10_r33 | media/libstagefright/codecs/amrnb/dec/src/lsp_avg.cpp | /*
------------------------------------------------------------------------------
Pathname: ./audio/gsm-amr/c/src/lsp_avg.c
Functions:
Date: 04/14/2000
------------------------------------------------------------------------------
REVISION HISTORY
Description: Removed the functions lsp_avg_init and lsp_avg... | ALGO | 0.974533 | 6.647949 |
ba5e5e32-fed7-4d80-bd91-6d32ff391dbf | FrederikTobner/AdventOfCode2024 | day_12/src/main.cpp |
#include <expected>
#include <string>
#include <system_error>
#include <vector>
#include "../../shared/src/exit_code.hpp"
#include "../../shared/src/file_operations.hpp"
#include "../../shared/src/grid_processor.hpp"
#include "../../shared/src/print_compatibility_layer.hpp"
#include "../lib/parser.hpp"
#include "../... | ALGO | 0.969783 | 5.774683 |
f10f0e0e-d324-44c0-a707-eb9938e7d13f | jjunseoki/baekjoon | baekjoon/1977.cpp | #include<iostream>
using namespace std;
int main() {
int M, N;
int psn[10000];
int sum = 0;
int mini = 10000;
//Է
cin >> M;
cin >> N;
//psn迭 ü ־
for (int i = 1; i <= N; i++) {
psn[i] = i * i;
}
//ǹ ã
for (int i = 1; i <= N; i++) {
if (M <= psn[i] && psn[i] <= N) {
sum += psn[i];
mini = min(mini... | ALGO | 0.999982 | 4.273719 |
bc6158ae-2fd5-4881-9361-3e690431ff2c | catwomp1/cpp_primer | Chapter Exercises/Chapter7/7.5/factorials.cpp | // factorials.cpp -- Using recursive function to find factorials
#include <iostream>
//Function prototype
long long factorial(int value);
int main(int argc, char* argv[])
{
using namespace std;
int value;
long long result;
cout << "Enter value (q to quit): ";
while(cin >> value && value >= 0)
{
result = facto... | ALGO | 0.999631 | 5.748952 |
6b695d95-23f2-430e-9ea2-a07df4c96662 | ishandutta2007/codeforces | satashun/normal/1204/C.cpp | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(... | ALGO | 0.999989 | 4.073741 |
2247f169-da8d-4834-b292-d379641917b6 | Shubhamm1211/LeetCode | 2691-count-vowel-strings-in-ranges/count-vowel-strings-in-ranges.cpp | class Solution {
public:
vector<int> vowelStrings(vector<string>& words, vector<vector<int>>& q) {
int n = words.size();
set <char> st = {'a', 'e', 'i', 'o', 'u'};
vector <int> ans, org(n), pre(n);
for(int i = 0; i < n; i++){
string w = words[i];
if(st.count(w... | ALGO | 0.999912 | 6.027258 |
5340f522-646d-4345-92be-95405ec88c96 | LineageOS/android_external_angle | third_party/vulkan-deps/spirv-tools/src/source/opt/unify_const_pass.cpp | #include "source/opt/unify_const_pass.h"
#include <memory>
#include <unordered_map>
#include <utility>
#include <vector>
#include "source/opt/def_use_manager.h"
#include "source/opt/ir_context.h"
#include "source/util/make_unique.h"
namespace spvtools {
namespace opt {
namespace {
// The trie that stores a bunch o... | TOOL | 0.875435 | 7.914588 |
d199211c-429c-4739-830b-986309a077e4 | DenizTohumcu/DCS | libraries/graphs/graphs.cpp | //
// Created by Deniz Tohumcu on 09/11/2019.
//
#include "graphs.h"
#include <iostream>
#include <vector>
#include <map>
#include <string>
#include "../logicgates/logicgates.h"
#include "gateInfo.h"
graphs::graphs(std::map<std::string, std::string> outputPerGateMapGiven,
std::map<std::string, std::vec... | ALGO | 0.998547 | 3.681061 |
922201da-a460-45be-9d3b-0c1bfa013af7 | Slava/competitiveProgramming | timus/timus_1732.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main () {
string str, s;
getline(cin, str);
int j = 0;
vector<int>u(str.size());
for (; cin >> s; ) {
int pos = str.find(s, j);
if(pos == -1) {
cout << "I HAVE FAILED!!!";
return 0;
}
for (int i = 0; i < s.size(); i++)... | ALGO | 0.999716 | 3.795861 |
13b9501d-b191-4f2b-b736-2498577c4889 | HarshCodes-07/C-Plus-Plus-Programming | OperatorOverload3.cpp | #include<iostream>
using namespace std;
class Num{
private :
int a,b,c,d;
public :
Num(int p,int q,int r,int s){
a=p;
b=q;
c=r;
d=s;
}
void operator -(){
a=-a;
b=-b;
c=-c;
d=-d;
}
void show(){
cout<"\n";
cout<<"\n\ta = "<<a;
cout<<"\n\tb = "<<b;
cout<<"\n\tc = "<<c;
... | ALGO | 0.98732 | 3.606748 |
3e9ef65d-694b-4343-aa42-df3e6eb17340 | enkilee/leetcode | .history/no1160_20200317112842.cpp | /*
* @Author: your name
* @Date: 2020-03-17 10:50:10
* @LastEditTime: 2020-03-17 11:25:07
* @LastEditors: Please set LastEditors
* @Description: In User Settings Edit
* @FilePath: \leecode\no1160.cpp
*/
#include <iostream>
#include <cmath>
#include <vector>
#include <stack>
#include <map>
#include <unordered_map... | ALGO | 0.999955 | 5.041293 |
490c0893-0ccd-4c01-838e-fea03ac116ad | tmsnn/ADS2022 | midterm/I.cpp | #include <bits/stdc++.h>
using namespace std;
string int_to_bin(long long d){
string s;
while(d > 0){
if(d % 2){
s += '1';
} else {
s += '0';
}
d /= 2;
}
return s;
}
int main(){
int n; cin >> n;
// stack <char> st;
for(int i = 0; i <... | ALGO | 0.999945 | 4.999126 |
d58f84f8-a3fb-473a-80d9-25038c72fc7a | onebyone/489project | client/client_refactor.cpp | #include <cstring>
#include <cstdio>
#include <errno.h>
#include <resolv.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <sstream>
#include <pthread.h>
#include <mutex>
#include <vector>
#include "file_ops.h"
#include "netw_util.h"
#include "analyze_peerlist.h"
// create directory
#include <sys/stat.h>
#includ... | WEB | 0.867338 | 3.75335 |
1dba569e-4475-4fdb-9c2c-92acc8122ac0 | Nati-Hab1/Data-Structures-and-Algorithms- | Practice Problems on Graphs/815. Bus Routes.cpp | #include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
class Solution {
public:
int numBusesToDestination(vector<vector<int>>& routes, int S, int T) {
if (S == T) {
return 0;
}
unordered_map<int, unordered_set<int>> to_route;
for (int i ... | ALGO | 0.999927 | 6.037095 |
c735a8a9-8bd0-48c7-8376-edae8793bf93 | seanarch/pku-ds | 1-basic/week6/appleandworm.cpp | #include <iostream>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int temp = (y + x - 1) / x;
int remaining = n - temp;
if (remaining < 0) remaining = 0;
cout << remaining << endl;
return 0;
}
| ALGO | 0.999554 | 3.421621 |
80c0cd47-76fe-431b-9d2b-cc18a7b1db43 | HeathGargit/MathsExercises | dependencies/imgui/extra_fonts/binary_to_compressed_c.cpp | // ImGui - binary_to_compressed_c.cpp
// Helper tool to turn a file into a C array.
// The data is first compressed with stb_compress() to reduce source code size.
// Then encoded in Base85 to fit in a string so we can fit roughly 4 bytes of compressed data into 5 bytes of source code (suggested by @mmalex)
// (If we u... | TOOL | 0.967025 | 6.112878 |
9897cb03-18e2-4868-8e74-fc614131ac63 | arthurnmachado/prog2 | avaliativos/quest2/ciclo.cpp | #include <stdio.h>
int ciclo(int n){
if(n == 1){
printf("1 ");
return 1;
}
else if(n % 2 == 0){
printf("%d ", n);
return 1 + ciclo(n/2);
}
else{
printf("%d ", n);
return 1 + ciclo((n*3)+1);
}
}
int main(){
int n;
scanf("%d", &n);
printf("%d\n", ciclo(n));
return 0;
} | ALGO | 0.999974 | 4.49073 |
660e5627-28ff-45d4-bb67-1e1053a099d8 | pingjuiliao/mlir-playground | llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.min.max/min_init_list.pass.cpp | // UNSUPPORTED: c++03
// <algorithm>
// template<class T>
// T
// min(initializer_list<T> t);
#include <algorithm>
#include <cassert>
#include "test_macros.h"
int main(int, char**)
{
int i = std::min({2, 3, 1});
assert(i == 1);
i = std::min({2, 1, 3});
assert(i == 1);
i = std::min({3, 1, 2}... | TEST | 0.994453 | 4.9407 |
4deff79e-d495-4848-ad51-38309c679cd4 | AksyonovaKaterina/labs_PA_22_Aksionava | 9303_Khalilov_lb4/src/threads.cpp | #include "./utils.cpp"
#include "./strassen.cpp"
#include <thread>
#include <ctime>
#include <math.h> /* pow */
using namespace std;
int main(int argc, const char **argv)
{
srand(time(0));
int power = 7, n = pow(2, power), m = pow(2, power);
auto A = MATRIX::generate(n, m);
auto B = MATRIX::generate... | ALGO | 0.977743 | 4.470451 |
d7b74f8e-816e-411b-88ba-fc59bf6cf396 | MeleshenkoDasha/asm | Lab_6/Lab_6/Source1.cpp | //a^2/b + 21, a>b
//-a + 6, a=b
//(ab - 12b)/a, a<b
//a^2/b - 1, a>b
//-a + 25, a=b
//(8ab - 2b)/a, a<b
#include <iostream>
using namespace std;
double get_value() {
double value;
while (true) {
if (!(std::cin >> value) || (std::cin.peek() != '\n')) {
std::cin.clear(); ... | ALGO | 0.989453 | 3.743631 |
4a263651-d86d-4b33-baeb-d1406b559546 | bioyoshoo/atcoder | Boot-camp/Medium/93.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> plug(M, vector<int>(N, 0));
for (int i = 0; i < M; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
plug.at(i).at(s -... | ALGO | 0.999927 | 4.217743 |
a36c8106-96d4-4d3d-946f-c875d3d855fe | esbanarango/Competitive-Programming | HackerRank/Cavity Map.cpp | /*
Cavity Map (30 points)
HackerRank
Esteban Arango Medina
*/
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#inc... | ALGO | 0.999811 | 3.349137 |
717dd54c-fa4e-48dc-a71c-95cb608b4e63 | thegamer1907/Code_Analysis | scrape/data/Organized/Liverbird2002/Liverbird2002_TLE.cpp | #include <bits/stdc++.h>
using namespace std;
#define FastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fi first
#define se second
typedef long long ll;
typedef long long unsigned llu;
typedef vector<long> vec;
const
long MaxM = 1e5 + 5;
long p[MaxM];
int main(){
llu n,m,k1;
cin >> n >> m >> ... | ALGO | 0.999961 | 3.33174 |
6ae46a83-c735-49a5-94ee-d7c4dfce17c4 | realme72/hackerearthsolutions | graphs/topological-sort.cpp | #include"bits/stdc++.h"
using namespace std;
#define pb push_back
#define ll long long
#define sorted(x) sort(x.begin(),x.end())
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(v) v.begin(), v.end()
const int N = 11;
vector<int> ans;
vector<int> v[N];
int vis[N],n,m;
void dfs(int u)... | ALGO | 0.999991 | 4.090737 |
e61f2d26-5876-45e2-8c71-055184dd6bee | rafa-hub/converter | copt/init_color_sort.cpp | //init_color_sort.cpp file: implements RLF functionality of InitColorSort class. Cannot be included in the header because it uses clique funcitonality
//date of creation: 2/11/15
//author: pss
#include "init_color_sort.h"
#include "./batch/batch_benchmark.h"
//#include "./clique/clique.h"
#include "./clique/clique_rus... | ALGO | 0.999548 | 4.435589 |
45a2ba6e-5f46-4b9e-b51d-56a1dab0eddb | musegros/mazecpp | src/main.cpp | #include <iostream>
#include <vector>
#include <string>
#include <fstream>
#include <stack>
#include "../include/Branch.h"
#include "../include/MazeTextFile.h"
using namespace std;
#define PRINT(STR, VAR) \
cout << STR " = " << VAR << endl
int main(int argc, char *argv[]) {
vector<Branch*> queue;
string nextMoves... | ALGO | 0.998148 | 5.160472 |
c575bb7c-f6bc-4b6c-b3b7-fcb4c467d0d9 | RockysDev/CSCI2270-Data-Structures | exam2sub/quest1/Graph.cpp | #include "Graph.hpp"
#include <vector>
#include <queue>
#include <stack>
#include <iostream>
#include <climits>
using namespace std;
void Graph::addEdge(string v1, string v2){
for(unsigned int i = 0; i < vertices.size(); i++){
if(vertices[i]->name == v1){
for(unsigned int j = 0; j < vertices.s... | ALGO | 0.996974 | 3.754186 |
1dd4751f-1c14-49ea-9191-454cf736cfc5 | deltaDC/Discrete-Mathematics-PTIT | bai 3.7 duyet cac dinh tru.cpp | #include <bits/stdc++.h>
using namespace std;
#define lim 10000005
#define MOD 1000000007
#define ll long long
#define faster() ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define testcase() int t; cin >> t; while(t--)
vector<int> ke[1005];
bool visited[1005];
void dfs(int u)
{
visited[u] = true;
for(a... | ALGO | 0.99971 | 3.14813 |
3afcf66c-65a8-4480-9b8c-2d3a86da16cd | yantay0/algorithms-and-data-structures | labs-ejudge/lab-1/E.cpp | #include <iostream>
#include <queue>
using namespace std;
int main()
{
queue<int> b, n;
int x;
for (int i = 0; i < 5; i++)
{
cin >> x;
b.push(x);
}
for (int i = 0; i < 5; i++)
{
cin >> x;
n.push(x);
}
int cnt = 0;
while (!b.empty() and !n.empty())
{
if (b.front() == 0 and... | ALGO | 0.999741 | 3.657721 |
bbf42fcf-7703-4f30-96c8-acac2d2bf094 | Leelasai2004/LeetCodes | 1298-reverse-substrings-between-each-pair-of-parentheses/1298-reverse-substrings-between-each-pair-of-parentheses.cpp | class Solution {
public:
string reverseParentheses(string s) {
stack<int> st;
int n=s.size();
vector<int> portal(n);
for(int i=0;i<n;i++){
if(s[i]=='('){
st.push(i);
}
else if(s[i]==')'){
int j=st.top();
... | ALGO | 0.999978 | 5.737491 |
1abebe1a-0757-46ce-9545-15cf8d56373d | ZhaoQi99/ACM | 牛客/Wannafly挑战赛21/B.机器人.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
char Map[55][55];
int N,M;
int si,sj;
int main()
{
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
cin.sync_with_stdio(false);
int t;
cin >> t;
bool flag = false;
while(t--)
{
cin >> N >> M;
... | ALGO | 0.99977 | 3.571195 |
4396e80b-96c6-4399-96bf-73bc055a346f | alexandraback/datacollection | solutions_5686313294495744_1/C++/Slevin/code.cpp | #include <cassert>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <limits>
#include <numeric>
#include <sstream>
#include <utility>
#include <cmath>
#include <algorithm>
#include <bitset>... | ALGO | 0.999671 | 4.548925 |
d886a5da-34b0-4f4e-9f13-fbc904a249c3 | Andreshk/AdventOfCode2023 | Day09.cpp | #include "Lines.h"
#include <scn/scan.h>
#include <print>
#include <vector>
#include <algorithm> // std::ranges::all_of
void day09(const char* filename) {
int part1 = 0;
int part2 = 0;
for (std::string_view line : lines(filename)) {
auto xs = scanList<int>(line);
std::vector<int> firsts;
for (bool even = true... | ALGO | 0.99972 | 4.494312 |
e9773e68-5584-4cf6-82b9-e0e9b53db773 | PixelStuffs/external_libcxx | test/std/algorithms/alg.modifying.operations/alg.partitions/is_partitioned.pass.cpp | // <algorithm>
// template <class InputIterator, class Predicate>
// constpexr bool // constexpr after C++17
// is_partitioned(InputIterator first, InputIterator last, Predicate pred);
#include <algorithm>
#include <functional>
#include <cstddef>
#include <cassert>
#include "test_macros.h"
#include "te... | TEST | 0.967722 | 7.186196 |
91d37fdb-e7ab-4cf9-8bc9-6681d3317ab8 | sidv1905/Practice-C-Programs | dynamic array sum.cpp | #include<iostream>
#include <cstdlib>
using namespace std;
//dynamic array with its sum as output
int main()
{
int *a,n,sum;
cout<<"ENTER N size of array : ";
cin>>n;
a=(int *)malloc(n*sizeof(int));
cout<<"ENTER elements";
int i;
for(i=0;i<n;i++)
{
cin>>*(a+i);
}
cout<<"SUM OF ARRAYS IS: ";
sum=0;
for... | ALGO | 0.85208 | 3.227601 |
6a0f7449-313d-4b59-b58d-394f76cdf1d2 | NeonXGit/Wallet | src/llmq/signing_shares.cpp | #include <llmq/signing_shares.h>
#include <llmq/quorums.h>
#include <llmq/commitment.h>
#include <llmq/signing.h>
#include <llmq/utils.h>
#include <bls/bls_batchverifier.h>
#include <chainparams.h>
#include <evo/deterministicmns.h>
#include <masternode/node.h>
#include <net_processing.h>
#include <netmessagemaker.h>
... | TOOL | 0.978177 | 6.649122 |
f5041463-024d-45a0-9454-69aef1a7b8ad | ChuanqiXu9/clang-modules-converter | llvm/tools/llvm-cfi-verify/lib/FileAnalysis.cpp | #include "FileAnalysis.h"
#include "GraphBuilder.h"
#include "llvm/BinaryFormat/ELF.h"
#include "llvm/DebugInfo/DWARF/DWARFContext.h"
#include "llvm/DebugInfo/Symbolize/SymbolizableModule.h"
#include "llvm/MC/MCAsmInfo.h"
#include "llvm/MC/MCContext.h"
#include "llvm/MC/MCDisassembler/MCDisassembler.h"
#include "llvm/... | TOOL | 0.968002 | 7.591877 |
2f883489-71e2-4be9-a6e1-14461317ebc4 | moneypiaorui/MagicWand | libraries/Chirale_TensorFLowLite/src/tensorflow/lite/micro/kernels/depth_to_space.cpp | #include "tensorflow/lite/kernels/internal/reference/depth_to_space.h"
#include <stdint.h>
#include "tensorflow/lite/c/common.h"
#include "tensorflow/lite/kernels/internal/types.h"
#include "tensorflow/lite/kernels/kernel_util.h"
#include "tensorflow/lite/micro/kernels/kernel_util.h"
#include "tensorflow/lite/micro/m... | ALGO | 0.858655 | 7.84527 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.