uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
a30ce0ee-a6c3-4d9d-8c43-1fb1e8440a88 | shubhampatel27/DSA-Question-Love-Babbar1 | Phaseone/1963Leetcode.cpp | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
class Solution {
public:
int minStoneSum(vector<int>& piles, int k) {
priority_queue<int> pq;
for(int i=0; i<piles.size(); i++){
pq.push(piles[i]);
}
while(k--){
int p=pq.top();
if(p%2==0... | ALGO | 0.999942 | 4.721392 |
dcabcfcc-bdbb-4aba-b1f2-b608a9f697e7 | OpenXRay/xray-soc-history | xr_3da/xrRender_R2/Light_rSM.cpp | #include "stdafx.h"
#include "light_rSM.h"
const float c_range = 100;
void CLight_rSM::compute_xf_direct (Fmatrix& L_view, Fmatrix& L_project, Fmatrix& mView, float p_FOV, float p_A, float p_FAR, float plane_dist )
{
}
| ALGO | 0.984798 | 4.643234 |
543496fb-07da-4a7b-9529-9e5ef7278afb | raincross7/code-similarity | codes/train_code/problem179/problem179_13.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
template<class T>
using reverse_priority_queue = priority_queue<T, vector<T>, great... | ALGO | 0.999898 | 3.883517 |
d916d9de-bf98-4f94-88bf-a36c7293902e | emanuelpeg/codigoCpp2023 | clase5/colecction/TP2-POO/listaordenada.cpp | #include "listaordenada.h"
#include <iostream>
using namespace std;
ListaOrdenada::ListaOrdenada():Lista(){
}
ListaOrdenada::ListaOrdenada(int valor):Lista(valor) {
}
ListaOrdenada::~ListaOrdenada() {
}
bool ListaOrdenada::alta(int valor) {
nodo *aux=acceso;nodo *ant=NULL;nodo *nuevo;
while (aux!=NULL)
... | ALGO | 0.975809 | 4.774117 |
06412999-31a4-4aaa-a750-e94c5ec8f104 | lazybones1/Algorithms | 백준알고리즘/단계별로 풀어보기/14. 백트래킹/P_Number_14889.cpp | #include <iostream>
#include <vector>
#include <limits>
using namespace std;
int n;
int map[21][21];
int visited[21];
int ans = std::numeric_limits<int>::max();
void dfs(int index, int first){
if(index == n/2){
vector<int> team_link, team_start;
for (int i = 0; i < n; i++){
if (visited[i]) team_start.... | ALGO | 0.999968 | 4.318404 |
e54d0368-7da2-41be-a1f3-df2ec9b38f6e | ishandutta2007/codeforces | shik/normal/341/C.cpp | // TwT514 {{{
#include <bits/stdc++.h>
#define SZ(x) ((int)(x).size())
#define FOR(i,c) for (__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define PER(i,n) for (int i=(int)(n)-1; i>=0; i--)
#define PER1(i,b,a) for (int i=(int)(b); i>=(int)(a); i--)
#define REP(i,n) for (int i=0; i<(n); i++)
#define REP1(i,a,b... | ALGO | 0.999967 | 3.723179 |
d8365885-9b6f-4016-80c7-28f9f25625c9 | debisaw/c-plus-plus-projects-for-uni | 341_assignment_2/utree.cpp | /**
* CMSC 341 - Spring 2021
* Project 2 - Binary Trees
* UserTree.h
* Implementation for the UTree class.
*/
#include "utree.h"
/**
* Destructor, deletes all dynamic memory.
*/
UTree::~UTree() {
clear();
}
/**
* Sources a .csv file to populate Account objects and insert them into the UTree.
* @param infi... | ALGO | 0.887307 | 5.143798 |
46ad2b15-67db-4e66-aee0-95e6527af12a | nucleargezi/acm-icpc | Library_chacker/set power series/Exp_of_Set_Power_Series.cpp | #include "MeIoN_Lib/Z_H/MeioN.hpp"
#include "MeIoN_Lib/MeIoN_all.hpp"
#include "MeIoN_Lib/math/set/subset_exp.hpp"
#include "MeIoN_Lib/math/mod/modint.hpp"
// #define tests
using mint = M99;
void Yorisou() {
INT(n);
VEC(mint, a, 1 << n);
UL(subset_exp(a));
}
#include "MeIoN_Lib/Z_H/main.hpp" | ALGO | 0.999551 | 4.680803 |
2e441188-a8fb-4b43-bdaf-854d713b81cc | balckwilliam/tengine_opendla_note | opencv-4.5.4/3rdparty/carotene/src/magnitude.cpp | #include "common.hpp"
#include "vtransform.hpp"
#include <cmath>
namespace CAROTENE_NS {
#ifdef CAROTENE_NEON
namespace {
struct Magnitude
{
typedef s16 type;
void operator() (const int16x8_t & v_src0, const int16x8_t & v_src1,
int16x8_t & v_dst) const
{
int16x4_t v_src0_p = vget... | ALGO | 0.997824 | 6.697874 |
47b3a549-975b-408d-8d01-0f6793c116c1 | eduardoyutaka/uri | beginner/2552.cpp | // CheeseBreadSweeper
#include <iostream>
using namespace std;
int solve(int mtx[][100], int i, int j, int m, int n) {
if (mtx[i][j])
return 9;
int res = 0;
if (i==0 && m==1) {
;
} else if (i==0 && m>1) {
res += mtx[i+1][j];
} else if (i==m-1 && m>1) {
res += mtx[i-1][j];
} else {
res ... | ALGO | 0.999941 | 4.246987 |
3b413e9a-7a90-432b-bb92-8b6a801023b4 | IcyCC/net_safe | src/rc4.cpp | #include "rc4.h"
#include <iostream>
using namespace std;
RC4::RC4()
{
this->k.clear();
this->miwen=NULL;
}
/*
初始化算法
接受密钥和密钥长度
生成S盒
*/
void RC4::rc4Init(char *key, long Len)
{
int i;
this->k.clear();
this->miwen=NULL;
if (key == NULL || Len == 0)
{
cout<<"rc4 key or len is 0, ret... | ALGO | 0.982317 | 3.374945 |
61812af2-96ed-472e-a08f-d298a3ada036 | yerass11/Algorithms_and_data_structures_FALL_2023 | Lab3/I.cpp | #include <iostream>
using namespace std;
int main() {
int n; cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int target; cin >> target;
int l = 0, r = n - 1;
int mid;
while(l <= r) {
mid = l + (r - l) / 2;
if (a[mid] == target) {
cou... | ALGO | 0.999979 | 4.700962 |
23280d2c-0273-41bc-96d7-35f0da4b417c | kosekitau/atcorder | aaa/202-a.cpp | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
using Graph = vector<vector<int> >;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<(21-a-b-c)<<endl;
return 0;
} | ALGO | 0.999574 | 3.162128 |
368f42f2-c96a-41c8-a573-489ccfdd2cef | FHead/PhysicsHiggsProperties | Likelihood/11363AttachLikelihood8D/AttachLikelihood.cpp | //---------------------------------------------------------------------------
// AttachLikelihood.cpp
// Author: Yi Chen (11231)
//
// This program reads in a file, get tree named "probe_tree",
// evaluate likelihood using a 6D map and make a new branch with
// the log likelihood for each entry
//
//
// To run it, comp... | DATA | 0.941646 | 3.956981 |
86697c9b-805d-495d-a671-f650976ee356 | hejiangda/PAT_Study | 2019/A1021_Deepest_Root/main.cpp | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
// n个结点，maxheight记录深搜得到的最大高度
int n, maxheight = 0;
// v是邻接表，用来存储图
vector<vector<int>>v;
// 判断结点有无访问过
bool visit[10010];
// set可以去重，因此两次dfs得到的相同的结点只会保存一次
set<int> s;
// temp用来保存高度最高的根
vector<int> temp;
void dfs(int node, int ... | ALGO | 0.999955 | 4.789678 |
947f3094-850e-437b-b3fc-83d2aa2513b8 | ishandutta2007/codeforces | m_99/normal/1617/A.cpp | #include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define Inf 1000000001
int main(){
int _t;
cin>>_t;
rep(_,_t){
string s;
cin>>s;
vector<int> cnt(26,0);
rep(i,s.size()){
cnt[s[i]-'a']++;
}
string t;
cin>>t;
string ans = "";
if... | ALGO | 0.999936 | 3.816803 |
d9adc886-2654-4c1c-8183-3a2a56f5dc5a | shagatomte19/Codeforces | Bit++.cpp | #include<iostream>
#include<string>
using namespace std;
int main(){
int X=0,n;
string a;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(a[1]=='+'){
X++;
}else{
X--;
}
};
cout<<X<<endl;
return 0;
}
| ALGO | 0.999804 | 3.944939 |
5bd78600-1a1d-4ec4-81c4-e4acaa757ccc | Library-Dev/BlibraryTest | src/crypto/sha1.cpp | #include "crypto/sha1.h"
#include "crypto/common.h"
#include <string.h>
// Internal implementation code.
namespace
{
/// Internal SHA-1 implementation.
namespace sha1
{
/** One round of SHA-1. */
void inline Round(uint32_t a, uint32_t& b, uint32_t c, uint32_t d, uint32_t& e, uint32_t f, uint32_t k, uint32_t w)
{
... | ALGO | 0.998309 | 7.495188 |
d982d12b-3502-4a18-92f0-599b77dc251b | MuVen/LeetCode-MuVen | Problems/Easy/66_PlusOne.cpp | /*
Given a non-empty array of digits representing a non-negative integer,
plus one to the integer.
The digits are stored such that the most significant digit is at the
head of the list, and each element in the array contain a single digit.
You may assume the integer does not contain any leading zero,
except the nu... | ALGO | 0.999847 | 6.934533 |
1a587755-7e83-466b-86fb-b42a7de795c2 | raincross7/code-similarity | codes/train_code/problem181/problem181_122.cpp | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | ALGO | 0.999895 | 3.147438 |
7ec23d3d-8595-4b75-8a1d-fb90c93fc067 | tickelton/playground | challenges/lc/dp/word_break.cpp | /*
# Word Break
Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.
Note that the same word in the dictionary may be reused multiple times in the segmentation.
## Example 1:
Input: s = "leetcode", wordDict = ["lee... | ALGO | 0.999727 | 6.323418 |
7f4126a4-4432-410d-8c52-fa61a0bf5c96 | VanDien2006/DSA | ThucHanh/TH31_3/Bai05/Bai05.cpp | /*###Begin banned keyword - each of the following line if appear in code will raise error. regex supported
###End banned keyword*/
#include <iostream>
using namespace std;
// Cấu trúc của một node
struct NODE {
int info;
NODE* pNext;
};
// Cấu trúc của một DSLK
struct LIST {
NODE* pHead;
NODE* pTail;
};
NODE* Cr... | ALGO | 0.999966 | 5.139519 |
41877446-3ecb-4c9f-8014-729f36832ea7 | cw-yam/cwyam-study | week2/day3/10866.cpp | #include <iostream>
#include <deque>
#include <cstring>
using namespace std;
int main()
{
int N, x;
cin >> N;
string s;
deque<int> d;
while(N--)
{
cin >> s;
if(s == "push_front")
{
cin >> x;
d.push_front(x);
}
else if(s == "push_ba... | ALGO | 0.999668 | 4.225582 |
a15b0163-d5b4-4e92-b3ee-8ca717c9e5ab | abhix201/LeetCode_Codes | 0128-longest-consecutive-sequence/0128-longest-consecutive-sequence.cpp | class Solution {
public:
int longestConsecutive(vector<int>& nums) {
if (nums.size() == 0) return 0;
set<int> s(nums.begin(), nums.end());
int cnt = 1;
int ans = 0;
int prev = *s.begin();
for (auto it = next(s.begin()); it != s.end(); it++) {
if (*it == pr... | ALGO | 0.999927 | 5.714488 |
e0c7f591-f610-41b4-8d71-0e96add21426 | Donglidishu/Cpp_Beginner_Tutorial | Part1_C++基础编程/38.乘法口诀表.cpp | #include <iostream>
using namespace std;
int main()
{
for (int h = 1; h <= 9; h++)
{
for (int l = 1; l <= h; l++) // 列数小于等于行数
{
cout << l << " * " << h << " = " << l * h << "\t";
}
cout << endl;
}
return 0;
} | ALGO | 0.998049 | 3.457461 |
6a09ef7a-3df2-4d4b-b01a-5f9cc6dc0865 | eizadhamdan/leetcode_solutions | Easy/1768-merge_strings_alternately.cpp | class Solution {
public:
string mergeAlternately(string word1, string word2) {
int i = 0;
int j = 0;
std::string ans = "";
int word1_len = word1.length();
int word2_len = word2.length();
while (i < word1_len && j < word2_len) {
ans += word1[i];
... | ALGO | 0.999944 | 5.985231 |
8dcd9425-5199-4cdc-aa90-d8173420fdbd | Bungmint/competitiveprogramming | contest/codeforces/1594/1594E1.cpp | // Problem: E1. Rubik's Cube Coloring (easy version)
// Contest: Codeforces - Codeforces Round #747 (Div. 2)
// URL: https://codeforces.com/contest/1594/problem/E1
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
using namespace std;
using ll = long long;
using vi = ve... | ALGO | 0.999788 | 5.253752 |
8c14da0f-226e-4cd5-9115-e06d8f9e446e | gentbot/GlowCube | src/animations/animations.cpp | #include <FastLED.h>
#include "definitions.h"
#include <webmonitor.h>
// Function to calculate the intensity of the wave at position (x, y) at time t
float waveIntensity(int x, int y, float t) {
float distance = sqrt((x - DEF_SIZE_X / 2) * (x - DEF_SIZE_X / 2) + (y - DEF_SIZE_Y / 2) * (y - DEF_SIZE_Y / 2));
return... | TOOL | 0.981444 | 4.095113 |
21725cfb-204b-4be4-9086-2c189161a758 | Adonis-Stavridis/leetcode | cpp/5.longestPalindromicSubstring.cpp | #include <string>
#include <cstring>
using namespace std;
// class Solution
// {
// public:
// string longestPalindrome(string s)
// {
// }
// };
class Solution
{
public:
string longestPalindrome(string s)
{
int len = s.size();
if (len == 0 || len == 1)
return s;
int current = 0;
int... | ALGO | 0.999524 | 5.739444 |
553c3964-4b27-43a3-847b-9eee906dad6d | Leodicap99/leetcode | Dynamic Programming/1473. Paint House III.cpp | class Solution {
public:
int dp[101][21][101];
int help(int i,int l,int t,vector<int>& houses, vector<vector<int>>& cost, int m, int n, int target)
{
if(dp[i][l][t]!=-1)return dp[i][l][t];
if(t>target)return INT_MAX/2;
if(i==m)
{
if(target==t)return 0;
... | ALGO | 0.999984 | 5.949081 |
3a85bb19-6d6d-4ba6-b9dc-e709d252c03b | tupl/CPP-Playground | CPPCode-Playground/unique_path.cpp | // https://leetcode.com/problems/unique-paths/
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
using namespace std;
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> mat(m, vector<int>(n, 0));
mat[0][0] = 1;
for(int... | ALGO | 0.994074 | 6.362392 |
e8a1a6b1-7c14-409d-a3eb-13f80f7717e5 | hsondd/learn | CPP/std::move/move2.cpp | #include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <iomanip>
#include <utility>
#include <vector>
#include <string>
int main()
{
std::string str = "Salut";
std::vector<std::string> v;
v.push_back(str);
std::cout << "After copy, str is: " << quoted(str) << std::endl;
v.push_ba... | TOOL | 0.883079 | 3.587416 |
2bb70f8d-5fc0-4181-97a0-5db4131471f6 | prosteSebastian/bfskingdom | dorucovani1.cpp | #include <sstream>
#include <string>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <memory>
#include <cassert>
using namespace std;
class CDelivery
{
public:
// ctor
// dtor... | ALGO | 0.998203 | 5.538394 |
447a0a7e-6d65-4f57-99b8-c66308c57b80 | learningbeam/cpp | dp/memoization.cpp | class Solution {
public:
int solve(vector<vector<int>>& grid,int x,int y, int m, int n, vector<vector<int>>&dp){
if(x<0 || x>=m || y<0 || y>=n) return 10000;
if(x == m-1 && y==n-1) return grid[x][y];
if(dp[x][y] != -1) return dp[x][y];
return dp[x][y] = grid[x][y] + min(solve(grid,x+... | ALGO | 0.999997 | 6.007999 |
626f5704-cb8f-4ac3-bf31-d368c23df3df | jluissandovalm/lammps_smd | lib/smd/unsupported/doc/examples/MatrixSinh.cpp | #include <unsupported/Eigen/MatrixFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
MatrixXf A = MatrixXf::Random(3,3);
std::cout << "A = \n" << A << "\n\n";
MatrixXf sinhA = A.sinh();
std::cout << "sinh(A) = \n" << sinhA << "\n\n";
MatrixXf coshA = A.cosh();
std::cout << "cosh(A) = \n"... | ALGO | 0.991407 | 5.894121 |
2883c5d4-bea4-48dd-9857-184919bc7299 | ashokabairwaideology/Leet-code-problem | solution/0900-0999/0921.Minimum Add to Make Parentheses Valid/Solution.cpp | class Solution {
public:
int minAddToMakeValid(string s) {
string stk;
for (char c : s) {
if (c == ')' && stk.size() && stk.back() == '(')
stk.pop_back();
else
stk.push_back(c);
}
return stk.size();
}
}; | ALGO | 0.999697 | 6.386768 |
e45a390e-5a5d-442b-9bd8-6e7b8409104c | LingwuPro/SQL-Copilot | runner.cpp | #include <torch/script.h> // One-stop header.
#include <iostream>
#include <bits/stdc++.h>
#include <memory>
// using namespace std;
// std::ifstream fin("tokenizer_output.txt");
// std::ofstream fout("output.txt");
int main()
{
// Deserialize the ScriptModule from a file using torch::jit::load().
std::shared_p... | DATA | 0.989252 | 5.061264 |
3f27781c-474e-4ebb-a12e-00627a9d1273 | seclab-ucr/IncreLux | KLEE/z3/src/ast/rewriter/seq_skolem.cpp | #include "ast/rewriter/seq_skolem.h"
#include "ast/ast_pp.h"
using namespace seq;
skolem::skolem(ast_manager& m, th_rewriter& rw):
m(m),
m_rewrite(rw),
seq(m),
a(m) {
m_prefix = "seq.p.suffix";
m_suffix = "seq.s.prefix";
m_accept = "aut.accept";
m_tail ... | ALGO | 0.935278 | 5.306742 |
8c3999cb-e372-4879-8a94-3c13d17afd5a | trinhminhtriet/leetcode | solutions/1700-1799/1788.maximize-the-beauty-of-the-garden/Solution.cpp | class Solution {
public:
int maximumBeauty(vector<int>& flowers) {
int n = flowers.size();
vector<int> s(n + 1);
unordered_map<int, int> d;
int ans = INT_MIN;
for (int i = 0; i < n; ++i) {
int v = flowers[i];
if (d.count(v)) {
ans = max... | ALGO | 0.999955 | 5.923503 |
c32538c3-3170-483f-ab65-c3f2eb14c0f5 | metanoia1989/cppStudy | C++高级编程/chapter18/ModifyingAlgorithms/copy_backward.cpp | #include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
// 复制算法 copy_backward() 将源范围的元素反向复制到目标范围。从目标范围的最后位置开始修改
// Function template to populate a container of ints.
// The container must support push_back().
template<typename Container>
void populateContainer(Container& cont)
{
int num;
w... | ALGO | 0.997369 | 4.349669 |
c1a47e89-f9b7-4a40-bec8-9d7ba292887c | JoSangYeon/JSY_in_KMUCS | KMU_Algorithm/알고랩/C++/동전교환하기(교환가지수).cpp | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int calc(int n, int m, vector<int> v)
{
vector<vector<int>> dp(m + 1, vector<int> (n + 1, 0));
dp[0][0] = 1;
for (int i = 1; i < m+1; i++)
{
int c = v[i - 1];
for (int j = 0; j < n + 1; j++)
{
if (j < c)
... | ALGO | 0.999966 | 3.784562 |
5b1c53c0-2bec-416c-8d85-8195a5dd65f9 | JuhoLahdeniemi/VrProjekti | Library/PackageCache/com.unity.ide.visualstudio@2.0.16/Editor/COMIntegration/COMIntegration~/COMIntegration.cpp | #include <iostream>
#include <sstream>
#include <string>
#include <filesystem>
#include <windows.h>
#include <shlwapi.h>
#include <fcntl.h>
#include <io.h>
#include "BStrHolder.h"
#include "ComPtr.h"
#include "dte80a.tlh"
constexpr int RETRY_INTERVAL_MS = 150;
constexpr int TIMEOUT_MS = 10000;
// Often a DTE call m... | TOOL | 0.955793 | 6.937841 |
89144b39-368a-493d-aa86-b956b18efadd | sarvex/leetcode-checked-c | solution/2100-2199/2196.Create Binary Tree From Descriptions/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.99992 | 6.832874 |
f74a2932-67e0-434b-a6b8-1790a441b57c | Anubhav12345678/competitive-programming | srchngarradjcntdiffK.cpp | // C++ program to search an element in an array
// where difference between all elements is 1
#include<bits/stdc++.h>
using namespace std;
// x is the element to be searched in arr[0..n-1]
// such that all elements differ by at-most k.
int search(int arr[], int n, int x, int k)
{
// Travers the given array st... | ALGO | 0.999927 | 4.764237 |
3f529b85-64ea-4861-8e34-490010c80ba0 | alreadySagor/XPSC-Batch-4 | Week_5/Day_1/C_Closest_to_the_Right.cpp | /**
* author: SAGOR AHMED
* created: A P R I L , 2024
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
while (k--) {
... | ALGO | 0.999977 | 4.899718 |
3ac953ca-2b7e-4ecb-b7cc-582b8da14d63 | PagalavanPagal66/Leetcode_Solutions | 0289-game-of-life/0289-game-of-life.cpp | class Solution {
public:
int cal(vector<vector<int>>board,int i,int j)
{
int n=board.size(),m=board[0].size();
int sum=0;
if(i>0) sum+=board[i-1][j];
if(i<n-1) sum+=board[i+1][j];
if(j>0) sum+=board[i][j-1];
if(j<m-1) sum+=board[i][j+1];
if(i>0 && j>0) su... | ALGO | 0.999987 | 6.37106 |
64eb3120-7b70-4f57-b8a1-06a86229840b | n1ckfg/latk_ml_003 | SynDraw/SynDraw/libigl/include/igl/lscm.cpp | #include "vector_area_matrix.h"
#include "cotmatrix.h"
#include "repdiag.h"
#include "min_quad_with_fixed.h"
#include <iostream>
IGL_INLINE bool igl::lscm(
const Eigen::MatrixXd& V,
const Eigen::MatrixXi& F,
const Eigen::VectorXi& b,
const Eigen::MatrixXd& bc,
Eigen::MatrixXd & V_uv,
Eigen::SparseMatrix<do... | ALGO | 0.997253 | 5.901941 |
e85e23c7-4174-47fb-9c3c-7bcf8aff2c55 | atanmarko/ncnn-with-cuda | src/layer/arm/lrn_arm.cpp | #include "lrn_arm.h"
#include <math.h>
#if __ARM_NEON
#include "neon_mathfun.h"
#include <arm_neon.h>
#endif // __ARM_NEON
namespace ncnn {
int LRN_arm::forward_inplace(Mat& bottom_top_blob, const Option& opt) const
{
int w = bottom_top_blob.w;
int h = bottom_top_blob.h;
int channels = bottom_top_blob.... | ALGO | 0.996819 | 6.260041 |
324e38fc-b7d9-4954-9e87-70eaaa9e8b62 | alizul01/road-to-gemasweet | src/2021/laserironman/Main.cpp | #include <iostream>
using namespace std;
bool isIntersecting(int ironmanPos[], int ultronPos[], int obs1[], int obs2[]) {
double denominator = ((ironmanPos[0] - ultronPos[0]) * (obs1[1] - obs2[1]))
- ((ironmanPos[1] - ultronPos[1]) * (obs1[0] - obs2[0]));
if (denominator == 0)
return false;... | ALGO | 0.997863 | 4.566456 |
72bef5f1-4ace-4102-b430-b0426b7d9128 | mrmanago/coding_challenges | LeetCode/minimum_path_sum.cpp | #include <bits/stdc++.h>
using namespace std;
int minPathSum(vector<vector<int>>& grid);
int main()
{
vector<vector<int>> twoDimVector =
{
{1, 3, 1},
{1, 5, 1},
{4, 2, 1}
};
cout << minPathSum(twoDimVector);
return 0;
}
int minPathSum(vector<vector<int>>& grid) {
if (... | ALGO | 0.999886 | 5.802975 |
eeddb150-1904-4893-8bb4-ba07b2dc5a2d | ehadzic/Tehnike-programiranja | T3/Z4/main.cpp | /* TP 2016/2017: Tutorijal 3, Zadatak 4
Autotestove pisao Haris Hasic. Sva pitanja
sugestije i prijave gresaka mozete slati na
mail: <EMAIL>
*/
#include <iostream>
#include <deque>
typedef std::deque<int> vektor;
using std::cout;
using std::cin;
bool Parnost (int n){
if(!n) return true;
int suma=0;
if(n<... | ALGO | 0.998877 | 4.340991 |
63eca836-28f1-40a5-8d8f-505c6050a24d | DIMPLESINGHVI/PracticeProblems | check_circularLL.cpp | #include <iostream>
using namespace std;
class Node
{
public:
int data;
Node* next;
Node(int data)
{
this->data = data;
this->next = NULL;
}
~Node()
{
int val = data;
if(this->next!=NULL)
{
delete next;
next ... | ALGO | 0.999701 | 4.40178 |
08c43aa8-cb5f-4ab2-87c8-84a29c63a4f2 | csl-iisc/SUV-MICRO24 | llvm/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/ranges.replace_if.pass.cpp | // <algorithm>
// UNSUPPORTED: c++03, c++11, c++14, c++17
// UNSUPPORTED: libcpp-has-no-incomplete-ranges
// template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity,
// indirect_unary_predicate<projected<I, Proj>> Pred>
// requires indirectly_writable<I, const T&>
// constexpr I rang... | TEST | 0.948905 | 7.670462 |
9077521a-f004-4d5f-b606-bd8e94ff43f4 | ML-UCV/ML-CodeBert-DistinctSolutions | Raw Dataset/apm/kruskal/test/befb7970-7a02-40fe-bc4f-e7d243bc4822.cpp | #include <bits/stdc++.h>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
struct edge {
int x, y, cost;
bool operator <(const edge &other) {
return cost < other.cost;
}
};
const int Dim = 4e5 + 5;
int tata[Dim], w[Dim];
int n, m, costTotal;
edge e[Dim];
vector <pair <i... | ALGO | 0.999963 | 4.290014 |
030b356d-5b00-4106-a1c1-a428ef9d9fa3 | npatolia/Indv-Soft-Dev-in-C | Milestone3/MyCode/SimpleAIPlayer.cpp | #include <fstream>
#include <assert.h>
#include <utility>
#include <iostream>
#include "SimpleAIPlayer.h"
using namespace std;
// Preconditions: res points to a BestMove object, which may have 0 for
// its current bestMove. Any value V such that V <= min or V >= max is
// "uninteresting" to the caller. Level is alw... | ALGO | 0.999407 | 5.841885 |
a34b193c-d22a-40e7-9e6f-d39105a77475 | riptideiv/USACO-Algorithms | Knapsack/problems/talent_show/talent.cpp | #include <cstring>
#include <iostream>
using namespace std;
int n, W;
int w[251], t[251];
int dp[251][1001];
int main() {
memset(dp, 0x7f, sizeof(dp));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> t[i];
}
return 0;... | ALGO | 0.999862 | 4.09018 |
83225a22-d987-4d75-8f53-2c62a1188593 | eduschadesoares/estruturaDeDados | Outros/Pilha/pilha_dinamica.cpp | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <ctime>
#include <clocale>
#include <unistd.h>
using namespace std;
struct no {
int dado;
struct no *prox;
};
struct no *topo = NULL;
void pushMenu();
void push(int valor) {
struct no *aux;
aux = new(s... | TOOL | 0.980822 | 3.539553 |
ce8b9c79-b0b1-4792-a912-279fbeef4af1 | alexandraback/datacollection | solutions_5686275109552128_1/C++/yanaz/main.cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
int a[100005],b[100005];
vector<int >g;
int cmp(int a,int b)
{
return a>b;
}
int main()
{
//freopen("B-large.in","r",stdin);
//freopen("out.txt","w",stdout);
int i,j,n,m,t,N=0;
scanf("%d",... | ALGO | 0.999864 | 3.38134 |
f420f30f-cb2a-4414-9daa-2dd56d051427 | peer-open-source/xara | SRC/system_of_eqn/linearSOE/pardiso/PARDISOGenLinSOE.cpp | // Written: M. Salehi <EMAIL>
// website : http://opensees.net
// Created: 02/19
// Revision: A
#include <PARDISOGenLinSOE.h>
#include <PARDISOGenLinSolver.h>
#include <Matrix.h>
#include <Graph.h>
#include <Vertex.h>
#include <VertexIter.h>
#include <math.h>
#include <stdlib.h>
#include <Channel.h>
#include <FEM_Ob... | ALGO | 0.984012 | 3.502593 |
2f6e2c37-6b3b-4de0-8638-93aa85ee068e | BenjaminLattanzio/College-Project-Portfolio | hw3/Source.cpp | #include <iostream>
#include <map>
#include <fstream>
#include <algorithm>
#include <string>
#include <sstream>
using namespace std;
int main()
{
ifstream file;
string myLine;
file.open("input.txt"); //opening file named input.txt
if (file.fail())
{
cout << "Failed to open the input file" << endl;
... | TOOL | 0.994593 | 4.350173 |
6c55475c-8539-4944-b5fb-5fc10b4974d5 | nirvana369/UVA-problem-solved | 541.cpp | /*
Hoang Linh
Problem: ERROR CORRECTION - 541 (541.*)
*/
#include <cstdlib>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <map>
#include <iostream>
#define fi... | ALGO | 0.998466 | 3.262401 |
e477735b-532f-40a4-b4c4-1413bac37656 | vinci-grape/Rectifier | output/ChatGPT/avatar/Java/C++/codeforces_637_A.cpp | #include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ara(n);
unordered_map<int, int> map;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
ara[i] = v;
if (map.find(v) == map.end()) {
... | ALGO | 0.999973 | 4.749618 |
ff648416-6b79-4777-8020-aeb5b378c7b7 | ssolo/ALE | src/traceback_scaled.cpp | #include "exODT.h"
using namespace std;
using namespace bpp;
//The current lowmem=true method uses sample(true) cf. sample.cpp.
//The general structure of the calculation, and lot of the code, is the same as p(ale) cf. model.cpp.
pair<string,scalar_type> exODT_model::p_MLRec(approx_posterior *ale, bool lowmem)
{
a... | ALGO | 0.999796 | 3.433773 |
22cdb067-1f73-44a3-ba73-d987d117bcc1 | Suresh-Dub/CPP-LAB_COM-411 | Exp-11/b.cpp | //• To delete course records using files.
#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
struct CourseRecord {
string name;
string code;
string instructor;
string startDate;
string endDate;
};
vector<CourseRe... | TOOL | 0.913315 | 5.818922 |
0e512daa-4b90-4c8b-b742-4c8777b391dc | saurabh-sk/Udacity-SDC-ND | 07 Highway Driving/src/Eigen-3.3/test/visitor.cpp | #include "main.h"
template<typename MatrixType> void matrixVisitor(const MatrixType& p)
{
typedef typename MatrixType::Scalar Scalar;
typedef typename MatrixType::Index Index;
Index rows = p.rows();
Index cols = p.cols();
// construct a random matrix where all coefficients are different
MatrixType m;
m... | TEST | 0.872494 | 6.156642 |
fa10a1c3-fc23-472b-89e9-bd2dba3c660c | Arpit455/LeetCode-Daily-Problems | 2025/AUG/Power of Two.cpp | class Solution {
public:
bool isPowerOfTwo(int n) {
if(n<=0)
return false;
int x=ceil((double)log2(n));
return pow(2,x)==n;
}
}; | ALGO | 0.999176 | 6.172269 |
df006939-16fa-4fed-aacd-ebdbec01ddd1 | yhw-yhw/MOVER | thirdparty/scene_initialization/Manifold/3rd/igl/n_polyvector.cpp | #include "LinSpaced.h"
#include "n_polyvector.h"
#include "edge_topology.h"
#include "local_basis.h"
#include "nchoosek.h"
#include "slice.h"
#include "polyroots.h"
#include "igl_inline.h"
#include <Eigen/Sparse>
#include <Eigen/Geometry>
#include <iostream>
#include <complex>
namespace igl {
template <typename Der... | ALGO | 0.998953 | 5.044185 |
7a114aa5-7287-45c3-89b0-f458c5901cb5 | mariospapa90/UE4-HW-4.18 | Engine/Source/Runtime/Navmesh/Private/DetourTileCache/DetourTileCache.cpp | #include "DetourTileCache/DetourTileCache.h"
#include "DetourTileCache/DetourTileCacheBuilder.h"
#include "Detour/DetourNavMeshBuilder.h"
#include "Detour/DetourNavMesh.h"
#include "Detour/DetourCommon.h"
#include "Detour/DetourAssert.h"
/// Region partitioning methods
/// @see rcConfig
enum dtRegionPartitioning
{
DT... | ALGO | 0.969492 | 5.488471 |
ef823a39-0e3b-4a86-9341-47944752de13 | ishandutta2007/codeforces | shino16/normal/1574/B.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int t, as[3], m, n;
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d%d%d%d", as, as + 1, as + 2, &m);
sort(as, as + 3);
auto [c, b, a] = as;
n = a + b + c;
int hi = a - 1 + ... | ALGO | 0.999965 | 4.089718 |
95a96d35-537f-425e-864e-ee6efe3f9521 | abhishekmittal15/Competitive-Programming- | atcoder/abc/abc173/c/sol.cpp | #include<iostream>
#include<vector>
using namespace std;
#define int long long int
ostream& operator<<(ostream& os,const vector<int>& a ){
for (int i = 0; i < a.size();i++)
os << a[i];
os << endl;
return os;
}
int power(int a,int b){
int ans = 1;
for (int i = 0;i<b;i++)
ans = ans * ... | ALGO | 0.999716 | 4.09084 |
cf43e562-01ef-45a2-9aa0-f6e277f41a34 | TeamOctOS/android_frameworks_av | media/libstagefright/codecs/m4v_h263/dec/SoftMPEG4.cpp | //#define LOG_NDEBUG 0
#define LOG_TAG "SoftMPEG4"
#include <utils/Log.h>
#include "SoftMPEG4.h"
#include <media/stagefright/foundation/ADebug.h>
#include <media/stagefright/foundation/AUtils.h>
#include <media/stagefright/MediaDefs.h>
#include <media/stagefright/MediaErrors.h>
#include <media/IOMX.h>
#include "mp4d... | TOOL | 0.853233 | 5.63415 |
607bd690-9d5e-42aa-8adc-763138f6e285 | afrenoy/experimentalaevol | src/post_treatments/population_statistics.cpp | // =================================================================
// Libraries
// =================================================================
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <err.h>
#include <errno.h>
#include <sys/stat.h>
// ===================... | ALGO | 0.976727 | 6.837563 |
1392f597-d999-4d34-8a5a-789840756582 | byam/algorithms | atcoder/contest/abc/contest/abc227/4.cpp | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
//#include <atcoder/all>
// using namespace atcoder;
using namespace std;
// func
#define rep(i, first, last) for (int i = (first); i < (last); i++)
#define rrep(i, last, first) for (int i = (last); i >= (fi... | ALGO | 0.999704 | 3.691845 |
6f8849b6-cf98-421b-b9df-54735a749486 | KeiKeiZuihaoYa/Git-repository | vsc-c++/oj/hdu/2069.cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> ask;
int maxx, dp[500][120], ans[500];
int type[5] = {1, 5, 10, 25, 50};
signed main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int tmp;
while (cin >> tmp)
{
ask.push_back(tmp);
maxx = max(maxx, tmp);
}
dp[0][... | ALGO | 0.999464 | 4.059906 |
9bf867b7-700d-4b72-a929-47c98e56f5d8 | harshpatel-22/CPP | 11. Arrays & Questions/swapAlternate.cpp | #include <iostream>
using namespace std;
void printArray(int a[],int size){
// Printing the array
for (int i = 0; i < size; i++)
{
cout << a[i] << " ";
}
}
void swapAlternate(int a[], int size)
{
for (int i = 0; i < size; i += 2)
{
if (i + 1 < size)
{
swap(a... | ALGO | 0.999154 | 4.871226 |
d3c8efaf-9f18-4a0a-9a65-6e2e12862d5e | suho-han/23-1-Data-Structure | Final Examples/BinaryTree.cpp | #include "BinaryTree.h"
#include <iostream>
using namespace std;
int main() {
string name = "Suho Han";
int number = 20192650;
cout << number << " " << name << endl;
typedef BinaryTree <char> charTree;
typedef charTree* charTreePtr;
charTreePtr bt1(new charTree);
bt1->insert('D');
charTreePtr bt2(new char... | ALGO | 0.983719 | 3.687125 |
b0e1b2a5-fdd5-463c-a5b1-0c1207e7e132 | darklinden/StringDecode | StringDecode/StringDecode/UniversalDetector/universalchardet/CharDistribution.cpp | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
#include "CharDistribution.h"
#include "JISFreq.tab"
#include "Big5Freq.tab"
#include "EUCKRFreq.tab"
#include "EUCTWFreq.tab"
#include "GB2312Freq.tab"
#define SURE_YES 0.99f
#define SURE_NO 0.01f
#define MINIMUM_DATA_THRESHOLD 4
//... | ALGO | 0.968872 | 5.874213 |
310371a0-a15b-496c-9d13-324912b3b362 | metehkaya/Algo-Archive | Problems/LeetCode/Solutions/1943.Describe_the_Painting.cpp | typedef long long LL;
class Solution {
public:
static const int maxs = 100001;
LL add[maxs];
int open[maxs];
int close[maxs];
vector<vector<LL>> splitPainting(vector<vector<int>>& ar) {
int n = ar.size();
for( int i = 0 ; i < n ; i++ ) {
open[ar[i][0]]++;
clo... | ALGO | 0.999582 | 4.691611 |
0f71f5ad-b857-4668-aa59-e1761da89d4a | liju000/currency-converter-application | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.9988 | 6.76073 |
a6b0acd9-d0af-409e-9ba3-f5e9946d9940 | patty-13/DSA_Coding | GRAPHS/DFS_GRAPH.CPP | #include "bits/stdc++.h"
using namespace std;
vector<bool> visited;
void dfs(vector<int> adj[], int node)
{
visited[node] = true;
for(auto next_node : adj[node])
{
if(visited[next_node] == true){continue;}
dfs(adj,next_node);
}
}
int main()
{
int m,n; cin>>n>>m;
vector... | ALGO | 0.999966 | 4.087986 |
e94b25df-5162-4a38-9410-8e3c180959a8 | ericyem/CodingPractice | CodeForces/116A.cpp | #include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::va... | ALGO | 0.999908 | 4.100922 |
958d4a3b-e4f4-47fe-8cd2-93a28a1971c5 | axe-el/Uva-problems | 12798/12798.cpp | /*
12798
VAMOS LEYENDO LOS DATOS EN CADA RENGLON TODOS LOS NUMEROS (GOLES) DE ESE JUGADOR DEBEN SER MAYOR A 0
SI UNO ES 0, YA NO SE AGREGA AL RESULTADO FINAL
*/
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,x;
while( cin >> n >> m ){
int count =0;
... | ALGO | 0.999436 | 3.313853 |
ed23a9dc-f870-46ec-9b58-ea9c209241bd | raincross7/code-similarity | codes/train_code/problem184/problem184_109.cpp | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
#define all(x) (x).begin(),(x).end()
#define re... | ALGO | 0.999935 | 3.186086 |
f3106740-5657-4823-94bd-562e63afa019 | FreeAndFair/evoting-systems | EVTs/VoteHere/VHTi-1.0.0.72/src/vhti/tabulation/shuffle_internal.cpp | /* */
/* This material is subject to the VoteHere Source Code Evaluation */
/* material indicates your acceptance of this Agreement in its entirety. */
/* Copies of the Agreement may be found at www.votehere.net. */
/* */
/* */
/* You may not download this Software if you are located in any country */
/* (or are a... | ALGO | 0.999425 | 7.384488 |
760aea52-baf2-41f3-948a-996ba3d68253 | officefish/HackerRankChallenges | HackerRankChallenges/Arrays/SocksMerchantChallenge.cpp | /*
Hackerrank::Chalenges::SockMerchant
description: https://www.hackerrank.com/challenges/sock-merchant
There is a large pile of socks that must be paired by color.
Given an array of integers representing the color of each sock,
determine how many pairs of socks with matching colors there are.
Example:
n = 7; ar = ... | ALGO | 0.999906 | 5.727412 |
a35b505c-f179-4a1a-9702-76d5441bb1c3 | giuseppeambrosio97/competitive_programming | cpp/codeforces/problemset/112A.cpp | #include <bits/stdc++.h>
using namespace std;
int isMaiusc(char ch)
{
return (ch >= 65 && ch <= 90) ? true : false;
}
int compare(char *s1, char *s2)
{
for (int i = 0; i < strlen(s1); i++)
{
if (isMaiusc(s1[i]))
{
s1[i] += 32;
}
if (isMaiusc(s2[i]))
{
... | ALGO | 0.999979 | 3.55084 |
cfe76ce9-30ab-4002-ba5c-e673c0b8ec91 | tanjummotin/Competitive-Programming | CODE BOOK/KMP/2.Text e pattern ta koto koto index e ache.cpp | ///in the name of ALLAH
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll>createTempArray(string pattern)
{
vector<ll>lps(pattern.size());
int index=0;
for(int i=1;i<pattern.size();)
{
if(pattern[index]==pattern[i])
{
lps[i]=index+1;
ind... | ALGO | 0.999642 | 4.353543 |
8884caee-0b3c-4c7f-b886-e547c706132d | kaho0/CPP | 2DArraays/spiral.cpp | #include<iostream>
using namespace std;
void spiral(int matrix[][4],int n,int m)
{
int srow=0,scol=0;
int erow =n-1,ecol=m-1;
while(srow<=erow && scol<=ecol){
//top
for(int j=scol;j<=ecol;j++)
{
cout<<matrix[srow][j]<<" ";
}
//right
for(int i=srow+1;i<=erow;i++)
{
cout<<matrix[i][ecol]<<" ";
}
//botto... | ALGO | 0.999943 | 3.384954 |
f616c196-951b-4021-bbde-b36b8ce9a466 | Astha86/CP-31_Sheet | 800 Rated Questions/A_Ambitious_Kid.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> v(n);
for(int i=0; i<n; i++){
cin>>v[i];
if(v[i]<0) v[i] = abs(v[i]);
}
sort(v.begin(),v.end());
cout<<v[0];
}
| ALGO | 0.999982 | 4.053832 |
12c5c96e-96b3-4e33-bef3-5bff8c4372c3 | sarvex/leetcode-harbour | solution/2000-2099/2017.Grid Game/Solution.cpp | using ll = long long;
class Solution {
public:
long long gridGame(vector<vector<int>>& grid) {
ll ans = LONG_MAX;
int n = grid[0].size();
ll s1 = 0, s2 = 0;
for (int& v : grid[0]) s1 += v;
for (int j = 0; j < n; ++j) {
s1 -= grid[0][j];
ans = min(ans,... | ALGO | 0.999985 | 5.543633 |
ede6ba91-3bdb-4f36-a419-47093945c902 | mostafa-cse/Most-Used-Templates-from-Various-Sources | Dynamic Programming Optimizations/Subset Sum in SQRT.cpp | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
// if sum of the array values = x, then complexity is O(x sqrt(x))
// returns the subset ids
vector<int> subset_sum(vector<int> a, int s) {
vector<int> cnt(s + 1, 0), dp(s + 1, 0), last(s + 1, 0);
map<int, vector<int>> id;
for (int i = 0; i < a... | ALGO | 0.999954 | 3.659798 |
a8bf52d3-641d-42df-98f4-ca656a9a3c31 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_8197_2.cpp | #include <bits/stdc++.h>
#pragma GCC optimize "Ofast"
#pragma GCC optimize "unroll-loops"
#pragma GCC target "sse,sse2,sse3,sse4,abm,avx,mmx,popcnt,tune=native"
char _;
using namespace std;
int n;
int a[1010];
long long ans;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = ... | ALGO | 0.999636 | 3.907725 |
3e3d5683-087a-43a0-9aef-965e0556af7d | KICube/PRACTICE | contest_01/17/main.cpp | #include <iostream>
#include <algorithm>
#include <vector>
long n;
long water{0};
int main() {
std::cin >> n;
std::vector<long> towers(n);
std::vector<long> first(n);
std::vector<long> secnd(n);
for (long i = 0; i < n; i += 1) {
std::cin >> towers[i];
}
first... | ALGO | 0.999969 | 5.092472 |
8bdce0d6-af9f-4779-ab41-6d1f6e2d8fa9 | fast01/chaosframework | chaos/common/configuration/GlobalConfiguration.cpp | #include <fstream>
#include <iostream>
#include <chaos/common/log/LogManager.h>
#include <boost/interprocess/sync/file_lock.hpp>
#include <boost/interprocess/sync/scoped_lock.hpp>
#include "GlobalConfiguration.h"
using namespace chaos;
namespace po = boost::program_options;
#define _RPC_PORT 8888
#define _DIREC... | CONFIG | 0.899644 | 3.803087 |
f57dbaea-3148-4ce4-ad29-11b0edd19ac0 | ishandutta2007/codeforces | xyz2606/normal/1358/A.cpp | #include<vector>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<algorithm>
#include<iostream>
#include<bitset>
#include<functional>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<random>
#include<ctime>
#include<complex>
using nam... | ALGO | 0.999933 | 4.287069 |
3c72e661-7758-4ef2-ba69-dcb8a5baafc4 | chachabai/cf | baiduStar2020/2A.cpp | #include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
using LL = long long;
int main() {
//freopen("in","r",stdin);
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int cas;
std::cin >> cas;
while (cas--) {
int n, m, p;
std::cin >> n >> m >> p;
int r = 0;
if (n... | ALGO | 0.999675 | 3.864936 |
8c3be59e-31d1-46ce-b796-3673da5a5dcf | ashpurple/Algorithm-Study | Programmers/Kakao/level3_합승 택시 요금.cpp | #include <string>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
const int INF = 1000000;
int matrix[201][201];
void printMatrix(int N){
for (int i = 1; i <= N; i++){
for (int j = 1; j <= N; j++){
cout << matrix[i][j]<<" ";
}
cout << "\n";
}
}
void Floyd(int N){
for (int k =... | ALGO | 0.999597 | 4.129965 |
fc4bc242-c904-48be-b7da-b4921c7db2d3 | Bungmint/competitiveprogramming | contest/codeforces/103643/K.cpp | using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpi = vector<pii>;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pll>;
using ld = long double;
template <typename T, size_t SZ>
using ar = array<T, SZ>;
template <typename T>
using pqg = priority_... | ALGO | 0.999864 | 3.343995 |
c58a9507-74ce-40ae-9583-2f2a1455ea91 | Capobmb/ICPC2024-capsasquad | B.cpp | #pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,fma,popcnt,bmi,bmi2")
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all> // ac-library #### CAREFUL on CodeForces
using namespace atcoder; // ac-library
std::ostream &operator<<(std::ostrea... | ALGO | 0.999955 | 4.798934 |
92b575d0-2ae7-4c65-91a5-bd4105309911 | siddiq-1018/6Companies30days | MicroSoft/10.SticklerThief.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// } Driver Code Ends
class Solution
{
public:
//Function to find the maximum money the thief can get.
int dp[10001];
int stickler(int arr[],int n){
if(n<=0){
return 0;
}
if(n==1){
... | ALGO | 0.999852 | 5.902899 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.