uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
fd8a807d-d993-4def-aca7-fbef7cb96f30 | kartik3110/DSA-Coding-Ninjas | BackTracking/rat-in-a-maze.cpp | // To get all test cases accepted, make recursive calls in the order: Top, Down, Left, Right.
// #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int n;
int solution[18][18];
void solve(int **maze, int r, int c)
{
if (r == n - 1 && c == n - 1)
{
// solution has been reached
fo... | ALGO | 0.999897 | 4.689088 |
2b2dc1bf-4e19-4533-934a-e61937fbcd64 | ajimenezh/Programing-Contests | Codeforces/VKCUPRound3Div2ProblemA.cpp | #include <iostream>
#include <sstream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <stdio.h>
using namespace std;
#define fo(i,n) for(int i=... | ALGO | 0.999599 | 3.049511 |
3b603aa7-105d-4fec-83ee-df96a57933c4 | chandraseta/travelling-salesman | src/CTMatrix.cpp | // File: CTMatrix.cpp
// Author: Rionaldi Chandraseta - 13515077
// Written on 2017-04-03
#include <algorithm>
#include "CTMatrix.h"
CTMatrix::CTMatrix(std::string FileName) : Dist(FileName) {
NumCheckedNode = 1;
}
Matrix CTMatrix::getMatrix() {
return Dist;
}
int CTMatrix::getNumCheckedNode() {
return NumCh... | ALGO | 0.999775 | 5.528865 |
75625f70-ec74-425e-8a50-d3cc406fab82 | hkhetawat/SCOREP_Applications | lammps/src/USER-OMP/fix_gravity_omp.cpp | /* ----------------------------------------------------------------------
Contributing author: Axel Kohlmeyer (Temple U)
------------------------------------------------------------------------- */
#include "omp_compat.h"
#include "fix_gravity_omp.h"
#include "atom.h"
#include "update.h"
#include "input.h"
#include... | ALGO | 0.997979 | 7.448198 |
7b30dba1-1f6e-4c3e-8713-3d6735cc57ff | Nimur-Rashid-Imon66/Competitive-Programming | UVa/10110(Light, more light).cpp | #include <bits/stdc++.h>
#define pi (3.141592653589)
#define mod 1000000007
#define nl endl
#define pb push_back
#define ff first
#define ss second
#define testcase {ll t;cin>>t;while(t--){slove();}}
#define all(c) c.begin(), c.end()
#... | ALGO | 0.999952 | 4.610673 |
7d3dfbb1-d3c7-46a8-a85f-033441382e0b | RohitNunnaguppala/DSA_ROHIT | Leetcode/219.cpp | class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
unordered_map<int, int> indexMap;
for (int i = 0; i < nums.size(); ++i) {
if (indexMap.find(nums[i]) != indexMap.end() && i - indexMap[nums[i]] <= k) {
return true;
}
... | ALGO | 0.999963 | 6.591135 |
a8618f4c-3072-4ff6-870f-c08a9cdb697d | Hritik003/Hacker-rank-problems-in-C | no of digits in a integer.cpp | #include<stdio.h>
#include<math.h>
int main()
{
int long long n;
scanf("%d",&n);
int i = 0;
int len = 0;
for (i = 0; n / pow(10, i) >= 1; i++)
{
len++;
}
printf("%i\n", len);
return len;
}
| ALGO | 0.999413 | 3.079725 |
30f17685-f691-4d85-9b34-adbceb53d783 | lvirgili/programming_challenges | uri/URI1586.cpp | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int strength(const string &name){
int s = 0;
for(unsigned i=0; i < name.size(); ++i){
s += name[i];
}
return s;
}
int solve(const vector<int>& strengths){
int N = strengths.size();
long lon... | ALGO | 0.999861 | 4.510095 |
5514eae1-4ff7-4705-bbdd-71ceff602ddd | qsd8k-legacy/android_system_core | fs_mgr/fs_mgr_fstab.cpp | #include <ctype.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mount.h>
#include <unistd.h>
#include <android-base/file.h>
#include <android-base/stringprintf.h>
#include <android-base/strings.h>
#include "fs_mgr_priv.h"
const std::string kDefaultAn... | TOOL | 0.949952 | 6.423707 |
4db57bb2-2c14-473c-9dbe-0e9fd8b74202 | dinhminh0307/LeetCodeTrain | Stack/C++/Problem682.cpp | /**
* https://leetcode.com/problems/baseball-game/description/?envType=problem-list-v2&envId=stack
*/
#include <iostream>
#include <vector>
#include <stack>
#include <string>
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
class Solution {
public:
bool check_int(string s) {
for(int i... | ALGO | 0.999651 | 6.322824 |
48ff1e41-d82a-4b43-9ff1-a15334f1a4dc | RajAditya01/C-WITH-DSA | C++/Binary_Search.cpp | #include<iostream>
using namespace std;
int binarySearch(int arr[], int size, int key) {
int start = 0;
int end = size-1;
int mid = start + (end-start)/2;
while(start <= end) {
if(arr[mid] == key) {
return mid;
}
//go to right wala part
if(key > arr[mid]... | ALGO | 0.999848 | 4.976192 |
f107d6de-2b45-4d75-b8ca-a7fb61be8d67 | thakkarnetram/DSA-Lectures- | DSA/Lecture 26 - Recursion Day 1/countingUsingRecursion.cpp | #include <iostream>
using namespace std;
void print(int n)
{
if (n == 0)
return;
// Tail Recursion
cout << n << " ";
print(n - 1);
// Head Recursion
cout << n << " ";
}
int main()
{
int n;
cin >> n;
print(n);
return 0;
} | ALGO | 0.999852 | 4.907793 |
10ea96ed-2322-4817-a0ce-17d2a6e5111b | vineetvermaa61/DSA_SUPREME | #Main_Codes/Week12_Stacks/remove_redundent_brackets.cpp | #include <iostream>
#include <vector>
#include <stack>
using namespace std;
bool findRedundantBrackets(string &s)
{
stack<char> st;
for (int i = 0; i < s.length(); i++)
{
char ch = s[i];
if (ch == '(' || ch == '+' || ch == '-' || ch == '*' || ch == '/')
{
st.push(ch);
... | ALGO | 0.999805 | 4.599241 |
a298b24d-e33e-43c8-9803-9064def9e8a9 | rtisne/Pdp | server/src/connectedcomponentextraction.cpp | #include "../headers/connectedcomponentextraction.h"
#include <algorithm>
#include <stack>
#include <cassert>
#include <opencv2/imgproc/imgproc.hpp>
//#include <opencv2/highgui/highgui.hpp>
ConnectedComponentExtraction::ConnectedComponentExtraction()
{
}
static const uchar BACKGROUND = 255;
/*
Region growing fro... | ALGO | 0.96539 | 4.497453 |
1c788f9e-2fe8-4d51-9d0b-1217b5eed180 | Lee-HoJin/BaekJoon | 5. 문자열/1152_단어의개수/test2.cpp | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
bool isChar (char input) {
if ( ( input >= 'A' && input <= 'Z' ) ||
( input >= 'a' && input <= 'z' ) ) {
return true;
}
else {
return false;
}
}
int main ( void ) {
string input;
getline(ci... | ALGO | 0.999907 | 3.5863 |
0d790400-621f-4ac6-8ee8-30e9b401f6e7 | Tenchmarn/Tasks-from-the-programmer-school | (0052).cpp | #include <iostream>
#include <string>
using namespace std;
int main() {
string a1;
int sum1=0, sum2=0;
cin >> a1;
for (int i = 0; i < 3; i++) {
sum1 += a1[i] - '0';
}
for (int j = 3; j < 6; j++) {
sum2 += a1[j] - '0';
}
if (sum1 == sum2) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | ALGO | 0.999922 | 3.532662 |
e225bde2-2656-4677-bb52-a93fce465481 | svisser/js-arm64 | intl/icu/source/common/ustring.cpp | #include "unicode/utypes.h"
#include "unicode/putil.h"
#include "unicode/ustring.h"
#include "unicode/utf16.h"
#include "cstring.h"
#include "cwchar.h"
#include "cmemory.h"
#include "ustr_imp.h"
/* ANSI string.h - style functions ------------------------------------------ */
/* U+ffff is the highest BMP code point, t... | TOOL | 0.995275 | 6.223773 |
44715da9-737c-4fbc-b13a-675d946e8d93 | avinashw50w/ds_algo | Arrays/Subarray/Count subarrays with sum k.cpp | /*Count the no of subarrays whose sum is K.
∑a[i..j] = K
=> ∑a[0..j] - ∑a[0..i-1] = K
=> ∑a[0..j] - K = ∑a[0..i-1]
keep calculating the prefix sums and
just count the previously occured prefix sums whose value matches with the
current prefix sums
- Another approach can be to first store the frequency of all the prefix... | ALGO | 0.999842 | 5.796272 |
c451344e-ba5c-405a-b08d-187f9085debe | TarunSinghania/Prewritten-code | dp standard problems/total-number-of-non-decreasing-numbers-with-n-digits.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define fr(i,a,b) for(int i =a ; i < b; i++)
#define FR(i,a,b) for(int i =a ; i > b; i--)
#define frj(j,a,b) for(int j =a ; j < b; j++)
#define FRE(i,a,b) for(int i =a ; i >= b; i--)
#defi... | ALGO | 0.999835 | 4.369799 |
4cff0cb5-3291-4e5d-af00-c48f768d5a2a | titocs/Random-Competitive-Programming | ARKAVIDIA 7.0/Emordnilap.cpp | #pragma GCC optimize ("03")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long int ll;
typedef long double ld;
#define pb ... | ALGO | 0.999835 | 3.741825 |
e6940422-fc21-4502-b730-66e26e1881fb | vivekdusad/dsa-algo | Sorting/BubbleSort/bubbleSort.cpp | #include<iostream>
using namespace std;
void swap(int *a,int *b){
int temp = *a;
*a = *b;
*b = temp;
}
void bubbleSort(int A[] , int n){
int flag;
for(int i=0;i<n-1;i++){
for(int j=0;j<n-i-1;j++){
if(A[j]>A[j+1]){
swap(&A[j],&A[j+1]);
}
... | ALGO | 0.999848 | 5.026063 |
207e7040-7162-4308-bb35-9db348704ab0 | Shubhamt45054/CrackYourInternship | Array/Easy/02_Move Zeroes.cpp | class Solution {
public:
void moveZeroes(vector<int>& arr) {
int n=arr.size();
int j=0;
for(int i=0;i<n;i++){
if(arr[i]!=0){
swap(arr[j],arr[i]);
j++;
}
}
}
};
| ALGO | 0.99991 | 6.155354 |
312bacf2-0d82-407d-8aee-ca534c71125d | WJ-self/algorithm | .history/acwing/basic/贪心/区间问题/906_区间分组_20230913152651.cpp | #include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
const int MAX=0x3f3f3f3f;
typedef pair<int,int> PII;
PII p[N];
int n,a,b,res,mb = -MAX; //mb: 分界线
int main() {
cin >> n;
for (int i=0; i<n; i++) {
cin >> a >> b;
p[i] = {a,b};
}
sort(p, p+n); //按照左端点排序
for (int i=0; i... | ALGO | 0.999985 | 4.588528 |
421be538-2f5c-4534-b942-b6837559daaf | CFOP2357/competitive_programing | codeforces/Codeforces Round #706 (Div. 2)/A.cpp | #include <iostream>
#include <climits>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <time.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_... | ALGO | 0.999919 | 3.903795 |
2a7fe010-3d56-43d9-87f1-280be07534c8 | ParasWaghela07/DSA-SUPREME-2.0 | (WEEK 12) QUEUE/sliding_window_maxi.cpp | class Solution {
public:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
deque<int>dq;
vector<int>ans;
for(int i=0;i<k;i++){
while(!dq.empty() && nums[i]>nums[dq.back()]){
dq.pop_back();
}
dq.push_back(i);
}
ans.pu... | ALGO | 0.999994 | 6.101971 |
75a23771-3928-404e-bdb1-7a0fb549e6e2 | Kr-Raman/Codechef_practice | Graphs/SSSP/Program.cpp | #include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pb push_back
vi arr[10001];
int vis[10001];
int dis[10001];
void dfs(int node,int d)
{
vis[node]=1;
dis[node]=d;
for(int i=0;i<arr[node].size();i++)
{
int child = arr[node][i];
if(vis[child]==0)
{
... | ALGO | 0.999993 | 4.224859 |
4911e859-a162-424a-a351-b56f876bf132 | vuba2002/Code_C | 05-28-Tam-giac-vuong.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int check(ll a[], int n){
for(int i = n - 1; i > 1; i--){
int l = 0, r = i - 1;
while(l < r){
if(a[l] + a[r] == a[i]) return 1;
else if(a[l] + a[r] < a[i]) ++l;
else --r;
}
}
return... | ALGO | 0.999507 | 4.158186 |
89ab99ce-25db-4ff3-9850-312a60784eb4 | Mr-Bangladesh/Problem-Solving | Toph/Largest Prime.cpp | /**In the name of Allah, the Most Merciful, the Most Merciful.**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define INF 9223372036854775806
#define pb push_back
#define mp make_pair
ll MOD=1000000007;
#define PI 2*acos(0.0)
ll mod(ll B,ll M){ll X=B%M; if(X>=0) r... | ALGO | 0.99991 | 3.909449 |
39b1ba6a-ba22-418f-8877-4d5658df39fc | manu05X/Leetcode | 557-reverse-words-in-a-string-iii/557-reverse-words-in-a-string-iii.cpp | class Solution {
public:
string reverseWords(string s)
{
int lastSpaceIdx = -1;
int len = s.size();
for(int i = 0; i <= len; i++)
{
if(i == len || s[i] == ' ')
{
int stIdx = lastSpaceIdx + 1;
int endIdx = i - 1;
... | ALGO | 0.999939 | 6.232867 |
74c96821-5c3e-4c25-b16b-c9c6e6b7499e | ROCm/rocHPCG | src/ComputeResidual_ref.cpp |
//@HEADER
// ***************************************************
//
// HPCG: High Performance Conjugate Gradient Benchmark
//
// Contact:
// Michael A. Heroux ( <EMAIL>)
// Jack Dongarra (<EMAIL>)
// Piotr Luszczek (<EMAIL>)
//
// ***************************************************
//@HEADER
/*!
@file Compute... | ALGO | 0.99907 | 6.291428 |
cf73c3b3-8506-40c2-9c1e-d51fbdc17fe2 | qiaozishun4/CSP2024_BJ | BJ-Senior/answers/BJ-S01421/color/color.cpp | #include <iostream>
#include <cstring>
using namespace std;
const int maxn = 1e6 + 10;
int T;
int n;
int a[maxn];
int c[maxn];
void solve()
{
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
memset(c, 0, sizeof c);
int ans = 0;
for (int i = 0; i < (1 << n); i++)
{
int res = 0;
for (int j = 1; j <= n; j... | ALGO | 0.99987 | 4.412696 |
7d8e502c-d666-49f7-a5d6-192123e83ff3 | buitanphat247/C-Algorithm | Code(2022-2023)/Sum_Chan/main.cpp |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
long long sum=0;
for(long long i=0;i<n;i++)
{
long long tmp;
cin>>tmp;
if(tmp%2==0)
sum+=tmp;
}
cout<<sum<<endl;
}
| ALGO | 0.999961 | 4.025569 |
ebc8c083-ca2e-4dbf-8b11-a0dac313cd1e | PARCO-LDRD/benchmarks | gpu_threads/hotspot3D-omp/3D.cpp | #include <sys/types.h>
#include <omp.h>
#include "3D_helper.h"
#define TOL (0.001)
#define STR_SIZE (256)
#define MAX_PD (3.0e6)
/* required precision in degrees */
#define PRECISION 0.001
#define SPEC_HEAT_SI 1.75e6
#define K_SI 100
/* capacitance fitting factor */
#define FACTOR_CHIP 0.5
floa... | ALGO | 0.999385 | 3.514032 |
00a9c689-69d1-412c-9ddb-2d376dd96e2f | ishandutta2007/codeforces | davidlee1999wtk/normal/519/C.cpp | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cstdlib>
#include<string>
#include<bitset>
#define INF 1000000000
#define fi first
#define se second
#define debug(x) cout<<#x<<"="<<x<<endl
#de... | ALGO | 0.999798 | 3.414977 |
58775691-67dc-4c8e-9f3e-7dd4e5c0748f | anjanajoseph12/blog-front | 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.998809 | 6.763549 |
749ac9ad-254f-406b-a17e-565f1cc11676 | kagasan/atcoder | shojin/0226/3.cpp | //
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, l... | ALGO | 0.999674 | 3.507541 |
e0aa525b-3f16-4e4a-8826-e57f1a67f907 | ayushsharma-crypto/CSES | sort&search/collectingnumber2.cpp | #include <iostream>
using namespace std;
int main()
{
int n,ans=0,m;
cin >> n >> m;
int arr[n],present[n+1],hash[n+1];
for(int i=0;i<n;i++) cin >> arr[i];
for(int i=0;i<=n;i++) present[i]=0;
for(int i=0;i<n;i++)
{
present[arr[i]]=1;
if(present[arr[i]-1]!=0) continue;
... | ALGO | 0.999987 | 4.218367 |
afea2e8c-bddb-4ac2-9944-ec950eef3eeb | mohamedaminebennacef/Problem-Solving | 1000/b-different-divisors/b-different-divisors.cpp | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define em emplace_back
#define mp make_pair
#define sz(a) (int)(a.size())
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
#define endl "\n"
// int a[500005];
#define int... | ALGO | 0.999752 | 4.732296 |
3a1b46ea-7f31-472a-89ca-fd50042763a0 | pyzahl/XNucleoGMControl | AstroMini_Library/src/AstroMini_Library.cpp | /*
* This program calculates solar positions as a function of location, date, and time.
* The equations are from Jean Meeus, Astronomical Algorithms, Willmann-Bell, Inc., Richmond, VA
* (C) 2015, David Brooks, Institute for Earth Science Research and Education.
*/
#include <Time.h>
#include <time.h>
#include <m... | ALGO | 0.997474 | 5.799385 |
ee77f66f-15e5-49ae-b566-291e05233034 | xin-yu-liu/ClickHouse | src/Processors/QueryPlan/PartialSortingStep.cpp | #include <Processors/QueryPlan/PartialSortingStep.h>
#include <Processors/QueryPipeline.h>
#include <Processors/Transforms/PartialSortingTransform.h>
#include <Processors/Transforms/LimitsCheckingTransform.h>
#include <IO/Operators.h>
namespace DB
{
static ITransformingStep::Traits getTraits(size_t limit)
{
retur... | ALGO | 0.948503 | 7.694682 |
c44b36d6-9728-4028-a290-53dc17085128 | madhav-bits/Coding_Practice | leetLenOfLastWord.cpp | /*
*
//**********************************************************58. Length of Last Word.***************************************************
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.
If the last word does not exist, return 0.
... | TEST | 0.977348 | 5.073785 |
63cd381d-c87b-42c4-843e-b81658b36861 | Harshit-Verma-Official/Data-Structures-and-Algorithms | Graph/FloydWarshall.cpp | #include <bits/stdc++.h>
using namespace std;
#define V 6 //No of vertices
void floyd_warshall(int graph[V][V]) {
int dist[V][V];
//Assign all values of graph to allPairs_SP
for (int i = 0; i < V; ++i)
for (int j = 0; j < V; ++j)
dist[i][j] = graph[i][j];
//Find all pairs shorte... | ALGO | 0.999941 | 4.955375 |
78046e58-fdd6-4194-9f56-a05af1d82c62 | longhai-mine/filemaynha | nhamtan/huydietsohoc/zs.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = (int)1e9 + 7;
map <int, int> f;
int n;
int lt(int x, int y)
{
int res = 1;
for(int i = 1; i <= y; i++)
res *= x;
return res;
}
vector <int> prime;
void snt()
{
for(int i = 2; i <= sqrt(1e9); i++)
{
bo... | ALGO | 0.999969 | 5.150306 |
c7f934d3-5994-4076-9de1-3dead4d09ccb | rabelhmd/LeetCode | 1436-destination-city/1436-destination-city.cpp | class Solution {
public:
string destCity(vector<vector<string>>& paths) {
unordered_map <string, string> Mp;
string origin;
for(auto &path: paths) {
if(origin == "") origin = path[0];
Mp[path[0]] = path[1];
}
while(Mp.find(origin) != Mp.end())... | ALGO | 0.99984 | 5.630572 |
ee288f23-60b7-4775-abd1-a36a84fe603b | kashishjethmalani/Daily-DSA | 79_top k freq elements_POTD_GFG.cpp | ERROR: type should be string, got "\nhttps://leetcode.com/problems/find-the-winner-of-an-array-game/\n\nvector<int> topK(vector<int>& nums, int k) {\n vector<int> ans;\n map<int,int> m;\n for(auto i:nums){\n m[i]++;\n }\n priority_queue<pair<int,int>>q;\n for(auto i:m){\n q.push({i.second, i.first});\n }\n while(!q.empty() and k--){\n ans.push_back(q.top().second);\n q.pop();\n }\n \n return ans;\n }\n" | ALGO | 0.99999 | 5.261443 |
f2f4b23b-8837-4b5a-8304-7b841b3175bb | ishandutta2007/codeforces | gazelle/normal/1375/C.cpp | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <algorithm>
#include <cassert>
#include <random>
#include <iomanip>
#include <bitset>
#include <array>
#define FOR(i, n, m) for(ll i = (n); i < (ll)(m); i++)
#... | ALGO | 0.99975 | 4.715269 |
252bfdf1-3f51-42fd-96be-08225b686d48 | raincross7/code-similarity | codes/train_code/problem209/problem209_123.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int maxn = 2e5 + 5;
typedef long long ll;
typedef uint64_t HT;
const int mod = 1e9 + 7;
int pre[N], sum[N];
int find(const int &x) {
return x == pre[x] ? x : pre[x] = find(pre[x]);
}
int main() {
int n, m;
cin >> n >> m;
for (int... | ALGO | 0.999874 | 4.02935 |
a47211fd-675b-450b-a442-ef61b2960319 | AfsanaChoity/XPSC_Phitron_batch_6 | week-2/problems/D_Line.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int t; // number of testcases
cin >> t;
while (t--)
{
long long n; // the length of the line.
cin >> n;
string str;
cin >> str;
long long current_total = 0;
long long first_idx = 0, last_idx = n... | ALGO | 0.999705 | 4.284825 |
e6c32dd6-8869-4c4e-85cf-239cd4bfc916 | Lchuxian/SLAM-Environment | OpenCV3_and_OpenCV4_coexist/opencv-4.5.5-build/opencv_contrib-4.5.5/modules/tracking/src/trackerCSRTScaleEstimation.cpp | #include "precomp.hpp"
#include "trackerCSRTScaleEstimation.hpp"
#include "trackerCSRTUtils.hpp"
//Discriminative Scale Space Tracking
namespace cv
{
class ParallelGetScaleFeatures : public ParallelLoopBody
{
public:
ParallelGetScaleFeatures(
Mat img,
Point2f pos,
Size2f base_target_sz,
... | ALGO | 0.991474 | 6.256912 |
848eebee-1466-4c1b-b341-bc2c3fff4891 | YBenPan/Competitive-Programming | Codeforces/1391B.cpp | #include <bits/stdc++.h>
#define LL long long
#define MOD 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--)
{
int n, m;
cin >> n >> m;
char g[105][105];
int cnt = 0;
for (int i = 0; i <... | ALGO | 0.999079 | 4.699698 |
0c31450d-485d-4336-a203-b539e5ff4d46 | Beldex-monero/monero | tests/performance_tests/main.cpp | #include <boost/regex.hpp>
#include "common/util.h"
#include "common/command_line.h"
#include "performance_tests.h"
#include "performance_utils.h"
// tests
#include "construct_tx.h"
#include "check_tx_signature.h"
#include "cn_slow_hash.h"
#include "derive_public_key.h"
#include "derive_secret_key.h"
#include "ge_fro... | TEST | 0.861167 | 6.158906 |
e95bd2dd-7cd8-4a24-a5ed-1ef17bc7b40f | manikanta2901/ubuntu | .history/practice/cpp/codeforces/KthLargestNumber_20210409215618.cpp | // #include <bits/stdc++.h>
// #include<vector>
// #include<iostream>
// #include<cmath>
// #include<algorithm>
// #include<iterator>
// #include<string>
// #include<map>
// #include<queue>
// using namespace std;
// #define trav(dataType,DataStruct,name) for(dataType<DataStruct>::itt ip = name.bb(); ip != name.ee(); i... | ALGO | 0.999867 | 4.65906 |
585a4a69-bf98-4f02-b5e2-a4945d5e11d7 | Aisha-ashraf/-CrackInternship | Day16/Remove_nth_node_from_end.cpp | #include <iostream>
using namespace std;
// Definition for singly-linked list.
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* dummy = new ListNode(-1);
dummy->n... | ALGO | 0.999962 | 6.580763 |
aa250bb4-a36c-4079-be86-d59f2f4e7671 | HarshilD05/FOS | FOS/RR.cpp | //
#include <iostream>
using namespace std;
struct Process {
int id; // Id
int BT; // Burst Time
int remT; // Remaining Time
int AT; // Arrival Time
int CT; // Completion Time
int TAT; // Turn Around Time
int WT; // Wait Time
Process () {}
Process (int i... | ALGO | 0.999961 | 3.762692 |
f1c96eef-b688-4912-9b5d-eef57289c180 | mavlevin/einsteinsriddle | cpp_solution/algorithm.cpp |
#include "algorithm.h"
namespace algorithm
{
void solve()
{
std::array<std::array<person::PropertyValue, person::kPropertyOptions>, person::kNeighborCount> raw_street;
std::vector<std::array<person::PropertyValue,person::kPropertyOptions> > animals_permutations;
std::vector<std::array<person::PropertyValue,p... | ALGO | 0.999329 | 4.469685 |
4bb71c51-f778-4512-b3a3-9f6bc69cb405 | Nicolahxd/Problemas-Competitiva | aceptados/1025.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
int arr[n];
int aux;
for(int i=0;i<n;i++){
scanf("%d",&arr[i]);
}
int size_T=sizeof(arr)/sizeof(arr[0]);
sort(arr,arr+size_T);
int medio=(n/2)+1;
int cont=0;
for(int i=0;i<medio;i++){
cont+= (arr[i]/2)+1;
}
printf("%d... | ALGO | 0.999841 | 3.728511 |
4d8dfa7a-bf71-4bcf-bc73-4b32ea1006cc | vicho441/Intro_Program-UADE | Ejercicios CLASES/Clase 28-3/Clase 28-3/Funciones/Funciones.cpp | // Funciones.cpp : Este archivo contiene la función "main". La ejecución del programa comienza y termina ahí.
//
#include <iostream>
using namespace std;
int preba(int numero)
{
return numero;
}
string NumeroParOImpar(int numero) {
if (numero % 2 == 0)
{
return "Su numero es par";
}
else... | TOOL | 0.934402 | 5.138526 |
5824f1a9-954a-4260-940c-9a093ea2ad29 | Swathi-f2/MATRIX | Search_element_in_matrix.cpp | // Each row is sorted in non-decreasing order.
// The first integer of each row is greater than the last integer of the previous row.
// https://leetcode.com/problems/search-a-2d-matrix/
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
bool searchMatrix(vector<vector<int>>& ma, int target) {
... | ALGO | 0.999851 | 4.939063 |
a1dbe74d-ac98-4b4a-990c-f653e8acde5b | kaushal02/interview-coding-problems | Palindrome And Substring.cpp | /*
Walmart Labs IIT Dhanbad 2018
Given strings A and B, find the minimum number of manipulation done in string A
to achieve the following:
1. A is a palindrome
2. B is a substring in A
Here manipulation is defined as changing a character to some other character
1 <= String Lengths <= 5000
O(N^2)
*/
#include <iostrea... | ALGO | 0.999972 | 5.641629 |
f40dfcd9-60f0-4791-a6ce-75f93ed02e0c | Mohamed439mahmoud/Algorithms | اسايمنت في ال Recursion.cpp | #include <iostream>
#include<string>
using namespace std;
void selectionsort(int arr[], int n) {
int midx;
for (int i = 0; i < n - 1; i++)
{
midx = i;
for (int j = i + 1; j < n; j++)
{
if (arr[midx] > arr[j]) {
midx = j;
}
}
swap(arr[i], arr[midx]);
}
}
void print(int arr[], int n)
{
for (in... | ALGO | 0.999876 | 4.608125 |
7db0539d-44e9-4538-9cc3-002464d79395 | alexandraback/datacollection | solutions_5756407898963968_0/C++/poesia/a.cpp | #include <iostream>
#include <set>
using namespace std;
int main() {
int t;
cin >> t;
for (int tc = 1; tc <= t; tc++) {
int r;
cin >> r;
set<int> row, possibilities;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
int x;
... | ALGO | 0.995605 | 4.531241 |
31740f71-d24c-43a0-9b74-d004f2b28aaf | Mayuresh-NG/Ciphers | poly.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
string msg, key, k, ct, pt;
int len_msg, len_key, i, j=0;
cout << "Enter Message : ";
getline(cin, msg);
transform(msg.begin(), msg.end(), msg.begin(), ::toupper);
cout << "Enter Key : ";
getline(cin, key);
transform(key.begin... | ALGO | 0.999983 | 5.328513 |
946ec812-1bf9-40ce-97ea-e120cd1f7b2e | Fezaan/CodingWithCPP | maximumConsecutiveOnes.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
int longestOnes(int n, vector<int> &nums, int k)
{
// Code here
int len = 0, l = 0, r = 0, count = 0;
while (r < n)
{
if (nums[r] == 0)
... | ALGO | 0.999625 | 6.457994 |
5d8ab4f5-29d6-40c1-8648-b37287973af4 | KeroDeep/NSU | Object_Oriented_Programming/Road_marking/parser.cpp | #include "parser.hpp"
std::pair<std::vector<Line>, bool> Parser::getLines() {
std::string mark, line;
double lenght;
std::vector<Line> result;
while (std::getline(is, line)) {
std::istringstream iss(line);
if (!(iss >> lenght)) continue;
if (!(iss >> mark)) continue;
aut... | TOOL | 0.910343 | 3.566191 |
a851a0f5-d61f-488c-acef-d7d5ba5276b6 | ishandutta2007/codeforces | ashishgup/normal/612/D.cpp | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
int n, k;
map<int, vector<int> > m;
int32_t main()
{
IOS;
cin >> n >> k;
for(int i = 1; i <= n; i++)
{
int l, r;
cin >> l >> r;
m[l].push_back(1);
m[r + 1].... | ALGO | 0.999983 | 3.551918 |
6e1ed402-1d53-4967-827a-aa653e01a400 | Jesusrac31/Advent-of-code | 2022/Day_8/main (35).cpp | #include <fstream>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int part_1() {
vector<vector<int>> mapa;
int visibles = 0;
string nombreArchivo = "input.txt";
ifstream archivo(nombreArchivo.c_str());
string linea;
// Obtener línea de archivo, y almacenar contenido en "line... | ALGO | 0.999432 | 5.124435 |
11bc7dd3-13b5-469c-add1-e75244a65af9 | JohnItoo/Solvay | codeforces/training/CF-1182A.cpp | #include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <set>
#include <vector>
#include <string.h> // for memset in CF judge.
using namespace std;
#define _CRT_SECURE_NO_DEPRECATE // suppress some compilation warning messages (for VC++ users)
// Shortcuts for "common" data type... | ALGO | 0.999978 | 5.406945 |
15878975-c40e-43e9-b348-7fc24335839e | shivamm-jha/leet-code | 1672-richest-customer-wealth/1672-richest-customer-wealth.cpp | class Solution {
public:
int maximumWealth(vector<vector<int>>& accounts) {
int n= accounts.size();
int m = accounts[0].size();
int ans=INT_MIN,sum=0;
for(int i=0;i<n;i++){
sum=0;
for(int j=0;j<m;j++){
sum+=accounts[i][j];
}
... | ALGO | 0.99964 | 6.016856 |
1dc58d8f-38a9-4e9c-a5b8-3959c7d234bf | YiyangHuo/G-nut-Anubis-complied-in-VS2019 | Anubis_complete/src/gmodels/gfuncplane.cpp | #include <iostream>
#include <iomanip>
#include <cmath>
#include "gmodels/gfuncplane.h"
using namespace std;
namespace gnut {
// LSQ (plane)
// ---------
// int t_gfunc_plane::LSQ_plane(const ColumnVector& X, const ColumnVector& Y, const ColumnVector& Z ) // !!! MOZNO NESKOR... | ALGO | 0.99417 | 4.378513 |
92adecb5-8773-43bd-82b2-acbdb51cb91e | ClownUI/frameworks_av | media/module/codecs/amrnb/enc/src/g_code.cpp | /*
------------------------------------------------------------------------------
Filename: /audio/gsm_amr/c/src/g_code.c
Date: 01/31/2002
------------------------------------------------------------------------------
REVISION HISTORY
Description: The return of L_mult was being stored in a Word16 before it ... | ALGO | 0.999876 | 6.726301 |
be1bf725-f112-47ca-a4e9-5e75d4aab834 | tskzokias/OpenGL-ES_Renderer | app/src/main/cpp/glm/test/ext/ext_vector_common.cpp | #include <glm/ext/vector_common.hpp>
#include <glm/ext/vector_bool1.hpp>
#include <glm/ext/vector_bool1_precision.hpp>
#include <glm/ext/vector_bool2.hpp>
#include <glm/ext/vector_bool2_precision.hpp>
#include <glm/ext/vector_bool3.hpp>
#include <glm/ext/vector_bool3_precision.hpp>
#include <glm/ext/vector_bool4.hpp>
#... | TEST | 0.855905 | 6.965013 |
6f091df4-af24-4307-8738-984369116a7a | rukhsana-dev/makeup | 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.998859 | 6.785645 |
b9ca073a-f8e9-472d-a8c5-e0367ec2a8bc | ArghyaB118/DynamicGAP | graphs/synthetic-graph-generator.cpp | #include <iostream>
#include <vector>
#include <string>
#include <fstream>
using namespace std;
void buildGraph(int m, int n, int &e) {
ofstream graph_file;
graph_file.open ("synthetic_graph.el");
int i = 1;
while (2*i + 1 <= m) {
graph_file << i << " " << 2*i << endl;
graph_file << i << " " << 2*i + 1 << endl... | ALGO | 0.996193 | 3.604425 |
e6204fa6-0267-4d5f-99f5-a44081adaaff | da1234cao/data_structure | leetcode/code/5_最长回文子串.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
string longestPalindrome(string s) {
// 输入s的长度，大于等于1
int maxLen = 0;
int left = 0;
int right = 0;
// dp[i,j]，表示s[i,j]字串，是否为回文串
vector<vector<bool>> dp(s.length(), vector<bool>(s.le... | ALGO | 0.999872 | 4.555602 |
018572d7-1297-4889-a906-a4b93c1ac6f9 | Abhilash-0322/cpp_ds | DSA/list_mer_s.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* me... | ALGO | 0.999691 | 5.399904 |
147e0335-3319-4984-8133-d14df53b02b4 | Shell-Wataru/AtCoder | Other/MSOL2020/D.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <map>
#include <iomanip>
#include <cmath>
#include <set>
#include <numeric>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
namespace mp = boost::multiprecision;
int main()
{
... | ALGO | 0.999794 | 3.579832 |
695118fc-f852-480e-94fe-f6ce0ec18504 | SeungBeomLim/24-1_PPS-Camp | A098_임승범_20240706.cpp | // A098. Intersection of Two Linked Lists - Leetcode
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
List... | ALGO | 0.99979 | 5.736184 |
08fdbdc8-9ba5-4afd-8ecd-346c73d23ce9 | kartikmadan26/100DaysOfCode | day21.cpp | // Question
// 2149. Rearrange Array Elements by Sign
// You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers.
// You should rearrange the elements of nums such that the modified array follows the given conditions:
// Every consecutive pair of integ... | ALGO | 0.999981 | 5.952353 |
38e30bf4-bf8c-4935-88ab-0f918f151e79 | xczhang07/leetcode | f/getTopKSmallestNum.cpp | 第二轮VO 第二题 https://www.1point3acres.com/bbs/thread-1067696-1-1.html
//Meta
vector<int> getTopKSmallest(vector<vector<int>>& arrs, int k) {
priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<pair<int, pair<int, int>>>> pq;
vector<int> ret;
for(int i = 0; i < arrs.size(); ++i... | ALGO | 0.99997 | 4.530338 |
b65ab77c-47e2-4e0c-8b62-75d88cc6975f | otavioon/COLA-2022-Tools | datasets/src/optz/codenet/3/p03775_s106610384.cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<n; ++i)
#define rep1(i, n) for (int i=1; i<=n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
constexpr ll... | ALGO | 0.999698 | 4.750436 |
833b4f0b-c520-4a7f-99ac-3d38ba1d731a | Scrubpai/Competitive-Programming | Codeforces/1506F.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MM = 2e5+5;
#define nl '\n'
#define f first
#define s second
int n;
void solve(int tc) {
cin >> n;
vector<pii> p(n);
for (int i=0; i<n; i++) cin >> p[i].f;
for (int i=0; i<n; i++) cin >> p[i].s;
... | ALGO | 0.999937 | 3.613702 |
64800deb-5c78-4f52-b7ab-3eb408039ca3 | canplane/problem-solving | boj/old/202102-cpp/8-brute/10819_next_permutation.cpp | #include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<int> v(N);
for (int i = 0; i < N; i++)
scanf("%d", &v[i]);
int ans = 0;
sort(v.begin(), v.end());
do {
int sum = 0;
for (i... | ALGO | 0.999942 | 4.174373 |
609bf044-0e80-4b59-99c8-7bf7e7866b55 | sjulier/Refactored_ORB_SLAM2 | Source/ThirdParty/g2o/g2o-20241228_git/g2o/solvers/csparse/solver_csparse.cpp | #include "g2o/core/block_solver.h"
#include "g2o/core/optimization_algorithm_dogleg.h"
#include "g2o/core/optimization_algorithm_factory.h"
#include "g2o/core/optimization_algorithm_gauss_newton.h"
#include "g2o/core/optimization_algorithm_levenberg.h"
#include "g2o/core/solver.h"
#include "g2o/core/sparse_optimizer.h"... | ALGO | 0.998206 | 7.302964 |
9f4d6739-3a01-4191-8789-0d249cc3e5f1 | krishna-raj007/BodhiTree-Annotation | CS101_Autumn2020-21/Fibonacci/296_fibonacci.cpp | #include<simplecpp>
main_program{
int n, k;
cin >> n >> k;
int i;
int f0 = 0, f1 = 1;
long long int a = f0, b = f1;
if(n>=2){
cout << a << endl << b << endl;
for(i = 1; i <= n-2; i+=1){
cout << (a+b)%k << endl;
long long int r = b%k;
b = a%k + b%k;
a = r;
}
}
else co... | ALGO | 0.99997 | 3.419012 |
e38e3148-18e5-4fc4-8464-afb70476f30d | Abdulrazaq542/Note-App-with-supabase | 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.998756 | 6.772262 |
0a47e780-506a-4fa6-b3ea-f937f27b1f95 | caterinaminarini/LSN_MINARINI | Exercise01/01.1/main.cpp | #include <iostream>
#include <fstream>
#include <string>
#include <cmath>
#include "../../ParallelRandomNumberGenerator/random.h"
using namespace std;
void DataBlocking(double*, double*, double*, int, int);
double error (double, double, int);
int main (int argc, char *argv[]){
// --- PRIMA PARTE ---
... | ALGO | 0.982732 | 4.016953 |
80c40179-7ee2-4b0f-9354-f37d05a42017 | kripal-01/Assignment-20 | 9_rev_array_easy.cpp | //9. Write a program to print the elements of an array in reverse order
#include<stdio.h>
void sum(int *p,int s)
{ int i;
for(i=s-1;i>=0;i--)
printf("%d ",*(p+i));
}
int main()
{
int i,a[5]={1,2,3,4,5};
sum(a,5);
return 0;
}
| ALGO | 0.970449 | 3.325339 |
7926f0d4-7c8e-4794-89c6-7db37840080c | specialgrade/c-cc | C-Code-Repo/Functions/function/sorting_selection.cpp | #include <stdio.h> // give the step-by-step display of sorting
void selection_asc(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;
printf("Pass %d: ", i + 1);
... | ALGO | 0.999825 | 3.650367 |
69458ef3-dffb-4f17-b65a-3229963f8b06 | shafayetejaman/CLI-projects | extractText/files/week 05/day 3/C_Train_and_Queries.cpp | // https://codeforces.com/problemset/problem/1702/C
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<char> vc;
... | ALGO | 0.999918 | 4.630099 |
0c464c54-32d3-4325-ad4d-6d837a9c8f8d | jyotirmoy1997/Data-Structures-Files | Graph/StronglyConnectedComponents.cpp | #include<bits/stdc++.h>
using namespace std;
class Graph
{
public:
int n;
vector<int> *graph;
Graph(int v)
{
n = v;
graph = new vector<int>[n];
}
void addEdge(int u, int v)
{
graph[u].push_back(v);
}
void show()
{
for(int i=0; i<n; i++)
{
... | ALGO | 0.999966 | 5.367579 |
27f3838d-f329-4a62-80eb-fe678a3e6432 | LeiYangJustin/CVUI4CellularSolid | CVUI/Optimizer/my_optimizer.cpp | #include "my_optimizer.h"
#include "my_line_search.h"
CMyOptimizer::CMyOptimizer()
{
}
CMyOptimizer::~CMyOptimizer()
{
}
double CMyOptimizer::iterate(int iter)
{
std::cout << iter << " iteration..." << std::endl;
save_cvt_results();
// collect positions
std::cout << "--collect sites..." << std::endl;
std::vec... | ALGO | 0.999452 | 4.655442 |
49638296-ef50-4eb4-aa06-9192c0cab467 | dicoccolorenzoo/Fogli_LPC-AK2024-25 | F1/F1_4.cpp | //Programma che dati tre numeri forniti dall'utente, ne trova il valore assoluto e dopodiché ne trova il più grande
#import <stdio.h>
int main(){
int a,b,c,max; //Definiamo 3 numeri
int errore=0;
printf("Scrivi tre numeri interi, metti lo spazio tra ogni numero '1 2 -3'");
scanf("%d %d %d", &a, &b, &c);
if ... | ALGO | 0.999246 | 3.850286 |
cfdc26fa-e93b-4fe0-87ce-7b3c0eb2c253 | ShisuiMadara/450DSA | floodFill.cpp | class Solution {
public:
void recursion(vector<vector<int>>&image, int sr, int sc, int color, int realColor)
{
int n = image.size();
int m = image[0].size();
image[sr][sc] = color;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0, -1};
//down, rig... | ALGO | 0.99957 | 6.068885 |
69ef80a1-98c7-41a3-a387-57c3b36c0d2d | ishandutta2007/codeforces | akulyat/normal/1176/D.cpp | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;
ifstream in;
ofstream out;
const long long kk=1000;
const long long ml=kk*kk;
const long long mod=ml*kk+7;
const long long inf=ml*ml*ml+7;
ll n,i,j;
vector <ll> ... | ALGO | 0.99991 | 3.206177 |
9d2bb951-30c8-435b-a5fb-098dea1c72de | biyotteu/algorithms | C++/최대공약수와 최소공배수2.cpp | #include <bits/stdc++.h>
using namespace std;
int f(int a,int b){
if(b == 0) return a;
return f(b,a%b);
}
int main(){
int a,b;
scanf("%d %d",&a,&b);
if(a<b) swap(a,b);
printf("%d\n%d",f(a,b),a*b/f(a,b));
} | ALGO | 0.999946 | 3.664042 |
83e6549d-c38c-42c8-9117-0dc357b4f10b | Michael-Ma/Coding-Practice | CC/C20/SuffixTrieMatch.cpp | #include <iostream>
#include <cstring>
using namespace std;
class Trie{
public:
static const int MAX_N = 100*100; // 100 is the length of string, need to hold 100 suffix for this string
static const int NODE_SIZE = 26; // each node has 26 element.
int size; // utilized size after inserting.
int t... | ALGO | 0.999452 | 4.46118 |
b01c2cc1-493b-4957-83fd-dc83c424ca08 | wefking/node-course-2-web-server | Cpp/programming-book/chapter4/drill1.cpp | #include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
double convert2meters(double,string);
int main()
{
vector<double> nums_m;
double num1=0;
double num1_m = 0;
string unit = "";
vector<string> units = {"cm","m","in","ft"};
double smallest = 0;
double largest = 0;... | TOOL | 0.967355 | 4.791106 |
4e20e14a-3c30-44e9-826a-b920262ce930 | KMSBisko/Cpp-pratice-learning | DFS.cpp | #include <bits/stdc++.h>
using namespace std;
int a[101][101]={0};
int n, m, u, v, s,i;
bool trace[101];
void DFS(int u)
{
cout << u << endl;
trace[u] = 0;
for (int v = 1; v <= n; v++)
if (a[u][v] == 1 && trace[v] )
DFS(v);
}
int main()
{
cin >> n >> m >> s;
for (i=1; i<= m; i... | ALGO | 0.999834 | 3.614797 |
6eb4d49e-794d-4926-b38d-c8cf638eac59 | TanishqBhargava/Hackerearth | Algorithms/Graphs/Breadth First Search/Big P and Party.cpp | /*========================*\
| ID: tanishqbhargava2509 |
| LANG: C++ |
\*========================*/
//Tanishq Bhargava
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b, u, v;
cin >> a >> b;
vector<int>adj[a], visit(a, 0), cnt(a, 0);
for(int i = 0; i < b; i++)
{
cin >> u >> ... | ALGO | 0.999872 | 4.13837 |
080663e3-3bf2-4d48-aefc-1b764c1cb768 | mox-mox/pca | ex1/a03/a3.cpp | // Compile with g++ -Wall -Wextra -Wpedantic -std=c++14
#include <iostream>
#include <iomanip>
#include "utils.h"
/**
* \brief Template function for integrating by a rieman summ
*
* This function will calculate a one-dimensional integral for a function F by calculating the riemann sum.
*
* u_b ... | ALGO | 0.998776 | 6.583925 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.