uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
8a6d0047-df1c-42f0-a774-10ed8ce83c3f | pologrp/experiments | tests/src/simulator.cpp | #include <chrono>
#include <cmath>
#include <cstdlib>
#include <exception>
#include <fstream>
#include <iostream>
#include <mutex>
#include <sstream>
#include <string>
#include <thread>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#include "boost/program_options.hpp"
namespace po = boost:... | DATA | 0.965668 | 6.368479 |
13a49855-a1c4-4e08-ab76-de44ae48a8b9 | HongSon28/Training | Online Judges/Vnoj/voi20_bonus.cpp | #include<bits/stdc++.h>
using namespace std;
const int N=300;
int n,k;
long long a[N+5],dp[N+5][N+5][N+5];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin>>n>>k;
for (int i=1;i<=n;i++) cin>>a[i];
for (int len=2;len<=n;len++) {
for (int i=1;i+len-1<=n;i+... | ALGO | 0.999943 | 4.229666 |
48a77efb-134a-42a4-b50c-93f1b9bd7488 | AbishekBhatta999/Numerical-Lab | Numerical Lab/Lab 2/Lagrange.cpp | //Lagrange Interpolation method
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cout << "Enter no. of terms" << endl;
cin >> n;
vector<float> X(n), Y(n);
float x, sum = 0, term;
int i, j;
cout << "Enter Values of X" << endl;
for (i = 0; i < n; i++)
... | ALGO | 0.999821 | 3.843642 |
cb3e07d1-50d0-490c-b18b-15a02b44d2e2 | kshoo0421/AlgorithmStudy | 11_최단경로(플루이드워셜)/11_2_02458.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0), cin.tie(0);
int N, M;
cin >> N >> M;
vector<vector<int>> dist(N, vector<int>(N, 0));
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
dist[a - 1][b - 1] = 1;
}
function<void()> Floyd = [&]() {
for (int k = 0; k < ... | ALGO | 0.999873 | 4.278372 |
9bd081e6-fa34-43c7-a229-9e2d855422d8 | vinoo999/pCMF | pkg/src/gamDistrib.cpp | /*!
* \file gamDistrib.cpp
* \fn class definition for Gamma Prior
* \author Ghislain Durif
* \version 0.1
* \date 22/04/2016
*/
#include <Rcpp.h>
#include <RcppEigen.h>
#include <math.h>
#include <boost/math/special_functions/digamma.hpp>
#include "gamDistrib.h"
#include "random.h"
#define mdigamma() unaryExpr(... | ALGO | 0.999599 | 6.630232 |
b95d9ca9-e3a2-41cf-bee3-3d6aaa16f73f | JonasGrmd/virtual-reality_project | 3rdParty/bullet/examples/Benchmarks/BenchmarkDemo.cpp | // Collision Radius
#define COLLISION_RADIUS 0.0f
#include "BenchmarkDemo.h"
///btBulletDynamicsCommon.h is the main Bullet include file, contains most common include files.
#include "btBulletDynamicsCommon.h"
#include <stdio.h> //printf debugging
#include "TaruData.h"
#include "landscapeData.h"
#include "BulletColli... | TEST | 0.90467 | 4.69548 |
9b10ca0d-2fd4-445a-afb5-a8f084d7d380 | Final-Combat-Source/finalcombat-src | src/utils/vvis/flow.cpp | int g_TraceClusterStart = -1;
int g_TraceClusterStop = -1;
/*
each portal will have a list of all possible to see from first portal
if (!thread->portalmightsee[portalnum])
portal mightsee
for p2 = all other portals in leaf
get sperating planes
for all portals that might be seen by p2
mark as unseen if n... | ALGO | 0.999483 | 4.319342 |
dd474bc2-4483-4467-889b-59aa28f55a45 | firstime09/CPlus-Plus | cpp_IF_E02.cpp | #include<iostream>
using namespace std;
int main(){
int a, c;
cout << "Input Nilai a = ";
cin >> a;
//c = 1;
for(int b = a; b > 0; b--){
printf("%-d", b);
//c*=b;
if (b!=1)
printf("x");
}
//printf(" = %d",c);
}
| ALGO | 0.999835 | 3.230944 |
3f7809eb-6fa8-4ef9-bcdb-8411ff0f70f9 | ishandutta2007/codeforces | igori/normal/1385/C.cpp | const int LG = 21;
const int N = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef ... | ALGO | 0.99993 | 5.044988 |
e48b0cfc-6d25-4f46-a075-421d02dafd2b | FMI-IP-2024-2025/ip-kn1-group3-practicum-2024-2025 | week_10/solutions/ex4.cpp | #include <iostream>
#include <cstdint>
//ще използваме std::min от <algorithm>.
//причината за това е, че в <utility>
//нямаме дефиниция на std::min, която да
//работи директно с инициализиращ списък -
//това значи, че трябва да пишем множество
//от вложени std::min, което е меко казано противно.
//в рамките на този ку... | ALGO | 0.999781 | 3.816734 |
5297571f-1054-458a-90ca-91c9def603cd | GovardhaneNitin/Top-Interview-150 | 58-Length-of-Last-Word.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
class Solution
{
public:
int lengthOfLastWord(string s)
{
// ...write your solution here...
int count = 0;
for (int i = s.length() - 1; i >= 0; i--)
{
if (count == 0 && s[i] == ' ')
... | ALGO | 0.995725 | 5.684988 |
35bf29e2-293d-4c04-bd4e-6c0606adcfc4 | gaivits/code_Kidding | robt1000s.cpp | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main()
{
string data;
int k,n=0,s=0,e=0,w=0;
cin>>data;
cin>>k;
int x,y,answer;
x=0;
y=0;
for(int i=0;i<data.size();i++)
{
if(data[i] == 'N')
{
n++;
}
else if(data[i] == 'S')
{
s++;
}
else if(data[i] == 'E'... | ALGO | 0.999969 | 3.04088 |
e72194cc-938b-40b8-85b4-c79252d43cd5 | arelokesh-7/sai_ganesh | tasks/c++/easy/sum.cpp | // C++ - Easy 2
// TODO: Create a Basic C++ Program to Add Two Numbers
int main()
{
}
| TOOL | 0.916504 | 3.772228 |
490e40b8-2e40-43c4-9d21-727e9941c559 | MozaffarMotwakil/cpp-problem-solving | level-2/Ex22-FibonacciSeriesWithRecursion/Ex_22-FibonacciSeriesWithRecursion.cpp | #include <iostream>
using namespace std;
void PrintFibonacciSeries(int Number, int N1, int N2) {
int FibNum = 0;
if (Number > 0)
{
FibNum = N1 + N2;
cout << FibNum << " ";
N1 = N2;
N2 = FibNum;
PrintFibonacciSeries(Number - 1, N1, N2);
}
}
int main()
{
//int Num = 10, N1 = 0, N2 = 1, FN = 0;
cou... | ALGO | 0.999545 | 4.569656 |
25a698d9-571f-407d-b78e-e38851f01eee | Tayade1999/intershala | m2-diving-into-c-programming/m2-code challenges - solution/m2-t4-e6.cpp | #include <stdio.h>
int main() {
int a[2][3], sum = 0;
// We will use nested for loop to access each position in a 2D array very similar to what we saw in the previous video
for (int r = 0; r < 2; r++) {
for (int c = 0; c < 3; c++) {
// User input for each element
printf("Enter a n... | ALGO | 0.997649 | 3.83848 |
d6a4456d-ac9c-4acf-b73d-89f9b9d8dec2 | Mnyikaniko/Mnyikaniko | mnyika differential equation project.cpp | #include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <utility> // For std::pair
// RK4 Differential Solver Class
class DifferentialSolver {
private:
// RK4 method implementation
static double rk4Step(double (*f)(double, double), double x, double y, double h) {
double k1 = ... | ALGO | 0.999852 | 6.710942 |
b7dfa09c-c08e-4690-b6e9-d8cfd3fb03d3 | Alimurrazi/Programming | beginner_level_and_uva/funct.cpp | #include<stdio.h>
int call(int i)
{
if(i==2)
return 0;
call(i+1);
printf("%d\n",i);
}
int main()
{
int k=call(0);
//printf("%d\n",k);
}
| ALGO | 0.999328 | 3.266469 |
a7884d2d-d72a-4619-a26e-95a174d0c7b6 | Aman-Keshri/DSA-450 | 8__Binary Tree/12_sum_tree_node_right_plus_left.cpp | #include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
struct Node *left, *right;
};
struct Node *newNode(int data)
{
struct Node *temp = (struct Node *)malloc(sizeof(struct Node));
temp->data = data;
temp->left = NULL;
temp->right = NULL;
return temp;
}
pair<bool, int> i... | ALGO | 0.999775 | 4.86433 |
b62cd64b-247e-45b4-a799-714260ec6330 | Xeomuz/Doom-Port-Source-Code | Zandronum/src/p_trace.cpp | #include "p_trace.h"
#include "p_local.h"
#include "i_system.h"
#include "r_sky.h"
#include "doomstat.h"
// [BB] New #includes.
#include "unlagged.h"
struct FTraceInfo
{
fixed_t StartX, StartY, StartZ;
fixed_t Vx, Vy, Vz;
DWORD ActorMask, WallMask;
AActor *IgnoreThis;
FTraceResults *Results;
sector_t *CurSector;... | ALGO | 0.975586 | 5.522955 |
7365ae68-051d-43f1-b58e-fffdea01f6b4 | drfpslegend/SchoolAssignments | C++/Concept Practice/Kayleen/hw5/b/main.cpp | #include <iostream>
#include <vector>
#include <iomanip>
void showEvens (const int [], const int, int &, std::vector<int> &);
int main()
{
const int SIZE = 10;
int index = 0;
int values[SIZE] = {2, 5, 7, 8, 11, 14, 17, 18, 22, 23};
std::vector<int> evens(0);
showEvens(values, SIZE, index, evens);
std::cout ... | ALGO | 0.974872 | 4.931587 |
46a97996-0c82-4d03-acc4-164ce5f9cafa | andreitudorica/UTCN_AN2 | Sem 2/FA/Tema9_BFS/Tema9_BFS/Source.cpp | #include <fstream>
#include <iostream>
#include <vector>
#include<ctime>
#include<algorithm>
#include "Profiler.h"
using namespace std;
Profiler profiler("BFS");
ifstream f("Text.txt");
int E, V, QueueLength,QL, Start, opCount;
vector <int> Neighbours[1000];
int Queue[1000], Distance[1000], used[10001], printed[10001];... | ALGO | 0.999584 | 4.486224 |
e3199bfb-b63e-4cdb-8910-3b97718df1a3 | karanmanglani/CP | Codeforces/Practice/CP 31/900/1582B.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main(){
lli t;
cin >> t;
while(t--){
lli n;
cin >> n;
vector<lli> a(n);
lli o = 0,z=0;
for(lli i = 0;i < n;i++) {
cin >> a[i];
if(a[i] == 0) z++;
else if(a[i] == 1) o... | ALGO | 0.999808 | 4.169464 |
4788136e-5d99-44ba-974b-8b529bc1167f | jordannanyan/flutter_Jordan-Setiawan-Nanyan | Minggu 4/10. Soal Platform Widget & Layout/praktikum/flutter_application_platform_widget/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.998311 | 6.76073 |
dfe93614-a388-4eea-93aa-da8d453fc3a3 | henryjchen/Competitive-Programming | codeforces/ToyBlocks.cpp | #include <bits/stdc++.h>
using namespace std;
int n;
int64_t tot = 0;
vector<int64_t> a;
bool ok(int64_t mid) {
if ((tot + mid) % (n-1) == 0) {
return true;
}
return false;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int T; cin >> T;
while (T--) {
cin ... | ALGO | 0.999923 | 5.541938 |
700d435d-69b4-4f5a-bccd-9610692116e1 | nereagallego/PACS | lab2/matrixMultEigenClock.cpp | #include <iostream>
#include <Eigen/Dense>
#include <ctime>
#include <iomanip>
int main(int argc, char* argv[])
{
clock_t time;
time = clock();
if(argc < 2){
std::cerr << "Usage ./matrixMultEigen.cpp <N>" << std::endl;
}
int N = atoi(argv[1]);
Eigen::MatrixXd mat = Eigen::MatrixXd::R... | ALGO | 0.998371 | 4.015986 |
4fa3a5f6-059c-4b94-b1d6-0d4e94b27f78 | ppkhang285/C-Codes | BAITAP/TOUR.cpp | #include <bits/stdc++.h>
#define task "TOUR"
#define REP(i,a,b) for(int i=a ; i<=b ; ++i)
#define oo 10000000
using namespace std;
struct EGDE{
int u,v,w;
};
EGDE E[10000];
int C[100][100] ,n, m , T[1000][100], chosenE, chosenU , chosenV , chosen[1000] ,N;
void FLoyd(){
REP(k,1,n)
REP(i,1,n)
... | ALGO | 0.999994 | 3.916245 |
cf320153-aff1-49f6-810b-6b503b0969a7 | huajian1069/leetcode | src/0020-valid-parentheses/valid-parentheses.cpp | #include "valid-parentheses.hpp"
#include <stack>
bool Solution::isValid(string s) {
stack<char> par;
int i = 0;
bool valid = true;
while(i < s.length() && valid){
switch(s[i]){
case '(':
case '{':
case '[':
par.push(s[i]);
bre... | ALGO | 0.999044 | 6.375823 |
52450f2f-55d7-489b-b8d3-52e4f9d6b915 | KingBean4903/C-CPP-DSA- | DP-PREP/is_palindrome.cpp | #include <iostream>
#include <vector>
#include <climits>
using namespace std;
int isPalindrome(string& s) {
int n = s.length();
// min number of cuts for palindrome
// partitioning of s[i...j]
int dp[n][n];
// True if substring s[i...j]
// is palindrome else false
bool isPalin[n][n];
for (int i = 0; i< ... | ALGO | 0.99986 | 5.101609 |
4dd2ee5c-a402-4169-947d-d2c3c52e0ade | Froked/LeetCode_30_days_challenge_2020 | week_2/day_13.cpp | /**
Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1.
Example 1:
Input: [0,1]
Output: 2
Explanation: [0, 1] is the longest contiguous subarray with equal number of 0 and 1.
Example 2:
Input: [0,1,0]
Output: 2
Explanation: [0, 1] (or [1, 0]) is a longest contiguous su... | ALGO | 0.999983 | 5.934842 |
d4c7a331-7182-4e17-882d-5ff804d9e267 | FerdousReza1998/Practice-Codes-CSE225 | home practice/My_stack_array/main.cpp |
///stack with array
#include <iostream>
#define size 100
using namespace std;
///array implementation of stack
class MyStack
{
public:
int A[size];
int top;
MyStack()
{
this->top = -1;
}
};
MyStack stack1;
///*******************************************
bool isEmpty(){
if(stack1.top==-1)... | ALGO | 0.998592 | 4.193042 |
e383f1f2-91b4-4233-babb-5d6f5767a233 | ritukadiya/OOP_C- | MODULE_4.4_P2_RECTANGLEAREA.cpp | /*
Write a C++ Program to find Area of Rectangle using inheritance.
*/
#include <iostream>
using namespace std;
class rectangle
{
public:
int width;
int height;
void inputDimensions()
{
cout << "Enter width: ";
cin >> width;
cout << "Enter height: ";
cin >> height;
... | TOOL | 0.950877 | 4.80844 |
629e6b6a-a31f-4eb4-8786-a6a5c0e1e600 | reuven-itzhakov/Leet-Code | 2463-minimum-recolors-to-get-k-consecutive-black-blocks/minimum-recolors-to-get-k-consecutive-black-blocks.cpp | class Solution {
public:
int minimumRecolors(string blocks, int k) {
int minw = k, currw = 0;
for(int i = 0; i <= blocks.length()-k; i++){
for(int j = i; j < k+i; j++){
if(blocks[j] == 'W')
currw++;
}
if(currw < minw)
... | ALGO | 0.999852 | 5.513661 |
ae7dd57d-1d44-49d0-a8f1-b4ae199c56bf | SujitChaudhary2005/CPP-Assignment | Lab2/Q3.cpp | //Program to check if two arrays are equal or not
#include <iostream>
using namespace std;
bool areArraysEqual(int arr1[], int arr2[], int size) {
for (int i = 0; i < size; i++) {
if (arr1[i] != arr2[i]) {
return false;
}
}
return true;
}
int main() {
const int size = 5;
... | ALGO | 0.999345 | 6.105538 |
0d8c7796-bc5f-4718-92aa-63bbf34928ca | muriloguizelin/algos | CSES/coinPiles.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for(int i = 0; i < n; i++){
int a, b;
cin >> a >> b;
if((a+b)%3 == 0 && 2*a >= b && 2*b >= a){
cout << "YES" << endl;
} else {
... | ALGO | 0.999933 | 4.00707 |
e3ab8b30-20e2-4989-b1f3-ec9148002622 | bdrillard/eecs-268 | Lab_09/Lab_09b/sortingLab/2373732_Lab9/TestDriver.cpp | //Selection and Bubble are working
#include <iostream>
#include <cstdlib>
#include <cassert>
#include <ctime>
#include "Sorts.h"
using namespace std;
typedef void (*SortFunction)(double a[], int n);
int main(int argc, char *argv[])
{
if(argc < 4) {
cerr << "Usage: " << argv[0]
<< " <algorithm> <n> <se... | ALGO | 0.999128 | 4.679471 |
54a545ea-db22-404d-a794-04f4c54f9267 | GarvLuthra24/file-codes | assignment 2/q5.cpp | #include <iostream>
using namespace std;
class complex
{
private:
int r;
int c;
public:
complex()
{
this->r = 0;
this->c = 0;
}
complex(int r, int c)
{
this->r = r;
this->c = c;
}
void display()
{
cout << this->r << "+i" << this->c << end... | ALGO | 0.937537 | 4.233273 |
fa4cdbc9-6114-4a68-a782-717329efbfa9 | Rahul-IITG/DSA | reverse_pairs.cpp | #include <vector>
using namespace std;
int reversePairs(vector<int>& nums) {
} | ALGO | 0.99972 | 5.587414 |
a3a64835-7ad7-442b-89b1-f513aa317b57 | a00012025/Online_Judge_Code | Zerojudge/a044.cpp | #include <stdio.h>
main ()
{
int a,b ;
while (scanf ("%d",&a)==1)
{
b=(a+1)*(a*a-a+6)/6 ;
printf ("%d\n",b) ;
}
}
| ALGO | 0.999303 | 3.095231 |
73dee064-4225-4d7e-9adc-a03d799883fd | vmos-dev/frameworks | av/media/libstagefright/codecs/amrwb/src/dec_alg_codebook.cpp | /*
------------------------------------------------------------------------------
Filename: dec_alg_codebook.cpp
Date: 05/08/2004
------------------------------------------------------------------------------
REVISION HISTORY
Description:
--------------------------------------------------------------------... | ALGO | 0.99991 | 3.930405 |
7e3e1e8d-c7bb-4ef4-bc34-08af8096a65d | tony9402/baekjoon | solution/dynamic_programming_1/11048/main.cpp | // Authored by : tony9402
// Co-authored by : -
// Link : http://boj.kr/4ff69fc575384408beee739a7904de45
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N, M; cin >> N >> M;
vector<vector<int>> DP(N + 1, vector<int>(M + 1));
for(int i=1;i<=N;i... | ALGO | 0.999947 | 3.925092 |
4cf99d17-6f32-4c57-874d-7b8f28f9b867 | herrdiener/HunAlign | src/hunalign/oldAlignTest.cpp | #pragma warning ( disable : 4786 )
// Hajjaj. Ez komoly warning. De nemigen tudom kikerulni.
#pragma warning ( disable : 4503 )
#include "dictionary.h"
#include "bloom.h"
#include "translate.h"
#include "alignment.h"
#include "bookToMatrix.h"
#include "dicTree.h" // Just for main_SmallSubsetLookupTest()
#include <s... | TEST | 0.895579 | 5.261376 |
6a5982e9-6a21-4ae8-b719-d0dcacf66c66 | yjp20/codeforces-solutions | 115/a/a.cpp | // youngjinp20
// 2020 03
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[2005];
vector<int> roots, G[2005];
int dfs(int v) {
int m = 0;
for (auto e:G[v]) {
m = max(m,dfs(e));
}
return m + 1;
}
int main() {
cin >> n;
for (int i=1; i<=n; i++) {
cin >> a[i];
if (a[i] == ... | ALGO | 0.999659 | 3.944804 |
61b2a37d-26fc-4a1e-b426-bfb9a7b1402d | rishavchandra/dsa | strings and char arrays/remove-all-occurences-of-substring.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
string sub;
cin >> s >> sub;
int pos = s.find(sub);
while(pos != string::npos){
s.erase(pos, sub.length());
pos = s.find(sub);
}
cout << s;
return 0;
} | ALGO | 0.999685 | 3.741195 |
838ed02e-4dca-4347-b548-02921e41953d | ShuoHe97/CS239-Final-Project | chrono/chrono-dev/src/chrono/geometry/ChLine.cpp | #include <memory.h>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include "chrono/geometry/ChLine.h"
namespace chrono {
namespace geometry {
// Register into the object factory, to enable run-time dynamic creation and persistence
// CH_FACTORY_REGISTER(ChLine) // NO! Ab... | ALGO | 0.995929 | 5.573127 |
0acd1b11-52af-4b7e-8ff0-a70ba157dcdf | MAsadMughal/Cpp-Journey | DSA (CODE HELP)/Lec38_Keypad_Problem_using_Recursion.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
void problem(string question, vector<string> mapping, string output, vector<string> &ans, int ind)
{
if (ind >= question.length())
{
// cout << output << endl;
ans.push_back(output);
return;
}
... | ALGO | 0.999734 | 5.410715 |
c8a35aec-3a7c-4154-9cb5-82053d9ff34b | lutfiandri/hackerrank | cpp/12-attribute-parser.cpp | #include <bits/stdc++.h>
// #include <sstream>
using namespace std;
int main() {
int n, q;
string temp;
cout << "masukkan n dan q ";
cin >> n >> q;
vector<string> hrmls;
vector<string> queries;
cin.ignore();
for (int i = 0; i < n; i++) {
getline(cin, temp);
temp.erase(... | ALGO | 0.982551 | 3.829166 |
434156cc-cc4f-4230-b9b6-75ca88681e0a | PiyasSarkar81/LeetCode-and-GFG-Solutions | 0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlin... | /**
* 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* removeNodes... | ALGO | 0.999987 | 5.978543 |
09891fcd-7914-4761-8292-e22d50a31656 | SAP/project-foxhound | gfx/skia/skia/src/core/SkBlurMaskFilterImpl.cpp | #include "src/core/SkBlurMaskFilterImpl.h"
#include "include/core/SkBlendMode.h"
#include "include/core/SkBlurTypes.h"
#include "include/core/SkFlattenable.h"
#include "include/core/SkImageFilter.h"
#include "include/core/SkImageInfo.h"
#include "include/core/SkMaskFilter.h"
#include "include/core/SkMatrix.h"
#include... | TOOL | 0.909967 | 7.267864 |
aad8d02a-afba-41c4-b14e-7f39fe20e509 | SenseLogic/MYST | BOOST/boost_1_76_0/libs/graph/example/scaled_closeness_centrality.cpp | //[scaled_closeness_centrality_example
#include <iostream>
#include <iomanip>
#include <boost/graph/undirected_graph.hpp>
#include <boost/graph/exterior_property.hpp>
#include <boost/graph/floyd_warshall_shortest.hpp>
#include <boost/graph/closeness_centrality.hpp>
#include "helper.hpp"
using namespace std;
using nam... | ALGO | 0.999728 | 7.028439 |
b0ec56c6-c189-4b1d-bb49-6d6287df1a64 | sinian666/code_41_18 | cpp_副本3/chapter_backtracking/permutations_i.cpp | /**
* File: permutations_i.cpp
* Created Time: 2023-04-24
* Author: Krahets (<EMAIL>)
*/
#include "../utils/common.hpp"
/* 回溯算法：全排列 I */
void backtrack(vector<int> &state, const vector<int> &choices, vector<bool> &selected, vector<vector<int>> &res) {
// 当状态长度等于元素数量时，记录解
if (state.size() == choices.size()... | ALGO | 0.999977 | 5.578971 |
93c18299-ab56-43b6-815e-26d54ad1996c | ishandutta2007/codeforces | rstoick/normal/1305/A.cpp | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
using namespace std;
#define fas... | ALGO | 0.99981 | 3.672974 |
9bc888ce-0b12-4e95-986a-ffd638c6f6a7 | YounesMakhlouf/CP-Solutions | EPT-Solving-Cup-4.0/I-pyromane.cpp | #include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
typedef vector<int> vi;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> x(n), y(n), goodness(n);
map<double, int> radiuses;
// Input
for (int i = 0; i < n... | ALGO | 0.999658 | 4.611138 |
c086cc6e-3d7f-4c58-9e7c-ea9b1fb0676d | K-gmx/Roxy | Code/20周/9前缀和与差分/重新排序.cpp | #include <bits/stdc++.h>
#define ll long long int
#define N 100009
using namespace std;
ll cnt[N],d[N],a[N];
int main(){
ll n,m;
scanf("%lld",&n);
for(ll i=1;i<=n;i++){
scanf("%lld",&a[i]);
}
scanf("%lld",&m);
for(ll i=1;i<=m;i++){
ll r,l;
scanf("%lld%lld",&l,&r);
d[l]++;d[r+1]--;
}
cnt[0]=0;
for(ll i=... | ALGO | 0.999986 | 3.781023 |
c6e39090-27e9-4d5d-b768-368512a76b36 | girish751/LeetCode | 0217-contains-duplicate/0217-contains-duplicate.cpp | class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
map<int,int>m;
vector<int>arr;
for(int i=0;i<nums.size();i++){
m[nums[i]]++;
}
for(auto it:m){
if(it.second>=2){
return true;
}
}
retu... | ALGO | 0.999744 | 5.717139 |
49527b63-80bd-4f88-9a96-abfc8a059722 | ramderoy1234/leetcode_problems | 1813-maximum-erasure-value/1813-maximum-erasure-value.cpp | class Solution {
public:
int maximumUniqueSubarray(vector<int>& nums) {
unordered_set<int> mp;
int i = 0;
int sum = 0;
int maxSum = 0;
for (int j = 0; j < nums.size(); j++) {
while (mp.find(nums[j]) != mp.end()) {
sum -= nums[i];
mp... | ALGO | 0.999778 | 6.686916 |
1e9ca2cd-500c-4f70-a3d3-ca018891fea9 | shiqitao/SOJ-Solutions | SOJ_C++/4024.cpp | #include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (b > 0) {
cout << a << "+" << b << "=" << a + b << endl;
cout << a << "*" << b << "=" << a*b << endl;
cout << a << "/" << b << "=" << a / b << endl;
cout << a << "%" << b << "=" << a%b << endl;
}
else if (b < 0) {
cout << a... | ALGO | 0.989886 | 3.422473 |
c3c02e47-e2a8-421c-a1a6-4443a23f9bd9 | ashish2125it/Coding_Blocks_Launchpad | Coding-Blocks-Launchpad-main/Lecture 19/Program_03.cpp | #include <iostream>
using namespace std;
int main() {
int n, m;
// Input number of rows and columns
cout << "Enter number of rows (n): ";
cin >> n;
cout << "Enter number of columns (m): ";
cin >> m;
int arr[n][m];
// Input the 2D array
cout << "Enter elements of the 2D array:" <<... | ALGO | 0.999473 | 5.972173 |
f8e20515-939a-4cb0-8f71-f25bb99c1d2d | zhouyium/myoj | 4495/gen.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
freopen("2.in", "w", stdout);
srand(time(NULL));
// t 1 ~ 10
int n=rand()%50000+1;
cout<<n<<"\n";
for (int i=1; i<=n; i++) {
//m,n
int op=rand()%3;
if (0==op) {
cout<<"insert ";
int x=rand()%1000000000;
cout<<' '<<x<<"\n";
} else if (1=... | ALGO | 0.993066 | 3.74225 |
9fc5be28-f3ba-4ff5-8da1-dffae2de496a | KomalDhanwani-ai/problem-solving-with-cpp | 412-fizz-buzz/fizz-buzz.cpp | class Solution {
public:
vector<string> fizzBuzz(int n) {
vector<string> result;
for (int i = 1; i <= n; i++) {
if (i % 3 == 0 && i % 5 == 0)
result.push_back("FizzBuzz");
else if (i % 3 == 0)
result.push_back("Fizz");
else if (i % 5... | ALGO | 0.999835 | 6.925446 |
3ded6e42-9f6d-4e78-9d33-1b4753d6345a | pch6828/PS_Algorithm | LeetCode/ALGORITHM/unique_paths_ii.cpp | class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int grid[101][101];
for(int i = 0; i <= max(obstacleGrid.size(), obstacleGrid[0].size()); i++){
grid[i][0] = grid[0][i] = 0;
}
grid[0][1] = 1;
for(int i = ... | ALGO | 0.999867 | 6.345818 |
04e5ad6c-9b44-439c-8a46-7dd2e764f39b | takatoshilee/Competitive-Programming | cbflamethrower.cpp | #include "bits/stdc++.h"
//#include "debugging.h"
using namespace std;
//#define dbg(v) \
//cout << "Line(" << __LINE__ << ") -> " << #v << " = " << (v) << endl;
#define ll long long
#define ld long double
#define ar arrayOHH
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x... | ALGO | 0.999921 | 4.183846 |
247cceaa-61f2-4918-b202-3340283d7fca | alexandraback/datacollection | solutions_5670465267826688_0/C++/catupper/dijkstra.cpp | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
string str;
int n, t, l, x;
int val[108000];
#define I 2
#define J 3
#define K 4
int mult(int x, int y){
int res = 1;
if(x < 0){
res *= -1;
x *= -1;
}
if(y < 0){
res *= -1;
y *= -1;
}
if(x == 1 && y == 1)return res * 1;
if(x ... | ALGO | 0.999976 | 4.012312 |
3119abfb-deb4-48b1-b863-631d0ec3abd6 | jbsrpsk/student | 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 |
d081cbe9-75cd-4e4b-8dee-fa7bbf7beb0e | range4-skyz/LearnCpp | CppCon/CppCon_2023/library_changes/ranges/demo/main4.cpp | #include <algorithm>
#include <print>
#include <ranges>
#include <vector>
// Several folding algorithm:
// ranges::fold_left()
// ranges::fold_left_first()
// ranges::fold_right
// ranges::fold_right_last()
// ranges::left_with_iter()
// ranges::left_first_with_iter()
int main() {
std::vector v {11, 22, 33, 44};
... | ALGO | 0.999683 | 4.572682 |
617b9332-f632-414a-b1a7-722e745f0276 | IElgohary/Uva-solutions | 10505 - Montesco vs Capuleto.cpp | /*input
1
8
2 4 5
2 1 3
0
0
0
1 3
0
1 5
*/
#include <stdio.h>
#include <cmath>
#include <set>
#include <vector>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string.h>
#include <stack>
#include <map>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <functi... | ALGO | 0.999623 | 4.098236 |
334d5151-5b13-4439-90d9-99d72c365a90 | chichuyun/LeetCode | 0026/main.cpp | class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size()<2) return nums.size();
int left = 0;
int right = 1;
int len = nums.size();
while(right < len) {
while(right < len && nums[left] == nums[right]) ++right;
if(... | ALGO | 0.999776 | 6.338151 |
fd1951a1-8a18-437a-b3c4-43360f8105d9 | vorsv/code | leet/19.cpp | #include<bits/stdc++.h>
#include "ll.h"
using namespace std;
class Solution {
public:
Solution(){
int b=2;
ListNode* a = vecToLinkedList({1,2,3,4,5});
cout << removeNthFromEnd(a,b);
}
ListNode* removeNthFromEnd(ListNode* a, int b){
return a;
... | ALGO | 0.999847 | 4.644571 |
0a34106e-7158-4bd8-946a-990438bf5576 | sarvex/leetcode-dart | solution/0600-0699/0658.Find K Closest Elements/Solution.cpp | class Solution {
public:
vector<int> findClosestElements(vector<int>& arr, int k, int x) {
int left = 0, right = arr.size() - k;
while (left < right) {
int mid = (left + right) >> 1;
if (x - arr[mid] <= arr[mid + k] - x)
right = mid;
else
... | ALGO | 0.999998 | 5.623294 |
57caf497-aa80-4582-9524-c26c940deed8 | Parmeshwargupta/Dsa | array/swapingarr.cpp | #include <iostream>
using namespace std;
void printArray(int arr[], int size)
{
for (int i = 0; i < size; i++)
{
cout << arr[i] << " ";
}
// cout << "Print the array" << endl;
}
void swapalternate(int arr[], int size)
{
for (int i = 0; i < size; i += 2)
{
if (i + 1 < size)
... | ALGO | 0.998952 | 4.305983 |
4bfc339c-354a-49c5-b38b-93391b045f47 | pranonrahman/Competitive-Programming-Codes | CompetitiveProgramming/CodeForces/55A/24846350_AC_46ms_16kB.cpp | //coded by: pranonrahman-------------------------------------
//-----------------------------------------------------------
//-----------------------------------------------------------
#include<bits/stdc++.h>
using namespace std;
#define O_o ios_base::sync_with_stdio(0)
#define O_O ios_base::sync_with_stdio(0); cin.ti... | ALGO | 0.999732 | 3.958312 |
e3a7e163-a537-4a4b-ae70-c71545796f5c | konicst1/aes128-implementation | src/aes-pc/aes128-AES-NI.cpp | #include <stdio.h>
#include <stdint.h>
#include <immintrin.h>
#include <chrono>
/* AES Constants */
const uint8_t rCon[12] = {
0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36,
};
/* AES state type */
typedef uint32_t t_state[4];
/* Helper functions */
void hexprint16(uint8_t *p) {
for (i... | ALGO | 0.983373 | 5.020761 |
c6a44748-a049-41e7-9535-a144a736d9de | LeeBergstrand/NCBI_Tools | src/algo/structure/cd_utils/cuAlignedDM.cpp | #include <ncbi_pch.hpp>
#include <algo/structure/cd_utils/cuAlignedDM.hpp>
BEGIN_NCBI_SCOPE
BEGIN_SCOPE(cd_utils)
const double AlignedDM::FRACTIONAL_EXTRA_OFFSET = 0.005;
AlignedDM::AlignedDM()
:DistanceMatrix(), m_ppAlignedResidues(0), m_maligns(0)
{
}
void AlignedDM::setData(MultipleAlignment* malign)
{
m_malign... | ALGO | 0.894577 | 6.323857 |
9d3e872e-a89b-47ee-82ee-ac57ccbac0a8 | liaoj12/ACM | POJ/done/poj_1000.cpp | #include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
cout << a + b << endl;
return 0;
}
| ALGO | 0.992138 | 3.43364 |
9615bd4a-c51c-4a88-bfb1-fb1c75c9fd49 | avijitgupta/contrail-avrotest | boost_1_49_0/libs/units/example/performance.cpp | /**
\file
\brief performance.cpp
\details
Test runtime performance.
Output:
@verbatim
multiplying ublas::matrix<double>(1000, 1000) : 25.03 seconds
multiplying ublas::matrix<quantity>(1000, 1000) : 24.49 seconds
tiled_matrix_multiply<double>(1000, 1000) : 1.12 seconds
tiled_matrix_multiply<quantity>(1000, 1000... | TEST | 0.974434 | 6.027916 |
49ad9941-b471-490c-965d-6fa62011cfdd | 512391/Shuntingyard | ShuntingYard.cpp | #include<iostream>
#include"Stack.h"
#include"Queue.h"
#include<cstring>
#include<cmath>
#include<map>
#include"BinaryStack.h"
using namespace std;
/*
author jay williamson
date 2/5/25
this class converts expressions to infix prefix and postfix and can evaluate them
*/
//this converts the origional infix to po... | ALGO | 0.999167 | 4.077724 |
da4c5b5f-8d43-496e-8af2-736b8ce416bc | uzzal2200/Alogorithm | Module 27 : LCS Variations/Check_string_a_is_subsequence.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
int n=a.size();
int m=b.size();
// normal apporach O(M);
// int x=0;
// bool check = false;
// for(char c: b)
// {
// if(c == a[x])
// {
// x++;
// }
// ... | ALGO | 0.999993 | 3.826191 |
a489d9e6-321d-49b4-921c-79448b2a6444 | raincross7/code-similarity | codes/train_code/problem004/problem004_110.cpp | // Gaurav Nuti
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii > vii;
typedef vector<pll > vll;
#define pb push_back
#define mp make_pair
#define ar array
#define mod 1000000007
... | ALGO | 0.999591 | 3.479774 |
7afff4c9-6286-4a66-b041-1681014927c0 | Ritika-Kumari-16/LeetCode | 0054-spiral-matrix/0054-spiral-matrix.cpp | class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
int m= matrix.size();
int n=matrix[0].size();
int left =0, top=0;
int bottom = m-1;
int right=n-1;
vector<int>ans;
while(top<=bottom && left<=right){
for(int i=left;i<=... | ALGO | 0.999997 | 6.277762 |
e09f48b9-6604-4637-874d-e9cdada1b178 | sugaliudaykiran/dsa_labs | s-1/s-1.2/pattern_5.cpp | #include<bits/stdc++.h>
using namespace std;
void call2pattern(int n){ // TC -> O(N^2).. SC -> O(1)..
for (int i=0; i<n; i++){
for (int j=0; j<n-i; j++){
cout << "* " <<" ";
}cout << "\n";
}
}
int32_t main(){
int n;
cin >> n;
call2pattern(n);
return 0;
}
// ... | ALGO | 0.999721 | 4.171009 |
41912b9d-177b-4349-a04f-c6a567d370fa | Elzapat/advent-of-code | 2020/04/4_1.cpp | #include <fstream>
#include <iostream>
#include <vector>
int main () {
std::ifstream input("4.txt");
std::string line;
int n = 0;
bool byr = false, iyr = false, eyr = false, hgt = false, hcl = false, ecl = false, pid = false;
while (std::getline(input, line)) {
if (line.find("byr:") != s... | ALGO | 0.953813 | 5.116928 |
b41d391d-5315-40a2-a3bd-5f436e612d62 | lukas-lansky/sage | src/sage/schemes/hyperelliptic_curves/hypellfrob/hypellfrob.cpp | #include "hypellfrob.h"
#include "recurrences_ntl.h"
#include "recurrences_zn_poly.h"
NTL_CLIENT
namespace hypellfrob {
/*
For some reason NTL doesn't have conversions to mat_ZZ....
*/
void conv(mat_ZZ& x, const mat_ZZ_p& a)
{
x.SetDims(a.NumRows(), a.NumCols());
for (int i = 0; i < a.NumRows(); i++)
for... | ALGO | 0.999963 | 4.796922 |
c9790d73-cc27-4702-bb69-c53aca841a9d | kmjp/procon | csacademy/021-040/029/a.cpp | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... | ALGO | 0.999514 | 3.743748 |
1d274b09-9e53-4dab-ae7f-f395f2c3fbba | euav/focss | src/tasks/wdm_run.cpp | #include <fstream>
#include <iostream>
#include "focss/equalizer/linear.h"
#include "focss/field.h"
#include "focss/functions.h"
#include "focss/module/amplifier.h"
#include "focss/module/fiber.h"
#include "focss/processing/modulation.h"
#include "focss/solver/ssfm.h"
#include "parameters.h"
#include "systems.h"
#inclu... | ALGO | 0.984558 | 4.029045 |
7e285a37-53ab-48f0-b454-51c0caf5e4f9 | nshan651/leet | lang/cpp/src/345-reverse-vowels-of-a-string.cpp | #include <string>
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
class Solution
{
public:
std::string reverseVowels(std::string s)
{
auto isVowel = [](char c)
{ return c == 'a' || c == 'e' || c == 'i' || c == 'o'
|| c == 'u' || c == 'A' || c == 'E' || c == 'I' || c == 'O' || c ... | ALGO | 0.999498 | 6.435726 |
aee92ef2-d2d1-431f-b660-78054cdf296c | Rossatoo/UFN-Faculdade | programa-oEstruturada-main/1_exercicios/codigo1.cpp | //1) Fazer um programa em C++, populando um vetor (tamanho N) com números aleatórios de 0 a 100. Na sequência, o vetor deve ser exibido, bem como o maior e o menor valor inseridos.
#include <iostream>
#include <ctime>
#include <cstdlib>
using namespace std;
int main() {
//Populando o vetor
int vetor[10];
... | ALGO | 0.993244 | 4.122527 |
b7c8770f-9317-4cc2-b4e6-b7cb432c0c7b | kkpan11/apple-llvm-project | clang-tools-extra/clang-include-fixer/tool/ClangIncludeFixer.cpp | #include "FuzzySymbolIndex.h"
#include "InMemorySymbolIndex.h"
#include "IncludeFixer.h"
#include "IncludeFixerContext.h"
#include "SymbolIndexManager.h"
#include "YamlSymbolIndex.h"
#include "clang/Format/Format.h"
#include "clang/Frontend/TextDiagnosticPrinter.h"
#include "clang/Rewrite/Core/Rewriter.h"
#include "cla... | TOOL | 0.967137 | 7.848163 |
6d10cd96-2d5a-49fd-8956-62a90c87e7bc | ahao214/Algorithm | Ahao.LeetCodeCPP/1619. 删除某些元素后的数组均值.cpp | #include<vector>
#include <algorithm>
#include <numeric>
using namespace std;
class Solution {
public:
double trimMean(vector<int>& arr) {
int n = arr.size();
sort(arr.begin(), arr.end());
int partialSum = accumulate(arr.begin() + n / 20, arr.begin() + (19 * n / 20), 0);
return par... | ALGO | 0.99876 | 5.830311 |
11c10d3d-9b22-4665-9744-36941dd67c0c | shashikira02/Leetcode | 0239-sliding-window-maximum/0239-sliding-window-maximum.cpp | class Solution {
public:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
vector<int> ans; // Stores the maximums of all sliding windows
deque<int> dq; // Deque to store indices of potential maximums
for (int i = 0; i < nums.size(); i++) {
// Remove index that are out ... | ALGO | 0.999991 | 6.731336 |
700ce106-c05a-4b70-9e62-717087d8b8bd | DdiDding/Solve_Algorithm | Algospot/Algospot/달팽이.cpp | #include <bits/stdc++.h>
using namespace std;
double dp[1001][2002];
int day, top;
double solve(int n, int m)
{
//帶
if (n == day) return top <= m ? 1.0 : 0.0;
//̼
double & ret = dp[n][m];
if (ret != -1.0) return ret;
return ret = 0.75 * solve(n + 1, m + 2) + 0.25 * solve(n + 1, m + 1);
}
int main()
{
ios_b... | ALGO | 0.998742 | 3.95212 |
a5125dce-bb1f-4475-9d0f-1b5db41a4678 | kokihoon/algorithm | 11650_c++.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int num;
cin >> num;
vector<pair<int, int> > vec(num);
for(int i = 0; i < num; i++) {
cin >> vec[i].first >> vec[i].second;
}
sort(vec.begin(), vec.end());
for(int i = 0; i < num; i++) {
... | ALGO | 0.999751 | 4.339037 |
0d99b9da-f1ff-4b96-b664-22618bc6ad1f | vittorioromeo/cppcon2015 | 1_ForArgs/p1.cpp | #include <iostream>
// Let's rewrite the code snippet in a more organized manner, using
// comments to make obvious what it is actually happening.
template <typename TF, typename... Ts>
void forArgs(TF&& mFn, Ts&&... mArgs)
{
// We require a context where variadic parameter expansion can
// take place, so tha... | TOOL | 0.988223 | 7.363444 |
5ed881ba-1c69-492c-a129-9a5914af7f76 | zubayersust/LightOJ-Solve | 1063.cpp | /**
Author : Zubayer Rahman
Email : <EMAIL>
CPU : 0.024s
Memory : 2752
*/
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<vector>
#include<algorithm>
#define MAX_HILL 10005
using namespace std;
int testCase,caseNum=1,n,m,tim=0;
int low[MAX_HILL],dis[MAX_HILL],parent[MAX_HILL];
bool visited[MAX_... | ALGO | 0.999783 | 5.076988 |
ca650aac-5d64-4766-8801-e428bbbf3368 | ishandutta2007/codeforces | pashka/normal/1141/C.cpp | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<long> a(... | ALGO | 0.999975 | 3.845831 |
bff0ccd2-817d-410c-b47d-7355c7a5247d | munzir/10c-3DHighLevelControllerC-Munzir | eigen/doc/examples/tut_arithmetic_dot_cross.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
using namespace std;
int main()
{
Vector3d v(1,2,3);
Vector3d w(0,1,2);
cout << "Dot product: " << v.dot(w) << endl;
double dp = v.adjoint()*w; // automatic conversion of the inner product to a scalar
cout << "Dot product via a matrix product... | ALGO | 0.999117 | 4.042919 |
f735ca0f-f910-4990-ae8e-b31e1398e95a | sinian666/codes_102_3 | cpp_副本8/chapter_searching/hashing_search.cpp | /**
* File: hashing_search.cpp
* Created Time: 2022-11-25
* Author: Krahets (<EMAIL>)
*/
#include "../utils/common.hpp"
/* 哈希查找（数组） */
int hashingSearchArray(unordered_map<int, int> map, int target) {
// 哈希表的 key: 目标元素，value: 索引
// 若哈希表中无此 key ，返回 -1
if (map.find(target) == map.end())
return -... | ALGO | 0.999771 | 5.437144 |
5df5c1d0-ad1d-438f-aceb-4926819e69ff | mevivek3620/CSES | DP/Removing_Digits.cpp | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#define ll long long
#define M 1000000007
#define f(i,a,b) for(int i=a;i<b;i++)
#define f1(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define vi vector< int >
#define vl vector< ll >
#define ss second
#define f... | ALGO | 0.999838 | 4.504113 |
aea16fb8-fe2c-48cc-a994-8f62a7dc998c | ishandutta2007/codeforces | temotoloraia/normal/1270/G.cpp | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
//#define ll __int128
#define ll long long
#define LEFT(a) ((a)<<1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a,b) ((a+b)>>1)
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define y1 y122
#pragm... | ALGO | 0.999826 | 3.502181 |
c650ab99-42e4-47da-9412-9611ab7944aa | sahilkhan03/CF-Solutions | codeforces/873/B.cpp | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pb push_back
#define pl pair<ll, ll>
#define vl vector<ll>
#define vi vector<int>
... | ALGO | 0.999945 | 4.185511 |
a1236dbe-8af1-4531-8f04-681fbe2cb7cc | realAYAYA/UnrealEngine-ToonLit | UnrealEngine/Engine/Plugins/Runtime/Metasound/Source/MetasoundStandardNodes/Private/MetasoundLowFrequencyNoise.cpp | #define LOCTEXT_NAMESPACE "MetasoundStandardNodes_LowFrequencyNoise"
// Low Frequency Noise :
// Similar to an Oscillator has Frequency/Phase. At the start of each phase a random value is chosen between (0..1)
// Between each phase the output is an interpolation between the previous and the next value
// The interpola... | TOOL | 0.970401 | 6.693198 |
57414e5e-6262-4fb0-9231-d57298e9c8c8 | fishy15/competitive_programming | online/cf/755/permutation.cpp | #include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <numeric>
#define ll long long
#define ld long double
... | ALGO | 0.999654 | 3.688019 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.