uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
fe5d1c7e-5b4b-4373-b29d-b829cbdfab66 | udacity/CarND-MPC-Quizzes | mpc_to_line/src/Eigen-3.3/bench/bench_gemm.cpp |
// g++-4.4 bench_gemm.cpp -I .. -O2 -DNDEBUG -lrt -fopenmp && OMP_NUM_THREADS=2 ./a.out
// icpc bench_gemm.cpp -I .. -O3 -DNDEBUG -lrt -openmp && OMP_NUM_THREADS=2 ./a.out
// Compilation options:
//
// -DSCALAR=std::complex<double>
// -DSCALARA=double or -DSCALARB=double
// -DHAVE_BLAS
// -DDECOUPLED
//
#include... | TOOL | 0.960019 | 5.829477 |
25de8cbe-cb98-4481-9562-ad7df0d92c7f | moungJae/CSE3081 | HW2_S20192138/my_quick_sorts.cpp | #include "my_quick_sorts.h"
typedef struct {
unsigned int score;
float data[3];
char comments[16];
} ELEMENT;
void qsort_orig(void* base, size_t left, size_t right, _Cmpfun* cmp) {
int pivot, i, j, int_left, int_right;
int_left = (int)left, int_right = (int)right;
ELEMENT tmp;
if (int_left < int_right) {
i ... | ALGO | 0.999921 | 4.815239 |
fb8f47bf-a936-449d-8368-8f4d18acb24d | TaiKonne/Code_Forces | A_Nauuo_and_Votes.cpp | #include <bits/stdc++.h>
using namespace std;
#define nl << '\n'
#define vti vector<int>
#define vtll vector<long long>
#define yep cout << "YES" nl
#define nope cout << "NO" nl
#define ll long long
#define lg long
#define db double
#define pb push_back
#define bg begin()
#define ed end()
#define rbg rbegin()
#define ... | ALGO | 0.999983 | 4.127198 |
f944b241-1eaa-444e-943b-265bce61b814 | nbyaya/LegionCore-7.3.5II | src/server/scripts/Draenor/TheEverbloom/boss_archmage_sol.cpp | /*
Dungeon : The Everbloom 100
Encounter: Archmage Sol
*/
#include "the_everbloom.h"
enum Says
{
SAY_INTRO = 0,
SAY_AGGRO = 1,
SAY_FIREBLOOM = 3,
SAY_WARN_PHASE_FROST = 4,
SAY_PHASE_FROST = 5,
SAY_WARN_PHASE_ARCANE = 6,
SAY_PHASE_A... | TOOL | 0.884564 | 6.375419 |
1e54f0d8-bb11-4ad2-a314-70917de0d694 | YadavDhirendra/Data-Structures-and-ALgorithms-Problems | Linked list/DoublyLL.cpp | //Doubly Linked List
#include <bits/stdc++.h>
using namespace std;
class Node
{
public:
Node *prev;
int data;
Node *next;
Node(int data)
{
this->data = data;
this->prev = NULL;
this->next = NULL;
}
~Node(){
int value = this->data;
if (this->next!=N... | ALGO | 0.999853 | 5.034709 |
91bda9a5-81f7-40b8-989f-b0e70fc8c8f8 | convict-git/sport_coding | crap/interview_bit.cpp | #include <bits/stdc++.h> /*{{{*/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifndef CONVICTION
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse... | ALGO | 0.999647 | 4.172054 |
f1aac6ca-c5b5-4e29-9912-ae39efca3bbc | raincross7/code-similarity | codes/train_code/problem197/problem197_143.cpp | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a <= b) {
if (a <= c) {
if (b <= c) {
cout << a << " " << b << " " << c << endl;
} else {
cout << a << " " << c << " " << b << endl;
}
} else {
cout << c << " " << a << " " << b <... | ALGO | 0.999938 | 3.926614 |
30e718c2-5f13-46ab-af2b-b4dc5aa12576 | TajwarSaiyeed/problem-solving-codechef-leetcode-codechef | 23-02-2025/B. Queue at the School.cpp | /*
Author: Tajwar Saiyeed
Date: 2025-02-23 08:18:16
File: B. Queue at the School.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
void solve()
{
int n, t;
cin >> n >> t;
string s;
cin >> s;
while (t--)
{
for (int i = 0; i < n; ++i)
{
i... | ALGO | 0.999889 | 4.981596 |
6ed88388-413a-4949-b2f2-70805bcb7c08 | Arun03Kumar/leetcode_sol | 2554-maximum-number-of-integers-to-choose-from-a-range-i/2554-maximum-number-of-integers-to-choose-from-a-range-i.cpp | class Solution {
public:
int maxCount(vector<int>& banned, int n, int maxSum) {
unordered_set<int> st(begin(banned), end(banned));
int ans = 0;
for(int i = 1; i <= min(n, maxSum); i++) {
if(st.find(i) != st.end()) continue;
if(i <= maxSum) {
ans++;
... | ALGO | 0.999956 | 6.380093 |
a9fafe4e-c0c0-4e13-b285-7fa8b22db9ab | shengan8776/CS557 | Project3b/loadobjfile.cpp | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <ctype.h>
#ifdef __APPLE__
#include <OpenGL/gl.h>
#else
#include <GL/gl.h>
#endif
#include <vector>
// delimiters for parsing the obj file:
#define OBJDELIMS " \t"
struct Vertex
{
float x, y, z;
};
struct Normal
{
float nx, n... | TOOL | 0.916683 | 4.582154 |
535dd283-f91f-4ecd-91f4-44484c2826b4 | scarlet2131/leetcode | graph/find_componenets_dfs.cpp | #include<bits/stdc++.h>
using namespace std;
int n,m;
int a[1000][1000];
bool visited[1000][1000];
int x[4]={-1,0,1,0};
int y[4]={0,1,0,-1};
int comp;
vector<int> size;
void dfs(int i,int j,int &count)
{
visited[i][j]=true;
count++;
for(int k=0;k<4;k++)
{
int nl=x[k]+i;
int nr=y[k]+j;
if(nl>=0 and nr>=0 and ... | ALGO | 0.999878 | 3.716463 |
ef34de3f-e84f-4c96-85ef-19f36495e247 | Alex313031/pdfium-supermium | fxbarcode/qrcode/BC_QRCoderEncoder.cpp | #include "fxbarcode/qrcode/BC_QRCoderEncoder.h"
#include <stdint.h>
#include <algorithm>
#include <memory>
#include <utility>
#include <vector>
#include "core/fxcrt/data_vector.h"
#include "core/fxcrt/fx_string.h"
#include "core/fxcrt/span_util.h"
#include "fxbarcode/common/BC_CommonByteMatrix.h"
#include "fxbarcode... | ALGO | 0.924675 | 7.55247 |
3967fe51-aee5-4ec0-88b6-634c3c079f22 | NgTienHungg/PTIT-Source | SPOJ PTIT/ATM3.cpp | // https://www.spoj.com/PTIT/problems/BCATM3/
// BCATM3 - ATM 3
#include <bits/stdc++.h>
using namespace std;
int a[9] = {500, 200, 100, 50, 20, 10, 5, 2, 1};
void solve()
{
int x;
cin >> x;
int d = 0;
for (int i = 0; i < 9; i++)
{
d += x / a[i];
x %= a[i];
}
cout << d << ... | ALGO | 0.999637 | 4.602137 |
d849bf16-2597-41e3-9662-fd402048ddf6 | Li-Weihang/Pointers-on-C | C4E2/C4E2/C4E2.cpp | // C4E2.cpp : ̨Ӧóڵ㡣
//
#include "stdafx.h"
#include <stdio.h>
#include <stdlib.h>
bool isPrime(int num) {
if (num == 1)
return false;
if (num == 2)
return true;
for (int j = 2; j < num / 2; j++) {
if (num % j == 0)
return false;
}
return true;
}
int main()
{
for (int i = 1; i <= 100; i++) {
if (isPr... | ALGO | 0.986668 | 3.356742 |
c386e9ac-5f77-454c-86fc-739e9ddc54b2 | ge2668/HW | CPP/MOOC/mandantory/Chap4/mooc4_1.cpp | #include<iostream>
using namespace std;
class Integer
{
private:
int _num;
public:
Integer(int num){_num = num;}
int get_num(){return _num;}
int gcd(Integer b);
};
int Integer::gcd(Integer b)
{
int factor = (_num < b.get_num())? _num: b.get_num();
while (factor)
{
... | ALGO | 0.999146 | 4.62536 |
1d2f791a-01e7-4594-871d-6b325f1033b8 | jeterlab/ionic-mechanisms-underlying-bistability-in-spinal-motoneurons | boost/libs/compute/perf/perf_comparison_sort.cpp | #include <algorithm>
#include <iostream>
#include <vector>
#include <boost/program_options.hpp>
#include <boost/compute/system.hpp>
#include <boost/compute/algorithm/sort.hpp>
#include <boost/compute/algorithm/is_sorted.hpp>
#include <boost/compute/container/vector.hpp>
#include "perf.hpp"
namespace po = boost::pro... | ALGO | 0.99293 | 5.952507 |
03eb48d4-f1b5-4491-b1ef-d198e371286d | qt/qtwebengine-chromium | chromium/third_party/skia/src/effects/SkBlurImageFilter.cpp | #include "SkBitmap.h"
#include "SkBlurImageFilter.h"
#include "SkColorPriv.h"
#include "SkFlattenableBuffers.h"
#include "SkGpuBlurUtils.h"
#include "SkBlurImage_opts.h"
#if SK_SUPPORT_GPU
#include "GrContext.h"
#include "SkImageFilterUtils.h"
#endif
SkBlurImageFilter::SkBlurImageFilter(SkFlattenableReadBuffer& buffer... | TOOL | 0.867366 | 7.256692 |
88aa6cb0-0d4c-40c7-ab6f-b23933d68e95 | abhiiishek07/DSA | 1530-number-of-good-leaf-nodes-pairs/1530-number-of-good-leaf-nodes-pairs.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.99998 | 5.728665 |
1ac9bc0e-bfa9-4c18-9e9d-8c965743eacc | zkyaw/VirtualSole | 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 |
b4aaaff9-6e84-4d6f-ad17-fb140c5d238d | Scientific-Computing-Lab/OMPar | evaluation/autoPar/parallelized-only-codes/eigenvalue-omp/main.cpp | #include <chrono>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <omp.h>
#include "reference.h"
#include "utils.cpp"
#include "kernels.cpp"
void runKernels(
float *diagonalBuffer,
uint *numEigenValuesIntervalBuffer,
float *offDiagonalBuffer,
float *eigenIntervalBuff... | ALGO | 0.998045 | 5.602355 |
014bbce5-0e59-4fd5-9e47-535b31bdb4fb | min-ia/URI-Cpp | 1009.cpp | #include <iostream>
#include <string>
using namespace std;
double salary(double fixed, double sales){
double salary;
salary = fixed + (sales*0.15);
return salary;
}
int main(){
string name;
double fixed, sales;
cin >> name;
cin >> fixed;
cin >> sales;
cout.setf(ios::fixed, ios::floatfield);
cout.precisi... | TOOL | 0.971198 | 5.159715 |
7c9c2123-902d-450b-b63b-6e7f61db3ad0 | sl1296/acm-code | hdu-1043-3 TimeLimitExceed.cpp |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
struct node{
char z[3][3];
bool operator < (const node &p) const{
for(int i=0;i<3;i++)for(int j=0;j<3;j++)if(z[i][j]!=p.z[i][j])return z[i][j]<p.z[i][j];
return false;
}
};
struct stt{
... | ALGO | 0.999942 | 4.191183 |
399443c5-fca1-43b9-a489-603dcc93d207 | ForhanShahriarFahim/LeetCode_Solutions | 0152-maximum-product-subarray/0152-maximum-product-subarray.cpp | class Solution {
public:
int maxProduct(vector<int>& nums) {
int ans = INT_MIN, suffix = 1, prefix = 1,n = nums.size();
for(int i = 0;i<nums.size();i++){
if(prefix == 0) prefix = 1;
if(suffix == 0) suffix = 1;
prefix*=nums[i];
suffix*=nums[n-i-1];
... | ALGO | 0.999983 | 5.786057 |
43826169-a9ab-49ec-915e-bb0988e815c0 | xDroidOSS-Pixel/device_google_cuttlefish | host/libs/allocd/utils.cpp | #include "host/libs/allocd/utils.h"
#include <cstdint>
#include <optional>
#include "common/libs/fs/shared_buf.h"
#include "common/libs/fs/shared_fd.h"
#include "host/libs/allocd/request.h"
namespace cuttlefish {
// While the JSON schema and payload structure are designed to be extensible,
// and avoid version inco... | TOOL | 0.965998 | 7.357521 |
0c419bda-2438-4a15-9647-d14ed222fff8 | jseobyun/WarpHE4D_ReFLAME | ext/botsch-kobbelt-remesher-libigl/ext/libigl/include/igl/sort_angles.cpp | template <typename DerivedM, typename DerivedR>
IGL_INLINE void igl::sort_angles(
const Eigen::MatrixBase<DerivedM>& M,
Eigen::PlainObjectBase<DerivedR>& R) {
const size_t num_rows = M.rows();
const size_t num_cols = M.cols();
assert(num_cols >= 2);
R.resize(num_rows);
// Have to us... | ALGO | 0.999715 | 7.076909 |
4b91fd4c-fdc6-4e9e-9de2-9440137779ac | jasha64/jasha64 | 2015/NOIP&NOI/NOIP2007tigao/count.cpp | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 200007;
int Number[N];
int Value[N], Count[N], Top = 0;
int main()
{
freopen("count.in", "r", stdin);
freopen("count.out", "w", stdout);
int NumberN;
int i;
cin >> NumberN;
for (i = 0; i < NumberN; i++) scanf("%d",... | ALGO | 0.99998 | 3.680409 |
6034f735-ac25-4f00-a7a9-b2d8a4e1c6d9 | Harzu/stepic_cpp_begin | step_two/gcd.cpp | #include <iostream>
using namespace std;
unsigned gcd(unsigned a, unsigned b)
{
if (a == 0) return b;
if (b == 0) return a;
if (a >= b)
{
return gcd(a % b, b);
}
else
{
return gcd(a, b % a);
}
}
int main()
{
cout << gcd(2, 2) << endl;
return 0;
} | ALGO | 0.987841 | 5.520906 |
3af3fb41-6c2b-43a2-a447-f39915b84f8a | Bhanupal22600/CANDIDATE-MASTER | TREES/Construct_Tree_BFS_Queue.cpp | // In leetcode question they gives us vector then how can we assume its a tree
#include <iostream>
#include<queue>
#include<climits>
using namespace std;
class Node
{ // This is a TreeNode
public:
int val;
Node *left;
Node *right;
Node(int val)
{
this->val = val;
this->left = NULL;
... | ALGO | 0.99999 | 5.434724 |
501c71d9-a526-4c20-8048-860408963e23 | PremiumGraphicsCodes/CGLib2023 | Physics/Fluid/MVPVolumeParticle.cpp | #include "MVPVolumeParticle.h"
#include "MVPFluid.h"
#include "SPHKernel.h"
using namespace Crystal::Math;
using namespace Crystal::Physics;
MVPVolumeParticle::MVPVolumeParticle(const float radius, const Vector3dd& position) :
radius(radius),
position(position),
restMass(0.0f)
{}
MVPVolumeParticle::~MVPVolumePa... | ALGO | 0.860691 | 5.658207 |
94ff29c1-d7df-472a-b422-fa0ff2aaa33d | LiamLYJ/AXVision | AXVisionSDK/3rdparty/eigen_IOS/eigen-git-mirror/doc/examples/tut_matrix_coefficient_accessors.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
MatrixXd m(2,2);
m(0,0) = 3;
m(1,0) = 2.5;
m(0,1) = -1;
m(1,1) = m(1,0) + m(0,1);
std::cout << "Here is the matrix m:\n" << m << std::endl;
VectorXd v(2);
v(0) = 4;
v(1) = v(0) - 1;
std::cout << "Here is the vector v:\n... | ALGO | 0.995891 | 3.687909 |
34b91c72-54b3-41e2-a29e-916cf4b93d35 | nk185545/c-DSA | c++ programs3/String[remove consecutive a and any b].cpp | #include <bits/stdc++.h>
using namespace std;
string removestring(string str)
{
string res="";
res=res+str[0];
for(int i=1;i<str.length();i++)
{
if(str[i]=='a' && res[res.length()-1]=='a' )
{
continue;
}
- else if(str[i]=='b')
{
continue;
}
else
{
res=res+str[i];
}
}
return res;
}
int m... | ALGO | 0.999896 | 4.285015 |
c1298fde-b9a6-40e5-8b5c-a7ebb5bf8a0b | vuoanh291104/CodeCpp | company.cpp | #include<bits/stdc++.h>
#include<string>
#include<sstream>
using namespace std;
struct Company{
int rank;
string global_company;
string country;
double sales;
double profit;
double assets;
double market_value;
};
struct Company1{
int rank1;
string global_company1;
string... | DATA | 0.983814 | 3.505592 |
713d954a-c2a6-4f0e-a0f8-02bf6706752d | Awaleed/keyboard_trainig | 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 |
78b44304-5a21-4459-acac-9e19c425acc7 | parthtyagii/DSA-Codes | inbuiltsort.cpp | #include <iostream>
#include <algorithm> // Header file to use sorting function.
using namespace std;
// Inbuilt Sort in C++ STL: Much more efficient than basic sorting algorithm.
bool compare(int a, int b){
return a<b;
}
int main()
{
int n;
cout << "Number of elements: ";
cin >> n;
int array[100... | ALGO | 0.99971 | 5.272379 |
cd808956-944f-4e77-8948-f1801ed20579 | ihays/LeetCode | C++/PaintHouse.cpp | /***********************************************************************************************
Problem Paint House
Developer Ian Hays
Date 06/01/2021
URL https://leetcode.com/problems/paint-house/
Space O(1)
Time O(N)
Description Use input vector as a way to use DP to store t... | ALGO | 0.999911 | 6.377427 |
4a8f25ee-4d06-489c-a10a-addb71987a45 | destroierdam/Intro-to-programming-2018-Materials | Lesson4/solutions/numbs1ton.cpp | #include<iostream>
using namespace std;
int main()
{
int n, i;
cin>>n;
// с for
for(i = 1;i <= n;i++)
{
cout<<i<<" ";
}
cout<<endl;
// с while
i = 1;
while(i<=n)
{
cout<<i<<" ";
i++;
}
cout<<endl;
// с do-while
i = 1;
if(i <= n) // проверка за коректност(ако се въведе отрицателно число)
{
... | ALGO | 0.998854 | 3.613347 |
e72fce4f-296e-4de6-8548-ccb55b39c2ca | Raviyadav144/Competitve-Programming | Codeforces/1221.cpp | //-----raviyadav144----//
#include<bits/stdc++.h>
using namespace std;
#define forn(i,j,n) for(int i =j; i<n; i++)
#define ll long long
#define all(v) v.begin() , v.end()
#define vi(v,n) vector<int> v(n)
#define fora(e,v) for(auto &e :v)
#define endl "\n"
#define pi acos(-1.0)
#define mod 1000000007
bool bishop[1001... | ALGO | 0.999375 | 4.172268 |
c8f10b56-064b-47fc-87bc-15da477177f8 | tokumaru-y/CompetitiveCPP | typical90/52_ng.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> dx{ 1, 0, -1, 0 };
vector<int> dy{ 0, 1, 0, -1 };
int N;
ll ans = 0;ll MOD = 1000000007;
vector<vector<ll>>A;
void dfs(int pos, ll sum) {
if (pos == N) {
... | ALGO | 0.999955 | 4.429825 |
2c0f038f-e828-4d6f-8304-fc692dce7da7 | thegamer1907/Code_Analysis | contest/1542502806.cpp | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 100010
#define ll long long
#define INF 1e18
ll f[2][N];
int i,j,k,n,m,p,a[N],cnt[N];
bool b;
inline void Solve(int l,int r,int L,int R,ll s){
if(l>r)return;
int Mid=l+r>>1,x=0;
for(int i=l;i<=Mid;i++)s+... | ALGO | 0.999916 | 3.459372 |
88b6d305-eff3-4759-a0a5-a6ccecdd2149 | YazanZebak/CompetitiveProgramming | Codeforces/Gym/2017-2018 ACM-ICPC Egyptian, Collegiate Programming Contest (ECPC 2017)/CF101840-GYM-E.cpp | /*
Idea:
- for each prime number let it equal to 5
- for each two primes number let it equal to 3
- each path has value of 3 or 25 we can add it to the answer
- now to calc number of paths we need to keep number of which that has value of #ones or #prime or #two_primes
- we can merge two_primes paths with ... | ALGO | 0.99996 | 4.624515 |
4517b1f5-5cb6-4607-a8a7-97f938cd0340 | 123pk/Topic-wise-Problems | Graph/787. Cheapest Flights Within K Stops.cpp | /*
Platform :- Leetcode
Approach :- We create a 3d dp where dp[i][j][k] -- stoers the min cost of flight to reach from 'i' to 'j' with 'k' stopage
We do bfs (greedily) always choosing the path with minimum cost (dijkstra) or we can also use bellman ford .
We store the min cost for each of the in... | ALGO | 0.999937 | 6.096206 |
f2ea74dc-f915-411b-bb27-b93cf2c36ebd | sarvex/leetcode-clojure | solution/2300-2399/2310.Sum of Numbers With Units Digit K/Solution.cpp | class Solution {
public:
int minimumNumbers(int num, int k) {
if (num == 0) return 0;
for (int i = 1; i <= num; ++i) {
int t = num - k * i;
if (t >= 0 && t % 10 == 0) return i;
}
return -1;
}
}; | ALGO | 0.999798 | 5.073513 |
f968eb20-a31e-4717-9a33-4f14930dd79e | pytorch/pytorch | torch/csrc/lazy/core/ir_util.cpp | #include <torch/csrc/lazy/core/ir_util.h>
#include <stack>
#include <c10/util/Logging.h>
namespace torch::lazy {
std::vector<const Node*> Util::ComputePostOrder(
const Node* node,
EmissionMap* emap) {
std::vector<const Node*> post_order;
std::stack<const Node*> node_stack;
node_stack.push(node);
whi... | ALGO | 0.998834 | 7.600013 |
23b13971-b7a1-464b-9f03-87cfacee25c0 | MuneerAlrawahi/Projectchrono_ASU | Templet/DEMdemo_Balldrop.cpp | // =============================================================================
// A meshed ball hitting a granular bed under gravity.
// =============================================================================
#include <core/ApiVersion.h>
#include <core/utils/ThreadManager.h>
#include <DEM/API.h>
#include <DEM/... | ALGO | 0.983342 | 6.54846 |
b9808025-126e-48b1-b517-053641235698 | Xelerezex/learning-space | coursera-courses/specialization-the-art-of-development-in-modern-c++/4-brown-belt/week-4/02.Cache/Source/Solution.cpp | #include "Common.h"
using namespace std;
class LruCache : public ICache
{
public:
LruCache (
shared_ptr<IBooksUnpacker> books_unpacker,
const Settings& settings
)
{
// реализуйте метод
}
BookPtr GetBook(const string& book_name) override
... | TOOL | 0.877291 | 3.562103 |
a1d6e671-ecb7-4ab4-8728-2b7d59134c43 | prajapati-arjun/strivers_sde_sheet_challenge | Day 23/Rabin_Carp.cpp | #include<bits/stdc++.h>
const int base = 31;
const int q = 29;
void rabinkarp(string &pattern,string &text,vector<int> &ans)
{
int j;
int h=1;
int p=0; //hashvalue of string pattern
int t=0; //hashvalue of string text
int n=text.size();
int m=pattern.size();
/... | ALGO | 0.999756 | 5.423446 |
24384c5e-4017-4964-a246-136572cb994b | jindalshivam09/cppcodes | ACM/parenthesis.cpp | #include<iostream>
#include<vector>
using namespace std;
int count;
void parenthesis(int i ,int n , int left,int right, vector<int> &brackets) {
if(i==n && left == right) {
for(int j=0;j<n;j++) {
if(brackets[j] == 1) cout << "(";
else cout << ")";
}
cout << endl;
count++;
return;
}
// e... | ALGO | 0.999937 | 4.318442 |
aab119d8-81e6-4340-b5a7-4750eaf5ecee | maartenb/cern-root | interpreter/llvm/src/tools/llvm-xray/xray-converter.cpp | #include "trie-node.h"
#include "xray-registry.h"
#include "llvm/DebugInfo/Symbolize/Symbolize.h"
#include "llvm/Support/EndianStream.h"
#include "llvm/Support/FileSystem.h"
#include "llvm/Support/FormatVariadic.h"
#include "llvm/Support/ScopedPrinter.h"
#include "llvm/Support/YAMLTraits.h"
#include "llvm/Support/raw_o... | TOOL | 0.874515 | 7.663901 |
91603f27-5c39-4867-9e8c-85ef983942ef | THEKNIGHTPROTOCOL/Leetcode | 9. Palindrome Number.cpp | class Solution {
public:
bool isPalindrome(int x) {
if (x < 0 || (x % 10 == 0 && x != 0)) return false;
int reversed = 0;
while (x > reversed) {
reversed = reversed * 10 + x % 10;
x /= 10;
}
return x == reversed || x == reversed / 10;
}
};
| ALGO | 0.999789 | 6.198318 |
f958d226-8eb9-4e4a-b67c-99fc3725c5e5 | Adarsh3424/GFG_POTD | May/11-Juggler-Sequence.cpp | class Solution {
public:
vector<long long> jugglerSequence(long long n) {
// code here
vector<long long> result = {n};
while(n != 1) result.push_back(n = pow(n, n % 2 + 0.5));
return result;
}
};
| ALGO | 0.999979 | 5.659176 |
da5a5655-3fa7-40e1-b02d-d9c6a606f0cf | oosquare/OI-Codes | Storage/Luogu/P6216-回文匹配.cpp | #include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 3e6 + 10;
constexpr int maxm = 3e6 + 10;
int n, m;
unsigned ans, sum[maxn], sum2[maxn];
int pi[maxm], r[maxn];
char s1[maxn], s2[maxm];
void preprocess() {
for (int i = 2, j = 0; i <= m; ++i) {
while (j != 0 && s2[i] != s2[j + 1])
... | ALGO | 0.999945 | 4.00921 |
c3917aba-faec-45cc-b301-f6f03e75115d | Shakila72/Data-Structure-and-Algorithm- | Searching Programs/distance calculating.cpp | #include<iostream>
using namespace std;
struct dist
{
int feet;
int inches;
};
int main()
{
dist d1,d2,sum,diff;
cout<<"\tEnter distance d1 {feets & inches} : "<<endl;
cin>>d1.feet>>d1.inches;
cout<<"\tEnter distance d2 {feets & inches} : "<<endl;
cin>>d2.feet>>d2.inches;
diff.feet=d1.feet-d2.feet;
diff.inches=d1.... | ALGO | 0.999128 | 3.563478 |
51c25b41-fd81-4ae6-8fbd-c7a00975b7fc | ishandutta2007/codeforces | ashishgup/normal/825/B.cpp | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N=20;
int n=10;
int f[N], a[N][N];
int dx[4]={1, 0, 1, 1};
int dy[4]={0, 1, 1, -1};
void check(int x, int y, int k)
{
memset(f, 0, sizeof(f));
for(int i=0;... | ALGO | 0.999966 | 4.596468 |
69ec70e4-4cd1-402d-85d5-0f3b97b4a3eb | rara200405/uts-pab2 | flutter_rara/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.998313 | 6.76775 |
01b7e227-525d-42fc-a53b-52d03487e674 | akib35/LeetCode-Practice | b_search/69. Sqrt(x).cpp | class Solution {
public:
int mySqrt(int x) {
int lo = 0, hi = x/2;
int mid;
while (lo <= hi) {
mid = lo + (hi - lo) / 2;
if (mid == x / mid) return mid;
if (mid < x / mid) lo = mid + 1;
else hi = mid - 1;
}
return hi;
}
};
//add this for better space... | ALGO | 0.999713 | 4.927104 |
9f2ca259-e51f-43d3-987b-795087b7b7ec | NoOneofConsequencePrime/Solutions | LeetCode/C++/sum-of-subarray-minimums.cpp | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_set>
#include <numeric>
#include <map>
#include <stdlib.h>
#include <time.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> ... | ALGO | 0.999986 | 4.778452 |
03b51360-d4a7-41a4-a2e5-eca7c4255393 | singhaditya8499/Codeforces | 509A.cpp | #include<iostream>
#include<cmath>
#include<bits/stdc++.h>
#include<set>
#include<map>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n+1][n+1];
for(int i=1;i<n+1;i++)
{
a[i][1]=1;
a[1][i]=1;
}
for(int i=2;i<n+1;i++)
{
for(int j=2;j<n+1;j++)
{
a[i][j]=a[i-1][j]+a[i][j-1];
}
}
cout<<a[n][n... | ALGO | 0.999885 | 3.00688 |
0cd4d3c1-1a19-42d0-af6d-08793e5eaddc | RedlineResearch/simulator-GC | boost_1_71_0/libs/graph/example/write_graphviz.cpp | // A simple example of using write_graphviz to output a BGL adjacency_list
// graph in GraphViz Dot format.
// Author: Doug Gregor
#include <boost/graph/graphviz.hpp>
enum files_e { dax_h, yow_h, boz_h, zow_h, foo_cpp,
foo_o, bar_cpp, bar_o, libfoobar_a,
zig_cpp, zig_o, zag_cpp, zag_o,... | ALGO | 0.965199 | 6.492318 |
bfdabb76-d6f3-42bc-8e8b-a8a797049280 | robertobbaik/codingtest | 0606/NM3.cpp | #include <iostream>
#include <vector>
using namespace std;
void backtracking(vector<int> &arr, int depth, int N, int M)
{
if(depth == M)
{
for(int i = 0; i < M; i++)
{
cout << arr[i] << " ";
}
cout << "\n";
return;
}
for(int i = 1; i <= N; i++)
... | ALGO | 0.999945 | 4.095047 |
2e9a4ba1-6639-4eba-a87b-015d97bcb10d | Shintaro0105/Competitive-programming | atcoder/abc/259/b.cpp | #include <iostream>
#include <vector>
#include <set>
#include <array>
#include <cmath>
#include <string>
#include <algorithm>
#include <functional>
#include <map>
#include <tuple>
#include <queue>
#include <stack>
#include <bitset>
#include <deque>
#include <iomanip>
#define rep(i,n) for(int i = 0;i < (n);i++)
using na... | ALGO | 0.99928 | 4.378611 |
7d834673-b3fd-4445-8933-40827d4406d2 | desparza22/delaunay_3d | clibs/eigen-3.4.0/bench/quat_slerp.cpp | #include <iostream>
#include <Eigen/Geometry>
#include <bench/BenchTimer.h>
using namespace Eigen;
using namespace std;
template<typename Q>
EIGEN_DONT_INLINE Q nlerp(const Q& a, const Q& b, typename Q::Scalar t)
{
return Q((a.coeffs() * (1.0-t) + b.coeffs() * t).normalized());
}
template<typename Q>
EIGEN_DONT_INL... | ALGO | 0.988623 | 6.251058 |
565d7ac7-41f3-4591-8ea4-87dbd1216b9c | VINAYAK308/OOP | Pract5(SelectionSort).cpp | /*Write a function template for selection sort that inputs,
sorts and outputs an integer array and a float array.*/
#include<iostream>
using namespace std;
int n;
#define size 10
template<class T>
void sel(T A[size])
{
int i,j,min;
T temp;
for(i=0;i<n-1;i++)
{
min=i;
for(j=i+1;j<n;j++... | ALGO | 0.999013 | 4.726417 |
ea3f4b12-ed15-4adc-984f-807bf70b0229 | arlechann/atcoder | AOJ/DSL/RSQ_and_RAQ.cpp | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <t... | ALGO | 0.999599 | 4.814937 |
90ef76f9-a354-4f31-9d25-1128c25c87f0 | kellyy8/CS31 | Project 4 - Arrays/array.cpp | //
// main.cpp
// array
//
// Created by Kelly Yu on 10/28/21.
//
#include <iostream>
#include <string>
#include <cassert>
using namespace std;
int reduplicate(string a[], int n);
int locate(const string a[], int n, string target);
int locationOfMax(const string a[], int n);
int circleLeft(string a[], int n, int p... | TEST | 0.969407 | 4.870668 |
8c8fc564-376c-4507-a967-6a6707d319b1 | ishandutta2007/codeforces | tiwairoao/normal/1515/G.cpp | #include <bits/stdc++.h>
typedef long long ll;
const int N = 200000;
struct edge{int x, l;};
std::vector<edge>G1[N + 5], G2[N + 5];
void adde(int u, int v, int w) {
G1[u].push_back((edge){v, w});
G2[v].push_back((edge){u, w});
}
std::vector<int>v[N + 5];
int dfn[N + 5], low[N + 5], dcnt;
int id[N + 5], cnt, stk[N... | ALGO | 0.999946 | 4.912108 |
3861994a-a70a-4a4f-9126-b99af56b1a74 | q45101218/DATASTRUCTURE | BinarySearch/binarysearch.cpp | /*************************************************************************
> File Name: binarysearch.cpp
> Author:YangKun
> Mail:<EMAIL>
> Created Time: Tue 14 Nov 2017 12:28:49 PM PST
************************************************************************/
#include<iostream>
using namespace std;
template<cla... | ALGO | 0.999992 | 5.436934 |
d50416d0-2c9b-46f1-bcdb-68b315f7ac10 | CppTrainingHub/training-cpp | exercises/29_std_map/main.cpp | #include "../exercise.h"
#include <map>
#include <unordered_map>
// READ: `std::map` <https://zh.cppreference.com/w/cpp/container/map>
// READ: `std::unordered_map` <https://zh.cppreference.com/w/cpp/container/unordered_map>
template<class k, class v>
bool key_exists(std::map<k, v> const &map, k const &key) {
// ... | TEST | 0.882882 | 5.58226 |
98dbc9db-64ee-4636-ad35-065bd490ade4 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_11256_1.cpp | #include <bits/stdc++.h>
using namespace std;
priority_queue<long long int, vector<long long int>, greater<long long int> > q,
t;
map<pair<long long int, long long int>, long long int> mp;
vector<long long int> p[150005], v(200005, 0);
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
... | ALGO | 0.998772 | 3.609296 |
c88e5266-d9b7-4489-8189-6ffe9738286a | ishandutta2007/codeforces | al13n/normal/611/C.cpp | #define _CRT_SECURE_NO_DEPRECATE
#define _USE_MATH_DEFINES
#include <array>
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <ctime>
#include <numeric>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#... | ALGO | 0.999899 | 3.907913 |
8d284487-cd48-40a0-803b-9c377ff77b79 | version0chiro/Ace-The-Code | Leet-Code-Question/set-mismatch/set-mismatch.cpp | class Solution {
public:
vector<int> findErrorNums(vector<int>& nums) {
int n=nums.size();
int arr[n];
int p;
int q;
for(int i=0;i<n;i++){
arr[i]=0;
}
for(auto a:nums){
arr[a-1]=arr[a-1]+1;
... | ALGO | 0.999673 | 5.83077 |
8925ad89-58f8-491f-b499-93ebe40a7477 | BobierAngel/fbbsit3bcrud | 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 |
1a0571e8-1a3e-4452-91f9-b9a84f1b7f5f | QWERx29/My-Codes-and-Docs_OLD | OnlineJudge/Luogu/P5728.cpp | #include<bits/stdc++.h>
using namespace std;
int n,a[10086][5],sum;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=3;j++)
{
cin>>a[i][j];
a[i][4]+=a[i][j];
}
}
for(int i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
{
if(abs(a[i][1]-a[j][1])<=5&&abs(a[i][2]-a[j][2])<=5&&abs(a[i][3]-a[j... | ALGO | 0.999582 | 3.552935 |
756f681f-487b-4242-970b-f2cc0ffa12e1 | WilliamJokuS/mywebsite | idek/dfhgshseh.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
char a;
float num1, num2;
cout << "What do you want?\nSum(+)\nMultiply(*)\nSubtract(-)\nDivide(/)\nSquare root(v)\n";
while(cin>>a){
if(a=='+') {
cout<<"enter your number here...";
cin >> num1 >> num2;
cout << "you... | TOOL | 0.987912 | 3.334077 |
a55464c8-2afa-4db6-8edd-5f837500e220 | akashranjanofficial/-CN-Data-Structures-Algorithm-Implementations | DYNAMIC MEMORY ALLOCTION/basic.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int *p = new int; //heap me memory allocate ho jaye ga then p me uska address save ho jaye ga
*p = 10;
cout << *p << "this will give value of p" << endl;
double *pd = new double;
*pd = 10.6;
char *c = new char;
*c = 'a';
cout <<... | ALGO | 0.872742 | 3.263479 |
a487e09d-cd32-4bf8-b172-32bb0f27c862 | rawhide99/week6 | OOP_concept/prog10.cpp | #include <iostream>
using namespace std;
class complex
{
int a,b;
public:
void set_data(int x, int y)
{
a = x, b = y;
}
void show_data()
{
cout << "a " << a << endl << "b " << b << endl;
}
friend void fun(complex);
};
void fun(complex c)
{
cout <<"Sum is " << c.a... | TOOL | 0.937608 | 4.082011 |
066dc7d8-e5c6-436c-950d-ae78337b3424 | SRIRAM617/DS_CODES_C- | no of duplicates in an array.cpp | #include<iostream>
using namespace std;
int main()
{
int sizeA,length,i,j;
cout<<"Enter size of the array"<<endl;
cin>>sizeA;
int A[sizeA];
cout<<"Enter the length of the array"<<endl;
cin>>length;
cout<<"Enter the elements"<<endl;
for(int k=0;k<length;k++)
{
cin>>A[k];
... | ALGO | 0.999714 | 3.223798 |
8e60669f-9af5-4883-b59d-fe281cf42fce | aarindey/Leetcode-Solution-By-aarindey | can-place-flowers/can-place-flowers.cpp | class Solution {
public:
bool canPlaceFlowers(vector<int>& flowerbed, int n) {
int c=0,n2=flowerbed.size();
if(n==0)
return true;
if(n2==1)
{
if(flowerbed[0]==0&&n==1)
return true;
else
return false;
}
... | ALGO | 0.999987 | 6.750299 |
1006a23c-8983-408d-b408-b2d99f015ead | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_4669_8.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
using P = pair<int, int>;
int n;
cin >> n;
vector<P> v(n);
for (auto &p : v) cin >> p.first >> p.second;
sort(v.begin(), v.end());
cout << v[n - 1].first + v[n - 1].second << endl;
return 0;
}
| ALGO | 0.999892 | 4.215711 |
36dfe9eb-8dac-40fb-8f68-e5ec4e48ca0e | Bihanojko/BMS2 | bms2A.cpp | /*
* Project 2
* Subject: Wireless and Mobile Networks
* Author: Nikola Valesova
* Date: 16. 12. 2018
* Faculty of Information Technology
* Brno University of Technology
* File: bms2A.cpp
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include "rscode-1.3/ecc.h"
// lengt... | TOOL | 0.987393 | 4.285382 |
52d1dcdb-01ef-4fae-aa93-eebff7e5d821 | BeLike-Harsh/C-Data-Structures-and-Algorithms-DSA- | Vectors/2_Dyanamic_memory_allocation.cpp | #include<bits/stdc++.h>
using namespace std;
void func(){
int size;
cin>>size;
int *arr=new int[size];//New keyword is use for new memory allocation in heap memory(dynamic memory allocate in heap\\\ and static in stack)
int x=1;
for (int i = 0; i < size; i++){
arr[i]=x;
cout<<arr[i]... | ALGO | 0.990696 | 4.072059 |
cef15565-b88a-4c22-836c-4f03fb045ebb | Infinity-Voice-Synthesis/Infinity-Studio | JUCE_Windows/juce_box2d/box2d/Collision/b2DynamicTree.cpp | #include "b2DynamicTree.h"
#include <cstring>
#include <cfloat>
using namespace std;
b2DynamicTree::b2DynamicTree()
{
m_root = b2_nullNode;
m_nodeCapacity = 16;
m_nodeCount = 0;
m_nodes = (b2TreeNode*)b2Alloc(m_nodeCapacity * sizeof(b2TreeNode));
memset((void*)m_nodes, 0, m_nodeCapacity * sizeof(b2TreeNode));
... | ALGO | 0.997879 | 7.727639 |
8e0b2600-8987-4569-8afc-7764c95276ea | fuad7161/Basic-Algorithm- | Sorting/stack.cpp | #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <random>
#include<iomanip>
#include <cassert>
#include <cstring>
#include <sstream>
#include <complex>
#include <numeric>
#in... | ALGO | 0.999368 | 3.68077 |
894b2b2b-724f-443b-813d-fe3575b80213 | SocialSim/SocialCube | src/BehaviorModel/PoissonProcessModel.cpp | #include "PoissonProcessModel.hpp"
using namespace std;
std::vector<unique_ptr<Event>> PoissonProcessModel::evaluate(
const string objectID,
const vector<double>& mu,
const vector<string>& typeList,
int k,
time_t t_startTime,
time_t t_endTime
) {
vector<unique_ptr<... | TOOL | 0.888394 | 6.286581 |
6b9f98d7-b988-44fd-8db5-52007535c911 | suxutao/LeetcodeList | cn/3508-implement-router .cpp | #include "../../../stdc.h"
using namespace std;
//leetcode submit region begin(Prohibit modification and deletion)
class Router {
public:
int limit;
queue<int>q;
set<array<int,3>>s;
unordered_map<int,deque<array<int,3>>>m;
Router(int memoryLimit) {
limit=memoryLimit;
}
bool add... | ALGO | 0.999465 | 5.527232 |
590ca566-2998-42a5-80ed-76f27d398c36 | SparrowSurya/leetcode-blind-75 | best-time-to-buy-and-sell-stock.cpp | #include <vector>
using namespace std;
class Solution {
public:
int maxProfit(vector<int> &prices) {
int maxprofit = 0;
int buy = 0;
int len = prices.size();
for (int i = 0; i < len; ++i) {
int profit = prices[i] - prices[buy];
if (profit > maxprofit) {
maxprofit = profit;
... | ALGO | 0.999616 | 6.141387 |
10f7cc2b-c781-49f5-8b63-4f3dbaae1336 | ajimenezh/Programing-Contests | Topcoder/GogoXCake.cpp | #include <iostream>
#include <sstream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <stdio.h>
using namespace std;
#define rep(it,s) for(__ty... | ALGO | 0.999773 | 4.631391 |
d35d9003-a3fd-4132-b218-2568b0118c7e | glerium/OI-Life | Contest/201119/hard/hard.cpp | #include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
template<typename T>void read(T& x){
T v=0,w=1; char ch=getchar ();
while(ch>'9'||ch<'0'){if(ch=='-')w=-1;ch=getchar ();}
while(ch<='9'&&ch>='0')v=v*10+ch-'0',ch=getchar ();
x=v*w;return;
}
ll s;
int main(){
// freope... | ALGO | 0.999913 | 3.408493 |
2c260fe4-8af7-4e00-b34e-d36125a2d8c3 | cwza/juniortrainingsheet | CF318-D2-A.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
ll n, k;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n >> k;
ll split = (n+1)/2 + 1;
if(k<split) cout << 1+2*(k-1);... | ALGO | 0.999485 | 3.519976 |
43f5b86b-d66f-408e-9eb9-e9209048f5a1 | MalikTawkeer/data-structures-using-CPP-2022 | deleteNodAtSpecificLocation.cpp | //delte node at any specific location
#include<iostream>
using namespace std;
class Node
{
public:
int data;
Node* next;
Node(){}
Node(int data)
{
this->data=data;
}
};
//insert data at last of SLL
void insertNodeAtLast(Node* &head,int data)
{
Node* temp=head;
Node* ne... | ALGO | 0.999978 | 4.642967 |
80a0ad73-2bd9-495e-83b7-33b5a27d864c | ShenaoChen/Algorithm | code/acm/acwing3764.cpp | #include <iostream>
using namespace std;
void solve() {
int n;
string s, a, b;
cin >> n >> s;
for(int i = 0; i < n; i++){
if(s[i] == '2')
a += '1', b += '1';
if(s[i] == '0')
a += '0', b += '0';
if(s[i] == '1'){
a += '0', b += '1';
... | ALGO | 0.999939 | 3.78208 |
61f49cb2-cfc0-401a-be17-14ba119df44c | ajayrajsrivastava/GeeksPractice | BinaryTrees/sum_tree_simple.cpp | #include<iostream>
#include<stack>
using namespace std;
struct Node{
int data;
Node *left = NULL;
Node *right = NULL;
Node( int data ) {
this -> data = data;
}
};
int sum( Node *root ) {
if( root == NULL )
return 0;
return root -> data + sum( root -> left ) + sum( roo... | ALGO | 0.999857 | 5.180186 |
966c7605-aa9e-4866-9d45-12f018cd315c | marioloera/ccode | cpp/lect16/sort2.cpp | // sort algorithm example
#include <iostream> // std::cout
#include <algorithm> // std::sort
#include <vector> // std::vector
bool myfunction (int i,int j) { return (i>j); }
struct myclass {
bool operator() (int i,int j) { return (i>j);}
} myobject;
int main () {
int myints[] = {32,71,12,45,26,8... | ALGO | 0.999159 | 4.58882 |
14fa5f2a-c486-4832-8a5a-66cc7ca06cc9 | Chaitalykundu/Data-Structure-and-Algorithm | 14-Bit-manipulation/Questions/02-Set the kth bit of a number/Solution-1.cpp | /*
Author : Chaitaly Kundu
Date : 12/05/2024
Problem name : Set K-th bit of a number
Problem Link : https://www.geeksforgeeks.org/problems/set-kth-bit3724/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article
Level : Basic
Purpose : Learn Bit Manipulation
Topic Tag : Bit Manipulation... | ALGO | 0.999909 | 5.607489 |
08cb96a5-4835-4807-896c-7aea9fbd3e46 | Drashko73/UniversityProject-OOP-CPP | Code/main.cpp | /*
*
* ----------------------------------------------------------------------------
* Seminarski rad iz predmeta Praktikum iz objektno-orijentisanog programiranja
* Tema projekta: Sistemi za rukovodjenje projektima IT kompanije
* Autor: Radovan Draskovic 73/2021
* Datum: 08.07.2023.... | TOOL | 0.908279 | 3.924194 |
6dac7ff6-943e-4290-a299-1c566e2da217 | liuxiaochuang/Lintcode | test4.cpp |
#include<vector>
#include<iostream>
#include<limits.h>
#include<map>
#include<set>
using namespace std;
int partirion(vector<int> &nums, int start , int last) {
int x = nums[last];
int i = start;
int j = start ;
while (j != last+1) {
if (nums[i] > x) {
swap(nums[i], nums[j]);
... | ALGO | 0.99998 | 4.376758 |
62cf3e1f-9b09-4591-a213-e891de9cf472 | hanb613/Algorithm | BOJ/C++/BOJ_11057번/11057번, 오르막 수.cpp | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include <string>
#include <string.h>
#include <math.h>
#include <queue>
#include <tuple>
using namespace std;
#pragma warning(disable:4996)
typedef long long ll;
#define MOD 10007
int n, result;
ll dp[1001][10];
int ma... | ALGO | 0.999794 | 4.366463 |
8787b3ec-0aaf-451e-8250-8678c069ea28 | kundan6930/coding_contest | atcoder/THIRD PROGRAMMING CONTEST 2023 ALGO（AtCoder Beginner Contest 318）/A_Full_Moon.cpp | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main (){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m,p;
cin>>n>>m>>p;
n=n-m;
int ans=0;
if(n>=0)
{
ans++;
}
ans+=(n/p);
cout<<ans<<endl;
return 0;
} | ALGO | 0.999858 | 3.722855 |
2c043340-dbfd-4fad-a804-4776bafb0e72 | ishandutta2007/codeforces | fop_zzz/normal/794/B.cpp | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<algorithm>
#include<queue>
#define For(i,j,k) for(int i=j;i<=k;++i)
#define Dow(i,j,k) for(int i=k;i>=j;--i)
#define ll long long
#define inf 1e9
#define pb push_back
#define local freopen("in.in","r",stdi... | ALGO | 0.999915 | 3.015669 |
c97c5d9a-6d55-473e-b49d-e82d134d0861 | Pukala/Templates_Book | CAPTURE1/OverloadingFunctionTemplate.cpp | #include <iostream>
#include <cstring>
/*
Be careful to use T&
*/
// maximum of two values of any type (call-by-reference)
template<typename T>
const T& max(const T& a, const T& b)
{
return b < a ? a : b;
}
// maximum of two C-strings (call-by-value)
char const* max (char const* a, char const* b)
{
retur... | TOOL | 0.991519 | 5.537564 |
abbfc041-3fea-4d5f-91d0-d0cb25661ac0 | alexandraback/datacollection | solutions_5765824346324992_0/C++/HarryQuake/ProgramB.cpp | #include <iostream>
#include <string>
#include <sstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
freopen("D:\\GoogleCodeJam\\in.txt","r",stdin);
freopen("D:\\GoogleCodeJam\\out.txt","w",stdout);
int TestNum = 0;
cin >> TestNum... | ALGO | 0.99985 | 3.572554 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.