uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
6d9afe5c-e86e-45a3-af52-5bf030a72525 | chengzeyi/whu-acm-oj | archive/002_Genesis.cpp | #include <bits/stdc++.h>
using namespace std;
string processLine(const string &line) {
size_t firstSpacePos = line.find(' ');
if (firstSpacePos == string::npos) {
return line + " 0";
}
bool isAlpha = false;
size_t count = 0;
for (auto iter = line.begin() + firstSpacePos + 1; iter != li... | ALGO | 0.994986 | 4.391919 |
1c9068bf-9ed6-4c38-91e5-fbf782ff566c | MoominKim/BaekJoon | boj/boj_1202_binary_search.cpp | #include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
#define int long long
using namespace std;
vector<pair<int, int> > jewel;
vector<int> bag;
priority_queue<int> q;
signed main()
{
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++)
{
int M, V;
cin >> M >> V;
jewel.push_back({M,V... | ALGO | 0.999952 | 3.823661 |
608c6b3d-32e2-49d5-92e2-d3257c7bb59a | caotoanbk/CP_contest_template | ACMICPC.NET/1797/solution.cpp | #include <bits/stdc++.h>
using namespace std;
#ifdef ON_PC
#include "../shared/lib/debug2.h"
#else
#define dbg(...)
#define dbgArr(...)
#endif
#define int int64_t
typedef pair<int,int> pii;
#define ll long long
#define ld long double
#define ar array
#define vt vector
#define pb push_back
#define ... | ALGO | 0.99998 | 4.344457 |
e28a3970-3e2e-4f02-a4fe-ae2929935b4a | hoangngoanngoan/cpp_canchi | cpp_canchi/cpp_canchi.cpp | // cpp_canchi.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <iostream>
#include <ctime>
using namespace std;
string tinhcanchi(int year)
{
string can[10] = { "Canh","Tan","Nham","Quy","Giap","At","Binh","Dinh","Mau","Ky" };
string chi[12] = { "Than","Dau","... | TOOL | 0.877614 | 5.426154 |
1fcbc29b-f993-4ae5-8a84-cd12235c6fd1 | ELTCore/cppcode | leetcode/c2789.cpp | /*
2789. 合并后数组中的最大元素
中等
相关标签
相关企业
提示
给你一个下标从 0 开始、由正整数组成的数组 nums 。
你可以在数组上执行下述操作 任意 次：
选中一个同时满足 0 <= i < nums.length - 1 和 nums[i] <= nums[i + 1] 的整数 i 。将元素 nums[i + 1] 替换为 nums[i] + nums[i + 1] ，并从数组中删除元素 nums[i] 。
返回你可以从最终数组中获得的 最大 元素的值。
示例 1：
输入：nums = [2,3,7,9,3]
输出：21
解释：我们可以在数组上执行下述操作：
- 选中 i = 0 ，得到数组 nums =... | ALGO | 0.999987 | 5.976124 |
98d37ece-2562-40c8-b5c0-464860553e90 | misaelmateus/problem-solving | Codeforces/709-C.cpp | // Author : Misael Mateus
// Submission date: 2016-08-24 22:07:42
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int a = 0;
for(int i = 0; i < s.size(); i++){
if(s[i] == 'a'){
if(a == 0)
continue;
if(a == 1)
break;
}
else{
a = 1;
s[i] = (char)((int)(s[i] ... | ALGO | 0.998946 | 3.248318 |
6ca2605a-89b9-430c-b66e-86d52ca46ffa | tsw303005/LeetCode | 121. Best Time to Buy and Sell Stock/function.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int maxProfit(vector<int>& prices) {
int ans = 0;
int small = prices[0];
for (int i = 1; i < prices.size(); i++) {
if (small > prices[i]) small = prices[i];
else ans = max(a... | ALGO | 0.999678 | 5.869178 |
ba6c7673-31d9-4ced-90a7-f2da3730e16e | MEGHANA-NEKAR/leetCode-repo | Subset Sum Problem - GFG/subset-sum-problem.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:
bool isSubsetSum(vector<int>arr, int sum){
int n = arr.size();
vector<bool>prev(sum+1,0),curr(sum+1,0);
prev[... | ALGO | 0.999492 | 5.929105 |
1a298ec0-e203-4779-b933-b2f46794f766 | SidGit195/Competitive-Programming | Math (Number Theory)/Prime Check.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
bool is_prime = true;
if(n == 1){
cout << 0 << endl;
return 0;
}
for(int i=2; i*i<=n; ++i){
if(n % i == 0){
is_prime = false;
break;
}
}
// O(sqrt(N))
c... | ALGO | 0.999935 | 4.601318 |
615d8fb9-64b5-4f84-9a16-a99212854ecd | korca0220/Algorithm_study | ACMICPC/SWtest/Problem/Simulation/14890.cpp | #include <iostream>
#include <vector>
using namespace std;
bool getCheck(vector<int> &in, int len){
int n = in.size();
vector<bool> check(n, false);
for(int i=1; i<n; i++){
if(in[i-1] != in[i]){
int diff = abs(in[i-1] - in[i]);
if(diff != 1){
return false;
... | ALGO | 0.999934 | 3.408086 |
c1fe3139-8988-4526-b779-ef90fd0c3367 | pranavdharrao/Polyglot-DSA-Solutions | Pattern/pattern-C++/hollowPyramid.cpp | #include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
//full hollow pyramid r * 2c
for(int row = 0; row < n; row++){
int k =0;
for(int col = 0; col < ((2*n) - 1); col++){
if(col < n - row - 1){
cout<<" ";
}
else if(k <... | ALGO | 0.999832 | 3.7295 |
29de3bb0-87ae-4348-b186-9ff5c6754d8f | BabaYaga1221/Competitive-programming | burger.cpp | #include<iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,c=0;
long int m;
cin>>n>>m;
long a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
c=c+a[i];
}
if(c==m)
cout<<"YES"<<endl;
else
cout<<"NO... | ALGO | 0.999949 | 3.648629 |
ce68c229-d61d-4aaa-a360-cd8af4973788 | shyu61/program-competition | code/ant/121.cpp | // 包除原理
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// 最小公倍数について
// lcm(a,b) = gcd(a,b) * (aにしかない因数) * (bにしかない因数)
// a = gcd(a,b) * (aにしかない因数)
// b = gcd(a,b) * (bにしかない因数)
// 故に
// a * b = gcd(a,b)^2 * (aにしかない因数) * (bにしかない因数)
// a * b = gcd(a,b) * lcm(a,b)
// lcm(a,b) = a * b / gcd(a,b)
// 包除原... | ALGO | 0.999994 | 4.497825 |
a6e665fe-3854-4f01-9a4a-0fbd025550c7 | ldct/cp | GKS/2020/2020-D/C/C.cpp | #include <bits/stdc++.h>
using namespace std;
template<class T> ostream& operator << (ostream& os, const vector<T>& v) { os << "["; for (int i=0; i<v.size(); i++) { os << v[i]; if (i < v.size() - 1) os << ", "; } return os << "]"; }
template<class T> ostream& operator << (ostream& os, const set<T>& v) { os << "{"; for... | ALGO | 0.999148 | 4.888528 |
8961b7f1-82e6-4223-a028-577f726361d5 | SaranyaDas/CS141Lab7 | 9.cpp | #include <iostream>
using namespace std;
void factorial(int n, int fact) {
if(n > 0) {
fact *= n;
--n;
factorial(n, fact);
}
else {
cout << "Factorial =" << fact;
}
}
int main() {
int n, fact = 1;
cout << "Enter a number: ";
cin >> n;
factorial(n, fact);
return 0;
}
| ALGO | 0.995446 | 4.55787 |
6235b934-d1d5-4cbd-a6bc-79591d2e6261 | SetsunaChyan/OI_source_code | USST/PX2/c3-3.cpp | #include <cstdio>
int n;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int t=i,x=i;
while(x)
{
t+=x%10;
x/=10;
}
if(t==n)
{
printf("%d",i);
return 0;
}
}
printf("no");
return 0;
} | ALGO | 0.999982 | 3.709319 |
d98f8f48-b900-4d8a-8452-5fd7ea42576a | wang2028/kuangbin | 2. 搜索进阶/A-hdu1043(未完成).cpp | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <cstring>
using namespace std;
#define INF 0x3f3f3f3f
// HDU 1043、POJ 1077 Eight
// 真的难啊...暴力广搜+STL各种超时溢出...
// 需要哈希（康托展开）+打表才能过 hdu...
// 以下仅是自写的康托展开的模板...
const int Digit = 5;
int F[... | ALGO | 0.999842 | 3.43818 |
d01cb977-8201-451b-a973-76aab4ffca32 | rungeh/SIMUTATOR | Mutator/mutator.cpp | #include "mutator.h"
bool has_suffix(const string& s, const string& suffix)
{
return (s.size() >= suffix.size()) && equal(suffix.rbegin(), suffix.rend(), s.rbegin());
}
int putInList(string dPath, list <string> &dList) {
string frmt = ".txt";
DIR *dir = opendir(dPath.c_str());
if (!dir) {
return 1;
}
dirent ... | TOOL | 0.973953 | 4.161129 |
707fa6f6-529d-4960-96d1-90579e0ca016 | AhmedHamed-20/ODC-Flutter-Hackathon | 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 |
0c0e2d01-59fd-4433-8a67-3f92d75b185f | flpolyproject/spatialcov | Fred-master/src/jl_transform.cpp | #include "jl_transform.hpp"
namespace JLTransform {
Curves transform_naive(const Curves &in, const distance_t epsilon, const bool empirical_k = true) {
if (in.empty()) return in;
auto rg = Random::Gauss_Random_Generator<coordinate_t>(0, 1);
curve_number_t number_points = 0;
for (con... | ALGO | 0.99915 | 5.551104 |
08f51c3f-46a6-435f-b48e-93ac0b6cc9f5 | kishanraj04/leetcode-solutions | tree/662. Maximum Width of Binary Tree.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999145 | 6.197999 |
37a34191-a5df-4772-af38-086e28385b2e | jplanari/RK_tf2-new | mods/utils.cpp | #include "tfa/Opers.h"
#include "tfa/Simulation.h"
TF_Func void computeTimes(tfa::Simulation &sim)
{
CPUTimer_Info();
CPUTimer_Reset();
}
TF_Func void startMainTimer(tfa::Simulation &sim)
{
CPUTimer_Beg("main");
}
TF_Func void endMainTimer(tfa::Simulation &sim)
{
CPUTimer_End("main");
}
TF_Func bool... | ALGO | 0.994072 | 3.839643 |
cb607ad7-5930-421c-847b-0678fa16e7ca | githubcpt/viewBasePolyScope | deps/libigl/include/igl/unproject_in_mesh.cpp | template < typename Derivedobj>
IGL_INLINE int igl::unproject_in_mesh(
const Eigen::Vector2f& pos,
const Eigen::Matrix4f& model,
const Eigen::Matrix4f& proj,
const Eigen::Vector4f& viewport,
const std::function<
void(
const Eigen::Vector3f&,
const Eigen::Vecto... | ALGO | 0.975177 | 6.336682 |
5b1daa1d-f59f-4137-a5da-8ef7ef67e397 | ALSVenky/sample | DSA C++/05stack/02creatingUsingLL.cpp | #include<iostream>
using namespace std;
struct node{
int data;
struct node* next;
}*top=NULL;
void push(int x){
node *t=new node;
if(t==NULL){
cout<<"stack over flow"<<endl;
}
else{
t->data=x;
t->next=top;
top=t;
}
}
int pop(){
int value=-1;
if(top==NU... | ALGO | 0.999109 | 3.723417 |
09a2a6e7-7bbf-447a-80c8-441970b1518b | Lailansyahda/ParadigmaOOP2_0250 | polimorpi/polimorpi.cpp | #include <iostream>
using namespace std;
class seseorang
{
public :
//virtual void pesan() = 0;
virtual void pesan()
{
cout << "Pesan dari seseorang" << endl;
}
};
class joko : public seseorang
{
public:
void pesan()
{
cout << "Pesan dari lia" << endl;
}
};
class ... | TOOL | 0.963908 | 4.832166 |
ecef2c2c-8ef3-418e-bec4-112d0b4b4123 | garimellagowtham/MySketchbook | libraries/AP_Math/polygon.cpp | /// -*- tab-width: 4; Mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*-
#include "AP_Math.h"
/*
* The point in polygon algorithm is based on:
* http://www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html
*/
/*
* Polygon_outside(): test for a point in a polygon
* Input: P = a point,
* ... | ALGO | 0.999801 | 7.673773 |
a89f94f6-af60-4f99-9efd-9614a67ce4a3 | Guminsung/Algorithm | BOJ/1753.cpp | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
vector<vector<pair<int, int>>> p(20001);
priority_queue<pair<int, int>> q;
int weight[20001];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, k, u, v, w;
cin >> n >> m >> k;
for (... | ALGO | 0.999958 | 4.120803 |
2aba847d-2290-4481-b246-b5efce146547 | tanishq6818/DSA | POTD Oct 11th/GFG POTD.cpp | // Given a binary tree, find if it is height balanced or not.
// A tree is height balanced if difference between heights of left and right subtrees is not more than one for all nodes of tree.
// A height balanced tree
// 1
// / \
// 10 39
// /
// 5
// An unbalanced tree
// 1
// ... | ALGO | 0.999987 | 6.965584 |
31e8c64a-cec4-4a28-8509-e643e2150609 | wjdrud2532/Xcode_First | Xcode_First/BAEKJOON/18870_Again.cpp | //
// 18870.cpp
// Xcode_First
//
// Created by 한정경 on 2021/05/09.
//
#include <iostream>
#include <vector>
#include <algorithm>
using std::cin;
using std::cout;
using std::endl;
using std::ios_base;
using std::vector;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
... | ALGO | 0.999994 | 4.525695 |
d1166a68-e6f8-44df-aca1-44ceac008406 | hmwang2002/Algorithm-Learning | leetcode/leetcode-1786.cpp | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
auto _{
[]() noexcept
{
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr), std::cout.tie(nullptr);
return 0;
}()};
class Solution
{
vector<vector<pii>> graph;
vector<int> dis;
priority_que... | ALGO | 0.999893 | 4.859227 |
920c0737-e562-4ebd-99dc-cca81725f988 | spmallick/learnopencv | Homography/perspective-correction.cpp | #include <opencv2/opencv.hpp>
using namespace cv;
using namespace std;
struct userdata{
Mat im;
vector<Point2f> points;
};
void mouseHandler(int event, int x, int y, int flags, void* data_ptr)
{
if ( event == EVENT_LBUTTONDOWN )
{
userdata *data = ((userdata *) data_ptr);
circle(data... | ALGO | 0.983176 | 5.488451 |
f78eedf6-47c1-4d44-824b-f93d2aaab9dd | Ginakira/Code-Archive | Leetcode/LeetCode1046.cpp | // LeetCode 1046 最后一块石头的重量
#include <queue>
#include <vector>
using namespace std;
// Solution1: 优先队列
class Solution {
public:
int lastStoneWeight(vector<int>& stones) {
priority_queue<int> q;
for (int stone : stones) {
q.push(stone);
}
while (q.size() > 1) {
... | ALGO | 0.999667 | 5.193948 |
bdc3a8c8-c59c-4a3b-b3e2-9f54dab089b0 | duongtrieuelec/LeetSolve | cpp-leetcode/leetcode139-word-break_dp2.cpp | #include<vector>
#include<algorithm>
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
// 更快的dp, 时间复杂度: O(N * M), N是字符串s的长度, M是数组wordDict的长度
class Solution {
public:
bool wordBreak(string s, vector<string>& wordDict) {
const int len = s.size();
bool dp[len + 1];
dp[0] = true;
... | ALGO | 0.999603 | 5.183112 |
6b0035ac-4e0a-4c9b-a489-6ef4ccf06876 | kunyavskiy/competitive-programming-archive | opencup/18-19/180909/B.cpp | #include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>... | ALGO | 0.999494 | 3.69298 |
4a1e87b7-fb6f-4b46-a443-d03891fd9e31 | weizds/LeetCode | medium/230_Kth_Smallest_Element_in_a_BST.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999984 | 6.116484 |
21283f1c-5b00-4793-b06c-be50a0ecbba1 | Sachin1801/DSA_CPP_Leetcode_-_GFG | 0023-merge-k-sorted-lists/0023-merge-k-sorted-lists-time_optimised.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* mergeKLists... | ALGO | 0.999922 | 5.945309 |
8bd8dffb-0036-491f-8d6d-0eb5ca0fe539 | Sudhir769/LeetCode-GFG-Daily | 04 November 2024/lc-/Solution.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
string compressedString(string word)
{
string result = "";
int n = word.length();
int i = 0;
while (i < n)
{
char ch = word[i];
int cnt = 0;
while (i < n and cnt ... | ALGO | 0.999988 | 5.836452 |
d5f26ada-210f-48cf-a761-ae842d606288 | maormizrachi/HeatSimulation | source/solver/Solver.cpp | #include "Solver.h"
#include <iostream> // todo remove
Solver::Solver(IOAgent *agent, Cell *cell, matrix_t &coefficients): agent(agent), cell(cell), coefficients(coefficients)
{
MPI_Comm_rank(cell->getCommunicator(), &this->rank);
MPI_Comm_size(cell->getCommunicator(), &this->size);
}
/**
* given a row and ... | ALGO | 0.999921 | 5.340256 |
b2ded4b4-1285-43fd-a767-67f3aec3b3da | svn2github/qmcpack | branches/mixed-r5175/src/QMCHamiltonians/LocalECPotential.cpp | namespace qmcplusplus {
LocalECPotential::LocalECPotential(const ParticleSet& ions, ParticleSet& els):
IonConfig(ions)
{
NumIons=ions.getTotalNum();
myTableIndex=els.addTable(ions);
//allocate null
PPset.resize(ions.getSpeciesSet().getTotalNum(),0);
PP.resize(NumIons,0);
Zeff.resize(Nu... | TOOL | 0.892484 | 5.453956 |
27c710fa-083f-4940-872e-d81de3f54875 | guptayogansh/cses-codes-cp | Tree diameter.cpp | #include<bits/stdc++.h>
using namespace std;
const int mxN=2e5;
int n,ans,d[mxN+1];
vector<int> adj[mxN+1];
void dfs(int s=1, int e=0){
for(auto u:adj[s]){
if(u==e) continue;
dfs(u,s);
ans = max(d[s]+d[u]+1, ans);
d[s]=max(d[s], d[u]+1);
}
}
int main(){
cin>>n;
for(int i=2;i<=n;i++){
int a... | ALGO | 0.999538 | 3.912532 |
8eae8578-803e-4e7d-aea4-c79f743addb7 | hkmangla/cppProgramms | Algorithms/prims.cpp | #include "bits/stdc++.h"
using namespace std;
#define pii pair<int,int>
#define f first
#define s second
vector<pii> adj[100001];
int prims(int x){
bool vis[100001];
memset(vis,false,sizeof(vis));
priority_queue<pii> Q;
Q.push({0,x});
int minCost = 0;
while(!Q.empty()){
pii p = Q.top();
Q.pop();
int n = ... | ALGO | 0.999949 | 3.920313 |
0cce0796-e723-45f4-bd04-d5d7d3e360b5 | mwy3055/Algorithm-codes | baekjoon/cpp/c++/10282.cpp | #include <iostream>
#include <queue>
#include <vector>
#include <functional>
using namespace std;
typedef pair<int, int> Pair; //Ÿ,
const int INF = 0x70000000;
inline int max(int a, int b) { return a > b ? a : b; }
void dijk(int& c, int& n, int* d, vector<vector<Pair>>& adj)
{
priority_queue<Pair, vector<Pair>, great... | ALGO | 0.999813 | 4.165036 |
37fc0e67-d26e-427e-87aa-4dd32cdf8340 | abhishek143-tech/CPP | Array/reverse.cpp | #include <iostream>
using namespace std;
void reverseArray(int arr[], int start, int end)
{
while (start < end)
{
int temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
start++;
end--;
}
}
void printarray(int arr[], int size)
{
for (int i = 0; i < size; ... | ALGO | 0.999465 | 5.439039 |
191f7072-3fc1-4d5e-bded-48ec9d558f26 | heeseokjung/codeforces | R632DIV2/C.cpp | #include <cstdio>
#include <set>
using namespace std;
int N;
long long arr[200001];
long long prefix[200001];
int main() {
scanf("%d", &N);
for(int i = 1; i <= N; ++i)
scanf("%lld", arr+i);
for(int i = 1; i <= N; ++i)
prefix[i] = prefix[i-1] + arr[i];
long long count = 0;
set... | ALGO | 0.999722 | 4.011819 |
a424d7de-37f6-4d1b-bb17-bdae5dd41a2b | 1205900291/zhang_yuran | 5-19/main.cpp | #include <iostream>
using namespace std;
int main()
{
int n;
int i=1;
double x=4;
cin>>n;
for(i=1;i<=n;i++)
{
if(i%2==0)
x=x+(double)4/(2*i+1);
else if(i%2 !=0)
x=x-(double)4/(2*i+1);
cout<<x;
}
}
| ALGO | 0.999756 | 3.145274 |
6d72fbf7-485b-4bf3-8817-4e6fd2570e14 | nilay2207/CP | Codeforces/creep.cpp | #include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define INF 1e18
#define nline "\n"
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.14... | ALGO | 0.999795 | 4.279037 |
277f9968-7e47-43ed-af6e-8c2a04c7fca8 | akshita1204/StriverSheetChallenge | BinarySearch/1D/1.cpp |
//https://leetcode.com/problems/binary-search/
/*
class Solution {
public:
int search(vector<int>& nums, int target) {
int n = nums.size(); //size of the array
int low=0, high=n - 1;
while (low <= high) {
int mid = (low + high) / 2;
if (nums[mid] == target) return mid;
... | ALGO | 0.999925 | 6.397386 |
87804bf7-739a-4cbe-a780-ea48c407ea75 | douglas-ee/exercicios_cplusplus | C++/45_execoes_try_catch/1_execoes_try_catch.cpp | #include <iostream>
using namespace std;
double div(double n1, double n2)
{
if(n2 == 0)
throw "Divisao por zero!!\n";
return n1 / n2;
}
int fat(int n)
{
if(n < 0)
throw "Numero negativo!!";
if(n == 0 || n == 1)
return 1;
return n * fat(n - 1);
}
int main(int argc, char *argv[])
{
//try - tenta executar... | ALGO | 0.976024 | 5.224534 |
c2ce4723-e439-4748-a395-bab27398248c | falabretti/uri-online-judge | cpp/ad-hoc/1105.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int b, n;
while (cin >> b >> n and b != 0 and n != 0) {
int balances[b];
for (int i = 0; i < b; i++) cin >> balances[i];
for (int i = 0; i < n; i++) {
int d, c, v;
cin >> d >> c >> v;
balan... | ALGO | 0.99775 | 3.598249 |
a30286d9-95bd-48b8-8a9d-8f2aa828d489 | ishandutta2007/codeforces | gary/normal/1203/E.cpp | //* AuThOr GaRyMr *//
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","... | ALGO | 0.999977 | 3.592858 |
46ebddb5-7167-4253-970d-9bed6ce44930 | DaniloHatz/beecrowd-cpp-solutions | Iniciante/1557-MatrizQuadrada3.cpp | #include <iostream>
#include <cmath>
int main()
{
unsigned short n, t;
for (std::cin >> n; n != 0; std::cin >> n)
{
t = std::log10(std::abs(pow(2, (n * 2 - 2)))) + 1;
for (unsigned char i = 0; i < n; i++)
{
for (unsigned short j = 0; j < n; j++)
{
std::cout.width(t);
std::cout << std::right;
... | ALGO | 0.999582 | 5.014325 |
f25d1c19-8a12-4b15-972b-88f90d77c46a | kamrul17/DSA_Stuff | basicMath/armstrongNo.cpp |
#include <bits/stdc++.h>
using namespace std;
bool armstrongNum(int num)
{
int originalNo = num;
int temp = num;
int NoOFdigits = 0;
int sum = 0;
while (temp != 0)
{
NoOFdigits++;
temp /= 10;
}
while (num != 0)
{
int digit = num % 10;
sum = sum + po... | ALGO | 0.999946 | 5.687721 |
13c52744-d05a-4b91-8c30-9fe5a7bd91e3 | pavellevap/code_antiplagiat | test/04/839.cpp | #pragma comment(linker, "/STACK:64000000")
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <iostream>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i,n) for (int i = 0, _##i = (n); i < _##i; ++i)
... | ALGO | 0.999847 | 3.541763 |
d93d6562-443a-4bb4-968c-ae454bf93ade | gyli0086/opencv1 | modules/features2d/src/kaze/KAZEFeatures.cpp | /**
* @file KAZEFeatures.cpp
* @brief Main class for detecting and describing features in a nonlinear
* scale space
* @date Jan 21, 2012
* @author Pablo F. Alcantarilla
*/
#include "../precomp.hpp"
#include "KAZEFeatures.h"
#include "utils.h"
namespace cv
{
// Namespaces
using namespace std;
/* ***************... | ALGO | 0.986633 | 3.241642 |
d0011303-18da-4dd1-b396-6873f0aea533 | wonju-cho/Algorithm_Problems | Baekjoon/2263_tree_traversal.cpp | //https://non-stop.tistory.com/128
#include<iostream>
using namespace std;
int inOrder[100001];
int postOrder[100001];
int idx[100001];
void PreOrder(int inS, int inE, int posS, int posE)
{
if (inS > inE || posS > posE)
return;
int root = postOrder[posE];
int rootIdx = idx[root];
int leftSize = rootIdx - inS;... | ALGO | 0.999985 | 4.12425 |
24893b70-2f4a-413b-b5bf-0bddf6dbe91f | Ebrown569/https-github.com-godotengine-godot | thirdparty/embree/kernels/bvh/bvh_builder_sah_spatial.cpp | #include "bvh.h"
#include "bvh_builder.h"
#include "../builders/primrefgen.h"
#include "../builders/primrefgen_presplit.h"
#include "../builders/splitter.h"
#include "../geometry/linei.h"
#include "../geometry/triangle.h"
#include "../geometry/trianglev.h"
#include "../geometry/trianglev_mb.h"
#include "../geometry/t... | ALGO | 0.983945 | 7.225921 |
a457b6fe-f926-405b-9a1e-f7b181df15b5 | jimi36/pump | src/proto/http/utils.cpp | #include "pump/debug.h"
#include "pump/codec/sha1.h"
#include "pump/codec/base64.h"
#include "pump/proto/http/utils.h"
namespace pump {
namespace proto {
namespace http {
const char *find_http_line_end(const char *src, int32_t len) {
len = std::min<int32_t>(len, http_line_max_length);
if (len < http_line_min_... | WEB | 0.872915 | 6.23006 |
926f9509-4f02-4956-8071-2f3785363214 | peterkaczorowski/kicad | common/widgets/search_pane_tab.cpp | #include <widgets/search_pane_tab.h>
#include <widgets/search_pane.h>
#include <kiway.h>
#include <vector>
#include <string_utils.h>
#include <wx/clipbrd.h>
#include <core/kicad_algo.h>
SEARCH_PANE_LISTVIEW::SEARCH_PANE_LISTVIEW( SEARCH_HANDLER* handler, wxWindow* parent,
wx... | TOOL | 0.953343 | 6.185272 |
8ce88a91-9f25-44b3-a7ac-6db172c60b43 | pranjal9424/Company_coding_question | accenture/5.cpp | #include <bits/stdc++.h>
using namespace std;
int NumberOfHouse(int r,int unit,int* arr,int n)
{
if(n==0)
{
return -1;
}
int m=r*unit;
int sum=0;
for(int i=0;i<n;i++)
{
sum+=arr[i];
if(sum>=m)
{
return i+1;
}
}
return 0;
}
int main()
... | ALGO | 0.999917 | 4.392898 |
eb67bd10-df84-4dba-be0b-6ff2591de1f1 | karin0/problems | probs/bzoj1083.cpp | #include <cstdio>
#include <algorithm>
const int MAXN = 305;
int n, m;
int fa[MAXN];
inline void init() {
for (int i = 1; i <= n; ++i)
fa[i] = i;
}
inline int find(int x) {
return fa[x] == x ? x : fa[x] = find(fa[x]);
}
inline void merge(int x, int y) {
fa[find(x)] = find(y);
}
inline bool same(i... | ALGO | 0.999939 | 4.45999 |
3cd27a47-6225-455b-ac10-492edab85fb0 | HuynhDienThuc1/23521555_23520326_23521441_23521583_23521625_BT03 | Bai153/Bai153.cpp | #include <iostream>
#include <iomanip>
using namespace std;
void Nhap(int[], int&);
void ChanVeDau(int[], int);
void LeVeCuoi(int[], int);
void ChanDauLeCuoi(int[], int);
void Xuat(int[], int);
int main()
{
int b[100];
int k;
Nhap(b, k);
cout << "\nXuat mang mot chieu: " << endl;
Xuat(b, k);
ChanDauLeCuoi(b, ... | ALGO | 0.999439 | 3.704298 |
8ecadde2-80cb-475f-9dd8-71f5bcbe5e8f | behnejad/quera | university-9739.cpp | #include <iostream>
#include <stack>
using namespace std;
#define ll long long
const int N = 1e6 + 6;
ll h[N];
int l[N], r[N];
int main()
{
int n;
cin >> n;
for (int i = 0;i < n;i++)
{
cin >> h[i];
}
stack<pair<int, ll>> stk;
stk.push({ -1,-1 });
for (int i = 0; i < n; i++)
{
w... | ALGO | 0.999827 | 3.994258 |
206a4781-0bb9-4eda-a2dd-be9521807b4d | rohitsharma217/dsa | exp-7 BFS DFS.cpp | #include <iostream>
using namespace std;
// # Global
int visited[7] = {0, 0, 0, 0, 0, 0, 0};
int v[7] = {0, 0, 0, 0, 0, 0, 0};
int a[7][7] =
{
{0, 1, 1, 0, 0, 0, 1},
{1, 0, 0, 1, 0, 0, 0},
{1, 0, 0, 0, 1, 1, 0},
{0, 1, 0, 0, 0, 0, 0},
{0, 0, 1, 0, 0, 0, 0},
{0, 0, 1,... | ALGO | 0.99997 | 5.034689 |
c233ffa5-c0eb-4af5-babf-3be143f7d7a0 | Stanotron/vsCode | c++/leetcode/subsetSum.cpp | #include <bits/stdc++.h>
#define fr(i,a,b) for(int i = a; i < b; i++)
#define pb push_back
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
// recursion and memoization
int dp[102][1002];
int subset2(int arr[], int sum, int n){
if(sum==0 || n==0) r... | ALGO | 0.999525 | 4.080858 |
89e99336-939f-48d9-86eb-c3021f6fdcef | soul059/DSA | binary search/Bs on 1D array/find minimum in rotated sorted array (duplicate ele).cpp | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int minInRotatedSorted(vector<int> arr,int target){
int low=0, high= arr.size()-1;
int mini = INT_MAX;
while(low<=high){
// if(arr[low] <= arr[high]){
// mini = min(mini,arr[low]);
// break;
... | ALGO | 0.999984 | 4.739633 |
eb7f750b-5304-4bba-87cb-c2a56bfac213 | mohit7788/ASSIGNMENT-OF-c | 43. All Operations of String.cpp | #include<stdio.h>
#include<conio.h>
Void main(){
Char string1[25],string2[25];
int l;
Clrscr();
Printf(***** performing string length ******\n);
Printf(enter only one string \n);
Scanf(%s,string1);
l = strlen(string1);
printf(the string length is %d\n\n,l);
printf(**** performing string concatenation... | TOOL | 0.875909 | 3.000407 |
b2d5fefa-8671-4d81-879f-071ae95f13ac | Ali-Hassan2/Arrays-Questions-DSA | HassanConfusion.cpp | #include<iostream>
#include<vector>
using namespace std;
int main() {
// ranged based loop
vector<int> vec;
vec.push_back(1);
vec.push_back(2);
vec.push_back(3);
// 1 2 3
// for(int i = 0; i < vec.size(); i++) {
//
// cout << vec[i] << endl;
// }
for(auto num : vec... | ALGO | 0.928653 | 3.825981 |
52c7e7f2-7573-4c48-ab7b-d31730c54cf1 | GengxinLiu/SWMP | NetworkDataExtract/OBBcalculation/SourceCode/symmetry/Intersection/Wm5IntrLine2Arc2.cpp | #include "Wm5MathematicsPCH.h"
#include "Wm5IntrLine2Arc2.h"
#include "Wm5IntrLine2Circle2.h"
namespace Wm5
{
//----------------------------------------------------------------------------
template <typename Real>
IntrLine2Arc2<Real>::IntrLine2Arc2 (const Line2<Real>& rkLine,
const Arc2<Real>& rkArc)
:
mLi... | TOOL | 0.931494 | 6.063958 |
9fbc1547-144e-4391-8d72-3635c8f7926a | dingkwang/SFND_2D_Feature_Matching_own | src/MidTermProject_Camera_Student.cpp | /* INCLUDES FOR THIS PROJECT */
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <limits>
#include <opencv2/core.hpp>
#include <opencv2/highgui/highgui.hpp>
#include <opencv2/imgproc/imgproc.hpp>
#include <opencv2/features2d.hpp>
#include <opencv2/... | ALGO | 0.987143 | 7.170139 |
bad96e98-b502-4b9a-935d-f5d3a4fddf3e | sarvex/leetcode-erlang | solution/1700-1799/1703.Minimum Adjacent Swaps for K Consecutive Ones/Solution.cpp | class Solution {
public:
int minMoves(vector<int>& nums, int k) {
vector<int> arr;
for (int i = 0; i < nums.size(); ++i) {
if (nums[i]) {
arr.push_back(i);
}
}
int m = arr.size();
long s[m + 1];
s[0] = 1;
for (int i = 0;... | ALGO | 0.999992 | 5.605762 |
61906e7c-08d2-4bb2-a033-6b92700a2e45 | mlibovych/Cpp-WhiteBelt | rational_eq_and_subb.cpp | #include <iostream>
#include <string>
#include <vector>
#include <numeric>
using namespace std;
class Rational {
public:
Rational() {
numerator = 0;
denominator = 1;
};
Rational(int new_numerator, int new_denominator) {
if (!new_numerator) {
numerator = 0;
de... | ALGO | 0.995305 | 5.119986 |
4387d3f3-f458-4918-bb4d-313edb9d3ddb | arman-bhaai/Codechef-Solutions | START60D Palindrome Flipping.cpp | /*______________________________________________________________________
||--------------------------------------------------------------------||
|| ||
|| "I bear witness that there is no god but Allah and I bear witness ||
|| that Muhammad (peace b... | ALGO | 0.999886 | 4.445405 |
f887e118-5f21-4a94-9581-7160247acf8e | ob22a/Leetcode | 13-roman-to-integer/roman-to-integer.cpp | class Solution {
public:
int romanToInt(string s) {
vector<int> values(91); //Since ASCII value of Z is 90
values['I']=1;
values['V']=5;
values['X']=10;
values['L']=50;
values['C']=100;
values['D']=500;
values['M']=1000;
int result=0;
... | ALGO | 0.999611 | 6.166449 |
cd9d44fd-1798-47f1-838e-95ef2f5d15df | vbonnici/grafe-sim | analysis/data/p02233/s443068540.cpp | // ???????¨???????
#include <bits/stdc++.h>
using namespace std;
long long dp[101];
long long fib(long long n){
dp[0] = 1;
dp[1] = 1;
for(int i=2;i<=n;++i) dp[i] = dp[i-1] + dp[i-2];
return dp[n];
}
int main(){
long long n;
cin>>n;
memset(dp,0,101);
cout<<fib(n)<<endl;
return EXIT_SUCCESS... | ALGO | 0.99998 | 4.568343 |
79a1698b-e228-469d-a087-5adb74f5732f | HafizMudassirHusain/DSA-with-Cplusplus | TOPL_Projects/TOPL_Project.cpp | // Online C++ compiler to run C++ program online
#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <ctime>
using namespace std;
bool isLetterInWord(char letter, const string& word) {
return (word.find(letter) != string::npos);
}
void updateDisplayString(const string& word, const... | TOOL | 0.9522 | 6.142595 |
db6be583-b62f-493d-9e37-575b45498899 | xyluo2028/LCPrac | src/minAvailableDuration.cpp | bool comp(vector<int> a, vector<int> b) {
if (a[0] < b[0]) return true;
else return false;
}
class SolutionGood {
public:
vector<int> minAvailableDuration(vector<vector<int>>& slots1, vector<vector<int>>& slots2, int duration) {
sort(slots1.begin(), slots1.end(), comp);
sort(slots2.begin(),... | ALGO | 0.999922 | 5.646353 |
5cb9b0e1-dd5f-4b27-bdb0-21f511cdad19 | hakomori64/atcoder | abc/054a.cpp | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw" << endl;
return 0;
}
if (a == 1) {
cout << "Alice" << endl;
return 0;
}
if (b == 1) {
cout << "Bob" << endl;
return 0;
}
if (... | ALGO | 0.99992 | 3.623281 |
6b853e65-bd35-4b60-946c-2ce2c2b0ffbe | bugttle/Cocos2d-x_Study_20140127 | Cocos2d-x_3D/cocos2d/tools/simulator/libsimulator/lib/ProjectConfig/SimulatorConfig.cpp |
#include "SimulatorConfig.h"
#include <sstream>
SimulatorConfig *SimulatorConfig::_instance = NULL;
SimulatorConfig *SimulatorConfig::getInstance()
{
if (!_instance)
{
_instance = new SimulatorConfig();
}
return _instance;
}
SimulatorConfig::SimulatorConfig()
{
_screenSizeArray.push_back... | CONFIG | 0.851181 | 4.317884 |
ca426204-a920-4ebf-a54d-44d5d623c3bf | ishandutta2007/codeforces | gs12117/normal/663/E.cpp | #include<stdio.h>
#include<vector>
int n,m;
int ans;
int a[1<<20];
char s[23][100100];
std::vector<int> b[500];
void f(int dep,int stp,int r){
int i,j;
if(dep==0){
j=0;
for(i=0;i<=r;i++){
if(i<r-i)j+=b[stp+i][0]*i;
else j+=b[stp+i][0]*(r-i);
}
if(ans>j)ans=j;
return;
}
int t=(1<<dep-1),endp=stp+r+1;... | ALGO | 0.999908 | 3.792176 |
a13bef53-4668-4fe8-ba63-8a0d098fbc62 | JunBinLiang/IO-Workbook | CF/Round-914(div2)/E(tree+2500).cpp | #include <string>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
using namespace std;
const int MAX = 2e5 + 10;
struct Node {
int l, r;
int tag = 0, mx = 0;
} tr[MAX * 4];
void pushup(int u) {
int lid = u * 2 + 1, rid = u * 2 + 2;
if(tr[u].l != tr[u].r) {
tr[u].mx = max(... | ALGO | 0.999985 | 4.550937 |
c7471294-7356-478f-8e45-1dadd6fe3507 | mohitmallick17/LeetCodeSolutions | 224-basic-calculator/224-basic-calculator.cpp | class Solution {
bool isDigit(char &c){
return (c>='0' and c<='9');
}
public:
int calculate(string s) {
long long Sum=0, sign=+1;
stack<long long> stk;
int n=s.size();
for(int i=0;i<n;i++){
if(isDigit(s[i])){
long long val = 0;
... | ALGO | 0.999889 | 4.942606 |
842420d3-39d9-42b8-9c3d-d13b705902b2 | architag01/OOPs-in-Cpp | multipleinheritance.cpp | //WAP in C++ to demonstrate the concept of Multiple Inheritance
#include<iostream>
using namespace std;
class A
{
protected:
int i,j;
public:
void add()
{
cout<<i+j;
}
};
class B
{
protected:
int k,l;
public:
void mul()
{
cout<<k*l;
}
};
class C:public A, public B
{
public:
void set(in... | ALGO | 0.894865 | 4.720343 |
3a43ac76-e294-4dec-8430-7b22c6a03ee6 | MrDargad/CodeChef | 1000 - 1200 1* Beginner Level/1039 Card Removal (REMOVECARDS).cpp | #include <iostream>
using namespace std;
int main() {
int T;
cin>>T;
while(T--)
{
int N;
cin>>N;
int A[11]={0};
int max=0;
for(int i=0;i<N;i++)
{
int num;
cin>>num;
A[num]++;
if(A[num]>max)
max=A[num];
}
cout<<N-max<<endl;
}
return 0;
... | ALGO | 0.999677 | 3.476743 |
94b638fa-f40c-44a6-bde2-91d6f3113f59 | Arsham-LH/ProgrammingBasics | Midterm/midterm q2/main.cpp | #include <iostream>
using namespace std;
long long int power(int a,int n)
{
long long int r=1;
for (long long int i=1;i<=n;i++)
{
r*=a;
}
return r;
}
int main()
{
long long int m,n,k,m_,power=1,a;
cin>>m>>n>>k;
m_=m%k;
a=m_;
while (power<n)
{
a*=m_;
a%=k;
power++;
}
cout<<a;
return 0;
}
| ALGO | 0.999998 | 3.563161 |
040ae1ba-38c1-4d0b-bd20-55196549e292 | transbot/ThinkingInCPPChinese | ThinkingInCpp中文版代码/C06/SearchReplace.cpp | // STLҺ滻㷨
#include <algorithm>
#include <functional>
#include <vector>
#include "PrintSequence.h" // һԶͷļڴӡ
using namespace std;
// ԶνʣǷj == i + 1
struct PlusOne {
bool operator()(int i, int j) { return j == i + 1; }
};
// Զνʣij˻Ƿڸֵ
class MulMoreThan {
int value;
public:
MulMoreThan(int val) : value(v... | ALGO | 0.999622 | 4.476503 |
e1a1f307-2fa9-4b15-9b77-4d23cb615388 | sarthakkaingade/object_tracking | src/object_tracking.cpp | #include "object_tracking.h"
/**
* Object Tracking
*/
ObjectTracking::ObjectTracking() :
it_(nh_),
KF(6, 2, 0)
{
image_sub_ = it_.subscribe("/ps3_eye/image_raw", 1, &ObjectTracking::ImageCallback, this);
target_sub_ = nh_.subscribe("/SelectTargetPerFoRo", 1, &ObjectTracking::SelectTargetCallback, this);
mode_... | TOOL | 0.957391 | 5.792284 |
dd54fd3a-8e81-4c4e-8b7e-74a18fbe2d1e | sofikulsk02/DSA_in_c- | strings/TotalNumberOfDigits.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
string s=to_string(n);
cout<<s.length();
} | ALGO | 0.999674 | 4.036969 |
79c5ecc3-4aaa-46cc-b195-38e1dac494d2 | aniket-dev-ai/Sheriyans__DSA | 1299-replace-elements-with-greatest-element-on-right-side/1299-replace-elements-with-greatest-element-on-right-side.cpp | class Solution {
public:
int Greatest(vector<int>& arr , int i){
int c = 0;
for(i ; i<arr.size();i++){
if(c<arr[i]){
c=arr[i];}
}
return c;
}
vector<int> replaceElements(vector<int>& arr) {
for(int i = 0 ; i<arr.size()-1;i++){
arr[i]=Greatest(arr,i+1);
}
a... | ALGO | 0.99997 | 5.131973 |
9b33ad18-7a7f-48e2-830b-1e2a35d91068 | anantsingh404/Leetcode | 2262-solving-questions-with-brainpower/solving-questions-with-brainpower.cpp | class Solution {
public:
int n;
long long solve(int idx,vector<vector<int>>&q,vector<long long>&dp)
{
if(idx>=n)
{
return 0;
}
if(dp[idx]!=-1)
{
return dp[idx];
}
long long ans=INT_MIN;
ans=max(ans,q[idx][0]+solve(idx+q[idx][1]+1,q,dp));
ans=max(ans,solve(idx+1,q,dp))... | ALGO | 0.999941 | 4.998172 |
2ced6ce7-f4e4-41e9-90d2-c4d9d05b1654 | rwth-irt/irt_gnss_preprocessing | irt_gnss_preprocessing/third_party/gnss_tools/GNSSPreProcessingDualAntenna_ert_rtw/CalculateTroposphericCorrection.cpp | // Function for MATLAB Function: '<S29>/Calculate Tropospheric Corrections'
real_T GNSSPreProcessingDualAntenna::GNSSPreProcessingDualAn_interp1(const real_T varargin_1[5], const real_T
varargin_2[5], real_T varargin_3, B_CalculateTroposphericCorrec_T *localB)
{
real_T Vq;
int32_T low_i;
Vq = (rtNaN);
... | ALGO | 0.999201 | 6.163713 |
cda46381-87e3-4530-9ce5-1c54914155f5 | yahohulia/Practice_Work | PW_1_5/PW_1_5/Source1.cpp | #include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;
int findFirstOccurrence(int A[], int n, int P) {
int index = -1;
for (int i = 0; i < n; ++i) {
if (A[i] == P) {
index = i;
break;
}
}
return index;
}
int main() {
int n;
co... | ALGO | 0.999454 | 5.829248 |
4ae746e9-202c-462a-b67f-a90150a10c74 | shivaditya77/LEETCODE | 1260-shift-2d-grid/1260-shift-2d-grid.cpp | class Solution {
public:
vector<vector<int>> shiftGrid(vector<vector<int>>& grid, int k) {
int m=grid.size();
int n=grid[0].size();
vector<vector<int>>temp(m,vector<int>(n));
for(int r=0;r<m;r++)
{
for(int c=0;c<n;c++)
{
int dindex=((... | ALGO | 0.999958 | 6.331716 |
b837d90c-c23b-4e23-af8d-34be6afdf426 | benedicttan88/QuantLib | ql/pricingengines/basket/kirkengine.cpp | /* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
#include <ql/exercise.hpp>
#include <ql/math/functional.hpp>
#include <ql/pricingengines/basket/kirkengine.hpp>
#include <ql/pricingengines/blackcalculator.hpp>
#include <ql/pricingengines/blackformula.hpp>
#include <utility>
namespace Qu... | ALGO | 0.999314 | 7.382397 |
bca0ab20-c90d-4d05-af0d-89831581d281 | sarvex/leetcode-ocaml | solution/1600-1699/1670.Design Front Middle Back Queue/Solution.cpp | class FrontMiddleBackQueue {
public:
FrontMiddleBackQueue() {
}
void pushFront(int val) {
q1.push_front(val);
rebalance();
}
void pushMiddle(int val) {
q1.push_back(val);
rebalance();
}
void pushBack(int val) {
q2.push_back(val);
rebalance()... | ALGO | 0.999736 | 5.990326 |
6b953d35-8e64-43c6-bbb9-13460f18f78d | mohdhaider07/DSA | Heap/aditty.cpp | #include <iostream>
#include <stack>
#include <vector>
#include <map>
#include <queue>
using namespace std;
string isKSortedArray(int arr[], int n, int k)
{
stack<int> s1;
stack<int> s2;
for (int i = 0; i < n; i++)
{
if (!s1.empty() && arr[s1.top()] < arr[i])
{
while (!s1.... | ALGO | 0.999997 | 5.351276 |
f1cd8811-8e28-4ebc-bf8a-c17fa9661ee4 | azanahmed000/C--Problem-Solutions | basic proramms/product dicount c.cpp | #include<iostream>
using namespace std;
int main()
{
float pp,lp;
cout<<"Entert Product price and Loyality poiunts:";
cin>>pp>>lp;
int pd=10;
int ld=5;
float r_amo=pp-((pd*pp)/100);
cout<<"After discount of 10% you will pay:"<<r_amo;
float ldp=r_amo-((ld*r_amo)/100);
cout<< "the price for people having mem... | ALGO | 0.999237 | 3.5404 |
d1074b89-d2a5-4c9e-8935-3e8b317587cd | Minsu-Jung1999/EDCC_TASKS | project_5/lib/privatestrlib.cpp | /*
* File: privatestrlib.cpp
* -----------------------
* This file implements the privatestrlib.h interface.
* This functionality is considered "private" and not to be used by students.
*
* @version 2021/04/09
* - moved to private SGL namespace
* - renamed some functions to remove 'string' prefix
* @version 20... | TOOL | 0.908853 | 4.506197 |
4ba95970-874f-48a8-8047-13dd4371312b | OluwaseunOjeleye/Real-Time-Human-Gender-Detection | Gender_Detection_GPU/src/local_layer.cpp | #include "local_layer.h"
#include "utils.h"
#include "im2col.h"
#include "col2im.h"
#include "blas.h"
#include "gemm.h"
#include <stdio.h>
#include <time.h>
int local_out_height(local_layer l)
{
int h = l.h;
if (!l.pad) h -= l.size;
else h -= 1;
return h/l.stride + 1;
}
int local_out_width(local_layer... | DATA | 0.985502 | 4.679669 |
c0f8b1ad-a7cd-46ca-b807-7665b9d02e57 | EKA2L1/EKA2L1 | src/emu/cpu/src/12l1r/translate/vfp.cpp | #include <cpu/12l1r/arm_visitor.h>
#include <cpu/12l1r/block_gen.h>
#include <cpu/12l1r/visit_session.h>
#include <cpu/12l1r/core_state.h>
#include <functional>
namespace eka2l1::arm::r12l1 {
bool arm_translate_visitor::vfp_VMOV_reg(common::cc_flags cond, bool D, std::size_t Vd, bool sz, bool M, std::size_t Vm) {... | TOOL | 0.876024 | 6.179003 |
d5ee5058-76f3-4f4b-8b4a-aa74c52decac | Doem/Programming-Homework | HugeInteger - 1051522 - hw3.cpp | // Member-function definitions for class HugeInteger
#include <iostream>
using namespace std;
#include "HugeInteger.h" // include definition of class HugeInteger
// default constructor; construct a zero HugeInteger with size 1
HugeInteger::HugeInteger()
: integer(1) {
}
HugeInteger::HugeInteger(unsigned int n) {
in... | TOOL | 0.931615 | 4.576919 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.