uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
d1182a37-db4a-4e19-9c91-a1582b4a35af | loook98/PlayWithAlgorithm | exercise/Solution46_2.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
vector<vector<int>> res;
vector<bool> visited;
vector<vector<int>> permute(vector<int>& nums) {
visited = vector<bool>(nums.size(), false);
vector<int> path;
backTracing(nums, 0, path);
return res;
... | ALGO | 0.999988 | 5.925426 |
e6d05b64-b215-4ead-b49d-b6f489c480d6 | AllanPanchi/ED---9686 | Alejo/P3/Tetris/main.cpp | #include <SFML/Graphics.hpp>
#include <iostream>
#include <vector>
#include <cstdlib>
#include <ctime>
// Clase para representar una palabra en el juego
class Word {
public:
Word(const std::string& text, const sf::Vector2f& position)
: text(text), position(position) {
font.loadFromFile("Action_Man.... | TOOL | 0.899756 | 5.940182 |
88abc701-9fc4-4598-a9e6-6dbf6d1a97a9 | owais-rashid-mir/c-cpp-programming | PalindromeString_Owais_04.cpp | /*
Program : C++ program to check whether a string is a palindrome or not - Method 1.
*/
#include <iostream>
using namespace std;
int main()
{
// A palindrome is a string, which when read in both forward and backward ways is the same. E.g: madam, lol.
string str, rev="";
cout<<"Enter a string: ... | ALGO | 0.999688 | 5.523479 |
caf0e0a9-f39f-4708-98ae-9e9e18643797 | gangwar1234/CP | codeforces/C654_d2.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef vector<lo> vl;
typedef vector<vl>vll;
#define all(v) (v).begin(), (v).end()
#define debug(x) cerr<<#x<<" = "<<x<<endl;
#define REPV(a, b, c) for (lo(a) = b; (a) < (c); (a)++)
#define REP(a,b) for(lo i =(a) ;i<(b);i++)
template <typename T>
i... | ALGO | 0.99958 | 3.878361 |
3a9a74dd-f837-4ab3-aa78-abff23d129e9 | hieu-ln/IT81-05 | CodeC2/TuanKien_C2_Bai6.cpp | //Chuong 2: Cau truc du lieu co ban - bai 5- Luc Tuan Kien - nhom 5- IT81
#include <iostream>
using namespace std;
//khai bao cau truc stack
#define MAX 100
int a[MAX];
int sp;
// Khoi tao stack rong
void init(int a[],int &sp)
{
sp = -1;
}
// kiem tra stack rong
int isEmpty(int a[], int &sp)
{
if(sp == -1)
return ... | ALGO | 0.987805 | 3.516708 |
81d4e43f-9eec-4096-9252-72efe2294070 | ishandutta2007/codeforces | rfpermen/normal/1452/B.cpp | #include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
template<class A, class B>
ostream& operator<<(ostream& os, const pair<A, B> &p) {
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template<class T>
ostream... | ALGO | 0.999833 | 3.869819 |
83d0a39d-b64f-473e-bf97-71a6df593e00 | JODE-HRK/Algorithm-Question | leetcode/14.cpp | //
// Created by JODE on 2023-01-14.
//
#include <iostream>
#include <vector>
using namespace std;
string longestCommonPrefix(vector<string>& strs) {
int cnt = 0, len = 1000000, cntlen = 0, sum = strs.size();
string ans = "";
for (int i = 0; i < sum; ++i) {
if(len > strs[i].size())
len =... | ALGO | 0.999658 | 5.484481 |
4076b751-85b0-4361-a296-af3a5ffe85c4 | vmmc2/Competitive-Programming | LeetCode/Top Interview Questions/Miscellaneous/String/To Lower Case.cpp | class Solution {
public:
string toLowerCase(string str) {
int n = (int)str.size();
for(int i = 0; i < n; i++){
if((int)str[i] >= 65 && (int)str[i] <= 90){
str[i] = (char)((int)str[i] + 32);
}
}
return str;
}
};
| ALGO | 0.986083 | 6.080287 |
70cced4a-6b70-4805-b85d-485096f89226 | NVH19/Cpp-PTIT | test2.cpp | #include<bits/stdc++.h>
using namespace std;
struct OTO{
string a,b,d,e;
int c;
};
int tien(OTO s){
int tong = 0;
if(s.c == 5)
tong = 10000;
else if(s.c == 7)
tong = 15000;
else if(s.c == 2)
tong = 20000;
else if(s.c == 29)
tong = 50000;
else
t... | ALGO | 0.990096 | 3.587856 |
a6511b3b-b88b-4814-9af3-04eeb2f8640c | Kvncyldz33/Cpp_Ornek_Kodlar | Döngüler/asal sayı.cpp | #include <iostream>
using namespace std;
int main() {
int num, i, flag=0;
cout << "Bir sayi girin: ";
cin >> num;
for (i=2; i<=num/2; i++) {
if (num % i == 0) {
flag = 1;
break;
}
}
if (num == 1) {
cout << "Asal degil." << endl;
}
else {
if (flag == 0) ... | ALGO | 0.999566 | 3.828329 |
1f1f748d-fb64-4b14-b0ba-005d4de5c9fe | hjiang13/LLMs-in-IR | POJ-104/85/2222.cpp | #include <iostream>
using namespace std;
char s[MLEN][MAX];
int i,j,n;
int main(){
cin >> "%d",&n);
for(i=0; i<=n-1; i++){
cin >> "%s",s[i]);
}
for(i=0; i<=n-1; i++){
int a=1;
for(j=0; s[i][j]!='\0'; j++){
if(!((s[i][j]=='_')||(s[i][j]>='A'&&s[i][j]<='Z')||(s[i][j]>='a'&&s[i][j]<='z')||(s[i][j]>='0'&&s[i][j]<='9'&&j>0)... | ALGO | 0.999663 | 3.405393 |
1d886467-634d-4029-a646-7406bb350f04 | abun100/csc212-Final-Project-ABun | functions/Rework/Rework.cpp | #include "grahamScan.h"
int main()
{
std::vector<Point> points = { {0, 3}, {1, 1}, {4, 4},
{0, 0}, {2, 2}, {1, 2}, {3, 1}, {3, 3} };
grahamScan scan(points);
scan.initial_setup(points);
scan.find_convex_hull(points);
return 0;
} | ALGO | 0.99779 | 4.354691 |
12f8daed-aa28-4c31-a4f3-6436dfd28cf2 | BlockchainManiac0x00/CompetitionCoin | src/activemasternode.cpp | #include "protocol.h"
#include "activemasternode.h"
#include "masternodeman.h"
#include <boost/lexical_cast.hpp>
#include "clientversion.h"
//
// Bootup the masternode, look for a 1000 CMPC input and register on the network
//
void CActiveMasternode::ManageStatus()
{
std::string errorMessage;
if (fDebug) LogP... | WEB | 0.922346 | 5.053082 |
df051e68-ce67-4ce8-bfd5-504f21cc6bae | rajeevranjancom/Leetcode_Cpp | 941. Valid Mountain Array.cpp | class Solution {
public:
bool validMountainArray(vector<int>& A) {
int i = 0, n = A.size();
if (n < 3) {
return false;
}
while (i < n - 1 && A[i] < A[i + 1]) {
++i;
}
if (i == 0 || i == n - 1) {
return false;
}
while... | ALGO | 0.999944 | 6.303086 |
74303427-91cf-4e72-8fee-6e05a8de08da | jwezorek/advent_of_code | src/2019/day_11.cpp | #include "../util/util.h"
#include "y2019.h"
#include "intcode.h"
#include <filesystem>
#include <functional>
#include <print>
#include <ranges>
#include <unordered_set>
#include <unordered_map>
#include <boost/functional/hash.hpp>
namespace r = std::ranges;
namespace rv = std::ranges::views;
/*----------------------... | ALGO | 0.997742 | 6.611743 |
38f48321-302d-4394-b2aa-ab8ffb7fc012 | harimouli/DSA | 0205-isomorphic-strings/0205-isomorphic-strings.cpp | class Solution {
public:
bool isIsomorphic(string s, string t) {
int n = s.size();
vector<int> maps(256, 0);
vector<int> mapt(256, 0);
for(int i = 0; i <n; i++){
if(maps[s[i]] != 0 || mapt[t[i]] != 0){
if(maps[s[i]] != mapt[t[i]]){
... | ALGO | 0.999992 | 6.41808 |
b6774e9c-be99-4cd2-9b74-c40760c0de8c | papilong123/LeetCode | cpp/Array/238.ProductofArrayExceptSelf.cpp | #include <vector>
using namespace std;
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
vector<int> res(nums.size(),1);
int left=1,right=1;
for(int i=0;i<nums.size();i++){
res[i]*=left;
left*=nums[i];
}
for(int i=nums.size()... | ALGO | 0.999963 | 5.553731 |
86ecaa98-c43f-44de-b90a-2022d145121f | gafeol/competitive-programming | ojs/cf/697/D.cpp | #include <bits/stdc++.h>
using namespace std;
#define fst first
#define snd second
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define for_tests(t, tt) int t; scanf("%d", &t); for(int tt = 1; tt <= t; tt++)
template<typename T> inline T abs(T t) { return t < 0?... | ALGO | 0.99996 | 3.402492 |
29ae998c-fca8-4722-91fe-0c2f63e27680 | SeboCode/ETHZ-AlgoLab-2020 | exercise_5/asterix_the_gaul/main_60.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
typedef std::vector<std::pair<long, long>> movement_list;
typedef std::vector<std::tuple<long, long, int>> distance_list;
typedef movement_list::size_type movement_list_size_type;
typedef distance_list::size_type distance_list_size_type;
long... | ALGO | 0.999649 | 5.700701 |
b488845e-5b73-4896-b529-578d8746e032 | vuba2002/Code_C | 04-21-Dequi.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int a[1000001];
void Nhap(int a[], int n){
for(int i = 0 ; i < n ; i++){
cin >> a[i];
}
}
void dem(int a[], int n){
int dem = 0;
for(int i = 0 ; i < n ;i++){
if((a[i] % 2) == 0) dem++;
}
cout << dem;
}
int main(){... | ALGO | 0.999734 | 4.372881 |
bc8864cd-3d30-4bd1-8ac9-0aa0616466f8 | nhuallpa/random-fiuba-game | randomgame/libs/Box2D/Dynamics/Contacts/b2ChainAndCircleContact.cpp | #include <Box2D/Dynamics/Contacts/b2ChainAndCircleContact.h>
#include <Box2D/Common/b2BlockAllocator.h>
#include <Box2D/Dynamics/b2Fixture.h>
#include <Box2D/Collision/Shapes/b2ChainShape.h>
#include <Box2D/Collision/Shapes/b2EdgeShape.h>
#include <new>
using namespace std;
b2Contact* b2ChainAndCircleContact::Create(... | ALGO | 0.969322 | 6.351975 |
34f60a83-6f3c-4d3b-ae51-86e74b80050a | numan947/Curiously-Bored | uva11503.cpp | #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
... | ALGO | 0.999417 | 4.395903 |
61a46723-5b96-42fd-b424-526d0613d79e | danieltrt/SBFL | benchmarks/python/CHECK_NUMBER_IS_PERFECT_SQUARE_USING_ADDITIONSUBTRACTION.cpp | #include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <cstdlib>
#include <string>
#include <vector>
#include <queue>
#include <fstream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#incl... | ALGO | 0.997467 | 5.652733 |
f3422e63-8362-42dc-830f-339815722ccb | Debnandan/CPP-programs | C++ PROGRAMS/no4.cpp | #include<iostream>
using namespace std;
int main()
{
int b,h;
float area;
cout<<"enter base :\n";
cin>>b;
cout<<"enter height :\n";
cin>>h;
area=.5*b*h;
cout<<"area of traingle = "<<area;
return 0;
} | ALGO | 0.968901 | 3.589944 |
a25e63e4-f2ff-42d8-9e0e-9dbe6ca7f375 | renetdevp/coding_test | baekjoon/baekjoon_1012.cpp | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
void freeTable(char** table, int n) {
for (int i = 0; i < n; ++i) free(table[i]);
free(table);
}
void bfs(char** table, char** visited, short u, short v, short yLen, short xLen) {
char dy[] = { -1, 0, 1, 0 };
char dx[] = { 0, 1, 0, -1 };
s... | ALGO | 0.999924 | 3.812069 |
4f8b97f5-8ec4-4922-99ab-7e618dc60cc4 | FranciscoThiesen/OldProblems | Codeforces/round449/d.cpp | /*input
2 4 4
2
1
3
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int (i) = (a); (i) < (n); ++(i))
#define per(i,a,n) for(int (i) = (n-1); (i) >= (a); --(i))
#define fi first
#define se second
#define pb push_back
#define mt make_tuple
#define mp make_pair
#define all(v) (v).begin(), (v).end()... | ALGO | 0.999997 | 3.247691 |
cf738d60-d10b-4190-b4aa-124354b8764c | moonflower-Bai/OIcode | 考试/sdfzc56/C.cpp | #include<bits/stdc++.h>
using namespace std;
#define PII pair<int,int>
#define MP make_pair
#define ll long long
const int qwe=1e6+5;
const int mod=1e9+7;
int n;
ll ans=0;
PII a[qwe];
ll f[qwe][2];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d%d",&a[i].first,&a[i].second);
}
sort(... | ALGO | 0.99999 | 3.906214 |
3ea65ac8-bcdc-4130-8713-e11517af57b8 | pranavladkat/3dVPM | src/wake.cpp | #include "wake.hpp"
using namespace std;
Wake::Wake()
{
lifting_surface = NULL;
}
Wake::~Wake()
{
}
void Wake :: add_lifting_surface(const std::shared_ptr<Surface> surf) {
lifting_surface = surf;
}
void Wake :: initialize(const vector3d& free_stream_velocity, const double &dt){
assert(lifting_surface... | TOOL | 0.936267 | 5.142202 |
c5820cd2-7f61-4e68-b87d-908910a9280d | aostoic/redbull_code_bech_v1 | 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.998693 | 6.797273 |
d814443c-e0f3-4330-895e-22c025ceb2ab | gracygulati7/100DaysOfCode | Day 32/min_food_hamsters.cpp | //! leetcode question 2086. Minimum Number of Food Buckets to Feed the Hamsters
//? link : https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters/description/
#include<iostream>
#include<string>
using namespace std;
class Solution {
public:
int minimumBuckets(string hamsters) {
... | ALGO | 0.999922 | 4.804749 |
f7c25b0c-ed65-4a81-b88c-0586bf5ff471 | anuragull/algorithms | sorting_algo/insertion.cpp | // project include
#include "insertion.h"
// system include
#include <iostream>
template <class T>
void insertsort<T>::runInsertSort(T * arr,int size) {
std::cout << "starting insertion sort \n";
// outer loop
for(int i =1 ; i< size ; i++ ) {
// inner loop
int j = i;
while(arr[j] < arr[j-1] && j > 0)... | ALGO | 0.999147 | 4.41829 |
37daea43-a7d8-4e9c-ad26-fa3e009245f8 | evapavlinek/acceleratedCPP | ch4/exercises/ex4.cpp | /* Now change your squares program to use double values instead of ints. Use
manipulators to manage the output so that the values line up in columns. */
#include <iostream>
#include <string>
#include <iomanip>
using namespace std;
double max_width(double n)
{
return log10(n) + 1;
}
int main()
{
double n ... | TOOL | 0.916943 | 5.034026 |
3a6612a6-ff8d-498f-8af4-150461bab24a | raincross7/code-similarity | codes/train_code/problem055/problem055_484.cpp | #include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
#define R(i,n) for(int i = 1; i<=n; i++)
typedef long long ll;
using namespace std;
int main(){
int n,count=0;
cin >> n;
vector<int> v(n,0);
r(i,n){
cin >> v.at(i);
if(i>0&&v.at(i)==v.at(i-1)){
count++;
v.at(i)=1000;
}
}... | ALGO | 0.999814 | 3.385149 |
0d7b898d-1341-4be7-8d6e-5681a6747903 | yancouto/competitive-programming | contests/camp17/s01e04/7/7.cpp | #include <bits/stdc++.h>
using namespace std;
#define fst first
#define snd second
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
const ll modn = 1000000007;
inline ll mod(ll x) { return x % modn; }
#ifdef ONLINE_JUDGE
# define debug(args...) {}
#else
# define debug(args...) fprintf(stderr, args... | ALGO | 0.999992 | 3.581444 |
085f056f-f8e9-46eb-b2a1-98ad865aeb05 | lakshitcodes/DSA_Problems | Codeforces/2024.09.03 - Round 971 (Div 4)/A_Minimize.cpp | #include <bits/stdc++.h>
using namespace std;
/*
A. Minimize!
time limit per test
1 second
memory limit per test
256 megabytes
You are given two integers aand b (a≤b). Over all possible integer values of c (a≤c≤b), find the minimum value of (c−a)+(b−c).
Input
The first line contains t(1≤t≤55) — the number of test ca... | ALGO | 0.999708 | 4.937274 |
f9899a3b-a656-4822-a4a7-f1e71ad33343 | leslieyip02/leetcode | completed/0168.cpp | #include <iostream>
using namespace std;
class Solution {
public:
string convertToTitle(int columnNumber) {
string title = "";
do {
columnNumber--;
title = (char) (columnNumber % 26 + 65) + title;
columnNumber /= 26;
} while (columnNumber > 0);
r... | ALGO | 0.999824 | 5.709509 |
873428db-68e1-42b4-b6af-65b18e22ab09 | Nzarite/cp | binarysearchtree/bst.cpp | #include <iostream>
#include <queue>
#include <limits.h>
using namespace std;
struct Node
{
int key;
Node *left, *right;
Node(int k)
{
key = k;
left = right = NULL;
}
};
bool search(Node* root, int x){ // time complexity O(h) auxiliary space O(h)
if(!root)
return false;
... | ALGO | 0.99998 | 3.884327 |
b9a67745-8165-44aa-b812-c2c9af3ac00d | nguyenhoang4875/CompetitiveProgramming | Spct/bruteforce/J.cpp | #include <bits/stdc++.h>
#define int long long
using namespace std;
/**
* Problem: https://codeforces.com/contest/1121/problem/B
* Solution: brute force for each sum a[i] + a[j] O(n ^ 2)
*/
int tcs, n;
set<int> si;
int a[1005];
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
... | ALGO | 0.999883 | 4.36234 |
ddd19ec7-d6ab-4eb4-a7d6-2e40ce81b3fe | Adamjakobsen/FYS4150 | Project4/utils.cpp | #include "./include/utils.hpp"
std::mt19937 gen(42);
double kb=1.;
arma::mat init_random_config(int L, double &E, double &M, int align)
{
int N = L * L;
arma::mat config = arma::zeros<arma::mat>(L, L);
for (int i = 0; i < N; i++)
{
int k = i / L;
int l = i % L;
if (align == 0)
... | ALGO | 0.998644 | 5.474686 |
3bf1dc54-bc75-46f7-bda9-dfd597449efd | Fidasek009/LeetCode | 217. Contains Duplicate/main.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
sort(nums.begin(), nums.end());
for(int i = 1; i < nums.size(); i++) if(nums[i-1] == nums[i]) return true;
return false;
}
};
int main()... | ALGO | 0.999809 | 4.975258 |
275f513f-a79f-4f7f-9dde-74ee2b9551d6 | Thakuraditya05/C-Notes | 3)fundamentalOfPrograming-2/code/verticalDiamond.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int num;
cin>>num;
int outerLoop=num*2-1;
for(int i=1;i<=outerLoop;i++){
if(i<=num){
for(int j=1;j<=i;j++){
cout<<"*";
}
}
if(i>num){
for(int j=1;j<=outerLoop-i+1;j++){
... | ALGO | 0.999984 | 3.926085 |
e5748622-0276-43a1-815c-39df8fe9de92 | agreemsxv0v/leetcode_prblm | 1497-check-if-array-pairs-are-divisible-by-k/1497-check-if-array-pairs-are-divisible-by-k.cpp | class Solution {
public:
bool canArrange(vector<int>& arr, int k) {
int n=arr.size();
for(int i=0;i<=n/2;i++)
{
for(int j=n-1;j>=n/2;j--)
{
int sum=arr[i]+arr[j];
if(arr[i] < 0)
continue;
if(arr[j] < ... | ALGO | 0.99991 | 5.464132 |
35454a30-6f47-42aa-ba2c-bf2348325749 | zhenglu0/Programming_Practice | Practices/Graphs/DetectCycleDG.cpp | //
// DetectCycleinDG.cpp
//
// Modified by 罗铮 on 03/13/14.
//
// http://www.geeksforgeeks.org/detect-cycle-in-a-graph/
//
// A C++ Program to detect cycle in a directed graph
#include <iostream>
#include <list>
#include <climits>
using namespace std;
class Graph
{
int V; // No. of vertices
lis... | ALGO | 0.99953 | 6.234598 |
7ef933d1-d9a7-41ce-bace-81fb080c68ba | abulKhasim/Binary_Tree_1 | 12_verticalorderTraversal.cpp | class Solution {
public:
vector<vector<int>> verticalTraversal(TreeNode* root) {
//vertical level multi_nodes
map<int, map<int, multiset<int>>> nodes;
// node vertical, level
queue<pair<TreeNode*, pair<int, int>>> q;
q.push({root, {0,0}});
... | ALGO | 0.999996 | 6.166465 |
db457e86-840d-4f32-87ec-0f9f98679dda | lisabcde/2020cce | week12/進階題：計算質數個數.cpp | #include <stdio.h>
int main()
{
int a,b,count=0,j;
scanf("%d%d",&a,&b);
for(int i=a ;i<=b ;i++ ){
for( j=2 ;j < i ;j++ ){
if(i%j==0)break;
}
if(j==i)count++;
}
printf("%d",count);
} | ALGO | 0.999709 | 3.403153 |
87750797-5d20-40e2-addb-1d623de849ef | rummanwaqar/RTIMULib-Teensy | libraries/RTIMULib/RTMath.cpp | #include "RTMath.h"
#include <Arduino.h>
// Strings are put here. So the display functions are no re-entrant!
char RTMath::m_string[1000];
uint64_t RTMath::currentUSecsSinceEpoch()
{
return micros();
}
const char *RTMath::displayRadians(const char *label, RTVector3& vec)
{
sprintf(m_string, "%s: x:%f, y:%f... | TOOL | 0.896642 | 6.68263 |
a9241b8e-8788-45b8-b8e8-3d4a5a5acb3b | siddharth25pandey/Leetcode-Solution | Medium/Permutation in String.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
bool checkInclusion(string s1, string s2) {
vector<int> cur(26), goal(26);
for(char i : s1) goal[i - 'a']++;
for(int i = 0; i < s2.size(); i++) {
cur[s2[i] - 'a']++;
if(i >= s1.size()) cur[s2[i - s1.size()] - 'a']--;
if(goal == cu... | ALGO | 0.99994 | 5.872961 |
06e2293e-5b5d-416f-8f50-15f357907ef3 | makeusabrew/flingball-ios | Flingball/libs/Box2D/Dynamics/b2Island.cpp | #include <Box2D/Dynamics/b2Island.h>
#include <Box2D/Dynamics/b2Body.h>
#include <Box2D/Dynamics/b2Fixture.h>
#include <Box2D/Dynamics/b2World.h>
#include <Box2D/Dynamics/Contacts/b2Contact.h>
#include <Box2D/Dynamics/Contacts/b2ContactSolver.h>
#include <Box2D/Dynamics/Joints/b2Joint.h>
#include <Box2D/Common/b2StackA... | ALGO | 0.999823 | 7.336499 |
a9566d42-2652-47bc-9421-4f692b97a71b | QiuYue-bit/vins-mono-noted | pose_graph/src/pose_graph.cpp | #include "pose_graph.h"
PoseGraph::PoseGraph()
{
posegraph_visualization = new CameraPoseVisualization(1.0, 0.0, 1.0, 1.0);
posegraph_visualization->setScale(0.1);
posegraph_visualization->setLineWidth(0.01);
t_optimization = std::thread(&PoseGraph::optimize4DoF, this);
earliest_loop_index = -1;
... | ALGO | 0.959957 | 3.365584 |
bd227c19-7419-4cd9-bee4-4442fd8527a4 | vedantjain1112/GFG | 1496-path-crossing/1496-path-crossing.cpp | class Solution {
public:
bool isPathCrossing(string path) {
int x = 0, y = 0;
unordered_set<string> visited;
visited.insert("0,0");
for (char move : path) {
switch (move) {
case 'N':
y++;
break;
case... | ALGO | 0.999937 | 6.524242 |
f8f7df5e-e053-4066-b4ed-dc9f348b093f | hardwood89/StanfordNoC | booksim/maxsize.cpp | #include "booksim.hpp"
#include <iostream>
#include "maxsize.hpp"
// shortest augmenting path:
//
// for all unmatched left nodes,
// push node onto work stack
// end
//
// for all j,
// from[j] = undefined
// end
//
// do,
//
// while( !stack.empty ),
//
// nl = stack.pop
// for each edge (nl,j),... | ALGO | 0.969763 | 5.403545 |
0787f2c0-aaf2-4827-8579-7f8a91111c16 | Ayesha049/all_contest_codes | OCTOBER 2017/BINARY SEARCH/TWO POINTER/B. Queries about less or equal elements.cpp | #include <bits/stdc++.h>
#define ll long long
#define f(i,a,b) for(int i=(a);i<(b);i++)
#define fd(i,a,b) for(ll i=(a);i>(b);i--)
#define x first
#define y second
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d %d",&a,&b)
#define siii(a,b,c) sca... | ALGO | 0.999979 | 3.547167 |
263ef145-2b44-42da-b3d5-f033d5c46fc8 | Jackyxtt/MCVIO_practice | MCVIO/thirdparty/eigen/bench/sparse_cholesky.cpp | // #define EIGEN_TAUCS_SUPPORT
// #define EIGEN_CHOLMOD_SUPPORT
#include <iostream>
#include <Eigen/Sparse>
// g++ -DSIZE=10000 -DDENSITY=0.001 sparse_cholesky.cpp -I.. -DDENSEMATRI -O3 -g0 -DNDEBUG -DNBTRIES=1 -I /home/gael/Coding/LinearAlgebra/taucs_full/src/ -I/home/gael/Coding/LinearAlgebra/taucs_full/build/lin... | ALGO | 0.989861 | 4.147974 |
0608eabd-dae3-4a4f-8f14-d64fe7be6c17 | cosmoss-jigu/vip | llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy_if.pass.cpp | // <algorithm>
// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter,
// Predicate<auto, InIter::value_type> Pred>
// requires CopyConstructible<Pred>
// constexpr OutIter // constexpr after C++17
// remove_copy_if(InIter first, InIter last, OutIter result, Pred pred)... | TEST | 0.918834 | 7.490817 |
62780e16-ed99-4046-9817-a4e079be8e19 | NAGAVENIGOWDA/My_Placement_prep_DSA | Striver's Sheet/greedy-job-scheduling-or sequencing.cpp | //{ Driver Code Starts
// Program to find the maximum profit job sequence from a given array
// of jobs with deadlines and profits
#include<bits/stdc++.h>
using namespace std;
// A structure to represent a job
struct Job
{
int id; // Job Id
int dead; // Deadline of job
int profit; // Profit if job... | ALGO | 0.999958 | 5.833546 |
ad1fd29e-e82d-41c0-8969-92afd25e3dd6 | freegreg/morbidel-timus | done/1069.cpp | /*
* ACM Online
* The Pruffer Code - Problem 1069
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define NODS 16000
long n, how[NODS], flag[NODS], sum[NODS], sol[NODS], s[NODS], oflag[NODS];
int main()
{
long i, j, k, next, lev = 0;
n = 0;
while (scanf("%ld", &s[n++]) == 1)
flag[--s[n - 1... | ALGO | 0.999956 | 3.317317 |
09af6b9e-cebd-4425-93de-ebf3c9ecc142 | jer22/OI | codeforces/372div2/C/c.cpp | #include <bits/stdc++.h>
using namespace std;
long long n;
long long num[100005];
int main() {
freopen("c.in", "r", stdin);
cin >> n;
num[0] = 2ll;
for (long long i = 1ll; i <= n; i++) {
long long a = (i + 1ll) * (i + 1ll);
long long b = i;
long long t = sqrt(b);
long long x = a * b;
num[i] = i * (i +... | ALGO | 0.999891 | 3.453486 |
0def7579-84dd-422e-b34c-7fc82346d41f | wdazhi97/httpserver | third/boost_1_87_0/libs/graph/example/dijkstra-no-color-map-example.cpp | #include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/dijkstra_shortest_paths_no_color_map.hpp>
#include <boost/property_map/property_map.hpp>
using namespace boost;
int main(int, char*[])
{
typedef adjacency_list< listS, vecS, directedS, no_property,
prop... | ALGO | 0.999785 | 5.936502 |
06819269-b5eb-4f51-af9f-99aa281ee661 | ledizia/Programacao-Competitiva | dijkstra/shortest-routes-I.cpp | #include<bits/stdc++.h>
using namespace std;
#define N 100002
#define INF 2000000000000009
long long int n, m, u, v, w, dist[N], vis[N];
vector<pair<long long int, long long int> > adj[N];
void dijkstra() {
for (int i = 1; i <= n; i++) {
dist[i] = INF;
vis[i] = 0;
}
dist[1] = 0;
prior... | ALGO | 0.999969 | 4.279595 |
53be17e9-9173-468a-a20a-924e1b8bc5d8 | VenkataAnilKumar/InterviewBit-CPlusPlus | Hashing/WindowString.cpp | // https://www.interviewbit.com/problems/window-string/
struct info{
int freq, arrived;
};
string Solution::minWindow(string S, string T) {
unordered_map <char, info> myMap;
for(int i = 0; i < T.length(); i++){
if(myMap.find(T[i]) == myMap.end()){
myMap[T[i]].freq = 1;
... | ALGO | 0.99999 | 6.115694 |
6872ea96-9ceb-4a5a-a466-930d02dc8f42 | quocdung2603/ALL_OF_C | CodeForces/A_Circle_of_Students.cpp | #include <bits/stdc++.h>
using namespace std;
#define nl << '\n'
#define fi first
#define se second
#define vc(type,name) vector<type>name
#define yes cout << "YES"
#define no cout << "NO"
#define int long long
#define double long double
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(),... | ALGO | 0.999833 | 4.064046 |
eb8d16f5-4daf-450d-952c-a011464eb251 | jocarsa/salvapantallas3 | starfield/simulacion.cpp | #include <opencv2/opencv.hpp>
#include <omp.h>
#include <vector>
#include <random>
#include <chrono>
#include <iostream>
#include <iomanip>
using namespace cv;
using namespace std;
using Clock = chrono::high_resolution_clock;
struct Star {
double angle;
double dist;
};
int main() {
// Window and video pa... | TOOL | 0.96213 | 5.92999 |
b23478ea-d5f7-4af2-9ce8-464bf23565e2 | morsalin80/Codeforces-and-atcoder | codeforces/4/B.cpp | /// Bismillahir Rahmanir Rahim
/* Mohammad Morsalin
Dept of ICE, NSTU
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define int long long
#define f0(... | ALGO | 0.999999 | 3.272571 |
06611266-89e2-4ffe-a271-2718ba560252 | gifsyn/AtCoder | ABC/ABC127/abc127c.cpp |
#include <cstdio>
#include <algorithm>
using namespace std;
#define m_MAX (int)1e5
int n, m;
int L[m_MAX + 1];
int R[m_MAX + 1];
int main(){
scanf("%d %d", &n, &m);
for(int i = 0; i < m; i++){
scanf("%d %d", &L[i], &R[i]);
}
int L_max = L[0];
int R_min = R[0];
for(int i = 0; i < m; ... | ALGO | 0.999881 | 3.873089 |
77171fd1-a1c0-446e-a1c3-7700dfb98468 | shaowei-cai-group/Z3-Parti-Z3pp-at-SMT-COMP-2024 | solver-files/common/resources/partitioner-src/src/tactic/core/cofactor_elim_term_ite.cpp | #include "tactic/core/cofactor_elim_term_ite.h"
#include "ast/rewriter/mk_simplified_app.h"
#include "ast/rewriter/rewriter_def.h"
#include "ast/for_each_expr.h"
#include "ast/ast_smt2_pp.h"
#include "ast/ast_ll_pp.h"
#include "tactic/tactic.h"
struct cofactor_elim_term_ite::imp {
ast_manager & m;
params_... | ALGO | 0.999934 | 7.533461 |
aecc041a-24a4-4f12-80fc-c84723526157 | AbhinavKoul/Coding_Questions_Solutions | InterViewBit(TopicWise Distribution)/Recursion or Backtracking/Solve SUDUKU/Solution.cpp | //#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<unordered_map>
#define v vector
using namespace std;
/*
This question is similar to graph colouring problem where
Colours = m = 9
edges = V = 9*9
Time Complexity = O(V^M) //since checking al... | ALGO | 0.999659 | 5.618768 |
e30be7b9-d5bf-43d3-ad62-5781e6befd4c | shanjiang7/FEMSolver | eigen-3.4.0/doc/examples/Tutorial_ArrayClass_cwise_other.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
ArrayXf a = ArrayXf::Random(5);
a *= 2;
cout << "a =" << endl
<< a << endl;
cout << "a.abs() =" << endl
<< a.abs() << endl;
cout << "a.abs().sqrt() =" << endl
<< a.abs().sqrt() << endl... | ALGO | 0.966202 | 3.130341 |
28ccb9e1-2ecf-4a58-8116-2df9764c85ca | jsccl1988/buildtools | third_party/libc++/trunk/test/std/containers/container.adaptors/priority.queue/priqueue.cons/ctor_iter_iter_comp.pass.cpp | // <queue>
// template <class InputIterator>
// priority_queue(InputIterator first, InputIterator last, const Compare& comp);
#include <queue>
#include <cassert>
#include <functional>
int main()
{
int a[] = {3, 5, 2, 0, 6, 8, 1};
int* an = a + sizeof(a)/sizeof(a[0]);
std::priority_queue<int, std::vecto... | TEST | 0.993376 | 5.088899 |
6c643d87-e423-43f3-bf42-e05e04d31ab8 | mohima-mimino11/DSA-DAY-33 | doubly_delete_at_head.cpp | #include <bits/stdc++.h>
using namespace std;
class Node{
public:
int val;
Node* next;
Node* prev;
Node(int val){
this->val = val;
this->next = NULL;
this->prev = NULL;
}
};
void deleteAtHead(Node* &head, Node* &tail){ // Time - O(1)
Node* deleteNode = head;
head = head->next;
delet... | ALGO | 0.998605 | 4.530838 |
eae8985f-a173-45ba-842c-8637f23e1a3c | plumzero/memo-pki | 参考/200多个常见的VC++加密算法代码/ecp.cpp | //Download by http://www.NewXing.com
// ecp.cpp - written and placed in the public domain by Wei Dai
#include "pch.h"
#include "ecp.h"
#include "asn.h"
#include "nbtheory.h"
#include "algebra.cpp"
#include "eprecomp.cpp"
NAMESPACE_BEGIN(CryptoPP)
ANONYMOUS_NAMESPACE_BEGIN
static inline ECP::Point ToMontgomery(const... | ALGO | 0.973234 | 6.097394 |
f4135ed6-695b-4cda-b717-96b59e6f2603 | debanjandgt/LeetCode | 3120. Count the Number of Special Characters I/code.cpp | class Solution {
public:
int numberOfSpecialChars(string word) {
map<char,int> mp;
int cnt=0;
set<char> st;
for(int i=0;i<word.size();i++)
{
char ch=word[i];
int d=(int)ch;
if(d>=65 && d<=90)
{
d+=32;
... | ALGO | 0.998674 | 5.590604 |
84bd1b6f-29db-4762-9934-054a2daea1e7 | CourtneyODonnell/flutter_application_1 | 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 |
ec822efe-7ca0-4c21-960a-0a131ae6eb63 | zpoint/Reading-Exercises-Notes | Programming_Pearls/Algorithms/binary_search_repeat_int.cpp | #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <queue>
#include <map>
std::map<int, size_t> val_map;
void generate_to_file(unsigned long long max_val)
{
std::ofstream ofs("temp.txt");
for (unsigned long long i = 0; i < max_val; ++i)
of... | ALGO | 0.969541 | 3.609054 |
15b6ffed-7ccd-4543-87b6-43beaf07b6ae | kaluginpeter/Algorithms_and_structures_tasks | CodeWars/7kyu/ Geometry_Basics_Cross_Product_in_3D.cpp | /*
This series of katas will introduce you to basics of doing geometry with computers.
Vector objects (struct in C) have x, y, and z attributes.
Write a function calculating the cross product of Vector a and Vector b, the result should be a Vector object.
You can read more about cross product on Wikipedia.
Tests ro... | ALGO | 0.90197 | 6.245047 |
97252ea9-750e-484a-9440-a97d0e7fd61c | rohitgargRG/C-DSA | Revision/Stack_and_queue/stack_using_LL.cpp | #include <bits/stdc++.h>
using namespace std;
class Node{
public:
int data;
Node* next;
Node(int& data){
this -> data = data;
this -> next = NULL;
}
};
class stack_using_LL{
public:
int size;
Node* top;
stack_using_LL(){
this -> size = 0;
}
// pus... | ALGO | 0.999101 | 4.834165 |
f2cd4515-8923-4dbf-81a2-400a867a0eca | Dhruv-Mahajan227/C-Programs | Q_63.cpp | // Question 63
//C++ Program to Count the Frequency of Each Character in a String Using a For Loop
#include <iostream>
using namespace std;
int main() {
string str;
int freq[256] = {0};
cout << "Enter a string: ";
cin >> str;
for (char ch : str) {
freq[ch]++;
}
cout << "Characte... | ALGO | 0.99884 | 4.317346 |
1ac163a4-53fc-4847-ad62-1b8606576012 | heiseish/Competitive-Programming | kattis/grass/grass.cpp | /**
if you don’t like your destiny, don’t accept it .instead ,have the courage to change it.
*/
#include <bits/stdc++.h>
#define forn(i, l, r) for(int i=l;i<=r;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define nd second
#define st first
#define debug(x) cout<<#x<<" -> "<<x<< endl
#define kakim... | ALGO | 0.999846 | 3.531289 |
04ad41ff-8b02-4779-bcff-62eed0daf17d | mehedi1022/CodeBlocks | Codeforces/ICPCAssiut/Data Type/AreaOfACircle/AreaOfACircle.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
double a, r, pi;
cin >> r;
pi = 3.141592653;
a = pi * r * r;
cout << fixed << setprecision(9) << a << endl;
return 0;
} | ALGO | 0.995094 | 4.074867 |
9e21684b-2f99-4461-9589-a576162337c5 | HYBB-rash/algorithm | PAT_Advan/1015.cpp |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MAXN = 1000010;
bool prime[ MAXN + 1 ];
// 打素数表
void init_prime() {
prime[ 0 ] = prime[ 1 ] = true;
for ( int i = 2; i <= MAXN; i++ ) {
if ( !prime[ i ] )
for ( int j = 2 * i; j < MAXN; j += i )
... | ALGO | 0.999805 | 4.329327 |
d8ccf4ea-a345-4dbd-a7f0-a37b19ae9b4c | vinhngtr/1000-bai-code-thieu-nhi | Chapter 1/006.cpp | #include <iostream>
using namespace std;
int main ()
{
cout << "n: ";
unsigned int n; cin >> n;
double sum = 0;
for (unsigned int i = 1; i <= n; i++)
sum += 1.0 / (i * i + 1);
cout << "S(n) = " << sum << endl;
return 0;
} | ALGO | 0.999189 | 4.188053 |
9390d75c-525d-4ec8-8af7-4b835340fdd1 | JustWon/rgbd_slam_lecture | 3rdparty/g2o/g2o/apps/g2o_hierarchical/g2o_hierarchical_test_functions.cpp | #include <signal.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <fstream>
#include <sstream>
#include <algorithm>
#include <cassert>
#include <sstream>
#include "g2o/apps/g2o_cli/dl_wrapper.h"
#include "g2o/apps/g2o_cli/output_helper.h"
#include "g2o/apps/g2o_cli/g2o_common.h"
#include "g2o/core/... | ALGO | 0.977624 | 6.020065 |
ca114fc5-0e26-4ad4-b010-a9453e0e0a83 | Sapna-Mary/bpc_assignment | table.cpp | //Program to print the tables of 5
#include <iostream>
int main()
{
int num = 5;
std::cout << "Multiplication Table of " << num << ":\n";
for (int i = 1; i <= 10; ++i)
{
std::cout << num << " x " << i << " = " << (num * i) << std::endl;
}
return 0;
}
| TOOL | 0.986014 | 3.697179 |
fa36fa3a-8266-4fc9-ac39-88dee0551200 | TaeminYeom/sensord | src/fusion-sensor/fusion_util.cpp | #include <errno.h>
#include <math.h>
#include <stdlib.h>
#include "fusion_util.h"
#define RAD2DEGREE (180/M_PI)
#define QUAT (M_PI/4)
#define HALF (M_PI/2)
#define ARCTAN(x, y) ((x) == 0 ? 0 : (y) != 0 ? atan2((x), (y)) : (x) > 0 ? M_PI/2.0 : -M_PI/2.0)
static float clamp(float v)
{
return (v < 0) ? 0.0 : v;
}
int... | ALGO | 0.988986 | 6.647778 |
bb0fa309-ef89-4d0d-a6ce-ee8568a8f94c | anstjaos/Algorithm | BOJ/13244.cpp | #include <iostream>
using namespace std;
int tc, N, M, edge[1001][1001], from, to, cnt;
bool visit[1001];
int stack[1001], top;
void init()
{
top = -1;
cnt = 0;
for (register int i = 1; i <= N; i++) {
visit[i] = false;
for (register int j = 1; j <= N; j++) edge[i][j] = 0;
}
for (register int i = 0; i < M; i... | ALGO | 0.999959 | 4.614641 |
2cf60228-eefb-4fc5-bf9f-e2a7efd32a6a | 5akur0/Sakuro_PKU_Introduction-to-Computing_A | 链表/3.cpp | #include <bits/stdc++.h>
using namespace std;
// 定义链表节点结构体
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
// 插入一个新节点到链表
void insert(ListNode *&head, int value) {
ListNode *newNode = new ListNode(value);
if (head == NULL) {
head = newNode;
} else {... | ALGO | 0.999995 | 4.976215 |
5223655a-320f-416d-b0d2-228f96c37750 | rival809/camera_usb | packages/pigeon/platform_tests/test_plugin/example/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.997682 | 6.785805 |
c2390fc2-ad70-442e-a82b-9a615739cc1b | Dashbah/Algorithms_2 | semester1/contest4_corndekomp/A_sqrtDecomposition.cpp | //
// Created by Dashbah on 15.10.2022.
//
// TL91
#include <vector>
#include <iostream>
#include <cmath>
int zapros(int left, int right, std::vector<int> &vec, const std::vector<int> &vec1,
const std::vector<int> &vec2, int length1, int length2) {
int result = 0;
--left;
--right;
int len1_l... | ALGO | 0.999818 | 4.657331 |
f844dc04-e376-4f84-9eb8-b0ca0b230703 | JohnDSylvester/lab9 | labs/genepool/Query.cpp | #include "Query.h"
#include <algorithm>
#include <sstream>
#include <stdexcept>
// This file provides query parsing and execution.
// You can edit it if you want, but you shouldn't need to.
// Gradescope will use the original version.
// Helper function that throws an error if a read fails:
void read_term(std::istre... | TOOL | 0.876327 | 6.668283 |
35df79a9-ddd6-4347-ac9f-e4c171524158 | antoto17/tp5listas | ejercisio2.cpp | #include <iostream>
using namespace std;
class Nodo {
private:
int dato;
Nodo* sig;
public:
Nodo(int d) {
dato = d;
sig = nullptr;
}
int getDato() {
return dato;
}
Nodo* getSiguiente() {
return sig;
}
void setSiguiente(Nodo* s) {
sig = s;
... | ALGO | 0.983975 | 5.773245 |
be593a5a-f743-4e64-bc0a-06e8f152e512 | cherrie-k/NearHere | 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 |
c9927e20-7311-44de-8792-43cb423186f9 | chinhtx04/Data-structure-and-algorithm | Semester 2/Lab 8/C.cpp | #include <iostream>
#include <vector>
using namespace std;
vector<int> adj[1000001];
bool visited[1000001];
void DFS(int u)
{
visited[u] = true;
for (int x : adj[u])
{
if (!visited[x])
{
DFS(x);
}
}
}
int main()
{
int n, m;
cin >> n >> m;
for (int i = ... | ALGO | 0.999764 | 5.093603 |
a9998460-8e9a-43fe-9d74-716646f12b98 | kmsabrin/UVaSolved | UVaSolved/Volume 109/10911.cpp | #include <stdio.h>
#include <math.h>
int n;
double min_sum;
int X[16], Y[16];
char used[16];
double distance( int i, int j )
{
return sqrt( double( ( X[i] - X[j] ) * ( X[i] - X[j] ) + ( Y[i] - Y[j] ) * ( Y[i] - Y[j] ) ) );
}
int call( double sum )
{
int i, j;
if ( sum > min_sum )
{
return 0;
}
for ( i ... | ALGO | 0.997746 | 3.544378 |
0754cbff-1908-4e07-9c7d-628c311ede96 | moran991231/SystemProgramming | 20211006MultiThread/onethread.cpp | /*
* Numbers.c
*
* Sample code for "Multithreading Applications in Win32"
* This is from Chapter 2, Listing 2-1
*
* Starts five threads and gives visible feedback
* of these threads running by printing a number
* passed in from the primary thread.
*
*/
#define WIN32_LEAN_AND_MEAN
#include <stdio.h>
#include ... | ALGO | 0.961938 | 4.154881 |
08c75d9d-68a9-47ff-a5e7-149bd32d9726 | cs350892/LeetCodeChallenge_50days | Array_BesttiimetoBuy01.cpp | #include <iostream>
using namespace std;
int maxProfit(int prices[], int size) {
if (size == 0) return 0;
int min = prices[0];
int max = 0;
for (int i = 1; i < size; i++) {
if (prices[i] < min) {
min = prices[i];
} else {
int profit = prices[i] - min;
... | ALGO | 0.9999 | 6.523684 |
9cb83023-a4b4-4667-b093-2d523d32a40a | sarvex/leetcode-racket | solution/2100-2199/2101.Detonate the Maximum Bombs/Solution.cpp | class Solution {
public:
int maximumDetonation(vector<vector<int>>& bombs) {
int n = bombs.size();
vector<vector<bool>> g(n, vector<bool>(n));
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
g[i][j] = check(i, j, bombs);
int ans = 0;
for (i... | ALGO | 0.999939 | 5.83558 |
c22a5359-b156-4e9f-8108-c3d6bb0aa9c0 | AnkangH/LeetCode | others/7. Reverse Integer.cpp | /*
Given a 32-bit signed integer, reverse digits of an integer.
Example 1:
Input: 123
Output: 321
Example 2:
Input: -123
Output: -321
Example 3:
Input: 120
Output: 21
Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1].
For the pur... | ALGO | 0.999888 | 5.479106 |
5edc0f6c-a015-4178-9841-f6762cb83094 | evangrin/mute-plugin-example | JUCE/modules/juce_box2d/box2d/Collision/b2Collision.cpp | #include "b2Collision.h"
#include "b2Distance.h"
void b2WorldManifold::Initialize(const b2Manifold* manifold,
const b2Transform& xfA, float32 radiusA,
const b2Transform& xfB, float32 radiusB)
{
if (manifold->pointCount == 0)
{
return;
}
switch (manifold->type)
{
case b2Manifold::e_circles:
{... | ALGO | 0.9993 | 7.734326 |
1d69c637-d405-4bd9-9eeb-637cb3b2c534 | deepakbhavsar43/Data-Structure-and-algorithm-with-c- | BinaryTree/preorder_built_and_print_tree.cpp | #include<iostream>
using namespace std;
class node{
public:
node* left;
int data;
node* right;
node(int d){
data=d;
left=NULL;
right=NULL;
}
};
node* buildTree(){
int d;
cin>>d;
if(d==-1){
return NULL;
}
... | ALGO | 0.999941 | 4.509094 |
3da788ba-3a81-4dbc-a058-f45e590a0445 | funbp6/code-practice | 程式設計程式/Convex_Hull.cpp | #include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
double vangle(pair<double,double>f, pair<double,double>s)
{
double lenfs,lenos;
lenfs=sqrt(f.first*f.first+f.second*f.second);
lenos=sqrt(s.first*s.first+s.second*s.second);
cout << "lenfs= " << lenfs << " " << "lenos= " << l... | ALGO | 0.999995 | 3.590234 |
24e43cf8-02f9-420a-a0ad-d82e04b60d7e | rpl-cmu/incopt | gtsam/gtsam_unstable/nonlinear/ConcurrentIncrementalSmoother.cpp | /**
* @file ConcurrentIncrementalSmoother.cpp
* @brief An iSAM2-based Smoother that implements the
* Concurrent Filtering and Smoothing interface.
* @author Stephen Williams
*/
#include <gtsam_unstable/nonlinear/ConcurrentIncrementalSmoother.h>
#include <gtsam/nonlinear/LinearContainerFactor.h>
#in... | ALGO | 0.980032 | 7.575832 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.