uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
88e088ec-e4f6-497a-99bf-4d027b76b643 | JCStillson21030/Team3FinalProjectCSC201TCC | Code Examples CW and HW/pointers.cpp | /******************************************************************************
Jonathon Stillson CSC201 CW 25MAR21
Pointers
*******************************************************************************/
#include <iostream>
using namespace std;
int main(){
int x = 124;
int y = 356;
int* intPtr1; //decl... | TOOL | 0.916956 | 4.118155 |
7a3946ed-6926-49c2-a099-1d463cd34a36 | tcgm/audacity | src/VoiceKey.cpp | /**********************************************************************
Audacity: A Digital Audio Editor
VoiceKey.cpp
?? Dominic Mazzoni
?? Shane Muller
*******************************************************************//*!
\class VoiceKey
\brief
This implements a voice key, detecting either the next "ON... | TOOL | 0.980511 | 6.514652 |
c194ff93-2dd9-4629-bd53-9f4163bad841 | GuilhermeGabriel/competitive-programming | uri/2370.cpp | #include <bits/stdc++.h>
using namespace std;
struct Pessoa {
int h;
string name;
};
bool orderNum(Pessoa p1, Pessoa p2){
return p1.h > p2.h;
}
bool orderAlpha(Pessoa p1, Pessoa p2){
return p1.name < p2.name;
}
int main(){
int qp, qt; cin >> qp >> qt;
Pessoa p_tmp;
vector<Pessoa> pessoas;
while(qp--){
c... | ALGO | 0.999825 | 3.96839 |
3de2af9c-c78d-4c16-9c25-12b63dcd6e4f | InsightDev/XMU-JudgeOnline | 5/1438.cpp | #include <map>
#include <string>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
map<string, int>::iterator it;
map<string, int>::iterator rm;
map<string, int> mp;
string st[3];
char s[11];
int n, i;
scanf("%d", &n);
while (n--) {
for (i = 0; i < 3; i++) {
s... | ALGO | 0.999777 | 3.654184 |
d8afdc3f-9323-4c9e-98bd-46ff909a0b25 | Hazewsky/OpenGL-graphics | deps/Box2D-master/Box2D/Box2D/Collision/b2BroadPhase.cpp | #include <Box2D/Collision/b2BroadPhase.h>
b2BroadPhase::b2BroadPhase()
{
m_proxyCount = 0;
m_pairCapacity = 16;
m_pairCount = 0;
m_pairBuffer = (b2Pair*)b2Alloc(m_pairCapacity * sizeof(b2Pair));
m_moveCapacity = 16;
m_moveCount = 0;
m_moveBuffer = (int32*)b2Alloc(m_moveCapacity * sizeof(int32));
}
b2BroadPha... | TOOL | 0.871868 | 6.901489 |
ca6b58dd-4201-46a5-ad0a-4d604425dbfb | al-pacino/Clustering | src_nothreads/main.cpp | #include <cmath>
#include <cassert>
#include <map>
#include <limits>
#include <vector>
#include <string>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <exception>
#include <stdexcept>
using namespace std;
#include <MpiSupport.h>
#include <Vector2d.h>
#include <DissimilarityMatrix.h>
#include <P... | ALGO | 0.999742 | 5.676362 |
a9f8db76-1769-4077-a172-01e88115a952 | openeuler-mirror/openjfx8 | modules/web/src/main/native/Source/ThirdParty/icu/source/common/dictbe.cpp | #include <utility>
#include "unicode/utypes.h"
#if !UCONFIG_NO_BREAK_ITERATION
#include "brkeng.h"
#include "dictbe.h"
#include "unicode/uniset.h"
#include "unicode/chariter.h"
#include "unicode/ubrk.h"
#include "utracimp.h"
#include "uvectr32.h"
#include "uvector.h"
#include "uassert.h"
#include "unicode/normlzr.h"... | TOOL | 0.925006 | 6.446648 |
bbbba604-9ded-4256-a613-107c9d7f9409 | naruto361/LeetCodeSolutions | MinimizeMaximumPairSumInArray.cpp | int minPairSum(vector<int>& nums) {
sort(nums.begin(),nums.end());
int maxi=0;
for(int i=0;i<nums.size()/2;i++)
{
maxi=max(maxi,nums[i]+nums[nums.size()-1-i]);
}
return maxi;
}
| ALGO | 0.999963 | 5.458984 |
79a7b0f7-1a11-47c6-8751-90436e5ca495 | misskalyani/Basic-CPP-Programming | Data Structure & Algorithm 2/Matrix/bfs.cpp | #include<iostream>
#include<stdlib.h>
#define MAX 10
using namespace std;
typedef struct
{
int data[MAX];
int front,rear;
}queue;
void initq(queue*q)
{
q->rear=q->front=-1;
}
int isempty(queue*q)
{
return (q->rear==q->front);
}
void addq(queue*q,int n)
{
q->data[++q->rear] = n;
}
int delq(queue*q)
{
return... | ALGO | 0.999985 | 3.303792 |
a9623b1e-305f-4e87-ab3b-3d50120169d3 | arsheelsheikh/4months-DSAchallenge | Cpp/Arrays/2586. Count the Number of Vowel Strings in Range.cpp | class Solution {
public:
int vowelStrings(vector<string>& words, int left, int right) {
int count = 0;
for (int i = left; i <= right; i++) {
string word = words[i];
if (isVowel(word[0]) && isVowel(word.back())) {
count++;
}
}
return... | ALGO | 0.999685 | 6.506572 |
d72211d5-5916-4784-8f34-d9fe51b062d6 | sameermansoori1/Abhiman_assignment | 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.998733 | 6.76775 |
41bfea1f-c05f-4b86-80ce-af3b6989301f | cod4i3/MyAtcoder | ABC100_199/ABC154/e.cpp | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll rec(string &S, int D, int k = 0, bool tight = true, int sum = 0) {
if (k == S.size()) {
return sum == D;
}
int x = S[k] - '0';
int r = tight ? x : 9;
int res = 0;
for (int i = 0; i <= r; i++) {
}
}
int main() {
s... | ALGO | 0.999832 | 4.907634 |
8c27947a-c86c-4b30-bbb0-86783de30f6b | ishandutta2007/codeforces | rosed/normal/1698/D.cpp | #include<bits/stdc++.h>
using namespace std;
namespace red{
#define int long long
#define double long double
#define ls(p) (p<<1)
#define rs(p) (p<<1|1)
#define lowbit(i) ((i)&(-i))
#define mid ((l+r)>>1)
#define eps (1e-15)
const int N=1e6+10,inf=2e9;
int n,m,ans;
int a[N];
bool vis[N];
map<int,int... | ALGO | 0.99987 | 3.810476 |
6c70d8b9-dab4-4cf4-a113-0c2aa882c1c3 | torres98/LeetCode-Solutions | 2sum.cpp | #include <vector>
#include <cmath>
#include <iostream>
#include <climits>
#include <algorithm>
#include <unordered_map>
using namespace std;
vector<vector<int>> twoSum(vector<int>& nums, int target) {
vector<vector<int>> res;
unordered_map<int, int> values_to_pos;
for (int i = 0; i < nums.size(); i++)... | ALGO | 0.999645 | 5.50029 |
14b8d3eb-280f-4127-966f-b373be82b664 | J2on/BaekjoonOnlineJudge | V2/BaekJoon_25305.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
/*
BaekJoon_25305 : 커트라인
n명의 학생이 응시, 상위 k명이 수상, 커트라인을 구하라 (커트라인 == 상 받은 사람 중 꼴지)
1<= n <= 1000
1<= k <= n
1<= x(학생의 점수) <= 10,000
*/
int main() {
int numN; // Num of students
int numK; // Num of winners
int numX; // score of stu... | ALGO | 0.999889 | 4.10144 |
e9bdc03a-651b-4c9e-bcad-ff113beb3fd2 | ishandutta2007/codeforces | fastmath/normal/1392/A.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) st... | ALGO | 0.999662 | 4.12579 |
d4f32855-4bf8-44ce-b5a4-b2cfb6af0b44 | ConradWarren/LeetCode-Challenges | 1970-LastDayWhereYouCanStillCross.cpp | #include <vector>
class Solution {
public:
bool Depth_Frist_Search(std::vector<std::vector<int>>& grid,std::vector<std::vector<bool>>& visted_nodes, int y, int x, int day) {
if (y < 0 || y >= grid.size() || x < 0 || x >= grid[0].size()) return false;
if (visted_nodes[y][x]) return false;
if (grid[y][x] <= day) ... | ALGO | 0.999588 | 6.093803 |
368dfe17-458a-4d07-bcd9-f0eb9610be20 | shubham405/CSES_SOLVED | Tree/companyQueries1.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
//int up[50000][17];
//vector<int> tree[50000];
void binary_lifting(ll src, ll parent, vector<ll> adj[],vector<vector<ll>> &up)
{
//cout<<src<<" "<<parent<<endl;
up[src][0]=parent;
//cout<<src<<" ->";
for(ll i =1;i<20;i++)
{
... | ALGO | 0.999932 | 4.326691 |
c8097d06-fd95-4099-9e7a-923876cc8b44 | jpwbernardi/Codigos | uri1210.cpp | /*
S: P - V[i] + C[0] , se n == N e i == M
min(P - V[i] + C[0], C[i]) , se n == N
P - V[i] + C[0] + S(1, n + 1) , se i == M
min(P - V[i] + C[0] + PD(1, n + 1), C[i] + PD(i + 1, n +... | ALGO | 0.999975 | 3.041543 |
850860de-7447-4f38-8675-13da20618506 | oknkc8/ITE2039 | Longest_common_sequence.cpp | // 2017029807_âȣ_12525
#include<bits/stdc++.h>
using namespace std;
string a, b, ans;
int dp[505][505];
int main() {
cin >> b >> a;
for (int i = 1; i <= a.size(); i++) {
for (int j = 1; j <= b.size(); j++) {
if (a[i - 1] == b[j - 1]) dp[i][j] = dp[i - 1][j - 1] + 1;
else dp[i][j] = max(dp[i - 1][j], dp[i]... | ALGO | 0.999985 | 3.305281 |
41345725-9ba7-4976-a139-183b8410f54c | TheStranger512/Competitive-Programming-Stuff | SPOJ/NY10C.cpp | /* Solved
* 8625. Just The Simple Fax
* File: NY10C.cpp
* Author: Andy Y.F. Huang
* Created on December 31, 2012, 4:07 PM
*/
#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <set>
#includ... | TEST | 0.996888 | 3.44041 |
e14b695e-caae-46d9-b8b5-a6aa4b6a2194 | AuroraStudiosDigipen/Borealis | Borealis/lib/JoltPhysics/Jolt/Physics/SoftBody/SoftBodyMotionProperties.cpp | #include <Jolt/Jolt.h>
#include <Jolt/Physics/SoftBody/SoftBodyMotionProperties.h>
#include <Jolt/Physics/SoftBody/SoftBodyCreationSettings.h>
#include <Jolt/Physics/SoftBody/SoftBodyContactListener.h>
#include <Jolt/Physics/SoftBody/SoftBodyManifold.h>
#include <Jolt/Physics/PhysicsSystem.h>
#include <Jolt/Physics/Bo... | ALGO | 0.969884 | 4.184487 |
37c25b14-6756-4f08-a611-2e54cb92293b | Sovol3d/Sovol-OrcaSlicer | OrcaSlicer/src/libslic3r/SLA/Clustering.cpp | #include "Clustering.hpp"
#include "boost/geometry/index/rtree.hpp"
#include <libslic3r/SLA/SpatIndex.hpp>
#include <libslic3r/SLA/BoostAdapter.hpp>
namespace Slic3r { namespace sla {
namespace bgi = boost::geometry::index;
using Index3D = bgi::rtree< PointIndexEl, bgi::rstar<16, 4> /* ? */ >;
namespace {
bool cmp... | ALGO | 0.999386 | 7.011903 |
714c7352-d372-4eda-8aa1-68039dea0431 | LittleYang0531/CQ-CSP-S-2021 | CQ-00301/airport/airport.cpp | #include<algorithm>
#include<iostream>
#include<cstdio>
const int N=1e5+5;
using namespace std;
//#define getchar gc
inline int read()
{
char h=getchar();
int y=0,q=1;
while(h<'0'||h>'9'){if(h=='-')q=-1;h=getchar();}
while(h>='0'&&h<='9')y=y*10+h-'0',h=getchar();
return y*q;
}
struct node{
int a,b;
bool operator... | ALGO | 0.999867 | 3.404474 |
2a8e8c67-6272-4dfd-a5b2-6daef8738c2f | kks227/BOJ | 3300/3392.cpp | #include <cstdio>
#include <algorithm>
using namespace std;
const int MAX = 1<<16;
struct Vert{
int x, y1, y2;
bool type;
Vert(): Vert(0, 0, 0, false){}
Vert(int x1, int y3, int y4, bool type1): x(x1), y1(y3), y2(y4), type(type1){}
bool operator <(const Vert &O){
if(x != O.x) return x < O.x;
return type < O.t... | ALGO | 0.999212 | 3.475437 |
78132e17-af3f-4c49-89c6-53b5dbef30c2 | ishandutta2007/codeforces | pajaraja/normal/1041/B.cpp | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a,long long b)
{
if(b==0) return a;
return gcd(b,a%b);
}
int main()
{
long long a,b,x,y;
cin>>a>>b>>x>>y;
long long d=gcd(x,y);
x=x/d; y=y/d;
cout<<min(a/x,b/y);
} | ALGO | 0.999588 | 3.593948 |
920e282e-782e-4ae9-825d-956f22034e60 | Jyunpp/Algorithm | Codeforce/Round 540/D1.cpp | // 20190304 21:40 ~ 22:10
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <memory.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <math.h>
using namespace std;
#define sd(x) scanf(" %d", &x);
#define slld(x) scanf(" %lld", &x);
#define pb push_... | ALGO | 0.999974 | 3.867399 |
1fc8bd66-3b7c-4f0d-939c-00afe26f7f22 | SaminRahman1/DSA | Basic Data Structures/Module - 19 (Problem Solving With Binary Tree)/diameter_of_a_binary_tree.cpp | //https://www.naukri.com/code360/problems/diameter-of-the-binary-tree_920552
// int mx;
// int max_height(TreeNode<int> *root) {
// if(root == NULL)
// return 0;
// int l = max_height(root->left);
// int r = max_height(root->right);
// int d = l+r;
// mx = max(mx,d);
// return max(l,r) +... | ALGO | 0.99857 | 5.685127 |
1244ecc9-3d85-4181-bcf2-2a4fb306d2a4 | hzfsls/leetcode-supercrawl | data/1704.determine-if-string-halves-are-alike/code_snippets/sol.cpp | class Solution {
public:
bool halvesAreAlike(string s) {
}
}; | ALGO | 0.988102 | 4.458858 |
678bd2cb-64f5-4ed7-8ea6-34f8f04c296d | Fungucide/Contest | ccc/ccc03s5.cpp | #ifndef _MSC_VER
#include <bits/stdc++.h>
#else
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <unordered_map>
#include <queue>
#include <list>
#include <stack>
#include <set>
#define scanf scanf_s
#endif
#define ll l... | ALGO | 0.999171 | 3.810846 |
bec6bc24-d618-4ffa-ac74-d7df07d05494 | Aritradutta2002/Crack-FAANG-Interview | DataStructures-Algorithms-Master/LeetCode/933.number-of-recent-calls.cpp | #include<deque>
class RecentCounter {
deque<int> req;
public:
RecentCounter() {
req = {};
}
int ping(int t) {
req.push_back(t);
while(req.front() < t-3000) req.pop_front();
return req.size();
}
};
/**
* Your RecentCounter object will be instantiated and ca... | ALGO | 0.991958 | 6.277006 |
82a5c920-af23-478a-9d21-6f120417d0b7 | Houzich/ANN-Image-Compression | Libraries/eigen-eigen-634efb91dccc/eigen-eigen-634efb91dccc/bench/perf_monitoring/trmv_upt.cpp | #include "gemv_common.h"
EIGEN_DONT_INLINE
void trmv(const Mat &A, Vec &B, const Vec &C)
{
B.noalias() += A.transpose().triangularView<Upper>() * C;
}
int main(int argc, char **argv)
{
return main_gemv(argc, argv, trmv);
}
| ALGO | 0.988034 | 4.898617 |
d11f1f10-2358-4adf-a593-4ad842e3b111 | Tahsin005/Problem-Solving | Week 2 Problems/B_Triple.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define Tahsin ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main(){
Tahsin
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int cnt[n + 1];
memset(cnt,0,sizeof(cnt));
int ans = -1;
... | ALGO | 0.999941 | 4.169274 |
e26076e1-6277-48f8-a519-72ddb90264b3 | alexandraback/datacollection | solutions_2453486_0/C++/gitu/tic.cpp | /*------Coded by Gitanshu Behal------*/
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<cctype>
#include<ciso646>
#include<stdbool.h>
#include<cstddef>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<complex>
#include<funct... | ALGO | 0.99976 | 4.033292 |
1a52d222-71e4-47fc-be7f-c0c5fe729cff | Sumu154/Object_Oriented_Programming | P_Exception hadling/1.exception block.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b, ans;
cin >> a >> b;
try{
if(b==0){
//throw "devide by zero error\n";
throw b;
}
ans = a/b;
cout << ans << "\n";
}
// catch(const char *e){
// cout << "exception occured\... | ALGO | 0.999018 | 3.588367 |
a2f08e8c-c43e-4ff8-9ba4-4215747ccb0b | ishandutta2007/codeforces | cerberus97/normal/758/A.cpp | /*
Hanit Banga
*/
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define fast_cin() ios_base::sync_with_stdio(false)
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
const int N = 1e2 + 5;
int a[N];
int main()
{
fast_cin();
int n, mx = 0;
cin >> n;... | ALGO | 0.99977 | 3.789886 |
e0732a82-5191-4deb-aecc-1b69869b9a40 | kmjp/procon | codeforce/701-750/743/b2.cpp | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... | ALGO | 0.999651 | 3.659664 |
65f8fc12-25c0-42fd-a7c0-d817eb7f5548 | MEtooHARD/Progran-Lab-II | w2/w2q4.cpp | #include <math.h>
#include <iostream>
using namespace std;
class TWT { // TollWayToll (大噓)
public:
int distance;
TWT(int distance) { this->distance = distance; }
int toll() {
return round(distance < 200 ? distance * 1.2
: 200 * 1.2 + ((distance / 200 - 1) * 200 +
... | ALGO | 0.976789 | 3.821109 |
ba9a7442-c9e6-4d6b-bda6-49f61258677d | pratyushiitd/CP | Fenwick Tree/2d_tree.cpp | // https://cses.fi/problemset/task/1739/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int MAX = 2e3+2;
int n, q;
int arr[MAX][MAX];
vector<vector<int>> bit;
void update(int x, int y, int val){
while(x <= n){
int d ... | ALGO | 0.999411 | 4.408591 |
c403003a-aace-4bbf-8393-34aeeb70da40 | sssem-312/E_M2 | 2.2/main.cpp | #include "2.2.h"
int main()
{
setlocale(LC_ALL, "Russian");
char ans[10];
int a, b, res;
printf(" Добро пожаловать в калькулятор! \n");
while (ans[0] != 'n')
{
printf(" Введите первый аргумент: ");
scanf(" %d", &a);
printf(" Введите второй аргумент: ");
... | TOOL | 0.923518 | 3.504562 |
4cc154fc-8eb0-4dcb-a9f0-745dd4468bca | RAPTORf472/CP | Graph/2SAT (Tarjan's SCC).cpp | int n, m;
vector<int> adj[2 * N];
int low[2 * N], num[2 * N], timeDfs, scc;
stack<int> order;
vector<int> comps[2 * N];
int sccID[2 * N];
void tarjan(int u) {
low[u] = num[u] = ++timeDfs;
order.push(u);
for (int v : adj[u]) {
if (num[v]) {
low[u] = min(l... | ALGO | 0.999976 | 4.574995 |
f38c4a86-4905-4353-8e5c-523ceecd1fcc | muhammad-sayem/Codeforces | C_Wheres_The_Bishop.cpp | #include<bits/stdc++.h>
#define endl '\n'
#define yes "YES"
#define no "NO"
#define ll long long
#define pb push_back
#define pii pair <int,int>
#define pll pair <long long,long long>
#define re... | ALGO | 0.999751 | 3.740706 |
599c0006-97a7-45dc-ac30-532cc879662d | odiazribagorda/ClassProjects | 2nd Year/C++/04.cpp | // Oscar Diaz Ribagorda (DG04)
#include <iostream>
#include <vector>
using namespace std;
struct tipoP {
int p = -1;
int max = 0;
};
ostream & operator<<(ostream & archSal, vector<tipoP> const& v) {
if (v.size() > 0) {
archSal << v[0].p;
for (int i = 1; i < v.size(); ++i)
archSal << ' ' << v[i].p;
}
re... | ALGO | 0.999981 | 4.226283 |
a4c7a3ed-bf1d-44ff-9726-57bb45ba2b34 | tsingke/Homework_Neumann | 于慧/Experiment_4/SOURCECODES/程序设计A.main.cpp | #include<iostream>
#include"head.h"
using namespace std;
int main()
{
int *e, *p;
p = new int [20];
e = p;
cout<<"Please input 20 integer"<<endl;
for(int i = 0; i < n; i++)
{
cin>>p[i];
}
PandDnumber(e);
calculate(e);
sortScore(e);
delete []p;
return 0;
}
| ALGO | 0.998562 | 3.069135 |
c834881a-3801-45e4-ab96-ada2eecbc21f | Peeyush609/Daily-Code | lc9.cpp | class Solution {
public:
int longestSubsequence(string s, int k) {
int n = s.size();
int zeroes = 0;
for(int i = n - 1 ; i >= 0; i--){
if(s[i] == '0'){
zeroes++;
}
}
int power = 0;
int len = zeroes;
long long sum = 0;
... | ALGO | 0.999982 | 6.129601 |
fd4ec964-6d14-4011-a570-8c95e6368318 | Golden-Eagle/kazakh | ext/bullet-2.83.5/src/BulletCollision/NarrowPhaseCollision/btPersistentManifold.cpp | #include "btPersistentManifold.h"
#include "LinearMath/btTransform.h"
btScalar gContactBreakingThreshold = btScalar(0.02);
ContactDestroyedCallback gContactDestroyedCallback = 0;
ContactProcessedCallback gContactProcessedCallback = 0;
///gContactCalcArea3Points will approximate the convex hull area using 3 points
... | ALGO | 0.960852 | 6.886747 |
7d18e492-c3f3-4677-b788-1361806d0df8 | stg0123/baekjoonlearn | graph/networkflow/bipartite matching/baekjoon2188.cpp | #include <iostream>
#include <vector>
using namespace std;
class cow_matching{
private:
vector<vector<int>> link;
vector<bool> visit;
vector<int> sol;
int N,M;
public:
cow_matching(){
std::cin >> N >> M;
link.resize(N+1);
visit.resize(M+1);
sol.resize(M+1,0);
... | ALGO | 0.999678 | 3.960186 |
0e09b180-7142-4c11-b175-d4d005cf2a9a | raincross7/code-similarity | codes/train_code/problem401/problem401_500.cpp | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
int main()
{
fast_in_out
int t,l;cin>>t>>l;
string s;
vector<string>con;
while(t--){
cin>>s;
con.pb(... | ALGO | 0.99985 | 3.685297 |
a9788c0d-ddd9-4900-a9e1-1bc9ec40bf6d | qgjoluw/leetcode | 145-postorderTraversal.cpp | vector<int> postorderTraversal(TreeNode *root) {
vector<int> result;
stack<TreeNode *> st;
TreeNode *p = root;
while (p)
{
//1. push root into stack;
st.push(p);
if (p->left)
{
//2. push left child into stack;
p = p->left;
}
else if (p->right)
{
//4. push right child int... | ALGO | 0.999974 | 5.115732 |
8f292610-9d61-407c-899c-5af9419e002a | trungdangtapcode/Competitive-Programming-Notebook | archived/my_desktop_grade11/SPOJ/AtcoderDPcontestHGrid1.cpp | #include <bits/stdc++.h>
using namespace std;
long long int p = 1e9 + 7;
long long int dp[1005][1005];
int h, w;
bool isRong[1005][1005];
int main(){
cin >> h >> w;
for (int i = 1; i <= h; i++){
string s;
cin >> s;
for (int j = 0; j < s.length(); j++) isRong[i][j+1] = (s[j]=='.');
}
// for (int i = 1; i <= h... | ALGO | 0.999913 | 4.373412 |
76a1f80d-037a-45df-987e-dd85551c1462 | CS-parth/CodeForces | A/A_Byteshima_and_Bytesaki.cpp | /*Jai Shri Ram*/
/*Jai Bajrang Bali*/
/*Hare krishna hare krishna krishna krishna hare hare hare rama hare rama rama hare hare*/
/*ॐ कृष्णाय वासुदेवाय हरये परमात्मने प्रणत क्लेशनाशाय गोविंदाय नमो नमः*/
#include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.ti... | ALGO | 0.999158 | 3.449345 |
3c3f4533-aa29-4f4d-a78c-aa6c2e451bca | Denchikaxaxa/Task1.2 | Task26/Task26.cpp | // Task26.cpp : Этот файл содержит функцию "main". Здесь начинается и заканчивается выполнение программы.
//
#include <iostream>
#include <math.h>
#include "Test.h"
using namespace std;
int main()
{
setlocale(LC_ALL, "Rus");
try
{
Test t;
double p;
cout << "Введите значение переменной p " << endl;
cin >... | ALGO | 0.998799 | 4.430533 |
cc70b5db-0a19-433a-83e9-7e81a8c902b5 | sachinprasanna7/DSA-Everyday | Day 13/DailyChallenge7_1_2023.cpp | #include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) { //FIRST SOLUTION, TLE
int n = cost.size();
for(int i = 0; i < n ; i++){
int tank = 0;
for(int j = i ; j < n + i ; j++){
... | ALGO | 0.999877 | 5.613 |
3ddc6e39-9735-4cbb-af5b-d9817dd7b31d | Mittal854/III | Computer Networks/c++/functions_prototype.cpp | #include<iostream>
using namespace std;
int sum(int a,int b); //--> Acceptable
int main(){
int num1,num2;
cout<<"Enter first number: ";
cin>>num1;
cout<<"Enter second number: ";
cin>>num2;
cout<<"The sum is "<<sum(num1,num2);
return 0;
}
int sum(int a,int b){
int c=a+b;
return c;
} | ALGO | 0.995153 | 4.294582 |
0a6c9bd4-6a2c-464d-945f-e3a6fc794254 | NitaiBanik/My-algorithm | Union Find Disjoint/G. Path Queries.cpp | #include<bits/stdc++.h>
using namespace std;
struct st
{
long long x,y,z;
st(long long p, long long q, long long r)
{
x = p,y = q, z = r;
}
bool operator <(const st&p) const
{
return z<p.z;
}
};
struct qq
{
long long x,y;
} Q[200005];
bool comp1(qq x, qq y)
{
return ... | ALGO | 0.999969 | 3.771591 |
d85465be-bbe7-4081-9a11-f06d5338b4ad | Jaswanth03-cyber/Competitive-Programming | Algorithms/Graph Algorithms/adjacencymatrix_graph.cpp | #include<bits/stdc++.h>
using namespace std ;
class graph{
private:
int vertices ;
int edges ;
int **weight;
public:
graph(int n){
this->vertices = n ;
this->edges = 0 ;
weight = new int*[n] ;
for(int i = 0 ; i < n ; i++){ // way of allocating dynamic memor... | ALGO | 0.999624 | 4.858539 |
90eb9e94-2a78-4383-9926-eabf3b818679 | ishandutta2007/codeforces | 1.618/normal/1227/G.cpp | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
const int LEN = 100000;
struct fastio{
int it,len;
char s[LEN + 5];
fastio(){
it = len = 0;
}
char get(){
if(it < len) return ... | ALGO | 0.999916 | 3.258532 |
1acc26cd-ee42-4ce6-9b37-15ccdec7e7c5 | suman1406/waste_manage | 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 |
51272241-f078-47e1-8574-4827fd8996af | QbitQuantum/Basics | Исходники/ei_maya_phong_architectural.cpp | color getPhong(
const normal& i_N, const vector& i_V, const float cosinePower,
const eiBool i_keyLightsOnly, const eiBool unshadowed)
{
color C = 0.0f;
vector R = reflect( normalize(i_V), normalize(i_N) );
LightSampler sampler(this, P, i_N, PI/2.0f );
float isKeyLight = 1;
//if( i_keyLightsOnly != 0... | ALGO | 0.953399 | 3.815601 |
f372fcbb-83fa-46b3-af4d-34e5ff6f10c7 | IamHammadDevX/Data-Structures-And-Algos- | BinarySearchTree(BST)/largestBst.cpp | #include<iostream>
#include<queue>
using namespace std;
class node {
public:
int data;
node* left;
node* right;
// constructor
node(int d) {
this->data = d;
this->left = NULL;
this->right = NULL;
}
};
// make info class
class info {
public:
int maxi;
int mini;... | ALGO | 0.99999 | 5.89441 |
62352da2-9f44-4f58-a0f1-3e1568915979 | ojaster/first_project | cpp_xcode/FIrst_Project/FIrst_Project/proc3.cpp | //#include <iostream>
//#include <math.h>
//using namespace std;
//void powerA234(double y, double x, double & half, double & geometry_half);
//int main(){
// double x;
// double y;
// double half;
// double geometry_half;
// cin>>x;
// cin>>y;
// powerA234(x,y,half,geometry_half);
// cout<<half... | ALGO | 0.999514 | 3.558079 |
daeecd34-971a-491d-9ae1-32a2fe037000 | WhatTheMUCK/Olympiad-Programming | Тренировки по алгоритмам 5.0 от Яндекса/Занятие 1 (Сложность, тестирование, особые случаи)/D. Слоны и ладьи/main.cpp | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
void bishop(vector<vector<int>>& chessboard, int x, int y){
for (int i = 1; x + i < 8 && y + i < 8 && chessboard[x + i][y + i] < 2; i++)
chessboard[x + i][y + i] = 1;
for (int i = 1; x + i < 8 && y - i >... | ALGO | 0.996163 | 4.083962 |
04337442-e6f0-48bb-9145-c55cbc5cf844 | Yashsankpal/AlgoVisualizer | .history/heapSort/main_20210908013720.cpp | #include <SFML/Graphics.hpp>
#include<iostream>
#include<bits/stdc++.h>
using namespace sf;
struct Data{
int height;
int posx;
};
class Box{
public:
std::vector<Data> column;
Box(int value){
Data data;
for(int i=0;i<value;i++){
data.posx = i;
data.height = 1 + rand()%(600);
... | ALGO | 0.983864 | 3.892802 |
354de03e-e9ba-4732-b033-785f313d2360 | access-softek/llvm-project | libcxx/test/std/algorithms/alg.sorting/alg.min.max/min_init_list_comp.pass.cpp | // UNSUPPORTED: c++03
// <algorithm>
// template<class T, class Compare>
// T
// min(initializer_list<T> t, Compare comp);
#include <algorithm>
#include <functional>
#include <cassert>
#include "test_macros.h"
int main(int, char**)
{
int i = std::min({2, 3, 1}, std::greater<int>());
assert(i == 3);
... | TEST | 0.992916 | 5.661092 |
af2e567f-a497-442a-bf44-207938b9e9bd | kenny8/cpp_work | dz_1/ConsoleApplication1/ConsoleApplication1/ConsoleApplication1.cpp | // ConsoleApplication1.cpp : Этот файл содержит функцию "main". Здесь начинается и заканчивается выполнение программы.
//
#include <iostream>
using namespace std;
int factorial(long int x);
float sin_1(int x = 1, int y = 10);
float sin_2(float x = 0.1, float y = 1.1);
void snow(int a);
int main()
{
setlocale(LC_... | TOOL | 0.981578 | 3.057569 |
c91b5c6c-2c8c-4c80-876e-9465dfff1410 | Fiddich-Dev/Algorithm | week6/11053-1.cpp | #include <bits/stdc++.h>
using namespace std;
int n;
int a[1004];
int cnt[1004];
int ret;
int main() {
cin >> n;
for(int i = 0; i < n; i++) {
cin >> a[i];
}
fill(&cnt[0], &cnt[0] + 1004, 1);
for(int i = 0; i < n; i++) {
for(int j = 0; j < i; j++) {
if(a[j] < a[i] && c... | ALGO | 0.999842 | 4.18774 |
4f02b362-a013-464b-929e-8e00c27c35b5 | yaochong-cc/LinkedList | 链表类.cpp | ////来自csdn
//
//#include <iostream>
//#include <stdexcept>//异常处理头文件
//
//using namespace std;
//
////节点类实现
//// 链表节点类
//template<typename T>
//class node
//{
//public:
// node() : next(nullptr) {} //默认构造函数
// node(T val) : data(val), next(nullptr) {}//构造函数
//private:
// T data;
// node* next;//指向下一个节点的指针
//... | ALGO | 0.997295 | 3.650704 |
d8bb6672-dd8c-4257-87f4-e8433eceddcb | 6Farkas9/LeetCode100 | furth_time/8_binary_tree/t42/main.cpp | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
vector<int> nums = {-10,-3,0,5,9};
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int... | ALGO | 0.999998 | 5.510078 |
4fed7943-d5dd-4b97-b4a8-084a36e11e40 | prajogotio/upsolving | CF:287:2:D/a.cpp | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long dp[1003][103];
long long ways[1003];
int N;
long long K, MOD;
int main(){
scanf("%d",&N);
cin >> K;
cin >> MOD;
long long pow10 = 1;
for(int i=N;i>=1;--i){
for(int j=0;j<10;++j){
if(i == 1 && j == 0) continue;
long l... | ALGO | 0.99984 | 3.809534 |
9464de73-aed5-4672-b3c4-b97474b3f8c4 | wondol2/ps | problems/baekjoon/10773.cpp | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include "debug.h"
#else
#define debug(x)
#endif
void solve(){
int K; cin >> K;
vector<int> v;
int a;
for(int i=0; i<K; ++i){
cin >> a;
if(a == 0) v.pop_back();
else v.push_back(a);
}
int sum = 0;
f... | ALGO | 0.998773 | 4.284914 |
eccaf06f-8cec-46b1-a128-7cf7f78bf950 | tum-vision/afs | src/main.cpp |
#include <main.hpp>
int main(int argc, char **argv)
{
/** Set start-end indices**/
int from = 0, to = -1;
/** Set the image name for single image evaluation **/
string name ="";
Model *model = new Model();
Dataset *dataset= new Test();
Timer *run_time = new Timer();
/** Boole... | DATA | 0.92794 | 5.409515 |
58ca6c1c-44f2-44aa-85cc-2478ba42b438 | ML-UCV/ML-CodeBert-DistinctSolutions | Raw Dataset/evaluare/ast/train/40f1a099-eea2-420e-9071-dd873ce53e07.cpp | #include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
const int MAXN = 100041;
char sir[MAXN];
int par[MAXN];
struct Nod
{
int val;
char op;
Nod *st, *dr;
Nod(char _op, Nod* _st, Nod* _dr) {
op = _op;
st = _st;
dr = _dr;
}
Nod(int... | ALGO | 0.999951 | 3.714064 |
cbb10d81-e6c1-4199-bec5-aae71610d034 | shubham24680/Cpp-Language | TowerOfHanoi.cpp | #include <iostream>
#include <conio.h>
using namespace std;
void towerOfHanoi(int n, char from, char to, char mid)
{
if (n == 0)
return;
towerOfHanoi(n - 1, from, mid, to);
cout << "Move disk " << n << " from rod " << from << " to rod " << to << endl;
towerOfHanoi(n - 1, mid, to, from);
}
int ... | ALGO | 0.999451 | 5.890498 |
e88c6e6f-23e5-4afa-9285-c248397788c5 | ericsong917/Coding-Test | 프로그래머스/lv2/43165. 타겟 넘버/타겟 넘버.cpp | #include <string>
#include <vector>
using namespace std;
int len ;
int t;
int ans=0;
vector<int> nums;
void backtrack(int depth, vector<int> vec){
if(depth == len){
int sum=0;
for(auto e : vec){
sum+=e;
}
if(sum==t)
ans++;
return;
}
vector<int... | ALGO | 0.999978 | 5.529121 |
63d50bcd-e4a8-45d7-87ea-e965435ece51 | tamaskenez/advent-of-code | 2021/d22.cpp | #include "common.h"
int P1()
{
ifstream f(CMAKE_CURRENT_SOURCE_DIR "/d22_input.txt");
assert(f.good());
auto lines = read_lines(f);
set<AI3> s;
for (auto l : lines) {
bool on;
if (starts_with(l, "on ")) {
on = true;
l = l.substr(3);
} else if (starts... | ALGO | 0.99004 | 4.814467 |
d52fc1a2-7568-45ab-a12a-33ee0cf44cc4 | ajkumar-1907/learningDSA | Lecture5/6.cpp | #include<iostream>
using namespace std;
int main() {
int n ;
cout<<"Enter the value of n : ";
cin >> n;
int sum = 0;
for(int i=1; i<=n; i++ ) {
//sum = sum + i;
sum += i;
}
cout<< sum <<endl;
return 0;
} | ALGO | 0.99369 | 3.624697 |
7cedd9dc-ef36-457a-854d-c8536437ab39 | gkulkarn82/datastructure | Threading/Threading_2.cpp | #include<iostream>
#include<thread>
#include<mutex>
#include<condition_variable>
std::mutex mu;
std::condition_variable cd;
int count = 1;
void printOdd()
{
for(; count < 100;)
{
std::unique_lock<std::mutex> locker(mu);
cd.wait(locker,[]() { return (count % 2 == 1); });
std::cout << "F... | ALGO | 0.967061 | 5.393605 |
9044a5bb-4b33-488d-b11e-0c2446c8e81e | danadrianmirea/CTCI-solutions | Chapter 1 - Arrays and Strings/Is Unique/is_unique.cpp | //https://ide.geeksforgeeks.org/PXfVawytO8
#include <bits/stdc++.h> // Include every standard library
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typ... | ALGO | 0.997002 | 4.705333 |
31e9eb5b-60dc-4e56-89a7-c294369b7c21 | Harshit2047/LeetCode | 518-coin-change-ii/coin-change-ii.cpp | class Solution {
public:
int helper(vector<int> &coins, int amount, int idx, vector<vector<int>> &dp) {
if (amount == 0) return 1;
if (idx == coins.size()) return 0;
if (dp[idx][amount] != -1) return dp[idx][amount];
int include = 0;
if (amount >= coins[idx]) {
... | ALGO | 0.999958 | 6.058027 |
368b8777-926b-4f18-98d0-50b0c0fd3dc1 | ja-ho/swfc | binary_tree/binary_tree_list.cpp | #include <cstdio>
#include <cstdlib>
typedef struct _node
{
int data;
char name[6];
_node *left;
_node *right;
} node;
typedef struct _tree{
node *root;
int size;
} tree;
void init_tree(tree *ptr)
{
ptr->size = 0;
ptr->root = (node *)malloc(sizeof(node));
ptr->root->left = NULL;
ptr->root->right = NULL;
}
... | ALGO | 0.999413 | 3.627571 |
c83f2bb1-f8f1-47a4-a7d2-faca09c3025e | wenqf11/LeetCode | C++/237. Delete Node in a Linked List/main.cpp | #include <iostream>
#include "solution.h"
int main() {
Solution s;
ListNode *head = new ListNode(0);
head->next = new ListNode(1);
head->next->next = new ListNode(2);
s.deleteNode(head->next);
delete head->next;
delete head;
return 0;
}
| ALGO | 0.998593 | 4.151866 |
da5f734b-0059-47e6-a399-f9954510d6d7 | jharkawat/cp-codes | algozenith/6_week/square_sum.cpp | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
/*
conditions
*/
void solve()
{
ll n; cin >> n;
ll mean = 0;
ll A[n];
for(ll i=0; i<n; i++){
cin >> A[i];
mean += A[i];
}
ll avg = ceil(mean/n);
... | ALGO | 0.999861 | 5.508074 |
d212e255-2baf-4f78-9e05-f635d645deab | LYXRhythm/Py-CPP-LUT | eigen-3.4.0/unsupported/doc/examples/BVH_Example.cpp | #include <Eigen/StdVector>
#include <unsupported/Eigen/BVH>
#include <iostream>
using namespace Eigen;
typedef AlignedBox<double, 2> Box2d;
namespace Eigen {
Box2d bounding_box(const Vector2d &v) { return Box2d(v, v); } //compute the bounding box of a single point
}
struct PointPointMinimizer //how to compute squa... | ALGO | 0.999862 | 6.502348 |
1b3a52ed-9a88-4945-91ee-4f9b71ce3c0a | slitvinov/lammps-sph-multiphase | src/fix_press_berendsen.cpp | #include "string.h"
#include "stdlib.h"
#include "math.h"
#include "fix_press_berendsen.h"
#include "atom.h"
#include "force.h"
#include "comm.h"
#include "modify.h"
#include "fix_deform.h"
#include "compute.h"
#include "kspace.h"
#include "update.h"
#include "respa.h"
#include "domain.h"
#include "error.h"
using name... | ALGO | 0.95563 | 6.135087 |
cf6ebbfc-afda-4b05-b9b7-55527cd50532 | UbertoGC/competitive_programming | Online_Judge/SET1/Clock_Hands.cpp | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
double m,hora,angulo,horaAng,minutoAng;
char dot;
while(1){
cin >> hora >> dot >> m;
if(hora==0 && m==0)
break;
horaAng=hora*30+(m/60)*30;
minutoAng=m*6;
angulo=(... | ALGO | 0.999397 | 3.480062 |
c67725d0-246e-49eb-9e35-78c96d4eebcb | fufaich/SomeSort | main.cpp | #include <iostream>
#include "SomeSort.h"
template <typename T, size_t N>
void printList(const T (&list)[N]) {
std::cout << "List: [";
for (size_t i = 0; i < N; i++) {
std::cout << list[i];
if (i != N - 1)
std::cout << ", ";
}
std::cout << "]" << std::endl;
}
int main(){
... | ALGO | 0.998584 | 4.542633 |
f451a24c-32dc-4e67-81f7-68831007adb3 | Imran4424/C-Plus-Plus-Object-Oriented | 6. Polymorphism/3. Operator Overloading/6. Comparison Operator/1.Equal_NotEqual.cpp | #include <iostream>
using namespace std;
class Person
{
private: string name;
private: int moneyAmount;
public: Person()
{
name = "";
moneyAmount = 0;
}
public: Person(string name, int moneyAmount)
{
this -> name = name;
this -> moneyAmount = moneyAmount;
}
public: bool operator== (const Person &im... | ALGO | 0.924275 | 3.833871 |
f411d597-3b67-4a09-919a-29dae1a43943 | NavdeepSinghNegi999/DSA | 21_merge_Sort.cpp |
void merge(vector<int>&arr, int l, int mid, int h){
int s1 = mid-l+1;
int s2 = h-mid;
int *arr1 = new int[s1];
int *arr2 = new int[s2];
for(int i=0; i<s1; i++) arr1[i] = arr[l+i];
for(int i=0; i<s2; i++) arr2[i] = arr[mid+i+1];
int i =0,j=0,k=l;
while(i < s1 && j < s2){
if(... | ALGO | 0.999793 | 4.981991 |
58e755d0-62bc-4cb9-904b-df44615d6a85 | ShawnTSH1229/XEngine | ThirdParty/boost_1_78_0/libs/contract/example/features/check.cpp | #include <boost/contract.hpp>
int gcd(int const a, int const b) {
int result;
boost::contract::check c = boost::contract::function()
.precondition([&] {
BOOST_CONTRACT_ASSERT(a > 0);
BOOST_CONTRACT_ASSERT(b > 0);
})
.postcondition([&] {
BOOST_CONTRACT... | ALGO | 0.938407 | 7.122193 |
f9e2823f-c9d0-4250-9d8b-724c856ba03a | Reido50/CSE-232 | Lecture Examples/06.8-lychrel.cpp | #include<iostream>
using std::cout; using std::endl; using std::cin;
using std::boolalpha;
#include<string>
using std::string; using std::to_string; using std::stol;
long rev_num(long num){
string rev = "";
string str = to_string(num);
for (int i = str.size()-1 ; i >= 0 ; --i){
rev += str[i];
}
return st... | ALGO | 0.999169 | 4.146806 |
6049096d-f4fc-4f85-b0df-fe31dc7619bc | wlals1126/BOJ | 02800/02840/2846.cpp | #include <iostream>
#include <vector>
#include <string>
#include <sstream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N);
string input;
getline(cin, input);
getline(cin, input);
istringstream iss(input);
for (int i = 0; i < N; i++)
iss >> arr[i];
i... | ALGO | 0.999574 | 4.457097 |
6a031835-a8f5-440e-b91b-c1143d032960 | 420198/Saxion | Jaar_2/Project Netwerken/Node/cryptopp/vmac.cpp | // vmac.cpp - written and placed in the public domain by Wei Dai
// based on Ted Krovetz's public domain vmac.c and draft-krovetz-vmac-01.txt
#include "pch.h"
#include "config.h"
#include "vmac.h"
#include "cpu.h"
#include "argnames.h"
#include "secblock.h"
#if defined(CRYPTOPP_DISABLE_VMAC_ASM)
# undef CRYPTOPP_X86... | ALGO | 0.942252 | 6.286158 |
010adc81-92a8-436f-b8f0-d6a1c6a79795 | zaki/ojlc | atoi.cpp | /* vim:set sw=4:ts=4: */
#include <stdio.h>
#include <string>
#include <vector>
#include <iostream>
using std::string;
class Solution
{
static const int overflowP = 2147483647;
static const int overflowM = -2147483648;
enum State { START, SIGN, DIGITS };
public:
int atoi(const char *str)
{
int... | ALGO | 0.999026 | 4.46115 |
1d27e03d-4f74-4e08-b962-10a8978569f7 | shivamngpal/DSA-practice | array practice/Array assignment/KeyPair.cpp | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
pair<int,int> TwoPointerKeyPair(vector<int>& arr, int x){
int i=0;
int j=arr.size()-1;
int sum=0;
pair<int,int> p = make_pair(-1,-1);
while(i<j){
sum=arr[i]+arr[j];
if(sum==x){
p.first = arr[i]... | ALGO | 0.999997 | 5.177788 |
4dd80b47-adcb-4d5b-9769-d17498f8ca1d | ak1rou/CPPcourse | HW25/HW25/HW25.cpp | #include "graph.h"
int getTime() { return 1; }
int main()
{
GraphAdjList graph(11, Graph::ConnectionType::directed);
graph.addEdge(1, 2);
graph.addEdge(2, 5);
graph.addEdge(5, 9);
graph.addEdge(1, 4);
graph.addEdge(4, 8);
graph.addEdge(1, 3);
graph.addEdge(3, 6);
graph.addEdge(6... | ALGO | 0.997199 | 5.752904 |
fec9e3dc-1753-43b5-afc5-0d0e1f254f94 | DenisDerX/NUFT_OPRA | SM_1/LAB_6/Work6_3/Work6_3.cpp | #include <stdlib.h>
#include <iostream>
#include <stdio.h>
#include <windows.h>
using namespace std;
int main()
{
system("cls");
setlocale(LC_ALL, "Ukr");
const int n = 10;
int i, a[n];
cout << "Введіть масив А[" << n << "]= ";
for (i = 0; i < n; i++)
{
cin >> a[i];
}
system... | ALGO | 0.996088 | 3.438736 |
102213cb-5ac8-4da4-b249-b3bdcc9f3c1a | FontJuanIgnacio/ESTRUCTURA-DE-DATOS | ESTRUCTURA DE DATOS - Ejercicio N°1.cpp | #include<iostream>
using namespace std;
int main()
{
//declaración de variables
string x;
string L[5]={"2","5","7","9","10"}; // arreglo
bool encontrado = false; // Bandera para indicar si se encontró el elemento
cout << "Ingrese el elemento a buscar: ";
cin >> x;
for(int i = 0;... | ALGO | 0.99772 | 3.694273 |
457c4419-1dd8-4395-a207-7a9e4e1d9d68 | JasonCeng/MultipartyPSI-Pro | thirdparty/linux/miracl/miracl_osmt/source/curve/pairing/mnt.cpp | /*
* program to generate MNT Elliptic curves
*
* Compile as (for example)
* cl /O2 /GX mnt.cpp big.cpp miracl.lib
*
* See Miyaji, Nakabayashi & Takano "New explicit conditions of elliptic curve
* traces for FR-reduction", IEICE Trans. Fundementals., Vol. E84A, No. 5,May
* 2001
*
* Invoke as mnt N where k= 3... | ALGO | 0.997198 | 3.534577 |
473eebcc-ee7e-48eb-bae0-cfa60374d07d | gabrielavm/Introduction_To_Programming-Tasks | String Correctness Checker/stringCorrectnessChecker.cpp | #include <iostream>
using namespace std;
const int ARRAYSIZE = 1024;
const int MAXSIZE = 255;
void checkStringCorrectness(char array[])
{
int numberOfOpenScope = 0;
int numberOfCloseScope = 0;
for (int i = 0; i < MAXSIZE; ++i)
{
if (array[i] == '(')
{
++numberOfOpenScope;
}
if (array[i] == ')')
{
... | ALGO | 0.983736 | 4.281675 |
9e3d622b-2f81-4e79-bf33-737ad699430f | guimello/OldSchoolBreakout | libs/Box2D/Dynamics/Contacts/b2ContactSolver.cpp | #include <Box2D/Dynamics/Contacts/b2ContactSolver.h>
#include <Box2D/Dynamics/Contacts/b2Contact.h>
#include <Box2D/Dynamics/b2Body.h>
#include <Box2D/Dynamics/b2Fixture.h>
#include <Box2D/Dynamics/b2World.h>
#include <Box2D/Common/b2StackAllocator.h>
#define B2_DEBUG_SOLVER 0
b2ContactSolver::b2ContactSolver(b2Conta... | ALGO | 0.999587 | 6.633346 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.