uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
ed2b5c39-888b-4eaf-a1a1-e5913465e79e | DiscreteKat/MicrographyQRCodes | AppFrame/AppAlgoMGLetterWarping.cpp | #include "StdAfx.h"
#include "AppAlgoMGLetterWarping.h"
#include "AppAlgoModuleSelection.h"
AppAlgoLetterWarping::AppAlgoLetterWarping( HKCAppItem^ _appItem ):m_ModuleEnergy(_appItem),m_VisualEnergy(_appItem)
{
m_QRCData = &_appItem->Data->QRCData;
m_ImgW = _appItem->Data->WordArtEvi.segment_img.cols;
m_ImgH = _app... | ALGO | 0.907873 | 3.939437 |
d7e73752-85fb-4e57-804d-da9c52b20a43 | BatsuraBohdana/team-work | sotr-insert.cpp | #include <iostream>
using namespace std;
void insertionSort(int arr[], int n) {
for (int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;
// Переміщення елементів, які більші за key, на одну позицію вперед
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
... | ALGO | 0.999754 | 5.425148 |
5fdcbc74-150e-407a-b31a-6199ace8b41e | akashb2003/dsa-questions | Arrays/4.cpp | // Given an array A[ ] of positive integers of size N, where each value represents the number of chocolates in a packet. Each packet can have a variable number of chocolates. There are M students, the task is to distribute chocolate packets among M students such that :
// 1. Each student gets exactly one packet.
// 2. ... | ALGO | 0.999929 | 5.51598 |
afb8971b-9209-4b94-b9b5-f388b40112a2 | fortyyearslater/My-Codes | P1510[01背包].cpp | #include <iostream>
using namespace std;
int f[10001],c,n,w[10001],v[10001],mv,sum;
int main()
{
std::ios::sync_with_stdio(false);
cin>>mv>>n>>c;
for(int i=1;i<=n;i++){cin>>v[i]>>w[i];sum+=v[i];}
if(sum<mv){cout<<"Impossible";return 0;}
for(int i=1;i<=n;i++)
for(int j=c;j>=w[i];j--)
f[j]=max(f[j],f[j-w[i]]+v[... | ALGO | 0.999995 | 3.39752 |
7b42c79c-8c7a-479e-bc29-0dd2aee8d154 | IgnacioMaqueda/Google-Kick-Start | 2020/RoundF/A-ATMQueue.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, N, X, Ai;
pair<int, int> AiP;
cin >> T;
for (int t = 1; t <= T; ++t) {
cin >> N >> X;
queue<pair<int, int> > A;
for (int i = 1; i <= N; ++i) {
cin >> Ai;
A.push({Ai, i});
}
... | ALGO | 0.999602 | 3.611435 |
0a37a261-d0fe-4b47-b0e1-0cd13c33aabe | Alok-Khansali/Lets-LeetCode | Easy/Special Array I.cpp | class Solution
{
public:
bool isArraySpecial(vector<int> &nums)
{
int st = (nums[0] & 1);
for (int i = 1; i < nums.size(); i++)
{
int par = nums[i] & 1;
if (par == st)
return false;
st = par;
}
return true;
}
}; | ALGO | 0.999634 | 5.595709 |
305ddc3d-082d-45e5-b558-e1d3e0554cf5 | sirocco-rt/pluto-sirocco | Src/Chombo/TagCells.cpp | #include <cstdio>
#include <string>
using std::string;
#include "PatchPluto.H"
#include "LoHiSide.H"
static void computeRefVar(double ***UU[], double ***q, double, RBox *Ubox);
#if (EOS != ISOTHERMAL) && (ENTROPY_SWITCH == NO)
#ifndef CHOMBO_REF_VAR
#define CHOMBO_REF_VAR ENG
#endif
#else
#ifndef CHOMBO_REF_... | ALGO | 0.999762 | 5.723334 |
537b0ed4-69ea-4385-9859-2f7bd7c19c80 | Archit3006/c- | sumfodigit.cpp | #include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int sum = 0;
while(n>0){
int lastdigit = n%10;
sum = sum + lastdigit;
n = n/10;
}
cout<<sum<<endl;
} | ALGO | 0.999931 | 4.566236 |
7640d33c-212b-40f2-98ee-e26d58d0a5f7 | conggaro/Bon_tinh_chat_trong_LapTrinhHuongDoiTuong_OOP | Học OOP đóng gói/Ham_ban.cpp | // Hàm bạn friend trong OOP
// Nếu một hàm nằm ngoài lớp
// được định nghĩa là một hàm bạn (Friend function)
// thì dữ liệu protected
// và riêng tư private của một lớp
// có thể được truy cập bằng cách sử dụng hàm.
// Một lớp có thể có nhiều hàm bạn
// và chúng phải nằm bên ngoài class
#include <iostream>
usin... | TOOL | 0.984012 | 4.452371 |
f8baf8af-93a0-4bc5-881f-f6747c542d63 | SCR01/-CrackYourPlacement | Matrix/Matrix0&X.cpp | #include<iostream>
using namespace std;
// Size of given matrix is M X N
#define M 6
#define N 6
// A recursive function to replace previous value 'prevV' at '(x, y)'
// and all surrounding values of (x, y) with new value 'newV'.
void floodFillUtil(char mat[][N], int x, int y, char prevV, char newV)
{
// Base c... | ALGO | 0.999824 | 4.725974 |
2a98701e-094b-4fba-b492-f6ee444410bc | wvu-navLab/gnss-ins-zupt | GNSS_INS_ZUPT/3rdparty/RobustGNSS/gtsam/gtsam/navigation/TangentPreintegration.cpp | /**
* @file TangentPreintegration.cpp
* @author Frank Dellaert
* @author Adam Bry
**/
#include "TangentPreintegration.h"
#include <gtsam/base/numericalDerivative.h>
#include <boost/make_shared.hpp>
using namespace std;
namespace gtsam {
//--------------------------------------------------------------------... | ALGO | 0.892357 | 7.120077 |
1e0a6716-f41c-4749-ada5-7df993109347 | liguigui/kamyu104-LeetCode | C++/projection-area-of-3d-shapes.cpp | // Time: O(n^2)
// Space: O(1)
class Solution {
public:
int projectionArea(vector<vector<int>>& grid) {
int result = 0;
for (int i = 0; i < grid.size(); ++i) {
int max_row = 0;
int max_col = 0;
for (int j = 0; j < grid.size(); ++j) {
if (grid[i][... | ALGO | 0.999943 | 6.420208 |
31d532e9-156e-4789-96fa-652d004bc150 | yaram/p2vpn | thirdparty/qtbase/src/corelib/text/qstringmatcher.cpp | #include "qstringmatcher.h"
QT_BEGIN_NAMESPACE
static void bm_init_skiptable(QStringView needle, uchar *skiptable, Qt::CaseSensitivity cs)
{
const char16_t *uc = needle.utf16();
const qsizetype len = needle.size();
qsizetype l = qMin(len, qsizetype(255));
memset(skiptable, l, 256 * sizeof(uchar));
... | TOOL | 0.96565 | 7.280735 |
0a6ae493-2935-4958-a017-c26a4d137793 | debrishi/leetcode-daily | 2024.01.29.cpp | #include <iostream>
#include <stack>
using namespace std;
class MyQueue {
public:
stack<int> stack1;
stack<int> stack2;
MyQueue() {
stack1 = std::stack<int>();
stack2 = std::stack<int>();
}
void push(int x) {
stack1.push(x);
}
int pop() {
... | ALGO | 0.99952 | 4.940488 |
826161bb-5066-41a4-be3f-5643219288f0 | KayG2310/learning-cpp | DSA sheet/DP/LIS/divisible.cpp | class Solution {
public:
vector<int> largestDivisibleSubset(vector<int>& arr) {
int n = arr.size();
vector<int>dp(n,1), hash(n);
int maxi = 1;
int last = 0;
sort(arr.begin(), arr.end());
for(int i=0; i<n; i++){
hash[i] = i;
for(int prev=0; prev... | ALGO | 0.999989 | 5.545605 |
f8f9d9e3-8804-4f57-bdf4-9b5487494191 | shail10/6Companies30days | Wallmart/generate random point in a circl.cpp | vector<int> flip;
int i;
vector<int> flipMatchVoyage(TreeNode* root, vector<int>& voyage) {
i = 0;
return isMatchingVoyage(root, voyage) ? flip : vector<int>{-1};
}
bool isMatchingVoyage(TreeNode* root, vector<int>& v){
if(!root) return true;
if(root -> val != v[i++])... | ALGO | 0.999976 | 6.02589 |
36ef2ef1-6fc5-461f-bb95-8d4273dc15e3 | bohkuri/Caesar_Cipher | caesar cipher/CaesarCipher.cpp | #include<iostream>
#include"CaesarCipher.h"
#include<string>
#include<sstream>
#include<cctype>
CaesarCipher::CaesarCipher(int _key){
key = _key;
while(key < 0){
key += 26;
}
key = key % 26;
}
string CaesarCipher::encrypt(string text){
string result;
for (int i = 0;i < text.length(); i... | ALGO | 0.997152 | 4.222263 |
d22554cd-3798-4595-a718-3ed53e516935 | BhaskarAnand-05/Compiler-Design-Lab | DFA_for_ing.cpp | // #include <bits/stdc++.h>
// #include <map>
// #include <string>
// using namespace std;
// map<pair<string, char>, string> transition_function;
// void initialize_transition_function()
// {
// transition_function[make_pair("q0", 'i')] = "q1";
// transition_function[make_pair("q1", 'n')] = "q2";
// tra... | ALGO | 0.998956 | 4.952686 |
ac84e3a9-6d0b-4070-ba5f-f4e3488a02eb | AlexGuzmn/Advanced-Algorithms | A01633819-A01367610_Act3.2/main.cpp | /*
Activity 3.2 Implementation of Dijkstra and Floyd algorithms
Andrés Alejandro Guzmán González - A01633819
José Pablo Naime García - A01367610
*/
#include <iostream>
#include <vector>
#include "./src/Utils.h"
using namespace std;
int main() {
int nodes;
vector < vector<int> > adjMatrix;
cin >> nodes... | ALGO | 0.999554 | 4.900494 |
cf94e29f-4f13-4574-9ada-41818e24a3ce | Hiyabye/Baekjoon | 30xxx/30991.cpp | #include <iostream>
#include <vector>
using namespace std;
void solve(void) {
int n; cin >> n;
vector<long long> a(n+1, 0), b(n+1, 0), c(n+1, 0);
a[0] = 0, b[0] = 0, c[0] = 1;
for (int i=1; i<=n; i++) {
a[i] = a[i-1] - c[i-1];
b[i] = b[i-1] + c[i-1];
c[i] = 2*a[i-1] - 2*b[i-1] + c[i-1];
}
cout... | ALGO | 0.999989 | 3.551306 |
88df6483-bb6c-4790-83b0-35b8b5008f2a | kitewu/datastructure_algorithm | SDUST-OJ/oj中缀转后缀.cpp | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<string>
#include<stack>
#include<vector>
#include<cmath>
using namespace std;
bool isOperator(char c)
{
if(c == '+' || c == '-' || c == '*' || c == '/' || c == '%' || c == '^' || c == '(' || c == ')')
return true;
return fa... | ALGO | 0.999831 | 3.489691 |
180d226c-a1f2-4510-8342-24c7448ddb11 | DevlTz/ITP | Funções_EXERCICIOS/08-conjunto.cpp | #define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include "doctest.h"
/*
* Um conjuto é um tipo de coleção que possui uma propriedade particular: nenhum
* elemento se repete.
*
* Implemente uma função que transforme uma dada sequência qualquer de inteiros
* em um conjunto. Ou seja, não deve haver repetição de elemento... | TEST | 0.923658 | 5.757719 |
f7ee046a-47b9-4d42-9d03-ba52e9bb99ed | BrowserWorks/Waterfox-Classic | modules/fdlibm/src/e_hypot.cpp | /* @(#)e_hypot.c 1.3 95/01/18 */
/* __ieee754_hypot(x,y)
*
* Method :
* If (assume round-to-nearest) z=x*x+y*y
* has error less than sqrt(2)/2 ulp, than
* sqrt(z) has error less than 1 ulp (exercise).
*
* So, compute sqrt(x*x+y*y) with some care as
* follows to get the error below 1 ulp:
... | ALGO | 0.999945 | 4.963704 |
afaea93d-f13b-4113-9bfc-b0c3510735c1 | firaandiani/TugasMobileProgramming | 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 |
8e3de972-1f0a-47ce-8063-f992216d5156 | ishandutta2007/codeforces | hydrogen_zyx/normal/1693/A.cpp | #include<bits/stdc++.h>
using namespace std;
#define pii pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define de(x) cout<< #x << ' ' << x << endl;
typedef long long ll;
const ll N = 1e6 + 5;
const ll mod = 1e9 + 7;
ll a[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
c... | ALGO | 0.9999 | 4.220801 |
4353d755-ea22-429c-a319-ad499264e478 | gavin971/CPP_Learning | Cpp-Primer/ch15/ex15.7/limit_quote.cpp | #include "limit_quote.h"
double Limit_quote::net_price(std::size_t n) const
{
if (n > max_qty)
return max_qty * price * discount + (n - max_qty) * price;
else
return n * discount *price;
}
| ALGO | 0.937733 | 5.621136 |
18f26ff0-2f67-40e2-8e1a-73044cd6ba34 | victorgdc/leetcode-submissions | problems/reverse-string/Accepted/3-10-2023, 4_52_36 PM/Solution.cpp | // https://leetcode.com/problems/reverse-string
class Solution {
public:
void reverseString(vector<char>& s) {
for (int i = 0, j = s.size()-1; i < j; i++, j--) {
swap(s[i], s[j]);
}
}
}; | ALGO | 0.999037 | 6.439757 |
eeb68ba8-4131-4e9c-8850-c189c0e2bf19 | pm306/procon | 典型90問/056.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
constexpr double EPS = 1e-9;
#define all(v) v.beg... | ALGO | 0.999987 | 4.347599 |
16cd3560-728d-43d5-aa3f-15d3239e63ea | EhsanQA/ACM-ICPC_Trainings | CacheBenchmark.cpp | #include<bits/stdc++.h>
using namespace std;
int loger(int a) {
return (int)(log(a) / log(2));
}
int binToDec(string a) {
int dec = 0;
for (int i = a.size() - 1; i >= 0; i--) {
if (a[i] == '1')
dec += pow(2, a.size() - 1 - i);
}
return dec;
}
int tagger(int tagSize, string ad... | ALGO | 0.98552 | 4.513153 |
f3d810c4-d80d-42a3-9e9f-f6a369d654af | luxroot/baekjoon | old/10990/main.cpp | #include <iostream>
using namespace std;
int main()
{
int i,j,n;
cin >> n;
for(i=0;i<n;i++){
for(j=0;j<n-i-1;j++)cout << ' ';
cout << '*';
for(j=0;j<2*i-1;j++)cout << ' ';
cout << (i==0 ? "\n" : "*\n");
}
return 0;
} | ALGO | 0.999906 | 3.57096 |
f2ff41b8-6297-438b-841b-a9b60e667d51 | OftenDeadKanji/DirectX11-Renderer | Engine/src/math/box.cpp | #include "box.h"
#include "ray.h"
#include "intersection.h"
namespace Engine::math
{
bool Box::intersects(const Ray& ray, Intersection& outNearest) const
{
float tmin = (min.x() - ray.origin.x()) / ray.direction.x();
float tmax = (max.x() - ray.origin.x()) / ray.direction.x();
if (tmin > tmax)
{
std::swa... | TOOL | 0.862685 | 7.071084 |
650f8a44-fe6b-4e1b-9a38-0cf9b02ab162 | danilovict2/Competitive-Programming-Problems | CSES/Tasks and Deadlines/main.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define mp make_pair
#define sz(a) a.size()
#define MOD 1000000007
#define forn(i, n) for (int i = 0; i < n; ++i)
#... | ALGO | 0.999725 | 3.579363 |
848d559a-0df8-4dd1-92bf-f86457639da2 | sinsheep/dateStructures | binaryTree/binaryTree.cpp | #include<stdlib.h>
#include<stack>
#include<queue>
#include<stdio.h>
using namespace std;
typedef struct TreeNode* binaryTree;
struct TreeNode{
int data;
struct TreeNode* left;
struct TreeNode* right;
};
void PreOrder(binaryTree T){//先序遍历
if(T!=NULL){
printf("%d\n",T->data);
PreOrder(T->... | ALGO | 0.999991 | 4.171626 |
791af86a-f2fe-4402-864c-dc91c9c0b85a | ishandutta2007/codeforces | maspy/normal/6/B.cpp | #line 1 "main.cpp"
#include <bits/stdc++.h>
#line 3 "/home/maspy/library/my_template.hpp"
using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using v... | ALGO | 0.999891 | 4.506506 |
1ec845b6-6aed-4ca0-b820-76ca8ab99f93 | buresjan/optim_lbm | nomad/examples/advanced/library/exampleSuggestAndObserve/suggestAndObserve.cpp | /*---------------------------------------------------------------------------------*/
/* NOMAD - Nonlinear Optimization by Mesh Adaptive Direct Search - */
/* */
/* NOMAD - Version 4 has been created by ... | ALGO | 0.999883 | 6.357028 |
1cb0a56b-0263-43c8-9d58-0b86abcf6299 | Rendex451/vm-2025 | lr3/main.cpp | #include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
// Функция: x^5 + x + a = 0
double f(const double& x, const double& a) {
return pow(x, 5) + x + a;
}
// Производная функции: 5x^4 + 1
double df(const double& x) {
return 5 * pow(x, 4) + 1;
}
// Вторая производная функции: 20x^3
dou... | ALGO | 0.999965 | 5.512521 |
4fa9a606-5ef6-447a-8adb-da058ff9b1f1 | mbhs/mbit | archive/2024s/solutions/BehindTheScenes.cpp | // int max = 2 147 483 647 (2^31-1)
// ll max = 9 223 372 036 854 775 807 (2^63-1)
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define MOD 1000000007
typedef long long ll;
typedef long double ld... | ALGO | 0.999975 | 4.421781 |
2c5b3fcb-1ff7-4290-80d4-a13d8f6c10fe | GalaxionZero/APL | Metnum/project2/regulaFalsi.cpp | #include <iostream>
#include <cmath>
using namespace std;
// Fungsi yang akan dicari akarnya
double func(double x) {
return exp(x) - 5*x*x; // Fungsi e^x - 5x^2
}
// Implementasi metode Regula Falsi
double regulaFalsi(double a, double b, double tol, int maxIteration) {
if (func(a) * func(b) >= 0) {
c... | ALGO | 0.999988 | 5.205504 |
7e02ae1e-0efe-4e72-b076-10827df5cfe6 | MurrayEfford/secr | src/pdot.cpp | #include "secr.h"
using namespace std;
using namespace Rcpp;
using namespace RcppParallel;
struct pdotpoint : public Worker {
const RMatrix<double> xyR;
const RMatrix<double> trapsR;
const RMatrix<double> dist2R;
const RVector<int> detectR;
const RMatrix<double> TskR;
... | ALGO | 0.999451 | 5.821033 |
fa3324a8-22a1-4b59-9f11-bfc77f4f3ad3 | electronicarts/CnC_Red_Alert | WIN32LIB/SRCDEBUG/IRANDOM.CPP | /***************************************************************************
** C O N F I D E N T I A L --- W E S T W O O D A S S O C I A T E S **
***************************************************************************
* *
* ... | TOOL | 0.931694 | 4.330541 |
971fcb8a-fad2-4022-9bb4-e5cf3177db2a | WLL1020/Mathematical-Modeling-Course-Code | main.cpp | //#define _CRT_SECURE_NO_WARNINGS
//#include <iostream>
//#include <cmath>
//using namespace std;
//
//// жһǷΪĺ
//bool isPrime(int num) {
// if (num <= 1) return false; // 1µ
// for (int i = 2; i <= sqrt(num); i++) {
// if (num % i == 0) {
// return false; // ˵
// }
// }
// return t... | ALGO | 0.987479 | 4.105773 |
d8560ce2-1940-4795-bf0b-2c8c44a93d5f | Ahmed101Noor/Problem-Solving | 2652-sum-multiples/2652-sum-multiples.cpp | class Solution {
public:
int sumOfMultiples(int n) {
int sum=0;
for (int i=1 ; i<=n;i++){
if(i%3==0||i%5==0||i%7==0){sum+=i;}
}
return sum;
}
}; | ALGO | 0.999883 | 4.890433 |
c2ab7c75-0ebc-47c9-8396-014845c18c4b | iamslash/learntocode | leetcode/BasicCalculatorII/a.cpp | #include <cstdio>
#include <string>
#include <sstream>
// l
// 0 + 3 + 2 * 2 + 0
//
class Solution {
public:
int calculate(std::string s) {
std::istringstream iss("+"+s+"+");
int r = 0; // total
int last = 0; // last term
char opr = 0; // operator
int opd = 0; // operand
... | ALGO | 0.999729 | 4.888525 |
6b38dd41-7eca-4262-8fde-577758bef633 | lyb1234567/CMU_Database | src/optimizer/optimizer.cpp | #include "optimizer/optimizer.h"
#include <optional>
#include "common/util/string_util.h"
#include "execution/plans/abstract_plan.h"
namespace bustub {
auto Optimizer::Optimize(const AbstractPlanNodeRef &plan) -> AbstractPlanNodeRef {
if (force_starter_rule_) {
// Use starter rules when `force_starter_rule_` is... | ALGO | 0.870966 | 7.890601 |
d5ea8d09-a37e-446f-afdd-8f5b6e05deae | AccentureMobilityServices/frameworks_base | media/libstagefright/codecs/amrwb/src/synthesis_amr_wb.cpp | /*
------------------------------------------------------------------------------
Filename: synthesis_amr_wb.cpp
Date: 05/04/2007
------------------------------------------------------------------------------
REVISION HISTORY
Description:
--------------------------------------------------------------------... | ALGO | 0.999688 | 3.877183 |
efac96ab-b544-4cf9-b958-371f954ca684 | Jimut123/code-backup | 4rth_Sem_c++_backup/parenthesis/is_print.cpp | /* isprint example */
#include <stdio.h>
#include <ctype.h>
int main ()
{
int i=0;
char str[]="first line \n second line \n";
while (isprint(str[i]))
{
putchar (str[i]);
i++;
}
return 0;
}
| TOOL | 0.912741 | 3.743786 |
27d1d0ea-7fae-494a-8166-c4295e8ef6e5 | lovi-bhatia/Coding-Ninja-DSA | Backtrack/sort_find_subsets.cpp | // lexicographically and length
#include <bits/stdc++.h>
using namespace std;
bool compare(string a, string b){
if(a.length()==b.length())
return a<b; //lexicographically because length is same
return a.length()<b.length();
}
void findSubsets(char *input, char *output, int i, int j, vector <string> &v){
// b... | ALGO | 0.999956 | 4.49762 |
b70a0336-0adf-4bc6-8450-bf68b75631fa | kushagra1934/LCsolutions | 2216-delete-the-middle-node-of-a-linked-list/2216-delete-the-middle-node-of-a-linked-list.cpp | /**
* 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:
ListNode* deleteMiddl... | ALGO | 0.999913 | 5.782657 |
d1a16a37-5796-413a-8b30-43480091584e | windcry1/My-ACM-ICPC | Practise/XTJ.cpp | #include<stdio.h>
int main()
{
int a,b,c,i=1;
float sum=0;
scanf("%d %d %d",&a,&b,&c);
while(i<=a)
sum+=i++;
i=1;
while(i<=b)
{
sum+=i*i;
i++;
}
i=1;
while(i<=c)
sum+=1.0/(float)(i++);
printf("%.2f\n",sum);
return 0;
}
| ALGO | 0.999604 | 3.226265 |
b0380f65-36a0-4823-84eb-5a7aad486fde | ishandutta2007/codeforces | robezh/normal/722/E.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define subnb true
#define Lnb true
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll... | ALGO | 0.99991 | 4.12989 |
88c09efb-5c97-447e-972b-582f3cc1b1c9 | adarsh-verma1/My-DSA-CP-Learning | Codeforces/50/50-A.cpp | /*
Author: ADARSH VERMA
Codeforces: adarsh_verma_
Codechef: adarsh_verma_
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vs vector<string>
#define pb push_back
#define um unordered_map
#define F first
#define S se... | ALGO | 0.999748 | 5.119806 |
23261670-415e-4399-9135-ef2f6deacd5c | laosiaudi/leetcode | Sliding_Window_Maximum.cpp | /*********************************************************************************
* File Name : Sliding_Window_Maximum.cpp
* Created By : laosiaudi
* Creation Date : [2015-11-15 17:38]
* Last Modified : [2015-11-15 19:56]
* Description :
******... | ALGO | 0.999979 | 5.386669 |
dc1744db-051b-48c9-8cd6-b7131617990f | devlipe/INF110 | 10Aula/horario.cpp | /* Programa com o uso de structs para calcular a diferenca entres dois horarios
Felipe P Ferreira
26/11/2020
*/
#include <iostream>
#include <iomanip>
using namespace std;
typedef struct horario
{
int hora;
int minuto;
}horario;
void le (horario &t)
{
cin >> t.hora >> t.minuto;
}
horario difer... | ALGO | 0.99724 | 4.571526 |
412cb81b-5db0-4784-8b96-ef70e9a4cc39 | ImprovedPerspective/CompetitiveProgramming | Kattis/Completed/Bela.cpp | #include <iostream>
using namespace std;
int main()
{
int valuesD [8] = {11, 4, 3, 20, 10, 14, 0, 0};
int valuesN [8] = {11, 4, 3, 2, 10, 0, 0, 0};
int hands;
char suit;
cin >> hands >> suit;
int points = 0;
for(int a =0; a < 4* hands; a++)
{
char card, s;
cin >> card >> s;
if(s==suit)
{
switch(car... | ALGO | 0.99909 | 3.946761 |
8f2feeeb-0fa1-4bae-bd40-dff6623c56a8 | Arspasov/HackerRankProblems | InsertANodeAtASpecificPositionInALinkedList/InsertANodeAtASpecificPositionInALinkedList.cpp | // Complete the insertNodeAtPosition function below.
/*
* For your reference:
*
* SinglyLinkedListNode {
* int data;
* SinglyLinkedListNode* next;
* };
*
*/
SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* head, int data, int position) {
SinglyLinkedListNode* current = head;
Sin... | ALGO | 0.998559 | 5.427 |
c849c79b-2ec7-4300-b4af-d099f98ba203 | MdMostafizurRahaman/Random-Code | DFA_Minimization (1).cpp | #include<iostream>
#include<string>
using namespace std;
const int numOfAlpha = 3;
const int maxN = 100;
string DFA[maxN][numOfAlpha];
string FinalStates[maxN];
bool matrix[maxN][maxN];
void calibrate()
{
for(int i = 0; i < maxN; i++)
{
for(int j = 0; j < maxN; j++)
{
matrix[i][j] =... | ALGO | 0.999987 | 4.401333 |
c2abf730-e31c-4e41-aaa3-8df39c0905de | RohitKotha/leetcodePrograms | 1496-lucky-numbers-in-a-matrix/lucky-numbers-in-a-matrix.cpp | class Solution {
public:
vector<int> luckyNumbers (vector<vector<int>>& mat) {
vector<int>minis;
vector<int>maxis;
for(int i=0;i<mat.size();i++){
int min=mat[i][0];
for(int j=0;j<mat[0].size();j++){
if(min>mat[i][j]){
min=mat[i][j];... | ALGO | 0.999899 | 6.170324 |
8516e2ee-9fd9-4980-b301-d6ba2e3c0790 | vtman/DockEM2 | xd_peaks.cpp | #include "xdock_header.h"
int XData::findPeaks() {
int iq, kq, jq, kqq, iqq, jqq, np, np2;
Ipp64f sk, sj, si;
unsigned int u1, u2;
Ipp32s* vPeak, * vindex;
Ipp32u* uIndex, * uTemp;
Ipp32f* v_loc, * v_loc2, *wCC;
Ipp64f* vAng;
quat* vQ;
quat qa, qb, qc, qres;
bool t;
npeaks = 0;
vPeak = (Ipp32s*)pmcTemp... | ALGO | 0.998318 | 4.10026 |
43b57745-fd90-461a-bf82-52800c4a5929 | OneBitPython/Codeforces | Round845/A_Everybody_Likes_Good_Arrays.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define all(c) c.begin(), c.end()
#define endl "\n"
const double PI=3.141592653589;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << ... | ALGO | 0.999309 | 4.243333 |
978b3b94-646f-4aa7-8990-79e974af4dcf | ishandutta2007/codeforces | sofapuden/normal/1487/D.cpp | #include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef pair<db,db> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typ... | ALGO | 0.99955 | 4.499901 |
541a9a49-7ebe-45d8-b62a-13a35ccc12d9 | SunnyBodana/MODULE-.4---ASSIGNMENT | MODULE 4 ASSIGNMENT/CLASS & OBJECT/5.cpp | /*
5. Write a C++ program to create a class called Rectangle that has private
member variables for length and width. Implement member functions to
calculate the rectangle's area and perimeter.
*/
#include <iostream>
using namespace std;
class Rectangle{
private:
double length;
double width;
public :... | TOOL | 0.925812 | 4.739632 |
3f168228-9aa6-4d18-9454-c0538d2c8b38 | raincross7/code-similarity | codes/train_code/problem364/problem364_41.cpp | #include <iostream>
using namespace std;
int main(){
int n, a, b; cin >> n >> a >> b;
cout << (((abs(a-b)-1)%2) ? "Alice" : "Borys") << endl; return 0;
} | ALGO | 0.999797 | 3.455561 |
74b413ff-0b62-4e78-acbf-85ecd1aa396e | AbdelrahmanAboulfotouh/Problem-Solving | leetcode/Medium/Add-Two-Numbers.cpp | /**
* 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:
ListNode* addTwoNumbe... | ALGO | 0.999956 | 6.339733 |
cf4a7bbe-4df1-4661-8f38-a6419aaf8826 | ZiluZhang/LeetCode-2 | 0021.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* res = new ListNode(-1);
ListNode* tmp = res;
... | ALGO | 0.999973 | 5.983233 |
694f7e56-a401-4cc1-8456-40bed3c9cd8a | PhamThanhPhongPN/Ptit-HCM-C-Session4 | BT5.cpp | #include <stdio.h>
int main(){
int num1,num2,num3;
printf("Hay nhap ba so nguyen : \n");
scanf("%d%d%d",&num1,&num2,&num3);
if (num1 < num3 && num3 < num2 || num2 < num3 && num3 < num1) {
printf("%d nam giua %d va %d",num3,num1,num2);
} else {
printf("%d khong nam giua %d va %d",num3,num1,num2);
}
return 0;... | ALGO | 0.999666 | 3.486482 |
72cad0d0-c289-4396-852e-ba4da314efc1 | ShailzaThakur7/Leetcode | 0209-minimum-size-subarray-sum/0209-minimum-size-subarray-sum.cpp | class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int n=nums.size();
int left=0;
int min_length=INT_MAX;
int sum=0;
for(int i=0;i<n;i++){
sum+=nums[i];
while(sum>=target){
min_length=min(... | ALGO | 0.999996 | 6.453994 |
cd62ce6e-58aa-484b-98b8-cba350f83334 | SebasKoria/CSES-Problem-Set-Solutions | Dynamic Programming/Minimizing Coins.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> coins;
vector<ll> dp;
ll minCoins(ll n){
if(n == 0) return 0;
ll &ans = dp[n];
for(int i=0;i<coins.size() && coins[i] <= n; i++){
ans = min(ans, 1 + dp[n - coins[i]]);
}
return ans;
}
int main()
{
ll n, ... | ALGO | 0.999991 | 4.443058 |
cca53497-1769-4691-9057-b51757b18a20 | iwiwi/programming-contests | codeforces/261/D.cpp | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
using namespace std;
#define all(c) (c).begin(), ... | ALGO | 0.999751 | 3.8765 |
cde50aad-b58d-4c17-8a61-a307c5f91f1e | AsceticOfLife/leetcode-CPlusPlus | answer/113.路径总和-ii.cpp | /*
* @lc app=leetcode.cn id=113 lang=cpp
*
* [113] 路径总和 II
*/
// @lc code=start
/**
* 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), ... | ALGO | 0.999976 | 6.564353 |
94ff04f2-9e14-4a15-bd76-a6e3f9bd1a63 | YurkoFlisk/MPI_Test | MPI_Test/main.cpp | #include <iostream>
#include <string>
#include <mpi.h>
using namespace std;
constexpr int K = 8;
int main(int argc, char* argv[])
{
MPI_Init(&argc, &argv);
const double beginTime = MPI_Wtime();
int procCnt, curProcRank;
MPI_Comm_size(MPI_COMM_WORLD, &procCnt);
MPI_Comm_rank(MPI_COMM_WORLD, &curProcRank);
const... | ALGO | 0.896718 | 4.037001 |
0dc30bd9-8cd9-468d-a0e8-b8f09ad05b11 | goropikari/CompetitiveProgramming | atcoder/past019/e.cpp | // https://atcoder.jp/contests/past19-open/tasks/past19_e
// 2025年03月30日 15時59分45秒
#include <bits/stdc++.h>
#include <variant>
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).... | ALGO | 0.999697 | 4.174257 |
216c1986-c793-4406-9c04-4db288640206 | rgyhuang/Competitive_Coding | DMOJ/Other/Boolean.cpp | #include <iostream>
#include <string>
int main() {
std::string a;
int num{ 0 };
std::cin >> a;
while (a.compare("not") == 0) {
std::cin >> a;
num++;
}
if (num % 2 != 0) {
if (a.compare("True") == 0) {
std::cout << "False";
}
else {
std::cout << "True";
}
}
else {
if (a.compare("True") == 0)... | ALGO | 0.994377 | 4.53405 |
a61955a5-d60f-4afc-9e3f-7dcbed56b700 | Ahmedsabib/Phitron_Problem_Solving_Club | Week - 4/Day - 9/C. Minimum Varied Number.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int tests;
cin >> tests;
for (int cases = 0; cases < tests; ++cases) {
int s;
cin >> s;
string ans;
for (int j = 9; j >= 1; j--){
if (s >= j){
ans += (char) ('0' + j);
s ... | ALGO | 0.99988 | 5.268074 |
561e4b9e-b673-4226-b642-52f436a79795 | 13acteria/ITSA-2 | ITSA/11.cpp | #include <iostream>
using namespace std;
int main(){
int m, n;
while(cin >> m){
cin >> n;
int nums[m][n];
for(int r=0; r<m; r++){
for(int c=0; c<n; c++){
cin >> nums[r][c];
}
}
for(int c=0; c<n; c++){
for(int r=0; r<m... | ALGO | 0.999236 | 3.378168 |
834c3162-1709-49b5-bffc-72e81a49e044 | tanaysharma94/Dynamic-DROID-SLAM | DROID-SLAM/thirdparty/eigen/unsupported/doc/examples/MatrixSinh.cpp | #include <unsupported/Eigen/MatrixFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
MatrixXf A = MatrixXf::Random(3,3);
std::cout << "A = \n" << A << "\n\n";
MatrixXf sinhA = A.sinh();
std::cout << "sinh(A) = \n" << sinhA << "\n\n";
MatrixXf coshA = A.cosh();
std::cout << "cosh(A) = \n"... | ALGO | 0.991431 | 5.890235 |
a6e115fc-46e6-48d8-b947-5a714d280ba6 | BoleynSu/CompetitiveProgramming | archives/problemset/acm.timus.ru/1079.cpp | /*
PROGRAM: $PROGRAM
AUTHOR: Su Jiao
DATE: 2010-4-10
DESCRIPTION:
$DESCRIPTION
*/
#include <iostream>
using std::cin;
using std::cout;
#include <fstream>
using std::ifstream;
using std::ofstream;
#include <sstream>
using std::stringstream;
using std::endl;
#include <vector>
using std::vector;
#include <string>
using st... | ALGO | 0.99987 | 3.808371 |
ae6da756-0d58-42eb-9dcd-4371dd1b5aa5 | pery77/peryEngine | peryEngine/peryEngine/Box2D/Dynamics/Joints/b2FrictionJoint.cpp | #include "../../Dynamics/Joints/b2FrictionJoint.h"
#include "../../Dynamics/b2Body.h"
#include "../../Dynamics/b2TimeStep.h"
// Point-to-point constraint
// Cdot = v2 - v1
// = v2 + cross(w2, r2) - v1 - cross(w1, r1)
// J = [-I -r1_skew I r2_skew ]
// Identity used:
// w k % (rx i + ry j) = w * (-ry i + rx j)
//... | ALGO | 0.973862 | 7.624512 |
54175ce6-d164-41a0-86db-e873ce24fb65 | PrachieNaik/DSA | DP/NDigitNumbersWithDigitSumS/NDigitNumbersWithDigitSumS.cpp | /*
Problem statement: Find out the number of N digit numbers, whose digits on being added equals to a given number S. Note that a valid number starts from
digits 1-9 except the number 0 itself. i.e. leading zeroes are not allowed.
Since the answer can be large, output answer modulo 1000000007
N = 2, S = 4
Valid numb... | ALGO | 0.999959 | 5.822239 |
44304e03-7a82-47dc-87f4-693a512b2b5a | reepier/Beatmatcher-ArduinoStyle | main/music.cpp | #include "debug.h"
#include "music.h"
#include "constant.h"
SoundAnalyzer beat_analyzer;
extern boolean beat;
void SoundAnalyzer::record(){
unsigned long next = micros();
clip = false;
for (int i=0; i<SAMP_N; i++){
next = next + 1000000.0/SAMP_F;
record_real[i] = analogRead(musicpin);
... | TOOL | 0.893389 | 4.281719 |
e5b3dfba-8573-4f91-8392-0d1c4509d9a7 | CrystalOS-Project/frameworks_av | media/libstagefright/codecs/amrnb/common/src/int_lpc.cpp | /*
Pathname: ./audio/gsm-amr/c/src/int_lpc.c
Functions:
------------------------------------------------------------------------------
REVISION HISTORY
Description: Updated template used to PV coding template.
Changed to accept the pOverflow flag for EPOC compatibility.
Description: Per review comments, replac... | ALGO | 0.994999 | 6.3164 |
08bae8de-28ac-4323-853c-f05958b7f0b9 | FennelDumplings/acwing | prob274_移动服务.cpp | #include <iostream>
#include <vector>
#include <climits>
#include <cstring>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXL = 201;
const int MAXN = 1001;
int dp[MAXN][MAXL][MAXL];
int c[MAXL][MAXL];
int p[MAXN];
int N, L;
void iterative(int i)
{
// 当前阶段为 i
if(i == N)
return;
for(... | ALGO | 0.999901 | 3.529443 |
6b09381b-fc80-4865-9f39-1191d95dc566 | DeepCoudharyPEC/DSA-Assignments-SEM-3 | Comparing Binary Search and Binary Search Tree (BST)-21105008.cpp | //
#include <iostream> //DEEP CHOUDHARY
#include <queue> //SID:21105008 ECE
using namespace std;
//Creating structure of Node of a tree
class Node{
public:
int data;
Node*left;
Node*right;
Node(int data){
this->data=data;
left=NULL;... | ALGO | 0.999975 | 5.343818 |
63ef89f8-436f-437a-ad7a-4db1de35a655 | Leonardo-Miguel/beecrowd_URI_judge_solutions | 04_estruturas_e_bibliotecas/1256.cpp | #include <bits/stdc++.h>
using namespace std;
/*
A resoluo basicamente consiste em utilizar um dicionrio em que as chaves so
os endereos, e cada chave guarda vetores como valor. Nesse caso cada endereo
armazenar os diferentes elementos que apontam para esses endereos.
*/
vector<int> split_and_convert_string(string s... | ALGO | 0.989247 | 3.700684 |
b49ddad2-ef5a-47e0-ac60-6dfc87955d0a | rizwaanbashir2001/GFG | School/Find Index/find-index.cpp | //{ Driver Code Starts
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
vector<int> findIndex(int a[], int n, int k)
{
int f=-1;
int h=-1;
vector<int >ans;
for(int i=0;i<n;i++){
if(a[i]=... | ALGO | 0.999888 | 5.79306 |
b5774254-efa3-4270-9d43-c6dbab095a0f | Thisayang/Codeforces | 579A_Raising_Bacteria.cpp | #include <bits\stdc++.h>
using namespace std;
int main() {
int x, ans = 0;;
cin >> x;
while(x > 0) {
if(x % 2 == 1) ans ++;
x /= 2;
}
cout << ans;
return 0;
}
| ALGO | 0.999894 | 4.377522 |
a3ca70b4-90ee-4ade-ba0c-3fc547cc0787 | imkhushboo/QOTD | 12-07-2024.cpp | class Solution {
public:
int helperx(string &s, int x)
{
// cout<<s<<" ";
stack<char>st;
int ans = 0;
for(auto it: s)
{
// cout<<it<<"--\n";
if(!st.empty() and st.top() == 'a' and it == 'b')
{
st.pop();
... | ALGO | 0.999941 | 5.375709 |
db206858-5813-4138-8ec3-1e477b02386e | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_9109_3.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 2e6, MOD = 1e9 + 7;
const long double EPS = 0.000000001;
pair<long long, long long> p[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long x, x1, y, y1, n, ans1 = INT_MAX;
cin >> n >> x >> y >> x1 >> y1;
vector<pair<long long, long ... | ALGO | 0.999764 | 3.821129 |
e62dc49a-e206-4cc2-9314-648daa68b766 | alexandraback/datacollection | solutions_5634697451274240_1/C++/andcai/RevengePancakes.cpp | #include <fstream>
using namespace std;
int main(){
ifstream fin ("B-large.in");
ofstream fout ("B-output.txt");
int t, x;
fin >> t;
char input[101];
for (int i = 1; i <= t; i++){
fin >> input;
int cnt = 0;
for (x = 1; input[x] == '+' || input[x] == '-'; x++){
if (input[x] != input[x-1]) cnt++;
}
i... | ALGO | 0.999852 | 4.077619 |
78dbaf88-561e-4084-9291-a7a8d2b0612a | shoulderhu/uva | 11235 Frequent values.cpp | #include <iostream>
#include <algorithm>
using namespace std;
int n;
int tree[200000], bleft[100000], bright[100000];
void setTree() {
for (int i = n - 1; i > 0; --i) {
tree[i] = max(tree[2 * i], tree[2 * i + 1]);
}
}
int getTree(int i, int j) {
int m = 0;
for (i += n, j += n; i <= j; i /= 2, j = (j - 1) ... | ALGO | 0.998344 | 3.877857 |
64264b61-1cd1-482f-97bd-ae447d688494 | Farhan-Ahmed-Mohammed/striver_dsa_sheet | preorder traversal of binary tree.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.999971 | 6.09182 |
451eafbd-fbcc-4652-9269-157731567066 | greatwhiteshark293/Datastructure | Arrays/1.1 Merge two sorted arrays.cpp | // 88. Merge Sorted Array
// https://leetcode.com/problems/merge-sorted-array/
// You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.
// Merge nums1 and nums2 into a single array sorted in non-... | ALGO | 0.99992 | 6.839575 |
9a36176b-3abd-45fa-81fd-038fed65e4dd | jjcook/velour | src/sg_covcutoff.cpp | //
// sg_covcutoff.cpp
//
// sequence graph coverage cutoff -- delete nodes with insufficient kmer coverage
//
// XXX NOTE: do not apply to partitioned graphs!!!
#include "types.h"
//
// CONFIGURABLE PARAMETERS
//
// NONE?
// internal statistics variables // TODO: need to reset some of these between iterations
sta... | ALGO | 0.939816 | 6.877695 |
c3514f24-69f0-4677-8805-d9d94bd3ce04 | harshitasaini16/Leetcode-Practise | 329-longest-increasing-path-in-a-matrix/329-longest-increasing-path-in-a-matrix.cpp | class Solution {
public:
int longestIncreasingPath(vector<vector<int>>& mat) {
int n=mat.size();
int m=mat[0].size();
vector<vector<int>>ans(n,vector<int>(m,1));
queue<pair<int,int>>q;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
q.push({i,j});
... | ALGO | 0.999984 | 6.170009 |
b9b80eac-d8d5-4c39-a0ad-ddecfac465f6 | Harshita781/DSA | Stack/IsRedundantBracket.cpp | /*
Problem Statement:
Given valid mathematicalexpression in the form of a string.You are supposed to return true if the givrn expression cntains a pair of redundant bracket, else return false. The given string only contains '(',')','+','-','*','/' and lowercase English letters.
Sample Input 1 :
2
(a+b)
(a+c*b)+(c))
Sam... | ALGO | 0.998115 | 4.511874 |
2f1af9f3-ff6d-4237-b6b4-7f481c949e5c | NQBH/advanced_STEM_beyond | OLP_ICPC/C++/NHH_Christmas_party.cpp | #include <iostream>
using namespace std;
static const long long MOD = 1000000007;
int main() {
int n; cin >> n;
// base cases: !0 = 1, !1 = 0
if (n == 0) {
cout << 1 << "\n";
return 0;
}
if (n == 1) {
cout << 0 << "\n";
return 0;
}
long long prev2 = 1; // ... | ALGO | 0.999995 | 4.823666 |
2b393a16-1b8c-4d9c-827c-dbd9e3531ada | devid8642/Algorithms-and-Data-Structures | problems/problem101/main.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b + c && b < a + c && c < a + b) {
cout << 'S' << endl;
if (a == b && b == c)
cout << 3 << endl;
else if (a != b && b != c && a != c)
cout ... | ALGO | 0.999856 | 4.686584 |
023846fd-462d-41ac-9338-6cd6b8e834f8 | ishandutta2007/codeforces | oleh1421/normal/1420/A.cpp | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=500010;
int a[N];
void solve(){
int n;cin>>n;
for (int i=1;i<=n;i++) cin>>a[i];
for (int i=2;i<=n;i++){
if (a[i]>=a[i-1]){
cout<<"YES\n";
return;
}
}
cout<<"NO\n";
}
int main() {
... | ALGO | 0.999925 | 4.256288 |
8540d088-2e2a-4579-942c-3c32d063e962 | zal-orz/pytorch | aten/src/ATen/native/cpu/BinaryOpsKernel.cpp | #define TORCH_ASSERT_NO_OPERATORS
#include <ATen/native/BinaryOps.h>
#include <cmath>
#include <ATen/Dispatch.h>
#include <ATen/Dispatch_v2.h>
#include <ATen/OpMathType.h>
#include <ATen/Parallel.h>
#include <ATen/cpu/vec/functional.h>
#include <ATen/cpu/vec/vec.h>
#include <ATen/native/Math.h>
#include <ATen/native/... | ALGO | 0.945019 | 4.155545 |
904c7fe1-0b4a-4ad8-a441-aa7669f80be7 | eshf/NPSI | source/headers/boost/libs/bimap/example/repetitions_counter.cpp | // VC++ 8.0 warns on usage of certain Standard Library and API functions that
// can be cause buffer overruns or other possible security issues if misused.
// See https://web.archive.org/web/20071014014301/http://msdn.microsoft.com/msdnmag/issues/05/05/SafeCandC/default.aspx
// But the wording of the warning is mis... | TOOL | 0.900271 | 6.431441 |
aa6e8d58-8b2c-4827-ab3d-db3abad04c4d | ibhupesh/OOPS-Lab | Inheritance/friend.cpp | #include <iostream>
using namespace std;
class B;
class A {
private:
int numA;
public:
A(): numA(12) { }
friend int add(A, B);
};
class B {
private:
int numB;
public:
B(): numB(1) { }
friend int add(A , B);
};
int add(A objectA, B objectB)
{
return (objectA.num... | TOOL | 0.923932 | 4.900976 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.