uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
aa069b64-43aa-4d6a-8445-72b4a62abbab | Zlin0509/Zlin_ACM | _CF/CONTEST/1500-1999/1808/E1.cpp | //
// Created by 27682 on 2025/4/18.
//
#include "bits/stdc++.h"
#define endl '\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
typedef double db;
typedef long double ldb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ... | ALGO | 0.99998 | 4.588604 |
213cc833-264d-437a-aee6-87417b991561 | Stravey/Algorithm_Practice | Second/P_1/P5740.cpp | #include <iostream>
#include <cstring>
using namespace std;
struct student {
string name;
int chinese,math,english;
}a,ans;
int main()
{
int n;
cin >> n;
cin >> a.name >> a.chinese >> a.math >> a.english;
ans = a;
for(int i = 2;i <= n;i++) {
cin >> a.name >> a.chinese >> a.math >> ... | ALGO | 0.999418 | 3.622399 |
38296f24-54dd-406f-bac8-f9ca40facbce | RiccardoSilvestrini/RiccardoSilvestrini- | 12-12-2022_laboratorio-tpsit/riccardosil.cpp | #include <sys/wait.h>
#include <stdio.h>
#include <fenti.h>
#include <stdlib.h>
#define NRFIGLI 4
int main() {
int status, pid, x;
for (x=0; x < NRFIGLI; x+*) {
pid = fork0);
if (pid == 0) {
printf("Sono il figlio, il mio pid e':%d.", getpid());
exit (0);
} else{
... | TOOL | 0.969497 | 4.176674 |
757e982d-baaf-4580-98b5-2421b6c44fa6 | ishandutta2007/codeforces | tute7627/normal/1367/E.cpp | //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define P... | ALGO | 0.999953 | 3.254746 |
6eb24ebd-f46a-4589-aea9-899cd20ff1db | Shreya-Kesharwani/C-plus-plus-STL | lambda_function.cpp | #include<bits/stdc++.h>
using namespace std;
bool is_positive(int x){
return x>0;
}
int main()
{
//cout<<[](int x,int y){return x+y;}(4,7)<<endl;
/*auto sum=[](int x,int y){return x+y;};
cout<<sum(2,3);*/
vector<int> v={2,-3,-5};
cout<<all_of(v.begin(),v.end(),
[](int x){return x>0;});
cou... | ALGO | 0.990657 | 4.133596 |
46a3daad-d6e9-4622-985d-8b90b56572bc | Alex-Shen1121/SZU_Learning_Resource | 计算机与软件学院/面向对象程序设计（荣誉）/大作业1/素材1/2018192040_1129_1.cpp | 2018192040:Problem1129:𰸴
#include<iostream>
#include<string>
#include<iomanip>
using namespace std;
class card{
protected:
int ID,counter;
string name;
public:
card(){
};
card(int id,int c,string n):ID(id),counter(c),name(n){
};
void initial(){
cin>>ID>>name>>counter;
}
int save(double n){
if(n/10!=0||n<0... | ALGO | 0.852928 | 3.284969 |
7c1995bc-63c7-43e2-a69b-2d3bf382bad3 | sonapraneeth-a/competitive-programming_submissions | platforms/leetcode/practice/non-premium/medium/1237__find-positive-integer-solution-for-a-given-equation/solutions.cpp | // clang-format off
/**
* FILE DESCRIPTION
*
* Filename: 1237__find-positive-integer-solution-for-a-given-equation/solutions.cpp
* Created on: 05 September 2021
* Last modified: 05 September 2021
* Author: sonapraneeth_a
* Description: LeetCode submission for 'Find Positive Integer So... | ALGO | 0.99983 | 5.721719 |
d5a79cc8-beb8-4d1f-b1a7-8b6732224e06 | raincross7/code-similarity | codes/train_code/problem016/problem016_81.cpp | #include <bits/stdc++.h>
//#include "atcoder/all"
typedef long long int ll;
using namespace std;
// using namespace atcoder;
#define MAXN 300001
#define mod 1000000007
ll a[MAXN];
int main() {
int n;
cin >> n;
ll co[60];
for (int i = 0; i < 60; i++) co[i] = 0;
for (int i = 1; i <= n; i++) {
... | ALGO | 0.999992 | 4.269155 |
d047d61a-1765-4bc7-bc1e-be268b5e5ed0 | ultra-pool/SpesCoin2 | src/rpcprotocol.cpp | #include "rpcprotocol.h"
#include "clientversion.h"
#include "tinyformat.h"
#include "util.h"
#include "utilstrencodings.h"
#include "utiltime.h"
#include "version.h"
#include <stdint.h>
#include <boost/algorithm/string.hpp>
#include <boost/asio.hpp>
#include <boost/asio/ssl.hpp>
#include <boost/bind.hpp>
#include <... | WEB | 0.859265 | 7.536353 |
7b9357e3-e2e6-4f40-a6df-54083b605099 | ishandutta2007/codeforces | mangooste/normal/1288/B.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstring>
#include <iomanip>
using ll = long long;
using namespace std;
// #define int long long
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(a) a.begin(), a.end()
... | ALGO | 0.999642 | 4.546477 |
683b1b37-0850-426f-b617-0bb5bc47bf61 | Shashankiitr/Nongamba- | Codeforces/B_Segment_Tree_for_the_Minimum.cpp | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
int gcd(int a, int b){
if(b == 0) return a;
return gcd(b, a % b);
}
//O(log(min(a, b)))
int nCr(int N, int R){
int a = 1, b = 1; if(N - R < R) R = N - R;
if(R != 0){
while(R){
a *= N; b *=... | ALGO | 0.99989 | 5.608333 |
efadced6-939a-416d-8521-ec74d4da455c | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_1480_8.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int c[4];
while (cin >> c[0] >> c[1] >> c[2] >> c[3]) {
int n = 0;
for (int i = 0; i < 4; i++) n += c[i];
for (int i = 0; i < 4; i++) {
if (c[i]) {
int b[4];
for (int k = 0; k < 4; k++) b[k] = c[k];
vector<int> ans{... | ALGO | 0.999961 | 3.45496 |
5d25ca81-3847-475c-8eac-747205eacce2 | aenoskov/RankLib | indri/branches/lexalytics/src/CompressedCollection.cpp | //
// CompressedCollection
//
// 12 May 2004 -- tds
//
#include "indri/CompressedCollection.hpp"
#include "zlib.h"
#include "lemur/string-set.h"
#include "indri/XMLNode.hpp"
#include "lemur/Exception.hpp"
#include "lemur/RVLCompress.hpp"
#include "indri/RVLDecompressStream.hpp"
#include "indri/RVLCompressStream.hpp"
#... | TOOL | 0.91373 | 7.757759 |
ac40233e-2a77-45f6-b44a-212b28b4fdae | gdscorg/CPP | Debug/t3.cpp | #include "iostream"
using namespace std;
int main(){
int num,count=0;
cout<<"Enter the number of elements in array: ";
cin>>num;
char arr[num],final[num];
cout<<"Enter the elements of array: ";
for(int i=0;i<n;i--)
cin>>arr[i];
for (int i=0;i<num;i++){
if(arr[i]%2!=0){
... | ALGO | 0.999494 | 3.873752 |
1d8fb732-01ff-4971-a3e1-82e20c93fb87 | omkarauti11/30-Days-6-Companies-Challenge-2024 | Day22/3006_Find_Beautiful_indices_in_the_Given_Array_1.cpp |
#include <bits/stdc++.h>
using namespace std;
// solution
class Solution
{
public:
void computeLPS(string pattern, vector<int> &lps)
{
int M = pattern.length();
int len = 0; // Length of the previous longest prefix & suffix
lps[0] = 0; // Because there is no proper suffix and prefix ... | ALGO | 0.99979 | 5.397361 |
035dbea7-faa7-456e-aef9-dba90d61016a | ishandutta2007/codeforces | kmjp/normal/999/F.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.999867 | 3.208181 |
1da43893-ed64-416a-a0ec-d85f07e29c74 | nagamaheshreddy/Leetcode-DSA-Solved-2025 | 2685-first-completely-painted-row-or-column/2685-first-completely-painted-row-or-column.cpp | class Solution {
public:
int firstCompleteIndex(vector<int>& arr, vector<vector<int>>& mat) {
int r=mat.size();
int c=mat[0].size();
vector<int>rows(r,0);
vector<int>cols(c,0);
unordered_map<int,pair<int,int>>mp;
for(int i=0;i<r;i++){
for(int j=0;j<c;j++... | ALGO | 0.999982 | 5.834904 |
bd144fd4-d9eb-4440-9c75-98d5fadfc69c | BhaveshPatil12/CPP-OOPS | TemplateT39.cpp | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
template<typename T>
bool sort_predicate(const T & a, const T & b)
{
return a < b;
}
template<typename T>
void generic_sort(std::vector<T> & arr)
{
std::sort(arr.begin(), arr.end(), &sort_predicate<T>);
}
void test_funct... | ALGO | 0.999249 | 5.727668 |
6299ab46-42c4-4652-9407-745eecf664e7 | dodouwang/leetcode | 105.construct-binary-tree-from-preorder-and-inorder-traversal.cpp | /*
* [105] Construct Binary Tree from Preorder and Inorder Traversal
*
* https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/
*
* algorithms
* Medium (34.47%)
* Total Accepted: 141K
* Total Submissions: 409K
* Testcase Example: '[3,9,20,15,7]\n[9,3,15,20,7]'
... | ALGO | 0.999977 | 6.896355 |
82c0ad43-9065-4f7d-a5b3-1c8f40c1b439 | kwang-12/ros_basalt | thirdparty/opengv/test/test_noncentral_absolute_pose.cpp | #include <stdlib.h>
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <opengv/absolute_pose/methods.hpp>
#include <opengv/absolute_pose/NoncentralAbsoluteAdapter.hpp>
#include <sstream>
#include <fstream>
#include "random_generators.hpp"
#include "experiment_helpers.hpp"
#include "time_measurement.hpp... | ALGO | 0.958706 | 5.671026 |
9f58e88e-5424-4a15-b632-8c4132cf7968 | EEDK/StudyBaekJoon | 프로그래머스/1/135808. 과일 장수/과일 장수.cpp | #include <bits/stdc++.h>
using namespace std;
int solution(int k, int m, vector<int> score) {
int answer = 0;
int n = score.size();
int boxCnt = n / m;
int add = n - m * boxCnt;
int Pos = add;
sort(score.begin(), score.end());
for(Pos; Pos < n; Pos = Pos + m){
int p... | ALGO | 0.999771 | 4.450184 |
04781bd1-5520-4e3b-990e-f3454526b403 | stefanodefilipps/Robotics_Manipulator | multiple_obstacle/flaccoController.cpp | #include <iostream>
#include <string>
#include <vector>
#include <Eigen/Dense>
#include <Eigen/SVD>
#include <Eigen/QR>
#include <math.h>
#include <vector>
#include "flaccoController.h"
using namespace std;
using namespace Eigen;
VectorXf FlaccoController::control(vector<MatrixXf> Ji, vector<MatrixXf> bi, float lam, ... | ALGO | 0.999982 | 3.105029 |
0088caf4-439f-48ae-a59f-d34129e498d1 | dylan007/Coding | iecse/summer19/codeheat19/7.cpp | /*=======================
Author : Shounak Dey
Filename : 6.cpp
======================= */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define PB push_back
#define MK make_pair
#define SZ(a) (int)(sizeof(a))
#define F first
#define S second
#define... | ALGO | 0.999884 | 3.521309 |
4f77be45-305b-46fc-9d87-d619b0b8bd83 | tokumaru-y/CompetitiveCPP | typical90/resolved/22.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> dx{ 1, 0, -1, 0 };
vector<int> dy{ 0, 1, 0, -1 };
unsigned long long A,B,C;
unsigned long long ans;
void input() {
cin >> A >> B >> C;
}
unsigned long long gcd(unsigned long long a,... | ALGO | 0.999971 | 4.890017 |
9e1da26d-a414-4eab-83ef-deb4bbe5559a | Tejalpatel2099/Leetcode | 1358-number-of-substrings-containing-all-three-characters/1358-number-of-substrings-containing-all-three-characters.cpp | class Solution {
public:
int numberOfSubstrings(string s) {
int count = 0, j = 0;
int lastSeen[3] = {0, 0, 0}; // array to count 'a', 'b', 'c'
for (int i = 0; i < s.size(); ++i) {
lastSeen[s[i] - 'a']++;
while (lastSeen[0] > 0 && lastSeen[1] > 0 && lastSeen[2] > 0) {
... | ALGO | 0.999948 | 5.961569 |
c6531e3e-c781-4817-aeec-2837b3ba9dc2 | akashsuri1/cpp_dsa | c++_dsa/Maths/Multiply_Strings.cpp | #include<bits/stdc++.h>
using namespace std;
string multiplystrings(string num1,string num2){
if(num1.size()==0 || num2.size()==0){
return "0";
}
vector<int> result(num1.size()+num2.size(),0);
int shift=0;
for(int i=num2.size()-1;i>=0;i--){
int carry=0;
int position=0;
... | ALGO | 0.99997 | 4.957157 |
eceec0b4-8267-4eb8-9ce7-272bc415159a | Nikhilbardeja/cpp_assignment | 1/59.cpp | #include <iostream>
using namespace std;
int main() {
int a = 20, b = 40, max, lcm;
max = a;
if (max<b) max = b;
lcm = max;
while(true){
if(lcm%a == 0 && lcm%b==0) break;
lcm++;
}
cout<<lcm;
return 0;
} | ALGO | 0.999884 | 3.898088 |
d4f7228b-aa78-4f1a-8894-fe0f7ce7ec6f | fuzzuf/fuzzuf | optimizer/slopt/thompson_sampling.cpp | #include "fuzzuf/optimizer/slopt/thompson_sampling.hpp"
#include <boost/math/distributions/beta.hpp>
#include <boost/random.hpp>
#include <random>
namespace fuzzuf::optimizer::slopt {
ThompsonSampling::ThompsonSampling(size_t _num_arms)
: num_arms(_num_arms), num_selected(num_arms), num_rewarded(num_arms) {}
//... | ALGO | 0.99939 | 7.417779 |
3c81947d-3353-4f73-8bfa-492aa34122bd | jarir2020/Problem-Solving | liteOj/cpp/false_ordering.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
const int MAX_N = 1000;
// Array to store the precalculated number of divisors
int divisorsCount[MAX_N + 1];
// Function to precalculate the number of divisors for each number
void calculateDivisorsCount() {
for (int ... | ALGO | 0.999963 | 6.577069 |
56d6010d-514e-4f7b-96bd-544a8eeeaf26 | nflorina/algorithms | lab01/cpp/task-3/main.cpp | #include <iostream>
#include <fstream>
#include <vector>
using namespace std;
class Task {
public:
void solve() {
read_input();
print_output(get_result(n, x, y));
}
private:
int n, x, y;
void read_input() {
ifstream fin("in");
fin >> n >> x >> y;
fin.close();
}
// (x, y) in dreptunghiul [ (tlx, tly... | ALGO | 0.997195 | 3.905352 |
4845f4d1-e6e6-43b3-bd8a-efe031f0f80e | tangjz/TDL | training-2016-autumn/2016-11-06/G - Primorial vs LCM - tjz.cpp | #include <cmath>
#include <stdio.h>
typedef long long LL;
const int maxn = 10000001, mod = 1000000007;
int t, tot, prime[maxn], d[maxn], s[maxn];
LL n;
LL Pow(LL x, int k)
{
LL ret = 1;
for( ; k; k >>= 1, x = x * x)
if(k & 1)
ret = ret * x;
return ret;
}
LL Root(LL x, int k)
{
LL y = (LL)floor(exp(log(x) / k))... | ALGO | 0.999823 | 4.221089 |
5047016e-3590-4623-879f-9c0c7cab0598 | dpariag/leetcode | number_matching_subseqs.cpp | // Leetcode: https://leetcode.com/problems/number-of-matching-subsequences/description/
// https://leetcode.com/problems/number-of-matching-subsequences/description/
// Given a string s, and a list of words, find the number of words that are subsequences of s.
// Brute Force: Generate all subsequences of s, and match ... | ALGO | 0.999877 | 6.846915 |
2e4876c5-fbac-4c63-86d8-4a9e6c8a69c4 | levinsv/pgadmin3 | pgscript/utilities/m_apm/mapm_mul.cpp | /*
*
* This file contains basic multiplication function.
*
*/
#include "pgAdmin3.h"
#include "pgscript/utilities/mapm-lib/m_apm_lc.h"
extern void M_fast_multiply(M_APM, M_APM, M_APM);
/****************************************************************************/
void m_apm_multiply(M_APM r, M_APM a, M_APM b... | ALGO | 0.997556 | 3.940645 |
20efde45-bf8b-49e4-870b-716eb61faaef | PhoenixAthens/Essentials_of_CPP | EssentialsOfCPP/using_const.cpp | //
// usingConst.cpp
// EssentialsOfCPP
//
// Created by Anmol Khanna on 03/04/24.
//
#include <stdio.h>
#include <iostream>
#include <vector>
using std::vector;
using std::cout;
using std::endl;
int sum_of_vector();
int sum_of_vector_2();
int sum_of_vector_3();
int main(){
cout<<"The sum is (contraint impos... | TOOL | 0.914299 | 4.141405 |
f9846c3b-5ee9-4d15-9188-fa556ef1d3a3 | cliatyw/UE4 | Engine/Plugins/Experimental/ControlRig/Source/ControlRig/Private/Math/Simulation/CRSimContainer.cpp | #include "Math/Simulation/CRSimContainer.h"
void FCRSimContainer::Reset()
{
AccumulatedTime = TimeLeftForStep = 0.f;
}
void FCRSimContainer::ResetTime()
{
AccumulatedTime = TimeLeftForStep = 0.f;
}
void FCRSimContainer::StepVerlet(float InDeltaTime, float InBlend)
{
TimeLeftForStep -= InDeltaTime;
if (TimeLeftF... | ALGO | 0.858928 | 6.033599 |
70bef249-ba1c-4c4d-92e6-abd6951a536d | prashant7210/C-plus-plus-with-DSA | Merge_sort/new.cpp | #include <iostream>
using namespace std;
void merge(int arr[], int l, int mid, int r);
void merge_sort(int arr[], int l, int r);
int main(){
int n; cin>>n;
int arr[n];
for(int i=0; i<n; i++){
cin>>arr[i];
}
merge_sort(arr,0,n-1);
for(int i=0; i<n; i++){
cout<<arr[i]<<" ";
}
... | ALGO | 0.999984 | 4.474061 |
ab5ae05d-7af0-4856-b3c2-806d1b3cb333 | trantrongnb/Lap_Trinh_CPP_PTIT | đổi chỗ chữ số.cpp | #include<iostream>
using namespace std;
#include<map>
#include<string>
#include<set>
#include<algorithm>
#include<vector>
#include<sstream>
#define ll long long
int MAX=1e9+7;
using namespace std;
void check(){
string s;cin>>s;
int idx=s.size()-2;
while(idx>=0&&s[idx]<=s[idx+1]) idx--;
if(idx==-1){
... | ALGO | 0.999683 | 4.21638 |
48eb65b2-829c-48a2-8d32-fdeee827de9a | PACOVA/Tfg_Vankillo | vankillosl/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.998121 | 6.76073 |
7f77c6e5-5eb1-49ba-8c10-b85e76e0055a | goldcoin/goldcoin-0.7.5 | BuildDeps/deps/boost/libs/graph/example/bellman-ford-internet.cpp | int
main()
{
using namespace boost;
// ID numbers for the routers (vertices).
enum
{ A, B, C, D, E, F, G, H, n_vertices };
const int n_edges = 11;
typedef std::pair < int, int >Edge;
// The list of connections between routers stored in an array.
Edge edges[] = {
Edge(A, B), Edge(A, C),
Edge(B... | ALGO | 0.999715 | 4.852907 |
c49b9135-4c6a-434d-a98c-af163a3255d9 | cubercsl/The-road-to-ACMer | UVaOJ/UVa247.cpp | // Calling Circles, ACM/ICPC World Finals 1996, UVa247
/*Sample Input
5 6
Ben Alexander
Alexander Dolly
Dolly Ben
Dolly Benedict
Benedict Dolly
Alexander Aaron
14 34
John Aaron
Aaron Benedict
Betsy John
Betsy Ringo
Ringo Dolly
Benedict Paul
John Betsy
John Aaron
Benedict George
Dolly Ringo
Paul Martha
George Ben
Alexa... | ALGO | 0.999937 | 4.210112 |
ca13d76e-4908-4ea7-a96e-337e87d0f90b | atmark-techno/atmark-dist | lib/STLport/test/regression/ptition0.cpp | // STLport regression testsuite component.
// To compile as a separate example, please #define MAIN.
#include <algorithm>
#include <iostream>
#ifdef MAIN
#define ptition0_test main
#endif
#if !defined (STLPORT) || defined(__STL_USE_NAMESPACES)
using namespace std;
#endif
static int less_10(int a_)
{
return a_ < 1... | TEST | 0.862049 | 6.333739 |
1d9ee277-4f64-4f05-b891-aa333a4476f9 | BinomialSheep/CompetitiveCpp | AtcoderProblems/典型90/20_LogInequality.cpp | #pragma region header
#include <bits/stdc++.h>
// デバッグ用マクロ：https://naskya.net/post/0002/
#ifdef LOCAL
#include <debug_print.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using vi = vector<int>... | ALGO | 0.999832 | 4.438293 |
5054a66f-b535-4013-a032-b51cd3ba1fe0 | Adityalad-25/Recursion | 15.reverseStack.cpp | /*gfg link :- https://practice.geeksforgeeks.org/problems/reverse-a-stack/1
You are given a stack St. You have to reverse the stack using recursion.
Example 1:
Input:
St = {3,2,1,7,6}
Output:
{6,7,1,2,3}
Explanation:
Input stack after reversing will look like the stack in the output.
*/
//{ Driver Code Starts
//Init... | ALGO | 0.999817 | 6.204655 |
f059010d-546b-4336-987e-3fcdf9f4f79a | hardcao/leetCode | singleNumber.cpp | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
class Solution {
public:
int singleNumber(int A[], int n) {
int one = 0;
int two = 0;
int three = 0;
for(int i=0;i<n;i++) {
two |= one&A[i];
one^=A[i];
three=one&two;
one&= ~three;
two&= ~three;
}... | ALGO | 0.999921 | 4.806823 |
afd6e695-c5cf-4c84-a86a-54f411a6f19c | VacioOlvido/LAB3 | LAB32.cpp | // LAB32.cpp : Этот файл содержит функцию "main". Здесь начинается и заканчивается выполнение программы.
//
#include <iostream>
//#include <iostream> Подкючает библиотеку input-output stream для вывода и ввода в консоль
#include <Windows.h>
//#include <Windows.h> позволяет работать с кирилицей в консоли, включает функ... | ALGO | 0.958252 | 3.68292 |
6995f57d-932c-4b6e-829e-3e5f719f63c3 | riz1-ali/Codeforces_Solutions | 1051C.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define f first
#define s second
typedef long long int ll;
int main()
{
vector<ll> v;
map<ll,ll> m;
map<ll,char> val;
set<ll> a,b,rep,uni,uni2;
string s;
ll n,i,x;
bool flag=1;
cin>>n;
for(i=0;i<n;i... | ALGO | 0.999982 | 3.705799 |
04d5cf98-bda5-48e5-953d-017c859d5817 | Kaiyilin/CplusLearning | Variables.cpp | /* Variables in C++
int - stores integers (whole numbers), without decimals, such as 123 or -123
double - stores floating point numbers, with decimals, such as 19.99 or -19.99
char - stores single characters, such as 'a' or 'B'. Char values are surrounded by single quotes
string - stores text, such as "Hello World". St... | TOOL | 0.88262 | 3.870261 |
e01daddb-c95b-4960-86f0-bdc303dacee6 | harsh735/practice-problems | merge-two-sorted-lists/merge-two-sorted-lists.cpp | /**
* 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* mergeTwoLis... | ALGO | 0.999926 | 5.711828 |
e91e8c8d-14cf-4d58-b74e-1515298de72c | Changhe160/cplusplus2019-2020-2 | code/chapter6.0/Fraction.cpp | #include "Fraction.h"
void Fraction::reduce() {
int num = gcd(abs(m_numerator), abs(m_denominator));//ȡӷĸԼ
m_denominator /= num;
m_numerator /= num;
}
int Fraction::gcd(int x, int y)//շת
{
if (y != 0)
gcd(y, x%y); //ݹ
else //ʡ
return x; //y=0ʱؽ
}
Fraction::Fraction(int a, int b)
:m_numerator(a), m_denominato... | TOOL | 0.94655 | 4.875124 |
21692030-1ae4-4e8c-a0d7-71949657c776 | abdull-ah-med/PF | Week5/PF-LAB-WEEK-5/task05.cpp | #include <iostream>
#include <cmath>
using namespace std;
int power(int num, int num2);
main()
{
system("cls");
int num, num2, result;
cout << "Enter 1st number: ";
cin >> num;
cout << "Enter 2nd number: ";
cin >> num2;
result = power(num, num2);
cout << "Number 1 (" << num << ") raised ... | ALGO | 0.995614 | 5.042934 |
0d9af07c-aac0-4356-8ada-bb112c648a90 | DikshaNautiyal06/leetcode_dsa | 1878-check-if-array-is-sorted-and-rotated/check-if-array-is-sorted-and-rotated.cpp | class Solution {
public:
bool check(vector<int>& nums) {
int count=0;
int n=nums.size()-1;
for(int i=1;i<nums.size();i++){
if(nums[i-1]>nums[i]){
count++;
}
}
if(nums[n ] > nums[0]) {
count++;
}
... | ALGO | 0.999982 | 5.534591 |
81cd0efe-0038-47c5-a042-5772379af6f0 | copydev/CodeForces | Round612/C.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,n) for(ll i = 0;i<n;++i)
int main() {
int n;
cin>> n;
int arr[n];
ll odd = 0;
ll even = 0;
ll oddleft, evenleft;
REP(i,n){
cin>>arr[i];
if(arr[i]%2 == 0){
even++;
}
else{
odd++;
}
}
if(n%2 == 0){
oddleft =... | ALGO | 0.999958 | 3.831128 |
fd8540f7-6ffd-45d8-bf65-35f659caf6fb | tushev/ta_conditional_quicksort | main.cpp | #include <vector>
#include <iterator>
#include <string>
#include <sstream>
#include <iostream>
using namespace std;
#include "main.hpp"
size_t defined_array_length;
string input_buffer;
vector<int> input_array;
int main(int argc, char *argv[])
{
getline(cin, input_buffer);
{
stringstream iss(input_buffer);
i... | ALGO | 0.999651 | 4.859301 |
98760115-0ac1-4dcb-a50f-1e34ee506d12 | LIVE-EMPIRE/LITZLERTOTO | Engine/Source/ThirdParty/PhysX/PhysX_3.4/Source/GeomUtils/src/pcm/GuPCMTriangleContactGen.cpp | #include "GuGeometryUnion.h"
#include "GuPCMTriangleContactGen.h"
#include "GuPCMContactConvexCommon.h"
#include "GuVecTriangle.h"
#include "GuBarycentricCoordinates.h"
#if PCM_LOW_LEVEL_DEBUG
#include "PxRenderBuffer.h"
#endif
#define EDGE_EDGE_GAUSS_MAP 0
#define BRUTE_FORCE_EDGE_EDGE 0
using namespace physx;
usi... | ALGO | 0.994985 | 4.8423 |
6e3fcf0a-c9c6-4139-b925-ba2f9ee5c8fa | miscalculation53/library | verify/yosupo/and_or_convolution.test.cpp | #define PROBLEM "https://judge.yosupo.jp/problem/bitwise_and_convolution"
#define SINGLE_TESTCASE
// #define MULTI_TESTCASE
// #define AOJ_TESTCASE
#ifndef LOCAL
#define FAST_IO
// #define FAST_CIO
// #define INTERACTIVE
#endif
#define INF 4'000'000'000'000'000'037LL
#define EPS 1e-11
#include "template/template_al... | ALGO | 0.999757 | 4.967092 |
03a657de-0e6a-46f3-a535-0389a6f95090 | Himanshu3198/Dynamic-Programming-DSA-Series | LCS-97. Interleaving String.cpp | class Solution
{
public:
int dp[101][101][201];
bool solve(string &s1, string &s2, string &s3, int i, int j, int k, string str)
{
// condition to check given string is equal to desired string? and all character from both string utilised or not!
if (str == s3 && i >= s1.size() && j >= s2.size() && k... | ALGO | 0.999984 | 5.471563 |
6ff6079f-03aa-4867-b0f1-cedee238397a | jungh150/PS | baekjoon/5568.cpp | #include <iostream>
#include <vector>
#include <set>
#include <string>
using namespace std;
int n, k;
vector<int> card;
vector<bool> chk;
set<int> ans;
void dfs(int cnt, string num) {
if (cnt == k) {
ans.insert(stoi(num));
return;
}
for (int i = 0; i < n; i++) {
if (!chk[i]) {
... | ALGO | 0.999943 | 4.749061 |
99572c85-eaab-4566-9645-8a1cae5bf663 | Mabbus44/cProjects | Advent of code 2018/Day04/main.cpp | #include <iostream>
#include <fstream>
#include <string>
#include <list>
#include "Event.h"
#include "Guard.h"
using namespace std;
int main()
{
ifstream input;
string line;
list<string> inputList;
list<Event> eventList;
list<Guard> guardList;
Guard* activeGuard;
int bestGuardSleepTime = 0;
int bestGu... | ALGO | 0.994863 | 4.935693 |
4a47e205-fd8b-429f-9f41-706c7aacccf8 | zomb-zomb/VIW-SLAM | vins_estimator/src/initial/solve_5pts.cpp | #include "../../include/initial/solve_5pts.h"
namespace cv {
void decomposeEssentialMat( InputArray _E, OutputArray _R1, OutputArray _R2, OutputArray _t )
{
Mat E = _E.getMat().reshape(1, 3);
CV_Assert(E.cols == 3 && E.rows == 3);
Mat D, U, Vt;
SVD::compute(E, D, U, Vt);
... | ALGO | 0.999772 | 6.119298 |
abe0993e-e0f4-4220-a5d0-d3066f4a994b | yousuf-cse-bd/CodesMateCPP | TriangleUsingRecursion2.cpp | /**
* @file TriangleUsingRecursion2.cpp
* @author Md. Yousuf Ali (<EMAIL>)
* @brief Draw an upper triangle using recursion and single loop
* @version 0.1
* @date 2023-04-12
* @since WednesDay; 05:12 AM
* @copyright Copyright (c) 2023
* @institute: Dept. of CSE, Varendra University, Rajshahi, Bangladesh
*/
#inc... | ALGO | 0.995951 | 6.589022 |
1e64ac95-55a8-4975-88ab-6c5dba83fcdc | open-algebra/Oasis | src/Multiply.cpp | //
// Created by Matthew McCall on 8/10/23.
//
#include "Oasis/Multiply.hpp"
#include "Oasis/Add.hpp"
#include "Oasis/Divide.hpp"
#include "Oasis/Exponent.hpp"
#include "Oasis/Imaginary.hpp"
#include "Oasis/Integral.hpp"
#include "Oasis/Matrix.hpp"
#include "Oasis/RecursiveCast.hpp"
#define EPSILON 10E-6
namespace O... | TOOL | 0.972425 | 6.311344 |
1d7873f5-2212-4141-8238-28ef434ccba8 | merego/scrippa | C++/NRinC302/legacy/nr2/CPP_211/examples/xzriddr.cpp | #include <iostream>
#include <iomanip>
#include "nr.h"
using namespace std;
// Driver for routine zriddr
DP fx(const DP x)
{
return NR::bessj0(x);
}
int main(void)
{
const int N=100,NBMAX=20;
const DP X1=1.0,X2=50.0;
int i,nb=NBMAX;
DP xacc,root;
Vec_DP xb1(NBMAX),xb2(... | ALGO | 0.999934 | 4.21359 |
1db2821f-8701-4a6f-a8f9-e7bf40d06e6e | infiniflow/finity | src/storage/invertedindex/posting_iterator.cpp | module;
#include "common/utility/builtin.h"
#include <cassert>
#include <cstdlib>
#include <vector>
import stl;
import byte_slice_reader;
import posting_list_format;
import term_meta;
import in_doc_pos_iterator;
import multi_posting_decoder;
import segment_posting;
import in_doc_pos_state;
import index_defines;
impor... | TOOL | 0.855306 | 6.790718 |
1ddbaad2-e1f4-4072-9822-6ac13602ca47 | jancokOS/android_frameworks_av | media/libstagefright/codecs/amrwb/src/wb_syn_filt.cpp | /*
------------------------------------------------------------------------------
Filename: wb_syn_filt.cpp
Date: 05/08/2004
------------------------------------------------------------------------------
REVISION HISTORY
Description:
-------------------------------------------------------------------------... | ALGO | 0.999917 | 4.836874 |
c95b1565-9922-4dcd-875c-8a795ed35139 | Thenaidn/codetree_practice | 241102/자주 등장한 top k 숫자/top-k-frequent-elements.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <unordered_map>
#include <string>
using namespace std;
#define MAX_N 100001
#define MOD 1000000007
int n, m;
int a, b, c, d, e;
int arr[MAX_N];
string t;
bool cmp(pair<int,int> a, pair<int,int>b){
if (a.second == b.second) {... | ALGO | 0.999973 | 4.091075 |
89b05ac6-7e96-4997-9d7b-bee849a4aba3 | M0xYasser/Problem-Solving | Codeforces Solutions/Codeforces Round #111 (Div. 2) - 160/160A-Twins.cpp | /*
Author : Mohamed Yasser
userName : M0xYasser
Date & Time : September 23, 2021 - 21:43:08
*/
#include <bits/stdc++.h>
using namespace std;
#define loop0(i,n) for (int i(0);i<n;i++)
#define pre(n) fixed << setprecision(n)
void fast (){
ios::sync_with_stdio(false);
cin.tie(0);
}
int main(){
fas... | ALGO | 0.999941 | 4.093621 |
064f9c12-5a3e-48c0-8fec-4244174c62c6 | lanl/kitsune-old | llvm/lib/CodeGen/RegAllocBasic.cpp | #include "AllocationOrder.h"
#include "LiveDebugVariables.h"
#include "RegAllocBase.h"
#include "Spiller.h"
#include "llvm/Analysis/AliasAnalysis.h"
#include "llvm/CodeGen/CalcSpillWeights.h"
#include "llvm/CodeGen/LiveIntervalAnalysis.h"
#include "llvm/CodeGen/LiveRangeEdit.h"
#include "llvm/CodeGen/LiveRegMatrix.h"
#... | ALGO | 0.939369 | 7.846656 |
c6e6d435-089d-4927-9684-07067369e80f | HarshitaSadadekar/Codechef_questions | Greedy_Algos/min_AbsDiff.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,i; cin>>n;
vector<int> a;
for(i=0;i<n;i++){
int c; cin>>c;
a.push_back(c);
}
sort(a.begin(),a.end());
int ans= abs(a[0]-a[1]);
for(i=1;i<a.size();i++){
if(abs(a[i]-a[i-1])<ans){
ans=abs(a[i]-a... | ALGO | 0.9999 | 3.675211 |
51819dbc-7f3c-46d2-90ab-2cadba8bab5b | raincross7/code-similarity | codes/train_code/problem335/problem335_160.cpp | #include<bits/stdc++.h>
typedef long long ll;
inline ll read() {ll x = 0;char ch = getchar(), w = 1;while(ch < '0' || ch > '9') {
if(ch == '-') w = -1;ch = getchar();}while(ch >= '0' && ch <= '9') {x = x * 10 + ch - '0';ch = getchar();
}return x * w;}
void write(ll x) {if(x < 0) putchar('-'), x = -x;if(x > 9) write(x /... | ALGO | 0.999993 | 3.688584 |
0e98ad5c-5bb8-4367-8296-c171ca68d462 | HarshSinghgithub/Striver-Dynamic-Programming | Graph/Topological_Sort.cpp | class Solution
{
public:
//Function to return list containing vertices in Topological orde
void dfs(int node, vector<int> adj[], vector<int> &vis, stack<int> &st){
vis[node] = 1;
for(int next_node : adj[node]){
if(vis[next_node] == 0){
dfs(next_node, adj, vis, st);
}
... | ALGO | 0.999996 | 5.883394 |
8931453d-41a1-483f-a327-1e92df3469f5 | thiagotps/lmscpp | deps/eigen-3.4.0/bench/spbench/test_sparseLU.cpp | // Small bench routine for Eigen available in Eigen
// (C) Desire NUENTSA WAKAM, INRIA
#include <iostream>
#include <fstream>
#include <iomanip>
#include <unsupported/Eigen/SparseExtra>
#include <Eigen/SparseLU>
#include <bench/BenchTimer.h>
#ifdef EIGEN_METIS_SUPPORT
#include <Eigen/MetisSupport>
#endif
using namesp... | ALGO | 0.994878 | 4.273294 |
28eecb02-1c55-4da0-a3b8-aa45c4f71050 | elect000/proc | w1/problem5-bak.cpp | // Football
#include <stdio.h>
#include <string.h>
#include <sstream>
#include <istream>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
string teams [30];
int team_info [30][6];
// 0 1 2 3
// game_played win tie losses
// 4 5
// goal_score goal_against
int tea... | ALGO | 0.999133 | 3.98268 |
ca69d993-e431-400b-a17c-ee3228996d9d | Xiangyu-Hu/SPHinXsys | tests/2d_examples/test_2d_dambreak/Dambreak.cpp | /**
* @file dambreak.cpp
* @brief 2D dambreak example.
* @details This is the one of the basic test cases, also the first case for
* understanding SPH method for free surface flow simulation.
* @author Luhui Han, Chi Zhang and Xiangyu Hu
*/
#include "sphinxsys.h" //SPHinXsys Library.
using namespace SPH; // Nam... | ALGO | 0.98577 | 5.612378 |
a6549f6b-d58d-4045-832c-a27eb0a231e9 | SnowyField1906/university-of-science | Programming 2/tests/2020-2021/21CTT5/main.cpp | #include <iostream>
#include <stdlib.h>
using namespace std;
struct Date {
int day;
int month;
int year;
};
struct Record {
Date date;
float weight;
float height;
};
void InputARecord(Record &record) {
cout << "\tInput the date:" << endl;
cout << "\t\tDay: "; cin >> record.date.day;
... | ALGO | 0.998332 | 4.019919 |
f4032a00-8738-4720-9f79-89762aeeb2ff | suchiwon/algorithm | simple/1254_make_pelindrom.cpp | #include <iostream>
#include <string>
using namespace std;
bool bPelindrom(const char* subStr, int start, int end)
{
while(start <= end)
{
if(subStr[start] != subStr[end])
return false;
start++;
end--;
}
return true;
}
int main()
{
int i = 0, size;
string str;
cin >> str;
size = str.size();
f... | ALGO | 0.999879 | 3.838968 |
5fceca34-7aa6-4716-a68c-f1813f97bcaf | AppalachiaInteractive/com.appalachia.unity3d.audio | src/NativeCode~/Plugin_Granulator.cpp | #include "AudioPluginUtil.h"
namespace Granulator
{
const int MAXGRAINS = 500;
const int MAXDELAYLENGTH = 0x40000;
const int MAXSAMPLE = 16;
Mutex sampleMutex;
int debug_graincount = 0;
struct GranulatorSample
{
float* data;
float* preview;
int numsamples;
... | TOOL | 0.855033 | 6.615296 |
6a7f8596-d47b-4651-8de6-4f6d2d560e3c | pratapshingane18/String | ToggleCases.cpp | #include<iostream>
using namespace std;
int main(){
char s[] = "wElCoMe";
int i;
for(i=0; s[i]!='\0'; i++){
if(s[i] >= 65 && s[i] <=90){
s[i] = s[i]+32;
}
else if(s[i] >=97 && s[i]<='z'){
s[i] -= 32;
}
}
cout<<"Changed stri... | ALGO | 0.989022 | 4.302739 |
3bdd0112-5771-4d2d-84f7-d5f62b42c22e | sid24ss/multi_agent_planner | multi_agent_planner/src/MotionPrimitives/PolicyGenerator.cpp | #include <multi_agent_planner/MotionPrimitives/PolicyGenerator.h>
#include <multi_agent_planner/LoggerNames.h>
#include <multi_agent_planner/Constants.h>
#include <multi_agent_planner/Utilities.h>
#include <costmap_2d/cost_values.h>
#include <cassert>
#include <cmath>
using namespace multi_agent_planner;
PolicyGenera... | ALGO | 0.999896 | 5.400418 |
f49a4b60-478b-4f58-94b2-2e68fddb8bd9 | KaiKostack/blender-demolition | extern/bullet2/src/BulletCollision/CollisionShapes/btPolyhedralConvexShape.cpp | //#if defined (_WIN32) || defined (__i386__)
//#define BT_USE_SSE_IN_API
//#endif
#include "BulletCollision/CollisionShapes/btPolyhedralConvexShape.h"
#include "btConvexPolyhedron.h"
#include "LinearMath/btConvexHullComputer.h"
#include <new>
#include "LinearMath/btGeometryUtil.h"
#include "LinearMath/btGrahamScan2dCo... | ALGO | 0.985411 | 6.91544 |
51ced19d-6992-4ec6-b008-746eaf197a4a | hogyny/updated_Cpp | RelativePrimes.cpp | #include<iostream>
using namespace std;
int relative(int a, int b){
int i;
int sta;
for (i = 1; i <= a; i++){
if(a % i == 0 && b % i ==0){
sta = i;
}
}
return sta;
}
int main(){
int num1, num2;
cout << "Give two numbers: ";
cin >> num1 >> num2;
... | ALGO | 0.999153 | 4.447514 |
d09ffb1f-58ec-47ec-b779-e35eeb7663d2 | amacalito/leetcode | algorithms/cpp/scrambleString/scrambleString.cpp | // Source : https://oj.leetcode.com/problems/scramble-string/
// Author : Hao Chen
// Date : 2014-10-09
/**********************************************************************************
*
* Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
*
* Be... | ALGO | 0.999967 | 6.062487 |
6ea376b7-878f-4d27-90a7-d1763b49f09b | joery0x3b800001/LEETCODE-150-Days | 150/GraphGeneral/FastImpl/133.cpp | // Clone Graph
// https://leetcode.com/problems/clone-graph/description/?envType=study-plan-v2&envId=top-interview-150
// https://en.wikipedia.org/wiki/Connectivity_(graph_theory)#Connected_graph
// https://en.wikipedia.org/wiki/Object_copying#Deep_copy
#include <bits/stdc++.h>
using namespace std;
// Definition f... | ALGO | 0.999874 | 6.773855 |
fc05ea78-2050-480e-b614-483a5a69babd | jpmaus/sonic-visualiser-tweak | sonic-visualiser-tweak-src/sv-dependency-builds/src/vamp-plugin-sdk-2.5/examples/SpectralCentroid.cpp | /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
#include "SpectralCentroid.h"
using std::string;
using std::vector;
using std::cerr;
using std::endl;
#include <math.h>
#ifdef __SUNPRO_CC
#include <ieeefp.h>
#define isinf(x) (!finite(x))
#endif
#ifdef WIN32
#define isnan(x) false
#def... | TOOL | 0.958587 | 5.983606 |
ccc686b2-0fa1-49d8-8782-ecf7fe5fa0bf | Alzarus/URI_ONLINE_JUDGE | Iniciante/1073-quadrado-de-pares.cpp | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
if(n < 0 || n > 2000)
return -1;
for(int i = 1; i <= n; i ++){
if(i % 2 == 0){
cout << i << "^2 = " << (i*i) << endl;
}
}
return 0;
}
| ALGO | 0.997546 | 4.154073 |
9ef7874c-16ad-4862-ac13-b8c40bbc9dc7 | wazidu/solved-problems | uri1001 basic.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0);
long long int a,b;
cin>>a>>b;
cout<<"X = "<<a+b<<endl;
return 0;
}
| ALGO | 0.985755 | 3.390425 |
c439a7d7-ae61-4e9a-b716-8fa58b6e499a | AliPervaiz/Project-Euler-Public | 0030. Digit Fifth Powers/main.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;
#define rep(i,a,b) for(auto i=(a); i<(b); ++i)
#define repc(i,a,b,c) for(auto i=(a); i<(b); i+=c)
#define repn(i,a,b) for(auto i=(a); i>(b); --i)
#define trav(a,x)... | ALGO | 0.999658 | 5.309294 |
60b76f8d-679b-4caf-b906-5e19497c2237 | ishandutta2007/codeforces | belonogov/normal/949/D.cpp | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),a.end()
#define pw(x) (1LL<<(x))
#define db(x) cerr << #x << " = " << x << endl
#define db2(x, y) cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define db3(x... | ALGO | 0.999973 | 3.940424 |
69e0eee2-f6f2-497b-a030-a494e4493f13 | ar5had/cs-106B | Assignment3/4-StockCutting/lib/StanfordCPPLib/stacktrace/call_stack_windows.cpp | /* Windows implementation of the call_stack class. */
#ifdef _WIN32
#include "call_stack.h"
#include <windows.h>
# undef MOUSE_EVENT
# undef KEY_EVENT
# undef MOUSE_MOVED
# undef HELP_KEY
#include <tchar.h>
#include <assert.h>
#include <errno.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <si... | TOOL | 0.904805 | 6.27262 |
fd5ccedd-7279-4886-b5b1-c3ccdaf15869 | XJDKC/University-Code-Archive | Course Experiment/Computer Network Course Exp/No.1 Simple HTTP Server/GUI/Config.cpp | #include "Config.h"
#include <iostream>
#include <fstream>
using namespace std;
Config::Config(void)
{
}
Config::~Config(void)
{
}
int Config::getConfig()
{
int colon,tail;
string ori,key,value;
ifstream inFile("Config.yml");
Config::setDefault();
if (!inFile.is_open())
{
cout << "Fail to open the config fi... | CONFIG | 0.903465 | 4.038475 |
09c20c58-93bf-43db-8b3c-723bbb62e9c3 | Ramazanm1nd3R/univer_learning_materials | Algoritmiz/Defence/Def3/bublesort.cpp | #include <iostream>
#include <vector>
int main() {
int n, sevenIndex = -1;
std::cin >> n;
std::vector<int> arr(n);
for (int i = 0; i < n; i++) {
std::cin >> arr[i];
if (arr[i] == 7 && sevenIndex == -1) {
sevenIndex = i;
}
}
if (sevenIndex != -1) {
for... | ALGO | 0.999987 | 4.174162 |
3b281a6d-b91d-4bf3-b065-a145f3577937 | KenetC/Procesamiento-de-Imagenes | eigen-3.4.0/bench/bench_norm.cpp | #include <typeinfo>
#include <iostream>
#include <Eigen/Core>
#include "BenchTimer.h"
using namespace Eigen;
using namespace std;
template<typename T>
EIGEN_DONT_INLINE typename T::Scalar sqsumNorm(T& v)
{
return v.norm();
}
template<typename T>
EIGEN_DONT_INLINE typename T::Scalar stableNorm(T& v)
{
return v.sta... | TEST | 0.975244 | 6.694365 |
a691dfcc-8b6e-4000-9909-1f04199af0cf | axelu/leetcode | cpp/00500-00999/palindromicsubstrings.cpp |
// 647. Palindromic Substrings
// https://leetcode.com/problems/palindromic-substrings/
class Solution {
public:
int countSubstrings(string s) {
size_t n = s.size();
if( n == 0 ) return 0;
if( n == 1 ) return 1;
if( n == 2 ) return s[0] == s[1] ? 3 : 2;
int mem[1000][1000]... | ALGO | 0.999937 | 6.659585 |
c4846078-bda1-49ab-98e2-a27a4715f0a6 | GrihsaIvanenko/code228 | ЛКШ/5#день/Алиса и Дракула/code.cpp | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
void solve(long long A, long long B) {
long long ans = 0;
if (B < 90) {
for (; B > 0; --B) {
ans = max(A / gcd(A, B) * B, ans);
... | ALGO | 0.999874 | 5.172276 |
f6e63814-4f20-44bc-add1-ab05f73f3023 | satyamsoni-01/Programming-Question-Practice | selection_sorting_with_recursion.cpp | #include<iostream>
using namespace std;
int selection_sorting(int ar[],int l)
{
return ar;
}
int main()
{
int arr[]={3,5,8,6,3,7,0,9,4,33,7,97,55,3,56};
return 0;
} | ALGO | 0.99992 | 3.339362 |
3efcbc73-2f78-45b6-be7c-9c6f34799ced | Minhquanzz1002/KTLT | KTLT_TH7/Bai_Toan_3.cpp | /*Ghi mang vao file , doc file va bo sung, sua, xoa*/
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#define MAX 100
void Input(int a[], int n);
void Output(int a[], int n);
void docfile (int b[], int &m);
void ghifile (int a[], int n);
void boSung(int a[], int &n);
void boSungVaoVTBatKi (int a[], int &n);
vo... | TOOL | 0.855168 | 3.071031 |
c2c14a53-8b27-46f1-8a08-3752d861d133 | Crewbee/Space-Racer-OpenGL | Libraries/Framework/Libraries/Bullet3/src/BulletCollision/CollisionShapes/btStridingMeshInterface.cpp | #include "btStridingMeshInterface.h"
#include "LinearMath/btSerializer.h"
btStridingMeshInterface::~btStridingMeshInterface()
{
}
void btStridingMeshInterface::InternalProcessAllTriangles(btInternalTriangleIndexCallback* callback, const btVector3& aabbMin, const btVector3& aabbMax) const
{
(void)aabbMin;
(void)aabb... | ALGO | 0.871394 | 6.528596 |
eff6da37-15bb-4b10-a2c2-9ac14154254f | AndroX2/frameworks_av | media/libstagefright/httplive/M3UParser.cpp | //#define LOG_NDEBUG 0
#define LOG_TAG "M3UParser"
#include <utils/Log.h>
#include "M3UParser.h"
#include <binder/Parcel.h>
#include <cutils/properties.h>
#include <media/stagefright/foundation/ADebug.h>
#include <media/stagefright/foundation/AMessage.h>
#include <media/stagefright/foundation/ByteUtils.h>
#include <me... | TOOL | 0.870171 | 6.320943 |
8c968810-4757-4935-a2f0-62c806459b1b | wyjoutstanding/Algorithm | AlgorithmNote/AlgorithmNote-Code/第4章 算法初步/二分/B1030.cpp | /*
* @Author: wuyangjun
* @Date: 2019-07-31 09:46:22
* @LastEditTime: 2019-07-31 09:58:06
* @Github: https://github.com/wyjoutstanding
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, p;
scanf("%d %d", &N, &p);
vector<int> res(N);
for(int i = 0; i < N; i++) {
scanf("%d",... | ALGO | 0.999994 | 3.957239 |
1f2efa43-97a7-48e1-b8bf-d539cd53662c | 21051576/leetcode | array_easy-q121.cpp | #include<iostream>
using namespace std;
int main(){
int n;
cout<<"Enter the number of prices"<<endl;
cin>>n;
int prices[n];
cout<<"Enter the prices one by one"<<endl;
int i;
for(i=0;i<n;i++){
cin>>prices[i];
}
int max=0,j;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
... | ALGO | 0.999648 | 3.825224 |
5697115f-d951-4c02-82d1-cef4e161e5ab | u2508/All-Programs | c++/inheritence.cpp | #include <iostream>
using namespace std;
class a
{public:
a();
~a();};
class b:public a
{private:
int a1=0,b1=0;
protected:
int sum;
public:
int vbb(){
cin>>a1>>b1;
sum=a1+b1;
cout<<sum<<endl;}};
class c :public b
{public :
int abc(){
vbb();
cout<<sum<<end... | ALGO | 0.975981 | 3.220643 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.