uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
bd734c2c-67e1-4fca-b6c6-9c13f494f445 | crespo2014/cpp-exam | ch01/c1_5_15.cpp | #include <iostream>
#include <queue>
#include <deque>
#include <vector>
#include <functional>
using namespace std;
int main()
{
int a1[]={1,2,3,4,5,6,7,8,9,10};
//1. default constructor
priority_queue<int> s1;
//2. copy constructor;
priority_queue<int> s2(s1);
//3. initiilization using iterators
vector<int> ... | TOOL | 0.857127 | 3.955008 |
8544855a-a29b-4437-af57-5176df2617a9 | mumba-org/mumba | third_party/boost/src/libs/compute/perf/perf_bolt_exclusive_scan.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <bolt/cl/scan.h>
#include <bolt/cl/copy.h>
#include <bolt/cl/device_vector.h>
#include "perf.hpp"
int main(int argc, char *argv[])
{
perf_parse_args(argc, argv);
std::cout << "size: " << PERF_N << std::endl;
bolt::cl::control ctrl = bo... | ALGO | 0.899975 | 3.956727 |
0a318bc0-3fb6-44f4-b851-aa027c5a9c4c | madhumitha01/Data-Structures-and-Algorithms | XorAgain.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int a[n];
int ans=0;
for (int i = 0; i<n; i++)
{
cin >> a[i];
a[i]=2*a[i];
ans=ans^a[i];
}
cout<<... | ALGO | 0.999901 | 3.560899 |
7da89556-9ddd-4910-abfc-8a8a910beb03 | mayurnagrale/Codes | Array_Problems/mergeInterval.cpp | #include<bits/stdc++.h>
using namespace std;
vector<int> solve(vector<pair<int,int>> pv){
vector<int> res(15,0);
for(int i=0;i<pv.size();i++){
res[pv[i].first] += 1;
if(pv[i].second< pv.size()){
res[pv[i].second+1] = res[pv[i].second+1
] - 1;
}
}
//prefix... | ALGO | 0.998573 | 4.21574 |
7635139a-6469-49fc-9e4d-bff842c0a3eb | south37/codeforces | round622/c/c.cpp | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L"... | ALGO | 0.999999 | 3.580503 |
2b892541-dc9a-42cb-b315-e94933beb3fa | KimmiGYH/LeetCode_Notes_Public | Solutions_0001-1000/0112_Path Sum_路径总和/cpp_1_recursion_v2.cpp | // Definition for a binary tree node.
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {... | ALGO | 0.999963 | 6.099952 |
6b3ebc8e-5a20-4ed1-9c6a-bf2665e13bee | MdShah-alam/Contest | 964 (Div. 4)_C.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int n,s,m;
cin>>n>>s>>m;
vector<pair<int,int>>p;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
p.push_back({a,b});
}
bool found=false;
... | ALGO | 0.999897 | 3.675614 |
bb6a7bad-fbd0-484d-885d-59253a17b2b1 | ParasAnxi/CodeForce | 1878A.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using cd = complex<double>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using pll = pair<ll, ll>;
using ppii = pair<int, pii>;
using vi = vector<int>;
using vd = vector<double>;
us... | ALGO | 0.999983 | 4.901969 |
d2524330-8395-4810-b782-17363e71a9a0 | VasylKudrych/ConsoleApplication4.7- | ConsoleApplication4.7,/ConsoleApplication4.7,.cpp | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main()
{
double xp, xk, x, dx, eps, a = 0, R = 0, S = 0, i;
int n = 0;
cout << "xp = "; cin >> xp;
cout << "xk = "; cin >> xk;
cout << "dx = "; cin >> dx;
cout << "eps = "; cin >> eps;
cout << fixed;
cout <<... | ALGO | 0.998108 | 3.411726 |
d9353fa1-65af-48f9-9e3c-60065ba306fe | abhradeepbarman/dsa-supreme | 13- BST/Assignments/flatten_bst_to_sorted_LL.cpp | #include<bits/stdc++.h>
using namespace std;
class TreeNode {
public:
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int data) {
this->val = val;
this->left = NULL;
this->right = NULL;
}
};
void inorder(TreeNode* root, TreeNode* &prev) {
if(root == NULL) {
... | ALGO | 0.999908 | 4.821402 |
16ce9e99-5bda-4d10-8c1b-ad80defd516a | hummingbird-12/boj-solutions | Solutions/15727_조별과제를 하려는데 조장이 사라졌다.cpp | #include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cassert>
#include <algorithm>
#include <array>
#include <bitset>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <n... | ALGO | 0.999915 | 4.016871 |
dab29449-d61c-4c2b-9974-3c1f94ff593e | unstoppableayush/CPP-Codes | snake.cpp | //snake game in c
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <conio.h>
#include<time.h>
#include<ctype.h>
#include <time.h>
#include <windows.h>
#include <process.h>
#define UP 72
#define DOWN 80
#define LEFT 75
#define RIGHT 77
int length;
int bend_no;
int len;
char key;
void record();
v... | TOOL | 0.996179 | 3.199507 |
d0e2a640-1df8-4f6e-87cf-52cbf4c5483a | rubengb18/Metodos-algoritmicos-de-resolucion-de-problemas-MARP2 | MARP2/Problema21/Problema24/Problema24.cpp | #include <fstream>
#include<iostream>
#include <vector>
#include<algorithm>
#include "Matriz.h"
using namespace std;
bool esValida(vector<int>& prod_en_mercado, int& coste, int& coste_min,int i) {
if (prod_en_mercado[i] > 3||coste>coste_min) {
return false;
}
return true;
}
void resolver(Matriz<int>&lista,int k,... | ALGO | 0.999827 | 3.987129 |
1b50c838-e601-42d9-a92f-bb02c7b02677 | albar965/atools | src/geo/calculations.cpp | #include "geo/calculations.h"
#include "geo/line.h"
#include "geo/linestring.h"
#include <QDateTime>
#include <QLineF>
#include <QPointF>
#include <QRect>
namespace atools {
namespace geo {
float distanceToLine(float x, float y, float x1, float y1, float x2, float y2, bool lineOnly,
LineDist *d... | ALGO | 0.994723 | 6.639307 |
6ed04584-2ad8-41f8-b37e-686811d52f96 | lakshits11/LeetCode | 0989-add-to-array-form-of-integer/0989-add-to-array-form-of-integer.cpp | class Solution {
public:
vector<int> addToArrayForm(vector<int> A, int K) {
for (int i = A.size() - 1; i >= 0 && K > 0; --i) {
A[i] += K;
K = A[i] / 10;
A[i] %= 10;
}
while (K > 0) {
A.insert(A.begin(), K % 10);
K /= 10;
}
... | ALGO | 0.999664 | 5.829873 |
00bf38de-26c6-4441-b48e-670b722401c0 | littleGnAl/mirror_platform_frameworks_av | media/module/codecs/amrnb/dec/src/a_refl.cpp | /*
------------------------------------------------------------------------------
Filename: /audio/gsm-amr/c/src/a_refl.c
Functions: a_refl
Date: 02/05/2002
------------------------------------------------------------------------------
REVISION HISTORY
Description: Removing unneeded include files and the ... | ALGO | 0.999835 | 5.786362 |
e5e3e398-aaa7-49a2-a9a1-4524657e2a98 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_10663_3.cpp | #include <bits/stdc++.h>
using namespace std;
const double eps(1e-8);
int n;
int x[1000010];
vector<int> ans;
int main() {
scanf("%d", &n);
int a;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
x[a] = 1;
}
int s = 1000000;
int m = 0;
for (int i = 1; i <= s; i++) {
if (x[i] && !x[s - i + 1]) an... | ALGO | 0.999745 | 3.179059 |
513b2a5c-f339-4ee3-adbc-402b11510b78 | FlorianPerigne/tvf_compu | NPDPut.cpp | #include "NPDPut.hpp"
//constructor for the basket put
NPDPut::NPDPut(double strike, std::vector<double> weights)
:NonPathDependent(strike), NPD_weights(weights)
{
}
//constructor for vanilla put
NPDPut::NPDPut(double strike)
:NonPathDependent(strike)
{
NPD_weights.push_back(1);
}
std::vector<double> NPDPut::ge... | ALGO | 0.999589 | 5.181932 |
cb647997-ed35-4e8f-bec9-296d69ee779c | TURBO70/LeetCode-Solutions | 2348-number-of-zero-filled-subarrays/2348-number-of-zero-filled-subarrays.cpp | class Solution {
public:
long long zeroFilledSubarray(vector<int>& v) {
long long ans = 0, cnt = 0,n=v.size();
for (int i = 0; i < v.size(); i++) {
if (v[i] == 0) {
cnt++;
} else {
ans += ((cnt * (cnt + 1)) / 2);
cnt=0;
... | ALGO | 0.999979 | 5.940106 |
e8bd185f-6579-4a5a-8137-425706b6ebe6 | lekien66-dhcn/Dirty-Money-Detection | Serial_Detection.cpp | #include "Serial_Detection.h"
#include "Sobel_Filter.h"
#include "Canny_Filter.h"
Mat Display_Serial(Mat img, Mat cop) {
//Mat image_copy = img.clone();
//cvtColor(img, img, COLOR_BGR2GRAY);
//threshold
//cop = Display_Sobel(cop);
//threshold(cop, cop, 0, 255, THRESH_OTSU + THRESH_BINARY);
//close morphology
M... | ALGO | 0.970708 | 3.391313 |
ea79b1a3-cba8-4998-9d03-3f7c92c54082 | lucianmot/codechef-problems | 1001 - C++ - ATM Machine.cpp | // C++ - ATM Machine
// Rating - 1001
// https://www.codechef.com/submit/ATM2
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, k;
cin >> t;
while(t--) {
cin >> n >> k;
string answer;
for ( int i = 0; i < n; i++ ) {
int num;
cin >> num;
if ( num <= k ) {... | ALGO | 0.999923 | 3.887369 |
75a321c3-f5ec-4e62-9767-2c654d5382cc | ljt141421/DataStructure | minSpanTree_Prim/GraphMtx.cpp | #include"GraphMtx.h"
//ʼͼ
void initGraph(GraphMtx *g)
{
g->maxVertices=Default_Vertex_Size;
g->numVertices=g->numEdeges=0;//ʵʶ=ʵʱ=0
//Ϊбٿռ
g->verticesList=(T*)malloc(sizeof(T)*(g->maxVertices));
assert(g->verticesList != NULL);
//ٶάռ
g->edge=(int**)malloc(sizeof(int*) * g->maxVertices);
assert(g->edge != NUL... | ALGO | 0.999566 | 3.555402 |
11cd1601-8ee1-4dee-a2a5-7109765dcd90 | jrouwe/JoltPhysics | Jolt/Physics/Vehicle/VehicleCollisionTester.cpp | #include <Jolt/Jolt.h>
#include <Jolt/Physics/Vehicle/VehicleCollisionTester.h>
#include <Jolt/Physics/Vehicle/VehicleConstraint.h>
#include <Jolt/Physics/Collision/RayCast.h>
#include <Jolt/Physics/Collision/ShapeCast.h>
#include <Jolt/Physics/Collision/CastResult.h>
#include <Jolt/Physics/Collision/Shape/SphereShape... | ALGO | 0.920914 | 3.382042 |
850715b6-24fb-41aa-b03a-35d2911645fe | itsmesuraj20/Leetcode-Practice | 1337-the-k-weakest-rows-in-a-matrix/1337-the-k-weakest-rows-in-a-matrix.cpp | class Solution {
public:
vector<int> kWeakestRows(vector<vector<int>>& mat, int k) {
vector<pair<int,int>> v;
for(int i=0;i<mat.size();i++){
int c_1 = count(mat[i].begin(),mat[i].end(),1);
v.push_back({c_1,i});
}
sort(v.begin(),v.end(),[](pair<int,int> &a,pair... | ALGO | 0.999954 | 5.729806 |
5b8089c6-19bc-493f-9cc8-e4bd4dfeb231 | AnusFarrukh/Flutter_Programming | flutter_assignment01/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.998597 | 6.763549 |
0c1f6707-8864-4c2e-aa3c-9ff8bf13c6bc | hong-sile/algorithm | baekJoon/cpp/20499.cpp | #include<iostream>
using namespace std;
int main(){
int K, D, A;
scanf("%d/%d/%d",&K,&D,&A);
if((K+A)<D || D==0)
cout <<"hasu";
else
cout <<"gosu";
} | ALGO | 0.995688 | 3.38482 |
882771ea-668b-44d0-bc6f-75eebe856be4 | saipavan2702/my-leetcode | problems/summary_ranges/solution.cpp | class Solution {
public:
vector<string> summaryRanges(vector<int>& A) {
int n=A.size();
vector<string>hash;
int j=0;
if(n==0)
return {};
if(n==1){
string s=to_string(A[0]);
return {s};
}
for(int i=1;i<n;i++){
long ... | ALGO | 0.999945 | 6.241261 |
e88af83c-5843-4031-8f31-8e1b470c2f3c | ishandutta2007/codeforces | tadijasebez/normal/1208/D.cpp | #include <stdio.h>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <stdlib.h>
#include <bitset>
#include <queue>
#include <stack>
#include <ctime>
#include <deque>
#i... | ALGO | 0.999995 | 3.441833 |
9a2b51e3-33f1-4d80-9f04-e01c631ced60 | asr1410/Practice | loopInLinkedList.cpp |
#include <bits/stdc++.h>
using namespace std;
class Node
{
public:
int data;
Node *next;
int flag;
};
Node *Empty(Node *head, int data)
{
head = new Node();
head->data = data;
head->next = head;
head->flag = 0;
return head;
}
void insertNode(Node *head, int data)
{
Node *newNode = n... | ALGO | 0.999971 | 4.716122 |
c3c1cffc-20c0-418d-ac86-0a6ebfbcbdea | JugalPatel01/CPPTutorial | --cppSTL/17-functors02-example.cpp | /*
# transform function {from algorithm library}
* transform for unary opeartion
transform(inputBegin, inputEnd, OutputBegin, unary_opeartion)
* transform for binary opeartion
transform(inputBegin1, inputEnd1,inputBegin2, OutputBegin, unary_opeartion)
To learn more about transform visit : htt... | ALGO | 0.999068 | 6.017883 |
b34d0a0d-aade-444e-b42e-21c70f707e82 | nanaezheng/ACM-ICPC-code | Dynamic Programming/hdoj2602.cpp | #include<stdio.h>
#include<string.h>
int n,m;
int f[2010],weight[2010],cost[2010];
int max(int x,int y)
{
return x>y?x:y;
}
int zeroonepack(int cost,int weight)
{
int i;
for(i=m;i>=cost;i--)
f[i]=max(f[i],f[i-cost]+weight);
return f[n];
}
int main()
{
int t;
scanf("%d",&t);
while(t--... | ALGO | 0.999959 | 3.119746 |
c522be06-9f0d-4631-8d14-d25b5eca9228 | lake4863/leetcode | lc_2170.cpp | class Solution {
private:
array<int, 4> op2(vector<int>& nums, int start) {
int first = 0;
int second = 0;
int cnt[100001] = {0};
for(int i = start; i < nums.size(); i += 2) {
++cnt[nums[i]];
if(cnt[nums[i]] >= cnt[first]) {
if(nums[i]... | ALGO | 0.999925 | 5.5307 |
16958447-22ab-4aa9-9b4d-1748f5ade223 | LuvKobe/StudyCode-2023 | Code_05_14/Compare3.cpp | #include"FileCompress.h"
FileCompress::FileCompress()
{
for (int i = 0; i < 256; i++)
{
fileByteInfo[i].ch = i;
//fileByteInfo[i].appearCount = 0;
}
}
bool FileCompress::CompressFile(const string& filePath)
{
FILE* pf = fopen(filePath.c_str(), "rb");
if (pf == NULL)
{
cout << "ѹļʧ!" << endl;
return fa... | TOOL | 0.983186 | 3.855785 |
54b4bdf2-7e0c-487e-856c-1766985d112b | eXperiencePoints/XPCoin | src/rpcnet.cpp | #include "bitcoinrpc.h"
#include "alert.h"
#include "wallet.h"
#include "db.h"
#include "walletdb.h"
#include "net.h"
#include "ntp.h"
using namespace json_spirit;
using namespace std;
Value getconnectioncount(const Array& params, bool fHelp)
{
if (fHelp || params.size() != 0)
throw runtime_error(
... | WEB | 0.936215 | 6.244516 |
5ead9e2d-26ac-4894-bfd9-d4367af5f1bb | DinhHuyKhanh/Codeforces | 7D.cpp | #include <bits/stdc++.h>
/**
* @author: huykhanh
* @create:
**/
using namespace std;
using ll = long long;
using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
ll POW... | ALGO | 0.999976 | 4.572241 |
40e0a64e-6565-411c-8a71-7ea4d2d43827 | architjain2002/DSA-Notes | Strings/Largest_number_formed_from_an_array.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function template for C++
class Solution
{
public:
// The main function that returns the arrangement with the largest value as
// string.
// The function accepts a vector of strings
static bool cmp(stri... | ALGO | 0.999955 | 5.36339 |
fa558d3b-913e-432d-a682-aa8be65ce273 | Sabe358/lab3.4 | lab3,4/lab3,4/lab3,4.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
double x;
double y;
double R;
cout << "x = "; cin >> x;
cout << "y = "; cin >> y;
cout << "R = "; cin >> R;
if (((x >= 0 && y >= 0 && pow(x - R, 2) + pow(y - R, 2) <= pow(R, 2) && y <= x)) ||
(x <= 0 && y <= 0 && pow(x + R, 2) + pow(y + R, ... | ALGO | 0.998913 | 3.883429 |
5a54bc25-ac75-4253-8b4c-ae7158605f83 | bartoszbielawski/convolution-benchmark | main.cpp | #include <vector>
#include <random>
#include <algorithm>
#include <array>
#include <cstdio>
#include "timediff.h"
#include "types.h"
using namespace std;
struct TestData
{
TestData(size_t noOfSamples): data(noOfSamples, 0), coeffs(noOfSamples, 0.0)
{
mt19937 mt;
uniform_real_distribution<sample> r... | TEST | 0.95524 | 5.729643 |
b1235484-424f-482c-a963-3c8bbe0023f2 | flameshimmer/leet2015 | Leet2015/Leet2015/LetterCombinationsOfAPhoneNumber .cpp | #include "stdafx.h"
//Given a digit string, return all possible letter combinations that the number could represent.
//
//A mapping of digit to letters(just like on the telephone buttons) is given below.
//
//2-> a, b, c
//3-> d, e, f
//4-> g, h, i
//5 -> j, k, l
//6 -> m, n, o
//7-> p, q, r, s
//8-> t, u, v
//9-> w, ... | ALGO | 0.998553 | 5.796743 |
921b6d71-1e3d-4eb5-a758-3551e826fc67 | hmahajan99/GeeksforGeeks-Solutions | Arrays/Must Do/Two numbers with sum closest to zero.cpp | // Given an integer array A of N elements. You need to find the sum of two elements such that sum is closest to zero.
// Approach: 2 Pointer
// Time - O(nlogn)
// Sort all the elements of the input array.
// Initialize l as 0 and r as n-1.
// sum = a[l] + a[r]
// If sum is -ve, then l++
// If sum is +ve, then r–
#in... | ALGO | 0.999913 | 5.49781 |
e339aa43-b4a9-4ba5-b8a9-2e0da1497bac | ellynhan/challenge100-codingtest-study | ise-yen/PGS/신고 결과 받기.cpp | #include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <unordered_map>
using namespace std;
vector<string> split(string input, char del){
vector<string> answer;
stringstream ss(input);
string tmp;
while(getline(ss, tmp, del)){
answer.push_back(tmp);
}
... | ALGO | 0.999256 | 5.351773 |
9e03a246-8949-434c-971f-b3f5d016dd80 | vishaltiwari/GSoC-GEOS | geos-svn/src/noding/MCIndexSegmentSetMutualIntersector.cpp | #include <geos/noding/MCIndexSegmentSetMutualIntersector.h>
#include <geos/noding/SegmentSetMutualIntersector.h>
#include <geos/noding/SegmentString.h>
#include <geos/noding/SegmentIntersector.h>
#include <geos/index/SpatialIndex.h>
#include <geos/index/chain/MonotoneChain.h>
#include <geos/index/chain/MonotoneChainBui... | ALGO | 0.993344 | 5.273971 |
7d226411-3b0b-4e11-8e03-d4f83e1e7867 | Vineeth1007/Self-driving-cars | project_10_MPC_control/src/Eigen-3.3/bench/bench_gemm.cpp |
// g++-4.4 bench_gemm.cpp -I .. -O2 -DNDEBUG -lrt -fopenmp && OMP_NUM_THREADS=2 ./a.out
// icpc bench_gemm.cpp -I .. -O3 -DNDEBUG -lrt -openmp && OMP_NUM_THREADS=2 ./a.out
// Compilation options:
//
// -DSCALAR=std::complex<double>
// -DSCALARA=double or -DSCALARB=double
// -DHAVE_BLAS
// -DDECOUPLED
//
#include... | TOOL | 0.922345 | 5.840695 |
ec3d788d-be77-4d91-be49-3e082d75759d | Andreew9504089/2022-Aerial-Robotics | Practice/class2/src/turtle_Pcontrol.cpp | // include ros library
#include "ros/ros.h"
// include msg library
#include <turtlesim/Pose.h>
#include <geometry_msgs/Twist.h>
#include <geometry_msgs/Point.h>
// include math
#include <math.h>
using namespace std;
float theta_error;
// turtle pose
turtlesim::Pose turtle;
// goal points
geometry_msgs::Point tur... | ALGO | 0.890991 | 4.187915 |
c8692e28-2f72-4cad-8526-ececefe44648 | vrangr1/competitive-programming | contests/luogu/lgr/lgr_195_div3/a.cpp | /***************************************************
* Author : Anav Prasad
* Nick : vrangr
* Created : Sat Aug 3 11:58:41 IST 2024
****************************************************/
#include <bits/stdc++.h>
#define debug(...) (void)42
#ifdef LOCAL
#undef debug
#include <algo/debug.hpp>
const bool ... | ALGO | 0.99998 | 4.599672 |
a0ba8263-90a8-4f0d-9772-b2d3c9c1d261 | godra-y/pp1_2022 | quiz3 upsolving/M.cpp | #include <iostream>
using namespace std;
int dish(int sum, string s) {
for(int i=0; i<s.size(); i++) {
sum+=s[i];
}
return sum;
}
int main() {
string s;
cin>>s;
int a=dish(0,s);
if(a>=300){
cout<<"It is tasty!";
}
else if(a<300){
cout<<"Oh, no!";
}
ret... | ALGO | 0.999336 | 3.98578 |
a6637a0b-e6ba-4aac-9c8e-e0011f393ef5 | almishra/metadirective | llvm/lib/Analysis/SyntheticCountsUtils.cpp | #include "llvm/Analysis/SyntheticCountsUtils.h"
#include "llvm/ADT/DenseSet.h"
#include "llvm/ADT/SCCIterator.h"
#include "llvm/Analysis/CallGraph.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/InstIterator.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/ModuleSummaryIndex.h"
using namespace llvm;
// Given... | TOOL | 0.937656 | 7.704673 |
004335c7-08ef-465e-b6ed-6776f7a0e257 | KaranGoyal-09/LeetCode | 18-4sum/4sum.cpp | #define ll long long
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
int n = nums.size();
sort(nums.begin(), nums.end());
vector<vector<int>> ans;
for (int i = 0; i < n; i++) {
if (i > 0 && nums[i] == nums[i - 1]) continue;
... | ALGO | 0.999992 | 6.000535 |
63d35ce0-4ab4-4cf3-b687-f7f3e92ae498 | AlterFritz88/interactive_learn_cpp | task_2_8_4.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int temp, a, b;
cin >> a >> b;
int diff = b - a;
for (int i = 2; i < 10; i++){
cin >> temp;
if (temp - b != diff){
cout << "NO";
return 0;
} else b = temp;
}
cout << "YES" << endl << diff;
... | ALGO | 0.999898 | 3.258189 |
c09d698d-a7a1-4a55-a829-d36607b0c9f4 | Aman2241/Self-Driving-Car | project_10_MPC_control/src/Eigen-3.3/doc/examples/tut_arithmetic_redux_basic.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::Matrix2d mat;
mat << 1, 2,
3, 4;
cout << "Here is mat.sum(): " << mat.sum() << endl;
cout << "Here is mat.prod(): " << mat.prod() << endl;
cout << "Here is mat.mean(): " << mat.mean() ... | ALGO | 0.997889 | 3.872858 |
473e9703-a3ea-405b-8550-a98df8dd3f1c | HasnathJami/Data-Structures-and-Algorithms | C++/Recursion/apowerbUsingRecursion.cpp | #include <iostream>
using namespace std;
int power (int a,int b)
{
if(b==0)
return 1;
return a*power(a,b-1);
}
int main()
{
int a,b;
a=2,b=3;
cout<<power(a,b)<<endl;
}
| ALGO | 0.99979 | 4.770704 |
7d5b2f63-67ad-4ff7-8b2e-ce1b7814f219 | wujysh/2014_ACM_Summer_Training | 基本算法/水题/HDU_1000_A_+_B_Problem.cpp | #include <iostream>
using namespace std;
long long a, b;
int main() {
while (cin >> a >> b) {
cout << a + b << endl;
}
return 0;
}
| ALGO | 0.982453 | 4.885032 |
624995ad-1a46-4db0-b862-220d17ce5957 | sarvex/leetcode-nelua | solution/0600-0699/0656.Coin Path/Solution.cpp | class Solution {
public:
vector<int> cheapestJump(vector<int>& coins, int maxJump) {
int n = coins.size();
vector<int> ans;
if (coins[n - 1] == -1) {
return ans;
}
int f[n];
const int inf = 1 << 30;
f[n - 1] = coins[n - 1];
for (int i = n -... | ALGO | 0.999993 | 5.550504 |
819081c3-6455-4e1e-9a7e-afd9fafc3801 | bossxu/acm | 比赛/美团资格赛/美团初赛b/c.cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<cmath>
#include<set>
#include<cstdlib>
#include<functional>
#include<climits>
#include<cctype>
#include<iomanip>
using namespace std;
typedef long long ll;
#define INF 0x3... | ALGO | 0.999974 | 3.6504 |
1f1ceae4-2ddc-43d4-8992-feaa8aaa8afa | Leovaldez42/CP | Codechef/DSA/Getting started Practice Contest/ANGTRICH.cpp | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if((a+b+c)==180 && a>0 &&b>0 &&c>0)
cout << "YES";
else cout << "NO";
} | ALGO | 0.999759 | 3.919654 |
b5ad5c04-2b89-485f-aee8-593ffbbc77a3 | ishandutta2007/codeforces | toxel/normal/1060/C.cpp | #include<bits/stdc++.h>
const int N = 2010;
const int M = N * N;
int pre[N];
int maxx[M], maxy[M];
int main(){
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++ i){
scanf("%d", &pre[i]);
pre[i] += pre[i - 1];
}
for (int i = 0; i < n; ++ i){
for (int j = i + 1; j ... | ALGO | 0.999953 | 3.518663 |
1b707372-3881-44f5-9aaf-30edcf2814c2 | s0umyajeet/Competitive-Programming | Atcoder/ABC/151/B.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, x, sum = 0;
cin >> n >> k >> m;
for (int i = 1; i < n; i++) {
cin >> x;
sum += x;
}
int req_score = (m * n) - sum;
if (req_score <= k) {
if (req_sco... | ALGO | 0.999965 | 3.92196 |
f07d58df-9b5d-429f-8e5d-2f6359743398 | KaniyanAhmad/pflab | labTask3/distance.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int x1, y1, x2, y2;
float distance;
cout << "Enter the X1 = ";
cin >> x1;
cout << endl << "Enter the Y1 = ";
cin >> y1;
cout << endl << "Enter the X2 = ";
cin >> x2;
cout << endl << "Enter the Y2 = ";
cin >... | ALGO | 0.995323 | 4.084975 |
51b8ac4d-c9f2-4c70-82f5-3cb657b19501 | araxvindh/Hope_Files | hope_prime/Non Overlapping interval.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<vector<int>>inter(n,vector<int>(2));
for(int i=0;i<n;i++)
{
cin>>inter[i][0] >>inter[i][1];
}
sort(inter.begin(),inter.end());
int end=arr[0][1];
int cnt=0;
for(int i=1;i<n;i++)
{
... | ALGO | 0.999899 | 4.551898 |
4078da54-9458-4f70-bb58-40828b29d499 | caupiiz/club-algoritmia-upiiz | Sesiones/2021-1/Intermedios/Clase 13-01 Maps and Unordered maps/word_frequencies.cpp |
#include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " es: " << x << endl;
// Prints frequencies of individual words in str
void printFrequencies(const string &str)
{
// Se declara el map de tipo <string, int>, cada palabra
// se mapea a su frecuencia
unordered_map<strin... | ALGO | 0.995131 | 5.154572 |
27c1d811-d15b-4306-8902-ea628725f300 | abhijeet-v-salunkhe/women_safety_watch_background_running_application | 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 |
64d41ed3-22bd-44dc-800f-e43c891a6ddb | leehayeong/Algorithm | programmers/level2/42626.cpp | #include <string>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
/*
더 맵게
스코빌 지수를 K이상으로 만들기 위해 섞어야하는 최소 횟수는?
스코빌지수 = 가장 맵지 않은 음식 + (두번째로 맵지 않은 음식 * 2)
*/
int solution(vector<int> scoville, int K) {
int answer = 0;
priority_queue<int, vector<int>, greater<int>> pq; // 큐에 담긴 수가 작은 ... | ALGO | 0.999592 | 5.36834 |
a75747be-1cbd-4806-b8d4-f763fa569fc7 | vivekyadav6838/DSA-solution | Sasta_Shark_Tank.cpp | #include<bits/stdc++.h>
/*** @author Vivek Yadav ***/
// #define for(i,n) for (int i = 0; i < n; ++i)
// #define ll long long int
// #define arr(n) int arr[n]
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int x,y;
cin>>x>>y;
int xa= (x*100)/10;
int ya = (y*100)/20;
if(xa>ya)
{
... | ALGO | 0.998226 | 3.559609 |
e3c7cc3c-536d-4508-92ee-6a58c55ee340 | sarvex/leetcode-shakespeare | solution/2400-2499/2413.Smallest Even Multiple/Solution.cpp | class Solution {
public:
int smallestEvenMultiple(int n) {
return n % 2 == 0 ? n : n * 2;
}
}; | ALGO | 0.999667 | 6.568551 |
0393a057-f70e-4b8b-8f4d-eba6a26307dd | ishandutta2007/codeforces | heart_blue/normal/721/B.cpp | #include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bi... | ALGO | 0.999722 | 3.341124 |
fa788beb-9a83-4757-a57b-62eef589c377 | maestron/botnets | VirusPack/Phatbot-stoney/configgui/sapphire.cpp | #include "stdafx.h"
#include "sapphire.h"
//////////////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////////////
//// Sapphire implementation starts here
//////////////////////////////////////////////////////////////... | ALGO | 0.998292 | 6.246291 |
2c5a4f0c-320d-4e33-9737-b0015569af82 | mk-minchul/attend-and-compare | coco/detectron2/detectron2/layers/csrc/ROIAlign/ROIAlign_cpu.cpp | namespace {
// implementation taken from Caffe2
template <typename T>
struct PreCalc {
int pos1;
int pos2;
int pos3;
int pos4;
T w1;
T w2;
T w3;
T w4;
};
template <typename T>
void pre_calc_for_bilinear_interpolate(
const int height,
const int width,
const int pooled_height,
const int ... | DATA | 0.929107 | 6.932075 |
9503a911-1b43-44f7-bba3-c55f8a53f40d | Kosmodesant/PSQLCPP | 05/main.cpp |
#include <iostream>
#include <pqxx/pqxx>
// Структура, представляющая клиента
struct Client {
std::string first_name;
std::string last_name;
std::string email;
std::vector<std::string> phone_numbers;
};
class ClientManager {
public:
// Конструктор класса ClientManager
ClientManager() {
... | TOOL | 0.876024 | 7.483167 |
844353a7-db79-418c-9b03-3cb291da57ec | yogibala/leetcode | solutions/3256. Maximum Value Sum by Placing Three Rooks I/3256.cpp | class Solution {
public:
long long maximumValueSum(vector<vector<int>>& board) {
const int m = board.size();
const int n = board[0].size();
long ans = LONG_MIN;
using T = tuple<long, int, int>;
vector<vector<T>> rows(m); // [(val, i, j)]
vector<vector<T>> cols(n); // [(val, i, j)]
set<T... | ALGO | 0.999612 | 6.265338 |
3987bdf5-3455-41c5-921d-cded22fa621e | Astenna/Sorting_algorithms | quicksort.cpp | #include "sorts.h"
template <class type>
void quicksort(type array[], int left, int right)
{
if(right>left)
{
int pivot = (right+left)/2;
int l = left;
int r = right-1;
while( l < r)
{
while(array[l] < array[pivot])
l++;
while(arra... | ALGO | 0.999707 | 4.294949 |
9e9de5ca-3b51-489b-a095-5aa46145f06b | xxioachou/ACM | cf_problems/CF1437D.cpp | #include <bits/stdc++.h>
#define x first
#define y second
#define sz(x) ((int)x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18;
// 贪心地一层一层放节点
void solve() {
int n;
cin >> n;
vector<int> a(n + 1), c(n + 1);
for(int i = 1; i <= n; i++) ... | ALGO | 0.999663 | 4.379528 |
56571007-2ce4-4163-8a09-287acebd5acc | arnavarora1710/Competitive_Programming | Codeforces/1326D2.cpp | // https://codeforces.com/contest/1326/problem/D2
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pi;
#define f first
#define s second
#define MULTI_TEST (1)
const int maxn = 2e6 + 5, inf = 1e18;
int n, c, p... | ALGO | 0.999978 | 5.372736 |
2097ae3b-f0f9-4a41-a847-d1467fc88b35 | SamyakJain2002/Coding-Solutions | Finding Profession - GFG/finding-profession.cpp | // { Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution{
public:
char profession(int level, int pos){
bool isopp = false;
while(pos!=1){
if(pos%2 == 0){
is... | ALGO | 0.998547 | 4.85205 |
eaa3d169-6fc3-44c5-ab1e-3130e815c214 | Harsh2563/DSA-ques | Maximum difference between pair in a matrix - GFG/maximum-difference-between-pair-in-a-matrix.cpp | //{ Driver Code Starts
/* Driver program to test above function */
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
int findMaxValue(vector<vector<int>>&mat, int N)
{
int ans = INT_MIN;
vector<vector<int>> maxVal(N,vector<int>(N,0));
maxVal[N-... | ALGO | 0.999949 | 5.858535 |
766210c5-0584-4db0-88b5-7396ed74ec05 | rishabhkukreja30/DSA-questions | Graphs/Cycle_detection_DSU.cpp | #include<bits/stdc++.h>
using namespace std;
// cycle detection in an undirected graph using dsu
class graph {
int v;
list <pair< int, int> > l;
public:
graph(int v) {
this->v = v;
}
int addEdge(int u, int v) {
l.push_back(make_pair(u,v));
}
// Find
int findSet(int i, int parent[]) {
//base case
if(... | ALGO | 0.999809 | 4.544455 |
c06002ec-b746-43a5-aff3-035b89ed94dc | MariaChrysafis/CompetitiveProgramming | Codeforces/1637D.cpp | #include <cmath>
#include <cassert>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("Ofast")
#pra... | ALGO | 0.999955 | 4.341665 |
66b78684-5b20-447f-ba90-ec515e3c3bff | manikanta2901/ubuntu | .history/SRM/DAA/Algorithms/Backtracking/StreamString_20210526211820.cpp | #include<bits/stdc++.h>
#include<sstream>
using namespace std;
int main(){
string a ;
cin >> a;
vector<int>answer;
stringstream ss(a);
char ch = ',';
int num1;
while(ss >> num1 >> ch){
answer.push_back(num1);
}
ss >> num1;
for(int i = 0; i < answer.size(); i++){
... | ALGO | 0.994083 | 3.059752 |
25e725c6-37d1-40c5-b209-650742457069 | GyuJin-Cho/Algorithm | 백준/빠른A+B.cpp | #include<iostream>
#pragma warning(disable:4996)
using namespace std;
int main()
{
int N;
scanf("%d",&N);
int a, b;
for (int i = 0; i < N; i++)
{
scanf("%d%d", &a, &b);
printf("%d\n", a + b);
}
return 0;
} | ALGO | 0.999416 | 3.452881 |
9bc244af-b7af-46ba-9c7f-c37b54eff066 | Allergy27/Allergy-to-not-study | cpp/NowCode/round92/f_fix.cpp | /* @author Allergy
* @email <EMAIL>
* @workspace cpp\NowCode\round92\f_fix.cpp
* @date 2025/05/11 20:30:17
*/
#include <bits/stdc++.h>
#define lowbit(x) ((x) & (-(x)))
#define ln std::endl
#define PII std::pair<int, int>
using ll = int64_t;
int inf = 0x3f3f3f3f;
ll ll_inf = 0x3f3f3f3f3f3f3f3f;
int mai... | ALGO | 0.999556 | 4.1236 |
066cc558-bf84-4476-a4a3-f26f597b485b | Golgoo/TP1-WrapperModulaire-IntergrationDonnees | boost_1_72_0/libs/histogram/examples/guide_custom_accumulators_2.cpp | //[ guide_custom_accumulators_2
#include <boost/format.hpp>
#include <boost/histogram.hpp>
#include <cassert>
#include <iostream>
#include <sstream>
int main() {
using namespace boost::histogram;
// Make a custom accumulator, which tracks the maximum of the samples.
// It must have a call operator that accepts... | ALGO | 0.975735 | 6.820365 |
6931574b-2ad0-432b-829a-a108bc0deb3e | eXpl0it3r/Box2D | src/Dynamics/Contacts/EdgeAndCircleContact.cpp | #include <Box2D/Dynamics/Contacts/EdgeAndCircleContact.hpp>
#include <Box2D/Common/BlockAllocator.hpp>
#include <Box2D/Dynamics/Fixture.hpp>
#include <new>
namespace b2
{
Contact* EdgeAndCircleContact::Create(Fixture* fixtureA, int32, Fixture* fixtureB, int32, BlockAllocator* allocator)
{
void* mem = allocator->All... | TOOL | 0.942727 | 7.153534 |
46354bbf-afd2-4dfe-b8e7-b7dafd602c55 | ishandutta2007/codeforces | aliceg/normal/1089/F.cpp | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <random>
#include <bitset>
#define sqr(x) ((x) * (x))
#define F first
#define S second
#define sz(a)... | ALGO | 0.999803 | 3.961349 |
6a41bfb9-d027-43b4-aae7-0a5266b37f77 | metadriverse/metaurban | metaurban/orca_algo/src/orca_agent.cpp | #include "orca_agent.h"
orca_agent::orca_agent() : Agent() { fakeRadius = 0; }
orca_agent::orca_agent(const int &id, const Point &start, const Point &goal, const Map &map,
const environment_options &options, AgentParam param)
: Agent(id, start, goal, map, options, param) { fakeRadius = param.rEps + param.ra... | ALGO | 0.97027 | 4.34642 |
3333bf06-61df-4c57-a203-238eacea353f | small-Qing/data-structure | 作业2/表达式求值.cpp | #include<fstream>
#include<stdio.h>
#include<iostream>
#include<stdlib.h>
//#include"stdafx.h"
using namespace std;
#define OVERFLOW -2
#define TRUE 1
#define FALSE 0
#define INFEASIBLE -1
#define ERROR 0
/*************ջ**************/
typedef struct stack{
char *base,*top;
int size;
}qstack;
/**************ջ*******... | ALGO | 0.999913 | 3.361734 |
7bf256e8-ca08-4c45-a464-1b30c56700b1 | imilk23/cses | IntroductoryProblems/Repetitions.cpp | //g++ 7.4.0
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
int solve(){
return 0;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
string ADN;
cin >> ADN;
int max_length=1;
int tmp=1;
for(int i=0; i<ADN.length()-1; i++){
if(ADN[i]==... | ALGO | 0.999929 | 4.099496 |
84c9d20d-781a-4c6e-b542-3e131fe09a8d | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_5267_2.cpp | #include <bits/stdc++.h>
using namespace std;
string dict[100];
string names[60];
int main() {
int n, k;
cin >> n >> k;
string c = "abcde";
for (int i = 0; i < 100; i++) {
dict[i] = 'A' + c;
next_permutation(c.begin(), c.end());
}
string s;
cin >> s;
int t = 0;
if (s == "YES") {
for (int i... | ALGO | 0.99999 | 3.680522 |
497c443f-21d3-45fd-9d6d-35701847ee16 | Teju080808/DSA | Queue/crud.cpp | #include <iostream>
using namespace std;
#define MAX 3
class queue
{
private:
int capacity;
int *arr;
int front;
int rear;
int size;
public:
queue(int capacity)
{
this->capacity = capacity;
this->arr = new int[this->capacity];
this->front = -1;
this->rear = -... | ALGO | 0.963188 | 4.219429 |
7b2f5b99-1999-4182-bf7a-6a99a4fbc1b9 | Synonymous64/Leetcode-daily-challenges | Year-2023/LeetCode-June-Challenge/LastDayWhereYouCanStillCross.cpp | #include<bits/stdc++.h>
using namespace std;
class Solution {
private:
bool isPossible(int row, int col, int mid, vector<vector<int>> &cells){
vector<vector<int>> grid(row + 1, vector<int>(col + 1, 0));
vector<pair<int,int>> directions{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
for(int i = 0; i < m... | ALGO | 0.999888 | 5.909866 |
995ea123-def5-4512-b9a0-a5e434cec75b | 23ksw10/LeetCode | algorithm/1477_Find_Two_Non-overlapping_Sub-arrays_Each_With_Target_Sum/solution.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
int minSumOfLengths(vector<int>& arr, int target) {
int ans = INT_MAX;
vector<int>dp(arr.size(), INT_MAX);
int l = 0;
int tmp = 0;
int min_curr = INT_MAX;
for (int r = 0; r < arr.size(); r++) {
tmp... | ALGO | 0.999984 | 5.312331 |
e3f66e71-c3c0-4194-a202-2f903bba28b9 | emmmile/machine-learning-utils | test/example.cpp | #include "random.hpp"
#include "swarm.hpp"
#include "population.hpp"
#include "ackley.hpp"
#include "ann.hpp"
#include "vect.hpp"
#include "neural_pso.hpp"
#include <boost/progress.hpp>
using namespace std;
using namespace ml;
using namespace boost;
#define dim 20 // dimensions of the search space
typedef... | ALGO | 0.999852 | 5.566047 |
91886f95-882d-454b-8886-ccefbad59d88 | uwx/DoubleAgent | source/tags/stable/build 1.0.0.30/Util/LocalizeEx.cpp | /////////////////////////////////////////////////////////////////////////////
#include "StdAfx.h"
#include <math.h>
#include "LocalizeEx.h"
#include "Log.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////... | TOOL | 0.960885 | 4.766831 |
39492804-cbe0-4faf-8f0e-4ff00add013f | jyeon1204/Study-algorithm | 9장_최단경로/9-2.cpp | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int n,m;
int graph[501][501]; //÷̵ ִܰ ˰ 忡 ִܰŸ ؾ ϹǷ 迭 Ѵ.
int main(void){
cin >> n >> m;
for(int i=0; i<501; i++)
fill(graph[i], graph[i]+501, INF); // graph ʱȭ
for(int a=0; a<=n; a++)
for(int b=0; b<=n; b++)
if(a==b)
graph[a][b] = ... | ALGO | 0.999774 | 4.221138 |
cfbacd15-95b7-4cee-bc45-0a01f4d68d5e | sanskarsri18/striver | Rat_in_a_Maze.cpp | Brute Force Approach
class Solution{
public:
void solve(vector<string>& ans, string path, vector<vector<int>>& visited, vector<vector<int>>& m, int n, int i, int j){
if(i == n-1 && j == n-1){
ans.push_back(path);
return ;
}
if((i+1) < n && visited[i+1][j... | ALGO | 0.999979 | 6.598276 |
e1e8d43f-6d3e-46e2-95b7-f4e5f2e47f34 | peterbell10/hyperthreading | nbody_add.cpp | #include "kernels.h"
#include <cstdio>
int main(int argc, char ** argv) {
if (argc != 2) {
printf("Usage: %s thread_count\n", argv[0]);
return EXIT_FAILURE;
}
auto thread_count = std::stoi(argv[1]);
jthread t1(nbody_forces, thread_count);
jthread t2(add_bound, thread_count);
}
| ALGO | 0.979304 | 4.045588 |
a77f874b-1b7e-4c54-885e-4075b5a609f4 | hjimce/android-image | app/src/main/cpp/opencv-3.2.0/modules/photo/src/inpaint.cpp | /* ////////////////////////////////////////////////////////////////////
//
// Geometrical transforms on images and matrices: rotation, zoom etc.
//
// */
#include "precomp.hpp"
#include "opencv2/imgproc/imgproc_c.h"
#include "opencv2/photo/photo_c.h"
#undef CV_MAT_ELEM_PTR_FAST
#define CV_MAT_ELEM_PTR_FAST( mat, row... | ALGO | 0.998574 | 4.490352 |
806c851c-0fe2-4060-9f5e-0c9345b660aa | mlkorra/Prep | geeksforgeeks/sortbyfreq.cpp | /*
Problem : Sort Elements of an array by frequency
Site : GeeksforGeeks
Approach : Brute Force Method
Sort the array initially which takes O(nlogn) time.
Then create a 2d Array to store index and count
Finally sort the 2D Array wrt the count,and if count is equal,compare the i... | ALGO | 0.999996 | 5.000572 |
fe0a7fd6-51ea-4126-9a52-967e19e15988 | rahulkumar62026391/DSA | OOPs in C++/virtualderivative.cpp | //Virtual inheritance or diamond problem
#include<iostream>
using namespace std;
class A
{
int a;
public:
A()
{
a=10;
}
void display()
{
cout<<"Value of a : "<<a<<endl;
}
};
class B:virtual public A
{
};
class C:virtual public A
{
};
class D:public B,public C
{
};... | ALGO | 0.947336 | 4.66101 |
a89d2869-5821-40ac-98a8-32ed631babea | 4rthurmonteiro/forge2d_game | 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.998799 | 6.776823 |
db09ff35-b22c-43d5-902f-e959f0b2c1bb | NatinaelFekadu/flutter | basics/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.998699 | 6.763549 |
1860a89e-9aa2-4565-9dad-8be5fa0dfe71 | Ravi-Dhillayan/DSA | All.cpp | #include<iostream>
using namespace std;
class All{
int i,j,*a,n,temp,min;
public:
void boble(){
cout<<"Enter the Array Size : "<<endl;
cin>>n;
a=new int[n];
cout<<"Enter the unshorted Array Elements : "<<endl;
for(i=0;i<n;i++){
cin>>a[i];
}
cout<<"printed the Shorted : "<<endl;
for(i=0;... | ALGO | 0.999387 | 3.454454 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.