uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
3addd485-8ef0-484a-a6ee-6f0fdd175c53 | theayushkaul/Data-Structures-and-Algorithms | Dynamic Programming/2D DP/EditDistance.cpp | #include<bits/stdc++.h>
using namespace std;
class Solution {
int solve(string word1, string word2, int i, int j) {
// If we reach the end of word1, return the number of characters remaining in word2
if (i == word1.length()) {
return word2.length() - j;
}
// If we reach ... | ALGO | 0.999988 | 5.633707 |
3b490f90-a17e-4182-a2a1-e4ea39f1b8f8 | SYSU-PlayDroneSquad/sysu_playDrone_ws | src/geographiclib/dotnet/examples/ManagedCPP/example-Rhumb.cpp | using namespace System;
using namespace NETGeographicLib;
int main(array<System::String ^> ^/*args*/
)
{
try {
Rhumb^ rhumb = gcnew Rhumb(Constants::WGS84::MajorRadius, Constants::WGS84::Flattening, true);
// Alternatively: const Rhumb& rhumb = Rhumb::WGS84();
{
// Sample direct calculation, travel... | ALGO | 0.998111 | 4.907689 |
d4d3e2b5-8405-4fd5-839e-f906c5a71444 | abhirup-dev/dsa-practise | Day16/DijkstraArHoloNa.cpp | #include <queue>
#include <climits>
#include <iostream>
using namespace std;
using pii = pair<int, int>;
using vii = vector<pii>;
using vi = vector<int>;
using vvi = vector<vi>;
void printDP(int dp[], int N, string user) {
cout << user << "\n";
for (int i = 0; i < N; ++i)
{
cout << i << "->" << (... | ALGO | 0.99997 | 4.41977 |
11a1f96f-0a2b-4579-a0dd-00b58ce8611f | alisonssns/Exercicios-BeeCrowd-CPP | 2 - Condicionais/TesteSelecao.cpp | #include <stdio.h>
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int A, B, C, D, soma;
cin >> A >> B >> C >> D;
if (B > C && D > A && (A + B) < (C + D) && C > 0 && D > 0 && (A % 2) == 0)
{
cout << "Valores aceitos" << endl;
}
else
{
cout << "Valore... | ALGO | 0.999751 | 3.106404 |
15db1a11-2fb8-4a7e-82d0-563c5284724e | HamadaMohamed1/Problem_Solving_And_Projects_cpp | Level 4/Problem9/Problem 9.cpp | /*
* Problem #9
* Write a program to print year calender
*/
#include <iostream>
#include <string>
using namespace std;
int ReadNumber(string message)
{
int num;
cout << message << endl;
cin >> num;
return num;
}
string NumberToText(int number)
{
if (number == 0)
{
return "";
}
... | TOOL | 0.993773 | 4.809813 |
9d9176bc-1f36-4376-9000-60759de1f983 | cztchoice/crashfix | crashfix_service/libdumper/Misc.cpp | #include "stdafx.h"
#include "Misc.h"
#include "strconv.h"
#include "md5.h"
double microtime()
{
#ifdef _WIN32
return GetTickCount();
#else
struct timeval tv;
struct timezone tz;
gettimeofday(&tv, &tz);
return (double)(tv.tv_sec)*1000+(double)(tv.tv_usec)/1000;
#endif
}
size_t GetMemoryUsage()
{
... | TOOL | 0.948926 | 4.662004 |
a355425c-562a-4435-a743-f28a8ff38007 | nhnquang11/cs106b-wt22 | Practice Final Exam/Demos/HashFunction.cpp | /**
* The implementation of tabulation hashing provided here is based on an
* implementation by the legendary Kevin Gibbons when he was a TA for CS166
* in Spring 2016. Thanks, Kevin!
*/
#include "HashFunction.h"
#include "random.h"
#include <random>
#include <climits>
#include <array>
#include <cstdint>
namespace... | ALGO | 0.999569 | 7.336354 |
7222fa7e-73e2-454c-9d7b-6a5115cb7099 | khank080605/code-c | c01054.cpp | #include <stdio.h>
int tunt (int n){
int s = 0;
for (int i = 2; i * i <= n; i++) if (n%i == 0){
while (n%i == 0) {
s += i;
n /= i;
}
}
if (n != 1) s += n;
return s;
}
int main(){
int n;
scanf ("%d", &n);
int s = 0;
for (int i = 1; i <= n; i++){
int a;
scanf ("%d", &a);
s += tunt (a);
}
prin... | ALGO | 0.999952 | 3.542681 |
bff6cbcb-13a6-4071-bd30-d5474dce7f39 | XanderHayhoe/Leetcode | 80. Remove Duplicates from Sorted Array II.cpp | class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if (nums.size() <= 2) {
return nums.size();
}
int new_length = 2;
for (int i = 2; i < nums.size(); ++i) {
if (nums[i] != nums[new_length - 2]) {
nums[new_length] = nums[i];
new_length++;
}
... | ALGO | 0.999877 | 6.537211 |
81c756b8-b0a6-46ce-866a-1ee8374d6c0f | alulu-zh/software | boost_1_70_0/libs/numeric/ublas/doc/samples/vector_binary_redux.cpp | #include <boost/numeric/ublas/vector.hpp>
int main () {
using namespace boost::numeric::ublas;
vector<double> v1 (3), v2 (3);
for (unsigned i = 0; i < (std::min) (v1.size (), v2.size ()); ++ i)
v1 (i) = v2 (i) = i;
std::cout << inner_prod (v1, v2) << std::endl;
}
| ALGO | 0.998345 | 3.969631 |
a6363828-a7dc-4440-9d63-b5f94d511450 | alexandraback/datacollection | solutions_5639104758808576_0/C++/TeaPot/A.cpp | #include <cstdio>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <ctime>
#include <cstring>
#include <cassert>
#include <bitset>
#include <sstream>
#include <queue>
#define pb push_back
#define mp make_pair
#define fs first
#define s... | ALGO | 0.99925 | 3.99753 |
780819ff-aa5c-4d09-bc8a-e2962e575e86 | MuMuloveU/wanghu | 游戏源码/客户端组件/6.6诈金花/游戏服务器/GameLogic.cpp | #include "StdAfx.h"
#include "GameLogic.h"
//////////////////////////////////////////////////////////////////////////
//˿
BYTE CGameLogic::m_cbCardListData[52]=
{
0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09,0x0A,0x0B,0x0C,0x0D, // A - K
0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18,0x19,0x1A,0x1B,0x1C,0x1D, //÷ A - K
0... | TOOL | 0.932695 | 3.893715 |
44ff8b61-f488-440d-86b2-d1a3b43a3e0e | KR-EGOIST/Baekjoon-Algorithm | 입출력과 사칙연산/10998.cpp | #include<iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b;
return 0;
}
| ALGO | 0.961307 | 3.734437 |
50ff5a79-3aea-4803-9384-4acaa27fc8c8 | Lithe-Project/Lithe | src/P2p/NetNodeConfig.cpp | #include "NetNodeConfig.h"
#include <boost/utility/value_init.hpp>
#include <Common/Util.h>
#include "Common/CommandLine.h"
#include "Common/StringTools.h"
#include "crypto/crypto.h"
#include "CryptoNoteConfig.h"
namespace CryptoNote {
namespace {
const command_line::arg_descriptor<std::string> arg_p2p_bind_ip ... | CONFIG | 0.920341 | 6.651694 |
6e9c7615-3b5c-42f2-a6a1-c403398aa8d5 | iulian0512/android_spatialite | static_libs/geos-3.12.0/src/noding/snapround/MCIndexSnapRounder.cpp | #include <geos/noding/MCIndexNoder.h>
#include <geos/noding/snapround/MCIndexSnapRounder.h>
#include <geos/noding/snapround/HotPixel.h>
#include <geos/noding/IntersectionFinderAdder.h>
#include <geos/noding/NodingValidator.h>
#include <geos/geom/Coordinate.h>
#include <geos/geom/CoordinateSequence.h>
#include <vector>... | ALGO | 0.998797 | 6.793586 |
d666ddeb-68c9-4dfc-af97-b80d7e149233 | AndroidBBQ/android10 | frameworks/av/media/libstagefright/codecs/amrnb/common/src/l_shr_r.cpp | /*
Filename: /audio/gsm_amr/c/src/l_shr_r.c
------------------------------------------------------------------------------
REVISION HISTORY
Description: Created separate file for the L_shr_r function. Sync'ed up
with the current template and fixed tabs.
Description: Updated template. Changed function i... | ALGO | 0.99816 | 7.295126 |
46686d9e-88b7-433b-9079-82c2d8adf8c3 | UdaySharmaGitHub/DSA-CPP | GFG/School Problems/Simple_interest.cpp | /*
Given three integers P,R and T, denoting Principal, Rate of Interest and
Time period respectively.Compute the simple Interest.
Your Task:
You don't need to read input or print anything.
Your Task is to complete the function simpleInterest()
which takes three integers P,R and T and returns the simple interest.
Exp... | ALGO | 0.987457 | 5.108519 |
436bc134-2007-4d27-9410-bb8ede28f563 | piyushsachdeva/Dotnet | snippets/cpp/VS_Snippets_CLR/List`1_SortSearchComparerRange/cpp/source.cpp | // REDMOND\glennha
// <Snippet1>
using namespace System;
using namespace System::Collections::Generic;
public ref class DinoComparer: IComparer<String^>
{
public:
virtual int Compare(String^ x, String^ y)
{
if (x == nullptr)
{
if (y == nullptr)
{
// If x ... | ALGO | 0.996496 | 5.94502 |
d6774757-380f-4e18-9668-94fe12d9e75e | VeggieOrz/Algorithm-Practice | leetcode/lwh/Daily_075 颜色分类.cpp | /*
* 题目：75. 颜色分类
* 链接：https://leetcode-cn.com/problems/sort-colors/
* 知识点：双指针
*/
class Solution {
public:
void sortColors(vector<int>& nums) {
int n = nums.size();
int p0 = 0, p2 = n - 1;
for (int i = 0; i <= p2; i++) {
// 要先处理 2，因为交换玩完之后可能那个位置是0，需要后续处理
while (i ... | ALGO | 0.999896 | 6.033435 |
25590cd3-675f-4aee-ba03-82f2bb4dc0d1 | steveliu121/vstream | openlib/fdk-aac/libSBRdec/src/arm/lpp_tran_arm.cpp | /* -----------------------------------------------------------------------------
Software License for The Fraunhofer FDK AAC Codec Library for Android
© Copyright 1995 - 2018 Fraunhofer-Gesellschaft zur Förderung der angewandten
Forschung e.V. All rights reserved.
1. INTRODUCTION
The Fraunhofer FDK AAC Codec Lib... | ALGO | 0.99762 | 6.753243 |
0954e3f2-076d-44f0-ab27-95e50c90209a | elvispy/PESolutions | Trash/lista2.cpp | /*Escribir un programa que permita cargar un valor numerico entero
en una Estructura de datos tipo Lista.
Crear un menu que permita insertar nodos
Borrar Nodos y
Visualizar los datos de la Lista.*/
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
typedef struct elemento{ int x;} ELEMENTO;
typedef struct list... | TOOL | 0.987165 | 3.194638 |
7842a2c0-f2bf-489b-9f8f-ec052c207613 | oscarduqueK/Entidlamente | 1o inCurso/sorting.cpp | #include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int posMin(const vector<int>& v, int left, int right) //for selection sort
{
int pos = left;
for (int i = left + 1; i <= right; ++i)
{
if (v[i] < v[pos])
pos = i;
}
return pos;
}
void selectionSort(vector<int>& v)
{
int last = v... | ALGO | 0.999685 | 4.240448 |
ca7cff51-e1cc-4d6d-beb0-2c7e811841d1 | Capzera/Cpp | LGOJ/P2622.cpp | #include <bits/stdc++.h>
using namespace std;
long long n, m, dp[1 << 10], a[101][10], vis[1 << 10];
int bfs() {
queue<pair<int, int> > q;
q.push({(1 << n) - 1, 0});
vis[(1 << n) - 1] = 1;
while (q.size()) {
int u = q.front().first, step = q.front().second; q.pop();
if (!u) return step;
for (int i = 0; i < m;... | ALGO | 0.999989 | 4.011966 |
919cf2e8-91b0-4553-9d59-3f6dfb318dbc | KrithikaPadmashali/StriversA2Z | prefix_sum/static_range_sum.cpp | //question: https://judge.yosupo.jp/problem/static_range_sum
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,q;
cin>>n>>q;
vector<int> arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
}
vector<long long > prefix_sum(n+1,0);
for(int i=1;i<=n;i++){
prefix_sum[i]=prefix_sum[i-1]+arr[i-1];... | ALGO | 0.999943 | 5.198368 |
eb7d37b6-3733-4fa0-a70e-34aeeeb3c26e | hztttt/Synergistic_Optimization | lammps_DeepSPIN/src/SCAFACOS/scafacos.cpp | /* ----------------------------------------------------------------------
Contributing author: Rene Halver (JSC)
------------------------------------------------------------------------- */
#include "scafacos.h"
#include "atom.h"
#include "comm.h"
#include "domain.h"
#include "error.h"
#include "force.h"
#include ... | ALGO | 0.985486 | 6.246838 |
0d7c1c81-31db-4746-be57-01e5126dd4a3 | Abhishekkkkkkkkkkk/100DaysofLearningChallange | DAY40/DSA/Pointer1.cpp | #include<iostream>
using namespace std;
int main(){
/*
int arr[10] = {23,122,41,67};
cout << "Address of First Memory Block is :- " << arr << endl;
cout << "Address of First Memory Block is :- " << &arr[0] << endl;
cout << "*arr is :- " << *arr << endl;
cout << "*arr+1 is :- " << *arr + 1 << endl;... | ALGO | 0.977695 | 3.074318 |
c9d7cf92-9a7c-4e93-96d3-5d7c21e559a0 | prakashpandey16/coding | c++/Basic of C++/areaofcircle.cpp | #include<iostream>
using namespace std;
int main()
{
float r, area,pi;
pi =3.14;
r = 10;
area = pi*r*r;
cout << area ;
} | ALGO | 0.997269 | 3.224502 |
a8b826fc-0159-49d5-baa5-8017d61f83f9 | delwar03/CF | C_Johnny_and_Another_Rating_Drop.cpp | #include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int mod = 1e9 + 7;
const int N = 3e5 + 10;
const int INF = 1e15 + 10;
void solve() {
int n; cin>>n;
int ans = 0, val = 1, ind = 0;
while(n) {
if(n & 1)
ans += val;
val = 2 * ... | ALGO | 0.999923 | 4.225813 |
ade79c1e-b72c-4664-985a-ef18af7df435 | beanthemoonman/School-Year-2012-2013 | comp-eng/XCel/main.cpp | #include <iostream>
#include <string>
#include <sstream>
int setpos(int, int);
std::string toString(int );
int partition(int* ,int ,int );
void quicksort(int* ,int ,int );
void reverse(int* , int , int );
int main(){
char c;
const int X = 28;
const int LENGTH = 10;
std::string error = "non... | ALGO | 0.991441 | 3.452367 |
6a20fa6a-cf55-429e-bbdb-b09a554706b3 | openjdk/jdk11u-dev | src/hotspot/share/gc/g1/g1ConcurrentMark.cpp | #include "precompiled.hpp"
#include "classfile/metadataOnStackMark.hpp"
#include "classfile/symbolTable.hpp"
#include "code/codeCache.hpp"
#include "gc/g1/g1BarrierSet.hpp"
#include "gc/g1/g1CollectedHeap.inline.hpp"
#include "gc/g1/g1CollectorState.hpp"
#include "gc/g1/g1ConcurrentMark.inline.hpp"
#include "gc/g1/g1Co... | TOOL | 0.851434 | 3.946296 |
292df90e-b1ec-4e21-a932-49fd3f7a3e79 | astraizer/algoFJ | Soal/Day 2/L.cpp | #include <stdio.h>
int main(){
int t;
scanf("%d",&t);
for(int tc=0;tc<t;tc++){
int n,m;
scanf("%d %d",&n,&m);
int l[n];
int min=0;
int range=1000000;
for(int i=0;i<n;i++){
scanf("%d",&l[i]);
int res=(m>l[i])?m-l[i]:l[i]-m;
if(range>res){
range=res;
min=i;
}
}
min++;
printf("Cas... | ALGO | 0.999949 | 3.331177 |
674e24bd-6548-45eb-996b-82ebbe8ea1aa | khbminus/code2020 | tinkoff/2020/data_structures2/l1.cpp | #include <cstdio>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
const int MAXA = 3000000;
const int MAXN = 100000;
const int MAXLOG = 22;
const long long COST = 1000 * 1000 * 1000;
long long dp[MAXA];
int l[MAXN], r[MAXN], c[MAXN];
int p[MAXA];
int mv[MAXA];
int rk[MAXA];
int A;
... | ALGO | 0.998748 | 3.576807 |
ab52d45d-74fd-47e2-b63c-d4b642769eff | NextGenPiyush/Graph-Theory | Advance_topics/hamiltonian_path.cpp | #include<bits/stdc++.h>
using namespace std;
bool check(int n, int m, vector<vector<int>> &edges);
bool dfs(int node, vector<vector<int>> &adj, vector<bool> &visited, int &count, int n);
int main(){
return 0;
}
bool check(int n, int m, vector<vector<int>> &edges){
vector<vector<int>> adj(n);
for(int i=0... | ALGO | 0.999923 | 5.054296 |
8723620f-844f-48ca-a9a7-3f1b5439b357 | vitspot/leetcode-daily | 2021/september/day-24/solution1.cpp | class Solution {
public:
int tribonacci(int n) {
int trib[39];
trib[0]=0;
trib[1]=1;
trib[2]=1;
for(int i=3;i<=n;i++)
{
trib[i]=trib[i-1]+trib[i-2]+trib[i-3];
}
return trib[n];
}
}; | ALGO | 0.999966 | 5.900002 |
bb9c291b-4fde-4b62-9571-5577cc066588 | LuisEnilton/Maratona | AtCoder/Library Practice Contest/a.cpp | //
// Created by Luis on 17/11/2023.
//
//Template By eduardocesb
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <cmath>
#define optimize ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define INF 1000000010
#define INFLL 1000000000000000010LL... | ALGO | 0.999689 | 5.264414 |
3fe25b49-360c-4639-926a-9f5f59b2ed10 | Priyranjankr/DSA-Practice-Code-Priyranjan | 5Linked List/TakeInput.cpp | #include <iostream>
using namespace std;
#include "Node.cpp"
Node *takeInput()
{
cout << "In Input Function: " << endl;
int data;
cin >> data;
Node *head = NULL;
// optimasized
Node *tail = NULL;
// temparory method -1 data nhi daal payege
while (data != -1)
{
Node *newNod... | ALGO | 0.998658 | 4.758944 |
1586c9cd-d494-4092-9743-a8ff0e0c9a24 | ishandutta2007/codeforces | mohammedehab2002/normal/825/D.cpp | #include <iostream>
#include <algorithm>
using namespace std;
int cnt[27][2],x;
void go()
{
while (x<26 && cnt[x][0]>=0)
x++;
if (x==26)
{
x=0;
for (int i=0;i<26;i++)
cnt[i][0]-=cnt[i][1];
go();
}
}
int main()
{
string s,t;
cin >> s >> t;
for (int i=0;i<s.size();i++)
{
if (s[i]!='?')
cnt[s[i]-'a'][... | ALGO | 0.999988 | 3.410767 |
4fd6377e-2319-4cae-906f-76cf9a1fe61e | guptaanmol184/OOAD-LAB-2017 | lab5/extra_stuff/INCLUDE/Implementation/swap.cpp | /*swap two numbers by passing PARAMETER as REFERENCES
using temporary variable
Input: two integer pointers*/
void swap_TEMP(int *a,int *b)
{
int temp;
temp=*b;
*b=*a;
*a=temp;
}
/*swap two FLOATING numbers by passing PARAMETER as REFERENCES
using temporary variable
Input: two float type pointers*/
void swap_TEMP(f... | ALGO | 0.998861 | 3.918852 |
2466fa37-f6dd-4036-903f-79dcc4d3bfc7 | cyt9772/CodingTest | P15988.cpp | #include<iostream>
#include<stdio.h>
using namespace std;
long long d15988[1000001];
#define MOD15988 1000000009
int P15988() {
int T, n;
cin >> T;
for (int i = 0; i < T; i++) {
cin >> n;
d15988[0] = 1;
d15988[1] = 1;
d15988[2] = 2;
d15988[3] = 4;
for (int j = 4; j <= n; j++) {
if (d15988[j]) conti... | ALGO | 0.999901 | 4.102859 |
d16462f4-8db5-4000-8e68-bdef92210856 | SamkitSanghvi/Coding | Recursion/MergeSort.cpp | // KK
// Merge Sort
// Divide array into 2 parts
// Get both part sorted via recurison
// merge two sorted arrays
// At every level n elements are merget (nlogn)
#include<bits/stdc++.h>
using namespace std;
vector<int> mergeee(vector<int> left,vector<int> right){
vector<int> ans(left.size()+right.size());
in... | ALGO | 0.999986 | 4.276361 |
abdf40fe-b0eb-4a51-a933-a1d56a0f14a2 | heyhooman/0xDSA | striver/step1/1.2/pattern7.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
void printTriangle(int n) {
for(int i=1; i<n+1; i++){
for(int x= n-i; x>0; x--){
cout<<" ";
}
for( int y = 2*i -1; y>0... | ALGO | 0.999858 | 5.93169 |
48fbf28c-a6ce-477c-9a9b-ec9e5fa52d85 | raincross7/code-similarity | codes/train_code/problem033/problem033_394.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i < (n);i++)
typedef long long ll;
int main(){
while(true){
int n;
long ans = 100000000000;
cin >> n;
if(n == 0)return 0;
vector<int > a(n);
rep(i,n)cin >> a[i];
rep(i,n){
... | ALGO | 0.999927 | 3.646014 |
cc1aad87-704e-43d3-a1f0-ef64dfb21a8d | Mohamed-Hossam/Problem-Solving | codeforces/272-C/272-C-11988061.cpp | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<iterator>
#include<cmath>
#include<string>
#include<sstream>
#include<cstring>
#include<ctype.h>
#include<iomanip>
#include<functional>
#include<bitset>
#include<s... | ALGO | 0.999968 | 4.114909 |
564e7655-1841-43be-8da6-e5964fb31dac | thomasmarsh/ODE | ode/demo/demo_chain2.cpp | /* exercise the C++ interface */
#include <ode/ode.h>
#include <drawstuff/drawstuff.h>
#include "texturepath.h"
#ifdef _MSC_VER
#pragma warning(disable:4244 4305) // for VC++, no precision loss complaints
#endif
// select correct drawing functions
#ifdef dDOUBLE
#define dsDrawBox dsDrawBoxD
#define dsDrawSphere ds... | ALGO | 0.948934 | 5.421312 |
5143a565-2063-4654-a18d-3fd9f40a763a | iceyfighting/CS_Basics | Basics/algorithm/interviewCode/byteDance/noteOne/isLand/count_isLand.cpp | #include<iostream>
#include<string.h>
using namespace std;
#define cols 5
#define rows 5
class Solution{
public:
int isLandCore(int Land[][cols],int row,int col,int visited[][cols], bool & flag)
{
int a[4];
int result = 0;
memset(a,0,4*sizeof(int));
... | ALGO | 0.99988 | 4.63979 |
0b945f88-6d58-49ab-99fc-feda294ee148 | smmahadee/learn_c_cpp_dsa | 3.phitron_algorithm/module-6.0(dijkstra)/v2/2.dijkstra_effecient.cpp | #include <iostream>
#include <queue>
using namespace std;
vector<pair<int, int> > v[20];
int dis[20];
class cmp {
public:
bool operator()(pair<int, int> a, pair<int, int> b) {
return a.second > b.second;
}
};
void dijkstra(int src) {
priority_queue<pair<int, int>, vector<pair<int, int> >, cmp... | ALGO | 0.999918 | 4.144171 |
bda8fec4-1606-47ec-b599-769f9b516f84 | urcs-sync/Montage | ext/mod-single-repo/nvm_malloc/ulib-svn/test/median.cpp | #include <time.h>
#include <stdio.h>
#include <assert.h>
#include <algorithm>
#include <ulib/sort_median_prot.h>
#define LESSTHAN(x, y) (*(x) < *(y))
DEFINE_MEDIAN(test, int, LESSTHAN);
int main()
{
srand((int)time(0));
for (int j = 0; j < 100; ++j) {
int ne = rand() % 67321 + 1;
int k = rand() % ne;
int m;... | ALGO | 0.992074 | 4.898997 |
54566af1-0682-4e5a-8dc8-98b0c50d709f | orionGGG/leetcode | 删除排序数组中的重复项.cpp | #include<iostream>
#include<vector>
#include<string>
#include<sstream>
using namespace std;
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if (nums.size() == 0) return 0;
int i = 0;
for (int j = 1; j < nums.size(); j++) {
if (nums[j] != nums[i]) {
i++;
nums[i] = nums[j];
}
}... | ALGO | 0.999797 | 6.129932 |
c99949ca-e693-4e26-97c3-912b58528316 | rajprem4214/LeetCode | 2594-minimum-time-to-repair-cars/2594-minimum-time-to-repair-cars.cpp | #define ll long long
class Solution {
public:
long long repairCars(vector<int>& ranks, int cars) {
long long lo=0, hi=1e14;
while( lo<hi ){
ll mid=(lo+hi)/2;
ll count=0;
for(int i=0;i<ranks.size();i++){
count+=sqrt(mid / ranks[i]);
}
... | ALGO | 0.999981 | 5.602305 |
2638934e-2f6b-4d1d-b5d4-b4135402f47f | thegamer1907/Code_Analysis | contest/1542591004.cpp | #include <bits/stdc++.h>
using namespace std;
char pw[4];
char word[100][4];
int main(){
scanf("%s",pw);
// cout<<"Aaaa"<<endl;
int n;
scanf("%d",&n);
int flag = 0;
for(int i=1;i<=n;i++){
scanf("%s",word[i]);
if(word[i][0]==pw[0] && word[i][1]==pw[1]) flag = 1;
}
if(!flag){
int fir = 0,sec ... | ALGO | 0.999898 | 3.413157 |
03ac5007-0c74-43f1-b40e-9076ddd0bcb6 | charaneadam/cp | codeforces/D3_605_C_YetAnotherBrokenKeyboard.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k,ans,tmp;
cin >> n >> k;
string s;
cin >> s;
s += '#';
set<char> st;
for(int i=0; i<k; i++){
char c;
cin >> c;
st.insert(c);
}
ans = tmp = 0;
for(auto c : s){
if(st.find(c) == ... | ALGO | 0.999914 | 3.496845 |
e5b78aa5-195b-4de2-b851-7f28732fe232 | liwei2088/oi | 一本通/01基础语法/05数组/0503字符类型和字符数组/1139.cpp | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
string s;
int n;
int main() {
cin >> n;
while (n--) {
cin >> s;
transform(s.begin(), s.end(), s.begin(), ::tolower);
if (s[0] >= 'a' && s[0] <= 'z') s[0] -= 32;
cout << s << endl;
}
return 0;... | ALGO | 0.999546 | 4.478735 |
a263359d-e411-49f2-a5f6-2ea64a6d5687 | TonChan0828/AtCoder | ABC/ABC116/A.cpp | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
template <typename T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b; // aをbで更新
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b) {
if (a > b) {
a... | ALGO | 0.999904 | 5.212386 |
f6301e4a-fc07-425a-bc1e-249a5b802a8e | downingstreet/BitchX1.2 | dll/europa/cse476/lexicon.cpp | #include <iostream.h>
#include <fstream.h>
#include "lexicon.h"
// ---------------------------------------------------------------------------
// Class Implementation: Lexicon
// ---------------------------------------------------------------------------
Lexicon::Lexicon(char *fileName) {
char buffer[1000];
ifstre... | TOOL | 0.968161 | 5.122208 |
f88ac05b-a038-4f53-8355-3081c6ee57fb | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_11046_5.cpp | #include <bits/stdc++.h>
using namespace std;
bool chk(vector<int>& s1, vector<int>& s2, int sz) {
int c = 0;
for (int i = 0; i < 27; i++) {
if ((s1[i] + s2[i]) % 2 != 0) c += 1;
}
if (c == 0) return true;
if (c > 1) return false;
if (c == 1) {
if (sz % 2 != 0)
return true;
else
retu... | ALGO | 0.999972 | 4.216408 |
2095cd5a-e63d-463d-bc4f-bb7f069fe853 | cal-cs184-student/p4-clothsim-sp23-vwu-tyang | ext/nanogui/ext/eigen/doc/examples/tut_arithmetic_matrix_mul.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
Matrix2d mat;
mat << 1, 2,
3, 4;
Vector2d u(-1,1), v(2,0);
std::cout << "Here is mat*mat:\n" << mat*mat << std::endl;
std::cout << "Here is mat*u:\n" << mat*u << std::endl;
std::cout << "Here is u^T*mat:\n" << u.transpo... | ALGO | 0.999312 | 3.818773 |
af5636f2-fdb4-4755-aa70-b015df643106 | LionsWrath/grafos-rework | dijkstra_map.cpp | #include <iostream>
#include <string>
#include <iomanip>
#include <vector>
#include <queue>
#include <functional>
#include <map>
#include <algorithm>
using namespace std;
#define WHITE 0;
#define MAXV 15
#define INF 99999
typedef pair<string, int> si;
typedef pair<int, string> is;
typedef multimap<string, si> msi;
... | ALGO | 0.999802 | 4.285944 |
4a61791e-c344-42ba-b4e8-42c436a5ff44 | LaLlorona/Algorithms | BOJ/0To5000/1600.cpp | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, pair<int, int> > piii;
const int MAX = 200;
const int INF = 987654321;
int height, width;
int max_horse_jump;
int dct_y[4] = {0, -1, 0, 1};
int dct_x[4] = {-1, 0, 1, 0};
int horse_y[8] = {-1, -2, -2, -1, 1, 2, 2, 1};
int horse_x[8] = {-2, -1, 1, 2, 2, 1... | ALGO | 0.9999 | 3.999548 |
2e5bb5ec-5c0c-41f0-ad94-ecae1ad54729 | virtual1008/ujjvalleetcodesolution | 1431-kids-with-the-greatest-number-of-candies/1431-kids-with-the-greatest-number-of-candies.cpp | class Solution {
public:
vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
int maxi=*max_element(candies.begin(),candies.end());
vector<bool> ans(candies.size(),false);
for(int i=0;i<candies.size();i++){
if(candies[i]+extraCandies>=maxi) ans[i]=true;
... | ALGO | 0.999948 | 5.866414 |
e4b4d201-b99b-49f8-b847-bea6f7692a8d | sh12250/JungAlgorithm | 프로그래머스/lv0/120811. 중앙값 구하기/중앙값 구하기.cpp | #include <string>
#include <vector>
using namespace std;
int solution(vector<int> array) {
for(int i = 0; i < array.size(); i++)
{
int left = 0;
int right = 0;
for(int j = 0; j < array.size(); j++)
{
if(array[i] > array[j])
{
left++;
... | ALGO | 0.999921 | 5.017375 |
1228455f-9322-4464-8f85-058199f3f4e3 | huzaifaawan699/Sorting_Algorithm | SelectionSort.cpp | #include<iostream>
using namespace std;
void selection(int arr[],int n){
for(int i=0;i<n-1;i++){
int min=i;
for(int j=i+1;j<n;j++){
if(arr[j]<arr[min]){
min=j;
}
}
int temp=arr[i];
arr[i]=arr[min];
arr[min]=temp;
}
}
int mai... | ALGO | 0.999982 | 4.689616 |
e4fb37dc-5a59-4321-92b2-afd9af957660 | Shailesh93602/potd | leetcode/2024/june/30/30.cpp | class Solution {
public:
int find(int a, vector<int> &root) {
if(root[a] != a) root[a] = find(root[a], root);
return root[a];
}
bool uni(int a, int b, vector<int> &root) {
int root1 = find(a, root);
int root2 = find(b, root);
if(root1 == root2) return false;
... | ALGO | 0.999819 | 5.195718 |
d981d0f2-ae49-4f0e-870e-665b8a62516d | ishandutta2007/codeforces | datastructures/normal/1140/B.cpp | #include <iostream>
#include <cstdio>
using namespace std;
int t,n,flag;
char a[105];
int main(){
// freopen("1140B.in","r",stdin);
// freopen("1140B.out","w",stdout);
cin>>t;
while(t--){
cin>>n;
int first=0,last=n;
for (int i=1;i<=n;i++)cin>>a[i];
for (int i=1;i<=n;i++)
if (a[i]=='<')first=i;
for (int... | ALGO | 0.999907 | 3.139458 |
b5d8c97a-dc26-4023-81a3-0530a2ed3d87 | VIDA-NYU/Segmentangling | Inviwo/modules/segmentangling/ext/qhull/src/user_eg3/user_eg3_r.cpp | #//! user_eg3_r.cpp -- Invoke rbox and qhull from C++
#include "libqhullcpp/RboxPoints.h"
#include "libqhullcpp/QhullError.h"
#include "libqhullcpp/QhullQh.h"
#include "libqhullcpp/QhullFacet.h"
#include "libqhullcpp/QhullFacetList.h"
#include "libqhullcpp/QhullLinkedList.h"
#include "libqhullcpp/QhullVertex.h"
#inclu... | ALGO | 0.965758 | 3.971461 |
5d97720f-951f-4c7d-9f04-e59c18a71005 | CoderXiaoLiu/-46-ICPC- | j.cpp | #include<bits/stdc++.h>
using namespace std;
int n[4],temp[4];
int Min;
void dfs(int start,int ans){
cout<<"start:"<<start<<" "<<ans<<endl;
for(int i=0;i<4;i++)
cout<<n[i]<<" ";
cout<<endl;
if(start>=4){
Min=min(Min,ans);
}
if(n[start]==0){
dfs(start+1,ans);
r... | ALGO | 0.999904 | 4.505851 |
09f9fe26-c06d-4c72-adb7-34842932c692 | redsimmba/Intern-Preparation-Material-Shared | Stack/Evaluate Expression.cpp | int Solution::evalRPN(vector<string> &v) {
stack<int> s;
unordered_map<string,int> map;
int n=v.size();
map["+"]=1;
map["-"]=2;
map["*"]=3;
map["/"]=4;
for(int i=0;i<n;i++){
if(map[v[i]]<=0){
s.push(stoi(v[i]));
}
else if(map[v[i]]>=1 && map[v[i]]<=4){... | ALGO | 0.99983 | 5.146673 |
ca473c7a-b536-47b4-b7a4-2897ae7e49a7 | jpatlewis/prophetTest | venv/lib/python3.6/site-packages/pystan/stan/lib/stan_math/lib/boost_1.66.0/libs/regex/src/fileiter.cpp | /*
* LOCATION: see http://www.boost.org for most recent version.
* FILE: fileiter.cpp
* VERSION: see <boost/version.hpp>
* DESCRIPTION: Implements file io primitives + directory searching for class boost::RegEx.
*/
#define BOOST_REGEX_SOURCE
#include <boost/config.hpp>
#include <climit... | TOOL | 0.923852 | 5.369689 |
6d172e3a-abb1-49f1-892d-baecdb7dd0a0 | Hazrat-Ali9/HackerRank-Problem-Solving | grid challenge.cpp | #include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
/*
* Complete the 'gridChallenge' function below.
*
* The function is expected to return a STRING.
* The function accepts STRING_ARRAY grid as parameter.
*/
string gridChallenge(vector<string> grid) {
... | ALGO | 0.999916 | 6.072286 |
182d0d57-14a9-4716-b0c4-28cb7b42f3ee | ITrickStar/GPU-CUDA | MatrixMultiplication_CUDA/MatrixMultiplication_CUDA/Utils.cpp | #include "Utils.h"
double AverageTime(std::vector<double> arr) {
double res = 0;
for (int i = 0; i < arr.size(); i++) res += arr[i];
return res / arr.size();
}
float* MatrixZeros(int M, int N) {
int size = M * N;
float* A = new float[size];
for (int i = 0; i < size; i++) A[i] = 0;
return A;
}
float*... | TOOL | 0.951606 | 4.110455 |
7f18b894-2aab-46b1-8718-580e64aa6558 | dvaitam/codeforces | 1000-1999/1800-1899/1800-1809/1804/solE.cpp | //AshrafSustS19
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
// #define LOCAL 1
#ifdef LOCAL
#include "C:\Users\Zadeed\Documents\AshrafSustS19\app_debug.cpp"
#else
#define debug(...)
#define debugArr(arr, n)
#endif
int n, m, np;
vector<int> adj;
vector<int> MEMadj;
vector<vector<int>> MEM... | ALGO | 0.999979 | 4.266425 |
b8f16af7-896a-401c-9bcd-7d7ea04e5a20 | Mrsandman327/windows-book-code-c- | C++标准库（第2版）/fo/lambda5.cpp | #include <functional>
#include <algorithm>
#include <vector>
#include <iostream>
#include <string>
using namespace std;
using namespace std::placeholders;
class Person
{
private:
string name;
public:
Person(const string& n) : name(n)
{
}
void print() const
{
cout << name << endl;
}
... | TOOL | 0.962949 | 6.473865 |
1d2f2a1e-5e43-415e-bf63-f822103da299 | EmonHira135923/XPSC-Club-05---Probleam-Solving | XPSC - 05 Probleam Solving Club/Week 14/Day 92/Day 96/Sliding_Window_Median.cpp | #include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define FASTIO ios::sync_with_stdio(false);cin.tie(nullptr);
#include<string.h>
#include<string>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T> using pbds = ... | ALGO | 0.999997 | 3.340773 |
8c08dd57-31f4-4c63-bb64-39f9baa99d0e | Aryaman028/LeetCode_Problems | 0120-triangle/0120-triangle.cpp | class Solution {
public:
// int memo(int row,int col , vector<vector<int>>&triangle,vector<vector<int>>&dp){
// if(row == triangle.size()-1)return dp[row][col] = triangle[row][col];
// if(dp[row][col]!=-1)return dp[row][col];
// int cur = triangle[row][col] + memo(row+1,col... | ALGO | 0.999989 | 6.357138 |
9af50b13-1f44-4eaf-a439-3870fa66c935 | ngthanhtrung23/CompetitiveProgramming | codeforces/284/A.cpp | #define _GLIBCXX_DEBUG
#include <sstream>
#include <iomanip>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <deque>
#include <complex>
#define ... | ALGO | 0.999371 | 3.511053 |
5de342c4-9163-42a8-a26a-2f477142ef90 | kunal-umich/Udacity-Path-Planning-Highway-Driving | src/Eigen-3.3/doc/examples/class_CwiseUnaryOp.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
// define a custom template unary functor
template<typename Scalar>
struct CwiseClampOp {
CwiseClampOp(const Scalar& inf, const Scalar& sup) : m_inf(inf), m_sup(sup) {}
const Scalar operator()(const Scalar& x) const { return x<m_... | ALGO | 0.915297 | 6.433227 |
ee3d29a1-7dc9-4f9c-a2a9-30508414447f | dekaaa115/2311102148_Muhammad-Deka-Maulana | Pertemuan04 - Circular dan Non Circular/Guided/guided2.cpp | #include <iostream>
using namespace std;
// Deklarasi Struct Node
struct Node{
string data;
Node* next;
};
Node* head, * tail, * baru, * bantu, * hapus;
//Inisialisasi node head & tail
void init(){
head = NULL;
tail = head;
}
//Pengecekan isi list
int isEmpty(){
if (head == NULL){
return... | ALGO | 0.988409 | 4.777015 |
68304c6d-ddbf-4282-b874-a60dd8f4c5ce | Raka-coder/algoritma-struktur-data | tests/sort_menu_test.cpp | #include <stdio.h>
#include <stdlib.h>
// Untuk menampilkan array
void printArray(int arr[], int size) {
for (int i = 0; i < size; i++) {
printf("%d ", arr[i]);
}
printf("\n");
}
// Untuk menukar dua elemen
void swap(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
}
// Bubble S... | ALGO | 0.999975 | 5.786069 |
1b16d9ab-c0af-453f-96bb-d7afaf2250a5 | SuperMousse/Interview | CodingInterview/18_01_DeleteNodeInList/DeleteNodeInList.cpp | void DeleteNode(ListNode** pListHead, ListNode *pToBeDeleted){
if (pListHead == nullptr || pToBeDeleted == nullptr) {
return;
}
//删除的不是头结点也不是尾结点
if (pToBeDeleted->next != nullptr) {
ListNode* pNext = pToBeDeleted->next;
pToBeDeleted->val = pNext->val;
pToBeDeleted->next = pNext->next;
delete pNext;
pNe... | ALGO | 0.996338 | 4.282876 |
889dfc80-f0ab-4a1f-9263-f7fac7a5e8be | demining/bitcoin-Google-Colab | src/crypto/chacha20.cpp | // Based on the public domain implementation 'merged' by D. J. Bernstein
// See https://cr.yp.to/chacha.html.
#include <crypto/common.h>
#include <crypto/chacha20.h>
#include <string.h>
constexpr static inline uint32_t rotl32(uint32_t v, int c) { return (v << c) | (v >> (32 - c)); }
#define QUARTERROUND(a,b,c,d) \
... | ALGO | 0.999152 | 7.167084 |
02fc91df-24cd-4c6a-a44f-ccc5fa10cace | xs-web-lyq/learning-algorithm | c-base/minN.cpp | #include <stdio.h>
int main(){
int sum = 0,count = 1;
for(;sum < 1000; count++){
// printf("%d",count);
sum += count;
}
printf("%d",count-1);
return 0;
}
| ALGO | 0.998323 | 3.153294 |
5ffc19af-907d-48b4-ac00-b30bf6eebe91 | aritra741/Competitive-Programming | Codeforces/Porcelain.cpp | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[110][110][110], dp2[110][10007], best[110][110];
int vis[110][110][110], vis2[110][10007], q[110];
int arr[110][110], row, n, m, p;
ll rec( int l, int r, int rem )
{
if( !rem or l>r )
return 0;
if( vis[l][r][rem]==p )
ret... | ALGO | 0.999935 | 3.237174 |
9f460073-98b0-43b3-a295-be94eb0513a4 | FalseG0d/Algorithm-Data-Structure | LeetCode/Medium/MaxAreaIsland.cpp | class Solution {
public:
int areaDFS(vector<vector<int>>& grid, int i, int j, int M, int N){
if(i < 0 || j < 0 || i == M || j == N) return 0;
if(grid[i][j] == 0) return 0;
grid[i][j] = 0;
return 1 + areaDFS(grid,i-1,j,M,N) + areaDFS(grid,i+1,j,M,N) + areaDF... | ALGO | 0.999969 | 6.433022 |
c2390f04-8b86-441e-9295-b0016ce9c3fe | aKiii017/SolSearch | implementation/z3/src/smt/seq_eq_solver.cpp | #include <typeinfo>
#include "ast/ast_pp.h"
#include "ast/ast_ll_pp.h"
#include "ast/ast_trail.h"
#include "ast/for_each_expr.h"
#include "smt/smt_context.h"
#include "smt/theory_seq.h"
#include "smt/theory_arith.h"
using namespace smt;
bool theory_seq::solve_eqs(unsigned i) {
bool change = false;
for (; !ctx... | ALGO | 0.998269 | 4.664839 |
3f83612c-c29d-408c-b97d-250780a52f84 | yzcmf/Interview | LeetCode-Solutions/C++/find-all-duplicates-in-an-array.cpp | // Time: O(n)
// Space: O(1)
class Solution {
public:
vector<int> findDuplicates(vector<int>& nums) {
vector<int> result;
for (const auto& i : nums) {
if (nums[abs(i) - 1] < 0) {
result.emplace_back(abs(i));
} else {
nums[abs(i) - 1] *= -1;
... | ALGO | 0.999993 | 6.336748 |
38c181b4-96df-49b8-9b83-ba6c2af8a352 | senilpolra/cpp | pro/Function/DA_S_F.cpp | #include <iostream>
using namespace std;
int diagonal()
{
int a[3][3],i,j,sum=0;
for ( i = 0; i < 3; i++)
{
for ( j = 0; j < 3; j++)
{
cout<<"\n Enter the Arry =a[][]";
cin>>a[i][j];
}
cout<<"\n";
}
for ( i = 0; i < 3; i++)
{
... | ALGO | 0.998455 | 3.705606 |
13065fce-da7c-445d-ab78-770bbc567e6b | dew2222/UVA-Solutions | alphabetical order.cpp | #include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
using namespace std;
main()
{
char name[20][30],temp[30];
int n,v,i,j;
printf("Give the number of names to sort\n");
scanf("%d",&n);
printf("Give the names one by one\n");
for(i=0;i<=n;i++)
gets(name[i]);
for(i=0;i<n;i++)
for(j=i+1;j<=n;j++)
{
... | ALGO | 0.999802 | 3.994749 |
5628f3b5-aaf4-437a-ba04-25ead2b6f839 | DanielBarcenas97/Cpp | 1.C++Basico/5.Arrays/arrays2.cpp | #include<iostream>
int main(){
int calificaciones[30];
float promedio = 0.0;
//Llenando el arreglo:
for(int i = 0; i < 30; i++)
for(int j = 8; j < 11; j++){
//Llenamos 3 espacios del arreglo en cada iteracion:
calificaciones[i] = j;
calificaciones[i+1] = j;
calificaciones[i+2] = j;
//Saltamos ... | ALGO | 0.9888 | 3.294885 |
2c0a356e-64c4-4147-b297-bafd21f43154 | C-2024-1-3/8209240219gaoyutong | 第三，四次实验报告/四2（1）.cpp | #include<iostream>
using namespace std;
int indexof(const char* s1, const char* s2)
{
int len_s1 = strlen(s1);
int len_s2 = strlen(s2);
int equal = 0;
for (int i = 0; i < len_s2; i++)
{
equal = 0;
if (s1[0] == s2[i] && len_s1 <= (len_s2 - i + 1))
{
equal++;
for (int j = 1; j < len_s1; j++)
{
i++... | ALGO | 0.999086 | 3.928798 |
a377853e-c079-4b71-828d-7152ae6f09db | kegalas/ACM-Learn | DataStructure/Tree/persistentSegTree/pst2.cpp | //可持久化线段树，区间修改、区间查询，操作复杂度logn
//hdu 4348
#include <iostream>
using LL = long long;
int const MAXV = 3e6+5;
int const MAXN = 1e5+5;
struct Node{
LL val, tag;
int ls, rs;
}st[MAXV];
inline int& ls(int x){return st[x].ls;}
inline int& rs(int x){return st[x].rs;}
inline LL& val(int x){return st[x].val;}
inline... | ALGO | 0.999249 | 4.125031 |
62a6aff5-b280-4f4d-9538-8aeca4f6ff0e | misteraverin/algorithms | strings/hash_substr.cpp | #define TASKNAME "substr"
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <utility>
#include <map>
#include <set>
#include <vector>
#define x fdfsdsdf
#define y jbvhfdgfdhj
#define MAXN int(1e5 +10)
#define pb push_back
#defi... | ALGO | 0.999967 | 3.951269 |
d88d5146-cf5a-4fc0-b89b-cd9202ef27eb | suke-taku0305/compression | components/lcm.cpp | #include <iostream>
using namespace std;
int gcd( int a, int b ){
//gcd(a,b) = gcd(b, a mod b)
while(b > 0){
int t = a%b;
a = b;
b = t;
}
return a;
}
int lcm( int a, int b ){
// a*b = gcd(a,b) * lcm(a,b)
return ( a*b ) / gcd(a, b);
}
int main( int argc, char *argv[] ){... | ALGO | 0.99832 | 4.495106 |
2a774b6c-5fde-4bd8-bbd0-cf7faafd5055 | NeelmaniRam/CodeForces_Solutions | Missing Numbers.cpp | /*
problem link:https://www.hackerrank.com/challenges/missing-numbers/problem
probelm name:Missing Numbers
status: accepted
Neelmani Ram
*/
#include <bits/stdc++.h>
using namespace std;
int arr[200009]={};
int arr2[200009]={};
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++){
int x;
... | ALGO | 0.999857 | 3.321615 |
a0de8959-b045-4767-a942-41768a0fbd35 | ajnirp/manta | source/vortexsheet.cpp | #include "vortexsheet.h"
#include "solvana.h"
using namespace std;
namespace Manta {
// *****************************************************************************
// VorticityChannel class members
// *****************************************************************************
// VortexSheet Mesh class member... | ALGO | 0.86313 | 5.187991 |
6025bdac-02b2-4aa3-9c39-4072456fc9cc | Mowaffik-Almaradne/Application-Shop | 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 |
61863f5a-309a-4843-9070-489e61f4e509 | empty-works/random-challenges | StackImplement/main.cpp | /* Implement a stack that has the following methods:
*
* - push(val), which pushes an element onto the stack
* - pop(), which pops off and returns the topmost
* element of the stack. If there are no elements
* in the stack, then it should throw an error or
* return null.
* - max(), which returns the max... | ALGO | 0.998555 | 6.090201 |
18a94bae-a4ad-43f4-8a1e-9d1792353009 | bitwiseworks/qtwebengine-chromium-os2 | chromium/third_party/skia/tools/skdiff/skdiff.cpp | #include "include/core/SkBitmap.h"
#include "include/core/SkColor.h"
#include "include/core/SkColorPriv.h"
#include "include/core/SkTypes.h"
#include "tools/skdiff/skdiff.h"
/*static*/ char const * const DiffRecord::ResultNames[DiffRecord::kResultCount] = {
"EqualBits",
"EqualPixels",
"DifferentPixels",
... | TOOL | 0.893463 | 7.174188 |
32b96b35-7c49-4d74-8772-103e7f4c1129 | guit-git-for-assign/MiTiXin | 1661300440 黄海滨作业/C++77页.cpp | #include <iostream>
#include <string>
using namespace std;
class Sqlist
{
private:
int length=0;
const int MAXSIZE=3;
string strs[3];
public:
void Insert( int i, string s) ;
void Delet(int i);
void PrintOut() ;
};
void Sqlist::Insert( int i, string s)
{
if(length==MAXSIZE)
cout<<"ͨѶ¼"<<endl;
el... | TOOL | 0.973154 | 3.421942 |
b576bab8-6c4f-42b7-af55-ae34a80b6aba | Chandiharh-university/opps-and-dsa-harsh0955 | BFS $ DFS.cpp | #include <iostream>
#include <vector>
#include <climits>
using namespace std;
class Graph {
int V;
vector<vector<int>> adjMatrix;
public:
Graph(int V);
void addEdge(int u, int v, int weight);
void primMST();
};
Graph::Graph(int V) {
this->V = V;
adjMatrix.resize(V, vector<int>(V, INT_M... | ALGO | 0.999924 | 5.939037 |
9feadfea-bab3-47f6-aa8f-3535447c95e0 | maple3142/Practice | zjd396.cpp | #include<iostream>
using namespace std;
/* generate to[][]
#include<iostream>
#include<vector>
using namespace std;
int primes[11]={2,3,5,7,11,13,17,19,23,29,31}; //max=15+16=31
vector<int> to[17];
int main(void){
ios::sync_with_stdio(false);
cout<<"{{},";
for(int i=1;i<=16;i++){
for(int j=0;j<11;j++){
if(pri... | ALGO | 0.999721 | 3.895162 |
4d3865dd-0e2d-4bcd-9c55-d0f84ee61a95 | ishandutta2007/codeforces | l0tus/normal/1427/D.cpp | #include <bits/stdc++.h>
#define va first
#define vb second
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> ppi;
typedef pair<int,pii> pip;
const int MN = 1e5+5;
const int MOD = 1e9+7;
const int INF = 1e9;
int N,A[100],B[100],sz[100];
b... | ALGO | 0.999973 | 3.383115 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.