uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
66b8eb79-7c4d-4d37-bf16-2efdbde536fb | shafadila/2311102158_Shafa-Adila | Pertemuan 09/Unguided1.cpp | #include <iostream>
#include <vector>
#include <iomanip> // untuk std::setw
using namespace std;
int main() {
// Meminta pengguna untuk memasukkan jumlah simpul
int jmlSimpul_2311102158;
cout << "Silakan masukan jumlah simpul: ";
cin >> jmlSimpul_2311102158;
// Mendeklarasikan vektor untuk menyim... | ALGO | 0.992946 | 5.363594 |
4990bfe8-2505-435a-9ea8-0f9413f21c4a | MatthewDZane/UnrealQRCodeScanner | Source/ThirdParty/OpenCVLibrary/Hololens/sources/modules/flann/src/flann.cpp | #include "precomp.hpp"
#include "opencv2/flann.hpp"
namespace cvflann
{
/** Global variable indicating the distance metric to be used.
* \deprecated Provided for backward compatibility
*/
flann_distance_t flann_distance_type_ = FLANN_DIST_L2;
flann_distance_t flann_distance_type() { return flann_d... | CONFIG | 0.908505 | 3.668378 |
fb89efb3-4ebb-42b6-b97c-522865f4a4db | ppkicpc/2023-icpc-ppk | CP/Baekjoon/230806 solvedacGrandArena1/psg9790/C.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ip = pair<int, int>;
int n;
deque<ll> arr;
void solve()
{
arr.clear();
cin >> n;
for (int i = 0; i < n; i++)
{
ll val;
cin >> val;
if (arr.size() == 0)
{
... | ALGO | 0.999982 | 4.67837 |
292e69ae-125f-4142-b6bf-6a33c181ab1a | bol-edu/2022-spring-nthu | Lab_C_Vitis_Library/data_compression_Lab/L2/tests/snappy_dualcore_decompress/src/host.cpp | #include "xil_snappy_streaming.hpp"
#include <fstream>
#include <vector>
#include "cmdlineparser.h"
static uint32_t getFileSize(std::ifstream& file) {
file.seekg(0, file.end);
uint32_t file_size = file.tellg();
file.seekg(0, file.beg);
return file_size;
}
void xilValidate(std::string& file_list, std::... | TOOL | 0.887695 | 3.883361 |
8529c2f8-71b8-4c21-8304-762d22d3f0d7 | ArpitaAgrahari/Competitive-Programming | cpp/Segmented-seive.cpp | //segemented sieve is used to find prime numbers in a given range
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int limit=sqrt(n)+1;
vector<int> prime;
vector<int> low;
vector<int> high;
vector<int> mark(limit+1,0);
for(int i=2;i<=limit;i++){
if(mark[i... | ALGO | 0.999979 | 4.582535 |
4a5e9f7f-0d2a-41f5-b05b-9aaa133b490e | jungh150/PS | baekjoon/30987.cpp | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int x1, x2, a, b, c, d, e;
cin >> x1 >> x2 >> a >> b >> c >> d >> e;
b -= d;
c -= e;
int ans = a * (x2 * x2 * x2 - x1 * x1 * x1) / 3 + b * (x2 * x2 - x1 * x1) / 2 + c * (x2 - ... | ALGO | 0.999587 | 3.958526 |
1f9548f4-3d78-4e43-a0a9-88a949087ef8 | ishandutta2007/codeforces | okwedook/normal/1360/B.cpp | #pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("sse4.2")
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <sstream>
#include <deque>
... | ALGO | 0.999821 | 4.572807 |
f5af303c-c975-4497-a4ff-8e7fbad6b350 | DanGorbachenko/programming-2020-autumn | 2020.10.05-Homework-3/Homework 3.cpp | #include<iostream>
#include <cstdlib>
#include<clocale>
#include<ctime>
using namespace std;
void printMenu()
{
cout << "МЕНЮ" << endl;
cout << "0 - Выход из программы" << endl;
cout << "1 - Ввести несколько элемнетов с клавиатуры" << endl;
cout << "2 - Добавить в массив n случайных чисел в промежутке от a до b(n... | TOOL | 0.975824 | 3.328915 |
78dd2560-3f1f-4abb-a297-8b1d125c8ddb | PraveenChoudhary90/code-of-c-plus-plus | patterns/floyd.cpp | #include <iostream>
using namespace std;
int main()
{
int t=1;
for(int r=1;r<=3;r++)
{
for(int c=1;c<=r;c++)
{
cout << t << "\t";
t++;
}
cout << "\n";
}
} | ALGO | 0.999367 | 3.176367 |
b310b1b8-d64f-41a1-b149-f8342aff6b26 | SatDump/SatDump | src-core/common/codings/ldpc/matrix/sparse_matrix.cpp | #include <algorithm>
#include <numeric>
#include <sstream>
#include <ios>
// #include "Tools/Exception/exception.hpp"
#include "sparse_matrix.h"
using namespace codings;
using namespace codings::ldpc;
Sparse_matrix ::Sparse_matrix(const size_t n_rows, const size_t n_cols)
: Matrix(n_rows, n_cols),
row_to_cols(n_... | ALGO | 0.966073 | 5.065413 |
b18de796-e70d-4f8c-8a5f-fb4215f52bb0 | MDATIK-3/CPP-Problem-Solving | beecrowd_1164.cpp | #include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
#define ll long long int
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
using namespace std;
void MUKU()
{
int num;
int sum = 0;
cin >> num;
for (int i = 1; i < num; i++)
{
if (num % i == 0)
... | ALGO | 0.999618 | 5.350931 |
b2083771-56f8-49bf-a6d7-ef7c955f68db | patmarion/boost-build | boost_1_45_0/libs/numeric/ublas/doc/samples/matrix_column.cpp | #include <boost/numeric/ublas/matrix.hpp>
#include <boost/numeric/ublas/matrix_proxy.hpp>
#include <boost/numeric/ublas/io.hpp>
int main () {
using namespace boost::numeric::ublas;
matrix<double> m (3, 3);
for (unsigned j = 0; j < m.size2 (); ++ j) {
matrix_column<matrix<double> > mc (m, j);
... | ALGO | 0.983307 | 3.43838 |
4d1e692f-2ab7-4186-9873-e46fba93f417 | changri53/Alglib | insertsort.cpp | /* 2012--7--2
* Author: light_light
* Description: A Standard implement of insertionsort!
* For exercise!
*/
#include <cstdio>
#include <vector>
#include <ctime>
#include <cstdlib>
#define M 100
using namespace std;
vector< int > data;
void insertsort(vector< int > &a)
{
for(int i=1;i<a.size();i++)
{
... | ALGO | 0.999828 | 3.970409 |
d30fa96a-19d9-46a9-a884-0ff7010200fa | WingerZeng/MyCGLab | thirdparty/opencv-master/modules/calib3d/perf/perf_pnp.cpp | #include "perf_precomp.hpp"
namespace opencv_test
{
using namespace perf;
CV_ENUM(pnpAlgo, SOLVEPNP_ITERATIVE, SOLVEPNP_EPNP, SOLVEPNP_P3P, SOLVEPNP_DLS, SOLVEPNP_UPNP)
typedef tuple<int, pnpAlgo> PointsNum_Algo_t;
typedef perf::TestBaseWithParam<PointsNum_Algo_t> PointsNum_Algo;
typedef perf::TestBaseWithParam<int... | TEST | 0.922093 | 7.081458 |
5cf8502c-4ad6-43e4-bf27-b26506aeb462 | jeanchilger/competitive-programming | uri-problems/Origins/OBI 2010/2381 - Lista de Chamada.cpp | #include <iostream>
#include <string>
using namespace std;
int partition(string arr[], int first, int last) {
int pivot = first;
int low = first + 1;
int high = last;
string temp;
while (low <= high) {
if (arr[low] <= arr[pivot]) {
low++;
} else {
if (arr[h... | ALGO | 0.999962 | 4.777977 |
b3793290-ad91-4069-bbbd-81eb3f1adab7 | ConquerOS/bootable_recovery | updater/blockimg.cpp | #include <ctype.h>
#include <dirent.h>
#include <errno.h>
#include <fcntl.h>
#include <inttypes.h>
#include <linux/fs.h>
#include <pthread.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/ioctl.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <sys/wait.h>
#include ... | TOOL | 0.891278 | 7.503593 |
59b59450-52ea-4ffd-971d-ba2e898c8d0e | gabrielropke/gabrie_mobile_dev | 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 |
5f2620d9-a46a-4664-b936-f2e6f53e567e | ravireddy07/cpp-book | src/Code-Chef/OJUMPS.cpp | #include <cstdio>
int main(){
long long a; scanf("%lld\n", &a);
puts(((a % 6 == 0) || (a % 6 == 1) || (a % 6 == 3)) ? "yes" : "no");
return 0;
}
| ALGO | 0.999787 | 3.576386 |
17da707b-8a08-4d05-ab17-b10478c9ea9e | Feroz455/The-CPP-Standard-Template-Library-STL | STL Bitsets/to_string.cpp | /*
Cpp_STL_Reference
BITESETS
program to_string;
string to_string();
*/
#include<iostream>
#include<algorithm>
#include<bitset>
#include<string>
using namespace std;
//main begin
int main()
{
string bit_string = "110010";
bitset<8> b1(bit_string);
cout << "bl = " << b1 << endl;
//string fro position... | TOOL | 0.860527 | 4.243527 |
fbc4cf4b-0fd4-4798-8f6a-7b58774750e5 | kaushikacharya/leetcode | src/is_subsequence.cpp | // https://leetcode.com/problems/is-subsequence/?tab=Description
// Mar 05, 2017
#include <iostream>
#include <string>
using namespace std;
class Solution {
public:
bool isSubsequence(string s, string t) {
if (t.size() < s.size())
{
return false;
}
unsigned int i = 0;... | ALGO | 0.999447 | 5.505107 |
36de01c8-5791-425b-9b18-21c7cbae8a2b | heyuanYao-pku/Control-VAE | ThirdParty/eigen-3.3.8/demos/mix_eigen_and_c/binary_library.cpp | // This C++ file compiles to binary code that can be linked to by your C program,
// thanks to the extern "C" syntax used in the declarations in binary_library.h.
#include "binary_library.h"
#include <Eigen/Core>
using namespace Eigen;
/************************* pointer conversion methods **************************... | TOOL | 0.864311 | 6.259336 |
e693852e-b566-409e-b343-a34f3e344cac | vwzn/Struktur-Data | tree04.cpp | #include <iostream>
using namespace std;
struct Node
{
int data;
Node *left;
Node *right;
Node(int value)
{
data = value;
left = NULL;
right = NULL;
}
};
void inorderTraversal(Node *root)
{
if (root == NULL)
{
return;
}
// kiri simpul kanan
inord... | ALGO | 0.999853 | 5.61017 |
a104cddc-17a7-4e4a-865a-f72d3e3e5bba | mg-princess/CP2_CSE2035 | hw8-1/main.cpp | #include <iostream>
#include "max.hpp"
#include "sort.hpp"
using namespace std;
// I will fix this file to test your implementation.
template <typename T>
void print_array(T arr[], int n) {
for (int i = 0; i < n; i++) {
cout << arr[i];
if (i == n - 1) {
cout << endl;
} else {
... | ALGO | 0.998484 | 5.057942 |
761c5b37-0bc8-427e-9d06-efb51d66765c | iamsiamhossen/Problem-Solve-2025 | B_Rakhsh_s_Revival.cpp | /**
* Author: iamsiamhossen
* Created: 25-05-2025 13:23:05
**/
#include <bits/stdc++.h>
using namespace std;
// fastread
#define fastread() (ios_base::sync_with_stdio(0), cin.tie(0))
// Shortcut
#define endl "\n"
#define int long long
#define float double
#define all(X) (X).begin(), (X).end()
#define Reverse(X) reve... | ALGO | 0.999918 | 4.423038 |
3913b358-f1e9-4d43-9477-deca8bffa3e2 | tushar-3549/Problem_Solving | Codeforces/1555A - PizzaForces.cpp | /* بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم
Author: Md Tushar Ahmed
From : Dhaka , Bangladesh
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/p... | ALGO | 0.999918 | 4.817809 |
ffba7099-8d55-4d91-8b67-5ee7724edd45 | rsarnath/CSCI201Assignments | SampleCode/ListArrayClasses/angleList.cpp | // compile with "g++ -c angleList.cpp"
// i.e., compile without linking. This will
// create an executable file angleList.o
#include <cstdlib>
#include "angleList.h"
bool angleList::addAngle(angle a)
{
if (count >= maxNum)
{
// we have run out of space
return false;
}
else
{
... | TOOL | 0.853993 | 4.061759 |
2311ec5b-84df-4604-8c53-bf8aa0311925 | BreakingLead/cpp-learning | luogu/beginning-6-function/P5743.cpp | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n;
int a=1;
scanf("%d",&n);
for(int i=1; i < n; i++){
a=(a+1)*2;
}
printf("%d\n",a);
return 0;
}
| ALGO | 0.999419 | 3.135508 |
674ac26a-8213-4f30-b798-6d128e9d48be | priyanshimaurya/Linklist-solutions | insertatlastofNode.cpp | #include<iostream>
using namespace std;
class Node{
public:
int val;
Node* next;
Node(int data){
val=data;
next=NULL;
}
};
class circularll{
public:
Node* head;
circularll(){
head=NULL;
}
void display(){
if (head == NULL) {
cout << ... | ALGO | 0.997276 | 4.462102 |
a7c3f737-b63c-417c-9033-dfa13f34fa73 | niko117/d | src/cryptonote_basic/difficulty.cpp | #include <algorithm>
#include <cassert>
#include <cstddef>
#include <cstdint>
#include <vector>
//#include "include_base_utils.h"
#include "misc_language.h"
#include "common/int-util.h"
#include "crypto/hash.h"
#include "cryptonote_config.h"
#include "difficulty.h"
#include "boost/math/special_functions/round.hpp"
#u... | ALGO | 0.999525 | 6.326157 |
f6955761-dadc-472c-886a-555c3b3e784d | raincross7/code-similarity | codes/train_code/problem007/problem007_398.cpp | #include<iostream>
#include<map>
#include<set>
#include<list>
#include<stack>
#include<queue>
#include<cmath>
#include<string>
#include<time.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<algorithm>
typedef long long ll;
const int N = 1e7;
using namespace std;
int main()
{
ll a[200005];
ll num[... | ALGO | 0.999911 | 3.430384 |
b7ad1d17-8c97-41a2-99ae-a88871d9a6fb | SZyooo/PhysicsEngine | PhysicsEngine/ParticleSpring.cpp | #include "ParticleSpring.h"
#include "Vector3.h"
#include "Particle.h"
#include<cmath>
YoungEngine::ParticleSpring::ParticleSpring(Particle* p1, float constant, float rLen)
:particle(p1),springConstant(constant),restLength(rLen)
{
}
void YoungEngine::ParticleSpring::updateForce(Particle& p, float duration)
{
Vector... | ALGO | 0.974302 | 5.547993 |
ebb60b9d-e06b-4f78-9745-b937ac4629ee | haruboring/atcoder | abc412/a/main.cpp | #include "atcoder/all"
#include "bits/stdc++.h"
#define int long long
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repp(i, m, n) for (int i = m; i < (int)(n); i++)
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
signed main() {
int N;
cin ... | ALGO | 0.999759 | 4.044445 |
a9bc827d-f4ab-4c8d-b849-4abf3b74512c | Asif267-cse/C-plus-plus-and-DSA | C++ Basics/conditional_statements.cpp | #include <iostream>
using namespace std;
int main() {
int healthPoints = 50;
if (healthPoints > 0) {
cout << "Keep fighting!" << endl;
} else {
cout << "Game Over!" << endl;
}
char weapon = 's'; // s = sword, b = bow, m = magic
switch (weapon) {
case
| TOOL | 0.910204 | 3.782678 |
4c1dc4b6-2c8d-4d94-8afb-6ac4c2f16923 | abih-03/Assignment | Module-6/q11.cpp | /*
Write a program to swap the two numbers using friend function
*/
#include <iostream>
using namespace std;
class Number
{
private:
int a, b;
public:
Number(int x, int y) : a(x), b(y) {}
friend void swapNumbers(Number &num);
void display() const
{
cout << "a = " << a << ", b = " << b ... | ALGO | 0.993968 | 6.619868 |
7f6994a5-360b-4ad8-8a02-4fcb6a4ef628 | jun-pac/PS | 240705/5set/B.cpp |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define cediv(a,b) ((a)%(b)==0?((a)/(b)):((a)/(b))+1)
#define rng(i,a,b) for(int i=int(a);i<=int(b);i++)
#define rep(i,b) rng(i,0,b-1)
#define gnr(i,b,a) for(int i=int(b);i>=int(a);i--)
#define per(i,b) gnr(i,b-1,0)
#define pb push_back... | ALGO | 0.999982 | 4.21225 |
b5e32753-16db-4fa0-b945-24971f077a46 | Gal2o/Algo_Study | AlgoStudy/1157 단어 공부.cpp | //#include <iostream>
//#include <string>
//
//using namespace std;
//string s;
//int chk[30], mx;
//
//int main() {
// cin >> s;
//
// for (int i = 0; i < s.size(); i++) {
// s[i] = toupper(s[i]);
//
// chk[s[i] - 'A']++;
//
// mx = max(chk[s[i] - 'A'], mx);
// }
//
// int cnt = 0, idx... | ALGO | 0.999993 | 3.994147 |
06bc9067-314b-42fb-a8fb-e95bb6099c0b | Harshdeep1372/C-OOPS | Assignment Module 4 C++/Module 4.2 Programing with C++/9. Matrix addition using oprator overloading.cpp | // Write a Program of Two 1D Matrix Addition using Operator Overloading
#include<iostream>
using namespace std;
class Matrix
{
int a[5],c[5];
int b[5];
int i;
public:
void accept();
void display();
void operator +(Matrix obj);
};
void Matrix :: accept()
{
cout<<"Enter array element \n";
for(i=0;i<5;i++)
... | ALGO | 0.994701 | 5.041584 |
cb4593ad-90e8-4cfc-92e6-5139ad0f55e5 | Shaun103/C_Plus_Plus | C++_CPPCON_2017/CPPCON_Classes/main.cpp | #include <iostream>
#include <cmath>
#include <tuple>
// #include "gsl\gsl.h" //- pointer
using namespace std;
////////////////////////////
// Class
class Simple {
private:
int a = -1;
int b = -1;
int c = -1;
int d = -1;
public:
Simple() = default; // "default" instea... | TOOL | 0.876442 | 4.969476 |
31a26aa6-7147-4619-a9b8-02e2267e647a | Rishoven-jasuja/DSA-practice | 30_valid_palindrome.cpp | #include<iostream>
#include<cstring>
#include<string>
using namespace std;
int main(){
char str[6]="kanak";
int st=0;
int end=strlen(str)-1;
bool ans=true;
while(st<=end){
if(str[st]==str[end]){
st++;
end--;
}
else{
ans=false;
break;
}
}
if(ans){
cout<<"the s... | ALGO | 0.999874 | 3.246492 |
658f1dd2-6905-41c4-9ccd-94013fa41d72 | onkargalande/Leetcode-Practice-Solutions | 104-maximum-depth-of-binary-tree/maximum-depth-of-binary-tree.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999787 | 6.344861 |
b9339158-e19e-473f-ac66-fede6ead6499 | yanyun888/Study | STL/day05/sort.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template<typename IT>
void print (IT begin, IT end) {
while (begin != end)
cout << *begin++ << ' ';
cout << endl;
}
class Student {
public:
Student (string const& name, int age) :
m_name (name), m_age (age) {}
bool operator< (Studen... | ALGO | 0.997295 | 4.341277 |
152b0c2a-9d06-4b35-a7f2-593843f1fee4 | fuchsto/ti-oam-experiments | minimal/minimal_main.cpp |
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <cstring>
#include <limits>
#include <vector>
#include <algorithm>
#include <numeric>
#include <future>
#include <omp.h>
#include <oam/oam_types.h>
#include <oam/oam_vsmem.h>
#include <oam/oam_time.h>
#include <oam/oam_task.h>
#include <oam/oam_comm.... | TOOL | 0.951244 | 5.44065 |
c71a79f6-70ec-443d-a31b-20967efdc312 | Masahiro-Obuchi/Atcoder | ABC/ABC146/ABC146C_correct.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll A, B, X;
cin >> A >> B >> X;
ll l = 0, r = 1000000001; // l : o, r : x
auto keta = [&](ll c) {
int res = 0;
while (c > 0)
{
c /= 10;
res++;
}
return res;
};
auto f = [&](ll c) { // ラムダ式 とりあえず... | ALGO | 0.999844 | 3.915663 |
e4f423cd-9330-4469-8ffe-510a3bc15210 | Brandon-Winkler/LeetCode | C++/Arrays/Easy/RemoveDuplicatesFromSortedArray.cpp | #include<vector>
#include<iostream>
using namespace std;
class Solution {
public:
void removeDuplicates(vector<int>& nums) {
int k = 1; // set variable to track index of duplicates
int prev = nums[0]; // set previous variable to first element in vector
... | ALGO | 0.999184 | 6.051752 |
e35483ab-0472-4b63-a61e-214aed94d410 | 937miaow/Ecosystem-Homework | sim/lion.cpp | #include "lion.h"
#include "empty.h"
#include "rabbit.h"
#include <cstdlib>
#include <ctime>
using namespace std;
State LionUnit::getState()
{
return LION;
}
State LionUnit::nextState()
{
round();
if (age > DLION) // 年龄大于最大年龄，返回EMPTY
{
return EMPTY;
}
else if (sum[LION] > TMLION) // 周... | ALGO | 0.999697 | 4.246544 |
d8e6145c-ec3c-4126-9bcf-b0a9122260d6 | Vishu-hp/FJP-DSA | Level-1/Graph/printAllPaths.cpp | #include<bits/stdc++.h>
using namespace std;
class Edge {
public:
int src;
int nbr;
int wt;
Edge(int src, int nbr, int wt){
this->src = src;
this->nbr = nbr;
this->wt = wt;
}
};
void printAllPaths(vector<Edge>*graph,vector<bool>&vis... | ALGO | 0.999982 | 4.312297 |
52c80224-9fef-496c-8506-edbcb4317d4b | AreaROM/android_external_skia | src/utils/SkDashPath.cpp | #include "SkDashPathPriv.h"
#include "SkPathMeasure.h"
static inline int is_even(int x) {
return (~x) << 31;
}
static SkScalar find_first_interval(const SkScalar intervals[], SkScalar phase,
int32_t* index, int count) {
for (int i = 0; i < count; ++i) {
if (phase > ... | TOOL | 0.895856 | 7.360268 |
0fc67f82-9fcf-4712-bc4d-a4c36c06a431 | Shahabkhan99/device_oneplus_onyx | gps/utils/loc_misc_utils.cpp | #include <stdio.h>
#include <string.h>
#include <log_util.h>
#include <loc_misc_utils.h>
#include <ctype.h>
#define LOG_NDDEBUG 0
#define LOG_TAG "LocSvc_misc_utils"
int loc_util_split_string(char *raw_string, char **split_strings_ptr,
int max_num_substrings, char delimiter)
{
int raw_st... | TOOL | 0.973205 | 5.380703 |
91403746-aa75-43c9-9821-6ffe3aff833e | wellvolks/Problemas | Uri/Geral/uri1449.cpp | #include <iostream>
#include <vector>
#include <tr1/unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <sys/timeb.h>
#define For(i, n) for(int i = 0; i < n; i++)
#define FOR(i, r, n) for(int i = r; i < n; i++)
#define MAXV 10010
#defin... | ALGO | 0.997641 | 3.901373 |
ecc485da-85e0-4339-8e79-389b57e96798 | outman119/leetcode | scramblestring.cpp | class Solution {
public:
bool isScramble(string s1, string s2) {
int len1 = s1.length();
int len2 = s2.length();
if (len1 != len2)
{
return false;
}
if (len1 == 1)
{
return s1 == s2;
}
string str1 = s1;
string st... | ALGO | 0.999991 | 6.169403 |
9e3715b5-8405-4410-9d75-d6a289ce2ee9 | patee1811/Mysources | BT01/Bai 18.cpp | #include<bits/stdc++.h>
using namespace std;
int main ()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << sqrt((a - c) * (a - c) + (b - d) * (b - d));
}
| ALGO | 0.999862 | 3.428798 |
203e2259-0544-4bc9-8173-d7435e122ad2 | jevinskie/llvm-project-embedded-library-in-process | libc/src/math/generic/lrintl.cpp | #include "src/math/lrintl.h"
#include "src/__support/FPUtil/NearestIntegerOperations.h"
#include "src/__support/common.h"
#include "src/__support/macros/config.h"
namespace LIBC_NAMESPACE_DECL {
LLVM_LIBC_FUNCTION(long, lrintl, (long double x)) {
return fputil::round_to_signed_integer_using_current_rounding_mode<
... | TOOL | 0.949674 | 5.982041 |
c7bca982-d8a7-422b-86db-d5d9263c6db0 | Varshini11113/TechDose_Training | Leetcode_PracticeProblems/496-next-greater-element-i/next-greater-element-i.cpp | class Solution {
public:
vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
stack<int>s;
int n = nums2.size();
unordered_map<int,int>nge;
for(int i = n-1; i>=0; i--){
while(!s.empty() && s.top() < nums2[i]){
s.pop();
}
... | ALGO | 0.999924 | 5.793157 |
b9698d6f-b670-489a-8efb-b2f5b67f42c8 | MishaniaED/Institute | 3rd semester/Operating systems and computer architecture/Lab4/client_task2.cpp | #include<iostream>
#include<math.h>
#include<stdlib.h>
#include<unistd.h>
#include<stdio.h>
#include<sys/ipc.h>
#include<sys/msg.h>
#include<cstring>
using namespace std;
#ifndef MSGMAX
#define MSGMAX 1024
#endif
typedef struct{ // структура для учета компл корней
double first_compl;
double second_compl;
}Elem;
ty... | ALGO | 0.99635 | 3.012063 |
9be6090c-7ecb-4036-b79b-9073cf338b9c | leins275/bool-functions | src/bool_func.cpp | // leins, 02.06.2018
#include <iostream>
#include <cstdlib>
#include "bool_func.h"
#include "rdnf.h"
using namespace std;
// allocate memory, used in constructors only
void bool_func_cl::init(uint n)
{
uint m = (1 << n);
numOfVar = n;
TVT = new bool[m];
for (uint i = 0 ; i < m; i++)
TVT[i] = 0x0;
ZheP ... | ALGO | 0.996406 | 4.401019 |
5eb14b88-bbef-4756-b418-f5d6eefb5849 | shuhanmirza/competitive-programming-practice | uva/c_cpp/uva-12289.cpp | #include <cstdio>
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
int main()
{
string input;
int len,i,cas,T;
cin >> T;
while(T--)
{
cin >> input;
len = input.size();
if( len > 3 ) cout << "3\n";
else if( (input[0] == 't' && input[1... | ALGO | 0.99971 | 3.738644 |
3da0b3db-4c93-472b-a644-d01207a673d9 | VipulChauhan89/Leetcode-solutions | Array/1502-Can_Make_Arithmetic_Progression_From_Sequence.cpp | class Solution {
public:
bool canMakeArithmeticProgression(vector<int> &arr)
{
sort(arr.begin(),arr.end());
int diff=arr[1]-arr[0];
for(int i=1;i<arr.size()-1;i++)
{
if(arr[i+1]-arr[i]!=diff)
{
return false;
}
}
... | ALGO | 0.999862 | 5.53707 |
0b767e63-cc73-48d5-8404-6f7d78739cc7 | hemoye/ACM | C_C++/算法学习/算法竞赛入门经典——训练指南/第一章_算法设计基础/算法专题/吉首大学第八届程序设计大赛解题报告/I_素数密度/code.cpp | #include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 10000000;
bool f[100009], ff[MAXN+4];
int main( int agrc, char *agrv[] )
{
#ifndef ONLINE_JUDGE
freopen( "test.in", "r", stdin );
#endif
unsigned L, R;
int n(47004);
memset( f, true, sizeof(... | ALGO | 0.999801 | 3.66493 |
d010a284-5d6d-4598-b960-6216ae653627 | arras-energy/gridlabd | module/market/curve.cpp | #include "curve.h"
//////////////////////////////////////////////////////////////////////////
// IMPLEMENTATION OF BID CURVE
//////////////////////////////////////////////////////////////////////////
curve::curve(void)
{
len = 0;
bids = NULL;
keys = NULL;
bid_ids = NULL;
n_bids = 0;
total = 0;
}
curve::~curve(... | ALGO | 0.999621 | 6.657231 |
28e2ca46-ff43-4857-b5ca-865d052f2ebc | ThiagoCosta360/exercises | uri/1006.cpp | #include <iostream>
using namespace std;
int main()
{
double n1, n2, n3;
scanf("%lf", &n1);
scanf("%lf", &n2);
scanf("%lf", &n3);
printf("MEDIA = %.1lf\n", ((2 * n1) + (3 * n2) + (5 * n3)) / 10);
return 0;
} | ALGO | 0.999424 | 4.135737 |
1c3898ac-fe80-416a-ab64-5e8cce6a420d | ChinhNgo02/CTDL-GT | C++/demphantugiongnhau.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int test;
cin >> test;
while(test--){
int n;
cin >> n;
int a[n][n];
multiset< int >v;
for(int i = 0; i < n;i++){
set< int > s;
for(int j = 0; j < n;j++){
cin >> a[i][j];... | ALGO | 0.999743 | 3.815695 |
d75e5aae-8fdc-4524-832c-1761810818ca | tpn/cuda-samples | v10.1/0_Simple/matrixMulDrv/matrixMulDrv.cpp | /* Matrix multiplication: C = A * B.
* Host code.
*
* This sample implements matrix multiplication using the CUDA driver API.
* It has been written for clarity of exposition to illustrate various CUDA
* programming principles, not with the goal of providing the most
* performant generic kernel for matrix multipli... | ALGO | 0.963597 | 5.764362 |
f9d5fc19-52b9-4eab-a8a8-dcf63f843a2a | mairohanhoon/CodeForces-Files | 1931_D.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
int n, x, y;
cin >> n >> x >> y;
vector<int> arr(n);
long long count = 0;
map<pair<int, int>, long long> hashh;
for(int i=0; i<n; i++) cin >> arr[i];
for(int i=0; i... | ALGO | 0.999605 | 3.394309 |
29591a2a-0376-4c85-aeb7-fd80bd2de002 | ishandutta2007/codeforces | emilan/normal/1477/B.cpp | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
struct lazy_seg {
int n;
vector<int> a, lz, len;
lazy_seg(const vector<int> &_a) :
n(_a.size()), a(n << 1), lz(n, -1), len(n << 1, 1) {
copy(_a.begin(), _a.end(), a.begin() + n);
for (int i = n - 1; i;... | ALGO | 0.999959 | 4.390286 |
660b5d89-596d-4b21-b204-b5542ac60cf4 | alim-buet/CPCodes | Codes/C_Good_Subarrays.cpp | #include <bits/stdc++.h>
using namespace std;
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define vi vector<int>
#define ll long long
#define vl vector<long long>
#define fori for (int i = 0; i < n; i++) { cin >> arr[i]; }
void solve() {
int n;cin >> n;
string... | ALGO | 0.999861 | 4.905912 |
0411d6cd-04ba-4e28-a24d-34fbe2c67b97 | Luka-D03/Projects | 2. letnik/C++/vaje test/prva_A.cpp | #include <iostream>
#include <cmath>
using namespace std;
/*. a)Zapii program, ki izrauna vrednosti funkcije y= 3x^3-2x+3 za vsa cela tevila med 12 in 112.
b) Izraunane vrednosti naj sproti shranjuje v tabelo z imenom vrednosti.
c) Program naj izrauna in izpie najvejo vrednost izraunanih vrednosti v tabeli vrednosti.
... | ALGO | 0.999775 | 4.123544 |
5fda803b-ed49-45e0-bf0f-aa28b17177f2 | antiauto/llvm-project | llvm/lib/Transforms/Utils/DemoteRegToStack.cpp | #include "llvm/ADT/DenseMap.h"
#include "llvm/Analysis/CFG.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/Instructions.h"
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
#include "llvm/Transforms/Utils/Local.h"
using namespace llvm;
/// DemoteRegToStack - This function takes a virtual register computed by an
//... | TOOL | 0.975434 | 7.406528 |
dfe2be4a-cd5b-4663-ac67-683158c7ebef | moodgalal/problem-solving-with-c- | Arrival of the General/main.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
/* int n, maxi=0, mini=0,moves=0;
cin>>n;
int arr[n];
for(int i=0; i<n; i++)
{
cin>>arr[i];
}
int maxHeight=arr[0]; //Finding the maximum number index
for(int i=1; i<n; i++)
{
if(maxHeight<=arr[i])
{
... | ALGO | 0.999579 | 3.798468 |
8a28860e-0dad-4983-b77e-be3c8a58f3a4 | abhishek5897/DAAPracticalFile | greedy_min.cpp | #include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
class Graph
{
int n;
int no_edg;
int edges[100][4],sets[100][10],top[100];
public:
int input();
void initialize_span_t();
void sortedges();
void kruskal_algo();
int find_node(int);
};
int Graph::input()
{
... | ALGO | 0.999893 | 3.89931 |
8b0b6b49-7527-4550-8a63-e436ef4ff650 | LLNL/psuade | Src/FuncApprox/SelectiveRegression.cpp | #define PABS(x) (((x) > 0.0) ? (x) : -(x))
extern "C" {
void dgesvd_(char *, char *, int *, int *, double *, int *, double *,
double *, int *, double *, int *, double *, int *, int *);
}
// ************************************************************************
// Constructor
// ------------------... | ALGO | 0.921091 | 6.334544 |
61d188d9-57b6-4127-b628-f8d9229767c3 | linchik-l/Lesson52RevisionSolution | Task05/logic.cpp | // [The Last local maxima]
// Последний локальных максимум
//
// Дан вектор целочисленных значений. Необходимо разработать
// функцию(или программу), которая находит значение последнего
// локального максимума вектора. Если вектор не содержит локальных
// максимумов или вектор задан некорректно, то функция(программа)
/... | ALGO | 0.999795 | 5.314703 |
4c3c08e5-f7d2-42ad-a6bb-626c722410e3 | GabrieleRolleri/competitive_programming | training-olinfo/checksum/main.cpp | #include <bits/stdc++.h>
#define CYC(i, a, b) for(int i=a; i<b; i++)
#define CYCI(i, a, b) for(auto i=a; i!=b; i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
void inizializza(int, int);
int controlla(int);
vi fattori;
queue<int> fattoriQ;
... | ALGO | 0.999917 | 3.770427 |
89ec6880-8e9f-4e38-bacc-c236647510ff | liuzhaoze/cpp-primer-answer | Chapter6_函数/src/quiz_6.12.cpp | /**
* 改写练习 6.10 的程序，使用引用而非指针交换两个整数的值。
* 你觉得哪种方法更易于使用呢？为什么？
* 引用更易于使用。因为其不需要对指针解引用。
*/
#include <iostream>
using std::cout;
using std::endl;
void swap_two_int(int &p, int &q)
{
int temp;
temp = p;
p = q;
q = temp;
return;
}
int main()
{
int a = 5, b = 99;
cout << "a = " << a << ", b... | TOOL | 0.95897 | 4.5756 |
e0cfce1f-37f4-4caf-805e-8954070683a7 | Gaurav237/CodeForceProblem | 1742C.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define rep(i , j , n) for(ll i = j ; i <= n ; i++)
#define per(i , j , n) for(ll i = j ; i >= n ; i--)
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector... | ALGO | 0.997851 | 4.703712 |
5893d482-3d46-4860-83b2-5c2e2c7f9e93 | Yang2096/snippet | leetcode/23.cpp | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
ListNode* mergeKLists(vector<ListNode*>& lists) {
if(lists.size() == 1) return lists[0];
auto cmp ... | ALGO | 0.999845 | 5.544116 |
deafd085-8b67-4906-a8f9-c1ff474d1212 | akssingh0102/Workspace | DSA and Competitive Programming/CP_CipherSchools/2021 June/Assignment -2 (Recursion & Backtracking)/9.cpp | #include <bits/stdc++.h>
using namespace std;
#define UNASSIGNED 0
#define N 9
bool FindUnassignedLocation(int grid[N][N],
int& row, int& col);
bool isSafe(int grid[N][N], int row,
int col, int num);
bool SolveSudoku(int grid[N][N])
{
int row, col;
if (!FindUnassignedLocation(grid, row, col))
return ... | ALGO | 0.999726 | 6.401458 |
23cd869c-dd08-403a-aacc-a5376990a521 | SeacenLiu/LeetCode | 88. 合并两个有序数组/main.cpp | /**
给定两个有序整数数组 nums1 和 nums2，将 nums2 合并到 nums1 中，使得 num1 成为一个有序数组。
说明:
初始化 nums1 和 nums2 的元素数量分别为 m 和 n。
你可以假设 nums1 有足够的空间（空间大小大于或等于 m + n）来保存 nums2 中的元素。
示例:
输入:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
输出: [1,2,2,3,5,6]
*/
/**
- 反过来想!!!
- 从后面开始比对，选最大！
*/
#include <iostream>
#i... | ALGO | 0.999985 | 5.294043 |
508d5e4e-b046-495d-97a2-bf3b580505c9 | rishab95/Data-Structures-and-Algorithms | Problems/max_digit_prime.cpp | #include<iostream>
#include<cstring>
using namespace std;
void seive(bool prime[], int n)
{
for(int p=2;p*p<=n;p++)
{
if(prime[p] == false)
{
for(int i=p*2;i<=n;i+=p)
{
prime[i] = true;
}
}
}
}
int ansdigit(int l, int r)
{
bool prime[r+1];
memset(prime, false, sizeof(prime));
seive(prime, ... | ALGO | 0.999254 | 3.720461 |
b9e32239-2e75-4ac3-bfa1-034f385c41ae | williamdewitt95/B-Tree | createBT.cpp |
#include "album.h"
#include "btree.hpp"
#include <stdio.h>
#ifndef createBT
#define createBT
bool doesExist(char const name[81]){//check if the file or directory exists
std::ifstream tester(name);
if(tester.good())
return true;
return false;
}
int main(int c, char * v[]){
char helpStr[] = "Usage: createBT fil... | TOOL | 0.982354 | 3.977637 |
df0a62f4-8da9-43da-aa09-3de6c9f085eb | ishandutta2007/codeforces | hanaelhami/normal/1129/A1.cpp | #include<bits/stdc++.h>
#define rep(i,l,r) for(int i=l;i<r;i++)
#define put(x) cout<<#x<<" = "<<x<<endl;
#define X first
#define Y second
#define pb push_back
using namespace std;
typedef long long num;
const int maxn=1e5+10,inf=1e9+10;
int n,m,ans,mnn[maxn];
vector<int> v[maxn];
inline int dis(int i,int j){
ret... | ALGO | 0.999793 | 3.263457 |
8e67c08c-f3e9-4623-b162-38d11338a271 | antusaha970/My-source-code-DSA | loveBabbar/isSortedByRec.cpp | #include<iostream>
using namespace std;
void printArr(int arr[],int n){
for (int i = 0; i < n; i++)
{
cout<<arr[i]<<" ";
}
}
bool isSorted(int arr[],int size){
// Base Case
if(size ==0 || size==1)
return true;
// procession
if(arr[0] > arr[1])
return false;
... | ALGO | 0.999701 | 5.296603 |
9ecde994-aa69-42a9-bf47-54458827b50a | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_11104_14.cpp | #include <bits/stdc++.h>
using namespace std;
int nodes, edges, counter, counter2;
vector<int> adj[100001];
set<int> adjset[100001];
int seen[100001];
int low[100001];
int depth[100001];
bool iscut[100001];
set<int> group[100001];
int dfn[100001];
stack<pair<int, int> > s;
set<pair<int, int> > ins;
bool isOld[100001];
... | ALGO | 0.999921 | 4.13856 |
a2015a03-006d-469e-aabb-a50d8e0fe24e | CamilaMusina/ntr-start | week3/hw1_week3.cpp | #include <iostream>
#include <vector>
#include <memory>
#include <array>
#include <variant>
#include <unordered_map>
#include <cctype>
// (1 + 2) * 3 / 4 + 5 * (6 - 7)
// 1. Токенизация
// 2. Парсер (построение дерева разбора выражения)
// +, -, *, /, %
struct OpeningBracket {};
struct ClosingBracket {};
struct N... | ALGO | 0.994974 | 5.915482 |
0d3e6036-b437-43a5-901c-6f05cf3a7f5e | ayush26kr/Data-Structure | Hashing/Open Hashing/Chaining.cpp | #include <iostream>
using namespace std;
// Linked List node
class Node{
public:
int data;
Node* next;
};
// Hash Table
class HashTable{
public:
Node** HT;
HashTable();
int hash(int key);
void Insert(int key);
int Search(int key);
~HashTable();
};
HashTable::HashTable() {
HT = new Node* [10];
for (int i=... | ALGO | 0.999936 | 5.432843 |
b7f67764-e417-4bce-97e6-35b9838081fd | Maksasj/megaboost | libs/math/example/lambert_w_precision_example.cpp | //! Lambert W examples of controlling precision
// #define BOOST_MATH_INSTRUMENT_LAMBERT_W // #define only for (much) diagnostic output.
#include <boost/config.hpp> // for BOOST_PLATFORM, BOOST_COMPILER, BOOST_STDLIB ...
#include <boost/version.hpp> // for BOOST_MSVC versions.
#include <boost/cstdint.hpp>
#includ... | ALGO | 0.970487 | 5.610013 |
55815e81-9e7e-431e-a613-6694d1909981 | AakashRanjan001/leetcodebros | 2894-divisible-and-non-divisible-sums-difference/2894-divisible-and-non-divisible-sums-difference.cpp | class Solution {
public:
int differenceOfSums(int n, int m) {
int sum_n=0,sum_m =0;
for(int i=1;i<=n;i++){
if(i%m!=0){
sum_n+=i;
}
else{
sum_m+=i;
}
}
return sum_n - sum_m;
}
}; | ALGO | 0.999991 | 5.674906 |
37f1a53e-97a5-4227-8d7b-ad42e76921ac | arkampatel99/CPP-Programming | Program208.cpp | #include<iostream>
using namespace std;
// Input : 7985674
// Output : 4 occurs 1 times
// 5 occurs 1 times
// 6 occurs 1 times
// 7 occurs 2 times
// 8 occurs 1 times
// 9 occurs 1 times
class DigitX
{
public:
int iNo;
DigitX(... | ALGO | 0.999727 | 4.542977 |
43ee1275-c1d1-4751-aaa6-32ddf250da3e | ishandutta2007/codeforces | ljecll/normal/1010/D.cpp | /*
PROG: source
LANG: C++11
_____
.' '.
/ 0 0 \
| ^ |
| \ / |
\ '---' /
'._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
struct chash
{
int operator()(int x) const
{
... | ALGO | 0.999724 | 4.628298 |
b370a473-b8bf-4777-94ca-23e1943a9a1d | jubayertalha/Problem-Solving | Contests/AIUB/ICPC TPC1 22/H_DigitCounting.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl "\n"
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define RFOR(i,n) for(ll i=n-1;i>=0;i--)
#define NFOR(i,n) for(ll i=1;i<=n;i++)
int main(){
B... | ALGO | 0.999812 | 3.86071 |
65ec86b0-cf43-4278-a3f2-71f3ae13bc49 | Abdul-Rahimm/Codeforces | C_Ski_Resort.cpp | // بِسْمِ اللهِ الرَّحْمٰنِ الرَّحِيْمِ
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define pb push_back
#defin... | ALGO | 0.999855 | 3.706682 |
d11ed779-6b6e-4485-bb88-6ecb1999cd9f | Hyevvy/algorithm | BOJ/c++/boj16677 악마게임.cpp | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
string gbs;
int ssa[101];
string s;
int isIncluded(){
int res = 0;
for(int i=0; i<gbs.size(); i++){
for(int j=0; j<s.size(); j++){
if(gbs[i] == s[j]) {
s[j] = s[j] + ('a' - 'A');... | ALGO | 0.999962 | 5.138484 |
68904b90-9b1a-415c-b52f-e9d648705a61 | saranyamaity2000/Easy-Solutions | AllPossibleFBTree_DP.cpp | unordered_map< int , vector<TreeNode*> > dp ;
class Solution {
public:
vector<TreeNode*> allPossibleFBT(int n) {
if( dp.find(n) != dp.end() ) return dp[n] ;
vector<TreeNode*> ans ;
if( n == 1) {
ans.push_back(new TreeNode(0)) ;
}
else if(n ... | ALGO | 0.999939 | 5.873867 |
7c6bd385-9774-49d0-9cbc-55df4d5a68c3 | HargovindArora/Programming | Problems/even_after_odd.cpp | #include<bits/stdc++.h>
#define endl '\n'
using namespace std;
class node{
public:
int data;
node *next;
node(int data){
this->data = data;
next = NULL;
}
};
void insertAtTail(node *&head, int data){
if(head==NULL){
head = new node(data);
return;
}
node *... | ALGO | 0.999927 | 4.768319 |
76aadc0a-c694-41e8-9644-c97ca4fc87f7 | Rajat775/Leetcode | 0215-kth-largest-element-in-an-array/0215-kth-largest-element-in-an-array.cpp | class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
priority_queue<int,vector<int>,greater<int>>q;
for(int i=0;i<k;i++)
q.push(nums[i]);
for(int i=k;i<nums.size();i++)
{
if(nums[i]>q.top())
{ q.pop();
q.push(n... | ALGO | 0.999903 | 4.93151 |
18e4c030-42e4-4385-a551-3490fdbc10df | Sean0628/competitive_programming | atcoder/abc/abc031/c.cpp | #include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define out(arg) cout << (arg) << endl
using ll = long long;
using P = pair<int, int>;
using mint = modint1000000007;
void chmax(ll& a, ll b) { a = max(a, b); }
void chmin(ll& a,... | ALGO | 0.999985 | 4.710938 |
331c4450-89eb-48e9-90e0-dcc71e32eef5 | raincross7/code-similarity | codes/train_code/problem168/problem168_315.cpp | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | ALGO | 0.999961 | 4.023072 |
cd803263-3dcb-4364-b84e-c7f0cf0e870e | H-Shen/MyCodeCollection | 校招Collection/Others/E_Fibonacci.cpp | // https://ac.nowcoder.com/acm/contest/981/E
#include <bits/stdc++.h>
// matrixMul % m
template<typename T>
inline static
std::vector<std::vector<T> >
matrixMul(const std::vector<std::vector<T> > &A, const std::vector<std::vector<T> > &B, const T &mod) {
// Case 1:
if (A.empty() || B.empty() || A.at(0).empty... | ALGO | 0.99997 | 4.785516 |
d1ae141f-8590-45a4-8366-68a53d208c0b | romeorizzi/portafoglioVoti_public | Algoritmi/2019-06-25/all-CMS-submissions/2019-06-25.10:52:02.571910.VR439370.biancaneve.cpp | /**
* user: VR439370
* fname: FERRO
* lname: GIACOMO
* task: biancaneve
* score: 0.0
* date: 2019-06-25 10:52:02.571910
*/
#include<stdio.h>
void comando1(int altezze[], int numNani, int pos1, int pos2 );
void comando2(int altezze[], int numNani, int inf, int sup);
int main(){
int numNani=0;
int numRichie... | ALGO | 0.999914 | 3.245052 |
b6aa2eae-c03c-4244-be11-3c8a1f6bf5a7 | deeksha04-alt/DSA | LeetCode_DCC/Feb_DCC/18_Meeting_Rooms_III.cpp | #include<bits/stdc++.h>
using namespace std;
/*
Logic:
(1) Sort the meetings array to get meetings list in increasing order of their occurrence
(2) Maintain a vector (track) of size n, where n = number of rooms , and initialise it with 0, signifying all rooms are free
(3) Declare a set freeRoom, that has the room num... | ALGO | 0.999984 | 5.970466 |
46ca3810-188d-4098-8267-ac1a834323df | tools4BCI/SignalServer | extern/include/filterTools/spuc/comm/quad_data.cpp | #include "quad_data.h"
namespace SPUC {
quad_data::quad_data(int total_over) : rcfir(12*total_over+1), pn_i(0x006d, 63, -1),
pn_q(0x074d, 1023, -1), data(1,1), interp(4) {
void root_raised_cosine(fir<complex<double> >& rcfir, double alpha, int rate);
over = total_over;
rcfir.set_rate(over);
rcfir.set_automati... | ALGO | 0.95828 | 4.906441 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.