uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
3f62dabd-2f23-45dd-8c0d-fe0d3a427580 | alexchao2012/Leetcode | 双指针-3 Sum.cpp | #include"head.h"
vector<vector<int> > threeSum(vector<int> &num){
vector<vector<int> > res;
if(num.size()<3)
return res;
sort(num.begin(),num.end());
int i,j,k;
vector<int> temp(3);
for(i=0;i<num.size()-2;i++){
k=i+1;
j=num.size()-1;
while(k<j){
int sum=num[i]+num[k]+num[j];
if(sum==0){
temp[0... | ALGO | 0.999591 | 4.442934 |
6ffd7deb-7a4c-46f0-ae78-1b6c0b9a2d92 | gorden5566/asuswrt-ac1200hp | release/src/lzma/CPP/7zip/Compress/RangeCoder/RangeCoderBit.cpp | // Compress/RangeCoder/RangeCoderBit.cpp
#include "StdAfx.h"
#include "RangeCoderBit.h"
namespace NCompress {
namespace NRangeCoder {
UInt32 CPriceTables::ProbPrices[kBitModelTotal >> kNumMoveReducingBits];
static CPriceTables g_PriceTables;
CPriceTables::CPriceTables() { Init(); }
void CPriceTables::Init()
{
c... | ALGO | 0.992492 | 5.476203 |
c9f1d272-c386-4d19-bea3-41c26e748d6c | raincross7/code-similarity | codes/train_code/problem023/problem023_434.cpp | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | ALGO | 0.999976 | 4.497389 |
d375d7b4-b9b7-4cc6-b7f9-07730b36a41f | JorgeDJ0/FirstYearIslanderConference | Discipline.cpp | #include <iostream>
#include <string>
#include <vector>
#include "Discipline.h"
using namespace std;
void Discipline::getKeyWords() const
{
for (int i = 0; i < keyWords.size(); i++)
cout << keyWords[i] << " ";
}
bool Discipline::searchKeyWords(string s)
{
for (int i = 0; i < keyWords.size(); i++)
... | TOOL | 0.93889 | 3.383799 |
af6f4fbe-1f57-4858-8f22-22fc7e116e60 | nikitaaa23/LeetCode-Solutions | merge-intervals/merge-intervals.cpp | class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
sort(intervals.begin(), intervals.end());
vector<vector<int>>v;
v.push_back(intervals[0]);
for(int i = 1; i<intervals.size(); i++){
if(intervals[i][0]<=v.back()[1])
... | ALGO | 0.999998 | 5.990907 |
d251ce10-d3bc-4e82-aa2e-1536f963ca39 | nvtu/CompetitiveProgrammingLog | Codeforces/Div2Round782/A.cpp | #include <bits/stdc++.h>
using namespace std;
int T, N, R, B;
int main() {
// freopen("input.txt", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> T;
while (T--) {
cin >> N >> R >> B;
int div = R / (B+1), rem = R % (B+1);
string ans = "";
for (int... | ALGO | 0.999448 | 3.972315 |
704dbe3c-1914-4728-a564-dc9ea2588c75 | galder-game-jam/galder-game-jam-2022 | external_libs/box2d/src/collision/b2_collide_edge.cpp | #include "box2d/b2_collision.h"
#include "box2d/b2_circle_shape.h"
#include "box2d/b2_edge_shape.h"
#include "box2d/b2_polygon_shape.h"
// Compute contact points for edge versus circle.
// This accounts for edge connectivity.
void b2CollideEdgeAndCircle(b2Manifold* manifold,
const b2EdgeShape* edgeA, const b2Tr... | ALGO | 0.999671 | 7.652112 |
5572e0e9-c20a-431a-a0d7-1d1e21d264c9 | arnab7070/BeyondCoding | C++ Programs/DSA Concepts/duplicate_element.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int arr[5] = {8,5,9,8,7};
bool flag = false;
sort(arr, arr+5);
for (int i = 0; i < 4; i++)
{
if(arr[i]==arr[i+1]){
cout<<arr[i];
flag = true;
break;
}
}
if(flag==false)
{
cout<<"No Dupl... | ALGO | 0.999864 | 3.378118 |
4209197d-37ce-42f5-a43c-0b1ef4221665 | iamndnt/Admin_IPA | 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 |
55caf628-7eaa-4ece-a7e4-b6d19ee4638d | Iam5B/2017-DataStructureAlgorithm | CCCC-GPLT/L2-005.cpp | #include<iostream>
#include<algorithm>
#include<iomanip>
using namespace std;
int arr[50][10000];
int len[50];
typedef struct{
int dat;
int frm;
}N;
int func(N a,N b){
return a.dat<b.dat;
}
void sql(int a,int b){
N tarr[20000];
int tlen=len[a]+len[b];
int lena=len[a];
int i;
int j;
... | ALGO | 0.998972 | 3.762201 |
c4bee3f6-d9ee-4aeb-b50c-4b7c2adc5f3e | Krishnarjunj/Striver-Notes | DP/Partition_Subsets.cpp | class Solution {
public:
bool findans(int ind, int sum, vector<int>& nums, vector<vector<int>>& dp){
if(sum == 0) return true;
if(ind == 0){
if(nums[ind]==sum) return true;
return false;
}
if(dp[ind][sum]!=-1) return dp[ind][sum];
//take
boo... | ALGO | 0.999981 | 5.401389 |
766e59f3-f527-4b04-b85e-11b74500df77 | LoveWX/kickstart | 2019RoundB/c.cpp | #include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <climits>
using namespace std;
const int SIZE = 100000;
int N, S;
int A[SIZE];
int score[SIZE];
struct SegmentTreeMax
{
int n;
vector<int> maxv, tags;
SegmentTreeMax(int size)
{
n = size;
maxv.... | ALGO | 0.999935 | 3.851944 |
8d51ac1b-5eef-40c4-9ac7-e0cebf78ea24 | Ishwarendra/CompetitiveProgramming | CodeForces/GNU C++20 (64)/1249C2 _ Good Numbers (hard version)/1249C2.cpp | #include <bits/stdc++.h>
#ifdef LOCAL
#include "F:\CPP\Debug\debug.h"
#else
#define print(...) 1;
#endif
using i64 = long long;
void solve()
{
i64 n;
std::cin >> n;
auto get = [&](i64 n)
{
std::vector<int> digits(60);
for (int i = 0; i < 60; i++)
{
digits[i] = n %... | ALGO | 0.999404 | 4.816518 |
47d39c7f-1c03-4a56-b26a-4aa6a55ae7e7 | kaiuki2000/Computational-Physics | Treinos random/Vector test/Vectortest.cpp | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int v[] = {1, 2, 3, 4, 5};
vector<int> vec(v, v + 5);
for (auto i = vec.begin(); i != vec.end(); i++) //'auto' neste caso é algo do genéro: std::vector<int>::interator
cout << "v[" << i - vec.begin() << "]= " << *i << endl;
... | ALGO | 0.946398 | 3.664053 |
0d0e11b3-276c-4053-a2bb-f5c1ef6d597a | Rishideep08/Leetcode | 0557-reverse-words-in-a-string-iii/0557-reverse-words-in-a-string-iii.cpp | class Solution {
public:
string reverseWords(string str) {
stringstream ss(str);
string word;
string ans = "";
while(getline(ss,word,' ')){
reverse(word.begin(),word.end());
ans = ans + word;
ans = ans + " ";
}
return ans.substr(0,a... | ALGO | 0.999982 | 6.27704 |
c173bdc2-ca20-481d-8d89-db061b54d5e5 | alexandraback/datacollection | solutions_1485490_0/C++/juwon/c.cpp | #include <cstdio>
#include <algorithm>
using namespace std;
int n, m;
long long a[101], b[101];
int A[101], B[101];
long long d[101][101];
int main() {
int r, cs = 0;
scanf("%d", &r);
while (r--) {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%lld %d", &a[i], &A[i]);
}
for (int i = 1; i... | ALGO | 0.99992 | 3.562922 |
35f5c6ee-4741-4430-b690-150b2239ab53 | CryptVenture/BitMoneyV2 | src/denomination_functions.cpp | /**
* @file denominations_functions.cpp
*
* @brief Denomination functions for the Zerocoin library.
*
* @copyright Copyright 2017 PIVX Developers
* @license This project is released under the MIT license.
**/
#include "denomination_functions.h"
using namespace libzerocoin;
// ------------------... | ALGO | 0.98384 | 7.204152 |
0b660db1-ec26-42d8-8527-86c9c2964c2c | taikido/leetcode | 77-combinations/solution1.cpp | class Solution {
public:
vector<vector<int> > combine(int n, int k) {
set<vector<int> > set_result;
vector<int> num;
for(int i=1; i<=n; i++) num.push_back(i);
perm( num, 0, k, set_result);
vector<vector<int> > result;
set<vector<int> >::iterator it;
for... | ALGO | 0.999985 | 5.619468 |
18e4d9fc-2689-4109-b168-8848766979d4 | yadavanshu/Coding | C++/LinkedList/linkedlist.cpp | #include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
struct Node *next;
Node(int x){
data = x;
next = NULL;
}
};
class Solution
{
public:
Node *insertAtBegining(Node *head, int x)
{
if(head == NULL){
head = new Node(x);
return he... | ALGO | 0.99985 | 4.391949 |
46974d04-6abe-4921-a9f3-4b2e9ffc7e94 | ishandutta2007/codeforces | mahdi_jfri/normal/606/A.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int a , b , c;
int main()
{
int x1 , x2 , x3;
cin >> x1 >> x2 >> x3;
cin >> a >> b >> c;
ll sum = 0;
if(x1 < a)
sum += (x1 - a);
else
sum += (x1 - a) / 2;
if(x2 < b)
sum += (x2 - b)... | ALGO | 0.999986 | 3.371391 |
e1f2e6e8-908f-47c7-b7c2-5525445ae114 | best2160187/mobile-apps | examples/flutter_view/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.998039 | 6.774826 |
aff3e909-9ef2-435b-b24e-ddfee0c175b4 | chicleee/EDM | deploy/edm_onnx_cpp/demo.cpp | #include <iostream>
#include <string>
#include <opencv2/core.hpp>
#include "edm/edm.h"
using namespace std;
using namespace cv;
typedef unsigned char uchar;
cv::Mat drawKpMatches(const std::vector<cv::KeyPoint> &kepts0,
const std::vector<cv::KeyPoint> &kepts1,
const cv::Ma... | ALGO | 0.949273 | 5.176259 |
6d03e3cb-b886-4db8-be9d-dfd64117301f | ishandutta2007/codeforces | rfpermen/normal/1287/D.cpp | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define ll long long
#define ull unsigned long long
#define rep(i,n,N) for(int i=n;i<=N;++i)
#define rap(i,n,N) for(int i=n;i>=N;--i)
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#def... | ALGO | 0.999998 | 3.409415 |
5463cfc8-3a22-46ee-bc6d-d4ed583b94c8 | avneeshlingwal9/codes | C++/temo/guide4b.cpp | #include <iostream>
using namespace std ;
class Node{
public :
Node* next ;
int data ;
Node(int x){
data = x ;
next = NULL ;
}
};
class stackLinkedList{
public :
Node* head ;
stackLinkedList(){
head = NULL ;
}
void push(int x){
Node* newnode = ... | ALGO | 0.999746 | 4.119634 |
a758b8ef-8869-45ae-9a7c-12efaa43eee1 | HYU-GradProj/pytorch-run-length-impl-cpp | third_party/ComputeLibrary/tests/validation/reference/NonMaximaSuppression.cpp | #include "NonMaximaSuppression.h"
#include "Utils.h"
#include "tests/validation/Helpers.h"
namespace arm_compute
{
namespace test
{
namespace validation
{
namespace reference
{
template <typename T>
SimpleTensor<T> non_maxima_suppression(const SimpleTensor<T> &src, BorderMode border_mode, T constant_border_value)
{
... | ALGO | 0.996675 | 6.826078 |
ada37d06-b115-41e3-b7ad-b75c3afc8f18 | starswap/CompetitiveProgramming | ICPC/UKIEPC/2017/A.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> H(N);
vector<int> R(N);
vector<int> T(N);
for (int n = 0; n < N; ++n) {
cin >> H[n];
cin >> R[n];
cin >> T[n];
}
... | ALGO | 0.999935 | 4.642071 |
f7ab9735-1305-4801-a22e-a94a4bd13306 | Juhikarn123/codechef | INOI1901.cpp | #include <bits/stdc++.h>
using namespace std;
//in-contest submission from back then
//good times
pair<int,int> p[5010]; //length, idx
int q[5010], t[5010];
bool comp (pair<int,int> a, pair<int,int> b){
if (t[a.second] > t[b.second]) return false;
else return true;
}
void sol(){
int N,M;
cin >> N >>... | ALGO | 0.99993 | 3.707814 |
8a1b3f67-c13d-4fbb-859a-3bfdeedd2e3a | sailor-ux/mycodes | leetcode_vscode/sxl/sec9/9_2.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
vector<int> combination;
vector<vector<int>> combinations;
dfs(combination, combinations, 1, n, k);
return combinations;
}
void dfs(vector<int>& com... | ALGO | 0.999965 | 5.783745 |
65b926c9-b162-4311-8203-2dcae6ac3b94 | ElTantawy/mimd_to_simt | SSDE/LLVM/llvm/lib/CodeGen/SelectionDAG/FunctionLoweringInfo.cpp | #include "llvm/CodeGen/FunctionLoweringInfo.h"
#include "llvm/ADT/PostOrderIterator.h"
#include "llvm/CodeGen/Analysis.h"
#include "llvm/CodeGen/MachineFrameInfo.h"
#include "llvm/CodeGen/MachineFunction.h"
#include "llvm/CodeGen/MachineInstrBuilder.h"
#include "llvm/CodeGen/MachineModuleInfo.h"
#include "llvm/CodeGen/... | TOOL | 0.909942 | 4.382802 |
6df7a0e0-9b94-4287-919f-6fe2b358ca34 | Rahulbist009/Lottery_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 |
97382bb8-1eb5-48b1-9698-1d31185e6690 | sebbbin/Boj | 2164.cpp | //카드 2 실버 4
//덱 /자료구조
#include <iostream>
#include <algorithm>
#include <deque>
using namespace std;
int main (){
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int N;
cin >>N;
deque<int> d;
for(int i = 0; i < N; i++){
d.push_back(i+1);
}
while( d.size(... | ALGO | 0.999782 | 3.833416 |
b855b75f-f8aa-4501-bb8b-f2580772e517 | raincross7/code-similarity | codes/train_code/problem078/problem078_288.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
string alphabet="abcdefghijklmnopqrstuvwxyz";
int main() {
string s,t; cin>>s>>t;
vector<int> vs(26,0), vt(26,0);
rep(i,s.size()){
int x;
rep(j,26){
if(s[i]==alphabet[j]){x=j; break;}
}
vs[x]++... | ALGO | 0.999997 | 4.293843 |
d6ce26c4-c417-4239-9753-5be87e15622d | ramansrivastavaa/DSA-Question-With-Code- | findDuplicate.cpp | #include <bits/stdc++.h>
using namespace std;
int finddupli(int arr[] ){
int ans=0;
for (int i = 0; i < 5; i++)
{
ans = ans^arr[i];
}
//its giving the array without the duplicate num
for (int i = 1 ; i < 5; i++)
{
ans = ans^i;
}
return ans;
}
int main(){
... | ALGO | 0.99959 | 3.763601 |
3a5fbb9c-1907-42df-9e17-63f4155bd4f3 | anujjain5699/DSA | dynamic_programming/number_of_balanced_binary_tree_recursion.cpp | /*
Code : No. of balanced BTs using DP
Given an integer h, find the possible number of balanced binary trees of height h. You just need to return the count of possible
binary trees which are balanced.
This number can be huge, so, return output modulus 10^9 + 7.
Write a simple recursive solution
Input Format :
The firs... | ALGO | 0.999998 | 5.666533 |
c0da43f0-081d-4119-9027-af3ee1e31035 | sossont/Algorithm_Study | 알리알리알라셩/수치해석/백준 12015 가장 긴 증가하는 부분 수열.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
vector <int> an;
int num;
an.push_back(0);
for(int i = 0; i<N; i++){
cin >> num;
if(num > an.back())
an.push_back(num);
else{
int idx = lo... | ALGO | 0.999905 | 4.129999 |
889d23a4-a812-4db7-a760-b478ef69bb63 | momagdy13/book_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.998733 | 6.76775 |
2d681564-4c52-4b22-83b0-6e85efd9cebd | Bharathj157/gfg-problems | Difficulty: Medium/Merge two sorted linked lists/merge-two-sorted-linked-lists.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
struct Node {
int data;
struct Node *next;
Node(int x) {
data = x;
next = NULL;
}
};
void printList(struct Node *head) {
struct Node *temp = head;
while (temp != NULL) {
cout << temp->data << ' ';
... | ALGO | 0.999821 | 5.960391 |
606b63e1-572a-4aa4-813c-53cb667bb17e | ishandutta2007/codeforces | posij118/normal/605/B.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, x, y, ptr, ptr2;
cin >> n >> m;
pair<int, int> edg[m];
pair<int, int> mst[n - 1];
pair<int, int> oth[m - n + 1];
int ans[m][2];
ptr = 0;
ptr2 = 0;
for(int i = 0; i<m; i++){
cin >> x >> y;
edg[i] = ... | ALGO | 0.999979 | 3.821732 |
7cb30f31-ab3a-4dd0-9336-29a2541b7fa1 | shivupa/PISCES-1 | src/VectorFFTW.cpp | #include <omp.h>
#include <iostream>
#include "timer.hpp"
#include "VectorFFT.hpp"
/** optimizations
* - reuse FFTW plans and remove allocations per function call
* - use in-place FFT
* - remove temporary arrays and assignments
* - combine y = V*x + ifft(fft(x)*V(g))
* - reuse phi_xk for KE_phi_xk
*/
VectorFFT:... | ALGO | 0.998738 | 5.075532 |
e73500be-de2f-47db-9245-3689f02dc786 | proofrepo/MadboxpcWOW_3.0 | dep/g3dlite/source/Random.cpp | #include "G3D/Random.h"
namespace G3D {
Random& Random::common() {
static Random r;
return r;
}
Random::Random(void* x) : state(NULL), m_threadsafe(false) {
(void)x;
}
Random::Random(uint32 seed, bool threadsafe) : m_threadsafe(threadsafe) {
const uint32 X = 1812433253UL;
state = new uint32[N];... | TOOL | 0.960886 | 5.926675 |
6b839258-50a6-4480-88e4-5c010f66b957 | oioi0210/codetree-TILs | 240111/모두 3의 배수/all-multiples-of-3.cpp | #include <iostream>
using namespace std;
int main() {
int n;
bool satisfied = true;
for (int i = 1; i < 6; i++) {
cin >> n;
if (n% 3!= 0) {
satisfied = false;
}
}
if (satisfied == true) {
cout << 1;
}
else {
cout << 0;
}
return 0;
} | ALGO | 0.999851 | 4.122632 |
95d5619a-9826-465e-bf94-64ce3eca27d4 | hxndg/leetcode | leetcode-524/longest-word-through-deleting.cpp | /*
我们一开始想要的答案是比较最长的能够匹配的，在相同的条件下我们想要的是字母顺序靠前的，
那么就可以先按照单词长度，然后按照字母顺序来进行排序，然后找到一个符合的就可以了，非常好的想法
注释的代码是原本的，等到找到了在比较的方法，而没有注释的代码是正常的，先经过比较排序再直接返回，好很多
*/
#include <iostream>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <limits.h>
#include <string.h>
using namespace std;
b... | ALGO | 0.999942 | 4.053895 |
2c26c010-f84d-47d7-ad0b-fc067e665a56 | rudxkush/leetcode-practice | 207-course-schedule/course-schedule.cpp | class Solution {
public:
bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
unordered_map<int, vector<int>> adjList;
vector<int> inDegree(numCourses, 0);
for(auto neighbour : prerequisites) {
int source = neighbour[1];
int destination = neighbour[0]... | ALGO | 0.999374 | 6.568085 |
4f4cb3a7-82dd-4be4-b209-bd8c9053db19 | TRAN-THUY-NGOC/UPCODER | UPCODER/Other/DemSo0TanCungGiaiThua.cpp | #include <iostream>
using namespace std;
long long numberZeroDigits(long long n) {
long long d = 0;
long long k = 5;
while (k <= n){
d += n / k;
k *= 5;
}
return d;
}
int main() {
long long n;
cin >> n;
cout << numberZeroDigits(n);
return 0;
} | ALGO | 0.999615 | 4.631922 |
94004742-275a-48d0-987c-4339a15b0f80 | harshraj9988/LeetCode-solutions | Leetcode-solution-c-c++/reorderRoutesToMakeAllPathsLeadToTheCityZero.cpp | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
class Solution
{
private:
int dfs(int node, vector<unordered_set<int>> &unidirectional, vector<unordered_set<int>> &bidirectional, vector<bool> &visited)
{
int count = 0;
for (int next : bidirectional[node])
{
... | ALGO | 0.999796 | 5.3832 |
81cead53-5b46-459b-848f-d1593c9c5113 | iamrakesh28/Competitve-Programming | contest/HackerCup/Round 2/a.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int q;
scanf("%d", &q);
for (int i = 0; i < q; ++i) {
int n, m, k, a, b, pos = 0;
int x[2], y[2];
scanf("%d%d%d", &n, &m, &k);
scanf("%d%d", &a, &b);
for (int j = 0; j < k; ++j)
scanf("%d%d", x + j, y + j);
if (k == 1) {
printf("Case #%d... | ALGO | 0.999872 | 3.139926 |
f1a15c28-54f5-4d72-987b-b0ae5d9c13bf | ScaredHD/Code | Algorithm/CLRS/6-heap/heap.cpp | #include "heap.h"
#include <iostream>
int main() {
MaxHeap heap;
heap.load({4, 1, 3, 2, 16, 9, 10, 14, 8, 7});
std::cout << heap.isMaxHeap() << "\n";
heap.buildMaxHeap();
std::cout << heap.isMaxHeap() << "\n";
return 0;
} | ALGO | 0.973167 | 4.723282 |
6d8015f7-40c0-4731-bf42-397ad9f49a25 | illuz/WayToACM | ACM_CODE/HDU/2014_live_anshan/1005.cpp | /*
* Author: illuz <iilluzen[at]gmail.com>
* File: 1005.cpp
* Create Date: 2014-10-22 13:28:48
* Descripton:
*/
#define HDU
// don't forget to change lld to I64d
#ifdef HDU
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <st... | ALGO | 0.999843 | 3.514027 |
c61136be-7c50-4dea-926d-b025c00a88ee | bda-mota/CPP | 09/ex02/src/PmergeMe.deque.cpp | #include "../includes/PmergeMe.hpp"
void PmergeMe::runDeque(int argc, char **argv) {
clock_t start = clock();
fillMainDequeList(argc, argv);
if (!isSorted(_dequeList)) {
std::deque<std::deque<int> > mainSubLists;
std::deque<int> pendingList;
divideDeque(_dequeList, mainSubLists);
separateDequeValues(_deq... | ALGO | 0.996848 | 4.326434 |
c7fc1aea-3e21-4c0a-8d96-a2113c7c8cb0 | HarshitPan/Study-Material | Sem4/Graphics/Codes/dda.cpp | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <GL/glut.h>
// function to draw a circle using DDA algorithm
void drawCircle(int x0, int y0, int radius)
{
float x, y, i;
float angle = 0.0;
glBegin(GL_POINTS);
// calculate x and y coordinates for each point on the circle
for (i =... | ALGO | 0.999381 | 6.394782 |
3b834139-7c3d-4985-b631-0590304e1325 | rustamabdukakhorov/algo_ubtuit_uz | 0040.cpp | //Author: R.U.S.T.E.A.M
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x,y,z;
cin>>x>>y>>z;
if(x>0)
x = x*x;
if(y>0)
y = y*y;
if(z>0)
z = z*z;
cout<<x<<" "<<y<<" "<<z;
return 0;
}
| ALGO | 0.999884 | 3.895617 |
3da8376d-ed05-4c91-8cac-f9a3e9600c8c | ishandutta2007/codeforces | summitwei/normal/1333/C.cpp | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int, int> > vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define INF 0x3f3f3f3f
#define MOD 1000000007LL
#define EPSILON 0.00001... | ALGO | 0.999861 | 3.552013 |
d7a174cd-6135-441d-b81a-e838419c881e | Deepakkumar586/CPP-LinkedList | LinkedList/DoublyLinkedList.cpp | #include <iostream>
using namespace std;
class Node
{
public:
int data;
Node *prev;
Node *next;
// constructor
Node(int d)
{
this->data = d;
this->prev = NULL;
this->next = NULL;
// cout<<"Data : "<<this->data<<endl;
// cout<<"Prev: "<<this->prev<<endl;
... | ALGO | 0.999203 | 4.533642 |
59b42051-e89e-45f4-802b-f09718aca59d | eari100/Algorithms_Workbook | cpp/Baekjoon/binary_search/Q2776.cpp | #include <iostream>
#include <algorithm>
using namespace std;
/**
* @source: https://www.acmicpc.net/problem/2776 (암기왕)
* @classification: binary search
* @문제 푼 날짜 (자력으로 풂?): 25.01.09 (O)
**/
bool binary_search(int nums[], int n, int target) {
int str = 0, end = n - 1;
if (target < nums[str] || target > nums... | ALGO | 0.999955 | 5.598401 |
496bace9-8d6a-49ff-8a45-e6df94080eaf | hiiamtruongnhudat/ConditionalExercises | TreeBFS.cpp | #include<bits/stdc++.h>
using namespace std;
int matrix[1001][1001];
int n;
bool visited[1001];
vector<pair<int, int>> T;
void __init__()
{
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cin >> matrix[i][j];
memset(visited,false,sizeof(visited));
}
void BFS(int node... | ALGO | 0.999874 | 3.13351 |
ce661e72-e438-4ac9-a0bb-b3772001cad4 | jellyfish26/competitive-programming | AtCoder/Beginner/ABC16x/ABC163/B.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is... | ALGO | 0.999996 | 3.896863 |
342bded0-097d-451a-898d-47d0f445d476 | roy4801/solved_problems | uva/11479.cpp | /*
* Uva 11479 - Is this the easiest problem?
* author: roy4801
* AC(C++) 0.000
*/
#include <iostream>
#include <algorithm>
#include <cstdint>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("./testdata/11479.in", "r", stdin);
freopen("./testdata/11479.out", "w", stdout);
#endif
int cases;
in... | ALGO | 0.999645 | 4.591638 |
8321bc6e-297f-45f9-9423-378377419d71 | abhinav7061/Dsa | Tree/BST/largestBST_inBT.cpp | #include <iostream>
using namespace std;
#define defaultNodeDetails {INT32_MAX, INT32_MIN, 0, 0, true}
struct TreeNode
{
int data;
struct TreeNode *left;
struct TreeNode *right;
TreeNode() : data(0), left(nullptr), right(nullptr) {}
TreeNode(int val) : data(val), left(nullptr), right(nullptr) {}
... | ALGO | 0.999764 | 6.761537 |
f039a490-82c9-48f7-bfb6-d9525724263c | Lesords/LanQiao | 模拟赛/模拟赛1/9.cpp | #include<iostream>
#include<queue>
#include<cstdio>
using namespace std;
const int MAXN = 1005;
struct node{
int x,y;
};
int n,m,k;
int nextt[4][2] = {1,0,0,1,-1,0,0,-1};
char a[MAXN][MAXN];
queue<node> q,q_tmp,zero;
node tmp,tt;
int main() {
scanf("%d%d",&n,&m);
getchar();
for(int i = 1;i <= n;i++) {
for(int j =... | ALGO | 0.997111 | 3.281795 |
9e9c6e22-4c07-47ea-b7d3-729bae56aeed | Ashok-Bhatt/Leetcode-Problems | Asteroid_Collision/submission1.cpp | class Solution {
public:
vector<int> asteroidCollision(vector<int>& asteroids) {
int n = asteroids.size();
stack<int> st;
vector<int> ans;
for (int i=n-1; i>=0; i--){
if (asteroids[i] > 0){
while (!st.empty() && st.top()<0 && abs(st.top())<asteroids[i]){
... | ALGO | 0.999978 | 5.885446 |
ad04cdf1-e875-4610-83e1-b5d4cb576a67 | raihan02/My_Profile- | DFS_FLOOD_Fill.cpp | #include <bits/stdc++.h>
using namespace std;
int fx[] = {+0,+0,+1,-1,-1,+1,-1,+1}; /// move up down && corner /// If we want only move in up and down , thne
int fy[] = {-1,+1,+0,+0,+1,+1,-1,-1}; /// UVA problem samle (Oil deposite )
int row , col;
/*
for up down right left
int fx[]={+1,-1,+0,+0};
int fy[]={+0,+0,+1,... | ALGO | 0.998802 | 4.316463 |
a273b444-492b-40e5-bd6c-8f4727e2f53d | Dharnesh67/CSES | codeforces/B_Little_Girl_and_Game.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vll vector<long long>
#define vvll vector<vector<long long>>
#define mii map<int, int>
#define msi map<string, int>
#define mci map<char, int>
#define si se... | ALGO | 0.999991 | 4.598628 |
2f8f8384-d031-41c4-a154-0d92120673a4 | 12Sounak/DSA_Stivers-CodeHelp | 14_68_Quick_Sort/Q1_Quick_Sort.cpp | #include <bits/stdc++.h>
using namespace std;
int partition(vector<int> &arr, int low, int high) {
int pivot = arr[low];
int i = low;
int j = high;
while (i < j) {
while (arr[i] <= pivot && i <= high - 1) {
i++;
}
while (arr[j] > pivot && j >= low + 1) {
... | ALGO | 0.999972 | 5.585309 |
14dcf884-95bc-440f-88de-a49cbd9847ba | furiousteabag/CPPCourse | ProgramsExecution/SwapMin/src/swap.cpp | #include <iostream>
using namespace std;
int ** create_array2d(size_t a, size_t b) {
int ** m = new int *[a];
m[0] = new int[a * b];
for (size_t i = 1; i < a; ++i) {
m[i] = m[i - 1] + b;
}
return m;
}
void free_array2d(int ** m) {
delete [] m[0];
delete [] m;
}
void print_array2d... | ALGO | 0.98823 | 3.623627 |
bc6f9ed2-5c88-420f-b6b4-f7351c01cdee | puneethkumar18/DSA_in_Cpp | Phase_4/Trees/Tree based problems/Part-1/heightOfTree.cpp | #include<iostream>
#include<queue>
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* buildtree(Node* &root){
cout<<"Enter the data of the node"<<endl;
... | ALGO | 0.999423 | 4.430274 |
5865ec6f-6040-4f15-83c0-ca5e28385ce8 | pshirishreddy/CBIR_GA | main.cpp | #include <iostream>
#include <QApplication>
#include <QDialog>
#include <highgui.h>
#include <cv.h>
#include "HaarWavelet.h"
#include "System.h"
#include "Similarity.h"
#include "headers.h"
#include "QuickSort.h"
#include <time.h>
#include "images.h"
#include "Chromosome.h"
using namespace std;
int main(int argc, cha... | ALGO | 0.976219 | 3.634944 |
b0362b38-91b8-448b-9ca7-ba33b27608cf | alphaprojectv1/Programming | Basic/Get_Prefix_Sum.cpp | #include<bits/stdc++.h>
#include <stdio.h>
#define int long long
#define nl "\n"
#define blk " "
#ifndef ONLINE_JUDGE
#define debug(a) cout<<#a<<blk<<a<<nl;
#else
#define debug(a)
#endif
const int N=1e5+5;
using namespace std;
int32_t main()
{
int n;
cin>>n;
int a[n],p[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
... | ALGO | 0.999932 | 3.478325 |
e99ed819-20c8-472f-bb81-5874c935fed1 | HanYouyang/Computer | 数据结构与算法/PKU-CS/Leetcode/LeetCode-master 3/C++/binary-tree-preorder-traversal.cpp | // Time: O(n)
// Space: O(1)
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<i... | ALGO | 0.999998 | 6.634849 |
b07657c7-15de-4fb3-acf7-d034823e29b3 | rahuldohare007/LeetCode2022-CPP | 1472. Design Browser History.cpp | /*
You have a browser of one tab where you start on the homepage and you can visit another url, get back in the history number of steps or move forward in the history
number of steps.
Implement the BrowserHistory class:
BrowserHistory(string homepage) Initializes the object with the homepage of the browser.
void visit(... | ALGO | 0.998945 | 6.150307 |
04e95d32-c1b1-40c9-9e62-8d4abe9c6117 | adityadeshmukh10/Leetcode | 0035-search-insert-position/0035-search-insert-position.cpp | class Solution {
public:
int searchInsert(vector<int>& arr, int target)
{
int n = arr.size();
int low = 0;
int high = n-1;
int ans = n;
if(target>arr[n-1])
{
return ans;
}
else if(target<arr[0])
{
return 0;
... | ALGO | 0.999974 | 6.142056 |
af657893-59d3-4ccd-ad8b-421272db825f | RaphaelIT7/gmod-common-plugin-base | development/garrysmod_common/sourcesdk-minimal/public/simple_physics.cpp | #include "simple_physics.h"
#include "tier0/dbg.h"
// memdbgon must be the last include file in a .cpp file!!!
#include "tier0/memdbgon.h"
CSimplePhysics::CSimplePhysics()
{
Init( 1.0f / 30.0f ); // default is 30 steps per second
}
void CSimplePhysics::Init( float flTimeStep )
{
m_flPredictedTime = 0;
m_iCurTimeS... | ALGO | 0.989044 | 5.881694 |
714d9ef8-db6c-462e-b9db-7a58646b448d | Noodle96/contestProgramming | AtCoder/B_missinNo.cpp | #include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define msg(str,str2) cout << str << str2<< endl
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template<typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli =... | ALGO | 0.999993 | 4.108837 |
ab2ad4e8-1b89-4e16-b120-1ad97d79ee55 | srshoruv/tries | CountUniqueSubStrings.cpp | #include <iostream>
#include <unordered_map>
#include <string>
#include <vector>
using namespace std;
class Node{
public:
unordered_map<char, Node*> children;
bool endOfWord;
int freq;
Node(){
endOfWord = false;
}
};
class Trie{
Node* root;
public:
Trie(){
root = new ... | ALGO | 0.999482 | 5.83918 |
36aaeddb-a164-4d8c-a758-ccfd4bf5ef3b | ishandutta2007/codeforces | akulyat/normal/1418/G.cpp | #include <bits/stdc++.h>
#pragma GCC optimize ("O3", "unroll-all-loops")
#pragma GCC target ("sse4.2")
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
ifstream in;
ofstream out;
const long long kk... | ALGO | 0.99993 | 3.888642 |
6bd3d054-8120-4e25-8e87-9df35150d54c | jayysuthar/Competitive-Programming-Practice | Leetcode/1614. Maximum Nesting Depth of the Parentheses.cpp | class Solution {
public:
int maxDepth(string s) {
int a=0,sum=0;
for(int i=0;i<s.size();i++){
if(s[i]=='('){
sum++;
}
else if(s[i]==')'){
sum--;
}
a = max(a,sum);
}
return a;
}
}; | ALGO | 0.99978 | 5.63725 |
b1cccc6e-f3d0-40e6-a277-2f7fa05c2f21 | laughing-Otoko/Numerical-analysis | c++/eulers method/eulers_method (copy).cpp | #include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
double f(double t, double y){ return (y/t)- pow((y/t), 2);}
double y(double t){ return t/(1+log(t));}
void eulers_method(double a, double alpha, double h, int N)
{
double t = a;
double w = alpha;
cout.setf(ios::fixed);
cout... | ALGO | 0.999867 | 3.241804 |
8fe537d0-d1aa-4833-b113-0962663e79e9 | Neaj-Morshad-101/CP-Code-Templates-and-Resources | Notes and Resources/code-library-shahjalal shohag/Graph Theory/Inverse Graph.cpp | #include<bits/stdc++.h>
using namespace std;
const int N = 3e5 + 9;
// given edges which are not in the graph you need to apply dfs
// 2 coloring for this problem
int par[N], col[N], vis[N], ty[N], n;
vector<int> g[N];
int Find(int x) {
return par[x] == x ? x : par[x] = Find(par[x]);
}
void dfs(int u, int c) {
if... | ALGO | 0.999799 | 4.00156 |
449e5db1-0ce6-4e9d-8e80-5b0db92dc2e1 | ishandutta2007/codeforces | -____/normal/1483/D.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 666;
const LL inf = 1e18;
void cmin(LL&x,LL y){
if(x>y)
x=y;
}
void cmax(LL&x,LL y){
if(x<y)
x=y;
}
int n,m,q,ans;
LL d[N][N],e[N][N],f[N][N],g[N];
int main(){
int i,j,k,l,x,y,z;
LL o;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
for... | ALGO | 0.999919 | 4.216639 |
5b6d13d4-ce7f-4aef-b506-b2b4f966976b | Pejman712/CRF | modules/Control/MotionController/src/Teleoperation/InputShaperTaskController.cpp | // Standard Libraries
#include <memory>
#include <vector>
// CRF Libraries
#include "MotionController/Teleoperation/InputShaperTaskController.hpp"
namespace crf::control::motioncontroller {
InputShaperTaskController::InputShaperTaskController(
const TaskVelocity& startVelocity,
const TaskAcceleration& maxAcc... | TOOL | 0.889057 | 7.194596 |
5690324e-65f9-479e-863a-424f56dd4399 | DionysiosB/CodeForces | 0800-0899/876D-SortingTheCoins.cpp | #include<cstdio>
#include<vector>
int main(){
long n; scanf("%ld", &n);
std::vector<bool> mark(n);
printf("1 ");
long right(n - 1), cnt(0);
for(long p = 0; p < n; p++){
long x; scanf("%ld", &x); --x;
mark[x] = 1;
if(x == right){while(right >= 0 && mark[right]){cnt++; --rig... | ALGO | 0.999744 | 3.220616 |
cd325c4d-d7bb-45f4-a778-4618f761f0c5 | ishandutta2007/codeforces | nots0fast/normal/1268/B.cpp | #include <bits/stdc++.h>
using namespace std;
#define mp(a,b) make_pair(a,b)
#define ff first
#define setp(a) setprecision(a)<<fixed
#define ss second
#define fori(v) for(ll i=0; i<v; i++)
#define forj(v) for(ll j=0; j<v; j++)
#define fork(v) for(ll k=0; k<v; k++)
#define forl(v) for(ll l=0; l<v; l++)
#define fort(v) f... | ALGO | 0.999951 | 3.8104 |
b6506eec-b594-47e9-aba3-7e506cc17ee4 | Rajdeep7/LeetcodeSolutions | Linked-List/RemoveDuplicatesII.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if ((head==NULL) || (head->next == NULL) ){return head;}
ListNode* pre ... | ALGO | 0.999971 | 5.450857 |
07a1caf6-3a96-4cf4-84c4-c1d9c96d360d | flexsloth/LeetCode_solutions | 0169-majority-element/0169-majority-element.cpp |
class Solution {
public:
int majorityElement(vector<int>& nums) {
sort(nums.begin() , nums.end());
nums.push_back(-1);
int n = nums.size();
int gg=0,ans=0;
int count=1;
int i;
for( i = 0 ; i < nums.size()-1 ; i++){
if(nums[i] == nums[i+1]){
... | ALGO | 0.999981 | 5.178761 |
3e80f4c3-cdee-4281-9dfa-e4ed49cfdfaf | meichengzhong/libfuzzer | llvm/lib/CodeGen/ReachingDefAnalysis.cpp | #include "llvm/ADT/SmallSet.h"
#include "llvm/ADT/SetOperations.h"
#include "llvm/CodeGen/LivePhysRegs.h"
#include "llvm/CodeGen/ReachingDefAnalysis.h"
#include "llvm/CodeGen/TargetRegisterInfo.h"
#include "llvm/CodeGen/TargetSubtargetInfo.h"
#include "llvm/Support/Debug.h"
using namespace llvm;
#define DEBUG_TYPE "r... | ALGO | 0.998887 | 7.652811 |
67c03ac3-d80d-443b-88d8-e0eef397ecf5 | MuraliMallisetty77/GenesisTrainingTechinical | cpp/Rectangle/main.cpp | #include<iostream>
#include"header.h"
int maxarea(Rectangle r[],int n)
{
int area[n];
for(int i=0;i<n;i++)
{
area[i]=r[i].calArea(r[i].getLength(),r[i].getBreadth());
std::cout<<"Area:"<<area[i]<<"\t";
}
int max=area[0];
for(int i=1;i<n;i++)
{
if(max<area[i])
... | ALGO | 0.984102 | 3.890075 |
8c9d4cba-ae33-4531-bb7c-24d1d30bfd59 | tanushree-dwibedi/Cpp | Cpp/Array/change.cpp | #include<iostream>
using namespace std;
void change(int x){
x = 8;
}
void change2(int &x){
x = 9;
}
void change3(int *x){
*x = 10;
}
void changearr(int arr[]){
arr[0]=0;
}
int main(){
int x = 3;
cout<<x;
change(x);//pass by value
cout<<x;
change2(x);//pass by reference
cout<<x;
... | ALGO | 0.990058 | 4.115633 |
4d4b1128-5fc8-45a6-9846-fc99a683014d | jiyeon2781/algorithm-practice | Baekjoon/Silver/9095.cpp | #include <iostream>
#include <algorithm>
using namespace std;
const int MaxSize = 11;
int dp[MaxSize + 1];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc, N;
cin >> tc;
dp[1] = 1, dp[2] = 2, dp[3] = 4;
for (int i = 4; i <= MaxSize; i++) {
dp[i] = dp[i... | ALGO | 0.999949 | 4.540287 |
14d4dd5c-4e93-40c9-a62b-3f0eef19ef92 | geeseek/MLToolkits | lr/ridge_regression.cpp | #include<iostream>
#include<fstream>
#include<string>
#include<vector>
#include<set>
#include<utility>
#include<cstdlib>
#include<ctime>
#include "Eigen/Eigen"
using namespace std;
using namespace Eigen;
#define MAX_ROUND 10000
class splitstring : public string {
vector<string> flds;
public:
splitstring(char... | DATA | 0.852192 | 4.889136 |
3c62d95f-cd3e-4948-97ec-ef108bbe7cd3 | arcanumghost/advent | AdventOfCode2015/Day15/main.cpp | #include <iostream>
#include <vector>
#include <fstream>
#include <string>
using namespace std;
union ingredient
{
struct props
{
int capacity;
int durability;
int flavor;
int texture;
int calories;
}props;
int m[4];
};
int score(vector<ingredient> &ing, vector<int> &amt)
{
ingredient total {0,0,0,0};... | ALGO | 0.994943 | 3.481964 |
80920293-f7ba-4c36-857d-ab7f86179c87 | night0205/greenjudge | a008.cpp | #include <iostream>
using namespace std;
main(){
int c;
cin >> c;
cout << c*9.0/5+32;
}
| ALGO | 0.966929 | 3.322834 |
76abfc46-b3b6-4989-b941-8387bee0410b | Komal-J04/DSA | GFG/Amazon/Arrays/17. FindIndexesOfASubarrayWithGivenSum.cpp | // https://www.geeksforgeeks.org/batch/test-series-bundle/track/amazon-arrays/problem/subarray-with-given-sum-1587115621
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
// Function to find a continuous sub-array which adds up to a given number.
... | ALGO | 0.999652 | 5.577373 |
d13fbf2e-5161-40b0-9b8d-00d1bdacf961 | akulsanthosh/example | postfixEvaluation.cpp | #include <iostream>
#include "Stack.h"
using namespace std;
int main(int argc, char const *argv[])
{
unsigned int postfix[] = {'1','2','3','*','+','9','-'},ch;
Stack<int> s;
for (int i = 0; i < sizeof(postfix)/sizeof(unsigned int); ++i)
{
ch = postfix[i];
if (isdigit(ch))
{
s.push(ch-'0');
}
else {
... | ALGO | 0.999121 | 3.538157 |
05ee1ae9-8d9c-4b50-9b69-6e22d8ec6931 | morrischen890717/Leetcode | C++/108.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.999996 | 6.677193 |
1c806cd8-6635-4e29-b1a2-771bb3a85f89 | okaditya84/LeetCode-Streak | LC979distributeCoins.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.999991 | 6.496441 |
8df120df-0001-43c0-93e7-325846aa5407 | ishandutta2007/codeforces | melnik/normal/817/B.cpp | #include <iostream>
#include <fstream>
#include <list>
#include <stack>
#include <deque>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <iomanip>
#include <ctime>
#include <iterator>
#include <cstdio>... | ALGO | 0.999877 | 3.813985 |
5fe2bf5c-b17d-45a6-b80c-98cae6870a25 | firewatersun/2024-BSCH-CompSci-Griffith-PT | 2024 BSCH CompSci Griffith PT/Library/PackageCache/com.unity.ide.visualstudio@2.0.22/Editor/COMIntegration/COMIntegration~/COMIntegration.cpp | #include <iostream>
#include <sstream>
#include <string>
#include <filesystem>
#include <windows.h>
#include <shlwapi.h>
#include <fcntl.h>
#include <io.h>
#include "BStrHolder.h"
#include "ComPtr.h"
#include "dte80a.tlh"
constexpr int RETRY_INTERVAL_MS = 150;
constexpr int TIMEOUT_MS = 10000;
// Often a DTE call m... | TOOL | 0.949846 | 6.933585 |
68e49fb8-a8d9-4f99-a2bc-6678482caac1 | snikolov3/DEMSI_newLAMMPS | LAMMPS/src/USER-OMP/bond_fene_omp.cpp | /* ----------------------------------------------------------------------
Contributing author: Axel Kohlmeyer (Temple U)
------------------------------------------------------------------------- */
#include "omp_compat.h"
#include "bond_fene_omp.h"
#include "atom.h"
#include "comm.h"
#include "force.h"
#include "ne... | ALGO | 0.999566 | 6.129918 |
375d56ae-3056-4440-9cb3-da4c0e27bfbd | tingyun63/fheroes2 | src/fheroes2/ai/normal/ai_normal_spell.cpp | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <ostream>
#include <vector>
#include "ai.h"
#include "ai_normal.h"
#include "army_troop.h"
#include "artifact.h"
#include "artifact_info.h"
#include "battle.h"
#include "battle_arena.h"
#include "battle_army.h"
#include "battle_board.... | ALGO | 0.998103 | 6.495093 |
ae5c6c3c-0fb5-4375-ba9a-b1a2785f14b8 | quant-tam/ChernoCpp | std-vector/main.cpp | #include <iostream>
#include <vector>
// 定义一个顶点类
struct Vertex {
float x, y, z;
};
std::ostream& operator<<(std::ostream& stream, const Vertex& vertex) {
stream << "(" << vertex.x << ", " << vertex.y << ", " << vertex.z << ")";
return stream;
}
int main() {
std::vector<Vertex> vertices;
vertices.p... | TOOL | 0.918568 | 3.501821 |
2962e4bb-9aab-4686-87b6-8fa042a81c58 | duchenerc/sokoban | sokoban/sokoban.cpp | // sokoban.cpp : Defines the entry point for the application.
//
#include "sokoban.hpp"
int main(int argc, char* argv[])
{
if (argc < 2)
{
std::cout << "usage: sokoban <filename>" << std::endl;
return 1;
}
std::string solverType = "";
bool valid = false;
do
{
std::cout << "sokob... | TOOL | 0.852691 | 6.293621 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.