uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
5de0dc25-a05f-4c7f-b930-56a0a7914052 | sakiib/competitive-programming-code-library | DS & Algo Implementation/Graph Theory/Articulation Point & Bridge/Articulation Point Tarjan.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef unsigned long long uLL;
typedef pair < int , int > ii;
const int inf = 1e9;
const LL INF = 1e18;
const int N = 1e5 + 5;
const int mod = 1000000007;
const double eps = 1e-8;
const double pi = acos( -1.0 );
vector <int> graph[ N ];
set <int... | ALGO | 0.999904 | 4.829938 |
660e105b-d2b9-42b4-9f5e-205d08f4ad7f | thegamer1907/Code_Analysis | Implementation/965.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n, t;
while(cin >> n >>t)
{
string s;
cin >> s;
int flag=1;
for(int j=0; j<t; j++)
{
flag = 1;
for(int i=0; i<n-1; i++)
{
if(s[i]=='B' && s[i+1]=='G' &&... | ALGO | 0.999796 | 3.513669 |
117545e8-59e9-46f6-b5a6-84e6169c220a | raincross7/code-similarity | codes/train_code/problem351/problem351_295.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
char a, b;
cin >> a >> b;
if (a < b) {
cout... | ALGO | 0.999992 | 4.19161 |
313d59b5-7db5-4958-9c6a-ca437b809e52 | arya4868/DSA | CodeHelp-DSA-Busted-Series-main/Lecture044 Linked List Day1/circularLinkedList.cpp | #include<iostream>
#include<map>
using namespace std;
class Node {
public:
int data;
Node* next;
//constrcutor
Node(int d) {
this->data = d;
this->next = NULL;
}
~Node() {
int value = this->data;
if(this->next != NULL) {
delete next;
... | ALGO | 0.999816 | 5.129316 |
74e71d60-ab3f-4fb2-b7ce-ea4d79d84d21 | NaveenVaratharaj/Problem_Solving | Patterns/8.cpp | // 5 4 3 2 1
// 5 4 3 2
// 5 4 3
// 5 4
// 5
#include <iostream>
using namespace std;
int main(){
int n = 5;
int val = n+1;
for(int i=1; i<=5; i++)
{
for(int j=5; j>=i; j--)
{
cout<<val-j<<" ";
}
cout<<endl;
}
} | ALGO | 0.999978 | 3.547728 |
10d5d008-10f2-4eab-9614-e17781ea61de | raincross7/code-similarity | codes/train_code/problem076/problem076_433.cpp | // ABC166C.cpp
#include <iostream>
#include <vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
vector<bool>tower(n,true); // 良い展望台か
vector<ll>h(n); // 高さ
rep(i, n) cin >> h[i];
int a, b;
... | ALGO | 0.999961 | 4.005682 |
2d97c466-2bf3-4c98-a6e2-bb13b3da75cf | ishandutta2007/codeforces | vkgainz/normal/1635/F.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <array>
#include <set>
using namespace std;
struct seg_tree {
vector<long long> seg;
int sz;
void init(int n) {
sz = 1;
while (sz < n) sz *= 2;
seg.resize(2 * sz, 4e18);
}... | ALGO | 0.99999 | 4.082905 |
75b30830-518a-4b80-ac18-cf3919b6a60c | bbsjz/leetcode | lc84.cpp | #include<vector>
#include<iostream>
using namespace std;
int largestRectangleArea(vector<int>& heights) {
vector<int> stack;
heights.push_back(-1);
int maxarea=0;
for(int i=0;i<heights.size();i++)
{
if(stack.empty()||heights[stack.back()]<=heights[i])
stack.push_back(i);
... | ALGO | 0.999846 | 5.651537 |
37a13fdd-8d92-48ed-ae8d-9105d6d4941e | hassanrajon/vs | codeforces/Trailing_Zeros.cpp | #include <bits/stdc++.h>
using namespace std;
#define nl cout << "\n";
#define yes cout << "YES\n";
#define no cout << "NO\n";
#define pb push_back
#define pp pop_back
#define ll long long int
#define l long int
const int mod = 1000000007;
//===========================================================
void feel_the_worl... | ALGO | 0.999605 | 3.871338 |
b95228ed-b543-421c-a163-4bff59b5dfdf | s0urav6529/Codeforces-Solutions | 1300A CF.cpp | #include<iostream>
#include<stdio.h>
using namespace std;
int ara[1001];
int main()
{
int tc,n,sum=0,product=1,cnt=0;
cin>>tc;
while(tc--)
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>ara[i];
if(ara[i]==0)
{
ara[i]+=1;
... | ALGO | 0.999682 | 3.558685 |
65e76f04-3a15-45b7-a98e-f384b989fbd2 | sungho2578/Computational-Geometry | Lab/CS133_Lab7_sahn025.cpp | /*
UCR Spring 2019
CS 133 Lab 7 - Line Simplification
Sungho Ahn, 862026328
*/
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
typedef pair<double, double> Point;
typedef vector<Point> Polyline;
// Calculate distance between a point and a line
double Distance(Point &p1, Point ... | ALGO | 0.999857 | 5.545579 |
5d44683a-a93a-4595-9d88-36b569acf60b | ishandutta2007/codeforces | zbsnb/normal/1304/A.cpp | #include<iostream>
using namespace std;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main(){
ios::sync_with_stdio(0);cin.tie(0);
int t;cin>>t;
while(t--){
int x,y,a,b;cin>>x>>y>>a>>b;
if((y-x)%(a+b)==0){
cout<<(y-x)/(a+b)<<endl;
}
else cout<<"-1"<<endl;
}
... | ALGO | 0.999819 | 3.666757 |
d28c9174-842f-429b-8321-13d71b6bf475 | DiyaBhuva/LeetCode_Problems | isValidSudoku.cpp | class Solution {
public:
bool isValidSudoku(vector<vector<char>>& board) {
unordered_set<string> seen;
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
char num = board[i][j];
if (num == '.') continue;
... | ALGO | 0.999595 | 7.008042 |
d2a9e7bd-36dd-4355-8988-4f7b02a6b9ad | prashantrajch/C-Data-Structure-and-Algorithm- | Day 7/pattern15.cpp | #include<iostream>
using namespace std;
int main(){
int num;
cout<<"Enter a number:- ";
cin>>num;
int row = 1;
while(row <= num){
char ch = 'A' + row - 1;
int col = 1;
while(col <= row){
cout<<ch<<" ";
col = col + 1;
}
cout<<endl;
... | ALGO | 0.996165 | 3.528641 |
1aaee21f-065f-43bd-a6e9-a8b54937c8eb | lmunier/compet_sti | LED_tracking/tracking.cpp | //Module: tracking.h
//version: 1.0
//Update: 15.05.2018
//Responsability: Munier Louis
/*Description :
* Management of the camera who tracks the corner LED to throw the bottle in right place.
*/
#include "tracking.h"
// Initialize pins stepper
CheapStepper init_stepper(int& init_step){
Chea... | TOOL | 0.997163 | 3.773328 |
38542b8c-f732-45f7-a399-d1ccee59320f | ZondCoin/Zond | src/chain.cpp | #include "chain.h"
using namespace std;
/**
* CChain implementation
*/
void CChain::SetTip(CBlockIndex* pindex)
{
if (pindex == NULL) {
vChain.clear();
return;
}
vChain.resize(pindex->nHeight + 1);
while (pindex && vChain[pindex->nHeight] != pindex) {
vChain[pindex->nHeight] ... | ALGO | 0.997434 | 5.527294 |
8ea864f9-484f-4b07-af8e-d2d589452280 | chandranshubhardwaj0907/DAA_assignmentss | DAA/lab assignment 1/q7.cpp | #include <iostream>
#include <climits>
using namespace std;
int maxSubArraySum(int arr[], int size)
{
int max_sum = INT_MIN;
int current_sum = 0;
for (int i = 0; i < size; i++)
{
current_sum = max(arr[i], current_sum + arr[i]);
max_sum = max(max_sum, current_sum);
}
return max_sum;
}
int main()
{
Aarush Pruthi
2CO17
1... | ALGO | 0.999659 | 5.639756 |
4230b575-30d5-4b6c-bda3-19063c1bb9ff | dgalizzi/aedcode | example/apply-map.cpp | // $Id$
/* COMIENZO DE DESCRIPCION
Escribir una funci\'on
{\tt void apply_map(list<int> \&L, map<int,int> \&M, list<int> \&ML)} que,
dada una lista {\tt L} y una correspondencia {\tt M} retorna por
{\tt ML} una lista con los resultados de aplicar {\tt M} a los
elementos de {\tt L}. Si alg\'un elemento... | ALGO | 0.99898 | 4.874307 |
1d9486e3-56bd-4fc3-89b8-94425d713c46 | VidyaBipin/imgui-c--c | addon/Dither/src/dither_errordiff.cpp | #define MODULE_API_EXPORTS
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include "libdither.h"
#include "random.h"
#include "dither_errordiff_data.h"
struct ErrorDiffusionMatrix {
double divisor;
int* buffer; // buffer for flat matrix array
int width;
int height;
... | ALGO | 0.997164 | 5.847143 |
ca702cca-bea5-4c75-ae94-8b39dff6eea7 | TheDwoon/AdventOfCode | AdventOfCode2021/Day02.cpp | #pragma once
#include <string>
#include <iostream>
#include <chrono>
#include <sstream>
#include <iterator>
#include <vector>
#define TITLE "Day 02"
struct command {
std::string command { 0 };
int movement { 0 };
};
std::vector<std::string> tokenize(const std::string &input, const std::string &separator);
ty... | TOOL | 0.921987 | 6.578897 |
0d8b7d9f-0d65-4b9f-a52a-d8517feea577 | all-loop/book-cpp-OOApproach | cap 02 - Basic of C++ programming/booleanTypes.cpp | /******************************************************
* The use of Boolean variables and values *
******************************************************/
#include <iostream>
using namespace std;
int main() {
// Variable definitions
bool x = 123;
bool y = -8;
bool z = 0;
bool t = -0;... | TOOL | 0.863418 | 4.206226 |
2a64a2b1-1d10-4fda-9903-58afef781f64 | shabane/Fibonacci-SEN | cpp/Functional Program/main.cpp | #include<iostream>
using namespace std;
long* seq = new long[100];
void fib(int SeqNum) {
seq[0] = 0;
seq[1] = 1;
for(int i=0; i<=SeqNum; i++) {
seq[i+2] = seq[i] + seq[i+1];
}
}
int main() {
cout << "enter seq: ";
int tmp;
cin >> tmp;
if(tmp >=1 && tmp <= 99) {
fib(t... | ALGO | 0.999904 | 3.668003 |
700391d3-aa43-4e7f-b5c0-49b9823fef0d | wguo32/cs_dsAlgo | Data Structures and Problem Solving Using Cpp 2nd/Shape.cpp |
#ifdef USE_DOT_H
#include <iostream.h>
#else
#include <iostream>
#if !defined( __BORLANDC__ ) || __BORLANDC__ >= 0x0530
using namespace std; // Borland 5.0 has a bug
#endif
#endif
#ifndef SAFE_STL
#include <string>
#include <vector>
using namespace std;
#else
#include ... | ALGO | 0.997474 | 5.966563 |
74d32684-6117-455e-9f70-ff65fe08cac2 | 21omkarsase/DSA | Trees/easy/inorderTraversal.cpp | // 94. Binary Tree Inorder Traversal
// Solved
// Easy
// Topics
// Companies
// Given the root of a binary tree, return the inorder traversal of its nodes' values.
// Example 1:
// Input: root = [1,null,2,3]
// Output: [1,3,2]
// Example 2:
// Input: root = []
// Output: []
// Example 3:
// Input: root = [1]
//... | ALGO | 0.999999 | 6.950098 |
ddd90be3-5c2e-4b2d-92b8-76d4e148afe8 | gyq18/AutonomousDrivingTrajectoryPlanning | Cpp/ConvertPathToTrajectory/PlanSpeedForDynamicScenarios/eigen-3.4.0/doc/examples/tut_arithmetic_redux_basic.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::Matrix2d mat;
mat << 1, 2,
3, 4;
cout << "Here is mat.sum(): " << mat.sum() << endl;
cout << "Here is mat.prod(): " << mat.prod() << endl;
cout << "Here is mat.mean(): " << mat.mean() ... | ALGO | 0.99784 | 3.872858 |
57e4be2e-187a-4643-ae60-8448c1d1bdff | hello-world0421/Algorithm-Code-Repository | code_learning/洛谷/刷题/P4956.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
n /= 364;
for (int i = 100; i >= 1; i--)
if ((n - i) % 3 == 0 && (n - i) / 3 > 0)
{
cout << i << '\n'
<< (n - i) / 3;
return 0;
}
return 0;
} | ALGO | 0.999361 | 3.017726 |
c6923964-ee7c-4442-9749-282240669e77 | OladapoAjala/libraries | Smartcar_shield/src/DistanceSensor.cpp | /* An abstract class to represent a distance sensor, that offers the ability to measure a distance and perform a series of measurements
in order to get the median distance. The median distance algorithm is heavily based on the one from the NewPing library. */
#include "Smartcar.h"
const short DistanceSensor::DEFAULT... | ALGO | 0.964809 | 6.167709 |
8d641937-a480-41cb-a25c-8a4763fea711 | Shailu2004/DSA-Codes | binaryaddition.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
class solution
{
public:
string fun(string s1, string s2)
{
bitset<100> a(s1);
bitset<100> b(s2);
int sum = a.to_ulong() + b.to_ulong();
}
};
int main()
{
solution s1;
cout << s1.fun("11", "1");
} | ALGO | 0.999715 | 4.961656 |
0b03784a-1826-4b3b-8c0c-9aaf355215b4 | tmuttaqueen/MyCodes | Online Judge Code/[Other] Online-Judge-Solutions-master_from github/Live Archive/3929 - Car Plates Competition.cpp | #include <cstdio>
using namespace std;
int val[27];
int to_num(char s[]){
int cont1 = 0,cont2 = 0;
for(int i = 0;i < 7;++i){
if(s[i] >= 'A' && s[i] <= 'Z') ++cont1;
else break;
}
for(int i = 6;i >= 0;--i){
if(s[i] >= '0' && s[i] <= '9') ++cont2;
else break;
... | ALGO | 0.999674 | 3.47342 |
982cffbb-6724-4dcb-84bb-146122eb1e69 | than0112/learning_hub | codewar/8kyu/problem 26/26-1.cpp | #include <iostream>
#include <string>
#include <sstream> // 引入 stringstream，用於輕鬆拆解字串
#include <algorithm> // 引入 min 函式
#include <limits> // 引入 numeric_limits
using namespace std;
/**
* @brief 在一個字串中，找出最短單字的長度。
* @param str 輸入的字串，由一或多個單字組成。
* @return int 最短單字的長度。
*/
int find_short(string str)
{
// --- 演算法... | ALGO | 0.992817 | 6.049688 |
766820fe-19f1-498d-a60b-1bec41d3e43f | Shannju/njucser_helphelp | Algorithm算法/Code/7/.history/1_20220605110018.cpp | #define DEBUG
/*
题目：扑克游戏I
题目描述：
一个月黑风高的夜，有两个高智商犯罪集团，分别称X党和Y党，合伙抢劫了一家赌场，但是在分赃时却出现了分歧，X党老大提议利用赌场里随处可见的扑克牌，和Y党老大玩一局游戏，以决定分赃的比例。
提示0：
游戏规则如下：
① 将赌场里的除了大小王的扑克牌收集起来，随机打乱，明牌摊开在桌子上，排成一行牌组
② X党老大先手，每轮两党老大轮流从牌组的左端或右端连续抽取任意非零数量的牌，直到牌全部抽完为止
③ 最后计算X党老大和Y党老大所抽牌的总分之差D，若D大于0，则X党多拿|D|万元；若D小于0，则Y党多拿|D|万元；若D等于0，则两党各分一半
④ 具体的计分规则如... | ALGO | 0.999951 | 4.046153 |
9b9c5646-a6df-44b3-8c53-8745ed3c0dc8 | liuxueyang/cpp | leetcode/contest/457/b.cpp | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include ... | ALGO | 0.999859 | 5.024805 |
93c6f7d7-679e-4884-bc63-c7940041d065 | thomasxm/Akira-obfuscator | libcxx/test/libcxx/fuzzing/unique.pass.cpp | // UNSUPPORTED: c++03, c++11
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <vector>
#include "fuzz.h"
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t *data, std::size_t size) {
std::vector<std::uint8_t> working(data, data + size);
std::sort(working.begin(), working.end());
... | TEST | 0.975756 | 6.065795 |
59a6f024-0d4a-4a40-905c-0f43295a4a2b | orishaa/ind-prog-menshe-chem-3 | практика 12/class.cpp | #include <iostream>
#include <cmath>
#include "class.h";
using namespace std;
Class_4::Class_4(double _a, double _c)
{
a = _a;
c = _c;
}
void Class_4::show()
{
cout << ": " << a << "x^2 + " << c << " = 0" << endl;
}
void Class_4::Get_answer_podbor()
{
if ((((-1) * c) / a) < 0) cout << " ." << endl;
else {
do... | ALGO | 0.998217 | 3.156441 |
8e519c5b-bb89-4956-a4aa-ab933472f3ed | enochii/leetcode-solution | 863.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
#include <stdlib.h>
#include <vector>
#include <unordered_map>
using namespace std;
struct TreeNode {
int val;
Tre... | ALGO | 0.999994 | 5.832206 |
6bc899c4-783b-4dc9-8ead-934ef66bf232 | HectorTa1989/LeetCode-Cpp | Array/Contains Duplicate III.cpp | /*Given an array of integers, find out whether there are two distinct indices i and j in the array such that
the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k.
Example 1:
Input: nums = [1,2,3,1], k = 3, t = 0
Output: true
Example 3:
Input: num... | ALGO | 0.999932 | 6.002687 |
08483a7f-70d7-4b45-a8e4-b62c72e4b11a | BanSheeGun/Gun | Unusual/FOJ/1795.cpp | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
inline ll qm(ll a, ll n, const ll & p) {
ll ans = 1;
ll tmp = a;
while (n != 0) {
if (n & 1)
ans = ans * tmp % p;
n = n >> 1;
tmp = tmp * tm... | ALGO | 0.999836 | 3.351037 |
4425ee88-5d95-4809-bdb5-a339c2747eef | ndpsssz/CodigosProgramacionBasica | Guia9/Main.cpp | #include <cstdlib>
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int const N = 5; // N es el tamaño máximo del histograma
int const MAXDATOS = 100; // MAXDATOS es el tamaño máximo de la colección;
int i,j,totalDatos,d,f;
int coleccion [MAXDATOS];
int histograma [N];
cout<... | ALGO | 0.961014 | 3.557049 |
36f4241d-6790-44e4-97a4-ee5780eca227 | Laudarisd/Educational-Practice | c_plus/src/simple_problem/raise_number_to_power.cpp | #include <iostream>
#include <stdlib.h>
#include <math.h>
using namespace std;
int main()
{
int base, exponent, result;
cout << "Enter base:";
cin >> base;
cout << "Enter exponent:";
cin >> exponent;
if (exponent == 0)
{
cout << "The result is 1" << endl;
}
else if (exponen... | ALGO | 0.999677 | 4.775859 |
fb220cb9-7180-4217-9b54-c497b69bcbaf | SuyashJoshi179/ProgramsForProblems | codeforces/819/Dafter.cpp | #include <bits/stdc++.h>
#include <random>
#include <fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<double, double> pd;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll... | ALGO | 0.999954 | 5.072743 |
c700f8f7-9404-4a96-b69d-1d99e2d97451 | stbrumme/leetcode | 0073.cpp | class Solution {
public:
void setZeroes(vector<vector<int>>& matrix) {
set<int> clearX, clearY;
for (int x = 0; x < matrix.size(); x++)
for (int y = 0; y < matrix[x].size(); y++)
if (matrix[x][y] == 0)
{
clearX.insert(x);
... | ALGO | 0.998389 | 6.389798 |
d34ed4fc-1a99-4017-b6ba-88078950af97 | divyansh12git/cf | 0contest/e-173/problemB.cpp | // Author: * Divyansh Gupta ( divyansh_8 ) *
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
/*_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ ... | ALGO | 0.99973 | 4.199673 |
11f08780-b4fd-43ea-8f6f-c855a2de01e7 | wuweiFrank/route | Floyd.cpp | #include "StdAfx.h"
#include "Floyd.h"
//㷨
void Floyd(int nsize, float **dist ,int ** prev)
{
for(int i=0;i<nsize;++i)
{
for(int j=0;j<nsize;++j)
{
for(int k=0;k<nsize;++k)
{
if(dist[i][k]+dist[k][j] < dist[i][j])
{
dist[i][j] = dist[i][k] + dist[k][j];
prev[i][j] = k;
}
}
}
}
... | ALGO | 0.999939 | 3.50553 |
2229288b-b67f-47a3-bb2b-3880041a219e | tarunlalchandani/datastructuresLab | queueUsingArray.cpp | #include<bits/stdc++.h>
using namespace std;
//implement queue using array
class Queue {
int arr[1000];
int startInd;
int endInd;
public:
Queue() {
startInd = 1;
endInd = 0;
arr[0] = -1;
}
void push(int ne) {
if(startInd==1000) {
cout<<"Overflow!"<<endl;
return;
}
endInd++;
arr[endInd] = ne... | ALGO | 0.997992 | 4.305989 |
88fe32d7-d6f9-49a1-98bf-d2118a9f7a6a | saojiprasad/CP | Code Forces/B set/B. Substrings Sort.cpp | #include<bits/stdc++.h>
#define ll long long
using namespace std;
bool comparator(string a,string b){
return a.length()<b.length();
}
void solve(){
int n;
cin>>n;
string s[100];
for(int i=0;i<n;i++){
cin>>s[i];
}
sort(s,s+n,comparator);
... | ALGO | 0.999998 | 3.812314 |
07d9e366-591d-474d-a3a8-2e299bc3ffd3 | raincross7/code-similarity | codes/train_code/problem356/problem356_213.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).... | ALGO | 0.999978 | 4.024925 |
efa7ca28-1070-424b-ac64-35e77f04b42c | wissem18/CP-Solutions | CodeForces/402C | Searching for Graph/209658966.cpp | #include "bits/stdc++.h"
using namespace std;
#define ll long long
//#define pi pair<int,int>
#define pll pair<ll,ll>
//double const pi= 3.141592653;
int dx[] = {0, 0, -1, -1, -1, 1, 1, 1};
int dy[] = {-1, 1, 0, -1, 1, -1, 1, 0};
int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0... | ALGO | 0.999707 | 3.881747 |
cd7e70b1-be85-4540-8984-36f251831fa4 | ishandutta2007/codeforces | teapotd/normal/1328/B.cpp | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#ifdef LOC
#include "debuglib.h"
#else
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Pii = pair<int, int>;
#define pb push_back
#define mp make_pair
#de... | ALGO | 0.999906 | 3.5172 |
43f83432-4e56-4a77-91b0-9750db88bb84 | vidja-abhay/Data_Structure_C- | Data_Structure/BINARY SERACH TREE/Kth_SMALLEST_NODE.cpp | #include <bits/stdc++.h>
using namespace std;
class node
{
public:
int data;
node *left;
node *right;
node(int data)
{
this->data = data;
this->left = NULL;
this->right = NULL;
}
};
node *bst(node *root, int x)
{
if (root == NULL)
{
return new node(x);
... | ALGO | 0.99998 | 3.903393 |
7dba04e7-acfd-4100-9310-c1364be447c4 | ishandutta2007/codeforces | heno239/normal/825/F.cpp | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | ALGO | 0.999892 | 3.965072 |
262daf5a-0db4-42d4-98c0-9eb02c2cea02 | Backwit/UsefulCodeDemos | algorithm/string/str.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
/*
* 求模板的next数组
*/
vector<int> NextPos(string str)
{
int len = str.size();
vector<int> next;
if(len == 0){
return next;
}
next.push_back(-1);
int i = 1;
int j = 0;
while(i < len){
if(next[j] == -1 || str[next[j]] == str[i-1]){... | ALGO | 0.999938 | 5.068693 |
42662760-8553-41ab-96b0-2d7482ff9b83 | karush17/DSAA-practice | Part-1/exponent/exponent.cpp | #include <stdio.h>
int pow(int m, int n)
{
if(n==0)
return 1;
if(n%2==0)
return pow(m*m,n/2);
else
return m*pow(m*m,(n-1)/2);
}
int main()
{
int m= 10;
int n = 3;
printf("%d",pow(m,n));
}
| ALGO | 0.999981 | 4.188666 |
e7294e04-6dcb-49e4-9390-5f470a98ca32 | hrushikesht/CompetitiveProgramming | old/cf389/tang.cpp | #include <bits/stdc++.h>
#include <unordered_map>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define i64 long long int
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(in... | ALGO | 0.999979 | 3.42631 |
32268666-91df-488e-99fe-3969e9bf3ff9 | Claudiomancinelli90/CutLocus | libs/libigl/include/igl/copyleft/cgal/lexicographic_triangulation.cpp | #include "lexicographic_triangulation.h"
#include "../../lexicographic_triangulation.h"
#include "orient2D.h"
template<
typename DerivedP,
typename DerivedF
>
IGL_INLINE void igl::copyleft::cgal::lexicographic_triangulation(
const Eigen::PlainObjectBase<DerivedP>& P,
Eigen::PlainObjectBase<DerivedF>& F)
... | ALGO | 0.910342 | 4.140855 |
8b224319-83d8-42ed-b635-2c9cf76b20f9 | LuizaMannes/Competitive_Programming | contests/interna_24-1/b.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
void solve() {
int n,k; cin >> n >> k;
vector<int> ar(3);
int chore=0;
for(int i=0;i<n;i++){
int a;cin >> a;
ar[a%3]++;
chore^=(a%3);
}
if(k==0){
cout << (chore ? "Julia" : "... | ALGO | 0.999987 | 4.942071 |
2c831463-6590-4e47-aa24-9a85b70d2f6d | ministerhuang/MFMamba | monai/csrc/filtering/trainable_joint_bilateral/jbf_layer_cpu_forward.cpp | #include "trainable_joint_bilateral.h"
#include "utils/tensor_description.h"
#include "utils/tensor_indexing.h"
template <typename scalar_t>
void JointBilateralFilterCpuForward_3d(
torch::Tensor inputTensor,
torch::Tensor guidanceTensor,
torch::Tensor outputTensor,
torch::Tensor outputWeightsTensor,
... | ALGO | 0.99799 | 6.822575 |
da44e203-a331-490e-af31-c71a2a4dcf12 | raincross7/code-similarity | codes/train_code/problem450/problem450_91.cpp | /// *** --- ||| In the name of ALLAH ||| --- *** ///
#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;
t... | ALGO | 0.999979 | 4.201235 |
eb4cd8a0-fed4-448b-a6d6-991c41476558 | Levelup25/quellierattigui | src/shared/ai/Score.cpp | #include "Score.h"
#include <iostream>
using namespace std;
using namespace ai;
using namespace engine;
using namespace state;
int Score::getScore() const {
int score = 0;
score += bonusDmgEnnemy;
score -= malusDmgAlly;
score += bonusCloser;
score -= malusPaUsed;
score -= malusPmUsed;
return score;
}
v... | TOOL | 0.910661 | 4.025167 |
fa28bfe7-90b8-43f3-a808-42c58cccf0b0 | Werner7777/C-prime | cpps/1032/Project2/源.cpp | #include<iostream>
#include<vector>
#include<algorithm>
#include "Sales_data.h"
#include<string>
using namespace std;
void compareIsbn(vector<Sales_data>& words) {
sort(words.begin(), words.end(), [](Sales_data& s1, Sales_data& s2) {
return s1.isbn() > s2.isbn(); });
}
int main() {
Sales_data book1("Jojo's bizza... | ALGO | 0.929403 | 4.781588 |
b9cb3d4d-12eb-489c-a3f2-769fc795ebfa | ishandutta2007/codeforces | gary/normal/1348/E.cpp | /*
AuThOr Gwj
*/
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep(a,b) for(int... | ALGO | 0.999951 | 3.117212 |
a5f3484f-7e9f-403e-b29d-e45d02b8cc95 | vsharkovski/Competitive-Programming | Programs/POI/Meteors (met).cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 300010;
int n, m, q;
vector<int> pos[maxn]; // positions this owner owns
ll want[maxn]; // how much this owner wants
int ans[maxn];
int qL[maxn], qR[maxn], qVal[maxn];
int queriesDone;
struct fenwick {
ll tree[maxn];
void ... | ALGO | 0.999998 | 4.317617 |
5e32a141-d627-49b3-8672-27db76a08716 | hasoo4963/codetree-TILs | 240329/두 실수의 곱/the-product-of-two-real-numbers.cpp | #include <iostream>
#include <iomanip>
using namespace std;
int main() {
// 여기에 코드를 작성해주세요.
double a = 5.26;
double b = 8.27;
cout << fixed << setprecision(3) << a*b;
return 0;
} | ALGO | 0.992003 | 3.811069 |
7d8686be-5ce1-4282-b1b6-a1aa69a719f3 | SanDiegoCastilho/Prog-Geral | Code C++/Exercícios/Cap 04/Exercicio_4_34_1.cpp | //San Diego - 24/12/2018 - 14:17.
//Exercício 4.34
#include <iostream>
using namespace std;
int main(){
int Message, Dig_1, Dig_2, Dig_3, Dig_4, Dig_5;
int EncryptedMessage = 0;
cout << "Digite a menssage: ";
cin >> Message;
//Recupera cada dígito da mensagem separadamente.
Dig_4 = Message % 10;
Message = (M... | ALGO | 0.999279 | 4.700621 |
b3899589-7b47-4d8d-a2c4-ca264f0d5301 | MYXHcode/Sword-Finger-Offer-Learning-Code | 剑指Offer：名企面试官精讲典型编程题 编程练习/CodingInterviewChinese2-master/56_02_NumberAppearingOnce/NumberAppearingOnce.cpp | //==================================================================
// ָOfferԹپͱ⡷
// ߣκ
//==================================================================
// 56Ψһֻһε
// Ŀһгһֻһ֮⣬ֶΡ
// ҳǸԳһε֡
#include <cstdio>
#include <exception>
int FindNumberAppearingOnce(int numbers[], int length)
{
if(numbers == nullptr ||... | ALGO | 0.998682 | 4.819736 |
e85e0a07-3f54-4508-836a-9f0095a14750 | PawanKmr470/DSA_Practice_Set | DSA_CPP/07_Algo/TopoSort_KahnAlgo_DFS3.cpp | #include <iostream>
#include <vector>
#include <stack>
using namespace std;
// Exactly same as TopoSort_KahnAlgo_DFS2.cpp but adjList is directly passed.
class Solution {
void findTopoSort(int node, vector<int> &vis, stack<int>& st, vector<int> adj[]) {
vis[node] = 1;
for (auto &i: adj[node]) {
if (!... | ALGO | 0.999996 | 6.086869 |
1e14785a-84e6-4c34-bd96-2f14ff49a96e | nt92/COP3503ClassCode | QuadraticEquation/QuadraticEquation.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
cout << "Enter a, b, c: ";
double a, b, c;
cin >> a;
cin >> b;
cin >> c;
double discrim = b * b - 4 * a * c;
if(discrim < 0)
{
cout << "The equation has no real roots";
}
else if(discrim > 0)
{
double r1 = (-b + sqrt(discrim)) ... | ALGO | 0.997855 | 3.952084 |
3e1422e8-0fa9-442c-8387-8cfd9ee79370 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_5973_0.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, last = 0, need = 0, first = 0, second = 0, ok;
cin >> t;
string s, ans[105];
for (; t--; t > 0) {
cin >> s;
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == ':') need++;
if (s[i] == ':' && s[i + 1] == ':') {
... | ALGO | 0.99249 | 3.609988 |
0cf3b385-a383-4cf9-b36a-8f353fe3c3b1 | l3vi-7/Programming | Coursera/Data Structures/week2_priority_queues_and_disjoint_sets/2_job_queue/job_queue.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using std::vector;
using std::cin;
using std::cout;
class JobQueue {
private:
int num_workers_;
vector<int> jobs_;
vector<int> assigned_workers_;
vector<long long> start_times_;
void WriteResponse() const {
for (int i = 0; i < jobs_.size(); +... | ALGO | 0.999953 | 4.393117 |
8376fa17-769a-4ab5-936f-3d86a2175f04 | jangseop-park/CAPRI-Net | PyMesh/third_party/cgal/Periodic_3_mesh_3/examples/Periodic_3_mesh_3/mesh_implicit_multi_domain.cpp | #include <CGAL/Periodic_3_mesh_3/config.h>
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/make_periodic_3_mesh_3.h>
#include <CGAL/Periodic_3_mesh_3/IO/File_medit.h>
#include <CGAL/Periodic_3_mesh_triangulation_3.h>
#include <CGAL/Periodic_3_function_wrapper.h>
#include <CGAL/Implicit... | ALGO | 0.98613 | 6.642868 |
665b2c94-3e3b-484c-9181-3fbabb336c89 | paulshovon94/Spinner_game_Cocos2d_js | frameworks/cocos2d-x/cocos/math/Quaternion.cpp | #include "math/Quaternion.h"
#include <cmath>
#include "base/ccMacros.h"
NS_CC_MATH_BEGIN
const Quaternion Quaternion::ZERO(0.0f, 0.0f, 0.0f, 0.0f);
Quaternion::Quaternion()
: x(0.0f), y(0.0f), z(0.0f), w(1.0f)
{
}
Quaternion::Quaternion(float xx, float yy, float zz, float ww)
: x(xx), y(yy), z(zz), w(ww)
... | ALGO | 0.962827 | 7.46275 |
258a0a04-7202-4b55-bc66-c8da8904d986 | Anantiz/42_Webserv | src/cluster/cluster.cpp | #include "cluster.hpp"
bool Cluster::_run = true;
Cluster::Cluster(const char *config_file_path) {
/// Parse the config file
// [...]
/*
Parser job:
For each `Server` add it to the '_servers' vector --> To have all the servers in one place
For each port, add it to the '_ports' vector --> To Open a listen ... | WEB | 0.960845 | 4.663857 |
26220d1f-acf1-4191-bbbd-76130d1147cc | tranduc2601/RL_C | RL_BTC_Portal/ss14/BT6.cpp | #include <stdio.h>
#include <string.h>
int main() {
char chuoi[] = "Rikkei Academy!";
int dem = 0;
for (int i = 0; i < strlen(chuoi); i++) {
if ((chuoi[i] >= 'A' && chuoi[i] <= 'Z') || (chuoi[i] >= 'a' && chuoi[i] <= 'z')) {
dem++;
}
}
printf("So ky tu la chu cai trong... | ALGO | 0.989009 | 3.757043 |
f6c63c9a-56bf-471e-aea5-6a5483ed11b3 | harshdeep91/Leetcode | Word Wrap - GFG/word-wrap.cpp | // { Driver Code Starts
//Initial Template for C++
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function Template for C++
class Solution {
public:
int solveWordWrap(vector<int>nums, int k)
{
int n=nums.size();
int dp[n];
int sum=0;
dp[n-1]=0;
... | ALGO | 0.999825 | 5.707268 |
9aa3e559-416d-4454-9118-39a46fdb5a99 | cmiyachi/CygWinAlgorithms | codesignal c++/classifyStrings.cpp | /** function classifyStrings(s) {
if (s.match(/[aeiou]{3}/)) return 'bad';
if (s.match(/[^aeiou?]{5}/)) return 'bad';
if (s.match(/\?/)) {
let a = classifyStrings(s.replace(/\?/, 'a'));
let b = classifyStrings(s.replace(/\?/, 'b'));
if (a == b) return a;
return 'mixed';
... | ALGO | 0.998115 | 4.128098 |
07e980e0-bdb5-4887-89be-677545c6dd31 | Altu-Bitu/Altu-Bitu-minji | [Number Theory] 0917/assignments/9613.cpp | //
// Created by Kang Minji on 2021-09-23.
//
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b){
if (b == 0){
return a;
}
return gcd(b, a%b);
}
int main(){
int t, n, num;
cin >> t;
while(t--){
cin >> n;
vector<int> v;
// 벡터에 숫자 ... | ALGO | 0.999897 | 5.588027 |
90565f4e-1727-41ba-a36e-9e8163be2d6a | muto-sota/Mystudy | miniz.cpp | #include "stdafx.h"
typedef unsigned char mz_validate_uint16[sizeof(mz_uint16) == 2 ? 1 : -1];
typedef unsigned char mz_validate_uint32[sizeof(mz_uint32) == 4 ? 1 : -1];
typedef unsigned char mz_validate_uint64[sizeof(mz_uint64) == 8 ? 1 : -1];
#ifdef __cplusplus
extern "C" {
#endif
/* ------------------- zlib-style... | TOOL | 0.921492 | 6.71598 |
7a617f28-56a2-41be-8caa-1b8e794418fe | abhiram2600/hackerearth | mod.cpp | #include<bits/stdc++.h>
#define endl "\n"
#define f(n) for(int i=0;i<int(n);i++)
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,m;
cin>>n>>m;
if(m%n==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
}
| ALGO | 0.999887 | 4.509518 |
6bfaa06a-68e2-4a92-bb44-777754916a10 | WebKraken/Game | Game/boost_1_63_0/libs/multiprecision/performance/linpack-benchmark.cpp | /* 1000d.f -- translated by f2c (version 20050501).
You must link the resulting object file with libf2c:
on Microsoft Windows system, link with libf2c.lib;
on Linux or Unix systems, link with .../path/to/libf2c.a -lm
or, if you install libf2c.a in a standard place, with -lf2c -lm
-- in that order, at the end of the com... | ALGO | 0.995643 | 5.292179 |
845eea50-58b9-4e84-9a57-d518dd13370d | toykam/flutter_starter | 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 |
bd75e8ce-a3f3-43cc-94dd-ebdc5c3556e4 | LifelongLearner-HEND/Data-Structures | Single Linked List/main.cpp | #include <iostream>
#include <algorithm>
using namespace std;
// comment
template<class T>
class Node {
public:
T data;
Node *next;
};
// comment
template<class T>
class SLL {
public:
Node<T> *head, *tail;
int Size;
SLL() {
head = tail = nullptr;
Size = 0;
}
bool isEmpty()... | ALGO | 0.996098 | 4.477904 |
9105b1fa-0774-4bca-bf56-0587cb9eb665 | gwynbleidd415/CodingNinjas | min-heap/solution.cpp | #include <bits/stdc++.h>
class MinHeap {
private:
vector<int> arr;
public:
MinHeap(): arr{0} {}
void insert(int num) {
arr.push_back(num);
int n = arr.size()-1, par{n>>1};
while(par>0 && arr[par] > arr[n]) {
swap(arr[par], arr[n]);
n = par, par = n>>1;
... | ALGO | 0.999982 | 5.148428 |
9ea5403a-9734-41e7-8d62-58598c10127d | abdulalimswe/Competitive-Programming | leetCode/1502.cpp | class Solution {
public:
bool canMakeArithmeticProgression(vector<int>& arr) {
sort(arr.begin(),arr.end());
set<int>s;
for(int i=1; i<arr.size(); i++){
int n = arr[i] - arr[i-1];
s.insert(n);
}
if(s.size() == 1){
return true;
... | ALGO | 0.999944 | 5.580337 |
2210a4d7-d27a-4ff1-979e-575c171b7fe5 | riddhimitra17/Open-source | Optimized Bubble Sort/Optimized_Bubble_Sort.cpp | #include <iostream>
using namespace std;
void optimizedbubbleSort(int arr[])
{
int rounds=0;
for(int i=0; i<5; i++)
{
rounds++;
int flag = false;
for(int j=0; j<5-i-1; j++)
{
if(arr[j]>arr[j+1])
{
flag = true;
int temp... | ALGO | 0.999871 | 3.695103 |
f66c4c0a-3134-4a10-8282-7a1d92e80f03 | pacxx/pacxx-llvm | tools/dsymutil/BinaryHolder.cpp | #include "BinaryHolder.h"
#include "llvm/Object/MachO.h"
#include "llvm/Support/raw_ostream.h"
namespace llvm {
namespace dsymutil {
static std::vector<MemoryBufferRef>
getMachOFatMemoryBuffers(StringRef Filename, MemoryBuffer &Mem,
object::MachOUniversalBinary &Fat) {
std::vector<MemoryBuf... | TOOL | 0.869224 | 7.151862 |
e0cb811e-50ba-4316-aa38-1c528293d5d8 | Brijesh03032001/MyDSAPersonal | Graphs/DetectCycle/BFS_unidrected_detect_cycle.cpp | #include <bits/stdc++.h>
using namespace std;
//Using Queue of Pair {node, parent_of_node}
class Solution {
public:
bool isCycleBFS(vector<int> g[], int V, int start, vector<bool>& visited) {
queue<pair<int, int>> que;
que.push({start, -1});
visited[start] = true;
while(!que.empty... | ALGO | 0.999785 | 5.871271 |
5403a212-fb5e-4335-ac77-8b81f514bdfe | SergioMenaQuispe/LABCC2 | lab19/ejercicio2.cpp | #include<iostream>
#include<vector>
using namespace std;
class Find{
public:
int operator()(float & begin, float & end, float ser) const {
float * pBegin = &begin;
float * pEnd = &end;
int count = 0;
float * aux = pBegin;
while (aux != pEnd){
if(*aux ==... | ALGO | 0.997486 | 4.068339 |
d10b2583-1e01-4b67-8625-838aeb632190 | ChandraMohan-Sah/Practice-CPP | Practice/Basic Question/10_Maximum_of_N_numbers.cpp | //Maximum of N numbers ( Eg. N=4 ; 12 -3 4 67 ;-->max is 67)
#include<iostream>
#include<climits> //to get least or max value of buckets
using namespace std;
int main()
{
int i=0;
int n;
cin>>n; //How many number to take input
int num;
int largest = INT_MIN; //INT_MIN = -2^31 and INT_MAX =... | ALGO | 0.999658 | 4.131918 |
f4777e92-2fe0-4d00-a6d1-61d97e162ae8 | gnorasi/gnorasi | Gnorasi/ext/tgt/spline.cpp | #include "tgt/spline.h"
#include "tgt/assert.h"
#include <algorithm>
namespace tgt {
Spline::Spline(const std::vector<vec3>& points /*= std::vector<vec3>()*/, float t /*= .5f*/, int stepCount /*= 100*/)
: Curve(stepCount, Bounds(), true, true)
, controlPoints_(points)
, tau_(t)
{}
/*
The points that... | ALGO | 0.998603 | 7.042383 |
52695073-c521-404d-abd6-628aa66bc757 | BeWithGanesh/Data-Structures-and-Algorithms | Graph/DFS.cpp | // Coded by Ganesh Prasad
#include<bits/stdc++.h>
using namespace std;
void addEdge(vector<int> adj[],int u,int v){
adj[u].push_back(v);
adj[v].push_back(u);
}
void dfs(int node,vector<int> &vis,vector<int> adj[]){
cout<<node<<" ";
vis[node] = 1;
for(auto x:adj[node]){
if(!vis[x])
dfs(x,vis,adj)... | ALGO | 0.999989 | 5.092169 |
2a65481a-21b0-4c70-8b6a-c6c8497aa612 | kodecocodes/flta-materials | 11-serialization-with-json/projects/starter/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.998532 | 6.763549 |
a88e4d78-9f6f-4460-a6ff-e44832caaad9 | SimoneCrt/Esercitazione_4_C_Array | Exercise2/main.cpp | #include "Utils.hpp"
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
string inputFile = "data.txt";
string outputFile = "result.txt";
//dimensione vettore e inizializzazione dei vettori
size_t n;
double* w = nullptr;
double* r = nullptr;
// Importo i dati
if (... | ALGO | 0.991988 | 4.993113 |
32100bdb-7820-408c-bda6-f96957f227dc | ConanMohamed/basketBall_score_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.9988 | 6.76073 |
f22c51ec-771e-44fb-bfe7-ac1ed3290562 | trietgaming/personal-CP-trainning-memories | ChonHSGTienGiang/DESERT.cpp | #include <bits/stdc++.h>
using namespace std;
#define MAXN 200000
int n;
int arr[MAXN];
bool cmp(int a, int b) {
return a < b;
}
int main() {
ifstream inp("DESERT.inp");
inp >> n;
for (int i = 0; i < n; ++i) {
inp >> arr[i];
}
inp.close();
int posBottles = 0;
int health = 0;
int res = 0;
... | ALGO | 0.99995 | 4.308498 |
1bbdc6a9-0c46-433b-b0fa-19bd2a19e47d | mud-ali/competitive-prog | mixing-milk/main.cpp | #include <iostream>
#include <string>
#include <vector>
#include <fstream>
using namespace std;
void transfer(int* m1, int* m2, int* c1, int* c2) {
int old = *m2;
*m2 = min(*m1+*m2, *c2);
*m1 -= *m2 - old;
}
int main() {
ifstream inp("mixmilk.in");
int c1,m1,c2,m2,c3,m3;
inp >> c1 >> m1 >> c2... | ALGO | 0.999702 | 3.168846 |
0ae812b8-53af-4dc8-8223-17b5621e5975 | fasher7/HackerRank | CompareTheTriplets.cpp | #include <iostream>
using namespace std;
int* compareTriplets(int a[], int size1, int b[], int size2)
{
int* finalscore = new int[2];
int score1 = 0;
int score2 = 0;
for (int x = 0; x < 3; ++x)
{
if (a[x] > b[x])
{
score1++;
}
else if (a[x] < b[x])
... | ALGO | 0.999963 | 4.515552 |
32c5db93-7204-4d49-bd0e-f90c0c149726 | ishandutta2007/codeforces | neal/normal/1237/C1.cpp | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<vector<int>> points;
int solve(int dimension, int start, int end) {
if (end - start == 1)
return start;
assert(dimension < 3);
vector<int> unpaired;
for (int i = start, j = start;... | ALGO | 0.999935 | 4.420285 |
0e4f96ea-cf22-4389-9e5a-63189d7ee65b | AlexRa/Kirstens-clone | S20/indra/llmessage/patch_idct.cpp | /**
* @file patch_idct.cpp
* @brief IDCT patch.
*
* $LicenseInfo:firstyear=2000&license=viewergpl$
*
* Copyright (c) 2000-2010, Linden Research, Inc.
*
* Second Life Viewer Source Code
* The source code in this file ("Source Code") is provided by Linden Lab
* to you under the terms of the GNU General Publi... | ALGO | 0.982822 | 4.452384 |
1ad10b2c-6d4d-4c17-9f48-56b643cd7c93 | Gongsta/competitive-programming | codeforces/977div2/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.995555 | 3.471726 |
6f92dfaa-a5b4-4f06-836a-e57e6bcca284 | Katwell/ElegansGermline | src/boundary_condition/LeaderCellBoundaryCondition.cpp | #include "LeaderCellBoundaryCondition.hpp"
#include "NodeBasedCellPopulation.hpp"
#include "GlobalParameterStruct.hpp"
//Constructor
template<unsigned DIM>
LeaderCellBoundaryCondition<DIM>::LeaderCellBoundaryCondition(AbstractCellPopulation<DIM>* pCellPopulation,
boost::shared_ptr< DTCMovementModel<DIM> > pLeaderCel... | ALGO | 0.995723 | 6.795734 |
1db3a360-bdd7-41b0-a530-0175d9370894 | Kari937/laba-9 | 4/4.cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
setlocale(0, "");
const int N = 14;
char vowel[N] = { 'A', 'a', 'E', 'e', 'I', 'i', 'J', 'j', 'O', 'o', 'U', 'u', 'Y', 'y' };
string str;
int k;
cout << "Введите строку из латинских букв):" << endl;
getline(cin, str);
k = 0;
for (int i = 0... | ALGO | 0.998443 | 4.524505 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.