uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
7bd5e178-c30b-4410-bf97-754ec8c67b5e | MandaKausthubh/CP_Journey | 04_ValueAddedCourse/01_MathandImplementation/Grasshopper.cpp | #include <bits/stdc++.h>
using namespace :: std;
int main(void) {
int test, x, k, a; cin >> test;
for(int i_ = 0; i_ < test; i_++){
cin >> x >> k;
if(x % k != 0) cout << 1 << endl << x << endl;
else {
cout << 2 << endl << x-1 <<' '<< 1 << endl;
}
}
return 0;
... | ALGO | 0.999603 | 3.839787 |
0779fb3b-2596-41aa-80d3-8cceccf6f940 | dhruvvgandhi/Computer_Graphics | SUHO.CPP | /* Polygon Clipping
c13-55 */
#include<stdio.h>
#include<graphics.h>
#include<math.h>
typedef struct
{
float x;
float y;
}PT;
int n;
main()
{
int i,j,gd,gm;
PT d,p1,p2,p[20],pi1,pi2,pp[20];
detectgraph(&gd,&gm);
initgraph(&gd,&gm,"");
printf("Enter coordinates (left,top) of point1 : ");
scanf("%f,%f",&p1.x,&p1.y);
p... | ALGO | 0.999897 | 3.518048 |
1704227b-b80f-47d5-8d32-9f149d8da696 | aprgproject/aprg_sandbox | AprgAlgebra/AprgAlgebra/src/Algebra/Solution/Solver/MultipleLinearEquations/LinearEquationsEqualitySolver.cpp | #include "LinearEquationsEqualitySolver.hpp"
#include <Algebra/Equation/EquationUtilities.hpp>
#include <Algebra/Retrieval/ExponentsRetriever.hpp>
#include <Algebra/Retrieval/VariableNamesRetriever.hpp>
#include <Algebra/Term/Utilities/ConvertHelpers.hpp>
#include <Algebra/Term/Utilities/CreateHelpers.hpp>
#include <A... | ALGO | 0.999941 | 5.192377 |
c4bed4eb-b855-485c-8b0a-aac715a9fa6c | AleksPopova/All-Homework | 11.11.18-HW3-Prime/5.cpp | /*
Напишите программу, заменяющую составные числа на их самые большие простые делители.
*/
#include <iostream>
using namespace std;
bool pr(int x)
{
int k = 0;
if (x == 1)
{
return 0;
}
else
{
for (int i = 2; i <= (x / 2); i++)
{
if ((x % i) == 0)
{
return 0;
break;
k++;
};
};
if (... | ALGO | 0.999952 | 4.788606 |
82eaa3eb-b23b-4b64-9fe5-d8173e01f32e | mass-Eve/journey-with-cpp | Day05/02-fibonacci-series/03-recursion.cpp | // 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,
#include<iostream>
using namespace std;
// A function to print the fibonacci series upto n-terms, recursively
int fibTerms(int n)
{
if (n <= 1){
return n;
}
else{
return fibTerms(n - 1) + fibTerms(n - 2);
}
}
// To print the terms
void printFibonacc... | ALGO | 0.996822 | 4.532748 |
74084e39-f690-4a49-8ab1-bdb1c9edd5b4 | Alkanoor/furry-pancake-plus-plus | tests/annealing_robot_test/simulated_annealing_on_pid.cpp | #include "simulated_annealing_on_pid.h"
Simulated_annealing_on_PID::Simulated_annealing_on_PID(const std::function<void(uint32_t, uint32_t, uint32_t)>& reset_pid, const std::function<bool(double&, double&)>& move_and_measure, double k, double k_prim, const PID& initial_pid, double initial_temperature, size_t n_iterati... | ALGO | 0.999715 | 5.749139 |
3ad4e8e1-94ac-4ec6-8a56-7217b8011731 | nazmulh24/Basic_CPP_Code | Codeforces/800/Watermelon.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int w;
cin >> w;
if (w == 2)
cout << "NO" << endl;
else if (w % 2 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| ALGO | 0.999584 | 3.709013 |
c970ec51-720b-48fa-9d9a-3c7802fe886a | Clixxzydev/FN-UnrealBuildver4.26 | Engine/Source/ThirdParty/PhysX3/PhysX_3.4/Source/GeomUtils/src/contact/GuContactCapsuleCapsule.cpp | #include "GuContactBuffer.h"
#include "GuDistanceSegmentSegment.h"
#include "GuContactMethodImpl.h"
#include "GuInternal.h"
#include "GuGeometryUnion.h"
using namespace physx;
namespace physx
{
namespace Gu
{
bool contactCapsuleCapsule(GU_CONTACT_METHOD_ARGS)
{
PX_UNUSED(renderOutput);
PX_UNUSED(cache);
const PxC... | ALGO | 0.989767 | 6.917675 |
77b44ad5-8b3e-4db5-bab0-0006323d6519 | ylyking/UnrealEngineNiv | Engine/Source/Runtime/Core/Private/Android/AndroidPlatformBacktrace.cpp | /*=============================================================================
AndroidPlatformStackWalk.cpp: Android implementations of stack walk functions
=============================================================================*/
#include "CoreMinimal.h"
#include "HAL/UnrealMemory.h"
#include <signal.h>
#incl... | TOOL | 0.863647 | 5.724887 |
ce5a14b8-2f84-4a66-8988-655057160da3 | joy-mollick/Segment-Tree-And-Divide-And-Conquer | HackerEarth-Help Ashu(BIT).cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int BIT[100005];
int arr[100005];
void update(int x,int val)
{
for(int X=x;X<=n;X += X&-X)
{
BIT[X]+=val;
}
}
ll query_sum(int x)
{
ll sum=0;
for(int X=x;X>0;X-=X&-X)
{
sum+=BIT[X];
}
re... | ALGO | 0.999922 | 4.404435 |
1120641d-71ee-4e59-a385-09ae8b3f936a | DibloTempest/ThinhLucifer | CPP/DP-HIEU-HAI-SO-LON-NHAT-TRONG-MANG.cpp | #include <bits/stdc++.h>
using namespace std;
long long a[1000004], f[1000004], d, n;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
f[n] = a[n];
for (int i = n - 1; i >= 1; i--)
{
f[i] = max(f[i + 1], a[i]);
}
d = -1e18;
for (int i = 1; i <= n - 1; i++)... | ALGO | 0.999956 | 3.836818 |
0d1ba018-9e43-46e6-ac33-7ef6656bffaf | Nexisato/LeetCodeDiary | TestRepo/24-09-22-Bytedance/q3.cpp | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
string S;
cin >> S;
int res = 0;
for (int i = 1; i < n; ++i) {
if (S[i] == S[i - 1]) {
if (S[i] >= 'a' && S[i] < 'z') {
... | ALGO | 0.999831 | 4.050313 |
393c0070-e2b9-4c1a-80ba-9a9909768121 | JaeNew/Leetcode-MySubmit | 128.最长连续序列.cpp | /*
* @lc app=leetcode.cn id=128 lang=cpp
*
* [128] 最长连续序列
*
* https://leetcode-cn.com/problems/longest-consecutive-sequence/description/
*
* algorithms
* Hard (41.43%)
* Total Accepted: 5.2K
* Total Submissions: 12.5K
* Testcase Example: '[100,4,200,1,3,2]'
*
* 给定一个未排序的整数数组，找出最长连续序列的长度。
*
* 要求算法的时间复... | ALGO | 0.999866 | 5.411704 |
037b122e-7712-4db7-aa83-db72f9a2beae | Turjo7/Algorithms | Dijektra Trial Version.cpp | #include<stdio.h>
#include<conio.h>
#define INFINITY 2000
#define MAXNODES 4
#define MEMBER 1
#define NONMEMBER 0
void shortpath(int weight[][MAXNODES], int , int ,int * ,int precede[]);
int main(void)
{
int i,j,s,t;
int weight[MAXNODES][MAXNODES],precede[MAXNODES],pd;
printf("\n Enter weight matrix ");
for... | ALGO | 0.999965 | 3.479941 |
879f10bf-c16d-4886-b4fa-faa47cef66c1 | Relph1119/cpp-red-book | beginning/assets/ch05/Ex5_06.cpp | // Using a do-while loop to manage input
#include <iostream>
#include <cctype> // For tolower() function
int main()
{
char reply {}; // Stores response to prompt for input
int count {}; // Counts the number of inp... | TOOL | 0.976885 | 5.474902 |
32b1fb2b-b6be-438e-9dff-f1f5c2da3181 | wonda-tea-coffee/yukicoder | 1005.cpp | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sort(a) ... | ALGO | 0.999709 | 3.856843 |
9993d183-d501-4989-bd86-65d10802e619 | amandeep-saluja/Data-Structures-Algorithms-Essentials-using-Cpp | Practice/Section 11 Backtracking/N-Queen_Problem.cpp | #include <iostream>
using namespace std;
void printBoard(int n, int board[][20])
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
cout << board[i][j] << " ";
}
cout << endl;
}
cout << endl;
}
bool canPlace(int board[][20], int n, int x, int y)
{... | ALGO | 0.999727 | 5.601189 |
84a4ba73-7927-4da1-9995-8dc2cebbec8c | OMR125/CodeForces-Solutions | CodeForces/GNU C++17/1328A | Divisibility Problem/119490969.cpp | #include<iostream>
using namespace std;
int main()
{
int n,cnt=0;
cin >> n;
int a,b;
for(int j=0;j<n;j++){
cin >>a>>b;
if(a%b!=0){
cout << b-(a%b) << endl;}
else{
cout <<0 << endl;
}
... | ALGO | 0.999924 | 3.000726 |
6ec1aa59-2717-43df-bd61-b9d33b7960fe | rijulsharma7/problemsolving | codeforces/perfectlyImperfectArray.cpp | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using mi = map<int, int>;
using ml = map<ll, ll>;
using umi = unordered_map<int, int>;
using uml = unordered_map<ll, ll>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using ti = tuple<int, int, int>... | ALGO | 0.999038 | 4.07725 |
5320d2af-128b-402c-a33e-1aecd2b75e96 | Dipto-shaha/LeetCode-Daily-Challenge | 1472-design-browser-history/1472-design-browser-history.cpp | class BrowserHistory {
public:
vector<string>s;
int current=-1,last=0;
BrowserHistory(string homepage) {
s.resize(101);
current++;
s[current]=homepage;
last=current;
}
void visit(string url) {
current++;
s[current]=url;
last=current;
}... | ALGO | 0.994825 | 5.583639 |
9130e133-bb32-4a0c-93eb-2257ea53a555 | DivyanshuSinghania/My-Tracker | Scratch_Implementations/venv/lib/python3.11/site-packages/sklearn/svm/src/liblinear/tron.cpp | #include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include "tron.h"
#ifndef min
template <class T> static inline T min(T x,T y) { return (x<y)?x:y; }
#endif
#ifndef max
template <class T> static inline T max(T x,T y) { return (x>y)?x:y; }
#endif
static void default_print(const char *buf)
{... | ALGO | 0.999544 | 5.847107 |
ab5f915d-f3cc-400a-bde4-8834431ac49a | hieupham1103/TINHOC | SCHOOL/Thay Duong/Prob/MATRIX.cpp | #include<bits/stdc++.h>
#define ii pair <int,int>
#define fi first
#define se second
#define int long long
#define double long double
#define endl '\n'
using namespace std;
int const maxN = 2 * 1e6 + 10;
int prefix[maxN];
int f[maxN];
bool notPrime[maxN];
void init(){
for (int i = 2; i * i <= maxN; i++){
... | ALGO | 0.999925 | 4.19915 |
87aed175-0d0a-4e36-a14f-fe0d9d09cdcc | Bikash9841/microMouseROS | Maze.cpp | #include "Maze.h"
uint8_t cells[16][16] = { { 11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,... | ALGO | 0.99943 | 4.740763 |
e844617e-205b-45f0-8a65-e1591a1f5c7d | sarthakgit21/Placement-Preparation-Program | 0050-powx-n/0050-powx-n.cpp | class Solution {
public:
double myPow(double x, int n) {
long val=abs(n);
double ans=1;
while(val){
if(val&1){
ans*=x;
}
x*=x;
val>>=1;
}
if(n<0) return 1/ans;
return ans;
}
}; | ALGO | 0.999815 | 5.970074 |
b45e66d0-7630-43ce-853b-ae69f290020b | Dhruv-2134/6Companies30Days | Company-4 (Flipkart)/que10.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
vector<int> rearrangeBarcodes(vector<int>& b) {
int m[10001] = {};
int max_cnt = 0, max_n = 0, pos = 0;
for (auto n : b) {
max_cnt = max(max_cnt, ++m[n]);
max_n = max_cnt == m[n] ? n : max_n;
... | ALGO | 0.999969 | 5.116134 |
9f5e0961-a624-46ce-a37e-dcca48125454 | oanoan16/Code-Cpp | Tin2/SoNhoNhatTrong3So.cpp | #include <bits/stdc++.h>
#define faster() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
int main()
{
faster();
float a,b,c,d;
cin >> a >> b>> c;
printf("%g",min(min(a,b),c));
return 0;
}
| ALGO | 0.999908 | 3.419643 |
ddf12bc8-1a50-48d1-8862-18889626fac8 | vinaytheprogrammer/LeetCode_Codes | 0016-3sum-closest/0016-3sum-closest.cpp | class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int n = nums.size();
if (n < 3) return 0; // Edge case: if less than 3 numbers, return 0 or handle accordingly
int closest = nums[0] + nums[1] + nums[2]; // Initialize closest to the sum of the first three... | ALGO | 0.999998 | 6.78238 |
2ad3eba8-596f-4cee-bcf9-dd7798c4586c | Vdtpro/DSA | Ngăn xếp hàng đợi/Di chuyển trong ma trận/Queue.cpp | #include<bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#define file() freopen("Test2.inp", "r", stdin); freopen("Test2.out", "w", stdout);
#define faster() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pq_min priority_queue<int, vector<int>, greater<int>>... | ALGO | 0.999776 | 4.788807 |
d777f799-89ea-4d28-830b-40bf37d66d4b | ernesto-official02/MCA_PEP_CPP | 04_pointers/01.cpp | //understanding pointers in cpp
#include<iostream>
using namespace std;
int main()
{
int var =5;
cout<<"here's the address or variable named as var"<<endl;
cout<<&var<<endl;//address
int *get= &var;
//pointer refrencing
cout<<get<<endl;//address
//pointer dereferencing // getting or acc... | TOOL | 0.990351 | 3.749145 |
ac6dee1c-f1a2-4f4b-8ecf-6a4c9431a626 | bigboxcoin/bbx | src/addrman.cpp | #include "addrman.h"
using namespace std;
int CAddrInfo::GetTriedBucket(const std::vector<unsigned char> &nKey) const
{
CDataStream ss1(SER_GETHASH, 0);
std::vector<unsigned char> vchKey = GetKey();
ss1 << nKey << vchKey;
uint64_t hash1 = Hash(ss1.begin(), ss1.end()).Get64();
CDataStream ss2(SER_... | ALGO | 0.971193 | 6.271472 |
0f50a24d-7d00-4df6-9f1a-674599847d6c | Altius01/heatsolver | heatsolver/src/inverse_solver.cpp | #include "inverse_solver.h"
#include <osqp++.h>
#include <Eigen/Sparse>
#include <iostream>
#include <memory>
#include "view.h"
#include "view_impl.h"
namespace heatsolver {
using SpMat = Eigen::SparseMatrix<InverseSolver::value_type>;
using SpVec = Eigen::SparseVector<InverseSolver::value_type>;
using Vec = Eigen... | ALGO | 0.998481 | 5.608199 |
96f23c8e-23c2-44ea-a547-6f5f34b6b26d | azecoder/Problem-Solving | E-olimp/6040. Triangles .cpp | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <c... | ALGO | 0.99937 | 4.04545 |
1c48bb64-e484-4a59-8eb5-ee7123cbe6a9 | AlexanderLukashuk/MyRepository | source/homework_STEP/overload_functionTemplates/32_b_hw17.cpp | #include <iostream>
#include <time.h>
using namespace std;
const int SIZE = 10;
template <typename T, typename I>
T func(T array[], I size)
{
T sum = 0;
for (int i = 0; i < SIZE; i++)
{
sum += array[i];
}
sum /= size;
return sum;
}
int main()
{
srand(time(0));
int array_Int[... | ALGO | 0.9972 | 4.350377 |
e0a9d52f-b526-400f-97d8-a95bc3ea6042 | cdht/Algorithm | CC150/20.12.cpp | /*
Given an NxN matrix of positive and negative integers, write code to find the submatrix with the largest possible sum.
*/
#include <vector>
#include <iostream>
#include <climits>
using namespace std;
//brute force O(n^6)
int maxSum(vector<vector<int> >& mat)
{
int sum = INT_MIN;
int n = mat.size();
//a,b... | ALGO | 0.999908 | 4.623645 |
8869c374-538f-4be4-8490-182fd8380fd0 | ngocnhi030402/assignment-ktlt | Assignment1-ktlt/adding_e/adding_e.cpp | // adding_e.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <iostream>
#include <iomanip>
#include <cmath>
#include <fstream>
#include <string>
#include <vector>
using namespace std;
string hmuhmu(string s) {
string a, b;
for (int i = 0; i < s.length(); i++) {
if ... | ALGO | 0.999316 | 3.683913 |
5b856873-d6ce-48af-b9b8-6cc91a9127ee | thermotools/lammps_mie_fh | src/SPIN/pair_spin_exchange.cpp | // clang-format off
/* ------------------------------------------------------------------------
Contributing authors: Julien Tranchida (SNL)
Aidan Thompson (SNL)
Please cite the related publication:
Tranchida, J., Plimpton, S. J., Thibaudeau, P., & Thompson, A. P. (2018).
Massivel... | ALGO | 0.997039 | 6.174263 |
b642406a-a0e0-4229-bf48-53f0b99ec01f | wondol2/ps | problems/baekjoon/14924.cpp | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include "debug.h"
#else
#define debug(x)
#endif
void solve(){
int S, T, D; cin >> S >> T >> D;
cout << T * D/(2*S) << "\n";
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin.exceptions(cin.failbit);
int T=1... | ALGO | 0.998075 | 3.774344 |
e01a4e5f-b764-494b-bdbb-00f1b8029be6 | ishassan/ProblemSolving | InterviewStreet/Lucky Numbers_building.cpp | #include <stdio.h>
const int MAX_LENGTH = 18;
const int MAX_SUM = 162;
const int MAX_SQUARE_SUM = 1458;
int primes[1460];
unsigned long long dyn_table[20][164][1460];
//changed here.......1
unsigned long long ans[19][180][1482]; //about 45 MB
int start[19][163];
int end[19][163];
//upto here.........1
void gen_prime... | ALGO | 0.998609 | 4.201927 |
5b5594f1-111e-4a44-9fdb-b4c3a98aabc6 | oneandtok/AdventOfCode2020 | Day8/day8_2.cpp | #include <tuple>
#include <vector>
#include <fstream>
#include <iostream>
#include <unordered_map>
int main() {
std::ifstream ifs("day8_input.txt");
if (!ifs) {
std::cout << "Failed to open the input file." << std::endl;
return 1;
}
std::string read_line;
std::vector<std::pair<std:... | ALGO | 0.999544 | 6.250145 |
2f1905ee-16ee-41ae-a548-c7290e97bbf8 | yuii88/View_detection_python | opencv/opencv-master/3rdparty/carotene/src/add.cpp | #include "common.hpp"
#include "vtransform.hpp"
namespace CAROTENE_NS {
#ifdef CAROTENE_NEON
namespace {
template <typename T, typename WT>
struct AddWrap
{
typedef T type;
void operator() (const typename internal::VecTraits<T>::vec128 & v_src0,
const typename internal::VecTraits<T>::v... | TOOL | 0.984522 | 6.213745 |
610e284d-b4ae-4ec4-99b2-9cb74c04519e | ktevans/GEn_QA | src/Analysis.cpp | #include <iostream>
#include "../include/Analysis.h"
#include "../include/FF_param.h"
// This script calculates the variables for GE/GM extraction.
void UpdateAverageKinematics(analyzed_tree *T){
SetHe3PolAngle(); // Sets the He3 polarization value/direction
TLorentzVector Pe(0,0,T->ebeam,T->ebeam); // inco... | ALGO | 0.996806 | 4.780251 |
7105d546-5bae-4fb7-8955-2cfb4c21eac6 | cggos/multicore_gpu_programming | Chapter6_GPU/AES_MPI/main.cpp | #include <stdio.h>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <sys/time.h>
#include <assert.h>
#include <string.h>
#include <ctime>
#include <mpi.h>
#include "rijndael.h"
using namespace std;
#define TAG_RES 0
#define TAG_WORK 1
#define TAG_DATA 2
static const int keybits = 256;
//*******... | ALGO | 0.998666 | 3.005963 |
bc78dcc9-6101-4fa6-8c11-ce8ae7cf3e47 | dimits-ts/Templated-Minimax-with-Othello-example | othello/ReversiState.cpp | #include "ReversiState.h"
using namespace std;
ReversiState::ReversiState(PLAYER p, PLAYER CPU_SYMBOL, const Board& other_board) : CPU_SYMBOL(CPU_SYMBOL), board(other_board), turn(p) {}
Board ReversiState::getBoard() const {
return board;
}
bool ReversiState::operator==(const ReversiState& other) const {
return t... | ALGO | 0.998119 | 4.434346 |
37a93d60-3c77-4072-8202-8ddbb37382ea | cssl-unist/trust-sec23 | rust/src/llvm-project/clang/lib/Analysis/ThreadSafetyLogical.cpp | #include "clang/Analysis/Analyses/ThreadSafetyLogical.h"
using namespace llvm;
using namespace clang::threadSafety::lexpr;
// Implication. We implement De Morgan's Laws by maintaining LNeg and RNeg
// to keep track of whether LHS and RHS are negated.
static bool implies(const LExpr *LHS, bool LNeg, const LExpr *RHS,... | ALGO | 0.998119 | 7.771601 |
9ae5dd28-7d3d-4d5c-beed-2e68e05a4cca | miaomao1989/program_test | c++/mm-temp/9/9-20.cpp | #include <iostream>
#include <list>
#include <vector>
using namespace std;
bool
isSame(const vector<int> & ivec, const list<int> & ilst)
{
if (ivec.size() != ilst.size())
return false;
else {
vector<int>::const_iterator vec_itar = ivec.begin();
list<int>::const_iterator lst_itar = ilst.begin();
while (vec_i... | TOOL | 0.969704 | 4.384525 |
e368ee30-87b2-4e01-b1de-c47ddad9d5f0 | TaeYongHwang/HyHIT | Taeyong/snail.cpp | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int N, M; // n : , m : ϼ
double cache[1001][1001]; //cache[i][j] : i Ұ, j 쿡 ް Ȯ.
//i,j ᱹ ڿ -> 0ϴ 쿡 ó.
//Ȯ ϴ ̱ , 쿡 1 ,
// 쿡 0 Ǵ
double find_possible_cases(int row, int col)
{
cout.precision(10);
double & ret ... | ALGO | 0.999761 | 4.302643 |
51e9a3f3-0d1a-42db-80ea-a3542c9b36fe | ptargino/uvaOnlineJudge | C++/Volume CI/p10189.cpp | #include <stdio.h>
#include <string.h>
int main() {
int n, m, i, j, count = 1;
char word[101], mine[102][102];
bool first = true;
while (scanf("%d%d", &n, &m) == 2 && n && m) {
for (i = 0; i < 102; i++)
for (j = 0; j < 102; j++)
mine[i][j] = '.';
if (first) first = false;
else putchar('\n');
gets(w... | ALGO | 0.99943 | 3.112684 |
fb9a13cd-35a3-4021-b957-6dca7d922c7a | yfxiao/MCMV2_HW1 | Drivers/CMSIS/NN/Examples/IAR/iar_nn_examples/NN-example-gru/arm_nnexamples_gru.cpp | /**
* @ingroup groupExamples
*/
/**
* @defgroup GRUExample Gated Recurrent Unit Example
*
* \par Description:
* \par
* Demonstrates a gated recurrent unit (GRU) example with the use of fully-connected,
* Tanh/Sigmoid activation functions.
*
* \par Model definition:
* \par
* GRU is a type of recurrent neura... | ALGO | 0.915252 | 7.471897 |
c06f1eb6-7f07-420b-a2a9-516aba88be37 | Toufik-Islam/XPSC_Phitron | Week 4/Day 1/Alt_Tab.cpp | /*
\~~~~~~~~~~~~~~~~~\
\ TOUFIK \
\ ISLAM \
\~~~~~~~~~~~~~~~~~\
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define nl '\n'
#define md 1000000007
#define Faster \
ios_base::sync_with_std... | ALGO | 0.999998 | 5.021823 |
41cbca4a-8980-498e-8676-dfe37bcbe88a | ranshaobaichi/Leetcode | Faceinterview-150/130surroundedArea/surroundedArea.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution {
private:
vector<vector<bool>> visited;
public:
bool dfs(vector<vector<char>>& board, int x, int y)
{
if (x < 0 || y < 0 || x >= board.size() || y >= board.size())
return true; // do... | ALGO | 0.999925 | 5.803507 |
c4f0f1cc-8d37-4211-b7ef-2c3fa60fcd7f | joydip007x/CompetitiveCodeArchive | UVA/11475/19934590_CE_0ms_0kB.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz 100000+1000
char s1[sz] ,s2[sz] ;
ll lps[sz] ;
void lpscalc( char pat[]){
int i=1, len=0;
lps[0]=0;
while(i<strlen(pat)){
if(pat[i]==pat[len]){
lps[i]=len+1;
len++;
i++;
}
else{
if(len... | ALGO | 0.999991 | 3.548246 |
069225f4-5ac1-4f87-a050-275386a43b23 | batoolhalaweh/CompetitiveProgramming | Cpp/Codeforce/AlmostRectangle.cpp | #include <bits/stdc++.h>
using namespace std;
#define FOR(n) for(int i = 0; i < int(n); ++i)
#define RFOR(n) for(int i = int(n); ~i; --i)
#define FORI(i, n) for(int i = 0; i < int(n); ++i)
#define NL '\n'
void solve() {
int n;
cin >> n;
vector<string> s(n);
for(int i = 0; i < n; ++i) {
cin >>... | ALGO | 0.999914 | 4.339742 |
813d0cf2-ce21-48e9-9d1d-2584eac31ec0 | Dartpixel/Competitive-Coding | CODECHEF/TIMELY.cpp | #include <iostream>
using namespace std;
int main()
{
int testcase, n;
cin >> testcase;
while (testcase--)
{
cin >> n;
if (n >= 30)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
}
return 0;
}
| ALGO | 0.99973 | 4.160398 |
a75d1b5a-b148-4996-8d08-f351e12dd4e8 | nourkidoudi/systeme-solaire- | 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.998799 | 6.776823 |
7586902d-b12e-4106-8acf-7ebccf59c318 | eshohag/leetcode | solution/0000-0099/0056.Merge Intervals/Solution2.cpp | class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
sort(intervals.begin(), intervals.end());
vector<vector<int>> ans;
ans.emplace_back(intervals[0]);
for (int i = 1; i < intervals.size(); ++i) {
if (ans.back()[1] < intervals[i][0]) {
... | ALGO | 0.999998 | 6.227956 |
54d021dc-1d62-4dec-a310-eb560393f382 | RRRdik/F2M3BO-AME | mainmenu/Library/PackageCache/com.unity.ide.visualstudio@2.0.14/Editor/COMIntegration/COMIntegration~/COMIntegration.cpp | #include <iostream>
#include <sstream>
#include <string>
#include <filesystem>
#include <windows.h>
#include <shlwapi.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 made to Visual Studio can fail after ... | TOOL | 0.938915 | 6.969462 |
39e44a9c-d937-47e4-88f8-8e4f70e58b10 | raincross7/code-similarity | codes/train_code/problem268/problem268_380.cpp | #include <bits/stdc++.h>
using namespace std;
int f(int n) {
if (n % 2 == 0) return n / 2;
else return 3 * n + 1;
}
int main() {
int s;
cin >> s;
set<int> S;
S.insert(s);
for (int i = 1; i <= 1e6; i++) {
s = f(s);
if (S.count(s)) {
cout << i + 1 << endl;
... | ALGO | 0.99999 | 4.316368 |
ccbb8a77-1cbd-4949-a8ab-a0d5d1d12d62 | estebanramirezm/Fundamentals-Of-Programming | lab-5-estebanramirezm/lab05.cpp | /*
Lab #6
Purpose: This program computes floating-point values according to certain equations for a, b, c, d, x, y, and z given floating-point values a, b, c, and d
Author: Esteban Ramirez
Date: Feb 17th, 2022
*/
#include <iostream>
#include <math.h>
using namespace std;
// This function computes floating-poi... | ALGO | 0.997854 | 3.345864 |
730142ec-5939-405e-9d61-7347b7a92272 | vikram-rathore1/competitive_programming | codechef/FEB17/SEAINVS/seainvs_small_accepted.cpp | #include<bits/stdc++.h>
using namespace std;
int t, n, m, l1, r1, l2, r2, p[100000], s; // q is current permutation, s is number of elements in q (window size)
long long perms;
vector<vector<int> > options; // options available for each index in the permutation Q
vector<pair<int, int> > number_sets(100000);
int ... | ALGO | 0.999916 | 4.091325 |
183e2c8b-630c-4f52-8d95-443411c4ada9 | AhJo53589/leetcode-cn | problems/sort-array-by-parity/SOLUTION.cpp |
//////////////////////////////////////////////////////////////////////////
class Solution {
public:
vector<int> sortArrayByParity(vector<int>& A)
{
int l = 0;
for (int r = 0; r < A.size(); r++)
{
if ((A[r] & 1) != 0) continue;
swap(A[l++], A[r]);
}
... | ALGO | 0.999964 | 5.3901 |
1c89bc08-0518-4115-be4c-a24dbda81876 | liubang/leetcode | src/56.merge-intervals.cpp | // Authors: liubang (<EMAIL>)
#include <algorithm>
#include <gtest/gtest.h>
#include <vector>
namespace {
class Solution {
public:
std::vector<std::vector<int>> merge(std::vector<std::vector<int>>& intervals) {
if (intervals.size() <= 1) {
return intervals;
}
std::sort(interva... | ALGO | 0.99995 | 6.472067 |
e90aa4ca-f692-4b6a-82da-d55d00dcef79 | devesh1808/DSA | Linked List - I/leetcode 2 - Add Two Numbers as Linked List.cpp | ListNode *addTwoNumbers(ListNode *l1, ListNode *l2)
{
ListNode *head = new ListNode(0);
ListNode *temp = head;
int carry = 0;
while (l1 != NULL || l2 != NULL || carry != 0)
{
int sum = 0;
if (l1 != NULL)
{
sum += l1->val;
l1 = l1->next;
}
... | ALGO | 0.999455 | 5.352945 |
98b9d628-4975-45a7-a97e-671121c4d5c3 | XDEv11/Codeforces | Round#958_div2/B.cpp | //#pragma GCC optimize ("O3")
#include <iostream>
#include <vector>
using namespace std;
namespace {
void solve() {
int n;
cin >> n;
vector<char> v(n);
for (auto& x : v) cin >> x;
int c0{}, c1{};
for (int i{0}; i < n; ++i) {
if (v[i] == '0') c0 += (!i || v[i - 1] != '0');
else ++c1;
}
cout <... | ALGO | 0.99998 | 5.740802 |
c66de8bf-6eef-4db5-b5f5-fd3ebead6a76 | amansingh-gh/CPP-DSA | LCQ/aggressive_cows.cpp | // Aggressive Cows
//{ 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:
bool isPossibleSol(vector<int>&stalls, int k, int mid){
int c =1;
int pos = stalls[0];
for(... | ALGO | 0.999982 | 6.021276 |
c0cdec29-6904-49a2-8936-90959b1081d4 | Foxnatic/platform_system_core | init/action_parser.cpp | #include "action_parser.h"
#include <ctype.h>
#include <android-base/properties.h>
#include <android-base/strings.h>
#ifdef INIT_FULL_SOURCES
#include "property_service.h"
#include "selinux.h"
#else
#include "host_init_stubs.h"
#endif
using android::base::GetBoolProperty;
using android::base::StartsWith;
namespace... | TOOL | 0.889156 | 6.990397 |
c7d909a2-cbb8-4667-9e6e-4910b2603ba4 | vaibhav-sharma-dev/DSA_Concepts | Algorithms/kadane's_algo.cpp | // kadane's algo to find max sub-array sum
// -1, 4, 7, 2
#include <iostream>
using namespace std;
int main()
{
int size;
cin >> size;
int arr[size];
for (int i=0; i<size; i++)
cin >> arr[i];
int curr_sum = 0;
int max_sum = INT_MIN;
for (int i=0; i<size; i++)
{
if (... | ALGO | 0.999963 | 4.575101 |
7fcc0e6b-d23a-4718-9250-de96752f084c | dzungpng/Mass-spring-volumetric-simulation | Deps/libigl/tutorial/706_FacetOrientation/main.cpp | #include <igl/read_triangle_mesh.h>
#include <igl/randperm.h>
#include <igl/orientable_patches.h>
#include <igl/slice.h>
#include <igl/hsv_to_rgb.h>
#include <igl/embree/reorient_facets_raycast.h>
#include <igl/opengl/glfw/Viewer.h>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
igl::opengl... | ALGO | 0.881186 | 6.768081 |
6ab21494-aeb6-42cc-a518-7c8b92f4362c | brianbbsu/8BQube | codebook/3_Data_Structure/link_cut_tree.cpp | struct Splay { // xor-sum
static Splay nil;
Splay *ch[2], *f;
int val, sum, rev, size;
Splay (int _val = 0) : val(_val), sum(_val), rev(0), size(1)
{ f = ch[0] = ch[1] = &nil; }
bool isr()
{ return f->ch[0] != this && f->ch[1] != this; }
int dir()
{ return f->ch[0] == this ? 0 : 1; }
void setCh(Spla... | ALGO | 0.999949 | 4.08897 |
970d5a64-bcd5-4736-9c3c-07f790f16732 | harsha20599/algorithms | consecutive_prime_numbers.cpp | #include<iostream>
using namespace std;
int main(){
int primes[100],limit,factors,end=0,key,count=0,sum;
cout<<"Enter the range of prime numbers to be considered : ";
cin>>limit;
for(int i =2; i<=limit;i++){
factors = 0;
for(int j = 2;j<i;j++){
if(i%j == 0){
factors++;
}
}
... | ALGO | 0.99981 | 3.640422 |
4b23dfab-3bd1-471e-a591-8d902262e00e | ehnryx/acm | codeforces/1279/a.cpp | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;... | ALGO | 0.999957 | 5.084751 |
f8b86bd2-9354-4362-a70c-9f4d9a78f96c | weizhouUMICH/SAIGE | thirdParty/bgen/3rd_party/boost_1_55_0/libs/numeric/odeint/examples/vexcl/lorenz_ensemble.cpp | #include <iostream>
#include <vector>
#include <vexcl/vexcl.hpp>
#include <boost/numeric/odeint.hpp>
//[ vexcl_includes
#include <boost/numeric/odeint/external/vexcl/vexcl_resize.hpp>
//]
namespace odeint = boost::numeric::odeint;
//[ vexcl_state_types
typedef vex::vector< double > vector_type;
typedef vex::mult... | ALGO | 0.999682 | 6.022974 |
c44765e2-e43f-4d92-9ada-8965e24e8d01 | zeyuanxy/cpp-utils | concurrency/thread-safe/thread-safe-lookup-table/table.cpp | #include <mutex>
#include <list>
#include <vector>
#include <map>
#include "boost/thread/shared_mutex.hpp"
template <typename Key, typename Value, typename Hash=std::hash<Key>>
class threadsafe_lookup_table {
private:
class bucket_type {
private:
typedef std::pair<Key, Value> bucket_value;
type... | TOOL | 0.85655 | 6.518932 |
1ba70d0e-6ddf-46a1-b8fd-ee2cc58da320 | SkyLoaderr/xray-last-days | xray/xrGame/space_restriction_bridge.cpp | ////////////////////////////////////////////////////////////////////////////
// Module : space_restriction_bridge.cpp
// Created : 27.08.2004
// Modified : 27.08.2004
// Author : Dmitriy Iassenev
// Description : Space restriction bridge
////////////////////////////////////////////////////////////////////////////... | TOOL | 0.861794 | 5.835745 |
2719cf71-7ce6-449c-b3f1-d7f02f7b47fa | Yuuuuuu-xue/DataStructures_and_Algorithms | linked_list/partition_list/solution.cpp | #include <bits/stdc++.h>
using namespace std;
/**
* Definition for singly-linked list.
*/
struct ListNode {
int val;
ListNode *next;
ListNode() : val(0), next(nullptr) {}
ListNode(int x) : val(x), next(nullptr) {}
ListNode(int x, ListNode *next) : val(x), next(next) {}
};
class Solution {
public:
ListN... | ALGO | 0.999996 | 5.323779 |
2a92166c-39fa-4ea5-91f1-b61f087f22f9 | mostafa21314/Snake_Ladder_QT | Board.cpp | #include "Board.h"
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <iostream>
#include <random>
#include <ctime>
#include <queue>
#include <tuple>
Board::Board() {
}
// random board generation with size based on user input by creating random snakes and ladders and inserting them in a graph model ... | TOOL | 0.964008 | 4.383827 |
29f065c6-b6db-4e94-94fb-83c436e3ea00 | Prashant-thakur77/cp-31 | 1100 rating/27.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mod 1000000006
void solve() {
// Your code here
ll n,k;
cin>>n>>k;
vector<ll> v(n);
map<int,bool> mp;
... | ALGO | 0.999941 | 4.6197 |
626a0d53-0121-47ce-85fe-350491c0faf0 | 2002nitesh/Data-Structure-and-Algorithm | GRAPH/1.cpp | // Number of Provinces
// Problem Statement: Given an undirected graph with V vertices. We say two vertices u and v belong to a single province if there is a path from u to v or v to u. Your task is to find the number of provinces.
#include<bits/stdc++.h>
using namespace std;
class Solution {
private:
// dfs tr... | ALGO | 0.999958 | 5.856396 |
1ff18748-bbdc-4ea3-ae13-a949500d97d8 | Artlesbol/Cpp-practice-on-CGplatform | tasks of the 8th week/8-8.cpp | #include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<string>
using namespace std;
bool check(int n)
{
if(n==1)return 0;
for(int i=2;i<=sqrt(n);i++)
{
if(n%i==0)
return 0;
}
return 1;
}
int main()
{
... | ALGO | 0.99989 | 4.399158 |
dbd72509-de2e-4be4-bed3-098a7f47457f | Sumit-pd/DSA | strings/removeAllWhiteSpaces.cpp | void removeAllWhiteSpaces(string str){
int si = 0 , ei = 0 ;
for(int i = 0 ; i < str.length() ; i++ ){
if(str[i] != ' '){
si++ ;
ei++ ;
}
}
while (ei < str.length())
{
if (str[ei] != ' ')
{
str[si] = str[ei] ;
si++ ;
... | ALGO | 0.978102 | 3.844328 |
ba6953c1-6bcf-40ea-a9e5-e3c1fe434b35 | docongban/Zcode_CTDL-GT | Contest 4 chia va chi/floor_x.cpp | /*Code By BanDC*/
//VS Code
#include<bits/stdc++.h>
using namespace std;
long long arr[1000000];
void Nhap(long long n)
{
for(long long i=1;i<=n;i++) cin>>arr[i];
}
void Xu_li(long long n,long long x)
{
long long k=0;
for(long long i=n;i>0;i--)
{
if(arr[i]<=x)
{
k=i;
break;
}
}
if(k==0) cout<<-1;
els... | ALGO | 0.999935 | 4.537244 |
c7fbf600-0a03-46a0-91a7-935ea95f9f04 | Nilkantha452/Problems | Problems/Linked List/FindMiddleNode.cpp | /* Find the middle node in a linked list */
#include <iostream>
struct ListNode
{
int val;
ListNode* next;
ListNode(int x)
{
val = x;
next = nullptr;
}
};
ListNode* MakeList(int arr[], int n)
{
if (n == 0) return nullptr;
ListNode* newNode = new ListNode(arr[0]);
List... | ALGO | 0.999961 | 6.037822 |
bc48e38a-bc53-4fdd-a496-b641826f5b52 | aiswariya3/DSA0912-C- | 47. Largest Class.cpp | #include <iostream>
using namespace std;
class Largest {
int a, b, m;
public:
void setData(int x, int y, int z) {
a = x;
b = y;
m = z;
}
friend void find_Max(Largest l);
};
void find_Max(Largest l) {
int max = l.a;
if (l.b > max) max = l.b;
if (l.m > max) max = l.m... | ALGO | 0.998361 | 4.350434 |
cd59bdc5-a5b3-47fe-b279-56c86cc73863 | riyabaranwal/Decode-with-C-- | DP4/MCM.cpp |
#include<iostream>
#include<vector>
#include<climits>
using namespace std;
vector<vector<int> > dp;
int f(int i , int j , vector<int>&arr){
vector<vector<int> > dp;
if (i == j || i+1 == j)
{
return 0;
}
if(dp[i][j] != -1) return dp[i][j];
int ans = INT_MAX;
for(int k = i+1 ; k < j ... | ALGO | 0.99993 | 4.023388 |
f098ceae-d4b4-490c-a4ad-326ef781aa47 | ChuanzhouYao/zkSNARK-LLVM | libs/circifier/libcxx/test/std/algorithms/alg.nonmodifying/alg.count/ranges.count_if.pass.cpp | // <algorithm>
// UNSUPPORTED: c++03, c++11, c++14, c++17
// template<input_iterator I, sentinel_for<I> S, class Proj = identity,
// indirect_unary_predicate<projected<I, Proj>> Pred>
// constexpr iter_difference_t<I>
// ranges::count_if(I first, S last, Pred pred, Proj proj = {});
// template<input_ra... | TEST | 0.864 | 7.348562 |
fa8d9050-df33-41fc-b223-d8018a36e475 | Raj-Bapat/usaco | countwords/countwords.cpp | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int counter = 0;
while (true) {
string a;
cin >> a;
if (cin.eof()) {
break;
}
counter++;
}
cout << counter << endl;
return 0;
}
| ALGO | 0.936586 | 3.343758 |
987299a7-b4b5-4b3b-b0fa-91b7b2b1b0f6 | Amarjeet264/DSA-problems | 2375-minimum-obstacle-removal-to-reach-corner/minimum-obstacle-removal-to-reach-corner.cpp | class Solution {
public:
int minimumObstacles(vector<vector<int>>& grid) {
int n = grid.size();
int m = grid[0].size();
vector<vector<int>> cost(n, vector<int>(m, INT_MAX));
priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<>> pq;
pq.push({... | ALGO | 0.999981 | 6.264022 |
3fb98e20-7c14-491a-a8e0-2a27bb27c56a | Simewu/bitcoin-version-compare | bitcoin-22.0/src/chain.cpp | #include <chain.h>
/**
* CChain implementation
*/
void CChain::SetTip(CBlockIndex *pindex) {
if (pindex == nullptr) {
vChain.clear();
return;
}
vChain.resize(pindex->nHeight + 1);
while (pindex && vChain[pindex->nHeight] != pindex) {
vChain[pindex->nHeight] = pindex;
p... | ALGO | 0.999384 | 6.967565 |
ef302d7d-02b8-4940-9822-a8f8340006b2 | llvm-git-prototype/llvm | llvm/lib/CodeGen/CFIInstrInserter.cpp | #include "llvm/ADT/DepthFirstIterator.h"
#include "llvm/CodeGen/MachineFunctionPass.h"
#include "llvm/CodeGen/MachineInstrBuilder.h"
#include "llvm/CodeGen/MachineModuleInfo.h"
#include "llvm/CodeGen/Passes.h"
#include "llvm/CodeGen/TargetFrameLowering.h"
#include "llvm/CodeGen/TargetInstrInfo.h"
#include "llvm/CodeGen... | TOOL | 0.970788 | 7.93886 |
e54db8ed-cb28-4d33-a9c7-b21e4065f10b | mikemel21/CIS343-GVZork | Game.cpp | #include "Game.hpp"
#include <random>
#include <functional>
#include <sstream>
/*
Michael Melei
Justin Burch
*/
Game::Game () {
create_world();
locationVector = std::vector<std::reference_wrapper<Location> >(locs.begin(), locs.end());
//cur = random_location();
cur = locationVector[0];
cur... | TOOL | 0.86938 | 4.262802 |
9087585e-9ab5-481b-85a6-97c85f6fc67d | capnmav77/Core-Programming | STL/DSA/Sliding Window/Largest Sum Subarray of Size at least K.cpp | /*
MY YOUTUBE VIDEO ON THIS Qn :
Company Tags : Facebook, Paytm, Myntra
GfG Link : https://www.geeksforgeeks.org/problems/largest-sum-subarray-of-size-at-least-k3121/1
*/
/****************************************************************** C++ *****************************... | ALGO | 0.99992 | 5.468651 |
b2cedf11-77e3-4ca3-90f6-031995bbeaba | SauravSarkar-CodersArcade/GSSS-Feb-2025-B1 | DataStructures/Trees/BinaryTrees/MirrorOfABinaryTree.cpp | #include <iostream>
using namespace std;
class TreeNode {
public:
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int x) : val(x), left(nullptr), right(nullptr){}
};
void inOrderTraversal(TreeNode* root){ // LDR
if(root != nullptr){
inOrderTraversal(root->left);
cout << root->... | ALGO | 0.999997 | 6.545041 |
46a301cf-39bb-4359-936c-708823135e42 | hphuckhanh/Symbol-Table-Using-HashTable | SymbolTable.cpp | #include "SymbolTable.h"
enum command
{
LINEAR,
QUADRATIC,
DOUBLE,
INSERT,
ASSIGN,
CALL,
LOOKUP,
PRINT,
BEGIN,
END
};
void SymbolTable::run(string filename)
{
ifstream ifs;
ifs.open(filename, ifstream::in);
int k=0;
int level = 0;
string init;
getline(ifs, init);
if(init == "") throw InvalidIns... | ALGO | 0.935518 | 3.553405 |
2d6089e5-9a1c-4889-90d8-77613ea2e597 | balabit-deps/balabit-os-8-opencv | contrib/modules/dnn_objdetect/src/core_detect.cpp | #include "opencv2/core_detect.hpp"
namespace cv
{
namespace dnn_objdetect
{
InferBbox::InferBbox(Mat _delta_bbox, Mat _class_scores, Mat _conf_scores)
{
this->delta_bbox = _delta_bbox;
this->class_scores = _class_scores;
this->conf_scores = _conf_scores;
image_width = 416;
im... | ALGO | 0.991648 | 6.223574 |
41ef0e88-c471-47dc-a31d-2c355d597ee3 | Suryadhrma/cobaae | 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 |
580e1191-079c-4b47-9531-edc0789b7e5f | beet-aizu/library | test/aoj/geometry/2334.test.cpp | // verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2334
// verification-helper: ERROR 1e-9
#include<bits/stdc++.h>
using namespace std;
#define call_from_test
#include "../../../geometry/geometry.cpp"
#include "../../../tools/chminmax.cpp"
#include "../../../graph/dijkstra.cpp"
#... | ALGO | 0.999495 | 4.02104 |
76dc8051-f14a-4e4a-a014-59a6dc52ef8d | Fenesh/Test_flatter | 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 |
b6100523-4825-4172-a762-931bdbd3fca7 | Luisfernandez2003/TPS-INFORMATICA- | TP Nº4-Ej_9.cpp | #include <stdio.h>
#include <math.h>
float S[37], A[37], P[37], x, rad;
int main(){
printf("Grados\t| Funcion Sen\t | Prom de la funcin\n");
printf("_____________________________________________\n");
for(int i = 0; i < 37; i++){
x = i * 10;
rad = x * (M_PI / 180);
S[i] = sin(rad);
A[i] = x;
}
for(int ... | ALGO | 0.97044 | 3.012968 |
35d99630-4096-4c4f-b3f7-ad0252e7fcf1 | Qwertyamc/AirOps | src/coldet/mytritri.cpp | #include "sysdep.h"
#include "mytritri.h"
__CD__BEGIN
Vector3D my_tri_tri_intersect(const Triangle& t1, const Triangle& t2)
{
Plane p1(t1.v1,t1.v2,t1.v3);
int other_side=0;
{
float f1=p1.Classify(t2.v1);
float f2=p1.Classify(t2.v2);
float f3=p1.Classify(t2.v3);
float f12=f1*f2;
float f23=f2*... | ALGO | 0.998819 | 6.686981 |
251b1f3e-5aa2-4110-8904-96fbbe5afd13 | Major-pr0ject/MAJOR1 | Xampp/FileZillaFTP/source/Accounts.cpp | #include "stdafx.h"
#include "accounts.h"
#include "iputils.h"
t_directory::t_directory()
{
bAutoCreate = FALSE;
}
t_group::t_group()
{
pOwner = NULL;
for (int i = 0; i < 2; i++)
{
nSpeedLimitType[i] = 0;
nSpeedLimit[i] = 10;
nBypassServerSpeedLimit[i] = 0;
}
nEnabled = 1;
forceSsl = 0;
}
t_group& t_gr... | TOOL | 0.939802 | 4.315146 |
1baae69d-4c33-499f-bc87-57cb1298a93a | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_12199_10.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j = 0, mx = -1, fromleft, fromright;
string s, t;
cin >> s >> t;
int left[t.size()], right[t.size()];
for (i = 0; i < s.size(); i++) {
if (s[i] == t[j]) {
left[j++] = i;
}
if (j == t.size()) {
fromleft = s.size() - i - 1... | ALGO | 0.999947 | 3.937649 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.