uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
a1c926ce-9893-4ecc-b69a-31096a6b4dfe | tredeim/AlgorithmsAndDataStructure | военные_сборы.cpp | #include <stdio.h>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
int main()
{
int N;
scanf("%d", &N);
std::vector<std::vector<int>> g(N);
std::vector<int> degree(N, 0);
int begin;
int end;
for (int i = 0; i < N - 1; ++i)
{
scanf("%d %d", &begin, &end);
... | ALGO | 0.999958 | 4.73451 |
44f274e8-b830-4da5-b331-471a0ed93e42 | bhavyakalra19/comp-prog | 908-middle-of-the-linked-list/middle-of-the-linked-list.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* middleNode(... | ALGO | 0.999884 | 5.794731 |
76bfaf86-49a7-4017-a201-ff71a9704de9 | Amankumar140/Leetcode | BST/medium/Binary Search Tree Iterator.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999842 | 6.345615 |
862ee72a-cb5d-462e-9023-8b7264238e3e | MdAlSiam/My-Codeforces-Solutions | 1291B.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define dd double
#define scl(x) scanf("%lld", &x)
#define scll(x, y) scanf("%lld %lld", &x, &y)
#define scd(x) scanf("%lf", &x)
#define scdd(x, y) scanf("%lf %lf", &x, &y)
#define prl(x) printf("%lld\n", x)
#de... | ALGO | 0.999941 | 3.810574 |
4de3b7f2-ee6e-4e25-b38b-cdf963280a09 | Deepak22903/PP | Trees/maxLevelSum.cpp | #include <climits>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
/**
* Definition for a binary tree node.
*/
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr... | ALGO | 0.999997 | 6.919858 |
2826698e-032b-4f1f-84bd-aab8c49b7ed9 | BME-MIT-IET/iet-hf-2022-do-the-thing | code/online_challenges/src/project_euler/problem_102/problem_102.cpp | #include <cmath>
#include <iostream>
#include <fstream>
struct Coord
{
int x;
int y;
};
int doubleTriangleArea(Coord a, Coord b, Coord c) // Area doesn't actually need to be calculated either,
// just compared for equality
{
/*
* Coordinate area metho... | ALGO | 0.989286 | 6.080492 |
8f9ec2af-bc69-4f40-bb62-7e6bd153ee17 | BhavyaSah7/Leetcode | Add Two Numbers.CPP | class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* ans = new ListNode();
ListNode* tmp = ans;
int car = 0;
while(l1 || l2 || car){
int sum = 0;
if(l1){
sum += l1->val;
l1 = l1->next;
... | ALGO | 0.999893 | 6.596113 |
09cff773-699c-4673-b704-6958f381c7f5 | sarvex/leetcode-solidity | solution/2200-2299/2293.Min Max Game/Solution.cpp | class Solution {
public:
int minMaxGame(vector<int>& nums) {
for (int n = nums.size(); n > 1;) {
n >>= 1;
for (int i = 0; i < n; ++i) {
int a = nums[i << 1], b = nums[i << 1 | 1];
nums[i] = i % 2 == 0 ? min(a, b) : max(a, b);
}
}
... | ALGO | 0.999996 | 5.591139 |
5f9be52c-a8dd-435a-bfcb-67844b1b2b61 | AnuragChouhanDEV/LeetCode | climbing-stairs/Accepted/5-22-2023, 5_34_14 PM/Solution.cpp | // https://leetcode.com/problems/climbing-stairs
class Solution {
public:
int climbStairs(int n) {
static vector<int> dp(47, -1);
if (n == 0) return 1;
if (n < 0) return 0;
if (dp[n] != -1) return dp[n];
return dp[n] = climbStairs(n-1)+climbStairs(n-2);
}
}; | ALGO | 0.999985 | 6.176759 |
293eab8c-3ba8-43cc-bb3c-708f27a428a8 | ITC-Vanadzor/ITC-7 | Hasmik_Kirakosyan/Homework/C++/05.11/Sorted_search.cpp | #include <iostream>
int comparation_char (void* element_1, void* element_2) {
if (*((char*)element_1) == *((char*) element_2)) return 1;
else if (*((char*)element_1) > *((char*) element_2)) return 2;
else return 3;
}
int comparation_double (void* element_1, void... | ALGO | 0.998862 | 4.257179 |
078a4fc4-3374-405a-a43d-c753a81a66ae | ishandutta2007/codeforces | endagorion/normal/547/A.cpp | #include <iostream>
#include <vector>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cstdio>
#include <queue>
#include <set>
#include <map>
#include <fstream>
#include <cstdlib>
#include <string>
#include <cstring>
#include <algorithm>
#include <numeric>
#define mp make_pair
#define fi first
#define se... | ALGO | 0.99996 | 3.477359 |
5de255f6-2a7d-42e8-8f31-9effc94f9e41 | ferrufino/InfixPosfixPrefix | main.cpp | using namespace std;
//MIO
#include <queue> //stl library
#include <stack> // stl library
#include <fstream>
#include <stdlib.h>
//#include "Stack.h"
//#include "Node.h"
//#include "Queue.h"
//Marcelo
//#include "stackcopy.h"
//#include "queuecopy.h"
//Hugo
//#include "queueListCirc.h"
//#include "stackListDobEnc.h"
//... | ALGO | 0.993863 | 4.041182 |
8969200e-ccbc-48f3-a4c5-a783780bb940 | ishandutta2007/codeforces | green_gold_dog/normal/281/A.cpp | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll INF = 1'000'000'000'000'000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
transform(s.begin(), s.begin() + 1, s.begin(), ::toupper);
cout << s;
}
/*
*/ | ALGO | 0.99932 | 3.923521 |
5063aea0-a845-4a83-893c-939333bdea41 | ishandutta2007/codeforces | denisson/normal/917/C.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define all(a) a.begin(), a.end()
#define db long double
const ll LINF = (ll)1e18 + 7;
int w1, w2, n, q;
ll cost[11];
struct st{
ll a[7... | ALGO | 0.999541 | 3.543867 |
84ba0136-7b3f-48f2-99e3-92bcb89ddc04 | oxygen-hunter/Flashboom | data/leetcode_cpp/nth-magical-number.cpp | // Time: O(logn)
// Space: O(1)
class Solution {
public:
int nthMagicalNumber(int N, int A, int B) {
static const int M = 1000000007;
const uint64_t a = A, b = B;
const auto lcm = a * b / gcd(a, b);
auto left = min(a, b), right = max(a, b) * N;
while (left <= right) {
... | ALGO | 0.999983 | 6.415143 |
86134b6f-b477-4bca-88ff-ba66f5198e47 | MadhurJ20/SPPU-Sem-IV-Practicals | DSAL_Exp_22.cpp | /*
Madhur Jaripatke
Roll No. 55
SE A Computer
RMDSSOE, Warje, Pune
*/
/*
Read the marks obtained by students of second year in an online examination of
particular subject. Find out maximum and minimum marks obtained in that subject. Use
heap data structure. Analyze the algorithm.
*/
#include<iostream>
using namespace s... | ALGO | 0.99978 | 4.000638 |
a5bd127d-20bf-4748-9829-9393214cfc63 | Sudhanshusingh1182/-CrackYourPlacement | 06-08-24 challenge/radixSort.cpp | void countSort(int arr[], int n, int exp) {
vector<int> output(n);
vector<int> count(10, 0);
// Count occurrences of each digit
for (int i = 0; i < n; i++) {
count[(arr[i] / exp) % 10]++;
}
// Compute cumulative count
for (int i = 1; i < 10; i++) {
count[i] += count[i - 1];... | ALGO | 0.99999 | 6.592417 |
d855ff41-745f-44b4-860e-5c392481583f | ChanghyeonKim93/kdtree_balanced | ataiya_kdtree_library/kdtree_k_nearest_neighbors.cpp | #include "KDTree.h"
#ifndef CPPONLY
#include "mex.h"
void retrieve_tree( const mxArray* matptr, KDTree* & tree){
// retrieve pointer from the MX form
double* pointer0 = mxGetPr(matptr);
// check that I actually received something
if( pointer0 == NULL )
mexErrMsgTxt("vararg{1} must be a valid k... | ALGO | 0.975988 | 5.588274 |
8d2128ea-a847-4031-9eff-41fa074c34bf | JohnMcFarland/InfixToPostfix | infix_to_postfix.cpp | #include <iostream>
#include <sstream>
#include <string>
#include <cctype>
#include <stack>
#include "infix_to_postfix.h"
#include "eval_exception.h"
using namespace std;
bool isOperator(char c);
int precLevel(char optr);
//Function to convert the infix expression to a postfix expression
//I:Takes in an infix expr... | ALGO | 0.992298 | 4.460505 |
6cb062c5-b150-48dc-8301-35347cc3bc55 | xlliam/LMRME | CK_Laplace/FFT.cpp | //******************************************************************************************************//
// //
// //... | ALGO | 0.999766 | 6.078245 |
41a06305-3d6b-42de-aaa8-8a698ab0d98f | biswajit-k/samsung-practice | 1. lazer in matrix.cpp | //https://www.thejoboverflow.com/p/p2072/
#include <iostream>
int main() {
using namespace std;
int t;
cin >> t;
for(int tt = 1; tt <= t; tt++)
{
int n, m, k;
cin >> m >> n >> k;
int a[n][m];
for(int i = 0; i < m; i++)
for... | ALGO | 0.999698 | 3.697833 |
1c5b7992-fa60-400d-9a4f-2d36687a402f | zhaolunallen/myCodePractice | pascals-triangle-ii.cpp | class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int >res;
vector<int >cur{ 1, 1 };
if (rowIndex == 0)return res;
if (rowIndex == 1)return cur;
for (int i = 2; i <= rowIndex; ++i)
{
res.clear();
res.push_back(1);
for (int j = 0; j < cur.size() - 1; ++j)
{
res.push_back... | ALGO | 0.999899 | 5.432043 |
415f7a8d-ca9d-466e-a20a-c75a0dda154a | atkirtland/cpp | lc/total-hamming-distance.cpp | # O(n^2)
class Solution {
public:
int totalHammingDistance(vector<int>& nums) {
int ret = 0;
for (size_t i = 0; i < nums.size(); ++i) {
for (size_t j = i+1; j < nums.size(); ++j) {
int z = nums[i] ^ nums[j];
int total = 0;
while (z != 0) {
... | ALGO | 0.999997 | 6.254458 |
d09da715-1d96-4a19-bdcd-5f119cbebddf | Mohit-IITM/CP | 1907C.cpp | #include <bits/stdc++.h>
#include <chrono>
#include <random>
#include <iomanip>
#include <fstream>
using namespace std;
/* ************************************************************************************************************************************ */
typedef long long ll;
typedef long double ld;
#define f... | ALGO | 0.999893 | 4.766511 |
dbc89097-5c08-4925-bb81-0eb70c3b86b7 | RisshabSingla/GFG-Solutions | Medium/Permutations of a given string/permutations-of-a-given-string.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
void helper(string str, vector<string> &ans, int index, int slen){
if(index == slen){
ans.push_back(str);
return;
}
unordered_set<char> done;
... | ALGO | 0.999967 | 6.283452 |
148a6cb6-bd42-4a32-8458-bff1463125e6 | clo-yunhee/pitch-tracker | src/tracker/processors/lpc_residual.cpp | #include "processors.h"
using Processors::filterFIR;
using Processors::lpc;
using Processors::hanning;
ArrayXf Processors::lpcResidual(const ArrayXf &x, int L, int shift, int order)
{
const int len(x.size());
ArrayXf win = hanning(L);
ArrayXd res = ArrayXd::Zero(len);
int start = 0;
while (start... | ALGO | 0.992433 | 5.964136 |
8beb9b9e-1248-455a-a977-bc9e7a2288e2 | MurrayEfford/secrdesign | src/secrdesignarma.cpp | /*
External procedures for secrdesign package 2022-10-21
2023-09-15 better protection from divide-by-zero in Lambdacpp
*/
#include "secrdesign.h"
/*==============================================================================*/
// [[Rcpp::export]]
arma::mat hazmatcpp (
const arma::vec &par,
... | ALGO | 0.996115 | 6.308543 |
58595277-be3b-4881-b091-e602104ce75e | mejibyte/live-archive | 4292 - Matchsticks/4292.3.cpp | /*
Accepted
Dynamic programming
*/
using namespace std;
#include <algorithm>
#include <iostream>
#include <iterator>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <cmath>
#include <que... | ALGO | 0.99871 | 4.531578 |
14d11c9b-0e81-43ac-aa7e-c9081b6ecc21 | GibOreh/CPP | b85-re_arrang_array_7.cpp | #include<bits/stdc++.h>
using namespace std;
int comperator(string a, string b){
string ab = a.append(b);
string ba = b.append(a);
if(ab.compare(ba)>0){
return 1;
} else{
return 0;
}
}
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
string a[n];
vector<string> v;
for(int i=0; ... | ALGO | 0.999977 | 4.479683 |
add4d83f-9cc5-499a-821f-6134b321cea0 | xinchengxx/algorithm_contest | 树/437. 路径总和 III.cpp |
struct TreeNode {
int val;
TreeNode* left;
TreeNode* right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode* left, TreeNode* right)
: val(x), left(left), right(right) {}
};
#include <map>
#include... | ALGO | 0.999962 | 6.025924 |
8c3fbc2b-765f-4b05-b2fe-e04e387616c9 | okeashwin/General | Arrays/atmost2DuplicatesAllowed.cpp | /*
What if duplicates are allowed at most twice?
IDEA : Maintain a map of frequency: ignore the element if it is already encountered atleast twice before i.e if freq(element) >= 2
Returns the new size of the vector
*/
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
unordered_map<int, in... | ALGO | 0.999816 | 6.318906 |
e0a75e19-a70c-43f5-bc9b-ae91429610b1 | puchninanastya/technopark-web-server | source/settings/settings.cpp | #include "settings.hpp"
using namespace monzza::settings;
Settings::Settings() :
cpuLimit_( 0 ),
threadLimit_( 0 ),
listeningPort_( MONZZA_DEFAULT_HTTP_PORT )
{}
bool Settings::isValid() {
return true;
}
bool Settings::readConfigValueByName( std::string configLine,
... | CONFIG | 0.939427 | 6.184181 |
648f135e-1c63-438f-9ff5-2e7d707c01e2 | DeependraParmar/DSA | CodeStudios/Aggresive Cows.cpp | /*
bool isPossible(vector<int> &stalls, int k, int mid){
int cowCount = 1;
int lastPos = stalls[0];
for(int i=0; i<stalls.size(); i++){
if(stalls[i] - lastPos >= mid){
cowCount++;
if(cowCount == k){
return true;
}
lastPos = stalls[i]... | ALGO | 0.999985 | 4.988927 |
b0cd546f-4a2e-4f29-b995-35b5529bde49 | PatelManav/Codeforces_Backup | 1178D.cpp | /*May The Force Be With Me*/
#include <bits/stdc++.h>
#include <stdio.h>
#include <ctype.h>
#pragma GCC optimize ("Ofast")
#define ll long long
#define MOD 1000000007
#define endl "\n"
#define vll vector<long long>
#define mll map<long long,long long>
#define pll pair<long long, long long>
#define all(c) c.begin(),c.en... | ALGO | 0.99954 | 3.586319 |
505f9075-07d1-4006-ad04-cea34540445b | parkchanghyup/algorithm | C++/양.cpp | #include<iostream>
using namespace std;
int R, C;
char map[255][255];
int visited[255][255];
int dy[] = { 1,-1,0,0 };
int dx[] = { 0,0,1,-1 };
int sheep = 0, wolf = 0;
pair<int, int> result = make_pair(0, 0);
void dfs(int y, int x) {
if (visited[y][x] == 1) return;
visited[y][x] = 1;
if (map[y][x] == 'v')wolf... | ALGO | 0.99981 | 3.927681 |
02e83852-9b17-4658-aa98-a5b01ede0d27 | hidayat365/Inventory.NET | Design/License/src/cryptopp560/seal.cpp | // seal.cpp - written and placed in the public domain by Wei Dai
// updated to SEAL 3.0 by Leonard Janke
#include "pch.h"
#include "seal.h"
#include "sha.h"
#include "misc.h"
NAMESPACE_BEGIN(CryptoPP)
void SEAL_TestInstantiations()
{
SEAL<>::Encryption x;
}
struct SEAL_Gamma
{
SEAL_Gamma(const byte *key)
: H(5... | ALGO | 0.953064 | 7.099498 |
fdd15b56-a106-48d5-b2cc-1f6d482e0313 | XXUZZWZ/algorithm | luofgu/zhuichang.cpp | #include<iostream>
#include<cmath>
using namespace std;
const int N = 5001;
int f[N];
int main(){
int n,a[N],res=0;
cin>>n;
for(int i = 1;i<=n;i++)cin>>a[i];
for(int i = 1;i<=n;i++){
f[i]=1;
for(int k = 1;k<i;k++)
if(a[i]>a[k]){
f[i]=max(f[i],f[k]+1);
}
... | ALGO | 0.999944 | 3.826776 |
4f5953d3-632d-4cf9-86e1-2b8e1e9678c7 | jonatas57/maratona | cf/contest/1904/a/a.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> ii;
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fll;
#define each(x, s) for(auto& x : s)
#define loop(x) for(int i = 0;i < x;i... | ALGO | 0.998011 | 3.666424 |
dca2f850-8797-466c-a012-22bb4f6462ef | Ahmhxn/Data-Structure-Implementation-Using-C- | min_heap.cpp | #include<iostream>
using namespace std;
struct node{
int value;
node* left;
node* right;
};
class min_heap{
int Num_curNodes; //n will use to calculate num of half nodes that can accumudate in a level
public:
node *root,*temp,*last,*P_last;
int level;
min_heap(){
root=temp=NULL;
Num_curNodes=level=0... | ALGO | 0.999895 | 3.557017 |
a3266ef8-317f-4422-98e2-7ce5b25ec9cd | Nite2005/DSA | pointers/double_pointer.cpp | #include<iostream>
using namespace std;
int main(){
int x =5;
int *p = &x;
int **pt = &p;//used to store address of single pointer
int ***ptr = &pt; //used to store address of double pointer
cout<<*p<<endl;
cout<<**pt<<endl;
cout<<*pt<<endl;
cout<<***ptr<<endl;
cout<<**ptr... | ALGO | 0.99875 | 3.56427 |
77898331-2d22-4f33-b3f5-fe6a78ff3652 | anshyyy/CPP | Codeforces/1594B.cpp | #include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL);
#define loop(i,a,n) for(int i=a;i<n;i++)
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
using namespace std;
void solve(){
ll n,k;
cin>>n>>k;
ll p =1;
ll ans=0;
loop(i,0,31){
i... | ALGO | 0.999942 | 4.100502 |
4b784b84-79f0-48ae-b234-d1a445a1e96f | keithMaybe/code | opencv/opencv学习(三)之像素遍历等操作/pixel.cpp | #include <iostream>
#include <cstring>
#include <opencv2/core.hpp>
#include <opencv2/highgui.hpp>
#include <opencv2/imgproc.hpp>
using namespace std;
using namespace cv;
Mat& ScanImageAndReduce(Mat& I,const uchar* const table);
int main(int argc, char** argv)
{
int divideWith = 0;
Mat srcImage = imread(... | TOOL | 0.90554 | 3.102196 |
cd1cb560-d4ab-4d0d-9767-adf36a5d2adb | arifur30/Codeforces-Submissions | A_-_Blue-Red_Permutation.cpp | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define nl "\n"
#define arrin(arr, n) for(ll i = 0; i < n; i++) cin>>arr[i]
#define arrout(arr, n) for(ll i = 0; i < n; i++) cout<<arr[i]<<" ";cout<<nl
#define arrin2... | ALGO | 0.999653 | 3.876098 |
dd8b81a4-a664-4dfc-a022-f7fa5445ae7f | avolkov/rpi-opencv | libtbb_source_pkg/tbb-4.2~20140122/src/test/test_semaphore.cpp | //
// Test for counting semaphore.
//
// set semaphore to N
// create N + M threads
// have each thread
// A. P()
// B. increment atomic count
// C. spin for awhile checking the value of the count; make sure it doesn't exceed N
// D. decrement atomic count
// E. V()
//
#include "../tbb/semaphore.h"
#include ... | TEST | 0.855664 | 6.690385 |
c7b3db24-0d83-4553-bb85-ed696815c6bd | dejana023/stare-kopije-projekta | radi tlmwrite/tlm/ip.cpp | #ifndef IP_C
#define IP_C
#include "ip.hpp"
SC_HAS_PROCESS(Ip);
Ip::Ip(sc_module_name name) :
sc_module(name),
ready(1)
{
_index.resize(_IndexSize, std::vector<std::vector<num_f>>(
_IndexSize, std::vector<num_f>(4, 0.0f)));
interconnect_socket.register_b_transport(this, &Ip::b_transport);... | TOOL | 0.929285 | 4.232296 |
7eb43eec-dfdd-4b7a-81fc-b972b0343ccf | ttamx/Competitive-Programming | TOI/toi6_gem.cpp | #include<bits/stdc++.h>
using namespace std;
const int N=4e5+5;
vector<int> adj[N];
int disc[N],low[N],scc[N];
int timer;
stack<int> s;
void dfs(int u){
disc[u]=low[u]=++timer;
s.emplace(u);
for(int v:adj[u]){
if(!disc[v]){
dfs(v);
low[u]=min(low[u],low[v]);
}else... | ALGO | 0.999175 | 3.906252 |
e35eae32-3bac-4104-a632-5138e0704413 | thangisme/INT2215 | Week 5/B1.cpp | #include <iostream>
int main() {
int n, sum = 0;
std::cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
std::cin >> arr[i];
sum += arr[i];
}
int u = sum / n;
int o = 0;
for (int i = 0; i < n; i++) {
o += (arr[i] - u) * (arr[i] - u);
}
o /= n;
std::c... | ALGO | 0.999866 | 4.974446 |
7317f32b-ab2f-4fee-a69b-5f84a724dde6 | Kuldeep9071/DSA-in-CPP | Week2/Recursion1/NoOfDigits.cpp | /*
Problem statement
You are given a number 'n'.
Return number of digits in ‘n’.
Example:
Input: 'n' = 123
Output: 3
Explanation:
The 3 digits in ‘123’ are 1, 2 and 3.
Detailed explanation ( Input/output format, Notes, Images )
Sample Input 1:
121
Sample Output 1:
3
Explanation of sample output 1:
There are 3 di... | ALGO | 0.999916 | 5.222757 |
44594831-2540-4198-84a4-d3b63f27513c | ADS-bot/Leetcode | 1444-number-of-steps-to-reduce-a-number-to-zero/1444-number-of-steps-to-reduce-a-number-to-zero.cpp | class Solution {
public:
int numberOfSteps (int num) {
int ans = 0;
for (; num > 0; ans++)
if (num % 2 == 1) num--;
else num /= 2;
return ans;
}
};
| ALGO | 0.999922 | 5.911334 |
b1561930-c0c2-4fbf-931b-f05ffebd0035 | AR2029145/Rosas_Anthony_CSC5_43952 | Lab/New Folder/PayCheckIfStatementsV1/main.cpp | /*
* File: main.cpp
* Author: Anthony Rosas
* Created on March 16, 2015, 8:10 AM
* Purpose: Paycheck-> Independent if-statements
*/
//System Libraries
#include <iostream>//I/O standard
#include <iomanip>//Formatting
#include <fstream>//I/O File
using namespace std;
//User Libraries
//Global Constants
//Function Prototy... | TOOL | 0.900079 | 3.939551 |
3cc478e7-a33a-4780-add1-d27208486ba5 | om-ashish-soni/Competitive-Programming | problemset/topic_wise_problems/bit_manip/cirnos_perfect_bitmask_classroom.cpp | // problem link : https://codeforces.com/contest/1688/problem/A
// solution : below code
void solve(int t){
//shree ganeshay namah
int n;
read(n);
bitset<64> bs(n);
int m=0,one=0;
if(n==1){
cout<<3<<endl;
return;
}
vector<int> match;
F(i,0,64){
if(bs[i]==1){
match.pb(i);
}
}
int ans=(1LL<<match.... | ALGO | 0.999811 | 5.023775 |
1d92fcb0-2874-48a2-abc1-5b74aa708c2a | ishabhray/Competitive-Programming | codeforces/1517A.cpp | #include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define ii pair<int,int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll,ll>
#define vv vector
#define al... | ALGO | 0.999918 | 4.767556 |
ff0b53eb-bd2a-4d26-912c-bc44ea49905f | acinnes/bmn | playbmn_cpu.cpp | #include <iostream>
#include <random>
#include <utility>
#include <cassert>
#include <ctime>
#include <cstdio>
#include <future>
#include <mutex>
bool verbose = false;
// Beggar my neighbour deal explorer.
//
// Efficiently search (in pseudo random order) through shuffled deck starting points,
// to find the longest ... | ALGO | 0.998856 | 7.771241 |
4ff3a44b-4493-444e-9d90-3c540732507a | Vishaldhakrey/leetcode | 155-min-stack/min-stack.cpp | #include <stack>
#include <climits>
class MinStack {
public:
std::stack<long long> st;
long long minVal;
MinStack() {
while (!st.empty()) st.pop();
minVal = LLONG_MAX;
}
void push(int val) {
long long value = val;
if (st.empty()) {
st.push(value);
... | ALGO | 0.999664 | 6.621866 |
9b5fef62-7a1d-4d6a-8586-a1bc2d4932ac | Varadpatil21/MyGFGSolutions | Easy/Print adjacency list/print-adjacency-list.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
// Function to return the adjacency list for each vertex.
vector<vector<int>> printGraph(int V, vector<pair<int,int>>edges) {
// Code here
int arr[5][5];
vector<vector<i... | ALGO | 0.999887 | 6.210599 |
414aec25-9ad8-4a9e-ad18-f672f63fb62b | neelaryan2/CompetitiveProgramming | CodeForces/EDU/Two Pointers/307094H.cpp | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "trace.h"
#else
#define trace(args...)
#endif
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#defi... | ALGO | 0.999744 | 4.066296 |
3dda7c08-dbc7-4b85-9f79-b1716f4c8824 | rkasdf/TCSE2013 | WeeklyCode/week5/Valid Palindrome/lishiqiang.cpp | class Solution {
public:
bool isPalindrome(string s) {
int i=0,j=s.size()-1;
while(i<=j){
while(i<=j&&!isalnum(s[i])) i++;
while(i<=j&&!isalnum(s[j])) j--;
if(i<=j) if(tolower(s[i])!=tolower(s[j])) return false;
i++;
j--;
}
... | ALGO | 0.999632 | 6.436511 |
66f94ce3-5a1c-4cfa-90bb-8ffc788daf87 | MdShah-alam/Hackerrank | Bamboo_cutting.cpp | #include<bits/stdc++.h>
using namespace std;
int n, totalLength;
vector<int>bamboo;
vector<bool>used;
bool dfs(int index, int currentLength, int targetLength, int count) {
if (count == 0) return true;
if (currentLength == targetLength) return dfs(0, 0, targetLength, count - 1);
for (int i = index; i < n;... | ALGO | 0.999862 | 4.52281 |
43e379d9-90d5-4b0e-99bd-11b87ae703f0 | marinov98/fall-127-proof-of-work | Python_127_proof_winter/forloop.cpp | #include <iostream>
using namespace std;
int main()
{
int Min-Num=1;
int Max_Num=10;
int num;
cout<<'Number Number Squared \n';
for(num=Min_Num;num<=Max_Num;num++)
{ cout<<num<<'\t\t'<<(num*num)<<endl;
}
return 0;
}
| TOOL | 0.959194 | 3.154287 |
51329de0-e4a3-427f-8e3a-7bceffa10fc3 | Zenithw13/comsil_5_github | main.cpp | #include <stdio.h>
#include "Stack.h"
#include "LinkedList.h"
void prnMenu(){
cout<<"*******************************************"<<endl;
cout<<"* 1. 삽입 2. 삭제 3. 출력 4. 종료 *"<<endl;
cout<<"*******************************************"<<endl;
cout<<endl;
cout<<"원하시는 메뉴를 골라주세요: ";
}
int main(){
int mode,... | TOOL | 0.963718 | 4.286177 |
e182f4b9-eb01-4ef4-b818-3be3136329ae | KrishanKantAgnihotri/CP-Solutions | CodeChef/C++14/LONGCOOK/30756739.cpp | #include<bits/stdc++.h>
#include<boost/multiprecision/cpp_int.hpp>
#define ull unsigned long long int
#define ll long long
#define vi vector<int>
#define pi pair<int,int>
#define vii vector<pi>
#define eb emplace_back
#define mii map<int,int>
#define all(x) x.begin(),x.end()
#define fast_io ios_base::sync_with_stdio(fa... | ALGO | 0.999929 | 3.934645 |
58cbbfcf-d3a4-4ecb-a4b5-55618dc4ad68 | Mohit29061999/CbLvJan | Lec-15/BinarySearch.Cpp | #include <iostream>
using namespace std;
//recursive solution for binary search
void bs(int arr[],int s,int e,int x){//x is value to be searched
//base case
if(s>e){ //no elements are left to be searched
cout << -1 << endl;
return;
}
int mid =(s+e)/2; //middle index
if(arr[mid]==x)... | ALGO | 0.999891 | 4.928274 |
d0e87105-8e36-430c-a0fe-4ed40598a2ef | wresinski/leetcode | 1143.longest-common-subsequence.cpp | class Solution {
public:
int longestCommonSubsequence(string text1, string text2) {
int m = text1.size();
int n = text2.size();
vector<int> dp(n+1); // 数组优化为一维
int temp1;
for (int i=1; i<=m; ++i) {
temp1 = 0;
for (int j=1; j<=n; ++j) {
int temp2 = temp1;
temp1 = text1[i-1]==text2[j-1]?(dp[j-1]+1)... | ALGO | 0.99995 | 6.245286 |
c1670ce2-516d-48da-8552-71753d869116 | syuhari/Blade | Blade/libs/cocos2dx/support/CCPointExtension.cpp | #include "CCPointExtension.h"
#include "ccMacros.h" // FLT_EPSILON
#include <stdio.h>
NS_CC_BEGIN
#define kCCPointEpsilon FLT_EPSILON
float
ccpLength(const CCPoint& v)
{
return sqrtf(ccpLengthSQ(v));
}
float
ccpDistance(const CCPoint& v1, const CCPoint& v2)
{
return ccpLength(ccpSub(v1, v2));
}
CCPoint
ccp... | TOOL | 0.899947 | 6.540313 |
dae222e9-8a94-441c-9d6a-9f551f7109d0 | chirantan-basu01/LeetCode-I | third-maximum-number/third-maximum-number.cpp | class Solution {
public:
int thirdMax(vector<int>& nums) {
long first=LONG_MIN;
long second=LONG_MIN;
long third=LONG_MIN;
for(auto num:nums){
if(num==first||num==second||num==third)
continue;
if(num>=first){
... | ALGO | 0.999985 | 5.379365 |
e20c87e7-5cd9-4379-ab28-659d2f09440b | Arkaenaz/GDPARCM | Shared/OpenCV/sources/samples/cpp/tutorial_code/ImgTrans/houghlines.cpp | /**
* @file houghlines.cpp
* @brief This program demonstrates line finding with the Hough transform
*/
#include "opencv2/imgcodecs.hpp"
#include "opencv2/highgui.hpp"
#include "opencv2/imgproc.hpp"
using namespace cv;
using namespace std;
int main(int argc, char** argv)
{
// Declare the output variables
M... | ALGO | 0.993465 | 5.88318 |
55241f96-34f3-48cc-8191-c17bd9b532d7 | MikhailJacques/Design-Patterns | Behavioral/Chain of Responsibility/Chain_of_Responsibility_C++/Chain_of_Responsibility_1.cpp | // Chain of Responsibility Design Pattern - Behavioral Category
// 1. Put a "next" pointer in the base class
// 2. The "chain" method in the base class always delegates to the next object
// 3. If the derived classes cannot handle, they delegate to the base class
// http://sourcemaking.com/design_patterns/chain_of_re... | ALGO | 0.994661 | 6.458154 |
c20a747e-8f3b-4498-9588-bc8ea979c246 | tahsinrahman/uva | 10910.cpp | #include <bits/stdc++.h>
using namespace std;
int n, t, p, mx, dp[71][71];
int f(int i, int w)
{
if(i == n) {
if(!w) return 1;
return 0;
}
if(dp[i][w] != -1) return dp[i][w];
int sum = 0;
for(int j = p; w-j >= 0 && j <= mx; ++j) sum += f(i+1, w-j);
return dp[i][w] = sum;
}
int main()
{
int T;
scanf("... | ALGO | 0.999934 | 3.609508 |
bc3c6faf-67d3-49e4-86c2-e9d82bc57980 | jellc/Library | test/aizu-online-judge/2934.test.cpp | #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/2934"
#include <iostream>
#include "src/string/Manacher.hpp"
int main() {
using namespace workspace;
size_t n;
std::string s;
std::cin >> n >> s;
auto r = Manacher(s);
for (size_t k = 2; k <= n; ++k) {
bool fail = false;
for (size_t i = k... | ALGO | 0.999811 | 4.803068 |
b7869a5b-d1ea-4880-9ed1-0f15c7e290c3 | longlongvip/LuoGu | Popular/1980/main.cpp | #include<cstdio>
#include <climits>
#include<iostream>
int count(int m , int x);
using namespace std;
int main(){
int n , x;
cin >> n >> x;
int sum = 0;
for(int i = 1 ; i <= n ; i++)
{
sum = sum + count(i , x);
}
cout << sum << endl;
system("pause");
return 0;
}
int count(in... | ALGO | 0.998728 | 3.841999 |
4f5d2142-4198-4b32-aaeb-f0e4ce0c6478 | NikhilK06/Leet | solutions/1514. Path with Maximum Probability/1514.cpp | class Solution {
public:
double maxProbability(int n, vector<vector<int>>& edges,
vector<double>& succProb, int start, int end) {
vector<vector<pair<int, double>>> graph(n); // {a: [(b, prob_ab)]}
priority_queue<pair<double, int>> maxHeap; // (prob to reach u, u)
maxHeap.emplac... | ALGO | 0.999984 | 6.532829 |
110dc16b-41c7-4e14-ac24-3e27d9f88710 | nayuta-0909/Kyopro_Practice | 典型90/sol/005-03.cpp | #include <iostream>
using namespace std;
long long modpow(long long a, long long b, long long m) {
long long p = 1, q = a;
for (int i = 0; i < 63; i++) {
if ((b & (1LL << i)) != 0) {
p *= q;
p %= m;
}
q *= q;
q %= m;
}
return p;
}
const long long mod = 1000000007;
//
long long N, B, K;
long long C... | ALGO | 0.999684 | 3.962644 |
40c37d63-f318-442a-ae77-5ac8e4b839ba | 0968377398/-inh-Vi-t-Ho-ng | bai2_ss8.cpp | #include<stdio.h>
int main(){
int n;
int sotachra;
int s = 0;
printf("Nhap n: ");
scanf("%d",&n);
for(;n!=0;){
sotachra = n % 10;
s += sotachra;
n /= 10;
}
printf("%d",s);
}
| ALGO | 0.99931 | 3.351453 |
97567143-2d7f-41d3-a202-ff4788a4e502 | niu-lijinliang/chaseOffer | 数组/39.cpp | class Solution {
public:
int majorityElement(vector<int>& nums) {
int candidate = -1;
int count = 0;
for (int num : nums) {
if (num == candidate)
++count;
else if (--count < 0) {
candidate = num;
count = 1;
}... | ALGO | 0.999968 | 5.725939 |
268301e1-a6a4-41c1-81ed-5221f1e74a9b | Monal-Patel/amrsolver | lib/boost/libs/geometry/doc/src/examples/algorithms/perimeter.cpp | // Boost.Geometry (aka GGL, Generic Geometry Library)
// QuickBook Example
//[perimeter
//` Calculate the perimeter of a polygon
#include <iostream>
#include <boost/geometry.hpp>
#include <boost/geometry/geometries/point_xy.hpp>
#include <boost/geometry/geometries/polygon.hpp>
namespace bg = boost::geometry; /*< Co... | ALGO | 0.953727 | 5.732238 |
9f3eb98d-86e8-4e01-b7a7-d018bb81c65a | adriablancafort/problemes-ap3 | dynamic-programing/common-scores.cpp | #include <iostream>
#include <vector>
using namespace std;
int findLCS(const vector<int>& arthur, const vector<int>& bob, vector<vector<int>>& dp, int i, int j) {
if (i == 0 || j == 0) return 0;
if (dp[i][j] != -1) return dp[i][j];
if (arthur[i-1] == bob[j-1]) {
dp[i][j] = 1 + findLCS(art... | ALGO | 0.999985 | 4.64789 |
9fb323d6-6763-4820-bbc9-a69aa48f1ba0 | Taejin1221/Re-PS | Baekjoon/Baekjoon02738.cpp | // Baekjoon02738.cpp
#include <iostream>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int matA[100][100], matB[100][100];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> matA[i][j];
for (int i = 0; i < n; i++)
for (int j = 0; j < ... | ALGO | 0.999826 | 3.61157 |
d4d6a569-da44-4233-b210-681032d01405 | brijeshchhatrala01/noteapp_task | 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 |
dff9cb2f-73f4-4043-b7cb-4e5cca0a8ec3 | ishandutta2007/codeforces | rajat1603/normal/763/C.cpp | #include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 5;
int mod , n;
int arr[N];
int tmp[N];
int power(int a , int b){
int res = 1;
while(b){
if(b & 1){
res = (1LL * res * a) % mod;
}
a = (1LL * a * a) % mod;
b >>= 1;
}
return res;
}
bool check(in... | ALGO | 0.999935 | 3.908166 |
bf6ec062-c11a-4a7d-b163-d968c331d543 | Yawn-Sean/Daily_CF_Problems | daily_problems/2025/07/0703/personal_submission/cf1510g_lengli.cpp | /*
lengli_QAQ
Hope there are no bugs!!!
*/
#include <bits/stdc++.h>
#define fastio std::ios::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0)
#define all(x) x.begin(),x.end()
#define pb push_back
#define i64 long long
void solve(){
int n,k;
std::cin>>n>>k;
std::vector<std::vector<int>> eg(n+2);
fo... | ALGO | 0.999953 | 4.47762 |
ae0be896-bc5a-48eb-8d32-e138b240339b | AMRITESH-MISHRA-15/POTD-2024 | 01-01-2025/3_divisors.cpp | class Solution {
public:
bool isThree(int n) {
int count=0;
for(int i=2;i<n;i++){
if(n%i==0)count++;
}
if(count==1)return 1;
else return 0;
}
}; | ALGO | 0.999846 | 4.932351 |
714b526e-3e64-4f73-a07b-cec6f6aec168 | MirajShekhda/LeetCode | 1717-maximum-score-from-removing-substrings/1717-maximum-score-from-removing-substrings.cpp | class Solution {
private:
int removeSubStr(string s, string pattern, int max, int min){
int n = s.size();
int answer = 0;
stack<char> st;
for(int i=0; i<n; i++){
if(!st.empty() && st.top() == pattern[0] && s[i] == pattern[1]){
st.pop();
an... | ALGO | 0.999951 | 5.550022 |
6b958e5a-51ae-4475-92b6-e369d832aef0 | Caproner/HDU | 2000-2099/2049.cpp | #include<stdio.h>
int ca(int n,int m)
{
int i;
long long ans=1;
for(i=n;i>n-m;i--)ans*=i;
for(i=1;i<=m;i++)ans/=i;
return (int)ans;
}
int main()
{
int c,n,m,i,j;
long long a[21];
scanf("%d",&c);
while(c--)
{
scanf("%d %d",&n,&m);
a[0]=1;
a[1]=0;
fo... | ALGO | 0.999972 | 3.930656 |
54aa5bf6-ba13-4408-9f25-91170bbf486d | GuacheSuede/MSSubmission1234567890 | submission/sma/boost_1_69_0/libs/math/example/hyperexponential_snips.cpp | // Caution: this file contains Quickbook markup as well as code
// and comments, don't change any of the special comment markups!
#ifdef _MSC_VER
# pragma warning (disable : 4996) // disable -D_SCL_SECURE_NO_WARNINGS C++ 'Checked Iterators'
#endif
#include <boost/math/distributions/hyperexponential.hpp>
#include <io... | ALGO | 0.938883 | 3.775836 |
7f6511c2-b131-4687-a3e1-a09392256dca | xivid/aoapc-bac1nd | part2/chapter6/6.5/Lists/127.cpp | #include<cstdio>
#include<cstdlib>
#include<cstring>
int top[60],pile=0; //top[i]=card number of pile i,pile=tot of pile
char s[60][60][3];
void copy(int x,int y)
{
for(int i=1;i<=top[y];i++) {s[x][i][0]=s[y][i][0]; s[x][i][1]=s[y][i][1];}
top[x]=top[y];
}
bool movable(int x)
{
if(x-3>0&&(s[x-3][top[x-3]][0]==s[x... | ALGO | 0.998747 | 3.576657 |
bc98c7b9-07e5-48f7-ab03-aa2f86bfb987 | Harsh-COE/Data-Structure-Algorithm | Competitive Programming/Codechef/MarchLong2021/XOr.cpp | /********************************************************************************************************************************
********************************************************************************************************************************
d8b 888 d8b Y88b d88P ... | ALGO | 0.999724 | 3.330948 |
81871c58-db11-418c-b84f-64cd8725c08f | jmvalois/Sherlock_Compilation | SRC_test_env/analysis/integrator/PFEMIntegrator.cpp | // $Revision: 1.0 $
// $Date: 2013-01-16 12:51:53 $
// $Source: /usr/local/cvs/OpenSees/SRC/analysis/integrator/PFEMIntegrator.h,v $
// Written : Minjie Zhu
// Created : Jan 2013
//
// Description: This file contains the class definition for PFEMIntegrator.
// PFEMIntegrator is an algorithmic class for performing a PF... | ALGO | 0.993469 | 5.327183 |
5cce98ce-cbd4-4970-8423-46435c721a34 | jiangyinzuo/algorithm | src/exercise/holiday/j.cpp | //
// Created by Jiang Yinzuo on 2020/7/1.
//
#include <cstdio>
int main() {
long long m, a, b, c;
scanf("%lld %lld %lld %lld", &m, &a, &b, &c);
m++;
long long res = ((a % m)) ^ ((b - 1) % m) ^ ((c - 1) % m);
if (res == 0)
printf("Danftito\n");
else
printf("Tomaz\n");
retur... | ALGO | 0.999975 | 4.396343 |
23a18c9e-c03c-4a6e-a3e5-26aae6114936 | EthanKim8683/High-School-Competitive-Programming | CSAcademy/Dynamic Programming/unfair_game.cpp | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
using I = int;
using Lli = long long int;
const Lli MIN = -1e18;
const I N = 1e5;
I a_arr[N];
Lli dp[2][N + 1];
I main(void) {
#ifdef ETHANKIM8683
freopen("unfair_game.in", "r", stdin);
#endif
cin.tie(0)->sync_with_stdio(0);
I n;... | ALGO | 0.999883 | 3.855439 |
e41118d1-b2b6-47f5-bc45-bcaff81cf6ae | Dai0526/Algorithm | Algorithm/OnlineAssessment/LeetCode/Medium/946_ValidStackSequence.cpp | #include <vector>
#include <stack>
using namespace std;
class Solution {
public:
bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {
if(pushed.size() != popped.size()){
return false;
}
int n = pushed.size();
stack<int> stk;
int popId... | ALGO | 0.999662 | 6.305965 |
c823ae1e-a315-4f0a-97d3-a42883e98277 | 05sachin/DSAwithCpp | 14-AssignmentTree/7ReplaceWithDepth.cpp | // You are given a generic tree. You have to replace each node with its depth value. You just have to update the data of each node, there is no need to return or print anything.
#include<iostream>
#include<vector>
#include<climits>
#include<queue>
#include "TreeNode.h"
using namespace std;
void replaceWithDepth(TreeNod... | ALGO | 0.999563 | 4.929526 |
b831644c-c70a-4555-8916-3fd75242c2c2 | ishandutta2007/codeforces | reyna/normal/626/E.cpp | //In the name of God
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
typedef long long ll;
typedef pair<int, int> pii;
template<class P, class Q> inline P smin(P &a, Q b) { if (b < a) a = b; return a; }
template<class P, class Q> inline P smax(P &a, Q b) { if (a < b) a... | ALGO | 0.999944 | 3.511425 |
bb889073-653f-48f9-a002-21fbc0798e63 | miemie2013/ncnn_ppyolov2 | src/layer/arm/sigmoid_arm.cpp | #include "sigmoid_arm.h"
#include <math.h>
#if __ARM_NEON
#include <arm_neon.h>
#include "neon_mathfun.h"
#endif // __ARM_NEON
#include "arm_usability.h"
#include "cpu.h"
namespace ncnn {
Sigmoid_arm::Sigmoid_arm()
{
#if __ARM_NEON
support_packing = true;
#if NCNN_ARM82
support_fp16_storage = cpu_support_... | ALGO | 0.998189 | 6.299802 |
6e81527c-e9e6-4ab7-aee0-d0d13393d4c2 | Notreallyaryann/DSA | String/Largest3SameDigitNoInString.cpp | class Solution {
public:
string largestGoodInteger(string num) {
int n=num.size();
char maxchar=' ';
for(int i=2;i<n;i++){
if(num[i]==num[i-1] && num[i]==num[i-2]){
maxchar=max(maxchar,num[i]);
}
}
if(maxchar==' '){
return "";
}
return ... | ALGO | 0.9999 | 5.438982 |
4a6e51c0-ecf9-4b66-ae3a-b153e69cc198 | chaitrali2411/coding_with_C- | fibonacci.cpp | #include <iostream>
using namespace std;
int main() {
int n;
cout << "Enter the number of terms: ";
cin >> n;
int t1 = 0, t2 = 1, nextTerm;
cout << "Fibonacci Series: ";
for (int i = 1; i <= n; ++i) {
cout << t1 << " ";
nextTerm = t1 + t2;
t1 = t2;
t2 = nextT... | ALGO | 0.999879 | 4.816182 |
877168a3-f653-4a2e-a5fb-2ab86d3f6784 | DEEPIKA-SUK/6Companies30Days | Microsoft/Q12.cpp | #include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function template for C++
class Solution{
public:
// arr[] : int input array of integers
// k : the quadruple sum required
vector<vector<int> > fourSum(vector<int> &a, int k) {
// Your code goes here
vector<ve... | ALGO | 0.999891 | 4.981674 |
7227f6d1-4439-4eb9-a3c5-793e62af852c | ishandutta2007/codeforces | chenyanbo/normal/939/C.cpp | #include<bits/stdc++.h>
#define N 210007
using namespace std;
inline int read()
{
int ret=0; char c=getchar();
while(c<48||c>57)c=getchar();
while(c>=48 && c<=57)ret=ret*10+c-48,c=getchar();
return ret;
}
int ss,v,n,p,f,s,h;
int a[N],b[N],ans; //long long //1 1ll
int main()
{
n=read();
for(int i=1; i<=n; ++i)a... | ALGO | 0.99995 | 3.074291 |
745f4c61-6e60-434a-81aa-bb25cac54a84 | YJ243/codetree-TILs | 231221/좌표평면 위의 균형 2/balance-on-coordinate-plane-2.cpp | #include <iostream>
#include <algorithm>
#define MAX_N 100
using namespace std;
int n;
int x[MAX_N];
int y[MAX_N];
int ans;
int main() {
// 입력
cin >> n;
for(int i=0; i<n; i++){
cin >> x[i] >> y[i];
}
// 모든 직선에 대해 전부 시도해보
for(int i=0; i<=100; i += 2){
for(int j=0; j<=100; j += 2... | ALGO | 0.999898 | 4.556958 |
27129935-0145-47f9-800b-6c0ac10e796f | KingNNT/C-CPP | Source/Algorithm/Search/BreadthFirstSearch.cpp | /*
Breadth First Search for a Graph
*/
/* Code by KingNNT */
#include <bits/stdc++.h>
#define pathio "/mnt/Learning And Working/Code/C-CPP/GNU-Compiler/In-Out/"
// #define pathio "E:/Code/C-CPP/GNU-Compiler/In-Out/"
#define lfi pathio "input.txt", "r", stdin
#define lfo pathio "output.txt", "w", stdout
using namespac... | ALGO | 0.999962 | 4.528368 |
8595d59d-b35f-43dc-8729-ef117937527c | Shubham-Git07/CPP_Programs | practise-pgms/area-of-rectangle.cpp | #include<iostream>
using namespace std;
//calculate area of rectangle
int main()
{
int len, breath;
cout<<"Enter length and breath of rectangle is:"<<endl;
cin>>len>>breath;
cout<<"area of reactanle is ="<<len*breath<<endl;
}
| TOOL | 0.959733 | 3.445714 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.