uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
61b18ab0-e66d-45ce-91b2-42d3267acb75 | Heisenberg-737/Road_To_Intern | Graphs/micro_2.cpp | #include <bits/stdc++.h>
using namespace std;
void solution(int n, vector<int> &r, vector<int> &c)
{
vector<vector<char>> mine(n, vector<char>(n, '0'));
for (int i = 0; i < r.size(); i++)
mine[r[i]][c[i]] = 'B';
int dx[] = {1, 1, 1, 0, 0, -1, -1, -1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
... | ALGO | 0.99985 | 4.214398 |
1be4f02f-23c3-4eab-bc9d-5109dd26c9de | shamikh1014/code7 | Array/arrayProblem4.cpp | // Given an array which consists of 0, 1 and 2. Sort the array without using a sorting algo
#include<bits/stdc++.h>
using namespace std;
// Method 1
void sort012_1(int arr[], int size){
int low=0;
int mid=0;
int high=size-1;
while(mid<=high){
switch(arr[mid]){
case 0:
... | ALGO | 0.999922 | 5.045432 |
4afd5f3b-77a5-4060-a311-70a68cc527dc | Earlz/renamedcoin | src/rpcnet.cpp | #include "rpcserver.h"
#include "main.h"
#include "net.h"
#include "netbase.h"
#include "protocol.h"
#include "sync.h"
#include "util.h"
#include <boost/foreach.hpp>
#include "json/json_spirit_value.h"
using namespace json_spirit;
using namespace std;
Value getconnectioncount(const Array& params, bool fHelp)
{
... | WEB | 0.938986 | 6.616203 |
f0204c55-ca59-4f4e-8dda-09dad9b88ec8 | fgokmenoglu/code-something-daily | Codewars/2024/C++/7kyu/upper_body_strength.cpp | /*
* Alex is transitioning from website design to coding and wants to sharpen his skills with CodeWars.
* He can do ten kata in an hour, but when he makes a mistake, he must do pushups.
* These pushups really tire poor Alex out, so every time he does them they take twice as long.
* His first set of redemption pus... | ALGO | 0.996686 | 3.843742 |
fdc97f92-669c-4b2a-9033-b0f0776d4b6a | amtf1683/llvm | clang/lib/Driver/ToolChains/MSVC.cpp | #include "MSVC.h"
#include "CommonArgs.h"
#include "Darwin.h"
#include "clang/Basic/CharInfo.h"
#include "clang/Basic/Version.h"
#include "clang/Config/config.h"
#include "clang/Driver/Compilation.h"
#include "clang/Driver/Driver.h"
#include "clang/Driver/DriverDiagnostic.h"
#include "clang/Driver/Options.h"
#include "... | TOOL | 0.942166 | 7.223324 |
db01116d-3fdd-4235-8a6a-9f5d596849f9 | C0ntrolDev/scrollbar_ultima | example/customized_example/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.998721 | 6.76775 |
c9f501e1-6f6a-4023-ade7-0a964db6e73d | MahajanYashasvi156/LeetCoding | 98-validate-binary-search-tree/98-validate-binary-search-tree.cpp | /*
Link - https://leetcode.com/problems/validate-binary-search-tree/submissions/
Inorder traversal of BST is nothing but sorted order
So let us use that property as follows
Maintain the inorder predecessor, and check if the that node is lesser than current node.
If yes, then good and continue
If not, then return false... | ALGO | 0.999985 | 7.012415 |
225a3eaf-6316-44ff-bd33-9a7d0d78b9fa | Keerthu8999/PROJECT1 | Untitled1.cpp | #include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
}*top=NULL;
void insb(int x)
{
struct node *temp;
temp=(struct node*)malloc (sizeof(struct node));
temp->data=x;
temp->next=top;
top=temp;
}
void insm(int x,int n)
{
int i;
struct node *temp,*temp1;
temp=(struct node*)malloc(size... | ALGO | 0.999722 | 3.531326 |
07112656-1419-4d88-b1cd-2060adb7b407 | im-Toqeer-506/Daily_LeetCode | 883-car-fleet/car-fleet.cpp | class Solution {
public:
int carFleet(int target, vector<int>& position, vector<int>& speed) {
int n = position.size();
stack<float> st;
vector<pair<int, float>> vec;
for (int i = 0; i < n; i++) {
vec.push_back({position[i], float(target - position[i]) / speed[i]});
... | ALGO | 0.999655 | 5.816211 |
2a7a0477-8132-4d4f-938b-1c3de375c4f3 | janani271/CP-solutions-3 | xorandor.cpp | #include<bits/stdc++.h>
using namespace std;
string a , b;
long long n , i , a_count , b_count;
int main()
{
cin>>a>>b;
if(a.size()!=b.size())
cout<<"NO";
else
{
n = a.size();
for(i=0;i<n;i++)
{
if(a[i]=='0')
a_count++;
}
for(i=0;i<n;i++)
{
if(b[i]=='0')
b_count++;
}
if(a_count!=b... | ALGO | 0.999972 | 4.377394 |
79bd7e2b-b987-471d-9144-dd193b168424 | GerritTheron/openCV-contrib | modules/optflow/src/simpleflow.cpp | #include "precomp.hpp"
#ifdef _MSC_VER
# pragma warning(disable: 4512)
#endif
//
// 2D dense optical flow algorithm from the following paper:
// Michael Tao, Jiamin Bai, Pushmeet Kohli, and Sylvain Paris.
// "SimpleFlow: A Non-iterative, Sublinear Optical Flow Algorithm"
// Computer Graphics Forum (Eurographics 201... | ALGO | 0.999242 | 6.749408 |
544fd9e6-49cf-46fa-b877-d59aac9d0a0a | Dr-XX/pandore-bug-injected | src/operatorsP0/filtering/pexponentialfiltering.cpp | /**
* @author Regis Clouard - 1994-10-13
*/
#include <math.h>
#include <pandore.h>
using namespace pandore;
/**
* @file pexponentialfiltering.cpp
*
* Filtre exponentiel symetrique.
* alpha: Valeur de lissage. (0 fort, 1 nul).
* Construction d'une image intermediaire par passage
* d'un filtre exponentielle sur... | ALGO | 0.990287 | 4.84683 |
43945857-aff6-410d-88e1-be2e893d6382 | ishandutta2007/codeforces | tanphatls987/normal/131/A.cpp | #include <iostream>
#include <fstream>
#include <cstdlib>
#include <string.h>
#include <math.h>
#include <deque>
#define check() printf("tick\n")
using namespace std;
const int maxi=100000;
string s;
int key,change,i;
int main()
{
cin>>s;
change=1;
for(i=1;i<s.length();i++) if (s[i]>='a'&&s[i]<='z') chan... | ALGO | 0.997001 | 4.114307 |
4452d6d3-c1d5-4e14-855e-3e0e9a682349 | hrishithub/Data-structures-and-algorithms | arrays/easy/0111-number-that-appear-only-once/0111-number-that-appear-only-once.cpp | /*
https://leetcode.com/problems/single-number/
Brute: Use nested for loop TC- O(N^2) SC- O(1)
Better: Use Hashing (el with freq as one in hashmap is our ans) TC- O(N) SC-O(N) as we use hashmap
Optimal: XOR approach (This works because of property of XOR which is A^A=0) TC- O(N) SC- O(1)
*/
#include <bits/stdc++.h>... | ALGO | 0.999863 | 5.663254 |
944bd9d3-9cca-4ee9-877b-62f77a75fbfb | doduck210/Algorithm_Study | 42578.cpp | //https://programmers.co.kr/learn/courses/30/lessons/42578
#include <string>
#include <vector>
using namespace std;
int solution(vector<vector<string>> clothes) {
vector<string> types;
vector<int> ans;
for(int i=0;i<clothes.size();i++){
bool no=true;
for(int j=0;j<types.size(... | ALGO | 0.999688 | 5.55368 |
bb94ccf2-f96b-4b9d-8693-fbb81109579a | kishantalekar/180_DAYS_OF_CODE_CHALLENGE | DAY_4/Factorial.cpp |
#include<iostream>
using namespace std;
int main(){
int n,fact=1;
cout << "enter the n number :";
cin >> n;
for (int i = 1; i <= n; i += 1)
{
fact *= i;
}
cout << fact;
return 0;
} | ALGO | 0.999939 | 4.319749 |
b627002f-67a6-4df2-9276-71bd95d4f43f | avigautam-329/Interview-Preparation | Recursion and Backtracking/NoOfNumbers-WithRepition.cpp | /*
Given a number n, find number of numbers that are greater than n using the same set of digits as n. n might have duplicate digits.
Input Format :
Integer n
Output Format :
Count of greater numbers
Sample Input :
122
Sample Output :
2
*/
#include<bits/stdc++.h>
#include<cmath>
using namespace std;
long count(lo... | ALGO | 0.999658 | 5.525029 |
58e0bcdf-1df8-4b61-8cd5-9d13b3e71d9e | RAHUL27474/coding | Hashmap/2225.cpp | class Solution {
public:
vector<vector<int>> findWinners(vector<vector<int>>& matches) {
map<int,int>loss;
for(auto it:matches){
loss[it[1]]++;
}
vector<int>zeros;
vector<int>ones;
for(auto it:matches){
i... | ALGO | 0.999802 | 5.680478 |
53fce144-eb01-4619-b723-2ac720ff8c9b | itamar8910/DarkForest | libc/Math.cpp |
#include "Math.h"
namespace Math
{
u32 min(u32 x, u32 y)
{
return (x < y) ? x : y;
}
u32 div_ceil(u32 e, u32 d)
{
u32 leftover = e % d;
u32 floor = e / d;
return (leftover == 0) ? floor : floor + 1;
}
u32 round_up(u32 val, u32 m)
{
if((val ... | TOOL | 0.951997 | 5.471962 |
9f8c0a90-3f42-4b8b-8a25-c1f223f36639 | mmarinriera/dorsal_closure_simulation | src/SplitHoneycombVertexMeshGenerator.cpp | #include "SplitHoneycombVertexMeshGenerator.hpp"
SplitHoneycombVertexMeshGenerator::SplitHoneycombVertexMeshGenerator(unsigned numElementsAcross,
unsigned numElementsUp,
bool isFlatBottom,
... | ALGO | 0.903398 | 5.858708 |
0784d008-52ac-464e-9aab-d53055d3594c | yuvraj0028/leetcode-submissions | 88-merge-sorted-array/merge-sorted-array.cpp | class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
if(m == 0){
nums1 = nums2;
return;
}
if(n == 0){
return;
}
vector<int> ans(m+n);
for(int i = 0; i<n; i++)
nums1.pop_b... | ALGO | 0.999967 | 5.31865 |
4a2bb5d7-3091-41d7-89d5-25637b66d754 | dreamhunter2333/essential_cpp_learn | ch03/3.2.cpp | #include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
using namespace std;
class Lessthan
{
public:
bool operator()(const string &s1, const string &s2)
{
return s1.size() < s2.size();
}
};
int main()
{
ifstream infile("3.1.txt");
if (!infile)
{... | ALGO | 0.997409 | 4.502032 |
798de652-a7a2-4941-9391-cad0dd0a3ad5 | Brauuwu/DSA_Rebuild | CON2_25 - TẬP CON BẰNG NHAU.cpp | #include<bits/stdc++.h>
#define ll long long
#define oo 1e9
using namespace std;
int main(){
int t; cin >> t;
while(t--){
int n; cin >> n;
int a[n];
int sum = 0;
for(int &x:a){
cin >> x;
sum += x;
}
if(sum&1) cout << "NO\n";
else cout << "YES\n";
}
return 0;
}
| ALGO | 0.99938 | 4.122922 |
0aef00b9-0e72-47b9-86c4-24bce588f054 | jonathandarryl/UVa-Code | 1197.cpp | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef vector<int> vi;
int main(void){
vector<vi> AdjList;
int n,m;
int flag[30000];
int sus[30000];
while(cin>>n>>m &&(n || m)){
AdjList.assign(n,vi());
for(int i=0;i<n... | ALGO | 0.999857 | 3.920565 |
1f551184-8a7a-4ecf-be18-bcbad831aedf | Arihant140206/DSA | 9-palindrome-number/palindrome-number.cpp | class Solution {
public:
bool isPalindrome(int x) {
if (x < 0) {
return false;
}
long reverse = 0;
int xcopy = x;
while (x > 0) {
reverse = (reverse * 10) + (x % 10);
x /= 10;
}
return reverse == xcopy;
}
};
| ALGO | 0.999918 | 6.07936 |
40426626-911a-4e80-a3ae-ee731cb68a11 | singlarohan/leetcode_sol | 0822-unique-morse-code-words/2022-08-17 13.16.33 - Accepted - runtime 11ms - memory 8.7MB.cpp | class Solution {
public:
int uniqueMorseRepresentations(vector<string>& words) {
vector<string> s = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
unordered_map<string, int> mp;
... | ALGO | 0.999919 | 6.363226 |
cb6d9e00-911f-4a3f-b960-00afa033efe3 | anubhawbhalotia/Competitive-Programming | LeetCode/162. Find Peak Element.cpp | class Solution {
public:
int findPeakElement(vector<int>& nums) {
int l = 0, r = nums.size() - 1;
while(l < r)
{
int mid = (l + r) / 2;
if(nums[mid] < nums[0] + mid)
e = mid - 1;
}
}
}; | ALGO | 0.99989 | 5.100184 |
dab5b925-4ca7-45d3-8531-b30e1a2cbc3b | sabrina-boby/dimik_problem_solution-cpp | dimik-37-alphabate_short.cpp | #include<iostream>
#include<cstring>
using namespace std;
int main()
{
int t,i,j;
cin>>t;
char a[t][10000];
char temp[10000];
for(i=0; i<t; i++)
{
scanf("%s",&a[i]);
}
//cout<<"a = "<<a[i]<<endl;
for(i=0; i<t; i++)
{
for(j=i+1; j<t; j++)
{
//... | ALGO | 0.999978 | 3.216106 |
aea760e0-d8b7-4f9a-a111-93d1f4b90211 | panmari/pbrt_rpf | src/filters/triangle.cpp | // filters/triangle.cpp*
#include "stdafx.h"
#include "filters/triangle.h"
#include "paramset.h"
// Triangle Filter Method Definitions
float TriangleFilter::Evaluate(float x, float y) const {
return max(0.f, xWidth - fabsf(x)) *
max(0.f, yWidth - fabsf(y));
}
TriangleFilter *CreateTriangleFilter(const ... | TOOL | 0.941902 | 6.596693 |
f13a0377-e06f-45f3-aec0-654999b308b7 | varad8/CS-Experiment | DRAWTRIANGLE.CPP | #include <stdio.h>
#include <graphics.h>
// Function to draw a triangle
void drawTriangle(int x, int y, int size) {
line(x, y, x + size, y); // Bottom line
line(x, y, x + size / 2, y - size); // Left side
line(x + size, y, x + size / 2, y - size); // Right side
}
// Recursive function to generate the Sier... | ALGO | 0.977729 | 5.937869 |
06993ce0-1b5a-46d8-852b-dd51fc5a0ab8 | tejasrocksHere/DSA | Atcoder/Keyboard.cpp | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
void solve() {
string S;
cin >> S;
// Map each letter to its index in the given permutation S
map<char, int> position;
for (int i = 0; i < 26; i++) {
position[S[i]] = i + 1; // 1-based index for each le... | ALGO | 0.99967 | 5.066196 |
2a5d6a4c-a29a-4419-baa0-b4219883c647 | 33arsenic75/leetcode | 2610-closest-prime-numbers-in-range/2610-closest-prime-numbers-in-range.cpp | class Solution {
public:
vector<int> closestPrimes(int left, int right) {
vector<int> primeNumbers;
for (int candidate = left; candidate <= right; candidate++) {
if (candidate % 2 == 0 and candidate > 2) continue;
if (isPrime(candidate)) {
if (!primeNumbers.em... | ALGO | 0.999983 | 5.489225 |
c4fe27d0-1d7a-4c0d-b423-96d0af69f2a4 | xinkaiwang/usaco2022 | Bronze1-1/06-23-am/unit07/complete-tasks/tasks.cpp | /*
* Complete tasks
*/
#include <bits/stdc++.h>
using namespace std;
int freq[1000001];
int main() {
int N; cin >> N;
for(int j=0; j<N; j++) {
int x; cin >> x;
freq[x]++;
}
int ans = 0;
for(int x=0; x<=1e6; x++) {
if(freq[x]==1) {
ans = -1;
break;
}
else
ans += (freq[x]+2)/3; //round up
... | ALGO | 0.999963 | 3.911406 |
8d03039b-802f-4d23-8875-135457381a5b | MrArthor/CPP | C++/best-team-with-no-conflicts.cpp | // Time: O(nloga)
// Space: O(n)
// optimized from Solution3
class Solution {
public:
int bestTeamScore(vector<int>& scores, vector<int>& ages) {
vector<pair<int, int>> players;
for (int i = 0; i < size(scores); ++i) {
players.emplace_back(scores[i], ages[i]);
}
sort(be... | ALGO | 0.99964 | 6.589131 |
ea8b0588-90c6-4e57-938f-109c340053ea | ljw-LAB/Algorithm | Ch2/ex2_2_1/FibonacciFunc.cpp | #include <stdio.h>
// int Fibo(int n)
// {
// if( n == 1)
// return 0;
// else if(n == 2)
// return 1;
// else
// return Fibo(n-1) + Fibo(n-2);
// }
// int main(void)
// {
// int i;
// for(i = 1; i < 15 ; i++)
// printf("%d ", Fibo(i));
// return 0;
// }
... | ALGO | 0.99938 | 4.01137 |
fb8401db-943f-41a6-bee3-15ae24201334 | Sriramkk123/leetcode-problems | 776-n-ary-tree-postorder-traversal/n-ary-tree-postorder-traversal.cpp | /*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val) {
val = _val;
}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public:
vector<int> postorder(Node*... | ALGO | 0.999913 | 6.021946 |
91431ce2-954a-4ba3-b0ce-91f2de5dc5e2 | hyunsikwon/algorithm-study | Baekjoon/정렬/좌표 정렬하기_#11650/좌표 정렬하기_#11650/main.cpp | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int N;
int x,y;
vector<pair<int, int>> v;
//bool compare(pair<int, int> a, pair<int, int> b) {
// if (a.first == a.first) return a.second < b.second;
//
// return a.first < a.second;
//}
int main(int argc, const char * argv[]) {
... | ALGO | 0.999889 | 4.526785 |
f0cca7fc-6e8a-4f2d-92ff-e9dc64f4ac5b | thanhchuc-hcmue-it46/lap-trinh-can-ban-cpp | cpp/Kiem_tra_ngay_thang_nam_th1.cpp | // Viết chương trình nhập vào 3 số nguyên là ngày tháng năm. Hãy xác định ngày tháng năm có hợp lệ hay không?
// Lưu ý:
// - Ngày phải tương ứng với tháng
// - Tháng phải từ 1 đến 12
// - Năm phải >= 1900
// - Năm nhuận là năm chia hết cho 400 hoặc chia hết cho 4 nhưng không chia hết cho 100
// Input: 3 số nguyên dương... | ALGO | 0.999887 | 4.004625 |
c869019f-38d7-400e-a51a-09aae7d99006 | ManpreetKhinda/Stack_Problems | balancedparaenthesis.cpp | #include <iostream>
#include <cmath>
#include <stack>
#include <string>
#include <stdlib.h>
#include <math.h>
#include <unordered_set>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <algorithm>
#include <queue>
using namespace std;
bool isvalid(string s){
int n=s.length();
st... | ALGO | 0.998586 | 5.175869 |
145157b8-1eee-4314-99e0-407293445a7b | BojanDulevski/Structure-Programming | Structure Programming C++/Task14.cpp | Да се напише програма која вчитува матрица со димензии MxN (макс. 100x100). На почетокот се внесуваат димензиите на матрицата, а потоа и елементите на матрицата кои се само вредностите 1 и 0. Програмата треба да изброи и отпечати на СИ во колку од редиците и колоните има барем 3 последователни елементи со вредност 1.
... | ALGO | 0.999923 | 4.171511 |
ed3d88b9-108d-4f07-8569-d20d6ca2e99a | nhatminh2947/UVa-Online-Judge | 499/499.cpp | //******************************************************************
// Coded by: Huynh Nhat Minh
// Problem Number: 499 - What's The Frequency, Kenneth?
// Verdict:
//******************************************************************
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#includ... | ALGO | 0.999886 | 3.569777 |
5365bea2-c133-4923-bcc6-7e9a28cc72e3 | GrittyCode/STL-Study | DEQUEUE/dequeue.cpp | #include<iostream>
#include<deque>
#include<vector>
using namespace std;
int main(void)
{
vector<int> v(4,100);
deque<int> dq(4,100);
dq.push_back(10);
dq.push_back(20);
//vector와 다르게 앞에서도 넣어줄수있다.
dq.push_front(100);
dq.push_front(200);
dq.push_front(300);
dq.pop_back();
//뒤에... | TOOL | 0.894362 | 3.416811 |
f815f8fc-73c8-4eda-997e-70c8b618d939 | ronnygaur/DSA | Patterns and Loops/pattern13.cpp | #include <iostream>
using namespace std;
int main()
{
int n ;
cin>>n ;
int row = 1;
char ch = 'A';
while (row <=n)
{
int col = 1;
while ( col <=n)
{
cout << ch << " ";
ch = ch + 1;
col = col + 1;
}
cout << endl;
row = row + 1;
}
} | ALGO | 0.999666 | 3.738377 |
d07dc45f-d684-49dc-9bd0-b5fedc2a680e | ruiqini/traj-opt-admm | lib/libigl/include/igl/volume.cpp | template <
typename DerivedV,
typename DerivedT,
typename Derivedvol>
IGL_INLINE void igl::volume(
const Eigen::MatrixBase<DerivedV>& V,
const Eigen::MatrixBase<DerivedT>& T,
Eigen::PlainObjectBase<Derivedvol>& vol)
{
using namespace Eigen;
const int m = T.rows();
vol.resize(m,1);
for(int t = 0;t<m;... | ALGO | 0.996566 | 5.599927 |
024136ae-a943-487d-9e34-1ab205f9978b | abhijeet1003/A_to_Z_DSA_QUESTIONS | LINKED LIST/Clone_A_Linked_List/Changing_link_approach_O(n)_O(1).cpp | // QUESTIONS
/*
You are given a special linked list with N nodes where each node has
a next pointer pointing to its next node. You are also given M random
pointers, where you will be given M number of pairs denoting
two nodes a and b i.e. a->arb = b (arb is pointer to random node).
Construct a copy of the given ... | ALGO | 0.999702 | 4.159235 |
29a8912b-e17a-44a2-bfc2-f5749f664ee8 | jctemp/cuda-graphics | main.cpp | /**
* OpenGL 3 application using opengl_3_toolkit.
*
* @author Volker Ahlers<br>
* <EMAIL>
* @version 2010-03
*/
#include <GL/glew.h> // has to be included before freeglut.h
#include <GL/freeglut.h> // includes gl.h, glext.h, glu.h
#include <cstdlib>
#include <ctime>
#include <cuda_gl_interop.h>
#includ... | TOOL | 0.894398 | 5.445739 |
5ff5c0d3-81de-4567-bf01-3aae44465e99 | dyneleee/pokerbots2024 | cpp_skeleton gwin2/src/equity.cpp | #include <algorithm>
#include <bitset>
#include <iostream>
#include <random>
#include "equity.h"
#include "game.h"
const int p13[7] = {1, 13, 169, 2197, 28561, 371293, 4826809};
inline int get_digit(int number, int digit) { return (number / p13[digit]) % 13; }
int get_strength(std::vector<Card> cards) {
int n =... | ALGO | 0.99927 | 3.986093 |
afd4d7af-57ec-41d6-8b32-b321d02f8d4f | Abhishek-k30/DSA | 0875-koko-eating-bananas/0875-koko-eating-bananas.cpp | class Solution {
public:
long long check(vector<int>& piles, int speed){
long long time=0;
for(int i=0; i<piles.size(); i++){
time+= ceil((double)(piles[i])/(double)(speed));
}
return time;
}
int minEatingSpeed(vector<int>& piles, int h) {
int n... | ALGO | 0.999936 | 5.749533 |
2d88826f-96c2-441f-bf1b-42c263faf3c2 | ishandutta2007/codeforces | burnedchicken/normal/1526/D.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.99995 | 4.243703 |
1124ed61-d4ff-46db-99d6-7d6bd5b9c1b8 | CuriousCI/codeforces | 25B.cpp | #include <iostream>
#include <cstdint>
#include <algorithm>
using namespace std;
int main()
{
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
uint16_t length;
string phone_number;
cin >> length >> phone_number;
if (length & 1)
{
for (auto digit = 0; digit < length - 3; digit += 2)
cout << phone_number[d... | ALGO | 0.993474 | 4.39904 |
9b119bc4-023c-405f-a747-8e2311bcf244 | FS-A1-CODES/FS-A-Codes | CPP/Day 6/valid_ip.cpp | /*
Bob Khan is working with various number systems.
He has created two kinds of addressing systems to share information
between any two electronic devices.
Addresses in Type-I has following properties:
- This addressing has four parts, each part is called as 'octet'
- each octet can have a decimal value between 0 to... | ALGO | 0.985466 | 4.760953 |
509df885-c2f2-45ec-a598-16b8f0605e9f | kimurash/typical90 | 042/main.cpp | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <atcoder/modint>
#define rep(i, s, n) for (int i = s; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define arrout(a, s, n) rep(i, s, n)cout<<a[i]<<" "; cout<<endl;
#define vecout(v) for(auto elm : (v))cout<<elm<... | ALGO | 0.999913 | 4.803745 |
5d316e31-1cfe-4515-ae3c-add2b7eb3985 | liwan-cn/oj | 北邮OJ/0272.cpp | #include<stdio.h>
int G[55][55];
int main(){
int t;
scanf("%d",&t);
while(t--){
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
G[i][j]=n;
}
G[i][i]=0;
}
while(m--){
int u,v;
scanf("%d%d",&u,&v);
G[u][v]=G[v][u]=1;
}
for(int k=1;k<=n;k++)
for(int i=... | ALGO | 0.999923 | 3.977947 |
50a0a555-d5fd-421a-95b9-49b1d719499b | ShivNandanJha/Cpp-Tutorial | lastOccurance.cpp | #include <iostream>
#include <vector>
using namespace std;
/*
todo: This program finds the last occurrence of a number input by the user from an array.
*/
int main()
{
vector<int> v(6); // Create a vector of integers called 'v' with 6 element
for (int i = 0; i < 6; i++)
{ // Use a loop to read in 6 inte... | ALGO | 0.999606 | 5.887926 |
be198cca-8590-4e78-a8bf-da77db8dbd24 | Mohamed123-r/first_app | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.9988 | 6.76073 |
d7e129e3-b24d-4be3-83cc-2ef8c223b3e2 | raincross7/code-similarity | codes/train_code/problem490/problem490_225.cpp | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | ALGO | 0.99967 | 3.507846 |
6a2a22fc-4369-4b28-90fa-40d3b8cfbe72 | se-sic/hyteg-VaRA | src/hyteg/mesh/MeshGenRefineCoarseMesh.cpp | #include <unordered_map>
#include <utility>
#include "MeshInfo.hpp"
namespace hyteg {
Point3D getMidPoint( MeshInfo::IDType v0, MeshInfo::IDType v1, const MeshInfo& originalMeshInfo )
{
auto& originalVertices = originalMeshInfo.getVertices();
return walberla::real_c( 0.5 ) * ( originalVertices.at( v0 ).getCoor... | ALGO | 0.993862 | 5.886535 |
8340af40-9184-4e7b-afda-7787996c22c2 | vlbandara/slock-project | mobile-app/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.998173 | 6.76775 |
2c36270e-4d46-4b25-a399-eb160d3887e1 | ruixu1/Password-Competition | diff_key_recovery_report.cpp | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <cassert>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
#include <fstream>
#include <algorithm>
#include <iostream>
#include<stdio.h>
#include <iomanip>
#include <sstream>
#include <set>
#include <array>
#include <bitset>
#in... | ALGO | 0.999213 | 3.237994 |
9cf61089-2ebd-4819-8cb5-8fefb0043caa | farmpiggie/competitive-programming | codeforces/2037/c.cpp | /*
even + even = even, odd + odd = even
basically find some even, odd # when added together has some divisors.
let's say it is divisible by 3.
basically find some x, y <= n s.t. (x + y) % 3 == 0
try 1, 2. or (1, 5).
// odd + even = odd
// make some odd # that is not prime.
// smallest odd that isnt prime is 9.
// 5 ... | ALGO | 0.999747 | 4.82258 |
7aff32b7-e499-466f-abdb-35e422444f8c | rodrigopalaciossalas/COMP2--2.2-2023 | clases/14.09.2023/tarea secuencia de fivonachi.cpp | #include <iostream>
#include <string>
using namespace std;
int main ()
{
int cont1=1;
int cont2=0;
int f;
cout<<" cantidad de numeros: "<<endl;
cin>>f;
cout<<"numeros fibonacci son" << f << endl;
for(int a= 1; a<=f; a++)
{
cout << cont2 << ",";
cont1 = cont1+cont2; ... | ALGO | 0.99941 | 3.3771 |
e8b46658-9251-4930-9cd2-95bcd33045b8 | lsa0828/classFilesStorage | c++/chap10/10-6.cpp | #include <iostream>
using namespace std;
template <class T>
class MyStack {
int tos;
T data[100];
public:
MyStack();
void push(T element);
T pop();
};
template <class T>
MyStack<T>::MyStack() {
tos = -1;
}
template <class T>
void MyStack<T>::push(T element) {
if (tos == 99) {
cout << "stack full";
return;... | ALGO | 0.893946 | 4.416221 |
310c39d0-9578-4ae5-aebe-8dd204b680fb | deveshsahu/VulkanPractice | Triangle/BSpline.cpp | #include "BSpline.h"
BSpline::BSpline(int degree, std::vector<float>& knotVector, std::vector<glm::vec3>& controlPoints):
myDegree(degree),
myControlPoints(controlPoints),
myKnot(knotVector)
{
}
int BSpline::findSpan(float u)
{
int numBasisFunc = myKnot.size() - myDegree - 1;
if (u == myKnot[numBasisFunc+1])
r... | ALGO | 0.999001 | 5.896064 |
26c6a464-9b73-451a-a7a9-b56927ce9d62 | caushik-subramaniam-c/cpp | level2/nthsmallest.cpp | #include <iostream>
using namespace std;
void merge(int* array, int* leftArray, int* rightArray, int leftLength, int rightLength) {
int i = 0, j = 0, k = 0;
while (i < leftLength && j < rightLength) {
if (leftArray[i] <= rightArray[j])
array[k++] = leftArray[i++];
else
ar... | ALGO | 0.999931 | 4.86977 |
bab92586-7af3-4bca-81c4-31210402b21a | NafiHasan/HabiJabi | C++/Codeforces Contests/CF div 2 and div 3/Round 770/a.cpp | #include <bits/stdc++.h>
using namespace std;
#define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
int main() {
fast_io();
int tc;
cin >> tc;
while (tc--) {
int n, k;
cin >> n >> k;
string s;
cin >> s;
bool pal = 1;
string t = s;
reverse(t.begin(), t.end());
for (int i... | ALGO | 0.999889 | 3.974692 |
669412d5-c718-4044-ab11-17cf4f9827bb | iexpurgator/Major-Exercises | CPP/Matrix/CPPMAT06.cpp | #include <bits/stdc++.h>
#define ull unsigned long long int
#define ll long long int
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define rFOR(i, a, b) for (ll i = b-1; i >= a; --i)
using namespace std;
const int MODULO = 1e9+7;
int main(){
ios::sync_with_stdio(false); cin.tie(0);
int t; cin >> t;
while... | ALGO | 0.999753 | 3.016385 |
4764a9a3-3bc3-4991-88f9-04ac57b5af3c | kammradt/uri | beginner/1020.cpp | #include <iomanip>
#include <iostream>
using namespace std;
int main()
{
int days;
cin >> days;
int years = days / 365;
days -= years * 365;
int months = days / 30;
days -= months * 30;
cout << years << " ano(s)" << endl;
cout << months << " mes(es)" << endl;
cout << days << " dia(s)" << endl;
... | ALGO | 0.99742 | 4.139501 |
0d843493-2fc1-4622-b64c-081a7e4a8ca3 | abhirams2020/Leetcode-Tracker | 131-palindrome-partitioning/131-palindrome-partitioning.cpp | class Solution {
public:
vector<vector<string>> res;
bool isPalindrome(string &s, int left, int right){
while(left < right){
if(s[left]!=s[right]){
return false;
}
left++;
right--;
}
return true;
}
void dfs... | ALGO | 0.999975 | 6.551831 |
7632c617-0490-49a4-9012-6a2a9f7562a2 | Sourabhchaurasiya/DSA-Practice-Questions | CoderArmy/TwoPointers/pairDiff.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
return 0;
}
int solve(vector<int>&A,int B){
sort(A.begin(),A.end());
int start=0,end=1,n=A.size();
if(B<0)B=B*-1;
while(end<n){
if(A[end]-A[start]==B)return 1;
else if(A[end]-A[start]<B)end++;
else start++;
if(s... | ALGO | 0.99999 | 4.253713 |
4f1b1580-d9a7-4650-9174-079cd034f1b3 | WhalesState/pixel-engine | thirdparty/astcenc/astcenc_weight_align.cpp | #if !defined(ASTCENC_DECOMPRESS_ONLY)
/**
* @brief Functions for angular-sum algorithm for weight alignment.
*
* This algorithm works as follows:
* - we compute a complex number P as (cos s*i, sin s*i) for each weight,
* where i is the input value and s is a scaling factor based on the spacing between the weigh... | ALGO | 0.999214 | 7.415002 |
6e54b942-b75c-4fb9-9657-0135a503e7e0 | LucSam/mrtrix3-deep-atropos | cpp/cmd/dwidenoise.cpp | #include "command.h"
#include "image.h"
#include <Eigen/Dense>
#include <Eigen/Eigenvalues>
using namespace MR;
using namespace App;
const std::vector<std::string> dtypes = {"float32", "float64"};
const std::vector<std::string> estimators = {"exp1", "exp2"};
// clang-format off
void usage() {
SYNOPSIS = "dMRI no... | ALGO | 0.984321 | 4.241455 |
70dce09f-5ef2-4701-a194-60c1a03981b7 | sadibhaque/Phitron | Week_5/Topic_Wise/D. Fast search.cpp | /* Each conquered bug is a step towards mastery. */
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define py cout<<"YES\n"
#define pn cout<<"NO\n"
#define pend cout<<"\n"
#define pans cout<<ans<<"\n"
#define pb push_back
... | ALGO | 0.999844 | 4.38607 |
dbd5062e-baa8-4c4c-8250-896c2421c831 | LucaIT523/c_Data_Leakage_Control | cmn_crypto/AES.cpp | #include "pch.h"
#include "AES.h"
AES::AES(const AESKeyLength keyLength) {
switch (keyLength) {
case AESKeyLength::AES_128:
this->Nk = 4;
this->Nr = 10;
break;
case AESKeyLength::AES_192:
this->Nk = 6;
this->Nr = 12;
break;
case AESKeyLength::AES_256:
this->Nk = ... | ALGO | 0.930405 | 6.258949 |
371235e9-603a-498c-b4dd-b2fadd6ca2ea | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_1105_4.cpp | #include <bits/stdc++.h>
using namespace std;
int n, mx[200006], dp[200005], ar[200005], b[200005];
vector<int> v;
int main() {
scanf("%d", &n);
for (int i = 3; i <= n; i++) {
mx[i] = INT_MAX;
int x = sqrt(i);
ar[0] = 0;
for (int j = 1; j <= x; j++) {
ar[j] = 0;
if (i % j == 0) {
... | ALGO | 0.999979 | 4.426786 |
71b85656-f97f-415d-8938-8307457b69ac | GreyManuel/GreyHacks | TP/starters 14/diagmove.cpp | #include <bits/stdc++.h>
#define deb(x) cout << #x << ": " << x << endl;
#define deb2(x, y) cout << #x << ": " << x << " ~ " << #y << ": " << y << endl;
#define in(n, arr) \
for (int i = 0; i < n; i++) \
cin >> arr[i]
#define out(n, arr) \
for (int i = 0; i < n; i++) \
cout << a... | ALGO | 0.999856 | 5.334816 |
a4157535-0bc3-45e3-a502-aef893d8d1b6 | curlyapollo/short-paths | Graphs/tables.cpp | #include "tables.h"
int edges(std::vector<std::vector<int64_t>> &graph, int n) {
int cnt = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (graph[i][j]) {
cnt++;
}
}
}
return cnt;
}
void makeCSV_ver_graph(const std::string& ... | DATA | 0.86822 | 4.126307 |
a7cb863a-7599-4bda-9365-631f4d8f668e | Kawser-nerd/CLCDSA | Source Codes/AtCoder/abc116/D/4059237.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
vector<ll> b;
for (int i = 0; i < n; i++) {
ll t, d;
cin >> t >> d;
... | ALGO | 0.999964 | 4.411339 |
32427529-10fd-4876-a91a-58e8eee8560b | GeeKY03/cppcodesolutions | gjfgdfgdgfdfdf.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long int> vlli;
#define pb push_back
#define endl '\n'
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);
long long eat(ll i,ll n){
ll m=n,vasya=0;
while(m>0){
if(m<=i || m<10){
... | ALGO | 0.999923 | 3.606765 |
641d3d5f-b052-46c4-ad5a-1dbdba58d80b | Yin-1022/NTUE_Class-Computer_Programming | 20231129_HW_Combination.cpp | #include <iostream>
using namespace std;
int f(int m)
{
int s=1;
for(int i=1;i<=m;i++)
{
s=s*i;
}
return s;
}
int main()
{
int m;
int n;
cout<<"CmnAпJ"<<endl<<"m = ";
cin>>m;
if(m<0)
{
cout<<"mip0";
return 0;
}
cout<<endl<<"n = ";
cin>... | ALGO | 0.999848 | 4.610037 |
48cfa4e9-128d-4bc7-95a4-31949c8f5c4e | anishbhujbal7/leetcode | 16.cpp | class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(),nums.end());
int n =nums.size();
int ans=INT_MAX;
int goSum=0;
for(int i =0;i<n-2;i++){
int left=i+1;
int right=n-1;
while(left!=right){
... | ALGO | 0.999996 | 6.147264 |
7ec0b084-21a1-48a4-8767-90bafe7769b0 | Nikita0331/code-for-hacktoberfest | Array&String/occurrence_element.cpp | #include<iostream>
#include<math.h>
using namespace std;
int first(int arr[],int n,int key){
int start=0;
int end=n-1;
int ans=-1;
int mid= start+(end-start)/2;
while(start<=end){
if(arr[mid]==key){
ans=mid;
end=mid-1;
}
if(arr[mid]>key){
... | ALGO | 0.999878 | 4.607556 |
cf66c981-8fa2-4e10-8fe5-5b8ba1091f81 | TwindZ/CPP | CPP09/ex01/srcs/main.cpp | #include <iostream>
#include "../inc/RPN.hpp"
using std::cout;
using std::endl;
int main(int argc, char **argv)
{
if(argc != 2)
{
cout << "Error : Usage : RPN <\"ex: 9 8 + 5 - * 4 5 - + 6\">" << endl;
std::exit(EXIT_FAILURE);
}
RPN rpn;
rpn.execute(argv[1]);
return 0;
} | ALGO | 0.920108 | 4.663243 |
ac5e0fa1-58d7-466b-87a0-f190b86fe0c3 | harun-u-r-rashid/XPSC | 1st week/Day 06/D. Range Sum(6).cpp | /*
//Problem link: https://codeforces.com/group/MWSDmqGsZm/contest/326907/problem/D
#include <bits/stdc++.h>
using namespace std;
long long total_sum(int L, int R)
{
long long sum =(long long)(R - L + 1) * (L + R) / 2;
return sum;
}
int main()
{
int test;
cin >> test;
for (int i = 0; i < test; ... | ALGO | 0.999785 | 5.33778 |
4a12ee44-0bee-47e0-b9a0-939fb4a29844 | sukhbir-singh/competitive-programming | spoj/makemaze/maze (copy).cpp | #include <bits/stdc++.h>
using namespace std;
char arr[20][20];
int visit[20[20];
int x11=0;
int y11=0;
int x22=0;
int y22=0;
int shallow_check(int m,int n){
int i,count=0;
for(i=0;i<n;i++){
if(arr[0][i]=='.'){
count++;
if(count==1){
x11=0;
y11=i;
}else if(count==2){
x22=0;
y22=i;
... | ALGO | 0.999815 | 3.399149 |
05730b26-b0c4-42ed-9aa1-e3049d9ee0a7 | amirphl/learning | data-structures/geeks-for-geeks/stack/the-celebrity-problem.cpp | // https://www.geeksforgeeks.org/the-celebrity-problem/
// { Driver Code Starts
//Initial template for C++
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution
{
public:
//Function to find if there is a celebrity in the party or not.
// time: O(n... | ALGO | 0.999757 | 5.786281 |
d8c6be92-4ece-48e3-8d9e-53227ffe085c | alexandraback/datacollection | solutions_5765824346324992_0/C++/strin/haircut.cpp | #include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
using namespace std;
typedef long long int64;
int64 gcd(int64 a, int64 b)
{
if (b == 0)
return a;
else
return gcd(b, a%b);
}
int64 lcm(int64 a, int64 b)
{
return (a*b)/gcd(a,b);
}
int64 lcm(const vector<int64>... | ALGO | 0.999932 | 3.42786 |
9d970518-83f1-4b59-a82f-7d1d8df97990 | Pramath-N/Basics | Data Structures and Algo/Lvl2/MatheMatics/countDigits.cpp | #include<bits/stdc++.h>
int countDigits(int n){
int count = 0;
while(n > 0){
n /= 10;
count++;
}
return count;
}
int main(){
int n;
std::cout<<"Enter the integer: ";
std::cin>>n;
std::cout<<"The number of digits in "<<n<<" is: "<<countDigits(n)<<std::endl;
r... | ALGO | 0.998645 | 4.845119 |
391a3b55-72d9-4e49-b679-aec3bc2876d3 | dl8sd11/online-judge | codeforces/1370F1.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define SZ(i) int(i.size())
#define eb emplace_back
#define ALL(i) i.begin(),i.end()
#define X first
#define Y second
#ifd... | ALGO | 0.999568 | 4.030691 |
c03e0521-ac3a-40bd-beb3-8e0d388c2e07 | sophtiene/Algoritmo- | Simulado prova/Exercicio 5.cpp | //Simulado
//Exercicio 5
#include <stdio.h>
#include <locale.h>
int main(){
setlocale(LC_ALL, "Portuguese");
int num, i;
printf("Digite um n?mero: \n");
scanf("%d", &num);
for(i=1; i<= num; i++){
if(num%i == 0){
printf("%d, ", i);
}
}
return 0;
}
| ALGO | 0.996279 | 3.155317 |
678c2330-79c6-46f1-b75c-cb5ee8dccc1e | CheneyDev/my-leetcode | tree/0094-binary-tree-inorder-traversal/solution.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.99996 | 6.310205 |
1a8fd101-030e-4a45-862c-84e913942474 | DonSteve777/Algorithms--Data-structures | 4.grafosNoDirigidos/juez12/juez12/Source.cpp | #include <iostream>
#include <fstream>
#include <string>
#include "Manchas.h"
using namespace std;
bool resuelveCaso() { //O(F*C)
int rows, columns;
cin >> rows;
if (!std::cin) // fin de la entrada
return false;
cin >> columns;
Mapa mapa(rows);
for (string & linea : mapa)
cin >> linea;
Manchas manchas(m... | ALGO | 0.996661 | 4.477046 |
aaae1c6d-ef9d-4262-82dc-3010d8404207 | sunny2329/Data-Structure-And-Algorithms | Basics/arrays-3.cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> reverses(vector<int> v)
{
int s = 0, e = v.size() - 1;
while (s <= e)
{
swap(v[s], v[e]);
s++;
e--;
}
return v;
}
void merge(int arr[], int n, int brr[], int m, int c[])
{
int i = 0, j = 0;
int k = 0;
... | ALGO | 0.999941 | 4.148458 |
b32b338c-3f81-47cb-9a9b-2292d14d06f5 | ahmedmostafa10/Problem-Solving | Interesting drink/Source.cpp |
//=============//
//AHMED MOSTAFA//
//=============//
//Keep going..Sometimes you win, Sometimes you learn. > < .
// \ U /
//
/*
||========||
|| i <3 u ||
||========||
(\__/) || (\__/)
(•?•) || (•?•)
/ ? ? /> ?<\
????
*/
//// وَقُ... | ALGO | 0.999972 | 5.285386 |
51f1f3b6-75da-443d-a7a7-4fad4d0c8bf2 | ChromesDuzez/GameOfFifteen | GameOfFifteen/libraries/boost_1_81_0/libs/geometry/doc/src/examples/algorithms/simplify.cpp | // Boost.Geometry (aka GGL, Generic Geometry Library)
// QuickBook Example
//[simplify
//` Example showing how to simplify a linestring
#include <iostream>
#include <boost/geometry.hpp>
#include <boost/geometry/geometries/linestring.hpp>
#include <boost/geometry/geometries/point_xy.hpp>
/*< For this example we use ... | ALGO | 0.933155 | 7.447641 |
51294f72-9918-4de8-a4f0-02259d4b638d | DarkImpact1/Data-Structure-Algorithm | Tree/isSameTree.cpp | /*
Given the roots of two binary trees p and q, write a function to check if they are the same or not.
Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.
*/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *lef... | ALGO | 0.999799 | 6.674795 |
f6f15230-a5db-46a2-b945-7cd81c2dd0c4 | sharc-lab/LightningSim | llvm-project/clang/lib/ExtractAPI/API.cpp | #include "clang/ExtractAPI/API.h"
#include "clang/AST/CommentCommandTraits.h"
#include "clang/AST/CommentLexer.h"
#include "clang/AST/RawCommentList.h"
#include "clang/Index/USRGeneration.h"
#include "llvm/ADT/STLFunctionalExtras.h"
#include "llvm/ADT/StringRef.h"
#include <memory>
using namespace clang::extractapi;
u... | TOOL | 0.885198 | 7.747169 |
d5b20127-db69-4d46-94c4-4a3ba4d41530 | iamRishant/Leetcode | 239-sliding-window-maximum/sliding-window-maximum.cpp | class Solution {
public:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
deque<int> dq;
vector<int> ans;
for(int i=0;i<nums.size();i++){
if(!dq.empty() && dq.front()<=i-k) dq.pop_front();
while(!dq.empty() && nums[dq.back()]<=nums[i]) dq.pop_back();
... | ALGO | 0.999994 | 6.295449 |
92986a7a-a990-4e8d-a329-6e6fa2dbc24a | mahamuda-sultana/sheet1 | PM.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
char chr;
cin >> chr;
if (chr >= 97 && chr <= 122)
{
cout << "ALPHA" << endl;
cout << "IS SMALL" << endl;
}
else if (chr >= 65 && chr <= 90)
{
cout << "ALPHA" << endl;
cout << "IS CAPITAL" << endl;
}
else
... | ALGO | 0.993227 | 3.441141 |
b4db6b6b-f9e6-45c7-a1f0-2f8a6b3f5ad5 | shagho/compiler-project | llvm code generation/mathutils.cpp | #include "mathutils.hpp"
Value mathUtils::eval(std::string type,std::queue<std::string> infix, std::unordered_set<std::string> globalNames, std::unordered_map<std::string, Value> variables, codeGeneratorUtils &code)
{
std::queue<std::string> rpn = infixToRpn(intTodouble(infix));
std::stack<std::string> Stack;
... | TOOL | 0.953517 | 4.27959 |
68e632b9-34d7-47e2-bbaf-f77b4f0b79d0 | shanmo/OrcVIO | src/solve_5pts.cpp | #include "Initializer/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);
if (de... | ALGO | 0.99989 | 6.134039 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.