uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
d172d1cb-cfc9-4e3f-8c63-06bb3f981f10 | ishandutta2007/codeforces | fruwajacybyk/normal/1137/B.cpp | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define all(v) (v).begin(),(v).end()
#define PII pair<int,int>
#define mp make_pair
#define st... | ALGO | 0.999998 | 3.180254 |
21800cfd-5737-4d35-8f94-1f9a1956d8dd | poojaullegaddi/DSA | nearest_integer.cpp | /* Nearest Integer:
Int nearestInteger(int num, int m)
The function accepts two positive 'num' and 'm' as its argument. Implement the
following function to find the nearest integer to num.
1) Number is divisible by m.
2) Number is nearest to 'num' (Have the least distance from num)
Note: if there are two numbers with... | ALGO | 0.999929 | 3.74507 |
09cefdd7-5d30-471b-b570-3cdf4fb1111d | s1204IT/CT1_Source | webkit/Source/WebCore/platform/graphics/qt/PathQt.cpp | #include "config.h"
#include "Path.h"
#include "AffineTransform.h"
#include "FloatRect.h"
#include "GraphicsContext.h"
#include "ImageBuffer.h"
#include "PlatformString.h"
#include "StrokeStyleApplier.h"
#include <QPainterPath>
#include <QTransform>
#include <QString>
#include <wtf/MathExtras.h>
#include <wtf/OwnPtr.h... | TOOL | 0.863606 | 7.604631 |
395966f3-024d-4e77-885f-5c5ec43d5eec | dhruvjoshi137/Data_Structures_Algorithms | Lecture8/ClearKthBit2.cpp | #include<iostream>
using namespace std;
int main(){
int n=42;
int k =3;
int mask = ~(1<<k);
cout<<(n&mask)<<endl;
return 0;
} | ALGO | 0.998993 | 3.585381 |
7f457b14-435e-477a-9a33-75595e3ea915 | keiranberry/csc_372_analysis_of_algorithms | SortingCPPRefresher/SortingCPPRefresher/SortingCPPRefresher.cpp | #include "SortingCPPRefresher.h"
int main(int argc, char** argv)
{
string test = argv[1];
if (strcmp(argv[1], "t") == 0)
{
runWithTests();
}
else
{
runWithoutTests(argc, argv);
}
return 0;
}
void runWithTests()
{
kWithTime bestK;
bestK.time = 100;
ofstre... | ALGO | 0.976095 | 5.501845 |
819669b4-7212-40be-b710-975188f2a33b | thisisyourfahi/CodeForces-Solutions | Difficulty 800/1996B.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
void solve() {
int n, k; cin >> n >> k;
vector<vector<char>> oldGrid(n, vector<char>(n));
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
cin >> oldGrid[i][j];
}
}
int d = n / k;
vector... | ALGO | 0.99988 | 4.819581 |
9af648e7-5c4a-49ec-96a4-25f8e8fcef38 | hanael80/CppParser | HyCppParser.cpp |
#include "PCH.h"
#include <stdio.h>
#pragma warning(disable:4996)
#include "HyCppParser.h"
#include "HyCppParserConsts.h"
#include "HyCppPreprocessor.h"
#include <set>
#include <vector>
//#define USE_ORIGINAL_VALUE
void Class::GetVirtualFunctions( const ParsingResult& parsingResult, std::map< std::string, const Clas... | TOOL | 0.903977 | 3.212166 |
2adf2634-0023-4a30-90dd-49ce07efdddd | S-Popy/XPSC_phitron | week-10/balance_easy_version.cpp | // problem Link:
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int q; cin >> q;
map<ll,ll>mp;
set<ll>s;
while (q--) {
char ch;
ll x;
cin >> ch >> x;
if (ch == '+') {
... | ALGO | 0.999879 | 5.149081 |
8fe6cb09-65b8-4967-bef1-e16216619d80 | manoharbhat/fastPlannerUAV | PX4-Autopilot/src/lib/ecl/EKF/python/ekf_derivation/generated/yaw_estimator_covariance_prediction_generated.cpp | // Equations for covariance matrix prediction
const float S0 = cosf(psi);
const float S1 = powf(S0, 2);
const float S2 = sinf(psi);
const float S3 = powf(S2, 2);
const float S4 = S0*dvy + S2*dvx;
const float S5 = P(0,2) - P(2,2)*S4;
const float S6 = S0*dvx - S2*dvy;
const float S7 = S0*S2;
const float S8 = P(0,1) + S7*... | ALGO | 0.999284 | 3.376163 |
d6bfd61e-6851-4957-abbb-dee2e5bfc899 | yakuri354/cp | mosh/2023/2023_ans/A1/check.cpp | #include "testlib.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <string>
#include <set>
using namespace std;
int main(int argc, char* argv[]) {
registerTestlibCmd(argc, argv);
int t;
t = inf.readInt();
int score = 0;
for (int testcase = 0; testcase < t; ++testcase) {
... | ALGO | 0.930437 | 3.258433 |
c5d033e9-f7b9-4092-a230-d657bfec8936 | Aryan150304/DSA-codes- | Leetcode-Array/Array intersection.cpp | /* Code Ninjas problem solution of finding intersection among two arrays
Link of the problem - https://www.codingninjas.com/codestudio/problems/intersection-of-2-arrays_1082149
Solution - */
#include <bits/stdc++.h>
vector<int> findArrayIntersection(vector<int> &arr1, int n, vector<int> &arr2, int m)
{
vector<in... | ALGO | 0.999975 | 5.328728 |
37b0a0af-8807-41e3-b09b-d01be621736f | SysCall97/My-Codeforces-solutions | A. Paint the Numbers.cpp | /***************************************************************
* Name: KAZI NUR ALAM MASHRY *
* School: MAWLANA BHASHANI SCIENCE & TECHNOLOGY UNIVERSITY *
* CSE (14TH BATCH) *
***********************************************************... | ALGO | 0.999983 | 3.64457 |
6defe504-0fea-4425-9d58-ffde7f88646b | sanket0708/SdeSheet | Largest Element in Array - GFG/largest-element-in-array.cpp | //{ Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function Template for C++
class Solution
{
public:
int largest(vector<int> &arr, int n)
{
int maxi = INT_MIN;
for(auto x:arr)
{
if(x>maxi)
... | ALGO | 0.999773 | 6.198948 |
8f52f506-514b-4a66-8489-bdbc5c68c228 | Next-Gen-UI/Hacktober | Leetcode/0045. Jump Game II/0045.cpp | class Solution {
public:
int jump(vector<int>& nums) {
int ans = 0;
int end = 0;
int farthest = 0;
for (int i = 0; i < nums.size() - 1; ++i) {
farthest = max(farthest, i + nums[i]);
if (farthest >= nums.size() - 1) {
++ans;
break;
}
if (i == end) {
++a... | ALGO | 0.999995 | 6.472897 |
8a7d0b2c-dba0-4a72-bddb-aa0b2ac160d1 | nqdat2002/C_Plus_Plus | Mycode/uoc so nguyen to.cpp | #include <bits/stdc++.h>
using namespace std;
#define ms(s,n) memset(s, n, sizeof(s))
#define present(t, x) (t.find(x) != t.end())
typedef long long ll;
const ll mod = 1e9 + 7;
// Author: Nguyen Quoc Dat
// Code: B20DCPT053
// Organization: PTIT
// Date:
// Program:
// ------------------- Your code STARTS here !!!---... | ALGO | 0.999954 | 4.654308 |
094f992d-f5f9-430f-a5be-933bd71be80b | RomanBapst/PX4_mavros | fw_att_controller/include/fw_att_controller/eigen/doc/examples/TutorialLinAlgComputeTwice.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix2f A, b;
LLT<Matrix2f> llt;
A << 2, -1, -1, 3;
b << 1, 2, 3, 1;
cout << "Here is the matrix A:\n" << A << endl;
cout << "Here is the right hand side b:\n" << b << endl;
cout << "Computing LLT... | ALGO | 0.999957 | 3.145425 |
4695ba17-97b1-4c01-ac3f-ffde15cbc5c5 | Distrotech/opencore-amr | opencore/codecs_v2/audio/gsm_amr/amr_wb/dec/src/preemph_amrwb_dec.cpp | /*
------------------------------------------------------------------------------
Filename: preemph_amrwb_dec.cpp
------------------------------------------------------------------------------
INPUT AND OUTPUT DEFINITIONS
int16 x[], (i/o) : input signal overwritten by the output
int16 mu, ... | ALGO | 0.999683 | 5.531135 |
21fc3194-1e24-4654-857a-d9871f921ee8 | PacificCommunity/seapodym-codebase | src/seasonal_switch.cpp | #include "VarSimtunaFunc.h"
///Forward functions for:
///computing the seasonal switch function used to switch between habitats.
double daylength_comp(double lat, double jday, double pi);
double daylength_twilight(double lat, double jday, double pi);
double tetafunc(double arg, const double teta);
void VarSimtunaFun... | ALGO | 0.987505 | 5.575195 |
e85a81e7-0a20-4faf-a5ba-e61a8ad1170d | darwin/boost | libs/msm/doc/PDF/examples/ParsingDigits.cpp | #define FUSION_MAX_VECTOR_SIZE 20
#include <boost/msm/back/state_machine.hpp>
#include "char_event_dispatcher.hpp"
#include <boost/msm/front/state_machine_def.hpp>
#include <boost/msm/front/functor_row.hpp>
#include <boost/timer.hpp>
namespace msm = boost::msm;
namespace mpl = boost::mpl;
using namespace msm::front;
... | ALGO | 0.883335 | 4.800799 |
f2defc90-926e-4078-847f-42228640745b | shinosnipe/csapp-work | homework/chp2/2.81.cpp | #include "gtest/gtest.h"
#include "../include/clib.h"
// 设默认类型为int,w是int的位长
int answer_2_81_1(int k)
{
return 1 << k;
}
int answer_2_81_2(int j, int k)
{
return ((1 << j) - 1) << k;
}
int main()
{
print2bit(answer_2_81_1(10));
print2bit(answer_2_81_1(20));
print2bit(answer_2_81_1(17));
print2bit(answer_2_81_2(... | TEST | 0.928426 | 4.506232 |
98646328-7a3d-436f-89e6-21e604be3cdd | Yusaku-Nakanose/competitive_programming | AtCoder/ABC/373/e.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
long long k;
cin >> n >> m >> k;
vector<long long> a(n), b(n);
for(int i=0; i<n; i++) cin >> a[i];
long long rest = k;
for(int i=0; i<n; i++) rest-=a[i];
for(int i=0; i<n; i++) b[i] =... | ALGO | 0.99996 | 3.794515 |
e680d20c-10ef-4f89-8b8a-efe3cfd651a2 | we-are-kicking-lhx/xinxinalgorithm | T014. Longest Common Prefix.cpp | class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
int size = strs.size();
if(!size) return "";
if(size == 1) return strs[0];
int index = 0,flag = 0;
while (1) {
for (int i = 1; i < strs.size(); i++) {
int len = strs[i].len... | ALGO | 0.999912 | 5.683747 |
69fd017b-8c2b-45a9-9bed-78fea54562d3 | luobuyu/Code-test-daily | leetcode/daily/1015_2.cpp | class Solution
{
public:
int smallestRepunitDivByK(int k)
{
if (k % 2 == 0)
return -1;
int tmp = 1, ans = 0;
for (int i = 0; i < k; ++i)
{
ans = (ans + tmp) % k;
tmp = tmp * 10 % k;
if (ans == 0)
return i + 1;
... | ALGO | 0.999827 | 5.373727 |
3d1e5303-755e-452a-976f-1398b8d430bc | prakhar290/topicwise-c-plus-plus-programs | jumping statement in loops/continue.cpp | #include<iostream>
using namespace std;
int main()
{
int num;
cout<<"enter the number to where you want to print odd numbers: ";
cin>>num;
for(int i=0;i<num;i++)
{
if(i%2==0)
continue;
cout<<i<<" ";
}
//continue statement is used to leave a step and go ahead for the f... | ALGO | 0.99793 | 3.29192 |
77e9b7a6-c60c-4200-a4ee-d09cc886340f | abhisheksaran/Competitive-Programming | leetCode/DP/343.cpp |
class Solution {
public:
int integerBreak(int n) {
vector<int> dp(n+1,1);
for(int i=2;i<=n;i++){
//base case
if(i!=n) dp[i] = i;
for(int j=1;j<=i/2;j++){
dp[i] = max(dp[i], dp[j]*dp[i-j]);
//cout<<i<<" "<<dp[i]<<"\n";
... | ALGO | 0.999996 | 5.776185 |
4b715c9d-296d-4046-9ead-1ca501a2c2fd | ketan-suthar/Algorithms | Dynamic Programming/Intermidate/01_Knapsack/Memoization.cpp | #include <bits/stdc++.h>
using namespace std;
#define SIZE 1000
long int dpTable[SIZE+1][SIZE+1];
void print(int n, int w)
{
cout <<"\ndpTable: \n";
for(int i =0; i<=n; i++)
{
for(int j=0; j<=w; j++)
cout << dpTable[i][j] << " ";
cout << "\n";
}
}
long int fun(int values[]... | ALGO | 0.999992 | 4.25422 |
216ae2a8-1eec-4127-885a-d5443aff1c2e | feassis/Custom-Unreal-Engine-4.25.4 | Engine/Source/ThirdParty/PhysX3/PhysX_3.4/Source/LowLevelParticles/src/PtCollisionSphere.cpp | #include "PtCollisionMethods.h"
#if PX_USE_PARTICLE_SYSTEM_API
using namespace physx;
using namespace Pt;
namespace
{
void collideWithSphereNonContinuous(ParticleCollData& collData, const PxVec3& pos, const PxReal& radius,
const PxReal& proxRadius)
{
if(collData.localFlags & Part... | ALGO | 0.980322 | 6.959428 |
a40083f2-764c-4223-887b-74c6172b81c7 | hnjog/Algorithm | 프로그래머스/0/181919. 콜라츠 수열 만들기/콜라츠 수열 만들기.cpp | #include <string>
#include <vector>
using namespace std;
vector<int> solution(int n) {
vector<int> answer;
while(n != 1)
{
answer.push_back(n);
if(n%2 == 0)
n/=2;
else
n = n * 3 + 1;
}
answer.push_back(n);
return answer;
} | ALGO | 0.999944 | 5.703459 |
e886e07d-c4eb-44c8-9af4-e5f58082a6d9 | mlab-upenn/GrooveNet | project/src/AdaptiveCommModel.cpp | #include "AdaptiveCommModel.h"
#include "CarRegistry.h"
#include "InfrastructureNodeRegistry.h"
#include "StringHelp.h"
#include "Simulator.h"
#define ADAPTIVECOMMMODEL_FIRSTRBXJITTER_PARAM "FIRSTRBXJITTER"
#define ADAPTIVECOMMMODEL_FIRSTRBXJITTER_PARAM_DEFAULT "500u"
#define ADAPTIVECOMMMODEL_FIRSTRBXJITTER_PARAM_DES... | TOOL | 0.979431 | 5.062934 |
f59086ea-e321-4412-9785-fd7e1e7bec1b | oybek/competitive-programming | codeforces/496A.cpp |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include... | ALGO | 0.999822 | 3.815976 |
4039b41c-68a8-4ad0-979e-4917664ec832 | Aniket-1100/codeforces | sheet1/j.cpp | #include <iostream>
using namespace std;
int main(){
long long a,b;
cin>>a>>b;
if(b%a==0 || a%b==0){
cout<<"Multiples"<<endl;
}else{
cout<<"No Multiples"<<endl;
}
} | ALGO | 0.999928 | 4.158894 |
1a5581a0-2a07-4bf9-9ef8-90b9bae33217 | andrew-lonl/solarSystem | solarsystem.cpp | #include "solarsystem.hpp"
#define REST 700
#define REST_Z (REST)
#define REST_Y (-REST)
void SolarSystem::onDisplay()
{
glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
glClearColor(0.7f, 0.7f, 0.7f, 0.1f);
glMatrixMode(GL_PROJECTION);
glLoadIdentity();
gluPerspective(75.0f, 1.0f, 1.0f, 40000... | TOOL | 0.856438 | 4.377724 |
3bff292f-d416-4b96-a4c7-710266af2732 | abdelhalim-abulmagd/ProgrammingAdvices | 05 - Algorithms & Problem-Solving Level 2/Problems/Solutions/Problem #22.cpp |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int ReadNumber(const string& Msg)
{
int Number;
cout << Msg;
cin >> Number;
return Number;
}
void FillArray(int Array[], int Length)
{
for (size_t i = 0; i < Length; i++)
{
Array[i] = ReadNumber("Enter Numbe... | ALGO | 0.995909 | 4.790294 |
92d72815-d136-40a1-8f76-c787500daf48 | saikatcodec/CP | Codeforces/A_Password.cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define nl "\n"
#define ll long long
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define p... | ALGO | 0.999025 | 5.425421 |
90dcbfec-3e1b-4321-9b62-1a2e2d0ea120 | ishandutta2007/codeforces | jklepec/normal/1117/F.cpp | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
#define pb push_back
#define fi first
#define se second
typedef double lf;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
int add(int x, int y) {... | ALGO | 0.999936 | 3.591082 |
dc83ce27-0e17-4297-a09e-25b1d6e47670 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_12219_4.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[1001];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int chest = 0, bices = 0, back = 0;
for (int i = 0; i < n; i++) {
if (i % 3 == 0) {
chest += arr[i];
} else if (i % 3 == 1) {
bices += arr[i];
... | ALGO | 0.999751 | 4.128636 |
a6275fd6-9a2e-43a6-b13e-0649b861e464 | Nikhilsaini2204/Dsa-Questions | 1877-minimize-maximum-pair-sum-in-array/1877-minimize-maximum-pair-sum-in-array.cpp | class Solution {
public:
int minPairSum(vector<int>& nums) {
vector<int>result;
sort(nums.begin(),nums.end());
int i=0,j=nums.size()-1;
while(i<j){
result.push_back(nums[i]+nums[j]);
i++,j--;
}
int maxi = *max_element(result.begin(),result.end(... | ALGO | 0.999981 | 5.798618 |
6df2fa2a-ea27-4b9e-a27d-037a2ff4762f | Tamim-saad/CSES-problem-set-solutions | Digit Queries.cpp | // say Alhamdulillah
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | ALGO | 0.999891 | 4.570913 |
c15f774f-ef51-4797-a9f2-923d1f13ade1 | rmcs9/AdventOfCode2023 | Days/Day2/day2.cpp | using namespace std;
#include "day2.h"
#include <string>
#include <fstream>
#include <iostream>
int day2::possibleGames(std::string filepath) {
ifstream data(filepath);
string currentline;
int total = 0;
while(getline(data, currentline)){
string::iterator line = currentline.begin();
/... | ALGO | 0.927524 | 4.740022 |
47eb5c74-2a72-4600-9b4b-aa522790b188 | SamIam9640/codetree-TILs | 240321/되돌아오기/come-back.cpp | #include <bits/stdc++.h>
#define Dir_num 4
using namespace std;
int n,x,y;
int dx[Dir_num]={1,-1,0,0};
int dy[Dir_num]={0,0,-1,1};
int ans=-1;
int elapsed_time;
bool Move(int dir,int dist){
while(dist--) {
x+=dx[dir];
y+=dy[dir];
elapsed_time++;
if(x==0&&y==0){
an... | ALGO | 0.999868 | 3.42243 |
a92c2993-2ecb-4105-ad0a-b8cef81a002d | Ismail-Upal/CP-Trash | Solved Problem/C_Inhabitant_of_the_Deep_Sea.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int t;cin>>t;
while(t--){
int n,k;
cin>>n>>k;;
list<int>a(n);
for(int i=1;i<=n;i++){
int x;cin>>x;
a.push_back(x);
}
cout<<a.front()<<a.back();
int c=0;
... | ALGO | 0.999969 | 3.159246 |
d11cd4a8-6778-4e85-96e0-8980e3d96b95 | Tamimkhan7/CP-Course | Phase 1/class seven/Different Array/difference array and queries.cpp | #include <bits/stdc++.h>
using namespace std;
#define MTK \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define mem(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(), (x).end()
#define ll int long long
#define mod 1000000007
const int N = 1e6 + ... | ALGO | 0.999893 | 4.472911 |
c5a163ff-fcbc-474c-9262-1b84a71093f1 | heavenMOJANG/ICPC | .history/programmes_C_Cpp/HDU/2025“钉耙编程”中国大学生算法设计春季联赛（5）/1010_20250404191748.cpp | #pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int INF = 0x7fffffff;
void solve() {
int n; cin >> n;
vector<pair<int, int>> g[n + 1];
for (int i = 1; i < n; ++ i) {
int u, v, w; ... | ALGO | 0.999905 | 5.170593 |
f7f140f8-ff04-4f2a-a599-634728844836 | rk3288-dev/android_external_skia | src/core/SkMipMap.cpp | #include "SkMipMap.h"
#include "SkBitmap.h"
#include "SkColorPriv.h"
static void downsampleby2_proc32(SkBitmap* dst, int x, int y,
const SkBitmap& src) {
x <<= 1;
y <<= 1;
const SkPMColor* p = src.getAddr32(x, y);
const SkPMColor* baseP = p;
SkPMColor c, ag, rb;
... | TOOL | 0.963445 | 5.813989 |
1a800960-88b1-45ad-837f-44ea0b5c0076 | Soyab-Aktar/DSA-Supreme-2.0 | 4 Searching(Binery)/Level 1/MissingElement.cpp | // Find missing element
#include <iostream>
#include <vector>
using namespace std;
int missing(vector<int> &arr, int size)
{
int start = 0;
int end = size - 1;
int mid = start + (end - start) / 2;
int ans = -1;
while (start <= end)
{
int diff = arr[mid] - mid;
if (diff == 1)
... | ALGO | 0.999214 | 4.767571 |
ce71836a-3c90-4c8c-8c34-b1eb0af143c0 | PawanJaiswal08/Striver-SDE-Sheet | 27.Return-Subsets-Sum-to-K.cpp | #include<bits/stdc++.h>
using namespace std;
void solve(vector<int> arr, int k, int index, vector<int> &temp, vector<vector<int>> &ans){
if(index == arr.size()){
int sum = 0;
for(int i=0; i<temp.size(); i++){
sum = sum + temp[i];
}
if(sum == k){
ans.push_back... | ALGO | 0.99997 | 4.8067 |
130ade6b-640d-440c-9e2c-d988628784f3 | NividhSingh/LeetCode | 62/62.cpp | class Solution {
public:
int uniquePaths(int m, int n) {
vector<int> row(n);
for (int i = 0; i < n; i++) {
row[i] = 1;
}
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
row[j] += row[j - 1];
}
}
return ro... | ALGO | 0.999918 | 6.743668 |
42fd9b3d-ce67-47f0-b6d9-766d54cfc399 | dpritchLibre/comp633_parallel_programming | exer_1a/utest_calc_bodies.cpp | #include <stddef.h>
#include "cppunit/ui/text/TestRunner.h"
#include "cppunit/extensions/HelperMacros.h"
// declare vector struct and all-pair body sim fcn -----------------------------
struct vec_2d {
double x1;
double x2;
};
extern "C" void calc_bodies(struct vec_2d *r,
struct vec_2d *v,
cons... | TEST | 0.957254 | 6.561569 |
2444bb54-84d8-4f6b-852d-5ce37eef23e4 | FacerAin/Algorithm-Study | Baekjoon/Basic IO/2675/2675.cpp | //2675번 문자열반복
#include <iostream>
#include <string>
using namespace std;
int main(){
int T,R,len;
string S;
cin >> T;
while(T--){
cin >> R >> S;
int len = S.size();
for(int i=0;i<len;i++){
for(int j=0;j<R;j++){
cout << S[i];
}
... | ALGO | 0.999772 | 3.588765 |
5f46495a-c217-472d-b6ea-5376d03228b0 | medsi2/MIV | src/sync.cpp | #include "sync.h"
#include "util.h"
#include <boost/foreach.hpp>
#ifdef DEBUG_LOCKCONTENTION
void PrintLockContention(const char* pszName, const char* pszFile, int nLine)
{
printf("LOCKCONTENTION: %s\n", pszName);
printf("Locker: %s:%d\n", pszFile, nLine);
}
#endif /* DEBUG_LOCKCONTENTION */
#ifdef DEBUG_LOC... | TOOL | 0.97413 | 5.7469 |
eb6c940d-d413-4e4f-a979-ef405b3d0d31 | Surbhi-Jain-02/Programming | Greedy/Reversing Elements of queue.cpp | // Input 1:
// A = [1, 2, 3, 4, 5]
// B = 3
// Input 2:
// A = [5, 17, 100, 11]
// B = 2
// Example Output
// Output 1:
// [3, 2, 1, 4, 5]
// Output 2:
// [17, 5, 100, 11]
vector<int> Solution::solve(vector<int> &A, int B) {
queue<int> q;
int i;
for(i=B-1;i>=0;i--){
q.push(A[i]);
}
... | ALGO | 0.999992 | 4.621732 |
ffdd4abe-3aa4-416f-841b-ee543d3b0d28 | syg/gecko | embedding/components/commandhandler/nsCommandGroup.cpp | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
#include "nsString.h"
#include "nsReadableUtils.h"
#include "nsTArray.h"
#include "nsISimpleEnumerator.h"
#include "nsXPCOM.h"
#include "nsSupportsPrimitives.h"
#include "nsIComponentManager.h"
#include "nsCommandGroup.h"
#include "nsICont... | TOOL | 0.87006 | 7.057967 |
91d6605e-5b79-403a-9a66-5578aa06f458 | humuraelvin/C- | Factorial/Factorial.cpp | #include <iostream>
using namespace std;
int printFactorial(int n){
if (n == 0 || n == 1)
{
return 1;
}else
{
return n * printFactorial(n - 1);
}
}
int main(){
cout <<"Result: "<<printFactorial(10)<<endl;
} | ALGO | 0.999634 | 4.720409 |
cbb091e3-ea3a-49ab-b722-bd4393e4174c | meyer-d3v/Projects | C++/Revision.cpp | #include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
cout << "Dean Meyer" << endl;
cout << "Now you got to guess the correct number\n";
int iNum = rand() % 50;
int iAns;
int iTries = 0;
do {
cin >> iAns;
if (iAns > iNum) {
cout << "The number you have guessed is too high\n";
... | TOOL | 0.992564 | 3.461125 |
ee4c0771-eecd-4a25-b250-fea361c2a204 | jsren/llvm-detex | libcxx/test/std/containers/sequences/vector/vector.modifiers/emplace.pass.cpp | // UNSUPPORTED: c++03
// <vector>
// template <class... Args> iterator emplace(const_iterator pos, Args&&... args);
#include <vector>
#include <cassert>
#include "test_macros.h"
#include "test_allocator.h"
#include "min_allocator.h"
#include "asan_testing.h"
class A
{
int i_;
double d_;
A(const A&);
... | TEST | 0.963969 | 5.958981 |
51598774-58be-4c4e-888f-24d3236504fd | priya-singh07/6Companies30Days | MileStone5/03.cpp | // https://practice.geeksforgeeks.org/problems/find-the-missing-no-in-string/1/
int convert_num(string s)
{
int x=0;
for(int i=0;i<s.size();i++)
x=x*10+(s[i]-'0');
return x;
}
int missingNumber(const string& s)
{
int n=s.size();
for(int len=1;len<=6;len++)
{
string temp="";
... | ALGO | 0.998421 | 5.236461 |
311c7941-2901-4c07-b742-4210534fd124 | YukiTheKilla/supercomputers | MPI/build.cpp | #include <cstdlib> // Для system()
#include <sstream> // Для std::ostringstream
#include <iostream>
/* Я курю бамбук */
int ex1(){
const int min = 1; // Минимальное количество узлов
const int max = 8; // Максимальное количество узлов
const int k = 8;
std::cout << "Task 1. MinMax" << "\n";
for (... | TOOL | 0.921038 | 3.328806 |
94356ae6-55fc-4f0b-8f47-931075d4f6a9 | arpit-srma/leetcode | 1009-complement-of-base-10-integer/1009-complement-of-base-10-integer.cpp | class Solution {
public:
int bitwiseComplement(int n) {
int m=n;
int mask=0;
if(n==0)
return 1;
while(m!=0)
{
mask=(mask << 1) | 1;
m=m>>1;
}
int ans=(~n)& mask;
return ans;
}
}; | ALGO | 0.999971 | 6.135558 |
14b3b63e-4aea-4298-8c73-9109f2c63833 | devryyeong/problem-solving | CodeUp/1080.cpp | #include <iostream>
using namespace std;
int main() {
int n, i;
int sum = 0;
cin >> n;
for (i = 0; ; i++) {
sum += i;
if (sum >= n) {
break;
}
}
cout << i << endl;
return 0;
} | ALGO | 0.999956 | 3.814187 |
f5fc4b4f-72ca-4885-8c4c-cf9aec706aa6 | seunghye218/problem-solving | 프로그래머스/3/12971. 스티커 모으기（2）/스티커 모으기（2）.cpp | #include <vector>
#include <algorithm>
using namespace std;
int dp(const int &start, vector<int> dp) {
int len = dp.size(), i = 1;
// 시작 인덱스에 따른 초기화
if (start) ++i;
else --len;
dp[i] = max(dp[i], dp[i - 1]);
++i;
for (; i < len; ++i)
dp[i] = max(dp[i-1], dp[i-2] + dp[i]);
return m... | ALGO | 0.99719 | 4.855587 |
15240fc9-ab3b-4db7-b1a6-668c75096f9b | akashiitj/dsaprogram | dp/hearth/dup.cpp |
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <iterator>
#define MOD ... | ALGO | 0.999722 | 4.047995 |
02d49b52-c0bc-485e-9f36-fa0bd433832a | Mohit-Alive/DSA-Repo | Part-007/66-Prata-Spoj.cpp | #include<iostream>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
// PRATA SPOJ
bool ispossiSol(vector<int>cooksRanks,int np,int mid){
int currP=0; //initial coooked parta count
for(int i=0;i<cooksRanks.size();i++){
int r=cooksRanks[i],j=1;
int timeTaken=0;
while(true){... | ALGO | 0.999933 | 4.794086 |
4453f98b-dee0-40df-9df4-27a37360cd9f | proghead00/Interview-Competitive-Cpp | Hashing - Tries Challenges/stringWindow.cpp | #include <iostream>
#include <climits>
#include <string>
using namespace std;
string window(string s1, string s2) {
// corner case
if (s2.length() > s1.length())
return "No String";
// freq arrays
int fs1[256] = {0};
int fs2[256] = {0};
for (int i = 0; i < s2.length(); i++)
{
char ch = s2[i];
fs2[ch]++... | ALGO | 0.999946 | 4.728251 |
41625bba-6193-496f-9edc-591607435f74 | shaknoah/socket_prpgramming | concurrent_fork+thread/serverthread.cpp | /* A simple server in the internet domain using TCP
The port number is passed as an argument */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <unistd.h>
#include <pthread.h>
#define ull unsigned long long int
int n;
char ... | WEB | 0.855238 | 3.686307 |
146a5653-a076-4f41-ad5c-834e9df6f530 | Gnaroshi/practice-algorithm-solvedac | With_Levels/Bronze/Bronze_4/5300.cpp | // problem: Fill the Rowboats!
// id: 5300
// time taken:
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
cout << i << ' ';
if (i % 6 == 0 || i == n)
cout <<... | ALGO | 0.996977 | 3.909419 |
a827d602-a45e-42de-b1ca-384a8e6ca077 | pantq1711/CPP_CodePTIT | CPP0337.cpp | #include<bits/stdc++.h>
using namespace std;
void solve(string n){
map <char, int> mp;
for(char x : n) mp[x]++;
int r = 1e6, l = 0, cnt = 0;
int dem[256];
memset(dem, 0, sizeof(dem));
for(int i=0; i<n.length(); ++i){
dem[n[i]]++;
if(dem[n[i]] == 1) cnt++;
if(cnt == mp.size()){
while(dem[n[l]] > 1){
d... | ALGO | 0.999928 | 5.063768 |
e5b43750-92c7-4cef-9abb-4639dd45cbcf | tigercosmos/labkit | Source/WebCore/platform/mediastream/MediaConstraints.cpp | #include "config.h"
#include "MediaConstraints.h"
#if ENABLE(MEDIA_STREAM)
#include "RealtimeMediaSourceCenter.h"
#include "RealtimeMediaSourceSupportedConstraints.h"
#include <wtf/StdLibExtras.h>
namespace WebCore {
const String& StringConstraint::find(const WTF::Function<bool(const String&)>& filter) const
{
f... | TOOL | 0.935566 | 6.634159 |
95c2137a-ec94-4314-ad68-063156e92320 | akshay931/A2A | Array/2sum.cpp | // Do code everyday and Achieve Your target
#include <bits/stdc++.h>
using namespace std;
// Custom Defination
#define vvi vector<vector<int>>
#define vi vector<int>
//--------------------------------------------
pair<int, int> findSum(vi &val, int n)
{
unordered_map<int, int> map;
for (int i = 0; i < val.siz... | ALGO | 0.999907 | 4.641604 |
424bf110-17f3-4db8-90af-161f0fb69b31 | wethura/learn | algorithm/max-sum-of-rectangle-no-larger-than-k.cpp | #include<bits/stdc++.h>
#include "time.h"
#include "logger.h"
using namespace std;
/**
* coding here
*/
class Solution {
public:
int maxSumSubmatrix(vector<vector<int>>& matrix, int expect) {
int n = matrix.size(), m = matrix[0].size(), ret = -1000000;
for (int i = 0; i < n; i++) {
ve... | ALGO | 0.999957 | 5.832084 |
c1ff2c1c-1cf5-4186-87fd-182a8fa0aa7a | Nikhil562/DSAinCPP | 1372-longest-zigzag-path-in-a-binary-tree/1372-longest-zigzag-path-in-a-binary-tree.cpp | class Solution {
public:
int ans=0; //store final answer
void helper(TreeNode *root,int flag,int nodes){ //flag is condition for 0 and 1 and nodes stores path information
if(root==NULL) return; //base case
ans=max(ans,nodes);
if(flag){
... | ALGO | 0.999981 | 5.487632 |
70855467-f668-44d5-8761-9945e83f1f89 | mathialakan/fr- | mmm-test/hip/mmm.cpp | #include <iostream>
#include <vector>
#include <ctime>
#include <cstdlib>
#include <chrono>
#include "../../fraction/fr.h"
#include <unordered_map>
#include<hip/hip_runtime.h>
#include<hip/hip_runtime_api.h>
#if defined(X86)
#include <immintrin.h>
#endif
#if defined(OMP)
#include <omp>
#elif defined(OMP_OL)
#define t... | ALGO | 0.978862 | 3.863156 |
66f61c75-9ded-4e80-b064-7b08f479bb23 | zhyack/LeetCode | 215.cpp | class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
int n = nums.size();
nth_element(nums.begin(), nums.begin()+n-k, nums.end());
return nums[n-k];
}
}; | ALGO | 0.999959 | 5.378931 |
4cb7627d-5467-4355-b80b-f5ae999b0e60 | Pranav-Rustagi/Problem-Solving | Find k-th smallest element in given n ranges - GFG/find-kth-smallest-element-in-given-n-ranges.cpp | //{ Driver Code Starts
/* Driver program to test above function */
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function Template for C++
class Solution{
public:
vector<int>kthSmallestNum(int n, vector<vector<int>>&range, int q, vector<int>queries){
sort(range.begin(), ra... | ALGO | 0.999835 | 5.673001 |
53760c68-2ae0-4822-b2ab-6943053b7648 | FelixYuan-YF/step2_megasam | base/thirdparty/lietorch/eigen/unsupported/doc/examples/BVH_Example.cpp | #include <Eigen/StdVector>
#include <unsupported/Eigen/BVH>
#include <iostream>
using namespace Eigen;
typedef AlignedBox<double, 2> Box2d;
namespace Eigen {
Box2d bounding_box(const Vector2d &v) { return Box2d(v, v); } //compute the bounding box of a single point
}
struct PointPointMinimizer //how to compute squa... | ALGO | 0.999901 | 6.502348 |
4e5fea4c-13b5-402d-a426-1aa80bd6b0a2 | eclipse-sumo/sumo | src/microsim/MSLink.cpp | /****************************************************************************/
/****************************************************************************/
/// @file MSLink.cpp
/// @author Daniel Krajzewicz
/// @author Jakob Erdmann
/// @author Michael Behrisch
/// @author Laura Bieker
/// @date Sept 2002
/... | TOOL | 0.978783 | 4.440736 |
89a98ccc-208f-4840-b0ed-bbb57e092bc1 | sommerlukas/llvm-offload-jetson | libcxx/test/std/containers/sequences/vector/vector.modifiers/emplace.pass.cpp | // UNSUPPORTED: c++98, c++03
// <vector>
// template <class... Args> iterator emplace(const_iterator pos, Args&&... args);
#include <vector>
#include <cassert>
#include "test_macros.h"
#include "test_allocator.h"
#include "min_allocator.h"
#include "asan_testing.h"
class A
{
int i_;
double d_;
A(const... | TEST | 0.965208 | 6.058201 |
d5985a1c-9c4c-4368-8a09-a8e2af4597f1 | PaukIsUha/optimizing_formating_code | predictions/submissions-aizu-gpt35/Codenet/p00609/273981582/response_8.cpp | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#def... | ALGO | 0.99965 | 4.061219 |
71d3afb5-7b03-481b-a944-690dc9245261 | koosaga/olympiad | KOI/tst25_safezone.cpp | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define cr(v, n) (v).clear(), (v).resize(n);
using namespace std;
using lint = long long;
using pi = array<int, 2>;
struct disj {
vector<int> pa;
void init(int n) {
pa.clear();
pa.resize(n);
iota(all(pa), 0);
}
int... | ALGO | 0.99982 | 4.521409 |
79597f8e-ba5d-43d0-b94f-bd61fa7c5330 | suankun/cpp_snippets | Codewars/7kyu/10.Pair, map, set, tuple/Construct a bit vector set.cpp | // https://www.codewars.com/kata/52f5424d0531259cfc000d04/train/cpp
#include <vector>
#include <cmath>
#include <set>
int sort_by_bit(const std::vector<int>& array) {
std::set<int> unique;
int sum = 0;
for (const int & n : array) {
if (unique.find(n) != unique.end())
continue;
... | ALGO | 0.999818 | 5.872468 |
7273ade3-1c1f-4aa8-9407-ed0b63fb4024 | HuzaifaBinHabib/LeetCode | 0125-valid-palindrome/0125-valid-palindrome.cpp | class Solution {
public:
bool isPalindrome(string a) {
int lp = 0;
int rp = a.length() - 1;
while (lp <= rp) {
if (!isalnum(a[lp])) {
lp++;
continue;
}
if (!isalnum(a[rp])) {
rp--;
continue;
... | ALGO | 0.999397 | 6.041458 |
db877073-0958-4d6b-af72-2688516c597d | S-u-m-e-e-t-1/CPP | Fibonacci cpp.cpp | #include<iostream>
using namespace std;
#include <iostream>
int main() {
int n;
cout << "Enter the number of terms in the Fibonacci series: ";
cin >> n;
int x = 0, y = 1;
cout << "Fibonacci series up to " << n << " terms:\n";
cout << x << " " << y << " ";
for (int i = 3... | ALGO | 0.999977 | 4.592709 |
c1e4f8a9-375b-4c02-9fc0-f7cba4227758 | AdrianRojasGomez/UTN-Programacion-I | Guia Ejercicios 2/Ejercicio 10/Ejercicio10.cpp | #include <iostream>
using namespace std;
int main()
{
int n1,n2,n3,n4,n5,nMax, nMin;
cout << "Ingrese 5 numeros para determinar el menor y el mayor" << endl;
cin >> n1;
cin >> n2;
cin >> n3;
cin >> n4;
cin >> n5;
//Check n1 y n2
if (n1 > n2)
{
nMax = n1;
nMin... | ALGO | 0.999143 | 3.203148 |
609a3515-606e-4c50-9eaa-a72f06630982 | llllling/C-Data-Structures-And-Algorithm | 5.그리디/kruskal_mst.cpp | #include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
class SimpleDisjointSet
{
private:
struct Node
{
unsigned id;
unsigned rank;
unsigned parent;
Node(unsigned _id) : id(_id), rank(0), parent(_id) {}
bool operator!= (const Node& n) const
{
... | ALGO | 0.999919 | 4.938935 |
0454dc9c-9911-4f74-a9fb-abea0b7b1e7d | LencyBhalodiya/Leetcode | 442-find-all-duplicates-in-an-array/442-find-all-duplicates-in-an-array.cpp | class Solution {
public:
vector<int> findDuplicates(vector<int>& arr) {
vector<int> res;
if(arr.size() < 2) return res ;
int n =arr.size();
for(int i = 0 ; i < n ; i++)
{
int index = abs(arr[i])-1; // find element no as index number
if(arr[index... | ALGO | 0.999963 | 5.418623 |
43be0f9e-8028-44c5-a00e-7b6b975a0808 | TrustedCloud/private-llvm | tools/dsymutil/MachOUtils.cpp | #include "MachOUtils.h"
#include "BinaryHolder.h"
#include "DebugMap.h"
#include "ErrorReporting.h"
#include "NonRelocatableStringpool.h"
#include "dsymutil.h"
#include "llvm/MC/MCAsmLayout.h"
#include "llvm/MC/MCMachObjectWriter.h"
#include "llvm/MC/MCObjectStreamer.h"
#include "llvm/MC/MCSectionMachO.h"
#include "llv... | TOOL | 0.868485 | 7.36582 |
39f549d9-9092-4bc6-878a-0d7c37a50f72 | JimWongM/OptFuzz | webkit_for_optfuzz/Source/ThirdParty/ANGLE/src/gpu_info_util/SystemInfo_android.cpp | // SystemInfo_android.cpp: implementation of the Android-specific parts of SystemInfo.h
#include <dlfcn.h>
#include <vulkan/vulkan.h>
#include "gpu_info_util/SystemInfo_internal.h"
#include <sys/system_properties.h>
#include <cstring>
#include <fstream>
#include "common/angleutils.h"
#include "common/debug.h"
names... | TOOL | 0.943397 | 7.291708 |
9a926987-df12-4e57-9b7f-f09d97bd4ed6 | huytuan033/1000-b-i-code-C- | baii26.cpp | #include<iostream>
using namespace std;
class Number
{
protected:
int n;
public:
Number (int n= 0): n(n) {}
virtual void number() = 0;
int giatriN()
{
return n;
}
};
class KetQua: public Number
{
public:
KetQua(int n= 0): Number(n)... | ALGO | 0.99999 | 5.550144 |
a90b81d2-99f4-4b78-8fe3-8c72eb353357 | Anup0099/450DSA_Question | src/BinaryTree/BinarySearchTree/maxPathSum.cpp | #include <bits/stdc++.h>
using namespace std;
struct TreeNode
{
int value;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : value(x), left(NULL), right(NULL) {}
};
int max_sum_helper(TreeNode *root, int &max_sum)
{
if (root == NULL)
return 0;
int leftSum = max(0, max_sum_helper(root->l... | ALGO | 0.999971 | 5.789857 |
9fa770c0-ef04-4bea-a72b-d114f9779259 | amandhakad13/Dsa-Series | conditionals statements/odd_even.cpp | #include<iostream>
using namespace std;
int main() {
int num;
cout<<"Enter the number : ";
cin>>num;
if(num%2==0)
cout<<num<<" is Even";
else
cout<<num<<" is Odd";
} | ALGO | 0.993307 | 3.366315 |
43c010e4-8bf4-4e21-9ea4-11e7733fbdf2 | HimanshT/cc-codes | sandq/310.cpp | // Given a stack, the task is to sort it such that the top of the stack has the greatest element.
void SortedStack :: sort()
{
//Your code here
int n = s.size();
vector<int> v1;
for(int i=0;i<n;i++)
{
v1.push_back(s.top());
s.pop();
}
for(int i=0;i<n;i++)
{
for(int j=0;... | ALGO | 0.999995 | 5.754187 |
c75efe21-3c8d-43ac-80da-d671280b90f0 | Chirag1705/Cpp | 15.cpp | #include<iostream>
using namespace std;
// int sum(int a, int b){;
// int c = a+b;
// return c;
// }
// void swap(int a, int b){ // temp a b
// int temp = a; // 4 4 5 ----> This is dry run for swap function.
// a = b; // 4 5 5
// b = temp; // 4 5 4
// ... | ALGO | 0.998312 | 4.862089 |
7d1e1b6f-5df3-44c1-87ff-9fd077f9a1ba | Bl4ck-h00d/DSA_Notes | Scheduling/variation-2.cpp | /**
* Min meeting rooms required to accomodate all the meetings
*
* Given [start,end] of n meetings, return min meeting rooms required.
*
* I/p-
* [[0, 30],[5, 10],[15, 20]]
*
*
* 1 meet 2 meets 2meets 1meet ->no. of meetings happening at that pt of time
* x----------... | ALGO | 0.996608 | 4.789885 |
c12ca2d5-98bd-4ee3-bc1f-07b3a9359b79 | aa-johns/CS311-Data-Structures-and-Algorithms | forHW3/llist.cpp | //CS311 Yoshii Linked List class
//INSTRUCTION:
//Must use the provided HW3P1_help.doc to create llist.cpp
//It helps to first create if-then-else structure to fill in later.
//- Make sure PURPOSE and PARAMETER comments are given in detail
//- Make sure all if-then-else are commented describing which case it is
//- Ma... | ALGO | 0.997478 | 4.838361 |
c65d3215-4f0d-435f-bb55-f7519e6903c0 | Moyu0730/CP-Question-Record | CSES/1712. Exponentiation II.cpp | /* Question : CSES 1712. Exponentiation II */
#include<bits/stdc++.h>
using namespace std;
#define opt ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pirq(type) priority_queue<type, vector<type>, greater<type>>
#define mem(x, value) memset(x, value, sizeof(x));
#define pii pair<int, int>
#define p... | ALGO | 0.999917 | 4.263013 |
745adc9d-82d9-4a42-9c5b-aec24bbc4d70 | rainbow-auto/rainbow-codes | Luogu/P2885.cpp | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#define fastread ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl "\n"
using namespace st... | ALGO | 0.999931 | 3.510369 |
4555b605-a8bb-4317-b695-dccd154ae580 | changsongzhu/leetcode | C++/by_difficulty/easy/009_e.cpp | /**9[E]. Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.
Notes:
· Negative Integer must not be a Palindrome Number
· one way pass scan can solve this issue
· Convert the number to string and then use two pointers from the begin and end to scan the string
*... | ALGO | 0.999634 | 5.916744 |
7a60d744-f0e4-4ac4-bb37-643fe99b0126 | rafisgithub/CppLabClasses | C++lab-02/rootsOfQuadraticEquation.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main() {
float a, b, c, x1, x2, discriminant, realPart, imaginaryPart;
cout << "Enter coefficients a, b and c: ";
cin >> a >> b >> c;
discriminant = b*b - 4*a*c;
if (discriminant > 0) {
x1 = (-b + sqrt(discriminant)) / (2*a... | ALGO | 0.995883 | 4.002581 |
89f3fa35-83e9-41f6-93e2-9e6425bb0f2d | trolund/cpp-course-dtu | Week 3/FunWithBagsTwo.cpp | #include <iostream>
#include <vector>
using namespace std;
struct Command {
string command;
int value;
};
vector<Command> loadCommands (vector<string> s) {
vector<Command> result;
for(int i = 0; i < s.size(); i+=2){
string command = s[i];
int num = -1;
if(command != "quit")... | ALGO | 0.998842 | 4.736362 |
21010a9d-ac44-4981-8abe-bd4f1afeaac7 | kunyavskiy/ioi-on-codeforces | ioi2011-elephants/src/validate.cpp | #include <iostream>
#include "testlib.h"
using namespace std;
int MAXN[] = {150'000, 2, 100, 50'000, 70'000, 150'000};
int MAXM[] = {150'000, 100, 100, 50'000, 70'000, 150'000};
int main(int argc, char **argv){
registerValidation(argc, argv);
int group = atoi(validator.group().c_str());
int n = inf.readI... | ALGO | 0.997741 | 3.746568 |
b6cd185b-6364-45b2-9aeb-c41167bc8968 | ANYCUBIC-3D/AnycubicSlicer_Prusa | src/libslic3r/BoundingBox.cpp | #include "BoundingBox.hpp"
#include <algorithm>
#include <assert.h>
#include <Eigen/Dense>
namespace Slic3r {
template BoundingBoxBase<Point, Points>::BoundingBoxBase(const Points &points);
template BoundingBoxBase<Vec2d>::BoundingBoxBase(const std::vector<Vec2d> &points);
template BoundingBox3Base<Vec3d>::Bounding... | ALGO | 0.924266 | 7.369183 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.