uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
17e4739d-7aca-4a04-aa9d-704fd25fc46f | happylun/SketchModeling | Fusion/3rdparty/libigl/include/igl/repdiag.cpp | template <typename T>
IGL_INLINE void igl::repdiag(
const Eigen::SparseMatrix<T>& A,
const int d,
Eigen::SparseMatrix<T>& B)
{
using namespace std;
using namespace Eigen;
int m = A.rows();
int n = A.cols();
#if false
vector<Triplet<T> > IJV;
IJV.reserve(A.nonZeros()*d);
// Loop outer level
for (in... | ALGO | 0.99893 | 4.303635 |
6df3cee4-f8e8-4422-a072-7381b143d512 | vahidqituli/Crypto-app_1 | 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 |
abe9f4e0-44e0-45d7-8c26-2d46e96f1d41 | Sasha298/cplusplus | 1 semester/3/ex1.var12.cpp | #include <iostream>
int main() {
int N;
input:
std::cout << "Enter a three-digit positive number N: ";
std::cin >> N;
if (N < 100 || N > 999) {
std::cout << "Entered number is not three digits long.\n";
goto input;
}
int sum = 0;
int digit;
while (N > 0) {
... | ALGO | 0.998021 | 5.711866 |
1a48849c-81e0-4794-9e69-3ba4c73db19b | otzhora/cs_course_2017 | main.cpp | #include "iostream"
#include "xmmintrin.h"
#include <stdio.h>
#include <stdlib.h>
void * aligned_malloc(size_t size, int align) {
if (align < 0) {
return NULL;
}
void *ptr;
void *p = malloc(size + align - 1 + sizeof(void*));
if (p != NULL) {
ptr = (void*) (((size_t)p ... | ALGO | 0.967635 | 3.463507 |
4052d763-2c2e-474b-809a-a9c9d8df497f | davidyslu/OnlineJudgeUVa | UVA-10327/UVA-10327.cpp | #include <iostream>
#include <cstdio>
#define MAX 1005
using namespace std;
int main(void) {
int N, list[MAX];
while (scanf("%d", &N) != EOF) {
for (int i = 0; i < N; ++i) {
scanf("%d", &list[i]);
}
int flip = 0;
for (int i = 0; i < N; ++i) {
for (int... | ALGO | 0.999824 | 4.156909 |
57917596-9bc4-4bdf-ae15-543aa71f62d8 | Ravikumarjj/DSA-using-cpp | reverse first k element in a queue.cpp | //{ Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution
{
public:
// Function to reverse first k elements of a queue.
queue<int> modifyQueue(queue<int> q, int k) {
// add code here... | ALGO | 0.999921 | 5.599748 |
e3d9206e-b0dd-4c9e-a120-63e3487cc15b | JerryChen1031/2025aaib | week13-2.cpp | ///week12-3.cpp
#include <stdio.h>
int main()
{
int a = 51, b = 68;
int ans = 1;
for(int i=1; i<=a; i++){
if(a%i==0 && b%i==0) ans = i;
}
printf(" %d %d ̤j]: %d\n", a, b, ans);
printf("%d/%d , ܦ %d/%d\n", a, b, a/ans, b/ans);
}
| ALGO | 0.999175 | 3.122796 |
95d766a3-48b5-49b8-b363-96a746997877 | liangaili/leet | Remove Duplicates from Sorted Array II.cpp | class Solution {
public:
int removeDuplicates(int A[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (n<=1) {
return n;
}
int prev = A[0];
int write = 1;
for (int i=1; i<n; i++) {
if ... | ALGO | 0.999785 | 5.91494 |
2c1f6f65-9962-45d6-b5b3-c26433813a74 | naiemofficial/Mathematics-with-programming | C++/Pattern/Half pyramid of input charecter.cpp | #include <iostream>
using namespace std;
int main(){
char data; int rows;
cout << "Enter a charecter: ";
cin >> data;
cout << "Enter the number of rows: ";
cin >> rows;
for (int i = 1; i <= rows; i++) {
for (int x = 0; x < i; x++) {
cout << data << " ";
}
co... | ALGO | 0.976546 | 3.740455 |
971f879d-071c-46ec-ab6c-24d77712a730 | BlueSu007/OpenJudgeNoi-codes | 【1.13编程基础之综合应用】 23 区间内的真素数.cpp | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
bool isprime(int n){
if(n == 1)
return false;
for(int i = 2; i * i <= n; i++)
if(n % i == 0)
return false;
return true;
}
bool istrueprime(int n){
int m = 0;
while(n >= 1){
m = m * 10 + n % 10;
n /= 1... | ALGO | 0.999928 | 4.166276 |
74ac1f1f-93d4-45e4-957e-f1b95e46fc8d | CHAITANYA-2002/CHAITANYA-2002 | programing c++/Untitled1,cpp.cpp | using namespace std;
#include <conio.h>
#include <iostream> //early binding is binding at the time of compiling
int area(int, int);
float area(int);
int main()
{
//Area here is an example of funcion overloading that is calculating area and dono ke liye same hi naam rakh diya alag alag rkahne ki need nhi hai.
system(... | TOOL | 0.988149 | 3.851863 |
0df2211e-f290-4f8b-94ff-970da844688c | SunjidaAkter/important_notes | algo/module_10/counting_rooms.cpp | #include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
vector<string>g;
int visited[N][N];
int m,n;
bool is_valid(int i,int j){
return (i>=0&&j>=0&&i<m&&j<n);
}
void dfs(int i,int j){
if(!is_valid)return;
if(visited[i][j])return;
if(g[i][j]=='#')return;
visited[i][j]=true;
dfs(i,j+1);... | ALGO | 0.999844 | 4.45102 |
2d81e895-6406-40ad-b891-0e76cb48ea71 | 082T/solving_pr-eu | 0025.cpp | #include <iostream>
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
cpp_int countnum(cpp_int a)
{
int i = 0;
while (a > 0)
{
a /= 10;
i++;
}
return i;
}
int main() {
cpp_int a, b;
int index = 2;
a = 1;
b = 1;
while (... | ALGO | 0.999337 | 4.52118 |
b66385cd-5e92-4973-887f-1514451e6296 | genwockz/e-test | EmissionTesting/lib/opencv/sources/modules/cudaarithm/src/arithm.cpp | #include "precomp.hpp"
using namespace cv;
using namespace cv::cuda;
#if !defined (HAVE_CUDA) || defined (CUDA_DISABLER)
void cv::cuda::gemm(InputArray, InputArray, double, InputArray, double, OutputArray, int, Stream&) { throw_no_cuda(); }
void cv::cuda::mulSpectrums(InputArray, InputArray, OutputArray, int, bool,... | TOOL | 0.96425 | 7.133279 |
62a26a7d-d9e7-4d43-8fa1-ca92989d2b44 | Ayush73nigam/codore | binary_to_decimal.cpp | #include<iostream.h>
using namespace std;
int main(){
int number;
cin>>number;
int r;
int power=1;
int decimal=0;
while(number>0){
r=number%10;
decimal=decimal+r*power;
power=power*2;
number=number/10;
}
cout<<"the decimal form of the number is "<<decimal;... | ALGO | 0.999799 | 3.988802 |
cbcbe686-a06e-498f-916d-7a316ef40594 | firewood/topcoder | atcoder/agc_037/c.cpp | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int64_t, int64_t> II;
int64_t solve(int64_t N, std::vector<int64_t> A, std::vector<in... | ALGO | 0.999965 | 3.871531 |
9df86084-6381-430d-ac6d-81d1ee02e468 | Pelhans/BELL | submodules/clucene_core/search/QueryFilter.cpp | #include "../_ApiHeader.h"
#include "QueryFilter.h"
#include "IndexSearcher.h"
#include "../index/IndexReader.h"
#include "../util/BitSet.h"
#include "SearchHeader.h"
#include "Query.h"
CL_NS_DEF(search)
CL_NS_USE(util)
CL_NS_USE(index)
class QFHitCollector : public HitCollector {
CL_NS(util)::BitSet* bits;
publ... | TOOL | 0.888567 | 6.549937 |
38bfa92d-f083-457b-b673-551a1d316d43 | Kavya-1219/DAA | 19.knapsack using greedy technique.cpp | #include <stdio.h>
struct Item {
int weight;
int value;
};
void knapsack(struct Item items[], int n, int capacity) {
float totalValue = 0.0;
int currentWeight = 0;
for (int i = 0; i < n; i++) {
if (currentWeight + items[i].weight <= capacity) {
currentWeight += items[i].weight... | ALGO | 0.99997 | 5.902408 |
ceccec71-c2e3-4585-89db-c06fafc2e197 | JacksoonHayes/PRJ703_robot | libraries/ESP32-CAM_PRJ703_inferencing/src/edge-impulse-sdk/tensorflow/lite/micro/kernels/mirror_pad.cpp | #include "edge-impulse-sdk/tensorflow/lite/c/builtin_op_data.h"
#include "edge-impulse-sdk/tensorflow/lite/c/common.h"
#include "edge-impulse-sdk/tensorflow/lite/kernels/kernel_util.h"
#include "edge-impulse-sdk/tensorflow/lite/micro/kernels/kernel_util.h"
namespace tflite {
namespace {
struct OpDataMirrorPad {
int... | TOOL | 0.948401 | 7.828555 |
b92299e1-9eaa-4f94-aeaa-551e83efb671 | saujanya29/DSA-Sheet | 10.Linked List/Question On Linked List/3.Is Circular List/IsCircularList.cpp | #include<iostream>
#include<climits>
#include<vector>
#include<string>
#include<set>
#include<unordered_map>
#include<algorithm>
using namespace std;
class Node{
public:
int data;
Node* Next;
//Constructor
Node(int data){
this->data = data;
this->Next = NULL;
}
// Destructor
~Node(){... | ALGO | 0.999564 | 4.497564 |
c671d39d-d415-4cd6-9a35-6bd58ec4a57b | adityasharmawork/CPP_Programs | calendar.cpp | #include <iostream>
#include <iomanip>
using namespace std;
// Function to check if a year is a leap year
bool isLeapYear(int year) {
return (year % 4 == 0 && year % 100 != 0) || (year % 400 == 0);
}
// Function to get the number of days in a month
int getDaysInMonth(int month, int year) {
switch (month) {
... | TOOL | 0.997525 | 4.875483 |
bb53330c-8570-4651-a425-711ce58ba6eb | adilahmad17/Obfuscuro | llvm/llvm-4.0.0.src/lib/CodeGen/LiveIntervalAnalysis.cpp | #include "llvm/CodeGen/LiveIntervalAnalysis.h"
#include "LiveRangeCalc.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/Analysis/AliasAnalysis.h"
#include "llvm/CodeGen/LiveVariables.h"
#include "llvm/CodeGen/MachineBlockFrequencyInfo.h"
#include "llvm/CodeGen/MachineDominators.h"
#include "llvm/CodeGen/MachineInstr.h... | TOOL | 0.989481 | 5.423724 |
6d6001ec-39be-4730-ab27-58c77a49a5e0 | 81-28/AtCoder | archive/25_05_24/abc407_b.cpp | // https://atcoder.jp/contests/abc407/tasks/abc407_b
#include<bits/stdc++.h>
using namespace std;
#define rep1(i,n) for(int i=1;i<=(int)(n);++i)
template<typename Head,typename... Tail>
void print(const Head &head,const Tail &... tail){cout<<head;((cout<<' '<<tail),...);cout<<'\n';}
int main(){
ios::sync_with_s... | ALGO | 0.9973 | 3.592422 |
dda39bcf-4ce2-4e27-b80e-c0b48cf81f49 | ywh555hhh/23-10-1-hpl-task | hpcg/hpcg-master/src/GenerateGeometry.cpp |
//@HEADER
// ***************************************************
//
// HPCG: High Performance Conjugate Gradient Benchmark
//
// Contact:
// Michael A. Heroux ( <EMAIL>)
// Jack Dongarra (<EMAIL>)
// Piotr Luszczek (<EMAIL>)
//
// ***************************************************
//@HEADER
/*!
@file Generat... | TOOL | 0.991275 | 4.780084 |
452e1c53-e137-47c1-abe2-a33578dfc559 | Shahbaz898414/Competitive-Programming-template | Competitive-Programming-main/DP/digit-dp/soln1usingP&C.cpp | // JAI BAJARANG BALI
// manitianajay45
// give me some sunshine, give me some rain ,give me another chance to grow up once again....
// sab moh maya hai....
// waiting....
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll fac[19];
ll val_bound(string s,ll i){
if(i==s.length()){
... | ALGO | 0.999975 | 4.049035 |
52d75c3c-d65e-45ac-a6f0-ed42fa7344fa | MohamedIdrissiAlami/Algorithms-Problem-Solving-Level-1 | Ex-05/Ex-5.cpp | #include <iostream>
using namespace std;
template <typename T>
T ReadNumber(string Message)
{
T Number = 0;
cout << Message;
while ((cin >> Number).fail())
{
//user didn't input a valid number .
cin.clear();
cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
cout << "\ninvalid input " << Messag... | TOOL | 0.96769 | 3.908873 |
2429ead4-3cc3-4a7b-8857-a0a2fb1c3c84 | usc-isi/llvm | bolt/lib/Passes/RegReAssign.cpp | #include "bolt/Passes/RegReAssign.h"
#include "bolt/Core/MCPlus.h"
#include "bolt/Passes/BinaryFunctionCallGraph.h"
#include "bolt/Passes/DataflowAnalysis.h"
#include "bolt/Passes/DataflowInfoManager.h"
#include "bolt/Utils/Utils.h"
#include <numeric>
#define DEBUG_TYPE "regreassign"
using namespace llvm;
namespace ... | TOOL | 0.890065 | 7.773664 |
110f0cf3-d0dd-439c-bc2a-eca76c285152 | codescoop/Play-with-Data-Structures | 26_linked_lists/05_linked_list_deletion.cpp | /*
TOPIC: Linked List - Deletion
*/
#include <iostream>
using namespace std;
class Node{
public:
int data;
Node *next;
// constructor
Node(int d)
{
data = d;
next = NULL;
}
};
// pass a pointer by reference (because we want to make changes to the original head pointer)
v... | ALGO | 0.999901 | 5.236177 |
d701b946-54cf-4f7b-9f66-f57eb8e3d128 | ckagngoc/CodeC_choTreTrau | dinhthuc.cpp | #include <iostream>
using namespace std;
void nhapmt(float a[100][100],int n)
{
for (int i=0;i<n;i++)
{
for (int j=0;j<n;j++)
{
cout <<"["<<i<<"]"<<"["<<j<<"]: ";
cin >>a[i][j];
}
cout << endl;
}
}
void xuatmt(float a[100][100],int n)
{
for (int i... | ALGO | 0.999534 | 3.442046 |
33980658-cc6e-465a-91fe-abb7b82760c7 | conan1005/DSA-Questions | Leetcode/0-arrays-and-hashing/easy/242-valid-anagram.cpp | /*******************************************************************
*******************************************************************/
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
bool isAnagram(string s, string t) {
if(s.length() != t.length()) return false;
vector<int> count(27, 0);
... | ALGO | 0.999963 | 5.014245 |
5ffcf026-b0b8-4e9d-a6d9-0896f3d0404d | pytorch/torchrec | contrib/dynamic_embedding/src/tde/details/ctz_impl.cpp | #include "tde/details/bits_op.h"
namespace tde::details::bits_impl {
template <typename T>
struct CtzImpl {
/**
* Naive implementation for no __builtin_ctz
* @param v
* @return
*/
int operator()(T v) const {
if (v == 0)
return -1;
int result = 0;
while ((v & 1) == 0) {
v >>= 1;... | ALGO | 0.955887 | 7.482322 |
1a940283-4ad3-4be1-89dd-3d8a665735a9 | ekut-es/pulp-llvm | llvm/lib/Support/Process.cpp | #include "llvm/Support/Process.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/StringExtras.h"
#include "llvm/Config/config.h"
#include "llvm/Config/llvm-config.h"
#include "llvm/Support/CrashRecoveryContext.h"
#include "llvm/Support/FileSystem.h"
#include "llvm/Support/Path.h"
#include "llvm/Support/Program.h"
... | TOOL | 0.959627 | 7.749969 |
cf1cbb8b-faeb-457a-ba93-6add1746c028 | Mulab11/cntt2016-hw1 | TC-SRM-557-div1-250/oysq.cpp | #line 2 "FoxAndMountainEasy.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ui unsigned
#define ll long long
#define pii std::pair<int,int>
#define mp std::make_pair
#define fi first
#define se second
#define SZ(x) (int)(x).size()
#define pb push_back
template<class T>inline void chkmax(T &x, const... | ALGO | 0.999871 | 4.101003 |
dd9b9392-fb76-4f8e-bae6-8eac999e289d | wusu5545/C-_exercise | A2/B1_scalp.cpp | #include<iostream>
#include<cmath>
#include<vector>
using namespace std;
void print(vector<double>::const_iterator beg,vector<double>::const_iterator end){
double sum=0;
while(beg!=end){
sum+=pow(*beg,2);
beg++;
}
sum=sqrt(sum);
cout<<sum<<endl;
}
int main(){
vector<double>ivec;
double arr[10];
for (int i... | ALGO | 0.998033 | 3.787562 |
c98dc91b-7dd9-4229-b603-662a903430a9 | dushimsam/deep-dive-into-algorithms | graph-pheory/shortest-paths/digistral_algorithm.cpp | #include <bits/stdc++.h>
using namespace std;
/***
*
* THE DIFFERENCE WITH BELLMAN-FORD ALORGITHM WE DISCUSSED EALIER IS THAT
* WE DON'T NEED THE OUTER MOST LOOP THAT LEADS FROM 1-N.
* THIS IS EFFICIENT ALGORITHM TO BE USED WHEN WE DON'T HAVE NEGATIVE WEIGHTS IN OUR
* GRAPH.
*
* TIME COMPLEXITY: log(O(n+ mlogm... | ALGO | 0.999983 | 4.793247 |
89850ad6-cef5-4c61-bac9-9d4ee55fec65 | Pseudo-iitian/DailyCodes | codeforces_wordcapitalization.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
char a = s[0];
if(a>=97){
s[0]=(char)(a-32);
}
cout<<s;
return 0;
} | ALGO | 0.998187 | 3.80635 |
d029e960-703b-4ef0-91a8-3a11fbbf91f3 | pravinargade18/CP-world | CodeStudio/Arrays/Median_of_two_sorted_arrays.cpp | #include<bits/stdc++.h>
double median(vector<int> a, vector<int> b)
{
int a_size=a.size();
int b_size=b.size();
vector<int>v;
for(int i=0;i<a_size;i++){
v.push_back(a[i]);
}
for(int i=0;i<b_size;i++){
v.push_back(b[i]);
}
sort(v.begin(),v.end());
if(v.size()%2==0){
... | ALGO | 0.999709 | 3.730278 |
c4a1e59b-5758-47e1-a79a-b10e04275d2c | louie17/RoutePlanning | EigenLib/bench/benchCholesky.cpp |
// g++ -DNDEBUG -O3 -I.. benchLLT.cpp -o benchLLT && ./benchLLT
// options:
// -DBENCH_GSL -lgsl /usr/lib/libcblas.so.3
// -DEIGEN_DONT_VECTORIZE
// -msse2
// -DREPEAT=100
// -DTRIES=10
// -DSCALAR=double
#include <iostream>
#include <Eigen/Core>
#include <Eigen/Cholesky>
#include <bench/BenchUtil.h>
using na... | TEST | 0.990408 | 5.925367 |
5d7e2bb1-3a54-492a-b5dc-9d606393cd6a | CregskiN/MiniMineCraft-xcode | headerfiles/BulletCollision/CollisionDispatch/btConvexConcaveCollisionAlgorithm.cpp | #include "btConvexConcaveCollisionAlgorithm.h"
#include "LinearMath/btQuickprof.h"
#include "BulletCollision/CollisionDispatch/btCollisionObject.h"
#include "BulletCollision/CollisionShapes/btMultiSphereShape.h"
#include "BulletCollision/BroadphaseCollision/btBroadphaseProxy.h"
#include "BulletCollision/CollisionShapes... | ALGO | 0.999788 | 7.444685 |
d61a874f-15ae-4ab9-b6e9-074e1041cc04 | apple/llvm-project-v5 | llvm/lib/Transforms/InstCombine/InstCombineMulDivRem.cpp | #include "InstCombineInternal.h"
#include "llvm/ADT/APFloat.h"
#include "llvm/ADT/APInt.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/Analysis/InstructionSimplify.h"
#include "llvm/IR/BasicBlock.h"
#include "llvm/IR/Constant.h"
#include "llvm/IR/Constants.h"
#include "llvm/IR/InstrTypes.h"
#include "llvm/IR/Instr... | TOOL | 0.98849 | 6.647798 |
c6fef7ee-df2d-414d-8fda-f2f31accabd0 | benhunt19/algo-trading-project | Lib/site-packages/prophet/stan_model/cmdstan-2.33.1/stan/lib/stan_math/lib/tbb_2020.3/src/rml/perfor/tbb_simple.cpp | #include <cstddef>
#include <cstdlib>
#include <cstdio>
#include <float.h>
#include <math.h>
#include <time.h>
#include <omp.h>
#include <assert.h>
#include "thread_level.h"
#include "tbb/task.h"
#include "tbb/tick_count.h"
#include "tbb/task_scheduler_init.h"
#if _WIN32||_WIN64
#include <Windows.h> /* Need Sleep *... | TOOL | 0.922963 | 4.476879 |
496aff78-3fda-4a02-91b7-cdedf778e02d | QiSheng918/ur_force_control | force_control/src/variable_admittance_control.cpp | #include "ros/ros.h"
#include "geometry_msgs/WrenchStamped.h"
#include "std_msgs/String.h"
#include <Eigen/Eigen>
#include <Eigen/Geometry>
#include <Eigen/Core>
#include "cmath"
#include "std_msgs/Float64.h"
#include <std_msgs/String.h>
#include "sensor_msgs/JointState.h"
#include <geometry_msgs/TwistStamped.h>
#inclu... | TOOL | 0.92298 | 3.624627 |
116d0d14-0948-4d89-a0a7-78ff528a0929 | RuiqiW/geometry-processing-monte-carlo | libigl/include/igl/directed_edge_parents.cpp | template <typename DerivedE, typename DerivedP>
IGL_INLINE void igl::directed_edge_parents(
const Eigen::MatrixBase<DerivedE> & E,
Eigen::PlainObjectBase<DerivedP> & P)
{
using namespace Eigen;
using namespace std;
typedef Eigen::Matrix<typename DerivedE::Scalar, Eigen::Dynamic, 1> VectorT;
VectorT I = Vec... | ALGO | 0.99313 | 5.560305 |
9fc66ca2-27b4-49a0-bc74-faed79ad3a7b | orucovyusif/mvc-6-task | pen.cpp | #include <iostream>
#include <map>
int main(){
std::map <int,int> pencils;
int n, currentpencil, changedpen=-1,doublepen=0;
int sum1=0, sum2=0;
std::cin>>n;
for (int i=1;i<=n;i++){
std::cin>>currentpencil;
pencils[currentpencil]++;
if (pencils[currentpencil]>1){
doublepen=currentpencil;
}
sum1+=i;
s... | ALGO | 0.999274 | 3.194981 |
9b523606-e79f-42fe-968d-875324339f3f | ishandutta2007/codeforces | niyaznigmatul/normal/1325/A.cpp | /**
* Niyaz Nigmatullin
*/
#include <bits/stdc++.h>
using namespace std;
void solve() {
int x;
cin >> x;
cout << (x - 1) << ' ' << 1 << endl;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
int t;
cin >> t;
while (t--) solve();
} | ALGO | 0.999834 | 4.898979 |
d0bb29a5-ab44-411b-9799-1f330c7a9730 | khondkersadaf/Compiler-Design | Mid/Lab 1/2.cpp | #include <iostream>
using namespace std;
bool isArmstrong(int number) {
int originalNumber = number;
int sum = 0;
for (int temp = number; temp > 0; temp /= 10) {
int digit = temp % 10;
sum += digit * digit * digit * digit;
}
return (sum == originalNumber);
}
int main() {
int ... | ALGO | 0.999804 | 5.899333 |
5c9fdb6f-5f0a-451d-bd2a-394ce78a4fb9 | jluissandovalm/mpm | simpleMPM/src/eigen/bench/benchGeometry.cpp | #include <iostream>
#include <iomanip>
#include "../../eigen/bench/BenchTimer.h"
#include "../../eigen/Eigen/Core"
#include "../../eigen/Eigen/Geometry"
using namespace Eigen;
using namespace std;
#ifndef REPEAT
#define REPEAT 1000000
#endif
enum func_opt
{
TV,
TMATV,
TMATVMAT,
};
template <class res, ... | TEST | 0.870602 | 5.967607 |
df3d20fa-dbe3-493d-8ed4-92c4ddb0d630 | sency90/allCode | cpbook_code/ch6/ch6_04_sa.cpp | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
typedef pair<int, int> ii;
#define MAX_N 100010 // second approach: O(n log n)
char T[MAX_N]; // the input string, up to 100K characters
int n; // the length ... | ALGO | 0.999967 | 4.531277 |
1931d1fe-1e81-4259-94ab-83b670b9a64a | Hasib-Nabid/Coding-problems | Codeforces/B_Equal_Candies.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dl;
#define endl "\n"
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
int main()
{
optimize();
... | ALGO | 0.999885 | 3.78047 |
663cba55-7342-4b18-867b-d84c3d965e27 | MoyiHP/LeetCode | HashTable/T49 字母异位词分组.cpp | #include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
#include <map>
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
// sorted string ==> vector<string>
std::unordered_map<string, vector<string>> map;
... | ALGO | 0.999992 | 6.024157 |
8e9a7a28-63c6-4032-9030-8f05056d26b7 | Caoyi2011/cpp | lanqiao/3.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int num = 0;
if (n%3 == 0) num = n/3;
else
{
num = (n/3.0)+0.9;
// int f = n,z = 0;
// while (true)
// {
// if (f <= 0 || z >= n) break;
// if (f % 2 == 0) {... | ALGO | 0.999924 | 3.445277 |
d95251b4-1302-4a2a-8393-e9541a25bad4 | colasclaudet/PFE_PCL | primitive.cpp | #include "primitive.h"
using namespace std;
using namespace cv;
Primitive::Primitive(Point2f origin, Point2f end, int size, int K, int idPrimitive, int idSegment) : m_origin(origin), m_end(end), m_current(end),
m_K(K), m_idPrimitive(idPrimitive), m_idSegment(idSegment)
{
m_certificates = vector<bool>(size, 1)... | ALGO | 0.857305 | 5.177973 |
76db274f-bd35-4ebe-bfdb-116c8f19f55b | YoungJooYoo/For_Coding_Test | LeetCode/1060-missing-element-in-sorted-array/1060-missing-element-in-sorted-array.cpp | class Solution
{
public:
int missingElement(vector<int>& nums, int k)
{
int result = nums[0] + k; // 미리 k를 더하고 시작, 배열 조건이 길이가 1이상이므로.
// 1번 인덱스부터 탐색
for (int i = 1; i < nums.size(); ++i) {
if (nums[i] > result) { // 이미 k가 더해진 result보다 배열의 원소가 크면 반환
... | ALGO | 0.9999 | 5.076237 |
1ce981fa-d931-4af7-8e84-0ca4ed2e9988 | darelbeida/elpa | src/elpa2/GPU/ROCm/ev_tridi_band_amd_gpu_real.cpp | #include <stdlib.h>
#include <stdio.h>
#include <hip/hip_runtime.h>
#if (CUDART_VERSION > 9000)
template <typename T, unsigned int blk> __device__ void warp_shfl_reduce_real(volatile T *s_block)
{
unsigned int tid = threadIdx.x;
T val;
if (blk >= 64)
{
if (tid < 32)
{
s_bl... | ALGO | 0.999685 | 3.653603 |
cab2af13-dada-40ac-bf5c-d5e477a28c88 | 81-28/AtCoder | archive/25_03_08/abc396_a.cpp | // https://atcoder.jp/contests/abc396/tasks/abc396_a
#include<bits/stdc++.h>
using namespace std;
#define YesNo(x) cout<<(x?"Yes\n":"No\n")
template<typename T>
using v=vector<T>;
using vi=v<int>;
template<typename T>
istream &operator>>(istream &is,vector<T> &v){for(T &in:v)is>>in;return is;}
int main(){
ios::... | ALGO | 0.999981 | 3.741472 |
f750be5d-8a00-4b15-ad6c-f1bff27289fc | Darksang/2d-rts-engine | src/Box2D/Collision/b2Collision.cpp | #include "Box2D/Collision/b2Collision.h"
#include "Box2D/Collision/b2Distance.h"
void b2WorldManifold::Initialize(const b2Manifold* manifold,
const b2Transform& xfA, float32 radiusA,
const b2Transform& xfB, float32 radiusB)
{
if (manifold->pointCount == 0)
{
return;
}
switch (manifold->type)
{
... | ALGO | 0.999366 | 7.742243 |
de6aa73a-ddaf-4184-a50d-774e1569f1eb | sumit-raghukant-soni/Leetcode_Solutions | 830-largest-triangle-area/largest-triangle-area.cpp | class Solution {
public:
double largestTriangleArea(vector<vector<int>>& points) {
double ans = INT_MIN;
int sz = points.size();
for(int i=0; i<sz; i++){
for(int j=i+1; j<sz; j++){
for(int k=j+1; k<sz; k++){
double x1 = points[i][0], y1 = poin... | ALGO | 0.999926 | 5.838645 |
6c2c1214-c490-44b1-b3db-df345e440cb1 | GlebNeshchetkin/basic-cpp | tp-Lab-2/src/main1.cpp | #include "task1.h"
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
//using namespace std;
int main()
{
const size_t n = 6;
char* val[n]{ (char*)"ffff", (char*)"fff2", (char*)"f", (char*)... | TEST | 0.995575 | 4.139753 |
42f55c60-a3c2-46e9-b819-999d9ec53156 | sammiiT/leetcode | Tree/1110. Delete Nodes And Return Forest.cpp | //===類似題===
1111. Maximum Nesting Depth of Two Valid Parentheses Strings
2049. Count Nodes With the Highest Score
//===思路====
(*)Tree post-order算法
1. TreeNode節點是distinct,所以數值不會重複,可以建立一個unordered_map<int,int>記錄to_delete
2. 建立vector<TreeNode*>& ,在每一次遇到to_delete數值時, 將此TreeNode的 left和right分別push至vector<TreeNode*>中
-遇到to_d... | ALGO | 0.999872 | 5.85602 |
4067130c-1af2-402f-ae33-229e08362b18 | RychardRS/LIP | UNIDADE 01/Primeiro e último digito/main.cpp | #include <iostream>
using namespace std;
int digitos(int n, int &primeiroDigito, int &ultimoDigito);
int main()
{
/*Primeiro e último dígito Faça uma função que recebe como
parâmetro um número inteiro n>0 e retorna o primeiro e o último dígito de n.*/
int n, primeiroDigito, ultimoDigito;
cin>>n;
... | ALGO | 0.998211 | 4.061816 |
bff48b42-cc3d-48a0-a281-d003d70f749a | pz12356/CompetitiveProgramming | Nowcoder/2025 Winter Training2/b.cpp | #include <algorithm>
#include <iostream>
#include <vector>
using i64 = long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n;
std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
std::ranges::sort(a);
std::cout << a[n / 2] - 1 ... | ALGO | 0.999833 | 4.708463 |
801192ad-e9ef-4b64-b6ee-c96d087b2c1b | STong01/2021-- | C+.0227/C+.0227/Fibonacci.cpp | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
//NΪ
//FΪǹʱFibonacci
int N, F;
//LΪFibonacciN߾
//RΪFibonacciNұ߾
int L = 0, R = 0;
//F1F2ΪFibonacci
int F1 = 0, F2 = 1;
cin >> N;
while (1)
{
//Fibonacciй
F = F1 + F2;
F1 = F2;
F2 = F;
//N
if (F < N)
{
L = N - F;
... | ALGO | 0.999992 | 3.731545 |
24dba385-abaf-45b8-8e65-ef6dded55fe4 | vayer2005/acm | round1000/sphere.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a; int b; int c;
int x; int y; int z;
cin >> a >> b >> c >> x >> y >> z;
int incs = max(0, x-a) + max(0, y-b) + max(0, z-c);
int decs = max(0, (a-x)/2) + max(0, (b-y)/2) + max(0, (c-z)/2);
if (decs >= i... | ALGO | 0.999905 | 3.480035 |
d102963f-6c81-4cc8-8ea2-ce87dc7014e3 | yealuo/Leetcode | Code_Musings/Hash_Table/Hash_Table_3.cpp | #include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> hash;
for (int i = 0; i < nums.size(); ++i) {
auto it = hash.find(target - nums[i]);
... | ALGO | 0.999628 | 6.256909 |
82a0ef8e-f8d8-4b30-b3d4-c74fee3868e2 | plenilune3/problem_solving_cpp | beakjoon/BaaaaaaaarkingDog/BinarySearch/2805_나무 자르기.cpp | #include <iostream>
#include <algorithm>
using namespace std;
const int MAX = 1000000;
int N, A[MAX];
long long M;
int find_max_height();
int main(int argc, char const *argv[])
{
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
cin >> N >> M;
for (int i = 0; i < N; i++)
... | ALGO | 0.999993 | 4.603681 |
f267f71b-c24f-4fc7-80ed-90e715b8ab84 | Mahmoud3ali/CompetitiveProgramming | SPOJ/SPOJ COURAGE.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll sum[(int) 5e6] , t[(int) 5e6] , arr[(int) 1e6+5];
void build(int node , int s , int e)
{
if(s == e)
{
t[node] = sum[node] = arr[s];
return ;
}
int mid = (s+e)/2;
build(node*2,s,mid);
build(node*2+1,mid+1,e);
t[node] = min(t[node*2],t[node*... | ALGO | 0.999888 | 4.801629 |
bd3f27e0-9a29-4fba-9617-6f12092a75f7 | icf/Code | C++ code/GpBCS_S.C.CPMC/SC_afqmcConstraintPathBP_4/include/eigen/unsupported/test/polynomialsolver.cpp | #include "main.h"
#include <unsupported/Eigen/Polynomials>
#include <iostream>
#include <algorithm>
using namespace std;
namespace Eigen {
namespace internal {
template<int Size>
struct increment_if_fixed_size
{
enum {
ret = (Size == Dynamic) ? Dynamic : Size+1
};
};
}
}
template<int Deg, typename POLYNOMIAL... | TEST | 0.874776 | 6.294179 |
3a6d6c8a-fbc0-464b-ba60-97f0db6de741 | anindiangeek/CSES | IntroductoryProblems/Missing_Number.cpp | /*
Problem https://cses.fi/problemset/task/1083/
Easy peasy leamon squuezy
*/
#include <iostream>
int main()
{
int64_t n, sum = 0, a;
std::cin >> n;
while (std::cin >> a)
sum += a;
std::cout << (n * (n + 1) / 2) - sum;
} | ALGO | 0.999865 | 4.228648 |
e743b0a3-4078-47f7-8fbd-4f44ae5d8503 | Abhinav7076/My-Codes | LeetCode-Solutions-master/C++/design-hit-counter.cpp | // Time: O(1), amortized
// Space: O(k), k is the count of seconds.
class HitCounter {
public:
/** Initialize your data structure here. */
HitCounter() : count_(0) {
}
/** Record a hit.
@param timestamp - The current timestamp (in seconds granularity). */
void hit(int timesta... | ALGO | 0.998254 | 7.264303 |
c74e0107-6e81-404a-8ba2-df746be0b8d2 | alinjia/CPP_Lab2 | Task G.cpp | #include <iostream>
#include <unordered_set>
#include <string>
int main() {
std::unordered_set<std::string> setOfStrings;
char operation;
std::string input;
while (true) {
std::cin >> operation; // Считываем тип операции
if (operation == '#') {
break; // Если встречен си... | ALGO | 0.999858 | 6.111075 |
d6087a2e-ed11-40ff-9e39-f9539c384c9b | J-H-pic/New-Astar3D | main.cpp | #include <iostream>
#include <vector>
#include <unordered_set>
#include <cmath>
#include <queue>
#include <ros/ros.h>
struct Node {
int x, y, z;
bool isObstacle;
float cost;
Node* parent;
Node(int x = 0, int y = 0, int z = 0, bool isObstacle = false, float cost = std::numeric_limits<float>::infini... | ALGO | 0.999771 | 5.436493 |
8a30b418-29e4-4d96-b62c-2cb6d3f66c51 | sammochen/cp-submissions | uva/10721.cpp | /*
Original problem:
Author: sammochen
*/
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define REP(x,l,u) for(ll x = l;x<u;x++)
#define RREP(x,l,u) for(ll x = l;x>=u;x--)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
string to_string(string s) {return s;}
s... | ALGO | 0.999777 | 4.319342 |
d772e564-4483-4c63-8307-02d738054ea6 | CaptNikh/LeetCode-Practice | Mirror Tree - GFG/mirror-tree.cpp | // { Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
/* A binary tree node has data, pointer to left child
and a pointer to right child */
struct Node {
int data;
struct Node *left;
struct Node *right;
Node(int x) {
data = x;
left = righ... | ALGO | 0.999762 | 6.971782 |
f43b7757-6c53-4184-aedd-74c91b334a2a | motaher13/Solved-OJ-problems | Others/jubaer/c files n/motaher/sdfj.cpp | #include <iostream>
#include <stdio.h>
#include <map>
using namespace std;
int main()
{
int ara[10000],ara2[10000],k,i,j,l,m,n,cou,g;
map<int,int>name[10000];
map<int,int>name1[10000];
g=0;
while(1){
i=0;
cou=0;
while(1){
cin>>k;
if(name[g].find(k)!=name[g].end(... | ALGO | 0.994609 | 3.076642 |
59c4998a-4156-4a53-9923-f63f60ca856a | ishassan/ProblemSolving | TopCoder/Div 2/216-1000 TournamentRanker.cpp | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | ALGO | 0.99992 | 4.948505 |
6f7fcabd-54fd-459d-a673-1f604d1d601f | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_83_24.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * b % 2 == 0 ? "Even" : "Odd") << endl;
} | ALGO | 0.999985 | 5.138577 |
19683dad-8b39-4db4-b76d-14ff1f3446f2 | ShengZhan/shengzhan | 77_combination.cpp | /*
* Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
*/
#include <iostream>
#include <vector>
#include <unordered_map>
#include <stack>
#include <string>
using namespace std;
// Definition for binary tree
struct TreeNode {
int val;
TreeNode *left;
TreeNod... | ALGO | 0.999972 | 5.928348 |
c9903271-b07d-4d54-9b54-85f8289c802f | har200105/LoveBabbar450DSASheet | BinaryTrees/LeafAtSameLevel.cpp | class Solution{
public:
int ans;
void solve(Node* root,int h ,int &ma){
if(!root){
return;
}
if(ans==0){
return;
}
if(!root->left and !root->right){
if(ma==-1){
ma=h;
}else{
if(h!=ma){
ans=0;... | ALGO | 0.999957 | 5.295712 |
a4481521-f5d1-4296-adb8-8fa18d831b51 | raincross7/code-similarity | codes/train_code/problem316/problem316_13.cpp | #include <iostream>
using namespace std;
int main(){
int A, B;
string S;
cin >> A >> B >> S;
//入力終了
for(int i=0; i<A+B+1; i++){
if(i == A){
if(S[i] != '-'){
cout << "No" << endl;
return 0;
}
}
else
if(S[i]<'0' || '9'<S[i]){
cout << "No" << endl;
return 0... | ALGO | 0.999843 | 3.282809 |
2de8c28e-d20a-4bc6-b0d4-d6c5e91921c3 | TejasPatil80178/LeetCode_Problems | Algorithm/ToeplitzMatrix.cpp | class Solution {
public:
bool isToeplitzMatrix(vector<vector<int>>& matrix) {
int m = matrix.size();
int n = matrix[0].size();
if(m==1||n==1) return 1;
for(int i = m-1;i>=0;i--){
int x = matrix[i][0];
int k = i;
for(int j = 0;j<n && k<=m-1;j++){
... | ALGO | 0.999987 | 5.922475 |
5adaef4d-7cd6-4a8f-9919-11bdf9bb357c | PRANAVJARANDE/Leetcode-Solutions | easy/Merge Similar Items.cpp | class Solution {
public:
vector<vector<int>> mergeSimilarItems(vector<vector<int>>& items1, vector<vector<int>>& items2)
{
vector<vector<int>>ans;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q1;
for(auto x: items1)
{
q1.push({x[0],x[1]}... | ALGO | 0.999971 | 5.474532 |
cbeddd7e-8745-4c3a-817d-e99dca004d89 | raincross7/code-similarity | codes/train_code/problem158/problem158_485.cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
} | ALGO | 0.999246 | 3.383595 |
2e9d3f10-d253-48c3-a3a1-a4100a745228 | RinCloud/TrickCatcher | Datasets/TrickyBugs/GenProgs/dpp_generated_progs_cpp/p02715/p02715_num1_parsed.cpp | #include <iostream>
#include <cmath>
const int MOD = 1000000007;
// Function to calculate GCD of two numbers
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int N, K;
std::cin >> N >> K;
// Calculate the sum of GCD over all sequences
long lo... | ALGO | 0.999925 | 5.725587 |
d14838d7-9b17-46e8-983c-cb94354de169 | leonardoong/learn-cp | codeforces/problemset/133A.HQ9+/hq9.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
string a;
cin >> a;
for (int i = 0; i < a.length(); i++)
{
if (a[i] == 72 || a[i] == 81 || a[i] == 57)
{
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
} | ALGO | 0.994423 | 3.003069 |
44cd14e6-3b0a-450a-beb3-6834512abf33 | MathCancer/pc4thanos | src/BioFVM/BioFVM_basic_agent.cpp | #include "BioFVM_basic_agent.h"
#include "BioFVM_agent_container.h"
#include "BioFVM_vector.h"
namespace BioFVM{
std::vector<Basic_Agent*> all_basic_agents(0);
Basic_Agent::Basic_Agent()
{
//give the agent a unique ID
static int max_basic_agent_ID = 0;
ID = max_basic_agent_ID; //
max_basic_agent_ID++;
//... | ALGO | 0.965721 | 6.50698 |
c30ad12f-d5d7-467d-bb1b-ffbe79ed0baf | AntonioPalese/LeetCode | PathSum/main.cpp | #include <vector>
#include <stack>
#include <stdio.h>
#include <cmath>
//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... | ALGO | 0.999904 | 5.770289 |
bffeeb5c-be5c-4ed3-9b4f-4efe71d40cb0 | huudung0607/Recursion-dequy- | Tìm chữ số đầu tiên của số nguyên.cpp | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int S(long long n)
{
if (n < 10)
{
return n;
}
return S(n / 10);
}
int main()
{
long long n;
cin >> n;
cout << S(n) << endl;
}
| ALGO | 0.999481 | 3.8051 |
2c868ef3-5b03-4e57-b50c-160c2cd2c0a5 | Sumit-dey/leetcode | Problems/remove.cpp | class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode *back = head, *front = head;
int cnt = 0;
while(cnt < n) ++cnt, front = front->next;
ListNode *fake_head = new ListNode(0, head);
ListNode *prev_back = fake_head;
while(front != NUL... | ALGO | 0.999947 | 6.262334 |
a167d51a-a9c4-4377-b980-8e599fad76da | usherfu/competitiveprogram | adventofcode/2021/day14_q1_sol1.cpp | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
#include <unordered_map>
using name... | ALGO | 0.999258 | 3.535396 |
a5414789-d3e9-4fe0-84ba-b9eaba91280d | Saybal/DSA | Patterns/doubletriangle.cpp | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main(){
int height;
cout<< "Enter the height of the triangle: ";
cin>>height;
int ground= (height*2)-1;
for (int i = 0; i < height; i++){
for (int j = 1; j <= ground; j++)
{
if(((j >= height-i) && (j <= height+i))){
co... | ALGO | 0.999956 | 4.067021 |
b682e135-b541-416f-9ab0-ab804dc48e8c | shivansh2502/Competitive-Programming | Google_CodeJam/2021/Round1A/C.cpp | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define f(i,n) for(int i=0;i<n;i++)
#define fs(i,s,n) for(int i=s;i<n;i++)
#define ff first
#define ss second
#define int long long
#define pb push_bac... | ALGO | 0.999935 | 5.229004 |
e960f4bc-e55c-47ba-b1e2-0afbe2d1370f | sinian666/codes_41_16 | cpp_副本10/chapter_tree/binary_search_tree.cpp | /**
* File: binary_search_tree.cpp
* Created Time: 2022-11-25
* Author: Krahets (<EMAIL>)
*/
#include "../utils/common.hpp"
/* 二叉搜索树 */
class BinarySearchTree {
private:
TreeNode *root;
public:
BinarySearchTree(vector<int> nums) {
sort(nums.begin(), nums.end()); // 排序数组
ro... | ALGO | 0.999933 | 6.349885 |
6d3a2e53-8c89-4e26-9f35-eee40b8f5092 | Bilal98815/screenshot_widget | example/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.998787 | 6.76775 |
b9bc4238-035b-4542-993f-d73c2ef48c1e | ishandutta2007/codeforces | jhin/normal/1133/B.cpp | // system.cout(translate *from glut);
#include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
vector<long long> p;
int ho,mi,se,ho1,mi1;
void fix_time()
{ if(se>59)mi+=se/60,se=se%60;if(se<0)se+=60,mi--;
if(mi>59)ho+=mi/60,mi=mi%60;if(mi<0)mi+=60,ho--;
if(ho<0)ho+=24;if(ho>24)ho-=24;
}
long long... | ALGO | 0.999778 | 3.434143 |
0183f3d1-4622-48d4-96dd-405b24871800 | Anxiaolu/Cpp_Learning | program5/program5.cpp | #include<iostream>
using namespace std;
const int M=2,N=3;
class Matrix
{
private:
int a[M][N];//M行 N列 数组；
public:
Matrix()
{
for(int i=0;i<M;i++)
for(int j=0;j<N;j++)
a[i][j]=0;
}
Matrix(const Matrix& ma)
{
for(int i=0;i<M;i++)
for(int j=0;j<N;j++)
a[i][j]=ma.a[i][j];
cout<<"<拷贝构造函数>... | ALGO | 0.998779 | 3.375915 |
0b43fef9-1971-415d-ae7c-d7ca33c9ae78 | casperliuliuliu/LeetCode | c++/Best_Time_to_Buy_and_Sell_Stock.cpp | #include<iostream>
#include "two_sum.cpp"
#include<vector>
using namespace std;
int maxProfit(vector<int>& prices){
if(prices.size()<2)
return 0;
int max=0;
// // Brute Force
// for(int ii=0;ii< prices.size();ii++){
// for(int jj=ii+1;jj<prices.size();jj++){
// if(prices.at(... | ALGO | 0.998864 | 5.356242 |
7c106d09-f5f6-4955-aeb1-0fca5b6a0d01 | respawner8/Lab_Sem4 | nm/sin_func.cpp | #include<iostream>
using namespace std;
int main(){
int n;
cout<<"Enter the number of waves: ";
cin>>n;
int x=2*n*n;
char ar[n][x];
int t=1;
int i,j;
for(i=0;i<n;i++){
for(j=0;j<x;j++)
ar[i][j]=' ';
}
int k=n-1;
while(t<=n){
for(i=0;i<n;i++){
... | ALGO | 0.999582 | 3.531295 |
28236fbd-cf99-4439-81d7-e5dd3d2396a5 | Advanced-Robotics-Project-2024/aruco_marker_navsys | aruco_marker_localization/src/localization.cpp | #include<aruco_marker_localization/localization.hpp>
#include<aruco_marker_detector_msgs/msg/marker_infos.hpp>
#include<rclcpp/rclcpp.hpp>
#include<geometry_msgs/msg/transform_stamped.hpp>
#include<tf2_ros/static_transform_broadcaster.h>
#include<string>
#include<geometry_msgs/msg/pose_stamped.hpp>
#include<tf2/LinearM... | TOOL | 0.940456 | 5.3684 |
282995cd-94db-475c-b793-d8d3eb98a3dd | M4573R/competitive-programming-archive | codeforces/round-188/div-2/even_odds.cpp | #include <iostream>
using namespace std;
inline
void use_io_optimizations()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
int main()
{
use_io_optimizations();
unsigned long long numbers;
unsigned long long position;
cin >> numbers >> position;
unsigned long long odd {(number... | ALGO | 0.999376 | 3.945915 |
471631eb-383c-4112-9166-8ee9681a5460 | prashantchauhan1602/Modern-CPP | Week3/day3/Problem2/Functionality.cpp | #include "Functionality.h"
std::condition_variable cv;
std::mutex mt;
int value{-1};
bool flag{false};
void ProducerInput()
{
std::cout << "Enter the value : " ;
std::cin >> value;
//trigger a signal after cin is done, to indicate that consumer can proceed with square calculation...
flag = true;
... | TOOL | 0.986292 | 4.737875 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.