uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
9a52b500-a5ee-40ee-b70b-3d664e798f57 | sarvex/leetcode-tsh | solution/2000-2099/2059.Minimum Operations to Convert Number/Solution.cpp | class Solution {
public:
int minimumOperations(vector<int>& nums, int start, int goal) {
using pii = pair<int, int>;
vector<function<int(int, int)>> ops{
[](int x, int y) { return x + y; },
[](int x, int y) { return x - y; },
[](int x, int y) { return x ^ y; },
... | ALGO | 0.999992 | 5.636814 |
59bbd069-0c6f-4843-a5a4-01151b3892f2 | ishandutta2007/codeforces | bhaskartm/normal/1578/L.cpp | #include <bits/stdc++.h>
using namespace std;
#pragma optimize("-O3")
#define f first
#define s second
#define pb push_back
#define endl '\n'
const int N=2e5+5;
int n, l;
vector<vector<int>> adj;
vector<vector<int>> comp;
int timer;
vector<int> tin, tout;
vector<vector<int>> up;
vector<int>dep;
void dfs(int v, int ... | ALGO | 0.999973 | 4.362448 |
6feab364-475e-455f-9c75-001fde9f1cc7 | dy0221/AMR_project | amr_control/example/diff_drive_controller.cpp | /*
* Author: Bence Magyar, Enrique Fernández, Manuel Meraz
*/
#include <memory>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#include "diff_drive_controller/diff_drive_controller.hpp"
#include "hardware_interface/types/hardware_interface_type_values.hpp"
#include "lifecycle_msgs/... | TOOL | 0.96795 | 6.476899 |
dd390e1a-8d5e-445f-8e51-f58bc4fae573 | dmps51001/LeetCode_Training_Cplus_Done | 050_Cplus_Pow(x, n)_Medium/050_Cplus_Pow(x, n)_Medium.cpp | class Solution
{
public:
double myPow(double x, int n)
{
double dRet;
dRet = pow(x, n);
return dRet;
}
}; | ALGO | 0.999734 | 5.720814 |
a42d4285-8b84-4057-8829-ef9af0439a7d | Ashish2030/CPP_Programming_Language_Practice_Code | stringSort.cpp | #include<iostream>
using namespace std;
bool compare(string a,string b){
if(a.size()>b.size()&&a.substr(0,b.size())==b){
return true;
}
if(b.size()>a.size()&&b.substr(0,a.size())==a){
return false;
}
return a<b;
}
int main(){
string a[1000];
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
... | ALGO | 0.999842 | 4.376415 |
7d0c0160-b50f-44ae-87d1-25e235082142 | ishandutta2007/codeforces | gyh20/normal/1508/D.cpp | #include<bits/stdc++.h>
#define re register
using namespace std;
inline int read(){
re int t=0,f=0;re char v=getchar();
while(v<'0')f|=(v=='-'),v=getchar();
while(v>='0')t=(t<<3)+(t<<1)+v-48,v=getchar();
return f?-t:t;
}
struct node{
int x,y,z,id,id1;
bool operator <(const node A)const{return x==A.x?y<A.y:x<A.x;}... | ALGO | 0.999953 | 3.98306 |
ba329570-e588-4082-b885-9e497ddd25cd | voldigoad-7/leetcode-gfg-solutions | 0242-valid-anagram/0242-valid-anagram.cpp | class Solution {
public:
bool isAnagram(string s, string t) {
const int x=1e7+5;
vector<int>vec(x,0);
for(auto x:s)
{
vec[x]++;
}
for(auto x:t)
{
vec[x]--;
}
for(int i=0;i<x;i++)
{
if(vec[i]!=0 || vec... | ALGO | 0.99999 | 6.396914 |
c88e1ec0-89f5-4226-b720-3e95c7b594b5 | s-bond/Miscellaneous-Codes | 4/Is it a tree.cpp | /* @
* bond, sidhs
*/
#include <iostream>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <algorithm>
#include <cstring>
#include <fstream>
#include <bitset>
#include <set>
#include <cmath>
#include <time.h>
#include <string.h>
#include <stdio.h>
#include <cstdio>
////////... | ALGO | 0.999955 | 4.081232 |
f5720a3a-0b2e-450d-85af-232dc965b635 | DarkSharpness/PPCA-Exam | W1/A/T2/std.cpp | #include <bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); ++i)
#define per(i, r, l) for(int i = (r); i >= (l); --i)
#define pb push_back
using namespace std;
struct edge{int from,to,cap,flow;};
const int N = 3e5 + 10, inf = 1e9;
struct Dinic{
vector<edge> e;
vector<int> G[N];
int d[N],cur[N],n,m,s,t;
... | ALGO | 0.999988 | 3.597861 |
c02a7051-9245-49f3-af16-365bb779cee0 | ishandutta2007/codeforces | suiseiseki/normal/1149/B.cpp | #include <cstdio>
#define Maxn 100000
char a[5][Maxn+5];
int len[5];
char s[Maxn+5];
int nxt[Maxn+5][30];
int f[255][255][255];
char qu[3];
int mn(int a,int b){
return a<b?a:b;
}
int main(){
int n,q,x;
scanf("%d%d",&n,&q);
scanf("%s",s+1);
for(int i=0;i<26;i++){
nxt[n][i]=nxt[n+1][i]=n+1;
}
for(int i=n-1;i>=0;... | ALGO | 0.999911 | 3.779648 |
5bc51e7e-61e4-4933-888b-d0dcc5badddc | YunchaeChoi/GPU-Sched-master | Benchmarks/rodinia_cuda_3.1/cuda/mummergpu/src/mummergpu_gold.cpp | #include <stdio.h>
#include <string.h>
#include <fstream>
#include <stdint.h>
#define ulong4 uint32_t
#define int2 int32_t
#define uint4 uint32_t
#include "omp.h"
#include "mummergpu.h"
// Matches are reported as a node in the suffix tree,
// plus a distance up the node's parent link for partial
// matches on the p... | ALGO | 0.986844 | 3.436177 |
862228bb-1c3d-4342-9ee4-d9414082e8ec | raincross7/code-similarity | codes/train_code/problem168/problem168_170.cpp | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll INF = 1e16;
#define rep(i, N) for(ll i=0; i<N; ++i)
ll max(ll a, ll b) {return a < b ? b : a; }
ll min(ll a, ll b) {return a > b ? b : a; }
int main() {
int N;
ll Z, W;
cin >> N >> Z >> W;
vector<ll> a(... | ALGO | 0.999917 | 3.827762 |
1453d128-6ef2-45dd-aa1b-f7f09d29be4e | dvtdat/cp | codeforces/1825B.cpp | //
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef long long ll;
typedef long double ld;
const ll infLL = 2e18 + 7;
const int inf = 2e9 + 7;
const int maxN = 200010;
const ll MOD = 998244353;
const double eps = 1e-12;
void solve()
{
ll n, m; cin >> n... | ALGO | 0.999881 | 4.490447 |
b80c21ee-00cb-4efd-b932-849bc913c20d | Harshsngh07/DataStructures_and_Algorithms | GeeksForGeeks/Trees/MaxSumLeafToLeaf.cpp | int solve(Node *root, int &res)
{
if (root == NULL)
return 0;
if (!root->left && !root->right)
return root->data;
int l = solve(root->left, res);
int r = solve(root->right, res);
if (root->left && root->right)
{
res = max(res, l + r + root->data);
return max(l,... | ALGO | 0.999998 | 5.909401 |
6ef05467-1fea-4dba-b6bb-dd2dd039eecd | sabirmostofa/opengl-marionette | objloader.cpp | #include <vector>
#include <stdio.h>
#include <string>
#include <cstring>
#include <glm/glm.hpp>
#include "objloader.hpp"
// Very, VERY simple OBJ loader.
// Here is a short list of features a real function would provide :
// - Binary files. Reading a model should be just a few memcpy's away, not parsing a file at ... | TOOL | 0.898804 | 4.537187 |
2391e48a-9b16-4abd-b643-2753c26e8919 | Olesya-lisa/project1 | semestr2/Search/Interpol.cpp | #include <iostream>
#include <clocale>
using namespace std;
//
int interpolationSearch(int arr[], int low, int high, int x)
{
while (low <= high && x >= arr[low] && x <= arr[high])
{
if (low == high)
{
if (arr[low] == x) return low;
return -1;
}
int pos = low + (((x - arr[low]) * (high - low)) / (a... | ALGO | 0.999841 | 4.419777 |
80754303-fada-49bb-86d8-6e9ac4823bf6 | JulienCarayon/SKR-1.3-MeCreator2-final | Marlin/src/gcode/bedlevel/G35.cpp | #include "../../inc/MarlinConfig.h"
#if ENABLED(ASSISTED_TRAMMING)
#include "../gcode.h"
#include "../../module/planner.h"
#include "../../module/probe.h"
#include "../../feature/bedlevel/bedlevel.h"
#if HAS_MULTI_HOTEND
#include "../../module/tool_change.h"
#endif
#define DEBUG_OUT ENABLED(DEBUG_LEVELING_FEATURE... | TOOL | 0.986259 | 6.43751 |
54e4b8a7-cb3a-4f53-8f4c-d7f8f84f6260 | Mahudesh/Data-Structures-And-Algorithms | Binary Search Trees/Predecessor And Successor Of A Binary Search Tree.cpp | class Solution
{
public:
bool p=false;
bool s=false;
void findSuccessor(Node* root, int key, Node*& suc)
{
if(!root)
return;
if(root->key>key)
{
suc=root;
// s=!s;
s=true;
findSuccessor(root->left,key,suc);
}
... | ALGO | 0.999997 | 5.217333 |
2932de12-4dc4-49e0-aec2-f5d48478862f | KasanMoor/Algorithms | ass2/backup/quicksort.cpp | #include <iostream>
using namespace std;
const int n = 10;
void printArray( int array[] )
{
for( int i=0; i<n; i++ ) {
cout << array[i] << " ";
}
cout << endl;
}
int partition( int a[], int low, int hi )
{
/*cout << "partitioning; low: " << low
<< " high: " << hi
<< " pivot: " ... | ALGO | 0.999983 | 5.210709 |
8981a92a-6e7d-4195-87f0-5a9480b19009 | williamthio/competitive-programming-3 | Programming Exercises/1.3.3 Time to Start the Journey/3. Medium/UVa_10324.cpp | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
void uva_10324() {
string s;
int n, i, j, left, right, prev, tc = 0;
while (cin >> s, !cin.fail()) {
cout << "Case " << ++tc << ":\n";
cin >> n;
while (n--) {
cin >> i;
cin >> j;... | ALGO | 0.999713 | 4.430941 |
c086ec6f-165f-4836-a1de-14713bde2139 | arafat-yasin-2413/COURSE-3-DS | WEEK -5/Mod 18/4_countLeafNodes.cpp | #include<bits/stdc++.h>
using namespace std;
class Node
{
public:
int val;
Node *left;
Node *right;
Node(int val)
{
this->val = val;
this->left = NULL;
this->right = NULL;
}
};
Node * input_tree()
{
int val;
cin>>val;
Node * root;
if(val == -1) root = ... | ALGO | 0.999824 | 4.479569 |
3fd9425a-117c-4a0e-99c8-f77f3b58a97c | d-k-ivanov/sandbox-cpp | metaprogramming/pow/pow_runtime.cpp | #include <iostream>
double mypow(double x, int N) {
if (N < 0)
return 1 / mypow(x, -N);
else if (N == 0)
return 1;
else if (N % 2 == 0) {
double p = mypow(x, N / 2);
return p * p;
}
else
return mypow(x, N - 1) * x;
}
int main() {
std::cout << " " << "\t: ";
for(int x = 0 ; x <= 5; x... | ALGO | 0.999723 | 4.845221 |
b73e95b6-f00e-4fd4-a91f-265700c4d126 | Tingwei0512/llvm-19 | libc/src/math/generic/fmaximumf128.cpp | #include "src/math/fmaximumf128.h"
#include "src/__support/FPUtil/BasicOperations.h"
#include "src/__support/common.h"
#include "src/__support/macros/config.h"
namespace LIBC_NAMESPACE_DECL {
LLVM_LIBC_FUNCTION(float128, fmaximumf128, (float128 x, float128 y)) {
return fputil::fmaximum(x, y);
}
} // namespace LIBC... | ALGO | 0.961077 | 5.591823 |
e9402d69-089a-46b4-befc-ea1b2e7b5f4e | cola0405/usaco_cpp | silver/17-12/3_3.cpp | // 频繁地对set进行修改，效率也是低的
// 大小放到50000, 更慢了
// 只过了6个
#include <bits/stdc++.h>
using namespace std;
int main(){
freopen("shuffle.in", "r", stdin);
freopen("shuffle.out", "w", stdout);
int n;
cin>>n;
vector<int> next(n+1);
for(int i=1; i<=n; i++){
cin>>next[i];
}
int ans = 0;
... | ALGO | 0.999655 | 3.236247 |
b955dd38-a68d-4bee-9670-1de09c8dd8c6 | k1suxu/My_CP_Library | Range Querys/Wavelet_Matrix/Wavelet_Matrix.cpp | // ref: https://nyaannyaan.github.io/library/data-structure-2d/wavelet-matrix.hpp.html
#include <immintrin.h>
struct bit_vector {
static constexpr uint32_t w = 64;
vector<uint64_t> block;
vector<uint32_t> count;
uint32_t n, zeros;
inline uint32_t get(uint32_t i) const { return uint32_t(block[i / ... | ALGO | 0.999958 | 4.924932 |
67a7ddb5-18f1-4335-acbd-2e9c9f233697 | raincross7/code-similarity | codes/train_code/problem201/problem201_349.cpp | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
struct dish{
ll A,B;
bool operator<(const dish &o) const {return A+B < o.A+o.B;}
bool operator>(const dish &o) const {return A+B > o.A+o.B;}
};
int main(){
... | ALGO | 0.999878 | 3.588804 |
ec66ac15-2071-4067-8d71-c2e62fccb93b | yashuhl/LeetCodeProblems | meetingRoomCount.cpp | /*
253. Meeting Rooms II
Given an array of meeting time intervals intervals where intervals[i] = [starti, endi],
return the minimum number of conference rooms required.
Example 1:
Input: intervals = [[0,30],[5,10],[15,20]]
Output: 2
Example 2:
Input: intervals = [[7,10],[2,4]]
Output: 1
Constraints:
1 <= interva... | ALGO | 0.999994 | 6.652452 |
3a1e42c5-1955-42d0-9e0f-83939180619d | YakovKontarook/UniversityHomework | homework 6.3.3.cpp | //
// Created by Яков Контарук on 07.02.2023.
//
#include <iostream>
#include <string>
using namespace std;
int main() {
string str = "Hello";
char ch;
cout << "Введите символ, который вы хотите удалить: ";
cin >> ch;
int n = str.length();
for (int i = 0; i < n; i++) {
if (str[i] == c... | TOOL | 0.962411 | 5.115272 |
23801a77-5daa-41d4-bcb8-f4ba6cce9011 | santhosh-pmk/c-programming | week4/3.cpp | #include<stdio.h>
int main(){
int n=5;
for(int i=0;i<n;i++){
for(int s=0;s<n-i-1;s++){
printf(" ");
}
for(int j=0;j<i+1;j++){
printf("* ");
}
printf("\n");
}
return 0;
}
| ALGO | 0.999895 | 3.306705 |
78fa31a2-79b3-4e41-ad52-7cf7620cbb32 | Sarvaswa-Mohata/Leetcode | 204-count-primes/count-primes.cpp | class Solution {
public:
void SieveOfEratosthenes(int n, int& cnt)
{
if(n<=1) return;
// Create a boolean array "prime[0..n]" and initialize
// all entries it as true. A value in prime[i] will
// finally be false if i is Not a prime, else true.
bool prime[n + 1];
... | ALGO | 0.999887 | 5.390169 |
22e28ff9-53b0-4a32-8d88-82f9576b4b59 | FabianSchuetze/gpu_nn | src/layer/lstm.cpp | #include "../../include/layer/lstm.hpp"
#include <sys/time.h>
#include <iostream>
#include <memory>
#include "../../include/cuda_math.h"
#include "../../include/math.h"
using Eigen::all;
double cpuSecond2() {
struct timeval tp;
gettimeofday(&tp, NULL);
return ((double)tp.tv_sec + (double)tp.tv_usec * 1e-6);... | DATA | 0.992968 | 6.841065 |
ec0a52fd-3998-4010-9c40-e5cde3e10a36 | ArunRathaur1/DSA-II | c++/C. Dolce Vita.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
long long t;
cin>>t;
while(t--){
long long n,x;
cin>>n>>x;
vector<long long>ar(n);
long long sum=0;
for(long long i=0;i<n;i++){
cin>>ar[i];
sum=sum+ar[i];
}
sort(ar.begin(... | ALGO | 0.999847 | 4.116241 |
d093d2b5-f8d1-4466-9ab8-5111769d7b30 | heesangh/spmm-llm-optimization | eigen-baseline/doc/examples/tut_arithmetic_redux_basic.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main() {
Eigen::Matrix2d mat;
mat << 1, 2, 3, 4;
cout << "Here is mat.sum(): " << mat.sum() << endl;
cout << "Here is mat.prod(): " << mat.prod() << endl;
cout << "Here is mat.mean(): " << mat.mean() << endl;
cout << "Here ... | ALGO | 0.999483 | 3.8169 |
d3a77d2c-87bc-4e7b-a815-80ad4f7024d7 | georgealexakis/multispectral_processing | src/corners_registrator.cpp | #include <ros/ros.h>
#include <sensor_msgs/Image.h>
#include <message_filters/subscriber.h>
#include <message_filters/synchronizer.h>
#include <message_filters/sync_policies/approximate_time.h>
#include <std_msgs/Header.h>
#include <sensor_msgs/CameraInfo.h>
#include <sensor_msgs/SetCameraInfo.h>
#include <cv_bridge/cv... | ALGO | 0.898016 | 6.622716 |
f1cf0cbe-5769-4c77-b6be-c3ce55b54ad0 | hongthuyph312/morethantechnical | VirtualSurgeon/BeTheModel/face_warp.cpp | #include "../VirtualSurgeon_Warp/VirtualSurgeon_Warp/stdafx.h"
#include "util.h"
#include "../VirtualSurgeon_Warp/VirtualSurgeon_Warp/vs_warp.h"
namespace VirtualSurgeon {
void VirtualSurgeon_Warp::face_warp_read_points(std::string& str, Size im_size, vector<Point2d>& points) {
int x = -1,y = -1;
FILE* f;
fopen_s... | ALGO | 0.992016 | 3.12115 |
5a30b5e7-5842-403a-b402-3b6ee1d3dbb1 | SaksheePhade/Competitive-programming | Frontdoor1.cpp | #include <iostream>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
char *removeSpaces(char *str)
{
int i = 0, j = 0;
while (str[i])
{
if (str[i] != ' ')
str[j++] = str[i];
i++;
}
str[j] = '\0';
return str;
}
string findPalindrome(string P... | ALGO | 0.999894 | 5.381415 |
6402ce2b-1ba1-4514-91d5-97305db5a97e | Alex31122/CodeForces1 | CodeForces_20-30/APresents.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,p[105],r[105];
cin>>n;
for(int i=0;i<n;i++){
cin>>p[i];
r[p[i]-1]=i+1;
}
for(int i=0; i<n; i++){
cout << r[i] << " ";
}
return 0;
} | ALGO | 0.99993 | 3.827935 |
7e74fa0a-2e0e-439f-bbd9-2518b5ea1375 | mdbal-lunule/lunule | src/boost/libs/container/example/doc_recursive_containers.cpp | using namespace boost::container;
struct data
{
int i_;
//A vector holding still undefined class 'data'
vector<data> v_;
vector<data>::iterator vi_;
//A stable_vector holding still undefined class 'data'
stable_vector<data> sv_;
stable_vector<data>::iterator svi_;
//A stable_... | TOOL | 0.908382 | 3.745957 |
7d63cb04-8789-48f7-9b9e-9f5badcf9e54 | HHHHao-s/algorithm | 1074.元素和为目标值的子矩阵数量.cpp | #include "s.h"
/*
* @lc app=leetcode.cn id=1074 lang=cpp
*
* [1074] 元素和为目标值的子矩阵数量
*/
// @lc code=start
class Solution {
public:
int numSubmatrixSumTarget(const vector<vector<int>>& matrix, int target) {
int m = matrix.size();
int n = matrix[0].size();
int ans=0;
for(int i=0;i<m;... | ALGO | 0.999876 | 6.156106 |
da707baa-90d1-4cfa-b685-5df4c482aa46 | alexandraback/datacollection | solutions_5646553574277120_0/C++/liorin/solC.cpp | #include <cstdio>
#include <cstdlib>
#include <vector>
#include <set>
using std::vector;
using std::set;
bool check(set<long long int>::iterator l, set<long long int>::iterator r, long long int v, long long int c) {
set<long long int>::iterator it;
long long int k;
bool ret = false;
it = r;
// printf("Checking %ll... | ALGO | 0.999146 | 3.404886 |
0115c4d4-424a-45b1-8673-a82fbb9c4b9a | samueleceroni/codeforces | contests/514/D/d.cpp | #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int maxL, maxR, maxY=0, minY = INF, isPositive = -1, x, y, yOneShot=0;
for (int i=0; i<n; i++){
cin >> x >> y;
if(y>0){
if(isPositive == -1){
isPositive = 1;
} else if (isPositive == 0){
cout << -1;
return 0;
}
}
... | ALGO | 0.999986 | 3.978908 |
5f33bf9a-f0c8-49f4-8b1a-b0120f6228d2 | fyang26/leetcode | c++/minimum-path-sum.cpp | class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
if (grid.empty() || grid[0].empty()) return 0;
vector<vector<int>> res(grid);
int row = grid.size(), col = grid[0].size();
for (int i=1; i<row; i++)
res[i][0] += res[i-1][0];
for (int i=1; i<col;... | ALGO | 0.999972 | 6.136775 |
5485c0c9-0f79-473f-a296-01ed45aeb640 | wookim0719/codingTest-practices | baekjoon_1644.cpp | #include <bits/stdc++.h>
using namespace std;
bool che[4000001];
int n, a[2000001], p,lo,hi,ret,sum;
int main(){
cin>>n;
for(int i=2; i<=n; i++){
if(che[i]) continue;
for(int j=2*i; j<=n; j+=i){
che[j] =1;
}
}
//a 迭 Ҽ ߰ش.
for(int i=2; i<=n; i++){
if(!che[i]) a[p++] = i;
}
while(1){
cout<<sum<... | ALGO | 0.999549 | 3.275298 |
afb6f5a7-48d0-4ec1-91f4-0bad2a63d244 | shodi/Algoritmos | C++/Uri/1005.cpp | #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
double a, b;
while(scanf("%lf", &a) != EOF && scanf("%lf", &b) != EOF){
printf("MEDIA = %.5lf\n", (((a * 3.5) + (b * 7.5)) / (3.5 + 7.5)));
}
return 0;
}
| ALGO | 0.996709 | 3.943173 |
c83c1c25-547f-4698-b31d-cfa4ba4bc4cd | ajju-1209/COD | COD18.cpp | /*COD(18 problem) Equilibrium point gfgf*/
// { Driver Code Starts
#include <iostream>
using namespace std;
// } Driver Code Ends
class Solution{
public:
// Function to find equilibrium point in the array.
// a: input array
// n: size of array
int equilibriumPoint(long long a[], int n) {
... | ALGO | 0.999896 | 6.225811 |
5dcee27e-8c46-462a-9d95-5741d210314d | algo-seacow/NCTU-ItoA-2020-Fall | 1114/submissions/accepted/309552025_segment_tree.cpp | #include <bits/stdc++.h>
using namespace std;
class segment_tree{
public:
segment_tree(int size):st_size(size), v(size*4){}
void add_one(int pos){
add_one(1, 0, st_size - 1, pos);
}
int query_k_th_num(int k){
return query(1, 0, st_size - 1, k);
}
int size(){
return v[1];
}
private:
int st_s... | ALGO | 0.999964 | 4.439621 |
0b0abcf1-be8d-488d-97c4-174c256843e3 | CESARO23/Programacion_Competitiva | RPCs/RPC08-17/situation.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int i,j,k,n,x;
bool z=false;
scanf("%d",&n);
int vec[n+1];
for(i=0;i<n;i++){
scanf("%d",&x);
vec[i]=x;
}
for(i=0;i<n-2;i++){
for(j=i+1;j<n-1;j++){
for(k=j+1;k<n;k++){
if(vec[i]+vec[j]... | ALGO | 0.999977 | 3.664879 |
b49a2f8c-4054-4e5e-9582-4287177b1001 | hasib-24/DSA | SortingRelatedProblem/NewYearFriendMeet.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int>v(3);
for(int i=0;i<3;i++){
cin>>v[i];
}
sort(v.rbegin(),v.rend());
int first=v[0]-v[1];
int second=v[1]-v[2];
cout<< first+second<<" ";
return 0;
} | ALGO | 0.999899 | 3.650195 |
7454f7d6-24ba-4e3a-921a-6ee4e8e313d9 | MohamedAli00949/poblem-solving | data types - conditions/v.cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
int a, b;
string s;
cin >> a >> s >> b;
if (s == ">")
{
if (a > b)
{
cout << "Right";
}
else
{
cout << "Wrong";
}
}
else if (s == "<")
{
... | ALGO | 0.999879 | 3.114059 |
07c535b3-d5a7-42da-b629-2101acd03f58 | Yawn-Sean/Daily_CF_Problems | daily_problems/2024/09/0902/personal_submission/cf1055c_zrnstnsr.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int mod = 998244353;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3f;
void solve() {
ll la, ra, ta, lb, rb, tb;
cin >> la >> ra >> ta >> lb >> rb >> tb;
ll g = gcd(ta, tb);
ll da = ra - la, db = rb - l... | ALGO | 0.999309 | 4.697141 |
c3ab7439-8d23-4846-9411-7c50d2bc422c | SirjanSingh/CP-CF | C_Gellyfish_and_Flaming_Peony.cpp | #include <bits/stdc++.h>
using namespace std;
#define f(i, x, y) for (int i = x; i < y; i++)
#define fr(i, x, y) for (int i = x; i > y; i--)
#define int long long
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define all(vector) vector.begin(), vector.end()
#define nl cout << "\n"
#define x first
#define y sec... | ALGO | 0.999777 | 3.571204 |
d5a2ffb5-fa8b-4493-b0f3-d99854e7eedc | wdq/csce310 | homework01/program2/csce310hw001pt02.cpp | #include "csce310hw001pt02.h"
#include <string>
#include <iostream>
#include <vector>
#include <string.h>
#include <stdio.h>
using namespace std;
// Algorithm: Johnson Trotter (n)
// Input: A positive integer n
// Output: A list of all permutations of {1.....n}
//
// initialize the first permutation with 12...n
// wh... | ALGO | 0.999962 | 5.352687 |
0dd60205-d1c4-44e6-afbf-cff8f8d5640f | sanketdisale871/DSA | 893-all-nodes-distance-k-in-binary-tree/all-nodes-distance-k-in-binary-tree.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
private:
vector<int>ans;
unordered_set<int>nodes;
unordered_map<TreeNode*,TreeNode*>um;
... | ALGO | 0.999997 | 5.921067 |
cfe01007-09ed-4499-9cbf-53ef1fe950f6 | techlism/LeetCode-Solutions | 0841-keys-and-rooms/0841-keys-and-rooms.cpp | class Solution {
private:
void dfs(vector<vector<int>> & rooms,int & count,int node,vector<bool> & visited){
visited[node]=true;
count+=1;
for(auto neighbor : rooms[node]){
if(!visited[neighbor]) dfs(rooms,count,neighbor,visited);
}
}
public:
bool canVisitAllRooms... | ALGO | 0.999896 | 6.651098 |
29e1b6c5-ff03-4072-bedb-68cc67e2edea | Johniel/uva | 11752.cpp | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#define REP(i, n) for(int i=0; i<(int)n; ++i)
#define FOR(i, c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(),(c).end()
using namespace std;
typedef unsigned long long int lli;
int head(lli n)
{
int cnt... | ALGO | 0.999674 | 3.296943 |
8af73552-edc2-4c49-bf35-c56ab4c57b8a | Zzzode/myLeetCode | 5548.最小体力消耗路径.cpp | #include "Header.h"
class Solution {
public:
int minimumEffortPath(vector<vector<int>>& he) {
int len = he[0].size();
int hei = he.size();
if (len == 1 && hei == 1) return 0;
l = 0, r = 1e6;
while (l < r) {
mid = (l + r) / 2;
vector<vector<bool>> visited(hei, vector<bool>(len, false... | ALGO | 0.99999 | 5.951607 |
7942b717-33c3-4435-af37-ce8faa7f732d | himanshu062/leetcode-problems | 37-sudoku-solver/sudoku-solver.cpp | class Solution {
public:
void solveSudoku(vector<vector<char>>& board) { solve(board, 0); }
private:
bool solve(vector<vector<char>>& board, int s) {
if (s == 81)
return true;
const int i = s / 9;
const int j = s % 9;
if (board[i][j] != '.')
return solve(... | ALGO | 0.99933 | 7.243577 |
5d5867b2-7c44-4cba-9496-b54cd516bd27 | ishandutta2007/codeforces | satashun/normal/1718/A2.cpp | #pragma region satashun
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV =... | ALGO | 0.99995 | 5.312945 |
0e412107-abf6-4869-92e5-70a0fc40960d | MrcSanto/beecrowd-exercises | 1022/1022.cpp | #include <iostream>
#include <numeric>
int main(){
int n, numerador, denominador;
std::cin >> n;
for (int i=0;i<n;i++){
char op;
int n1, d1, n2, d2;
scanf("%d / %d %c %d / %d", &n1, &d1, &op, &n2, &d2);
if (op == '+'){
numerador = n1*d2 + n2*d1;
deno... | ALGO | 0.998775 | 5.127655 |
068d2c65-b336-4790-9de1-2a0ef738c113 | snewptl/stationaryTraveller | old-memory/2020_03_12/C.cpp | #include<bits/stdc++.h>
using namespace std;
int T,maxd;
const int maxn=200010;
char s[maxn];
int main(){
scanf("%d",&T);
while(T--){
scanf("%s",s);
int len=strlen(s);
maxd=0;
int d=0;
for(int i=0;i<len;i++){
d++;
if(s[i]=='R'){
max... | ALGO | 0.997981 | 3.897001 |
6676ab73-78ec-48b1-b957-74aaeb17be7a | ayushi0711/assignment7 | q8.cpp | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1; i<=n; i++){
for(int j=1; j<=i; j++){
cout<<j;
}
cout<<endl;
}
}
| ALGO | 0.999929 | 3.707284 |
5561aa90-3f2a-4bd2-982a-87c60f003f1a | WeiHe999/dmoj_cpp_level_2 | level-2/09-18-2021/silent_auction.cpp | #include <bits/stdc++.h>
using namespace std;
template < typename T > void
print (T t)
{
for (const auto & e:t) cout << e << " ";
cout << endl;
}
vector < string > split (string str1)
{
vector < string >vv;
string word;
istringstream ss (str1);
while (getline (ss, word, ' '))
{
vv.push_back (word... | ALGO | 0.998921 | 4.600466 |
61e6563e-9e7c-4f8f-9ad7-49cf6536a62f | projectarcana-aosp/platform_external_libcxx | test/std/algorithms/alg.nonmodifying/alg.search/search_pred.pass.cpp | // <algorithm>
// template<ForwardIterator Iter1, ForwardIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// constexpr Iter1 // constexpr after C++17
// search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
#include <algorithm>
#include <cassert>
#include "test_macros.h"... | TEST | 0.981508 | 5.896523 |
0c1deaa9-cc3a-4fb5-9973-9a01fe105d0b | Tracktion/tracktion_engine | modules/tracktion_engine/3rd_party/airwindows/Logical4/Logical4Proc.cpp | #ifndef __Logical4_H
#include "Logical4.h"
#endif
void Logical4::processReplacing(float **inputs, float **outputs, VstInt32 sampleFrames)
{
float* in1 = inputs[0];
float* in2 = inputs[1];
float* out1 = outputs[0];
float* out2 = outputs[1];
double overallscale = 1.0;
overallscale /= 44100.0... | ALGO | 0.997123 | 3.8487 |
2e5d90eb-4ed6-48a5-8de6-0c71bd687b24 | hjiang13/LLMs-in-IR | POJ-104/74/491.cpp | #include <iostream>
using namespace std;
int fs(int m){
int i;
if(m==1||m==2) {
return 0;
}
else{
for(i=2; i<m; i++){
if(m%i==0)
break;
}
if(i<m) return 0;
else return 1;
}
}
int fh(int n){
int a=n/10;
int b=n%10;
int m=0;
int t;
while(a!=0){
m=b*10;
t=a;
a=a/10;
b=t%10;
b+=m;
}
if(b==n) return 1;
else return 0;
}
int ... | ALGO | 0.999727 | 3.137501 |
8a72579c-65b2-4ab9-8f5a-b9e0ceb88cad | tomoakiii/atcoder2 | Archive/abc315/b.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 0x0F0F0F0F0F0F0F0F;
typedef pair<int, int> pii;
int main()
{
int M;
cin >> M;
vector<int> D(M);
int sd = 0;
for (auto &d: D) {
cin >> d;
sd += d;
}
int tgt = (sd+1)/2;
int cnt = 0;
... | ALGO | 0.99998 | 3.427147 |
b24e96dc-e1e4-4266-8c65-efee9e4fc1aa | ML-UCV/ML-CodeBert-DistinctSolutions | Raw Dataset/sate/bfs_lee/train/269069e3-40ad-11ec-bc70-dc7196033e92.cpp | #include <iostream>
#include <fstream>
#include <stdio.h>
#include <vector>
#include <queue>
#define INF (1<<30)
#define pii pair <int, int>
#define x first
#define y second
#define NMAX 30005
using namespace std;
ifstream fin("sate.in");
ofstream fout("sate.out");
int n, m, X, Y;
int dp[NMAX], inq[NMAX];... | ALGO | 0.999906 | 3.81014 |
342125ee-1216-4d8c-b229-b5bfea4e256a | ncs-jss/online-c-compiler | code_dep/728d9b544917edaeecb5dac58ccab4ed/cpp/cppsample.cpp | #include<iostream> //Do not write the extension for the included file
int main() //Main function must return a value
{
int a,b,c;
std::cin>>a;
/*The namespace std:: has to be used before every I/O Statement
Inputs take a garbage value if no file is uploaded
The file for inputs shall contain all the inputs in th... | TOOL | 0.904675 | 3.551907 |
49fc13ab-80bf-4e57-bf3c-467e78a7e3c0 | jhangy/ca_final_pro | ext/systemc/src/sysc/communication/sc_signal_resolved.cpp | /*****************************************************************************
sc_signal_resolved.cpp -- The resolved signal class.
Original Author: Martin Janssen, Synopsys, Inc., 2001-05-21
CHANGE LOG IS AT THE END OF THE FILE
*****************************************************************************/
#... | TOOL | 0.99272 | 6.889937 |
e9b18ecf-e146-448b-b158-211453b22c7a | Neer393/Strivers-SDE-Challenge | Single-Element-in-a-Sorted-Array.cpp | #include<bits/stdc++.h>
int singleNonDuplicate(vector<int>& arr)
{
int left = 0,right = arr.size() - 1;
while (left < right) {
int mid = left + (right - left) / 2;
if (mid % 2 == 1) {
mid--;
}
if (arr[mid] != arr[mid + 1]) {
right = mid;
} else {
... | ALGO | 0.999399 | 4.729233 |
5988e37d-d1ad-4c2b-b020-ac13bdae47cc | kumarshivam27december/c_programming_with_shivam | 05_queue_stl.cpp | #include <iostream>
#include <queue>
using namespace std;
int main() {
queue<string> q;
q.push("love");
q.push("Babbar");
q.push("Kumar");
cout << "Size before pop: " << q.size() << endl;
cout << "First Element: " << q.front() << endl;
q.pop();
cout << "First Element: " << q.front()... | ALGO | 0.924558 | 4.681779 |
867f8975-d3ff-45fa-a5df-b5d19db448b6 | Vortexx2/DSA-questions | leetcode/medium/62-unique-paths/best-dp.cpp | /**
* @file best-dp.cpp
* @author Vortexx2
* @brief Problem 62 - Unique Paths
* @date 30-07-2021
*
* Runtime - 0 ms O(m * n)
* Memory Usage - 6.2 MB O(n)
*/
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <list>
#include <unordered_map>
#include <map>
#include <set>
#includ... | ALGO | 0.999719 | 6.377507 |
9fb40c53-0b8b-49b5-b3e0-a1964b3ad908 | JackieXie168/libNeuralNet | eigen/doc/snippets/SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType.cpp | MatrixXd X = MatrixXd::Random(5,5);
MatrixXd A = X + X.transpose();
cout << "Here is a random symmetric 5x5 matrix, A:" << endl << A << endl << endl;
SelfAdjointEigenSolver<MatrixXd> es(A);
cout << "The eigenvalues of A are:" << endl << es.eigenvalues() << endl;
cout << "The matrix of eigenvectors, V, is:" << endl << ... | ALGO | 0.999726 | 3.056724 |
aca81ffa-7e9b-4eb2-a3e6-781841da0158 | agatagc/Courses | CPP/CPP_Zbior_zadan_1/cppzbz/#2/rozwiÑzania/38.cpp | #include <iostream>
#include <vector>
#include <fstream>
#include <string>
using namespace std;
typedef long long int L;
typedef unsigned long long int UL;
//////////////////////////////////////////////////////
UL ileAwB(string A, string B) {
UL i = 0;
L poz = -1;
while ((poz = B.find(A, ++poz)) != string::npo... | ALGO | 0.998582 | 4.103045 |
c7f9b5e6-0487-4fdd-9cb1-6af5407e8f82 | LOHIT-V-GANGOLLI/aps-code-library | problem 6.cpp | /*
Given an array arr[] denoting heights of N towers and a positive integer K.
You have to modify the height of each tower either by increasing or decreasing them by K only once.
After modifying, height should be a non-negative integer.
Find out what could be the possible minimum difference of the height of shortest a... | ALGO | 0.999909 | 5.50989 |
9694ee36-5e92-460c-8c47-6a75d85f5b00 | PratikPranav/Allcodes | c++/pattprac.cpp | #include<iostream>
using namespace std;
int main()
{
int n,c=1;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
cout<<c<<" "; c++;
}
cout<<endl;
}
}
| ALGO | 0.999913 | 3.673119 |
7fda745e-0dc2-4418-a64e-7164075f7bbe | manassinghdewari/dsa | 04Array/25Majority_Element.cpp | // majority element
// a element said to be a majority element if it appears
// more than n/2 times in an array (>n/2)
// n is the size of the array
// examples
// i/p:arr[] ={8,3,4,8,8}
// o/p: 0 or 3 or 4 (any index of 8)
// i/p:arr[] ={3,7,4,7,7,5}
// o/p: -1 (no majority) bcz 7 appears exactly 3 times it
// s... | ALGO | 0.999943 | 5.189219 |
f42ffdaf-8fed-4bb2-99d3-0f4b9225e553 | santhosh207/leetcode-solutions | 287.cpp | //287. Find the Duplicate Number
class Solution {
public:
int findDuplicate(vector<int>& nums) {
int s=0,e=nums.size()-1;
int mid=s+(e-s)/2;
while(s<=e){
int c=0;
for(int n:nums){
if(n<=mid)
c++;
}
if(c<=mid)
... | ALGO | 0.999959 | 5.761423 |
2f3bc42e-ea06-40d3-ac43-0675e4509234 | AIxiaodi4Ever/leetcode_in_cpp | 01a栈_队列_双端队列/0019method2.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) {}
* };
*/
// push all node into a stack and pop one-by-one t... | ALGO | 0.999985 | 6.180385 |
3457a4cf-ad31-438c-8187-69a0b535e827 | mukeshsoni5937/Data-structure-Algorithm-by-Ashish-Gadpayle | TwoTable.cpp | #include <iostream>
using namespace std;
void twosTable(int n, int multiple) {
if (n == 1) {
cout << multiple <<endl;
return;
}
twosTable(n - 1, multiple);
cout << multiple * n <<endl;
}
int main() {
int n;
cout << "Enter the number of multiples= ";
cin >> n;
cout << ... | ALGO | 0.996668 | 4.420374 |
785dc185-2386-4de3-900a-867b68bcfb5c | egg53231323/essentia_vs | essentia/algorithms/filters/dcremoval.cpp | #include "dcremoval.h"
#include "essentiamath.h"
using namespace essentia;
using namespace standard;
using namespace std;
const char* DCRemoval::name = "DCRemoval";
const char* DCRemoval::category = "Filters";
const char* DCRemoval::description = DOC("This algorithm removes the DC offset from a signal using a 1st ord... | TOOL | 0.94483 | 5.175868 |
40806d0b-efe7-4f29-8c56-9364315a49ca | pluttan/KelVin | KelVinSTRIP/src/mode/2/rainbow.cpp | #include "rainbow.h"
void mode_rainbow(int step,
int del,
int led,
int saturation,
int brighness)
{
static int current = 0;
current++;
int currentHue = (current % 256) * 1000;
for (int i = 0; i < led; i++)
{
leds[i] = C... | TOOL | 0.903108 | 3.475396 |
393527ad-15d8-42c4-ab1e-a80ddb5404de | arunyerram/CRACKYPURINTERNSHIP-CRACKYOURPLACEMENT | .history/Productarraypuzzle_20240725093139.cpp | class Solution{
public:
// nums: given vector
// return the Product vector P that hold product except self at each index
vector<long long int> productExceptSelf(vector<long long int>& nums, int n) {
//code here
vector<long long int>ans;
long long int tot=1,t=1,c=0;
... | ALGO | 0.99998 | 5.472773 |
7511c9c7-860d-4953-9e97-766d6040c030 | bhattarai-aavash/Distributed_Project | KeyDB_1/src/defrag.cpp | #include "server.h"
#include <time.h>
#include <assert.h>
#include <stddef.h>
#ifdef HAVE_DEFRAG
/* this method was added to jemalloc in order to help us understand which
* pointers are worthwhile moving and which aren't */
extern "C" int je_get_defrag_hint(void* ptr);
/* forward declarations*/
void defragDictBucke... | TOOL | 0.965656 | 6.327955 |
5d382859-cde5-4c0b-b53f-cf8f2ac083a2 | r4k0nb4k0n/Programming-Challenges | Baekjoon/2750.cpp | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> v;
int N;
scanf("%d", &N);
for (int i = 0; i < N;i++)
{
int temp;
scanf("%d", &temp);
v.push_back(temp);
}
sort(v.begin(), v.end());
for (int i = 0; i < N; i++)
printf("%d\n", v[i]);
return 0;
}
| ALGO | 0.999955 | 3.885262 |
8bc65d65-c185-4e10-9afd-f650d32a7d9e | BhuvanSharma02/Summer_School | max_consecutive2.cpp | #include<bits/stdc++.h>
using namespace std;
int findMaxConsecutiveOnes(vector<int>& nums) {
// int arr[6];
// int size = sizeof() / sizeof(arr[0]);
int max_sum = 0;
int current_sum = 0;
for (int i = 0; i < nums.size(); i++) {
if (nums[i] == 1) {
current_sum = current_sum + nums[i];
if (c... | ALGO | 0.999963 | 4.786854 |
d1078649-8bb1-40fa-a304-fe6277f755ec | sjulier/Refactored_ORB_SLAM2 | Source/ThirdParty/DBoW2/DBoW2-local/src/FSurf64.cpp | #include <vector>
#include <string>
#include <sstream>
#include "FClass.h"
#include "FSurf64.h"
using namespace std;
namespace DBoW2 {
// --------------------------------------------------------------------------
void FSurf64::meanValue(const std::vector<FSurf64::pDescriptor> &descriptors,
FSurf64::TDescriptor ... | TOOL | 0.942541 | 6.093814 |
76bd4ae5-1582-4dd4-8774-653ed404e6c4 | isangyoon-zz/BOJ | 2741.cpp | #include <cstdio>
int N;
int main(int const argc, char const** argv)
{
scanf("%d", &N);
for (int i = 1; i <= N; printf("%d\n", i++));
return 0;
}
| ALGO | 0.984596 | 3.959374 |
b6d3ffb6-c7d8-49c5-ae18-866079925051 | karunroyal94/demo | packages/rol/example/putting/example_01.cpp | /*! \file example_01.cpp
\brief Shows how to solve a golf putting control problem.
*/
#include "example_01.hpp"
typedef double RealT;
int main(int argc, char *argv[]) {
Teuchos::GlobalMPISession mpiSession(&argc, &argv);
// This little trick lets us print to std::cout only if a (dummy) command-line argume... | ALGO | 0.999805 | 5.952888 |
4e62a59a-347c-46d3-896c-1e2ae3e5b36f | cryptobiu/MPCHonestMajority | ArithmeticCircuit.cpp | #include "ArithmeticCircuit.h"
#include <fstream> // std::ifstream
ArithmeticCircuit::ArithmeticCircuit()
{
}
ArithmeticCircuit::ArithmeticCircuit(int i)
{
// vector<TGate> gates;
gates.resize(14);
TGate p1;
p1.gateType = INPUT;
p1.party = 1;
p1.input1 = -1;
p1.input2 = -1;
p1.out... | ALGO | 0.897075 | 3.132491 |
a56fee14-7035-410f-8cac-7aa869b52e6d | hoosong0235/acmicpc | CLASS 1/CLASS 1/1008.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
cout.precision(10);
double a, b; cin >> a >> b; cout << a / b;
} | ALGO | 0.967383 | 3.367442 |
5b6b53f9-71fc-4ff6-8867-128d47e8ba44 | hank891008/LeetCode | 3430-count-days-without-meetings/3430-count-days-without-meetings.cpp | class Solution {
public:
int countDays(int days, vector<vector<int>>& meetings) {
int ans = 0, last = 0;
sort(meetings.begin(), meetings.end());
for(auto& meeting: meetings){
int s = meeting[0], e = meeting[1];
if(s > last + 1) {
ans += s - (last + 1);... | ALGO | 0.999964 | 5.697749 |
13a5a78a-a776-4b85-84d4-4a5a694a5a37 | liuxueyang/cpp | codeforces/problemset/1459b.cpp | // Date: Mon Dec 18 21:31:45 2023
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | ALGO | 0.999803 | 4.63438 |
6afcc9b3-bf80-4271-b32f-d40ef981ce26 | Sefayet-Alam/New-CP-submissions_vol_3 | D_Effects_of_Anti_Pimples.cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// VVI
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define SZ(a)... | ALGO | 0.999989 | 4.532858 |
cb5516f6-bd37-42dc-84d6-9040088d46a2 | shelltdf/osgall | prebuild/cgal-master/Triangulation_3/test/Triangulation_3/test_Triangulation_with_transform_iterator.cpp | #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Triangulation_3.h>
#include <CGAL/Triangulation_vertex_base_with_info_3.h>
#include <CGAL/boost/iterator/transform_iterator.hpp>
#include <vector>
#include <cassert>
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
t... | ALGO | 0.972497 | 6.551245 |
2d6f4f64-d0a5-4c7e-ae07-416a9766ac5d | hjiang13/LLMs-in-IR | POJ-104/100/369.cpp | #include <iostream>
using namespace std;
void main()
{
char str[301],a[26]={
97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122}
;
int i,b[26]={
0}
,num=0,j;
gets(str);
for(i=0; str[i]!='\0'; i++)
{
if(str[i]>='a'&&str[i]<='z')
num++;
for(j=0; j<26; j++)
if(str[i]==a[j]... | ALGO | 0.999973 | 3.127444 |
568a1f0e-0dde-49a6-93fa-b7bfb3faa0c7 | wizardkeven/Guokai-Path-Planning-Project | src/Eigen-3.3/unsupported/doc/examples/EulerAngles.cpp | #include <unsupported/Eigen/EulerAngles>
#include <iostream>
using namespace Eigen;
int main()
{
// A common Euler system by many armies around the world,
// where the first one is the azimuth(the angle from the north -
// the same angle that is show in compass)
// and the second one is elevation(the angl... | ALGO | 0.989945 | 5.125681 |
d83a9b39-d4da-4f35-a98e-b6b37828c5ff | ishandutta2007/codeforces | aryanc403/normal/1178/D.cpp | /*
Warn - Don't change next line else you will get WA verdict. Online Judge is configured to give WA if next line is not present.
"An ideal problem has no test data."
Author - Aryan Choudhary (@aryanc403)
*/
#pragma warning(disable:4996)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize ("Ofast")
... | ALGO | 0.999564 | 3.696653 |
3fbd5421-3011-4793-8367-ab275034d297 | shahakash28/mPSI-TableOPPRF | thirdparty/win/miracl/miracl_osmt/source/curve/polymod.cpp | /*
* C++ class to implement a polynomial type and to allow
* arithmetic on polynomials whose elements are from
* the finite field mod p.
*
* WARNING: This class has been cobbled together for a specific use with
* the MIRACL library. It is not complete, and may not work in other
* applications
*
* This type ... | TOOL | 0.998596 | 6.173802 |
081079fd-952f-487d-b225-9debb0f9d9d8 | shammo18/Sports-Programming | doorframes.cpp | //Bismillahir Rahmanir Rahim
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#d... | ALGO | 0.999977 | 3.575903 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.