uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
2624b30e-498b-4c09-8edc-ba6e9f836bfb | FirdausHA/variegata_app | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.9988 | 6.76073 |
bcf47983-e0f0-42aa-92cb-8cd9f4953d3f | Kriminal589/Infa_MIREA | Домашняя работа №4/Проверка/Проверка/main.cpp | #include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
int main() {
setlocale(LC_ALL, "Russian");
int count = 0, sign = 0;
double s, m, n, p = 1;
cin >> s >> m >> n;
while ((s * (p / 100) * pow(1 + p / 100, n)) / (12 * (pow(1 + p / 100, n) - 1)) < m)
{
p += 0.1;
count += 1;
}
cout << "В... | ALGO | 0.999417 | 3.402883 |
84b540df-acd7-41c2-87fd-1a180aac1189 | bhavyagoel/LeetCode | 2. October'21/encode-and-decode-tinyurl/encode-and-decode-tinyurl.cpp | class Solution {
public:
// Encodes a URL to a shortened URL.
string encode(string longUrl) {
return longUrl;
}
// Decodes a shortened URL to its original URL.
string decode(string shortUrl) {
return shortUrl;
}
};
// Your Solution object will be instantiated and called as suc... | ALGO | 0.988837 | 5.882875 |
01f71c1f-fd39-4143-b636-8076af3cb7a6 | NiloyKumarKundu/Leetcode-Preparation | HackerRank/Mix Problem/Between Two Sets.cpp | #include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
/*
* Complete the 'getTotalX' function below.
*
* The function is expected to return an INTEGER.
* The function accepts following parameters:
* 1. INTEGER_ARRAY a
* ... | ALGO | 0.999935 | 4.382984 |
41c0616c-e024-4838-9d18-1a5c1fa8214d | Beman/boost-trunk-git-svn | libs/spirit/example/lex/word_count_lexer.cpp | // This example is the equivalent to the following lex program:
/*
//[wcl_flex_version
%{
int c = 0, w = 0, l = 0;
%}
%%
[^ \t\n]+ { ++w; c += yyleng; }
\n { ++c; ++l; }
. { ++c; }
%%
main()
{
yylex();
printf("%d %d %d\n", l, w, c);
}
//... | TOOL | 0.862071 | 7.635916 |
8d2aca52-2e8e-4aa0-82ea-31615dd1a953 | Macmat8/Regulacja_temperatury_pomieszczenia | CPP_Projekt_3/Regulator_BB.cpp | #include "Regulator_BB.h"
#include"Grzejnik.h"
#include "Pomieszczenie.h"
void Regulator_BB::steruj(float _temp_zad, float _dt, float _temp_akt) {
if (_temp_akt <= _temp_zad) {
g.ustaw_poziom(1);
}
if (_temp_akt > _temp_zad) {
g.ustaw_poziom(0);
}
} | TOOL | 0.89733 | 4.322725 |
27414145-8fdc-451e-be10-93ad53e85ace | Jinansh28/C_Plus_Plus | Leetcode/1721_SwappingNodesInLinkedList.cpp | #include<iostream>
using namespace std;
class ListNode {
public:
int val;
ListNode *next;
ListNode() : val(0), next(nullptr) {}
ListNode(int x) : val(x), next(nullptr) {}
ListNode(int x, ListNode *next) : val(x), next(next) {}
};
void print(ListNode *head){
ListNode *s = head;
while(s ... | ALGO | 0.999993 | 4.880324 |
5df8a23b-8ece-42ba-a9c0-f56e0373b44e | affan110/dsa-coding | Assignment 3 - Arrays/threeSumClosest.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <climits>
using namespace std;
int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(), nums.end());
int closestSum = INT_MAX;
int curSum = 0;
for (int i = 0; i < nums.size() - 2; i++) {
int left = i + 1;
... | ALGO | 0.999993 | 6.345501 |
f7b5a0e9-01db-4a8a-998e-10163162ca69 | Jak57/14-design-patterns-coding-interview | 3. Fast and Slow pointers/p1. Linked List Cycle.cpp | // https://leetcode.com/problems/linked-list-cycle/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
bool hasCycle(ListNode *head) {
if (head == NULL || head->next == NULL)... | ALGO | 0.99934 | 5.718991 |
45ec80bd-5f7b-41af-ba9f-ce57bcb5b5e1 | ia-toki/osn-2022 | osn-2022-gunungan/solution.cpp | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5;
const long long MAX_ANS = 1e18;
long long multiply(long long a, long long b) {
if (a == 0 || b == 0) return 0;
if (a > MAX_ANS || b > MAX_ANS) return MAX_ANS+1;
if (a > MAX_ANS / b) return MAX_ANS+1;
return a * b > MAX_ANS ? MAX_ANS + 1 : a ... | ALGO | 0.99999 | 4.33388 |
be42e6d3-5069-4bd4-a9db-e765e177b9f9 | hduyyg/acm | 高精度/1601-1.cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 500;
char s[maxn + 10];
int a[maxn + 10], b[maxn + 10];
void read(int a[]) {
scanf("%s", s);
int len = strlen(s);
for(int i = len - 1; i >= 0; i--) {
a[++a[0]] = s[i] - '0';
}
while(a[0] > 1 && a[a[0]] == 0) a[0]--;
}
... | ALGO | 0.999936 | 3.638667 |
b7c45fd1-c880-4261-b4e3-1a901e2cdab0 | harastw/SKILLBOX-CPP | practice14/pre5.cpp | #include <iostream>
using namespace std;
const unsigned int SIZE = 12;
void init(bool arrow[SIZE][SIZE]) { for (int i = 0; i < SIZE; i++) for (int j = 0; j < SIZE; j++) arrow[i][j] = true; }
void display(bool arrow[SIZE][SIZE])
{
for (int i = 0; i < SIZE; i++)
{
for (int j = 0; j < SIZE; j++)
{... | TOOL | 0.948156 | 4.049451 |
8b1656f7-0e93-4c9f-a388-8ed664d2cb9a | pigpenguin/Cs02 | 6_9_14/tests.cpp | #include <iostream>
using namespace std;
int main(){
double t1,t2,t3,t4,t5;
cout << "Please input 5 test scores seperated by spaces: ";
cin >> t1 >> t2 >> t3 >> t4 >> t5;
cout << "The average is: " << (t1+t2+t3+t4+t5)/5 << endl;
return 0;
}
| ALGO | 0.880031 | 3.844414 |
2c97146b-e730-416e-8cb0-ea1f0114ce4e | lope3x/URI | 1015.cpp | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main(int argc, char const *argv[])
{
double x1,x2,y1,y2;
cin>>x1;
cin>>y1;
cin>>x2;
cin>>y2;
double q1 = pow(x2-x1,2);
double q2 = pow(y2-y1,2);
double dist = sqrt(q1+q2);
cout<<fixed;
cout... | ALGO | 0.999699 | 3.974829 |
c71d08e4-0e88-4f59-b0fe-877307a880bd | nullmastermind/inkscape-for-trace | src/snapped-curve.cpp | #include "snapped-curve.h"
#include <2geom/path-intersection.h>
Inkscape::SnappedCurve::SnappedCurve(Geom::Point const &snapped_point, Geom::Point const &tangent, int num_path, int num_segm, Geom::Coord const &snapped_distance, Geom::Coord const &snapped_tolerance, bool const &always_snap, bool const &fully_constraine... | ALGO | 0.999552 | 7.030021 |
f96218d2-e97b-4430-91b9-5e804a6ae17a | tr1ten/DNA | usaco/Gold/D_2_Prefix_Suffix_Palindrome_Hard_version.cpp | #include <cstdio>
#include <bits/stdc++.h>
using namespace std;
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace __gnu_pbds;
template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update> ;
template<typename T>
using order... | ALGO | 0.999978 | 4.353939 |
c43cee13-f450-47c5-8962-4cae872909ca | wh-acmer/acm-shiyuan | Code in 2013/hdu4745.cpp | /*
water
*/
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 1010 ;
int dp[maxn][maxn];
int a[maxn];
int main()
{
int n;
while(scanf("%d",&n),n)
{
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
mems... | ALGO | 0.999865 | 3.497468 |
31a154a8-3fc2-45f2-b06a-be5dc1184d80 | lc-3-2/llvm | libc/src/math/generic/remquof.cpp | #include "src/math/remquof.h"
#include "src/__support/FPUtil/DivisionAndRemainderOperations.h"
#include "src/__support/common.h"
namespace __llvm_libc {
LLVM_LIBC_FUNCTION(float, remquof, (float x, float y, int *exp)) {
return fputil::remquo(x, y, *exp);
}
} // namespace __llvm_libc
| ALGO | 0.960687 | 5.697822 |
0d2f2ce5-79c7-4744-9917-6be50bfb662d | FedorovValentyn/PsychoDiagnosis | back/.venv/Lib/site-packages/sklearn/utils/src/MurmurHash3.cpp | // Note - The x86 and x64 versions do _not_ produce the same results, as the
// algorithms are optimized for their respective platforms. You can still
// compile and run any of them on any platform, but your performance with the
// non-native version will be less than optimal.
#include "MurmurHash3.h"
//-------------... | ALGO | 0.998534 | 7.198757 |
0f384170-6351-4d48-ab7e-bc6de72db6d8 | scottdwdwdw/leetcode | 219ContainsDuplicateII.cpp | /*
Given an array of integers and an integer k,
find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j]
and the difference between i and j is at most k.
*/
//ҵĴ
bool containsNearbyDuplicate(vector<int>& nums, int k) {
int n=nums.size();
std::map<int,std::vector... | ALGO | 0.999909 | 5.470223 |
f9397e7b-e287-4909-ac5c-436c7b7a31ab | broccoli-97/libigl | include/igl/bfs_orient.cpp | template <typename DerivedF, typename DerivedFF, typename DerivedC>
IGL_INLINE void igl::bfs_orient(
const Eigen::MatrixBase<DerivedF> & F,
Eigen::PlainObjectBase<DerivedFF> & FF,
Eigen::PlainObjectBase<DerivedC> & C)
{
using namespace Eigen;
using namespace std;
SparseMatrix<typename DerivedF::Scalar> A;
... | ALGO | 0.99956 | 6.060578 |
afcd9f64-26be-4839-8d03-e77fa512d14e | jiws829/Blue-Marble | team project/base.cpp | //82x40
#include "horse.h" // ִ ü
#include "go.h" //Ŀ ̵
#include "color.h" //ܼâ ִ Լ
#include "board.h" //
#include "finish.h" //Ļ
#include "money.h" //â ϴ Լ
#include "move.h" // ̵
#include "reset.h" // ʱȭ
#include "sell.h" // ̳ʽ Ű
#include "move_key.h" //Ȳݿ迡 ̵
#include "key.h" //Ȳݿ
#include "... | ALGO | 0.855043 | 3.620332 |
f797b393-9673-4eb5-8e4a-d16a88bb9a3e | stonewinter/LeetcodeEx | cpp_LeetCode_algo_7.cpp | #include <sstream>
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
int reverse(int x);
int main(){
int in = 900000;//1534236469;
cout << reverse(in) << endl;
return 0;
}
/*
solution 1, convert to string
*/
//int reverse(int x) {
// in... | ALGO | 0.999933 | 5.098503 |
1c1b7829-bdfe-4124-9f6d-9120eb7e643d | KevinOrellana00151220/LaboratoriosFunda | divisible.cpp | #include "iostream "
using namespace std;
int main(){
// se declaran las variables
int dividendo ;
int divisor ;
// se envia un mensaje al usuario pidiendo los valores de las variables
cout << "Ingrese los dos valores a dividir" << endl;
//se piden los valores al usuario
cin >> dividendo ;
cin >> divisor ;
// se ... | ALGO | 0.962975 | 3.521268 |
eeac862d-c4dd-4883-bef8-3b5db36143fd | iamkuntal2002/Atlassian-DSA | possibleWordsFromDigits.cpp | #include <bits/stdc++.h>
using namespace std;
void helper(string &dig, unordered_map<char, string> &mp, vector<string> &res, string curr, int ind)
{
if (ind == dig.size())
{
res.push_back(curr);
return;
}
string s = mp[dig[ind]];
for (int i = 0; i < s.size(); i++)
{
curr.... | ALGO | 0.999773 | 5.503246 |
aa943ef4-2fa3-4adc-9a2a-0ca2dcedd0e0 | alvinpiter/competitive-programming | TROC/02/D.cpp | #include<bits/stdc++.h>
using namespace std;
#define LL long long int
#define MAXV 50000
pair<int, vector<int> > generate(int base, int multiplier, int mod) {
int seenAt[MAXV + 3];
memset(seenAt, -1, sizeof(seenAt));
int current = base;
int cycleStartAt;
vector<int> numbers;
numbers.push_back... | ALGO | 0.999798 | 3.720569 |
95fa7d49-a3be-4fcf-8be6-5c6f69a360c4 | abdelrhman-arfat/cpp | task1-2/cpp.cpp | #include <iostream>
using namespace std;
int main()
{
int number;
cin >> number;
for (int i = 1; i < 11; i++)
{
cout << number << " x " << i << " = " << number * i << endl;
}
}
| ALGO | 0.996703 | 4.341491 |
f79a621d-5206-4b29-9395-e53dbcdfce71 | HermanPlay/computer-graphics-1 | task-3/polygon.cpp | #include "line.h"
#include "polygon.h"
#include "qcolor.h"
#include "qpainter.h"
#include "qpoint.h"
#include <QDebug>
void Polygon::draw(QPainter& painter) {
painter.setPen(color);
if (vertices.size() < 2) {
// Draw larger dots for individual vertices
for (const auto& vertex : vertices) {
... | TOOL | 0.974965 | 5.977603 |
9ba1e1f8-1a86-44b3-bd66-4d26820d17da | sarvex/leetcode-skip | solution/2000-2099/2079.Watering Plants/Solution.cpp | class Solution {
public:
int wateringPlants(vector<int>& plants, int capacity) {
int ans = 0, cap = capacity;
for (int i = 0; i < plants.size(); ++i) {
if (cap >= plants[i]) {
cap -= plants[i];
++ans;
} else {
cap = capacity - p... | ALGO | 0.999988 | 6.183552 |
0ff32795-61f9-4f6a-95df-dc0454f6923b | Jubayer-Islam/NSU-4th-sem-Lab.Codes-Projects | Stack queue LIst Pal and Rev check/ass/main.cpp | #include "queue.cpp"
#include "list.cpp"
#include "stack.cpp"
#include <iostream>
#include<string>
using namespace std;
bool IsPalindrome(string);
bool IsReverse(string,string);
bool IsPalindrome(string str){
StackLL<char> S1;
QueueLL<char> Q1;
int x=str.length();
bool p;
for(int i=0;i<x;i++){
S1... | ALGO | 0.997778 | 3.593024 |
28c73a6c-04e5-4553-a3e4-4d4efb4eb6b6 | bachtn002/-CTDL-GT | Data-Structure-and-Algorithms-PTIT-2020-master/Contest_3-Greedy_Algorithms/BAI2.cpp | #include <bits/stdc++.h>
using namespace std;
string num1, num2;
int min_sum() {
for (int i = 0; i < num1.length(); i++)
if (num1[i] == '6')
num1[i] = '5';
for (int i = 0; i < num2.length(); i++)
if (num2[i] == '6')
num2[i] = '5';
return stoi(num1) + stoi(num2);
}
... | ALGO | 0.99954 | 5.390904 |
85144e0f-e50d-405d-a36b-01aac9c2d5b8 | eggag32/Competitive-Programming | Codeforces/Kind Anton.cpp | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | ALGO | 0.999902 | 3.29289 |
549ab315-eb3d-4dd2-9f1c-7790431b76e4 | humkyung/SmartISO | App/SmartISODiff/ConvexHull.cpp | // IsConvexHull.cpp: implementation of the CConvexHull class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "ConvexHull.h"
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
///////////////////////////////////////... | ALGO | 0.999483 | 5.112238 |
e4188c8e-049b-4838-bc44-90cf311963a9 | ratikumari227/CPP | String_prog/palindrome.cpp | #include <iostream>
#include <string.h>
using namespace std;
void palindrome(char a[])
{
int len = strlen(a)-1;
int i=0,f=0;
while(i<=len)
{
if(a[i] != a[len-i])
f=1;
i++;
}
if(f==1)
cout<<"Not palindrome string";
else
cout<<"Palindrome string... | ALGO | 0.996976 | 4.073749 |
0dbd5bfe-6891-400a-b6b7-e820da6be531 | tjgolubi/boost | libs/geometry/index/example/random_test.cpp | // Boost.Geometry Index
// Additional tests
#include <iostream>
#define BOOST_GEOMETRY_INDEX_DETAIL_EXPERIMENTAL
#include <boost/geometry/index/rtree.hpp>
#include <boost/foreach.hpp>
#include <boost/random.hpp>
int main()
{
namespace bg = boost::geometry;
namespace bgi = bg::index;
size_t values_count... | TEST | 0.874873 | 6.418349 |
bb6d5480-ba1b-41c9-be5a-19a3977e9a2c | GuacheSuede/MSSubmission1234567890 | submission/ema/boost_1_69_0/libs/graph/example/make_biconnected_planar.cpp | #include <boost/graph/biconnected_components.hpp>
#include <boost/graph/make_biconnected_planar.hpp>
#include <boost/graph/boyer_myrvold_planar_test.hpp>
using namespace boost;
int main(int argc, char** argv)
{
typedef adjacency_list
< vecS,
vecS,
undirectedS,
property<vertex_index_t, int>,... | ALGO | 0.989458 | 7.067492 |
f61dda85-5913-4f10-a854-d96426192670 | imhardikdesai/DSA-Algorithms | C++ Programs/FractionalKnapsack.cpp | /*
Given the weights and values of N items, put these items in a knapsack of capacity W
to get the maximum total value in the knapsack. In Fractional Knapsack, we can break
items for maximizing the total value of the knapsack
*/
#include <bits/stdc++.h>
using namespace std;
struct Item {
int value, weight;
Item(i... | ALGO | 0.999953 | 5.136918 |
ceb205e2-e39f-45f7-9266-99b289694392 | TM-DEV-PRO/DSA-CP | funtion-snippets/strivers/day17/bottom-view.cpp | vector<pair<int,int>> res(2*100002);
void solve(Node *root,int i, int h){
if(root==NULL)
return;
if(h>=res[i].second){
res[i].first=root->data;
res[i].second=h;
}
solve(root->left,i-1,h+1);
solve(root->right,i+1,h+1);
}
//Function to return a list containing the bottom view... | ALGO | 0.999988 | 5.022227 |
837d2658-ce10-40ae-812a-2262eecb0be3 | Jairo-Roke/ardupilot_4_4 | libraries/AC_WPNav/AC_WPNav_OA.cpp | #include <AP_Math/control.h>
#include <AP_InternalError/AP_InternalError.h>
#include "AC_WPNav_OA.h"
AC_WPNav_OA::AC_WPNav_OA(const AP_InertialNav& inav, const AP_AHRS_View& ahrs, AC_PosControl& pos_control, const AC_AttitudeControl& attitude_control) :
AC_WPNav(inav, ahrs, pos_control, attitude_control)
{
}
// r... | TOOL | 0.916096 | 7.062773 |
ce229f68-4642-427d-acce-5f3d88848f8c | wvu-navLab/Enabling-Robust-State-Estimation-through-Measurement-Error-Covariance-Adaptation | 3rdparty/Eigen/doc/snippets/Tutorial_solve_triangular.cpp | Matrix3f A;
Vector3f b;
A << 1,2,3, 0,5,6, 0,0,10;
b << 3, 3, 4;
cout << "Here is the matrix A:" << endl << A << endl;
cout << "Here is the vector b:" << endl << b << endl;
Vector3f x = A.triangularView<Upper>().solve(b);
cout << "The solution is:" << endl << x << endl;
| ALGO | 0.999815 | 3.055453 |
3f285726-3df3-42b2-a1b5-ba3258ccf81c | vitalykov/yandex-training | week1/d.cpp | #include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> bars(n);
for (int& bar : bars) {
std::cin >> bar;
}
std::vector<bool> weights(m + 1, false);
weights[0] = true;
for (const auto& bar : bars) {
if (bar > m) {
... | ALGO | 0.999995 | 5.291389 |
4b97e3a2-0618-48cf-9ac6-a7b9bdfedcac | Vivekrathore2002/DSA-Coding | Special Digits - GFG/special-digits.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
int done=0;
vector<long long>f, inv;
class Solution {
const long long M=1e9+7;
public:
int bestNumbers(int N, int A, int B, int C, int D) {
if(!done) pre();
if(A==B)
{
long long sum=... | ALGO | 0.999785 | 6.009564 |
5518db81-e120-40c3-8fb0-1e8d92f9fe18 | killerrings/C-OOP- | Revision/friendFunction.cpp | #include<iostream>
using namespace std;
class B;
class A{
int num1;
public:
A(int a){
num1=a;
}
friend void add(A, B);
};
class B{
int num2;
public:
B(int b){
num2=b;
}
friend void add(A, B);
};
void add(A objA, B objB){
co... | ALGO | 0.978808 | 4.644476 |
5ed0e70a-4b91-4920-bcb7-32cc135f0e8f | vrishe/assembly | assembly.cpp | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <memory>
#include <regex>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
#inc... | TOOL | 0.905707 | 4.527081 |
6d6e3c67-f718-43bf-bb94-e6736fcefe32 | akhilkammila/leetcode-screenshotter | editorial_code/2000-2999/2483. Minimum Penalty for a Shop/cpp-0.cpp | class Solution {
public:
int bestClosingTime(string customers) {
// Start with closing at hour 0, the penalty equals all 'Y' in closed hours.
int curPenalty = count(customers.begin(), customers.end(), 'Y');
int minPenalty = curPenalty;
int earliestHour = 0;
for (int i = 0; i... | ALGO | 0.999801 | 6.520111 |
dbdfa3c9-38df-4887-ae41-cb04a3862b30 | kumarshashank571/July-Leetcode-Challenge | Binary Tree Zigzag Level Order Traversal(July 22).cpp | class Solution {
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
if(root == nullptr){return {};}
vector<vector<int>> result;
deque<TreeNode*> q;
q.push_back(root);
bool reverse = true;
while(!q.empty()){
int count = q.size();
vec... | ALGO | 0.999999 | 6.130207 |
d0ead0f7-837a-42ec-b5e5-be5df7faee22 | theleader99/data-structures-and-algorithms-c- | boi_so.cpp | //practice25
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll res[500];
int n;
bool OK;
void Solve(){
queue<ll> q;
q.push(9);
OK=true;
while(true){
ll t=q.front();q.pop();
if(t%n==0){
cout<<t;
OK=false;
break;
}
q.push(t*10);
q.push(t*10+9);
}
}
int main(){
ll t;
cin>>t;... | ALGO | 0.999859 | 4.782609 |
a5354f60-b4ef-4196-8ff4-c4913ed482b2 | amrendrayd/Dsa-with-Amrendra | searching-sorting/firstOccurence.cpp | #include <iostream>
#include <vector>
using namespace std;
int findFirstOccurence(vector<int> arr, int target){
int start = 0;
int end = arr.size() - 1;
int mid = start + (end - start) /2;
int ans = -1;
while(start <= end){
if(arr[mid] == target){
ans = mid;
end ... | ALGO | 0.999938 | 5.430182 |
1ae24a72-6f7e-4987-b7d3-fc6adb67d6f7 | Mosina916/Nagarro-Bootcamp-CPP-May-21 | lecture13/sumofelementsofarray.cpp | #include<iostream>
using namespace std;
// recursion -->function calling itself
// way 1 -->by shrinking array from forward
int sumofarrayelements(int *a,int n){ //4 5 8 n=3
// base case
// if(n==1){
// return a[0];
// }
if(n==0){
return 0;
}
// recursive case
return a[0]+sumofarrayelements(a+1,n-1);
}
... | ALGO | 0.999941 | 4.26988 |
9ca0efcc-61fa-4165-8001-87a8362fd533 | raincross7/code-similarity | codes/train_code/problem085/problem085_84.cpp | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int ... | ALGO | 0.999543 | 3.829823 |
7208519e-e33e-4fe9-a2d8-0ff9e0b92bad | Fadis/dlambda | src/compile/less.cpp | #include <boost/mpl/and.hpp>
#include <boost/mpl/or.hpp>
#include <boost/mpl/not.hpp>
#include <boost/type_traits/is_same.hpp>
#include <boost/utility/enable_if.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <llvm/IR/Value.h>
#include <llvm/IR/IRBuilder.h>
#include <dlambda/type.hpp>
#include <dlambda/proto/n... | TOOL | 0.93598 | 7.845158 |
3aa912b7-4b0a-44be-9fd3-cb2ae21a6097 | avendramini/leetcode | solved_problems/0172-factorial-trailing-zeroes/solution.cpp | class Solution {
public:
int trailingZeroes(int n)
{
int cont5=0;
int cont2=0;
for(int i=1;i<=n;i++)
{
int num=i;
while(num%2==0)
cont2++,num/=2;
while(num%5==0)
cont5++,num/=5;
}
return min(cont... | ALGO | 0.999946 | 6.449233 |
ab9420d6-4f34-419f-85bc-b0c5c5244b79 | fithisux/FSL | extras/include/boost/libs/geometry/doc/doxy/doxygen_input/sourcecode/doxygen_2.cpp | OBSOLETE
#include <boost/tuple/tuple.hpp>
#if defined(_MSC_VER)
// We deliberately mix float/double's here so turn off warning
//#pragma warning( disable : 4244 )
#endif // defined(_MSC_VER)
#include <boost/geometry/geometry.hpp>
#include <boost/geometry/algorithms/overlaps.hpp>
#include <boost/geometry/geometries/g... | TOOL | 0.914237 | 6.475918 |
74363c6c-abcb-420e-913a-503c2ea95691 | avramdj/MATF | KIAA/2_cas/max_xor.cpp | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
struct Node
{
// Flag koji govori da li je cvor list
bool is_leaf;
// Nema potrebe ni za kakvim mapama, znamo da su brojevi binarni, tako da sigurno imamo najvise 2 potomka
Node *nodes[2];
};
Node *create_node()
{
// Ovde moze alokacij... | ALGO | 0.999987 | 5.174274 |
62bfaf73-e09f-4a1d-8581-bdecc466cbbb | nerfx/advm | matrix/source/matrix_linear.cpp | #include<iostream>
#include<ctime>
#include "matrix.h"
namespace advm {
matrix::matrix(int rows, int cols, double default_value) : default_rows(1), default_cols(1) {
srand(static_cast<unsigned int>(time(NULL)));
if (rows < default_rows || cols < default_cols) {
this->rows = default_rows;
this->cols = def... | TOOL | 0.995262 | 4.318992 |
6df88d21-c7cf-4a1c-9597-a3bdac3ea766 | cou929/topcoder | BridgeCrossing.cpp | // BEGIN CUT HERE
// END CUT HERE
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
using namespace std;
class BridgeCr... | ALGO | 0.999898 | 5.009696 |
76c6ce98-cd22-4ad8-b47d-a3c1d001c7e5 | DiveshChauhan123/cpquestions | distinctbuttons.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int u=0,r=0,v=0,w=0;
for(int i=0;i<n;i++){
int x,y;
cin>>x>>y;
if(x>0)u=1;
if(x<0)v=1;
if(y>0)r=1;
if(y<0... | ALGO | 0.999779 | 4.242573 |
1aba1c37-0eed-4666-98a8-09665d82fba2 | Abrahamk12/Universidad | T4,suma de cuadrados,URIEL_ABRAHAM_LOPEZ_FLEISCHER_1081.cpp | #include <iostream>
#include <cstdlib>
#include <conio.h>
#include <stdio.h>
#include <math.h>
/*
URIEL ABRAHAM LOPEZ FLEISCHER
1081 MECATRONICA
Introduccin a la programacin, Jos Roberto Moreno Ruiz
*/
using namespace std;
int elv(int);
void pausa();
int main()
{
bool bandera=false;
int tecla, a, b, x;
tecla= 1, ... | ALGO | 0.875536 | 3.24813 |
9028cdf6-4a4b-4715-823e-665677c1e695 | SergiuIonescu98/fractals_parallel | windows_fractals/juliaParam/noSDL/julia.cpp | #include <cmath>
#include <string>
#include <vector>
#include <iostream>
using namespace std;
static int wArg = 400;
static int hArg = 300;
static int maxIterArg = 300;
static void getargs(int argc, char *argv[]); /* gets command-line args */
static void getargs(int argc, char *argv[])
{
if (ar... | ALGO | 0.999499 | 4.987531 |
2a953011-d2d2-4eda-b589-6046f47973c0 | sarvex/leetcode-javascript | solution/1100-1199/1119.Remove Vowels from a String/Solution.cpp | class Solution {
public:
string removeVowels(string s) {
string ans;
for (char& c : s) {
if (!(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')) {
ans += c;
}
}
return ans;
}
}; | ALGO | 0.999091 | 6.193916 |
c3789ce3-c7ed-4b2d-a5e6-3823aca39d09 | Sandeep-Raj-CSE/Leetcode-practice | 459-repeated-substring-pattern/repeated-substring-pattern.cpp | class Solution {
public:
bool repeatedSubstringPattern(string s) {
string temp=s;
for(int i=0; i<s.size()-1;i++){
char ch=temp[0];
temp.erase(0,1);
temp.push_back(ch);
if(temp==s){
return true;
}
}
retu... | ALGO | 0.999886 | 5.565477 |
14d19050-7429-4f66-9cf4-1ae1a0793048 | 0fajarpurnama0/Programming-Practice | cuda/C++/matrix-addition.cpp | #include <iostream>
#include <math.h>
#include <ctime>
// function to add the elements of two arrays
void add(int n, float *x, float *y)
{
for (int i = 0; i < n; i++)
y[i] = x[i] + y[i];
}
int main(void)
{
int N = 1<<20; // 1M elements
float *x = new float[N];
float *y = new float[N];
// initialize ... | ALGO | 0.993873 | 4.848536 |
463172bf-d50d-4fcb-8f94-a36746fa86ee | enlighten5/symfit-kernel | subprojects/symcc-rt/src/backends/qsym/qsym/third_party/z3/src/ast/rewriter/rewriter.cpp | #include "ast/rewriter/rewriter_def.h"
#include "ast/ast_ll_pp.h"
#include "ast/ast_smt2_pp.h"
void rewriter_core::init_cache_stack() {
SASSERT(m_cache_stack.empty());
m_cache = alloc(cache, m());
m_cache_stack.push_back(m_cache);
if (m_proof_gen) {
SASSERT(m_cache_pr_stack.empty());
m_... | ALGO | 0.994637 | 5.52443 |
07acf035-7a4d-4c2d-b219-6d1906c81cac | PhuocVinhLee/system_exam_quiz_programming | online_exam_system_backend/temp/7v5sty4a.cpp | #include<stdio.h>
int add(int x, int y)
{
return(x+y);
}
int main()
{
int a, b;
scanf("%d%d", &a, &b);
//function call add(a, b);
printf("%d",add(a, b));
return 0;
}
//function definition | ALGO | 0.994296 | 4.372581 |
15a688d3-2eeb-4f09-aaab-050b9a2e997a | Coen-Potgieter/LeetCode | easy/2591-distribute-money-to-max-children/src/main.cpp |
#include <iostream>
#include <vector>
void printVec(const std::vector<double>& inpVec) {
std::cout << "Printing Vector:" << std::endl;
size_t runningIdx = 0;
for (const double& elem : inpVec) {
std::cout << "Elem " << runningIdx << ": " << elem << std::endl;
runningIdx += 1;
}
}
class... | ALGO | 0.997654 | 5.139999 |
2b7729e0-41cd-4024-a486-9693a4ad4e2a | abhishekksingh02/CPP_WORKSPACE | udf.cpp | #include<iostream>
using namespace std;
void add();
int main()
{
add();
}
void add()
{
int a,b,c;
cout<<"Enter any two numbers\n";
cin>>a>>b;
c=a+b;
cout<<"Answer is:"<<c;
}
void subtraction()
{
int a,b,c;
cout<<"Enter any two numbers\n";
cin>>a>>b;
c=a-b;
cout<<"Answer is:... | ALGO | 0.953479 | 3.431718 |
83fc12ee-af01-4b1d-9c5b-10721c61848d | theascone/stochastic-subset-bvh | src/integrators/mlt.cpp | // integrators/mlt.cpp*
#include "integrators/mlt.h"
#include "integrators/bdpt.h"
#include "scene.h"
#include "film.h"
#include "sampler.h"
#include "integrator.h"
#include "camera.h"
#include "stats.h"
#include "filters/box.h"
#include "paramset.h"
#include "sampling.h"
#include "progressreporter.h"
namespace pbrt {... | ALGO | 0.997766 | 5.427974 |
38998b16-f916-4be1-b8e7-2013f605b2f0 | SuperCB/te_v1.13 | transformer_engine/pytorch/csrc/extensions/gemm.cpp | #include "common/util/cuda_runtime.h"
#include "extensions.h"
void te_gemm(at::Tensor A, at::Tensor A_scale_inverse, transformer_engine::DType A_type,
bool transa, at::Tensor B, at::Tensor B_scale_inverse,
transformer_engine::DType B_type, bool transb, at::Tensor D, at::Tensor D_scale,
... | ALGO | 0.959192 | 7.37753 |
b07ebb33-a1e3-483a-b891-388adaad41f7 | ChiyoYuki/xcpc | cf/2065/C_1_Skibidus_and_Fanum_Tax_easy_version.cpp | /**
* author: ChiyoYuki
**/
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define elif else if
typedef signed char i1;
typedef signed short int i2;
typedef signed int i4;
typedef signed long long int i8;
typedef unsigned char u1;
typedef unsigne... | ALGO | 0.999986 | 3.668114 |
b0a60b64-574a-484b-b094-5db5abdfc79e | SJMA11723/Problem-solving | codeforces/Codeforces Round 829 (Div. 2)/C2.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t; cin >> t;
while(t--){
int n; cin >> n;
int arr[n], sum = 0;
for(int i = 0; i < n; ++i){
cin >> arr[i];
sum += arr[i];
}
... | ALGO | 0.999209 | 3.678586 |
c5c03efb-bcc9-4014-b29d-731e71f2229b | ishandutta2007/codeforces | fanache99/normal/913/C.cpp | #include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <climits>
#include <bitset>
#include <cassert>
using namespace s... | ALGO | 0.999828 | 3.22798 |
14322542-6a87-4a64-8e50-a0354ba12ebc | vinayak0505/Data-Structures | Minimum Time Difference.cpp | #include "string"
#include "vector"
using namespace std;
class Solution {
int cal(string& a,string& b){
int ans = 0;
ans += (b[0] - a[0]) * 600;
ans += (b[1] - a[1]) * 60;
ans += (b[3] - a[3]) * 10;
ans += (b[4] - a[4]);
return min(ans,1440 - ans);
}
public:
... | ALGO | 0.999468 | 5.486342 |
563eb436-4efa-47b1-b284-34e59e6626ec | ayushgoyal04/Learning-Journey | Learning-DSA/CP/striver_playlist_checklist/Recursion/Recursion_Backtracking/function.cpp | #include<bits/stdc++.h>
using namespace std;
int A(int a1, int a2){
int sum = a1+a2;
}
int B(int b1, int b2){
int C(15);
}
int C(int c1, int c2){
}
int main(){
int ans = A(5, 10);
} | ALGO | 0.985494 | 3.13736 |
237dc153-0f46-4b62-9da7-acda962a29aa | withtahmid/cp | Codeforces/2024-05-30_[Div-2]_166_(EDU)/A.cpp | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define dbg(...)
#endif
#define all(v) v.begin(),v.end()
#define len(v) ((int) v.size())
#define has(v, x) ((v.find(x) != v.end()))
#define int int64_t
typedef long double ld;
typedef pair<int, int> pii;
void solve(const int& tc){
... | ALGO | 0.999949 | 5.016222 |
01c36f72-6963-4635-a233-537c557a91b1 | ishandutta2007/codeforces | gamegame/normal/652/D.cpp | #include<iostream>
#include<algorithm>
#include<stack>
using namespace std;
struct seg{
int org,sor,l,r;
};
bool cmp1(seg i,seg j){
return i.l>j.l;
};
bool cmp2(seg i,seg j){
return i.r<j.r;
};
int bit[200001],n;
int pre(int i){
int sum=0;
while(i>0){
sum+=bit[i];
i-=i&(-i);
}
return sum;
}
void update(int i... | ALGO | 0.999929 | 3.929816 |
80eebf19-edef-417d-b30d-fea34e34b8e9 | ivanbisimbrero/RGBFilters | SoftEdgeDetectionMain.cpp | #include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <cmath>
#include <chrono>
#include <algorithm>
using namespace std;
using namespace std::chrono;
#include "Image.h"
#include "SoftEdgeDetection.h" // Include your SoftEdgeDetection class
int main() {
vector<string> imageFiles =... | ALGO | 0.999126 | 6.510034 |
9dd4e577-9a22-43c1-a77f-107028c05ce2 | AlSh007/Leetcode-Problems | 2742-painting-the-walls/2742-painting-the-walls.cpp | class Solution {
public:
int dp[501][501] = {};
int solve(vector<int>& cost, vector<int>& time, int i, int wallReamining){
if(wallReamining <= 0) return 0;
if(i >= cost.size()) return 1000000000;
if(dp[i][wallReamining] != 0) return dp[i][wallReamining];
int notTake = solve(cost, time, i+1, wallRea... | ALGO | 0.999548 | 5.55518 |
6e2d9530-fe3f-4ff4-b75d-14ca4ff31643 | sarvex/leetcode-s | solution/0500-0599/0515.Find Largest Value in Each Tree Row/Solution.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), l... | ALGO | 0.999989 | 6.403322 |
b0a6899e-2722-496a-b6c9-60b335c556ed | Valer4ikoff/Queue | Queue/Queue.cpp | /*1, Дано рядок s, знайти в ньому перший
неповторюваний символ і повернути його індекс. Якщо його не існує, поверніть -1.*/
/*
#include <iostream>
#include <unordered_map>
int firstUniqChar(const std::string& s) {
std::unordered_map<char, int> charCount;
// Рахуємо кількість кожного символу в рядку
for... | ALGO | 0.981881 | 4.781401 |
2b13e409-2c01-425b-ac86-1539e6ba7e7b | lazy-chess-player/daily_problem | Problem_CodeForces/2024/11/07/Valid_Bitonic_Permutations.cpp | #include <bits/stdc++.h>
using namespace std;
#define ft first
#define sd second
#define yes cout << "yes\n"
#define no cout << "no\n"
#define Yes cout << "Yes\n"
#define No cout << "No\n"
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),... | ALGO | 0.999912 | 4.10189 |
71e8a0b6-0487-4577-a3f3-37c5adf25c07 | RomanArzumanyan/VALI | src/TC/src/TaskDecodeFrame.cpp | #include "CodecsSupport.hpp"
#include "CudaUtils.hpp"
#include "Tasks.hpp"
#include "Utils.hpp"
#include <algorithm>
#include <array>
#include <atomic>
#include <condition_variable>
#include <iostream>
#include <memory>
#include <mutex>
#include <optional>
#include <queue>
#include <sstream>
#include <stdexcept>
#incl... | TOOL | 0.917034 | 7.376833 |
017993b8-74e2-438a-a62f-0187f0f4be15 | thestarharsh/Cpp-Masterclass | THE CHAPTER 10 GETTING THINGS OUT OF FUNCTIONS/10.5ReturningArrayElementIndexByPointer/main.cpp | #include <iostream>
const double* find_max_address(const double scores[], size_t count);
int main(){
double array[] {1.0,2.0,3.0,45.0,5.0,6.0,7.0,8.0,79.0,10.0};
const double* p_max = find_max_address(array,std::size(array));
std::cout << "max : " << *p_max << std::endl;
return 0;
}
const double*... | ALGO | 0.997005 | 5.003259 |
9fc9b646-611c-4b0a-aaf5-c2fafca8e46a | pratyushpanda91/Leetcode_DCC | 2025/May/1.2071. Maximum Number of Tasks You Can Assign.cpp | class Solution {
public:
int maxTaskAssign(vector<int>& tasks, vector<int>& workers, int pills, int strength) {
int left = 0, right = min(tasks.size(), workers.size());
sort(tasks.begin(), tasks.end());
sort(workers.begin(), workers.end());
while(left < right) {
int mid... | ALGO | 0.999972 | 5.596644 |
1f3bdbe3-3430-4112-b6d9-96b071c2f4c0 | FDA12345/smart_home | sdk/boost_1_73_0/libs/spirit/example/x3/roman.cpp | ///////////////////////////////////////////////////////////////////////////////
//
// A Roman Numerals Parser (demonstrating the symbol table). This is
// discussed in the "Symbols" chapter in the Spirit User's Guide.
//
// [ JDG August 22, 2002 ] spirit1
// [ JDG March 13, 2007 ] spirit2
// [ JDG May 13, 2015 ] ... | TOOL | 0.955495 | 7.699979 |
92a8e53f-3200-4127-b6af-3f72b4909e10 | JanathonL/LeetCode | solutions/387. First Unique Character in a String.cpp | // 387. First Unique Character in a String
// 先用unordered_map存一下每个字符出现的次数，然后顺序遍历一下找到第一个只出现一次的字符就返回，否则就是返回-1
class Solution {
public:
int firstUniqChar(string s) {
unordered_map<char,int> m;
for(int i=0;i<s.size();i++){
m[s[i]]++;
}
for(int i=0;i<s.size();i++){
... | ALGO | 0.999343 | 5.495252 |
d3fb0b4b-d204-448d-8440-e83529682709 | shakarb/Milestone2 | StringReserver.cpp | //
// Created by shaked on 14/01/2020.
//
#include "StringReserver.h"
string StringReserver::solve(string problem) {
reverse(problem.begin(), problem.end());
return problem;
} | ALGO | 0.998953 | 4.813789 |
6eea0056-dc9d-4589-8938-c45c4be02c7d | Anandadas123/C-C- | C/datastructure/ananda/queue.cpp | #include<stdio.h>
#include<conio.h>
#define SIZE 4
void insert();
void delet();
void traverse();
int queue[SIZE],front=0,rear=0;
int main()
{
int choice;
while(1)
{
printf("\n 1.insert");
printf("\n 2.delet");
printf("\n 3.TRAVERS");
printf("\n 4.EXIT");
printf("\nENTER YOUR CHOICE");
scanf("%d",&choice... | ALGO | 0.998403 | 3.393368 |
c8bb2d3b-eaf7-4b85-ae2b-85626ce0e72f | shinpei0208/gdev | cuda/runtime/ocelot/transforms/implementation/MoveEliminationPass.cpp | /*! \file MoveEliminationPass.cpp
\author Gregory Diamos <<EMAIL>>
\date Wednesday January 23, 2013
\brief The source file for the MoveEliminationPass class.
*/
// Ocelot Includes
#include <ocelot/transforms/interface/MoveEliminationPass.h>
#include <ocelot/analysis/interface/DataflowGraph.h>
#include <ocelo... | ALGO | 0.894006 | 7.566947 |
6cc4060d-8525-4d20-b051-91f2407f9cd1 | jsjerald/Data-Structures-and-Algorithms | 02. Algorithms/01. Arrays/25. Array Partition 1/array-partition-i.cpp | class Solution {
public:
int arrayPairSum(vector<int>& nums) {
int n = nums.size();
sort(nums.begin(),nums.end());
int total=0;
for(int i=0;i<n;i++)
{
if(i%2==0)
{
total += min(nums[i],nums[i+1]);
}
}
return... | ALGO | 0.999736 | 5.910535 |
846dad34-1f01-424b-892e-4be591ae3b34 | ishandutta2007/codeforces | wygzgyw/normal/1739/E.cpp | // wygzgyw
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
template <typename T> void write(T t) {
if (t<0) { put... | ALGO | 0.999941 | 3.714253 |
86ab7641-7a53-4b5d-bb2c-a7aad418ad40 | rudalsd/Algorithm-Study | 백준/그래프/02310. 어드벤처 게임.cpp | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
int n;
char room[1001];
int charge[1001];
vector<int> list[1001];
int visited[1001][501];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
list[0].push_back(1);
while (1) {
cin >> n;
if (n == 0) return 0;... | ALGO | 0.999897 | 3.619326 |
1f9a615f-94d6-4ab6-afe2-a9bb42322107 | Larsos099/qtpwm | CryptoPP/sm4.cpp | // sm4.cpp - written and placed in the public domain by Jeffrey Walton and Han Lulu
//
// We understand future ARMv8 enhancements are supposed
// to include SM3 and SM4 related instructions so the function
// is stubbed for an eventual SM4_Round_ARMV8.
#include "pch.h"
#include "config.h"
#include "sm4.h"
#i... | ALGO | 0.997855 | 7.574261 |
3a72c322-caa8-48cc-b5e4-b3e5db20cccf | arungeorgesaji/aoc | 2024/day1/part2/main.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ifstream f("input.txt");
unordered_multiset<int> nums1;
unordered_multiset<int> nums2;
if (!f.is_open()) {
cerr << "Error opening the file!";
return 1;
}
string s;
while (getline(f, s)){
istringstream iss... | ALGO | 0.99975 | 4.27977 |
13a4a8e6-9210-47ae-86c5-d1e6be1b7c28 | DavideSirico/programmazione-1 | 240923/6.cpp | #include <iostream>
using namespace std;
/*
Utilizzando solo variabili di tipo “int”, dati in input un
dividendo, un divisore e il numero di cifre decimali
desiderate per la precisione (con troncamento), realizzare
un programma che calcola il risultato della divisione tra
dividendo e divisore con la precisione scelta.... | ALGO | 0.983955 | 3.79108 |
3a987f60-7d39-418d-8979-2cfac2c0e53b | RishabhSkr/GFG_problems | Easy/Isomorphic Strings/isomorphic-strings.cpp | //{ Driver Code Starts
// C++ program to check if two strings are isomorphic
#include<bits/stdc++.h>
using namespace std;
#define MAX_CHARS 256
// } Driver Code Ends
class Solution
{
public:
//Function to check if two strings are isomorphic.
bool areIsomorphic(string str1, string str2)
{
int ... | ALGO | 0.999886 | 5.752262 |
576506d9-1955-41e9-9da9-09b3400bccfd | GMAP/SPBench | benchmarks/ferret/openmp/ferret_omp_pipe-farm/ferret_omp_pipe-farm.cpp | /*
Author: Renato Hoffmann
Email: <<EMAIL>>
December 2022
Although validated, there are no guarantees that this code will work.
In case of questions, please contact via email.
*/
#include <ferret.hpp>
#include "SPar_Shared_Queue.hpp"
#include <omp.h>
#ifdef ONDEMAND
#define QUEUESIZE 1
#else
#define QUEUESI... | DATA | 0.95844 | 3.361034 |
50b40ba8-69b4-469a-8e54-097ffca31b7a | kriishukla/CP_Solution | Atcoder/C++ 20 (gcc 12.2)/abc365_e/56290909.cpp | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define endl '\n'
using pii=pair<lli,lli>;
#define MP make_pair
#define F first
#define ld long double
#define S second
#define all(o) o.begin(),o.end()
lli M=998244353;
using mll = map<lli,lli>;
using vi = vector<lli>;
using vvi = vector<vector<l... | ALGO | 0.999922 | 3.91347 |
0e34088d-586d-470d-9a3b-2df2296311b1 | ishandutta2007/codeforces | swistakk/normal/605/A.cpp | #include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)... | ALGO | 0.999599 | 3.496675 |
d47a65f6-0714-40ae-895f-f5fc96a536d0 | drmeister/legacy-externals-clasp | boost/libs/spirit/example/qi/compiler_tutorial/calc5.cpp | ///////////////////////////////////////////////////////////////////////////////
//
// Same as Calc4, this time, we'll incorporate debugging support,
// plus error handling and reporting.
//
// [ JDG April 28, 2008 ] For BoostCon 2008
// [ JDG February 18, 2011 ] Pure attributes. No semantic actions.
//
/////... | TOOL | 0.944773 | 7.892432 |
d147c897-00d7-4304-832a-480b35ae1f38 | anubane/llvm-project-try | llvm/lib/CodeGen/CodeGenCommonISel.cpp | #include "llvm/CodeGen/CodeGenCommonISel.h"
#include "llvm/Analysis/BranchProbabilityInfo.h"
#include "llvm/CodeGen/MachineBasicBlock.h"
#include "llvm/CodeGen/MachineFunction.h"
#include "llvm/CodeGen/TargetInstrInfo.h"
#include "llvm/CodeGen/TargetOpcodes.h"
#include "llvm/IR/DebugInfoMetadata.h"
#define DEBUG_TYPE ... | ALGO | 0.889462 | 7.986229 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.