uuid stringlengths 36 36 | repo_name stringlengths 5 123 | relative_path stringlengths 5 4k | content stringlengths 33 2.85M | category stringclasses 6
values | algo_rel_score float64 0.85 1 | quality_score float64 3 8.76 |
|---|---|---|---|---|---|---|
08942c3c-98a2-4ad0-a998-9eba01f6c8ea | kevinMkY/CPP_ALGO | testC++++/23_合并K个升序链表.cpp | //
// 23_合并K个升序链表.cpp
// testC++++
//
// Created by yekaihua on 2021/2/18.
//
#include "23_合并K个升序链表.hpp"
#include "common.h"
//迭代
ListNode* mergeKLists(vector<ListNode*>& lists) {
if (lists.size() == 0) {
return nullptr;
}
ListNode *newhead = new ListNode(INT_MIN);
ListNode *pre = newhead;
... | ALGO | 0.999892 | 5.694385 |
6388853b-cc69-4608-af17-7d3c48a997e6 | iwiwi/programming-contests | icpc/fukuoka2011/J.cpp | #include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <map>
#include <climits>
#include <cstring>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
cons... | ALGO | 0.999915 | 3.828397 |
a1edc94f-7639-4b9e-863a-b12e505e0102 | Mohammad-Imran01/Data-structures-and-Algorithms | DSA Udemy/09. stack/01basics.cpp | #include <iostream>
using namespace std;
class stack{
private:
int size;
int last;
int* s;
public:
stack(int capacity, int topp = -1) {
size = capacity;
last = topp;
s = new int[capacity];
for(int i = 0; i < size; i++) s[i] = 0;
}
// pushes given element... | ALGO | 0.975806 | 4.428916 |
4b70996a-e078-4054-a91f-8e4ff9735799 | littledou2013/PAT | pat_1047.cpp | #include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
struct Student
{
char name[5];
int number;
vector<int> course;
bool operator < (const Student &stu) const
{
if (strcmp(name, stu.name) <= 0)
return true;
else
return false;
}
};
Student ... | ALGO | 0.999831 | 3.408926 |
ac2dbaa3-01c5-44d7-80c3-97b185ee3255 | noetipo/proyectoC- | ejercicios/doctorado/matriz_funcion_ejemplo.cpp | #include <iostream>
using namespace std;
// Función para inicializar la matriz con valores
void inicializarMatriz(int matriz[][4], int filas, int columnas) {
int valor = 1;
for (int i = 0; i < filas; ++i) {
for (int j = 0; j < columnas; ++j) {
matriz[i][j] = valor++;
}
}
}
// F... | ALGO | 0.99454 | 4.663147 |
b0cd4ae5-4746-44d1-8a9a-6deb5250d128 | The-No-Hands-company/RudeBase3D | third_party/libigl/libigl-2.5.0/include/igl/edge_collapse_is_valid.cpp | IGL_INLINE bool igl::edge_collapse_is_valid(
const int e,
const Eigen::MatrixXi & F,
const Eigen::MatrixXi & E,
const Eigen::VectorXi & EMAP,
const Eigen::MatrixXi & EF,
const Eigen::MatrixXi & EI)
{
using namespace Eigen;
using namespace std;
// For consistency with collapse_edge.cpp, let's determine... | ALGO | 0.996969 | 6.320778 |
239dde05-b6b9-40cb-87dd-39f7eae14531 | yasith/Problems | codeforces/round40/a.cpp | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
int main (int argc, char const* argv[]){
string s1, s2;
cin >> s1 >> s2;
if(s1.size() != s2.size()){
cout << "NO" << endl;
return 0;
}
for(int i = 0; i < s1.size(); i++){
if... | ALGO | 0.999984 | 4.188857 |
90ac86d5-8f41-4557-bc9b-9fc58013676f | jiwo-lee/data_structure | 202023202 이지우 - 코로나 DLL.cpp | #include <iostream>
using namespace std;
class corona_nation
{
public:
corona_nation(string name = "empty", int num_of_confirmed_p = 0, int num_of_death_p = 0);
void print_info();
string m_name;
int m_num_of_confirmed_p;
int m_num_of_death_p;
double m_death_rate;
};
template<class T>
class D... | ALGO | 0.953529 | 5.007966 |
5b799816-6db2-468a-a3c5-2d8ecb0c4f2a | rory-humphries/EpiGraph-cpp | simulations/CountryLockDown.cpp | #include <EpiGraph/Core/IO.hpp>
#include <EpiGraph/EigenUtil/IO.hpp>
#include <EpiGraph/EpiGraph.hpp>
#include <EpiGraph/Models/SIXRDNetMetaPop.hpp>
#include <EpiGraph/Random/Distributions.hpp>
#include <EpiGraph/Random/RandomMatrix.hpp>
#include <EpiGraph/Spatial/SpatialUtil.hpp>
#include <Eigen/Sparse>
#include <to... | DATA | 0.994126 | 5.41186 |
7de013b4-7e1f-46d1-8069-db152530f607 | daviddoria/VTKHoughPlanes | 3rdparty/newmat/fft.cpp | //$$ fft.cpp Fast fourier transform
#define WANT_MATH
// #define WANT_STREAM
#include "include.h"
#include "newmatap.h"
// #include "newmatio.h"
#ifdef use_namespace
namespace NEWMAT {
#endif
#ifdef DO_REPORT
#define REPORT { static ExeCounter ExeCount(__LINE__,19); ++ExeCount; }
#else
#de... | ALGO | 0.999554 | 5.982628 |
1b8bd172-f71e-4994-a69d-5b9738909106 | Tayyab-Ahmad-44/LeetCode | 01 December 2023/Day-19_Image_Smoother_e.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution
{
public:
vector<vector<int>> imageSmoother(vector<vector<int>> &img)
{
// Save the dimensions of the image.
int m = img.size();
int n = img[0].size();
// Create a new image of the same dimension as the ... | ALGO | 0.999548 | 6.488368 |
393effe7-2217-48a7-8a22-038fed3fd19e | SeSACAlgorithm/AlgorithmStudy | 백준/그래프 탐색/6593) 상범 빌딩/태호.cpp | #include <iostream>
#include <queue>
#include <vector>
#include <string>
using namespace std;
int n, m, l;
int dx[6] = { -1, 1, 0, 0, 0, 0 };
int dy[6] = { 0, 0, -1, 1, 0, 0 };
int dz[6] = { 0, 0, 0, 0, -1, 1 };
string board[32][32];
int dist[32][32][32];
struct coord { int x, y, z; };
queue<coord> que;
void Sett... | ALGO | 0.999939 | 4.128192 |
72100688-effb-428a-9cf3-189174cf3234 | langningchen/Etiger | 0021.cpp | #include <bits/stdc++.h>
using namespace std;
int n;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
if (i % 3 == 0 && i % 5 == 0)
cout << "FizzBuzz ";
else if (i % 3 == 0)
cout << "Fizz ";
else if (i % 5 == 0)
cout << "Buzz ";
else
... | ALGO | 0.999874 | 4.799947 |
af97bbbb-5ca6-4726-93f2-e34065d0422b | VamshiJanagani/DSA-Progress | Beginner Problems/Basic Maths/Count of Prime numbers till N.cpp | //Input: n = 6
//Output: 3
//Explanation: Prime numbers in the range [1, 6] are 2, 3, 5.
#include<bits/stdc++.h>
using namespace std;
class Solution{
private:
bool isPrime(int n){
if(n==0 || n==1){
return false;
}
else{
for(int i=2;i<n;i++){
if(n%i==0){
... | ALGO | 0.999945 | 5.771627 |
0a56773c-6310-4939-91a1-bcf592e6509a | JScoder-git/DSA-ALL- | labmsst.cpp | #include <bits/stdc++.h>
#define ll long long
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
using namespace std;
class Node {
public:
int data;
Node* next;
//constrcutor
Node(int d) {
this->data = d;
this->next = NULL;
}
~Node() {
int va... | ALGO | 0.999882 | 4.690631 |
c2060d6a-8df4-4f23-8023-2db2d2bb0c64 | CodderPrince/1-1_Practice | STRUCTURED PROGRAMMING LANGUAGE 1-1/SEMESTER 2 SOLVE/STRUCTURE AND UNIONS/PRACTICE/10-9.cpp | /*
***old 10.9 new 11.9*** *PRINCE*
Write a class template to represent a generic vector.
Include member functions to
perform the following tasks:
(a) To create the vector
(b) To modify the value of a given element
(c) To multiply by a scalar value
(d) To display the vector in the following form (10, 20, 30 …)
*/
#inc... | TOOL | 0.990129 | 3.604521 |
03184f99-fe7f-4dac-a36f-e7d8fe829f8f | Sheron4ik/algorithm_lab_2 | third.cpp | #include "algheader.h"
#include <set>
struct Node {
int modifier = 0;
int from = 0, to = 0;
Node* left = nullptr; Node* right = nullptr;
};
struct Event {
int start, end, operation;
};
struct comparator {
bool operator()(const std::pair<int, Event> &a, const std::pair<int, Event> &b) const {
... | ALGO | 0.999762 | 4.620013 |
62d6eff8-ccb0-43b3-82d5-2687905fbabb | ibsson/Program | BKJN/브루트포스 알고리즘/20240131_bkjn_11170(0의 개수).cpp | #Sol_2
#include <stdio.h>
int check_0(int n, int m) {
int cnt = 0;
for (int i = n; i <= m; i++) {
if (i == 0) cnt++;
int i2 = i;
while (i2 > 0) {
if (i2 % 10 == 0)cnt++;
i2 /= 10;
}
}
return cnt;
}
int main() {
int T, N, M;
scanf("%d", &T);
for (int i = 0; i < T; i++) {
scanf("%d %d", &N,... | ALGO | 0.999754 | 5.14201 |
d38e58ee-7e1a-45ca-bbf5-d466ef9f483d | Just-CAF/platform_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 |
a05776de-5d6d-40a6-a312-a71d5e15bd11 | PhanVanHieu-Ptit/Bai_tapC | may_tinh.cpp | #include<iostream>
#include<conio.h>
#include<math.h>
#define e 2.718
using namespace std;
int maytinh(char s,float a,float b);
int main(){
float a,b;
char s;
cout <<"Chon phep tinh can tinh: "; cin>> s;
if(s=='^'){
cout <<" Nhap co so a = "; cin>>a;
do{
cout <<" Nhap so mu x = "; cin>>b;
... | ALGO | 0.977288 | 3.155395 |
54fe8bc0-757c-410d-a062-b79ea5db4c03 | ishandutta2007/codeforces | melnik/normal/591/D.cpp | #include <iostream>
#include <fstream>
#include <stdio.h>
#include <list>
#include <stack>
#include <deque>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <ext\hash_set>
#include <bitset>
#include <vector>
#include <cmath>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <m... | ALGO | 0.999452 | 3.342252 |
345c7f6d-02d7-4bf3-b0c5-ed3c17792923 | keskitty/mymlidmlabs | MLIDM_lab3/MLIDM_lab3/labfree.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#define endl "\n"
#define PAIR 2
using namespace std;
void InputSet(vector<char>& set, int size)
{
for (int i = 0; i < size; i++)
{
cout << " " << i + 1 << " : ";
char ch = 0;
cin >> ch;
if(('0' <= ch && ch <= '9') || ('a' <= ch && ch <= 'z') || ('... | ALGO | 0.998353 | 3.938456 |
8bca6f13-d5ac-421c-a227-b128a1fffdc9 | jatin0670/Cpp | string/roman_to_integer.cpp | #include<iostream>
using namespace std;
int rti(char c){
if(c=='I'){
return 1;
}
else if(c=='V'){
return 5;
}
else if(c=='X'){
return 10;
}
else if(c=='L'){
return 50;
}
else if(c=='C'){
return 100;
}
else if(c=='O'){
return 500;
}
else{
return 1000;
}
}
int main()... | ALGO | 0.999661 | 4.057883 |
251e2ef8-7aa1-432b-97f9-ae5a12f43fdb | HanYouyang/Computer | 数据结构与算法/PKU-CS/Leetcode/LeetCode-master 3/C++/longest-word-in-dictionary-through-deleting.cpp | // Time: O(dlogd)
// Space: O(1)
class Solution {
public:
string findLongestWord(string s, vector<string>& d) {
sort(d.begin(), d.end(),
[](const string& a, const string&b) {
return a.length() != b.length() ? a.length() > b.length() : a < b;
});
for (con... | ALGO | 0.99995 | 6.162426 |
8937ccd2-2a90-4799-8bab-7896bc125a9c | tanvi2100/LeetCode-Solutions | 204.cpp | class Solution {
public:
int prime( int n){
for( int i=2;i*i<=n;i++){
if(n%i == 0){
return 0;
}
}
return 1;
}
int countPrimes(int n) {
int c=0;
for(int i=2;i<n;i++){
if(prime(i)){
c++;
}
... | ALGO | 0.999915 | 5.598963 |
7ca1189b-2d35-4f52-b041-fce58efdde56 | ishandutta2007/codeforces | origenes/normal/1228/E.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int (i) = (a); (i) <= (b); (i)++)
#define ROF(i, a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define sqr(x) ((x) * (x))
#define all(x) (x).begin(), (x).end()
#de... | ALGO | 0.999899 | 4.094384 |
86ae0c4a-d438-43f9-8f14-6bfd2530868f | Dor-Ben-Meir/Mainframe_Corrneto | g232F_ert_rtw/ert_main.cpp | // Function prototype declaration
void exitFcn(int sig);
void *terminateTask(void *arg);
void *baseRateTask(void *arg);
void *subrateTask(void *arg);
volatile boolean_T stopRequested = false;
volatile boolean_T runModel = true;
sem_t stopSem;
sem_t baserateTaskSem;
pthread_t schedulerThread;
pthread_t baseRateThread;
v... | TOOL | 0.863359 | 5.657831 |
c5e9ba2e-d7fe-4a5e-9b08-c5d363f47768 | Project-Flare-Staging/frameworks_av | media/module/codecs/m4v_h263/dec/src/get_pred_adv_b_add.cpp | /*
------------------------------------------------------------------------------
INPUT AND OUTPUT DEFINITIONS
Inputs:
xpos = x half-pixel of (x,y) coordinates within a VOP; motion
compensated coordinates; native type
ypos = y half-pixel of (x,y) coordinates within a VOP; motion
compens... | ALGO | 0.999887 | 6.023312 |
00d53b82-2c09-4771-b892-e0c456e4deab | anmolgera/Codeforces_Solutions | CodeForces/GNU C++17/1398C | Good Subarrays/95374010.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
//vector<int> adj[200005];
//vector<int> vis(200005,0);
//vector<int> deg(200005,0);
void anmol()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdo... | ALGO | 0.999856 | 4.005518 |
bc728ea9-a389-4d41-8ab6-4ea182b44fac | ishandutta2007/codeforces | denisson/normal/282/C.cpp | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:256000000")
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <s... | ALGO | 0.99995 | 3.289622 |
f9b8bb9c-3078-4ece-9e42-96d8f5864aa7 | suveshpandey/DSA-Cpp | 33_OOPs/3_classBook.cpp | #include<iostream>
using namespace std;
class Book{
public:
string name;
int price;
int noOfPages;
int countBooks(int p){
if(p>price)
return 1;
else return 0;
}
bool isBookPresent(string title){
if(title == name)
return true;
else
... | TOOL | 0.957107 | 3.945736 |
7fb8d06a-edfd-4ed4-88dd-f691008d0008 | LeonXJ/leonleetcode | RemoveElement.cpp | int removeElement(int A[], int n, int elem) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(!A || n==0){
return 0;
}
int iNextWrite = 0;
int iRead = 0;
for(iRead = 0; iRead<n; ++iRead){
if(A[iRead... | ALGO | 0.99981 | 5.327474 |
39cad8c4-db83-4ebc-b3a9-86bbf2c88302 | Alraaafi/CPP-Beginner-Problem-Solutions-Cprogramming-Beecrowdlem-Solutions-Cprogramming-Beecrowd | 1065 Even Between five Numbers.cpp | #include<iostream>
#include<iomanip>
#include<math.h>
using namespace std;
int main(){
double a, b, c, t;
cin>>a>>b>>c;
if(((b * b) - 4 * a * c) < 0 || a == 0)
{
printf("Impossivel calcular\n");
}
else
{
t = sqrt((b * b) - 4 * a * c);
printf("R1 = %.5lf\nR2 = %.5lf... | ALGO | 0.999908 | 4.309889 |
3f301685-0786-46a8-8c79-f1f58d9fd788 | JeonJe/Algorithm | 4.programmers/고득점 kit_DFS_BFS/프로그래머스_타겟넘버.cpp | //https://programmers.co.kr/learn/courses/30/lessons/43165
#include <string>
#include <vector>
#include <queue>
using namespace std;
int cnt;
void dfs(vector<int> numbers, int target, int sum, int depth) {
if (depth >= numbers.size()) { // 숫자를 한 개씩 더하다가 배열의 크기만큼 커지면
if (sum == target) // 배열의 합이 타겟과 같다면 cnt 증가
... | ALGO | 0.999933 | 5.533489 |
5c9a4b3a-755c-43c2-bb86-0e2019806d0e | codetatvaacademy/GU-Technical-Training-2026 | isha/assignment1/Q31.cpp | #include <iostream>
using namespace std;
int sumOfDivisors(int n) {
int sum = 0;
for (int i = 1; i <= n; i++)
if (n % i == 0) sum += i;
return sum;
}
int main() {
int n;
cin >> n;
cout << "Sum of Divisors: " << sumOfDivisors(n);
return 0;
}
| ALGO | 0.999506 | 5.902527 |
89fdf902-2d14-46a9-8835-ed0511100821 | ishandutta2007/codeforces | posij118/normal/1019/B.cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> a;
int n;
pair<int, int> solve(pair<int, int> lr){
int l, r;
l = lr.first;
r = lr.second;
if(r - l == 1 || r - l == -n+1) return lr;
cout << "? " << (l+r)/2 + 1 << endl;
fflush(stdout);
cin >> a[(l+r)/2];
cout << "? " << (((l+r... | ALGO | 0.99998 | 3.298393 |
1cbd384d-6d36-4370-8c1f-9e0d831f2396 | wenqiangwangsustech/FP16-LSRK | Efficiency/src/src_willimson/freeSurface.cpp | /*================================================================
* ESS, Southern University of Science and Technology
*
* File Name:propagate.cpp
* Author: Wenqiang Wang, <EMAIL>
* Created Time:2021-11-03
* Discription:
*
================================================================*/
#include "heade... | ALGO | 0.999133 | 3.93419 |
9ef65183-0ebc-458a-9b2f-fa9fe1ca1394 | tridibsamanta/Codeforces_Solutions | 450B.cpp | /*
~ Author : @tridib_2003
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define PI 3.1415926535897932384626
#define MOD 1000000007
#define vi vector<int>
#define vvi ... | ALGO | 0.999958 | 4.321989 |
2e556277-5e7e-4232-bcf0-f5f4a316ad7a | 8t-truck/baek_joon | 17626_four_squares.cpp | #include<iostream>
#include<vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> dp(n+1,50000);//ּڰ ʱȭ ϴ ū ʱȭ!
for (int i = 0; i * i <= n; i++) {
dp[i * i] = 1;
}
for (int c = 1; c <= n; c++) {
if (dp[c] == 1)
continue;
for (int i = 0; i * i < c; i++) {
dp[c] = min(dp[c], dp[i ... | ALGO | 0.999936 | 3.846661 |
eaff7a93-346a-47f0-a862-f4491349b3f8 | CGAL/cgal | Shape_detection/examples/Shape_detection/region_growing_lines_on_segment_set.cpp | #include <CGAL/IO/PLY.h>
#include <CGAL/Surface_mesh.h>
#include <CGAL/Shape_detection/Region_growing/Region_growing.h>
#include <CGAL/Shape_detection/Region_growing/Segment_set.h>
#include <CGAL/Shape_detection/Region_growing/Polygon_mesh.h>
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGA... | ALGO | 0.985689 | 5.207672 |
e658f9b9-d614-459b-b54a-a29536c14434 | xrisk/2018 | Codeforces/equator.cpp | #include <iostream>
#include <vector>
int main() {
#ifdef __APPLE__
freopen("input.txt", "r", stdin);
#endif
int N;
std::cin >> N;
std::vector<int> vec(N);
long long sum = 0;
for (int i = 0; i < N; i++) {
std::cin >> vec[i];
sum += vec[i];
}
long long half = 0;
for (int i = 0; i < N; i++) {
... | ALGO | 0.999617 | 4.152437 |
9effbb20-7a72-4528-9ae1-f0ae778bff0e | Lowkik-Sai/LeetCode-Hub | Strings/564. Find the Closest Palindrome.cpp | /*
Time complexity: O(n)
Space complexity: O(n)
*/
class Solution {
public:
bool checkPalin(string s){
int i = 0, j = s.size()-1;
while(i < j){
if(s[i] != s[j]) return false;
i += 1;
j -= 1;
}
return true;
}
string nearestP... | ALGO | 0.999994 | 6.507404 |
6d506535-509e-4194-878d-093f86ea1f9d | Kushagra910/AtoZ_DSA_sheet | Arrays/maximumSubarraySum.cpp | // codeStudio
// TC - O(N^3);
// SC - O(1);
#include <bits/stdc++.h>
long long maxSubarraySum(int arr[], int n)
{
long long maxi = LONG_MIN;
for(int i =0;i<n;i++){
for(int j=i;j<n;j++){
long long sum = 0;
for(int k=i;k<=j;k++){
sum += arr[k];
m... | ALGO | 0.999888 | 5.873895 |
ff1f0c46-97ae-4858-b4bb-b32b75b2804b | shimaahamdy/competitive-programming | C. Divisibility by Eight/main.cpp | #include <iostream>
using namespace std;
string number;
int sum;
int main()
{
cin>>number;
int siz=number.size();
for(int i=0;i<siz;++i)
{
int num1=0;
sum+=(number[i]-'0')*100;
num1=number[i]-'0';
if(num1%8==0)
{
cout<<"YES\n"<<num1;
... | ALGO | 0.999548 | 3.827004 |
8a73078d-ba31-4c0e-95c4-3a1b5894b4a2 | dhuamanilu/programacion | 1433/RPC_c.cpp | #include <iostream>
#include <iomanip>
#include <string>
using namespace std;
int main()
{
double n, k;
double d, s;
cin >> n >> k;
cin >> d >> s;
double res = ((d*n)-(k*s))/(n-k);
string variables = to_string((int)(res));
cout << setprecision(variables.size()+7);
if(res > 100 || ... | ALGO | 0.995469 | 3.510271 |
10dcce5d-f53c-47b8-8ee3-6b0bef6fa64c | ishandutta2007/codeforces | shun_pi/normal/1511/B.cpp | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#d... | ALGO | 0.999904 | 3.948185 |
eb8736f2-1827-4a52-8bf3-e8a4a469c5bb | vrnanshuman/Leetcode | 79-word-search/79-word-search.cpp | class Solution {
vector<vector<char>> b;
vector<vector<bool>> visited;
string w;
int m,n;
public:
bool dfs(int row, int col, int currentIdx) {
if(currentIdx == w.size())
return true;
if(row<0 || row>=m || col<0 || col>=n)
return false;
... | ALGO | 0.999817 | 6.078438 |
740c1e36-8fe9-45b8-ae09-509a8f98c119 | CiQiong/PAT | A1028.cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100010;
struct Student{
int id;
char name[10];
int score;
}stu[maxn];
bool cmp1(Student a,Student b){
return a.id<b.id;
}
bool cmp2(Student a,Student b){
int s=strcmp(a.name,b.name);
if(s!=0)return s<0;
else return a.id<b... | ALGO | 0.999711 | 3.566252 |
4a970736-df89-4069-85e9-81eb786b0b67 | goldentrash/matrix-multiplication | sample/fft.cpp | #define _USE_MATH_DEFINES
#include <cmath>
#include <complex>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
typedef complex<double> dcomplex;
typedef long long ll;
string multiply(const string& a, const string& b);
vector<ll> convolution(vector<dcomplex>& a, vector<dcomplex>& b);
voi... | ALGO | 0.99994 | 4.390903 |
1479389d-7719-4de4-a22b-93ff4d582365 | sischei/global_solution_methods_Rochester | Lecture_1/SparseGridCode/pyipopt/Ipopt-3.12.5/Ipopt/src/Algorithm/LinearSolvers/IpSlackBasedTSymScalingMethod.cpp | #include "IpoptConfig.h"
#include "IpSlackBasedTSymScalingMethod.hpp"
#include "IpTripletHelper.hpp"
namespace Ipopt
{
#if COIN_IPOPT_VERBOSITY > 0
static const Index dbg_verbosity = 0;
#endif
bool SlackBasedTSymScalingMethod::InitializeImpl(const OptionsList& options,
const std::string& prefix)
{
ret... | TOOL | 0.956913 | 7.379136 |
b7cf9d75-20a8-4c06-afa9-f308f56f1429 | YangtzeMa/root_canal | root_canal/NMS.cpp | #include <opencv2/opencv.hpp>
#include <vector>
#include <iostream>
#include <algorithm>
#include <numeric>
using namespace cv;
using namespace std;
// ǼֵƣNMS
vector<Rect> performNMS(const vector<Rect>& rects, vector<float> prediction, float overlapThresh) {
// 洢ľο
vector<Rect> result;
// Ϊգֱӷؿս
if (... | ALGO | 0.997983 | 6.946889 |
57bc865e-b46b-4218-9b7a-92b150d9a156 | ishandutta2007/codeforces | fdg/normal/573/A.cpp | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <memory.h>
using namespace std;
vector<int> v;
int main() {
int n;
scanf("%d", &n);
while (n--) {
int x;
scanf("%d", &x);
while (x % 2 == 0) x /= 2;
while (x % 3 ... | ALGO | 0.999944 | 4.093651 |
5f9d8545-f5b0-4e4f-bb45-072217d3c5cf | Li-Crazy/-Image-Processing- | Image/06/1d_dft.cpp | #include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <time.h>
#define M 256
#define Maxgray 255
double Pi;
struct Complex
{
double real;
double img;
};
void setimage(int data[M])
{
srand((int)time(0));
for(int i=0;i<M;i++)
data[i]=rand()%Maxgray;
}
void fft(int data[M],Complex dst[M],int imageff... | ALGO | 0.980219 | 3.35499 |
0376755d-92a4-45c4-b3f6-0119b62318be | Prince-Mendiratta/CPP-LeetCode | Linked-List/Linked-List.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
class ListNode {
public:
int val;
ListNode *next;
ListNode();
ListNode(int x);
ListNode(int x, ListNode *next);
};
ListNode::ListNode(){
val = 0;
next = NULL;
};
ListNode::ListNode(int x){
val = ... | TOOL | 0.926822 | 3.185379 |
bf5a56df-08c3-465f-98d0-3aa79d3da539 | zgpeace/LeetCodeJustDoIt | src/0097-Interleaving-String/0097.cpp | #include <deque>
#include <string>
using namespace std;
static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
class Solution
{
public:
bool isInterleave(string s1, string s2, string s3)
{
if (s1.size() + s2.size() != s3.size()) return false;
deque<deque<bool>> mem(... | ALGO | 0.999871 | 5.384519 |
d9cfd639-4d06-44c8-8719-425729d96094 | loveneeshdhir/ACM-ICPC-Algorithms | DP/Longest Repeated Subsequence/LonRep.cpp |
// C++ program to find the longest repeated
// subsequence
#include <bits/stdc++.h>
using namespace std;
// This function mainly returns LCS(str, str)
// with a condition that same characters at
// same index are not considered.
string longestRepeatedSubSeq(string str)
{
// THIS PART OF CODE IS SAME AS... | ALGO | 0.999938 | 5.765358 |
b54b3c5e-773e-45aa-9407-675156da7f25 | praditus343/Struktur_Data | Pertemuan5/talihan 2 (5)-1.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
class Antrian
{
private:
public:
vector<string> data;
int depan, belakang;
int maksElemen;
// Konstruktor
Antrian(int ukuran)
{
depan = 0;
belakang = 0;
maksElemen = ukuran;
data.resize... | ALGO | 0.995648 | 5.719959 |
b62df41f-63db-4e04-8659-2be4ff6f80e8 | divanshu31/Leetcode | 2634-minimum-common-value/minimum-common-value.cpp | class Solution {
public:
int getCommon(vector<int>& nums1, vector<int>& nums2) {
int common = INT_MAX;
int i = 0, j = 0;
while (i < nums1.size() && j < nums2.size()) {
if (nums1[i] == nums2[j]) {
common = nums1[i];
break;
} else if (nu... | ALGO | 0.999962 | 5.634163 |
c245b343-94b4-42a6-87fc-bffdc0235ba8 | ttocs8/CS | lab3/factorial.cpp | // Program: factorial.cpp
// Description: Test and develop the factorial function - main() has test
// code to check and see if the factorial() function works properly.
#include <iostream>
using namespace std;
// double factorial(int N) - returns the factorial variable N
// Please add the code necessary to calculate ... | ALGO | 0.944266 | 5.98907 |
82afc49e-2d37-4630-bb78-7096cedac7ee | parasguglani1/competitive_coding | icpc/2023_Prelims/Precious_Item_Auction.cpp | #include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#define ff first
#define ss second
#define int long long
using ll = long long;
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define PI 3.1415926535897932384626
#define ps(x,... | ALGO | 0.999956 | 4.22981 |
420878c6-e253-4737-a45f-bd8fdeaaaedc | helenjw/CSC317 | lab4/libigl/include/igl/bone_parents.cpp | template <typename DerivedBE, typename DerivedP>
IGL_INLINE void igl::bone_parents(
const Eigen::MatrixBase<DerivedBE>& BE,
Eigen::PlainObjectBase<DerivedP>& P)
{
P.resize(BE.rows(),1);
// Stupid O(n²) version
for(int e = 0;e<BE.rows();e++)
{
P(e) = -1;
for(int f = 0;f<BE.rows();f++)
{
if(... | TOOL | 0.905401 | 3.479885 |
8bc0e0f7-cc21-40db-933f-cbcb740c720c | changicho/prepare-algorithm-contest | week01~50/week39/changicho/2583. Kth Largest Sum in a Binary Tree/answer.cpp | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
Tr... | ALGO | 0.999963 | 5.781795 |
274dfba0-be96-4db6-acc4-f9f343bf5caf | DaraSingh2020/cppCodes | linkedNode.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
class Node{
public:
int Value;
Node* NodePTR;
Node(){
}
Node(int value){
Value=value;
}
Node(int value, Node* nodePTR){
Value=value;
NodePTR=nodePTR;
}
};
Node* addTwoLinedNodes(Node* N1,Node* N2){
Node* node=new Node(N1->Value+N2->Value);
return nod... | ALGO | 0.997793 | 4.284952 |
6a86a4cc-e6db-43cb-a494-1a12a4205b32 | thegamer1907/Code_Analysis | DP/479.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define IF(x, y, a, b) (x % y == 0 ? a : b)
int main(){
int boys[102];
int girls[102];
fill(boys, boys+102, 0);
fill(girls, girls+102, 0);
int n; cin >> n;
while(n--){
int x; cin >> x;
boys[x]++;
}
int m; cin >> m;
while... | ALGO | 0.999945 | 3.121557 |
ea31b4c5-cdaa-4673-a656-b92eabf25de3 | AtalaOba/BrainCoin | src/Wallet/WalletGreen.cpp | #include "WalletGreen.h"
#include <algorithm>
#include <ctime>
#include <cassert>
#include <numeric>
#include <random>
#include <set>
#include <tuple>
#include <utility>
#include <System/EventLock.h>
#include <System/RemoteContext.h>
#include "ITransaction.h"
#include "Common/ScopeExit.h"
#include "Common/ShuffleGe... | TOOL | 0.938675 | 4.570509 |
82762554-adcb-45c4-96c2-102453965b1e | falcaoanderson/CompetitiveProgramming | OBI/obi-2014-decifra.cpp | // 30/05/20 // 6:00 PM //
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main(){
string alfa, frase;
cin >> alfa >> frase;
for(char c : frase){
cout << alfa[c-'a'];
}
cout << endl;
return 0;
}
| ALGO | 0.998971 | 4.059086 |
fffd8c59-c1ba-4930-9b65-01f7939e2260 | randomwalk10/my_leetcode_solutions | 150_Evaluate_Reverse_Polish_Notation.cpp | /* O(N) in time and O(N) in space */
#include <vector>
#include <string>
#include <stack>
using namespace std;
class Solution {
public:
int evalRPN(vector<string>& tokens) {
stack<int> s;
for(int i=0; i<(int)tokens.size(); ++i){
if(tokens[i][0]=='+'){
int rhs = s.top();... | ALGO | 0.999895 | 6.239799 |
c636fcdd-ca11-4fc3-8543-65c4f337d2e7 | shubhamChaurasia55/DSA | 2780-minimum-index-of-a-valid-split/2780-minimum-index-of-a-valid-split.cpp | class Solution {
public:
int minimumIndex(vector<int>& nums) {
// Boyer-Moore Voting Algorithm
int count = 0, m_ele = 0;
for(int num : nums){
if(count == 0) m_ele = num;
if(num == m_ele) count++;
else count--;
}
count = 0;
for(int n... | ALGO | 0.999994 | 5.838197 |
2b2c2004-4d49-4b0c-b4a1-77cb69ffb392 | vriddhi1203/Codechef_and_codeforces_contests_solutions | codeforces- cards for friends.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int w,h,n;
int count=1;
cin>>w>>h>>n;
if(w%2!=0 && h%2!=0 && n==1){
cout<<"YES"<<endl;
continue;
}
if(w%2==0){
while(w%2==0){
w=w/2;
count=count*2;
}
}
if(h%2==0){
whil... | ALGO | 0.999855 | 3.89963 |
589bd609-47ac-4dd5-8627-2e816ab941b8 | trunghai95/MyCPCodes | Codeforces/596A.cpp | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef pair<int, int> pii;
pii p[4];
int n;
int main()
{
cin >> n;
for (int i = 0; i < n; ++i)
cin >> p[i].F >> p[i].S;
if (n < 2)
cout << -1;
else if (n == 2)
{
if (p[0].F == p[1].F || p[0]... | ALGO | 0.99981 | 3.681188 |
cc31cf3e-81ee-4d90-b31b-b380e8100d7e | muskan300600/DSA | Strings/8.only_alphabets.cpp | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(){
string S = "AA1d23cBB4";
for(int i=0;i<S.length();i++){
if((S[i]>='a' & S[i]<='z') || (S[i]>='A' & S[i]<='Z')){
continue;
}
else{
cout<<S[i];
}
}
} | ALGO | 0.999172 | 3.579497 |
475e1e5f-ceda-4528-93a7-c684f57c1e1d | whysodrooled/BOJ | cpp/2711.cpp | #include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
using std::cin;
using std::cout;
int main()
{
cin.tie(NULL);
cout.tie(NULL);
std::ios_base::sync_with_stdio(false);
int loop;
cin >> lo... | ALGO | 0.997715 | 4.382807 |
edbca6ba-5fa4-43d3-aa10-e3f5299dc613 | hajimeIppo-cmd/cp-codes | Baekjoon OJ/16000-16999/16199.cpp | #include <iostream>
using namespace std;
int main() {
int y, m, d;
int fy, fm, fd;
scanf("%d %d %d", &y, &m, &d);
scanf("%d %d %d", &fy, &fm, &fd);
int ans1 = fy - y;
if (fm == m && fd < d) ans1--;
else if (fm < m) ans1--;
int ans2 = fy - y + 1;
int ans3 = ans2 - 1;
printf("%d\n%d\n%d", ans1, ans2, ans3... | ALGO | 0.999673 | 3.766857 |
d620d4de-1f5d-464b-a85e-4f07f68d1536 | ShinSeungChul/BOJ | 1934/1934/소스.cpp | #include<iostream>
#include<vector>
#include<string.h>
#include<cstdio>
using namespace std;
int gcd(int n1, int n2) {
int temp;
if (n2 > n1) {
temp = n2;
n2 = n1;
n1 = temp;
}
while (n2 != 0) {
temp = n1%n2;
n1 = n2;
n2 = temp;
}
return n1;
}
int lcm(int n1, int n2) {
return n1*n2 / gcd(n1, n2);
... | ALGO | 0.999969 | 5.399139 |
40820a82-4b0f-46df-8a47-c94d41e5be89 | linneszyx/CP-Problems | 776-n-ary-tree-postorder-traversal/n-ary-tree-postorder-traversal.cpp | class Solution {
public:
vector<int> postorder(Node* root) {
// If the root is null, return an empty vector
if (!root) return {};
vector<int> res;
// Define the DFS function
function<void(Node*)> dfs = [&](Node* node) {
// Recursively call dfs for each child of ... | ALGO | 0.9995 | 6.852285 |
38d38404-dda7-4fa6-92bf-e7e00354d511 | geetikabatra/Problems-Practice | ProblemPractice/backtracking/combinationalsum.cpp | #include "/Users/gbatra/ProblemPractice/stdc++.h"
using namespace std;
void combinations(int *arr, int n, int x, vector<vector<int>> &result, vector<int> r){
if(x<0){
return;
}
if(x==0){
result.push_back(r);
return;
}
if(n<=0){
return;
}
r.push_back(arr[0]);
... | ALGO | 0.974552 | 4.060867 |
14536661-445e-4442-89d2-6a9afbcbb8f7 | jaewoopk/Cpp_Algorithm | Barking_Algorithm/B_1182.cpp | #include <bits/stdc++.h>
using namespace std;
int n,s,m = 1;
int t;
int cnt;
int arr[22];
int store[22];
bool issued[22];
bool conf = false;
void func(int k, int k2)
{
if (k == m)
{
int total = 0;
for (int i = 0; i < m; i++)
{
total += store[i];
}
if (total == s)
{
cnt++;
}
return ;
}
... | ALGO | 0.999984 | 3.2601 |
7611bc47-15b0-4669-aa2a-dd278da8bec6 | prakhar67199/coding-questions | code help/3 array/sum_of_all_subarray.cpp | //sum of all subarray
#include<iostream>
using namespace std;
int main()
{
int n;
cout<<"enter the size of an array: ";
cin>>n;
int data[n];
cout<<"enter the array element:";
for(int i=0;i<n;i++)
{
cin>>data[i];
}
int sum=0,result=0;
for(int i=0;i<n;i++)
{
sum... | ALGO | 0.999887 | 3.549314 |
8ed7a6cd-2b21-49fe-b99a-56e6cfc8b9dc | TankKingOne/NewCodeANDLeetCode | 961.重复N次的元素.cpp | //class Solution {
//public:
// int repeatedNTimes(vector<int>& A) {
// size_t N = A.size() / 2;
// unordered_map<int, int> m;
// for (auto e : A)
// {
// m[e]++;
// }
// for (auto& e : m)
// {
// if (e.second == N)
// return e.first;
// }
// return 0;
// }
//}; | ALGO | 0.999843 | 5.370034 |
e65b5f13-570c-4cbc-9da0-f656e58fa8da | HenriqueIII/learning-cpp | Capitulo 3/exercicios/ex3111.cpp | #include <iostream>
#include <fstream>
#include <cstring>
const int MAX_IGNORE=256, SIZEOFP=46, NAME_MAX=255;
int main(){
char palavra[SIZEOFP], filename[NAME_MAX],fileword[SIZEOFP];
int cont=0;
std::cout << "Abrir ficheiro -> ";
std::cin.getline(filename, NAME_MAX);
// std::cin.ignore(MAX_IGNORE... | TOOL | 0.966251 | 3.542067 |
715e9b28-ad29-41df-a70d-b3d73e5dd05e | sarvex/leetcode-scratch | solution/1700-1799/1796.Second Largest Digit in a String/Solution.cpp | class Solution {
public:
int secondHighest(string s) {
int a = -1, b = -1;
for (char& c : s) {
if (isdigit(c)) {
int v = c - '0';
if (v > a) {
b = a, a = v;
} else if (v > b && v < a) {
b = v;
... | ALGO | 0.999126 | 5.688924 |
7e6a83e0-4adf-41eb-bc12-6b38a62795bf | D-Rockie/DSA-LAB | DSA LAB/Lab 4/linked.cpp | // This code is to show the list ADT in the linked list !!!
#include <iostream>
#include <cstdlib>
class list {
private:
struct node {
int data;
struct node* link;
};
struct node* head;
public:
list() : head(NULL) {}
int inbeg(int num);
int inend(int num);
int inmid(int num... | ALGO | 0.999103 | 4.875242 |
56ef4465-06b8-4d1c-a9f7-84cbda277ae0 | zztiswb116/LLHP | utils/TableGen/DAGISelMatcherOpt.cpp | #include "DAGISelMatcher.h"
#include "CodeGenDAGPatterns.h"
#include "llvm/ADT/StringSet.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/raw_ostream.h"
using namespace llvm;
#define DEBUG_TYPE "isel-opt"
/// ContractNodes - Turn multiple matcher node patterns like 'MoveChild+Record'
/// into single compound... | ALGO | 0.987427 | 7.150287 |
ff646c12-809f-4d08-8ed8-c24b4abfab77 | samsank06/my-learnings | BST.cpp | #include<bits/stdc++.h>
using namespace std;
class BST{
public:
int data;
BST* left;
BST* right;
BST()
{
data=0;
left=NULL;
right=NULL;
}
void inorder(BST* root);
void preorder(BST* root);
void postorder(... | ALGO | 0.999525 | 4.404635 |
5a927f81-db22-49f5-ba46-2133769fd134 | Harshu05x/Pattern-Printing-Questions | pascal_triangle.cpp | #include <iostream>
using namespace std;
int main()
{
int n;
cout<<"Enter no of lines: ";
cin>>n;
for(int i = 1; i <= n; i++){
for(int j = n-i-1; j >= 0; j--)
cout<<" ";
int c = 1;
for(int j = 1; j <= i; j++){
cout<<c<<" ";
... | ALGO | 0.999839 | 4.150802 |
45b08055-ee02-467b-baef-c491dfba9a78 | ishandutta2007/codeforces | thescrasse/normal/1574/A.cpp | #include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<
#define INF (ll)1e18
#define mod 998244353
#define maxn 110
ll i, i1, j, k, k1, t, n, m, res, flag[10], a, b;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#if... | ALGO | 0.999786 | 5.10241 |
7cde1fe2-479e-48b1-9026-7e2abd96fdb5 | yqw1212/fuzztruction-llvm17.0.6 | mlir/lib/Dialect/Tensor/Transforms/ExtractSliceFromReshapeUtils.cpp | using namespace mlir;
using namespace mlir::affine;
using namespace mlir::tensor;
/// A tuple that represents (dimension number, dimension value).
using DimAndIndex = std::tuple<unsigned, Value>;
/// Transform `dimAndIndex` from the output index space of a (non-rank-reducing)
/// slice described by `sliceParams` into... | TOOL | 0.93042 | 7.94456 |
2deb62f1-d3c0-42e8-a950-f95248ba723c | aqua4/leetcode-solutions | Detect Capital/Solution.111487321.cpp | class Solution {
public:
bool detectCapitalUse(string word) {
bool first = 0;
if (word.length() < 2) {
return 1;
}
if (word[0] <= 'Z') {
first = 1;
}
bool second = 0;
if (word[1] <= 'Z') {
if (!first) {
retur... | ALGO | 0.999773 | 5.668597 |
9e07ee52-4821-4c33-8be9-98574e85ec7e | bqmnhat/CompetitiveProgramming | Codeforces/PolycarpAndSumsOfSubsequences/main.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int t;
long long b[8];
void ReadData() {
for (int i=1; i<=7; i++)
cin >> b[i];
}
void Solve() {
int NewB[8];
sort(b+1, b+1+7);
for (int i=1; i<=7; i++) {
for (int j=1; j<=7; j++) {
if (j == i)
... | ALGO | 0.999904 | 3.452196 |
1390e422-ce76-425f-9035-a4ac1134e791 | pravin435916/Cpp-DSA | Graph/NodeLevel.cpp | //Function to find the level of node X.
class Solution
{
public:
int nodeLevel(int V, vector<int> adj[], int X)
{
vector<bool> visited(V,false);
visited[0] =true;
queue<int> q;
q.push(0);
int level =0;
while(!q.empty()) {
int size = q.size();
while(size--) {
... | ALGO | 0.999966 | 5.032825 |
5bc388c4-1612-4416-8811-2b8018332cd5 | ehnryx/acm | kattis/judging.cpp | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;... | ALGO | 0.99997 | 4.06113 |
f2f10cbe-abc1-4245-9731-b9db839369d2 | raincross7/code-similarity | codes/train_code/problem256/problem256_301.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n;
cin>>n;
ll k;
cin>>k;
ll temp = n*500;
if(temp < k ){
cout<<"No";
}
else
cout<<"Yes";
return 0 ;
}
| ALGO | 0.999908 | 3.243854 |
0e83f108-95e9-4972-a235-11891aa861fd | CyberLemonade/RayTrace | ext/eigen/unsupported/bench/bench_svd.cpp | // Bench to compare the efficiency of SVD algorithms
#include <iostream>
#include <bench/BenchTimer.h>
#include <unsupported/Eigen/SVD>
using namespace Eigen;
using namespace std;
// number of computations of each algorithm before the print of the time
#ifndef REPEAT
#define REPEAT 10
#endif
// number of tests of t... | TEST | 0.99478 | 6.26191 |
cfcc2d98-7407-4cc7-9777-148567d04b48 | ChoiCube84/baekjoon-solutions | 7579/source.cpp | #include <bits/stdc++.h>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N, M;
cin >> N >> M;
vector<int> knapsack(10001, 0);
vector<int> memory(101, 0);
vector<int> cost(101, 0);
for (int i=1; i<=N; i++) {
cin... | ALGO | 0.999995 | 4.479095 |
4799a658-be78-4491-b906-5096a172359d | SunnyLin1215/3D-Placement-with-Macros | RePlAce_Algor/module/eigen-git-mirror/bench/benchmarkX.cpp | // g++ -fopenmp -I .. -O3 -DNDEBUG -finline-limit=1000 benchmarkX.cpp -o b && time ./b
#include <iostream>
#include <Eigen/Core>
using namespace std;
using namespace Eigen;
#ifndef MATTYPE
#define MATTYPE MatrixXLd
#endif
#ifndef MATSIZE
#define MATSIZE 400
#endif
#ifndef REPEAT
#define REPEAT 100
#endif
int mai... | ALGO | 0.963768 | 3.370773 |
7918eaa9-bc59-4609-a11c-cf400e32fd78 | mdrifat71/codeforces | random/binary_search.cpp | #include <bits/stdc++.h>
using namespace std;
bool b_search(int arr[], int n, int t)
{
int s = 0, e = n-1;
bool isFound = false;
while (s <= e)
{
int m = (s+e)/2;
if (arr[m] == t)
{
isFound = true;
break;
}
else if (arr[m] > t)
{
... | ALGO | 0.999068 | 4.07123 |
ce3b0ccc-ce13-4166-bc0c-e3550eaf1cff | dldlsdn4/NuGraphQL | 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 |
1776619d-4170-4611-9ad6-ab559f240ce7 | lucivpav/fast-triplets | step1/libs/lbfgsb-for-matlab/lbfgsb.cpp | #include "mex.h"
#include "matrix.h"
#include "matlabexception.h"
#include "matlabscalar.h"
#include "matlabstring.h"
#include "matlabmatrix.h"
#include "arrayofmatrices.h"
#include "program.h"
#include "matlabprogram.h"
#include <string.h>
#include <exception>
extern void _main();
// Constants.
// ------------------... | ALGO | 0.998771 | 7.082327 |
9d580ef8-cfa8-4ebb-82c6-66d3616bd577 | sxyizhiren/leetcode | number_of_digit_one.cpp | class Solution {
vector<int> s;
public:
int countDigitOneOfDeep(int n, int deep, int left){
//cout<<"countDigitOneOfDeep."<<n<<"."<<deep<<endl;
//if(1==deep){
// return n>=1?1:0;
//}
int s1=s[deep-1]*n;
int s2=(n>1)?pow(10,deep-1):0;
int s3=(n... | ALGO | 0.999931 | 4.425695 |
052a8d85-6d53-47da-9493-ca292d6a7035 | pat4life360/LEAP-Camera-Face-Tracker- | modules/gapi/src/executor/gtbbexecutor.cpp | #include "gtbbexecutor.hpp"
#if defined(HAVE_TBB) && (TBB_INTERFACE_VERSION < 12000)
// TODO: TBB task API has been deprecated and removed in 12000
#include "gapi_itt.hpp"
#include <opencv2/gapi/own/assert.hpp>
#include <opencv2/gapi/util/copy_through_move.hpp>
#include "logger.hpp" // GAPI_LOG
#include <tbb/task.h... | TOOL | 0.936465 | 7.547265 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.