uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
9ee2a586-40aa-4f99-9277-9ee4f6085efe | AnikDas-Stack/Codeforces-Problem-Solution | 707A. Brain's Photos.cpp | #include <stdio.h>
#include <conio.h>
int main()
{
int n, m, flag=1;
scanf("%d %d", &n, &m);
char ara[n][m];
for(int i=0; i<n; i++)
{
for(int j=0; j<m; j++)
{
scanf("%s", &ara[i][j]);
}
}
for(int i=0; i<n; i++)
{
for(int j=0; j<m; j++)
... | ALGO | 0.998535 | 3.614446 |
34cf6e68-8f79-43bb-9d44-b1b125c8e41a | vigneshsnaik/leetcode-solutions | 0069-sqrtx/0069-sqrtx.cpp | // https://leetcode.com/problems/sqrtx
class Solution {
public:
int mySqrt(int x) {
if(x<=1) return x;
int high =x,low=1;
while (high>=low){
int mid=low+(high-low)/2;
if(mid>x/mid){
high=mid-1;
}
else if(mid<x/mid){
... | ALGO | 0.999993 | 5.764614 |
d66e8986-e7e0-47a0-a9ff-9f4ab4a27ce9 | Superm4n97/competetive-programming | Codeforces vol 03/1372D.cpp | #include <bits/stdc++.h>
#define pb push_back
#define ll long long int
#define scd(a) scanf("%d",&a)
#define mp(a,b) make_pair(a,b)
#define scl(w) scanf("%I64d",&w)
#define scdd(a,b) scanf("%d %d",&a,&b)
#define srt(a) sort(a.begin(),a.end())
#define rs... | ALGO | 0.999993 | 3.488292 |
f7739010-9185-49ec-97fb-15e99ba67b2c | PeizeLin/abacus-develop_ab_bak | source/module_hamilt_general/module_xc/xc_funct_exch_gga.cpp | // This file contains realizations of gradient correction to exchange part
// Spin unpolarized ones:
// 1. becke88 : Becke88 exchange
// 2. ggax : PW91 exchange
// 3. pbex : PBE exchange (and revPBE)
// 4. optx : OPTX, Handy et al.
// 5. wcx : Wu-Cohen exchange
// And some of their spin polarized counterparts:
// ... | ALGO | 0.99877 | 4.498914 |
4d3ab095-1ede-40e0-9419-253773062911 | mbazargani/pLAHC | src/main.cpp | #include <iostream>
#include <iomanip>
#include <fstream>
#include "Configuration.h"
#include "TSPLIB.h"
#include "LAHC.h"
#include "Util.h"
#include "Random.h"
#include "Statistic.h"
#include "pLAHC.h"
#include "pLAHC_s.h"
using namespace std;
Random RANDOM;
int main(int argc, char** argv) {
// process command l... | ALGO | 0.994724 | 4.720872 |
61499146-fd42-4ed5-8635-5b41f78c6f9c | sahilsingh2002/LeetCode-DSA | 1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one/number-of-steps-to-reduce-a-number-in-binary-representation-to-one.cpp | class Solution {
public:
int numSteps(string s) {
int size = s.size();
int makezero = size-1,car = 0;
for(int i=size-1;i>0;i--){
if(s[i]-'0'+car==1){
makezero++;
car=1;
}
}
return makezero+car;
}
}; | ALGO | 0.999969 | 5.72009 |
a6c0d056-d25c-4f24-ae2d-59fa0464180b | Sourav601/emojify | emojify-master/opencv-master/opencv-master/modules/stitching/src/util.cpp | #include "precomp.hpp"
namespace cv {
namespace detail {
void DisjointSets::createOneElemSets(int n)
{
rank_.assign(n, 0);
size.assign(n, 1);
parent.resize(n);
for (int i = 0; i < n; ++i)
parent[i] = i;
}
int DisjointSets::findSetByElem(int elem)
{
int set = elem;
while (set != parent... | ALGO | 0.998093 | 5.520399 |
90c15ed0-8169-4e6f-8e94-22ee45e89afc | nickfryganiotis/algorithms | Binary Search/portals.cpp | #include <iostream>
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
bool canBeSorted(int N,int M,int c[],vector<pair<int,pair<int,int>>> p,int index){
vector<int> adj[N];
bool vis[N];
for(int i=0; i<N; i++){ ... | ALGO | 0.999994 | 4.347152 |
d3b3537c-b03d-44b9-b484-642cd903e26f | Samarvivian/new-algorithm | countingsort.cpp | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int N=100010;
int a[N];
int n;
void countingsort()
{
//找到最大元素
int m=a[1];
for(int i=1;i<=n;i++)
{
m=max(m,a[i]);
}
vector<int>vec(m+1);
for(int i=1;i<=n;i++)
... | ALGO | 0.999979 | 4.307983 |
f395eebc-2eab-4c35-bd21-6319f44d8ac6 | Rudy451/cpp_primer | ex11.38.cpp | #include <iostream>
#include <set>
#include <map>
#include <unordered_map>
#include <string>
#include <vector>
#include <istream>
#include <fstream>
#include <sstream>
using std::cout; using std::endl; using std::set; using std::map; using std::unordered_map; using std::string; using std::vector; using std::istream; u... | TOOL | 0.950909 | 4.992558 |
c903ce2b-495e-447b-ade2-68743d7e647d | MuhammadAbbasi/DSA_Semester3 | LAB Project/opencv-3.4.3/samples/cpp/tutorial_code/features2D/feature_flann_matcher/SURF_FLANN_matching_Demo.cpp | #include <iostream>
#include "opencv2/core.hpp"
#ifdef HAVE_OPENCV_XFEATURES2D
#include "opencv2/highgui.hpp"
#include "opencv2/features2d.hpp"
#include "opencv2/xfeatures2d.hpp"
using namespace cv;
using namespace cv::xfeatures2d;
using std::cout;
using std::endl;
const char* keys =
"{ help h | ... | ALGO | 0.960726 | 5.701033 |
a874cb95-4d01-45b2-8275-fd181020a52a | juxiangwu/image-processing | cuda-projects/opencv-cuda/opencv-cuda-api/47-DescriptorMatcher/main.cpp | #include <iostream>
#include <opencv2/opencv.hpp>
#include <opencv2/cudaarithm.hpp>
#include <opencv2/cudabgsegm.hpp>
#include <opencv2/cudacodec.hpp>
#include <opencv2/cudafeatures2d.hpp>
#include <opencv2/cudafilters.hpp>
#include <opencv2/cudaimgproc.hpp>
#include <opencv2/cudalegacy.hpp>
#include <opencv2/cudaobjde... | ALGO | 0.983814 | 4.645304 |
4a581bd1-b4c3-4f92-b06f-85a8b5d97f2e | superQCman/Chiplet_Heterogeneous_newVersion_old | gpgpu-sim/src/intersim2/main.cpp | // $Id: main.cpp 5487 2013-02-27 08:16:18Z qtedq $
/*main.cpp
*
*The starting point of the network simulator
*-Include all network header files
*-initilize the network
*-initialize the traffic manager and set it to run
*
*
*/
#include <sys/time.h>
#include <string>
#include <cstdlib>
#include <iostream>
#incl... | TOOL | 0.878661 | 4.648768 |
b385fd0d-c495-4145-8fcc-4efea43e7d01 | iStarryTree/flutter_learn | official_document/navigation_routin/tabs_learn/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.997807 | 6.76073 |
7890a58e-411a-4863-8d84-60512e49d0b1 | ysj9909/FFNet | 3d_sem_segmentation/libs/pointops/src/interpolation/interpolation_cuda.cpp | #include <vector>
#include <torch/serialize/tensor.h>
#include <ATen/cuda/CUDAContext.h>
#include "interpolation_cuda_kernel.h"
void interpolation_forward_cuda(int n, int c, int k, at::Tensor input_tensor, at::Tensor idx_tensor, at::Tensor weight_tensor, at::Tensor output_tensor)
{
const float *input = input_tenso... | DATA | 0.871918 | 5.965815 |
e514da7f-b1a8-4382-92c0-b98024801da6 | sarvex/leetcode-bhai | solution/0900-0999/0977.Squares of a Sorted Array/Solution.cpp | class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
int n = nums.size();
vector<int> res(n);
for (int i = 0, j = n - 1, k = n - 1; i <= j;) {
if (nums[i] * nums[i] > nums[j] * nums[j]) {
res[k--] = nums[i] * nums[i];
++i;
... | ALGO | 0.999994 | 6.062663 |
e02326a7-d672-4627-bdb7-6a49974243b4 | liuq901/code | ZJ/zj_d_067.cpp | #include <cstdio>
#include <cstdlib>
int main()
{
int x;
scanf("%d",&x);
if (x%4==0 && x%100!=0 || x%400==0)
printf("a leap year\n");
else
printf("a normal year\n");
system("pause");
return(0);
}
| ALGO | 0.999712 | 3.064052 |
1c30b5bf-9ab0-4772-aea0-39f400e09e5b | hjiang13/LLMs-in-IR | POJ-104/70/682.cpp | #include <iostream>
using namespace std;
int main()
{
int n;
double x[50],y[50],*px,*py,*px2,*py2,temp,max;
cin >> "%d",&n);
for(px=x,py=y; px<x+n; px++,py++)
cin >> "%lf %lf",px,py);
max=0;
for(px=x,py=y; px<x+n; px++,py++)
for(px2=px+1,py2=py+1; px2<x+n&&py2<y+n; px2++,py2++)
{
temp=(*px-*px2)*(*px-*px2)+(*py-*py2)*(... | ALGO | 0.999762 | 3.399613 |
1e6acd78-4bca-4784-87aa-0c31a731452a | itsmesuraj20/Leetcode-Practice | 845-longest-mountain-in-array/845-longest-mountain-in-array.cpp | class Solution {
public:
int longestMountain(vector<int>& a) {
int count=1;
int result=0;
int n=a.size();
for(int i=1;i<n-1;i++){
if(a[i]>a[i-1]){
count++;
}else{
count=1;
}
if(a[i]>a[i-1]... | ALGO | 0.999969 | 5.451595 |
09980571-8511-445b-ba27-de082e7450df | HajimeHitoshiHideo/CompProgCodes | TallerCato1erSem2025/Intro/E.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, s, act, cnt = 0;
bool b = false;
cin >> n >> s;
vector<int> a(n);
act = a.size()/2;
for(int i = 0; i<n; i++)
{
cin >> a[i];
}
sort(a.begin(), a.end());
while(true)
{
if(a[act] > s && !b)
... | ALGO | 0.999925 | 3.246193 |
7e2e9cea-999f-4847-824f-ecb52ae58deb | raincross7/code-similarity | codes/train_code/problem370/problem370_72.cpp | #pragma region include
#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i,n,m) for(int i = (int)(n); i < int(m); i++)
#define MOD (int)(1... | ALGO | 0.999998 | 4.686571 |
b7885a13-75c4-4519-af16-1a93906282cd | ishandutta2007/codeforces | ivl/normal/507/E.cpp | #include <cstdio>
#include <vector>
#include <set>
#define x first
#define y second
using namespace std;
const int oo = 1000000000;
class edge{
public:
int x, y, z;
edge(int _x = 0, int _y = 0, int _z = 0) : x(_x), y(_y), z(_z){}
};
int n, m;
edge E[100005];
vector < int > veze[100005];
int back[... | ALGO | 0.999954 | 3.2578 |
86a67166-d0b1-40c1-9bb4-4c5680b68022 | zakaria-zoulati/CP-CodeForces | B. Game with Telephone Numbers/solution.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1 ;
while (t--) {
int n ; cin >> n ;
string s ; cin >> s ;
bool vasya = true ;
int moves = n - 11 ;
int e... | ALGO | 0.999967 | 5.39295 |
2730c285-54ac-43db-a9a1-84ccaa9504f6 | rytiskar/University-projects | Data-Structures/dynamic-array/array.cpp | #include <iostream>
constexpr int INITIAL_CAPACITY = 1;
class Vector
{
public:
// Constructors
Vector()
:
capacity(INITIAL_CAPACITY),
size(0)
{
arr = new int[capacity];
}
Vector(int capacity)
:
capacity(capacity),
size(0)
{
ar... | ALGO | 0.980934 | 6.170916 |
2e16dd2c-ef81-4c14-80f6-d97fd01583bf | Chandu71202/DREAMTEAM | LinkedLists/Printing LL in reverse.cpp | #include<iostream>
using namespace std;
struct Node
{
/* data */
int data;
struct Node* next;
};
struct Node* insert_end(struct Node* head,int data)
{
struct Node* temp=(struct Node*)malloc(sizeof(struct Node));
temp->data=data;
temp->next=NULL;
if(head==NULL)
{
head=temp;
... | ALGO | 0.999646 | 4.45572 |
e571270e-7299-42b7-b666-0404fb8af628 | kazzmir/rafkill | src/guns/gun_tractor_beam.cpp | #include "gunobj.h"
#include "gun_tractor_beam.h"
#include "trigtable.h"
#include "weapons/weapon_damage.h"
#include "hulls/hull_weapon_tractor_beam.h"
#include "spaceobj.h"
#include "ebox.h"
#include <vector>
#include <math.h>
using namespace std;
WeaponTractorBeam::WeaponTractorBeam( int z, int d, int al ):
WeaponO... | TOOL | 0.877469 | 4.365233 |
5c012803-89fa-4ba3-9b69-e5852ab967cd | iLuzj0/MuseumGuideAssistance | Include/Eigen/bench/benchGeometry.cpp | #include <iostream>
#include <iomanip>
#include <Eigen/Core>
#include <Eigen/Geometry>
#include <bench/BenchTimer.h>
using namespace Eigen;
using namespace std;
#ifndef REPEAT
#define REPEAT 1000000
#endif
enum func_opt
{
TV,
TMATV,
TMATVMAT,
};
template <class res, class arg1, class arg2, int opt>
stru... | TEST | 0.945951 | 6.062908 |
1849d0b3-9087-4a7f-930e-71cc03f8a6ca | edwinzhng/hackerrank-solutions | Algorithms/Recursion/recursive-digit-sum.cpp | #include <iostream>
#include <string>
using namespace std;
string super_digit(string p) {
long long sum = 0;
if(p.length() == 1) {
return p;
}
for(int i = 0; i < p.length(); i++) {
sum += p[i] - '0';
}
return super_digit(to_string(sum));
}
int main() {
string n;
int k;
... | ALGO | 0.999983 | 5.020962 |
c6458512-745a-4096-9b39-a942acdb3809 | Mr-Kondo/atcoder | abc/088_b.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main(){
int N;
cin >> N;
vector<int> A(N);
rep(i,N) cin >> A[i];
sort(A.begin(), A.end());
int Alice = 0; int Bob = 0;
rep(i,N){
if(i%2 == 0) Alice += A[i];
else Bob ... | ALGO | 0.999958 | 4.58747 |
1bf121c3-736f-449e-8318-62d8818a8cab | eklepitsch/amath583 | hw6/src/gradient-fftw.cpp | // k. j. roche
// simple C++ gradient computation to exhibit use of FFT on regularized lattice
// here I use FFTW and CUDA FFT (CUFFT)
#include <iostream>
#include <fstream>
#include <vector>
#include <complex>
#include <algorithm>
#include <iomanip> // Include the <iomanip> header for setprecision
// from the C stan... | ALGO | 0.99944 | 6.220296 |
779af4d9-eea3-4c98-a521-80907ef55312 | goldsail/Leetcode | Leetcode/Q29.cpp | #include <stdlib.h>
class Solution
{
public:
int divide(int dividend, int divisor)
{
if (divisor == 0)
return INT_MAX;
if (dividend == INT_MIN && divisor == -1)
return INT_MAX;
if (dividend == 0)
return 0;
bool isNegative = (dividend > 0) ^ (divisor > 0);
//
int a = (dividend > 0) ? dividend ... | ALGO | 0.999864 | 5.717872 |
e367b91e-403e-4820-84ee-eb13810194a9 | alexandraback/datacollection | solutions_5630113748090880_0/C++/Kavarenshko/problem.cpp | #include <bits/stdc++.h>
#define FOR(i, n) for(int i=0; i < n; i++)
#define FOR1(i, n) for(int i=1; i <= n; i++)
using namespace std;
constexpr int INF = 0x7fffffff;
constexpr int LIMIT = 2501;
typedef long long ll; // –9,223,372,036,854,775,808 to 9,223,372,036,854,775,807 (19 digits)
typedef unsigned l... | ALGO | 0.998656 | 3.945459 |
50e38ab0-b70c-4f26-a5dd-b778e2e7a182 | ishandutta2007/codeforces | njwrz/normal/1133/E.cpp | #include <bits/stdc++.h>
using namespace std;
namespace io {
#define in(a) a=read()
#define out(a) write(a),putchar(' ')
#define outn(a) out(a),putchar('\n')
#define I_int int
inline I_int read() {
I_int x = 0 , f = 1 ; char c = getchar() ;
while( c < '0' || c > '9' ) { if( c == '-... | ALGO | 0.999981 | 3.856745 |
9a5666b4-f624-4b19-a68c-daf22b66cb30 | believe-that-23/random-practise | B_Permutation_Sort.cpp | #include <bits/stdc++.h>
#include <cmath>
#include <regex>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ll long long
#define all(x) (x).begin(),(x).end()
#define vll vector<long long int>
#define FAST ios_base :: sync_with_stdio (false); cin.tie (NULL)
using namespace std;
#defin... | ALGO | 0.999891 | 4.222393 |
9f8eaf1e-60ea-462c-9b4a-8999dadf8426 | LAsurvivor/my-leetcode-solutions | All/0720.词典中最长的单词/0720-词典中最长的单词.cpp | class Solution {
public:
string longestWord(vector<string>& words) {
sort(words.begin(), words.end(), [](const string& a, const string& b){
if(a.size() != b.size()){
return a.size() < b.size();
} else {
return a > b;
}
});
... | ALGO | 0.99995 | 5.820867 |
22539cce-1034-478b-8ec0-0797e3fdbffa | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_9700_8.cpp | #include <bits/stdc++.h>
using namespace std;
int a[120], n, k, p, v[120], mx = -1, mn = 2000000000;
int main(int argc, char *argv[]) {
scanf("%d%d", &n, &k);
p = n / k;
do {
memset(v, 0, sizeof(v));
} while (0);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
int m;
scanf("%d", &m);
while... | ALGO | 0.999882 | 3.850239 |
58435766-082a-4739-bd49-d04c8d32d5c1 | osjayaprakash/machine-translation | irstlm/src/ngt.cpp | // $Id: ngt.cpp 245 2009-04-02 14:05:40Z fabio_brugnara $
using namespace std;
#include <cmath>
#include "mfstream.h"
#include "mempool.h"
#include "htable.h"
#include "dictionary.h"
#include "n_gram.h"
#include "ngramtable.h"
#include "cmd.h"
#define YES 1
#define NO 0
#define END_ENUM { (char*)0, 0 }
... | ALGO | 0.900548 | 5.641755 |
0149b397-862e-4718-a8b9-9a19bcfac8e3 | 01fe23bcs120/Bussiness-Cases.github.io | Medical_Resource.cpp | #include <iostream>
#include <vector>
using namespace std;
// Function to heapify a subtree rooted at index i
void heapify(vector<pair<int, string>> &patients, int n, int i) {
int largest = i; // Initialize largest as root
int left = 2 * i + 1; // Left child
int right = 2 * i + 2; // Right child
// Ch... | ALGO | 0.999991 | 6.272596 |
b1ae3edf-4f50-448f-941e-2d4a3fd4c29b | Fisher87/leetcode | cplus/design-sql.cpp | // Time: ctor: O(t * max_m), t is the number of tables, max_m is the max number of columns in all tables
// insertRow: O(m), m is the number of columns
// deleteRow: O(1)
// selectCell: O(m)
// Space: O(d), d is the total size of data
// hash table
class SQL {
public:
SQL(vector<strin... | TOOL | 0.864361 | 6.843204 |
f5783d6b-6df2-4c35-be56-5f4eba0db486 | mhaberler/eigen | bench/sparse_product.cpp |
//g++ -O3 -g0 -DNDEBUG sparse_product.cpp -I.. -I/home/gael/Coding/LinearAlgebra/mtl4/ -DDENSITY=0.005 -DSIZE=10000 && ./a.out
//g++ -O3 -g0 -DNDEBUG sparse_product.cpp -I.. -I/home/gael/Coding/LinearAlgebra/mtl4/ -DDENSITY=0.05 -DSIZE=2000 && ./a.out
// -DNOGMM -DNOMTL -DCSPARSE
// -I /home/gael/Coding/LinearAlgebr... | ALGO | 0.995754 | 4.164869 |
b5a1ca4c-bf63-47d7-be7d-fd0784374b4e | ANUJ0MUNJAL/LeetCode-POTD | 145-binary-tree-postorder-traversal/binary-tree-postorder-traversal.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.999793 | 5.924144 |
4d6d0472-87cb-4734-9638-060115ddf68b | nobinov/image_resizer_server | include/boost_1_75_0/libs/multiprecision/example/gmp_snips.cpp | #include <boost/multiprecision/gmp.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <iostream>
void t1()
{
//[mpz_eg
//=#include <boost/multiprecision/gmp.hpp>
//=#include <iostream>
//=
//=int main()
//={
using namespace boost::multiprecision;
mpz_int v = 1;
// Do some arithmetic:
for(... | TOOL | 0.988856 | 4.264435 |
c37fd3c4-9bbd-41cc-82f3-c8a09f03c171 | zhm/node-spatialite | src/spatialite/deps/geos/geos/src/noding/MCIndexSegmentSetMutualIntersector.cpp | #include <geos/noding/MCIndexSegmentSetMutualIntersector.h>
#include <geos/noding/SegmentSetMutualIntersector.h>
#include <geos/noding/SegmentString.h>
#include <geos/noding/SegmentIntersector.h>
#include <geos/index/SpatialIndex.h>
#include <geos/index/chain/MonotoneChain.h>
#include <geos/index/chain/MonotoneChainBui... | ALGO | 0.991876 | 5.273971 |
cb3c04db-b258-487e-b543-217ad38ceac2 | Vidit-Ostwal-zz/DSA-Codes | 52-n-queens-ii/52-n-queens-ii.cpp | class Solution {
string get_temp(int index, int n)
{
string temp="";
for (int i = 0; i < n; i++)
{
if (i != index)
{
temp+='.';
}
else
{
temp+='Q';
}
}
return temp;
}
vector<vector<bool>> make_path(int n)
{
vector<boo... | ALGO | 0.999762 | 5.580441 |
d13d692a-4972-41b4-ac24-8a8c49d63b83 | Sowmya-257/Leetcode | 812-rotate-string/rotate-string.cpp | class Solution {
public:
bool rotateString(string s, string goal) {
if (s.size() != goal.size()) return false;
string doubled = s + s;
return doubled.find(goal) != string::npos;
}
};
| ALGO | 0.999965 | 6.018789 |
6dbaff11-1136-49ec-a011-86b1d334048b | xTecna/solucoes-da-beecrowd | problemas/iniciante/1004/1004.cpp | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << "PROD = " << A * B << endl;
return 0;
} | ALGO | 0.999364 | 4.500658 |
c69cb120-152a-49d1-946f-3c5fa2e88d7c | safrastyan/PuzzlingClarity | resources/cp/LeetCode/155. Min Stack.cpp | class MinStack {
public:
MinStack(): m_data()
{
}
void push(int val)
{
m_data.push_back(val);
}
void pop()
{
m_data.pop_back();
}
int top()
{
return m_data.back();
}
int getMin()
{
return *std::min_e... | ALGO | 0.999879 | 6.570194 |
4cfb8c56-b62d-4d2f-bbe4-0d311a32446b | amgit99/cses-ProblemSet | Range Queries/range_xor_queries.cpp | #include<bits/stdc++.h>
#define brr cin.tie(0) -> sync_with_stdio(0);
#define tc int t; cin >> t; while(t--)
#define __ << " " <<
#define ll long long
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define pi pair<int, int>
#define mod 1000000007
using namespace std;
const int MAX_N = 1<<... | ALGO | 0.999946 | 4.571243 |
599da182-2cab-4239-ad8a-711bb50d213f | gitchaofang/leetcode | 42.cpp | class Solution {
public:
int trap(vector<int>& height) {
int n = height.size();
std::vector<int> left(n,0);
std::vector<int> right(n,0);
for(int i = 1; i < n; ++i){
left[i] = std::max(left[i - 1], height[i - 1]);
right[n - 1 - i] = std::max(right[n - i], heigh... | ALGO | 0.999954 | 6.78687 |
a8fa9efa-f50d-4780-ad33-89610c6ba197 | DucAnhNguyen5905/DucAnhNguyen5905 | btvn_buoi_6.cpp | #include <iostream>
using namespace std;
/*
// Bai 20
void hoan_doi_vi_tri(int *mang, int so_phan_tu) {
int *start = mang;
int *end = mang + so_phan_tu - 1;
while (start < end) {
int temp = *start;
*start = *end;
*end = temp;
start++;
end--;
}
}
i... | ALGO | 0.995285 | 3.262083 |
55f74e31-7161-403f-8603-55f7f3db7fac | braveheart12/Birake | src/uint256.cpp | #include "uint256.h"
#include "utilstrencodings.h"
#include <stdio.h>
#include <string.h>
template <unsigned int BITS>
base_uint<BITS>::base_uint(const std::string& str)
{
SetHex(str);
}
template <unsigned int BITS>
base_uint<BITS>::base_uint(const std::vector<unsigned char>& vch)
{
if (vch.size() != sizeof... | ALGO | 0.906604 | 6.478078 |
3eee98d3-e44f-443d-ac18-3f89d9fce55e | obstaclelamb/OIwiki-temp | docs/misc/code/mo-algo-2dimen/mo-algo-2dimen_1.cpp | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int n, m, q, a[201][201];
long long ans[100001];
int disc[250001], cntdisc; // 离散化用
int blocklen, counts[40001];
long long now;
struct Question {
int x1, y1, x2, y2, qid;
bool operator<(Question tmp) const {
if (x1 / blocklen !=... | ALGO | 0.998918 | 4.394875 |
48bc5082-038f-4287-af84-a57280b86903 | CodeKwang/Blue-Bridge-Cup-2020-C- | 算法训练/ALGO-1 区间k大数查询.cpp | #include<iostream>
using namespace std;
int main()
{int n,m,i,l,j;
cin>>n;
unsigned int a[n];
for(i=0;i<n;i++)
cin>>a[i];
cin>>m;
for(l=0;l<m;l++)
{ int num=0;
unsigned int b[3];
for(i=0;i<3;i++)
{cin>>b[i];}
unsigned int c[n];
for(i=b[0]-1;i<b[1];i++)
{c[num++]=a[i];}
f... | ALGO | 0.999997 | 3.566272 |
83d8e949-0187-4d7b-b194-afb4085ed976 | Amitkr-2004/CPP | Dynamic Programming/L_Deques.cpp | #define ll long long int
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
vector<int> a;
ll dp[3005][3005];
ll f(int i,int j){
if(i==j) return a[i];
if(dp[i][j]!=-1) return dp[i][j];
return dp[i][j]=max(a[i]-f(i+1,j),a[j]-f(i,j-1));
}
int main(){
memset(dp,-1,sizeof dp);
int n... | ALGO | 0.999812 | 3.908705 |
f13ddd59-cead-457a-b9a2-6502ef2bd6fe | ArseniyKholod/stce_ss24_ex12 | thirdParty/eigen-3.4.0/unsupported/doc/examples/MatrixLogarithm.cpp | #include <unsupported/Eigen/MatrixFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
using std::sqrt;
MatrixXd A(3,3);
A << 0.5*sqrt(2), -0.5*sqrt(2), 0,
0.5*sqrt(2), 0.5*sqrt(2), 0,
0, 0, 1;
std::cout << "The matrix A is:\n" << A << "\n\n";
std::cout << "... | ALGO | 0.999036 | 3.621207 |
2974d441-bea8-4a32-a595-45ce65941eaf | lichen11/LSGMcode | algorithms/hungarian.cpp | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <gsl/gsl_heapsort.h>
#include "hungarian.h"
#include <mex.h>
typedef struct {
int num_rows;
int num_cols;
double** cost;
int** assignment;
int* col_inc;
} hungarian_problem_t;
int compare_doubles(const void *av,const void *bv)
{
double* a=(... | ALGO | 0.999974 | 4.525593 |
60d7c752-feaf-4b8f-8c7c-38ad4e814e92 | PrajwalGitCode/programs | pattern5.cpp | //========== User's Code Starts Here ==========
#include<iostream>
using namespace std;
void print_pattern();
/*Function to print the pattern */
void print_pattern()
{
/* Function to print the pattern */
int i = 5;
while (i >= 1) {
int j = 1;
while (j <= i) {
... | ALGO | 0.999543 | 4.035074 |
2e73e4fb-c5fc-4c55-80e9-41693b5e2d86 | vinorom/practice | src/string_compression.cpp | #include <bits/stdc++.h>
using namespace std;
int get_num_digits(int n)
{
int count = 0;
while (n) ++count, n /= 10;
return count;
}
string compress(const string& s)
{
if (s.empty()) return s;
vector<pair<char, int>> letters{{s[0], 1}};
for (size_t i = 1; i < s.length(); ++i)
{
i... | ALGO | 0.999956 | 5.634879 |
fcd2dc59-a402-4e79-9169-fc01ca75a942 | japleensachdev/COM-411 | EXPERIMENTS/exp4.cpp | #include <iostream>
#include <vector>
using namespace std;
/* Class Definitions */
class Student {
private: // Data Members declaration
string name;
string fatherName;
string phoneNumber;
int rollNo;
string dateOfBirth;
int semester,n,sub;
string email;
string addr;
char sub_name[3][20];
flo... | TOOL | 0.887888 | 4.608882 |
aca55fb9-d03c-4b7d-966b-aa52155104e8 | slicer4ever/Lightwave | Framework/Source/C++11/LWCore/LWSVector_AVX2_Double.cpp | #include "LWCore/LWSVector.h"
#ifndef LW_NOAVX2
LWVector4<double> LWSVector4<double>::AsVec4(void) const {
alignas(32) LWVector4<double> R;
_mm256_store_pd(&R.x, m_Data);
return R;
}
double *LWSVector4<double>::AsArray(void) {
return (double*)&m_Data;
}
const double *LWSVector4<double>::AsArray(void) const {
re... | TOOL | 0.990203 | 4.966471 |
fef7d3a5-036d-4742-9633-64804981ff90 | c-aranda-bassegoda/ACG_Project | 3_catmark_subdiv/subdivision/catmullclarksubdivider.cpp | #include "catmullclarksubdivider.h"
#include <QDebug>
/**
* @brief CatmullClarkSubdivider::CatmullClarkSubdivider Creates a new empty
* Catmull Clark subdivider.
*/
CatmullClarkSubdivider::CatmullClarkSubdivider() {}
/**
* @brief CatmullClarkSubdivider::subdivide Subdivides the provided control mesh
* and retur... | ALGO | 0.978006 | 6.181873 |
0da0e99f-7a53-4a1d-af9c-442d3efc2e24 | accident-study-group/leetcode-study | Noob/search_in_rotated_sorted_array_33/solution.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
int search(vector<int> &nums, int target)
{
int low = 0;
int high = nums.size() - 1;
int mid = 0;
// 정말 특이한 케이스들을 미리 처리해버리고 return 해버리면 불필요한 연산을 줄일 수 있음
if (nums.size() == 1)
{
if... | ALGO | 0.999992 | 5.845981 |
e957cdb3-613f-43e0-a6c3-a5cc475698c6 | cookie-sid/LeetCode | 1578-minimum-time-to-make-rope-colorful/1578-minimum-time-to-make-rope-colorful.cpp | class Solution {
public:
int minCost(string colors, vector<int>& neededTime) {
int ans = 0;
for(int i = 0; i < colors.length(); i++) {
int curr = i, next = i + 1;
int add = neededTime[curr], total = neededTime[curr];
while(next < colors.length() and colors[curr] =... | ALGO | 0.999747 | 6.214529 |
0059be72-ab9e-4b57-b423-cb154e8df3b0 | kirollosatef/problem-solving | leetCode/342.power-of-four.cpp | /*
* @lc app=leetcode id=342 lang=cpp
*
* [342] Power of Four
*/
#include <bits/stdc++.h>
using namespace std;
// @lc code=start
class Solution
{
public:
bool isPowerOfFour(int n)
{
if (n == 0)
return 0;
while (1)
{
if (n == 1 || n == 4)
return 1;
if (n % 4 != 0)
re... | ALGO | 0.999201 | 6.075103 |
c17f164d-2bef-466e-ae74-12c3ed3c01f0 | Akuls77/Udemy-BeginnerToAdvanceCpp | DiscountedBill.cpp | #include <iostream>
using namespace std;
int main()
{
float ba, dis, da;
cout<<"Enter ba: ";
cin>>ba;
if(ba>=100 && ba<500)
{
dis = (10.0/100.0)*ba;
cout<<dis<<endl;
da = (ba - dis);
cout<<da;
}
else if(ba>=500)
{
dis = (20.0/100.0)*ba;
co... | ALGO | 0.98039 | 3.033434 |
1d22297d-560a-46b0-9cb3-909c398ed13a | M4573R/competitive-programming-archive | timus/volume-03/hyperjump.cpp | #include <algorithm>
#include <iostream>
using namespace std;
inline
void use_io_optimizations()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
int main()
{
use_io_optimizations();
unsigned int elements;
cin >> elements;
int sum {0};
int max_sum {0};
for (unsigned int ... | ALGO | 0.999633 | 5.864301 |
6df0eb7c-1f23-42bb-b2a1-65b521fd09b2 | Prithvi04/30-Day-Leetcode-Challenge | Week-5/Day_30_Check_isValid.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.99999 | 6.586083 |
271856e7-2a3e-4a82-85e6-a17e22aa3488 | Abdillah/abdillah96bu-keyboard-init | java/jni/jni/org_pocketworkstation_pckeyboard_BinaryDictionary.cpp | #include <stdio.h>
#include <assert.h>
#include <unistd.h>
#include <fcntl.h>
#include <jni.h>
#include "dictionary.h"
// ----------------------------------------------------------------------------
using namespace latinime;
//
// helper function to throw an exception
//
static void throwException(JNIEnv *env, cons... | TOOL | 0.917521 | 6.422921 |
39649218-aa93-4faf-8d07-a236b13b5fda | cmake-wheel/pin3-slam | bindings/python/algorithm/expose-contact-dynamics.cpp | #include "pinocchio/bindings/python/algorithm/algorithms.hpp"
#include "pinocchio/bindings/python/algorithm/contact-info.hpp"
#include "pinocchio/bindings/python/algorithm/proximal.hpp"
#include "pinocchio/algorithm/contact-dynamics.hpp"
namespace pinocchio
{
namespace python
{
static const context::Vector... | ALGO | 0.997915 | 6.296767 |
4315c27b-79ac-4c1f-af8c-e82bbc4b206c | SelinaArjomand/CSCI110-Labs | bottles.cpp | /* Program: Total Bottles
Author: Selina Arjomand
Class: CSCI 110 MW
Date: 10/19/20
Description: User imputs the number of days and
the number of bottles returned each day.
The program will find the total
number of bottles returned. ... | ALGO | 0.977134 | 4.582078 |
305e7c2c-2387-4513-ba6b-8e55828fe271 | TeanWolf/Labs_PSTU | Laba11_3.cpp | //Метод половинного деления
#include <iostream>
#include <cmath>
using namespace std;
char ch;
double f(double x)
{
return 3 * sin(sqrt(x)) + 0.35 * x - 3.84;;
}
int main(int argc, char* argv[])
{
setlocale(LC_ALL, "RUS");
float a, b, x, eps;
cout << "Введите левый отрезок:";
cin >> a;
cout ... | ALGO | 0.999975 | 3.786887 |
5e81f57e-507e-4c19-b2e8-3fc31b852a7c | GlobeDex/GBDX_old | src/consensus/merkle.cpp | #include "merkle.h"
#include "hash.h"
#include "utilstrencodings.h"
/* WARNING! If you're reading this because you're learning about crypto
and/or designing a new system that will use merkle trees, keep in mind
that the following merkle tree algorithm has a serious flaw related to
duplicate tx... | ALGO | 0.999927 | 7.565377 |
48d273a1-535f-4e28-a699-7445a6c946a3 | manishtiwari2k3/manish-223117 | 3380-shortest-subarray-with-or-at-least-k-ii/3380-shortest-subarray-with-or-at-least-k-ii.cpp | // class Solution {
// public:
// int minimumSubarrayLength(vector<int>& nums, int k) {
// int left = 1;
// int right = nums.size();
// int minLength = -1;
// while (left <= right) {
// int mid = left + (right - left) / 2;
// if (hasValidSubarray(nums, k, mi... | ALGO | 0.99994 | 6.503292 |
099fcf25-8177-4e0c-82b8-9c0d2c472e5e | kie4280/leetcode-solution | LC15.cpp | class Solution {
public:
vector<vector<int>> threeSum(vector<int> &nums) {
if (nums.size() < 3)
return {};
sort(nums.begin(), nums.end());
vector<vector<int>> result;
for (int a = 0; a < nums.size() - 2; ++a) {
if (a > 0 && nums[a] == nums[a - 1])
continue;
int left = a + 1, ... | ALGO | 0.999714 | 6.184073 |
a9d9b050-f73c-49b9-a0de-ced9711b5f1b | waterfogSW/Cracking-Coding-Interview | Coding Test/DFS-BFS/binarySearch.cpp | #include <bits/stdc++.h>
using namespace std;
int n, target;
vector<int> arr;
inline int binarySearch(vector<int>& arr, int target, int start, int end) {
int mid = (start + end)/2;
if(arr[mid] == target) return mid;
if(target > mid) return binarySearch(arr,target, mid+1, end);
else return binarySearch... | ALGO | 0.999902 | 5.980938 |
012fa4a9-3451-488d-83a6-daa573b043f0 | MTG/essentia | src/essentia/utils/jsonconvert.cpp | #include "jsonconvert.h"
using namespace std;
using namespace essentia;
void JsonConvert::skipSpaces() {
while (_pos < _size) {
if (_str[_pos] == ' ' || _str[_pos] == '\n' ||
_str[_pos] == '\r' || _str[_pos] == '\t') {
_pos++;
}
else
break;
}
}
int JsonConve... | TOOL | 0.850345 | 5.203755 |
aabb7120-f166-41e6-8012-8fe20746e09c | RohitKotha/geeksforgeeksprograms | Difficulty: Easy/Delete node in Doubly Linked List/delete-node-in-doubly-linked-list.cpp | //{ Driver Code Starts
#include <stdio.h>
#include <stdlib.h>
/* a Node of the doubly linked list */
struct Node {
int data;
struct Node *next;
struct Node *prev;
Node(int x) {
data = x;
next = NULL;
prev = NULL;
}
};
// } Driver Code Ends
/* Structure of Node
struct Node
... | ALGO | 0.999895 | 6.175416 |
cbcd49c4-460d-4bda-8cc2-3cda5ef1ebf9 | amirkogit/CppTestGround | thirdparty/cpptemplates_second_edition/details/max.cpp | template<typename T>
T max (T a, T b)
{
return b < a ? a : b;
}
int main()
{
::max<double>(1.0, -3.0); // explicitly specify template argument
::max(1.0, -3.0); // template argument is implicitly deduced to be double
::max<int>(1.0, 3.0); // the explicit <int> inhibits the deduction;
... | ALGO | 0.968954 | 4.780129 |
382107ab-2f68-42e8-8ede-1ec15c288aba | wisalmalik/Basic_Of_c- | 08_functionPrototype.cpp | #include<iostream>
using namespace std;
float sum(int x, float y);
int main(){
float sum1 = sum(5,5.5);
cout << "the sum of the two number 5, 5.5 is " << sum1 <<endl;
return 0;
}
float sum(int x , float y ){
return x+y;
} | ALGO | 0.963837 | 3.908113 |
4dbd9dc8-6dd7-40e0-bb83-6b41489f6e98 | janfranco27/spoj | basics/12187.cpp | /**
* Character Patterns (Act 6)
**/
#include <iostream>
#include <string>
void println(char a, char b, int width, int cols) {
for (int i = 0; i < cols; i++) {
for (int j = 0; j < width; j++) {
std::cout<<a;
}
std::cout<<b;
}
for (int j = 0; j < width; j++) {
std::cout<<a;
}
std::cout... | ALGO | 0.993071 | 3.117496 |
be0883e1-9a92-4997-8467-5c87be9e91b8 | thegoof79/J-Core | src/server/scripts/EasternKingdoms/Karazhan/boss_maiden_of_virtue.cpp | /* ScriptData
SDName: Boss_Maiden_of_Virtue
SD%Complete: 100
SDComment:
SDCategory: Karazhan
EndScriptData */
#include "ScriptPCH.h"
#define SAY_AGGRO -1532018
#define SAY_SLAY1 -1532019
#define SAY_SLAY2 -1532020
#define SAY_SLAY3 -1532021
#define SAY_REPENTANC... | TOOL | 0.85681 | 6.727665 |
a51016dd-0f7c-4106-9e99-b688b417a1e3 | RomelFatal/COMPUTER-SCIENCE-ENGINEERING | C++/FUNCTIONS/Program4.cpp | // This program has three functions: MAIN, DEEP, and DEEPER.
// Created by Romel on 10/23/22.
#include <iostream>
using namespace std;
// Function prototypes
void deep();
void deeper();
/*********************************************
* main *
*************************************... | ALGO | 0.995128 | 5.80329 |
47c8be78-6044-4298-9ac2-48ee30dc933c | nvnnv/Leetcode | 1654. Minimum Jumps to Reach Home.cpp | class Solution {
public:
int dp[6000][2];
unordered_map<int, int> forbi;
int dfs(int i, bool back, int forward, int goback, int goal) {
if (i==goal) return 0;
if (i<0 || i >= 6000 || forbi.count(i) == 1) return 1e9;
if (dp[i][back] != -1) return dp[i][back];
dp[i][ba... | ALGO | 0.999876 | 5.107505 |
8ac09403-920b-4d21-843d-bbe236660ae2 | sisi0808/atcoder-env | arc/143/a.cpp | #include <bits/stdc++.h>
/* ACLのライブラリを追加*/
#include <atcoder/all>
using namespace atcoder;
#define fio() \
cin.tie(nullptr); \
ios::sync_with_stdio(false);
using namespace std;
#define rep(i, n) for(int i = 0; i < int(n); ++i)
#define rrep(i, n) for(int i = n; i >= 0; --i)
#define repp(i, n, m) for(int... | ALGO | 0.999984 | 4.317972 |
d5219c71-81ac-47cd-b0b4-70d19ebc0c64 | Snehal-Cse/Snehal-DSA_CHALLENGE | 300-longest-increasing-subsequence/longest-increasing-subsequence.cpp | class Solution {
public:
int f(vector<vector<int>>&dp, int n, vector<int>&nums, int i, int prev){
if(i==n){
return 0;
}
if(dp[i][prev+1]!=-1){
return dp[i][prev+1];
}
int take =0;
if(prev==-1 || nums[prev]<nums[i]){
take =... | ALGO | 0.999994 | 5.875537 |
9808e1a3-715f-421b-bc0f-b4fabaa037eb | ishandutta2007/codeforces | hyperbolic/normal/1404/B.cpp | #include <stdio.h>
#include <vector>
#include <algorithm>
int a,b,c,d,e;
int ans1 = 0,ans2 = 0;
std::vector<int> V[100010];
int func(int k, int prev, int h)
{
if(k==c) ans1 = h;
std::vector<int> save;
for(int i=0;i<V[k].size();i++)
{
if(V[k][i]==prev) continue;
int C = func(V[k][i],k,h+1);
save.push_back(C... | ALGO | 0.999993 | 3.703499 |
7bf44a6b-23ae-428c-acb7-e051783cfe5a | luciandinu93/CPlusPlusLearning | Chapter2/Lab1-5.cpp | /* Find the date of Easter
*
* 1. Divide year by 19 and find the remainder - assign it to a;
* 2. Divide year by 4 and find the reminder - assign it to b;
* 3. Divide year by 7 and find the reminder - assign it to c;
* 4. Take a, multiply it by 19 add 4 divide by 30 and find the reminder - assign it to d;
* 5. Di... | ALGO | 0.999776 | 5.239295 |
f3bd7f04-c1f9-405d-8c55-d73a51f484ac | shakilaust/Light-Oj-Solve | 1149 - FACTORS AND MULTIPLES.cpp |
//BISMILLAHIRRAHMANIRRAHIM
/*
manus tar shopner soman boro
Author :: Shakil Ahmed
.............AUST_CSE27.........
prob ::
Type ::
verdict::
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>
#include <math.h>
#include <limits.h>
#include <set>
#include <algorithm>
#include <i... | ALGO | 0.999854 | 3.76831 |
1b366b19-d7fc-4573-b3ae-f0bb263097a2 | AbdoWael2003/Graduation-Project-QAgent2.0- | FlowChartGeneration/CPPSamples/Sample741/sample_code741.cpp | #include <cmath>
std::pair<double, double> area_tetrahedron(double side) {
double area = sqrt(3) * (side * side);
return {area, area};
}
| TOOL | 0.968128 | 5.301494 |
78912ad5-3b99-4a76-b15f-02f59fba88c4 | Coding-Zuo/ACM | Leetcode/链表/142环形链表2.cpp | //
// Created by 左玉晖 on 2020/11/23.
// https://leetcode-cn.com/problems/linked-list-cycle-ii/
#include <iostream>
#include<algorithm>
#include<vector>
#include <unordered_map>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
publ... | ALGO | 0.99996 | 4.320283 |
9f3eb9df-d779-45e1-bdde-6bb0720257c3 | 1chooo/code | zerojudge/a149-乘乘樂/solution.cpp | /*
* Author: 1chooo<<EMAIL>>
* Problem link: https://zerojudge.tw/ShowProblem?problemid=a149
* Status: AC
*/
#include <iostream>
#include <cstdlib>
using namespace std;
int main(void) {
int T;
cin >> T;
for (int i = 0; i < T; i++) {
int temp;
cin >> temp;
if (temp == 0) {
cout... | ALGO | 0.999956 | 5.06458 |
c511f000-295b-4297-a80c-41f81efc46b5 | moyuanhuang/leetcode | 0/89_0.cpp | class Solution {
public:
vector<int> grayCode(int n)
{
vector<int> res = {0};
for(int i = 0; i < n; i++)
{
int size = res.size();
for(int j = size - 1; j >= 0; j--)
{
res.push_back(res[j] | (1 << i));
}
}
return res;
}
}; | ALGO | 0.999965 | 6.030761 |
03bc9095-58d2-4485-ad90-2d8cd2408533 | gomster96/Byungwoong_Algorithm | lecture/25.cpp | #include<iostream>
#include<stdlib.h>
#include<vector>
using namespace std;
#define mine
#ifdef mine
int main(){
//// 빠르게 짜는법을 모르겠음 ...
freopen("input.txt","rt",stdin);
int n =0;
scanf("%d",&n);
vector<int> a(n);
for(int i=0; i<n; i++){
scanf("%d",&a[i]);
}
vector<int> k(n)... | ALGO | 0.999655 | 3.477303 |
194f2e2f-4f96-4270-9f63-6e73356c7364 | shamiulriyad/codeforces | div 3/Round 1032/A.cpp | #include <bits/stdc++.h>
using namespace std;
void solve(int tc)
{
int b,c;cin>>b>>c;
vector<int>d(b);
for(int i=0;i<b;i++)cin>>d[i];
int e=d[0],f=d[b-1];
cout<<min(abs(c-e),abs(c-f))+(f-e)<<'\n';
}
signed main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int tc, tt = 1;
cin >> tt;
f... | ALGO | 0.999795 | 4.290728 |
94135876-3160-43ff-a695-a2e06b1b9da8 | Taranum01/LeetCode | 967-numbers-with-same-consecutive-differences/967-numbers-with-same-consecutive-differences.cpp | class Solution {
public:
vector<int>ans;
int countDigit(int n){
int count=0;
while(n>0){
count++;
n=n/10;
}
return count;
}
void findNumber(int num, int n, int k){
if(countDigit(num)==n){
ans.push_bac... | ALGO | 0.999879 | 6.670943 |
be7f8f0a-6b4d-4604-a1b3-577cb01882bb | nish235/C-CppAssignments | Sept09/Greater2WRNA.cpp | #include<iostream>
#include<conio.h>
using namespace std;
int great()
{
int n1,n2;
cout<<"\n Enter 1st Numbers : ";
cin>>n1;
cout<<"\n Enter 2nd Numbers : ";
cin>>n2;
if(n1>n2)
{
cout<<"\n Greater Number Is : "<<n1;
}
else
{
cout<<"\n Greater Number Is : "<<n2;
... | ALGO | 0.995357 | 3.097329 |
02740ccb-325b-4060-ba62-de93ef634dc8 | B1oodyAnge1/Dividing_a_number_by_digits | Dividing_a_number_by_digits/Dividing_a_number_by_digits.cpp | #include <iostream>
#include <string>
#include "regex"
//Составить программу, которая будет считывать введённое пятизначное число.
//После чего, каждую цифру этого числа необходимо вывести в новой строке.
//
//В этой задаче нужно воспользоваться операцией — остаток от деления %.
int main()
{
setlocale(LC_ALL, "ru");... | ALGO | 0.999185 | 3.956334 |
5300fbb3-ba3f-4e72-864b-401f371f31b3 | kurumishka/problems | global16/A.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define times int t; cin >> t; while(t--)
#define ANS 1000000007
#define F first
#define S second
#define T_MAX(a,b,c) max(max(a,b),c)
#define S... | ALGO | 0.997924 | 3.709685 |
8959c8ec-b987-4f85-8175-3f52df4f4cbf | cronosoid/Gravity-Flux-main | include/IMGUI/misc/fonts/binary_to_compressed_c.cpp | // ImGui - binary_to_compressed_c.cpp
// Helper tool to turn a file into a C array, if you want to embed font data in your source code.
// The data is first compressed with stb_compress() to reduce source code size,
// then encoded in Base85 to fit in a string so we can fit roughly 4 bytes of compressed data into 5 by... | TOOL | 0.940942 | 6.26867 |
702515b5-4eb6-4810-8dc2-c31fd6b3ba87 | r-d-s-l-w/competitive-programming | CSES/Playlist.cpp | /// Radoslaw Mysliwiec 2020
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define endl '\n'
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using pi =... | ALGO | 0.999909 | 4.269349 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.