uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
5cd76448-dacf-4d09-af6f-d60ac478911f | bm-mit/Codeforces | 514A_ChewbaccaAndNumber.cpp | //* 202685392 Apr/19/2023 15:07UTC+7 Minh4893IT A - Chewbaсca and Number GNU C++17 Accepted 15 ms 0 KB
#include <bits/stdc++.h>
using namespace std;
int main()
{
char c;
cin >> c;
if (c >= '5')
if (c == '9')
cout << c;
else
cout << 9 - (c - '0');
else
c... | ALGO | 0.998923 | 5.266998 |
97b5f189-a173-4b31-a646-d45fd3dd697d | tsukuten/star_initializer | eigen-eigen-5a0156e40feb/bench/dense_solvers.cpp | #include <iostream>
#include "BenchTimer.h"
#include <Eigen/Dense>
#include <map>
#include <vector>
#include <string>
#include <sstream>
using namespace Eigen;
std::map<std::string,Array<float,1,8,DontAlign|RowMajor> > results;
std::vector<std::string> labels;
std::vector<Array2i> sizes;
template<typename Solver,type... | TOOL | 0.998521 | 6.32812 |
6b61187d-0cba-4bc4-8c47-ca32892b3695 | an920107/programming | C++/程式設計/0512_work.cpp | #include <bits/stdc++.h>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
struct node{
int data;
struct node *next;
};
typedef struct node Node;
void createQ();
void addQ(int);
void deleteQ();
void printList();
Node *Front, *Rear;
int main(i... | ALGO | 0.999144 | 4.34542 |
18a9d36b-0406-4ef9-a1ed-8c9c83728d8c | TosakaUCW/CompetitiveProgramming | Old/Luogu/[Luogu P1509] 找啊找啊找GF.cpp | #include <stdio.h>
#include <algorithm>
const int N = 1e2 + 5;
int n, M, R;
int m[N], r[N], time[N];
int f[N][N], g[N][N];
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d%d%d", &m[i], &r[i], &time[i]);
scanf("%d%d", &M, &R);
for (int i = 1; i <= n; i++)
for (int j... | ALGO | 0.999934 | 3.662812 |
521e8ae3-e4ab-4d14-8355-3e50625645b6 | Vaibhav6200/DSA_Practice | Stacks and Queues/easy/reverse_a_stack.cpp | #include<bits/stdc++.h>
using namespace std;
void push_at_bottom(stack<int> &st, int val){
// Base case
if(st.empty()){
st.push(val);
return;
}
int top = st.top();
st.pop();
// Recursive call
push_at_bottom(st, val);
st.push(top);
}
void reverse_stack(stack<int> &st){... | ALGO | 0.999851 | 5.015659 |
6b2af326-b08e-496c-a5bf-3c9a4acb6428 | Srihari192211120/datastructures-CSA0336 | sum of row and columns.cpp | #include <stdio.h>
int main()
{
int r,c,arr[100][100];
printf("Enter the number of rows and column\n");
scanf("%d %d",&r,&c);
printf("Enter the elements of the matrix\n");
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
scanf("%d",&arr[i][j]);
}
}
printf... | ALGO | 0.997174 | 3.29898 |
9ccf229c-0c18-47d1-b9c4-b3160f7a5648 | nicolaprezza/r-index | ri-build.cpp | #include <iostream>
#include "internal/r_index.hpp"
#include "utils.hpp"
#include "internal/r_index.hpp"
using namespace ri;
using namespace std;
string out_basename=string();
string input_file=string();
int sa_rate = 512;
bool sais=true;
ulint T = 0;//Build fast index with SA rate = T
bool fast = false;//build fast... | ALGO | 0.993272 | 4.959816 |
3c52ecff-4d66-4699-b3e3-3b1acf64fa1a | robotics-upo/neural_esdf_local | hector_quadrotor_noetic/hector_localization/hector_pose_estimation_core/src/filter/ekf.cpp | #include <hector_pose_estimation/filter/ekf.h>
#include <hector_pose_estimation/system.h>
#include <boost/pointer_cast.hpp>
#ifdef USE_HECTOR_TIMING
#include <hector_diagnostics/timing.h>
#endif
namespace hector_pose_estimation {
namespace filter {
EKF::EKF(State &state)
: Filter(state)
{}
EKF::~EKF()
{}
bool... | ALGO | 0.962835 | 7.307989 |
ef89c9b9-f418-4302-927f-41aa8b99c8c8 | dhirajpatil2346/compitative | codechef/starter 101/2nd.cpp | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define endl "\n"
void solve()
{
LL n, h;
cin >> n >> h;
vector<LL> v(n);
for (auto &val : v)
cin >> val;
sort(v.begin(), v.end());
LL ans = 1e9;
LL l = 0, r = v.back();
while (l <= r)
{
LL mid = (l + ... | ALGO | 0.999977 | 4.849347 |
b6af86d1-c529-418f-94c1-4b451d028f1a | SaiSandeepRaguru/CompetitiveCoding | 1925-count-nice-pairs-in-an-array/count-nice-pairs-in-an-array.cpp | class Solution {
public:
long long mod = 1000000007;
int rev(int a)
{
int n=0;
while(a!=0)
{
n = n*10 + a%10;
a/=10;
}
return n;
}
int countNicePairs(vector<int>& nums) {
int n=nums.size();
long long cnt=0;
... | ALGO | 0.999976 | 5.883315 |
b8c02d38-d6bb-42e8-a0fd-5109c9874cd4 | jhavishesh/100DaysOfCodes | Day-22/Possible Words From Phone Digits.cpp | /* https://practice.geeksforgeeks.org/problems/possible-words-from-phone-digits-1587115620/1/ */
//Solution:
vector<string> possibleWords(int a[], int N)
{
unordered_map<int, vector<string>>M;
M[2] = {"a", "b", "c"};
M[3] = {"d", "e", "f"};
M[4] = {"g", "h", "i"};... | ALGO | 0.999727 | 5.157837 |
fbbc204f-0c9e-470c-afb1-f334e3a0b4b7 | Avnerus/ichigo | ExternalLibs/cocos2dx/support/zip_support/unzip.cpp | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#ifndef NOUNCRYPT
#define NOUNCRYPT
#endif
#include "zlib.h"
#include "unzip.h"
#ifdef STDC
# include <stddef.h>
# include <string.h>
# include <stdlib.h>
#endif
#ifdef NO_ERRNO_H
extern int errno;
#else
# include <errno.h>
#endif
namespace... | TOOL | 0.932681 | 4.932162 |
b7476c6f-a670-485e-a0a7-b3f2c748a6ed | Seirisiii/submit | posn/C1T2.cpp | #include<bits/stdc++.h>
using namespace std;
int n;
int m,d;
int mn=INT_MAX,mx=INT_MIN;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(int i=0;i<n;++i){
int x;
cin>>x;
mn=min(mn,x);
mx=max(mx,x);
}
cin>>m>>d;
int diff=mx-mn;
for(i... | ALGO | 0.999866 | 3.233588 |
b1c10592-5b51-475b-a498-9c3f6c7db85e | flywzen/Learn-Cpp | .College-Task/Tugas 022.cpp | #include <iostream>
using namespace std;
class Queue {
private:
int* arr;
int front, rear, capacity, count;
public:
Queue(int size) {
capacity = size;
arr = new int[capacity];
front = 0;
rear = -1;
count = 0;
}
void enqueue(int value) {
if (count =... | ALGO | 0.912823 | 4.917093 |
6585f5bf-7e9f-4ec0-8c53-07d48629d5c2 | omkarlanghe/cracking-the-coding-interview | IsUnique.cpp | /*
* Implement an algorithm to determine if a string has all unique characters. what if you cannot use additional datastructures
*/
#include<iostream>
using namespace std;
int IsUnique(string &);
string sort(string &);
int main()
{
string str;
cout<<"enter string"<<endl;
cin>>str;
int flag = IsUnique(str);
if(... | ALGO | 0.999415 | 5.38774 |
b629b72c-444c-4f7a-bbd8-4500d61c4cb5 | hounche/opencv_ia-4.x_rep | 3rdparty/carotene/src/threshold.cpp | #include "common.hpp"
namespace CAROTENE_NS {
void thresholdBinary(const Size2D &size,
const u8 *srcBase, ptrdiff_t srcStride,
u8 *dstBase, ptrdiff_t dstStride,
u8 threshold, u8 trueValue, u8 falseValue)
{
internal::assertSupportedConfiguration();
#if... | ALGO | 0.993432 | 6.735574 |
44738a2c-4a4b-4861-ab44-7ad112307fd7 | YannamYeswanth/CS254 | LAB2/Q5/code.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
ifstream input_file("input.txt");
if(!input_file.is_open()){
cerr << "Error opening the input file" << endl;
}
ofstream output_file("output.txt");
if(!output_file.is_open()){
cerr << "Error opening the output file" << endl;
... | ALGO | 0.999783 | 4.46506 |
540f63b2-8533-4554-983a-af7616ee2b46 | pks2906/GFG | Medium/Maximum Product Subarray/maximum-product-subarray.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution{
public:
long long maxProduct(vector<int> arr, int n) {
long long minVal = arr[0];
long long maxVal = arr[0];
long long maxProduct = arr[0];
f... | ALGO | 0.999939 | 6.585245 |
6c0d4d4e-f7f5-4263-8f8a-0bcd5d7503f9 | Soumyaworks/AlgoVault | code_jam_2021/Qualifications/MoonsUm.cpp | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
#define ll long long int
#define pb push_back
#define mp make_pair
#define ld long double
#define fi first
#define se second
#define mod 1000000007
#define fill(a,x) memset(a,x,sizeof(a))
#... | ALGO | 0.999867 | 3.624247 |
b6b08554-01ca-49c2-b353-9b59735e153e | ishandutta2007/codeforces | burnedchicken/normal/1592/B.cpp | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2,fma,tune=native")
#define ll long long
#define int ll
#define ull unsigned ll
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) ... | ALGO | 0.999982 | 4.366087 |
926cd60c-c3e8-409f-aa01-383d367fc465 | strands-project/strands_perception_people | mdl_people_tracker/src/Detections.cpp | #include "Detections.h"
#include "AncillaryMethods.h"
using namespace std;
// ++++++++++++++++++++++++ constructor ++++++++++++++++++++++++++++++++++++++
Detections::Detections(int x, const int flag)
{
// sizeOfDetVec = x;
if (x == 22) {
offSet = 0;
} else {
offSet = 1;
}
img_num =... | ALGO | 0.959809 | 5.114687 |
0cc317a7-315f-4988-939e-c40d61ee55f5 | ydh0520/Algorithm | SW Expert Academy/4112.cpp | #include<iostream>
#include<vector>
#define INPUT_LIMIT 10000
using namespace std;
vector<int> sum_set;
int cal_sum(int n) {
return n*(n + 1) / 2;
}
void make_sum_set() {
int index = 0;
int sum = cal_sum(0);
while (sum < INPUT_LIMIT) {
sum = cal_sum(index);
sum_set.push_back(sum);
index++;
}
}
pair<in... | ALGO | 0.999856 | 4.07919 |
ad8134d9-79cf-4ea6-9678-62680319ffce | JinyuChata/leetcode_cpp | leetcode/editor/cn/931_minimum-falling-path-sum.cpp | //给你一个 n x n 的 方形 整数数组 matrix ，请你找出并返回通过 matrix 的下降路径 的 最小和 。
//
// 下降路径 可以从第一行中的任何元素开始，并从每一行中选择一个元素。在下一行选择的元素和当前行所选元素最多相隔一列（即位于正下方或者沿对角线向左或者向右的第
//一个元素）。具体来说，位置 (row, col) 的下一个元素应当是 (row + 1, col - 1)、(row + 1, col) 或者 (row + 1
//, col + 1) 。
//
//
//
// 示例 1：
//
//
//输入：matrix = [[2,1,3],[6,5,4],[7,8,9]]
//输出：13... | ALGO | 0.999993 | 6.487066 |
ff67b5c6-0ee7-4a0e-b97f-9db3390461d9 | Mumlul/System_bills | Билет 10/client10/client10.cpp | #include <windows.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <cctype>
#include <locale>
#include <sstream>
using namespace std;
int main() {
setlocale(LC_ALL, "Russian");
wchar_t buffer[1024];
DWORD bytesRead;
if (!ReadFile(GetStdHandle(STD_INPUT_HANDLE), buffer, size... | TOOL | 0.89928 | 4.252443 |
cb0e7ca8-b640-418b-8b88-9afe4600a063 | thegamer1907/Code_Analysis | DP/1477.cpp | #include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <vector>
#include <iomanip>
#include <cmath>
#include <map>
int a[100001], c[100001];
bool u[100002];
using namespace std;
int main() {
int n, m = 0, q = -1, p = 0;
cin >> n;
vector <long long> a(101);
for (long long i... | ALGO | 0.999924 | 3.471585 |
7a6eb3cb-d51f-4352-8885-828bc565e7a0 | Huzaifa-Abbasi/Sem3-DS | Lab 8/ex1.cpp | #include <iostream>
using namespace std;
int queue[100], n=100, front = -1, rear = -1;
void Insert(){
int val;
if (rear == n-1)
cout<< "Queue Overflow: ";
else if(front == -1)
front = 0;
cout<<"Inset the Element: "<<endl;
cin>>val;
rear++;
queue[rear]=val;
}
void Delete() {
if ... | ALGO | 0.923483 | 3.686421 |
8017a5c1-0737-444f-99b5-8f76d11d51e6 | sapjv/SAPJV_Codes | Bit Integers ( Bit Numbers )/Calculate pow(base,exponent) of large numbers.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define MAX 250
int multiply(int x , int result[] , int res_size)
{
int carry=0;
for(int i=0;i<res_size;i++)
{
int product = x*result[i]+carry;
result[i]=product%10;
carry=product/10;
}
while... | ALGO | 0.999933 | 4.693406 |
40633d79-cd99-4dd4-b918-8bc6a3e9ca42 | ArseniyKholod/stce_ss24_ex12 | thirdParty/eigen-3.4.0/lapack/svd.cpp | #include "lapack_common.h"
#include <Eigen/SVD>
// computes the singular values/vectors a general M-by-N matrix A using divide-and-conquer
EIGEN_LAPACK_FUNC(gesdd,(char *jobz, int *m, int* n, Scalar* a, int *lda, RealScalar *s, Scalar *u, int *ldu, Scalar *vt, int *ldvt, Scalar* /*work*/, int* lwork,
... | ALGO | 0.999291 | 5.526819 |
88228ca1-e63c-4934-bd42-81e72b2a5ff7 | willmomo/ry2kojima | etc/library/hsutil/hsutil.cpp | #include "hsutil.h"
// HsFindWindowEnumProcɓnp[^p\
typedef struct {
LPCTSTR lpClassName; // HsFindWindowɓnꂽ
LPCTSTR lpWindowName; // .. ..
DWORD dwFlags; // .. ..
HWND hwnd; // }b`EBhEւ̃nh
} HSFW_ENUM_PARAM, *PHSFW_ENUM_PARAM;
#define MAX_CLASS_NAME 2048
#define MAX_WINDOW_NAME 2048
//-----------------... | TOOL | 0.997244 | 5.897609 |
02397d35-7609-439c-9757-412da7cbda2d | kash1sh/practice_ques_cp | A_Subsequence_Permutation.cpp |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vll vector<ll>
#define vpll vector<pair<ll, ll>>
#define fo(i, k, n) for (ll i = k; i < n; i++)
#define fo1(i, k, n) for (ll i = k; i <= n; i++)
#define rr return
#define Endl endl
#define ff first
#define ss second
#define setbits(x) __builti... | ALGO | 0.999976 | 4.975924 |
c2d15d7f-7fd9-4fb3-b686-f9a76896ce0f | ishandutta2007/codeforces | kal013/normal/1216/E2.cpp | /*/ Author: kal013 /*/
//#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <cstdio>
using namespace std;
#define int long long
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<pii,int> ppi;
typedef vector<pii> vpi;
typedef priority_queue<ppi> max_heap_ppi;
#define For(i,n) for(int i=0;i<(int)... | ALGO | 0.999726 | 3.941725 |
074b1810-0494-4414-ab0a-91bd95342ee7 | congnt24/OCRTess | libraries/tess-two/jni/com_googlecode_tesseract_android/src/ccstruct/pageres.cpp | #include <stdlib.h>
#ifdef __UNIX__
#include <assert.h>
#endif
#include "blamer.h"
#include "pageres.h"
#include "blobs.h"
ELISTIZE (BLOCK_RES)
CLISTIZE (BLOCK_RES) ELISTIZE (ROW_RES) ELISTIZE (WERD_RES)
// Gain factor for computing thresholds that determine the ambiguity ... | TOOL | 0.95578 | 4.705564 |
496c3dd3-5f44-40ff-94e2-d534041e3699 | echoz/xlibspatialite | geos/src/algorithm/BoundaryNodeRule.cpp | #include <geos/algorithm/BoundaryNodeRule.h>
namespace geos {
namespace algorithm { // geos.algorithm
// These classes are public in JTS, and under the BoundaryNodeRule
// namespace. In GEOS they are hidden and only accessible as singleton
// from BoundaryNodeRule static const references
//
namespace {
/**
* A {@l... | ALGO | 0.99665 | 7.799881 |
5ca8838d-196d-4ffd-b78f-fadb4c264387 | Estrel05/algorithm | Baekjoon/src/p7568.cpp | #include <iostream>
#include <utility>
using namespace std;
int main() {
int n, rank = 1;
cin >> n;
pair<int, int> p[n];
for (int i = 0; i < n; i++) cin >> p[i].first >> p[i].second;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
if (p[i].first < p[j].first && p[i].se... | ALGO | 0.999914 | 4.417753 |
63a202b1-6e3d-4bfa-9740-ded4f2702e5f | Bodhidhruvi/practical-list-3 | p9.cpp | #include<iostream>
using namespace std;
class max
{
private:
int n1,n2;
public:
void input()
{
cout<<"Enter number 1 :: ";
cin>>n1;
cout<<"Enter number 2 :: ";
cin>>n2;
}
void display()
{
cout<<"Number 1 ::"<<n1<<endl;
cout<<"Number 2 ::"<<n2<<endl;
}
vo... | ALGO | 0.959609 | 3.740024 |
c19398f5-365f-40ed-8b2b-e3f49f375bcd | see-coder/lets-learn | 10-Arrays/10-011-trapping-rain-water/solve.cpp | #include <bits/stdc++.h>
using namespace std;
int trapped_water(vector<int>& height)
{
int n = height.size();
int left = 0, right = n-1;
int left_max = 0, right_max = 0;
int res = 0;
while(left <= right)
{
if(height[left] <= height[right])
{
if(height[left] >= left_... | ALGO | 0.999918 | 5.546414 |
9b6eecc8-7196-48f9-9659-ba6844ffef83 | hhhnnn2112/NOI-ACcode-Explanation | Explanation/P1077.cpp | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000007;
int n, m, x;
int f[101];
int main()
{
scanf("%d%d", &n, &m);
f[0] = 1;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
f[j + 1] = (f[j + 1] + f[j]) % mod;
}
scanf("%d", &x);
for (int j = m; j > x; j--)
{
f[j] = (f[j... | ALGO | 0.999992 | 3.753515 |
1b235bf4-fcca-4c7f-bf2f-6a7140a18f29 | SuseelKumarG/cpsolns | F_Goblin.cpp | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long
typedef long long ll;
typedef pair<int, int> p... | ALGO | 0.999988 | 4.597132 |
675ec42c-4b8b-4b74-b8e8-dcd18e4b9024 | nrey/eulerOld | eu0047.cpp | #include"eu0047.h"
#include"principal.h"
void eu0047 :: solucion(){
// ---------------------------------------------------- //
tstart = (double)clock()/CLOCKS_PER_SEC;
// ---------------------------------------------------- //
output = 0;
temp_13 = 26000;
tem_1d_1 = new unsigned long long[temp_13];
tem_1d_2 ... | ALGO | 0.999697 | 4.63043 |
2da43013-b39e-4504-8d5c-46a87a9622fb | ishandutta2007/codeforces | vkgainz/normal/1097/D.cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree <pair<ll, int>, null_type, less<pair<ll, int>>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
#... | ALGO | 0.99998 | 4.869011 |
125654f0-f7c9-4d56-b232-b0f5dbeb4f24 | xi-guo-0/leetcode-solutions | cpp/0460-lfu-cache.cpp | struct Node {
int key, val, freq;
Node(int _key, int _val, int _freq) : key(_key), val(_val), freq(_freq) {}
};
class LFUCache {
int minfreq, capacity;
unordered_map<int, list<Node>::iterator> key_table;
unordered_map<int, list<Node>> freq_table;
public:
LFUCache(int _capacity) {
minfreq = 0;
capac... | ALGO | 0.999793 | 6.096088 |
dab3c048-a1cb-4663-aed5-3ee847205cfc | seongjinkime/problem-solving | bfs/단지번호붙이기/solution.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
vector<vector<int>>adj;
//check
void bfs(int y, int x, int& cnt){
adj[y][x] = 0;
cnt++;
if(y>0 && adj[y-1][x] == 1)
bfs(y-1, x, cnt);
if(y<n-1 && adj[y+1][x] == 1)
bfs(y+1, x, cnt);
if(x>0 && adj[... | ALGO | 0.999922 | 3.72712 |
c9bb3f9e-1ffc-4d88-a202-1287cc316958 | raihanuldev/Data-Structure | module-2 STL-Vector/reversing.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;cin>>n;
vector<int>v(n);
for(int i =0; i<n; i++){
cin>>v[i];
}
reverse(v.begin(),v.end());
for(int i =0; i<n; i++)
{
cout<<v[i]<<" ";
}
//order of N
return 0;
} | ALGO | 0.999865 | 4.066354 |
e92c14e6-6d04-4be9-9c1d-77727c98c2e2 | Avitoshsandve/DSA | binary search1.cpp | #include<iostream>
using namespace std;
int binarysearch(int arr[],int l,int r,int n)
{
while(l<=r)
{
int m=l+(r-l)/2;
if (arr[m]==n)
return m;
if(arr[m]<n)
l=m+1;
else
r=m-1;
}
return -1;
}
int main()
{
int arr[]={2,4,8,24,56,69,79};
int... | ALGO | 0.99975 | 5.489243 |
dfd5530b-42c9-42a5-b970-3e325810f925 | caixiaomo/leetcode-ans1 | leetcode C++/BST/Search_In_Rotated_Array/answer.cpp | /*
Search in Rotated Sorted Array II Total Accepted: 6286 Total Submissions: 21216 My Submissions
Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the array.
*/
class Solution {... | ALGO | 0.99999 | 6.393609 |
361eb794-d1ad-4d7e-aaaa-e9649d0f7ca5 | oxygen-hunter/Flashboom | data/big-vul-100/add_attention_code/CodeLlama/top0-100/shortest-path-with-alternating-colors-Solution.shortestAlternatingPaths/177832_nan.cpp | walk_string(fz_context *ctx, int uni, int remove, editable_str *str)
{
int rune;
if (str->utf8 == NULL)
return;
do
{
char *s = &str->utf8[str->pos];
size_t len;
int n = fz_chartorune(&rune, s);
if (rune == uni)
{
/* Match. Skip over that one. */
str->pos += n... | ALGO | 0.999286 | 5.828567 |
72f2a474-697d-4fdb-9aed-313269321a76 | Aiden-Tang-0113/Aiden-Tang-0113 | 11_Count Integers.cpp | #include<iostream>
using namespace std;
int main()
{
int k,j;
int sum_1 = 0,sum_5 = 0,sum_10 = 0;
cin >> k;
for(int i = 0;i < k;i++)
{
cin >> j;
if(j == 1)
sum_1++;
if(j == 5)
sum_5++;
if(j == 10)
sum_10++;
}
cout << sum_1... | ALGO | 0.999171 | 3.362538 |
54880aac-57dc-4113-8ea1-615796b4baf9 | ExpoSEJS/Z3 | src/smt/theory_str_mc.cpp | /*++
Module Name:
theory_str_mc.cpp
Abstract:
Model Construction for String Theory Plugin
Author:
Murphy Berzish and Yunhui Zheng
Revision History:
--*/
#include "ast/ast_smt2_pp.h"
#include "smt/smt_context.h"
#include "smt/theory_str.h"
#include "smt/smt_model_generator.h"
#include "ast/ast_pp.... | TOOL | 0.934072 | 6.035614 |
cbe56575-7833-4f7a-8080-393e69959799 | edwinzanella/CSC-211 | Assignment_3/main_3.cpp | #include <iostream>
#include <string>
void char_swap() {
std::string str;
std::getline(std::cin, str);
int length = str.length();
for (int i = 0; i < length / 2; i++) {
std::swap(str[i], str[length - i - 1]);
}
std::cout << str << std::endl;
return;
}
int main(){
char_swa... | ALGO | 0.993687 | 5.435474 |
904d336e-0f42-4a40-8632-ec255406e65c | vikas0799/rbu-cpp | basics DSA/Lect-09-Array/array1.cpp | #include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
//method-1
//sum of n number
//cout<<n*(n+1)/2;
//method-2
// int sum=0;
// for(int i=1;i<=n;i++)
// {
// sum =sum+i;
// }
// cout<<sum;
//method-3
//storing 0 to n where n is include 0 1 2 ... | ALGO | 0.999777 | 4.102495 |
fb301257-790c-4f01-8811-53e3ca5489e6 | Vishal-S-Hayyal/DSA | 04_Functions/printtilln.cpp | #include <iostream>
using namespace std;
void print(int n){
for(int i=1; i<=n; i++){
cout<<i<<endl;
}
}
int main() {
int n;
cout<<"Enter the value"<<endl;
cin>>n;
print(n);
} | ALGO | 0.991508 | 3.519422 |
2e3dfca4-c14f-47af-ab46-2736377fabfb | ulpashk/ADS_22B030552 | lab6/H.cpp | #include <bits/stdc++.h>
using namespace std;
int partition(vector<char> &str, int left, int right){
int pivot = right;
int i = left - 1;
for(int j = left; j <= right-1; j++){
if(str[j] < str[pivot]){
i++;
swap(str[i], str[j]);
}
}
swap(str[i + 1], str[pivot... | ALGO | 0.999929 | 4.063352 |
efd64e71-288d-43e5-82ca-10f17f691470 | st116409/programming-c-2024-autumn | 2024.09.28-Homework-2/Task4/Source.cpp | #include<cstdio>
#include<cstdlib>
int main(int argc, char* argv[])
{
int a1 = 0;
int b1 = 0;
int c1 = 0;
int a2 = 0;
int b2 = 0;
int c2 = 0;
scanf_s("%d %d %d %d %d %d", &a1, &b1, &c1, &a2, &b2, &c2);
if (a1 < b1)
{
int t = a1;
a1 = b1;
b1 = t;
}
if (a1 < c1)
{
int t = a1;
a1 = c1;
c1 = t;
... | ALGO | 0.999977 | 3.581609 |
2e39a108-efa6-487d-8396-84315c78e00f | VermaDeepali/GFG-POTD | Minimum Cost of ropes.cpp | // Given an array arr containing the lengths of the different ropes, we need to connect these ropes to form one rope. The cost to connect two ropes is equal to sum of their lengths. The task is to connect the ropes with minimum cost.
// Examples:
// Input: arr[] = [4, 3, 2, 6]
// Output: 29
// Explanation: We can c... | ALGO | 0.999957 | 5.42453 |
25dfb724-141c-4b34-9c19-bafb12346968 | rilato/Baekjoon | cpp/레벨별/Bronze/Bronze5/27328(三方比較(Three-Way_Comparison)).cpp | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int X;
cin >> X;
cout << X * 24;
return 0;
} | ALGO | 0.989641 | 3.16245 |
c1d5e3eb-b3f7-4b24-b4f9-8b5f6e61ceca | pm306/procon | ABC/187/B.cpp | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using pll = pair<ll, ll>;
constexpr char ln = '\n';
constexpr long long INF = 1LL<<60;
constexpr double EPS = 1e-9;
#define all(v) v.begin(), v.end()
#define rep(i, n) for(int i=0;i<(n);i++)
#define rept... | ALGO | 0.999961 | 5.097562 |
e9adbbac-7863-454d-b8c6-0d6992ccdc1e | ooakley/learning_muscleabm | src/agents.cpp | #include "agents.h"
#include <algorithm>
#include <complex>
#include <random>
#include <numbers>
#include <cmath>
#include <cassert>
#include <limits>
#include <iostream>
#include <utility>
#include <ranges>
#include <boost/numeric/ublas/matrix.hpp>
#include <boost/math/distributions/normal.hpp>
namespace boostMatri... | ALGO | 0.996559 | 7.253769 |
94f92a99-1053-4e66-b653-2fb40856cfc2 | UnBnB/Exercicios-tep | 2023.1/Lista_01/K.cpp | /*
Website: AtCoder
Link: https://atcoder.jp/contests/abc043/tasks/abc043_b
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define all(x) x.begin(), x.end()
#define vin(vt) for (auto &e : vt) cin >> e
#define LSOne(S)... | ALGO | 0.999708 | 4.62128 |
a8575614-e81f-4832-99f3-aae7ca46af33 | Anish-Karthik/DSA-and-Competitive-Prog | Dynamic Programming/Geek_Jump.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
private:
vector<int> dp;
int f(int n, vector<int>&a) {
if( n == 0) return 0;
if(dp[n] != -1) return dp[n];
int one = abs(a[n] - a[n-1]) + f(n-1, a);
int two = one;
... | ALGO | 0.999956 | 6.21474 |
6278ba77-a27f-4b66-ac4d-82f3ecc50e30 | AmnaZafar43/Programming-Day-task | Week-4/t4.cpp | #include <iostream>
using namespace std;
main()
{
int redroses,tulips,whiteroses;
float disc,fprice,tprice;
cout <<"Enter no of red roses";
cin >> redroses;
cout <<"Enter no of white roses";
cin >> whiteroses;
cout <<"Enter no of tulips";
cin >> tulips;
tprice=(redroses*2.0)+(tulips*2.5)+(whiteroses*4.1);
if(tprice>200... | ALGO | 0.92807 | 4.289134 |
04106c6c-c8ed-4475-9472-36873784c780 | openkylin/boost1.74 | libs/math/tools/igamma_temme_large_coef.cpp | #include <boost/math/special_functions/log1p.hpp>
#include <boost/math/special_functions/erf.hpp>
#include <boost/math/constants/constants.hpp>
#include <map>
#include <iostream>
#include <iomanip>
#include "mp_t.hpp"
using namespace std;
using namespace boost::math;
//
// This program calculates the coefficients of ... | ALGO | 0.999464 | 4.41123 |
1e36a3b9-e893-4f35-8652-cfd8675df7cf | minkimgyu/TIL | 프로그래머스/1/118666. 성격 유형 검사하기/성격 유형 검사하기.cpp | #include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
map<char, int> surveyData;
void SolveOneProblem(string survey, int choice)
{
switch(choice)
{
case 1:
surveyData[survey[0]] += 3;
break;
case 2:
surveyData[survey[0... | ALGO | 0.999926 | 5.77947 |
49771dc3-1a10-447d-aa05-8a01b86f3326 | davidcepeda1/ESPE14542-ESTRUCTURADEDATOS | Primer Parcial/ProyectoConjunto2/Cesar.cpp | #include "Cesar.h"
#include <algorithm>
#include <cctype>
#include <iostream>
#include <sstream>
using namespace std;
string cifrarCesar(const string& texto, int desplazamiento) {
string resultado = texto;
for (char& c : resultado) {
if (isalpha(c)) {
char limite = isupper(c) ? 'A' : 'a';
... | TOOL | 0.979867 | 3.286817 |
9f56b5b4-737d-4fc5-822a-97d7fc353c73 | julliet27/Past_solved_problem | CountingOrders.cpp | #include<bits/stdc++.h>
#define endline "\n"
#define fast_io ios_base::sync_with_stdio(false)
#define ll long long
using namespace std;
int main(){
fast_io;
int t;cin>>t;
int MOD=1e9+7;
while(t--){
int n;cin>>n;
vector<int>a(n,0);
vector<int>b(n,0);
ll ans=1;
for(... | ALGO | 0.999983 | 3.888411 |
b8a2e5dd-92c1-401b-9d7f-6626cbaef1f2 | Annkkitaaa/Data-Structures-And-Algorithms | Day-7/subarraysumk.cpp | #include<bits/stdc++.h>
using namespace std;
void subArray(int a[],int n,int k){
int l=0;
for(int i=0;i<n;i++){
int sum=0;
for(int j=i;j<n;j++){
sum+=a[j];
if(sum==k){
l=max(l,j-i+1);
}
}
}
cout<... | ALGO | 0.999878 | 4.991348 |
e13c8a47-98d4-4541-b767-bc4a19640a14 | Srikar4510/Leetcode | 498-diagonal-traverse/diagonal-traverse.cpp | class Solution {
public:
vector<int> findDiagonalOrder(vector<vector<int>>& mat) {
int m = mat.size();
int n = mat[0].size();
vector<int> res;
res.reserve(m*n);
for(int k=0;k<m+n-1;k++){
vector<int> diag;
int r,c;
if(k<n){
... | ALGO | 0.999988 | 6.425979 |
8f6b2691-dbf4-4137-a922-be14e64e2ef7 | ishandutta2007/codeforces | andr0901/normal/1201/B.cpp | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define forn(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, ... | ALGO | 0.999922 | 3.909654 |
3f8dcf43-de79-49a8-aa11-31194196a971 | eemoreira/biblioteca-de-problemas | cf/793/a.cpp | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef priority_queue<ii, vii, greater<ii>> pqmin;
#define mp make_pair
#define fst first
#define snd ... | ALGO | 0.999968 | 5.031461 |
a83bf505-0153-483f-8f08-93facd3dfa80 | klupek/cppcms | tags/v0.999.0/booster/lib/locale/src/icu/boundary.cpp | #include "cdata.h"
#include "all_generator.h"
#include "icu_util.h"
#include "uconv.h"
namespace booster {
namespace locale {
namespace boundary {
namespace impl_icu {
using namespace booster::locale::impl_icu;
index_type map_direct(boundary_type t,icu::BreakIterator *it,int reserve)
{
index_type indx;
indx.... | TOOL | 0.901445 | 5.129652 |
58117588-c3d7-446f-8ab9-fa601fb69960 | Beng-Cccat/Algorithm | Homework2/H2_Q3 sum to T.cpp | #include<iostream>
using namespace std;
int main() {
int a[100] = { 0 };
int num = 0;
char b;
cout << "请输入一个数组（严格递增）：" << endl;
cin >> a[0];
while ((b = getchar()) != '\n') {
num++;
cin >> a[num];
}
cout << "请输入加和T：" << endl;
int T;
cin >> T;
bool tag = 0;
//O(n2):暴力求解
cout << "O(n2)查找后的结果：" << endl;
... | ALGO | 0.999969 | 3.852332 |
5fd73b95-65c5-412f-aa34-f2774606b017 | alexandraback/datacollection | solutions_2453486_1/C++/Dab/A.cpp | #include <cstdio>
#include <set>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <cstring>
#include <vector>
using namespace std;
const char* X_WON = "X won";
const char* O_WON = "O won";
const char* DRAW = "Draw";
const char* NOT_COMPLETED = "Game has not completed";
const int SIZE = 4;
char a[SI... | ALGO | 0.999907 | 4.890543 |
90422c77-c9d8-4ced-ab94-c7475acb79a7 | 93Hong/Algorithms | 1931_MeetingRoom/Main.cpp | #include <cstdio>
#include <vector>
#include <algorithm>
#pragma warning(disable: 4996)
using namespace std;
int main() {
int n, first, second;
scanf("%d", &n);
vector<pair<int, int>> vec;
for (int i = 0; i < n; i++) {
scanf("%d", &first); scanf("%d", &second);
vec.push_back({ second, first });
}
sort(vec.... | ALGO | 0.999881 | 3.956829 |
3d5c8f62-ae57-4104-a8a3-a99b36f4b610 | prabhatku304/cpp | feedback.cpp | #include<iostream>
#include<cstring>
using namespace std;
int main()
{
int t;
cin >> t;
for(int k=0;k<t;k++)
{
char s[1000000];
int ct=0;
cin >> s;
int l=strlen(s);
for(int i=0;i<l-2;i++)
{
if(s[i]=='0' && s[i+1]=='1' && s[i+2]=='0' || s[i]=='1' && s[i+1]=='0' && ... | ALGO | 0.999603 | 4.142587 |
670380b5-fb0d-42f0-8705-4cb910a83551 | vikramkumar14/DSA0180-OOPS-USING-C- | STRONGNUMBER.cpp | #include <iostream>
using namespace std;
bool is_strong_number(int num) {
int sum_of_factorials = 0, temp = num;
while (temp > 0) {
int digit = temp % 10;
int factorial = 1;
// Calculate factorial of the digit
for (int i = 1; i <= digit; ++i) {
factorial *= i;
}
sum_of_factorials += factor... | ALGO | 0.999694 | 5.733426 |
053d2915-b813-4c43-ae4a-45b782989e35 | SoyEtiago/competitive-programming | codeforces/Codeforces Round 995 (Div. 3)/a.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);cin.tie(0);
int T;
cin >> T;
while(T--) {
int n;
cin >> n;
vector<int> v1;
vector<int> v2;
for(int i = 0; i < n; i++) {
int a;
cin >> a;
v1.push... | ALGO | 0.999975 | 3.734993 |
9d3c4c7b-4d4f-4ed8-99e8-0f7af6dc32a9 | markmsmith/NaClAMBase | NaClAMBullet/bullet-2.81-rev2613/src/BulletSoftBody/btSoftRigidCollisionAlgorithm.cpp | #include "btSoftRigidCollisionAlgorithm.h"
#include "BulletCollision/CollisionDispatch/btCollisionDispatcher.h"
#include "BulletCollision/CollisionShapes/btSphereShape.h"
#include "BulletCollision/CollisionShapes/btBoxShape.h"
#include "BulletCollision/CollisionDispatch/btCollisionObject.h"
#include "btSoftBody.h"
#inc... | ALGO | 0.993185 | 4.0597 |
2ae4e45d-3344-48df-98fc-ba483ad12a6d | harshit-sharmaaa/Data-Structures-Algorithms | Lecture 18 LL(17 sept)/reverseLinkedList.cpp | #include <iostream>
using namespace std;
class Node
{
public:
int data;
Node *next;
Node(int d)
{
data = d;
next = NULL;
}
};
void insertAtEnd(Node *&head, Node *&tail, int data)
{
if (head != NULL)
{
Node *n = new Node(data);
tail->next = n;
tail =... | ALGO | 0.999975 | 4.896935 |
a58de67b-6f60-4257-ba97-77d58f198e1f | nxplatform/nx-mobile | thirdparty-cpp/boost_1_62_0/libs/program_options/src/parsers.cpp | #include <boost/config.hpp>
#define BOOST_PROGRAM_OPTIONS_SOURCE
#include <boost/program_options/config.hpp>
#include <boost/program_options/parsers.hpp>
#include <boost/program_options/options_description.hpp>
#include <boost/program_options/positional_options.hpp>
#include <boost/program_options/detail/cmdline.hpp>
... | CONFIG | 0.905852 | 7.372321 |
9f93dd35-5d99-423b-a193-b8da8715546b | wysoviet/acmprogram | ural/1525.cpp | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | ALGO | 0.999911 | 3.132937 |
d99c1175-7cb2-4463-8608-f3f8d3ade824 | KaziMithfa/Problem-Solving-Codes | SumofCubes.cpp |
//CodeForces - 1490C
#include<iostream>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
/* int lowBound(vector<long long int>&A,long long int x){
int low = 0, high = A.size();
while(low<high){
int mid = (low + high)/2;
if(A[mid]<x){
low = mid + 1;
}
else{
high = mid;
... | ALGO | 0.998823 | 4.651626 |
9ce926bb-cda5-4e61-9e62-f13d972220d6 | amalmn11/code_valide_SDD | liste dynamique.cpp | #include <stdio.h>
#include <stdlib.h>
typedef struct lst{
int Entier;
struct lst *svt;
//struct lst *prd;
}Cellule;
//creer un cellule
Cellule* Creer_cellule(){
Cellule *NE;
NE=(Cellule *)malloc(sizeof(Cellule));
if(!NE)
{
printf("probleme de l'allocation");
exit((int)-1);
}
NE->svt=NULL;
return((Ce... | ALGO | 0.979039 | 3.806433 |
e4e57652-c5ec-403b-8442-fdf2dffd737c | rpl-cmu/incopt | gtsam/gtsam/3rdparty/Eigen/doc/examples/TutorialLinAlgInverseDeterminant.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix3f A;
A << 1, 2, 1,
2, 1, 0,
-1, 1, 2;
cout << "Here is the matrix A:\n" << A << endl;
cout << "The determinant of A is " << A.determinant() << endl;
cout << "The inverse of A is:\n... | ALGO | 0.999836 | 4.186114 |
3dc4db2a-5df6-496a-8d4b-84eb8b97f094 | ToshikiNakamura0412/emcl_ros | src/utils/particle.cpp | /**
* @file particle.cpp
* @author Toshiki Nakamura
* @brief Class of Particle
* @copyright Copyright (c) 2024
*/
#include <vector>
#include "utils/particle.h"
Particle::Particle(void) : pose_(0.0, 0.0, 0.0) { weight_ = 0.0; }
Particle::Particle(const float x, const float y, const float yaw) : pose_(x, y, yaw)... | ALGO | 0.988302 | 5.58874 |
b30fd5a3-afda-4f0d-b0dd-1a9e43cc98d4 | CFXS/llvm-strip-l0 | llvm/utils/TableGen/InstrDocsEmitter.cpp | #include "CodeGenDAGPatterns.h"
#include "CodeGenInstruction.h"
#include "CodeGenTarget.h"
#include "TableGenBackends.h"
#include "llvm/TableGen/Record.h"
#include <string>
#include <vector>
using namespace llvm;
namespace llvm {
void writeTitle(StringRef Str, raw_ostream &OS, char Kind = '-') {
OS << std::string(... | TOOL | 0.872233 | 7.283017 |
044fdae4-511e-4abe-ae65-bbc92354f0d8 | chishiya2309/DSA | DoThi/BellmanFord.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> ii;
struct canh{
int u, v, w;
};
int n, m, s;
vector<ii> ke[200005];
int visited[200005];
vector<canh> dscanh;
void nhap(){
cin >> n >> m >> s;
for(int i = 0; i < m; i++){
int x, y, w; cin >> x >> y >> w;
ke[x].push_b... | ALGO | 0.999795 | 3.811246 |
5e5c0475-542b-4331-a6bf-0dc3f01b12fc | ioannkozlitin/opencv470_cuda | opencv_contrib/modules/saliency/src/BING/CmShow.cpp | #include "../precomp.hpp"
#include "CmShow.hpp"
#include "opencv2/core.hpp"
// #include <opencv2/highgui.hpp>
typedef std::pair<int, int> CostiIdx;
namespace cv
{
namespace saliency
{
Mat CmShow::HistBins( CMat& color3f, CMat& val, bool descendShow, CMat &with )
{
// Prepare data
int H = 300, spaceH = 6, barH = ... | TOOL | 0.914702 | 6.128946 |
84de1665-278a-4286-920b-2caf2afdb2d5 | Deepak-png981/Data_Structures_And_Algorithms | 1-two-sum/1-two-sum.cpp | class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int n = nums.size();
vector<int>ans;
unordered_map<int , int>map;
for(int i = 0; i<n; i++){
int tofind = target - nums[i];
if(map.find(tofind) != map.end()){
ans.push_... | ALGO | 0.999796 | 6.317741 |
fb56710f-01ea-435d-91f7-43d9b9f9b9f2 | zzm99/Algorithm-Training | 动态规划/计数DP/96. 不同的二叉搜索树.cpp | class Solution {
public:
int numTrees(int n) {
vector<int> dp(n+1, 0);
dp[0] = 1;
for(int i=1; i<=n; i++){
for(int j=1; j<=i; j++){
dp[i] += dp[j-1]*dp[i-j];
}
}
return dp[n];
}
}; | ALGO | 0.999993 | 6.454892 |
82afdaf6-08ce-4857-a853-4ffb8939d4ca | harshhx17/CompetitiveTemplates | cpp/dynamicLiChao.cpp |
struct LiChao_max
{
struct line
{
ll a, b;
line() { a = 0; b = 0; }
line(ll _a, ll _b) { a = _a; b = _b; }
ll eval(ll x) { return a * x + b; }
};
struct node
{
node *l, *r; line f;
node() { f = line(); l = NULL; r = NULL; }
node(ll a, ll b) { ... | ALGO | 0.998928 | 4.436108 |
6e35a391-8608-400d-aad6-113be5ab70a1 | atanapi/atanapi-core-departed | src/evo/specialtx.cpp | #include <chainparams.h>
#include <consensus/validation.h>
#include <hash.h>
#include <primitives/block.h>
#include <validation.h>
#include <evo/cbtx.h>
#include <evo/deterministicmns.h>
#include <evo/specialtx.h>
#include <llmq/quorums_commitment.h>
#include <llmq/quorums_blockprocessor.h>
bool CheckSpecialTx(const... | ALGO | 0.876342 | 5.903209 |
f35b9b98-a991-4918-9140-4a77637b4cfa | jacquemv/evenlyspacedstreamlines | evenlyspacedstreamlines/quadraticforms.cpp | #include "quadraticforms.h"
#include <math.h>
//-----------------------------------------------------------------------------
EllipticQuadraticForm::EllipticQuadraticForm(double a_, double b_, double c_,
double d_, double e_, double f_)
{
a = a_; b = b_; c = c_; d = d_... | ALGO | 0.999729 | 5.946172 |
53837059-a238-4092-bba0-01786c7c644f | asdfghjkkl11/algorythm | beakjoon/1094.cpp | #include <iostream>
#include <algorithm>
using namespace std;
int m;
int main()
{
cin >> m;
int count = 0;
while (m != 0) {
count += m % 2;
m /= 2;
}
cout << count << endl;
return 0;
}
| ALGO | 0.999755 | 4.350293 |
25534afd-8afb-45fb-86b1-2d527c77708a | zgaze/leetcode | Tree/PathSum_112.cpp | /* ***********************************************************************
> File Name: PathSum_112.cpp
> Author: zzy
> Mail: <EMAIL>
> Created Time: Thu 08 Aug 2019 11:43:08 AM CST
********************************************************************** */
#include <stdio.h>
#include <vector>
#include <stri... | ALGO | 0.999872 | 5.666153 |
eec0e67e-2387-4545-ab5c-ffb8a3f58ef7 | nardo0905/CS-Uni-Course-Git | 221021 Pract/task11.cpp | #include <iostream>
int main() {
// От клавиатурата се въвеждат n реални числа (1 <= n <= 1000), намерете и изкарайте най-малкото и най-голямото от тях. (Без употребата на масив)
int n;
std::cout << "> ";
std::cin >> n;
int biggest = 0;
int smallest = 99999;
for (int i = 0; i < n; i++) ... | ALGO | 0.997467 | 4.519154 |
a536d8b2-9877-4c2d-a60f-42026fed964f | onhas/Praktyki | zadania/zad4/zad4.cpp | // Napisz program, który spośród trzech różnych liczb a,b,c wybiera najwieksza
#include <iostream>
using namespace std;
int main()
{
int a, b, c;
cout << "Podaj liczbe a: ";
cin >> a;
cout << "Podaj liczbe b: ";
cin >> b;
cout << "Podaj liczbe c: ";
cin >> c;
//nie mialem inn... | ALGO | 0.998243 | 3.977308 |
b6f89199-55c8-4767-b66f-62035f75a768 | TengFeiyang01/Algorithm | casual/DP/tree_dp/dmy_tb_2.cpp | #include <bits/stdc++.h>
using i64 = long long;
void solve() {
int n, m, q;
std::cin>> n >> q;
m = 100;
std::vector<int> c(n), sz(n);
std::vector<int> adj[n];
for (int i = 1; i < n; ++i) {
int fa;
std::cin >> fa;
adj[fa - 1].push_back(i);
}
for (int i = 0; i < n... | ALGO | 0.999958 | 4.374422 |
687b3fce-50a7-422b-8c8f-3ae04083a95b | snwdaaa/BOJ | Level/10/9063-Ground.cpp | #include <iostream>
struct Marble
{
int x;
int y;
};
int main()
{
// 입력
int N;
std::cin >> N;
if (N <= 1) // 구슬이 한 개 이하면 직사각형 X
{
std::cout << 0;
return 0;
}
Marble* marbles = new Marble[N];
for (int i = 0; i < N; i++)
{
std::cin >> marbles[i].x >> m... | ALGO | 0.999355 | 5.07268 |
5d1d44af-9dd1-47d4-906f-c41e11731b16 | Kynn274/BaitapUPCODER | PhanSo7.cpp | #include <iostream>
#include <cmath>
using namespace std;
struct PS{
int tu,mau;
};
istream & operator>>(istream & is, PS&p){
is>>p.tu>>p.mau;
return is;
}
ostream & operator<<(ostream & os, PS p){
if(p.tu==0){
os<<0;
}else{
if(p.tu>0 && p.mau<0){
os<<'-'<<p.tu<<'/'<<abs(p.mau);
}else if(p.t... | ALGO | 0.99879 | 3.981309 |
9d247525-c2d9-4080-8681-29f14de6bd4b | princejs446/burger-Desgin | 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.998733 | 6.76775 |
fc37461c-c7e1-4b2f-a287-4e547792e7ef | renaissanceMan92/cplusplus-ExercisesCollection | Function exercises/Heights.cpp | //============================================================================
// Name : Heights.cpp
// Author : Robin Holm
// Description : Task 4. App for calculating the height of a child based on
// its gender and the heights of its parents.
//========================================================... | ALGO | 0.931194 | 4.189225 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.