uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
c631ab1b-fa8d-4125-bb6f-0b73cf7b0b64 | BBBob/Pikachu-s-naughtiness | contest_training/2018-05-27/2-small.cpp | //#define test
#include<bits/stdc++.h>
using namespace std;
const int Nmax=27;
typedef long long ll;
int n;
int mp[Nmax][Nmax];
struct Edge{
int x,y,w,next;
Edge(){ }
Edge(int x,int y,int w,int next):x(x),y(y),w(w),next(next){ }
}e[Nmax*Nmax*2];
int V[Nmax];
int size;
inline void init()
{
memset(V,-1,si... | ALGO | 0.999941 | 3.849158 |
688b19f1-9b3a-4932-8ae6-dd1ff41c5b85 | quiniks/Rocket-Battle-Project | RocketBattle/src/CollisionHelper.cpp | #include "..\include\CollisionHelper.h"
CollisionHelper::CollisionHelper()
{
}
CollisionHelper::~CollisionHelper()
{
}
float CollisionHelper::dot(sf::Vector2f a, sf::Vector2f b)
{
return a.x * b.x + a.y * b.x;
}
sf::Vector2f CollisionHelper::cross(sf::Vector2f a, float scalar)
{
return sf::Vector2f(scalar * a.y, ... | ALGO | 0.980349 | 6.324044 |
2366f843-5ed2-4f71-9c52-14ac8d2096ab | Nehasharma97549/job-ready-bootcamp-all-assignments | bootcamp_assignment35/35_10th.cpp | //10-
#include <iostream>
using namespace std;
int rem(int num)
{
return (num % 10);
}
template <typename X>
void hashTable(X table[], X num)
{
table[rem(num)] = num;
}
int main()
{
int table[10];
hashTable<int>(table, 50);
return 0;
}
| ALGO | 0.999542 | 3.161372 |
2445375a-fe8a-4897-9dc1-4fcdfbb6f88a | msg7086/VSFilterSimpleMod | src/BaseClasses/source.cpp | // Locking Strategy.
//
// Hold the filter critical section (m_pFilter->pStateLock()) to serialise
// access to functions. Note that, in general, this lock may be held
// by a function when the worker thread may want to hold it. Therefore
// if you wish to access shared state from the worker thread you will
// need to ... | TOOL | 0.906011 | 5.5056 |
35190a0b-e45c-4884-b1db-428cc2e076f0 | prashantsinha0604/Geeksforgeeks | Difficulty: Easy/Pair with given sum in a sorted array/pair-with-given-sum-in-a-sorted-array.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
int countPairs(vector<int> &arr, int target) {
// Complete the function
int count = 0 ;
unordered_map < int , int > mp;
for( int i = 0 ; i < arr.size(); i+... | ALGO | 0.999089 | 6.68568 |
88826965-f15b-40a0-b590-d348d64359ca | naresh-chilukurthi/MissionRnD-C-Arrays2-Worksheet | src/countGreaterNumbers.cpp | /*
OVERVIEW: You are given a bank statement where transactions are ordered by date. Write a function that finds the number of transactions in that statement after a given date.
-- find the count of numbers greater than a given number in a sorted array.
E.g.: Input: A[3] = { { 10, "09-10-2003", "First" }, { 20, "19-10-2... | ALGO | 0.980127 | 4.103862 |
8e9b300d-d3ea-44d1-ad7f-46c29d2326fd | NickKotadiya/cpp | Basic/circle.cpp | #include <iostream>
using namespace std;
int main()
{
float area,pie=3.14,r,sq;
cout<<" enter radius value :";
cin>>r;
area=pie*(r*r);
cout<<area;
return 0;
} | ALGO | 0.971786 | 3.162875 |
2d5ea841-9260-4751-9be4-85a8838bf61e | Lucifero-debug/Data-Structure-and-algorithm | linked_list/flattenlist.cpp | #include <iostream>
using namespace std;
class Node {
public:
int data;
Node* next;
Node* child;
Node(int data){
this->data=data;
this->next=NULL;
this->child=NULL;
}
~Node() {
int value = this -> data;
if(this->next != NULL) {
delete ... | ALGO | 0.999923 | 4.389982 |
ddee830b-2b30-48fc-b52c-3df546aebd9d | Gaurang03/DSA-Questions | DPP1/6_Unique2_elements.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
const long long ONE_SIXTH = 166666668;
int setBit(int n, int pos)
{
return ((n & (1 << pos)) != 0);
}
int32_t main()
{
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll x = 0;
... | ALGO | 0.999994 | 3.62454 |
313c82f7-7dbc-4522-b82c-65b9764d1a36 | nlhtungg/SOICT_DSA_LAB | degree2polynomial.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
double a, b, c; cin >> a >> b >> c;
double delta= b*b-4*a*c;
if(delta<0) cout << "NO SOLUTION";
else if(delta==0) cout << fixed << setprecision(2) << -b/(2*a);
else if(delta>0){
double x1=(-b-sqrt(delta))/(2*a);
double x2=(-b... | ALGO | 0.999906 | 4.303608 |
ef5c96a2-5e86-46bc-a178-f43297e42104 | sumanbabum/TestAZureBoards | snippets/cpp/VS_Snippets_CLR/Cryptography.RSACSP.SignData2/CPP/example.cpp |
//<SNIPPET1>
using namespace System;
using namespace System::Security::Cryptography;
using namespace System::Text;
array<Byte>^ HashAndSignBytes( array<Byte>^DataToSign, RSAParameters Key )
{
try
{
// Create a new instance of RSACryptoServiceProvider using the
// key from RSAParameters.
... | TOOL | 0.958601 | 6.470752 |
1936e2ab-fc95-4ce5-a044-66225f876fb2 | adityarajput22/HACKERBLOCKS- | transposeoofmatrixcode.cpp | #include<iostream>
using namespace std;
int main ()
{
// for transpose both row and column are same
int n;
cin>>n;
int arr[100][100];
int transpose[100][100];
// taking input
for(int i = 0;i<=n-1;i++)
for(int j = 0;j<=n-1;j++)
cin>>arr[i][j];
// storing in transpose matrix
for (int i = 0; i < n; ++i... | ALGO | 0.999872 | 3.867215 |
6d9bc87c-0fea-4e23-bda8-256c5520577e | ngng628/competitive-programming | atcoder/others/ant-book/chap1/kujibiki/main.cpp | # include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool Main() {
int n, m;
cin >> n >> m;
if (!(n | m)) return false;
vector<int> p(n);
for_each(p.begin(), p.end(), [](int& e){ cin >> e; });
p.push_back(0);
n += 1;
auto score = [&m](int sum) { return sum > m ? sum : sum; };
... | ALGO | 0.999887 | 3.800003 |
8fb1980c-6e0f-47fb-bd7f-e1a04afdabf4 | ishandutta2007/codeforces | risujiroh/normal/1456/B.cpp | #include <bits/stdc++.h>
#pragma region my_template
struct Rep {
struct I {
int i;
void operator++() { ++i; }
int operator*() const { return i; }
bool operator!=(I o) const { return i < *o; }
};
const int l_, r_;
Rep(int l, int r) : l_(l), r_(r) {}
Rep(int n) : Rep(0, n) {}
I begin() const... | ALGO | 0.99991 | 4.054075 |
d99656f9-4340-49e9-9195-01de690cae1b | codexx07/DSA | Graph in CPP/unwaightedGraph.cpp | #include <iostream>
#include <vector>
#include <list>
using namespace std;
template <typename T, int Nodes>
class Graph {
private:
vector<list<T>> edges;
public:
Graph() {
edges.resize(Nodes);
}
void addEdge(int src, int dst) {
edges[src].push_back(dst);
}
vector<T> BFS(int ... | ALGO | 0.999998 | 6.331138 |
f23f7e01-bc89-4d4b-87fa-338a08e2277e | vsm2004/DAA-MANU | Subset Sum Problem.cpp | #include <stdio.h>
void print_subset(int subset[], int subset_size) {
printf("{ ");
for (int i = 0; i < subset_size; i++) {
printf("%d ", subset[i]);
}
printf("}\n");
}
void find_subsets(int arr[], int n, int target, int subset[], int subset_size, int current_sum, int index) {
if (current_... | ALGO | 0.999964 | 5.930538 |
cc81d8ba-3d12-49fa-b4ba-07f51f972720 | adrianwilhelmi/aod-lab4 | z1/z1.cpp | #include<unordered_map>
#include<queue>
#include<vector>
#include<numeric>
#include<chrono>
#include<iostream>
#include<string>
#include<utility>
#include<sstream>
#include<fstream>
#include"graph.hpp"
std::pair<int64_t, std::vector<std::unordered_map<int64_t, int64_t>>> edmonds_karp(const Graph& graph, int64_t s, in... | ALGO | 0.998959 | 5.769784 |
6b989cbb-a527-485d-bd1b-a2f699108d87 | koosaga/olympiad | Canada/cco16p4.cpp | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <limits.h>
#include <math.h>
#include <time.h>
#include <iostream>
#include <functional>
#include <numeric>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset... | ALGO | 0.999683 | 3.554914 |
c0a4ba0b-1a41-495d-bff6-5bd9fadf298e | avinesh2101/coding-ninjas-competitive-part2 | 13DP-1/max_Sumrect.cpp | /* Maximum Sum Rectangle
Send Feedback
Given a 2D array, find the maximum sum rectangle in it. In other words find
maximum sum over all rectangles in the matrix.
Input
First line contains 2 numbers n and m denoting number of rows and number of
columns. Next n lines contain m space separated integers denoting elements... | ALGO | 0.999993 | 4.405182 |
1f6aa3fe-07c6-4231-8901-a89ad83de3f3 | coderark/Algo-DS | A & D/C2/Week 4/set_range_sum.cpp | #include <cstdio>
// Splay tree implementation
// Vertex of a splay tree
struct Vertex {
int key;
// Sum of all the keys in the subtree - remember to update
// it after each operation that changes the tree.
long long sum;
Vertex* left;
Vertex* right;
Vertex* parent;
Vertex(int key, long long sum, Ver... | ALGO | 0.999905 | 4.727253 |
f9e99836-1296-454f-8b61-86589db7963c | plasmatic1/dmoj-solutions | cpp/cco19p3.cpp | // ./cco-19-p3-winter-driving.yml
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll INF = 0x3f3f3f3f, LLINF = 0x3f3f3f3f3f3f3f3f;
ll P2(ll k) { return k*(k-1); }
const int MN = 2e5 + 1;
int N,
sz[MN], P[MN];
ll A[MN];
vector<int> g[MN];
int gsz(int c, int p) {
sz[c] = A[c];
P[c... | ALGO | 0.999848 | 3.756461 |
116c279a-074c-488a-8f13-e2a7a066a489 | udacity/CarND-MPC-Project | src/Eigen-3.3/bench/benchVecAdd.cpp |
#include <iostream>
#include <Eigen/Core>
#include <bench/BenchTimer.h>
using namespace Eigen;
#ifndef SIZE
#define SIZE 50
#endif
#ifndef REPEAT
#define REPEAT 10000
#endif
typedef float Scalar;
__attribute__ ((noinline)) void benchVec(Scalar* a, Scalar* b, Scalar* c, int size);
__attribute__ ((noinline)) void be... | TOOL | 0.865334 | 5.125496 |
21df1e39-6363-48c7-a2e7-e147a88d2a00 | Marllon-Freitas/Cpluplus-CompProg-Course | lab-11/aprendizagem/q01.cpp | /*
Defina uma senha por meio de um vetor de caracteres no seu programa. Peça ao
usuário que digite a senha dele. Verifique se ele digitou a senha correta, se sim
mostre a mensagem "senha correta", se não mostre a mensagem "senha incorreta".
Para comparar strings, pesquise sobre como usar a função strcmp.
Digite a senh... | TOOL | 0.943903 | 4.00386 |
3fb0dc33-9a30-468d-a875-c7ab6451ff62 | NikTRSK/CS104 | Labs/lab4/part1/fib.cpp | #include "fib.h"
int Fibonacci::get(int n) {
if (n == 1 || n == 2) {
return 0;
}
return get(n - 1) + get(n - 2);
}
| ALGO | 0.999258 | 4.841564 |
8b799973-efe8-44c4-a266-2f5accfa359d | mrsalt/USU | CS Class work/My Data Classes/Binary Search Tree.cpp | #include <iostream.h>
#include <string.h>
#include "Binary Search Tree.h"
template <class NodeType>
TreeNode<NodeType>::TreeNode(const NodeType &d){
data = d;
leftChild = NULL;
rightChild = NULL;
}
template <class NodeType>
TreeNode<NodeType>::TreeNode(TreeNode<NodeType> *Node){
data = Node->data;
leftChild = No... | ALGO | 0.999763 | 4.148894 |
3c981bbe-9f60-49fa-b87c-db8a06d113ab | fkhadivar/allegro_toolkit | src/third_party/Utils.cpp | #include "third_party/Utils.h"
template<typename T>
Utils<T>::Utils()
{
}
template<typename T>
Eigen::Matrix<T,4,1> Utils<T>::quaternionProduct(Eigen::Matrix<T,4,1> q1, Eigen::Matrix<T,4,1> q2)
{
Eigen::Matrix<T,4,1> q;
q(0) = q1(0)*q2(0)-(q1.segment(1,3)).dot(q2.segment(1,3));
Eigen::Matrix<T,3,1> q1Im = (q1.... | ALGO | 0.996779 | 6.754299 |
e210a0db-ca74-4743-b53b-d50ffcca12bf | bbaah123/CPlusPlus | files/SOWC++EO9 Programming Challenge Solutions/Chapter15/15_01.cpp | // Chapter 15 - Assignment 1, Analysis of Sorting Algorithms
// This Program uses a class named AbstractSort as a framework
// for sorting algorithms that sort by comparing pairs of array entries.
// To obtain a concrete class for sorting, one first subclasses
// the AbstractSort class and then overrides the pure virtu... | ALGO | 0.999905 | 6.262327 |
37d913eb-a3f2-4167-8f63-f6a243830571 | wndgur2/study_algorithm | 김원래/BaekJoon/1823_수확.cpp | #include <iostream>
#include <vector>
#include <time.h>
#include <algorithm>
using namespace std;
int N;
vector<int> prices;
vector<vector<int>> d;
int dp(int l, int r, int day)
{
if (l > r) return 0;
int& res = d[l][r];
if (res != -1) return d[l][r];
return res = max((prices[l] * day) + dp(l + 1, r, day + 1), (... | ALGO | 0.999413 | 4.136754 |
1a35b4c1-8f3e-449b-9c7e-5416ff07824b | ishandutta2007/codeforces | shatovoleg/normal/1690/B.cpp | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define len(v) ((int)(v).size())
#define pb push_back
#define kek pop_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#defi... | ALGO | 0.999965 | 3.379247 |
affe49bb-bd2f-459b-abd4-ac650e1d0597 | patelsneh18/GeeksForGeeks-DSA-Workshop | Week 1/Arrays/P02-revArrInGroups.cpp | #include<bits/stdc++.h>
using namespace std;
void reverseInGroups(vector<long long>& arr, int n, int k){
long long start = 0;
long long end = k-1;
while(start<end)
{
long long temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
star... | ALGO | 0.999956 | 4.110373 |
b8c58936-26ab-40cb-a95c-0b3d9258ee4a | Charingchen/CarND-Path-Planning | src/Eigen-3.3/bench/sparse_lu.cpp |
// g++ -I.. sparse_lu.cpp -O3 -g0 -I /usr/include/superlu/ -lsuperlu -lgfortran -DSIZE=1000 -DDENSITY=.05 && ./a.out
#define EIGEN_SUPERLU_SUPPORT
#define EIGEN_UMFPACK_SUPPORT
#include <Eigen/Sparse>
#define NOGMM
#define NOMTL
#ifndef SIZE
#define SIZE 10
#endif
#ifndef DENSITY
#define DENSITY 0.01
#endif
#ifnd... | ALGO | 0.996381 | 4.187482 |
ffd41d9a-1d76-4916-ba71-cbcecaa03619 | santychasi/GRUPO_5_ESTRUCTURA_DE_DATOS | SEGUNDO PARCIAL/Metodos de Ordenamiento/Counting Sort/Ordenar.cpp | #include <iostream>
#include "Ordenar.h"
#include <algorithm>
#include <conio.h>
void Ordenar::mostrar(int *arr, int tam) {
for(int i = 1; i <= tam; i++)
cout << arr[i] << " ";
cout << endl;
}
int Ordenar::obtenerMaximo(int arr[], int tam) {
int max = arr[1];
for(int i = 2; i<=tam; i++) {
if(a... | ALGO | 0.999257 | 4.23995 |
3041ca1f-e087-42ed-8cfc-51619a19c5ac | xv1998/PAT | Hello World for U/Hello World for U/test.cpp | #include<bits\stdc++.h>
#include<iostream>
#include<vector>
using namespace std;
int num1, num2, n, ans,isFound = 0;
int datas[1000005],tag[1000005];
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // !ONLINE_JUDGE
cin >> num1 >> num2 >> n;
for (int ... | ALGO | 0.999775 | 3.559875 |
75890cdd-c348-462c-a044-47d73a86cfcb | nya3jp/icpc | camp/2008russia/src/russian_camp/0826/ballistic.cpp | #include <iostream>
#include <cstdio>
#include <vector>
#include <functional>
#include <complex>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALLOF(c) (c).begin(), (c).end()
#define DIGIT 100
#define O... | ALGO | 0.999969 | 3.32231 |
4dce3b10-6b3c-4ed6-b1c2-88b6c8faaacb | secretlabs/MicroFrameworkSDK-Mono | DeviceCode/pal/OpenSSL/OpenSSL_1_0_0/crypto/objects/obj_xref.cpp | /* crypto/objects/obj_xref.c */
/* Written by Dr Stephen N Henson (<EMAIL>) for the OpenSSL
* project 2006.
*/
#include <openssl/objects.h>
#include "obj_xref.h"
DECLARE_STACK_OF(nid_triple)
STACK_OF(nid_triple) *sig_app, *sigx_app;
static int sig_cmp(const nid_triple *a, const nid_triple *b)
{
return a->sign_id... | TOOL | 0.915519 | 6.04985 |
c1fd66bb-5644-4f3c-b4b5-b625ea14a0ef | briandrawert/SPH-BVF | src/compute_meso_rho_atom.cpp | #include <cstring>
#include "compute_meso_rho_atom.h"
#include "atom.h"
#include "update.h"
#include "modify.h"
#include "comm.h"
#include "force.h"
#include "memory.h"
#include "error.h"
using namespace LAMMPS_NS;
/* ---------------------------------------------------------------------- */
ComputeMesoRhoAtom::Compu... | ALGO | 0.955896 | 6.274739 |
f78d6ce7-17d5-48ae-a418-3360e33af27d | sanan-sajid/CP-Codes | Codeforces/A_Filling_Shapes.cpp | #include <bits/stdc++.h>
#define mod 1000000007
#define LL long long int
using namespace std;
int main()
{
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
LL T;
T = 1;
while (T--)
{
LL N;
cin >> N;
... | ALGO | 0.999871 | 3.341272 |
5fcae860-fa47-418c-9660-ea3db5cac1fc | Deepanshurathore01/Problem_of_The_Day_DSA | Tcs Codevita Prepration Code/Collecting Candies/Candies.cpp | /*Question:- Krishna loves candies a lot, so whenever he gets them,
he stores them so that he can eat them later whenever he wants to.
He has recently received N boxes of candies each containing Ci candies
where Ci represents the total number of candies in the ith box. Krishna
wants to store them in a single box. Th... | ALGO | 0.999963 | 4.401114 |
7a308df5-e636-4d70-a6a0-198fabd09611 | nodchip/icfpc2021 | libs/boost_1_76_0/libs/compute/perf/perf_stl_saxpy.cpp | #include <algorithm>
#include <iostream>
#include <vector>
#include "perf.hpp"
float rand_float()
{
return (float(rand()) / float(RAND_MAX)) * 1000.f;
}
// y <- alpha * x + y
void serial_saxpy(size_t n, float alpha, const float *x, float *y)
{
for(size_t i = 0; i < n; i++){
y[i] = alpha * x[i] + y[i]... | ALGO | 0.914536 | 5.478343 |
40d4e1f1-033d-4660-9c52-c48fcde624ab | shreyas70/HackerRank-solutions | DS/Arrays/RainWaterTrap.cpp | /*
https://leetcode.com/problems/trapping-rain-water/solution/
TC: O(N)
SC: O(N)
*/
int Solution::trap(const vector<int> &A) {
vector<int> left;
vector<int> right(A.size());
int count = 0;
left.push_back(0);
int leftMax=A[0];
for(int i=1;i<A.size();i++)
{
leftMax = m... | ALGO | 0.999828 | 7.065333 |
94a54087-d927-4957-81c7-97bb43a6cf50 | NeoAnomaly/xray | xray/editors/LevelEditor/Edit/ESceneAIMapTools_Generate.cpp | #include "stdafx.h"
#pragma hdrstop
#include "ESceneAIMapTools.h"
#include "scene.h"
#include "../ECore/Editor/ui_main.h"
#include "ui_leveltools.h"
#include "cl_intersect.h"
#include "MgcAppr3DPlaneFit.h"
#include "sceneobject.h"
#include "../ECore/Editor/EditObject.h"
#include "../ECore/Editor/EditMesh.h"
#include ... | ALGO | 0.992501 | 3.334264 |
247db2f6-29bd-4c05-b41c-4d2d4b567970 | alvinpiter/competitive-programming | Codeforces/Gym/100513/G.cpp | #include<bits/stdc++.h>
using namespace std;
#define LL long long int
#define MAXN 200000
/*
For each segment starting from the left most, if its sum is > 0, then we will decrease the right most elements first.
Maintain a deque to store indices that can be reduced.
*/
int n, k, mini;
int bit[MAXN + 3];
void update(i... | ALGO | 0.999987 | 3.544651 |
714462a3-478d-47f4-914a-b9f64a287981 | isri-aist/DataDrivenMPC | tests/src/TestMpcOscillator.cpp | /* Author: Masaki Murooka */
#include <gtest/gtest.h>
#include <chrono>
#include <fstream>
#include <iostream>
#include <nmpc_ddp/DDPSolver.h>
#include <DDMPC/TorchUtils.h>
#include <DDMPC/Training.h>
/** \brief DDP problem based on data-driven state equation. */
class DDPProblem : public nmpc_ddp::DDPProblem<2, 1... | TEST | 0.95273 | 5.802855 |
02df4ac9-0e3a-40f6-90ef-493f110813cb | TheFenrisLycaon/DSA-C-- | cp/CodeForces/0200-0299/231B.cpp | #include <cstdio>
#include <vector>
int main(){
long n(0), d(0), l(0); scanf("%ld %ld %ld", &n, &d, &l);
long numPos = (n + 1) / 2;
long numNeg = n / 2;
long dmin = numPos * 1 - numNeg * l;
long dmax = numPos * l - numNeg * 1;
std::vector<long> numbers(n,0);
if(d < dmin || d > dmax){pu... | ALGO | 0.999852 | 3.235446 |
dd2a1fe5-3c53-4745-8da6-9e7dfc081d8b | A-Spiral-Forge/Strivers-SDE-Sheet-Challenge | Linked-List/First-Node-of-Loop-in-Linked-List.cpp | #include <bits/stdc++.h>
using namespace std;
class Node
{
public:
int data;
Node *next;
Node()
{
this->data = 0;
next = NULL;
}
Node(int data)
{
this->data = data;
this->next = NULL;
}
Node(int data, Node* next)
{
this->data = data;
... | ALGO | 0.999969 | 5.243781 |
bd151ccc-46a4-41ff-be9d-e3cd6e809f8b | FANSAN6190/sem3 | DS/Labs/Lab5/le5q3.cpp | /*3.Write a program to check whether given Matrix is sparse or not. We say a matrix as sparse when more
than 50% of total elements are zero. If matrix is sparse then represent it in triplet form with the help of array data
structure. Also print the number of bytes that are saved or wasted when you repre... | ALGO | 0.992459 | 3.27945 |
19bcdd4a-b6bc-448e-8147-1772d0456bcd | emrahuzucar355/Uzucar- | libcudacxx/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/stable_sort.pass.cpp | // <algorithm>
// template<RandomAccessIterator Iter>
// requires ShuffleIterator<Iter>
// && LessThanComparable<Iter::value_type>
// void
// stable_sort(Iter first, Iter last);
#include <algorithm>
#include <iterator>
#include <random>
#include <cassert>
#include "test_macros.h"
std::mt19937 randomne... | TEST | 0.997407 | 7.64468 |
44a01ed8-c43a-4a0a-bc42-74295f5c1e3a | EagleEyeKestrel/Leetcode | 2001-5000/2127. 参加会议的最多员工数/template的副本.cpp | class Solution {
public:
int maximumInvitations(vector<int>& f) {
int n = f.size();
int vis[n], in[n], l[n];
memset(vis, 0, sizeof(vis));
memset(in, 0, sizeof(in));
for (int i = 0; i < n; i++) {
in[f[i]]++;
}
queue<int> q;
for (int i = 0; i... | ALGO | 0.999926 | 5.359342 |
2cd248bd-67be-41e2-ac39-fa42fead2d70 | srymaker0/CODE | CaptainHu/algorithm/递推动规/16.oj44最长上升子序列2.cpp | /*************************************************************************
> File Name: 16.oj44最长上升子序列2.cpp
> Author: ZYJ
> Mail: NO
> Created Time: Tue 16 Feb 2021 05:11:08 PM CST
************************************************************************/
#include <iostream>
#include <cstring>
using namespace std... | ALGO | 0.999997 | 4.462255 |
ed47041d-8952-4ec3-9f80-b41243e5405b | salilab/imp | modules/statistics/src/RecursivePartitionalClusteringEmbedding.cpp | #include <IMP/statistics/RecursivePartitionalClusteringEmbedding.h>
#include <IMP/statistics/internal/TrivialPartitionalClustering.h>
IMPSTATISTICS_BEGIN_NAMESPACE
RecursivePartitionalClusteringEmbedding::
RecursivePartitionalClusteringEmbedding(Embedding *metric,
Parti... | ALGO | 0.979344 | 6.772213 |
fedf5496-2c23-434e-987b-ce76c5e952f3 | ishandutta2007/codeforces | thenymphsofdelphi/normal/1478/A.cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <=... | ALGO | 0.999702 | 4.112211 |
e9f06dea-4b6c-4c9e-8d0b-917e1d4cd0d0 | dspill/analysis | src/brute_force_dynamic_structure_factor.cpp | #include "trajectory.hpp"
#include "couf.hpp"
#include <iterator>
using namespace std;
int main(int argc, char **argv)
{
if(argc < 2 || strcmp(argv[1], "--help") == 0 || strcmp(argv[1], "-h") == 0)
{
cout << "Usage: " << '\n';
cout << argv[0] << '\n';
cout << " <char*> infile" << '\n'... | ALGO | 0.997119 | 5.416149 |
b2c503cd-2cd6-4f6d-a659-1083ea65e122 | lazybug19/DSA-QuestionBank | Graphs/UndirCycle_DFS.cpp | #include <bits/stdc++.h>
using namespace std;
bool dfs(int i, int parent, vector<vector<int>> &v, vector<int>& vis)
{
vis[i]=1;
for(auto child: v[i])//i -> parent
{
if(vis[child]!=1)
{
dfs(child,i,v,vis);
/*if(dfs(child,i,v,vis)) return true*/
}
else
... | ALGO | 0.999839 | 3.70649 |
b8c2b6d0-e20e-40c3-b5ab-d9a170d78769 | hungg261/local-judge-template-cp | local/GENERATOR/SOLVER.cpp | #include<bits/stdc++.h>
#define int long long
using namespace std;
// module xu li so lon
typedef string bigint;
namespace BIGINT{
int compare(const string&a,const string&b){
if(a.size()!=b.size())return a.size()>b.size()?1:-1;
return a.compare(b);
}
string add(const string&a,const string&... | ALGO | 0.999989 | 4.167909 |
558c6e56-4d27-4085-bae1-df60248cd920 | AlexCraciun6/Expanses_Tracker_App | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998859 | 6.785645 |
fb7af5e5-bf22-4c97-96a2-aa932340637f | aartajew/cocos2d-x-batching | cocos2d/cocos/base/CCProperties.cpp | #include "CCProperties.h"
#include <string.h>
#include "platform/CCPlatformMacros.h"
#include "platform/CCFileUtils.h"
#include "math/Vec2.h"
#include "math/Vec3.h"
#include "math/Vec4.h"
#include "math/Mat4.h"
#include "base/ccUTF8.h"
#include "base/CCData.h"
#include "deprecated/CCString.h"
USING_NS_CC;
// Utilit... | TOOL | 0.868155 | 6.74651 |
b0122156-7d2a-44ac-8145-a75c13b05c95 | gandyli/cp_lib | test/aoj/ITP1_3_D.test.cpp | #define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_3_D"
#include "all.hpp"
#include "math/divisors.hpp"
int main() {
dR(int, a, b, c);
int ans = 0;
foreach (d, divisors(u32(c)))
if (a <= d && d <= b)
ans++;
print(ans);
return 0;
} | ALGO | 0.99929 | 4.586832 |
b31bba8e-cc94-4413-aad8-35ed4a0cc8fc | nitish166/Website | Practice/loop.cpp | #include<bits/stdc++.h>
int detectloop(Node *head) {
// your code here
unordered_set<Node*> s;
while(head !=NULL)
{
if(s.find(head) !=s.end())
return true;
s.insert(head);
head=head->next;
}
return false;
}
| ALGO | 0.999963 | 4.68292 |
456a310f-2ddf-4ecb-aca6-086cb36ea8a3 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_150_62.cpp | #include <bits/stdc++.h>
using namespace std;
string str;
int jump(int start, int d) {
int res = 0;
for (int i = start; i < str.size() && str[i] == '*'; i += d, res++)
;
return res;
}
int main() {
int m;
cin >> m;
cin >> str;
int n = str.size() / 2 + 1;
int MAX = 0;
for (int i = 0; i < str.size() ... | ALGO | 0.999977 | 3.861277 |
9c36096c-1124-4c2a-b33e-5550a83dbd82 | dhruvjoshi137/Data_Structures_Algorithms | Lecture26/Generate_BalancedParantheses.cpp | #include <iostream>
using namespace std;
void f(char out[], int n, int i, int opencnt, int closecnt)
{
// base case
if (i == 2 * n)
{
// i have made decisions for 0 to 2n-1
out[i] = '\0';
cout << out << endl;
return;
}
// recursive case
if (opencnt < n)
{... | ALGO | 0.999703 | 4.490805 |
bae41880-0cf4-449d-ad8c-476327e281aa | Altu-Bitu-7/Altu-Bitu-KimYewon | 01_정렬_맵_셋/1431.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
//시리얼번호의 모든 자리수 합 구하기
int sum(string sn1) {
int result = 0;
for (int i = 0; i < sn1.length(); i++) {
if (isdigit(sn1[i])) { //숫자이면
result += sn1[i] - '0'; //char -> int
}
}
return result;
}
bool cmp(string sn1, string sn2) {
... | ALGO | 0.999949 | 6.11483 |
bafc1f05-57fa-4f8c-9076-483a402ce5bf | aggarwalanku/c-c-programmes | lexorder.cpp | #include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
void lexorder(char *str)
{
int length=strlen(str);
sort(str,str+length);
int m=1;
cout<<str<<endl;
while(m==1)
{
//cout<<str<<endl;
int count=0,index=length-1;
for (int i = length-1; i >0; i--)
{
if(str[i-1]<str[i])
{
... | ALGO | 0.99993 | 3.737458 |
54365291-fb2b-4935-977b-bdecdda611c7 | PaukIsUha/optimizing_formating_code | predictions/submissions-aizu-gpt35/Codenet/p01660/731502966/response_5.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAX_T = 3000, MAX_M = 300;
int M, start, goal, dice[6], *N;
vector<int> adj[MAX_M];
bool isPositionValid(int p) { return 0 <= p && p < M; }
void MakeGraph() {
for (int m = 0; m < M; m++) {
for (int r = 0; r < 6; r++) {
... | ALGO | 0.999986 | 4.164347 |
4ccd185a-0b46-4a6b-8b87-836b1bd20d0f | abhishek18124/PPCPPApril2023 | Lecture 09/001Arrays_FirstOccurrence.cpp |
// n <= 100
#include<iostream>
using namespace std;
int main() {
// int arr[] = {10, 20, 30, 10, 20};
// int n = sizeof(arr) / sizeof(int);
// int t = 20;
int arr[100]; // based on the constraints
int n;
cout << "enter the number of elements in the array : ";
cin >> n;
for(int i=0; i<n; i++) {
cin >>... | ALGO | 0.999728 | 5.874526 |
59fed03f-7166-4566-8e89-055098385d77 | Jodu-Karthik/Os | OsPreemptivePri.cpp | #include<bits/stdc++.h>
using namespace std;
struct process
{
string id;
int priority;
int arrTime;
int burstTime;
int tempBurstTime;
int compTime;
int turnAroundTime;
int waitingTime;
};
void findComp(vector<process> &p)
{
int n=p.size();
int remaining_pro=n;
int min_time=0;
while(remaining_pro>0)
{
i... | ALGO | 0.99988 | 4.184882 |
ea40065a-ae53-433a-b58f-f3badec639dd | DominicS99/Competitive-Programming | Leetcode/0860: Lemonade Change.cpp | class Solution {
public:
bool lemonadeChange(vector<int>& bills) {
int f = 0, t = 0;
for (int & c : bills) {
if (c == 5) {
f++;
} else if (c == 10) {
if (!f) return false;
t++; f--;
} else {
if (t && ... | ALGO | 0.999537 | 6.263741 |
b913056f-6c68-425c-bc5a-a11c90cc8388 | desromech/micro-physics | src/Frustum.cpp | #include "Frustum.hpp"
#include "Plane.hpp"
namespace UPhysics
{
void Frustum::makeOrtho(float left, float right, float bottom, float top, float nearDistance, float farDistance)
{
leftBottomNear = Vector3(left, bottom, -nearDistance);
rightBottomNear = Vector3(right, bottom, -nearDistance);
leftTopNear = Vector... | ALGO | 0.970367 | 6.804376 |
3feb123c-8fa3-4344-a1db-2901ac49d463 | sstuqtd/vocal | thridparty/boost/libs/math/src/tr1/cyl_bessel_kf.cpp | extern "C" float BOOST_MATH_TR1_DECL boost_cyl_bessel_kf BOOST_PREVENT_MACRO_SUBSTITUTION(float nu, float x) BOOST_MATH_C99_THROW_SPEC
{
return c_policies::cyl_bessel_k BOOST_PREVENT_MACRO_SUBSTITUTION(nu, x);
}
| TOOL | 0.876494 | 3.030694 |
6acec484-3cf7-4af8-ad51-5361938ad412 | ishandutta2007/codeforces | zbsnb/normal/1236/C.cpp | #include<iostream>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
#define ll long long
const ll mod=998244353;
int main(){
int n;cin>>n;
if(n%2==1){
for(int i=0;i<=n-1;i++)cout<<n/2+1+i*n<<" ";cout<<endl;
for(int i=1;i<=n/2;i++){
for(int j=0;j<=n-1;j++)cout... | ALGO | 0.999887 | 3.924062 |
37bf6dcf-d275-4f4e-a149-04e6bcde5e6a | Lianging/android_10_code | frameworks/av/media/libstagefright/codecs/amrnb/common/src/add.cpp | /*
Filename: /audio/gsm_amr/c/src/add.c
------------------------------------------------------------------------------
REVISION HISTORY
Description: Created separate file for add function. Sync'ed up with the
current template and fixed tabs.
Description: Changed all occurrences of L_sum with sum.
De... | ALGO | 0.99871 | 6.71736 |
6206a2f7-b15a-44af-9e66-29f5ff0cc570 | lpj0822/VideoSurveillantSystem | ImageSegmentation/maxflow/maxflow.cpp | /* maxflow.cpp */
#include <stdio.h>
#include "graph.h"
/*
special constants for node->parent
*/
#define TERMINAL ( (arc *) 1 ) /* to terminal */
#define ORPHAN ( (arc *) 2 ) /* orphan */
#define INFINITE_D ((int)(((unsigned)-1)/2)) /* infinite distance to the terminal */
/************************************... | ALGO | 0.998511 | 5.428074 |
74157df3-1ce5-4514-ad3c-da554d50c2f0 | ishandutta2007/codeforces | lomk/normal/1097/C.cpp | /*input
4
(
((
(((
(())
7
)())
)
((
((
(
)
)
*/
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define __builtin_popcount __builtin_popcountll
#define int long long
#define bit(x,y) ((x>>y)&1LL)
#define loop(i,l,r) for(int i=(int)... | ALGO | 0.999901 | 4.077229 |
91afa985-402c-4804-8121-e32429125df5 | grybd/Algorithms | 二分查找/二分法：两个有序数组长度为N，找到第N、N+1大的数.cpp | #include <bits/stdc++.h>
using namespace std;
//递归二分法求解
vector<int> GetMid(vector<int>& A, vector<int>& B, int a_start,int a_end,int b_start,int b_end,int N)
{
vector<int> result;
//初始化中间位置
int a_mid = (a_start + a_end) / 2;
int b_mid = (b_start + b_end) / 2;
//如果有答案了
if (A[a_mid] == B[b_mid])
{
result.push_ba... | ALGO | 0.999981 | 4.143174 |
124d134b-435d-4170-a9da-e0dc0fc74997 | ikanshifu/SOCS-Semester-1 | Binary Search/TestC(timelimit).cpp | #include <stdio.h>
//int binarySearch(long long *arr,long long left,long long right,long long find){
// if(arr[right+1]<=find){
// return right+2;
// }
//
// while(left<=right){
// int mid = left + (right-left)/2;
// if(arr[mid] <=find && find < arr[mid + 1]){
// return mid+1;
// }else if(arr[mid]<find){
// /... | ALGO | 0.999776 | 4.637067 |
7c39632f-229f-46bb-adf7-9bcd68c933b7 | isha-24/Leetcode | Isomorphic Strings.cpp | //https://leetcode.com/problems/isomorphic-strings/
class Solution {
public:
bool isIsomorphic(string s, string t) {
if(s.length()!=t.length())
return false;
unordered_map<char, char> m;
unordered_map<char, int> num;
for(int i=0; i<s.length(); i++){
if(m.find... | ALGO | 0.999959 | 6.315945 |
ca4394b3-cb59-474c-a6f6-40546b5c5251 | sstarodubov/algorithm_research | C++/codeforces_2/1791/d.cpp | #include<iostream>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int t;
void dec(unordered_map<char, int>&m, char k) {
m[k]--;
if (m[k] <= 0) {
m.erase(k);
}
}
void resolve() {
int n;
string s;
cin >> n;
cin >> s;
unordered_map<char, int> lm;
uno... | ALGO | 0.999931 | 5.422709 |
0dc26dfc-54c1-4092-ab79-38f61b90bc0a | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_10139_13.cpp | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int m = 0, n = 0;
cin >> m >> n;
if (m % n == 0) {
for (int i = 1; i <= n; i++) cout << m / n << " ";
cout << endl;
} else {
int t1 = m / n, t2 = m / n + 1;
for (int i = 1; i <= n; i++) {
if (i * t2 + (n - i) ... | ALGO | 0.99995 | 3.813764 |
149469ed-598e-4d1f-84f5-6d63dcb27494 | xivid/aoapc-bac1nd | part2/作者代码/ch5/10035.cpp | #include <stdio.h>
int main() {
int a, b;
while (scanf("%d%d",&a,&b) == 2){
if (!a && !b) return;
int c = 0, ans = 0;
for (int i = 9; i >= 0; i--) {
c = (a%10 + b%10 + c) > 9 ? 1 : 0;
ans += c;
a /= 10; b /= 10;
}
printf(%d\n, ans);
}
return 0;
}
| ALGO | 0.999887 | 3.671047 |
787f788d-1f00-444b-aa95-eec6c5d990e6 | songxiaokui/beginning | algorithm/problem/tree/109. 有序链表转换二叉搜索树.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
/**
* Definition for a binary tree node.
* struc... | ALGO | 0.999998 | 6.152158 |
165af5df-4171-42e4-be28-028c64fc4b59 | ishandutta2007/codeforces | sofapuden/normal/1228/A.cpp | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
bool def(string s){
set<char> sc;
for(char c : s){
sc.insert(c);
}
return sc.size() == s.size();
}
void solve(){
int l, r; cin >> l >> ... | ALGO | 0.999767 | 3.92728 |
6fc41e93-b455-4df3-a4ab-b5ab8d21fb03 | raincross7/code-similarity | codes/train_code/problem205/problem205_98.cpp | #include<iostream>
#include<cstdio>
using namespace std;
char s[4]={ 'R', 'Y', 'G', 'B' };
int main()
{
int h,w,d;
cin>>h>>w>>d;
int x,y;
for(int i=1;i<=h;i++,putchar('\n'))
for(int j=1;j<=w;j++)
{
x=i+j+w,y=i-j+w;
putchar(s[((x/d)&1)*2+((y/d)&1)]);
}
return 0;
} | ALGO | 0.998933 | 3.110191 |
61f4271b-0cdd-4a73-bbb0-719c48e0746a | ruby-kim/Algorithm | Baekjoon(BOJ)/17000~17999/17826.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n=0;
vector<int> v;
for(int i=0; i<50; i++){
int tmp=0;
cin>>tmp;
v.push_back(tmp);
}
s... | ALGO | 0.998909 | 3.925589 |
25087099-5173-487a-ac5b-2ff3cafa671e | pastgonex/Algorithm_go | 01_Acwing算法基础课/04_数学知识/05_扩展欧几里得/02_线性同余方程.cpp | #include <iostream>
using namespace std;
int n;
typedef long long ll;
int exgcd(int a, int b, int& x, int& y)
{
if (!b) {
x = 1, y = 0;
return a;
}
int d = exgcd(b, a % b, y, x);
y -= (a / b) * x;
return d;
}
int main()
{
cin >> n;
while (n--) {
int a, b, m;
... | ALGO | 0.999921 | 4.3774 |
26126231-1e7c-40ae-9af6-83ffbbfaed0c | haderech/libcxx | test/std/algorithms/alg.sorting/alg.min.max/requires_forward_iterator.fail.cpp | // <algorithm>
// template<ForwardIterator Iter>
// max_element(Iter first, Iter last);
#include <algorithm>
#include <cassert>
#include "test_iterators.h"
int main(int, char**) {
int arr[] = {1, 2, 3};
const int *b = std::begin(arr), *e = std::end(arr);
typedef cpp17_input_iterator<const int*> Iter;
{
... | TEST | 0.97058 | 5.517587 |
41880a7a-8400-4acf-a945-b3162ae73a0b | IshratMim/Coodeforces | amusing_joke.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
string a,b,c,final;
int count=-1;
cin>>a>>b>>c;
final=a+b;
sort(final.begin(),final.end());
sort(c.begin(),c.end());
for(int i=0;i<final.size();i++){
if(final[i]!=c[i]){
count++;
}
}
if(count==-1){
cout<... | ALGO | 0.999991 | 3.477507 |
4442c838-81f9-4861-9ef9-e0151b2138e5 | aryangupta02092002/NovemberChallenge2023 | GFG/AVLTreeInsertion.cpp | //{ Driver Code Starts
//
#include <bits/stdc++.h>
#define MAXN 2000
using namespace std;
struct Node
{
int data, height;
Node *left, *right;
Node(int x)
{
data=x;
left=right=NULL;
height=1;
}
};
bool isBST(Node *n, int lower, int upper)
{
if(!n) return 1;
if( n->da... | ALGO | 0.999963 | 6.163704 |
a157dc06-68f0-4c56-b090-1674dc9fc9c1 | DuNai0524/algorithm_solving | leetcode/editor/cn/LeetCode218.cpp | #include <bits/stdc++.h>
using namespace std;
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
public:
vector<vector<int>> getSkyline(vector<vector<int>>& buildings) {
}
};
//leetcode submit region end(Prohibit modification and deletion)
| ALGO | 0.999801 | 6.462734 |
05a4e162-aa45-402e-945a-81f0cc4f49e7 | priyanshu070702/leetcode | 0864-shortest-path-to-get-all-keys/0864-shortest-path-to-get-all-keys.cpp | class Solution {
public:
int dir[4][2] = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};
int shortestPathAllKeys(vector<string>& grid) {
int m = grid.size();
int n = grid[0].size();
queue<pair<pair<int, int>, int>> que;
vector<vector<unsigned long>> mapKey(m, vector<unsigned long>... | ALGO | 0.999854 | 5.781677 |
8e0a5a8a-eb45-4aca-8587-15c1b097181f | matthriscu/CSES | repetitions.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
size_t best = 0, current = 1;
for (size_t i = 1; i < s.size(); ++i)
if (s[i] == s[i - 1])
++current;
else {
best = max(current, best);
current = 1;
}
cout << max(current, be... | ALGO | 0.999836 | 3.742342 |
5e017928-9d68-4273-b71c-0ec67c3e2c5a | lakshaydhiman70/Competitive-Programming | CodeForces/Random Problem/TwinPermutations.cpp | #include<bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin>>n;
for(int i=0;i<n;i++){
int x;
cin>>x;
cout<<(n-x) + 1<<" ";
}
cout<<endl;
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", s... | ALGO | 0.999855 | 4.392642 |
3a437178-21d9-4393-a437-7a00bcc95e3d | Jobaieer/CodeForces-SS | Sheet-1/S.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
double x;
cin >> x;
if (x < 0 || x > 100)
{
cout << "Out of Intervals";
}
else if (x >= 0 && x <= 25)
{
cout << "Interval [0,25]";
}
else if (x > 25 && x <= 50)
{
cout << "Interval (25,50]";
... | ALGO | 0.972049 | 4.289519 |
294e2f3d-11ff-4735-bdc8-fe3bf8bf27b8 | eslamsherif/CarND_Project10MPC | src/Eigen-3.3/doc/examples/DenseBase_middleCols_int.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
int main(void)
{
int const N = 5;
MatrixXi A(N,N);
A.setRandom();
cout << "A =\n" << A << '\n' << endl;
cout << "A(1..3,:) =\n" << A.middleCols(1,3) << endl;
return 0;
}
| ALGO | 0.874149 | 3.133398 |
005853e7-87f6-4fbc-a283-5f4b06fdeff1 | junseok16/Programmers | Programmers/Lv. 0/개미 군단.cpp | /*
* @title : 개미 군단(Lv. 0)
* @content : 코딩테스트 입문
* @author : 탁준석
* @date : 230111
* @state : 완료
*/
#include <string>
#include <vector>
using namespace std;
int solution(int hp) {
int answer = 0;
answer += hp / 5;
hp %= 5;
answer += hp / 3;
hp %= 3;
answer += hp;
return answer;... | ALGO | 0.998576 | 4.191443 |
5ca7d0e4-6e45-4086-bb41-ffc6f6604772 | pastine/taller-micromachines | libs/Box2D/Dynamics/Joints/b2PulleyJoint.cpp | #include "Box2D/Dynamics/Joints/b2PulleyJoint.h"
#include "Box2D/Dynamics/b2Body.h"
#include "Box2D/Dynamics/b2TimeStep.h"
// Pulley:
// length1 = norm(p1 - s1)
// length2 = norm(p2 - s2)
// C0 = (length1 + ratio * length2)_initial
// C = C0 - (length1 + ratio * length2)
// u1 = (p1 - s1) / norm(p1 - s1)
// u2 = (p2 -... | ALGO | 0.987661 | 6.877583 |
384f5256-c94c-40ae-bcb0-6a9cd9632d71 | Daejjyu/Algorithm | Baekjoon/10952_2.cpp | #include <iostream>
int main()
{
int A, B;
while (~scanf("%d %d", &A, &B)) {
if (A == 0 && B == 0)
break;
printf("%d\n", A + B);
}
} | ALGO | 0.997253 | 3.507811 |
db09cba2-697a-4f06-828b-61bb76ab7dbf | Jaycelation/DSA-PTIT | Contest 6 - Sap xep - Tim kiem/CTDL_005 - Xoa du lieu trong DSLK don.cpp | #include <bits/stdc++.h>
#define _ 0
using namespace std;
int main() {
int n; cin >> n;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int x; cin >> x;
for (int i = 0; i < n; ++i) {
if (a[i] != x)
cout << a[i] << " ";
}
return (0^_^0);
}
| ALGO | 0.999679 | 3.215665 |
c312070c-6e01-4877-a1e1-355532b651e4 | grinisrit/inq | tests/hydrogen_local.cpp | /* -*- indent-tabs-mode: t -*- */
#include <systems/ions.hpp>
#include <systems/electrons.hpp>
#include <config/path.hpp>
#include <input/atom.hpp>
#include <utils/match.hpp>
#include <ground_state/initial_guess.hpp>
#include <ground_state/calculate.hpp>
#include <input/environment.hpp>
int main(int argc, char ** ar... | ALGO | 0.985914 | 5.693184 |
0bf5a0bf-a640-430d-803c-a1e205201399 | seanwarren/bioimageconvert | libsrc/libraw/internal/dht_demosaic.cpp | /*
* функция вычисляет яркостную дистанцию.
* если две яркости отличаются в два раза, например 10 и 20, то они имеют такой же вес
* при принятии решения об интерполировании, как и 100 и 200 -- фотографическая яркость между ними 1 стоп.
* дистанция всегда >=1
*/
static inline float calc_dist(float c1, float c2) {
... | ALGO | 0.997614 | 4.842167 |
54692bfe-510d-4fb2-8b5d-26be47ed7835 | NishantKSinha/LeetCode | 0110-balanced-binary-tree/0110-balanced-binary-tree.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.999641 | 6.428988 |
2b6424ad-8a2a-4489-8d98-b87b3e037e8a | schnoog/Marlin2.1 | Marlin/src/gcode/bedlevel/abl/G29.cpp | /**
* G29.cpp - Auto Bed Leveling
*/
#include "../../../inc/MarlinConfig.h"
#if HAS_ABL_NOT_UBL
#include "../../gcode.h"
#include "../../../feature/bedlevel/bedlevel.h"
#include "../../../module/motion.h"
#include "../../../module/planner.h"
#include "../../../module/stepper.h"
#include "../../../module/probe.h"
#... | ALGO | 0.98183 | 6.20001 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.