uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
70116cd1-3954-4312-830b-cd04e8df4a34 | Rajsoni03/Competitive-Programming-Training | 07_sorting/J.cpp | #include <iostream>
using namespace std;
int main(){
int n = 5;
// static int arr[5];
int arr[n] = {1, 2}; // 5, 2
for (int i = 0; i < n; i++){
cout << arr[i] << ' ';
}
return 0;
} | ALGO | 0.994964 | 3.55969 |
085edb41-0417-4d70-8a0f-c4021b018951 | vpekunov/Planning_C_Translator | Examples/MPI2REENT.dir/mpi_alltoall.cpp | // 04 processors
#include <stdio.h>
#include <stdlib.h>
#include "mpi.h"
/*
! This program shows how to use MPI_Alltoall. Each processor
! send/rec a different random number to/from other processors.
*/
/* globals */
int numnodes,myid,mpi_err;
#define mpi_root 0
/* end module */
void init_it(int *argc, char **... | ALGO | 0.991946 | 4.56218 |
abe36505-1b7d-4062-9d75-5a21f509f644 | 4969949901/Investigacion-y-practica-de-arreglos-o-array | main.cpp | #include <iostream>
#include<stdlib.h>
#include <conio.h>
#include "archivos.h"
using namespace std;
int main() {
cout << "-----Practica aplicando Arrays----- " <<endl;
int opc,op;
while(opc!=6){
cout<<"Seleccione una opcion para ejecutar el ejercicio que elija:\n1.Escribir un programa que calcule la... | TOOL | 0.893266 | 3.644271 |
1a0f01c7-fa9e-4735-a454-1abed99872e9 | wuvei/algorithm | Algorithm/cpp/0899.OrderlyQueue/orderlyQueue.cpp | class Solution {
public:
string orderlyQueue(string s, int _k) {
if (_k == 1) {
int i = 0, j = 1, k = 0, n = s.size();
while (i < n && j < n && k < n) {
char a = s[(i + k) % n], b = s[(j + k) % n];
if (a == b) k++;
else {
... | ALGO | 0.999997 | 5.961681 |
0b2857a9-d099-4b50-9944-b01a3b36d8ec | sahir7/Data_Structures | Queue_by_linked_list.cpp | #include<iostream>
using namespace std;
int count=0;
class node{
public:
int data;
node * next;
node(int d){
data=d;
next=NULL;
}
};
class Queue{
node * front;
node *back;
public:
Queue(){
front=NULL;
back=NULL;
}
bool Isempty();
void push (int val);
void pop();
void top();
};... | ALGO | 0.98497 | 3.2793 |
e83e24a6-fab5-4719-b31a-1cf4f602461c | sinian666/codes_102_3 | 1cpp_副本5/chapter_graph/graph_adjacency_matrix.cpp | /**
* File: graph_adjacency_matrix.cpp
* Created Time: 2023-02-09
* Author: what-is-me (<EMAIL>)
*/
#include "../utils/common.hpp"
/* 基于邻接矩阵实现的无向图类 */
class GraphAdjMat {
vector<int> vertices; // 顶点列表，元素代表“顶点值”，索引代表“顶点索引”
vector<vector<int>> adjMat; // 邻接矩阵，行列索引对应“顶点索引”
public:
/* 构造方法 */
... | ALGO | 0.999473 | 6.276136 |
9b796105-c7f3-4fca-b5ef-c75595524bea | ishandutta2007/codeforces | dmga44/normal/1324/A.cpp | #include <bits/stdc++.h>
#define db(x) cout << (x) << '\n';
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pii;
typedef pair<double,ll> pdi;
typedef pair<string,ll> psi;
typedef pair<ll,string> pls;
type... | ALGO | 0.99974 | 4.483223 |
8cc6d3f1-911d-4c39-a184-a6176eb7efbe | adnandado/arcade_os | 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 |
7c61dd94-d1f7-4f9a-8d3b-116f54377ab6 | sinian666/code_102_8 | cpp_副本9/chapter_sorting/bubble_sort.cpp | /**
* File: bubble_sort.cpp
* Created Time: 2022-11-25
* Author: Krahets (<EMAIL>)
*/
#include "../utils/common.hpp"
/* 冒泡排序 */
void bubbleSort(vector<int> &nums) {
// 外循环：待排序元素数量为 n-1, n-2, ..., 1
for (int i = nums.size() - 1; i > 0; i--) {
// 内循环：冒泡操作
for (int j = 0; j < i; j++) {
... | ALGO | 0.99994 | 6.035518 |
3018346c-4a76-42cc-abc1-e4cbe4b7927e | fanliqmul/gromacs_AFM_FH-MD | src/gromacs/selection/sm_position.cpp | /*! \internal \file
* \brief
* Implements position evaluation selection methods.
*
* \author Teemu Murtola <<EMAIL>>
* \ingroup module_selection
*/
#include "gmxpre.h"
#include "gromacs/selection/indexutil.h"
#include "gromacs/selection/position.h"
#include "gromacs/utility/arraysize.h"
#include "gromacs/utility... | ALGO | 0.995682 | 5.698596 |
f7b35027-884c-4949-b127-9316748937b1 | Vibhu-Godson/Master-Prep | cses/1622.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
// Code By VibhuGodson
vector<string>ans;
void solve(string &s, string c, vector<bool>&used){
if(s.size()==c.size()){
ans.push_back(c);
return;
}
for(int i=0;i<s.size();i++){
if(used[i] or (i>0 and s[i]==s[i-1] and use... | ALGO | 0.999933 | 5.078352 |
a41874ea-acd8-474c-976d-f6dc32e9dbda | LordOlumide/reliability_estimator | 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 |
3f77a0ed-5a7b-4dec-a74e-6c24dc3ca6aa | ArumilliLikitha/Leetcode | 128-longest-consecutive-sequence/longest-consecutive-sequence.cpp | class Solution {
public:
int longestConsecutive(vector<int>& nums) {
unordered_set<int>st;
if(nums.size()==0) return 0;
int longest=1;
for(int i=0;i<nums.size();i++)
{
st.insert(nums[i]);
}
int x,cnt;
for(auto it:st)
{
i... | ALGO | 0.999961 | 5.661027 |
45564f94-e839-4cbe-81e8-21d5da35c6b2 | wizleysw/backjoon | 15989/solve.cpp | // https://www.acmicpc.net/problem/15989
// 1, 2, 3 더하기 4
// Written in C++ langs
// 2020. 10. 32.
// Wizley
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
int N;
int DP[10001][4];
int main(){
ios_base :: sync_with_stdio(false);
cin.tie(NU... | ALGO | 0.99999 | 4.447393 |
36cf3142-7225-4c26-bfac-85f1bebddd9d | ajbutt1/cyro-stealer | src/scrypt.cpp | #include <stdlib.h>
#include <stdint.h>
#include "scrypt.h"
#include "pbkdf2.h"
#include "util.h"
#include "net.h"
#define SCRYPT_BUFFER_SIZE (131072 + 63)
#if defined (OPTIMIZED_SALSA) && ( defined (__x86_64__) || defined (__i386__) || defined(__arm__) )
extern "C" void scrypt_core(unsigned int *X, unsigned int *V... | ALGO | 0.989365 | 5.510696 |
29211ea8-3a65-449e-a8f4-72b6734384a7 | nverno/aoc | 2022/day7-2.cpp | // -*- compile-command: "make d7" -*-
#include <bits/stdc++.h>
#include "../lib/aoc.hpp"
using namespace std;
const int SZ = 70000000;
const int NEED = 30000000;
struct dir {
int sz;
string name;
dir *par;
vector<dir*> sub;
dir(dir* p = nullptr, string nm = ""): sz(0), name(nm), par(p) {}
} root;
... | ALGO | 0.98165 | 4.572463 |
2b709864-c677-4130-a6ed-0c7976e77b87 | Aryaman2912/DSA | Binary_Trees/delete_node_in_BST.cpp | // This program contains code to delete a node in a BST
#include<bits/stdc++.h>
using namespace std;
struct BstNode{
int data;
BstNode* left;
BstNode* right;
};
// Function to create a new node
BstNode* GetNewNode(int value){
BstNode* node = new BstNode();
node->data = value;
node->left = node->right = NULL;
... | ALGO | 0.999965 | 6.454649 |
3b4a8053-2ec4-4cc4-9016-aaba1f160194 | yqliving/Practice | 122-Best-Time-to-Buy-and-Sell-Stock-II/solution.cpp | class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size()==0) return 0;
int profit = 0;
for (int i = 0; i < prices.size()-1; i++) {
int diff = prices[i + 1] - prices[i];
if (diff > 0) profit += diff;
}
return profit;
}
}; | ALGO | 0.999917 | 5.994347 |
8b693b9b-0b37-4c81-b24c-d439c6e0e221 | XuanQuang1301/TRR2 | TRR2021.cpp | #include <bits/stdc++.h>
using namespace std;
int n;
vector<vector<int>> adj;
vector<bool> check;
void DFS(int u){
check[u] = true;
for(int i : adj[u]){
if(!check[i]){
DFS(i);
}
}
}
int main(){
ifstream inp("TK.INP");
ofstream out("TK.OUT");
inp >> n;
adj.clear()... | ALGO | 0.999819 | 3.350947 |
d53d4ead-0e58-4a5a-bac8-ac8ba0df0c24 | devcyjung/Exercism | solutions/cpp/rotational-cipher/1/rotational_cipher.cpp | #include "rotational_cipher.h"
#include <cctype>
namespace rotational_cipher {
std::string rotate(const std::string& input, int n) {
std::string result{};
for (auto&& ch: input) {
if (std::isupper(ch)) {
result.push_back(std::isupper(ch + n) ? ch + n : ch + n - 'Z' - 1 ... | ALGO | 0.999442 | 7.397091 |
158eaaf4-4527-4285-a7cf-0f00e29df7f8 | mohitmallick17/LeetCodeSolutions | 1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target.cpp | class Solution {
public:
int maxNonOverlapping(vector<int>& nums, int target) {
unordered_map<int,int> mp;
int s=0;
mp[0]=-1;
int ans=0;
int prev=-2;
for(int i=0;i<nums.size();i++){
s += nums[i];
// cout << s << " : ";
if(m... | ALGO | 0.999989 | 6.005963 |
455df751-1030-4fde-9778-053ba95e640c | Tejesh-Vempuluru/DSA | arrays/Reversepairs.cpp | #include<bits/stdc++.h>
using namespace std;
class Solution {
public:
int cntPairs(vector<int>& nums, int low, int mid, int high) {
int right = mid + 1;
int cnt = 0;
for (int i = low; i <= mid; i++) {
while (right <= high && nums[i] > 2LL * nums[right])
... | ALGO | 0.999922 | 5.321446 |
345a0ac1-ff82-47f1-941f-5809ab77bf8e | jdibenes/cormorant | sound/gb_sweep_unit.cpp | //-------------------------------------------------------------------------------------------------
// Project Cormorant - GB / CGB Emulator
// jcds (<EMAIL>)
// 2011
//-------------------------------------------------------------------------------------------------
#include "gb_sweep_unit.h"
gb_SweepUnit::gb_SweepUn... | TOOL | 0.973198 | 6.162559 |
94681a23-5f86-41c2-b457-46af85a30a11 | zhxiongfei/leetcode-Cpp | LeetCode_Cpp/leetcode_cpp/树/剑指Offer33_二叉搜索树的后序遍历序列.cpp | #include <stdio.h>
#include "vector"
using namespace std;
class Solution {
public:
bool verifyPostorder(vector<int>& postorder) {
return verifyHelper(postorder, 0, (int)postorder.size() - 1);
}
bool verifyHelper(vector<int> & postorder, int start, int end){
if (start >= end) return tru... | ALGO | 0.999934 | 5.582013 |
553924f7-11b7-40f8-a1a8-0be345f8de08 | chabuuuu/UIT_CTDL-GT | sort/selectionsort.cpp | #include <iostream>
#include <vector>
using namespace std;
void swap (vector<int>& arr, int i, int max){
int temp = arr[i];
arr[i] = arr[max];
arr[max] = temp;
}
void selectionSort(vector<int>& arr) {
int i = 0;
int n = arr.size();
int max;
while ( i < n - 1){
max = i;
int j = i + 1;
while (... | ALGO | 0.999807 | 4.180946 |
bfabbc23-5fd3-4267-b881-7e405d245ee4 | kakarla2/my-work | 111111.cpp | #include<stdio.h>
main()
{ float a,b,c;
scanf("%f%f%f",&a,&b,&c);
if(b*b-4*a*c>0)
{
printf("roots are real");
} else if(b*b-4*a*c==0)
{ printf("roots are equal");
} else {
printf ("roots are imaginary");
} }
| ALGO | 0.999897 | 3.699675 |
2e038b9c-89f2-4d70-a48a-2ccfbf9ede8c | Shubham-kr-sinha/DSA-codes-in-cpp | Priority Queues/heapify_algo.cpp | //converting given array to heap
#include<iostream>
#include<climits>
using namespace std;
void print(int arr[], int n){
for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}
cout<<endl;
}
void heapify(int i, int arr[], int n){
while(true){
int left = 2*i, right = 2*i+1;
if(left>=n) brea... | ALGO | 0.999875 | 4.190846 |
c326b577-dac6-4e12-b8e3-c5e4aa88853b | madhu915/DSA-Codes | code-sync/problems/range_sum_of_bst/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.999992 | 6.799486 |
8271824c-37ca-43bf-b768-dd39722a8600 | cubox-i/android_frameworks_av | media/libstagefright/codecs/mp3dec/src/pvmp3_mpeg2_stereo_proc.cpp | /*
------------------------------------------------------------------------------
PacketVideo Corp.
MP3 Decoder Library
Filename: pvmp3_mpeg2_stereo_proc.cpp
Functions:
pvmp3_st_intensity_ver2
pvmp3_mpeg2_stereo_proc
Date: 09/21/2007
-----------------------------------------------------... | ALGO | 0.996027 | 5.952 |
4b3bf2a8-b624-4c72-bbe1-c885c6660e66 | bert314/autolabor | src/navigation/global_planner/src/astar.cpp | #include<global_planner/astar.h>
#include<costmap_2d/cost_values.h>
namespace global_planner {
AStarExpansion::AStarExpansion(PotentialCalculator* p_calc, int xs, int ys) :
Expander(p_calc, xs, ys) {
}
bool AStarExpansion::calculatePotentials(unsigned char* costs, double start_x, double start_y, double end_x... | ALGO | 0.999591 | 6.404588 |
fb6b648d-2d23-440a-a207-df7c73399549 | MR-MaoJiu/getx_template | 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 |
edbdc662-7d1e-425a-aff8-7d99066b5977 | RenanMagalhaesLage/Desafios-De-Programacao | Problema Treasure Hunt/problem2.cpp | /*−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
* UNIFAL − Universidade Federal de Alfenas.
* BACHARELADO EM CIENCIA DA COMPUTACAO.
* Trabalho..: Competição
* Disciplina: Desafios da Programação
* Professor.: Luiz Eduardo da Silva
* Aluno.....: Renan Magalhães Lage
* Data....... | ALGO | 0.999987 | 3.750495 |
4acd48c0-7421-490f-a58e-299a85a64199 | CdTCzech/Qt5 | qtwebengine/src/3rdparty/chromium/third_party/skia/src/pathops/SkPathOpsLine.cpp | #include "src/pathops/SkPathOpsLine.h"
SkDPoint SkDLine::ptAtT(double t) const {
if (0 == t) {
return fPts[0];
}
if (1 == t) {
return fPts[1];
}
double one_t = 1 - t;
SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY };
return resul... | ALGO | 0.997502 | 5.817588 |
75d12ab9-5c20-4e9f-8a54-fc75088e617e | wcsanders1/LeetCode | ShortestDistanceAfterRoadAdditionQueriesI/CPP/ShortestDistanceAfterRoadAdditionQueriesI.cpp | // https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i/description/?envType=daily-question&envId=2024-11-27
#include <vector>
#include <unordered_set>
#include <queue>
#include <stack>
#include <unordered_map>
using namespace std;
class Solution
{
public:
vector<int> shortestDistanceAfterQ... | ALGO | 0.999745 | 6.278813 |
65e3cebb-8e73-48bb-b270-7e3ec0299fac | MouryaPeddineni/Leetcode | 1013-fibonacci-number/fibonacci-number.cpp | class Solution {
public:
int fib(int n) {
if(n==1 || n==0){
return n;
}
else{
return fib(n-1)+fib(n-2);
}
}
}; | ALGO | 0.999975 | 5.737184 |
de0c9193-5ef9-4f86-a876-cd2b56aa0ef7 | gauri18035/Hacktoberfest | Q3.cpp | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#... | ALGO | 0.999943 | 4.276997 |
b996c308-1a6e-4e63-9b1b-44fbea5af9ef | AnshulChaturvedi/Anshul-Codes | 0739-daily-temperatures/0739-daily-temperatures.cpp | class Solution {
public:
vector<int> dailyTemperatures(vector<int>& temp) {
int n = temp.size();
stack<int> st;
vector<int> ans(n),ngtemp(n);
for(int i=n-1;i>=0;i--){
while(!st.empty() && temp[st.top()]<=temp[i]){
st.pop();
}
ngtemp... | ALGO | 0.999898 | 6.297768 |
639c5b08-172c-48c7-bdfc-c85cb9b903de | Kshitij-789/CompetitiveProgramming | Olympiad/Baltic/Baltic 12-Melody.cpp | /*
let dp[i][j] denote minimum mistakes in sequence till index i if ith index is j
naive is L*N*N which gets only 65 points
optimize using bitsets and basic sqrt decomposition
*/
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b secon... | ALGO | 0.999939 | 3.180089 |
f9e37efc-b007-4dfa-b292-2fde4081b622 | ClassicBitcoins/cbitcoin | src/policy/fees.cpp | #include "policy/fees.h"
#include "amount.h"
#include "primitives/transaction.h"
#include "streams.h"
#include "txmempool.h"
#include "util.h"
void TxConfirmStats::Initialize(std::vector<double>& defaultBuckets,
unsigned int maxConfirms, double _decay, std::string _dataTypeString)
{
... | ALGO | 0.941918 | 5.875101 |
dc6a36bd-ff83-4f00-b924-44de0acc7be1 | GouravKumarPandit/Cpp-Practice-Question | Template11.cpp | #include<iostream>
using namespace std;
template <class t1,class t2>
void BigOrNot(t1 X,t2 Y){
if(X>Y)
cout<<X<<" is bigger number."<<endl;
else
cout<<Y<<" is bigger number."<<endl;
}
template <class t>
void BigOrNot(t X,t Y,t Z){ //Using ternary operator
t A;
A=(X>Y)?((X>Z)?X:Z):(... | ALGO | 0.993798 | 3.50627 |
2feb56ef-c038-4381-b69c-7659e6006873 | raincross7/code-similarity | codes/train_code/problem259/problem259_66.cpp | #include<iostream>
using namespace std;
int main ()
{
int n ;
cin>>n ;
if (n<1200 ) {
cout << "ABC"<<endl ;
}
else if ( n<2800) cout << "ARC "<<endl ;
else cout << "AGC" <<endl ;
return 0 ;
} | ALGO | 0.998871 | 3.007411 |
c6b6baf5-8bad-42c0-9c57-736e1abd00ac | MarcosViniciusG/Competitive-Programming | Problems/CF/984D/main.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
signed main() {
cin.tie(nullptr)->ios_base::sync_with_stdio(false);
int t, n, m;
cin >> t;
while(t--) {
cin >> n >> m;
cin.ignore(1, '\n');
... | ALGO | 0.999584 | 5.587812 |
e9725952-de51-4ae0-ac2b-cb63fa350d55 | nimit1jain/DSA-Questions | graphs/flood_fill.cpp | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
void solve(vector<vector<int>> &arr, int i, int j, int colour, int prev)
{
if (i >= 3 || i < 0 || j >= 3 || j < 0)
return;
else if (arr[i][j] != prev)
return;
arr[i][j] = colour;
solve(arr, i + 1, j, colour, prev);
so... | ALGO | 0.999905 | 4.244696 |
1ab71f33-fa43-48f8-add4-d694fd2db2ec | mickifricki/Blue-Engine | Bullet/src/BulletCollision/Gimpact/gim_box_set.cpp | #include "gim_box_set.h"
GUINT GIM_BOX_TREE::_calc_splitting_axis(
gim_array<GIM_AABB_DATA> & primitive_boxes, GUINT startIndex, GUINT endIndex)
{
GUINT i;
btVector3 means(btScalar(0.),btScalar(0.),btScalar(0.));
btVector3 variance(btScalar(0.),btScalar(0.),btScalar(0.));
GUINT numIndices = endIndex-startIndex;... | ALGO | 0.999936 | 6.159838 |
75bd58c5-092e-4a2c-b5b0-8494a91501e8 | Sudheer-18/leetcode | 200-number-of-islands/number-of-islands.cpp | class Solution {
public:
void helper(vector<vector<char>>& grid, int n, int m, vector<vector<bool>>& vis, int i, int j) {
if(i < 0 || j < 0 || i >= n || j >= m || grid[i][j] == '0' || vis[i][j]) return;
vis[i][j] = true;
helper(grid, n, m, vis, i+1, j);
helper(grid, n, m, vis, i-1, j... | ALGO | 0.999989 | 6.982529 |
6760b419-e734-403c-bce6-1a7ce39e7a05 | yutachaan/kyoupuro | atcoder/abc/251-300/284/e.cpp | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// <----- alias ----->
using ll = long long;
const int inf = numeric_limits<int>::max() / 2;
const ll infl = numeric_limits<ll>::max() / 2;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vs = vector<string>;
us... | ALGO | 0.999901 | 5.362878 |
033883d0-77f7-4b1a-b978-5065b11c1279 | xiaoyu2018/Leetcode-practice | cpp/0017电话号码的字母组合.cpp | #include<vector>
#include<iostream>
#include<vector>
using namespace std;
const string d2lmap[10] = {
"",
"",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
vector<string> res;
string temp = "";
//建立回溯树，明确深度和广度，深度用递归遍历，广度用循环遍历
void backTracking(int s, vector<int... | ALGO | 0.999837 | 5.670815 |
9eb45cbf-78ca-46f0-9c70-3534120e823c | numbqq/opencv | modules/core/src/matrix_c.cpp | #include "opencv2/core/mat.hpp"
#include "opencv2/core/types_c.h"
#include "precomp.hpp"
// glue
CvMatND cvMatND(const cv::Mat& m)
{
CvMatND self;
cvInitMatNDHeader(&self, m.dims, m.size, m.type(), m.data );
int i, d = m.dims;
for( i = 0; i < d; i++ )
self.dim[i].step = (int)m.step[i];
sel... | TOOL | 0.924764 | 5.033582 |
fc8f811f-15e1-48cb-9a64-279e34928a24 | OlegGirniak/TicTacToe | TIC-TAC-TOE/Bot.cpp | #include "Bot.h"
#include "Player.h"
Bot::Bot(char character)
{
this->name = "BOT Arthur";
this->character = character;
points = 0;
}
Bot::~Bot()
{
points = 0;
character = ' ';
}
const char& Bot::GetCharacter() const
{
return this->character;
}
std::string Bot::GetName() const
{
return this->name;
}
void B... | ALGO | 0.938022 | 3.556112 |
85a1ecae-63cb-4e5a-b392-0573c31f77d6 | yukikamome316/atcoder-archive | abc307/abc307_d_42973566_TLE.cpp | /*
* Author: yukikamome316
* Submission URL: https://atcoder.jp/contests/abc307/submissions/42973566
* Submitted at: 2023-06-26 14:08:30
* Problem URL: https://atcoder.jp/contests/abc307/tasks/abc307_d
* Result: TLE
* Execution Time: 2205 ms
*/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int... | ALGO | 0.999864 | 4.28472 |
29991b6f-143d-42ff-ab4a-82dad6b4423b | Shyam-Makwana/leetcode | 583-delete-operation-for-two-strings/583-delete-operation-for-two-strings.cpp | class Solution {
public:
int minDistance(string word1, string word2) {
int n = size(word1), m = size(word2);
vector<vector<int>> dp(n+1, vector<int> (m+1, 0));
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
if(i==0 || j==0) dp[i][j] = i+j;
else i... | ALGO | 0.999987 | 5.907187 |
8fdf56d7-a34f-441a-9657-6d76e028442d | ishandutta2007/codeforces | dmitriy.belichenko/normal/752/B.cpp | #include <iostream>
#include <cmath>
#include <vector>
#include <time.h>
#include <map>
#include <set>
#include <deque>
#include <cstdio>
#include <cstdlib>
#include <unordered_map>
#include <bitset>
#include <algorithm>
#include <string>
#include <fstream>
#include <assert.h>
#include <list>
#include <cstring>
using n... | ALGO | 0.999995 | 3.531733 |
659f3c24-194f-40b8-9f7a-ff298d566ac7 | seyoon1213/Algorithm | 1/O_4375.cpp | #include <stdio.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll n;
vector<ll> v;
int main(){
// scanf("%d", &n) 형식***
// 반환값 (1) 올바른 형식인 경우: 입력된 값(들)의 개수 (2) 올바른 형식이 아닌 경우: 0 (3) ctrl + d: EOF(-1)
while(scanf("%lld", &n) != EOF){
v.push_back(n);
}
for(int i = 0; i < ... | ALGO | 0.999835 | 3.928894 |
8112e00b-f068-45fc-8112-7f4c41fb3e30 | MR-P17/CPP_TREE | morris_traversal_preorder.cpp | #include<bits/stdc++.h>
using namespace std;
class Node
{
public:
int data;
Node *left;
Node *right;
};
Node *new_node(int data)
{
Node *tmp=new Node();
tmp->data=data;
tmp->left=NULL;
tmp->right=NULL;
return tmp;
}
void morris_traversal(Node *root)
{
Node *pre,*curr;
if(root==NULL)return;
curr=root;
whil... | ALGO | 0.999997 | 4.790636 |
79b82fc3-14f7-41e6-ad24-ef9cde9e98fd | preranashelke/Coding-practice | recursion/digitalRoot-19-12.cpp |
#include<bits/stdc++.h>
using namespace std;
//Given a non-negative integer num, repeatedly add all its digits until the result has only one digit
int digitalroot(int n){
if(n==0){
return 0;
}
return (n%9==0)? 9:(n%9);
}
int main(){
int n ;
cout<<"enter any number"<<endl;
cin>>n;
cout<<digitalroot(n)<<endl;
... | ALGO | 0.999793 | 4.891683 |
51bfd569-192e-4a54-b126-8b25d4dc68ad | anandayush24/LeetCode-Questions | 1926-nearest-exit-from-entrance-in-maze/1926-nearest-exit-from-entrance-in-maze.cpp | class Solution {
public:
int nearestExit(vector<vector<char>>& maze, vector<int>& entrance) {
int rows = maze.size();
int cols = maze[0].size();
queue<pair<int,int>> q;
q.push({entrance[0], entrance[1]});
maze[entrance[0]][entrance[1]] = '+';
int dr[4] = {1, ... | ALGO | 0.999973 | 5.880323 |
3a6d25e9-f2b4-4f10-b445-3acff01769f4 | sarvex/leetcode-fortran | solution/1000-1099/1099.Two Sum Less Than K/Solution.cpp | class Solution {
public:
int twoSumLessThanK(vector<int>& nums, int k) {
sort(nums.begin(), nums.end());
int ans = -1;
int i = 0, j = nums.size() - 1;
while (i < j) {
int t = nums[i] + nums[j];
if (t < k) {
ans = max(ans, t);
++... | ALGO | 0.999998 | 6.030451 |
70035704-f59c-4296-b5f9-03c308e9de5c | mxm43/leetcode | 92-reverse-linked-list-ii.cpp | class Solution
{
public:
ListNode *reverseBetween(ListNode *head, int m, int n)
{
ListNode **p = &head;
ListNode *list = NULL, *tail = NULL;
for (int i = 0; i < m-1; ++i) {
p = &((*p)->next);
}
tail = *p;
for (int i = 0; i < n-m+1; ++i) {
... | ALGO | 0.999978 | 6.041007 |
3da93a60-f23b-498d-984e-cc1ad65160e8 | rohan-0926/DSA-SOLUTIONS | Check for Balanced Tree - GFG/check-for-balanced-tree.cpp | // { Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// Tree Node
struct Node {
int data;
Node* left;
Node* right;
};
// Utility function to create a new Tree Node
Node* newNode(int val) {
Node* temp = new Node;
temp->data = val;
temp->left = NULL;
... | ALGO | 0.999834 | 6.811472 |
4c96070a-ae1b-404b-8241-94542bc2a4c3 | SourabhSingh22/Only_DSA | Program6.cpp | #include<iostream>
using namespace std;
void recursion(int n){
if(n<=0){
return;
}
// cout<<n<<" Sourabh"<<" ";
cout<<n<<" ";
recursion(n-1);
}
int main(){
int n;
cin>>n;
recursion(n);
return 0;
} | ALGO | 0.999879 | 4.070579 |
b6e4dff2-b586-4ce0-87a7-abd74ff47167 | yash-gargji/codeforces-solution | C_Ski_Resort.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--){
long long int n,k,q;
cin>>n>>k>>q;
long long int sum = 0;
int arr[n];
for(int i =0;i<... | ALGO | 0.999853 | 3.841122 |
b035d8f3-3d7b-45ac-8362-b8933ac3714a | knockcat/Temp | 01.Arrays/04_Minimum distance between two numbers.cpp | // Time Complexity -> O(n)
// Space Complexity -> O(1)
class Solution{
public:
int minDist(int a[], int n, int x, int y) {
// code here
int ans = INT_MAX;
int xIdx = -1, yIdx = -1;
for(int i = 0; i < n; ++i)
{
if(a[i] == x)
... | ALGO | 0.999963 | 5.284478 |
a62ce9e5-18d1-4ce8-b0cf-668c5f446728 | tanmoy4171/LeetCode | 0217-contains-duplicate/0217-contains-duplicate.cpp | // Set Approach
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
return nums.size() > set<int>(nums.begin(),nums.end()).size();
}
}; | ALGO | 0.999592 | 5.58617 |
4775ac49-b8b0-418e-b0e7-f74398dabcb2 | Cheburin/DeferredRender | DeferredRender/DXUT/Core/DXUTDevice11.cpp | //--------------------------------------------------------------------------------------
// Forward declarations
//--------------------------------------------------------------------------------------
extern void DXUTGetCallbackD3D11DeviceAcceptable( LPDXUTCALLBACKISD3D11DEVICEACCEPTABLE* ppCallbackIsDeviceAcceptable,... | TOOL | 0.891932 | 6.556206 |
8444b4bf-75f6-4226-9696-ca4e220240d2 | EdwardOu98/LeetCode | Daily Challenge/63_Unique_Paths_II.cpp | #include <vector>
using namespace std;
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
if(obstacleGrid[0][0] == 1) {
return 0;
}
int m = obstacleGrid.size(), n = obstacleGrid[0].size();
int dp[m][n];
int i, j;
d... | ALGO | 0.999084 | 6.286539 |
b021c165-13ed-4464-9a64-6e19822b0235 | Alice87877/Zerojudge-cpp | e968.cpp | //https://zerojudge.tw/ShowProblem?problemid=e968
#include <iostream>
using namespace std;
int main(){
int n,a,b,c;
cin>>n>>a>>b>>c;
int ans[n];
for(int i=0;i<n;i++){
ans[i]=i+1;
}
for(int i=n-1;i>=0;i--){
if(ans[i]!=a&&ans[i]!=b&&ans[i]!=c){
cout<<"No. "<<i+1<<"\n"... | ALGO | 0.999963 | 3.472278 |
ff2d5a2f-3b99-4e70-8007-9682e6865a52 | ashiqur0/c- | Chapter8_Array/unique_value.cpp | // Array : HW-3 Print all the unique value of an array
#include <bits/stdc++.h>
using namespace std;
void print_unique(int arr[], int size_arr, bool unique[]) {
for (int i = 0; i < size_arr; i++) {
if (unique[arr[i]]) {
cout << arr[i] << " ";
unique[arr[i]] = false;
}
}... | ALGO | 0.99294 | 5.22471 |
7e8b919b-35c1-44b0-b791-f5894de91233 | sagpant/feelpp | feelpp/contrib/boost/hana/example/tutorial/integral.cpp | #include <boost/mpl/equal_to.hpp>
#include <boost/mpl/int.hpp>
#include <boost/mpl/integral_c.hpp>
#include <boost/mpl/minus.hpp>
#include <boost/mpl/multiplies.hpp>
#include <boost/mpl/pair.hpp>
#include <boost/mpl/plus.hpp>
#include <boost/hana/assert.hpp>
#include <boost/hana/concept/constant.hpp>
#include <boost/h... | ALGO | 0.870958 | 6.37919 |
a6d3ffde-c1f3-4f0d-97e5-ae49f27e8a6e | shh1vachan/NSU_THIRD_SEMESTER | lab2b/game.cpp | #include "game.h"
#include <iostream>
#include <sstream>
#include <fstream>
#include <cstdlib> // for std::rand и std::srand
#include <ctime> // for std::time
#include <algorithm> //for std::find
Game::Game(int field_size)
: field_size(field_size), current_iteration(0), game_field(field_size, std::vector<cel... | ALGO | 0.949976 | 5.63136 |
3748fb20-0030-417d-ab4e-18774fc87eaa | boy2407/IT003-DSAA | stack_queue/maxrectangularhistogram.cpp | #include <iostream>
#include <vector>
#include <stack>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> heights(n);
for (int i = 0; i < n; i++) {
cin >> heights[i];
}
stack<int> st;
int max_area = 0;
f... | ALGO | 0.998648 | 5.608093 |
a43923fb-5ee5-4bc8-8fcc-341d169602f6 | Rifqi-Irfansyah/Kuliah_DDP | tugas28_while hitung z.cpp | #include <iostream>
using namespace std;
int main(){
float hasil, penyebut, pembilang;
cout << "Program Menghitung Pecahan" <<endl ;
hasil = 0;
penyebut = 10;
pembilang = 1;
while (pembilang <= 9)
{
cout << pembilang << "/" << penyebut << endl;
hasil = hasil + ( pembilan... | ALGO | 0.998914 | 3.544735 |
6683931f-6cc8-4489-af3f-2f0fdf315039 | Gaurav-Tewatia/Leetcode | Check if there exists a subsequence with sum K - GFG/check-if-there-exists-a-subsequence-with-sum-k.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
private:
bool helper(int i, int n, vector<int> &arr, int k){
if(i==n){
if(k==0)
return true;
else
return false;
... | ALGO | 0.999916 | 5.883397 |
d6c1e2d4-34c6-4f9e-9918-79931890a51d | harsha-hl/Bitcoin-Blockchain-Parser-using-ECL | main.cpp | #include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <float.h>
#include <math.h>
#include <time.h>
#include <stdint.h>
#include <sys/time.h>
#include <termios.h>
#include <unistd.h>
#include <assert.h>
// SHA256.h
#ifndef SHA256_H
#define SHA256_H
void computeSHA256(const void *input, // A pointer... | ALGO | 0.997341 | 5.929968 |
45a83c52-1521-4114-8c47-897a7cc4c3bc | jcucsb/eLEETcode | LengthOfLastWord.cpp | //PJ 1/10/23
//ENG II
//Notes: use a catch to make sure not indexing out of bounds on first attempt
class Solution {
public:
int lengthOfLastWord(string s) {
int wordLength = 0;
for(int i = 0; i < s.length(); i++){
if(isalpha(s.at(i))!=0){ //if it is an a... | ALGO | 0.997204 | 5.592833 |
dcbeea35-510b-42b3-8129-cfdfae91b83e | ABB00717/leetcode | problems/cpp/2845.count-of-interesting-subarrays.cpp | /*
* @lc app=leetcode id=2845 lang=cpp
*
* [2845] Count of Interesting Subarrays
*/
// @lc code=start
#include <unordered_map>
#include <vector>
class Solution {
public:
long long countInterestingSubarrays(std::vector<int>& nums, int modulo, int k) {
std::vector<int> prefix(nums.size() + 1, 0);
... | ALGO | 0.999393 | 6.38221 |
a105fc63-13df-42ce-b105-ccecb783e6c4 | sohebalam/lingoty | 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 |
b76a33e2-6a9d-4233-95b0-9523d3e49dad | gyeongpunch/SSAFY-13th-Embedded-Algorithm-Study | JungMinWoo99/2025_02/week_3/BOJ-테트로미노.cpp | #include <iostream>
#include <vector>
using namespace std;
int N, M;
vector<vector<int>> board;
class FindAnswer {
public:
FindAnswer(vector<vector<int>>& input) : grid(input) {
out_of_bound.assign(grid[0].size(), -1);
}
int getAnswer() {
for (int i = 0; i < grid.size(); i++) {
... | ALGO | 0.999906 | 4.80203 |
74394b92-0ca2-402e-ac12-cf14c3dbe07f | 774252326/sinyang | ogt/ogt/pcloud.cpp |
#include "pcloud.h"
#include <fstream>
#include <string.h>
bool cmprotp(rotatep p1, rotatep p2)
{
return p1.angle<p2.angle;
}
pcloud::pcloud(void)
: range(0)
{
pi=(3.1415926535897932384626433832795);
}
pcloud::~pcloud(void)
{
}
void pcloud::load(char * fp)
{
const int l=256;
std::ifstream ifs(fp);
point3d ... | TOOL | 0.890003 | 3.098132 |
ebe229a5-bade-4ec0-8f27-c0e24b8a018a | strn18/cpp_practice | algorithm/DFS/4803.cpp | #include <iostream>
#include <vector>
#include <cstring>
#include <string>
#define MAX 500
using namespace std;
int n, m;
vector<int> adj[MAX+1];
bool visited[MAX+1];
void initialize(void);
bool hasCycle(int prev, int cur);
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for(int t=1; 1; t++){
... | ALGO | 0.999958 | 5.30019 |
05766c0d-5a8d-4f74-b527-34d756b9b61c | manikanta2901/ubuntu | .history/SRM/elab/DAA/DivideAndConquer/BishuAndSoldiers_20210226145214.cpp | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main(){
int size;
cin >> size;
vector<int>powers;
for(int i = 0; i < size; i++){
int a;
cin >> a;
powers.push
}
return 0;
} | ALGO | 0.997348 | 3.391244 |
da43c7a0-156e-45d6-9cbc-ea777e558fc0 | Audreykacur/CPPProgramming | Labs/Lab6/Question2.cpp | //
// Created by Audrey Kacur on 2/16/22.
//
/*
When an object is falling because of gravity,
the following formula can be used to determine the distance the object falls in a specific time period:
d = (1/2) * g * t^2
The variables in the formula are as follows:
d is the distance (meters)
g is 9.8
t is the amount of ... | ALGO | 0.957539 | 3.12873 |
ee6dcbd8-6293-47c9-9d39-bfb9574d6cf3 | ilyakudrov/general_code | apps/observables/flux_tube/flux_tube_wilson.cpp | #include "../../../lib/cpu/include/data.h"
#include "../../../lib/cpu/include/flux_tube.h"
#include "../../../lib/cpu/include/matrix.h"
#include "../../../lib/cpu/include/plaket.h"
#include "../../../lib/cpu/include/smearing.h"
#include "../../../lib/cpu/include/wilson_loops.h"
#include <cstring>
#include <ctime>
#inc... | DATA | 0.963779 | 3.011172 |
c5905284-4b27-47f3-bbfb-fe97161bf1ce | hanzo-21/EEC_LAB-2ND-SEM | c++program/functiontypes.cpp | #include<conio.h>
#include<iostream>
using namespace std;
class Addition{
private:
int a , b;
public:
void input();
int sendA();
int sendB();
void sum1 ();
int sum2 ();
void sum3 (int x, int y);
int sum4 (int x , int y);
};
void Addition::input(){
cout<<"enter a"<<endl;
cin>>a;
cout<<"ente... | TOOL | 0.955386 | 4.333075 |
f967b2ff-f2e5-4ab4-a9b8-bd8df0819ea0 | xchmwang/algorithm | leetcode/leetcode76/leetcode76/main.cpp | #include <iostream>
#include <string>
using namespace std;
const int maxn = 128;
class Solution {
public:
int need_find[maxn], has_found[maxn];
string minWindow(string s, string t) {
int slen = s.length(), tlen = t.length();
for (int i = 0; i < tlen; ++i) ++need_find[t[i]];
int count = 0;
int max_begin... | ALGO | 0.999901 | 5.426996 |
097d4474-d5d9-4a74-a465-47e87f8e6a19 | karrel84/TesseractSample | tess-two/jni/com_googlecode_tesseract_android/src/ccutil/indexmapbidi.cpp | #include "indexmapbidi.h"
namespace tesseract {
// SparseToCompact takes a sparse index to an index in the compact space.
// Uses a binary search to find the result. For faster speed use
// IndexMapBiDi, but that takes more memory.
int IndexMap::SparseToCompact(int sparse_index) const {
int result = compact_map_.bi... | ALGO | 0.865774 | 7.798163 |
c2b0cb9d-3ff4-4a84-a82a-fb7e687ae0b8 | tangyanmin/PressTest | deps/eigen/bench/quat_slerp.cpp | #include <iostream>
#include <Eigen/Geometry>
#include <bench/BenchTimer.h>
using namespace Eigen;
using namespace std;
template<typename Q>
EIGEN_DONT_INLINE Q nlerp(const Q& a, const Q& b, typename Q::Scalar t)
{
return Q((a.coeffs() * (1.0-t) + b.coeffs() * t).normalized());
}
template<typename Q>
EIGEN_DONT_INL... | ALGO | 0.994343 | 6.251058 |
3d1bc89b-0f21-4171-9d2b-57fc1609521a | marknasser/iTi-Tasks-C | Labs/lab-7-11-assign1-maxmain.cpp | #include <iostream>
using namespace std;
int main() {
int a, b, c,d,e,max=-32768, min=32767;
cout<<"Enter num1:";
cin>>a;
cout<<"Enter num2:";
cin>>b;
cout<<"Enter num3:";
cin>>c;
cout<<"Enter num4:";
cin>>d;
cout<<"Enter num5:";
cin>>e;
if (a>max) {max=a;}
if (b>ma... | ALGO | 0.999874 | 3.231779 |
c67c6a77-4159-49ee-a99c-ca17cbf63f00 | SalmaMohammedHamedMustafa/Embedded-Linux-Tasks | 02cpp/02/task5.cpp | #include <iostream>
void findEvenAndOdd(int array[], int size, int evenArray[], int& evenCount, int oddArray[], int& oddCount) {
evenCount = 0;
oddCount = 0;
for (int i = 0; i < size; ++i) {
if (array[i] % 2 == 0) {
evenArray[evenCount++] = array[i];
} else {
oddArra... | ALGO | 0.999445 | 5.822905 |
21ae4b38-abc0-48b1-9985-80cca8fb15d2 | Intermodalics/pcl-debian | apps/src/pyramid_surface_matching.cpp | #include <pcl/io/pcd_io.h>
#include <pcl/filters/voxel_grid.h>
#include <pcl/features/normal_3d.h>
#include <pcl/features/ppf.h>
#include <pcl/registration/pyramid_feature_matching.h>
using namespace pcl;
#include <iostream>
using namespace std;
const Eigen::Vector4f subsampling_leaf_size (0.02f, 0.02f, 0.02f, 0.0f)... | ALGO | 0.973849 | 5.8523 |
caa139e8-c468-4677-b97b-8946c7c5abe7 | IvanRenison/ProgrammingProblems | ICPC contests/Latin American Regional 2019-2020/D.cpp | // https://codeforces.com/gym/102428
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ull> vu;
typedef vector<ll> vi;
typedef pair<ull, ull> uu;
typedef pair<ll, ll> ii;
typedef vector<uu> vuu;
typedef vector<ii> vii;
typedef tuple<ll, ll, ull> iiu;
t... | ALGO | 0.999234 | 4.709043 |
1abbef49-2f47-41cf-8e99-a3a517e4c669 | davidgohzk/CompetitiveProgramming | kattis/powerhand.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define pi pair<int, int>
#define hs unordered_set
#define hss hs<string>
#define hsi hs<int>
#define msi map<string, int>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#defi... | ALGO | 0.999948 | 3.786632 |
73930796-15bd-4a9f-826d-7664d3480ee1 | tyask/procon | atcoder/abc/abc189/1/abc189/D/main.cpp | #include <bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#pragma GCC diagnostic ignored "-Wunused-parameter"
#pragma GCC diagnostic ignored "-Wunused-variable"
#pragma GCC diagnostic ignored "-Wsign-compare"
#define overload4(_1,_2,_3,_4,n... | ALGO | 0.99993 | 4.637033 |
91f00f45-036d-4683-8e55-b1879a9e9ea8 | jgabrieldsl/PUC-2-Semestre | Matérias/Algoritmos e Linguagem de Programação - Prática/Aula 01 - Comandos de Seleção, Seleção e Repetição & For, While e Dowhile/Comandos de Seleção - Desafios/Exercicio_4.cpp | // Exercício 4 - (Desafio) Elabore um programa que leia os parâmetros a, b e c de uma equação quadrática e determine as raízes desta equação.
#include <iostream>
#include <cmath> // Biblioteca matemática
using namespace std;
int main() {
float a, b, c;
cout << "Digite os valores de A, B & C: ";
... | ALGO | 0.999475 | 4.638332 |
06066a7d-af57-4378-94b3-1d31ba3c265f | huytoong/Data-Structures-And-Algorithms | DSA/ThuatToanSinhKeTiep/B27_TheBai.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
bool check(int a[] , int n)
{
for(int i = 1 ; i < n; i++)
{
if(abs(a[i] - a[i + 1]) == 1) return false;
}
return true;
}
int main()
{
int n; cin >> n;
int a[n + 1];
for(int i = 1 ; i<= n ;i++... | ALGO | 0.999986 | 4.51166 |
13c7104b-c4bc-47f9-bccc-033257481dd0 | rajdeepdatta2016/Data-Structure-and-Algorithm | Basic/Pattern/Pattern_10.cpp | #include<iostream>
using namespace std;
int main()
{
int i,k,n,x;
std::cout << "Enter Rows: " << std::endl;
cin>>n;
for(i=1; i<=n; i++)
{
x=i;
for(k=1; k<=n+i-1; k++)
{
if(k<=n-i)
{
std::cout << " ";
}
else if(k... | ALGO | 0.999256 | 3.592457 |
3b9d4be1-3c62-4705-a81f-a225ff7bad05 | Randenlomnis0/tfg | codigo/soluciones/aer/563.cpp | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,j,k) for (int i = j; i < k; ++i)
#define RFOR(i,j,k) for (int i = j - 1; i >= k; --i)
#define MIN(a,b) a = min(a, b)
#define LEN(s) ((int)(s).length())
signed main() {
cin.sync_with_stdio(false);
cin.tie(nullptr);
int F, C, N;
while (cin >> F >... | ALGO | 0.999862 | 4.590866 |
4841015c-0791-45da-af1d-a0e84549f182 | xiguayizu/ollvm4.0-and-llvm9.0 | llvm/tools/clang/lib/Analysis/LiveVariables.cpp | #include "clang/Analysis/Analyses/LiveVariables.h"
#include "clang/AST/Stmt.h"
#include "clang/AST/StmtVisitor.h"
#include "clang/Analysis/Analyses/PostOrderCFGView.h"
#include "clang/Analysis/AnalysisDeclContext.h"
#include "clang/Analysis/CFG.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/PostOrderIterator.h"
#... | ALGO | 0.994509 | 5.203866 |
54d63aa0-d917-4573-b501-30195d74ef98 | ishandutta2007/codeforces | realcomplex/normal/1728/A.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main(){
fastIO;
int tc;
cin >> tc;
for(int ... | ALGO | 0.999946 | 4.021206 |
7d60e7ea-127e-46b2-a4ce-fe1a16f38cd4 | CLinnSheng/SC1013 | C/Exercise/Tutorial/Array/tut3.cpp | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
void distribution(int a[], int cnt){
srand(time(NULL));
for (int i = 0; i < cnt; i++)
a[(rand() % 100) / 10]++;
}
void print(int s[]){
for (int i = 0; i < 10; i++){
switch(i){
case 0: printf("0-9 |"); break;
case 1: printf("10-19... | ALGO | 0.99436 | 3.501012 |
4f90cce6-0cbd-4f6a-87f0-4478d3f06200 | nieyrinn/QueenCodes2025 | tasks/7.cpp | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
long long n, max1 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
max1 = max(max1, x);
}
cout << max1 << endl;
} | ALGO | 0.999803 | 4.169927 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.