uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
90d6f5a8-c3e4-4ebc-8a90-32df3551930b | ryotgm0417/AtCoder | problems/C/abc132c.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
int main(){
int n;
cin >> n;
VI d(n);
rep(i,n) cin >> d[i];
sort(d.begin()... | ALGO | 0.999238 | 4.038179 |
940d7ae3-701e-4401-af85-fd7a469dbde9 | ishandutta2007/codeforces | sugim48/normal/754/C.cpp | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#i... | ALGO | 0.999505 | 4.133078 |
dd015ab8-2261-4d59-a0db-8ba65401193d | ishandutta2007/codeforces | faustaadp/normal/1101/D.cpp | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll i,j,pr[202020],PS,n,ta,tb,has,ma,nod,a[202020];
vector<ll> v[202020],P,isi[202020],fak[202020];
ll b[202020],B[202020];
void dfs1(ll aa,ll bb,ll cc)
{
if(cc>ma)
{
nod=aa;... | ALGO | 0.998464 | 3.676762 |
40d394a0-0707-41a0-a7a6-b577f8b550a5 | cile/android_frameworks_av | media/libstagefright/codecs/amrnb/enc/src/qua_gain.cpp | /*
------------------------------------------------------------------------------
Pathname: ./audio/gsm-amr/c/src/qua_gain.c
Functions:
Date: 02/05/2002
------------------------------------------------------------------------------
REVISION HISTORY
Description: Updated template used to PV coding template.
... | ALGO | 0.99931 | 5.951205 |
659544fa-38df-4de6-b8c7-3e04f705d8de | wangxb812/leetcode_test | 剑指offer/JZ39.cpp | //输入一棵二叉树，判断该二叉树是否是平衡二叉树。
//在这里，我们只需要考虑其平衡性，不需要考虑其是不是排序二叉树
//平衡二叉树（Balanced Binary Tree），具有以下性质：它是一棵空树或它的左右两个子树的高度差的绝对值不超过1，并且左右两个子树都是一棵平衡二叉树。
#include<map>
using namespace std;
class Solution {
public:
bool IsBalanced_Solution(TreeNode* pRoot) {
if(pRoot ==nullptr) return true;
int left = Treedepth... | ALGO | 0.999915 | 5.146154 |
517e1935-97bd-4f16-96c0-88d90f1fba3d | Manju567/coding_Leetcode-solutions | lcof/面试题52. 两个链表的第一个公共节点/Solution.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* getIntersectionNode(ListNode* headA, ListNode* headB) {
ListNode *a = headA, *b = headB;
while (a != b) {
... | ALGO | 0.998949 | 5.261194 |
de2cb501-6466-4451-85ee-4a1a568061dc | i-pu/riscv-llvm-target | llvm-project/llvm/lib/Transforms/Utils/UnifyLoopExits.cpp | #include "llvm/Transforms/Utils/UnifyLoopExits.h"
#include "llvm/ADT/MapVector.h"
#include "llvm/Analysis/LoopInfo.h"
#include "llvm/IR/Dominators.h"
#include "llvm/InitializePasses.h"
#include "llvm/Transforms/Utils.h"
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
#define DEBUG_TYPE "unify-loop-exits"
using nam... | TOOL | 0.995407 | 7.928843 |
a896d86a-0990-4f1e-a7c7-46c35b51e48b | BobbysZhang/Code | template test/other/test.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
pair <int, int> a (2, 3);
pair <int, int> b (2, 4);
cout << (a == b) << endl;
} | ALGO | 0.993181 | 3.230719 |
bc269d45-a7f6-465c-a094-a3987fe46ca4 | ddubl/archiver | lib/opencv/modules/ml/test/test_utils.cpp | namespace opencv_test {
void defaultDistribs( Mat& means, vector<Mat>& covs, int type)
{
float mp0[] = {0.0f, 0.0f}, cp0[] = {0.67f, 0.0f, 0.0f, 0.67f};
float mp1[] = {5.0f, 0.0f}, cp1[] = {1.0f, 0.0f, 0.0f, 1.0f};
float mp2[] = {1.0f, 5.0f}, cp2[] = {1.0f, 0.0f, 0.0f, 1.0f};
means.create(3, 2, type);
... | ALGO | 0.93715 | 5.338003 |
e278d217-ea63-4f35-acf1-936d10800b39 | silaerdgnn/aaos13Hardware | google/pixel/thermal/pid_1_0/thermal-helper.cpp | #define ATRACE_TAG (ATRACE_TAG_THERMAL | ATRACE_TAG_HAL)
#include "thermal-helper.h"
#include <android-base/file.h>
#include <android-base/logging.h>
#include <android-base/properties.h>
#include <android-base/stringprintf.h>
#include <android-base/strings.h>
#include <utils/Trace.h>
#include <iterator>
#include <se... | TOOL | 0.89892 | 6.331242 |
2a2f3242-e30c-4b98-80f7-0555054e590e | danya140/QtCalculator | logic.cpp | #include "logic.h"
logic::logic()
{
}
void logic::calc(){
switch(delimiter){
case '+': result=leftNum + rightNum;
break;
case '-': result=leftNum - rightNum;
break;
case '*': result=leftNum * rightNum;
break;
case '/': result=le... | TOOL | 0.963143 | 3.45203 |
b76fec06-0348-478b-865c-b418d3f2f88d | babliraikwar/C-coding | palindron.cpp | #include <iostream>
using namespace std;
int main(){
int n,p;
cin>>n;
n=p;
int s=0;
while(n){
s=s*10+n%10;
n/=10;
}
if(s==p)
{
cout<<" it's number is palindron";
}
else
{
cout<<" it is not palindron";
}
return 0;
}
| ALGO | 0.999745 | 4.40951 |
2789932d-7d34-4b81-a0c7-84ef2bff4c81 | 111-jsl/LingoDB-CSE | lib/utility/Tracer.cpp | #include "utility/Tracer.h"
#include "json.h"
#include <fstream>
#include <iostream>
#include <mutex>
#include <queue>
#include <unistd.h>
namespace {
thread_local utility::Tracer::TraceRecordList* threadLocalTraceRecordList = nullptr;
utility::Tracer* singleton() {
#ifdef TRACER
static utility::Tracer perfTracer... | TOOL | 0.905375 | 6.497691 |
20ca6728-b574-402d-8b48-7d0cdda2651a | kunalbhatia-868/Leetcode | Linked List Insertion - GFG/linked-list-insertion.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
struct Node* next;
Node(int x){
data = x;
next = NULL;
}
};
void printList(Node* node)
{
while (node != NULL) {
cout << node->data <<" ";
node = node->next;
} ... | ALGO | 0.999736 | 5.915804 |
afa88ed2-aff6-4464-a550-d3feef442f97 | ddangu525/AlgorithmStudy | study_algo_gangnam/BSH/9095/src/9095.cpp | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll arr[11];
int T, N;
arr[1] = 1;
arr[2] = 2;
arr[3] = 4;
for (int i = 4; i < 11; i++)
arr[i] = arr[i - 1] + arr[i - 2] + arr[i - 3];
cin >> T;
for (int i = 0; i < T; i++) {
cin >> N;
cout << arr[N] << '\n';
}
return 0;
}
| ALGO | 0.999788 | 3.812473 |
39725053-9ada-4d98-b7c0-253dff4d0cf0 | 2023-anik/My_Code_Archive | Dynamic Programming/knapsack.cpp | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int knapsack(int n, int w, const vector<int> &wt, const vector<int> &val){
if(n==-1 || w==0){
return 0;
}
// if(wt[n]<=w){
// //option 1: include the item
// i... | ALGO | 0.999999 | 4.808772 |
39346ee9-56e4-4a14-a56b-af7e8545ea4c | Valurheredia/Loops-SIS | ejercicio2.cpp | def palabras_con_corchetes(linea):
word = ""
for char in linea:
if char != " ":
word += char # Agregar carácter a la palabra
else:
print(f"[{word}]") # Imprimir palabra entre corchetes
word = "" # Reiniciar palabra
print(f"[{word}]") # Imprimir la últi... | ALGO | 0.961679 | 5.303761 |
5bb2b831-360c-4d75-b9f7-198d2cdd8663 | theodormoroianu/ICPC_docs | stress-tests/number-theory/ModLog.cpp | #include "../utilities/template.h"
#include "../../content/number-theory/ModLog.h"
int main() {
const int lim = 100;
rep(m,1,lim) {
rep(a,0,lim) {
vector<ll> ans(m, -1);
ll b = a % m;
rep(x,1,max(m,2)) {
if (ans[b] == -1) ans[b] = x;
b = b * a % m;
}
rep(b,0,m) {
ll res = modLog(a, b, m... | TEST | 0.991665 | 4.057909 |
a4b85079-190b-4d54-8bdb-6bbade2ba818 | IcEy-999/MyUESource | Engine/Source/Developer/TraceInsights/Private/Insights/MemoryProfiler/ViewModels/MemTagNodeGroupingAndSorting.cpp | #include "MemTagNodeGroupingAndSorting.h"
#include "Insights/Table/ViewModels/TableColumn.h"
#include "Insights/MemoryProfiler/ViewModels/MemTagNodeHelper.h"
#define LOCTEXT_NAMESPACE "MemTagNode"
// Sort by name (ascending).
#define INSIGHTS_DEFAULT_SORTING_NODES(A, B) return A->GetName().LexicalLess(B->GetName());... | TOOL | 0.986385 | 6.850282 |
10f5f00a-8648-4dba-9b8b-d7ae07349581 | pranav17502/Coursera | 2. Data Structure/Assignments/week2_priority_queues_and_disjoint_sets/1_make_heap/buildHeap.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class HeapBuilder{
private:
vector<int> data_;
vector< pair<int, int> > swaps_;
void WriteResponse() const{
cout << swaps_.size() << "\n";
for (int i = 0; i < swaps_.size(); ++i){
cout << swaps_[i]... | ALGO | 0.999879 | 4.014581 |
189f81c5-5064-4031-9e75-ebf8cf1cad89 | bruteforceworker/avcoin2 | src/rpcblockchain.cpp | #include "main.h"
#include "bitcoinrpc.h"
using namespace json_spirit;
using namespace std;
extern void TxToJSON(const CTransaction& tx, const uint256 hashBlock, json_spirit::Object& entry);
double GetDifficulty(const CBlockIndex* blockindex)
{
// Floating point number that is a multiple of the minimum difficult... | WEB | 0.855618 | 6.047462 |
92da1c0a-fbdd-402e-8382-27fb63c16c6c | Zeyad-Amr/ImageSegmenterX | draft/Ass-4-k-means-2/localthreshold.cpp | #include "localthreshold.h"
cv::Mat applyLocalThreshold(cv::Mat inputImg, int blockSize, int C) {
qDebug("entered applyLocalThreshold");
cv::Mat output(inputImg.rows, inputImg.cols, CV_8UC1, cv::Scalar(0));
cv::Mat cumulative(inputImg.rows, inputImg.cols, CV_32SC1, cv::Scalar(0));
getCumulative2d(inpu... | ALGO | 0.999011 | 5.207771 |
d33d2278-7a3f-49a9-9e23-999e163853f8 | Shrutijaiswal1989/HACKEREARTH-MASTER- | Algorithms/Searching/Binary search/Failed ranges.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, m, X, Y;
cin >> n >> m;
vector<int> a(n), b(m);
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < m; i++)
cin >> b[i];
cin >> X >> Y;
}
| ALGO | 0.999938 | 3.060263 |
a461d7b1-1be1-4c6c-8a68-8a2333f42998 | hrace009/pw-tools | sPCK/main.cpp | #include "main.h"
bool compare(wxByte* buffer1, wxByte* buffer2, wxUint32 length)
{
for(wxUint32 i=0; i<length; i++)
{
if(buffer1[i]!=buffer2[i])
{
return false;
}
}
return true;
}
/*
delete directory recursive
*/
void wxDeldir(wxString Directory)
{
wxArrayS... | TOOL | 0.919789 | 3.531386 |
a46f53b7-908d-4e95-b007-d947f2576e68 | ishandutta2007/codeforces | wild_hamster/normal/718/C.cpp | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstring>
#include <deque>
#include <stack>
#include <stdio.h>
#include <map>
#include <set>
#include <time.h>
#include <string>
#include <fstream>
#include <queue>
#include <bitset>
#include <cstdlib>
#define X first
#define Y second
... | ALGO | 0.999928 | 4.113122 |
5b01228a-4dde-4ae4-9bcf-0a630c1b7e6b | tiansongyu/Advent-Of-Code | 2020/15/part2_method_bad.cpp | #include <fmt/core.h>
#include <cmath>
#include <set>
#include <fstream>
#include <strstream>
#include <istream>
#include <vector>
int main()
{
std::ifstream f("./input.txt");
if (!f.is_open())
return false;
std::vector<int> vec;
std::string mask;
char line[128];
std::string junk;
... | ALGO | 0.999392 | 4.718619 |
6cdb7d95-0751-4a9f-bf6a-faf5df46cb82 | wyl-lab/raspbian | IntelligenceHomeSys/SecuritySubsystem/SecuritySubsystem/基于OpenCV的人脸识别/opencv-master/3rdparty/openexr/IlmImf/ImfRle.cpp | #include <string.h>
#include "ImfRle.h"
#include "ImfNamespace.h"
OPENEXR_IMF_INTERNAL_NAMESPACE_SOURCE_ENTER
namespace {
const int MIN_RUN_LENGTH = 3;
const int MAX_RUN_LENGTH = 127;
}
//
// Compress an array of bytes, using run-length encoding,
// and return the length of the compressed data.
//
int
rleCompress... | ALGO | 0.99891 | 5.188163 |
4847e76c-a07f-4e8b-8139-d535d1756f2e | blissio/cpp_dev | LargestFirstColoring.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Vertex {
public:
int id;
int degree;
int color;
Vertex(int id, int degree) : id(id), degree(degree), color(-1) {}
bool operator<(const Vertex &other) const {
return degree > other.degree;
}
... | ALGO | 0.999896 | 6.332642 |
5b4e9fb9-34d2-4755-a2d4-5144ccac4e6b | thanh2811/cpp | Modulo7.cpp | #include <bits/stdc++.h>
using namespace std;
int n,a[1000000];
void input(){
cin >> n;
for(int i = 0 ; i<n ; i++)
cin >> a[i];
}
void solve(){
input();
sort(a,a+n);
int dem = 0,d = a[n-1] - a[0];
vector <int > v;
for(int i = 1 ; i*i<=d ; i++){
if(d%i==0){
v.push_... | ALGO | 0.999748 | 3.579371 |
41f7eaa6-d2f4-46da-91a7-68a22b0b3d93 | weki-wang/learn_uc | STL/1/05special_template_function.cpp | /* 本程序主要测试特例化模板函数*/
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
/* 模板函数*/
template <typename T>
bool LessThen(T const &a, T const &b){
return a < b;
}
/*为处理char *类型的数据，需要将模板特例化, const char * const & 的详细含义可见04文件*/
template <>
bool LessThen<const char *>(const char * const &a, con... | TOOL | 0.941456 | 4.449878 |
32c842c3-4ef8-4211-8307-00c59a6c555f | Ryii/LeetCode | 2024 Daily Problems/7. July/(6) 2582. Pass the Pillow.cpp | class Solution
{
public:
int passThePillow(int n, int time)
{
time = time % (2 * (n - 1));
return time > n - 1 ? n - (time - (n - 1)) : time + 1;
}
}; | ALGO | 0.99999 | 5.539674 |
8a7b6da7-f4ad-4de1-9b06-baeb27554569 | JJHeon/Study__CodingTest | backjoon/16234-MovePopulation.cpp | #include <iostream>
#include <cstring>
#include <vector>
#include <cmath>
using namespace std;
int n, l, r;
int dy[4] = {-1, 0, 1, 0}, dx[4] = {0, 1, 0, -1};
int mp[52][52];
int nmp[52][52];
int visited[52][52];
int t;
int dfs(int i, int j, vector<pair<int, int>>& v) {
int rst = 0;
for (int w = 0; w < 4; ++w... | ALGO | 0.999807 | 3.493656 |
1d55611e-3923-4bac-815c-724e02346513 | The-Gokul-Kishore/codeforces_solutions | cost_array.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int test;
cin>>test;
for(int t=0;t<test;t++){
int n,k;
cin>>n>>k;
vector<int> arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
}
int mod =n/ k;
int cnt = 1;
int start =0 ;
... | ALGO | 0.999806 | 3.618922 |
db50f47c-cacd-4295-a781-3a52593f6dff | LinuxUserGD/godot-opengl-4 | servers/physics/collision_solver_sw.cpp | /**************************************************************************/
/* collision_solver_sw.cpp */
/**************************************************************************/
/* This file is part of: */
/* ... | ALGO | 0.999597 | 6.760847 |
9290d5a1-ba9e-4f76-933b-706e6bcf2c72 | aanupam29/codeforces-problems | 365B - The Fibonacci Segment.cpp | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
void solve()
{
ll n;
cin>>n;
ll arr[n];
for(ll i=0;i<n;i++)
{
cin>>arr[i];
}
if(n==1||n==2)
{
cout<<n;
return;
}
ll ans=2;
ll final=-1;
for(ll i=2;i<n;i++)
{
if(arr[i... | ALGO | 0.999972 | 4.051239 |
3c9e4dbd-cb4b-4ea1-afe2-76f30d689473 | kk77777/LeetCode-Solutions | q374.cpp | /**
* Forward declaration of guess API.
* @param num your guess
* @return -1 if num is lower than the guess number
* 1 if num is higher than the guess number
* otherwise return 0
* int guess(int num);
*/
class Solution
{
public:
int guessNumber(int n)
{
long int l... | ALGO | 0.999972 | 5.572293 |
dab6b829-d58f-48fe-9217-930d79859ebe | raincross7/code-similarity | codes/train_code/problem357/problem357_334.cpp | #include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end(... | ALGO | 0.999806 | 4.029451 |
424f3462-5e11-4caa-be95-8187b55fe3a1 | zztiswb116/LLHP | tools/clang/tools/driver/cc1as_main.cpp | #include "clang/Basic/Diagnostic.h"
#include "clang/Basic/DiagnosticOptions.h"
#include "clang/Driver/DriverDiagnostic.h"
#include "clang/Driver/Options.h"
#include "clang/Frontend/FrontendDiagnostic.h"
#include "clang/Frontend/TextDiagnosticPrinter.h"
#include "clang/Frontend/Utils.h"
#include "llvm/ADT/STLExtras.h"
#... | TOOL | 0.864138 | 3.020969 |
eec62399-6589-4e2f-9645-ead4e373a9f7 | c61292558/yade4deepin | pkg/common/ForceEngine.cpp | // 2004 © Janek Kozicki <<EMAIL>>
// 2009 © Václav Šmilauer <<EMAIL>>
#include "ForceEngine.hpp"
#include <lib/high-precision/Constants.hpp>
#include <lib/smoothing/LinearInterpolate.hpp>
#include <core/Scene.hpp>
#include <pkg/common/Sphere.hpp>
#include <preprocessing/dem/Shop.hpp>
#include <core/IGeom.hpp>
#includ... | ALGO | 0.917222 | 6.871367 |
98200f67-85e7-432e-8f5b-a07959ac52c2 | icl-utk-edu/magma | src/zheevd.cpp | /*
-- MAGMA (version 2.0) --
Univ. of Tennessee, Knoxville
Univ. of California, Berkeley
Univ. of Colorado, Denver
@date
@author Stan Tomov
@author Raffaele Solca
@author Azzam Haidar
@precisions normal z -> c
*/
#include "magma_internal.h"
#include "magma_... | ALGO | 0.998731 | 5.870374 |
1185f90a-4281-41e8-86da-a82b8a2e0eb7 | shahin-you/LeetCode | 278/main.cpp | #include <iostream>
#include <format>
#include <vector>
#include <map>
#include <algorithm>
#include <cassert>
using namespace std;
constexpr int realBadVersion{ 4 };
void runTests();
int firstBadVersion(int n);
bool isBadVersion(int k);
int main() {
runTests();
return 0;
}
void runTests() {
assert(firstBadVers... | ALGO | 0.99953 | 5.57196 |
8e0d3a39-cef4-4fd5-82db-a6d224345b4f | NishuK-11/DSA | two_sum.cpp | // #include <bits/stdc++.h>
// using namespace std;
// class Solution {
// public:
// vector<int> twoSum(vector<int>& nums, int target) {
// int n = nums.size();
// map<int, int> mp;
// for (int i = 0; i < n; i++) {
// int remaining = target - nums[i];
// if (mp.find... | ALGO | 0.998888 | 5.756558 |
7d013186-964f-412f-88d8-fbb08adce679 | Zhang-RQ/OI_Code_10wL_Completion | BZOJ/2738.cpp | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cassert>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MAXN=510;
cons... | ALGO | 0.999924 | 3.281075 |
605b2073-73ab-4085-8225-54eae54b51fa | tabae/kyopro_lib | math/ofop/sample.cpp | #include <iostream>
constexpr long long nmax = 1000000000000000000; // 10^18
// nmaxより大きくなるとき, nmax+1を返す
long long ofpow(long long a, long long p) {
if(a > nmax) return nmax + 1;
if(a == 0) return 0;
long long res = 1;
for(int i = 0; i < p; i++) {
if(nmax / a < res) return nmax + 1;
re... | ALGO | 0.999913 | 4.561293 |
30f45c43-95c7-4ba5-a816-4d1b754b865d | akalenuk/wordsandbuttons | exp/valgrind/numbers.cpp | #include <chrono>
#include <iostream>
#include <string>
using namespace std;
// here you should implement your own magic checker.
// returns true if the square is magic, false otherwise
//
// 8 1 6 this is
// "816357492" = 3 5 7 a magic
// 4 9 2 square
//
auto magic_number = '5... | ALGO | 0.999144 | 6.426585 |
b7def9d6-fb3c-4adb-a5c5-8046217ad6b3 | manduca-a/Cpp-SCUOLA | compito 13 04 2019.cpp |
#include <iostream>
#include <math.h>
using namespace std ;
int a, perimetro, area;
int main ()
{
cout << "Inserire il lato" << endl ;
cin >> a ;
perimetro=a*4 ;
cout<<"Il perimetro e' " << perimetro << endl ;
area=a*a ;
cout<<"l'area e' " << area << endl ;
system ("pause") ;
}
| TOOL | 0.985407 | 3.4832 |
1f2d7c51-a643-4bb7-8392-d99b95bfb17f | sprkrd/adventofcode | 2024/21/part2.cpp | #include <array>
#include <cstdint>
#include <iostream>
#include <limits>
#include <string>
#include <unordered_map>
#include <utility>
constexpr int kNumberOfRobots = 25;
typedef std::pair<int,int> Vec2i;
struct Keyboard
{
int width;
int height;
std::string keys;
Keyboard(int width, int height, con... | ALGO | 0.998128 | 5.315297 |
b08f5806-85d0-464b-a2c0-214168e80c5e | xXxSpicyBoiiixXx/CS570-Adv-Comp-Arch | grappa/applications/join/Hypercube.cpp | #include "Hypercube.hpp"
#include <cmath>
#include <iostream>
//TODO: proper path
#include <glog/logging.h>
/*
* Hypercube implementation
*/
class Hypercube::impl {
private:
// length of each dimension
std::vector<int64_t> shares;
public:
impl(std::vector<int64_t> shares) : shares(shares) {} //cop... | ALGO | 0.98857 | 5.219498 |
a1d089bd-bdba-4b6a-8406-a0724b3922b7 | RamazanFIT/algorithms | part1/lab6/t2.cpp | #include <bits/stdc++.h>
#define ENDL "\n"
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define endd return 0;
#define goodluck ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
using ll = long long;
using namespace std;
signed main(){
goodluck
// freopen("std.in", ... | ALGO | 0.999942 | 3.354611 |
52f07465-28b6-4d17-9111-2b301816affb | 2mrmikeliu/CPP | qwq.cpp | #include<iostream>
using namespace std;
struct jz{
int a[110][110];
};
int n,m;
jz jia(jz a,jz b)
{
jz c;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
c.a[i][j]=a.a[i][j]+b.a[i][j];
}
}
return c;
}
jz a,b,c;
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>a.a[i]... | ALGO | 0.999867 | 3.012102 |
67898d61-26ba-4e9a-9e1f-0ef45e360ef8 | HinaPE/HinaPE-jet | fluid-engine-dev/src/jet/grid_point_generator2.cpp | #include <pch.h>
#include <jet/grid_point_generator2.h>
namespace jet {
void GridPointGenerator2::forEachPoint(
const BoundingBox2D& boundingBox,
double spacing,
const std::function<bool(const Vector2D&)>& callback) const {
Vector2D position;
double boxWidth = boundingBox.width();
double boxHe... | ALGO | 0.993776 | 6.064886 |
7f144622-e65e-4905-b9a3-d4b05fe9b0cb | Aakarsh102/leetcode | leetcode/allpathfromsourcetotarget.cpp | #include <vector>
class Solution {
public:
std::vector<std::vector<int>> allPathsSourceTarget(std::vector<std::vector<int>>& graph) {
std::vector<int> stack;
stack.push_back(0);
std::vector<std::vector<int>> output;
do_find(graph, 0, stack, output);
return output;
}
... | ALGO | 0.999892 | 6.183103 |
ffab0f2c-144c-4b0a-80bb-98948b220913 | rathoresuryansh196/basic-cpp | CodeJam/a.cpp | #include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c << endl;
return 0;
}
| ALGO | 0.999448 | 4.090514 |
ee87e76c-e931-4758-9037-12f43afdd573 | ishandutta2007/codeforces | alishahali1382/normal/858/F.cpp | #include <bits/stdc++.h>
#if defined(__GNUC__)
#pragma GCC optimize ("Ofast")
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<x<<endl;
#define debugp(x) cerr<<#x<<"= {"<<x.first<<... | ALGO | 0.999953 | 4.415138 |
90f31a97-147e-4a24-b6a4-55aa6bfd95c9 | heavenMOJANG/ICPC | .history/2024HDU多校/HDU多校8/1005_20240813092303.cpp | #pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define int long long
using namespace std;
constexpr int INF = 0x7fffffff;
void solve() {
int l, r, k; cin >> l >> r >> k;
map<int, map<int, int>> mp;
if (_lg(r - l + 1))
}
signed main() {
ci... | ALGO | 0.99972 | 4.159304 |
e647f717-eca1-4f2c-8473-298eb111e749 | suvarnsingrajput2004/Suvarnsing_Rajput_FBS | FBS/C/Assignment/Assignment 11/mystrcmp.cpp | #include <stdio.h>
int mystrcmp(char a[], char b[]);
int main() {
char str1[100], str2[100];
int result;
printf("Enter a first string: ");
gets(str1);
printf("Enter a second string: ");
gets(str2);
result = mystrcmp(str1, str2);
if (result == 0) {
printf("Strings are equal\... | ALGO | 0.999892 | 3.945522 |
91fe740e-f479-4f12-a578-d9c7a30f13b6 | Apurva-tech/LeetCode | 1047-remove-all-adjacent-duplicates-in-string/1047-remove-all-adjacent-duplicates-in-string.cpp | class Solution {
public:
string removeDuplicates(string s) {
string res = "";
stack<char> st;
st.push(s[0]);
for(int i = 1; i < s.length(); i++){
if(st.empty()) {
st.push(s[i]);
i++;
}
if(st.... | ALGO | 0.999874 | 6.128098 |
88b66a48-3399-44a5-b62d-ed4f10ca2983 | Tukekehaohaonuli/algorithm | Algorithm structure/tree-B.cpp | #include<cstdio>
#include<vector>
using namespace std;
struct node{
int data;
node *left,*right;
};
void insert(node* &root,int data){
if(root==NULL){
root=new node;
root->data=data;
root->left=root->right=NULL;
return ;
}
if(data<root->data) insert(root->left,data);
else insert(root->right,data);
}
void ... | ALGO | 0.999999 | 3.984443 |
bab31b3a-8266-4c1b-9b48-67689bf2f529 | ryder2002/KTLT-PTIT | RECURSIVE005 - Tính số sau khi lũy thừa của một số nào đó.cpp | #include<bits/stdc++.h>
using namespace std;
double power(double x, int n) {
if (n == 0) {
return 1.0;
}
if (n < 0) {
return 1.0 / power(x, -n);
}
double half = power(x, n / 2);
if (n % 2 == 0) {
return half * half;
} else {
return half * half * x;
}
}
int... | ALGO | 0.999914 | 5.104957 |
090ff364-9c99-48e3-8867-ff15961d09d8 | joeypark/ClockPlugin | VerletClothComponent/Source/VerletClothComponent/Private/VerletClothComponent.cpp | #include "VerletClothComponentPluginPrivatePCH.h"
#include "DynamicMeshBuilder.h"
#include "EngineGlobals.h"
#include "LocalVertexFactory.h"
#include "Engine/Engine.h"
DECLARE_CYCLE_STAT(TEXT("Update Verlet Cloth Time"), STAT_UpdateVerletClothTime, STATGROUP_Game)
/** Vertex Buffer */
class FVerletClothVertexBuffer :... | ALGO | 0.940376 | 3.668584 |
c3abe811-26c8-4a69-bb62-ce221b36d715 | BareiceBear/leetcode | BackTracking/PermutationSequence_60.cpp | /*
The set [1,2,3,...,n] contains a total of n! unique permutations.
By listing and labeling all of the permutations in order, we get the following sequence for n = 3:
"123"
"132"
"213"
"231"
"312"
"321"
Given n and k, return the kth permutation sequence.
Note:
Given n will be between 1 and 9 inclusive.
Given k wil... | ALGO | 0.999969 | 6.509584 |
c02eac99-3a58-4f84-8624-9de8b0831f83 | sidgupta234/Interview-Questions-Wiki | Arrays/minSteps.cpp | // https://www.interviewbit.com/problems/min-steps-in-infinite-grid/
// Input : X and Y co-ordinates of the points in order.
// Each point is represented by (X[i], Y[i])
int Solution::coverPoints(vector<int> &X, vector<int> &Y) {
int result = 0;
for(int i=1;i<X.size();i++){
int xsteps=0, ysteps=0... | ALGO | 0.999414 | 4.99292 |
5dd78d5b-c20d-4710-ba3e-dcd9c5fc73de | grainme/Interview-Preparation | CodeForces/random/A_Rudolph_and_Cut_the_Rope.cpp | /** /\_/\
* (= ._.)
* / > \>
*
* Salam Marouane :)
*/
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define _USE_MATH_DEFINES
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> ... | ALGO | 0.999541 | 4.584691 |
edaf73ac-73d7-44e1-abc4-8b58a549e279 | Chandrapalumath/LeetCode | 1071-greatest-common-divisor-of-strings/1071-greatest-common-divisor-of-strings.cpp | class Solution {
public:
string gcdOfStrings(string str1, string str2) {
if(str1+str2!=str2+str1) return "";
int n=__gcd(str1.size(),str2.size());
return str1.substr(0,n);
}
}; | ALGO | 0.99993 | 5.965277 |
ab8085f6-eda8-4c5b-a438-ca84114a93db | aqu640/C-plus-plus-practice | C-plus-plus-main/ch 7/7-4.cpp | #include <iostream>
using namespace std;
// 來源木棒(A)，輔助木棒(B)，目的木棒(C)
void hanoi(int n, char A, char B, char C) {
if(n == 1) {
cout << "Move sheet from " << A << "to" << C << endl;
}
else {
hanoi(n-1, A, C, B); // 將n-1盤子 ⇒ 由(A)移到輔助木棒(B)
hanoi(1, A, B, C); // 將最大盤子 ⇒ 由來源木棒(A)移到目的木棒(C... | ALGO | 0.999909 | 4.726811 |
db4c5d60-f480-42fc-8fe9-58b4fc40611c | sbs1621/Algorithm | Beakjoon/C++/2884.cpp | #include<iostream>
using namespace std;
int main(){
int H,M,m = 0;
cin >> H >> M;
if (0 <= H && H<= 23 && 0 <= M && M <= 59) {
if (M - 45 < 0)
{
M+= 15;
H -= 1;
if (H < 0)
H = 23;
}
else
M-=45;
cout << H <<" "<< M;
}
}
| ALGO | 0.999718 | 4.310188 |
3789a382-3566-41db-844b-567381c5de62 | animeshk-me/leetcode-problems | 97-interleaving-string/97-interleaving-string.cpp | class Solution {
public:
bool isInterleave(string s1, string s2, string s3) {
if(s1.size() + s2.size() != s3.size())
return false;
int m = s1.size(), n = s2.size();
vector<vector<int>> Cache(m + 1, vector<int>(n + 1, 0));
Cache[m][n] = 1;
for(int i = m; i >= 0; i-... | ALGO | 0.999895 | 6.020467 |
b3f4d28e-4a8e-4a2c-8ae7-7727f433c536 | sa04108/hyunbae | Coding_Test/Coding_Test/match_prediction.cpp | // https://www.acmicpc.net/problem/15997
#include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
using namespace std;
/*
Ȳ
1. 4 -> Ȯ 1/2
2. 3
1. 3 -> 3 Ȯ 2/3
2. 3 -> 3 Ȯ 1/3
3. 2 1 .
*/
double match[6][5] = { {0, 1, 0.7, 0.0, 0.3},
{0, 2, 0.4, 0.1, 0.5},
... | ALGO | 0.999536 | 4.026371 |
8ea43b73-c095-47b4-8e14-fa091887cb94 | shilpagarg/WHdenovo | trioasm/whatshap_trioasm/src/hapchat/binomialcoefficient.cpp | #include "binomialcoefficient.h"
std::vector<std::vector<unsigned int> > BinomialCoefficient::btable;
std::vector<std::vector<unsigned int> > BinomialCoefficient::ctable;
void
BinomialCoefficient::initialize_binomial_coefficients(const unsigned int n,
const unsigned int k... | ALGO | 0.999617 | 6.830739 |
343c9bb9-a622-4066-9c9d-d9e5dfa9d1e9 | pottaMuniAsheesh/CSES_problem_set | IntroductoryProblems/Permutations.cpp | // To see the problem statement, visit, https://cses.fi/problemset/task/1070
// To see the problem statement, visit, https://cses.fi/problemset/task/1070
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n, temp;
cin >> n;
... | ALGO | 0.999997 | 4.578421 |
6544da11-c51e-44af-a99c-72d7d21938dc | WilderStill/C-Programs | BZOJ/BZOJ 2745 - [HEOI2012] Bridge.cpp | #include<bits/stdc++.h>
#define M 205
#define ll long long
using namespace std;
ll n,m,p,c[M*10][M*10];
struct Matrix
{
ll a[M][M];
inline Matrix():a{0}{}
inline operator auto(){return a;}
inline operator auto()const{return a;}
inline Matrix operator*(const Matrix &b) const {
Matrix res;
... | ALGO | 0.999996 | 3.831001 |
a546be8a-80b8-4193-83c8-2e9d733d91ff | RevengeOS/android_packages_apps_OTAUpdates | jni/boost_1_57_0/libs/intrusive/example/doc_rbtree_algorithms.cpp | struct my_node
{
my_node(int i = 0)
: int_(i)
{}
my_node *parent_, *left_, *right_;
int color_;
//other members
int int_;
};
//Define our own rbtree_node_traits
struct my_rbtree_node_traits
{
typedef my_node node;
typedef my_node * ... | ALGO | 0.999771 | 6.599195 |
612840f9-b0fb-4ecf-ba6b-67e4e5e717fd | siryu2409/Algorithm | 프로그래머스/1/12954. x만큼 간격이 있는 n개의 숫자/x만큼 간격이 있는 n개의 숫자.cpp | #include <string>
#include <vector>
using namespace std;
vector<long long> solution(int x, int n) {
vector<long long> answer;
long long now = 0;
while(n > 0)\
{
now += x;
answer.push_back(now);
n--;
}
return answer;
} | ALGO | 0.99992 | 3.94985 |
da7f0ee9-e732-4fa9-a371-cfdc300adfbb | ishandutta2007/codeforces | volkov_ivan/normal/1290/C.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 7;
vector <int> incomp[N];
vector <int> g[N];
int color[N], comp[N], rv[N], sz[N], calc[N];
int shure = 0, add = 0;
bool fix[N];
void make_all(int v, int val) {
if (fix[v]) return;
int c = comp[v];
int was = color[v];
for (int elem : i... | ALGO | 0.999875 | 3.872446 |
51b841a5-e245-4b28-b144-1032ad265297 | MarowaAdel28/Problem-Solving | LinkedList/Compare two linked lists.CPP | /*
* Compare two linked lists
* easy
* https://www.hackerrank.com/challenges/compare-two-linked-lists/problem?isFullScreen=true
*/
#include <bits/stdc++.h>
using namespace std;
class SinglyLinkedListNode {
public:
int data;
SinglyLinkedListNode *next;
SinglyLinkedListNode(int node_data... | ALGO | 0.99856 | 4.80429 |
bb4c2563-c9a9-487c-aaa4-5d2d3d43ac1c | Sunjiumeng/School-code-Grade-one | 《C++实验》源码/第8章实例/Li8_3.cpp | //Li8_3.cpp
//ʾʹiosijԱַ
#include <iostream>
#include <string>
using namespace std;
int main()
{
double values[] = {1.23,35.36,653.7,4358.24};
char *names[] = {"aaaaaaa", "bbbb", "ccccc", "dddddd"};
for (int i=0;i<4;i++)
{
cout.setf(ios::left);//
cout.fill('*');//ַΪ*
cout.width(10);//Ϊ1... | TOOL | 0.966319 | 3.307403 |
11355524-6ac8-4619-8715-89e7a438b264 | ishandutta2007/codeforces | penguinhacker/normal/1485/C.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t; cin >> t;
while(t--) {
int x, y; cin >> x >> y;
ll ans = 0;
for (int b = 2; b <= min(32000, y); ++b) {
ans += min(b - 1, x / (b + 1));
}
for (int l = min(32000,... | ALGO | 0.999858 | 4.256279 |
6ea075b4-3dd8-4aa9-9c1f-f762091f5859 | Maskjam/Prototype-5-main | Library/PackageCache/com.unity.ide.visualstudio@2.0.12/Editor/COMIntegration/COMIntegration~/COMIntegration.cpp | #include <iostream>
#include <sstream>
#include <string>
#include <filesystem>
#include <windows.h>
#include <shlwapi.h>
#include "BStrHolder.h"
#include "ComPtr.h"
#include "dte80a.tlh"
constexpr int RETRY_INTERVAL_MS = 150;
constexpr int TIMEOUT_MS = 10000;
// Often a DTE call made to Visual Studio can fail after ... | TOOL | 0.963735 | 6.961219 |
a583e1c0-b30a-436a-8d09-d98dcb69d661 | nz0001na/programing_practice | Source18_05.cpp | #include <iostream>
using namespace std;
void DisElem(int a[], int n);
void QuickSort(int a[], int n);
void Qsort(int a[], int n, int low, int high);
int Partion(int a[], int low, int high);
//quick sort
void main() {
int a[] = { 55,22,44,67,35,77,18,69 };
int n = sizeof(a) / sizeof(a[0]);
cout << "Before:";
DisE... | ALGO | 0.999974 | 4.707935 |
5220f912-0d31-470f-b8c1-2b0f64e1b069 | Farid4hmed/-CrackYourInternship | Matrix/maxRec.cpp | class Solution {
vector<int>findPrev(vector<int>&vec){
vector<int>ans(vec.size());
stack<int>stk;
stk.push(-1);
for(int i=0;i<vec.size();i++){
int x=vec[i];
while(stk.top()!=-1 && (vec[stk.top()])>=x)
stk.pop();
ans[i]=stk.top(... | ALGO | 0.999992 | 6.307588 |
7daccfe9-6726-456b-b676-b492609c11ed | ishandutta2007/codeforces | far_from_noob/normal/1208/A.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define dd double
#define endl "\n"
#define pb push_back
#define fo(i,n) for(int i=0;i<n;i++)
ll mod=998244353;
ll n,k,t,m,q,flag=0;
ll po(ll k ,ll n,ll ans,ll temp,ll ans1){
if(n==0)return ans;
while(temp<=n){
ans*=ans1;ans%=mod;ans1=ans... | ALGO | 0.999986 | 4.518466 |
3052fd53-6baa-435b-8a6b-4caa3fcb0562 | nansencenter/nextsim | contrib/bamg/src/InterpFromMeshToMesh2dmex.cpp | /*!\file InterpFromMeshToMesh2dx
*/
#include "./InterpFromMeshToMesh2dmex.h"
#include "./Mesh.h"
#include "./shared.h"
#include "./typedefs.h"
//#include "../../toolkits/toolkits.h"
//#include "../../classes/classes.h"
//#include "../../bamg/bamgobjects.h"
using namespace bamg;
using namespace std;
int InterpFromM... | ALGO | 0.982257 | 5.354374 |
00892279-1a1a-4b0b-8a74-0c49e538a61b | rashika03/C-Assignment | Q7.cpp | #include<iostream>
using namespace std;
int main()
{
int x,sq;
cout<<"Enter a number";
cin>>x;
sq = x*x;
cout<<"The Square of "<<x<<" is "<<sq;
}
| TOOL | 0.919527 | 3.403914 |
7211b4f1-062c-4400-af4a-8a72f5185d43 | grantathon/nquantlib64 | QuantLib/ql/processes/geometricbrownianprocess.cpp | /* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
#include <ql/processes/geometricbrownianprocess.hpp>
#include <ql/processes/eulerdiscretization.hpp>
namespace QuantLib {
GeometricBrownianMotionProcess::GeometricBrownianMotionProcess(
... | ALGO | 0.932512 | 7.593368 |
faea4b5e-d8d2-4df0-9026-cd352d792cd3 | tomups/openmw-vr-quest | buildscripts/openmw-vr/apps/openmw/mwmechanics/aiavoiddoor.cpp | #include "aiavoiddoor.hpp"
#include <components/misc/rng.hpp>
#include "../mwbase/world.hpp"
#include "../mwbase/environment.hpp"
#include "../mwbase/mechanicsmanager.hpp"
#include "../mwworld/class.hpp"
#include "creaturestats.hpp"
#include "movement.hpp"
#include "actorutil.hpp"
#include "steering.hpp"
static co... | ALGO | 0.9394 | 5.269383 |
9ed1b7bf-95ff-4688-87f8-d9ae65808262 | sakagg/codechef | rrsum.cpp | #include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<stack>
#include<queue>
using namespace std;
int main()
{
// Uncomment to use TestCases
/* int T;
scanf("%d", &T);
while(T--)
{
}
*/
long long n, m, q, ans;
scanf("%lld%lld", &n, &m);
while(m--)
... | ALGO | 0.999912 | 3.16488 |
accd8ae5-3018-43ff-b22a-108d82189bd3 | gunjan3d/DSA | Queue/Queue.cpp | #include<iostream>
using namespace std;
class Queue
{
private:
int arr[100];
int front=0;
int rear = -1;
public:
void push(int val)
{
if(rear == 100)
{
cout<<"overflow\n";
return;
}
rear = rear+1;
arr[rear] = val;
}
voi... | ALGO | 0.998711 | 4.019441 |
6bb9fa0f-8904-4e74-bda3-9cf8e775fcb2 | juarezpaulino/coderemite | problemsets/Codeforces/C++/C1107.cpp | /**
*
* Author: Juarez Paulino(coderemite)
* Email: <EMAIL>
*
*/
#include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define ms(x,b) memset(x,b,si... | ALGO | 0.999861 | 4.521634 |
20c7db14-6033-41d6-8b4c-34fe4346798e | nxhhoang/MarisaOJ-roadmap-solution | Roadmap/Level 4/Tree/Euler Tour/Subtree queries/code_v2.cpp | // nxhhoang - the dreamer
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define endl '\n'
#define ub upper_bound // find target < min(value)
#define lb lower_bound // find target <= min(value)
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#de... | ALGO | 0.999898 | 4.10373 |
dcad2246-23f3-4ade-9710-d6343c8d6305 | alissonads/RayTracing | Raytracing/src/abstract/Sampler.cpp | #include "Sampler.h"
#include <algorithm>
#include "..\Util\Util.h"
Sampler::Sampler(const int numSamples,
const int numSets) :
numSamples(numSamples),
numSets(numSets),
jump(0), count(0)
{
samples.reserve(numSamples * numSets);
SetupShuffledIndices();
}
Sampler::Sampler(const Sampler &other) :
numSamples(... | ALGO | 0.902544 | 5.943187 |
931ca80a-ba4b-43a9-8350-c35267e532a7 | bhavy3103/Competitive-Programming | AtCoder/manyAplusb.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff(i, a, b) for (ll i = a; i < b; i++)
#define fb(i, a, b) for (ll i = a; i >= b; i--)
#define min3(a, b, c) min(a, min(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)))
#define max3(a, b, c) max(a, max(b, c))
#define max4(a, b, c, d... | ALGO | 0.999424 | 5.434446 |
1cabb752-8d12-42d6-b13a-d83ba051e15f | harshabangi/leetcode | cpp/graph_and_trees/merge_trees.cpp | //
// Created by Harsha Vardhan on 04/03/22.
//
#include <iostream>
#include <vector>
using namespace std;
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(i... | ALGO | 0.999949 | 6.281452 |
3d10cf78-6fec-4e61-99f9-dd98b1e266de | SolveGuys/AlgorithmStudy | Problems_Archives/28week/nmp9981/1946.cpp | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n,test;
vector<pair<int, int>> score;//성적
//초기화
void init() {
score.clear();
}
//입력
void input() {
cin >> n;
for (int i = 0; i < n; i++) {
int document, interview;
cin >> document>>interview;//서류점수, 면접점수
score.push_back({ doc... | ALGO | 0.999916 | 5.267382 |
71afc05f-4509-4dcd-8955-705b948ba997 | b-chae/AlgorithmStudy | baekjoon/2617.cpp | #include <iostream>
#include <vector>
using namespace std;
typedef struct marble {
bool visited;
vector<int> next_marbles;
vector<int> previous_marbles;
};
vector<marble> Marbles;
int N, M;
int next_dfs(int n) {
int count = 1;
int i;
Marbles[n].visited = true;
for (i = 0; i < Marbles[n].next_marbles.size(); ... | ALGO | 0.999891 | 3.880967 |
76e19126-8601-4d08-8dba-ce024585e064 | codacy-open-source-projects-scans/mongodb | src/mongo/db/query/boolean_simplification/match_expression_bm.cpp | #include "mongo/db/matcher/expression_leaf.h"
#include "mongo/db/matcher/expression_tree.h"
#include <benchmark/benchmark.h>
namespace mongo::boolean_simplification {
namespace {
std::unique_ptr<MatchExpression> buildOrOfLeafs(int value, std::vector<BSONObj>& bsonObjs) {
BSONObj operand = BSON("$eq" << value);
... | TEST | 0.976726 | 7.826073 |
7ae2b188-f9d8-40bc-b960-670f92ee13b2 | oji53/algo-training | atcoder_problems/abc/128b.cpp | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <numeric>
#include <set>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end(... | ALGO | 0.999936 | 3.766079 |
f2d541ca-eb8a-45f3-8825-da939b5543a0 | davehorton/pcap_ripper | deps/boost_1_65_1/libs/spirit/example/qi/roman.cpp | ///////////////////////////////////////////////////////////////////////////////
//
// A Roman Numerals Parser (demonstrating the symbol table). This is
// discussed in the "Symbols" chapter in the Spirit User's Guide.
//
// [ JDG August 22, 2002 ] spirit1
// [ JDG March 13, 2007 ] spirit2
//
//////////////////////... | TOOL | 0.948487 | 7.780124 |
8bc4d97d-cbdc-48d6-946d-efc47381ba45 | rymanb/CS170 | Labs/Lab 3/List.cpp | #include <iostream> // ostream
#include "List.h"
/*******************************************************************/
/*******************************************************************/
List::List(void)
{
head_ = 0;
}
List::~List(void)
{
struct Node * pNode = head_;
while (pNode != NULL)
{
... | TOOL | 0.935872 | 3.463325 |
5bcf9ac3-3c80-42fb-bca9-314437c1b6bc | ArrolCardoz/CompetitiveProgramming | AOC/2024/1.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec1, vec2;
int a, b;
// while (cin >> a >> b) {
// vec1.push_back(a);
// vec2.push_back(b);
// }
// sort(vec1.begin(), vec1.end());
// sort(vec2.begin(), vec2.end());
int ans;
// for (int i = 0; i < vec1.size(); i++) {
//... | ALGO | 0.999817 | 4.217818 |
9702aa7b-48c6-4835-b1fa-e79c45e7d35a | heathkh/iwct | snap/boost/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.991906 | 5.581228 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.