uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
4401c253-736e-4da6-af87-9b502343e2b2 | behnejad/quera | contest-3558.cpp | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int n, m, count = 0;
cin >> n >> m;
vector<int> days(30, 0);
n += m;
while (n--)
{
int x, y;
cin >> x >> y;
for (int i = x; i <= y; ++i)
{
days[i - 1] += 1;
if (days[... | ALGO | 0.999787 | 3.881795 |
23ebe175-955c-45c8-8d3e-dd2e146e58fd | dongyeseu/PAT | 2120_A.cpp | /*
1120 Friend Numbers（20 分）
Two integers are called "friend numbers" if they share the same sum of their digits, and the sum is their "friend ID". For example, 123 and 51 are friend numbers since 1+2+3 = 5+1 = 6, and 6 is their friend ID. Given some numbers, you are supposed to count the number of different frind ID's... | ALGO | 0.999889 | 5.08996 |
f93a8a5a-88d0-407f-9659-266ccbb4e750 | ishandutta2007/codeforces | eliden/normal/NA/397.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;++i)
#define debug(x) cerr<<#x<<": "<<x<<endl
#define sz(x) (int)(x).size()
using ll = long long;
using vi = vector<int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int MAXA=102;
vi count(MAXA,-1);
int... | ALGO | 0.999999 | 3.549607 |
be814d10-d178-4d41-9ce9-83f711e1b3a4 | TRAN-THUY-NGOC/UPCODER | UPCODER/Lập trình nâng cao /9. Xử lí chuỗi/DEMCHUOI.cpp | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int test;
string str;
cin >> test >> str;
while (test--) {
int cnt = 0;
string strc; cin >> strc;
int m = strc.find(str);
while (m != -1)
m = strc.fi... | ALGO | 0.999026 | 4.436097 |
92fd41d2-7ba9-4f93-89cc-bf67fa66fbd6 | hyeonseong0917/BOJ | dijkstra/1504.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
#define ll long long
const int MAX=800+1;
int N,E;
vector<pair<int,int>> v[MAX];
int dist[MAX];
int U,V;
int INF=122232421;
void Input(){
cin>>N>>E;
for(int i=0;i<E;++i){
int a,b,c;
c... | ALGO | 0.999797 | 4.594449 |
03d73aa2-f0fb-47c2-96d8-6fe09e9ba141 | GinOwO/CodeForces | Codeforces/1891_Codeforces Round 907 (Div. 2)/E_Brukhovich and Exams/E_Brukhovich and Exams.cpp | /*********************************
| OWO |
**********************************/
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("tune=native")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define in... | ALGO | 0.994712 | 5.103925 |
770c77ea-4412-4e3d-a922-e1e1e7e10741 | permin/Olymp | codeforces/296/E/problem.cpp | #include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stack>
#include <deque>
#include <queue>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <ctime>
#include <sstream>
#include <unordere... | ALGO | 0.998776 | 4.449769 |
5663c860-8b1c-4809-b0d4-19ece52a681b | boundarydevices/frameworks_av | media/libstagefright/codecs/mp3dec/src/pvmp3_huffman_decoding.cpp | /*
------------------------------------------------------------------------------
PacketVideo Corp.
MP3 Decoder Library
Filename: pvmp3_huffman_decoding.cpp
Funtions:
pvmp3_huffman_quad_decoding
pvmp3_huffman_pair_decoding
pvmp3_huffman_pair_decoding_linbits
Date: 09/21/2007
------------... | ALGO | 0.999948 | 6.113142 |
f0c69732-62d2-4ee8-9c32-58aeb8d0ca0d | Caerind/Keengine | Keengine/Sources/ExtLibs/Box2D/b2ChainAndCircleContact.cpp | #include "b2ChainAndCircleContact.h"
#include "b2BlockAllocator.h"
#include "b2Fixture.h"
#include "b2ChainShape.h"
#include "b2EdgeShape.h"
#include <new>
b2Contact* b2ChainAndCircleContact::Create(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator)
{
void* mem = alloc... | ALGO | 0.933987 | 6.263387 |
cb987a20-f738-4411-b83e-f561e40801da | zahid008/C-Plus | C++/perfectNumber/main.cpp | // Online C++ compiler to run C++ program online
#include <iostream>
using namespace std;
int isPerfect(int n)
{
int sum=0;
for(int i=1;i<n-1;i++)
{
if(n%i==0)
{
sum=sum+i;
}
}
if(sum==n)
return 1;
else
return 0;
}
int main() {
// Write C... | ALGO | 0.999807 | 5.082242 |
13219138-9936-4ed9-8a69-c69ad8201853 | dysania-z/algorithm-lab | lab1-1/main.cpp | #include<iostream>
#include<fstream>
#include<vector>
#include<windows.h>
#include<time.h>
#include<algorithm>
using namespace std;
void find(vector<int>& arr,int& maxnum,int& minnum,int l,int r)
{
if(l==r)
{
maxnum=arr[l];
minnum=arr[l];
return;
}
int mid=(l+r)>>1;
int maxl... | ALGO | 0.995296 | 3.816369 |
12a8001c-2325-45b1-b439-cb7cf315f9c1 | GQH123/Renatus-ACM-Codes | Codeforces Round #658 (Div. 1)/d/d.cpp | #include <bits/stdc++.h>
#define rep(i, l, r) for (register int i = l; i <= r; i++)
#define per(i, r, l) for (register int i = r; i >= l; i--)
#define srep(i, l, r) for (register int i = l; i < r; i++)
#define sper(i, r, l) for (register int i = r; i > l; i--)
#define erep(i, x) for (register int i = h[x]; i; i = e[i].... | ALGO | 0.999883 | 4.07552 |
2dc5e705-c96c-4d35-96ef-2be5fef36945 | akgautam8662/DSA-CPP | Patten/2.cpp | /*
Print This :-
4 3 2 1
4 3 2 1
4 3 2 1
4 3 2 1
*/
#include<iostream>
using namespace std;
int main()
{
int n;
cout<<"Enter Number :- ";
cin>>n;
int i=1;
while (i<=n)
{
int j=1;
while (j<=n)
{
cout<<n-j+1<<" ";
j++;
}
cout<<endl;... | ALGO | 0.999944 | 3.885073 |
d47b9d8a-2887-45bc-8654-494cc2d415b0 | iagorrr/Competitive-Programming-Solutions | submissions/ICPC/2023-2024 ICPC Northwestern European Regional Programming Contest (NWERC 2023)/L. Lateral Damage.cpp | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
/*
ios_base::sync_with_stdio(0);
cin.tie(0);
*/
/*
int sz = 100;
vector test(sz+1, vector(101, '.'));
int _shots = 0;
for (int r = 1; r <= sz; r++) {
for (int c = r; c >= 1; c -= 5) {
test[r][c] = '#';
_shots++;
}
for (int c = r+5; c... | ALGO | 0.999241 | 3.76419 |
55faac3d-0fc0-493b-8355-ca3028603772 | ashishbindra2/cpp | PermutationList/PermutationList/PermutationList.cpp | // PermutationList.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include "iostream"
#include "string"
using namespace std;
void per(int[],int,int);
int _tmain(int argc, _TCHAR* argv[])
{
char str[]="ABC";
int n=strlen(str);
per(str,0,n-1);//2,0,1
cout<<endl;
system("pause");
... | ALGO | 0.998082 | 4.211764 |
c4c27186-0851-4cad-970a-62521dd7b3ba | chrisdembia/coin | Bonmin/Ipopt/examples/hs071_cpp/hs071_main.cpp | #include "IpIpoptApplication.hpp"
#include "hs071_nlp.hpp"
#include <iostream>
using namespace Ipopt;
int main(int argv, char* argc[])
{
// Create a new instance of your nlp
// (use a SmartPtr, not raw)
SmartPtr<TNLP> mynlp = new HS071_NLP();
// Create a new instance of IpoptApplication
// (use a SmartP... | TOOL | 0.983179 | 6.044533 |
fe2e07b9-6631-4c98-adbc-1b6e7366fd99 | Codesmith28/cse205-ds | cp/codeforces/2025-02-02/BJOEIsOnTV.cpp | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#include "debug.h"
#else
#define dbg(x...)
#endif
using namespace std;
/* (╯°□°)╯︵ ┻━┻ */
#define int long long
#define pii pair<int, int>
#define endl "\n"
const int inf = 1e18;
const int ninf = -1 * inf;
int mod = 1e9 + 7;
void solve( ) {
int n;
cin >> n;
... | ALGO | 0.997636 | 4.223172 |
21446b47-6ff2-45e7-abf2-74de3ff7dc2a | mlogic1/advent-of-code-2023 | src/day09.cpp | /************************ ADVENT OF CODE 2023 **********************************
** adventofcode.com * *
** * /.\
** mlogic1 (https://github.com/ml... | ALGO | 0.999791 | 6.125638 |
46b6fa74-3cae-4b79-b29c-2055f323f0c8 | Junghs-cloud/Baekjoon | Gold/4/_14502.cpp | #include <iostream>
#include <queue>
using namespace std;
int** arr;
int** original;
int N, M;
bool** isVisited;
struct pos
{
int x;
int y;
pos(int a, int b)
{
x = a;
y = b;
}
};
queue<pos> bfsQueue;
int maxCount;
void count()
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < M; j++)
{
if (arr[i][j... | ALGO | 0.99965 | 4.514282 |
607776a9-d390-4b61-b393-90f6ea1ac7d9 | xspirus/Algo | Trip/trip.cpp | /**
* Credits: https://www.hackerrank.com/topics/lowest-common-ancestor
* https://www.youtube.com/watch?v=ctZ7fjMbPWE
*/
#include <iostream>
#include <vector>
#include <list>
#include <queue>
#include <climits>
#include <algorithm>
#include <cmath>
#define BSIZE 1<<15
char buffer[BSIZE];
int bpos = 0, bs... | ALGO | 0.999973 | 5.351531 |
0e0fc898-ffa3-49cd-94fe-a5bb87668b2f | 666WXY666/czxt-readerwriter | producer-consumer/源.cpp | #include<iostream>
#include<mutex>
#include<chrono>
#include<thread>
using namespace std;
int n = 10; // С
int in[3] = { 0,0,0 }, out[3] = { 0,0,0 }; // ָ,ָ
int flag[3] = { 0,0,0 }; //
int buffer[3][10]; //
mutex mtx[3]; //
mutex data_mtx; //
/**
* ߺ
*/
void producer(in... | ALGO | 0.990654 | 3.567563 |
b9f7e217-7713-4267-9266-3bdcf5b6d201 | iliyian/codeforces.com | 1931/C.cpp | #include <bits/stdc++.h>
#define int long long
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int lmax = 1, rmax = 1;
for (int i = 2; i <= n; i++) {
if (a[i] == a[i - 1]) {
lmax = i;
} else {
break;
}
... | ALGO | 0.999772 | 5.003364 |
19de9933-b6e3-40b9-a524-78bfe7207f8c | graphcore/poplibs | lib/poplibs_test/NonLinearity.cpp | #include <algorithm>
#include <cassert>
#include <cmath>
using namespace popnn;
static double sigmoid(double x) { return (1.0 / (1.0 + exp(-x))); }
static double hardSigmoid(double x) {
return (std::max(0.0, std::min(1.0, (x * 0.2 + 0.5))));
}
// Approximation used for CDF(x) for a normal distribution
// 0.5 * (1 ... | ALGO | 0.969435 | 7.271301 |
a8dc971e-d422-4058-a610-5c9b679acf1d | ir-rafio/iut-algorithms-lab-2a-summer-23-24 | Lab 2/Task B/submission/220041209_lab2_taskB.cpp | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
using LL = long long;
void pre()
{
fastio;
}
void solve(int tc)
{
LL n;
cin >>n;
vector <LL> arr(n);
vector <LL> arr2(n);
for(LL i=0;i<n;i++){
cin >> arr[i];
}
for (LL i=0;i... | ALGO | 0.999946 | 3.04351 |
847aec80-2d8f-4d54-8dca-6bf66c297519 | josefgraus/self_similarity | include/libigl/include/igl/gaussian_curvature.cpp | template <typename DerivedV, typename DerivedF, typename DerivedK>
IGL_INLINE void igl::gaussian_curvature(
const Eigen::PlainObjectBase<DerivedV>& V,
const Eigen::PlainObjectBase<DerivedF>& F,
Eigen::PlainObjectBase<DerivedK> & K)
{
using namespace Eigen;
using namespace std;
// internal corner angles
Ma... | ALGO | 0.997714 | 5.808574 |
264aed8b-f970-47d7-82e6-adf5fc615f1b | AleksanderMarkov-mav13/Home_Work_GB-ArrayS-Lesson_2_Vector-Class_Part | 3_1_bots_Showcase.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> erase_bot(vector<int> vec, vector<int> bot_sell)
{
vector<int> newvec(vec.size() - bot_sell.size());
int count_less = 0;
for (int i = 0; i < vec.size(); i++)
{
if (i == bot_sell[count_less] - 1)
{... | ALGO | 0.997408 | 3.7478 |
148276f8-8c1d-437f-b966-95df82f84207 | cuijixiang000/TraditionalStitch | HomoStitch/src/StitichBase/Cylinder/CylinderWarp.cpp | #include "CylinderWarp.h"
CylinderWarp::CylinderWarp(const float& fFactor, const cv::Size& ImgSize, const float& fFocal)
{
_fFactor = fFactor;
_ImgSize = ImgSize;
_CylinderSize = CalCylinderSize(fFocal);
}
CylinderWarp::~CylinderWarp()
{
_fFactor = 0.0;
_ImgSize.width = _ImgSize.height = 0;
_CylinderSize.width =... | ALGO | 0.982238 | 4.486056 |
7ceeb220-db6e-44ae-b0c7-0d915f427365 | shubham25kr07/Attendance_via_face_Recognition | opencv-master/samples/dnn/human_parsing.cpp | //
// this sample demonstrates parsing (segmenting) human body parts from an image using opencv's dnn,
// based on https://github.com/Engineering-Course/LIP_JPPNet
//
// get the pretrained model from: https://www.dropbox.com/s/qag9vzambhhkvxr/lip_jppnet_384.pb?dl=0
//
#include <opencv2/dnn.hpp>
#include <opencv2/highg... | DATA | 0.973277 | 5.574778 |
7ca5de1f-3033-4069-8d28-86946d021331 | yunshouhu/learn_opencv | objectDetection.cpp | #include "opencv2/objdetect/objdetect.hpp"
#include "opencv2/highgui/highgui.hpp"
#include "opencv2/imgproc/imgproc.hpp"
#include <iostream>
#include <stdio.h>
using namespace std;
using namespace cv;
/** */
void detectAndDisplay(Mat frame);
/** ȫֱ */
string face_cascade_name = "haarcascade_frontalface_alt.xml";
s... | TOOL | 0.925061 | 5.735121 |
78739eba-b97a-4d6f-99cf-2df403cf5882 | Nelsonmwaura/Algorithmic-Pseudocode | LeetCode Non-Contest Solutions/#103 Zig Zag Tree Traversal/Level Order Approach.cpp | class Solution
{
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root);
};
vector<vector<int>> Solution :: zigzagLevelOrder(TreeNode* root)
{
stack<struct TreeNode *> currentLevel, nextLevel;
vector<vector<int>> answer;
int level = 0;
// If root is not null, push it on the stack
if(... | ALGO | 0.999998 | 6.319748 |
fc55e87c-fee2-4e67-93bf-628b560e1c27 | Shaquille-Wu/MNN | tools/train/source/models/Lenet.cpp | #include "Lenet.hpp"
#include <MNN/expr/NN.hpp>
using namespace MNN::Express;
namespace MNN {
namespace Train {
namespace Model {
Lenet::Lenet() {
NN::ConvOption convOption;
convOption.kernelSize = {5, 5};
convOption.channel = {1, 20};
conv1.reset(NN::Conv(convOption));
convOption.reset();
... | DATA | 0.851171 | 4.772187 |
3c0b1eb2-b76d-4c61-b3a0-12478ba67e2f | sidhant-sriv/DAA | graham.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
struct Point {
double x, y;
};
// Calculate the orientation of three points (p, q, r)
int orientation(const Point& p, const Point& q, const Point& r) {
double val = (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y ... | ALGO | 0.999999 | 6.50698 |
fa3e7272-093d-4a76-ba78-7168b163ceea | yuweihsu01/LeetCode_USC | 153_Find Minimum in Rotated Sorted Array.cpp |
class Solution {
public:
int findMin(vector<int>& nums) {
if ( nums.size() == 1 )
return nums[0];
int min = nums[0];
int i = 0, j = nums.size()-1;
while ( 1 ) {
if ( nums[i] > nums[i+1] )
return nums[i+1];
else if... | ALGO | 0.999995 | 5.751507 |
5105d272-405a-442b-b2bb-b3779c4ddc44 | huang123aini/Some_Libs | Opencv_Test/opencv-4.x/modules/photo/src/align.cpp | #include "precomp.hpp"
#include "opencv2/photo.hpp"
#include "opencv2/imgproc.hpp"
#include "hdr_common.hpp"
namespace cv
{
class AlignMTBImpl CV_FINAL : public AlignMTB
{
public:
AlignMTBImpl(int _max_bits, int _exclude_range, bool _cut) :
name("AlignMTB"),
max_bits(_max_bits),
exclude_ra... | TOOL | 0.970135 | 5.323123 |
19cf4ab6-0133-4c2d-8449-ae0434809113 | zhaoweigg/RST | prime_thrFn.cpp | // Guanhong Zhou <<EMAIL>>, Evan Su <<EMAIL>>
#include <stdlib.h>
#include <assert.h>
#include <iostream>
#include <thread>
#include <vector>
bool isPrime(int64_t x);
// Shared globals, allocated before threads are spawned
// These will be used in the threaded code
extern std::vector<int64_t> candidates; // Candidate... | ALGO | 0.996643 | 5.474453 |
55ff8a46-93b9-4816-a048-958fd120332e | Iwaide/AtCoder | abc200/c/main.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N;
cin >> N;
map<int, int> A;
rep(i, N) {
long long Ai;
cin >> Ai;
int modA = Ai % 200;
A[modA] += 1;
}
long long re... | ALGO | 0.999691 | 4.091033 |
8edd7392-ce2a-4406-beb5-0c8cf37beb3f | Tahsin-Zaman-Jilan/Codeforce-Solutions-By-ZIlanJaman | A - Bear and Big Brother.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int A,B,sum=0;
cin>>A>>B;
for(; ;){
A=A*3;
B=B*2;
sum++;
if(A>B){
break;
}
}
cout<<sum;
}
| ALGO | 0.999864 | 3.942893 |
b183a72b-d3d7-46bb-bc2f-471c412a8350 | LeHaiDangSPKT/Nam1-Nam2 | 1. Freshman_HKI/NMLT/BT Tuan4 C/Bai 22/Bai 22.cpp | #include <stdio.h>
#define MAX 100
void nhap(int A[], int& n);
void tinh(int A[], int n);
void main()
{
int A[MAX], n;
nhap(A, n);
tinh(A, n);
}
void nhap(int A[], int& n)
{
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &A[i]);
}
}
void tinh(int A[], int n)
{
int dem = 0;
for (int i = 0; i< n-... | ALGO | 0.999775 | 3.465416 |
d797cd69-031e-4b06-b149-96863544fb6e | LGY3030/cpp_practice | Leetcode/54/Spiral_Matrix.cpp | class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<int> res;
vector<vector<bool>> vec(matrix.size(), vector<bool>(matrix[0].size(), false));
int h=0;
int v=0;
vector<pair<int, int>> opt={{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
int direct... | ALGO | 0.999998 | 6.071627 |
65dc6159-aa9f-45d6-8e10-ce5d4e8fc279 | stackwild/gogogadget | leetcodes/1408. String Matching in an Array/1408-3.cpp | struct TrieNode {
vector<shared_ptr<TrieNode>> children;
int count = 0;
TrieNode() : children(26) {}
};
class Trie {
public:
void insert(const string& word) {
shared_ptr<TrieNode> node = root;
for (const char c : word) {
const int i = c - 'a';
if (node->children[i] == nullptr)
node... | ALGO | 0.999855 | 6.370258 |
3ea5fc86-d462-4515-a084-4afa689be895 | ss6364/practice-CP | contest-1206-problem-A.cpp | // https://codeforces.com/contest/1206/problem/A
// Choose Two Numbers
#include<bits/stdc++.h>
using namespace std ;
#define Fors(n) for(int i=1;i<=n;i++)
#define For(n) for(i=0;i<n;i++)
#define ll long long
#define vint(s) vector<int> s
#define pb(x) push_back(x)
#define mpair(x,y) make_pair(x,y)
#define IOS ios:... | ALGO | 0.999959 | 3.211877 |
c3351bb1-623f-4593-8279-802213ae194f | NicholasUH/COSC3320 | hw4/p21.cpp | // 2edc45a2-35ae-4259-9f85-64eca275858a
#include <iostream>
#include <map>
#include <vector>
using namespace std;
bool isValid(string operand1, string operand2, string sum, map<char, char> &assignments)
{
for (int x = 0; x < operand1.length(); x++)
{
operand1[x] = (assignments[operand1[x]]);
}
... | ALGO | 0.99993 | 4.813491 |
37c98883-ea35-4b19-a6c8-487a10beff5e | Sachin5510/CPP | stl_array_of_vector.cpp | #include <bits/stdc++.h>
using namespace std;
void printvector(vector<int> v)
{
cout << "size of vector: " << v.size() << endl;
for (int i = 0; i < v.size(); i++)
{
cout << v[i]<< endl;
}
}
int main()
{
int N;
cin>>N;
vector<int> v[N];
for (int i = 0; i < N; i++)
{
int n;
cin >> n;
fo... | ALGO | 0.993841 | 4.160133 |
d40c9f6f-b3fc-4bb3-87a6-62678f919cb6 | arslanali19470/LeetCode_Solution | 0048-rotate-image/0048-rotate-image.cpp | class Solution {
public:
void rotate(vector<vector<int>>& matrix) {
int TotalRow=matrix.size();
int TotalCol=matrix[0].size();
//Transpose of the matrix:
for(int i=0; i<TotalRow;i++){
for(int j=i;j<TotalCol;j++){
int temp=matrix[i][j];
... | ALGO | 0.999953 | 6.556945 |
218738b0-40b6-4e7b-9403-23f4cb7d0384 | ishandutta2007/codeforces | matrixcascade_qwq/normal/547/D.cpp | //#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4", "avx")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define YES puts("YES")
#define NO puts("NO")
#define Yes puts("Yes")
#define No puts("No")
#define edl puts("")
#define mc cer... | ALGO | 0.999185 | 3.508297 |
af8a87c8-bb37-4fba-9810-9ebf78ddc267 | NoheliaEstefhania/competitive_2022 | codecheft/cap.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define endl "\n"
#define INF 2e9
void solve(){
int x, y;
cin>>x>>y;
if(x<y)
cout<<"FIRST"<<endl;
else if(x>y)
cout<<"SECOND"<<endl;
else
cout<<"ANY"<<endl;
}
int main(){
ios_base::sync_with_stdio(false);... | ALGO | 0.999666 | 3.935646 |
0f940d57-bf4a-4083-8b36-b368148897b9 | mimithu-99/chap_5_gen_q_1_3_refactoring_complex_widget_trees | 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 |
a9c24358-cb7f-4a98-8094-1e9ef8b60306 | sunbines/log | boost/libs/geometry/doc/doxy/doxygen_input/sourcecode/doxygen_1.cpp | OBSOLETE
#include <boost/tuple/tuple.hpp>
#if defined(_MSC_VER)
// We deliberately mix float/double's here so turn off warning
#pragma warning( disable : 4244 )
#endif // defined(_MSC_VER)
#include <boost/geometry/geometry.hpp>
#include <boost/geometry/geometries/register/point.hpp>
#include <boost/geometry/geometri... | TOOL | 0.948034 | 7.397203 |
9122102e-df68-41d2-80c9-f4210a80ac33 | NguyenTuan298/BaiTap_LTTBDD | 2251120328_NguyenQuocTuan_BaitapTuan2/hethongquanlythuvien/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.997797 | 6.76775 |
d3d05a08-f7d5-45ce-96d7-a9ef643e0e31 | isaacmsl/competitive-programming | AtCoder/abc293/b.cpp | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
int c[200000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (c[i] == 0) {
c[x-1] = 1;
++qntC;
}
}
... | ALGO | 0.999979 | 3.698504 |
c0cd2eeb-f48c-4044-af3e-83021797ba31 | pryogendra/C-CPP-Programming-Code | Prime.cpp | #include<iostream>
using namespace std;
int main()
{
int num,a=1;
cout<<"Enter a number to check prime or not : ";
cin>>num;
if(num==1)
{
cout<<"Number "<<num<<" is neither be prime nor composite.";
}
else if(num==2)
{
cout<<"Number "<<num<<" is a prime number.";
}
else
{
for(int i=2;i<num;i++)
{
... | ALGO | 0.999307 | 3.656025 |
59e307c9-ec40-4d16-9fc3-229efbe6ece4 | wingsuit360/Cplusplus | Example_20_3.cpp | #include <stdio.h>
#include <tchar.h>
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
template<class T>
struct Stack {
vector<T> sv;
void push(T t) {
sv.insert(sv.begin(), t);
}
T pop() {
T tmp = sv.front();
sv.erase(sv.begin());
return tmp;
}
bool empty() {
return sv.empty... | ALGO | 0.998485 | 4.261243 |
cb9d293f-0de4-4812-8778-ca95ffc16573 | frogface539/LeetCode | 416-partition-equal-subset-sum/partition-equal-subset-sum.cpp | class Solution {
public:
bool solve(vector<int>& nums , int targetSum , int index , vector<vector<int>>& dp){
if(targetSum == 0){
return true;
}
if(targetSum < 0 || index == nums.size()){
return false;
}
if(dp[targetSum][index] != -1){
re... | ALGO | 0.999948 | 5.996508 |
7aae2eb6-b247-4b0e-8e98-471a61b6f2ad | haishand/work | CP/hackerrank/nCrtable.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9;
const int maxn = 1e3;
ll c[maxn][maxn];
int main() {
int t;
cin >> t;
c[0][0] = 1;
c[1][0] = 1; c[1][1] = 1;
for(int k=2; k<maxn; k++) {
for(int i=1; i<k; i++) {
c[k][i] = (c[k-1][i-1]+c[k-1][i])%mod;
}
c[k][0] = ... | ALGO | 0.999937 | 3.646079 |
2936cdce-d8bb-45d0-b41e-9d0b7aedf643 | ishandutta2007/codeforces | chuochuo/normal/1096/F.cpp | #pragma GCC optimize(3)
#include<bits/stdc++.h>
#define MAXN 1000005
#define INF 1000000000
#define MOD 998244353
#define F first
#define S second
using namespace std;
typedef long long ll;
const ll inv2=(MOD+1)/2;
ll a[MAXN],d,b[MAXN],s[MAXN],t[MAXN],c[MAXN],ans;
int n,tt;
ll pow_(ll x,ll y)
{
ll res=1;
while ... | ALGO | 0.999845 | 4.047741 |
ab4df416-0f9a-4e85-ad1c-1aacf895f9a6 | ishandutta2007/codeforces | lonefox/normal/590/D.cpp | #define DEBUG 0
#include <algorithm>
#include <functional>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <list>
#include <map>
#includ... | ALGO | 0.999883 | 3.248891 |
406a44c4-8803-4f5c-acb7-b68194f0cae1 | 46ra20/Programming | Data_Structure_And_Algoritham/Module_2_5/D_Counting_Elements.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, count = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
if (a[i] + 1 == a[j])
{
count++;
... | ALGO | 0.999827 | 3.946741 |
4cbdc913-baaa-43a5-b6ca-f037dace8f28 | LucasRocha3/Faculdade | Aeds 2/Nivelamento/Exercicios de Revisao/Ex3.cpp | #include <iostream>
using namespace std;
void func(int vet[5],int x){
int maior=0,menor=100000;
for(int i=0;i<5;i++){
if(vet[i]>maior){
maior=vet[i];
}
if(vet[i]<menor){
menor=vet[i];
}
}
cout<<"O maior numero e "<<maior;
cout<<"\nO menor numero e "<<menor;
}
int main() {
int x... | ALGO | 0.999653 | 3.624395 |
4cd2e791-c360-4599-b4a7-7ca9c7126f3f | Edgarrrrrr/T2-RELION | src/symmetries.cpp | #include <stdio.h>
#include "src/symmetries.h"
// Read Symmetry file ======================================================
// crystal symmetry matices from http://cci.lbl.gov/asu_gallery/
int SymList::read_sym_file(FileName fn_sym)
{
int i, j;
FILE *fpoii;
char line[80];
char *auxstr;
RFLOAT ang_... | TOOL | 0.990965 | 3.918492 |
2adb8cb6-dde9-4291-bb9e-48d5a377101f | KFGD/Coding_Test_Programmers | Level2/Level2_카카오프렌즈_컬러링북.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void fun(const int color, const int x, const int y, const int m, const int n, vector<vector<int>>& picture, int& area)
{
if (0 > x || 0 > y || m == y || n == x)
return;
if (0 == picture[y][x])
return;
if (color != picture[y][x])
... | ALGO | 0.999622 | 5.562373 |
23a0818e-fa8d-43c1-bc37-1967beb909ec | MishkatIT/codeforces-atcoder-submissions | codeforces/1729/1729C Jumping on Tiles.cpp | /*
author : MishkatIT
created : Wednesday 2023-03-22-22.28.29
*/
#include<bits/stdc++.h>
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define debug(_) cout << #_ << " is " << _ << '\n';
using namespace std;
int main()
{
fio;
int t;
cin >> t;
while(t--)
{
stri... | ALGO | 0.999477 | 4.157094 |
d2fa232a-54aa-4f2c-bc92-c3e1ca44d505 | moon3fire/amas-engine | externals/include/glm/test/gtx/gtx_fast_trigonometry.cpp | #include <glm/ext/scalar_ulp.hpp>
#define GLM_ENABLE_EXPERIMENTAL
#include <glm/gtc/type_precision.hpp>
#include <glm/gtx/fast_trigonometry.hpp>
#include <glm/gtx/integer.hpp>
#include <glm/gtx/common.hpp>
#include <glm/gtc/constants.hpp>
#include <glm/gtc/vec1.hpp>
#include <glm/trigonometric.hpp>
#include <cmath>
#i... | TEST | 0.984188 | 6.277224 |
c4526073-81a6-4184-b834-0f81b8102fc8 | theoden42/code-store | codeforces/Codeforces Round 715 (Div. 1)/A.cpp | /* author: (g)theoden42 */
#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 all(a) a.begin(), a.end()
#ifdef ON_PC
#include <debug.h>
#else
#define debug(x...)
#endif
template<typename... | ALGO | 0.99997 | 4.457419 |
e6539fe3-cd87-42ff-950a-1363e27bea7c | wdazhi97/httpserver | third/boost_1_87_0/libs/geometry/index/example/3d_benchmark.cpp | // Boost.Geometry Index
// Additional tests
#include <iostream>
#include <boost/geometry/index/rtree.hpp>
#include <boost/chrono.hpp>
#include <boost/foreach.hpp>
#include <boost/random.hpp>
int main()
{
namespace bg = boost::geometry;
namespace bgi = bg::index;
typedef boost::chrono::thread_clock clock_... | TEST | 0.966451 | 6.076528 |
b89da553-742c-419c-afb3-b43385a4904c | gmagannaDevelop/msa-mod | src/ClustalW/src/tree/UPGMA/UPGMAAlgorithm.cpp | #ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "UPGMAAlgorithm.h"
#include <cmath>
#include <ctime>
#include <iomanip>
#include <sstream>
#include "../../general/SymMatrix.h"
#include "../../general/debuglogObject.h"
#include "../../general/clustalw.h"
#include "upgmadata.h"
namespace clustalw
{
UPGMAA... | ALGO | 0.999417 | 5.014871 |
6d117ae0-e717-474a-8a61-039f9389128b | alogeclock/Problem-Solving | BOJ/Gold/[11444] 피보나치 수 6.cpp | #include <bits/stdc++.h>
using namespace std;
#define MAX_NUM ((int)1e7 + 5)
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define PINF 1000000007
ll N;
map<ll, ll> fib;
ll fibo(ll k) {
if (fib[k]) return fib[k];
ll ret;
if (k % 2) {
ll A = fibo(k / 2);
ll B = fibo(k / 2 ... | ALGO | 0.999981 | 4.635967 |
e39635a2-715a-4211-94b3-13b4ab6cfc99 | oculi-s/Contest | 2023_SCPC/2nd_round/Q3 (45,300).cpp | #include <bits/stdc++.h>
using namespace std;
using ld = long long;
using str = string;
using vec = vector<ld>;
using snt = set<ld>;
using mat = vector<vec>;
using pii = pair<ld, ld>;
using vii = vector<pii>;
#define all(a) a.begin(), a.end()
#define rev reverse
#define pb push_back
#define sz size
#define ... | ALGO | 0.999804 | 4.26832 |
c0213af7-ee62-404e-86fd-238db4330ee9 | sunbines/boost_demo | boost/libs/graph/example/bfs-example2.cpp | #include <iostream>
using namespace boost;
template < typename TimeMap > class bfs_time_visitor:public default_bfs_visitor {
typedef typename property_traits < TimeMap >::value_type T;
public:
bfs_time_visitor(TimeMap tmap, T & t):m_timemap(tmap), m_time(t) { }
template < typename Vertex, typename Graph >
void... | ALGO | 0.999879 | 6.128194 |
8efb73bf-ba06-4a1d-83d3-fa71e0b46597 | Sudhir769/leetcode-solutions | 2379-maximum-total-importance-of-roads/maximum-total-importance-of-roads.cpp | class Solution {
public:
long long maximumImportance(int n, vector<vector<int>>& roads) {
vector<int> indegree(n, 0);
long long importance = 0;
for(auto it:roads){
indegree[it[0]]++;
indegree[it[1]]++;
}
sort(indegree.begin(), indegree.end());
... | ALGO | 0.999951 | 5.623428 |
3bfcfe41-5cab-4c69-9c14-46425bdb0f11 | JoshGaviola/leetcode | 191.) Number of 1 Bits/solution.cpp | class Solution {
public:
int hammingWeight(uint32_t n) {
int count = 0;
while (n > 0) {
if (n & 1) {
count++;
}
n >>= 1;
}
return count;
}
}; | ALGO | 0.999613 | 6.506218 |
ff5a5d41-5365-4239-8421-f65f44c69453 | maruthi718/LEETCODE-SUBMISSIONS | 0680-valid-palindrome-ii/0680-valid-palindrome-ii.cpp | class Solution {
public:
int cnt=0;
bool check(string s,int l,int r)
{
while(l<r)
{
if(s[l]==s[r])
{
l++;
r--;
}
else
{
cnt++;
if(cnt>1)
ret... | ALGO | 0.999997 | 6.333451 |
224b616d-1c2d-4bc2-8735-f71cf579a738 | Arhan13/seanprashad-leetcode-patterns | String/1360. Number of Days Between Two Dates/Codes/math.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution
{
private:
int numOfDaysInANonLeapYear = 365;
int numOfDaysInLeapYear = 366;
private:
bool isLeapYear(int year)
{
return ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0)) ? true : false;
}
int daysInMonth(int month, i... | ALGO | 0.999919 | 5.389527 |
044569ff-2b1b-4b4c-998e-67f2885d55d8 | pronad1/Problem_Solving_Part1 | good_prefixes.cpp | //Author : PROSENJIT MONDOL
#include<bits/stdc++.h>
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower);
#define upper(s) transform(s.begin(), s.end(), s.begin(), ::toupper);
using namespace std;
const int inf = 3e5;
using ll=long long ;
ll mod = 1e9 + 7;
//-----------------------------------------... | ALGO | 0.999798 | 4.360014 |
08ac7492-e87c-44cd-9788-92a6afdc16d7 | madahetooo/breakingbadwithdio | 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 |
cd162949-b459-4fb8-9b0d-5a44dbe95243 | areian13/PS_BOJ | 1. Bronze/Bronze 1/[B1] 28255 3단 초콜릿 아이스크림.cpp | #include <iostream>
#include <string>
#include <algorithm>
#define FastIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)
using namespace std;
string Third(string& icecream)
{
return icecream.substr(0, (icecream.size() + 2) / 3);
}
string Rev(string icecream)
{
reverse(icecream.begin(),... | ALGO | 0.995919 | 5.206698 |
29562316-9943-45a7-87c3-f2ca220c595f | HPCLab-933/Vina-CUDA | Vina-CUDA_v1.1/lib/cache.cpp | #include <algorithm> // fill, etc
#if 0 // use binary cache ע͵
// for some reason, binary archive gives four huge warnings in VC2008
#include <boost/archive/binary_oarchive.hpp>
#include <boost/archive/binary_iarchive.hpp>
typedef boost::archive::binary_iarchive iarchive;
typedef boost::archive::binary_oarchive o... | ALGO | 0.972932 | 4.034045 |
72d4d5eb-7aaf-481d-a29c-7171de5d2ce7 | orekiousun/Code | C++/LeetCode/Offer/Offer-String-67-strToInt.cpp | #include<iostream>
using namespace std;
#include<vector>
#include<string>
/*
写一个函数 StrToInt，实现把字符串转换成整数这个功能。不能使用 atoi 或者其他类似的库函数。
首先，该函数会根据需要丢弃无用的开头空格字符，直到寻找到第一个非空格的字符为止。
当我们寻找到的第一个非空字符为正或者负号时，则将该符号与之后面尽可能多的连续数字组合起来，作为该整数的正负号；假如第一个非空字符是数字，则直接将其与之后连续的数字字符组合起来，形成整数。
该字符串除了有效的整数部分之后也可能会存在多余的字符，这些字符可以被忽略，它... | ALGO | 0.998069 | 4.243627 |
c86e1d3c-fd57-4bf7-aad8-1d0d195da1cc | CoderBOCHENG/C- | C++ projects/0117_new_delete_2.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int arrSize;
cout << "How big is your array? ";
cin >> arrSize;
// int i1[arrSize]; // This doesn't work! ILLEGAL!
int* pointToNums = new int[arrSize]; // pointer to a block of 10 integers
// dynamic memory allocation
for(int i... | TOOL | 0.875956 | 3.384683 |
02ba405d-e08e-417a-a030-a6c746dc0e7a | harshil-eth/Leetcode- | Find Nth root of M - GFG/find-nth-root-of-m.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
private:
long long int getValue(long long int mid, int n, int m) {
long long int ans=1;
for(int i=1;i<=n;i++) {
ans *= mid;
if(ans > m) return 2;... | ALGO | 0.999987 | 6.295096 |
3f1a9a32-4695-46f3-9d82-50780d9509e6 | trinhminhtriet/leetcode | solutions/1200-1299/1296.divide-array-in-sets-of-k-consecutive-numbers/Solution2.cpp | class Solution {
public:
bool isPossibleDivide(vector<int>& nums, int k) {
if (nums.size() % k) {
return false;
}
map<int, int> mp;
for (int& h : nums) {
mp[h] += 1;
}
while (!mp.empty()) {
int v = mp.begin()->first;
for... | ALGO | 0.99993 | 5.552139 |
2d633e17-ac83-4cc7-86e1-40e9f64b3d03 | saxenaakshit/DSA | dsa_course/binary_search-I/05_piviot_in_an_Array.cpp | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
void inp(int arr[],int size){
for(int i=0;i<size;i++){
cin>>arr[i];
}
}
void pivot(int arr[],int n){
int s=0;
int e=n-1;
int mid=s+((e-s)/2);
while(s<e){
if(arr[0]<=arr[mid]){
s=mid+1;
}
el... | ALGO | 0.999874 | 4.129335 |
278edc87-1a1c-4360-8952-b25c45d08c74 | PFiS1737/my-sdust-oj-archives | archives/2849_循环节.cpp | // Description
// 循环节是一个数学术语，指的是在一个无限循环小数中重复出现的一组数字。具体来说，循环节是指无限小数的小数点后从某一位起向右进行到某一位置的一节数字循环出现，首尾衔接，这种小数称为循环小数，这一节数字称为循环节。
// 可以证明：所有的无理数都是无限不循环小数，所有的有理数都是有限小数或无限循环小数。将有效小数后补充无限个0也可以视作无限循环小数。
// 有理数皆可写作两数相除（分数）。现在的任务是给出两整数相除（a/b），让你写程序求出其循环节。
// 注意，循环节输出必须用小数点后第一组重复的部分。例如，1/7的循环节是142857，而不能是428571、285714……。
//
// Input... | ALGO | 0.999977 | 4.942099 |
983caee2-eee1-45fa-b9f6-c1f2930b9eae | akshatverma13/CodingQuestions | Maximum Subarray.cpp | class Solution {
public:
int maxSubArray(vector<int>& nums) {
partial_sum(nums.begin(), nums.end(), nums.begin());
int minSum = 0, ans = INT_MIN;
for (int n : nums) {
ans = max(ans, n - minSum);
minSum = min(minSum, n);
}
return ans;
}
};
| ALGO | 0.999966 | 6.355276 |
bb044d44-40f0-406f-bad2-ce5bee5a028c | dhruwill/Codeforces | dhruvil_11/1003/A [Polycarp's Pockets].cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
IOS
int n;
cin>>n;
int a[n];
int c[101]={0};
int i;
for(i=0;i<n;i++)
{
cin>>a[i];
c[a[i]]++;
}
sort(c,c+101);
cout... | ALGO | 0.999768 | 3.406295 |
8ea2fedc-d860-43e0-b119-ae26382bd1bc | jyhsia5174/algo | leetcode/727_v2.cpp | class Solution {
public:
string minWindow(string S, string T) {
for(int i = 0; i < S.size(); i++){
if( S[i] == T[0] )
myque.push({i, i+1});
}
for(int i = 1; i < T.size(); i++){
queue<pair<int, int>> que_tmp;
int pre_e = -1;
... | ALGO | 0.99999 | 5.929636 |
f994598d-15be-443c-84a2-c121b46c733e | Aviral-Dwivedi-0/Leetcode | 2427-first-letter-to-appear-twice/first-letter-to-appear-twice.cpp | class Solution {
public:
char repeatedCharacter(string s) {
int hash[128]={0};
for(int i=0;i<s.size();i++){
hash[s[i]]++;
if(hash[s[i]]==2){
return s[i];
}
}
return 'a';
}
}; | ALGO | 0.999928 | 5.22042 |
67edb45f-8e4f-4d09-b2b9-c9d057a4b76a | AbhayPatil2004/DSA-Practical | Ass2.cpp | //Implement all the functions of a dictionary (ADT) using hashing and handle collisions
//using chaining with / without replacement.
//Data: Set of (key, value) pairs, Keys are mapped to values, Keys must be comparable,
//Keys must be unique. Standard Operations: Insert(key, value), Find(key), Delete(key)
#include <io... | ALGO | 0.998835 | 4.48546 |
6d84d572-0353-4e0e-ba34-9162d1222748 | maddotexe/Competitive-contest-programs | codeforces/459b.cpp | #include<bits/stdc++.h>
using namespace std;
#define TRACE
#ifdef TRACE
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) cerr << #x << ": " << x << " | " << #y <... | ALGO | 0.999201 | 3.564774 |
4b883710-4f68-495c-8152-813b901dc24e | liyamai/TEB1113_DSA_24006910 | LAB3/LAB3_Single.cpp | #include <iostream>
using namespace std;
struct Node {
string name; // Node value
Node* next_pointer; // Pointer to next node (The * for next_pointer)
Node* prev_pointer; // Pointer to previous node (for doubly linked list)
};
class LinkedList {
private:
Node* head = nullptr;
Node* tail = n... | ALGO | 0.998588 | 6.582537 |
7b05c285-80e3-4529-8ddb-07d4d2d1890d | EthanCornell/DSAlib | Algorithms/CPP/OS/bin_sema.cpp | #include <mutex>
#include <condition_variable>
#include "bin_sema.hpp"
class BinarySemaphore
{
public:
BinarySemaphore(int initial = 1) : count(initial) {}
void wait()
{
std::unique_lock<std::mutex> lock(mtx);
while (count == 0)
{
cv.wait(lock);
}
count =... | TOOL | 0.992425 | 6.224282 |
8799bdd8-9da8-48d5-addf-c50037e7b8b2 | MoogleAndChocobo/ACM-Learning | SolvedProblems/HDU/1009.cpp | #include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <sstream>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <cmath>
#include <cctype>
using namespace std;
typedef long long LL;
const int MAX = 1e4 + 10;
const int N = 2e4;
#define r... | ALGO | 0.999748 | 3.978539 |
43f4e8b7-658e-40af-82ce-03a708ed7eb8 | JinuSpace/Algorithm | 프로그래머스/unrated/181851. 전국 대회 선발 고사/전국 대회 선발 고사.cpp | #include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int solution(vector<int> rank, vector<bool> attendance) {
int answer = 0;
vector<pair<int, int>> students;
for (int i = 0; i < rank.size(); i++) {
if (attendance[i]) {
students.push_back({rank[... | ALGO | 0.999811 | 4.67919 |
2f6dbc21-8467-41d7-b80e-516c217884da | Blanks-Brain/Competitive-Programming | DP(adi)/Knapsack and its child/kanpsack(top bottom).cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int i,j,b,c,n,w;
int t[1003][1005];
cin>>n>>w;
int wt[n+5],val[n+5];
for(i=0; i<n; i++)
cin>>wt[i];
for(i=0; i<n; i++)
cin>>val[i];
for(i=0; i<=n; i++)
for(j=0; j<=w; j++)
{
if(i==0 ... | ALGO | 0.99999 | 3.820524 |
186cf62c-840e-42c2-b04b-32d5a59c4d4f | Dai0526/Algorithm | Algorithm/OnlineAssessment/LeetCode/Medium/33_SearchRotatedSortedArray.cpp | /*
No duplicated
简单binary search搞定
*/
#include <vector>
using namespace std;
class Solution {
public:
int search(vector<int>& nums, int target) {
int n = nums.size();
if(n < 1){
return -1;
}
int left = 0;
int right = n - 1;
while(lef... | ALGO | 0.999997 | 6.202623 |
b8c6b45b-283e-494e-a6e1-256ea893a4a9 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_9205_459.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a + b << endl;
return 0;
}
| ALGO | 0.998418 | 3.680648 |
58fb6ed4-a8d6-4b6b-8ad9-3579f1462a4a | KJ-Lumina/CSD380_GameAI | Source/Student/Project_1/Leaf/L_RegisterRightTurn.cpp | #include <pch.h>
#include "L_RegisterRightTurn.h"
#include "../GlobalInfo.h"
L_RegisterRightTurn::L_RegisterRightTurn()
{}
void L_RegisterRightTurn::on_enter()
{
BehaviorNode::on_leaf_enter();
}
void L_RegisterRightTurn::on_update(float dt)
{
auto& bb = agent->get_blackboard();
int junctionIndex = bb.get_value<in... | ALGO | 0.872023 | 4.340661 |
2b11b31c-b995-421a-8098-59ecce75c09d | gavinmagnus69/AUDIO-EQUALIZER | JUCE/modules/juce_box2d/box2d/Dynamics/Contacts/b2EdgeAndPolygonContact.cpp | #include "b2EdgeAndPolygonContact.h"
#include "../../Common/b2BlockAllocator.h"
#include "../b2Fixture.h"
#include <new>
using namespace std;
b2Contact* b2EdgeAndPolygonContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)
{
void* mem = allocator->Allocate(sizeof(b2Edge... | ALGO | 0.980074 | 6.862731 |
9c15fd6c-32c0-422c-8f65-462e7993363e | rs280/cses | missingnumber.cpp | #include <iostream>
using namespace std;
int main()
{
long long int n, s = 0, ele;
cin >> n;
for (int i = 0; i < n - 1; i++)
{
cin >> ele;
s += ele;
}
cout << n * (n + 1) / 2 - s << endl;
return 0;
} | ALGO | 0.999703 | 3.317946 |
bd69648f-cece-40cc-bb8b-9aef6b389ca2 | ishandutta2007/codeforces | batman/normal/429/B.cpp | ///////////////////////////////\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
Sa1378 Platform Vesion <IP_ADDRESS>
/////////////////////////////////\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
// Don't push me
// Cause I'm close to the edge
// I'm trying not to lose my head
#include <bits/stdc++.h>
using namespace std;
... | ALGO | 0.999934 | 3.297453 |
50187dc1-fd94-4231-a744-2a3f5918cbd1 | NiveditaBhagat/ArtSense_flutter | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.