uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
a31b548d-4b81-438a-ad48-4fa98fa90370 | ishandutta2007/codeforces | andreasyan/normal/1296/B.cpp | #include <bits/stdc++.h>
using namespace std;
void solv()
{
long long x;
scanf("%lld", &x);
long long ans = 0;
while (1)
{
if (x < 10)
{
ans += x;
break;
}
ans += (x / 10) * 10;
x = x - (x / 10) * 10 + (x / 10);
}
printf("%lld\... | ALGO | 0.999825 | 4.650596 |
7352a144-82ef-404c-bdde-084090477e92 | allen-quad-robot/MiLAB-Cheetah-Software | user/MiLAB_Controller/Controllers/VisionMPC/VisionSolverMPC.cpp | #include "VisionSolverMPC.h"
#include "../convexMPC/common_types.h"
#include "VisionMPC_interface.h"
#include "VisionRobotState.h"
#include <eigen3/Eigen/Dense>
#include <cmath>
#include <eigen3/unsupported/Eigen/MatrixFunctions>
#include <qpOASES.hpp>
#include <stdio.h>
#include <sys/time.h>
#define V_BIG_NUMBER 5e10... | ALGO | 0.999798 | 3.62195 |
199a374b-e37e-4759-a78c-cc526321c06b | siddharthaggarwal25/cp-_notes_ques | A_Minimal_Coprime.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main (){
int t ;
cin>>t ;
while( t--){
int n ,l , r ;
cin>>n>>l>>r ;
vector<int > v( n);
for( int i=0 ;i< n ;i++)cin>>v[i];
sort( v.begin() , v.end());
int sum ... | ALGO | 0.99983 | 3.911485 |
f8fe293f-785b-41a2-bc07-e6d27dbc3970 | alexis51151/llvm-repo | llvm/lib/MCA/Support.cpp | #include "llvm/MCA/Support.h"
#include "llvm/MC/MCSchedule.h"
namespace llvm {
namespace mca {
#define DEBUG_TYPE "llvm-mca"
ResourceCycles &ResourceCycles::operator+=(const ResourceCycles &RHS) {
if (Denominator == RHS.Denominator)
Numerator += RHS.Numerator;
else {
// Create a common denominator for LH... | TOOL | 0.936756 | 6.959136 |
e9aceb92-1c2f-425a-935e-40921f31e4b4 | SubashChandra/geeksCoding | 1_LinkedLists/13_detectLoop2.cpp | //given a linked list detect if there is a loop
//using two pointers slow nd fast
//O(n) time
//O(1) space
#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
struct node
{
int data;
struct node *next;
struct node *arbitptr;
};
typedef struct node Listnode;
typedef Listnode *Listnodeptr;
... | ALGO | 0.999568 | 4.007358 |
da4046e1-f5c5-4585-bd0f-bce4d29a7364 | sudachi-emu/dynarmic | src/dynarmic/frontend/A64/translate/impl/simd_shift_by_immediate.cpp | #include <mcl/bit/bit_count.hpp>
#include "dynarmic/common/fp/rounding_mode.h"
#include "dynarmic/frontend/A64/translate/impl/impl.h"
namespace Dynarmic::A64 {
namespace {
enum class Rounding {
None,
Round
};
enum class Accumulating {
None,
Accumulate
};
enum class Signedness {
Signed,
Unsig... | ALGO | 0.92572 | 7.693911 |
f45888eb-9ceb-4884-9f19-29e082991251 | SoftRobotics/physics-toolbox | source/originals/bullet-2.82-r2704/Demos/EPAPenDepthDemo/PenetrationTestBullet.cpp |
///contribution by Pierre Terdiman to check penetration depth solvers
///see http://www.continuousphysics.com/Bullet/phpBB2/viewtopic.php?t=638
#ifdef WIN32//for glut.h
#include <windows.h>
#endif
//think different
#if defined(__APPLE__) && !defined (VMDMESA)
#include <OpenGL/gl.h>
#include <OpenGL/glu.h>
#include <... | ALGO | 0.998227 | 5.293925 |
319734ff-8c87-4471-882d-87d0ec2bf8ee | paramarthiphukan/LeetCodes | Subarray with given sum - GFG/subarray-with-given-sum.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
//Function to find a continuous sub-array which adds up to a given number.
vector<int> subarraySum(vector<int>arr, int n, long long s)
{
// Your code here
if(s==0L)
... | ALGO | 0.999905 | 5.472754 |
632f1624-05ab-4ee8-b767-691d61a12bfe | mmalka/TheNoobBot | meshReader/RecastLayer/Recast/RecastArea.cpp | #include <float.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include "Recast.h"
#include "RecastAlloc.h"
#include "RecastAssert.h"
/// @par
///
/// Basically, any spans that are closer to a boundary or obstruction than the specified radius
/// are marked... | ALGO | 0.994525 | 5.651413 |
d92e3408-b80f-4118-a719-0549c0ae2e60 | vbonnici/grafe-sim | analysis/data/p01314/s658233667.cpp |
#include <stdio.h>
int p=0;
int solve(int n){
int i=1,k=0,l=1;
while(i<n){
k=i;
l=k+1;
while(k<=n){
k=k+l;
l++;
if(k==n){
p++;
break;
}
}
i++;
}
return k;
}
int main(voi... | ALGO | 0.999794 | 3.882133 |
199c09d2-4eeb-470a-883e-fba56c8cbf2b | otto-krause/Guia-Clase-10-Lucas-Geronimo | trabajo integrador/3.cpp |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int fac,cant,pu,nump,pmv,mv,vtotal,i=0;
printf("\n Ingrese la factura ");
scanf("%d",&fac);
while (fac!=999){
printf("\n Ingrese la cantidad ");
scanf("%d",&cant);
printf("\n Ingrese el precio unitario ");
scanf("%d",&pu);
printf("\n Ingrese el numero... | ALGO | 0.976055 | 3.393375 |
54874c5f-de36-4ac9-a025-f652bb949d07 | Moazgamal/LeetCode-Problems | 3686-count-beautiful-splits-in-an-array/3686-count-beautiful-splits-in-an-array.cpp | class Solution {
long long MOD = 1e9+7;
long long BASE= 31;
bool isPrefix(int start1, int end1, int start2, int end2, vector<long long> &p, vector<long long> &pow)
{
int len1 = end1 - start1;
int len2 = end2 - start2;
if (len1 > len2)
{
return false;
... | ALGO | 0.999971 | 5.321279 |
4d609f61-735d-4d94-8b45-68c1b301e334 | iamjay/Qt | src/gui/graphicsview/qgraphicssceneindex.cpp | /*!
\class QGraphicsSceneIndex
\brief The QGraphicsSceneIndex class provides a base class to implement
a custom indexing algorithm for discovering items in QGraphicsScene.
\since 4.6
\ingroup graphicsview-api
\internal
The QGraphicsSceneIndex class provides a base class to implement
a ... | TOOL | 0.914655 | 6.776713 |
49f23485-019b-46b9-9549-4640dc6da527 | rickyggg/leetcode_and_swordoffer | src/swordoffer/33_二叉搜索树的后序遍历序列.cpp | class Solution {
public:
bool verifyPostorder(vector<int>& postorder) {
stack<int> s;// 单调栈,其中的元素单调递增
// 表示上一个根节点的元素，这里可以把postorder的最后一个元素root看成无穷大节点的左孩子l
int pre_elem = INT_MAX;
//逆向遍历（根->右->左）
for(int i = postorder.size() - 1; i >= 0; --i) {
// 左子树元素必须要小于单调栈中的根和... | ALGO | 0.999992 | 5.969191 |
2cf4f84f-6a6d-4f64-8a18-be1a7e3abef1 | goel-aadhaar/Competitive-Coding | OneAndTwo.cpp | #include <bits/stdc++.h>
using namespace std;
#define f(i, start, end) for (int i = start; i < end; i++)
#define fs(i, start, end, step) for (int i = start; i < end; i = i + step)
#define fr(i, start, end) for (int i = start; i > end; i--)
#define all(arr) arr.begin(), arr.end()
#define vi vector<int>
#define vvi vec... | ALGO | 0.999589 | 4.926954 |
8a42838a-6581-4fbc-8bc3-30c9487ffbbb | OlegRS/p_star_and_heat_hierarchy | GraphOS/src/labeling.cpp | #include "labeling.hpp"
#define QUIET_MODE // disables printing of some common warnings and info
// #define SILENT_MODE // disables printing of most warnings and info
#ifdef SILENT_MODE
#define QUIET_MODE
#endif
labeling::labeling() : size(0), radix(0), array(NULL), class_counters(NULL) {}
labeling::labeling(const u... | ALGO | 0.982988 | 4.3838 |
b783d5c0-43ab-4a1d-9546-82b6e9ba37b2 | diehlpkpapers/heat-ai | cpp/cgm-ai.cpp | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
// Function to perform matrix-vector multiplication: y = A*x
void matVecMult(const vector<vector<double>>& A, const vector<double>& x, vector<double>& y) {
int n = A.size();
for (int i = 0; i < n; ++i) {
y[i] = 0.0;
fo... | ALGO | 0.99999 | 4.820959 |
7f69bde6-a235-4eaf-a125-b270646b1fb1 | Bostrix/FSL-fnirt | newimage/miscmaths/armawrap/tests/newmat/newmat3.cpp | //$$ newmat3.cpp Matrix get and restore rows and columns
//#define WANT_STREAM
#include "include.h"
#include "newmat.h"
#include "newmatrc.h"
#ifdef use_namespace
namespace NEWMAT {
#endif
#ifdef DO_REPORT
#define REPORT { static ExeCounter ExeCount(__LINE__,3); ++ExeCount; }
#else
#define REPORT {}
#endif
... | TOOL | 0.884219 | 3.492424 |
ae8943fb-1fc1-4f98-8d23-8a390c716d5a | veselinoWiktor/FMI-Object-Oriented-Programming | Seminars/Week08/SwapCounter/Source.cpp | #include <iostream>
#include "SwapCounter.h"
void bubbleSort(int* arr, size_t size)
{
for (size_t i = 0; i < size - 1; i++)
{
bool isSwapped = false;
for (size_t j = 0; j < size - 1 - i; j++)
{
if (arr[j + 1] < arr[j])
{
SwapCounter::swap(arr[j], arr[j + 1]);
isSwapped = true;
}
}
if (!i... | ALGO | 0.958048 | 5.519829 |
6c662a80-b83e-4bc3-8fff-a70e53506dfd | MikaelVallenet/R-Type | libs/boost/libs/graph/example/clustering_coefficient.cpp | //[code_clustering_coefficient
#include <iostream>
#include <iomanip>
#include <boost/graph/undirected_graph.hpp>
#include <boost/graph/exterior_property.hpp>
#include <boost/graph/clustering_coefficient.hpp>
#include "helper.hpp"
using namespace std;
using namespace boost;
// The Actor type stores the name of each ... | ALGO | 0.99969 | 6.874402 |
0ba83d49-7db3-4926-8fc0-308f441c3772 | merelydust/PAT-Advanced-Level | 算法笔记/A1022_Digital Library.cpp | /***
IO说明：
第一行 书的总数N(<=10000) 接下来N*6行
书的7位ID
书名字符串
作者名字符串 (只有一位作者)
书的关键词们 以空格分隔 (<=5个)
出版商字符串
出版年份【1000，3000】
（总关键词不超过1000个 总出版社不超过1000个 书的信息输入完成后）
M 查询总数(<=1000) 接下来M行 每行采取以下一种查询方式
1: 书名
2: 作者名
3: 关键词
4: 出版商名
5: a 4-digit number representing the year
对每一条查询 首先输出原始查询语句
按升序输出查到的书ID 每个ID占一行
如果没找到 输出 N... | ALGO | 0.990032 | 3.893699 |
8fe7085c-c047-44a5-b431-2d564c83dcf2 | cmin764/cmiN | FII/L3/GPC/8/vecin2.cpp | /*
Determinarea vecinului unui nod cu care este
partajata o muchie intr-un ACOS4
a
Notatii: (->,a) denota ---> ,
\inclus este operatorul de incluziune,
\in este operatorul de apartenenta,
daca d este un drum de lungime |d|: d[0]d[1]...d[|d|-1]
atunci drumu... | ALGO | 0.999741 | 5.961794 |
4bd5aca1-314f-4000-91bd-6a2e3b31fe22 | elmerjani/competitive-programming | F_Even_Odd_Country.cpp | #include <iostream>
#include <vector>
#include <stack>
using namespace std;
class DSU {
private:
vector<int> parent, rank;
public:
DSU(int n) {
parent.resize(n);
rank.resize(n, 0);
for (int i = 0; i < n; ++i) {
parent[i] = i;
}
}
int find(int u) {
i... | ALGO | 0.999971 | 4.798448 |
cb6208aa-26f7-4289-a961-39191fb440eb | sarvex/leetcode-purescript | solution/0000-0099/0006.Zigzag Conversion/Solution.cpp | class Solution {
public:
string convert(string s, int numRows) {
if (numRows == 1) return s;
string ans;
int group = 2 * numRows - 2;
for (int i = 1; i <= numRows; ++i) {
int interval = i == numRows ? group : 2 * numRows - 2 * i;
int idx = i - 1;
w... | ALGO | 0.999998 | 6.244291 |
bab5016c-7ed9-4d6b-b356-94af464ba2ef | ShuangShuang0411/gamer-fork_debug_cooling | src/Init/Init_FFTW.cpp | #include "GAMER.h"
#ifdef SUPPORT_FFTW
static int ZIndex2Rank( const int IndexZ, const int *List_z_start, const int TRank_Guess );
#ifdef GRAVITY
extern real (*Poi_AddExtraMassForGravity_Ptr)( const double x, const double y, const double z, const double Time,
const int ... | ALGO | 0.998108 | 3.745069 |
bd21f962-a5aa-4df9-928f-05bd9190c58a | LuisCarlosRojasTorres/CoDecode | CoDecode/CipherCaesar.cpp | #include "CipherCaesar.h"
#include <iostream>
#include <QDebug>
CipherCaesar::CipherCaesar()
{
this->shift = 0;
setRosettaCharToInt();
setRosettaIntToChar();
}
CipherCaesar::CipherCaesar(int shift)
:
shift(shift)
{
setRosettaCharToInt();
setRosettaIntToChar();
}
QString CipherCaesar::e... | ALGO | 0.946328 | 4.647442 |
8d5dfd70-1fc1-47aa-a8b9-850328957d28 | ashokkelur/CBMC-With-DSP-C | dsp-checking/src/solvers/smt2/smt2_prop.cpp | /*******************************************************************\
Module:
Author: Daniel Kroening, <EMAIL>
\*******************************************************************/
#include <assert.h>
#include <i2string.h>
#include "smt2_prop.h"
/******************************************************************... | TOOL | 0.954065 | 6.877191 |
f827e0f7-a161-4166-a62c-79e0b2fb06ff | thebesttv/00.ACM | 02.LuoGu/4568.cpp | // Tag: 分层图 最短路
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<ctime>
#include<vector>
#include<queue>
#include<stack>
#include<list>
#include<set>
#include<map>
#include<utility>
#include<algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(... | ALGO | 0.999975 | 3.937774 |
6280af04-b5ef-4120-af4c-940b9198f5b3 | qsnake/trilinos | packages/isorropia/src/epetra/Isorropia_EpetraOrderer.cpp | //@HEADER
//@HEADER
#include <Isorropia_EpetraOrderer.hpp>
#ifdef HAVE_ISORROPIA_ZOLTAN
#include <Isorropia_EpetraZoltanLib.hpp>
#endif
#include <Isorropia_Exception.hpp>
#include <Isorropia_Epetra.hpp>
#include <Isorropia_EpetraCostDescriber.hpp>
#include <Teuchos_RCP.hpp>
#include <Teuchos_ParameterList.hpp>
#ifd... | ALGO | 0.969186 | 6.48563 |
99daf5f7-5667-4f9a-aa78-6ca873f37f9d | nchong/ic_liggghts | src/fix_recenter.cpp | /* ----------------------------------------------------------------------
Contributing author: Naveen Michaud-Agrawal (Johns Hopkins U)
------------------------------------------------------------------------- */
#include "stdlib.h"
#include "string.h"
#include "fix_recenter.h"
#include "atom.h"
#include "group.h"
... | TOOL | 0.995525 | 6.156011 |
61360dc9-f58d-493d-8f67-224af50b0e41 | Lucasmiles99/Selection-Sort | Projeto_Final/Serial.cpp | #include <iostream>
#include <vector>
#include <chrono>
#include <random>
#include <windows.h>
#include <algorithm>
using namespace std;
using namespace std::chrono;
void selectionSort(vector<int>& arr) {
int n = arr.size();
for (int i = 0; i < n - 1; i++) {
int minIndex = i;
for (int j = i ... | ALGO | 0.996075 | 6.230927 |
0ca34974-8ed4-4e03-a75f-1991af83289a | Abhishek-Verma0/Awesome-DSA-With-C-Plus-Plus | 12-Sorting/QuickSort.cpp | #include <bits/stdc++.h> // Includes all standard C++ libraries
using namespace std;
/*
QUICK SORT ALGORITHM
---------------------
Quick Sort is a **divide and conquer** algorithm.
Working:
- Pick an element as a "pivot" (in this implementation, we use the first element).
- Partition the array... | ALGO | 0.999992 | 6.478609 |
8941098d-b855-40fa-8823-7b401fb1a022 | ishandutta2007/codeforces | errichto/normal/1540/A.cpp | #include <bits/stdc++.h>
using namespace std;
void test_case() {
int n;
scanf("%d", &n);
vector<int> d(n);
for(int& x : d) {
scanf("%d", &x);
}
long long answer = *max_element(d.begin(), d.end());
// for(int i = 0; i < n; ++i) {
// for(int j = i + 1; j < n; ++j) {
// answer -= abs(d[i] - d[j]);
// }
/... | ALGO | 0.999675 | 4.380795 |
f47fe1b6-aa51-460a-9a4d-9c139f64cbe6 | Pritish-Wakhare/cpp-practice | palindrome.cpp | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | ALGO | 0.999637 | 4.388484 |
09f8573b-da9d-4b14-a6b4-027a5776618b | raincross7/code-similarity | codes/train_code/problem417/problem417_281.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
int main()
{
string S; cin>>S;
ll n=0;
rep(i,S.size())
{
if(i==0)
{
continue;
}
if(S.at(i)!=S.at(i-1))
{
n++;
}
}
cout<<n<<endl;
... | ALGO | 0.999951 | 3.844478 |
3bc66e4c-0e24-4fdb-92e9-686bf78032a3 | Andrealavi/Computer-Programming-II | bst/key.cpp | #include "key.h"
#include <iostream>
using namespace std;
int compareKey(keyType k1, keyType k2) { return k1 - k2; }
void copy(keyType &k1, keyType k2) { k1 = k2; }
void printKey(keyType k) { cout << k; } | TOOL | 0.940366 | 3.433247 |
70932f3f-1c20-4ab9-ab42-9b60c07e8953 | Reedric/CS3451FinalProject | ext/eigen/bench/sparse_cholesky.cpp | // #define EIGEN_TAUCS_SUPPORT
// #define EIGEN_CHOLMOD_SUPPORT
#include <iostream>
#include <Eigen/Sparse>
// g++ -DSIZE=10000 -DDENSITY=0.001 sparse_cholesky.cpp -I.. -DDENSEMATRI -O3 -g0 -DNDEBUG -DNBTRIES=1 -I /home/gael/Coding/LinearAlgebra/taucs_full/src/ -I/home/gael/Coding/LinearAlgebra/taucs_full/build/lin... | ALGO | 0.994451 | 4.147974 |
1b756295-4a5d-45ee-b1cc-0740c93b474d | amarsde2/c- | greedy/maxmin.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
long long maxDiff = 0, minDiff = 0;
sort(a.begin(), a.end());
// Calculate max difference
for(int i = 0; i < n/2; i++){
maxDi... | ALGO | 0.999924 | 4.354158 |
700c57c7-49d2-49ed-92f9-5e0a61b847c6 | shdhrubo/LeetCode | 2114-maximum-number-of-words-found-in-sentences/2114-maximum-number-of-words-found-in-sentences.cpp | class Solution {
public:
int mostWordsFound(vector<string>& sentences) {
int maxValue=0;
for(string s:sentences){
int m=1;
for(int i=0;s[i]!='\0';i++){
if(s[i]==' '){
m++;
}
maxValue=max(maxValue,m);
... | ALGO | 0.999933 | 5.523029 |
ea1692d0-ffcb-443e-aef3-3e4290f2cd3d | duchenlong/boost-search-engine | boost/install/boost_1_53_0/libs/geometry/doc/src/examples/algorithms/reverse.cpp | // Boost.Geometry (aka GGL, Generic Geometry Library)
// QuickBook Example
//[reverse
//` Shows how to reverse a ring or polygon
#include <iostream>
#include <boost/geometry.hpp>
#include <boost/geometry/geometries/polygon.hpp>
#include <boost/geometry/geometries/ring.hpp>
#include <boost/geometry/geometries/adapted... | TOOL | 0.97025 | 7.230124 |
7237bce8-c490-49bc-ac36-ce61dcb818ac | SYSUMSC/Share | CSP-solutions/CSP-201809-3/test.cpp | #include <string>
#include <iostream>
#include <map>
#include <sstream>
#include <algorithm>
#include <set>
#include <stack>
#include <vector>
using namespace std;
void split(const string &str, char delimiter, vector<string> &out)
{
string last;
for (int i = 0; i < str.size(); ++i)
if (str[i] == delimiter)
{
... | ALGO | 0.999045 | 4.159556 |
519f4411-543e-4a48-bd29-702a837a147e | k3shavkish0re/my_cpp_practice_2021 | Stack_using_array.cpp | #include<bits/stdc++.h>
using namespace std;
#define MAX 1000
int stackk[MAX];
int* top = stackk;
int size = 0;
void push(int num){
if(size >= MAX){cout<<"Overflow"<<endl;;}
else{
top = top+1;
*top = num;
size++;
}
}
void pop(){
if(size == 0){cout<<"Underflow"<<endl;}
... | ALGO | 0.997952 | 3.880062 |
fd39bf17-ea13-4b05-b10e-9ec40d296eda | AstroGeeKX/mud | luogu/p5731.cpp | #include <bits/stdc++.h>
using namespace std;
int a[15][15];
int main()
{
int n, k = 1, x = 1, y = 0;
cin >> n;
// 这些逻辑很可以 元素值为0表示没有填充
// y > 1 (但不是x > 1）是防止最外一层左边界的问题 情况是左下角a[n - 1][-1]的时候 y下标-1是未定义行为
// 循环条件前面y < n等用于最外一层的情况，其余循环起作用的是!a[][]等的条件
while (k <= n * n)
{
while (y < n && ... | ALGO | 0.999887 | 3.18247 |
f84332b9-3dc5-4f53-903d-2987ba0d16d0 | peacecoder229/systemp | oneDNN/src/cpu/x64/matmul/brgemm_matmul_reorders.cpp | #include "common/dnnl_thread.hpp"
#include "cpu/x64/matmul/brgemm_matmul_reorders.hpp"
namespace dnnl {
namespace impl {
namespace cpu {
namespace x64 {
using namespace format_tag;
format_tag_t get_otag(const memory_desc_t &dst_md) {
const memory_desc_wrapper od(dst_md);
const auto vnni_granularity = data_... | ALGO | 0.958957 | 7.489503 |
03fb3ada-9275-49ae-8717-823fcf7910c0 | YeongjeKim/CodeTree | 250302/제곱하여 출력하기/print-square-of-elements.cpp | #include <iostream>
using namespace std;
int main() {
int n;
int arr[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
cout << arr[i] * arr[i] << " ";
}
return 0;
} | ALGO | 0.999628 | 4.030837 |
efa4819e-21ec-4232-925a-26a66792c7f3 | hylTianMeng/PreCode | c++/Atcoder/ABC239/F.cpp | #include<bits/stdc++.h>
#define dd double
#define ld long double
#define ll long long
#define uint unsigned int
#define ull unsigned long long
#define N 200010
#define M number
using namespace std;
const int INF=0x3f3f3f3f;
template<typename T> inline void read(T &x) {
x=0; int f=1;
char c=getchar();
for(... | ALGO | 0.999977 | 3.877838 |
e37bbef6-061e-4c25-a382-6b5bc7b30fb8 | vishnujeet0609/my-dsa-submissions | july/2316-count-hills-and-valleys-in-an-array/count-hills-and-valleys-in-an-array.cpp | //T.C : O(n)
//S.C : O(1)
class Solution {
public:
int countHillValley(vector<int>& nums) {
int n = nums.size();
int i = 0; //points to non-equal neighbour in the left hand side
int j = 1; //points to non-equal neighbour in the right hand side by [j+1]
int count = 0;
while... | ALGO | 0.999972 | 5.54986 |
505c1aee-1700-443a-bb45-b1ec1ed76b14 | tayu0110/atcoder | abc/abc213e.cpp | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
using namespa... | ALGO | 0.999954 | 3.849087 |
830d5f61-ecd0-405a-80e6-67eec7d5efde | chaghdashko/hackerrank | tutorials/30_days_of_code/Day18_queues_n_stacks.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
class Stack {
private:
vector<char> v;
public:
void push(char data) {
v.push_back(data);
}
char pop() {
int val = v[v.size() - 1];
v.erase(v.begin() + v.size() - 1);
return val;
}
};
class Queue {
private:
vector<char> v;
pub... | ALGO | 0.999965 | 6.017685 |
33654d31-6b34-414d-a633-b035a69a8378 | Samir16113/Discrete-Structure-CSIT-LAB1 | A git/cartesianproduct.cpp | //Write a program that takes two or more sets as input and produces their
//Cartesian product as output.
#include<iostream>
using namespace std;
int main(){
int a[100],b[100];
int n,m,i,j;
cout<<"Enter the no of 1st set";
cin>>n;
if(n>100){
cout<<"Enter again"... | ALGO | 0.924521 | 3.94897 |
e703045c-0f29-42ad-b9dc-17e1b115fc7b | HARRISAMIN432/codeforces | threeIndices.cpp | #include <iostream>
#include <vector>
using namespace std;
int main()
{
ios::sync_with_stdio(false), cin.tie(0);
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
vector<int> nums(n);
for (int i = 0; i < n; i++)
cin >> nums[i];
int k = n;
in... | ALGO | 0.999699 | 3.706946 |
bfb3c7e8-68c5-4141-9213-57fcbe0a6b9c | diegocgr/codigo_muestra | C++/operaciones_matrices.cpp | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main(void){
int i, j; ///i para filas, j para col's (columnas)
int Atabla[5][5];
int Btabla[5][5];
int Rtabla[5][5];
int mult[1][1]={0}, suma[1][1]={0};
int Afil, Acol, Bfil, Bcol, x, Aelec, Belec, ope;
int Afn=0, Acn=0, Bfn=0, B... | ALGO | 0.951163 | 3.3186 |
5747c6e9-0eb2-4159-a154-9190c1ede67c | XDUgaile/Data-Structure | 线性表上机/264反转链表.cpp | #include<iostream>
#include<cstdio>
#include<malloc.h>
using namespace std;
typedef struct LinkList{
int num;
LinkList *next;
}LinkList;
LinkList* creatList(int cnt){
LinkList* head, * s, *r;
head=(LinkList*)malloc(sizeof(LinkList)); //ͷڵhead
r = head; //βָָͷڵ
for(int i=0; i<cnt;i++){
s=(LinkLis... | ALGO | 0.999725 | 3.417209 |
473d1575-e917-4eee-8b0c-c7e26c529705 | vryy/kratos_bcn3 | kratos/utilities/apply_function_to_nodes_utility.cpp | // System includes
// External includes
// Project includes
#include "utilities/parallel_utilities.h"
#include "utilities/apply_function_to_nodes_utility.h"
namespace Kratos
{
void ApplyFunctionToNodesUtility::ApplyFunction(
const Variable<double>& rVariable,
const double t
)
{
// Get function
... | ALGO | 0.999024 | 7.064418 |
a834d73a-89bd-4202-bc17-5c991a37d051 | LucaCraft89/C_Class3AIA | 2023.10.18/ex2.cpp | //
// Created by lucac on 10/18/2023.
//
#include <iostream>
using namespace std;
int main() {
int a=0, in;
cin >> in;
for (int i = 0; i < in+2; ++i) {
cout << "=" << " ";
}
cout << endl;
for (int i = 2; i < in+2; ++i) {
cout << "= ";
for (int j = 0; j < i-1; ++j) {
... | ALGO | 0.999631 | 4.225358 |
a679d32c-42c5-451c-94db-1d872c72c8c7 | Time1ess/MyCodes | CtCI/1.7-Reset Matrix/solution.cpp | class Clearer {
public:
vector<vector<int> > clearZero(vector<vector<int> > mat, int n) {
// write code here
vector<bool> rows(n, false), cols(n, false);
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
if(mat[i][j] == 0) {
rows[i] = true;... | ALGO | 0.999753 | 5.757864 |
ee5be173-28b0-46bd-a852-00ba29d0c383 | paulosestini/tcc-lorawan-end-device | sta/active_sta/managed_components/espressif__eigen/eigen/doc/snippets/Tutorial_AdvancedInitialization_LinSpaced.cpp | ArrayXXf table(10, 4);
table.col(0) = ArrayXf::LinSpaced(10, 0, 90);
table.col(1) = M_PI / 180 * table.col(0);
table.col(2) = table.col(1).sin();
table.col(3) = table.col(1).cos();
std::cout << " Degrees Radians Sine Cosine\n";
std::cout << table << std::endl;
| ALGO | 0.915762 | 3.543272 |
9bb9c344-ea85-4cde-ac30-c6db780907f7 | lagadreshma/cpp | pairSum.cpp | #include<iostream>
using namespace std;
void findPairs(int arr[], int size, int sum){
for(int i = 0; i < size; i++){
for(int j = (i + 1); j < size; j++){
if(arr[i] + arr[j] == sum){
cout << arr[i] << " " << arr[j] << endl;
}
}
}
}
int main(){
int ... | ALGO | 0.999698 | 4.875274 |
e40b0a87-7cc1-4ee3-b162-18a46fd978c0 | rylahs/Algorithm-2024- | BOJ/24.01/24.01.14/2751.cpp | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
for (auto& e : v)
cout << e << "\n";
return 0;
} | ALGO | 0.999828 | 4.613556 |
89985192-d5ed-41e3-9abe-1e9a021e4c4d | mkomod/survival-ss | src/utils.cpp | #include "utils.h"
// Evaluate the log partial likelihood
// [[Rcpp::export]]
double log_PL(arma::mat X, arma::vec b, arma::uvec Y_sorted,
arma::uvec Y_failure)
{
arma::vec xb = X * b;
double a = max(xb);
double denom = 0.0;
double tot = 0.0;
int ind_last_failure = X.n_rows;
int ind_curr_fai... | ALGO | 0.998538 | 5.940153 |
5d4f9b15-5d66-4eea-88e0-83d3e5377ffe | parnlnw/db401 | weathercast/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.998925 | 6.785645 |
61c58d10-f420-43e4-8416-6b930985025c | Raghavendra6005/Pattern_Problems | Ractangle_Patterns/Star_patterns/Butterfly_pattern/Solution.cpp | #include<iostream>
using namespace std;
int main(){
int num;
cin>>num;
for(int row=1;row<=num;row++){
// Print *
for(int col=1;col<=row;col++){
cout<<"* ";
}
// Print " "
for(int col=1;col<=(2*num-2*row);col++){
cout<<" ";
}
//... | ALGO | 0.999994 | 3.772412 |
285ef7cd-5585-463f-9ba2-91edb1108489 | qsd8k-legacy/android_system_core | adb/jdwp_service.cpp | #if !ADB_HOST
#define TRACE_TAG JDWP
#include "sysdeps.h"
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/socket.h>
#include <sys/un.h>
#include <unistd.h>
#include <list>
#include <memory>
#include <vector>
#include "adb.h"
#include "adb_io.h"
#include "adb_unique_fd.h"... | TOOL | 0.938327 | 7.07018 |
cbf516af-4223-4955-a453-58a6f735be7e | Kevin-DeBruyne/leetcode_solutions | X Total Shapes - GFG/x-total-shapes.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
//Function to find the number of 'X' total shapes.
void dfs(int i, int j, vector<vector<char>>&grid, vector<vector<int>>&vis){
int M=grid.size();
int N=grid[0].size();
... | ALGO | 0.999671 | 6.967219 |
74185a6c-855b-4e66-8dee-4f2349295e9e | thegamer1907/Code_Analysis | Implementation/501.cpp | #include<bits/stdc++.h>
using namespace std;
int n,k,a[100],d=0;
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++)
{
if((a[i]>=a[k])&&(a[i]>0)) d++;
}
cout<<d;
} | ALGO | 0.999957 | 3.28731 |
d667ec4d-91c6-451a-ae18-4d9413223500 | ishandutta2007/codeforces | chemthan/normal/737/D.cpp | #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
... | ALGO | 0.999913 | 3.603459 |
c3d780e9-5d53-400d-93ea-81deff81a350 | DLR-SE/llvm | libc/src/math/generic/remainderf.cpp | #include "src/math/remainderf.h"
#include "src/__support/FPUtil/DivisionAndRemainderOperations.h"
#include "src/__support/common.h"
namespace __llvm_libc {
LLVM_LIBC_FUNCTION(float, remainderf, (float x, float y)) {
int quotient;
return fputil::remquo(x, y, quotient);
}
} // namespace __llvm_libc
| ALGO | 0.992624 | 6.203137 |
5bb7f1b4-9905-4887-b538-ea1145e56209 | alexandraback/datacollection | solutions_2692487_1/C++/GBV/A.cpp | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <sstream>
#include <map>
#include <queue>
#include <stack>
#include <cstring>
#include <cstdlib>
#include <list>
#include <set>
#include <ctime>
#include <list>
#define pb push_back
#define mp make_p... | ALGO | 0.999737 | 3.576536 |
8961e0b2-3239-4b0c-a993-56a50e2ff27b | sravanthi194/Leet_Code_Problems | #25_Reverse Nodes in k-Group.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) {}
* };
*/
class Solution {
public:
ListNode* reverseKGro... | ALGO | 0.999997 | 5.82025 |
6b127815-b3d6-4980-985a-b1c113ec16e8 | raincross7/code-similarity | codes/train_code/problem030/problem030_364.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N,A,B;
cin >> N >> A >> B;
long long div = N / (A+B);
long long par = N % (A+B);
if(par >= A) cout << div*A + A << endl;
else cout << div*A + par << endl;
} | ALGO | 0.999957 | 3.635872 |
1d22a996-c2a8-4562-8f51-6962cab57335 | A7ryan/Data-Structures-Algorithms-In-Java-with-130-Leetcode-Problems | dynamicProgramming/fibonacii/topDown.cpp | #include <bits/stdc++.h>
using namespace std;
int findFibonaci(int n) {
if(n == 0) return 0;
if(n == 1) return 1;
return findFibonaci(n - 1) + findFibonaci(n - 2);
}
int main() {
int n = 7;
int fiboNum = findFibonaci(n);
cout << "Fibonacci of " << n << " is: " << fiboNum << endl;
return 0... | ALGO | 0.999937 | 5.951966 |
414ddddd-1150-4fb4-a631-b6c25e85a111 | yashsoni501/Competitive-Programming | Codeforces/1352B.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pu push
#define pp pop_back
#define in insert
#define MOD 1000000007
#define endl "\n"
#define sz(a) (int)((a).size())
#define all(x) (x).begin()... | ALGO | 0.999878 | 3.592375 |
28949f0f-aa05-4452-b9a9-9444b3f6d50e | nanopathi/frameworks_av_AOSP10_r33_CVE-2021-0508 | media/libmedia/StringArray.cpp | //
// Sortable array of strings. STL-ish, but STL-free.
//
#include <stdlib.h>
#include <string.h>
#include <media/StringArray.h>
namespace android {
//
// An expanding array of strings. Add, get, sort, delete.
//
StringArray::StringArray()
: mMax(0), mCurrent(0), mArray(NULL)
{
}
StringArray:: ~StringArray(... | TOOL | 0.971086 | 6.43154 |
7e153642-f088-41cc-8de2-18edb935691b | labs-inatel/Laboratorio_C202 | ExerciciosLab/Exercicio_URI1089.cpp | #include <iostream>
using namespace std;
int main()
{
int k;
int n;
int m;
int x;
int y;
while (cin >> k)
{
if (k != 0)
{
cin >> n >> m;
while (k--)
{
cin >> x >> y;
if (x == n || y == m)
cout << "divisa" << endl;
else if (x < n && y > m)
cout << "NO" << endl;
else ... | ALGO | 0.996973 | 3.38871 |
f91e3b05-fc9e-4d26-a3fe-105a8cd8f5f9 | neurobazaar/csc435-threads-tutorial | app-cpp/src/run-tasks.cpp | #include <iostream>
#include <vector>
#include <random>
#include <deque>
#include <mutex>
#include <thread>
int task()
{
int length = 10000000;
std::vector<int> vector(length);
std::random_device rd;
std::mt19937 gen(rd());
std::uniform_int_distribution<int> uniform_dist(0, length - 1);
for (a... | ALGO | 0.999147 | 5.236033 |
955ddcf1-b691-42c5-b7fa-95023005e80a | IKiprotich/OOP-Java | CAT 1/Rectangle.cpp | #include <iostream>
using namespace std;
class Rectangle {
private:
// Attributes
double width;
double length;
public:
// Constructor
Rectangle(double l, double w) : length(l), width(w) {}
// Setter methods
void setLength(double l) {
length = l;
}
void setWidth(double w) ... | TOOL | 0.933642 | 5.140142 |
7e1c3665-4d9f-4e40-9837-be6aefed13a5 | AbhiKangane/DSA_in_CPP | Graph/BellmanFord_Shortest_Path.cpp | // https://www.geeksforgeeks.org/problems/distance-from-the-source-bellman-ford-algorithm/1
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
vector<int> bellmanFord(int V, vector<vector<int>>& edges, int src) {
vector<int>dist(V, 1e8);
dist[src]=0;
for(int i... | ALGO | 0.999938 | 4.771902 |
208ce6dd-70d8-4996-8361-fa54b65b5416 | LeVanTuong1608/CodePTIT-C | 0424.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int t;cin>>t;
while(t--){
int n,m;cin>>n>>m;
int l=0;
int a[n][m],b[m*n];
for (int i=0;i<n;i++){
for (int j=0;j<m;j++){
cin>>a[i][j];
b[l]=a[i][j];
l++;
}
}
sort(b,b+l);
for (int i=0;i<l;i++){
cout<<b[i]<<" ";
}
cou... | ALGO | 0.999736 | 3.070608 |
3ff92de1-40de-42d4-abe5-25c005dbe405 | hadleyhzy34/data_structure_and_algorithm | array/leetcode_array/506_relative_ranks.cpp | #include <stdio.h>
#include <vector>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
using namespace std;
class Solution {
public:
vector<string> findRelativeRanks(vector<int>& nums) {
int one=0,two=0,three=0;
int oneIdx=-1, twoIdx=-1, threeIdx=-1;
for(int i=0;i<nums.s... | ALGO | 0.999681 | 5.553535 |
40211f7b-b4a6-4350-a068-f6e7036a4c51 | Jhay4Julian/weather_app | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.9988 | 6.76073 |
fc29fba4-fb29-4a5d-9b37-2e6cf28fdf16 | s1s1ty/UVA-problem-solution-with-CPP-code | UVA AC CODE/Graph/11244 Counting Stars.cpp | #include<bits/stdc++.h>
#define PI acos(0.0)
#define EPS 1e-7
#define fr first
#define sc second
#define N 100000
using namespace std;
int x[] = {-1, 0, 0, 1, 1, -1, -1, 1};
int y[] = {0, -1, 1, 0, 1, -1, 1, -1};
using namespace std;
char a[105][105];
int visit[105][105];
int bfs(int i,int j,int r,int c)
{
queue... | ALGO | 0.999824 | 3.618836 |
7c54b1d3-31c8-4407-9d81-5b7544375c4c | amitaka007/Leetcode_Top_Interview_150-main | Stack/Evaluate Reverse Polish Notation/Evaluate.cpp | class Solution {
public:
int evalRPN(vector<string> &tokens) {
stack<int> st;
for (const string& token : tokens) {
if (isOperator(token)) {
int operand2 = st.top(); st.pop();
int operand1 = st.top(); st.pop();
st.push(performOperat... | ALGO | 0.999875 | 6.895384 |
6f0cdc27-6a95-49a5-8d7d-f326010bb4df | perlconverter/TransCoderbkp | data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/SUM_TWO_LARGE_NUMBERS_1.cpp | #include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string str1, string str2 ) {
if ( str1 . length ( ) > str2 . length ( ) ) swap ( str1, str2 );
string str = "";
int n1 = str1 . length ( ),... | ALGO | 0.999789 | 5.662556 |
bf9cee92-3395-4aed-bb5e-3f04ee53dd6e | raincross7/code-similarity | codes/train_code/problem452/problem452_485.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
int seen[10000][10000];
char S[10000][10000];
vector<pair<ll, ll>> prime_factorize(ll n) { //素因数分解と各素数の個数
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++)
{
if (n % i != 0)
{
continue;
... | ALGO | 0.999996 | 4.134009 |
097c2b22-d086-4a07-bbd6-a9a8658ef096 | Tushar-Thorat-2001/DSA | Array/2darray4.cpp | // find max,min of col and row in 2d array
#include<iostream>
#include<climits>
using namespace std;
void print(int arr[3][3],int m,int n){
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
{
cout << arr[i][j] << " ";
}
// Newline for new row
cout << endl;
}
}
void rowsummaxmin(... | ALGO | 0.99596 | 4.015187 |
ce20bc19-3eba-4023-a755-ec3c3371abb7 | D-Arijit57/LeetCode-Solutions | 2529-range-product-queries-of-powers/range-product-queries-of-powers.cpp | class Solution {
public:
vector<int> productQueries(int n, vector<vector<int>>& queries) {
const int MOD = 1000000007;
// Extract exponents from n's binary representation
vector<int> exponents;
for (int i = 0; i < 32; i++) {
if (n & (1 << i)) {
ex... | ALGO | 0.99994 | 6.87321 |
bf51bdf1-4a4f-4b31-879a-84becfc219d4 | kushagra-18/Leetcode-solutions | 1315-sum-of-nodes-with-even-valued-grandparent/1315-sum-of-nodes-with-even-valued-grandparent.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.999873 | 5.557432 |
2becf2a9-78b9-4723-85a9-e0941c4659cc | Ionizing/pintia | PAT Advanced Level/1055/main.cpp | /* timeout */
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#pragma pack(push)
#pragma pack(1)
struct Record {
char Name[9] = "";
int Age = 0;
int Wealth = 0;
};
#pragma pack(pop)
std::vector<std::vector<Record>> Data(201);
int main(int argc, char* argv[]) {
#ifndef ONLINE_JUDGE
fr... | ALGO | 0.999741 | 4.052184 |
6c9b70a2-a773-48e3-afc1-65f515478d3a | bazow/cpu-vah | rhic/rhic-core/src/main/cpp/edu/osu/rhic/core/util/FiniteDifference.cpp | /*
* FiniteDifference.cpp
*
* Created on: Oct 22, 2015
* Author: bazow
*/
#include "edu/osu/rhic/core/util/FiniteDifference.h"
#include "edu/osu/rhic/trunk/hydro/DynamicalVariables.h"
PRECISION finiteDifferenceX(const PRECISION * const var, int i,int j,int k, int NX, int NY, int NZ, double dx) {
return 0.... | ALGO | 0.997245 | 5.458822 |
d1e0731a-f864-40e8-9705-c769d6018f05 | shawakation/PAT | Basic Level/1041/main.cpp | /*
1.string÷string[a][b];
ÿԪһstring
*/
#include <iostream>
#include <string>
using namespace std;
int main()
{
unsigned short n,k,t;
string stu[1001][2],zhunkao,kaoshi;
cin>>n;
for (unsigned short i=1;i<=n;i++) {
cin>>zhunkao>>t>>kaoshi;
stu[t][0]=zhunkao;
stu[t][1]=kaoshi;
}
cin>>k;
for (unsigned... | ALGO | 0.995423 | 3.262277 |
fc1a1867-7370-48cd-a916-18ddc8235fc6 | jeffriesd/competitive-programming | kattis/duos.cpp | // problem: https://mausa20.kattis.com/problems/dominatingduos
#include<bits/stdc++.h>
using namespace std;
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vb = vector<bool>;
using si = set<int>;
#define INF 99999999
int main() {
int N;
cin >> N;
vi heights;
for (int i = 0;... | ALGO | 0.999968 | 4.654881 |
a6d2053a-d4e7-465f-8cd8-67c3a9532700 | gurneeshs/DSA | DYNAMIC PROGRAMMING/108countdearrangements.cpp | /*
A Derangement is a permutation of ‘N’ elements, such that no element appears in its original position.
For example, an instance of derangement of {0, 1, 2, 3} is {2, 3, 1, 0}, because 2 present at index 0 is
not at its initial position which is 2 and similarly for other elements of the sequence.
G... | ALGO | 0.999993 | 5.494903 |
847819b4-738d-47ef-a56e-5d64023ec5be | hasnain-cyber/competitive-programming | codeforces/C_Monoblock.cpp | #include <bits/stdc++.h>
#define MOD 1000000007
// #define MOD 998244353
#define infinity numeric_limits<int>::max()
#define int long long int
#define double long double
#define endl '\n'
using namespace std;
template <typename T>
void print_arr(vector<T>& arr) {
for (T element : arr)
cout << element <... | ALGO | 0.999807 | 4.637985 |
b0c7fc51-c6bf-46ad-8008-0abc4ad04759 | Kawser-nerd/CLCDSA | Source Codes/AtCoder/abc117/C/4712311.cpp | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define vec vector
#define ll long long
#define ALL(a) a.begin(), a.end()
int main(void)
{
int n, m;
cin >> n >> m;
vec<ll> x(m);
rep(i, m) cin >> x[i];
sort(ALL(x));
vec<ll> d(m - 1);
rep(i, ... | ALGO | 0.999982 | 3.605728 |
f397c5db-6767-4801-95cc-f472066ff7ee | enginestein/Virus-Collection | Others/rBot v0.6.6 priv lsass/findfile.cpp | #include "includes.h"
#include "functions.h"
#include "externs.h"
#ifndef NO_FINDFILE
DWORD WINAPI FindFileThread(LPVOID param)
{
FFIND ffind = *((FFIND *)param);
FFIND *ffinds = (FFIND *)param;
ffinds->gotinfo = TRUE;
char sendbuf[IRCLINE];
unsigned int numfound = 0;
if (ffind.dirname[strlen(ffind.dirname)-... | TOOL | 0.862948 | 3.714739 |
b3617560-d51a-4a78-b3e8-f7af1c181204 | divyang9575/CP | implementation/C_Numbers_on_Whiteboard.cpp | #include<bits/stdc++.h>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define endl '\n'
#define lli long long int
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define pb push_back
#define pi pair<int,int>
#define ff first
#define ss second
#define fo(i,s,e) for(int i=s; i<=e; i++)
#defi... | ALGO | 0.999835 | 4.363841 |
67e055a4-fa76-44e4-93a7-0f0a819aa4e5 | lwxGitHub123/openpose | src/openpose/tracking/personTracker.cpp | #include <openpose/tracking/personTracker.hpp>
#include <atomic>
#include <iostream>
#include <unordered_map>
#include <openpose/utilities/fastMath.hpp>
#include <openpose_private/tracking/pyramidalLK.hpp>
#include <openpose_private/utilities/openCvMultiversionHeaders.hpp>
namespace op
{
struct PersonTrackerEntry
... | ALGO | 0.976048 | 6.804266 |
52ac4c82-fff8-4b9e-ac3a-7dd2c08889ea | notNakul/LeetCodeNew | 2787-ways-to-express-an-integer-as-sum-of-powers/2787-ways-to-express-an-integer-as-sum-of-powers.cpp | class Solution {
public:
int f(int ind,int end,int n,int x,vector<vector<int>> &dp){
if(n==0) return 1;
if(ind>end){
if(n==0) return 1;
return 0;
}
if(dp[ind][n]!=-1) return dp[ind][n];
int take=0;
if(n-pow(ind,x)>=0){
... | ALGO | 0.999961 | 5.230839 |
76755de4-0292-45e4-98d8-3a1aaed18e11 | benediktibk/kicad-packages3D-source | scripts/trim_step.cpp | /*
* trim_step2.cpp
*
* Created on: Jan 19, 2018
* Author: seth
*/
#include <algorithm>
#include <unordered_map>
#include <string>
#include <sstream>
#include <vector>
#include <fstream>
#include <regex>
#include <iostream>
// trim from end (in place)
static inline void rtrim(std::string &s) {
s.erase(... | DATA | 0.850571 | 4.688423 |
111b2542-70c8-497d-a8bf-23dd2da0d741 | PolySTAR-mtl/PolySTAR-Taproot | PolySTAR-Taproot-project/src/subsystems/feeder/feeder_position_subsystem.cpp | #include "feeder_position_subsystem.hpp"
#include "tap/communication/serial/remote.hpp"
#include "tap/algorithms/math_user_utils.hpp"
#include "control/drivers/drivers.hpp"
using namespace tap;
using tap::communication::serial::Uart;
namespace control
{
namespace feeder
{
void FeederPositionSubsystem::initialize()
{... | TOOL | 0.942637 | 5.929637 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.