uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
d13a11c5-8f91-4fd9-91e6-198c00bdb9fa | Deirror/FMI | DSA/HackerRank and LeetCode/Current Seminars and Practicums/Other/Combined Week 01, 02, 03/grades.cpp | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<int> arr(n);
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
sor... | ALGO | 0.999914 | 4.592104 |
2201daf3-6eff-4f4c-890f-d6a132ef75df | sevenalarm/Codeforces | farz/tst.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rpt(a) for (int i=0; i<(a); i++)
#define range(a, b) for (int j=(a); j<(b); j++)
#define ft first
#define sd second
#define pb push_back
#define fori(a, b) for (int i=(a); i<(b); i++)
ll f[50];
int delta = 10979;
bool fib(int n) {
fori(1,... | ALGO | 0.99723 | 3.800584 |
b411eaf6-71b8-4d8e-ab8c-7b5d688946f5 | bielpiero/lucky_bea | src/stats.cpp | #include "stats.h"
double stats::max(double a, double b){
double r = b;
if(a > b){
r = a;
}
return r;
}
double stats::min(double a, double b){
double r = b;
if(a < b){
r = a;
}
return r;
}
double stats::max(std::vector<double> values){
double max = -std::numeric_limits<double>::infinity();
if(values.si... | ALGO | 0.963307 | 5.598627 |
bac9b6e0-3c58-42d1-b764-79caa218c894 | lamphanviet/competitive-programming | uva-online-judge/accepted-solutions/1254 - Top 10.cpp | //=============================//
// Author: LAM PHAN VIET //
// Online Judge: UVA
// Problem: 1254 - Top 10
// Time limit: 18.000s
//=============================//
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#i... | ALGO | 0.999787 | 3.765659 |
7c2ea5e7-5138-4d60-a7ac-757f9cee6e78 | kewalkhondekar25/Data-Structures-And-Algorithms-CPP | cpp/15_basicMath/02_reverseNum/main.cpp | #include <bits/stdc++.h>
using namespace std;
void rev(int n){
int rev = 0;
while(n > 0){
int ld = n % 10;
rev = (rev * 10) + ld;
n/= 10;
};
cout << "reverse: " << rev << endl;
}
int main() {
int n;
cout << "Enter a number to reverse: " << endl;
cin >> n;
rev(n);
return 0;
}
/*
... | ALGO | 0.99895 | 4.948347 |
0c9e1727-6d92-4f02-b17c-7f7f87de34c4 | sanma-icfpc/icfpc2021 | libs/boost_1_76_0/libs/geometry/doc/index/src/examples/rtree/range_adaptors.cpp | //[rtree_range_adaptors
#include <boost/geometry.hpp>
#include <boost/geometry/geometries/point.hpp>
#include <boost/geometry/geometries/box.hpp>
#include <boost/geometry/index/rtree.hpp>
// Boost.Range
#include <boost/range.hpp>
// adaptors
#include <boost/range/adaptor/indexed.hpp>
#include <boost/range/adaptor/tr... | ALGO | 0.99445 | 6.437651 |
06e43614-ac8f-4003-9239-d4763bc297f0 | Gu0zj/database-cmu15445-fall2020 | third_party/murmur3/MurmurHash3.cpp | // This source file was originally from:
// https://github.com/PeterScott/murmur3
//
// We've changed it for use with VoltDB:
// - We changed the top-level functions defined below to return
// their hash by value, rather than accept a pointer to storage
// for the result
// Note - The x86 and x64 versions ... | ALGO | 0.984485 | 7.048966 |
b84d90e1-572c-4613-8be1-932697f46655 | jevhen-ponomarenko/OpenGL_SCI-FI_SCENE | OpenGL_2/BULLET/Bullet3Collision/BroadPhaseCollision/b3OverlappingPairCache.cpp | #include "b3OverlappingPairCache.h"
//#include "b3Dispatcher.h"
//#include "b3CollisionAlgorithm.h"
#include "Bullet3Geometry/b3AabbUtil.h"
#include <stdio.h>
int b3g_overlappingPairs = 0;
int b3g_removePairs =0;
int b3g_addedPairs =0;
int b3g_findPairs =0;
b3HashedOverlappingPairCache::b3HashedOverlappingPairCache... | TOOL | 0.960079 | 4.982692 |
3b32d0c7-28ab-457d-a198-bfad8cd62d1c | Rudy248/Leetcode | 15-3sum/3sum.cpp | class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> ans;
int n=nums.size();
sort(nums.begin(), nums.end());
for(int i=0; i<n; i++){
if(i>0 && nums[i]==nums[i-1]) continue;
int j=i+1;
int k=n-1;
... | ALGO | 0.999957 | 6.227797 |
7f435a30-ee91-44bc-8749-1f25bcf50c90 | Martialgod1/Codeforces_Solutions | 110A.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long x,y,k;
cin>>x;
string s = to_string(x);
k=s.size();
y=0;
for (int i = 0; i < k; i++)
{
if (s[i]=='4'||s[i]=='7')
{
y=y+1;
}
}
if(y==7||y==4)
{
cout<<"YES";
}
else
{
cout<<"NO";
}
return 0;
}
| ALGO | 0.99911 | 3.824589 |
b1c88b8a-b6c9-4722-b9fe-5f009844d698 | AshvinBa/CPP_Programs-2 | Questions/reverce_the_string.cpp | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
void reverse_string(char str[],int len)
{
int i=0;
int j=len-1;
while(i<=j)
{
swap(str[i++],str[j--]);
}
}
int main(){
char str[500]="irab nivhsA";
int len=strlen(str);
cout<<"The string is: ";
for(int i=0;i<len;... | ALGO | 0.999054 | 3.626263 |
f764ed5f-26e5-443e-99da-5ef974670de5 | ishandutta2007/codeforces | galen_colin/normal/1202/A.cpp | #include <bits/stdc++.h>
#include <chrono>
using namespace std::chrono;
using namespace std;
#define f0r(a, b) for (int a = 0; a < b; a++)
#define f1r(a, b, c) for (int a = b; a < c; a++)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); ... | ALGO | 0.9999 | 4.127027 |
f5bbf560-e844-49f6-9c31-016735d0f919 | techsavvyash/TheFundamentals | DSA/Algorithms/Competitive Programming/CodeChef/Contests/Starters-19-Dec-2021/The_Alternating_Sum.cpp | #include <iostream>
#include <climits>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
long long int t, n;
cin >> t;
while(t--) {
cin >> n;
long long int *arr = new long long int[n];
long long int *sums = new long long int[n];
... | ALGO | 0.999928 | 4.064171 |
22acef17-ec94-4af7-b1e1-f69645d1a832 | Lukahm/159201-algorithms-and-data-structures | assignment 3/a3 2.cpp | //Name:Haomin Liu ID:12109377
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <locale>
#include <sstream>
#include <string>
using namespace std;
/* implement your Queue class here */
struct Node {
int data;
Node *next;
};
class Queue {
private:
Node *front, *rear;
int counter;
public:
Queue();... | ALGO | 0.994225 | 3.747534 |
51c8001d-c86c-4e8c-9edb-221159c8a2f4 | dianestar/algorithm-cpp | SelfStudy/BOJ/Gold/1759.cpp | #include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
#define MAX_IDX 16
int L, C;
char ch;
vector<char> characters;
vector<int> isSelected(MAX_IDX);
void dfs(int index, int total, int vowel, int consonant) {
if (total == L) {
// 최소 한 개의 모음(a, e, i, o, u)과 최소 ... | ALGO | 0.999881 | 3.119892 |
5a34eaa6-5e94-4e29-96af-57db6ad8cbba | zhen8838/leetcode | 71.简化路径.cpp | /*
* @lc app=leetcode.cn id=71 lang=cpp
*
* [71] 简化路径
*/
#include "commom.hpp"
// @lc code=start
class Solution {
public:
string simplifyPath(string path) {
vector<string> s;
string tmp;
int i = 0, j = 0;
while (i != path.size()) {
// ic(s, tmp, path[i]);
if (path[i] == '/') {
... | ALGO | 0.999542 | 5.806026 |
407e4623-3e7e-4c6c-8536-3b9d9124c5ea | revbayes/revbayes.archive | boost_1_60_0/libs/sort/example/reversestringsample.cpp | // See http://www.boost.org/libs/sort for library home page.
#include <boost/sort/spreadsort/string_sort.hpp>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include <iostream>
#include <fstream>
#include <string>
using std::string;
using namespace boost::sort::spreads... | ALGO | 0.985497 | 4.712266 |
7e4a3c34-8401-4f1b-ad0c-7ca1499d93ca | sarvex/leetcode-haxe | solution/2500-2599/2530.Maximal Score After Applying K Operations/Solution.cpp | class Solution {
public:
long long maxKelements(vector<int>& nums, int k) {
priority_queue<int> pq(nums.begin(), nums.end());
long long ans = 0;
while (k--) {
int v = pq.top();
pq.pop();
ans += v;
pq.push((v + 2) / 3);
}
return ... | ALGO | 0.999988 | 5.345617 |
23206a73-5cc0-4702-a73e-8722030e8320 | Ayush1906saxena/dsaWithCpp | oddOrEven.cpp | #include <bits/stdc++.h>
#define ayush
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin >> n;
cout<<"The number "<<n;
if(n&1)
cout<<" is odd"<<endl;
else cout<<" is even"<<endl;
} | ALGO | 0.999692 | 3.654199 |
70fc3fea-4b18-4b02-8372-ccf496999e12 | dkangtext/Data-Structures-and-Algorithms | inclass/[Inclass11] Hash Table (Pre-Intermediate)/Bai06_FindMEXDungSTLVector.cpp | /*###Begin banned keyword - each of the following line if appear in code will raise error. regex supported
sort
stable_sort
partial_sort
partial_sort_copy
sort_heap
map
set
###End banned keyword*/
#include<vector>
#include<iostream>
using namespace std;
int main()
{
//###INSERT CODE HERE -
int n;
cin >> n;
... | ALGO | 0.99987 | 4.188947 |
4feb8980-212e-4861-b007-6340910be39f | Ramirez-Elias/CS124-BYUI | Week06/project06_Calendar_Program.cpp | /***********************************************************************
* Program:
* Project 6, Calendar Program
* Brother Helfrich, CS124
* Elias Ramirez
* Summary:
* Create a calendar for any month of any year from 1753 forward. This
* is similar to the cal utility on the Linux system. Prompt the user
* for the nu... | TOOL | 0.990707 | 3.802985 |
0b6ee3aa-8710-4c48-9c74-3c4dc90c8df3 | tsuchinoko29/nok0 | test/aoj-2600.test.cpp | #define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2600&lang=jp"
#include "data_structure/range_set.hpp"
#include "template.hpp"
void main_() {
INT(n, H, W);
range_set<int> xs, ys;
REP(i, n) {
INT(x, y, w);
xs.insert(max(x - w, 0), min(x + w, H));
ys.insert(max(y - w, 0), min(y + w, W... | ALGO | 0.990261 | 4.464316 |
22c71e39-609b-4db7-9edf-cb01e1eaecf6 | lalumine/firm | apps/tools/compare/vectcmp.cpp | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include "apps/io/file.hpp"
#include "apps/types.hpp"
#include "fora_interface.hpp"
constexpr char help[] =
"vectcmp <data_path> <truth_path> <result_path> [workloads]\n";
#define workload_path(workload) \... | TEST | 0.925876 | 5.435929 |
700b325c-a48c-416d-a42a-ba6beacd7401 | alexandraback/datacollection | solutions_5634947029139456_1/C++/zentropy/ChargingChaos.cpp | #include <stdio.h>
#include <vector>
#include <string>
#include <algorithm>
using std::vector;
using std::string;
unsigned int slove_small(unsigned int L,const vector<string>& src,const vector<string>& dst)
{
unsigned int ans = L + 1;
for(unsigned int imask = 0;imask < (1<<L);++imask)
{
vector<string> tmp = src;... | ALGO | 0.999921 | 3.883247 |
ae631f16-12e4-4ffa-a3b6-9777fb261ec3 | priyesh761/CSES-Problemset | 6. Tree Algorithms/Tree_Matching.cpp | #include <bits/stdc++.h>
using namespace std;
using pi = pair<int, int>;
#define F first
#define S second
void dfs(vector<vector<int>> &G, vector<pi> &dp, int par, int curr)
{
if (G[curr].size() <= 1)
{
dp[curr].F = 0;
dp[curr].S = 0;
}
for (int i = 0; i < G[curr].size(); i++)
i... | ALGO | 0.996114 | 4.206573 |
6d90461a-1461-43b3-a1ad-74e655f17d8f | ddayzzz/algorithm-and-basic-apps | tjpu-oj/huffman树.cpp | #include <iostream>
#include <queue>
#include <vector>
#include <numeric>
#include <functional>
int main() {
std::priority_queue<int,std::vector<int>,std::greater<int>> que;
int num;
std::cin >> num;
for (int i = 0; i<num; ++i)
{
int h;
std::cin >> h;
que.push(h);
}
long total = 0;
while (!que.e... | ALGO | 0.999968 | 4.22133 |
370c6fd2-5f3e-4580-a4a2-81ca289e15ed | Xenakios/XenakiosModules | dep/rubberband/src/audiocurves/PercussiveAudioCurve.cpp | /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
#include "PercussiveAudioCurve.h"
#include "src/system/Allocators.h"
#include "src/system/VectorOps.h"
#include <cmath>
#include <iostream>
namespace RubberBand
{
PercussiveAudioCurve::PercussiveAudioCurve(Parameters parameters) :
Au... | ALGO | 0.974154 | 7.24825 |
f13f2624-e867-47dd-912c-cde5a5a5d78a | ishandutta2007/codeforces | andreikkaa/normal/713/A.cpp | /*
* C++11 code template for contests.
* @author: Andrey Kalendarov
* @e-mail: <EMAIL>
*/
/*______ DEFINES _______*/
#define _SCL_SECURE_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
//#define ANDREIKKAA_TOPCODER
//#define ANDREIKKAA_ALLOCATOR
#define ANDREIKKAA_CLASS Solution
#define ANDREIKKAA_METHOD solve
#define AN... | ALGO | 0.999348 | 5.115906 |
c7d48479-7cf1-4e08-a18c-d873c92fed3c | BlauHimmel/Hikari | ext/tbb/examples/parallel_for/tachyon/src/grid.cpp | /*
* grid.cpp - spatial subdivision efficiency structures
*/
#include "machine.h"
#include "types.h"
#include "macros.h"
#include "vector.h"
#include "intersect.h"
#include "util.h"
#define GRID_PRIVATE
#include "grid.h"
#ifndef cbrt
#define cbrt(x) ((x) > 0.0 ? pow((double)(x), 1.0/3.0) : \
... | ALGO | 0.963097 | 6.68049 |
297636ff-7a7a-4f8e-bbea-0d5008a43725 | dantol29/CPP_exercices | CPP09/ex01/RPN.cpp | # include "RPN.hpp"
RPN::RPN()
{
}
RPN::RPN(const RPN &other)
{
_stack = other._stack;
}
RPN &RPN::operator=(const RPN &other)
{
if (this != &other)
_stack = other._stack;
return (*this);
}
RPN::~RPN()
{
}
std::stack<int> RPN::getStack() const
{
return (_stack);
}
bool RPN::handleOperation(char operation)
{... | ALGO | 0.987174 | 4.873918 |
6371e157-6376-486f-9091-bcc285f80aee | RetroPie/mame4all-pi | src/cpu/z8000/z8000ops.cpp | /******************************************
helper functions
******************************************/
/******************************************
check new fcw for switch to system mode
and swap stack pointer if needed
******************************************/
INLINE void CHANGE_FCW(UINT16 fcw)
{
if (fcw & ... | TOOL | 0.95369 | 5.90244 |
63586e97-7915-407c-a7dd-cc642eb70cb0 | YuhangQ/atpg-ls | src/lut.cpp | #include <set>
#include "lut.h"
#include "paras.h"
using namespace atpg_ls;
void LUT::flip_value() {
value ^= 1;
for(auto&[out, id] : fanouts_with_id) {
out->input_var ^= (1 << id);
}
}
void LUT::cal_fault_info(int *fd, int* fpl) {
fd[0] = fd[1] = fpl[0] = fpl[1] = 0;
if(isPO) {
... | ALGO | 0.993605 | 4.163537 |
04fa7f99-d322-474e-846e-db9bdeaf26ae | axelu/leetcode | cpp/01500-01999/maximizescoreafternoperations.cpp |
// 1799. Maximize Score After N Operations
// https://leetcode.com/problems/maximize-score-after-n-operations/
class Solution {
private:
void printBinary(long x, int c) {
/*
for(int i = c-1; i >= 0; --i) {
if( x & (1UL << i) ) cout << 1;
else cout << 0;
}
*/... | ALGO | 0.999974 | 5.322643 |
29eb465f-ae44-4639-b8de-90a8ee750236 | PerfectoZ/effective-succotash | Dynamic Programming/DP_Vacation.cpp | #include<bits/stdc++.h>
#define ll long long int
#define pi 3.1415926535897932385
#define mod 1000000007
#define db double
#define pp(x) pair<x,x>
#define ff first
#define ss second
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define tc ll tc; cin>>tc; for(ll number = 1 ; number <= tc ... | ALGO | 0.99996 | 4.43243 |
e64521f9-50ef-4cc0-8822-03650798c844 | Rookie0208/Learnings | Cpp DSA/linear_search.cpp | #include<bits/stdc++.h>
using namespace std;
void solve(vector<int> &v, int k) {
int i = 0;
for(i = 0; i<v.size(); i++) {
if(v[i] == k) break;
}
cout << i << endl;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for(int i = 0; i<n; i++) cin >> v[i];
solve(v, k);
} | ALGO | 0.999692 | 5.162255 |
55657368-187b-49e7-8b3f-27a3e4ff6147 | ThisisGame/Lives2D_Depends | bullet3/src/Bullet3OpenCL/NarrowphaseCollision/b3ContactCache.cpp | #if 0
#include "b3ContactCache.h"
#include "Bullet3Common/b3Transform.h"
#include "Bullet3Collision/NarrowPhaseCollision/shared/b3Contact4Data.h"
b3Scalar gContactBreakingThreshold = b3Scalar(0.02);
///gContactCalcArea3Points will approximate the convex hull area using 3 points
///when setting it to false, it w... | ALGO | 0.995609 | 6.487961 |
d4ee0615-a28f-4a46-9765-e6e38f5551e1 | i4h/sdscip | src/cppmain.cpp | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* */
/* This file is part the SCIP-Extension */
/* System Dynamics SCIP (SD-SCIP) */
... | ALGO | 0.868359 | 5.701294 |
a8f514bd-a8c6-4fd5-91c8-0e0053dfc0c2 | gRenka-with-40k-garlic/Semester-Cpp | Lab1/Lab1Task4/Lab1Task4.cpp | #include <iostream>
#include <cmath>
struct Point {
double x;
double y;
};
struct Ellipse {
Point center;
double radius1;
double radius2;
};
double calculateEllipseCircumference(Ellipse e) {
return 3.14159 * (e.radius1 + e.radius2); // снова не смогла импортировать пи
}
double calculateEll... | ALGO | 0.999837 | 5.071243 |
ff67bfe8-73e6-4907-a468-4a583dd58fd4 | Ashsifat1511/CP-Solves | C_Odd_Even_Increments.cpp | #include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
#define forn for(int i = 0; i < n; i++)
const int N = 1e6+7;
typedef long long int ll;
#define pb push_back
#define cs cout<<"Case "<<tc<<": "
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
cin>>t;
for(i... | ALGO | 0.999075 | 4.57658 |
a62f198a-1c89-474e-822d-887559502086 | scott-sihui-wang/LeetCode | 3114_Latest_Time_You_Can_Obtain_After_Replacing_Characters.cpp | class Solution {
public:
string maxH(string s){
if(s[0]=='?' && s[1]=='?'){
return string("11");
}
else if(s[0]!='?' && s[1]=='?'){
if(s[0]=='0'){
return string("09");
}
else if(s[0]=='1'){
return string("11");
... | ALGO | 0.999557 | 6.002904 |
16e50339-ca8c-4fff-81db-17a8c14c28e4 | sayak-ghosh/cpp | CODECHEF/StudyingAlphabet(ALPHABET).cpp | // Question Link : https://www.codechef.com/problems/ALPHABET
// PROBLEM CODE : ALPHABET
#include<iostream>
#include<string>
using namespace std;
int main()
{
string letter ;
// INPUT LETTER WHICH JEFF KNOW
cout << " \nEnter letters that jeff can read : " ; cin >> letter ;
// HOW MANY NUMBERS ARE IN T... | ALGO | 0.999862 | 4.920538 |
8c1f3b7c-881f-4726-8e7d-65bbd6bb6cb1 | dhanush-beep/dsa-lab | lab2/pointer.cpp | // program to check if a number is Armstrong, Perfect or a palindrome
#include <cstdio>
#include <cstdlib>
#include <math.h>
#include <string.h>
// Function prototypes
int countdigits(int *);
int *getdigits(int *, int *);
int is_palindrome(int *, int *, int *);
int is_armstrong(int *, int *, int *);
int is_perfect(int... | ALGO | 0.99682 | 3.722784 |
e76dbc00-baa8-427d-8b3d-291e3b7327d9 | bqmnhat/CompetitiveProgramming | BigOCoding/DancingWithTheGooglers/main.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int tc,n,s,p,t[101];
void ReadData() {
for (int i=1;i <= n; i++)
cin >> t[i];
}
int Solution() {
int ans = 0;
for (int i=1; i<=n; i++) {
if (t[i] >= max(0,(3*p - 2)))
ans++;
else if ((t[i] >= max(2,(3*p -... | ALGO | 0.998011 | 3.835227 |
1def191c-86ed-4874-a659-c7c791fecae4 | QTune1603/SPOJ | PTIT013A.CPP | #include <bits/stdc++.h>
using namespace std;
void solve()
{
int n;
cin >> n;
if (n % 100 == 86)
cout << 1;
else
cout << 0;
}
int main()
{
int t;
cin >> t;
while (t--)
{
solve();
cout << endl;
}
return 0;
} | ALGO | 0.99185 | 3.940141 |
13c41bde-5f06-40f9-bbb0-6deee9c92193 | RitulMohan/CSF211 | spiralordertraversal.cpp | #include <iostream>
using namespace std;
int main()
{
int n, m;
cin>>n>>m;
int a[n][m];
for (int i=0; i<n; i++)
{
for (int j=0; j<m; j++)
{
cin>>a[i][j];
}
}
//spiral order print
int row_start=0;
int row_end=n-1;
int column_start=0;
int column_end=m-1;
while(row_start<=row_end && col... | ALGO | 0.999958 | 3.016881 |
36f051cd-e628-4e52-a280-06c178e836b0 | juarezpaulino/coderemite | problemsets/SPOJ/SPOJ - BR/POODLEMG.cpp | /**
*
* Author: Juarez Paulino(coderemite)
* Email: <EMAIL>
*
*/
#include <cstdio>
using namespace std;
int main() {
int N, P;
while (scanf("%d %d", &N, &P)) {
if (!(N|P)) break;
int l = N/P + (N%P!=0);
if (l < 6) l = 0;
else if (l > 20) l = 14;
else l -= 6;
... | ALGO | 0.9882 | 3.278307 |
27afab3b-c376-4475-bca1-d36996e6bb25 | Lucas-Rezende/PDS2 | VPL02/VPL02.cpp | #include <iostream>
#include <string>
class CountVowels
{
private:
std::string _w;
unsigned int _a, _e, _i, _o, _u;
public:
CountVowels(std::string word)
{
_w = word;
_a = 0;
_e = 0;
_i = 0;
_o = 0;
_u = 0;
}
unsigned int CountA () {
uns... | ALGO | 0.964795 | 5.824475 |
2afb3b6c-d860-4108-925e-05220119b26a | nabin47/attack-on-problems | LightOJ/1008 - Fibsieve`s Fantabulous Birthday.cpp | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int t, c = 1;
cin>>t;
while(t--){
int i = 1, cur = 0, indx, indy;
long long s, j;
cin>>s;
i = ceil(sqrt((double(s))));
for(j = i - 3; j < i + 4; j++){
if(s > j * j && s <= (j+1) * (j +1)) break;
}
cur = j, i = j + 1;
long lo... | ALGO | 0.999213 | 3.490922 |
115451c2-fc5d-45f3-bbae-420982acb9fe | ishandutta2007/codeforces | um_nik/normal/1270/C.cpp | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | ALGO | 0.998985 | 3.105751 |
dd3ff525-a15e-49c7-9118-396c87672358 | MDNoorUddin/cses.fi-Solutions | Range_Xor_Queries.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ps() cout<<" ";
/** '' "\n" ^ **/
vector<ll> a(200001);
vector<ll> tree(800001);
int n,q;
void build(int node,int s,int e)
{
//cout<<s;ps();cout<<e;
if(s==e)
{
//ps();
// cout<<a[s]<<endl;
tree[node]=a[s-... | ALGO | 0.999965 | 4.521832 |
3ffcb07e-0380-4b64-bc20-1151fcc7695d | podgorskiy/MinimalFem | eigen/unsupported/doc/examples/MatrixSinh.cpp | #include <unsupported/Eigen/MatrixFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
MatrixXf A = MatrixXf::Random(3,3);
std::cout << "A = \n" << A << "\n\n";
MatrixXf sinhA = A.sinh();
std::cout << "sinh(A) = \n" << sinhA << "\n\n";
MatrixXf coshA = A.cosh();
std::cout << "cosh(A) = \n"... | ALGO | 0.992619 | 5.890235 |
f789e043-abd5-4a81-817b-7b614e4274c0 | iprosenjitp/Online-Judge | LeetCode/2399-Check Distances Between Same Letters.cpp | #include <bits/stdc++.h>
#define ll long long
using namespace std;
bool checkDistances(string s, vector<int>& distance)
{
int len = s.size();
for(int i = 0; i < 26; i++){
char ch = 'a' + i;
int a = s.find(ch);
if(a != -1){
string str = s.substr(a+1, len-a-1);
in... | ALGO | 0.999927 | 3.545062 |
c34674a9-0915-4f80-9fed-317bc49c0cf6 | kevinvanleer/soboard | app/libs/tess-two/jni/com_googlecode_tesseract_android/src/dict/permdawg.cpp | /*----------------------------------------------------------------------
I n c l u d e s
----------------------------------------------------------------------*/
#include "cutil.h"
#include "dawg.h"
#include "freelist.h"
#include "globals.h"
#include "ndminx.h"
#include "stopper.h"
#include "tprintf.h"
#... | ALGO | 0.996488 | 3.007731 |
9a5c86b0-8471-4971-b57f-f9d2b52b28d5 | pbosetti/MADS | src/main/broker.cpp | /*
____ _
| __ ) _ __ ___ | | _____ _ __
| _ \| '__/ _ \| |/ / _ \ '__|
| |_) | | | (_) | < __/ |
|____/|_| \___/|_|\_\___|_|
The broker executable. It redirects all messages from the frontend socket to
the backend socket.
The endpoints are defined in the settings file.
Author(s): Paolo Bosetti
... | WEB | 0.901778 | 7.08991 |
4d3f8271-5584-44d9-9a33-65dea5ea4c17 | Vattikondadheeraj/testing | Matrix_Operations/Total_Possible_Paths/Total_Possible_Paths.cpp | /*
TOTAL PATHS FROM (0, 0) to (m, n)
The task is to calculate total possible moves we can make to reach
(m, n) in a matrix, starting from origin, given that we can only take
1 step towards right or up in a single move.
*/
#include<bits/stdc++.h>
using namespace std;
int totalPaths(int m, int n) {
int total[100][... | ALGO | 0.99998 | 5.40435 |
8aa13243-607e-4753-8186-2b07cb60aef1 | henrywarhurst/matrix | libs/boost_1_72_0/libs/math/example/policy_ref_snip11.cpp | // Note that this file contains quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!
#include <iostream>
using std::cout; using std::endl;
// Setting (approximate) precision 25 bits in a single function call using make_policy.
//[policy_ref_snip11
#include <boost/math... | ALGO | 0.987983 | 4.541749 |
7d981f4e-bbc8-4022-b01f-8e87be702c69 | raincross7/code-similarity | codes/train_code/problem147/problem147_59.cpp | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < n; i++)
using namespace std;
void solve() {
long a, b;
ci... | ALGO | 0.999694 | 4.305894 |
f2c88979-eb1f-4dc1-bda2-49efdf951181 | Manash04/DataStructue-And-Algorithms | 1915-check-if-one-string-swap-can-make-strings-equal/1915-check-if-one-string-swap-can-make-strings-equal.cpp | class Solution {
public:
bool areAlmostEqual(string s1, string s2) {
vector<char>temp;
for (int i = 0; i < s1.size(); i++) {
if (s1[i] != s2[i]) {
temp.push_back(s1[i]);
temp.push_back(s2[i]);
}
}
if(temp.size()==0){
... | ALGO | 0.999963 | 6.134542 |
2fedd373-faf0-4e3c-8e22-47068a1c690c | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_9844_14.cpp | #include <bits/stdc++.h>
using namespace std;
int a[3010], arr[3010];
long long dp[3010][3010];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d", a + i);
a[i] -= i;
arr[i] = a[i];
}
sort(arr, arr + N);
int M = unique(arr, arr + N) - arr;
for (int i = 0; i < N; i++) {
... | ALGO | 0.999937 | 3.91512 |
9724eb36-b50d-43f7-9a87-bf197b39193b | DevRitesh08/DSA | Linked List/Medium Problems of LL/Add_1_to_a_Number_Represented_by_linked_list.cpp | #include<bits/stdc++.h>
using namespace std ;
class Node{
public:
int data;
Node* next ;
// constructor
Node(int data1)
{
data = data1 ;
next = nullptr ;
}
Node(int data1 , Node* next1)
... | ALGO | 0.999967 | 6.124707 |
3b5e9155-b5bc-4955-8412-77bfa3f31711 | subodhkmahto/DataStructure-and-Algoritham-with-c- | reverseStringWordWise.cpp | #include <iostream>
#include <vector>
#include <string>
using namespace std;
string reverseStringWordWise(string s) {
vector<string> str;
string s1;
for (auto i : s) {
if (i != ' ') {
s1 = s1 + i;
} else {
str.push_back(s1);
s1 = "";
}
}
... | ALGO | 0.999926 | 6.083678 |
7b1a9337-eb66-41a8-8a05-3cf31ef0b096 | VineetRajput87/GFG-POTD | Panagram Checking.cpp | class Solution
{
public:
//Function to check if a string is Pangram or not.
bool checkPangram (string s) {
vector<int> f(26, 0);
for(auto i : s){
char cur = tolower(i);
if(cur >= 'a' and cur <= 'z'){
f[cur - 'a'] = 1;
... | ALGO | 0.999315 | 5.799305 |
6fb893f1-c38e-4dc6-9f7e-71076f5d9492 | J1miin/2024_2_Cpp-Programming | 3주차/제출과제/10번/Add.cpp | #include <iostream>
using namespace std;
//class 구현
#include "Add.h"
void Add::setValue(int x, int y){
a = x;
b = y;
}
int Add::calculate(){
return a+b;
} | TOOL | 0.884552 | 5.231683 |
06af798e-5b3e-4357-a853-f7d55888fab4 | mrt786/Snake-Game | game-release.cpp | using namespace std;
// function prototypes
void SetCanvasSize(int, int);
void find(int , int& , int& );
void update_snake_location();
void generate_powerfood();// generating the power food
void check_power_food();// this function is to check that the snake eats the power food or not
void generate_food1();// generati... | TOOL | 0.968419 | 4.100223 |
3dabdefe-7cf7-4498-bde3-a7f220c9cf42 | umairgillani93/cpp-ds-algorithms | data_structures_algorithms_cpp/paren_check_stack.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
struct Node {
int data;
struct Node *next;
};
struct Node *top = NULL;
void push(char x) {
struct Node *t;
t = (struct Node *)malloc(sizeof(struct Node));
if (t == NULL) {
cout << "Stack is full, heap is full!" << '\n';
}
else {
t -> dat... | ALGO | 0.99918 | 5.021645 |
aa4446b0-5d5c-4e49-87e2-b8c6cdc43feb | runtyalien/LeetCode_75 | 1431-kids-with-the-greatest-number-of-candies/1431-kids-with-the-greatest-number-of-candies.cpp | class Solution {
public:
vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
int maxCandies = *max_element(candies.begin(), candies.end());
vector<bool> result(candies.size());
for (int i = 0; i < candies.size(); i++) {
if (candies[i] + extraCandies >= maxCandies) {
... | ALGO | 0.99996 | 6.080516 |
cdfa04e4-5489-41de-b2fa-fd92c9b09133 | Hasan-Saju/Competitive-Programming | Codeforces/1269B.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define vi vector<int>
#define si set<int>
#define pi pair<int,int>
#define FOR(i,n) for(int i=0;i<n;i... | ALGO | 0.999988 | 3.742717 |
ca72d7df-55f0-40e6-8b89-8253391478e5 | eggag32/Competitive-Programming | Codeforces/Moving to the Capital.cpp | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i ... | ALGO | 0.99997 | 4.891745 |
af65b560-3976-4b51-920b-817df07990e8 | walac/blender-wayland | source/blender/physics/intern/implicit_eigen.cpp | /** \file blender/physics/intern/implicit_eigen.cpp
* \ingroup bph
*/
#include "implicit.h"
#ifdef IMPLICIT_SOLVER_EIGEN
//#define USE_EIGEN_CORE
#define USE_EIGEN_CONSTRAINED_CG
#ifdef __GNUC__
# pragma GCC diagnostic push
/* XXX suppress verbose warnings in eigen */
# pragma GCC diagnostic ignored "-Wlogical... | ALGO | 0.999638 | 5.00526 |
46cbffc1-ef0a-4710-8da1-bd420c5bc5b9 | MaximePremont/R-Type_Epitech | libs/boost/libs/numeric/ublas/doc/samples/matrix_binary.cpp | #include <boost/numeric/ublas/matrix.hpp>
#include <boost/numeric/ublas/io.hpp>
int main () {
using namespace boost::numeric::ublas;
matrix<double> m1 (3, 3), m2 (3, 3);
for (unsigned i = 0; i < (std::min) (m1.size1 (), m2.size1 ()); ++ i)
for (unsigned j = 0; j < (std::min) (m1.size2 (), m2.size2 ... | ALGO | 0.994164 | 4.054733 |
ae7d468e-e4b7-4d0c-bfdb-efe7753b2484 | tfeadzwa/inventory_management | 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 |
37cd1d0a-9c3e-4cf2-975d-18ac51e93f86 | navinkrnirala76/LeetCode-Practice | Intersection of Two Arrays II.cpp | class Solution {
public:
vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
sort(nums1.begin(), nums1.end());
sort(nums2.begin(), nums2.end());
int i = 0, j = 0;
vector<int> res;
while(i < nums1.size() && j < nums2.size()){
if(nums1[i] == nums2... | ALGO | 0.99998 | 5.559614 |
c3a5c0d9-5d4d-455c-aa94-03597e261b25 | Struna1292/LeetCode | 0817-design-hashmap/0817-design-hashmap.cpp | class MyHashMap {
public:
struct LLnode { // linked list node
int key;
int value;
LLnode* next;
LLnode(int k, int v) {
key = k;
value = v;
next = nullptr;
}
};
LLnode** array;
int length;
int capacity;
float loadFactor;... | ALGO | 0.999454 | 6.174491 |
ad78741a-96ad-4545-a527-eabfa0118074 | tetraloba/competitiveProgramming | AlgoMethod/timeComplexity/3_device1/4_2.cpp | // 2023/06/28 00:59:25
// 2023/06/28 01:04:50 AC.
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long sum = 0;
for (int i : A) {
sum += i;
}
cout << sum * sum ... | ALGO | 0.999772 | 5.096049 |
1d717a30-4470-4f2b-8b57-edc12b042685 | m2ohara/PermojiApp | app/src/main/cpp/jni/src/suggest/core/result/suggestions_output_utils.cpp | #include "suggest/core/result/suggestions_output_utils.h"
#include <algorithm>
#include <vector>
#include "dictionary/utils/binary_dictionary_shortcut_iterator.h"
#include "suggest/core/dicnode/dic_node.h"
#include "suggest/core/dicnode/dic_node_utils.h"
#include "suggest/core/dictionary/error_type_utils.h"
#include ... | TOOL | 0.980515 | 7.499663 |
3875d8c4-e6f7-493a-afb9-bf5e7ff80947 | Krshivam/UVA-Online-Judge | uva_481.cpp | #include<bits/stdc++.h>
using namespace std;
#define MAX 100005
#define pb push_back
#define ll long long
ll arr[MAX];
ll I[MAX];
ll inf = 2000000000;
int main(int argc, char const *argv[])
{
int n=0;
ll num;
while(cin>>num){
arr[n] = num;
n++;
}
I[0] = -inf;
for (int i = 1; i < n+1; ++i)
{
I[i] = inf;
}... | ALGO | 0.999988 | 3.131112 |
08247a7e-79bf-4491-a0fa-262c9b044338 | a1k0n/tt08-donut-uart | verilator/serialmul_tb.cpp | #include <stdint.h>
#include "Vserialmul.h"
#include "Vserialmul__Syms.h"
int main(int argc, char **argv) {
Verilated::commandArgs(argc, argv);
Vserialmul *top = new Vserialmul;
const int x = 28580;
const int y = 25378;
const int z = -10986;
const int d = 0x128;
top->start = 1;
top->xin = x;
top->... | TEST | 0.976495 | 4.812659 |
85f39bdd-f647-4afc-bf8f-c3a08cd1b80c | artur-amorim/PomeronHVQCD | physics/fitSigmaGammaProtonKernelFixed.cpp | #include <iostream>
#include <string>
#include <vector>
#include "HolographicVQCD.h"
#include "HQCDP.h"
#include "GluonKernel.h"
#include "MesonKernel.h"
#include "SigmaGammaProton.h"
#include "methods/optimization/NelderMead.hpp"
#include "schrodinger/chebspec.h"
using namespace std;
int main(int argc, char ** argv)... | ALGO | 0.955532 | 4.51877 |
6bb7798f-e173-4feb-abf6-94344c7aeab3 | leorazo/REPOSITORIO-DE-Cplusplus- | C5 voc minu o mayu.cpp | #include<iostream>
using namespace std;
int main (){
char letra;
cout<< "\n este programa te dira si es una vocal mayuscula o minuscula";
cout<< "\n inserte una letra "; cin>> letra;
switch (letra){
case 'a':
case 'e':
case 'i':
case 'o':
case 'u': cout <<"la letra es una vocal minuscula"; br... | ALGO | 0.96911 | 3.71261 |
815de912-4a22-42aa-b129-88608e2c1054 | yujinrobot/yujin_lidar_v2 | driver_general/eigen-3.3.7/doc/examples/QuickStart_example.cpp | #include <iostream>
#include <Eigen/Dense>
using Eigen::MatrixXd;
int main()
{
MatrixXd m(2,2);
m(0,0) = 3;
m(1,0) = 2.5;
m(0,1) = -1;
m(1,1) = m(1,0) + m(0,1);
std::cout << m << std::endl;
}
| ALGO | 0.99644 | 3.474624 |
4cb88f32-d898-485c-826f-ecf3e5e756a6 | craftzbay/e-olymp | 2000-2999/2661 - Price labels - Ценники - Qiymət nişanları - Цінники.cpp | #include <iostream>
#include <set>
using namespace std;
set<int> s;
int n, val;
int main() {
//Читаем входные данные. Заносим ценники как для первого
//так и для второго супермаркета во множество s.
scanf("%d", &n);
while (n--) scanf("%d", &val), s.insert(val);
scanf("%d", &n);
while (n--) scanf("%d", &val), s... | ALGO | 0.999663 | 3.461263 |
ccb01d8f-b4fb-4dde-8f91-ab96152ef31a | ishandutta2007/codeforces | shubham__36/normal/1268/C.cpp | #pragma GCC optimize ("-O3")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#i... | ALGO | 0.999972 | 3.663476 |
5146bdff-5d02-4fe1-ab7f-94e64bfb26b8 | snikolov3/DEMSI_newLAMMPS | LAMMPS/src/KOKKOS/fix_setforce_kokkos.cpp | #include "fix_setforce_kokkos.h"
#include <cstring>
#include "atom_kokkos.h"
#include "update.h"
#include "modify.h"
#include "domain.h"
#include "region.h"
#include "input.h"
#include "variable.h"
#include "memory_kokkos.h"
#include "error.h"
#include "atom_masks.h"
#include "kokkos_base.h"
#include "region.h"
using ... | ALGO | 0.906626 | 6.473435 |
9d926bef-c505-443f-a704-5f7800da723b | all1m-algorithm-study/2021-1-Algorithm-Study | week8/Group7/Boj2251_poiu694.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
void fastIO()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void solve()
{
int A, B, C;
cin >> A >> B >> C;
vector<int> list;
bool visited[201][201][201] = {
f... | ALGO | 0.999974 | 3.525317 |
531fade9-9c59-441d-9387-61eadc127a6c | Parthcode1005/Problem-Solving-in-CPP | DP_Unique_Paths_LC_Tabulation.cpp | #include <bits/stdc++.h>
using namespace std;
int countWaysUtil(int m, int n, vector<vector<int> > &dp) {
for(int i=0; i<m ;i++){
for(int j=0; j<n; j++){
//base condition
if(i==0 && j==0){
dp[i][j]=1;
continue;
}
int up=... | ALGO | 0.99998 | 4.581121 |
38ec57c3-1072-4762-b698-2f07889f0e0e | SlaviB02/University- | C++/HackSaw.cpp | #include <iostream>
const int N = 100;
int hacksaw(int arr[], int size, int i, int br)
{
if (i == size-1)
{
return 1;
}
if (i == 0)
{
if (arr[i] > arr[i + 1])
{
br = 1;
return hacksaw(arr, size, i + 1, br);
}
else
{
br = 2;
return hacksaw(arr, size, i + 1, br);
}
}
if (br == 2)
{
if... | ALGO | 0.999989 | 3.653353 |
0b2c355e-5fb4-49a8-85e3-fefb155b98d3 | Reylyer/not-so-competitive | TLX/CXX/pp.testing.cpp | #include <iostream>
#include <string>
using namespace std;
int main(){
// string msg,detection;
// int convMsg,i,check;
// bool empty = false;
// cin>>msg;
// try{
// convMsg = stoi(msg);
// if(msg.size()>1 && msg[0]==0)detection="kata";
// else if(convMsg==0)detection="nol... | ALGO | 0.988124 | 3.369804 |
309658db-f4b7-45c5-8dfe-1d0830680d2b | chenfushan/alps_algorithm | MicrosoftExam/MicrosoftExam/main.cpp | #include <iostream>
#include <math.h>
using namespace std;
bool examBall(int ball[], int a, int b, int c){
if ((abs(ball[0] - ball[1]) == a) && (abs(ball[0] - ball[2]) == b) && (abs(ball[1] - ball[2]) == c)) {
return true;
}
if ((abs(ball[0] - ball[1]) == a) && (abs(ball[0] - ball[2]) == c) && (abs... | ALGO | 0.999208 | 4.055394 |
13761418-7849-453d-b1e3-6319321e95b7 | J8088/coursera-brown-belt | week2/restructuring/restructuring/stats_aggregator.cpp | #include "stats_aggregator.h"
using namespace std;
template <typename T>
ostream& operator << (ostream& os, const optional<T>& v) {
if (v) {
os << *v;
}
else {
os << "undefined";
}
return os;
}
namespace StatsAggregators {
void Composite::Process(int value) {
for (auto& aggr : aggregators) {
aggr->Pr... | TOOL | 0.881376 | 7.7514 |
b1b6e41e-4cdc-420e-ba01-70753c066c30 | noah-johnson1810/my-qmk | lib/chibios-contrib/ext/mcux-sdk/devices/LPC844/mcuxpresso/startup_lpc844.cpp | #if defined (DEBUG)
#pragma GCC push_options
#pragma GCC optimize ("Og")
#endif // (DEBUG)
#if defined (__cplusplus)
#ifdef __REDLIB__
#error Redlib does not support C++
#else
//*****************************************************************************
//
// The entry point for the C++ library startup
//
//********... | CONFIG | 0.917487 | 7.284845 |
33cf532b-e988-4268-bef4-982e332089f9 | lepecoder/algorithms | nowcoder/NC134.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
/**
* 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
* 计算最大收益
* @param prices int整型vector 股票每一天的价格
* @return int整型
*/
int maxProfit(vector<int> &prices) {
// write code here
int n = prices.size();
if ... | ALGO | 0.999898 | 5.266874 |
6ff35dd7-b74b-4cd6-8c57-038166537e03 | Akash52/code-daily | DSA/Bit Magic/K_th_bit.cpp | //Check whether K-th bit is set or not
#include<iostream>
using namespace std;
void isKthBit(int n,int k)
{
if((n>>(k-1))&1)
cout<<"SET";
else
cout<<"NOT SET";
}
int main()
{
int n,k;
cin>>n>>k;
isKthBit(n,k);
return 0;
}
| ALGO | 0.999247 | 3.766521 |
c5676b59-4253-4fba-949a-a0838d07a234 | ZMQ466/8209230305- | 1.2.cpp | #include <iostream>
using namespace std;
int main()
{
double r, h,,v;
= 3.14;
cout << "Բİ뾶ߣ";
cin >> r >> h;
v = r * r * h * /3;
cout << "ԲΪ" << v << endl;
} | ALGO | 0.994128 | 3.65182 |
84d8c3f5-c474-40dc-99ee-a06cf4a803f2 | Kujakuh/EssentiaEngine | thirdparty/opencv-4.10.0/modules/calib3d/src/quadsubpix.cpp | #include "precomp.hpp"
#include <limits>
#include <utility>
#include <algorithm>
#include <math.h>
namespace cv {
inline bool is_smaller(const std::pair<int, float>& p1, const std::pair<int, float>& p2)
{
return p1.second < p2.second;
}
static void orderContours(const std::vector<std::vector<Point> >& contours... | ALGO | 0.99975 | 6.562594 |
8eda41e2-078a-4f09-b4d3-29e553a93070 | SungWooHyuk/BaekjoonProgrammers | 프로그래머스/2/154538. 숫자 변환하기/숫자 변환하기.cpp | #include <queue>
#include <vector>
using namespace std;
int solution(int x, int y, int n) {
vector<int> visited(y + 1, -1);
queue<pair<int, int>> q; // 현재 숫자, 연산 횟수
q.push({x, 0});
visited[x] = 0;
while (!q.empty()) {
int cur = q.front().first;
int cnt = q.front().second;
... | ALGO | 0.999977 | 5.218597 |
5ea14121-c8a4-4493-bf40-60534cca6ecd | isha141/LeetCode | 133-clone-graph/133-clone-graph.cpp | /*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> neighbors;
Node() {
val = 0;
neighbors = vector<Node*>();
}
Node(int _val) {
val = _val;
neighbors = vector<Node*>();
}
Node(int _val, vector<Node*> _neighbors) {
val = _val;
... | ALGO | 0.999963 | 6.097413 |
51fa2e07-70a5-4110-88d7-687848e12b4e | Sharafabdullah/CompetitiveProgramming | cses/SortingAndSearching/SecondPass/Traffic_Lights.cpp | #include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define repd(i, a, b) for (int i = a; i >= b; --i)
#define pb push_back
#define B begin()
#define E end()
#define clr(x) memset(x,0,s... | ALGO | 0.999982 | 3.756937 |
1d77263e-c10a-4c2e-b711-beb24c83261d | bge-community/Ketsji-Game-Engine | intern/cycles/bvh/bvh_unaligned.cpp | #include "bvh/bvh_unaligned.h"
#include "render/mesh.h"
#include "render/object.h"
#include "bvh/bvh_binning.h"
#include "bvh_params.h"
#include "util/util_boundbox.h"
#include "util/util_debug.h"
#include "util/util_transform.h"
CCL_NAMESPACE_BEGIN
BVHUnaligned::BVHUnaligned(const vector<Object*>& objects)
... | TOOL | 0.9124 | 7.575213 |
640ecdc8-4c03-468b-b742-e8d1bfcb3554 | YuanyueLi/group-dia | library/GroupProphet.cpp | #include "GroupProphet.h"
const double p_ts_in_existspec = 0.7;
const double p_ts_out_existspec = 0.3;
namespace GroupDIA {
} /* namespace GroupDIA */
template<class T> bool large_first_single(const T& i, const T& j) {
return (i > j);
}
template<class T1, class T2> bool large_first(const pair<T1, T2>& i, const pa... | ALGO | 0.999515 | 4.746468 |
861ba0f2-c31a-4b84-8a0f-4d617a8418b1 | tmoflash/SWG-NGE | src/engine/server/library/serverGame/src/shared/space/ServerShipTargeting.cpp | #include "serverGame/FirstServerGame.h"
#include "serverGame/ServerShipTargeting.h"
#include "serverGame/Pvp.h"
#include "serverGame/ServerSharedObjectTemplateInterface.h"
#include "serverGame/ServerObject.h"
#include "serverGame/TangibleObject.h"
#include <vector>
//=================================================... | WEB | 0.880177 | 6.155535 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.