uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
b1b2c922-a9eb-4bd3-b3b5-1deb01dd9f7b | rk94655/cppCode | leetcode/1373.cpp | #include<iostream>
#include<queue>
using namespace std;
// template<typename T>
class node{
public:
int data;
node*left;
node*right;
node(int d)
{
data=d;
left=NULL;
right=NULL;
}
};
node * buildBSTTree(node *root, int data)
{
if(root==NULL)
return new node(data);
// node * res;
if(data<=root->data)
{... | ALGO | 0.999974 | 4.479883 |
c3aa3ca4-f084-462f-9d7e-9bf1e8b214ee | satyapsr13/LeetCode | 416-partition-equal-subset-sum/416-partition-equal-subset-sum.cpp | class Solution {
int sum;
int n;
int dp[201][10000];
bool find(vector<int>&v,int i,int rem)
{ cout<<rem<<endl;
if(rem==0)return 1;
if(i==n)return rem==0;
if(dp[i][rem]!=-1)return dp[i][rem];
if(rem>=v[i])
return dp[i][rem]=( find(v,i+1,rem-v[i])... | ALGO | 0.999982 | 5.415503 |
9ef45f77-1838-40dd-926c-9a2e18a2ce27 | majorli/algo_guide | source/codes/140_template_3.cpp | #include <cstdio>
const int MAXN = 100;
const double PI = 3.1415926536;
template<typename T>
struct List {
T values[MAXN];
int len;
};
int main()
{
List<int> sqr;
for (int i = 0; i < 10; i++)
sqr.values[i] = i * i;
sqr.len = 10;
for (int i = 0; i < sqr.len; i++)
printf("sqr(%d) = %d\n", i, sqr.values[i]);... | TOOL | 0.915213 | 3.939745 |
fb8156b6-d95a-480d-9123-48fec6f2d2d6 | xuyangRoger/algo202106_leetcode | week01/21merge-two-sorted-lists.cpp | /** 递归
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* mergeTw... | ALGO | 0.999978 | 5.919205 |
57c3847c-b4d1-472c-a314-fcecf360c805 | priyanshuranjan21/leetcodeproblems | 2050-count-good-numbers/count-good-numbers.cpp | class Solution {
private:
static constexpr int mod = 1000000007;
public:
int countGoodNumbers(long long n) {
// use fast exponentiation to calculate x^y % mod
auto quickmul = [](int x, long long y) -> int {
int ret = 1, mul = x;
while (y > 0) {
if (y % 2 ... | ALGO | 0.99998 | 6.029802 |
693d9f71-7ddc-46a4-853a-40df5e35eb40 | jingyu-tong/leetcode | 剑指offer/丑数.cpp | class Solution {
public:
int GetUglyNumber_Solution(int index) {
if(index < 7) return index;
vector<int> ans(index);
ans[0] = 1;
int ind2 = 0;
int ind3 = 0;
int ind5 = 0;
for(int i = 1; i < index; ++i) {
ans[i] = min(ans[ind2] * 2, min(ans... | ALGO | 0.999975 | 5.544227 |
a10e47b2-da94-4a71-9be5-46de2269e84a | sidhanth97/ROS-Warehouse-Robot | vision_align/src/pose.cpp | #include "opencv2/opencv.hpp"
#include <opencv2/aruco.hpp>
#include<iostream>
#include<vector>
using namespace std;
using namespace cv;
using namespace aruco;
int main()
{
Mat image=imread("/home/ubuntu/aruco/c1.jpg");
resize(image,image,Size(image.cols/2,image.rows/2));
Mat imageCopy;
image.copyTo(imag... | TOOL | 0.949823 | 3.619472 |
53699c42-becb-4825-a473-a3c048408afc | Jebearssica/LeetCode | Graph/207.课程表.cpp | /*
* @lc app=leetcode.cn id=207 lang=cpp
*
* [207] 课程表
*
* https://leetcode-cn.com/problems/course-schedule/description/
*
* algorithms
* Medium (54.53%)
* Likes: 914
* Dislikes: 0
* Total Accepted: 133.8K
* Total Submissions: 245.5K
* Testcase Example: '2\n[[1,0]]'
*
* 你这个学期必须选修 numCourses 门课程，记为... | ALGO | 0.99994 | 6.456253 |
ed026008-3b22-4fc9-8a9d-6fe9bb4ba4ce | tanisha0330/DSA_strivers_A2Z_sheet | recursion/subsequence_with_sum_k.cpp | #include<bits/stdc++.h>
using namespace std;
set<vector<int>> uniqueSubs; /// declare a global variable ,
// functnio to store
// to return all subsequences
void printsub(int arr[], int n,int target, int index=0, vector <int> curr={},int sum=0)
{
if (index==n)
{
if (target==sum)
{ vector <int> te... | ALGO | 0.999887 | 4.880232 |
439264e5-654c-4db4-bf39-2c7c5c9cd978 | cowkjw/Algorithm | BakeJoon/1406.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
string N;
list<char> L;
int M;
cin >> N;
for (auto i : N)
L.push_back(i);
auto cursorPos = L.end();
cin >> M;
while (M--)
{
char com;
cin >> com;
if (com == 'P')
{
char add;
cin >... | ALGO | 0.999815 | 4.924212 |
bfe5fe51-9d5c-471a-bed8-cadf36761651 | PulkitChangoiwala/Important-Data-Structures | Treap.cpp | #include<bits/stdc++.h>
using namespace std;
typedef struct node
{int k;
int v;
struct node *l,*r;
}node;
node* rightrotate(node* y)
{
node* x= y->l;
node*t2 = x->r;
x->r=y;
y->l= t2;
return x;
}
node* leftrotate(node *x)
{
node* y=x->r;
node*t2=y->l;
y->l= x;
x->r=t2;
return y;
}
node* newnod... | ALGO | 0.999983 | 4.223931 |
b2999029-ca70-402a-8015-ba96b2348d99 | Datapropdt/CPP_Lang | 069OOPS_TemplatesFns.CPP | // function template on user defined data types
#include <iostream.h>
#include <conio.h>
class complex
{
float rp,ip;
public:
complex(float=0.0,float=0.0);
complex operator+(complex&);
friend ostream & operator<<(ostream&,complex&);
};
complex::complex(float a, float b)
{
rp = a;
ip = b;
}
complex complex::operator+(co... | ALGO | 0.938186 | 5.077379 |
d22c1024-9010-4cea-a7e3-ff0760de3afb | robpellegrin/MATH306 | Matrix-CPP/Matrix.cpp | /**
* @file Matrix.cpp
* @author Robert Pellegrin
* @brief Implementation file for the Matrix class.
* @version 0.1
* @date 2025-03-27
*
* @copyright Copyright (c) 2025
*
*/
#include "Matrix.hpp"
#include <iomanip>
#include <random>
#include <stdexcept>
#include <thread>
#include <vector>
using std... | ALGO | 0.999076 | 7.152465 |
1ebbc969-ebc5-4b91-a2ec-c9833e431387 | ITCarlow-ElecEng-CompProg/assignment-3-Joshua-Whiteford | Lab 3/main.cpp | /**
*Joshua Whiteford
*02/10/2017
*main.c
*Standard Deviation Calculator
*/
/**< preprocessor directives */
#include <iostream>
#include <math.h>
using namespace std;
/**< Starting the function */
int main()
{
/**< Setting the DataTypes */
int i;
double values[10] = {0};
double sum = 0;... | ALGO | 0.9993 | 3.34819 |
6de4d491-38bf-4ba1-ae7d-e512e376b680 | AVC-CS/quiz-6-1-question-1-chloejuarez | main.cpp | #include "main.hpp"
// Do not change this file.
// Use q1.hpp file to complete the functions
int main()
{
int begin, end;
int prime1, prime2;
getTwoValues(begin, end);
prime1 = getNextPrime(begin);
cout << "The prime number after " << begin << " is " << prime1 << endl;
prime2 = getPrevPrime(end);
cout << "The... | ALGO | 0.998219 | 4.444577 |
324cf0de-feb2-44a0-a370-8662a39183f2 | DivonilLiquid/New-Life-of-Divonil | Recursion-3/phone_keypad.cpp | #include<iostream>
using namespace std;
char keypad[][10] = {"","","ABC","DEF","GHI","JKL",
"MNO","PQRS","TUV","WXYZ"};
void generate_keypad_strings(char number[],char output[],int i,int j){
//base case
if(number[i]=='\0'){
output[j] = '\0';
cout<<output<<endl;
return;
}
int digit = number[i] - '0';
if(... | ALGO | 0.999167 | 4.215883 |
ca765dda-ebda-46f8-bc33-707b931aa100 | Neha-Shaik/Competetive-Programming | SortingAlgorithms/insertionsort.cpp | #include<iostream>
#include<vector>
using namespace std;
using ll=long long int;
void insertion_sort(vector<int> &A,int n){
int i;
int value,hole;
for(i=1;i<n;i++){
value=A[i];
hole=i;
while(hole>0 && A[hole-1]>value){
A[hole]=A[hole-1];
... | ALGO | 0.999996 | 4.57521 |
959df6b0-42cd-407f-8693-dfddbe3530d2 | MnichWwy/SI_PROJECT | SourceFiles/toGray.cpp | #include "toGray.h"
void toGrayPerson()
{
toBinaryPerson();
for (auto it = personVec[0].begin(); it != personVec[0].end(); it++)
{
string temp;
for (size_t i = 1; i < (*it).size(); ++i)
{
if ((((*it).c_str()[i] == '1') && ((*it).c_str()[i - 1]) == '1') || (((*it).c_str()[i] == '0') && ((*it).c_str()[i - 1... | ALGO | 0.968334 | 3.386686 |
0a3521fb-c2e8-4bd0-83f2-fcb7bb7cab39 | Sukhada11/College-work | movie.cpp | #include<iostream>
using namespace std;
int main(){
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int l[n],r[n],p[n];
for(int i=0;i<n;i++)
cin>>l[i];
for(int i=0;i<n;i++)
cin>>r[i];
for(int i=0;i<n;i++)
p[i]=r[i]*l[i];
int max=p[n-1];
int maxi=n-1;
for(int i=n-1;i>=0;i--)
{
if(max<=p[i]){
... | ALGO | 0.999931 | 3.427575 |
5e397341-ef8c-41ad-87c6-bb1fe7a1375b | FelippeVelosoMarinho/TPs_ED | Pratica6/Felippe_Marinho_2021072260/TP/src/conversao.cpp | #include "../include/conversao.hpp"
/**
* @brief Função que converte uma expressão infixa para posfixa
*
* @param infixa
* @param posfixa
*/
void Conversao::converteInfToPos(char infixa[], char posfixa[])
{
Pilha pilha;
int j = 0;
for (int i = 0; infixa[i] != '\0'; i++)
{
char c = infixa[... | ALGO | 0.998144 | 4.08423 |
21ec102c-2ce7-4ab2-957e-20bcb8bd1106 | goropikari/CompetitiveProgramming | atcoder/abc410/b.cpp | // https://atcoder.jp/contests/abc410/tasks/abc410_b
// 2025年06月14日 21時01分21秒
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
// using vmint = vector<mint>;
// modint::set_mod(10);
// using mint = modi... | ALGO | 0.999993 | 4.285896 |
90f4bff8-11f4-4fab-ae60-1ff2ff1f2ed9 | kai-wei-kfuse/kai-wei-kfuse | 3121004831/my_module/numpy-1.24.4/numpy/core/src/npysort/radixsort.cpp | #define NPY_NO_DEPRECATED_API NPY_API_VERSION
#include "npy_sort.h"
#include "npysort_common.h"
#include "../common/numpy_tag.h"
#include <cstdlib>
#include <type_traits>
/*
*****************************************************************************
** INTEGER SORTS ... | ALGO | 0.999516 | 7.092376 |
57a74f89-78ed-4a2c-b32a-d11abb74cc3b | tanmay-vig/dsa-practice-codes | 12. Important Ques/1-Two-Sum.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
vector<int> twoSum(vector<int>& arr, int target) {
unordered_map <int, int> m;
vector <int> ans;
for (int i=0 ;i < arr.size() ;i++)
{
int first = arr[i];
int sec = target - first;
... | ALGO | 0.999669 | 5.751968 |
bd679a64-4ae7-4387-94f9-62a14efee874 | yonsei-hpcp/gcom | third-party/boost_1_86_0/libs/geometry/doc/doxy/doxygen_input/sourcecode/doxygen_1.cpp | OBSOLETE
#include <boost/tuple/tuple.hpp>
#if defined(_MSC_VER)
// We deliberately mix float/double's here so turn off warning
#pragma warning( disable : 4244 )
#endif // defined(_MSC_VER)
#include <boost/geometry/geometry.hpp>
#include <boost/geometry/geometries/register/point.hpp>
#include <boost/geometry/geometri... | TOOL | 0.951212 | 7.397203 |
b0f275dc-ae3f-4249-a693-e0963ed1aa49 | ShyamB123/Learning_cpp | Hashing/subarray_sumZero.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int arr [] = {6,-1,2,-1,2,-1,-7};
int n = sizeof(arr)/sizeof(int);
unordered_map<int,int> m;
int sum =0;
int a = -1;
for(int i=0;i<n;i++)
{
sum += arr[i];
if(sum == 0)
{
cout << "the subarray is... | ALGO | 0.99996 | 4.193514 |
47d23438-22a2-430b-9b56-eb497146fc76 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_6715_5.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
const int nn = (N - 10) / 2;
const int M = 1000000007;
int n, k, a[N];
long long l;
vector<int> v;
long long times(int p, int k) {
int pl = l % n;
if (pl == 0) pl = n;
int t = int(p <= pl);
long long ts = (l - 1) / n + t;
return max(0LL, ts ... | ALGO | 0.999978 | 3.770456 |
9b296a4d-7478-4bec-8a3a-51fb266e9eee | beelisais2793/FX | Synthesizer/Gamma/Gamma/examples/synthesis/subtractiveSing.cpp | #include "../AudioApp.h"
#include "Gamma/rnd.h"
#include "Gamma/Delay.h"
#include "Gamma/Filter.h"
#include "Gamma/FormantData.h"
#include "Gamma/Oscillator.h"
using namespace gam;
struct VowelFilter{
VowelFilter(){ params.lag(1); }
float operator()(float v){
Vec<N*2, float> frqAmp = params();
float r=0;
for... | TOOL | 0.928696 | 5.485428 |
f45fdde9-89c0-46b5-9d9b-d986d5102cc9 | coelien/codeforces | carl/stack_queue/leetcode_20.cpp | #include<iostream>
#include<string>
#include<stack>
using namespace std;
int main(){
string s;
cin>>s;
stack<char> st;
char temp;
for(int i=0;i<s.size();++i){
switch (s[i])
{
case '(':
st.push(s[i]);
break;
case '[':
st.push(s[i]);... | ALGO | 0.999433 | 4.25768 |
accdfbed-eda1-4c7d-ab42-26ba062c8934 | SimonF12/Demo0-445 | untitled/210 work 3.cpp | //
// Created by simon on 1/30/2024.
//
#include <iostream>
using namespace std;
template<typename T>
struct Node {
T data;
Node<T> *next;
};
template<typename T>
class Queue {
private:
Node<T> *front;
Node<T> *rear;
int size;
public:
Queue() : front(nullptr), rear(nullptr), size(0) {}
... | TOOL | 0.969971 | 5.413096 |
aa1cb668-9cc1-43c8-9b3d-42e3b92c3b88 | ishandutta2007/codeforces | cz_xuyixuan/normal/1338/E.cpp | #include<bits/stdc++.h>
using namespace std;
const int MAXN = 8005;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c); c ... | ALGO | 0.999885 | 3.887192 |
98d114f5-0fe0-4e6c-a1a0-800e643e210e | Mulab11/cntt2016-hw1 | TC-SRM-593-div1-1000/syf.cpp | //============================================================================
// Author : Sun YaoFeng
//============================================================================
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<bitset>
#include<string>
#include<cstdio>
#include<cctype>
#in... | ALGO | 0.999931 | 3.527434 |
5cd3a664-e687-4266-91d2-02de033ee63a | AlexanderB184/PieceMeal | tests/perft.cpp | #define CATCH_CONFIG_MAIN
#include <catch2/catch_test_macros.hpp>
#include <stdio.h>
#include <string.h>
#include "../include/chess.h"
//using namespace chess;
typedef struct {
size_t nodes, captures, enpassent, castles, promotions, checks,
discovered_checks, double_checks, checkmates;
} perft_results_t;
t... | TEST | 0.990557 | 7.003079 |
db4ffff6-5998-4872-b6d0-be26c19e8145 | alirz-pixel/Problem_solving | CodeForces/Education Codeforces Round 124/A.cpp | #include <iostream>
#include <cmath>
#include <map>
using namespace std;
using lld = long long;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
cout << lld(pow(2, n)) - 1 << "\n";
}
return 0;
} | ALGO | 0.999571 | 5.172163 |
fd0d6a29-639e-43bd-9e29-c977245221d0 | DraSoGo/Competitive_Programming | C3/Disaster_Dragon.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int x, a, b, q, p, d, n, ansl, ansr;
int tree[N];
int sum(int k)
{
int s = 0;
while (k >= 1)
{
s += tree[k];
k -= k & -k;
}
return s;
}
void add(int k, int x)
{
for (int i = k; i <= N; i += (i & -i))
{
... | ALGO | 0.9999 | 4.161174 |
5d00b815-c4b3-4292-a56b-118e7d76db80 | TangZichen0102/cpp_study | 实验舱/2022 信息与未来/模拟赛4/3.cpp | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
int n, s, x, y, tms, ans = INF, dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
char op, idx[135];
map<int, map<int, int>> vis;
int main() {
idx['E'] = 0, idx['W'] = 1, idx['S'] = 2, idx['N'] = 3;
cin >> n;
for(int i = 1; i <= n; i++) {
... | ALGO | 0.999687 | 3.642661 |
71a5a5a2-f577-4cb3-b5a4-a9621cdf6f5c | liwendongaaaa/- | libraries/fc/src/compress/smaz.cpp | #include <string>
#include <sstream>
#include <string.h>
#include <fc/exception/exception.hpp>
namespace fc {
typedef const char* const_char_ptr;
/* Our compression codebook, used for compression */
static const_char_ptr Smaz_cb[241] = {
"\002s,\266", "\003had\232\002leW", "\003on \216", "", "\001yS",
"\002ma\255\002... | TOOL | 0.970496 | 5.892166 |
17b52bd9-14a2-4c83-a7e8-89fa92cbfeb0 | MichaelSedrak/Interactive-ARAP | ARAP/libs/libigl-2.2.0/tests/include/igl/copyleft/cgal/order_facets_around_edges.cpp | #include <test_common.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
#include <igl/copyleft/cgal/order_facets_around_edges.h>
#include <igl/unique_edge_map.h>
#include <igl/readDMAT.h>
#include <igl/per_face_normals.h>
namespace {
typedef ... | TEST | 0.864585 | 7.479854 |
557c4259-db86-414c-895a-01b4afa11e30 | eryueniaobp/leetcode | revised/First Missing Positive.cpp | /**
* O(n) 每次要么前进一位，要么使某个数归位
*/
class Solution {
public:
int firstMissingPositive(int A[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int i = 0 ;
while(i<n){
if(A[i] != i){
while(A[i] < n &&A[i]>=0 && A[A[i]]... | ALGO | 0.999863 | 4.405165 |
5bea0798-2c3d-45bf-bcc7-ee920d7c2830 | devgalvas/Oriented-Object-Programming | Classes/Fracao_1/CFracao.cpp | #include "CFracao.h"
#include <iostream>
using namespace std;
// Métodos Protegidos da classe CFracao
CFracao CFracao::Reduzida(void){
int gcd = 1;
int minimo = m_numerador;
if (m_numerador > m_denominador)
minimo = m_denominador;
for(int i = 1; i <= minimo; i++)
{
if ((... | TOOL | 0.93187 | 5.421513 |
e1f778dd-d3f2-4ec6-8ce8-61d73d480fb9 | chanha-park/studyAlgorithm | boj/unsolved_15686.cpp | #include <iostream>
#include <list>
#include <queue>
enum {
EMPTY,
HOUSE,
CHICKEN
};
int dist(int start, int end) {
return (std::abs((start / 100) - (end / 100))
+ std::abs((start % 100) - (end % 100)));
}
struct Edge {
int start;
int end;
int weight;
Edge(int start, int end) : start(start... | ALGO | 0.999514 | 3.852417 |
f36f4ef8-dcec-46f5-972c-de007880705f | breaker250611/GFG-LEET-codes | 1139-largest-1-bordered-square/1139-largest-1-bordered-square.cpp | class Solution {
public:
//https://leetcode.com/problems/largest-1-bordered-square/discuss/345265/c%2B%2B-beats-100-(both-time-and-memory)-concise-with-algorithm-and-image
int largest1BorderedSquare(vector<vector<int>>& grid) {
vector<vector<int>>dph(grid.size(),vector<int>(grid[0].size(),0));
vecto... | ALGO | 0.999906 | 5.832899 |
58c404ff-9b7a-47f4-a788-60cd3b00a268 | rajarshi-hub/sixdays30companies | Int-7.cpp | int day(vector<int> &w , int c)
{
int d=0;
int s=0;
for(int i=0;i<w.size();i++)
{
s+=w[i];
if(s > c)
{
d++;
s=0;
i--;
}
}
if(s > 0)
d++;
return d;
}
class Solution {
public:
int shipWithinDays(vector<int>& weig... | ALGO | 0.999992 | 5.522343 |
ebc75000-38e6-45a4-a40a-1626f54e4acb | Hang-gug/ssdp | DAY1/2_upcasting3.cpp | // upcasting3.cpp
class Animal
{
public:
int age;
};
class Cat : public Animal
{
};
class Dog : public Animal
{
public:
int color;
};
// 활용 #2. 동종을 처리하는 함수 만들기.
// void NewYear(Dog* pDog) // Dog 객체만 인자로 받겠다는 의도
void NewYear(Animal* p) // 모든 동물 객체를 인자로 받을수 있다.
{
++(p->age);
}
int main()
{
Animal a; NewYe... | TOOL | 0.899862 | 6.565286 |
dcad42c1-97d6-4520-a912-9e0a0c339120 | liuq901/code | ZJ/zj_d_405.cpp | #include <cstdio>
#include <cstdlib>
int a[5001][31];
int main()
{
while (1)
{
int n;
scanf("%d",&n);
if (!n)
break;
for (int i=1;i<=n;i++)
{
scanf("%d",&a[i][0]);
for (int j=1;j<=a[i][0];j++)
scanf("%d",&a[i][j]);
}
int t;
sca... | ALGO | 0.993669 | 3.071269 |
63d81e1e-083a-4b76-ab8d-1971e1171562 | ishandutta2007/codeforces | neal/normal/1450/D.cpp | #include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
template<typename A, typ... | ALGO | 0.999658 | 4.659715 |
dba047c5-9d33-4d86-83af-a054cff10eea | MiroKaku/Musa.Runtime | Microsoft.VisualC.Runtime/UCRT/10.0.26100.0/ucrt/mbstring/mbsncmp.cpp | #ifndef _MBCS
#error This file should only be compiled with _MBCS defined
#endif
#include <corecrt_internal_mbstring.h>
#include <locale.h>
#include <string.h>
#pragma warning(disable:__WARNING_POTENTIAL_BUFFER_OVERFLOW_NULLTERMINATED) // 26018
/***
*int mbsncmp(s1, s2, n) - Compare n characters of two MBCS stri... | TOOL | 0.909356 | 6.263952 |
a856b565-ffc6-4a01-a423-974e0a1c4c67 | sieg-zeon/algo-method | 整数論的アルゴリズム/最大公約数/8.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep3(i, m, n) for(int i = (m); i < (int)(n); i++)
#define ALL(x) x.begin(), x.end()
#define debug(var) \
d... | ALGO | 0.999973 | 4.395971 |
49d01e00-2d60-4925-82af-044e0e456ffc | alexandraback/datacollection | solutions_1595491_0/C++/twinkle/b.cpp | #include <iostream>
using namespace std;
int main(){
//freopen("b.in","r",stdin);
//freopen("b.out","w",stdout);
int T,n,s,p,ans,tmp,Case = 0;
cin >> T;
while(T --){
cin >> n >> s >> p ;
ans = 0;
for(int i = 1;i <= n; i ++){
cin >> tmp;
if(tmp == 0 &&... | ALGO | 0.999425 | 3.121498 |
339a289e-fc7c-4536-ac3c-5bac6a28c1c1 | 4xx31/algorithms-cpp | codeforces/800s/A. Maximum Increase.cpp | // https://codeforces.com/problemset/problem/702/A
// DISCLAIMER: This is NOT production-quality code.
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int input;
vector<int> V;
while (cin >> input)
V.push_back(input);
int max = 1;
int localMax = 1;
... | ALGO | 0.999944 | 4.445444 |
e6b360a8-e24b-4cb4-916c-e0f5acfa9daf | RemyMachado/Theory-of-computing-CS421-CSUSM | HW1B_RecGen/generator.cpp | #include <iostream>
#include <string>
#include <queue>
using namespace std;
//----------------------------------------------
// CS421 HW1
// Write a generator in C++ for L = {x | x is a binary number}.
// Your name: **Anthony Machado
//----------------------------------------------
#define PROGRAM_SUCCESS 0
#define ... | ALGO | 0.989614 | 6.379602 |
a01787ea-8eb1-42f1-b588-20918716598f | king-yyf/cpcode | leetcode/lc300/4.cpp | #ifdef LOCAL
#include "/Users/yangyf/Desktop/cpcode/leetcode/lc_help.hpp"
#endif
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define f0(e) for(int i=0;i<(e);++i)
#define f1(e) for(int i=1;i<=(e);++i)
#define f2(i,e) for(int i=0;i<(e... | ALGO | 0.999902 | 4.644506 |
b43bfd99-8a31-4adf-9931-258dac636a9e | ppedro74/parallax-propeller-playground | libpid/pid.cpp | //#if ARDUINO >= 100
// #include "Arduino.h"
//#else
// #include "WProgram.h"
//#endif
//print
//#include "simpletools.h"
//extern unsigned long millis();
#include <pid.h>
/*Constructor (...)*********************************************************
* The parameters specified here are those for for which ... | TOOL | 0.970258 | 5.678843 |
60ab98a5-0981-40ff-9483-e5480cbb7f67 | Kosthi/AcWingSolver | PAT/数素数.cpp | #include <iostream>
using namespace std;
typedef long long LL;
const int N = 10010;
int prime[N];
int n, m;
int main() {
cin >> n >> m;
int p = 0, cnt = 0;
int i = 2;
while (cnt < m) {
int j = 2;
for (; j * j <= i; ++j) if (i % j == 0) break;
if (j * j > i) {
c... | ALGO | 0.999979 | 3.812843 |
2de0f6f2-5c8e-46c5-919a-9b5c9fdb03c5 | MohamedElbashar/ProblemSolving-Archive | Training/mostafa saad/Greedy/Pasha and String.cpp | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
#define ll long long
#define mem(a,b) memset(a,b,sizeof a)
#define oo 1e8
#define minn(a, b, c) min(min(a, b), c)
#define maxx(a, b, c) max(max(a, b), c)
int dx[] = { 1, 1, 0, -1, -1, -1, 0, 1 };
int... | ALGO | 0.999966 | 3.258451 |
bdb7ac55-dcfd-4fa0-bb9b-f18115ccf190 | A7med-Khedr/Data-Structure-Cpp | Graph/ adjacency-list.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <utility>
#include <bits/stdc++.h>
using namespace std;
class AdjacencyListGraph
{
private:
int numVertices; // Number of vertices
bool isDirected; // Directed or Undirected
vector<vector<... | ALGO | 0.99993 | 6.807666 |
a60fb1ce-e664-47fd-90f4-4c0940d0d94d | settyblue/C-projects | Tree Algorithms/EvalutePostfix.cpp | #include<iostream>
#include<string>
#include<stack>
#include<math.h>
using namespace std;
//Function to evaluate postfix.
float EvaluatePostfix(string postfixExpression);
// Function to verify whether a character is operator symbol or not.
bool IsOperator(char C);
// Function to verify whether a character is alpha... | ALGO | 0.998872 | 4.644291 |
39d02d08-9720-49b7-bc96-b03e721d6125 | grajput08/Data-Structure-Algorithm | Functions/counting from 1 to n.cpp | #include <iostream>
using namespace std;
void Counting(int number)
{
for (int i = 1; i < number; i++)
{
cout << "Number " << i << " is " << i << endl;
}
}
int main()
{
// write the code
Counting(10);
return 0;
} | ALGO | 0.995839 | 4.356425 |
49c27c22-4c99-47ea-977e-fb3585208523 | mireskandari/Competitive-Programming | codeforces/1642/B.cpp | #include <bits/stdc++.h>
using namespace std;
#define cerr cerr << "DEBUG "
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int tc;
cin >> tc;
while (tc--) {
int n;
cin >> n;
vector<int> a(n);
for (auto &i : a) {
cin >> i;
}
set<int> s(a.begin(), a.end());
int sz = (int) s.size... | ALGO | 0.999681 | 3.989233 |
ca613737-dfdc-4583-91c9-0665a072e6c7 | ishandutta2007/codeforces | cxy07/normal/1187/E.cpp | //Code By CXY07
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 2e5 + 10;
const int INF = 2e9;
const int mod = 1e9 + 7;
int n,ans;
int siz[MAXN],dp[MAXN];
vector<int> G[MAXN];
void DFS1(int x,int fa) {
siz[x] = 1;
for(register int i = 0,to;i < G[x].size(); ++i) {
to = G[x][i]... | ALGO | 0.994972 | 4.072058 |
f3fef809-d9d2-4bb9-a43a-9d35416a85de | ishandutta2007/codeforces | dzhulgakov/normal/291/E.cpp | #pragma comment(linker,"/STACK:64000000")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <iostream>
#include <iterator>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <... | ALGO | 0.999831 | 3.629584 |
c6017fc9-dbaa-4d28-ad74-53494ad15de4 | Abhijeet-Bhushari/Leetcode-Daily | Decode Ways/solution.cpp | class Solution {
public:
int n;
vector<int> dp;
map<string, bool> mp;
int solve(string &s, int ind){
if(ind >= n) return 1;
if(dp[ind] != -1) return dp[ind];
int ans;
string temp = s.substr(ind, 1);
if(mp[temp]){
ans = solve(s, ind+1);
}
... | ALGO | 0.999986 | 5.774859 |
107d241d-bdf9-4a07-8d5a-dbb650e48f8c | JRgit03/Algorithm | lanqiaocup/基础板子复习/快速幂.cpp | #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
using namespace std;
#ifdef LOCAL
#include "./debug.h"
#else
#define debug(...) 21
#endif
const int N = 1e6 + 10;
int fastpow(int a,int b,int p){
int res = 1;
while(b){
if(b & 1) res = res * a %... | ALGO | 0.999814 | 4.309009 |
f58c8468-632a-47d0-bec1-d8bc80f269d9 | raincross7/code-similarity | codes/train_code/problem445/problem445_245.cpp |
// Problem : A - Beginner
// Contest : AtCoder - AtCoder Beginner Contest 156
// URL : https://atcoder.jp/contests/abc156/tasks/abc156_a
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#i... | ALGO | 0.999718 | 3.249724 |
8f536737-e750-44e9-b1f3-8ac4c2c88010 | SelfishOlex/GridMateBook_1.18 | dev/Gems/Maestro/Code/Source/Cinematics/CharacterTrackAnimator.cpp | #include "Maestro_precompiled.h"
#include "CharacterTrackAnimator.h"
#include "AnimNode.h"
#include "CharacterTrack.h"
//////////////////////////////////////////////////////////////////////////
// Utility script functions used in Character Animnation functions
namespace
{
static const float TIMEJUMPED_TRANSITION_T... | TOOL | 0.912669 | 6.469803 |
0bdca2e9-6f2c-4845-a721-a1d80df5bacc | InwooLeeme/Algorithm | Boj/14888.cpp | #pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds... | ALGO | 0.999958 | 4.297626 |
52493527-2ff7-467a-b55c-d5ae0b8ccbea | ishandutta2007/codeforces | burnedchicken/normal/1684/B.cpp | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#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) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=... | ALGO | 0.9999 | 4.377944 |
899e2672-00cc-4444-8713-672939d70ecd | AYUSH-002/LEETCODE | 0230-kth-smallest-element-in-a-bst/0230-kth-smallest-element-in-a-bst.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.999993 | 5.708786 |
1c4b4fe3-c8ed-4bfd-a1e6-61d39d3ef892 | yorklephone/android_framework_base | media/libstagefright/codecs/amrnb/common/src/log2.cpp | /*
Filename: /audio/gsm_amr/c/src/log2.c
------------------------------------------------------------------------------
REVISION HISTORY
Description: Updated template used to PV coding template. Moved Log2_norm
function to its own file.
Description: Changed l_shl.c to l_shl.h in Include section.
Desc... | ALGO | 0.996974 | 6.583379 |
ab0a8683-243f-40e7-9489-56c845b80ec4 | mohitshyoran/Leetcode-Problems | Top-150/05. HasMap/128. Longest Consecutive Sequence.cpp | Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.
You must write an algorithm that runs in O(n) time.
Example 1:
Input: nums = [100,4,200,1,3,2]
Output: 4
Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.
Example ... | ALGO | 0.999984 | 5.598237 |
daa79435-ec10-44f2-88c5-37c68b67d649 | SkyLoaderr/xray-last-days | xray/xrCDB/OPC_Matrix4x4.cpp | ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/**
* Contains code for 4x4 matrices.
* \file IceMatrix4x4.cpp
* \author Pierre Terdiman
* \date April, 4, 2000
... | ALGO | 0.999463 | 6.468551 |
acb29acc-2e26-4972-972c-b10501c4500e | AlokiChaturvedi/Data-Structures-and-Algorithms | Stack and Queue/copy_Stack.cpp | #include <iostream>
#include <stack>
using namespace std;
stack<int> copyStack(stack<int> &input)
{
stack<int> temp;
while (not input.empty())
{
int curr = input.top();
input.pop();
temp.push(curr);
}
stack<int> result;
while (not temp.empty())
{
int curr =... | ALGO | 0.999934 | 4.543358 |
6204db26-440f-4595-bd34-71ddd0e67f79 | cile/android_frameworks_av | media/libstagefright/codecs/amrnb/dec/src/d8_31pf.cpp | /*
------------------------------------------------------------------------------
Pathname: ./audio/gsm-amr/c/src/d8_31pf.c
Functions:
Date: 01/28/2002
------------------------------------------------------------------------------
REVISION HISTORY
Description: Modified to pass overflow flag through to basi... | ALGO | 0.999539 | 5.109934 |
7c715eaf-e760-46ea-9f22-50f721de0ff4 | bullocgr/visualization | ballBounce.cpp | void
Bounce( float dt )
{
while( dt > EPSILON )
{
float tmin = dt; // minimum time to do something
int which = NOTHING_HIT; // which reason was it for doing the something
// these four collision times are computed using your projectile motion equations:
float tleft = (XLEFT+RADIUS-Xnow)/Vxnow; // time to h... | ALGO | 0.998413 | 5.667928 |
64f6af46-8724-4b94-a59d-f5d1eeb9caab | niketh457/CS254 | LAB6/Q3/Q3.cpp | #include <bits/stdc++.h>
using namespace std;
void dfs(int s, vector<vector<int>> &adj, vector<bool> &visited, stack<int> &st){
visited[s] = 1;
for(auto x:adj[s]){
if(!visited[x])
dfs(x, adj, visited, st);
}
st.push(s);
}
vector<int> topological_sort(vector<vector<int>> &adj){
... | ALGO | 0.999976 | 5.617739 |
69670d7d-9bac-475c-b176-f0f3adde47e9 | mateusbagli/exercicios-beecrowd-C | exercicios/bee1165.cpp | #include <stdio.h>
int main()
{
int t, n, i, primo;
scanf("%d", &t);
while (t > 0)
{
scanf("%d", &n);
primo = 1;
if (n < 2)
primo = 0;
else
{
i = 2;
while (i < n)
{
if (n % i == 0)
primo = 0;
... | ALGO | 0.999848 | 4.631959 |
2524f713-e701-49df-ad80-5a02d4d4bb4b | loal123/CP | cses/CSES_CSES_Problem_Set/Money_Sums.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define SZ(x) ((int)... | ALGO | 0.99995 | 3.51371 |
ada11ed0-b18f-4789-9179-933f71560481 | LeclaireD/COMP4490 | COMP4490/Vecmath.cpp | #include "Vecmath.h"
float AMBIENTLIGHT = 0.4;
Vec3 AMBIENT = Vec3(AMBIENTLIGHT,AMBIENTLIGHT,AMBIENTLIGHT);
int ALPHA = 64;
float dotProd(Vec3 a, Vec3 b) {
return ((a.getX() * b.getX()) + (a.getY() * b.getY()) + (a.getZ() * b.getZ()));
}
Vec3 crossProd(Vec3 a, Vec3 b) {
return Vec3((a.getY()*b.getZ())- (a.getZ()*b.... | ALGO | 0.930981 | 4.405622 |
cf6120b1-5795-40f0-bf34-3a597ac01f2f | iZhangHui/cppstdlib | contadapt/priorityqueue1.cpp | #include <iostream>
#include <queue>
using namespace std;
int main()
{
priority_queue<float> q;
// insert three elements into the priority queue
q.push(66.6);
q.push(22.2);
q.push(44.4);
// read and print two elements
cout << q.top() << ' ';
q.pop();
cout << q.top() << endl;
q... | ALGO | 0.987515 | 4.140404 |
2b2e6b36-b86e-44ac-a2bb-b1ddb9f9f824 | Miraz123/Programming | C++Programming/C++Programming/CircularSinglyLinkedList.cpp | /*
* C++ Program to Implement Circular Linked List
*/
#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*last;
/*
* Class Declaration
*/
class circular_llist
{
public:
void create_node(int value);
void add_begin(int value... | ALGO | 0.999986 | 5.756198 |
2575fafa-6b51-4075-940d-2e4d37ebab07 | salahuddinjony/Number-Theory | Wrong Summision/DivisorsandReciprocals.cpp | #include <bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// Function to calculate sum of divisors
int sumOfDivisors(int N) {
int sum = 0;
for (int i = 1; i*i <=N; ++i) {
if (N % i == 0) {
sum += i;
if (i != N / i) {
... | ALGO | 0.999854 | 5.285557 |
6cb9ccf9-2b29-4149-8095-81e0021a8911 | arifulmist/code_library | contest/A_Only_Pluses.cpp | /*
__ __ ____ _ ____ ___ _____ _ _ _ ___ ____ _ _ __ __
| \/ | _ \ / \ | _ \|_ _| ___| | | | | |_ _/ ___|| | / \ | \/ |
| |\/| | | | | / _ \ | |_) || || |_ | | | | | | |\___ \| | / _ \ | |\/| |
| | | | |_| | / ___ \| _ < | || _| | |_| | |___ | ... | ALGO | 0.999903 | 4.584299 |
51550c99-6d84-4817-9e1c-679d5111714d | nidhiupman568/C-PLUS-PLUS-PROBLEMS-SOLVED | Decode Ways.cpp | class Solution {
public:
int numDecodings(string s) {
vector<int> dp(s.size()+1);
dp[0]=1;
if(s[0]=='0')dp[1]=0;
else dp[1]=1;
for(int i=2;i<=s.size();i++){
int way1,way2;
if(s[i-1]=='0')way1=0;
else way1=dp[i-1];
if(stoi(s.subs... | ALGO | 0.999927 | 6.128431 |
5624e8f3-8270-4c2c-b652-cdd13acfe2f9 | raincross7/code-similarity | codes/train_code/problem379/problem379_445.cpp |
#include <cstdio>
#include <vector>
#include <iostream>
#define REP(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
int x, y;
cin >> x >> y;
REP(i, x+1) {
if(i*2 + (x-i)*4 == y) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| ALGO | 0.999919 | 3.027274 |
e7e0e62f-fa1b-47e3-bf38-57bf5a347c70 | ShuoYangRobotics/ocs2 | ocs2_robotic_examples/ocs2_perceptive_anymal/ocs2_switched_model_interface/src/core/TorqueApproximation.cpp | //
// Created by rgrandia on 08.12.21.
//
#include "ocs2_switched_model_interface/core/TorqueApproximation.h"
namespace switched_model {
template <typename SCALAR_T>
joint_coordinate_s_t<SCALAR_T> torqueApproximation(const joint_coordinate_s_t<SCALAR_T>& jointPositions,
... | ALGO | 0.991202 | 6.166777 |
11ab4792-e311-45d7-9d89-fed51d83e0bb | Shintaro0105/Competitive-programming | atcoder/abc/346/e.cpp | #include <iostream>
#include <vector>
#include <set>
#include <array>
#include <cmath>
#include <string>
#include <algorithm>
#include <functional>
#include <map>
#include <tuple>
#include <queue>
#include <stack>
#include <bitset>
#include <deque>
#include <iomanip>
#define rep(i,n) for(int i = 0;i < (n);i++)
#define ... | ALGO | 0.99996 | 3.397065 |
c20d2850-078d-4d42-bdc2-f48b36c133cf | youxiao/yxbase | buildtools/third_party/libc++/trunk/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp | // <algorithm>
// template<ForwardIterator Iter>
// requires EqualityComparable<Iter::value_type>
// Iter
// adjacent_find(Iter first, Iter last);
#include <algorithm>
#include <cassert>
#include "test_iterators.h"
int main()
{
int ia[] = {0, 1, 2, 2, 0, 1, 2, 3};
const unsigned sa = sizeof(ia)/sizeof... | TEST | 0.989624 | 5.614882 |
7fde1f1c-73ba-4eb3-92ef-c67cb2501de0 | euchangxian/LeetCode | C++/1861-RotatingTheBox/Solution.cpp | #include <cstddef>
#include <cstdlib>
#include <vector>
class Solution {
public:
std::vector<std::vector<char>> rotateTheBox(
std::vector<std::vector<char>>& box) {
// Hm. Seems like two pointers. The output dimensions is a transpose of the
// input.
//
// Initialize the output n x m.
// T... | ALGO | 0.999833 | 7.073368 |
2f88b1c7-279b-465b-a56c-4f73f20be14e | nmd1406/DSA | DSA02003.cpp | #include<bits/stdc++.h>
using namespace std;
int n{};
int arr[12][12]{};
bool check{false};
string s{};
void backTracking(int i, int j, string s)
{
if(i == n - 1 && j == n - 1)
{
cout << s << ' ';
check = true;
return;
}
if(arr[i + 1][j])
backTracking(i + 1, j, s + 'D'... | ALGO | 0.99929 | 5.604419 |
27e6a4e7-0c1f-4984-b07e-89d0d5c533c1 | Karan234Iamneo/skct-2023-daa | Time Complexity and Recursion/sum_of_elements.cpp | //Write a program to compute the sum of elements in an array using recursion.
#include <iostream>
using namespace std;
// Recursive function to calculate the sum of array elements
int calsum(int arr[], int n) {
if (n <= 0)
return 0;
return calsum(arr, n - 1) + arr[n - 1];
}
int main() {
int n;
... | ALGO | 0.999949 | 6.424083 |
8a4a4aa6-7695-49c8-9375-5e8e95a6e56a | Rinnegatamante/abuse-vita | src/imlib/filter.cpp | #if defined HAVE_CONFIG_H
# include "config.h"
#endif
#include "common.h"
#include "image.h"
#include "filter.h"
Filter::Filter(int colors)
{
CONDITION(colors >= 0 && colors <= 256, "bad colors value");
m_size = colors;
m_table = (uint8_t *)malloc(m_size);
memset(m_table, 0, m_size * sizeof(*m_tabl... | TOOL | 0.936055 | 5.835216 |
75afd27d-f4ba-4be0-ad14-f04160318c9c | typr7/practice | judge/hdu/OJ2007.cpp | /*
Problem Description
给定一段连续的整数，求出他们中所有偶数的平方和以及所有奇数的立方和。
Input
输入数据包含多组测试实例，每组测试实例包含一行，由两个整数m和n组成。
Output
对于每组输入数据，输出一行，应包括两个整数x和y，分别表示该段连续的整数中所有偶数的平方和以及所有奇数的立方和。
你可以认为32位整数足以保存结果。*/
#include<iostream>
using namespace std;
int main()
{
#if 0
freopen("text.in","r",stdin);
freopen("text.out","w",stdout);... | ALGO | 0.999618 | 5.138307 |
8a10f223-9975-4297-82a0-d3da62768607 | Sharpless298/adventofcode | 2024/Day 03/part1.cpp | #include <iostream>
using namespace std;
signed main() {
freopen("input.txt", "r", stdin);
long long ans = 0;
string s;
while (cin >> s) {
for (int i = 0; i < (int)s.size(); i++) {
if (s.substr(i, 4) == "mul(") {
i += 4;
int a = 0;
while (s[i] >= '0' && s[i] <= '9') a = a * 10 + s[i] - '0', i++;
... | ALGO | 0.999241 | 4.114473 |
9e265e0f-137a-43d9-b755-2d696e5049ea | ur0/webkit-source | WebCore/xml/XSLTUnicodeSort.cpp | #include "config.h"
#include "XSLTUnicodeSort.h"
#if ENABLE(XSLT)
#include <libxslt/templates.h>
#include <libxslt/xsltutils.h>
#include <wtf/Vector.h>
#include <wtf/unicode/Collator.h>
#if OS(DARWIN) && !PLATFORM(GTK)
#include "SoftLinkLibxslt.h"
static void xsltTransformErrorTrampoline(xsltTransformContextPtr, xs... | TOOL | 0.995302 | 7.252608 |
58535d17-4cc2-43cf-9bed-c0c83f034daa | KhawajaAbdulMoiz/Basics-Practice-in-C- | Loops/Triangle_pyramid.cpp | #include <iostream>
using namespace std;
int main() {
int height;
cout << "Enter the height of the triangle: ";
cin >> height;
for (int i = 1; i <= height; i++) {
for (int j = 1; j <= height - i; j++) {
cout << " ";
}
for (int k = 1; k <= (2 * i - 1); k++... | ALGO | 0.998482 | 5.150908 |
d48de67e-3938-4ca7-8bb2-8fb0cc5873bb | qpwoeirut/competitive-programming | Codeforces/Contest/Div1/1396/1396d.cpp | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "qpwoeirut/debug.h"
#else
#define debug
#define debug1
#define debug2
#define debug3
#endif
#define PB push_back
#define INS insert
#define FI first
#define SE second
#define sz(obj) ((int)(obj.size()))
#define all(obj) begin(obj), end(obj)
#defin... | ALGO | 0.999402 | 3.768637 |
7ddb9081-2e07-423d-9c74-8a27b28f54dc | alexandraback/datacollection | solutions_5686313294495744_0/C++/ziadouf/C.cpp | #include <stdio.h>
#include <functional>
#include <bitset>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <sstream>
#include <queue>
#include <string.h>
#include <numeric... | ALGO | 0.999635 | 4.345116 |
c3262080-924c-454e-85c2-f6ad6a8e11ed | ahmthlmzn/DataStructures | Polynomials Using Linked Lists/Poly.cpp | //Ahmet Halim UZUN - 152120181048
//Mesut KIZILAY - 152120181053
#include <stdio.h>
#include "Poly.h"
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstdlib>
#include <algorithm>
using namespace std;
void remove(PolyNode**, int);
#define DEG 100 //Maximum polino... | ALGO | 0.999095 | 3.366298 |
c1b7f062-1629-4351-8ba7-2181ea5d49db | rathi062/codes | codechef/AUG2015/ADMAG.cpp |
#include<iostream>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>
using name... | ALGO | 0.999946 | 3.743741 |
cfc1ab79-902c-4257-a58d-dd39a969dff5 | xrayFan/xray_history | Editors/!old/Plugins.old/LW/Import/xr_trims.cpp | #include "stdafx.h"
#pragma hdrstop
LPSTR _TrimLeft( LPSTR str )
{
LPSTR p = str;
while( *p && (u8(*p)<=u8(' ')) ) p++;
if (p!=str){
for (LPSTR t=str; *p; t++,p++) *t=*p;
*t = 0;
}
return str;
}
LPSTR _TrimRight( LPSTR str )
{
LPSTR p = str+xr_strlen(str);
while( (p!=str) && (u8(*p)<=u8... | TOOL | 0.909031 | 4.16645 |
8a606a10-b5d8-45f9-adb9-918b708835a9 | ameybh/competitive-programming | codeforces/1249/B1.cpp | // Author: Amey Bhavsar - ameybhavsar24@(github & twitter)
// IDE: Geany on Ubuntu 20.04
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define repD(i,a,b) for(auto i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#d... | ALGO | 0.999795 | 5.018756 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.