uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
c7e09514-b46d-4dfa-a40a-292cd557ed17 | heart-org/Cpp-primer-plus | chapter04/chapter04_6.cpp | #include "iostream"
#include "queue"
#include "stack"
#include "vector"
#include "algorithm"
#include "cstring"
#include "cmath"
#include "set"
#include "map"
#include "numeric"
#include "unordered_set"
#include "unordered_map"
using namespace std;
struct CandyBar
{
string brand;
float weight;
int calorie... | TOOL | 0.865717 | 3.395601 |
54323a71-e939-494e-90b0-14e8de1d2c4a | NguyenTrungSon-2154050266/CTDL_IT2101_Nhom6 | LYTUYETNHI-2154050206/CodeC1/Chương 2/Bai10.cpp | ////Chuong 2, Bai 10: STACK voi danh sach lien ket
//#include <iostream>
//#include <stdio.h>
//using namespace std;
//
////10.1 - Khai bao cau truc
//struct Node
//{
// int info;
// Node* link;
//};
//
//Node* sp; // luu tru dia chi phan tu dau tien cua STACK
//
////10.2 - Khoi tao STACK rong
//void init()
//{
// sp =... | ALGO | 0.981577 | 3.64254 |
3c7b498b-333c-4a69-b9c0-c678400c90fb | Chaste/Old-Chaste-svn-mirror | lung/src/ventilation/odes/SigmoidalAcinarUnit.cpp | #include "SigmoidalAcinarUnit.hpp"
#include <cmath>
#include <iostream>
#include <cstdlib>
#include <cassert>
#include "MathsCustomFunctions.hpp"
SigmoidalAcinarUnit::SigmoidalAcinarUnit() : mQ(0.0),
mDt(-1),
mPaw(0.0),
... | ALGO | 0.996847 | 6.338368 |
fadd9109-8dab-4d0d-bfd7-21cacf204746 | efeslab/moesi-prime | ext/systemc/src/sysc/datatypes/fx/scfx_pow10.cpp | /*****************************************************************************
scfx_pow10.cpp -
Original Author: Robert Graulich, Synopsys, Inc.
Martin Janssen, Synopsys, Inc.
*****************************************************************************/
/**********************************... | ALGO | 0.997027 | 6.079953 |
7b837378-946c-4aa2-ab6d-3dc4ad97ae5c | Leerw/ProgrammingPractice4ZJU | pat-a-practise/src/1030_dj_dfs.cpp | #include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int MAXV = 510;
const int INF = 1000000000;
int n, m, st, ed, G[MAXV][MAXV], cost[MAXV][MAXV];
int d[MAXV], minCost = INF;
bool vis[MAXV] = { false };
vector<int> pre[MAXV];
vector<int> tempPath, path;
void Dijsktra... | ALGO | 0.999938 | 3.73309 |
c898ac2d-453a-46d7-bc3f-217f76e72319 | alligatorYE/studyLinuxC | thinking_in_cpp/TICPP-2nd-ed-Vol-two/code/C11/ToastOMatic.cpp | using namespace ZThread;
using namespace std;
// Apply jam to buttered toast:
class Jammer : public Runnable {
Mutex lock;
Condition butteredToastReady;
bool gotButteredToast;
int jammed;
public:
Jammer() : butteredToastReady(lock) {
gotButteredToast = false;
jammed = 0;
}
void moreButteredToastR... | ALGO | 0.994732 | 6.631085 |
7336aeeb-f7d5-4a9d-9f6c-9b037cc5b392 | AbdoEbrahim0/leetCode | 0476-number-complement/0476-number-complement.cpp | // class Solution {
// public:
// int findComplement(int num) {
// int x=0;
// int power = 0;
// while (num != 0)
// {
// if (num % 2 ==0)
// {
// // x += pow(2, power);
// //Or
// x += 1<< power;
// }
... | ALGO | 0.99992 | 5.751846 |
17ef8c47-a775-4632-bc32-0a793bdb037a | galaxy4276/PS | boj/2869.cpp | #include<iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int A, B, V;
cin >> A >> B >> V;
int day = 1 + ( (V - A) / (A - B) );
if ((V - A) % (A - B) != 0) day++;
if (A >= V) cout << "1";
else cout << day;
}
| ALGO | 0.999921 | 3.476647 |
20e719d0-3014-46ea-bf4c-465c9377d3ed | encuadro/encuadro | xcode/App/demo05/demo05/simple.cpp | /** @file
* @brief A set of very simple examples of current CML functionality.
*/
#include "simple.h"
#include "cml_config.h" // Must be first (for now)!
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cml/cml.h>
using namespace cml;
using std::cout;
using std::endl;
using std::sqrt;
do... | ALGO | 0.996813 | 3.700649 |
7c53747a-a60b-4701-aebe-28b9cb820dad | SantiMor05/Indusmatica | Indusmática/5to ciclo/Algoritmia/Listas/ALGORITMIA_EX1_22-2_P1-yoshi/FuncionesLista.cpp | /*
* File: FuncionesLista.cpp
* Author: Usuario
*
* Created on 2 de mayo de 2025, 17:19
*/
#include <iostream>
#include <iomanip>
using namespace std;
#include "ELEMENTO.h"
#include "NODO.h"
#include "LISTA.h"
#include "FuncionesLista.h"
void construirLista(Lista &lista){
lista.cabeza = nullptr;
lista... | ALGO | 0.997646 | 4.787085 |
f3f45e9c-6760-41bf-a8fb-bbae12f1816d | ishandutta2007/codeforces | realcomplex/normal/468/A.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define INF 1e18
void open(){
freopen("in.txt","r",stdin);
//freopen("output.txt","w",stdout);
}
int main(){
//open();
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);... | ALGO | 0.999806 | 3.610043 |
83fe307a-3475-4b1f-8cbe-d46296e3a9b8 | yeahitsme2/practice | src/crypto/aes.cpp | #include "aes.h"
#include "crypto/common.h"
#include <assert.h>
#include <string.h>
extern "C" {
#include "crypto/ctaes/ctaes.c"
}
AES128Encrypt::AES128Encrypt(const unsigned char key[16])
{
AES128_init(&ctx, key);
}
AES128Encrypt::~AES128Encrypt()
{
memset(&ctx, 0, sizeof(ctx));
}
void AES128Encrypt::Encr... | TOOL | 0.957069 | 7.633793 |
03cff2a1-73fc-4181-843b-4675c2cf0fa7 | jsfoao/Cpp_Assignments | Small_Assignments/Reverse_Collection/Source.cpp | #include <iostream>
#include "Swap.h"
using namespace std;
// generics declaration???
void swap_char(char* a, char* b)
{
char temp = *a;
*a = *b;
*b = temp;
}
void reverse_collection(char* str, int count)
{
if (count <= 2){ return;}
for (size_t i = 0; i < count - 1; i++)
{
if (i == count - 2 - i){ return; }... | ALGO | 0.913507 | 6.007172 |
6445e722-4c1c-45c0-8ff8-d702ccdc7379 | prithu-anan/My-BUET-Life-Course-Works | Level 2/Term 1/CSE 204/2. Stack & Queue/Offline/2005045/Store.cpp | #include <iostream>
#include <fstream>
#include "Array.cpp"
#include "LinkedList.cpp"
using namespace std;
int main(){
ifstream fin;
ofstream fout;
fin.open("store_input.txt", ios::in);
fout.open("store_output.txt", ios::out);
streambuf* stream_buffer_cout = cout.rdbuf();
streambuf* stream_bu... | ALGO | 0.999962 | 3.014323 |
b061955b-d74b-4dce-85bd-7cd89ca7e556 | grig95/proiect_poo | include/CollisionHandler.cpp | #include "CollisionHandler.h"
#include "Collider.h"
#include "Rigidbody.h"
#include "CircleCollider.h"
#include "Collision.h"
#include "Vector.h"
#include "appexceptions.h"
#include <iostream>
#include <cmath>
///just debugging
#include "Object.h"
#include "Shape.h"
CollisionHandler::CollisionHandler() = default;
C... | ALGO | 0.888713 | 6.277044 |
a9cc0d17-c603-449c-8b08-6badb243fe13 | dxing-cs/TinyLight | CityFlow/src/vehicle/router.cpp | #include "vehicle/router.h"
#include "vehicle/vehicle.h"
#include "flow/route.h"
#include "roadnet/roadnet.h"
#include <limits>
#include <queue>
#include <set>
namespace CityFlow {
Router::Router(const Router &other) : vehicle(other.vehicle), route(other.route), anchorPoints(other.anchorPoints),
... | ALGO | 0.853739 | 5.811772 |
d675cb0d-ae9e-4198-a279-a8c1fbe1c1dc | piyushsingariya/codeforces | Codeforces Round #686 (Div. 3)/B. Unique Bid Auction.cpp | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define SORT(v) sort(all(v))
#define itr(i,n) for(int i=0;i<n;i++)
#define ll long long
#define ff first
#define ss second
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#d... | ALGO | 0.999915 | 4.390274 |
763bddf3-5804-4001-9e86-b1d653e2287d | StudyingFather/my-code | loj/2510.cpp | #include <iostream>
#include <algorithm>
using namespace std;
long long f[40001][41][41],a[20005],b[20005],c[20005];
int son[20005][2],n;
void dfs(int u,int x,int y)
{
if(u>n)
{
u-=n;
for(int i=0;i<=x;i++)
for(int j=0;j<=y;j++)
f[u+n][i][j]=c[u]*(a[u]+i)*(b[u]+j);
return;
}
dfs(son[u][0],x+1,y);
dfs(s... | ALGO | 0.999862 | 3.496971 |
a8ba088d-7be6-49dc-ab82-392a677275b7 | ziyaArslan1/Games | cppJenerik.cpp | #include <iostream>
#include <cstdlib>
#include <ctime>
template <typename TYPE>
class ARRAY {
private:
int cap,size;
TYPE *array;
public:
ARRAY(int cap) {
this->cap = cap;
size = 0;
array = new TYPE[cap];
}
~ARRAY() { delete [] array; }
void myRealloc() {
cap *= 2;
TYPE *newarray = new... | ALGO | 0.903114 | 3.90955 |
23346410-d5f0-4bb4-8724-52b963cca78c | OnyebuchiO/Fun-Codes | squares.cpp | /*
This program should take a positive input limit and print out all the square numbers less than or equal to limit, one per line.
For example if the input is 13 it should print out
0
1
4
9
*/
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int limit;
cin >> limit;
// start a counter... | ALGO | 0.998659 | 4.621629 |
329f1869-5f6f-44b8-b217-216eae0c4009 | nccaiteam/histopathology_annotation_nia | libs/boost_1_67_0/libs/msm/doc/HTML/examples/SimpleTutorialInternalFunctors.cpp | #include <iostream>
// back-end
#include <boost/msm/back/state_machine.hpp>
//front-end
#include <boost/msm/front/state_machine_def.hpp>
#include <boost/msm/front/functor_row.hpp>
#include <boost/msm/front/euml/common.hpp>
// for And_ operator
#include <boost/msm/front/euml/operator.hpp>
using namespace std;
namespace... | TOOL | 0.88027 | 6.483958 |
43ee6400-efa9-4ce3-99a0-84df383024d1 | baofuhann/FISCO_BCOS_FL | deps/src/boost/libs/geometry/doc/src/examples/algorithms/make_inverse.cpp | // Boost.Geometry (aka GGL, Generic Geometry Library)
// QuickBook Example
//[make_inverse
//` Usage of make_inverse and expand to conveniently determine bounding box of several objects
#include <iostream>
#include <boost/geometry.hpp>
#include <boost/geometry/geometries/box.hpp>
#include <boost/geometry/geometries/... | ALGO | 0.980741 | 6.819036 |
1689b906-cae3-4efa-84af-ddd8c054dba5 | tjwjdgks/algorithm | 프로그래머스/124 나라의 숫자/124num.cpp | #include <string>
#include <vector>
#include <algorithm>
using namespace std;
string solution(int n) {
string answer = "";
while (n != 0) {
n--;
int rest = n % 3;
n /= 3;
switch (rest) {
case 0:
answer += '1';
break;
case 1:
an... | ALGO | 0.999936 | 5.41425 |
d0e0f53d-4ff7-4f73-9c51-af2cbc292a95 | devhimanshuu/DataAlgoPro | Arrays/prob10.cpp | // Find missing number in an array
#include <bits/stdc++.h>
using namespace std;
int missingNumber(vector<int> &a, int N)
{
// Summation of first N numbers:
int sum = (N * (N + 1)) / 2;
// Summation of all array elements:
int s2 = 0;
for (int i = 0; i < N - 1; i++)
{
s2 += a[i];
... | ALGO | 0.999602 | 5.611342 |
a9a1e802-4011-4df0-9a15-c4344c8733fe | urawa72/procon | atcorder/abc140/c/main.cpp | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int n; cin >> n;
V<int> b(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> b[i];
}
ll ans = b[0];
for (int i = 1; i < n - 1; i++) {
ans += min(b[i - 1... | ALGO | 0.99997 | 3.765692 |
9cf20173-7265-44ea-9111-d525eaecbb5f | has2/Problem-Solving | codeforces/Round731-Div.3/ㅊ.cpp | #include <cstdio>
#include <queue>
#include <cstring>
#include <string>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int tc;
int k,n,m,a[301],b[301];
void prt(){
puts("a");
for(int i=0;i<n;i++) printf("%d ",a[i]);
puts("b");
for(int i=0;i<m;i++) printf("%d ",b[i]);... | ALGO | 0.999427 | 3.177643 |
dede18f4-065d-4bf6-8a38-8b3a57d65275 | tanmay2765/LeetcodeQuestions | 0543-diameter-of-binary-tree/0543-diameter-of-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.999934 | 6.722441 |
0bf37ee7-024c-4ba6-a32e-2005ca08263f | GuardianWorld/APP_Flutter_Escolar | 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.998756 | 6.772262 |
103594cc-13ab-4905-aef5-a80e51f41d36 | sajida-dev/2025-LeetCode-Problems | 0011-container-with-most-water/0011-container-with-most-water.cpp | int min(int a,int b){
if(a<b){
return a;
}else{
return b;
}
}
int max(int a,int b){
if(a<b){
return b;
}else{
return a;
}
}
class Solution {
public:
int maxArea(vector<int>& height) {
int beg=0,end=height.size()-1;
int max_area = 0,area=0;
... | ALGO | 0.999991 | 6.433841 |
b0ef9051-c6dd-4c80-af46-c52073504d70 | DikshantBadawadagi/DSA | pass.cpp | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
string s_input;
cin >> s_input;
int n = s_input.size();
vector<int> s(n);
for (int i = 0; i < n; ++i) {
s[i] = s_input[i] - '0';
... | ALGO | 0.99999 | 4.448629 |
3c9ef952-17d9-414e-870e-ce8b56144cb8 | MakinoRuki/Codeforces | R699/1481B.cpp | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <cmath>
#include <queue>
#define eps 1e-7
#define M 21
#define N 200
#define SZ 200000002
using namespace std;
typedef... | ALGO | 0.999994 | 3.839258 |
82f84bed-07cb-455d-ac0a-b5158e644f4f | yadavsakshi438/LeetCode | 0202-happy-number/0202-happy-number.cpp | class Solution {
public:
bool isHappy(int n) {
unordered_set<int> seen;
while (n != 1) {
if (seen.count(n)) {
return false;
}
seen.insert(n);
int sum = 0;
while (n > 0) {
int digit = n % 10;
... | ALGO | 0.999972 | 6.83553 |
a8552346-a7d1-40a8-b2be-9be520a2839d | TranYVan/Shape_project | Shape_project/main.cpp | /*
* SHAPE PROJECT
* Trần Ý Văn
* 21120360
* OOP Project
*/
#include "main.h"
#include "FileReading.h"
#include "ScreenPrinting.h"
#include "FileHandling.h"
#include <filesystem>
typedef IParser* (*CREATE_PARSER) ();
namespace fs = std::filesystem;
/// <summary>
/// Comparator for sorting the list of IShape base o... | TOOL | 0.951003 | 3.302501 |
7eb2d959-cb00-4582-b108-812df4807382 | sulivansimoes/Linguagem-C | C/URI/INICIANTE/SELEÇÃO/Imposto de Renda/Imposto de Renda.cpp | #include<stdio.h>
int main(void)
{
float sal,rend=0;
scanf("%f",&sal);
if(sal>=0 && sal<= 2000.00){
printf("Isento\n");
}else{
if(sal>=2000.01 && sal <= 3000.00){
rend = sal * 0.08;
printf("%.2f\n",rend);
}else{
if(sal>=3000.01 && sal <= 4500.00){
rend = 1000.00 * 0.08;
sal = (sal - 3000... | ALGO | 0.997873 | 3.358472 |
57a62959-70a3-44ce-9102-addc7755b27f | felipesdias/Extractor-URI-Online-Judge | URI-PT/INICIANTE/1052 - Mês.cpp | // Autor: Felipe Souza Dias<<EMAIL>>
// Nome: Mês
// Nível: 1
// Categoria: INICIANTE
// URL: https://www.urionlinejudge.com.br/judge/pt/problems/view/1052
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int main() {
int a;
string meses[12] = {"J... | TOOL | 0.985799 | 3.877034 |
660c4cf5-20d1-42b6-9e59-c7fd8d4ff887 | SaadiqRaufKhan/Leetcode-Problems | 0206-reverse-linked-list/0206-reverse-linked-list.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* reverseList... | ALGO | 0.999587 | 5.810203 |
d87ed6f0-65cd-4b85-829e-f0536c118790 | jumeike/gem5-smt-exp | gem5-vanilla/src/systemc/tests/systemc/misc/sim_tests/biquad/biquad3/delay_line.cpp | /*****************************************************************************
delay_line.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/*************************************************************************... | ALGO | 0.988609 | 5.923184 |
3bc3ad11-62ea-4e33-b2a5-4f75e8da8b81 | MehediHasan-75/code | Cost.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e5+10;
#define mod 1000000000
vector<ll>sz(N, 1), parent(N);
ll find_parent(ll u){
return parent[u]==u? u: parent[u]=find_parent(parent[u]);
}
void Union(ll u, ll v){
if(sz[u]<sz[v])swap(u, v);
sz[u]+=sz[v];
parent[v]=u;
}
s... | ALGO | 0.999982 | 4.586973 |
b396efe1-e94b-421b-95ff-14d9613ff12f | ShadowGhosto/OOP_NIR_KMBO-06-22 | ООП(2 курс 3 семестр)/другого чела/2 (5).cpp | #include <iostream>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <queue>
using namespace std;
bool findbyValue(const map<string, int>& tree, int value) {
for (const auto& pair : tree) {
if (pair.second == value) {
return true;
}
}
return false;
}
... | ALGO | 0.999153 | 4.879272 |
a359d3fd-2b0f-4d44-9e26-ec1da5de5c92 | ultra-u/My_LeetCode | Subarray_of_K/Solution.cpp | #include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
class Solution { //前缀和+哈希表优化
public:
int subarraySum(vector<int>& nums, int k) {
unordered_map<int,int> map;
map[0]=1; //和为0的子数组总存在，需排... | ALGO | 0.99981 | 5.059458 |
a7cbd951-7a91-4953-b9ee-6523d4f96afd | bayashi-cl/procon-submission | atcoder/abc245/abc245_c/30440675.cpp | #ifndef LOCAL
#define NDEBUG
#endif
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#includ... | ALGO | 0.999676 | 3.811342 |
8acc5720-8cc9-4619-9d13-bab9ba6be1eb | Peepbo/Coding-Test | Programmers/Level 2/큰 수 만들기/CodingTest/CodingTest.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
string solution(string number, int k) {
string answer = "";
int len = number.size();
int pivot = -1;
for (int i = 0; i < len - k; i++)
{
char max = 0;
for (int j = pivot + 1; j <= k + i; j++)
{
... | ALGO | 0.999747 | 5.240978 |
8560fbc9-4c81-4bac-94f3-d8d0dfd44091 | Jackiemin233/tram-mast3r | thirdparty/MASt3R-SLAM/thirdparty/eigen/doc/examples/class_FixedVectorBlock.cpp | #include <Eigen/Core>
#include <iostream>
template <typename Derived>
Eigen::VectorBlock<Derived, 2> firstTwo(Eigen::MatrixBase<Derived>& v) {
return Eigen::VectorBlock<Derived, 2>(v.derived(), 0);
}
template <typename Derived>
const Eigen::VectorBlock<const Derived, 2> firstTwo(const Eigen::MatrixBase<Derived>& v)... | TOOL | 0.954478 | 6.45845 |
4d27ccab-c640-414b-b8cc-215351021391 | Bearylover/ACCP | EOlymp/8609/37854446_AC_0ms_584kB.cpp | #include <bits/stdc++.h>
using namespace std;
int a;
int f(int b) {
if (b == 1) {
return 1;
}
return b + f(b-1);
}
int main() {
cin >> a;
if (a == 0) {
cout << a << endl;
return 0;
}
cout << f(a) << endl;
} | ALGO | 0.999921 | 4.284421 |
4ab18f4c-81de-4e4f-a5e3-69f80f42c6a4 | CTroy2003/MC-CBS | src/Instance.cpp | #include<boost/tokenizer.hpp>
#include <algorithm> // std::shuffle
#include <random> // std::default_random_engine
#include <chrono> // std::chrono::system_clock
#include"Instance.h"
int RANDOM_WALK_STEPS = 100000;
// Description: Constructor for the Instance class. It loads or generates the map and age... | ALGO | 0.986025 | 5.57288 |
c8fea375-b2b2-4aa3-80d8-701bc5c0006b | 404Nikhil/CFC | cf/118a.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
cin.tie(0);
cin.sync_with_stdio(0);
string s;
cin >> s;
string output;
for (int i = 0; i < s.size(); i++)
{
char ch = tolower(s[i]);
if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u' || ch == 'y')
{
continue... | ALGO | 0.999149 | 3.532559 |
8fd0615a-3232-450c-9baa-c9591f251ac3 | zalim-388/shoppingcartapp | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998733 | 6.76775 |
122570dd-6e18-484a-a605-d57cc9b8dbce | RytAakarsh/DSA-Question | Array/ARRK_closest.cpp | // Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array.
//The result should also be sorted in ascending order.losest
// An integer a is closer to x than an integer b if:
// |a - x| < |b - x|, or
// |a - x| == |b - x| and a < b
#include<iostream>
#include<vector>
#in... | ALGO | 0.999998 | 5.084459 |
14de6409-7e8d-437d-a0d8-46157492ef5a | wugangca/competitive-programming | usaco/2016/closing.cpp | #include <bits/stdc++.h>
using namespace std;
void dfs(vector<vector<int>>& adj, vector<bool>& visited, vector<bool>& open,
int u) {
visited[u] = true;
for (int v : adj[u]) {
if (open[v] && !visited[v]) {
dfs(adj, visited, open, v);
}
}
}
int main() {
freopen("closing.in", "r", stdin);
... | ALGO | 0.999969 | 4.565084 |
09b98a99-c797-4ee4-86ec-493a4bcb4128 | coffeemug444/Advent-of-Code | 2022/day_08/part1.cpp | #include "../../generic_includes.hpp"
#include "../../helper_functions.hpp"
using vec1d = std::vector<unsigned>;
using vec2d = std::vector<vec1d>;
vec2d get_data()
{
std::vector<std::string> lines = open_lines("data.dat");
vec2d data;
for (auto& line : lines)
{
data.push_back(vec1d{});
std::tr... | ALGO | 0.990738 | 6.123059 |
2884156d-6f9e-4fda-925b-a1d7c0021380 | abhijeetsde1/DSA | DSA Crack Sheet/solutions/Second most repeated string in a sequence.cpp | /*
Second most repeated string in a sequence
==========================================
Given a sequence of strings, the task is to find out the second most repeated (or frequent) string in the given sequence.
Note: No two strings are the second most repeated, there will be always a single string.
Example 1:
Input:
... | ALGO | 0.999989 | 6.53545 |
c71ade7f-dd79-4405-aa2b-96624a44adb9 | Octavi-Staging/android_hardware_interfaces | neuralnetworks/aidl/utils/src/Utils.cpp | #include "Utils.h"
#include <aidl/android/hardware/common/Ashmem.h>
#include <aidl/android/hardware/common/MappableFile.h>
#include <aidl/android/hardware/graphics/common/HardwareBuffer.h>
#include <android/binder_auto_utils.h>
#include <android/binder_status.h>
#include <nnapi/Result.h>
#include <nnapi/SharedMemory.h... | TOOL | 0.885537 | 7.228756 |
1771a7e7-d86f-4d3e-980d-0e294b9978c0 | mitali-kumari/TargetAAA | AAA/treeTraversal.cpp | //
// Created by mitali on 07/09/19.
//
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
struct node {
int data;
struct node *left, * right;
node(int data){
this->data = data;
left = right = NULL;
}
};
void PrintPreOrder(struct node *root)
{
if(root == NULL)
... | ALGO | 0.99977 | 5.490318 |
9e006186-f842-4434-9edd-dde6f5be4fd0 | codewithaditya07/C_plusplus | Exception.cpp | /*
What is exception
by the exception handling we van handle the unaccepted data
handle the prohibited data
i=1
j=0
cout<<i/j;
*/
#include <iostream>
using namespace std;
int main()
{
try
{
int i, j, k;
i = 1;
j = 1;
if (j == 0)
{
throw "Sorry any values is not divided by 0\n";
}
cout << i / j;
... | TOOL | 0.865365 | 3.421819 |
138ca773-a5b0-4f45-b80e-380bd040417f | GiangHoGoVap/CO2039 | Practice/C++ How to Program - Deitel (10th)/Chapter 12/12.13/Account.cpp | #include <iostream>
#include <vector>
using namespace std;
class Account
{
protected:
double balance;
public:
Account()
{
this->balance = 0;
}
Account(double _balance)
{
if (_balance < 0)
{
this->balance = 0;
cout << "Balance was invalid." << end... | TOOL | 0.991972 | 5.008292 |
e2d30769-aef8-4000-b20a-2928bbaec028 | arm/arm-toolchain | llvm/lib/Transforms/Utils/SampleProfileInference.cpp | #include "llvm/Transforms/Utils/SampleProfileInference.h"
#include "llvm/ADT/BitVector.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Debug.h"
#include <queue>
#include <set>
#include <stack>
#include <unordered_set>
using namespace llvm;
#define DEBUG_TYPE "sample-profile-inference"
namespace {
sta... | ALGO | 0.998499 | 6.909041 |
ab402366-fce1-48a4-98ef-9d06b284f930 | delowarsikder/Coding-Ground | Online Judge solution/codeForces/A. Short Substrings.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
while(n--)
{
string str;
cin>>str;
string ans="";
for(int i=0; i<str.length(); i++)
{
if(i>0 && i%2==0)
{
continue;
}... | ALGO | 0.999964 | 4.130411 |
6bfdae5b-02a3-447b-8688-089ede115f9c | Hemant-Jain-Author/Problem-Solving-in-Data-Structures-and-Algorithms-using-Cpp | Algo/DP/EditDist.cpp | #include <string>
#include <vector>
#include <iostream>
int min(int x, int y, int z) {
x = std::min(x, y);
return std::min(x, z);
}
int editDistUtil(const std::string &str1, const std::string &str2, int m,
int n) {
// If any one string is empty, then empty the other string.
if (m == 0 || n == 0)
return m + n;... | ALGO | 0.999946 | 6.064832 |
a9f8403a-0afd-43dd-8bf8-783690fd1de6 | xaishmitax/CPP-Assignment | loop4.cpp | #include <iostream>
using namespace std;
int main() {
int n;
cout << "Input number of terms to display: ";
cin >> n;
int a = 0, b = 1, next;
cout << "Here is the Fibonacci series up to " << n << " terms:\n";
for (int i = 1; i <= n; i++) {
cout << a << " ";
next = a + b;
a = b;
b = next;
}
cout << ... | ALGO | 0.994734 | 4.018548 |
d73c582f-296d-4c3c-a6b3-ac5f1084e247 | sahajgg/SDAIA_Hack_Theme1 | yolov6/deploy/ONNX/OpenCV/yolox/yolox.cpp | #include <fstream>
#include <sstream>
#include <iostream>
#include <opencv2/dnn.hpp>
#include <opencv2/imgproc.hpp>
#include <opencv2/highgui.hpp>
using namespace cv;
using namespace dnn;
using namespace std;
class yolox
{
public:
yolox(string modelpath, float confThreshold, float nmsThreshold, string classesFile);
... | DATA | 0.898238 | 4.124407 |
005a9a73-fbd0-4fd9-8f01-935675262949 | imakshaysoni/LeetCode | 0072-edit-distance/0072-edit-distance.cpp | class Solution {
public:
int minDistance(string word1, string word2) {
int n = word1.size();
int m = word2.size();
// vector<vector<int>> dp(n+1, vector<int>(m+1, -1));
// return solve(word1, word2, n, m, dp);
// return tabulation(word1, word2, n, m);
... | ALGO | 0.999998 | 6.0384 |
48c9da8e-6bd3-4618-aac1-88822ca9f7bb | MingzhenY/code-warehouse | CodingWebsites/WHU_OJ/Volume5/P1405.cpp | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define maxn 100000
#define MOD 1000000007
#define LL long long
using namespace std;
int maxprime[maxn+1];
int Prime[maxn/10+1],PrimeN;
LL Prime2[maxn/10+1];
void Init(){
memset(maxprime,-1,sizeof(maxprime));
PrimeN = 0;
for(int i=2... | ALGO | 0.999849 | 3.673062 |
1406cfd9-b5ac-4eba-bd1d-a6ec6bcd74f1 | fuqinho/GoogleCodeJam | 2011_1A/B/main.cpp | #include <iostream>
#include <vector>
#include <map>
using namespace std;
pair<int, int> dfs(int k, string& L, vector<int> words, vector<vector<int> >& masks) {
// if the size of given group is 1, there is no guess
if (words.size() == 1) return make_pair(0, words[0]);
// m[mask]: the list of word ids which have... | ALGO | 0.999989 | 5.131423 |
1515b467-a059-45ff-b439-c56dfefa53f3 | WaddahAzhary/Data-structure-coursework-COMP272 | linkedlist/test1.cpp | #include<iostream>
using namespace std;
struct node {
int data;
node *prev;
node *next;
};
getNewNode (int i){
node *newNode = new node; //allocate a dynamic memory in the heap
newNode->data = i;
newNode->prev = NULL;
newNode->next = NULL;
}
InsertAtHead(int i){
if (head == NULL){
... | ALGO | 0.995912 | 3.382791 |
53467ebb-9f26-42a7-b400-1bb17902d276 | Harshsngh07/DataStructures_and_Algorithms | leetcode/TwoPointers/TwoSum2.cpp | class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
int left=0, right = numbers.size()-1;
vector<int> result(2);
while(left<right)
{
if(numbers[left]+numbers[right]==target)
{
result[0] = left+1;
... | ALGO | 0.999956 | 6.385082 |
899342a3-d268-4c35-bf25-df168c7f3034 | Manav0111/week1-Dp1-CipherSchools | video12/mergeksortedLinkedlist.cpp | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
class ListNode
{
public:
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* mergetwoLL(ListNode... | ALGO | 0.999925 | 5.589766 |
ad2c64a1-b905-4a7d-83e7-0d63bc1d683d | wiselyku/Algorithms | Link_Lists/Program4_1.cpp | #include<iostream>
#include<map>
using namespace std;
struct Node {
int data;
Node* next;
};
void initNode(struct Node *head,int n){
head->data = n;
head->next =NULL;
}
void display(struct Node *head) {
Node *list = head;
while(list) {
cout << list->data << " ";
list = list->next;
}
cout << endl;
cout ... | ALGO | 0.999943 | 4.385427 |
ea14a5c8-0dab-4460-93bf-e25e9791be70 | shineishukla/DSA_Cpp | Arrays/practice5.cpp | //Equilibrium index of an array
#include <iostream>
using namespace std;
void equilibrium(int arr[], int n){
int sum = 0;
int leftsum = 0;
for (int i = 0; i < n; i++){
sum += arr[i];
}
for (int i = 0; i < n; i++){
sum -= arr[i];
if (leftsum == sum){
cout << i;
... | ALGO | 0.999974 | 5.475725 |
0e84d697-e0bc-426c-ae95-fdea1fc349d9 | routb68/Leetcode-pratice | 987-vertical-order-traversal-of-a-binary-tree/987-vertical-order-traversal-of-a-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.999997 | 5.832013 |
ae53da3a-cf75-4f6b-8bcc-c1dada292473 | donbasta/leetcode-submissions | Medium/396.cpp | class Solution {
public:
int maxRotateFunction(vector<int>& nums) {
int n = nums.size();
int tmp = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
tmp += i * nums[i];
sum += nums[i];
}
int ans = tmp;
for (int i = n - 1; i >= 1; i--) {
... | ALGO | 0.999953 | 5.709465 |
445df02b-9ee4-4b5e-b94b-221083a554a6 | Niko1607/Portafolio | proyectos.c++/Guia 2/Punto3.cpp | #include <iostream>
using namespace std;
int main() {
int CantidadDevalores;
int Valor = 1;
cout << "Actividad 2." << endl;
cout << endl;
cout << "Por favor, escribe un numero para la cantida de valoreas a ingresar: ";
cin >> CantidadDevalores;
while (Valor <= CantidadDevalores) {
... | ALGO | 0.976451 | 3.863376 |
7e725eb4-7328-46ec-b269-6e9a38b5a46d | R0maFUN/AntsColony | AntsColony/main.cpp | #include <iostream>
#include <vector>
#include <map>
#include <time.h>
#include <Windows.h>
#include "vertex.h"
#include "truck.h"
#include <conio.h>
#include "ReadData.h"
using namespace std;
#define const_TruckCAPACITY 50;
#define const_RetailCAPACITY 460;
typedef unsigned int u_int;
/*
int BinarySearchID(vector<d... | ALGO | 0.998911 | 3.725584 |
0459c6c7-91fd-4e64-ace0-d49f54b19da1 | ReiAccept/Algorithm | misc/ccutoj/20210324/D.cpp | #include<bits/stdc++.h>
using namespace std;
int n;
int fib[30]={0,1,1};
bool a[100003];
signed main(){
ios::sync_with_stdio(false);
for(int i=3;i<=25;i++) fib[i]=fib[i-1]+fib[i-2];
for(int i=1;i<=25;i++) a[fib[i]]=true;
while(cin>>n){
if(a[n]) cout<<"Sakiya is so noob."<<endl;
else cout<<"Hans... | ALGO | 0.999749 | 3.663191 |
107a7211-dac4-4b3a-ba94-c0b6a61e53a4 | gongkrmin/gong_lite | godot_edit/thirdparty/embree/kernels/bvh/bvh_builder_twolevel.cpp | #include "bvh_builder_twolevel.h"
#include "bvh_statistics.h"
#include "../builders/bvh_builder_sah.h"
#include "../common/scene_line_segments.h"
#include "../common/scene_triangle_mesh.h"
#include "../common/scene_quad_mesh.h"
#define PROFILE 0
namespace embree
{
namespace isa
{
template<int N, typename Mesh... | ALGO | 0.970338 | 6.292633 |
ddae2be1-cd52-4611-a24b-8ffa7fc4ef88 | thiagohfo/URIOnlineJudge | Beginner/Nível 2/URI 1541.cpp | #include <stdio.h>
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int A, B, C, area, lado;
while(true){
cin >> A;
if(A == 0){
return 0;
}
else{
cin >> B >> C;
area = A * B;
lado = ... | ALGO | 0.999587 | 3.55978 |
338994a1-9404-47f8-825f-3f204e6b1461 | evapilotno17/cses-solutions | CSES-SOLUTIONS/Mathematics/Counting-Grids/lelouch-of-the-code.cpp | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll mod=1e9+7;
ll modp(ll base,ll exp) {
ll res=1;
while(exp) {
if(exp%2) {
res=(res*base)%mod;
}
base=(base*base)%mod;
exp/=2;
}
return res;
}
ll _0(ll n) {
ll p=n*n;
return modp... | ALGO | 0.999964 | 4.998242 |
e0545e29-3fe6-4854-9688-27070f4375d6 | raincross7/code-similarity | codes/train_code/problem193/problem193_240.cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000; //10^9
const ll inff = 1000000000000000000; //10^18
int main(){
string s;
ci... | ALGO | 0.999854 | 3.554153 |
7dc40dee-a430-4c67-ad75-27fa5d583daa | Uday-Berad22/GFG-questions | Medium/Find the string in grid/find-the-string-in-grid.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
int x[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int y[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
vector<vector<int>> searchWord(vector<vector<char>>& grid, string word) {
vector<vector<int>> resu... | ALGO | 0.999788 | 5.803848 |
8debb1fc-0c55-4ac4-bc21-c9e01b7f047b | trindadetiago/sudoku-backend | linear_search_files/linear_search.cpp | #include <iostream>
#include <vector>
#include <chrono>
int linear_search(const std::vector<std::string> &list, const std::string &target, int &iterations)
{
iterations = 0;
for (size_t i = 0; i < list.size(); ++i)
{
++iterations;
if (list[i] == target)
{
return i;
... | ALGO | 0.980097 | 5.30867 |
0ef4db44-c5e5-44cf-bfcd-1cfa485c1b84 | pritom-gps/Weekly-Problem-Solving-Update | Week 2/Day 2/N - Chemistry.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int tst;
cin >> tst;
while (tst--)
{
int n, k;
string s;
cin >> n >> k >> s;
if (n == 1)
cout << "YES" << '\n';
else
{
i... | ALGO | 0.999894 | 4.004222 |
fa74f492-a9f2-4863-9567-77f9978acdf5 | RCPawn/some-cpp-code | arithmetic/day08/calculateDepth.cpp | #include<bits/stdc++.h>
using namespace std;
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), left(left), right(... | ALGO | 0.999185 | 4.872984 |
753d61cd-60bd-4e9f-8c7a-68f056ac4e70 | VipulChauhan89/CodeChef-Practice-Problems | Beginner/Expiring Bread-EXPIRY/bread.cpp | /*
Eikooc loves bread. She has N loaves of bread, all of which expire after exactly M days. She can eat upto K loaves of bread in a day.
Program to find out can she eat all the loaves of bread before they expire?
*/
#include <iostream>
using namespace std;
int main()
{
int T,N,M,K;
cin>>T;
while(T--)
{
... | ALGO | 0.999827 | 4.075467 |
193c7f03-29b0-4a83-87c4-b595e6de7e78 | zju3dv/MagLoc-AR | 3rd_party/eigen/doc/examples/class_Block.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
template<typename Derived>
Eigen::Block<Derived>
topLeftCorner(MatrixBase<Derived>& m, int rows, int cols)
{
return Eigen::Block<Derived>(m.derived(), 0, 0, rows, cols);
}
template<typename Derived>
const Eigen::Block<const Derive... | TOOL | 0.946881 | 5.865374 |
4131decd-bb0b-4a80-8368-45418f2d9262 | Guruprasad-Kamat24/CPP | SLL/sll2.cpp | #include<iostream>
using namespace std;
class node
{
public:
int data;
node* next;
node(int val)
{
data=val;
next=NULL;
}
};
//Insert at tail
void insertAtTail(node* &head, int val)
{
node* n= new node(val);
if(head==NULL)
{
head=n;
return ;
}
no... | ALGO | 0.999918 | 4.077851 |
995a81c0-2927-4f88-94f4-cf8e8df8a23d | awishnick/sidescroller | lib/boost_1_49_0/libs/numeric/ublas/doc/samples/vector_binary_outer.cpp | #include <boost/numeric/ublas/matrix.hpp>
#include <boost/numeric/ublas/io.hpp>
int main () {
using namespace boost::numeric::ublas;
vector<double> v1 (3), v2 (3);
for (unsigned i = 0; i < (std::min) (v1.size (), v2.size ()); ++ i)
v1 (i) = v2 (i) = i;
std::cout << outer_prod (v1, v2) << std::... | ALGO | 0.998308 | 3.95939 |
a0422be4-4d16-410c-8fa0-31bddf3345fd | EvsChen/mpm-simulator | src/SVD.cpp | #include "SVD.h"
#include "ext/ImplicitQRSVD.h"
PolarResult PolarDecompose(const Mat3f &m) {
Eigen::JacobiSVD<Mat3f> res(m, Eigen::ComputeFullU | Eigen::ComputeFullV);
Mat3f U = res.matrixU(), V = res.matrixV();
Mat3f R = U * V.transpose();
Mat3f S = V * res.singularValues().asDiagonal() * V.transpose();
ret... | ALGO | 0.999193 | 6.441759 |
659b92c9-4237-46e7-8470-5157972b4279 | peercoin/peercoin | src/test/settings_tests.cpp | #include <util/settings.h>
#include <test/util/setup_common.h>
#include <test/util/str.h>
#include <util/fs.h>
#include <boost/test/unit_test.hpp>
#include <univalue.h>
#include <util/strencodings.h>
#include <util/string.h>
#include <util/system.h>
#include <fstream>
#include <map>
#include <string>
#include <syste... | TEST | 0.931146 | 6.180321 |
6080575a-02e4-47f3-8be4-2833f7475367 | Shashank-D0205/DSA-100-days-of-Code | Day 67.cpp | //4Sum
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
sort(nums.begin(), nums.end());
vector<vector<int>> ans;
int n =nums.size();
for(int i=0;i<n-3;i++){
if(i>0 && nums[i]==nums[i-1]){
continue;
}
... | ALGO | 0.999992 | 5.846938 |
b8b2d2a8-a7fb-40a8-bc46-389b212dcc7d | IshikawaKyosuke/laba2 | c++1.cpp | #include <iostream>
#include <string>
using namespace std;
bool check(const string& podstroka, const string& T) {
for (char c : T) {
if (podstroka.find(c) == string::npos) {
return false;
}
}
return true;
}
int main() {
setlocale(LC_ALL, "RU");
int i = 0;
string S, T, result = "";
cout << "Введите S: ";... | ALGO | 0.999887 | 4.786959 |
3977443f-eaac-47d1-b621-27275d9536bf | 4ker/aoapc-book | aoapc-bac2nd/ch9/UVa10934.cpp | // UVa10934 Dropping water balloons
// Rujia Liu
#include<iostream>
#include<cstring>
using namespace std;
const int maxk = 100;
const int maxa = 63;
unsigned long long d[maxk+1][maxa+1];
int main() {
memset(d, 0, sizeof(d));
for(int i = 1; i <= maxk; i++)
for(int j = 1; j <= maxa; j++)
d... | ALGO | 0.999761 | 3.773244 |
0d51ca35-ed89-4be3-8e35-105e64d7b541 | richelbilderbeek/SineApproxVcl | UnitBenchmarkSineApprox.cpp | //---------------------------------------------------------------------------
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <utility>
#include <cassert>
#include <cmath>
#include <boost/timer.hpp>
#pragma hdrstop
//---------------------------------------------------------------... | ALGO | 0.99936 | 5.478609 |
133e0eb5-4591-4d7f-9673-2be951a904fe | Dark-Basic-Software-Limited/GameGuruMAX | GameGuru Core/Dark Basic Public Shared/Dark Basic Pro SDK/Shared/Objects/ElipsoidCollision/col_response.cpp | //Collision response
#include "col_local.h"
CollisionPacket collisionPackage; //Stores all the parameters and returnvalues
int collisionRecursionDepth; //Internal variable tracking the recursion depth
bool isGravity=true; //Do we need to apply gravity?
bool isBackCulling=false; //Do we need to apply backface culling?... | ALGO | 0.998159 | 4.095659 |
2db1b4fd-3f0a-48b3-b941-664181d36220 | lazyboson/UVaSolutions | MinimumCoin.cpp | #include "MinimumCoin.h"
MinimumCoin::MinimumCoin(int __len__): change(0) {
//resize and fill default value to -1
dp.resize(__len__, -1);
}
int MinimumCoin::countMin(vector<int>& coins, int change)
{
if(change == 0) {
return 0;
}
int min = INT_MAX;
for(auto coin : coins) {
if (change - coin >= 0) {
in... | ALGO | 0.999846 | 5.583452 |
9c093794-c408-4127-afeb-aa2e785daa3f | remote-android/platform_external_swiftshader | third_party/llvm-7.0/llvm/lib/Analysis/DivergenceAnalysis.cpp | #include "llvm/Analysis/DivergenceAnalysis.h"
#include "llvm/Analysis/Passes.h"
#include "llvm/Analysis/PostDominators.h"
#include "llvm/Analysis/TargetTransformInfo.h"
#include "llvm/IR/Dominators.h"
#include "llvm/IR/InstIterator.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/Value.h"
#include "llvm/Support/D... | ALGO | 0.997009 | 7.908338 |
23ddd0c3-7691-42fe-91ba-6d2a79bab96e | LIFECorp/external_2 | llvm/lib/CodeGen/OptimizePHIs.cpp | #define DEBUG_TYPE "phi-opt"
#include "llvm/CodeGen/Passes.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/CodeGen/MachineFunctionPass.h"
#include "llvm/CodeGen/MachineInstr.h"
#include "llvm/CodeGen/MachineRegisterInfo.h"
#include "llvm/IR/Function.h"
#include "llvm/Target/TargetIns... | ALGO | 0.973751 | 7.687897 |
022f4948-0dad-4749-8af8-09a5deaedf2d | saurabhh-svg/Contests | OAs/CreditSuise/cutoff.cpp | #include <bits/stdc++.h>
#define int long long int
#define pb push_back
#define fl(i, n) for (int i = 0; i < n; i++)
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
void solve()
{
int cutoff, n, ans = 0;
cin >> cutoff >> n;
int a[n], ... | ALGO | 0.99984 | 4.015505 |
07ee7d72-4241-4404-aa30-d4128e5402fe | rilato/Baekjoon | cpp/레벨별/Bronze/Bronze3/2443(별_찍기-6).cpp | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
int M = 0;
cin >> N;
for (int i = N; i > 0; i--) {
int num = i * 2 - 1;
for (int j = 0; j <= M - 1; j++) {
cout << ' ';
}
for (int j = 1; j <= num; j++) {
cout << '*';
... | ALGO | 0.999962 | 3.76311 |
2f54469e-bf24-4d02-bef6-eb19979d4041 | EunoiaOS/android_external_libcxx | test/std/algorithms/alg.nonmodifying/alg.count/count.pass.cpp | // <algorithm>
// template<InputIterator Iter, class T>
// requires HasEqualTo<Iter::value_type, T>
// constexpr Iter::difference_type // constexpr after C++17
// count(Iter first, Iter last, const T& value);
#include <algorithm>
#include <cassert>
#include "test_macros.h"
#include "test_iterators.h"
#if TE... | TEST | 0.953803 | 6.951782 |
37c59a8c-f99c-4f0b-b99f-abc7b84844c3 | ckormanyos/real-time-cpp | examples/chapter10_09/src/sys/idle/sys_idle_pi_spigot.cpp | #include <algorithm>
#include <array>
#include <cstdint>
#include <math/constants/pi_digits_hash_sha1_control.h>
#include <math/constants/pi_digits_100th_pi_digits.h>
#include <math/constants/pi_spigot_state.h>
#include <mcal_lcd.h>
#include <mcal_memory_dram.h>
#include <mcal_pwm.h>
#include <sys/idle/sys_idle_pi_spi... | ALGO | 0.998257 | 6.567288 |
b97af4f9-5035-4f09-97f8-01f5eb4ac5cd | sarvex/leetcode-c-- | solution/0200-0299/0250.Count Univalue Subtrees/Solution.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999935 | 6.962998 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.