uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
1296e3bd-5841-404c-abd0-2db1b5fb68cf | MayThirtyOne/DS-Algo | Coding Ninjas/3. Recursion/4_last_index_of_number.cpp |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int lindex(int* a, int size, int k){
if(size==0)
return -1;
if(a[size]==k)
return size;
return lindex(a,size-1,k);
}
void solve()
{
int size;
cin>>size;
int arr[size];
for(int i=0;i<size;i++) cin>>arr[i];
int k=2;
cout<<lindex(... | ALGO | 0.999635 | 4.478711 |
cee12d0b-908f-47ad-88cb-cd90dd3d57fb | Irfanrmdni/Algoritma-Pemrograman | Operasi Pengulangan/For Loop/Mencari jumlah huruf kapital pada string/kapital.cpp | #include <stdio.h>
#include <iostream>
#include <conio.h>
#include <string.h>
using namespace std;
int main(){
// OPERASI PENGULANGAN DENGAN FOR LOOP
// MENAMPILKAN STRING DAN MENGHITUNG JUMLAH HURUF KAPITAL NYA SAJA
char kata[100];
char kar;
int jum = 0, panjang;
cout << "Masukan kata : ";
gets(kata);
fo... | TOOL | 0.989192 | 3.755289 |
8d776608-7b54-4cae-a4c7-0b3cf667a0ca | CapTen101/CP-Solutions | ResourcesFromYoutube/Aditya Verma/Binary Search/Index of First 1 in a Binary Sorted Infinite Array.cpp | #include <bits/stdc++.h>
using namespace std;
#define start \
int t; \
cin >> t; \
while (t--)
int bin_firstoccurence(int arr[], int l, int r, int k)
{
int ans = -1;
while (l <= r)
{
int mid = l + (r - l) / 2;
if (k == arr[mid])
{
ans = mid;
... | ALGO | 0.999937 | 5.261253 |
0cdbe54d-4c2f-4ae7-9e72-16554538724d | channel104257/TaipeiTech-Programming-292362 | final-exam/exercise 5/main.cpp | #include <iostream>
using namespace std;
struct Check
{
char number;
Check *nextptr;
};
typedef struct Check check;
typedef Check *checkptr;
void displayBits(unsigned int x);
void printList(checkptr head);
checkptr isEmpty(checkptr head);
int main()
{
unsigned int x;
cout << "Please Enter a number (... | ALGO | 0.998251 | 5.356864 |
3aa8ebf1-d5a5-4e2e-b1f4-ad13669e879c | Compiler-Dependency-Analysis/llvm-levioso | lldb/source/Utility/Args.cpp | #include "lldb/Utility/Args.h"
#include "lldb/Utility/ConstString.h"
#include "lldb/Utility/FileSpec.h"
#include "lldb/Utility/Stream.h"
#include "lldb/Utility/StringList.h"
#include "llvm/ADT/StringSwitch.h"
using namespace lldb;
using namespace lldb_private;
// A helper function for argument parsing.
// Parses the ... | TOOL | 0.959236 | 7.41124 |
33aaacb5-6244-4b53-b15d-1ddb170506eb | vishnu510/LeetCode_Problem | 1021-remove-outermost-parentheses/1021-remove-outermost-parentheses.cpp | class Solution {
public:
string removeOuterParentheses(string s) {
int count=0;
string str;
for(int i=0;i<s.size();i++){
if(s[i]=='('){
if(count++){
str+='(';
}
}
else{
if(--count){
... | ALGO | 0.999668 | 6.268948 |
2c270e41-4f40-4e4c-b95e-84f4efcc56b4 | aryangupta02092002/April-Challenge-2023 | GFG/WifiRange.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:
bool wifiRange(int N, string s, int X){
// code here
int temp=0;
for(int i=0;i<N;i++)
{
if... | ALGO | 0.99922 | 5.091104 |
25f759a4-7934-4c2f-a1fd-f8c789ac0fc2 | VarlamovAM/Cpp_contests | 2_week/Task_2.cpp | #include <iostream>
#include <vector>
int main(){
std::vector<int> nums {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20};
int N;
std::cin >> N;
int i = 0;
int j = 0;
int first_number = 0;
int second_number = 0;
bool flag = false;
std::cout << nums.size(... | ALGO | 0.999915 | 4.31873 |
03528413-4397-4fb7-b439-7e9784a905f8 | haoliumilan/RAsocoC | cocos2d/tools/simulator/libsimulator/lib/ProjectConfig/SimulatorConfig.cpp |
#include "SimulatorConfig.h"
#include <sstream>
SimulatorConfig *SimulatorConfig::_instance = NULL;
SimulatorConfig *SimulatorConfig::getInstance()
{
if (!_instance)
{
_instance = new SimulatorConfig();
}
return _instance;
}
SimulatorConfig::SimulatorConfig()
{
_screenSizeArray.push_back... | CONFIG | 0.895892 | 4.314808 |
f096e9dd-9b63-4c7d-9d1e-9d01ae53ddbc | vynghiep/thuupdate | 53.cpp | #include <bits/stdc++.h>
#include <string>
using namespace std;
class Hangxe {
private:
string MaHX, TenHX, Country;
int Date;
public:
Hangxe() {}
Hangxe(string ma, string ten, string nuoc, int nam) {
MaHX = ma;
TenHX = ten;
Country = nuoc;
Date = nam;
}
strin... | ALGO | 0.988696 | 4.279691 |
2385a2de-b245-4d7a-bb2d-697224db928f | BloodnBones/7Sins | Move from Here/7Sins/Dependencies/Include/Box2D/Dynamics/Joints/b2GearJoint.cpp | #include <Box2D/Dynamics/Joints/b2GearJoint.h>
#include <Box2D/Dynamics/Joints/b2RevoluteJoint.h>
#include <Box2D/Dynamics/Joints/b2PrismaticJoint.h>
#include <Box2D/Dynamics/b2Body.h>
#include <Box2D/Dynamics/b2TimeStep.h>
// Gear Joint:
// C0 = (coordinate1 + ratio * coordinate2)_initial
// C = (coordinate1 + ratio ... | ALGO | 0.945442 | 6.952128 |
e7e306f3-676e-444a-9d18-5dacdbabf31e | AndyS1mpson/Distributed-Computing-Tasks | mpi/2.ScalarProduct/main.cpp | /*
Задача:
Найти скалярное произведение векторов.
*/
#include <iostream>
#include <stdio.h>
#include <unistd.h>
#include <ctime>
#include <mpi.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define MAX_RAND_VAL 100000 // верхняя граница значений вектора
#define VECTOR_SIZE 1000000 // ра... | ALGO | 0.999737 | 4.686704 |
f1996c97-7c6c-4397-a599-7ae7870482e9 | fshrmnsfrnd/ProgSchule | C++/Arrays/Arrays/Arrays.cpp | #include <string>
#include <iostream>
#include <stack>
using namespace std;
int main(){
char richtung;
cout << "Welche Richtung? (B zu M = 1/M zu B = 0): ";
richtung = '0';
string inputb = "ab c";
string inputm = "._ _._.";
char buchstaben[] = {'a', 'b', 'c'};
string morsecodes[] = {"._", "_...", "_._."};
st... | ALGO | 0.999571 | 3.974823 |
bb9606ea-0f88-462d-a19c-30814bbafa94 | roytam1/UXP | gfx/skia/skia/src/animator/SkParseSVGPath.cpp | #include <ctype.h>
#include "SkDrawPath.h"
#include "SkParse.h"
#include "SkPoint.h"
#include "SkUtils.h"
#define QUADRATIC_APPROXIMATION 1
#if QUADRATIC_APPROXIMATION
////////////////////////////////////////////////////////////////////////////////////
//functions to approximate a cubic using two quadratics
// m... | TOOL | 0.92006 | 4.305493 |
4518b787-3cb3-4259-8993-e09289f64531 | Compiler-Dependency-Analysis/llvm-levioso | llvm/lib/Transforms/IPO/GlobalDCE.cpp | #include "llvm/Transforms/IPO/GlobalDCE.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/Analysis/TypeMetadataUtils.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/IntrinsicInst.h"
#include "llvm/IR/Module.h"
#include "llvm/IR/Operator.h"
#include "llvm/InitializePasses.h"
#inc... | TOOL | 0.924158 | 7.886633 |
fcaa729c-b4b6-416d-b433-69669e957332 | MohiZzine/CP | problems/CF Contests/ECPC Training/STL Contest 1/D.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
stack<string> tags;
while(n--) {
string s; cin >> s;
if (s.find("End") != string::npos) {
if (!tags.empty() && tags.top() == s.substr(3)) tags.pop();
else {
cout << "WA";
... | ALGO | 0.976094 | 4.689248 |
4af8fad3-2a54-42d6-836b-401248f23f0b | nagasowmyakovvuri/c-programs | string upper letter.cpp | # include<stdio.h>
#include<string.h>
int main()
{
char s1[100];
scanf ("%[^\n]s",s1);
//strupr(s1);
//printf("%s",s1);
strlwr(s1);
printf("%s",s1);
return 0;
}
| ALGO | 0.99646 | 3.103385 |
a180e982-3994-4824-9cba-9ad66f991803 | mdarienzo/scicomp100-cpp-linux | session15/lab5/DrawTorus.cpp | // DrawTorus.cpp
#include "stdafx.h"
#include "SimpleScreen.h"
using namespace std;
void draw(SimpleScreen& ss)
{
// Define the two radii of the torus
double r1 = 140; // "Donut hole" radius
double r2 = 30; // "Cross-sectional" radius
// Calculate the angle deltas
double intervals = 37;
double deltaP... | ALGO | 0.952342 | 5.990596 |
e7a1ec72-398b-4f18-8c78-cca34edad76d | raincross7/code-similarity | codes/train_code/problem358/problem358_148.cpp | #include<iostream>
#include<queue>
#include<memory>
#include<map>
#include<set>
#include<unordered_map>
#include<array>
#include<vector>
#include<algorithm>
#include<list>
#include<limits>
#include<stdio.h>
#include<math.h>
#include<string>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat =... | ALGO | 0.999934 | 3.854633 |
bdbad9bd-046a-4e6a-b175-2adbcfbc85e7 | shaileshnift/qtum1 | src/evmone/lib/evmone/advanced_analysis.cpp | #include "advanced_analysis.hpp"
#include "opcodes_helpers.h"
#include <cassert>
namespace evmone::advanced
{
/// Clamps x to the max value of To type.
template <typename To, typename T>
inline constexpr To clamp(T x) noexcept
{
constexpr auto max = std::numeric_limits<To>::max();
return x <= max ? static_cast... | ALGO | 0.937051 | 7.320826 |
942db6ac-7197-4015-8334-1dc09eba99b3 | ishandutta2007/codeforces | dragonslayerintraining/normal/36/A.cpp | #include <iostream>
#include <fstream>
std::ifstream fin("input.txt");
std::ofstream fout("output.txt");
int N;
std::string str;
int main(){
fin>>N>>str;
int dist=0;
for(int i=0;i<N;i++){
if(str[i]=='1'){
for(int j=i+1;j<N;j++){
if(str[j]=='1'){
dist=j-i;
break;
}
}
for(int j=i... | ALGO | 0.999987 | 3.896652 |
008175c1-26d1-4e0b-ad71-edfd46945a23 | firewall1337/coding | programming/c++/constructor2.cpp | #include <iostream>
#include <bits/stdc++.h>
#include <string>
#include<cmath>
using namespace std;
class point{
int x,y;
public :
friend void dist(point , point);
point(int a, int b)
{
x = a;
y = b;
}
void display()
{
cout<<"The ... | ALGO | 0.999087 | 3.816418 |
95c792db-5a1a-4aba-a40b-1dd35364e0e0 | ashishkumar11125/GFG-DSA-question | Difficulty: Medium/Indexes of Subarray Sum/indexes-of-subarray-sum.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
vector<int> subarraySum(vector<int> &arr, int target) {
// code here
int s=0;
int c_s=0;
for(int end=0;end<arr.size();end++)
{
c_s+=arr... | ALGO | 0.999567 | 6.346437 |
4c440cc4-9753-4dc5-88a9-663863957bb4 | foy4748/Phitron | Semester3/Week13/d_deadly_laser.cpp | #include <bits/stdc++.h>
#include <cstring>
#define endl "\n"
//#define ll long long int
using namespace std;
bool isFound = false;
int max_r, max_c;
int Ar, Ac, Br, Bc;
const int Limit = 1001;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
bool isVisited[Limit][Limit];
int grid[Limit][Limit];
bool isValid(int... | ALGO | 0.99959 | 4.944925 |
071559b7-95ea-47eb-a8d5-20ff1033b72c | JasonMullen/Programming-1-3 | Chapter5PracticeProblems(OceanLevels)/Chapter5PracticeProblems(OceanLevels).cpp | /*
Name:Jason Mullen
Date:8-3-2020
Assignment: Ocean Levels
Assuming the oceans level is currently rising at about 1.5 millimeters per year,
write a program that displays a table showing the number of millimeters that the ocean will have risen each year for the next 25 years.
*/
#include <iostream>... | TOOL | 0.935757 | 4.130434 |
66c61917-73b7-4363-a0b7-dd71c71dc44e | Miku-Riku/dsa-sprint-30 | arrays/maxSubarray_kadane's-algorithm.cpp | // Title: Kadane's Algorithm for Maximum Subarray Sum
// Link: https://leetcode.com/problems/maximum-subarray/
// Date: 26-06-2025
// time complexity - O(n)
// space complexity - O(1)
// Tags: #Array #DP #Kadane #Leetcode #Medium
// concept -
// Choice 1: Extend the maximum sum subarray ending at the previous elemen... | ALGO | 0.999899 | 6.794455 |
d1d825f9-331b-48b6-9119-3908e967ad0e | ishandutta2007/codeforces | rubikun/normal/1333/F.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=200005,INF=1<<30;
int main(){
std::ifstream in("text.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
int N;cin>>N;
if(N==2)... | ALGO | 0.999994 | 3.530553 |
c8e392aa-d7b7-45a1-b128-4155f1b6da5b | HindzSight/Codes | Learning/test3.cpp | #include<bits/stdc++.h>
using namespace std;
int main() {
int w;
cin >> w;
while (w--) {
string t = "";
cin>>t;
int temp = t[0] - '0';
int arr[10] ;
arr[1] = 13;arr[2] = 23;arr[3] = 31;arr[4] = 41;arr[5] = 53; arr[6] = 67;arr[7] = 73;arr[8] = 83;arr[9] = 97;
... | ALGO | 0.999508 | 3.677395 |
981eaf8d-a1f8-49c0-96cc-798b14f08bd4 | esa/pagmo | src/problem/decompose.cpp | #include <cmath>
#include <boost/random/uniform_real.hpp>
#include "../exceptions.h"
#include "../types.h"
#include "../population.h"
#include "../rng.h"
#include "decompose.h"
namespace pagmo { namespace problem {
/**
* Constructor
*
* @param[in] p base::problem to be decomposed
* @param[in] method decompositio... | ALGO | 0.999943 | 6.010798 |
6ab92e88-9f22-441b-9064-6d384ff417c2 | dongzeli95/swe-interview | algorithm/greedy/largest_palindromic_num.cpp | // https://leetcode.com/problems/largest-palindromic-number/description/
/*
You are given a string num consisting of digits only.
Return the largest palindromic integer (in the form of a string) that can be formed using digits taken from num. It should not contain leading zeroes.
Notes:
You do not need to use all t... | ALGO | 0.999913 | 7.345325 |
86cf298d-866d-493e-b66a-b7bc93a71eee | Dc0dez/CSS-342 | 2024-summer-342-quiz-hello-world/swap_values/main.cpp | #include "util.hpp"
int main(){
int x = 5, y = 10;
std::cout << "Before swap: x = " << x << ", y = " << y << "\n";
swap(x, y); // the reference swap function from util.cpp is being called
std::cout << "After swap: x = " << x << ", y = " << y << "\n";
float a = 1.5, b = 2.5;
std::cout << "Befor... | TOOL | 0.851463 | 5.992859 |
0839066b-8385-4720-9599-e9d65bc99dc5 | anushkagupta19/AG-tech | 2657 leetcode.cpp | class Solution {
public:
vector<int> findThePrefixCommonArray(vector<int>& A, vector<int>& B) {
int n = A.size();
vector<int> result(n);
unordered_map<int, int> mp;
int count = 0;
for(int i = 0; i < n; i++) {
mp[A[i]]++;
if(mp[A[i]] == 2) {
... | ALGO | 0.99995 | 6.3901 |
14590e09-ce5f-43a5-b792-829efd253fac | MdRifat-Hossen/DSA | 3.Binary Tree/Boundary_Tree.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
#define MAX_HEIGHT 100000
// Tree Node
struct Node
{
int data;
Node* left;
Node* right;
};
// Utility function to create a new Tree Node
Node* newNode(int val)
{
Node* temp = new Node;
temp->data = val;
temp->left = NULL;
... | ALGO | 0.999712 | 6.349732 |
6f157fc0-8002-4348-8511-39b25a5d8cf6 | P-404/android_external_skia | src/core/SkQuadClipper.cpp | #include "src/core/SkGeometry.h"
#include "src/core/SkQuadClipper.h"
#include <utility>
SkQuadClipper::SkQuadClipper() {
fClip.setEmpty();
}
void SkQuadClipper::setClip(const SkIRect& clip) {
// conver to scalars, since that's where we'll see the points
fClip.set(clip);
}
///////////////////////////////... | ALGO | 0.997794 | 6.864172 |
199328ef-7e0d-4bdd-86d3-0740934c2e27 | ianloic/unladen-swallow | Util/llvm/lib/CodeGen/RegAllocLocal.cpp | #define DEBUG_TYPE "regalloc"
#include "llvm/BasicBlock.h"
#include "llvm/CodeGen/MachineFunctionPass.h"
#include "llvm/CodeGen/MachineInstr.h"
#include "llvm/CodeGen/MachineFrameInfo.h"
#include "llvm/CodeGen/MachineRegisterInfo.h"
#include "llvm/CodeGen/Passes.h"
#include "llvm/CodeGen/RegAllocRegistry.h"
#include "l... | TOOL | 0.934266 | 6.742334 |
48c68794-c630-400a-80c0-7ff0462226c2 | ballotz/blib3d | src/math.cpp | #include "math.hpp"
#include <algorithm>
namespace blib3d::math
{
int32_t test3_aab_plane(const vec3 box_min, const vec3 box_max, const vec4 plane)
{
vec3 v0, v1;
copy3(v0, box_min);
copy3(v1, box_max);
if (plane[0] > 0.f)
std::swap(v0[0], v1[0]);
if (plane[1] > 0.f)
std::swap(v0[1... | ALGO | 0.993468 | 6.425092 |
27e9ccb9-d11a-4543-9779-cfbe8934dad1 | Kaydeewrld/duckdb | extension/icu/third_party/icu/i18n/stsearch.cpp | // #include "unicode/utypes.h"
// #if !UCONFIG_NO_COLLATION && !UCONFIG_NO_BREAK_ITERATION
// #include "unicode/stsearch.h"
// #include "usrchimp.h"
// #include "cmemory.h"
// U_NAMESPACE_BEGIN
// UOBJECT_DEFINE_RTTI_IMPLEMENTATION(StringSearch)
// // public constructors and destructors ---------------------------... | TOOL | 0.884492 | 6.455072 |
08995a6f-6c72-4949-ac0e-cb0356ef1178 | erl987/alglib | libalglib/kernels_sse2.cpp | #ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include "stdafx.h"
//
// Must be defined before we include kernel header
//
#define _ALGLIB_IMPL_DEFINES
#define _ALGLIB_INTEGRITY_CHECKS_ONCE
#include "kernels_sse2.h"
// disable some irrelevant warnings
#if (AE_COMPILER==AE_MSVC) && !defined(AE_ALL_WARNINGS)
... | TOOL | 0.951709 | 5.942439 |
1f4c5394-c3a8-4b77-bd58-312391465531 | goldi1027/GT-EHL | boost_1_64_0/libs/graph_parallel/test/distributed_rmat_pagerank.cpp | // Authors: Brian Barrett
// Nick Edmonds
// Andrew Lumsdaine
#include <boost/graph/use_mpi.hpp>
#include <boost/config.hpp>
#include <boost/throw_exception.hpp>
#include <boost/graph/distributed/adjacency_list.hpp>
#include <boost/graph/distributed/compressed_sparse_row_graph.hpp>
#include <boost... | ALGO | 0.992124 | 5.588578 |
8e88c602-cb86-42d8-b88c-f35ed013cbde | Swapnil67/dsa | Trees/BST/01-easy/01-search-in-bst.cpp | /*
* Leetcode - 700
* Search in a Binary Search Tree
* You are given the root of a binary search tree (BST) and an integer val.
* Find the node in the BST that the node's value equals val and return the subtree rooted with that node.
* If such a node does not exist, return null.
*
* 4
* ... | ALGO | 0.999996 | 6.793369 |
280f1855-7563-42aa-a064-18755a634643 | adamnemecek/GeometricAlgebraSandbox | solutions/chap3/ex2/chap3ex2s.cpp | #ifdef WIN32
#include <windows.h>
#endif
#include <GL/gl.h>
#include <GL/glut.h>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <libgasandbox/e3ga.h>
#include <libgasandbox/e3ga_draw.h>
#include <libgasandbox/e3ga_util.h>
#include <libgasandbox/gl_util.h>
#include <libgasandbox/glut_util.h>
using... | ALGO | 0.974065 | 5.774308 |
0547c3dc-53e3-49b7-b5fc-2f1968981d22 | enzogl25/Competitive-Programing | Beecrowd/1238.cpp | #include <bits/stdc++.h>
using namespace std;
#define _ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define f first
#define s second
#define pb push_back
#define ppb pop_back
using ll = long long;
int main() {
_
int n; cin >> n;
while(n--){
string s, s1; cin >> s >> s1;
... | ALGO | 0.999909 | 3.957057 |
a2c24b15-c95d-44e1-a56d-c33cd88cb85b | thakd1011/Algorithm | Simulation/ps_1057.cpp | #include <iostream>
#include <algorithm>
using namespace std;
int N, kim, im;
int main() {
int res = 1;
cin >> N >> kim >> im;
kim -= 1; im -= 1;
kim = kim / 2;
im = im / 2;
while (kim != im) {
res++;
kim = kim / 2;
im = im / 2;
}
cout << res;
} | ALGO | 0.999065 | 3.210743 |
65889c63-c075-4546-a329-9b3f2dc8b372 | ishandutta2007/codeforces | artyom123/normal/1399/A.cpp | #include<bits/stdc++.h>
using namespace std;
#define pb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define pii pair<int, int>
const int INF = 2e9 + 1;
const int MAXN = 1e6 + 5;
int main(){
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio... | ALGO | 0.999569 | 4.346229 |
c16977d6-53f7-4e51-ba65-9b532199d838 | sazal-ns/ProblemSolving | UVA/10633 - Rare Easy Problem.cpp | #include <cstdio>
using namespace std;
int main()
{
unsigned long long n,sav;
while (scanf("%llu",&n)==1 && n!=0)
{
sav=(n*10)/9;
if(n%9==0)
{
printf("%llu %llu\n",sav-1,sav);
}
else
{
printf("%llu\n",sav);
}
}
return 0;
} | ALGO | 0.999341 | 3.409704 |
e7a5c738-5103-4fa9-bcf5-942d7468ef73 | sarslanhan/challenges | leetcode/reverse-integer/reverse-integer.cpp | #include <iostream>
#include <limits>
using namespace std;
#define DEBUG 1
#define PDEBUGLN(output) if (DEBUG) cout << output << endl
class Solution {
private:
int safeAddition(int a, int b) {
int x = a + b;
if (x - a != b) throw "INT_OVERFLOW";
PDEBUGLN(a << '+' << b << '=' << x);
... | ALGO | 0.999754 | 5.420072 |
829ee272-9dec-4ec4-8e09-6260fc937967 | Jain-Ayush-11/Competitive-Programming | B_Mainak_and_Interesting_Sequence.cpp | /*******************
CodeForces:- Ayush_J
CodeChef:- stein_1103
********************/
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef ... | ALGO | 0.999804 | 4.504661 |
f6e5ea08-dcf6-464b-a1ab-4ca82e02df02 | qianyanglm/qianyang_LeetCode_debug | leetcode/editor/cn/448-find-all-numbers-disappeared-in-an-array.cpp | /**
<p>Given an array <code>nums</code> of <code>n</code> integers where <code>nums[i]</code> is in the range <code>[1, n]</code>, return <em>an array of all the integers in the range</em> <code>[1, n]</code> <em>that do not appear in</em> <code>nums</code>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong>... | ALGO | 0.999725 | 5.462059 |
94a87305-990d-4a40-b93e-7ca9a1246078 | Duszke333/AOC2024 | day3/task2.cpp | #include <algorithm>
#include <fstream>
#include <iostream>
#include <regex>
#include <sstream>
#include <vector>
int main(int argc, char **argv) {
if (argc < 2) {
std::cout << "Usage: " << argv[0] << "filepath" << std::endl;
return 1;
}
std::ifstream input(argv[1]);
if (!input.is_open()) {
std::ce... | ALGO | 0.987749 | 4.998273 |
2d0daf40-3ac2-4ef9-9e07-6cd8faaa69c6 | VivekYadav98/DSA | Longest Repeating Subsequence - GFG/longest-repeating-subsequence.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
int solve(int i,int j,string& s,string& t,vector<vector<int>>& dp)
{
if(i==0 || j==0)
{
return 0;
}
if(dp[i][j] != -1)
{
... | ALGO | 0.999962 | 6.492307 |
62998f04-1d89-4ef3-b60d-81d504874d28 | FootprintGL/algo | leetcode/811-subdomain-visit-count.cpp |
class Solution {
public:
unordered_map<string, int> map;
vector<string> res;
/* 域名解析 */
void parser(string cpdomain) {
/* 找空格 - 提取访问次数 */
int i = 0, count;
int len = cpdomain.length();
string domain;
while (i < len) {
if (cpdomain[i] == ' ') {
... | ALGO | 0.999776 | 5.772333 |
17441619-dd56-40d9-a948-00c739e4d5bf | How-u-doing/DataStructures | Queue/PascalTriangle.cpp | // to be finished, print pascal's triangle using queue
#include "LinkedQueue.h"
#include <iostream>
using namespace std;
void pascal(int n)
{
LinkedQueue<int> que;
int i = 1, j, s = 0, k = 0, t, u;
que.push(i); que.push(i);
for (int i = 1; i <= n; ++i) {
cout << endl;
que.push(k);
for (j = 1; j <= i + 2; +... | ALGO | 0.99992 | 4.903604 |
7bdf2d62-2079-490c-bcb9-9ddb45535f5d | hewenhao2008/ffmpeg-rtc | FFmpeg-n4.3.3/metartc5/srt/apps/apputil.cpp | #include <cstring>
#include <chrono>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <utility>
#include <memory>
#include "srt.h" // Required for SRT_SYNC_CLOCK_* definitions.
#include "apputil.hpp"
#include "netinet_any.h"
#include "srt_compat.h"
using namespace std;
using namespace srt;
// NOTE:... | TOOL | 0.946248 | 4.271992 |
e615e5d1-ea0e-499c-aba7-f5dc19ab6f62 | Rainmaker2627/cp-solutions | usaco/2022/gold/apple_catching.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf=1e18;
struct query {
int q, t, x, n;
bool operator<(query b) { return (x+t==b.t+b.x?q<b.q:x+t<b.x+b.t); }
};
signed main() {
cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
vector<query> q;
for (int i =... | ALGO | 0.99955 | 3.989339 |
447641fa-28ae-4cc0-925a-1841d31602d7 | alanzhao1/chromium-libcxx | test/std/containers/sequences/forwardlist/forwardlist.modifiers/erase_after_many.pass.cpp | // <forward_list>
// iterator erase_after(const_iterator first, const_iterator last);
#include <forward_list>
#include <cassert>
#include <iterator>
#include "test_macros.h"
#include "min_allocator.h"
int main(int, char**)
{
{
typedef int T;
typedef std::forward_list<T> C;
const T t[] = ... | TEST | 0.850994 | 5.588311 |
a77db46b-5d6a-40af-91ad-66c33479e952 | maheessh/revbayes_assumption | src/core/datatypes/phylogenetics/ratematrix/RateMatrix_Tamura92.cpp | #include <math.h>
#include <cstddef>
#include "MatrixReal.h"
#include "RateMatrix_Tamura92.h"
#include "RbException.h"
#include "TransitionProbabilityMatrix.h"
#include "Cloneable.h"
#include "RbVector.h"
#include "RbVectorImpl.h"
#include "TimeReversibleRateMatrix.h"
using namespace RevBayesCore;
/** Default Constr... | ALGO | 0.983075 | 6.289201 |
81a846b1-a57b-4dd2-8df0-98daff8c52bd | hosogaya/iris_2d | src/iris_2d.cpp | #include <iris_2d/iris_2d.h>
namespace iris_2d
{
void Problem::reset()
{
getCRef().coeffRef(0,0) = ELLIPSOID_C_EPSILON;
getCRef().coeffRef(1,0) = 0.0;
getCRef().coeffRef(0,1) = 0.0;
getCRef().coeffRef(1,1) = ELLIPSOID_C_EPSILON;
best_vol_ = std::pow(ELLIPSOID_C_EPSILON, 2.0);
mean_ie_time_ = 0... | ALGO | 0.999801 | 6.243268 |
3c39db93-7dab-482d-876b-bbafca29be41 | next-step-for-interview-prep/Daily-leetcode-problem_with_detailed_solutions | 050-19th_feb-Power_of_two/code.cpp | #include <iostream>
#include <cmath>
using namespace std;
class Solution
{
public:
bool isPowerOfTwo(int n)
{
if (n == 0)
return false;
return (n > 0) && (1073741824 % n == 0);
}
}; | ALGO | 0.994784 | 5.384805 |
2f643fbb-0988-4660-bac5-9a573951ff92 | eriser/boost | libs/graph/example/clustering_coefficient.cpp | //[code_clustering_coefficient
#include <iostream>
#include <iomanip>
#include <boost/graph/undirected_graph.hpp>
#include <boost/graph/exterior_property.hpp>
#include <boost/graph/clustering_coefficient.hpp>
#include "helper.hpp"
using namespace std;
using namespace boost;
// The Actor type stores the name of each ... | ALGO | 0.999707 | 6.846968 |
89311844-2133-4d23-8fb2-16916337bea0 | ahajason/PAT | PAT乙级(Basic Level)/1054.cpp | #include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
int main() {
int n, cnt = 0;
char a[50], b[50];
double temp, sum = 0.0;
cin >> n;
for(int i = 0; i < n; i++) {
scanf("%s", a);
sscanf(a, "%lf", &temp);
sprintf(b, "%.2lf",temp);
int flag = ... | ALGO | 0.964725 | 3.831659 |
ffa779a6-ddd4-4a59-8109-a8df0caf9970 | V-Sekai-fire/TOOL_godot_cage_deformer | thirdparty/eigen/bench/benchmarkXcwise.cpp | // g++ -O3 -DNDEBUG benchmarkX.cpp -o benchmarkX && time ./benchmarkX
#include <iostream>
#include <Eigen/Core>
using namespace std;
using namespace Eigen;
#ifndef VECTYPE
#define VECTYPE VectorXLd
#endif
#ifndef VECSIZE
#define VECSIZE 1000000
#endif
#ifndef REPEAT
#define REPEAT 1000
#endif
int main(int argc, c... | ALGO | 0.986238 | 3.952658 |
d142f25c-52f3-4477-ae45-05ce64e3b5d8 | Rebellion-167/Array-Problems | Easy/LeftRotateByOne.cpp | //Given an array of N integers, left rotate the array by one place.
#include <bits/stdc++.h>
using namespace std;
void leftRotateOne(vector<int> &nums)
{
int temp = nums[0];
int n = nums.size();
for(int i=0;i<n-1;i++)
{
nums[i] = nums[i+1];
}
nums[n-1] = temp;
}
int main()
{
int n... | ALGO | 0.999959 | 6.256731 |
e454e09f-8b4b-4ee4-81bd-e8ad558506fc | jing1900/bat_algorithms | 3_String_Operation/3_5.cpp | /*
问题：
给定一个字符串str和一个整数i，i代表str中的位置，将str[0,i]移到右侧，str[I+1,n-1]移到左侧，举例：
str：“ABCDE”，i=2，将str调整为”DEABC“。要求，时间复杂度为O（N），额外空间复杂度为O（1）
解题思路：
1，先将str[0,i]上的部分逆序，ABCDE，变成CBADE
2，将str[i+1,n-1]上的部分逆序，变成CBAED
3，然后将str整体逆序，DEABC
*/
#include<iostream>
#include<string>
#include<vector>
#include<stdlib.h>
using namespace s... | ALGO | 0.999851 | 4.34611 |
3ce0acd1-8eb2-4820-95a2-806a40f055a5 | nqdat2002/Data-Structures-and-Algorithms | Duyet Do Thi/DSA09012 - LIỆT KÊ ĐỈNH TRỤ.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> p;
typedef vector<vector<int> > vt;
typedef vector<pair<int, int> > vp;
const ll mod = 1e9 + 7;
const int oo = 1e6 + 7;
#define f first
#define s second
#define pb push_... | ALGO | 0.999932 | 5.565473 |
01495ee2-0a3b-42f7-a07e-0d58e647bc63 | muskanyadav24/Daily-Task | task-23-rev-using -recursion.cpp | #include<iostream>
using namespace std;
int reverseNumber(int n, int rev=0){
if(n == 0){
return rev;
}
return reverseNumber(n/10, rev*10+n%10);
}
int main(){
int num;
cout << "Enter a number :- ";
cin >> num;
int reversed = reverseNumber(num);
cout << "Reversed Number :- " << reversed << en... | ALGO | 0.999661 | 4.424069 |
e30c9272-7213-4e7d-af8f-4425e7e4ffef | stevinz/extrude | src/3rd_party/mesh_optimizer/vcacheoptimizer.cpp | #include <assert.h>
#include <string.h>
// This work is based on:
// Tom Forsyth. Linear-Speed Vertex Cache Optimisation. 2006
// Pedro Sander, Diego Nehab and Joshua Barczak. Fast Triangle Reordering for Vertex Locality and Reduced Overdraw. 2007
namespace meshopt
{
const size_t kCacheSizeMax = 16;
const size_t kVal... | ALGO | 0.999841 | 7.068169 |
7ea7a1b4-cb95-4e1e-95ca-30a15e7d805b | ianshulx/DSA-Programs | Interview problems in C++/Intersection of Two Arrays II.cpp | Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order.
Example 1:
Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]
Example 2:
Input: nums1 = [4,9,5], nums2 = [9,4... | ALGO | 0.999992 | 5.889244 |
b5723ebf-bf96-47bc-a94f-b7a9ae13e41e | SahilDantani/cp | num_theory/clear_MSB.cpp | #include<bits/stdc++.h>
using namespace std;
void printBinary(int num){
for(int i=10;i>=0;i--){
cout<<((num>>i)&1);
}
cout<<endl;
}
int main(){
int n=59;
printBinary(n);
int i =3;
int msb = (n&((1<<(i+1))-1));
printBinary(msb);
} | ALGO | 0.99982 | 4.64469 |
23e9135a-45e2-40ab-89bf-e553bd088213 | jamperezmondragon/Competitive-Programming | cses/introductory/Coin_piles.cpp | #include <bits/stdc++.h>
using namespace std;
int t;
int main() {
cin >> t;
int a[t], b[t];
for (int i=0; i < t; i++)
cin >> a[i] >> b[i];
for (int i=0; i < t; i++) {
if ((a[i] + b[i])%3 == 0 && abs(a[i] - b[i])<= min(a[i], b[i]))
cout << "YES" << endl;
else cout << "NO" << endl;
}
retu... | ALGO | 0.999859 | 3.759783 |
e1adde9a-0b5b-403f-bc68-7ce3e3229ac8 | mdino/Programiranje1-Cpp | sortiranje izborom.cpp | #include <iostream>
#include <cstring>
using namespace std;
int main(){
char polje[5];
int i;
for(i=0;i<5;i++){
cout<<"Unesi "<<i+1<<". broj: ";
cin >> polje[i];
}//for
cout<<"\nVrijednosti u polju: ";
for(i=0;i<5;i+... | ALGO | 0.999214 | 3.552959 |
77369208-d001-42e4-ad08-cfd7330c8093 | MarkShoukry/CPP_Embedded_Sy | 15.Projects/Snake Game/Snake Game/GameBoard.cpp | #include <vector>
#include <iostream>
#include "Snake.cpp"
class GameBoard
{
public:
GameBoard(int width, int height) : width(width), height(height) {
// Initialize the game board with empty spaces
board.resize(height, std::vector<char>(width, ' '));
}
void update(const Snake& snake, cons... | TOOL | 0.991782 | 7.206622 |
1a336423-ca05-4aa7-b395-c1d51ac1dcc9 | LuiIsmoke/Projet_de_Dev_Mobile | 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 |
7462df93-1677-4bc3-8f9d-f6e5dc2d64dd | rahulnagurtha/Mycode | codeforces/416-1.cpp | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include "../debug.hpp"
struct debugger dbg;
#else
#define debug(args...) // Just strip off all debug tokens
#endif
#define si(i) scanf("%d",&i)
#define si2(i,j) scanf("%d %d",&i,&j)
#define si3(i,j,k) ... | ALGO | 0.999894 | 3.201213 |
da7dfd0a-17db-4056-bc3f-84f95b7be406 | raincross7/code-similarity | codes/train_code/problem237/problem237_326.cpp | #include <bits/stdc++.h>
//#pragma once
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<double,double> P;
const ll INF = 1e18;
const int MOD = 1000000007;
const dou... | ALGO | 0.999832 | 3.78385 |
813b5edf-b0ae-4724-ac66-0d822e51a987 | quasarcoin/quasar | src/policy/policy.cpp | // NOTE: This file is intended to be customised by the end user, and includes only local node policy logic
#include "policy/policy.h"
#include "validation.h"
#include "tinyformat.h"
#include "util.h"
#include "utilstrencodings.h"
#include <boost/foreach.hpp>
/**
* Check transaction inputs to mitigate two
... | TOOL | 0.884669 | 7.582377 |
7d503b2d-b56c-4d6c-91d2-cd3d350b20a4 | usmancheema674/chapter-4 | 4.30.cpp | #include <iostream>
using namespace std;
int main() {
unsigned n1{ 0 };
unsigned n2{ 1 };
cout << n1 << '\n' << n2 << endl;
while ( true ) {
unsigned temp = n1 + n2;
cout << temp << endl;
n1 = n2;
n2 = temp;
}
return 0;
}
| ALGO | 0.998874 | 3.777078 |
c702dfae-9c2e-4889-81b3-c5d4e7ac15ca | ysxGitHub/Cplusplus | DataStructure/回溯/N皇后.cpp | /*
*/
#include<iostream>
#include<vector>
using namespace std;
// n = 9 超时
// 把 void 换成 bool ，最后函数找到一个答案后就返回 true
void backtrack1(int fisrt, int n, vector<string>& path, vector<vector<string>>& ans, vector<bool>& row,vector<bool>& col, vector<bool>& sdiag, vector<bool>& udiag){
if(fisrt==n){
ans.emplace_... | ALGO | 0.999501 | 3.477244 |
a58298b1-eb16-40c8-9d0e-18afbc0633e6 | artemmam/hpc-20-21 | openmp/adaptive_quadrature.cpp | #include <math.h>
#include <omp.h>
#include <stdio.h>
#define EPSILON 1E-24
#define THRESHOLD 0.05
long double f(double x) {
return 4.0 / (1.0 + x * x);
}
long double quad(double left, double right,
long double f_left, long double f_right,
long double lr_area) {
double mid =... | ALGO | 0.999988 | 5.941482 |
162eacc3-3b71-4760-b68c-f02cd8c12955 | ishandutta2007/codeforces | quang/normal/1528/D.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 610;
int n, m;
vector<pair<int, int>> adj[N];
int used[N];
int dp[N];
queue<int> ls[N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v, w;
cin >> u >> v >> w;
adj[u].push_back... | ALGO | 0.999992 | 4.153863 |
cf6d83f0-7e4e-4270-9f90-014968f6c9e8 | Phil-Cao/LeetCode | 1.两数之和.cpp | /*
* @lc app=leetcode.cn id=1 lang=cpp
*
* [1] 两数之和
*/
// @lc code=start
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int,int> my_map;
vector<int> result;
for(int i=0;i<nums.size();i++)
{
my_map[nums[i]]=i;
}
... | ALGO | 0.99992 | 6.191087 |
23080fa3-5650-47f6-93f7-a869151a1de4 | madhav-bits/Coding_Practice | leetFirstUniqCharInStr.cpp | /*
*
//******************************************************387. First Unique Character in a String.***********************************************
Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.
Examples:
s = "leetcode"
return 0.
s = "loveleetcod... | ALGO | 0.99953 | 6.172369 |
24e982cd-1ca6-414d-82fe-62d14a7b9cca | ihewro/leetcode | 101_2.cpp | #include "Util.hpp"
/**
* 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, TreeNod... | ALGO | 0.999788 | 6.612431 |
f3b5d4d2-b921-4ad2-9099-5acfd85bf74f | abhinavgpt1/DSA-cpp | DSA-self/02_Basic_Recursion/subsequence of a string.cpp | #include <iostream>
using namespace std;
int subs(string input, string output[]) {
if (input.empty()) {
output[0] = "";
return 1;
}
string smallString = input.substr(1);
int smallOutputSize = subs(smallString, output);
for (int i = 0; i < smallOutputSize; i++) {
output[i + smallOutputSize] = input[0] + out... | ALGO | 0.999966 | 4.829144 |
6d0f84d7-38c4-41ea-b8b5-d8472b8c22fd | 21B031174/ADS | L 3/J.cpp | #include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
#define MAX 1000001
int n, k, a[MAX];
bool check(int x){
int f = 0;
double p;
for(int i = 0; i < n; i++){
p = a[i];
p = p / x;
f += ceil(p);
}
return f <= k;
}
int bs(int mx){
int left = 0... | ALGO | 0.999938 | 3.903615 |
d8604dd5-700e-430d-b7c1-c5553421acce | SnoOpWo0t/Different-Programming-Platform | CodeChef/Expiring Bread.cpp | #include<bits/stdc++.h>
using namespace std ;
int main ()
{
int i,T;
cin>>T;
for(i=1;i<=T;i++)
{
int n,sub,m,k,div;
cin>>n>>m>>k;
div = n/k;
if(div<=m)
{cout<<"yes"<<endl;}
else {cout<<"no"<<endl;}
}
return 0;
} | ALGO | 0.999866 | 3.772276 |
d9dc003e-5983-4ef0-bd4c-63e5226d72f9 | ishandutta2007/codeforces | humbertoyusta/normal/1621/C.cpp | #include<bits/stdc++.h>
using namespace std;
// Pragma
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline","03")
// Macros:
#define f first
#define s second
typedef long long ll;
// debugging macros
#define db(x) cerr << #x << ": " << (x) << '\n';
#define db_v(x) cerr << #x << ": ["; for( auto i :... | ALGO | 0.999873 | 4.141718 |
d7d775d7-8d55-4f25-ab2d-a4cf6b50f99e | Aadarshg087/competitive-programming | TLE Eliminators Course/CP 31/900/LongestDivisorInterval.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
// ------------------------ Macros -------------------------
#define ll long long int
#define endl "\n"
#define debug(x) \
cout << #x << ": "; \
_print(x); \
cout << endl;
// ---------------------- Debug Functions ---------... | ALGO | 0.999876 | 5.477313 |
baf94c95-0570-488c-8150-07e0ed2e1b32 | SemaMolchanov/cpp-basics | labs/lab4/n.cpp | #include <iostream>
using namespace std;
int main(){
int m, k;
int n;
cin >> n;
for (m = 2; m < n; m++){
for (k = 2; k <= (m/k); k++)
if (!(m%k)) break;
if (k > (m/k)) cout << m << " is prime\n";
}
return 0;
} | ALGO | 0.999712 | 4.375806 |
580fdc9b-500f-4fbe-8267-380ee1971bc4 | 778477/LeetCode | 00116. Populating Next Right Pointers in Each Node.cpp | #include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
#include "math.h"
#include "stdlib.h"
#include "stdio.h"
using namespace std;
/*
116. Populating Next Right Pointers in Each Node
Total Ac... | ALGO | 0.999619 | 4.572269 |
63867d05-0bb1-4bb4-b797-48c61d2b476e | SourceEngine-CommunityEdition/source | vguimatsurface/Clip2D.cpp | #include <vgui/ISurface.h>
#include "Clip2D.h"
#include "tier0/dbg.h"
#include "utlvector.h"
#if defined( _X360 )
#include "materialsystem/imaterialsystem.h"
#endif
// memdbgon must be the last include file in a .cpp file!!!
#include "tier0/memdbgon.h"
//---------------------------------------------------------------... | TOOL | 0.990473 | 5.30464 |
73d269f0-3a19-4212-9a5e-2c671f4a2b3a | Vincentsummer/Typora | C++/Leetcode/459_repeatedSubstringPattern.cpp | //
// Created by vincent on 20-2-21.
//
#include "solution.h"
/**
* 459. 重复的子字符串
* 方法一： 构造s+s
* 方法二： 使用KMP算法
* **/
namespace leetcode
{
bool Solution::repeatedSubstringPattern(string s)
{
return (s + s).find(s, 1) != s.size();
}
} // namespace leetcode
| ALGO | 0.996568 | 5.440776 |
3ee8b23d-cb21-45b4-99c1-aeea89558b30 | MehrajShakil/Data-structure | Trie/Tries.cpp | /// BISMILLAHIR RAHMANIR RAHEEM
/// ALLAH IS WATCHING ME
/// Every soul shall taste death.
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
/// order_of_key return number of elements less than x.
/// find_b... | ALGO | 0.999673 | 4.842 |
981cc8fd-a647-4812-8a1e-62f71ab2a3a8 | sanket0708/SdeSheet | Find length of Loop - GFG/find-length-of-loop.cpp | //{ Driver Code Starts
// driver code
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
Node* next;
Node(int val)
{
data = val;
next = NULL;
}
};
void loopHere(Node* head, Node* tail, int position)
{
if(position==0) return;
Node* walk = head;
... | ALGO | 0.999834 | 4.920918 |
86cee4db-4c87-40c6-a52e-e70157a336f6 | NisargkumarP/navigation2_wpf | navigation2/nav2_smac_planner/src/node_hybrid.cpp | #include <math.h>
#include <chrono>
#include <vector>
#include <memory>
#include <algorithm>
#include <queue>
#include <limits>
#include <utility>
#include "ompl/base/ScopedState.h"
#include "ompl/base/spaces/DubinsStateSpace.h"
#include "ompl/base/spaces/ReedsSheppStateSpace.h"
#include "nav2_smac_planner/node_hybri... | ALGO | 0.999658 | 4.58745 |
c111a14b-afa0-4d05-a457-19c4a16bc820 | ukmaurya/leetcode | 1037-minimum-number-of-k-consecutive-bit-flips/minimum-number-of-k-consecutive-bit-flips.cpp | class Solution {
public:
int minKBitFlips(vector<int>& nums, int k) {
// extension of 3191
// int n = nums.size();
// int flipCount = 0;
// int ans = 0;
// vector<bool> flip(n,false);
// for(int i=0;i<n;i++){
// if(i>=k && flip[i-k]==true){
// ... | ALGO | 0.999992 | 5.864095 |
f97183f9-78d0-45dc-a077-47f55cf4901e | DamianGutierrezDev/Practicas-iniciales-en-C-C-Java | C++/Clase Irracional/Irracional.cpp | #include "Irracional.h"
using namespace std;
Irracional :: Irracional(int nume, int deno){
this->numerador = nume;
this->denominador = deno;
}
int Irracional :: real(const Irracional& obj){
int aux = obj.numerador/obj.denominador;
return aux;
}
istream& operator >>(istream& ent, Irracional& obj){
... | TOOL | 0.973673 | 4.478193 |
6c80dc72-162c-4adb-96df-38c5b9f480ef | gberta/HFL_code | opencv_3.0/modules/features2d/src/matchers.cpp | #include "precomp.hpp"
#include <limits>
#include "opencl_kernels_features2d.hpp"
#if defined(HAVE_EIGEN) && EIGEN_WORLD_VERSION == 2
#include <Eigen/Array>
#endif
namespace cv
{
/////////////////////// ocl functions for BFMatcher ///////////////////////////
#ifdef HAVE_OPENCL
static void ensureSizeIsEnough(int row... | ALGO | 0.921307 | 6.780883 |
1ab36ee8-b8b1-4891-8696-a297e67df13f | Anshul091/Codeforces-solutions | 1802D.cpp | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<vl> ... | ALGO | 0.999882 | 5.069313 |
20dfb134-2d56-47e2-8e3c-bd64cf1c1848 | ishandutta2007/codeforces | maximumshot/normal/1517/G.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const int inf = 1e9;
const ll inf64 = 1e14;
struct Dinic {
struct Edge {
ll fr, to, cp,... | ALGO | 0.999892 | 4.265782 |
c32594c2-067d-44ec-9f6b-a7fab3d64e83 | burlen/SciberQuestToolKit | eigen-3.0.3/eigen-eigen-3.0.3/doc/examples/DenseBase_template_int_middleRows.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
int main(void)
{
int const N = 5;
MatrixXi A(N,N);
A.setRandom();
cout << "A =\n" << A << '\n' << endl;
cout << "A(1..3,:) =\n" << A.middleRows<3>(1) << endl;
return 0;
}
| ALGO | 0.948583 | 3.245548 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.