uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
391619c0-1ca7-4a01-96d1-10f031adb562 | aminjonshermatov/competitive_programming | atcoder/abc/403/src/E.cpp | #include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.hpp"
#else
#define dbg(...) 42
#endif
constexpr void Scan(auto&& ... args) noexcept { (std::cin >> ... >> args); }
constexpr void Print(auto&& ... args) noexcept { ((std::cout << args << ' '), ...); }
constexpr void Println(auto&& ... args) noexcept { Print(std::f... | ALGO | 0.998888 | 5.212068 |
5278cb6a-48a5-4748-ad1c-1eb203f8f0c2 | StrawHatWess/Competitive-Programming-Solutions | France IOI/Parcours à points.cpp | //Never stop trying
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typ... | ALGO | 0.999901 | 4.242702 |
e619eb46-18e5-4560-b87d-d862fe3ab6f5 | KaneCoin/KaneCoin | src/zerocoin/SerialNumberSignatureOfKnowledge.cpp | /**
* @file SerialNumberSignatureOfKnowledge.cpp
*
* @brief SerialNumberSignatureOfKnowledge class for the Zerocoin library.
*
* @author Ian Miers, Christina Garman and Matthew Green
* @date June 2013
*
* @copyright Copyright 2013 Ian Miers, Christina Garman and Matthew Green
* @license This pr... | ALGO | 0.967513 | 7.097405 |
ab790e3e-2543-4f80-a4d1-dd30f1913312 | samfubuki/lbcodessolution | prepinstatop100codes/removespacesfromstring.cpp | #include <iostream>
using namespace std;
int main()
{
//Initializing variables.
char str[100], str_no_spc[100];
int i=0, j=0 ;
//Accepting inputs.
cout<<"Enter the string:\n";
cin>>str;
//Iterating each character of string.
while(str[i] != '\0')
{
if(str[i] != ' ')
... | ALGO | 0.998583 | 5.402345 |
a14a5a04-5b5a-4827-badc-f6c5d207cfb4 | raincross7/code-similarity | codes/train_code/problem303/problem303_56.cpp | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << # x << "; "<< x << endl
int main() {
string S, T;
int total;
total = 0;
cin >> S >> T;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) != T.at(i)) {
total += 1;
}
else if (S.at(i) == T.at(i)) {
continue;
}
}
cout << total << e... | ALGO | 0.999959 | 3.609468 |
98b64b54-57a4-4ec8-a13c-f1c517242ab0 | moon-jam/APCS | c294. APCS-2016-1029-1三角形辨別.cpp | //https://zerojudge.tw/ShowProblem?problemid=c294
#include <bits/stdc++.h>
using namespace std;
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int arr[4];
cin >> arr[0] >> arr[1] >> arr[2];
sort(arr, arr+3);
cout << arr[0] << ' ' << arr[1] << ' ' << arr[2] << '\n';
if(arr[0]+arr[1]<=a... | ALGO | 0.99983 | 4.289674 |
015efd36-91f8-4e26-ad03-20aa45f3ceaa | ishandutta2007/codeforces | 74traktor/normal/1183/H.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[105][105];
int maxn = 1e16;
int used[27];
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (k <= 1){
cout << 0;
return 0;
}
... | ALGO | 0.999966 | 4.156628 |
5aae62cd-2195-4f54-9852-7a6a6b4ffebf | Legendexo/Keylogger-audio | subbreak.cpp | /*! \file subbreak.cpp
* \brief Substitution cipher breaker
* \author Georgi Gerganov
*/
#include "subbreak.h"
int main(int argc, char ** argv) {
printf("Usage: %s n-gram.txt\n", argv[0]);
if (argc < 2) {
return -1;
}
srand(time(0));
TFreqMap freqMap;
if (loadFreqMap(argv[1], fr... | TOOL | 0.967394 | 4.964037 |
77a67939-6b8d-48e7-9992-c33a33b9cfa9 | Saidkamolkhon/Assignmets | assinment9.cpp | // PROBLEM 1
#include<iostream>
using namespace std;
void count(string str)
{
int upper = 0, lower = 0, number = 0, special = 0;
for (int i = 0; i < str.length(); i++)
{
if (str[i] >= 'A' && str[i] <= 'Z')
upper++;
else
lower++;
}
cout << "Upper cas... | ALGO | 0.996029 | 3.423168 |
4aab9969-b81d-4f56-9924-8b5092ed01d4 | ms471841/Flutter-All-in-One | imagegesture/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.997573 | 6.797273 |
afa3579e-4203-4e3f-9c8c-9eb0cbba459f | huntrag/CSESAndOtherSamples | DSA/max-jumps.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vector<ll>> vii;
#define MOD 1000000007
#define fi first
#define se second
int minJump(int arr[], int n)
{
queue<int> q;
q.push(0);
vector<bool> vis(n, false);
vector<int> p... | ALGO | 0.999984 | 4.351754 |
1706f138-f455-44d9-bdc1-9471c6075016 | A7MEDK7/Data_Structures_FCI | QueueWithArray.cpp | #include <iostream>
using namespace std;
const int MAX_SIZE = 100;
class QueueWithArray {
private:
int rear, front, length; // rear: index of the last element, front: index of the first element, length: number of elements
int arr[MAX_SIZE]; // Fixed-size array to hold queue elements
public:
// Constructo... | ALGO | 0.998055 | 5.284686 |
268f8c5d-6129-45dd-b02c-526ba1c7c5ce | vrajpat3ll/computer-architecture | FloatingPointMultiplication.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
string a, b;
cin >> a >> b;
string c = "", w;
if (a == "0")
{
c = "0";
}
if (b == "0")
{
c = "0";
}
int sign = ((a[0] - '0') ^ (b[0] - '0'));
string X;
cout << sign;//TODO: NOT REQUIRED! But not f... | ALGO | 0.999939 | 3.598245 |
92dd3292-9375-46d5-8aba-091a3f0d8e93 | Rutujasonar/codexflutter | practical1/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.998232 | 6.76775 |
62de28ce-706f-436b-aa8e-8a3adc8dfe10 | DWenZo/LearningSourceCode | CC++SourceFile/c不三不四喜七数.cpp | #include <stdio.h>
int main()
{
int oj;
scanf("%d",&oj);
while(oj != 0)
{
int n;
scanf("%d",&n);
int count=0;
for (int i=1; i<=n;i++)
{
if (i%3 != 0 && i%4 != 0 && i%7 == 0)
count++;
}
printf("%d\n",count);
oj--;
}
return 0;
}
| ALGO | 0.999748 | 3.107124 |
d64b50ac-9e07-4b4f-9fe2-02044b2b5246 | seo-bo/ProblemSolving | Atcoder/ABC370/C.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll>pll;
typedef tuple<ll, ll, ll>ti;
const char* yes = "Yes";
const char* no = "No";
int main(void)
{
cin.tie(0)->ios::sync_with_stdio(0);
string s, t;
cin >> s >> t;
int siz = s.length(), cnt = 0;
vect... | ALGO | 0.999999 | 4.10624 |
8bb21dcb-23a4-43af-b19a-a7ab63bb60eb | ravi0531rp/a-langs | b-cpp/a-theory/a-apna-school-series/a3-io.cpp | #include <iostream>
using namespace std;
int main(){
int amount1;
cin>> amount1;
int amount2;
cin>>amount2;
short int sum;
sum = amount1 + amount2;
cout<<"Sum is "<<sum;
return 0; // exit the func
} | TOOL | 0.970655 | 3.185618 |
2270e743-deef-4f38-b527-c7093dd0950e | yehjin00/RPLiDAR_object-detection | datmo/src/kalman-cpp/kalman.cpp | /**
* Implementation of KalmanFilter class.
*
* @author: Hayk Martirosyan
* @date: 2014.11.15
*/
#include <iostream>
#include <stdexcept>
#include "kalman.hpp"
KalmanFilter::KalmanFilter(
double dt,
const Eigen::MatrixXd& A,
const Eigen::MatrixXd& C,
const Eigen::MatrixXd& Q,
const Eigen::MatrixX... | ALGO | 0.956988 | 7.469174 |
83dc8b13-21f9-4ff3-b327-9bafc8771279 | ishandutta2007/codeforces | cz_xuyixuan/normal/1305/C.cpp | #include<bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c);... | ALGO | 0.999972 | 3.576517 |
717fb4f3-56ce-4c5c-8f33-84773e5e6c30 | xierensong/cppPGround | 0901/4.cpp | #include<bits/stdc++.h>
using namespace std;
int convert(int n, int base)
{
int res=0;
stack<int> my_stack;
while(n % base != 0 || n / base != 0) {
int a = n % base;
n = n / base;
if (a >= 10) return -1;
my_stack.push(a);
}
while(!my_stack.empty()) {
int a... | ALGO | 0.999539 | 3.984373 |
2a6096fc-8c74-4825-b714-03eb6aa3f88e | ishandutta2007/codeforces | lagoon_/normal/1229/F.cpp | #include<bits/stdc++.h>
#define re register
long long l1[350100],r1[350100],a[350100],ta1,ta2;
#define pp std::pair<long long,long long>
#define mk(a,b) std::make_pair(a,b)
pp q1[1001000],q2[1001000];
int n;
inline bool cmp1(re pp a,re pp b){return a.first<b.first;}
inline bool cmp2(re pp a,re pp b){return a.first>b.fi... | ALGO | 0.999912 | 3.381771 |
f717466c-c6ba-4c83-90c9-dd246c805617 | ishandutta2007/codeforces | mtsd/normal/1704/A.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define inf 1000000007
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)
#d... | ALGO | 0.999977 | 4.11791 |
29dcd60d-c0c9-4c69-99a1-928f48b74be1 | RainSureZhao/PoissonReconCGAL | third_party/CGAL-6.0.1/examples/Property_map/custom_property_map.cpp | #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/jet_estimate_normals.h>
#include <CGAL/mst_orient_normals.h>
using Kernel = CGAL::Exact_predicates_inexact_constructions_kernel;
using Point_3 = Kernel::Point_3;
using Vector_3 = Kernel::Vector_3;
using ... | TOOL | 0.991028 | 7.752887 |
c0d0c434-d823-47ac-afbb-031f2c2b4334 | rudalsd/Algorithm-Study | 백준/dp/11054. 가장 긴 바이토닉 부분 수열.cpp | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int arr[1000];
int increase[1000];
int decrease[1000];
vector<int> mem;
int N;
int main()
{
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d", &arr[i]);
}
int max = 1;
for (int i = 0; i < N; i++) { //ϴ κ ִ increase
if (... | ALGO | 0.999986 | 4.451524 |
061760f0-5903-45c9-b151-5293b65a7c22 | Lion-Heart-KR/Inflearn | Part1/CodingTest/CPP_CodingTest/CPP_CodingTest/CPP_CodingTest_주차.cpp | #include <string>
#include <vector>
#include <map>
#include <iostream>
#include <sstream>
using namespace std;
vector<int> solution(vector<int> fees, vector<string> records)
{
vector<int> answer;
map<string, string> m;
map<string, int> m_temp;
for (auto it = records.begin(); it != records.end(); ++it)
{
str... | ALGO | 0.97066 | 5.009179 |
d57a975e-62e3-4925-ab1f-83dd23b92210 | codeforsmart/Cp-contest | cf contest/edu 78/2ok.cpp | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define lb lower_bound
#define debug(x) cout<<"["<<#x<<": "<<x<<"]"<<endl
#define f(i,p,n) for(ll i=p;i<n;i++)
ll exp(ll a,ll b,ll m... | ALGO | 0.999972 | 4.237774 |
163d0558-22a9-4c81-8a66-3e81ac8f0e63 | WIZARD-CXY/pl | leetcode/happynumber.cpp | class Solution {
public:
bool isHappy(int n) {
if(n==1){
return true;
}
unordered_set<int> old;
while(true){
int sum=0;
while(n){
sum+=(n%10)*(n%10);
n/=10;
}
... | ALGO | 0.999971 | 6.341076 |
6de5f33d-67fa-43f0-ac4b-7f2e5ece6c37 | dgodfrey206/leetcode-submissions | 58-length-of-last-word/58-length-of-last-word.cpp | class Solution {
public:
int lengthOfLastWord(string s) {
int n = s.size();
for (int i = n - 1; i >= 0; i--)
if (isalpha(s[i]))
for (int j = i; j >= -1; j--)
if (j == -1 || !isalpha(s[j]))
return i - j;
return 0;
}
}; | ALGO | 0.996789 | 5.906476 |
d0bcf50d-24f3-447f-ab12-94a3a44faf97 | HPC-AI-Team/lammps-fugaku-threadpool-sc23 | src/GRANULAR/gran_sub_mod_tangential.cpp | #include "gran_sub_mod_tangential.h"
#include "error.h"
#include "gran_sub_mod_damping.h"
#include "gran_sub_mod_normal.h"
#include "granular_model.h"
#include "math_extra.h"
using namespace LAMMPS_NS;
using namespace Granular_NS;
using namespace MathExtra;
static constexpr double EPSILON = 1e-10;
/* --------------... | ALGO | 0.974263 | 6.815031 |
c4376959-3be8-4eab-b79a-79557c02a1bd | dumppool/GameProgrammingGems | 游戏编程精粹2_SourceCode_12345章/05 Graphics Display/01 Marshall/MeshUtils.cpp | // MeshUtils.cpp
// This functions includes the member functions form MeshUtils.h
#include "MeshUtils.h"
// CreateUniqueEdgeList:
// This creates an edge list from the Mesh. The last step in the function
// is to compact the edge list that was passed in as ppEdges. This function
// uses a hash table in EdgeHas... | TOOL | 0.977119 | 5.910113 |
ba92abd4-3edc-47e4-b65b-b7f1cbe1d29c | michaelkoller/pic-to-plan-v2-git | pic_to_plan_v2/VAL/src/TrajectoryConstraints.cpp | #include "TrajectoryConstraints.h"
#include "Proposition.h"
#include "VisitController.h"
#include "Validator.h"
namespace VAL {
int PreferenceMonitor::id = 0;
std::set<int> PreferenceMonitor::done;
#define MESSAGE(x) if(LaTeX) { *report << x << "\\\\\n"; } else if(Verbose) { cout << x << "\n";}
bool PreferenceMonit... | ALGO | 0.981077 | 5.350098 |
88fb80c4-6d05-4ec6-b483-954b86daf70b | PavelKu2zov/Coursera | Yellow Belt/Week 2/bus_station_starter.cpp | #include <string>
#include <iostream>
#include <cassert>
#include <vector>
#include <map>
using namespace std;
enum class QueryType {
NewBus,
BusesForStop,
StopsForBus,
AllBuses
};
struct Query {
QueryType type;
string bus;
string stop;
vector<string> stops;
};
istream& operator >> (... | ALGO | 0.977643 | 5.813944 |
c567d46a-6a15-4d35-91f8-43c03a0e2e98 | pakorns/corona | librtt/Rtt_TesselatorStream.cpp | //////////////////////////////////////////////////////////////////////////////
//
// This file is part of the Corona game engine.
// For overview and more information on licensing please refer to README.md
// Home page: https://github.com/coronalabs/corona
// Contact: <EMAIL>
//
///////////////////////////////////////... | TOOL | 0.935804 | 4.975033 |
3951d495-7f34-4308-8246-225ddee71ee0 | pr7prashant/Leetcode | Minimum Swaps to Sort - GFG/minimum-swaps-to-sort.cpp | // { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
//Function to find the minimum number of swaps required to sort the array.
int minSwaps(vector<int>&nums) {
vector<pair<int, int>> arr;
for (int i = 0; i < nums.size(); i++) arr.pus... | ALGO | 0.999955 | 5.735507 |
a30a61b3-7960-4617-90e8-407fd47fca6d | LBiff/subjects_2020 | MaxMinWindowUpdate.cpp | //最大最小窗口更新结构
#include <deque>
#include <vector>
#include <cstdlib>
#include <cstdint>
#include <stdexcept>
#include <iostream>
using namespace std;
//最大更新结构
//T 为容器
//最大更新结构== 双端队列值升序，队列加数从后面加（>=加数的弹出）， 队列减数从前面减去索引过期的
template<typename T>
class MaxWindowUpdate
{
typedef typename T::value_type _value_type;
public:
//初... | ALGO | 0.999921 | 5.36126 |
0da1085b-98dc-4e7c-ae25-834b02faa834 | Landwere/Realtime-Graphics-Labs | 3rdParty/opencv-4.8.0/sources/modules/gapi/samples/gaze_estimation.cpp | #include <algorithm>
#include <iostream>
#include <cctype>
#include <opencv2/gapi.hpp>
#include <opencv2/gapi/core.hpp>
#include <opencv2/gapi/infer.hpp>
#include <opencv2/gapi/infer/ie.hpp>
#include <opencv2/gapi/streaming/cap.hpp>
#include <opencv2/gapi/cpu/gcpukernel.hpp>
#include <opencv2/highgui.hpp> // CommandLi... | ALGO | 0.855677 | 6.294922 |
885c504d-8257-453b-82e2-ef38c83779b2 | axxonite/algorithms | EPI/Solutions/8_LinkedLists/8.12_list_pivoting_solution.cpp | #include "stdafx.h"
#include "LinkedListPrototype.h"
namespace Solutions
{
shared_ptr<ListNode<int>> ListPivoting( const shared_ptr<ListNode<int>>& L, int x )
{
// Don't forget to initialize the next ptr on each list node.
shared_ptr<ListNode<int>> lesserDummyHead = make_shared<ListNode<int>>( ListNode<int> {0, ... | ALGO | 0.999972 | 5.227078 |
0be4b2fe-3815-4ad4-b996-6f8e390a0c3c | Divya063/programming | codeforces/div3/555/C.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define MOD 1000000007
#define dd double
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//ios_base& scientific (ios_base& str);
ll n;
cin >> n;
ll arr[n];
deque <in... | ALGO | 0.999993 | 3.475264 |
5e6b761e-5259-42bb-8cf8-e5492906e738 | immaksudalam/Algorithm | Binary search.cpp | #include <bits/stdc++.h>
using namespace std;
bool binary_search(int arr[], int n, int x){
int left =0, right = n-1;
while(left <= right){
int mid = (left+right)/2;
if(arr[mid]==x){
return true;
}
if(arr[mid] < x){
left = mid+1;
}
else righ... | ALGO | 0.999942 | 4.563011 |
26531310-ae2b-49d5-991f-9290d3a1031c | foxbao/SensorCalibration | SensorX2car/radar2car/eigen3/doc/examples/TutorialLinAlgSetThreshold.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix2d A;
A << 2, 1,
2, 0.9999999999;
FullPivLU<Matrix2d> lu(A);
cout << "By default, the rank of A is found to be " << lu.rank() << endl;
lu.setThreshold(1e-5);
cout << "With threshold 1e-5... | ALGO | 0.999869 | 4.090376 |
b83be2c5-7f26-48a5-aa40-a4c2007aae11 | sommerlukas/llvm-offload-jetson | libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/lexicographical_compare_comp.pass.cpp | // <algorithm>
// template<InputIterator Iter1, InputIterator Iter2, CopyConstructible Compare>
// requires Predicate<Compare, Iter1::value_type, Iter2::value_type>
// && Predicate<Compare, Iter2::value_type, Iter1::value_type>
// constexpr bool // constexpr after C++17
// lexicographical_com... | TEST | 0.908048 | 6.43159 |
2fd3d6e5-206b-442b-bcf5-a47fda0c6e05 | zf-w/mini_problem_collection_before_y2023m11 | Leetcode/Leetcode.839.similar-string-groups/Leetcode.839.similar-string-groups.cpp | /*
* @lc app=leetcode id=839 lang=cpp
*
* [839] Similar String Groups
*
* https://leetcode.com/problems/similar-string-groups/description/
*
* algorithms
* Hard (46.92%)
* Likes: 1093
* Dislikes: 184
* Total Accepted: 65.6K
* Total Submissions: 135.8K
* Testcase Example: '["tars","rats","arts","star... | ALGO | 0.999925 | 6.700008 |
7bfdb005-a5be-4ba0-8bbc-6c9a0b4790ee | shreejitverma/SDE-Interview-Prep | LeetCode/C++/n-th-tribonacci-number.cpp | // Time: O(logn)
// Space: O(1)
class Solution {
public:
int tribonacci(int n) {
vector<vector<int>> T = {{1, 1, 0},
{1, 0, 1},
{1, 0, 0}};
return matrixMult({{1, 0, 0}}, matrixExpo(T, n))[0][1]; // [a1, a0, a(-1)] * T^n
}
pri... | ALGO | 0.999977 | 6.554696 |
8ef3d517-76d4-4236-b9ff-ee54f19b00ee | raincross7/code-similarity | codes/train_code/problem325/problem325_448.cpp | #include <fstream>
#include <iostream>
// #include <cassert>
// BE CAREFUL WITH HASH TABLE & UNORDERED MAP
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define MOD 998244353
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,... | ALGO | 0.99998 | 3.715276 |
b4ec952b-d14f-4c0d-805c-13b44b6592e7 | ayushrajabd/ayushrajabd | 0004-median-of-two-sorted-arrays/0004-median-of-two-sorted-arrays.cpp | class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
vector<int> mix;double ans=0;int temp=0;
for(int i=0;i<nums1.size();i++){
mix.push_back(nums1[i]);
}
for(int i=0;i<nums2.size();i++){
mix.push_back(nums2[i]);
}
... | ALGO | 0.999982 | 6.282804 |
a690ee63-2c60-4fed-9e73-36705de1af1b | DustyRobinson/2022_17A | Lab/Static_1D_and_2D_Arrays/main.cpp | /*
* File: main.cpp
* Author: Dr. Mark E. Lehr
* Created on March 15th, 2020, 10:05 AM
* Purpose: Compare 1 and 2 Dimensional Static Arrays
*/
//System Libraries Here
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <iomanip>
using namespace std;
//User Libraries Here
//Global Constants Only... | ALGO | 0.997365 | 4.431963 |
46fe6c27-7dee-4753-8f69-0dbf1b0ee528 | noureldin-khaled/workspace | C++/Codeforces/New Year Transportation.cpp | #include<iostream>
#include<string>
#include<cstring>
#include<sstream>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<vector>
#include<stdlib.h>
#include<set>
#include<stdio.h>
using namespace std;
int main()
{
long int n,t;
scanf("%d %d",&n,&t);
long int arr[n-1];
for... | ALGO | 0.999993 | 3.490616 |
5ec2f5ff-6275-4057-af67-88699d20e73a | guilhermecorreagv/maximum_words | src/backtrack.cpp | #include "backtrack.h"
#include "utils.h"
namespace backtrack {
std::vector<std::set<uint32_t>> find_solution_set(
std::vector<uint32_t> &bitwords,
std::unordered_map<uint32_t, std::vector<std::string>> bit2words) {
std::vector<std::set<uint32_t>> res;
int bestScore = 0;
// this cancerous lambda functi... | ALGO | 0.99992 | 5.608796 |
01821a1e-3223-47c9-9fca-d8a4e8d12388 | GiovannaRR/Estrutura-de-Dados | Aula 2/Ex01.cpp | #include <iostream>
int main(){
int lin = 3, col = 4;
int mat[lin][col];
std::cout << "Digite os numeros: \n"; //printf() --> std::cout
for(int i = 0; i < lin; i++){
for(int j = 0; j < col; j++){
std::cin >> mat[i][j]; //scanf() --> std::cin
}
}
int somaCo... | ALGO | 0.989717 | 4.307866 |
08c05ad1-ac26-48e5-948f-f7ed6f226aac | HinaPE/Kasumi-legacy | reference/bbox.cpp | #include "../lib/mathlib.h"
#include "debug.h"
bool BBox::hit(const Ray &ray, Vec2 ×) const
{
// TODO (PathTracer):
// Implement ray - bounding box intersection test
// If the ray intersected the bounding box within the range given by
// [times.x,times.y], update times with the new intersection t... | ALGO | 0.962446 | 5.151396 |
165fcc26-8543-4932-b515-ee17f0dafe60 | AryanGupta2708/DSA-practice | TowerofHanoiRecursion.cpp | #include <stdio.h>
void TOH(int n, int A, int B, int C)
{
if (n > 0)
{
TOH(n - 1, A, C, B);
printf("(%d,%d)\n", A, C);
TOH(n - 1, B, A, C);
}
}
int main()
{
TOH(4, 1, 2, 3);
return 0;
} | ALGO | 0.999849 | 4.516844 |
413d2f41-6a3f-496e-992c-a324f7d99d1b | Amdev-5/Leetcode-Algorithmic-Problems | 590-n-ary-tree-postorder-traversal/590-n-ary-tree-postorder-traversal.cpp | /*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val) {
val = _val;
}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public:
vector<int> nums;
vector<... | ALGO | 0.999934 | 5.801119 |
9eb8a47a-0f67-499e-81a2-6a6a3a6fe54a | yuika-sama/code-ptit-solutions | DSA - PTIT/DSA05009.cpp | #include <bits/stdc++.h>
#define faster() {ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);}
#define endl '\n'
#define precision(x) setprecision(x) << fixed
#define pi pair<int, int>
#define ll long long
#define pb push_back
#define mp make_pair
#define keocon {cout << "I used to be your Tinkle Bell, but we're t... | ALGO | 0.999576 | 4.955651 |
52b627a6-eefa-48d4-93af-526d919c33f5 | virtualsecureplatform/llvm-rv16k | llvm/tools/llvm-nm/llvm-nm.cpp | #include "llvm/ADT/StringSwitch.h"
#include "llvm/BinaryFormat/COFF.h"
#include "llvm/Demangle/Demangle.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/LLVMContext.h"
#include "llvm/Object/Archive.h"
#include "llvm/Object/COFF.h"
#include "llvm/Object/COFFImportFile.h"
#include "llvm/Object/ELFObjectFile.h"
#include... | TOOL | 0.921399 | 5.504933 |
2c5a824e-1018-4085-a59d-c5eb1d5c10bf | sarvex/leetcode-cobol | solution/0000-0099/0068.Text Justification/Solution.cpp | class Solution {
public:
vector<string> fullJustify(vector<string>& words, int maxWidth) {
vector<string> ans;
for (int i = 0, n = words.size(); i < n;) {
vector<string> t = {words[i]};
int cnt = words[i].size();
++i;
while (i < n && cnt + 1 + words[i]... | ALGO | 0.999988 | 6.399116 |
6a7adf62-d810-456d-bbfd-af196236fce1 | kmjp/procon | 2017-2021/2020/keyence/b.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.999972 | 4.180204 |
f9f912f5-8242-497a-8656-876dd77d34af | adni03/DSA-Program-Files | Indexed Trees/Bd+ tree_K1.cpp | //Bd TREE WITH KEY RE-DISTRIBUTION
#include<iostream>
using namespace std;
const int d=1;
struct bdnode{
int data[2*d+1], space[2*d+1];
struct bdnode *PTR[2*d+2];
int p;
int d;
};
struct qnode{
struct bdnode *TEMP=NULL;
struct qnode *next=NULL;
};
struct Queue{
struct qnode *F=NULL;
struct qnode *R=NULL;
}... | ALGO | 0.999962 | 3.573448 |
ce7a38b7-9d48-4c07-b009-143af562934e | AoMas17/codeforces-perso | 0230/B/accepted.cpp | #include <iostream>
#include <vector>
#include <string>
#include <bits/stdc++.h>
using namespace std;
#define init ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define FORi(a) for (int i = 0; i < a; i++)
#define FORj(a) for (int j = 0; j < a; j++)
#define FORk(a) for (int k = 0; k < a; k++)
#define ull unsigne... | ALGO | 0.999866 | 3.882637 |
433dbb1d-56c1-4ffa-bbe0-009020562a30 | EagleGhostBear/Algorithm_Hub | 프로그래머스/2/147354. 테이블 해시 함수/테이블 해시 함수.cpp | #include <string>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
struct compare{
int col;
compare(int c) : col(c) {}
bool operator()(vector<int> left, vector<int> right){
if(left[col - 1] < right[col - 1]) return true;
if(left[col - 1] > right[col - 1]... | ALGO | 0.99989 | 5.136229 |
fe9b6db8-99ca-40da-a877-265863ced2bf | Yaroslav77777777/fantastic-palm-tree | app/jni/third_party/emoji_suggestions/emoji_suggestions.cpp | #include "emoji_suggestions.h"
#include <algorithm>
#include "emoji_suggestions_data.h"
#ifndef Expects
#include <cassert>
#define Expects(condition) assert(condition)
#endif // Expects
namespace Ui {
namespace Emoji {
namespace internal {
namespace {
checksum Crc32Table[256];
class Crc32Initializer {
public:
Crc3... | ALGO | 0.984114 | 7.070982 |
2a04404f-ad1c-4c32-8a22-88506131a614 | pratyush-45/Striver-SDE-Sheet | Heaps/RunningMedian.cpp | #include<bits/stdc++.h>
void findMedian(int *arr, int n)
{
priority_queue<int> maxHeap;
priority_queue<int, vector<int>, greater<int>> minHeap;
if(n == 0)
return;
maxHeap.push(arr[0]);
cout<<arr[0]<<" ";
for(int i= 1; i< n; i++)
{
int x = arr[i];
if(maxHeap... | ALGO | 0.999989 | 4.417439 |
548b4932-8a25-4d39-a224-aa358bea108d | Jungyh0/coding_test | c++로풀었던백준/2252.cpp | #include<bits/stdc++.h>
using namespace std;
#define MAX 32010
int v,e,num1,num2,Index=0;
vector<int> vec[MAX];
int visited[MAX];
priority_queue<int> q;
void input(){
cin>>v>>e;
for(int i=0;i<e;i++){
cin>>num1>>num2;
vec[num1].push_back(num2);
visited[num2]++;
}
for (int i = 1; i <= v; i++) {
if... | ALGO | 0.999902 | 4.144494 |
7877a5e8-c04e-4155-9d9e-27b7dea4be0b | zlangley/contest-programming | acm-icpc/from_nate/4946-highscore/highscore.cpp | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(int argc, char **argv) {
// process input
int cases;
cin >> cases; // read in the number of test cases
for (int c = 0; c < cases; c++) {
string name;
cin >> name;
const int len = name.length();
// total numer ... | ALGO | 0.999866 | 4.640164 |
92153961-ee5b-4e54-bc3b-43bf364fdd20 | parthoMalakar/Data-Structure | Tries & Huffman Coding/patternMatcing.cpp | /*
Pattern Matching
Send Feedback
Given a list of n words and a pattern p that we want to search. Check if the pattern p is present the given words or not.
Return true or false.
Input Format :
Line 1 : Integer n
Line 2 : n words (separated by space)
Line 3 : Pattern p (a string)
Output Format :
true ot false
Sample Inp... | ALGO | 0.999959 | 5.532908 |
d3694083-6284-42da-9a90-64dcc39eebf0 | alittlekitten/AlgorithmStack | Baekjoon/Cpp/Arithmetic/B4_33162_Walking.cpp | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// 33162 散歩 (Walking)
// 수학
int x;
cin >> x;
int ans = 0;
for (int i = 0; i < x; ++i) {
if (i % 2) ans -= 2;
else ans += 3;
}
cout << ans;
return 0;
}
| ALGO | 0.999867 | 3.576444 |
4eabbb98-b5aa-4c23-93d4-02ba7e6ced7b | LambyDev/Lamby | src/crypter.cpp | #include "crypter.h"
#include "crypto/aes.h"
#include "crypto/sha512.h"
#include "script/script.h"
#include "script/standard.h"
#include "util.h"
#include "init.h"
#include "uint256.h"
#include "wallet/wallet.h"
int CCrypter::BytesToKeySHA512AES(const std::vector<unsigned char>& chSalt, const SecureString& strKeyDat... | TOOL | 0.903699 | 7.487134 |
f7111b39-ea7d-4228-8171-85053bd47377 | SumitGarg11/Algorithms | Graph/Algozienth/DFS/dfsCode.cpp | #include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int>> g;
vector<int> vis;
vector<int> temp;
void dfs(int node)
{
temp.push_back(node);
vis[node] = 1;
for (auto v : g[node])
{
if (!vis[v])
{
dfs(v);
}
}
}
int main()
{
cin >> n >> m;
g.... | ALGO | 0.999986 | 4.178991 |
9970218a-a8b2-4a9b-b31c-4c94a61634f9 | avolkov/rpi-opencv | libtbb_source_pkg/tbb-4.2~20140122/src/perf/fibonacci_impl_tbb.cpp | #include <cstdio>
#include <cstdlib>
#include "tbb/task_scheduler_init.h"
#include "tbb/task.h"
#include "tbb/tick_count.h"
extern long CutOff;
long SerialFib( const long n ) {
if( n<2 )
return n;
else
return SerialFib(n-1)+SerialFib(n-2);
}
struct FibContinuation: public tbb::task {
lon... | ALGO | 0.999503 | 4.705167 |
2f5a6db4-eee5-4cc2-96c8-a88a43a11b42 | Pranav-Kumar-Singh-038/Competitive_Programming | Striver_CP_sheet/Implementation/Most_Unstable_Array.cpp | #include <bits/stdc++.h>
using namespace std;
/*
If n=1 then the answer is 0. Otherwise, the
best way is to construct the array [0,m,0,…,0].
For n=2 we can't reach answer more than m
and for n>2 we can't reach the answer more than 2m
because each unit can't be used more than twice.
So the answer can be represente... | ALGO | 0.999936 | 4.041245 |
006089b8-8322-4e17-8a01-4f55a482c44b | PiscesDante/LintCode | 95. 验证二叉查找树.cpp | /**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param root: The root of binary tree.
* @return:... | ALGO | 0.999993 | 6.801147 |
7f486812-2108-4475-b75c-1e8c615e63c9 | PedroDiSanti/Server | src/tools.cpp | #include "otpch.h"
#include "tools.h"
#include "configmanager.h"
extern ConfigManager g_config;
void printXMLError(const std::string& where, const std::string& fileName, const pugi::xml_parse_result& result)
{
std::cout << '[' << where << "] Failed to load " << fileName << ": " << result.description() << std::endl;... | TOOL | 0.943013 | 5.041539 |
33b0a817-8c85-4072-a870-e5fbfa8ed1a5 | 6108/codetree-TILs | 240423/소수 구하기/get-prime.cpp | #include <iostream>
using namespace std;
int main() {
int n, cnt;
cin >> n;
for (int i = 2; i <= n; i++) {
cnt = 0;
for (int j = 2; j < i; j++) {
if (i % j == 0)
cnt++;
}
if (cnt == 0)
cout << i << ' ';
}
return 0;
} | ALGO | 0.99994 | 4.678448 |
7a2c452b-fc92-49aa-8435-1de40a2c36d6 | shivang17d/DSALGO | Sorting/4_Qsort.cpp | // Quick Sort
#include <iostream>
using namespace std;
class Sort
{
public:
int n, arr[];
void read_data();
void swap(int* x,int* y);
int partition(int low ,int high);
void quickSort(int low ,int high);
void display_data();
};
void Sort ::read_data()
{
cout<<"Enter the size of the array : "<... | ALGO | 0.999977 | 5.348541 |
28f604d8-8fbd-4423-9cf4-a0691ba9d425 | MehrajRahman/competitive_programming | J_Count_Letters.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef set<int> si;
typedef set<ll> sl;
typedef map<int, int> mi;
typedef map<char, int> mc;
#define lpr pair<long long int, long long int>
#define fast \
ios_base::sync_wit... | ALGO | 0.998996 | 4.198369 |
a0f5c26b-409e-4a86-8b75-333c67ac4be2 | jeayoungho97/CodeStudy | self_study/백준단계별/4단계/10810.cpp | #include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> basket(n, 0);
for (int t = 0; t < m; ++t) {
int left, right, value;
std::cin >> left >> right >> value;
for (int i = left - 1; i < right; ++i) {
basket[i] = value;
}
}
for (int val : ... | ALGO | 0.999783 | 3.957329 |
c8177d82-9786-42b4-a76d-2138a9d12193 | johan-smc/UVA | 136.cpp | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#define foi( i , n , k ) for(int i = n; i < k ; ++i )
using namespace std;
int main()
{
long long n=2;
int c=1;
while( c<1500)
{
if(n%2==0||n%3==0||n%5==0)
c++;
n++;
}
printf("The 1500'th ugly number is %lld.\n",n);... | ALGO | 0.999921 | 4.169831 |
074c43d4-03e8-4262-8f15-c01e57a13fb9 | ishandutta2007/codeforces | ra16bit/normal/343/A.cpp | #include <cstdio>
#include <algorithm>
using namespace std;
long long a,b;
long long sol(long long a, long long b) {
if (a%b==0) return a/b;
return sol(b,a%b)+a/b;
}
int main() {
scanf("%I64d%I64d",&a,&b);
printf("%I64d\n",sol(a,b));
return 0;
} | ALGO | 0.999563 | 3.818859 |
57bbc979-13fc-4940-b457-c5caab1da048 | code233trainee/lijiminbest | CodeForese/题库/800-1200/2013_A.cpp | // https://codeforces.com/problemset/problem/2013/A
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve()
{
int n, x, y;
cin >> n >> x >> y;
if(x >= y)
{
cout << (n + (y - 1)) / y << endl;
}
else
{
cout << (n + (x - 1)) / x << endl;
}
}
int main... | ALGO | 0.999274 | 3.982748 |
6b788475-cee5-4e47-93e9-c89d4192d118 | bsmoura22/ProjGeometriaLP1 | src/circulo.cpp | #include <iostream>
#include <cmath>
#include "./../include/circulo.h"
using namespace std;
void circulo(int raio){
float area;
float per;
float pi = 3.1416;
area = pi * pow(raio, 2);
per = 2* pi * raio;
cout << "Area do circulo: " << area << endl;
cout << "Perimetro do circulo: " << per;
} | ALGO | 0.943067 | 4.295321 |
b2c48bf4-05f9-4e7d-97ad-84caae65e03f | Shadat-tonmoy/ACM-Problem-Solution | UVa/12592.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int i,j,k,l,m,n,a,b,c;
string str1,str2;
map <string,string> data;
map <string, string> :: iterator it;
while(cin>>n)
{
getchar();
for(i=0;i<n;i++)
{
getline(cin,str1);
//getchar();
... | ALGO | 0.973571 | 3.215594 |
e3374ed3-4fc0-44b3-a72a-f6db19f0e6a6 | reena855/assignment_565 | src/systemc/tests/systemc/misc/sim_tests/popc/popc.cpp | /*****************************************************************************
popc.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/*****************************************************************************
... | ALGO | 0.960119 | 6.072726 |
f8b26213-a1a9-49e4-b929-8ad9038e158d | StolasIn/leetcode_Submissions | content/best-time-to-buy-and-sell-stock/Accepted/2-16-2022, 12_41_45 PM/Solution.cpp | // https://leetcode.com/problems/best-time-to-buy-and-sell-stock
class Solution {
public:
int maxProfit(vector<int>& prices) {
int mi = 1e9;
int diff = 0;
for(int i=0;i<prices.size();i++){
diff = max(diff,prices[i] - mi);
mi = min(mi,prices[i]);
}
ret... | ALGO | 0.999847 | 6.280645 |
b051ea2d-ecc0-4736-a8a1-0f481f779623 | magicstone2018/leetcode | cpp/Longest Palindromic Substring/solution.cpp | class Solution {
public:
string longestPalindrome(string s) {
if (s.empty()) {
return "";
}
int max_length = 0;
string::iterator start = s.begin();
string::iterator it = s.begin();
do {
// use the character as the cord
int l = 1;
string::iterator left = it;
string::iterator right = it;
... | ALGO | 0.999976 | 6.100413 |
f6c0c57b-1c4b-4f33-b350-2345abae94c7 | mahmoudahmedibrahim5/CodeForces | 3-1100/Matchmaker.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define TABLE_SIZE 1000
unsigned int hashFunc(int size, int color)
{
return (size * 1000 + color);
}
int main()
{
int n, m;
cin >> n >> m;
unsigned int maxTable[1000] = {0};
unsigned int* hashT... | ALGO | 0.999924 | 4.488643 |
e7caeb4c-66ef-48bd-b048-3061c3eeaa40 | da1095/OOP244 | WS02/Part 2/WS2_P2/DNA.cpp | /* ------------------------------------------------------
Workshop 2 part 2
Module: DNA
Filename: DNA.cpp
Version 1
Author Devang Ramubhai Ahir Ahir
Revision History
-----------------------------------------------------------
Date Reason
-----------------------------------------------------------*/
#define _CRT_S... | TOOL | 0.984879 | 3.639158 |
33e5aa33-e8fc-423b-8140-52e23b54d77c | alec-Ng196/HW_HACKERANK | LTNC_W2/Number_line_jumps.cpp | //
// Created by Admin on 2/5/2024.
//
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
/*
* Complete the 'kangaroo' function below.
*
* The function is expected to return a STRING.
* The function accepts following pa... | ALGO | 0.999961 | 5.24017 |
43f50b94-fdd6-40e7-b680-fd4067a1ee2e | Akki5/spoj-solutions | EDIT.cpp | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main()
{
int n1,n2;
string s;
while(cin>>s)
{
n1=0,n2=0;
for(int i=0;i<s.length();i++)
{
if((i%2==0&&s.at(i)<91)||(i%2!=0&&s.at(i)>96))
... | ALGO | 0.998716 | 3.262796 |
e5222abe-1308-4d82-a4d8-f158a613bbe3 | shubham21699/My-LeetCode-Solutions | 2440-create-components-with-same-value/2440-create-components-with-same-value.cpp | class Solution {
public:
int check(vector<int> graph[], vector<int>& nums, vector<int>& v, int currNode, int targetSum) {
v[currNode] = nums[currNode];
for(auto nextNode : graph[currNode]) {
if(v[nextNode]) continue; // Already visited
... | ALGO | 0.999989 | 6.023065 |
d54f6040-98a9-4fb4-93e4-d4bd87e541cb | igor-526/forschools | telegram_local_server/telegram-bot-api/td/td/telegram/ConfigManager.cpp | #include "td/telegram/AuthManager.h"
#include "td/telegram/ConnectionState.h"
#include "td/telegram/Global.h"
#include "td/telegram/JsonValue.h"
#include "td/telegram/LinkManager.h"
#include "td/telegram/logevent/LogEvent.h"
#include "td/telegram/misc.h"
#include "td/telegram/net/AuthDataShared.h"
#include "td/telegram... | TOOL | 0.908985 | 6.210744 |
48351cdb-62bc-4805-9756-c540a725c816 | senlinzhan/experiments | leetcode_solutions/PlusOne.cpp | class Solution {
public:
vector<int> plusOne( const vector<int> &digits )
{
int plusOne = 1;
vector<int> result;
result.reserve( digits.size() );
for( auto iter = digits.crbegin(); iter != digits.crend(); ++iter )
{
int value = *iter + plusOne;
... | ALGO | 0.999766 | 7.008498 |
931e156e-bd6a-4c3d-b573-7621553c3a97 | juxiangwu/image-processing | cuda-projects/opencv-cuda/opencv-cuda-api/38-rectStdDev/main.cpp | #include <iostream>
#include <opencv2/opencv.hpp>
#include <opencv2/cudaarithm.hpp>
#include <opencv2/cudabgsegm.hpp>
#include <opencv2/cudacodec.hpp>
#include <opencv2/cudafeatures2d.hpp>
#include <opencv2/cudafilters.hpp>
#include <opencv2/cudaimgproc.hpp>
#include <opencv2/cudalegacy.hpp>
#include <opencv2/cudaobjde... | ALGO | 0.987232 | 4.023705 |
3949d907-2c33-40ca-901b-36391b8666a4 | sarvex/leetcode-zig | solution/0900-0999/0914.X of a Kind in a Deck of Cards/Solution.cpp | class Solution {
public:
bool hasGroupsSizeX(vector<int>& deck) {
int cnt[10000] = {0};
for (int& v : deck) ++cnt[v];
int g = -1;
for (int& v : cnt) {
if (v) {
g = g == -1 ? v : __gcd(g, v);
}
}
return g >= 2;
}
}; | ALGO | 0.999614 | 5.534117 |
38a29849-63a0-4e0b-8283-682d2c8683b1 | DevT75/CrackYourInternship | Maths_11_LC593_Valid_Square.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
inline int dist(vector<int>&a,vector<int>&b){
return (a[0]-b[0])*(a[0]-b[0]) + (a[1]-b[1])*(a[1]-b[1]);
}
// bool checkDim(vector<pair<int,int>>& sq){
// int a = dist(sq[0],sq[1]);
// int b = dist(sq[1],sq[3]);
... | ALGO | 0.999592 | 4.250467 |
8dd2f653-47e4-43e5-832b-8a861162a0e0 | berenger-eu/particle-interaction-with-optix | SDK/optixMultiSphereAABB/optixSphere.cpp | #include <optix.h>
#include <optix_function_table_definition.h>
#include <optix_stack_size.h>
#include <optix_stubs.h>
#include <cuda_runtime.h>
#include <sampleConfig.h>
#include <sutil/CUDAOutputBuffer.h>
#include <sutil/Exception.h>
#include <sutil/sutil.h>
#include "optixSphere.h"
#include <iomanip>
#include <... | ALGO | 0.999215 | 6.223869 |
77fe96fe-a30c-4c19-ae19-34ab469da90d | xian-wen/pat | Advanced/PAT_A1005 spell_it_right.cpp | /*
1005. Spell It Right (20)
时间限制：400ms 内存限制：64MB 代码长度限制：16KB
Description:
Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.
Input Specification:
Each input file contains one test case. Each case occupies one line which contains an ... | ALGO | 0.999942 | 5.060642 |
f5adcc81-1db0-42f0-abbb-8f292de85281 | yzcmf/Interview | LeetCode-Solutions/C++/find-words-that-can-be-formed-by-characters.cpp | // Time: O(m * n), m is the length of chars, n is the number of words
// Space: O(1)
class Solution {
public:
int countCharacters(vector<string>& words, string chars) {
const auto& count = counter(chars);
int result = 0;
for (const auto& word : words) {
if (check(word, chars, c... | ALGO | 0.999919 | 6.738988 |
6bab3109-d53b-4e23-b20c-d2d84b18fc22 | eliot-exdev/boost-morphos | libs/graph/example/filtered-copy-example.cpp | template < typename Graph > struct non_zero_degree
{
non_zero_degree() {} // has to have a default constructor!
non_zero_degree(const Graph& g) : g(&g) {}
bool operator()(
typename boost::graph_traits< Graph >::vertex_descriptor v) const
{
return degree(v, *g) != 0;
}
const Gra... | ALGO | 0.99675 | 5.972746 |
209d358c-dd69-4b7c-b1eb-494507712ac8 | ASAG-ISCAS/BdryReach | tests/capd_test2.cpp | #include <iostream>
#include "capd/capdlib.h"
using namespace capd;
using namespace std;
using capd::autodiff::Node;
// ####################################################
/*
* This is a map we will evaluate and differentiate (dimIn = 3, dimOut = 2, noParams = 5)
* @param in is an array of independent variables
* @... | ALGO | 0.999275 | 6.355651 |
bf94b5a8-f84c-41f4-9024-aa880739dabc | hjr265/sport-programming | Codeforces/Codeforces Round #145 (Div. 1, ACM-ICPC Rules)/C.cpp | // In the name of Allah, Most Gracious, Most Merciful
// /
//
//
//
//
// ??
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>... | ALGO | 0.999646 | 3.124903 |
bbf9f75d-92af-48b4-9169-8b270ae61d7b | TanviDeshmukh23/Codes | program223.cpp | #include<iostream>
using namespace std;
class Number
{
private:
int iNo1;
int iNo2;
public:
Number(int X, int Y)
{
iNo1 = X;
iNo2 = Y;
}
int Maximum()
{
if(iNo1 > iNo2)
{
return iNo1;
... | ALGO | 0.999106 | 4.403604 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.