uuid stringlengths 36 36 | repo_name stringlengths 5 123 | relative_path stringlengths 5 4k | content stringlengths 33 2.85M | category stringclasses 6
values | algo_rel_score float64 0.85 1 | quality_score float64 3 8.76 |
|---|---|---|---|---|---|---|
0820c45f-fa8f-4da7-a8ea-007a87f1d156 | RKanna/vscode-cpp-test-codes | DecimalToBinary.cpp | #include <iostream>
#include <vector>
using namespace std;
void DecimalToBinaryConversion(int decimal) {
vector<int> numVector;
int newVal;
do
{
newVal = decimal%2;
numVector.push_back(newVal);
decimal = decimal/2;
} while (decimal != 0);
for(auto val: numVector) {
cout <<... | ALGO | 0.999286 | 5.795053 |
8b509430-a825-40ed-a9a1-837d5a6b8a85 | manikanta2901/ubuntu | .history/codingChallenges/cpp/Codechef/longChallenges/Year2021/May/AnInterestingSequence_20210509153712.cpp | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
int k;
cin
}
return 0;
} | ALGO | 0.998891 | 3.426486 |
f85b2e03-a97c-408d-ad09-f414126863bc | yokotech/competitive_programming | AtCoder/abc/abc_140/3_abc140_c.cpp | // 3_abc140_c
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#inclu... | ALGO | 0.999969 | 3.52769 |
f58942d0-2e6f-4b8d-a833-cec60a51c7a4 | takumi152/atcoder | kupc2020c.cpp | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_std... | ALGO | 0.999974 | 3.874374 |
a49e1e85-21ce-4869-8d38-5bd36fd4c5ed | semsotsemm/KPO_2SEM | laba_4/laba4.1/laba4.2/laba4.2.cpp | #include <iostream>
using namespace std;
typedef unsigned int number;
typedef string depositType;
typedef unsigned int balance;
typedef string date;
typedef string fio;
typedef bool sms;
typedef bool banking;
struct bank {
depositType userType;
number userNumber;
balance userBalance;
date openingDate... | TOOL | 0.9188 | 3.316876 |
4aa8acb9-573c-4521-b04a-b37e215c0f86 | Junoquu/Coding_Training | SWEA/Unrated/1949. ［모의 SW 역량테스트］ 등산로 조성/［모의 SW 역량테스트］ 등산로 조성.cpp | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
struct Point
{
int y;
int x;
};
int T;
int N, K;
int maxDir;
int map[9][9];
int visited[9][9];
int peak = 0;
vector<Point> peaks;
int dy[4] = { -1,1,0,0 };
int dx[4] = { 0,0,-1,1 };
... | ALGO | 0.999852 | 4.071448 |
1f108f17-4124-4bbe-9665-8c07e2a7c68c | baojinchang/PAT | Speech_Patterns.cpp | #include <iostream>
#include <string>
#include<algorithm>
#include<map>
using namespace std;
bool jude(char &a)
{
if(a>='a'&&a<='z')
{
return true;
}
if (a>='A'&&a<='Z')
{
a = a + 32;
return true;
}
if (a>='0'&&a<='9')
{
return true;
}
return fal... | ALGO | 0.999945 | 3.958168 |
05123920-a132-4de8-8d7e-c643c01c7863 | rakesh-i/leetcode | 583.delete-operation-for-two-strings.cpp | /*
* @lc app=leetcode id=583 lang=cpp
*
* [583] Delete Operation for Two Strings
*/
// @lc code=start
class Solution {
public:
int dp[501][501];
int helper(string &w1, string &w2, int m, int n){
if(m==0||n==0){
return 0;
}
if(dp[m][n]!=-1){
return dp[m][n];
... | ALGO | 0.999963 | 6.438411 |
5759fc98-cc3e-4404-8b5a-db6b65a60083 | anlee798/ORB-SLAM2_modified | Thirdparty/eigen3/test/eigen2/eigen2_visitor.cpp | #include "main.h"
template<typename MatrixType> void matrixVisitor(const MatrixType& p)
{
typedef typename MatrixType::Scalar Scalar;
int rows = p.rows();
int cols = p.cols();
// construct a random matrix where all coefficients are different
MatrixType m;
m = MatrixType::Random(rows, cols);
for(int i =... | TEST | 0.919297 | 5.877094 |
e0b8d769-84a1-45cd-8f5c-d6734792e85e | Corycle/OI-Codes | Bashu OnlineJudge/3319.cpp | /*====Corycle====*/
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<cstdio>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<map>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int... | ALGO | 0.999883 | 3.868335 |
02786bf9-36c1-4b5c-9949-14387d3c4699 | Source-Authors/Obsoletium | game/server/h_ai.cpp | #include "cbase.h"
#include "game.h"
#include "vstdlib/random.h"
#include "movevars_shared.h"
// memdbgon must be the last include file in a .cpp file!!!
#include "tier0/memdbgon.h"
#define NUM_LATERAL_CHECKS 13 // how many checks are made on each side of a NPC looking for lateral cover
#define NUM_LATERAL_LOS_CH... | ALGO | 0.957794 | 6.011535 |
1a7be587-ab29-46ff-9526-3907248f1605 | Jody-Lu/Array | 393_UTF8_Validation/validUtf8.cpp | #include <iostream>
#include <vector>
using namespace std;
// Ff we meet data whose binary_len is larger than 8, then return false;
class Solution {
public:
bool validUtf8(vector<int>& data) {
int count = 0;
for(auto c : data) {
if(count == 0) {
if((c ... | ALGO | 0.991488 | 5.622572 |
2caffd6c-93c9-446f-8d4e-4d96ba654a3d | yuvraj1107thapa/Competitive-Programming | Algo++/Maths/CP/B_Sequence_Game.cpp | // #include<bits/stdc++.h>
// using namespace std;
// #define ll long long
// void file_i_o() {
// ios_base::sync_with_stdio(0);
// cin.tie(0);
// cout.tie(0);
// }
// void solve() {
// int t;
// cin >> t;
// while(t--) {
// ll n;
// cin >> n;
// vector<ll> a;
// ... | ALGO | 0.999752 | 3.887321 |
936587cb-737b-4ce5-b528-07936d0e492e | iamtiteuf/Algorithm-to-Control-Space_Swarms_ControlResearch | ExternalLibs/ct_optcon/examples/KalmanDisturbanceFiltering.cpp | /*!
* \example KalmanDisturbanceFiltering.cpp
*
* This example shows how to use the Kalman Filter to simultaneously estimate the state and the disturbance acting
* on a simple linear oscillator system. The gist of the example is that the state is augmented with a disturbance
* and the system dynamics is augmente... | ALGO | 0.977576 | 6.92739 |
3de536a9-8e7d-4926-bcc2-b5c551039a29 | PRAVEENKUMAR2003/Practice-codes | mergeit.cpp | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <string.h>
#include <algorithm>
#include <set>
#include <vector>
using namespace std;
int d;
void merge(vector <int> &a)
{
vector <int> b, c;
int q = 0, w = 0;
if (a.size() != 1)
{
for (int k = 0; k < a.size() / 2... | ALGO | 0.999953 | 4.363946 |
43bf87f9-7b68-4b83-99c1-376f19aa703a | PIPS-IPMpp/PIPS-IPMpp | PIPS-IPM/Core/Problems/Problem.cpp | #include "Problem.hpp"
#include "Variables.h"
#include "AbstractMatrix.h"
#include "MpsReader.h"
#include <iomanip>
#include <cmath>
Problem::Problem(std::shared_ptr<Vector<double>> g_in, std::shared_ptr<SymmetricMatrix> Q_in,
std::shared_ptr<Vector<double>> xlow_in,
std::shared_ptr<Vector<double>> ixlow_in,... | ALGO | 0.967166 | 5.867939 |
41605fa0-c8ff-4f15-b328-3deb7bb86370 | Intermodalics/pcl-debian | tools/crf_segmentation.cpp | #include <pcl/io/pcd_io.h>
#include <pcl/console/print.h>
#include <pcl/console/parse.h>
#include <pcl/console/time.h>
#include <pcl/segmentation/crf_segmentation.h>
#include <pcl/features/normal_3d.h>
using namespace pcl;
using namespace pcl::io;
using namespace pcl::console;
float default_leaf_size = 0.005f;
doubl... | DATA | 0.979315 | 6.286003 |
b4a6b56c-7c3d-499d-b519-92201c6522f4 | ItsShivam05/DSA- | 2766-find-the-prefix-common-array-of-two-arrays/find-the-prefix-common-array-of-two-arrays.cpp | class Solution {
public:
vector<int> findThePrefixCommonArray(vector<int>& A, vector<int>& B) {
int n = A.size();
vector<int>ans(n,0);
for(int i = 0;i<A.size();i++)
{
int count = 0;
for(int Ai = 0;Ai<=i;Ai++)
{
for(int Aj = 0;Aj<=i;... | ALGO | 0.999953 | 5.867548 |
90a3e3ca-abf9-4753-9e2c-869409cec651 | JainitBITW/CP | CSES/ss/3.cpp | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define FOK(i, a, n) for (int i = n; i > a; i--)
#define JALDI ios_base::sync_with_stdio(false);
#define jaldi cin.tie(NULL);
#define F first
#define MP make_pair
#define PB push_back
#define S second
#define nl cout << endl
... | ALGO | 0.999957 | 4.268009 |
0e109005-7fe0-4e58-804d-f263c034b1c6 | Avninder99/LeetCode_GFG_Solutions | 509-fibonacci-number/509-fibonacci-number.cpp | class Solution {
public:
int fib(int n) {
int prev = 1, prev2 = 0, curr;
if(n < 2) return n;
for(int i=2;i<=n;i++){
curr = prev + prev2;
prev2 = prev;
prev = curr;
}
return curr;
}
}; | ALGO | 0.999995 | 6.115061 |
4444e8a9-07c5-4aeb-a91d-b7596ee26832 | jollyjinx/idl4k | boost_1_53_0/libs/spirit/example/qi/compiler_tutorial/calc2.cpp | ///////////////////////////////////////////////////////////////////////////////
//
// A Calculator example demonstrating the grammar and semantic actions
// using plain functions. The parser prints code suitable for a stack
// based virtual machine.
//
// [ JDG May 10, 2002 ] spirit1
// [ JDG March 4, 2007 ... | TOOL | 0.967612 | 7.565277 |
069cd4c1-9b96-4cc0-b5db-fb559d75d7f8 | aditya059/LeetCode-Solutions | 0424-longest-repeating-character-replacement/0424-longest-repeating-character-replacement.cpp | class Solution {
public:
int characterReplacement(string s, int k) {
int count[26] = {0};
int maxCount = 0;
int start = 0;
int end = 0;
int ans = 0;
while(end < s.length()) {
count[s[end] - 'A']++;
if(maxCount < count[s[end] - 'A'])
... | ALGO | 0.999989 | 6.31769 |
3ba608c4-9194-4cbe-b065-0c84e1a0c668 | deepak-ky/cpp-codes | cpp-codes/topological_sorting_dfs.cpp | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define varname(name) #name
#define mod 1000000007
#define wer(x) cout<<"\n"<<varname(x)<<" here : "<<x<<"\n"
#define asdf(a,n) ... | ALGO | 0.999971 | 4.707918 |
64ff66ff-af8b-4424-b925-41148ec642e6 | Mitesh12ehd/DSA | 4. Binary Search/q3_LastOccurence.cpp | #include<iostream>
#include<algorithm>
using namespace std;
int LastOccurence(int arr[],int key,int size){
int start = 0;
int end = size-1;
int mid = start + (end-start)/2; // mid = (start+end)/2
int index = -1;
while(start<=end){
if(arr[mid] == key){
//store index and right ... | ALGO | 0.999892 | 4.776313 |
30ccd9b8-3731-4350-b7e4-49cfeab0aa0b | darshan-na/Keras_clone | vanilla_rnn.cpp | #include "vanilla_rnn.h"
#include "activations.h"
template<typename T,typename Activation,typename output_activation>
void vanilla_Rnn<T,Activation,output_activation>::weight_initialization()
{
random_device rd;
mt19937 gen(rd());
std::normal_distribution<float> d(0,1);
generate(this->w_x.data.begin()... | ALGO | 0.996615 | 5.053453 |
4d4b512c-03eb-4fe7-b067-4b9b80de49d7 | jaynishmehta/LeetCode | 0215-kth-largest-element-in-an-array/0215-kth-largest-element-in-an-array.cpp | class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
priority_queue<int>pq;
for(auto it:nums)pq.push(it);
int prev=0;
for(int i=0;i<k;i++){
prev= pq.top();
pq.pop();
}
return prev;
}
}; | ALGO | 0.999884 | 5.019397 |
add11166-4372-41c3-bb1a-627d0a651c73 | chanchal2003/Topic-Wise-DSA | 19. Binary Exponention/code.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, ans=1;
cin>>a>>b;
while(b){
if(b&1){
ans = ans * a;
}
a = a*a;
b = b>>1;
}
cout<<a<<endl;
return 0;
} | ALGO | 0.999972 | 4.319754 |
63801fdf-b56f-4905-b3b8-19d0b6e22ef1 | Shubhamsahu1101/cpp | Candies.cpp | #include <bits/stdc++.h>
#define forall(it, cont) for (auto it = cont.begin(); it != cont.end(); it++)
#define forl(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define int long long
#define pb push_back
#define M 1000000007
#define yes cout << "YES" << endl
#define no cout <<... | ALGO | 0.994704 | 3.95819 |
a94ceb26-b3fe-4c47-9794-1ae91b100e4a | blogdefotsec/Unitree_SDK_Extended | original_SDK/unitree_slam/20250410/module/Odometer_service/src/rpg_svo_pro_open/svo_direct/src/matcher.cpp | #include <svo/direct/matcher.h>
#include <cstdlib>
#include <random>
#include <chrono>
#include <vikit/vision.h>
#include <vikit/math_utils.h>
#include <kindr/minimal/angle-axis.h>
#include <svo/direct/patch_warp.h>
#include <svo/direct/patch_score.h>
#include <svo/direct/patch_utils.h>
#include <svo/common/frame.h>... | ALGO | 0.998886 | 6.096708 |
a2a54a44-7640-4a5b-9b73-f2fd3448f4d6 | medcsb/for-vulkan-tutorial | extern/glm/test/core/core_func_integer_find_msb.cpp | #include <glm/glm.hpp>
#include <cstdio>
#include <cstdlib> // To define "exit", req'd by XLC.
#include <ctime>
#ifdef NDEBUG
#define LE 1 // 1 for little-endian, 0 for big-endian.
static int pop(unsigned x) {
x = x - ((x >> 1) & 0x55555555);
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x ... | ALGO | 0.997891 | 3.326288 |
43f4897a-5014-4d52-8e77-f29c0cb8f947 | code-syl/ransomware-psp | DecryptorV2/CryptoPP/sha3.cpp | // sha3.cpp - modified by Wei Dai from Ronny Van Keer's public domain
// Keccak-simple.c. All modifications here are placed in the
// public domain by Wei Dai.
// Keccack core function moved to keccakc.cpp in AUG 2018
// by Jeffrey Walton. Separating the core file allows both... | ALGO | 0.99512 | 6.945646 |
158a57cf-1559-471a-b84a-29a6193e7132 | itsjay07/GFG | Transitive closure of a Graph.cpp | class Solution{
public:
vector<vector<int>> transitiveClosure(int N, vector<vector<int>> graph)
{
vector<vector<int>> index;
for (int i = 0; i < N; i++)
{
vector<int> checked(N, 0);
dfs(i, graph, checked, N);
index.push_back(checked)... | ALGO | 0.999923 | 6.147008 |
2f9bddb0-b6a1-47b2-a852-aba256535146 | HaniCodeHub/Data-Structures-Lab | LAB 11 (Queue)/queue.cpp | #include <iostream>
using namespace std;
int queue[100], n = 100, front = -1, rear = -1;
void inqueue() {
int val;
if (rear == n - 1) {
cout << "Queue Overflow" << endl;
return;
} else {
cout << "Insert the element in queue: ";
cin >> val;
if (front == -1) front = 0... | ALGO | 0.981876 | 5.189816 |
7c2541f6-47ca-4c46-96cf-a5a567a7bd06 | theethawat17/FoodApp | 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.998733 | 6.76775 |
91a4d0ed-0ae6-43a0-86a2-d37e0ec0bb23 | zhangxinfu200516/AGV_Board | User/Middleware/Algorithm/alg_power_limit.cpp | /**
* @file alg_power_limit.h
* @author qyx
* @brief 自适应功率限制算法
* @version 1.2
* @date
*
* @copyright ZLLC 2025
*
*/
#include "alg_power_limit.h"
#include "math.h"
/* Private macros ------------------------------------------------------------*/
/* Private types ------------------------------------------------... | ALGO | 0.999811 | 5.88133 |
1fd34bb5-37ee-4479-adb6-2dafd913a32e | su-giana/algorithm | leetcode/133.cpp | #include <iostream>
#include <vector>
using namespace std;
// 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 ... | ALGO | 0.999912 | 6.011733 |
c2a669c7-1f05-4bce-be38-1c8fbd81e973 | raincross7/code-similarity | codes/train_code/problem186/problem186_344.cpp | //#include<bits/stdc++.h>
#include<iostream>
using namespace std;
typedef long long ll;
const int N = 2000006;
int a[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++){
int x;
cin>>x;
}
cout<<(1 + (n-2)/(k-1))<<endl;
return 0;
}
| ALGO | 0.999099 | 3.365506 |
42f0b40b-d499-404d-b846-a8b85229a470 | ishandutta2007/codeforces | anta/normal/696/D.cpp | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<... | ALGO | 0.999769 | 3.373092 |
42d86327-21ee-462f-a293-81651a6e3753 | fhvirus/CodeArchive | CSES/1682.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n, m;
cin >> n >> m;
vector<vector<int>> adj(n + 1);
for (int a, b, i = 0; i < m; ++i) {
cin >> a >> b;
adj[a].push_back(b);
}
vector<int> vis(n + 1), out(n + 1), stk;
... | ALGO | 0.999904 | 4.137167 |
7e8d0ef6-9616-432f-948e-b20b67a23f58 | Antoniomondejar/CompetitiveProgramming | tap/M.cpp | #include <bits/stdc++.h>
#define fst first
#define snd second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) ((int ) x.size())
#define fore(i,a,b) for(int i=a,gmat=b;i<gmat;++i)
#define FIN ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define mst(a,v) memset((a),(v),sizeof(a))
using namespace std... | ALGO | 0.999804 | 4.789511 |
a5e08cfb-2780-4e55-84e9-ca9fd8c53531 | virajchandra51/LeetCode | Solved_Question_Set_1/104-maximum-depth-of-binary-tree/104-maximum-depth-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.999766 | 6.086387 |
33a83f26-aa66-487d-b886-d46ad9feccc3 | mridha-rakib/Problem-Solving | Math/Divisibility/162A_CF.cpp | #include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main()
{
optimize();
int n;
cin >> n;
vector<int> factors;
for( int i = 2; i <= n; i++ )
{
while( n % i == 0){
factors.push_back( i );
n /... | ALGO | 0.999948 | 4.151539 |
0fddcfdd-e4ef-4309-b829-f5bd0c1957ae | alopezccordero/PF3_project | To-do-list-index.cpp | #include <iostream>
#include <string>
using namespace std;
// Base class representing a general Task
class Task {
public:
string taskName;
int taskPriority;
bool taskCompleted;
Task() : taskName(""), taskPriority(0), taskCompleted(false) {}
Task(string name, int priority) : taskName(name), taskPr... | ALGO | 0.991992 | 6.97415 |
f653567d-34d2-4766-bae2-d33674bcea8f | piDack/magma | magmablas_hip/hlaswp.hip.cpp | #include "hip/hip_runtime.h"
/*
-- MAGMA (version 2.7.1) --
Univ. of Tennessee, Knoxville
Univ. of California, Berkeley
Univ. of Colorado, Denver
@date February 2023
@author Azzam haidar
*/
#include "magma_internal.h"
// MAX_PIVOTS is maximum number of pivots to apply in each ke... | ALGO | 0.999204 | 5.414399 |
e1ea146c-4285-49ff-9f84-8b2f34da85b7 | euchangxian/LeetCode | C++/1267-CountServersThatCommunicate/Solution.cpp | #include <array>
#include <cstddef>
#include <cstdlib>
#include <vector>
class Solution {
public:
int countServers(std::vector<std::vector<int>>& grid) {
// m * n binary matrix.
// grid[i][j] == 1 => server, 0 => no server.
// two servers are communicating if they are on the same row/column.
// Numb... | ALGO | 0.999754 | 7.15962 |
9c0a7a06-abcf-42ba-903c-95848a0361bd | TW299/AGAMAAFTG | AGAMANEW/TORUS/pjmnum.cpp | #include <cmath>
#include <iostream>
#include <iomanip>
#include <algorithm>
namespace torus {
using std::cerr;
// A lot like Press et al's version.
////////////////////////////////////////////////////////////////////////////////
double trapzd(double(*func)(double), const double a, const double b,const int n)
{
stat... | ALGO | 0.999759 | 4.630093 |
93f157a3-c544-47cc-b001-9f259c8080c1 | chandu-arc/Using-Functions-C-codes | Table3 using Functions.cpp | // Print Table using functions
#include<stdio.h>
void Check(int);
main()
{
int x;
printf("Enter x value:");
scanf("%d",&x);
Check(x);
Check(10);
}
void Check(int n)
{
int i=1;
while (i<=10)
{
printf("%d * %d = %d \n",n,i,n*i);
i++;
}
printf("\n");
}
| ALGO | 0.975462 | 4.136335 |
be5ac084-4c0d-4e20-be7e-e8c80618c85f | SameerPatil20/Competitive_programming_Sam_2027 | Codeforces/RandomCodeforces/D_Maximize_the_Root.cpp | #include<bits/stdc++.h>
#define rp(n) for(decltype(n) i=0;i<n;i++)
#define rp2(n,j) for(decltype(n) j=0;j<n;j++)
#define ll long long int
#define set(a,n,k) for(int lambda=0;lambda<n;lambda++){a[lambda]=k;}
#define out(a,n,k) for(int lambda=0;lambda<n;lambda++){cout<<a[lambda]<<k;}
#define ain(a,n) for(int lambda=0;lam... | ALGO | 0.999882 | 3.752246 |
b2fd7872-46f8-4315-a6b4-076e59a9ea0f | DavidMzNeto/C | C/atv14.cpp | #include <stdio.h>
int main(){
int num;
scanf("%i", &num);
if (num % 5==0)
{
printf("Esse numero e divisivel por 5");
}
else
{
printf("Esse numero no e divisilve por 5");
}
}
| ALGO | 0.996848 | 3.597818 |
b75f9287-6807-4bea-bc71-1b0086a66349 | rajith21/-sdechallengestriver | Kth largest element in the unsorted array.cpp | int kthLargest(vector<int>& arr, int size, int K)
{
sort(arr.begin(),arr.end());
return arr[size-K];
}
| ALGO | 0.999647 | 4.308546 |
683f0d58-dcd4-445f-8153-c50f7ba80610 | code229/online_judge_code | B. Maria Breaks the Self-isolation.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
int ans=n+1,ii=-1;
int i=0;
while(i<n){
int l=-1;
for(int j=... | ALGO | 0.999869 | 3.369169 |
898a394c-5c59-485d-b841-3fe123cc2773 | vaibhavsoni7389/ffmpeg | src/opencore-amr/opencore/codecs_v2/audio/gsm_amr/amr_wb/dec/src/pvamrwbdecoder.cpp | /*
------------------------------------------------------------------------------
Filename: pvamrwbdecoder.cpp
------------------------------------------------------------------------------
INPUT AND OUTPUT DEFINITIONS
int16 mode, input : used mode
int16 prms[], in... | ALGO | 0.992059 | 4.533881 |
34f11b83-170e-4b05-b81b-ad69419584a1 | Madhuu-k/DSA-Grind | Maps and Sets/Frequency count using map.cpp | #include<iostream>
#include<unordered_map>
using namespace std;
int main() {
string name = "MadhuSudhanRao";
unordered_map<char, int> freq;
for (char c : name) {
freq[c]++;
}
for (auto i : freq) {
if (i.second == 1) cout << i.first << ": " << i.second << endl;
}
return 0;
} | ALGO | 0.997412 | 4.23071 |
b7bf53b8-ae45-44bb-8a03-ec412f95d585 | om-1980/CPC_TASKS | Week2/splitSinglyLinkedList.cpp | #include <iostream>
#include <stdio.h>
using namespace std;
struct Node
{
int data;
struct Node* next;
Node(int x){
data = x;
next = NULL;
}
};
void append(struct Node** headRef, int newData)
{
struct Node* new_node = new Node(newData);
struct Node *last = *headRef;
if (*headRef == NULL)
{
... | ALGO | 0.999645 | 3.918413 |
5885ee3a-3332-4ce5-bfd4-20286c79ebb0 | Mounees-321/C-_DSA | BinaryTree.cpp | #include<iostream>
#include<queue>
using namespace std;
struct Node
{
int data;
Node *left;
Node *right;
Node():data(0),left(nullptr),right(nullptr){}
Node(int vl):data(vl),left(nullptr),right(nullptr){}
};
Node* Root = nullptr;
Node* Insert(Node* root,int vl)//Level Order Insert
{
if(!r... | ALGO | 0.999833 | 3.998481 |
95943c15-7e8a-45ad-a2e9-7ae0646f4033 | king-yyf/cpcode | codeforce/practice/1148c.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n;
cin >> n;
vector<int> p(n), a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
a[i]--;
p[a[i]] = i;
}
vector<array<int, 2>> ops;
fo... | ALGO | 0.999895 | 3.904429 |
d1181013-57d6-4ac9-9610-9a675fc04c28 | cristianxiix/HW-DISTINCT-NUMBERS-ARRAY-PROJ | HW DISTINCT NUMBERS ARRAY PROJ/Functions.cpp | #pragma once
#include "Functions.h"
bool checkDistinct(std::vector<int16>& v)
{
bool isDistinct = true;
for (int i = 0; i < v.size(); i++)
{
for (int j = i + 1; j < v.size(); j++)
{
if (v[i] != v[j])
{
i++;
continue;
}
... | ALGO | 0.998262 | 4.620075 |
88f026a3-3c63-48ef-8327-426e1c7cccd2 | sounak999/LeetCode-GFG-Submissions | Value equal to index value - GFG/value-equal-to-index-value.cpp | // { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution{
public:
vector<int> valueEqualToIndex(int arr[], int n) {
vector<int> ans;
for(int i=0; i<n; i++)
{
if(arr[i] == (i+1))
ans.push_back(i+1)... | ALGO | 0.999298 | 5.439241 |
95c9d953-dd49-4a43-b351-60df4a7a598f | Taranum01/LeetCode | 1463-the-k-weakest-rows-in-a-matrix/1463-the-k-weakest-rows-in-a-matrix.cpp | class Solution {
public:
typedef pair<int, int> P;
int binarySearch(vector<int>& arr, int l, int r) {
int mid;
int res = -1;
while(l <= r) {
mid = l + (r-l)/2;
if(arr[mid] == 1) {
res = mid;
l = mid+1... | ALGO | 0.99998 | 5.704237 |
13fa34fa-eb0c-41cd-a633-838a1c5f1e91 | Aqendo/olproga | yandex/sbori/dp1/A.cpp | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
const int INF = 1e9 + 7;
void solve() {
int n, x, answer = 0;
cin >> n >> x;
vector<int> t(n + 1), r(n + 2, -INF), lastnvp(n + 1), nvp(n + 2, INF);
r[0] = INF;
nvp[0] = -INF;
for (int i = 1; i <= n; ++i) {
cin >> t[i];
... | ALGO | 0.999969 | 4.909416 |
832bd1d5-a30d-4757-ae27-b5b382f2f138 | lxylxy123456/algorithms | src/MatrixChainOrderTest.cpp | #include "MatrixChainOrder.hpp"
#include <cassert>
#include <iostream>
#include <vector>
#include "test_utils.hpp"
#include "utils.hpp"
using namespace algorithms;
int test_chain(int n, int a) {
VECT_SIZT p;
std::vector<VECT_SIZT> s(n, VECT_SIZT(n + 1, 0));
random_integers<std::size_t>(p, 1, a, n + 1);
output_i... | TEST | 0.991203 | 4.538143 |
d28bfde3-cc5f-4b40-82c7-de8f3a766ea4 | ykc0131/Algorithm | BOJ/1931.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, s, e, num = 0;
cin >> N;
vector<pair<int, int>> t;
for (int i = 0; i < N; i++) {
cin >> s >> e;
t.push_back(make_pair(s, e));
}
sort(t.begin(), t.end(), [](pair<int, int> a, pair<int, int> b) {
if (a.seco... | ALGO | 0.999974 | 4.272351 |
14c2af15-bf76-4567-b89b-be243539c7ca | rohan-goyal-1/CP | CSES/ReadingBooks.cpp | #include <algorithm>
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <v... | ALGO | 0.999711 | 4.427584 |
0912dc9f-79bc-4634-8c6f-f32b1b7794da | Lukashatirishvili/CodingChallenges | aiasoft/299 - aiasoft.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int a[n + 1];
a[1] = 1;
a[2] = 2;
a[3] = 4;
for (int i = 4; i <= n; i++) {
a[i] = a[i - 1] + a[i - 2] + a[i - 3];
}
cout << a[n];
}
| ALGO | 0.999983 | 4.250674 |
2b4a1754-294e-4892-b306-07a4c59888d0 | ZamanNazmul/CodeForces-Problem-Solve | 1661a.cpp | // NAZMUL ZAMAN _BSC in IT
#include <bits/stdc++.h>
using namespace std;
#include<algorithm>
#include<string.h>
#include<cstdio>
#include<math.h>
#include<cmath>
#include<stdlib.h>
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define lop(i,n) for(int i=0;i<n;i++)
#define lop1(i,... | ALGO | 0.999813 | 3.656548 |
581f4116-a489-46e4-a82f-f320d9045e91 | S-Kishore-Balaji/Programs | Program 22-Days in a month.cpp | //days in a month
#include <stdio.h>
int main()
{
int a,b;
printf("Enter Year and Month Number: ");
scanf("%d %d",&a,&b);
if (b==1 || b==3 || b==5 || b==7 || b==8 || b== 10 || b==12)
printf("There are 31 days in this month.");
else if (b==4 || b==6 || b==9 || b==11)
printf("There are 30 days in this month.");
e... | ALGO | 0.997405 | 3.25789 |
4a1c7cb6-a9d0-4afe-a003-91628c323053 | Phoe-nix-89/LeetCode-Solution | Leetcode3274.cpp | #include<bits/stdc++.h>
using namespace std;
/* https://leetcode.com/problems/check-if-two-chessboard-squares-have-the-same-color/ */
class Solution {
public:
bool checkTwoChessboards(string c1, string c2) {
int x1 = c1[0] - 'a';
int x2 = c2[0] - 'a';
int y1 = c1[1] - '0';
int y2 =... | ALGO | 0.999854 | 5.893329 |
92dbded7-1364-4751-8bc2-7e81c2ddd4f9 | DanielKriz/AoC | AoC22/day11/part2/main.cpp | #include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <regex>
#include <sstream>
#include <string_view>
#include <utility>
#include <vector>
namespace aoc {
struct Monkey {
Monkey(
int testValue,
std::pair<int, int> operands,
std::pair<i... | ALGO | 0.996785 | 5.433229 |
4a61e1ce-1901-4a91-af66-3eef46091817 | GaurishIIITNR/CP-Problems-Solutions | 102_Coprimes.cpp | /*
========================================================================================
// ****हर हर महादेव🙏🙏***** //
// ***AUTHOR: GAURISH OJHA** //
// *****DATE: 17-03-2022**** //
// ******TIME:... | ALGO | 0.99923 | 5.233573 |
d25696d8-9505-4099-86b1-1a1aaab787e2 | shubhamv19/DSA__1 | DPP4/lcs.cpp |
#include<bits/stdc++.h>
using namespace std;
int lcs(string str1,string str2,int n,int m){
if (n==0|| m==0)return 0;
if(str1[n-1]==str2[m-1]){
return 1+lcs(str1,str2,n-1,m-1);
}
return max(lcs(str1,str2,n,m-1),lcs(str1,str2,n-1,m));
}
int main(){
string str1="ABCDGH";
string str2="A... | ALGO | 0.999993 | 4.759969 |
23d1c0ca-1ba0-42e5-999e-3a5943c8ab9b | Abdullah-Niaz/Data-Structure-Algorithm | Uni_End/Ass_Algorithm/Assignments/ASS_1/2_Odd/odd.cpp | #include <iostream>
using namespace std;
void printOddNumbers(int N) {
for (int i = 1; i <= N; ++i) {
if (i % 2 != 0) {
cout << i << " ";
}
}
cout << endl;
}
int main() {
int N;
// Prompting user for input
cout << "Enter a number N: ";
cin >> N;
/... | ALGO | 0.999581 | 5.709039 |
6418b6f7-28fa-49c8-a345-799167f37f71 | efc004u1m/Labs | 5/q1/test_cases/read.cpp | #include <bits/stdc++.h>
using namespace std;
ifstream fin, fout;
int main () {
int n;
fin.open("in01.txt");
fin >> n;
cout << n << endl;
string first, last;
int age;
for (int i = 0; i < n; ++i) {
fin >> first >> last;
fin >> age;
cout << first << " " << last << ... | ALGO | 0.95426 | 3.405474 |
3c355608-7f3e-4539-8dc2-07b76f39e755 | harsh13579/CPP-Codeforces-Codes | 1100/split_sort.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int t,n;
cin>>t;
while(t--)
{
int res=0;
cin>>n;
map<int,int>m;
vector<int>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
m[v[i]]=i;
}
sort(v.begin(),v.end());
... | ALGO | 0.999908 | 4.332246 |
c23202b8-ee53-471e-8207-ed820b03488d | mmKALLL/qlearning2 | src/include/Box2D/Dynamics/Contacts/b2ChainAndCircleContact.cpp | #include <Box2D/Dynamics/Contacts/b2ChainAndCircleContact.h>
#include <Box2D/Common/b2BlockAllocator.h>
#include <Box2D/Dynamics/b2Fixture.h>
#include <Box2D/Collision/Shapes/b2ChainShape.h>
#include <Box2D/Collision/Shapes/b2EdgeShape.h>
#include <new>
b2Contact* b2ChainAndCircleContact::Create(b2Fixture* fixtureA, ... | ALGO | 0.974685 | 6.49728 |
ad401912-b4f1-4210-aaf7-bbf6c331da88 | Yashmenaria1/Leetcode_daily_solutions | 1823. Find the Winner of the Circular Game.cpp | class Solution {
public:
int findTheWinner(int n, int k) {
if (n==1) return 1;
return (findTheWinner(n-1, k)+(k-1))%n+1;
}
};
| ALGO | 0.999995 | 5.619322 |
2387d472-6923-4f80-9a35-fd93af55f520 | dhrubajyotinath6/LEETCODE-QUESTIONS | Left View of Binary Tree - GFG/left-view-of-binary-tree.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// Tree Node
struct Node
{
int data;
Node* left;
Node* right;
};
vector<int> leftView(struct Node *root);
// Utility function to create a new Tree Node
Node* newNode(int val)
{
Node* temp = new Node;
temp->data = val;
temp->... | ALGO | 0.999436 | 6.841691 |
a48a1086-95f5-405c-aaac-7b31c6dd2153 | vedantpople4/CodeChef_Solutions | CANDY123.cpp | #include <bits/stdc++.h>
#define ll long long int
#define db double
#define pb push_back
#define mpr make_pair
#define andl "\n"
#define f first
#define s second
#define mset(x,y) memset(x,y,sizeof(x))
#define fr(i,h,n) for(long long int i=h;i<n;i++)
#define trace(it,x) for(auto it = (x).begin(); it != (x).end(); it++)... | ALGO | 0.999941 | 3.818983 |
c2d94b74-1bb7-47f3-8873-7be0161a9587 | kmjp/procon | 2017-2021/2020/codecraft/a2.cpp | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... | ALGO | 0.99995 | 4.577667 |
33b2842b-10f3-4684-84ae-33f280cf9391 | amaan8302/Leetcode | 0312-burst-balloons/0312-burst-balloons.cpp | class Solution {
public:
int solve(int i , int n , vector<int>& nums,vector<vector<int>>&dp)
{
if(i>n)
return 0;
if(dp[i][n]!=-1)
return dp[i][n];
int maxi = INT_MIN;
for(int m = i ; m<=n ; m++)
{
int cost = nums[i-1]*nums[m]*nums[n+1] ... | ALGO | 0.999986 | 5.245786 |
64e0a65b-237a-4028-a483-7c2fb96d7ebc | divyanshchawla23/daily-code | 1035-cousins-in-binary-tree/cousins-in-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.999993 | 5.860025 |
c94c37b1-7f6e-4cfe-9997-55d3a4281082 | warfka/prot | tst.cpp | /*!
\brief Алгоритм Евклида
\param a,b Два числа, чей наибольший делитель мы хотим найти
Данная функция реализует алгоритм Евклида, при помощи которого
находится наибольшее общее кратное у двух чисел.
Код функции выглядит следующим образом:
\code
int gcd(int a, int b) {
... | ALGO | 0.998891 | 4.809322 |
6a66f0a5-c2eb-4671-8508-34d8e4bb1523 | Shruhil/codefprces-problem-set | 982_q3.cpp | #include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vll vector<long long>
#define vvll vector<vector<long long>>
#define vvi vector<vector<int>>
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1e9+7;
#define ll long long
#define um unordered_map<int,int>
#define s... | ALGO | 0.999871 | 4.300879 |
48ff11bc-8a6f-4ff3-9b38-5d59212fea0a | taahahussainkhan/Coursework | Operating System/Lab Tasks/lab3task4.cpp | #include <stdio.h>
#include <stdbool.h>
void checkPrimeNumber(int num) {
bool isPrime = true;
if (num <= 1) {
isPrime = false;
} else {
for (int i = 2; i <= num / 2; i++) {
if (num % i == 0) {
isPrime = false;
break;
}
}
}
if (isPrime) {
printf("%d is a prime num... | ALGO | 0.999391 | 4.756964 |
495f7639-836b-4aae-9541-9e30266da351 | iagozag/competitive_programming | contests/cf/contest/2000/a/a.cpp | #include <bits/stdc++.h>
using namespace std;
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define rep(i,x,n) for(auto i=x;i<n;i++)
#define repr(i,n,x) for(auto i=n;i>=x;i--)
#define forr(x, v) for(auto& x: v)
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a.size())
#define endl '\n'
#define ff first
... | ALGO | 0.99972 | 3.931103 |
02fa039b-7161-4eec-98b7-b0b8fb015209 | DariaChaiuk/UnityGameProject | Library/PackageCache/com.unity.ide.visualstudio@2.0.17/Editor/COMIntegration/COMIntegration~/COMIntegration.cpp | #include <iostream>
#include <sstream>
#include <string>
#include <filesystem>
#include <windows.h>
#include <shlwapi.h>
#include <fcntl.h>
#include <io.h>
#include "BStrHolder.h"
#include "ComPtr.h"
#include "dte80a.tlh"
constexpr int RETRY_INTERVAL_MS = 150;
constexpr int TIMEOUT_MS = 10000;
// Often a DTE call m... | TOOL | 0.939417 | 6.926379 |
2c25f976-8648-414d-8cfa-ee1ff019308e | Shihabulminhaz/My_Competitive_Programming_Code | Codeforces/A/580A.cpp | #include<bits/stdc++.h>
using namespace std;
#define fi(a) scanf("%d",&a);
#define fli(a) scanf("%ld",&a);
#define fll(a) scanf("%lld",&a);
#define pi(a) printf("%d\n",a);
#define ppi(i,a) printf("Case %d: %d\n",i,a);
#define ll long long
int main()
{
int n,x,mx=1,cnt=1,f;
cin >> n;
for(int i=0; i<n; i++)... | ALGO | 0.999964 | 3.916962 |
73ca7843-0375-4afd-acaf-14987ff44fda | RamMotwani/Classes-and-Objects | asi 3 ans 9.cpp | #include<iostream>
using namespace std;
class circle
{
int radius;
public:
void setvalue(int x)
{
radius=x;
}
void showcirclearea()
{
cout<<"Area of circle is "<<3.14*radius*radius<<endl;
}
};
int main()
{
circle area;
area.setvalue(5);
area.showcirclearea();
... | TOOL | 0.974429 | 5.077609 |
5c087034-9adc-496c-af1d-f9a2491e3992 | nithashifana/leetcode-submissions | 3516.cpp | // Find closest person
// Easy
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int findClosest(int x, int y, int z) {
int a = x > z ? x-z : z-x;
int b = y > z ? y-z : z-y;
if(a>b) return 2;
else if(b>a) return 1;
return 0;
}
}; | ALGO | 0.999908 | 4.251252 |
fcf170b4-16ef-452c-b186-b248f1645269 | Subhraneel77/Leetcodes-Solutions | 1289-minimum-falling-path-sum-ii/1289-minimum-falling-path-sum-ii.cpp | class Solution {
public:
int minFallingPathSum(vector<vector<int>>& grid) {
int n = grid.size(), m = grid[0].size();
int res = INT_MAX;
vector<vector<int>> dp(n, vector<int>(m, -1));
for(int j = 0; j < m; ++j) {
dp[0][j] = grid[0][j];
}
for(int i = 1; i ... | ALGO | 0.999989 | 6.34995 |
063a06a4-4aaf-4ee1-83fb-53acaa3e7569 | Luismeza1/Portafolio-LAAM-00311319 | Portafolio_02.cpp | #include <iostream>
using namespace std;
void sumarMatriz(int a[2][2], int b[2][2]);
int main(void) {
int A[2][2];
int B[2][2];
for (int i = 0; i < 2; i++){
for(int j = 0; j < 2; j++){
cout << "Matriz A" << endl;
cout << "Ingrese el número a sumar fila: "<<i+1<<" colu... | ALGO | 0.895368 | 4.222543 |
fd249aba-d1a5-4dbb-aab0-ed8c2171bb77 | ahmedoshelmy/Competitive-Programming-Practice | HackerRank/Day 14 Scope.cpp | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
class Difference {
private:
vector<int> elements;
public:
int maximumDifference;
Difference(vector<int> input){
elements=input;
}
void computeDifference(){
int ... | ALGO | 0.999519 | 4.419955 |
21a24352-ef17-4f18-bfae-65df92eb55be | ftiasch/acm-icpc | sgu/p375.cpp | // SGU 375 -- Amplifiers
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
if (n % 2 == 0) {
puts("No solution");
} else {
vector <int> ways;
while (n != 1) {
if ((n + 1) % 4 == 2) {
ways.... | ALGO | 0.999996 | 3.647039 |
1676bcd1-b92e-452b-84a9-74b1408ab64f | piy1577/DSA | 6 function/14 decimal to octal.cpp | #include <iostream>
using namespace std;
int convert(int n){
int r=0;
int ans=0;
int i=0;
while(n>0){
int digit = n%8;
r = r*10 + digit;
n/=8;
i++;
}
for(int j=0;j<i;j++){
int lastdigit = r%8;
ans = ans*10 + lastdigit;
r/=8;
}
re... | ALGO | 0.982018 | 4.250512 |
3e319a7b-71cd-478e-9754-80bbdb7aea94 | Number1e/Project-mobile-praktikum | 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.998733 | 6.76775 |
565d533a-2c6f-4af3-abf9-78f380d0fdee | aryansharma89059/c--code | fibonacciseries.cpp | #include<iostream>
using namespace std;
int main()
{
int n1=0,n2=1,n3=3,i,number;
cout<<"enter the number of elements"<<endl;
cin>>number;
cout<<n1<<""<<n2<<""<<endl;
for(int i=2;i<number;i++)
{
n3=n1+n2;
cout<<n3<<""<<endl;
n1=n2;
n2=n3;
}
return 0;
} | ALGO | 0.999956 | 3.293452 |
aa863094-3a2f-427b-aa08-7ea6dde63280 | evans-prince/QELM | QELM/src/main.cpp | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <sstream>
#include <iterator>
#include <set>
#include "term.hpp"
#include "quine.hpp"
#include "espresso.hpp"
using namespace std;
// Function to minimize using Espresso (multi-pass)
vector<Term> minimizeEspresso(const vector<Term>& ... | ALGO | 0.999584 | 6.230711 |
ef3fc134-ad84-476f-bd98-8593584f63d8 | MichelPT/LatihanFlutter | pelatihan_flutter/windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998673 | 6.797273 |
8b17b725-9108-4798-b46f-556a1d90be2e | ryandeleon1/DeLeonRyan_CSC5_41202 | Homework/Assignment 6-7/Gaddis_8thEd_Chap8_Prob2/main.cpp | /*
* File: main.cpp
* Author: Ryan DeLeon
* Purpose: Winning the lotto
* Created on February 6, 2016, 5:07 PM
*/
//System Libraries
#include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;
//User Libraries
//Global Constants
//Function Prototypes
bool contains(const int[], int, int);
/... | ALGO | 0.999264 | 4.431311 |
dba22d1f-b636-4071-b3f0-13d57851c11f | raincross7/code-similarity | codes/train_code/problem347/problem347_267.cpp | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
string dp[10050];
ll com... | ALGO | 0.999996 | 4.632899 |
9d8e16e0-c7d8-4e88-b88d-c1f20fc975d5 | kevintsq/WebSearchEngine | create_index.cpp | #include <iostream>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <filesystem>
#include "zlib.h"
namespace fs = std::filesystem;
using std::cout;
using std::cerr;
using std::endl;
using std::string;
using std::stringstream;
using std::vector;
using std::pair;
using std::so... | DATA | 0.992173 | 4.551127 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.