uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
8a8fde5f-18c7-4a83-a721-877960ed4165 | THU-DSP-LAB/llvm-project | llvm/lib/Transforms/Utils/CanonicalizeFreezeInLoops.cpp | #include "llvm/Transforms/Utils/CanonicalizeFreezeInLoops.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/Analysis/IVDescriptors.h"
#include "llvm/Analysis/LoopAnalysisManager.h"
#include "llvm/Analysis/LoopInfo.h"
#include "llvm/Analysis/LoopPass.h"
#include "llvm/Analysis/ScalarEvo... | ALGO | 0.981215 | 7.80823 |
ae6076fe-4e72-41b5-9b9a-1ac202240fca | Amin145875/ami-master | forl-oop-2.cpp | #include <iostream>
using namespace std;
int main()
{
int start = 21;
int end = 24;
int sum = 0;
for (int start = 0; start < end; start++)
{
sum += start;
}
cout << "The sum is " << sum;
return 0;
}
| ALGO | 0.952506 | 3.212813 |
bbde1b55-41f3-4e1c-888a-e38a46809698 | Altaaaaaaa/Face-detection | opencv-master/samples/cpp/grabcut.cpp | #include "opencv2/imgcodecs.hpp"
#include "opencv2/highgui.hpp"
#include "opencv2/imgproc.hpp"
#include <iostream>
using namespace std;
using namespace cv;
static void help(char** argv)
{
cout << "\nThis program demonstrates GrabCut segmentation -- select an object in a region\n"
"and then grabcut wi... | ALGO | 0.935692 | 5.380814 |
fa24dd98-d56b-442b-93c4-ae907c877d3f | msk005/leetcode | 90-subsets-ii/90-subsets-ii.cpp | class Solution {
public:
vector<vector<int>>ans;
void solve(vector<int>& nums , int start , vector<int>& subset){
ans.push_back(subset);
for(int i=start ;i<nums.size();i++)
{
if(i>start and nums[i-1] == nums[i])
continue;
subset.... | ALGO | 0.999951 | 6.002059 |
99b21ad2-7266-42ef-b350-f7a6cee3853b | vstevanoska/rand_search | source/Rastrigin.cpp | #define _USE_MATH_DEFINES
#include "../header/Rastrigin.h"
#include <vector>
#include <cstdlib>
#include <math.h>
Rastrigin::Rastrigin()
{
lowerCon = -5.12;
upperCon = 5.12;
}
double Rastrigin::findSolution(int dimension)
{
//generate vector of random float values within the constrained space
vecto... | ALGO | 0.999753 | 5.130527 |
b91abb7a-1793-4cb2-8462-cf4e69852ec5 | sargun4/leetcode | Easy/Geek Jump/geek-jump.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int solve(vector<int>& height, int i,vector<int> &dp){
if(i==0) return 0;
if(dp[i]!=-1){
return dp[i];
}
in... | ALGO | 0.999896 | 6.426951 |
a7f3f5a7-4056-49ac-960d-40e582f9a26d | Anik-36/coding_in_laptop | phitron/C++/Basic Data Structure/Week 01-Introduction/Module 4-Assignment 01/Insert_it.cpp | #include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n);
for(int i = 0; i<n; i++){
cin>>a[i];
}
int m;
cin>>m;
vector<int> b(m);
for(int i = 0; ... | ALGO | 0.999942 | 3.325102 |
994c6817-a64b-4a0f-ad09-1f1d30c32803 | kdg5424/nextfoam-cfd | ThirdParty-2404/sources/adios/ADIOS2-2.9.2/source/utils/adios_iotest/settings.cpp | #include "settings.h"
#include <cmath>
#include <cstring>
#include <getopt.h>
#include <iostream>
#include <stdexcept>
#include <string>
#include "adios2/helper/adiosLog.h"
struct option options[] = {{"help", no_argument, NULL, 'h'},
{"verbose", no_argument, NULL, 'v'},
... | CONFIG | 0.924219 | 5.40975 |
76e4017e-449e-49d8-8bf9-44c6338e62e7 | pradeepnegi88/leetcode | 99-recover-binary-search-tree/recover-binary-search-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.999997 | 6.137633 |
56ab9c45-b9ab-491e-8d3c-576a88e7d981 | KeXen1/C-ECGR-2103 | example5/main.cpp | #include <iostream>
#include <vector>
using namespace std;
int main(){
//VECTOR CODE (SMARTER THAN ARRAYS)
vector<int> quizzes;
//OR
// vector<int> quizzes = {10, 70, 80, 90, 80};
quizzes.push_back(100);
quizzes.push_back(90);
quizzes.push_back(80);
quizzes.push_back(100);
... | ALGO | 0.965418 | 3.733782 |
494b5689-a3d3-4266-a0b6-0f62ea81a541 | bluestareesh/USACO | Bronze/USACO 2015 Us open problem 1.cpp | #include <iostream>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <algorithm>
#include <unordered_map>
using namespace std;
typedef long long ll;
# define int ll
int n,m;
int check(vector<string> &a, int i, int j,char M, char O) {
int q = 0;
string temp = "";
t... | ALGO | 0.999259 | 4.540946 |
0bf426a7-60f0-406f-9bb2-fb9b5952931a | TotoroCodingDojo/leetcode-cpp | 232/sol0.cpp | class MyQueue {
public:
stack<int> st1, st2;
MyQueue() {
}
void push(int x) {
st1.push(x);
}
int pop() {
if(st2.empty()){
while(!st1.empty()){
st2.push(st1.top());
st1.pop();
}
}
i... | ALGO | 0.999627 | 5.127573 |
f2edc061-804d-4811-b41e-533e33b1d58d | JoaoVictorRR-GitHub/Ciclo-Euleriano | Menu.cpp | /*
@ Docente:
* Joao Patricio.
@ Estudante:
* Joao Victor do Rozario Recla.
@ Disciplina:
* Analise e Sintese de Algoritmos.
@ Instituicao:
* IPT - Instituto Politecnico de Tomar.
* ESTA - Escola Superior de Tecnologia de Abrantes.
Este arquivo contem a ... | ALGO | 0.886438 | 5.443336 |
0be2b508-1b39-4de0-9cdf-75c9de85313c | Shaoma-lyl/USTC_Lab | 2018Autumn/数据结构/4_PB17081504_廖洲洲_最短路径/ShortestPath .cpp | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<process.h>
#define max 100000
int *vexs;//
int **arc;//ڽӾ
int vexnum;//
int startvex,endvex;
void CreatGraph(){
printf("붥\n");
scanf("%d",&vexnum);
arc=(int **)malloc(vexnum*sizeof(int *));
for(int i=0;i<vexnum;i++)
arc[i]=(int *)malloc(vexnum*si... | ALGO | 0.999947 | 3.081565 |
6c56294b-b832-4141-8f9d-5f69ebf32783 | hariprasadc86/CSA0261-c-programming-assignment | a2p6.cpp | #include <stdio.h>
#define MAX_SIZE 100
int main() {
int arr[MAX_SIZE], even[MAX_SIZE], odd[MAX_SIZE];
int i, size, evenCount = 0, oddCount = 0;
printf("Enter the size of the array: ");
scanf("%d", &size);
printf("Enter the elements of the array: ");
for(i = 0; i < size; i++) {
scanf("... | ALGO | 0.99966 | 4.499502 |
794270fe-c781-411c-abff-ad99bc994dd3 | AthulJoseph27/Codeforces | 1500/1516B.cpp | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define all(v) v.begin(), v.end()
void __print(int x)
{
cerr << x;
}
void __print(long x) { cerr << x; }
void __print... | ALGO | 0.99985 | 4.84889 |
d760e367-6911-4368-ab6c-166a566c8f9e | ishandutta2007/codeforces | marckess/normal/1385/D.cpp | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < n; i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
using namespace std;
typedef long l... | ALGO | 0.999822 | 4.464747 |
2141865d-af48-4f78-9c43-cd6048a031b2 | nodejs/ecmascript-modules | deps/icu-small/source/common/ustring.cpp | #include "unicode/utypes.h"
#include "unicode/putil.h"
#include "unicode/uchar.h"
#include "unicode/ustring.h"
#include "unicode/utf16.h"
#include "cstring.h"
#include "cwchar.h"
#include "cmemory.h"
#include "ustr_imp.h"
/* ANSI string.h - style functions ------------------------------------------ */
/* U+ffff is th... | TOOL | 0.992374 | 6.1573 |
8796fe0f-4250-412b-953b-96d9c9e02dae | saadam1n/GPUPathTracer | src/math/Camera.cpp | #include "Camera.h"
#include <glm/gtc/matrix_transform.hpp>
Camera::Camera(float aspect, float fieldofview, float focus, float aperture) : direction(0.0f, 0.0f, -1.0f), position(0.0f), pitch(0.0), yaw(0.0), aspect_ratio(aspect), fov(fieldofview), focal_distance(focus), lens_radius(aperture / 2) {}
void Camera::Genera... | TOOL | 0.906398 | 6.17663 |
a786b76f-0a38-4c91-95d2-98b822dfeb98 | AOSC-Tracking/telegram-desktop | Telegram/ThirdParty/rlottie/src/vector/vpathmesure.cpp | #include "vpathmesure.h"
#include <limits>
#include "vbezier.h"
#include "vdasher.h"
V_BEGIN_NAMESPACE
/*
* start and end value must be normalized to [0 - 1]
* Path mesure trims the path from [start --> end]
* if start > end it treates as a loop and trims as two segment
* [0-->end] and [start --> 1]
*/
VPath VP... | TOOL | 0.891208 | 5.781888 |
36c02b2e-2670-4e0b-a413-ab6985dccb95 | Prathmesh311/DSA | Greedy algorithms/GasStation.cpp | class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int position = 0;
int sum = 0;
int total = 0;
for(int i=0; i < gas.size(); i++){
sum += gas[i] - cost[i];
if(sum < 0){
total += sum;
sum = 0... | ALGO | 0.999997 | 5.988682 |
b91d5b75-2a1f-4bdb-a5d4-436cd4f242fc | wuhao5/boost | libs/mpl/example/inherit_multiply.cpp | // $Id: inherit_multiply.cpp 49268 2008-10-11 06:26:17Z agurtovoy $
// $Date: 2008-10-10 23:26:17 -0700 (Fri, 10 Oct 2008) $
// $Revision: 49268 $
#include <boost/mpl/inherit.hpp>
#include <boost/mpl/inherit_linearly.hpp>
#include <boost/mpl/list.hpp>
#include <iostream>
namespace mpl = boost::mpl;
using namespace m... | ALGO | 0.980462 | 5.013275 |
046dffdf-9259-465e-82bd-b2d2a5faa437 | yajunseo/Algoritm | dijkstra/1916_최소비용구하기.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <queue>
#define INF 1999999999
using namespace std;
int n, m;
int s, e;
// ,
vector<pair<int, int>> v[1001];
int arr[1001];
void dijkstra(int start)
{
arr[s] = 0;
priority_queue<pair<int, int>> pq;
pq.push({ 0, start });
whi... | ALGO | 0.999812 | 3.946072 |
56b673e7-272b-46ee-bcc5-cc1f5f7ffef5 | Adi2209/DSA | 2616-minimize-the-maximum-difference-of-pairs/2616-minimize-the-maximum-difference-of-pairs.cpp | class Solution {
public:
int minimizeMax(vector<int>& v, int p) {
sort(v.begin(),v.end());
int n = v.size();
int ans = v[n-1]-v[0];
int i=0,j=ans;
while(i<=j){
int m = (i+j)/2;
int total = 0;
int k = 0;
while(k<n-1){
if(v[... | ALGO | 0.999985 | 5.386137 |
585210a3-e646-4604-8e85-45328e194a5c | niraj-kumar-r/ES1101-Intro-To-Programming | Lab3/ques3.cpp | #include <iostream>
using namespace std;
int main(void)
{
int number = 0, sum = 0;
char flag;
while (true)
{
cout << "Enter a Number : ";
cin >> number;
sum += number;
cout << "Do you want to continue? [y/n] [By default takes n] : ";
cin >> flag;
cout ... | ALGO | 0.902921 | 3.769214 |
eb7593bb-556e-458e-b264-04be3801af9d | SamudraMitra/CodeISM26 | Long Challenge/Binary Search Long Challenge/T.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define max3(a, b, c) max(max(a, b), c)
#define max4(a, b, c, d) max(max(a, b), max(c, d)... | ALGO | 0.999973 | 5.39507 |
4142c77d-3d83-441c-abdc-6705db2524ac | Walker0710/CPP | LeetCode/Contest/WC_378/2982_Find_Longest_Special_Substring_That_Occurs_Thrice_2.cpp | #include <bits/stdc++.h>
using namespace std;
// << ,
int maximumLength(std::string s)
{
int n = s.length();
std::vector<std::vector<int>> freq(26, std::vector<int>(n + 1, 0));
char pre = s[0];
int len = 1;
freq[s[0] - 'a'][1] = 1;
int ans = -1;
for (int i = 1; i < n; i++)
{
... | ALGO | 0.99998 | 4.662127 |
d7c258ce-c623-4b13-a719-15efa13ee270 | hjm113/Algorithm | 프로그래머스/unrated/214288. 상담원 인원/상담원 인원.cpp | #include <string>
#include <vector>
#include <iostream>
#include <tuple>
#include <queue>
using namespace std;
int sum = 0;
int chk = 0;
int can = 0;
vector<tuple<int,int,int>> ans;
int ary[10];
int mx = 2000000000;
void dfs(int k) {
if(k == chk+1) {
if(sum == can) {
int cnt = 0;
pri... | ALGO | 0.999585 | 4.462345 |
251c3ec9-1aab-4c79-a181-11599409bcd8 | ghostumar/DSA | MATHEMATICS/countdigit using recursive.cpp | #include<iostream>
using namespace std;
int countdigit(int n){
int x=n;
if(x==0){
return 0;
}
return 1+countdigit(n/10);
}
int main(){
int n;
cout<<"Enter the no."<<endl;
cin>>n;
int ncount=countdigit(n);
cout<<ncount;
}
| ALGO | 0.999759 | 4.181231 |
78a0e78d-0113-41ef-8b0d-c68675d5a06b | nicole01101101zke/rodinia_CPU | openmp/mummergpu/src/smith-waterman.cpp | #include <iostream>
using namespace std;
inline int max2(int a, int b)
{
return (a > b) ? a : b;
}
inline int max4(int a, int b, int c, int d)
{
int maxl = (a > b) ? a : b;
int maxr = (c > d) ? c : d;
return (maxl > maxr) ? maxl : maxr;
}
int s(char a, char b, int match_score, int mismatch_score)
{
if (a ... | ALGO | 0.999568 | 4.038283 |
d7b6b65e-c9bd-4ca0-806e-dacaa85d0668 | chinmay-gupta-2003/POTD | 2024/11_November/15th_1574_Shortest_Subarray_to_be_Removed_to_Make_Array_Sorted.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
int findLengthOfShortestSubarray(vector<int> &arr)
{
int n = arr.size();
int i = 0, j = n - 1;
while (j > 0 && arr[j] >= arr[j - 1])
{
j--;
}
int mini = j;
if (j == 0)
return 0;
while (i < j && (... | ALGO | 0.999941 | 5.234689 |
50f44d34-aa2c-40c5-b2ad-6dd62ed2691a | Dipankar-Kumar-Singh/Codeforces | Path_Queries_II.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) begin(x) , end(x)
#define nl "\n"
// #include"/home/dk/debugging.h"
vector<int> values;
int const N = 2e5 + 100;
int const S = 1e6 ;
int sz[N] ;
int st[S] ;
int n ;
void update(int idx, int val) {
st[idx += n] = val;
for ... | ALGO | 0.999708 | 4.865241 |
631ad41e-e425-4ec9-8691-98b9e2e562c2 | Skifv/MIPT | Informatics_4/11_seminar/2.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class ResultsTable
{
private:
vector<unsigned int> resultsTable;
public:
ResultsTable() : resultsTable(0) {}
// Зарегистрировать новый результат,
// нас волнуют только баллы, имена пользователей не важны
void addResult... | ALGO | 0.998745 | 5.715446 |
9c90735a-3535-444d-9e30-ceba9acb4b83 | ankitverma-123-code/CPP-Data-Structures-Algorithms-Launchpad-master | 08. Recursion/4. Subset Based/4. Keypad Problem/4. Keypad Problem.cpp | #include<bits/stdc++.h>
#include<climits>
#include<algorithm>
#include<math.h>
#define ll long long
#define MAX 100000
using namespace std;
char keypad[][5] = {"", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wx", "yz"};
int counter=0;
void subsets(char *in, char *out, int i=0, int j=0){
// Base Case
// If i ... | ALGO | 0.999723 | 3.905523 |
0c332c6e-6d9c-42d8-8f38-c1f9af102d81 | gaolichen/contest | usco/123b/123b.cpp | /*
ID: mygali1
PROG: comehome
*/
#include<iostream.h>
#include<stdlib.h>
#include<fstream.h>
#include<string.h>
//#define DEBUG
#define M 2100000000
#ifdef DEBUG
#define in cin
#define out cout
#else
ifstream in("comehome.in");
ofstream out("comehome.out");
#endif
int map[60][60],nearest[60],mark[60],dis[60];
void ... | ALGO | 0.999738 | 3.304873 |
a1282d5b-c1a0-44e6-9ec5-6fa729750b7c | kiranrajput24/Private-Projects-N-Notes | Notes & Codes/Data-Structure-Program/ListWiseDataStructure/Graph/BFS/breadthFirstSearch.cpp | #include <iostream>
using namespace std;
#include "Queue.cpp"
void BFS(int G[][6], int start, int n)
{
int i = start;
int visited[6] = {0};
cout << i + 1 << endl;
visited[i] = 1;
enqueue(i);
while (!isEmpty())
{
i = dequeue();
for (int j = 0; j < n; j++)
{
... | ALGO | 0.999989 | 4.840823 |
f0fbca9e-9498-454a-b595-0a9b8c6a49a8 | Source-SDK-Base-Legacy-Project/source-sdk-2007 | src/materialsystem/stdshaders/lightmappedreflective.cpp | #include "BaseVSShader.h"
#include "mathlib/VMatrix.h"
#include "common_hlsl_cpp_consts.h" // hack hack hack!
#include "SDK_lightmappedreflective_vs20.inc"
#include "SDK_lightmappedreflective_ps20.inc"
#include "SDK_lightmappedreflective_ps20b.inc"
DEFINE_FALLBACK_SHADER( SDK_LightmappedReflective, SDK_LightmappedRef... | TOOL | 0.853071 | 5.924641 |
e990b393-634f-4f47-ac0b-f6ff18d92a06 | xylar/moab | tools/mbslavepart.cpp | //
// Usage:
// tools/mbslavepart -d 2 -m mpas/x1.2562.grid.h5m -s mpas/x1.10242.grid.h5m -o mpas_slave.h5m -e 1e-8 -b 1e-6 -O
//
#include <iostream>
#include <exception>
#include <cmath>
#include <vector>
#include <string>
#include "moab/ProgOptions.hpp"
#include "moab/Core.hpp"
#include "moab/AdaptiveKDTree.hpp"
#in... | ALGO | 0.961045 | 5.564541 |
444b25b6-3420-488a-9cb3-a4dcf2d12354 | muhammad-hasannn/cp_lab_sp25 | Lab 02 - Data Types/task03.cpp | /*Write a C++ program that prompt input roll number, student name and marks of three subjects:
1. Computer Programming = CP
2. Object Oriented Programming= OOP
3. Data Structures & Algorithms= DSA
Calculate total marks, percentage and division of student.
Marks percentage = marks obtained / total * 100*/
#include<iost... | TOOL | 0.895763 | 3.148948 |
b02f3543-2d0e-46c4-a30c-7da99c8a7203 | Sagarkc26/calculator | 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.998762 | 6.786404 |
f790cf95-7bc1-4669-b502-4ed0c1edbc98 | mohdabdulrahman297/Leetcode | 0605-can-place-flowers/0605-can-place-flowers.cpp | class Solution {
public:
bool canPlaceFlowers(vector<int>& flowerbed, int n) {
flowerbed.insert(flowerbed.begin() , 0);
flowerbed.push_back(0);
for(int i=1;i<flowerbed.size()-1;i++){
if(flowerbed[i-1] == 0 && flowerbed[i] == 0 && flowerbed[i+1] == 0){
... | ALGO | 0.999978 | 7.135988 |
22930405-ec08-4cdd-aa26-87a035b254bc | dittoo8/algorithm_cpp | BOJ/10845.cpp | #include <iostream>
#include <queue>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
queue<int> q;
for(int i=0;i<n;i++){
string commend;
cin >> commend;
if(commend == "push"){
int x;
cin >> x... | ALGO | 0.999246 | 4.395209 |
a4efe90f-ef43-49e8-b96f-1d7c24f396dc | Chayakorn26082547/codeforces | Division2/Edu141/C.cpp | // Yet Another Tournament
#include<bits/stdc++.h>
using namespace std;
struct A{
int v,idx,w;
};
bool val(A a,A b)
{
if(a.v!=b.v)
return a.v<b.v;
return a.idx<b.idx;
}
bool win(A a,A b)
{
if(a.w!=b.w)
return a.w>b.w;
return a.idx>b.idx;
}
A a[500100];
int mark[500100];
int main()
{
... | ALGO | 0.999994 | 3.50007 |
3293107e-3524-485b-899c-a325ee4f4ef5 | yukarinoki/programing_contests | keyence19/b.cpp | #include<cmath>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
string s, k = "keyence"; cin >> s;
int pos = 0;
int state=0;
for(int i=0;i<8;i++){
if(s.substr(0,i)+s.substr(s.length()-(7-i),7-i)==... | ALGO | 0.999928 | 3.469449 |
13496cb7-3648-49f9-be96-40f1813eff22 | NursultanBS/Data-Structures-and-Algorithms | lab_dict/fib.cpp | /**
* @file fib.cpp
* Contains Fibonacci-number generating functions both utilizing and not
* utilizing memoization.
*
* @author Matt Joras
* @date Winter 2013
*/
#include "fib.h"
#include <map>
using std::map;
/**
* Calculates the nth Fibonacci number where the zeroth is defined to be
* 0.
* @param n Whi... | ALGO | 0.999841 | 7.601202 |
c4cea7de-74f6-47aa-827f-eb1f0aa8c1b6 | Adarsh5511/Leetcode | 3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.cpp | class Solution {
public:
long long validSubstringCount(string word1, string word2) {
long long count=0;
int left=0;
unordered_map<char,int>targetmap;
for(auto i:word2){
targetmap[i]++;
}
int requiredmatches=targetmap.size();
unordered_m... | ALGO | 0.999955 | 5.939043 |
cedf1aa2-82b1-4a37-b5bb-5f3d5ca6e00f | uddipan/LeetCode | 128. Longest Consecutive Seq/source.cpp | class Solution {
public:
int longestConsecutive(vector<int>& nums) {
if(nums.empty())return 0;
set<int>S(nums.begin(), nums.end());
int cnt = 1, maxCnt = 1;
int prev = *(S.begin());
for(auto it = next(S.begin(),1); it != S.end(); ++it)
{
if(*it - prev == 1... | ALGO | 0.999949 | 5.570309 |
a2dc1805-9eff-4e81-b1fb-7efafaaec365 | Pranav-Rustagi/Problem-Solving | Number of 1 Bits - GFG/number-of-1-bits.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
int setBits(int N) {
int count = 0;
while(N) {
if(N & 1)
count++;
N >>= 1;
}
return count;
}
};
//{ Driver Code Starts.
... | ALGO | 0.999969 | 6.470654 |
150d9143-2054-4c5f-af6b-5a174a1fc166 | FujiwaraNaoto/atcoder1 | BigInt.cpp | /*
BigIntクラスを作り上げる
bigint[nelem] のようにして,配列巨大なIntとみなす
//各々のメソッドに関して,完成 とつけるべし
*/
#include<vector>
#include<sstream>//for ostream and istream
#include<iostream>
class BigInt{
typedef long long ll;
public:
size_t nelem;//配列のサイズ
std::vector<ll> bigint;
ll base=1000;
explicit BigInt(long long x){
... | ALGO | 0.99959 | 3.591762 |
ea6c331f-ecff-4ffe-bd42-cee5f8f70d46 | OnlyFuture/dualarmrobot | eigen-eigen-323c052e1731/doc/examples/TutorialLinAlgSelfAdjointEigenSolver.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix2f A;
A << 1, 2, 2, 3;
cout << "Here is the matrix A:\n" << A << endl;
SelfAdjointEigenSolver<Matrix2f> eigensolver(A);
if (eigensolver.info() != Success) abort();
cout << "The eigenvalues of A ... | ALGO | 0.999603 | 3.836841 |
ae1d2432-e89f-4276-a26d-c5afc3cca652 | bronifty/c-debugging | codes/c/bst/main.cpp | // project/main.cpp
#include <iostream>
#include "bst.h"
int main() {
// Define an array of integers to insert into the BST
int numbers[] = {5, 3, 1, 4, 2, 7, 6, 8, 3, 5}; // Includes duplicates: 3 and 5
int num_elements = sizeof(numbers) / sizeof(numbers[0]);
BST bst; // Create an instance of BST
... | ALGO | 0.999311 | 6.734683 |
143a8045-1b43-4820-b8d3-f9440181e028 | ThiagoFBastos/programacao-competitiva | cses/Knuth Division.cpp | #include "bits/stdc++.h"
#define endl '\n'
using namespace std;
const long long inf = 1e16L;
void solve() {
int n;
cin >> n;
vector<long long> pre(n + 1);
vector<int> p(n + 2), _(n + 1);
vector<vector<long long>> dp(n + 1, vector<long long>(n + 1));
pre[0] = 0;
for(int i = 1; i <= n; ++i) {
cin >> ... | ALGO | 0.999867 | 3.546342 |
4f10b2f5-85d1-4935-956d-933bd2dc5c6f | LuisJosueSantanaPerez/lenguaje-c-inf-411 | Unidad-2/Arreglos-B/Página-32-y-33.cpp | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
void reordenar(int n, char x[][12]);
int main() {
int i, n = 0;
char x[10][12];
// Leer la lista de cadenas de caracteres
printf("Introducir debajo cada cadena en una línea\n\n");
printf("Escribir 'FIN' para terminar\n\n");
do {
... | ALGO | 0.999928 | 4.598695 |
d025c076-01a3-464b-9e75-3c284a93234f | virajchandra51/TLE_CP_31 | 1400/08 - Copil_Copac_Draws_Trees.cpp | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
vector<int> dp; // O(n) space
map<pair<int,int>,int> ind; // O(n) space
void dfs(int vert, int par) {
for(auto x : adj[vert]) {
if(x == par) continue;
if(ind[{par, vert}] < ind[{vert,x}]) {
dp[x] = dp[vert];
... | ALGO | 0.999862 | 5.693532 |
b54cdb18-a0c1-4fb8-abf2-49f10af624df | ishandutta2007/codeforces | btzy/normal/1556/C.cpp | #include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int MAXN=1000;
vector<int> v; // starts with fix, ends with increase(if last increased) or fix(if last decreased)
int32_t main(){
ios_base::sync_with_stdio(false);
int n;
cin>>n;
bool isincrease=true;
int ans=0;
v.push... | ALGO | 0.999988 | 4.257028 |
8d0ae8ec-6f05-4fb0-969b-18bac053593c | raincross7/code-similarity | codes/train_code/problem274/problem274_307.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a, b, c, d;
cin >> N;
a = N % 1000;
b = N / 10 % 111;
c = N % 1111;
if (a == 0 || a == 111 || b == 0 || c == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| ALGO | 0.999912 | 3.958539 |
67f351ba-d071-4888-8f6f-ef37d2cef573 | npkhang99/Competitive-Programming | Codeforces/727B.cpp | #include <bits/stdc++.h>
using namespace std;
string st;
double ans = 0.0, curr = 0.0;
int flag = 0;
int main(){
cin>> st;
for(int i=0; i<st.size(); i++){
if('a' <= st[i] && st[i] <= 'z'){ ans += curr; curr = 0.0; continue; }
if(st[i] == '.'){
if(i+3 < st.size() && '0' <= st[i+3] &... | ALGO | 0.99925 | 3.491083 |
4db1e343-e84c-48ca-8246-58b98b009577 | HZhalex/KTLT | chương 2/phần 1/bai_6.cpp | #include <iostream>
#include <ctime>
using namespace std;
int main() {
int ngay,thang,n,t;
cout << "nhap vao ngay va thang:\n";
cin >> ngay >> thang;
if ( 3>=thang >=1){
cout << "quy1";
}
else if (6>=thang >=4){
cout << "quy2";
}
else if (9>=thang >=7){
... | ALGO | 0.999661 | 3.106827 |
25d1ab1e-7486-425e-a6a5-68c58e929475 | cedricxs/LeetCode | 43-multiply-strings.cpp | /*author : cedricxs
*level : middle
*/
class Solution {
public:
string multiply(string num1, string num2) {
if(num1=="0"||num2=="0")return "0";
int m=num1.size(),n=num2.size();
int co=0;string r(m+n,'0');
for(int i=num1.size()-1;i>=0;i--)
{ for(int j=num... | ALGO | 0.999961 | 5.762218 |
7955cc1b-8902-4595-9e3b-ef221c9b9e62 | SiddiqueSahb/DSASeries | DSA Series/DS/CharacterArrays2DArray/spiralPrint.cpp | // Online C++ compiler to run C++ program online
//code not working
//WAVE PRINT
#include <iostream>
#include<algorithm>
using namespace std;
void printRowSum(int **arr[][3],int row,int col){
cout<<"Printing sum row wise... "<<endl;
for(int row = 0;row<3;row++){
int sum = 0;
for(int col = 0;... | ALGO | 0.999309 | 3.816723 |
16534232-122d-4803-a3c2-ec9ac621fec2 | emrahuzucar355/Uzucar- | libcudacxx/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons/ctor_iter_iter_comp_cont.pass.cpp | // <queue>
// template <class InputIterator>
// priority_queue(InputIterator first, InputIterator last,
// const Compare& comp, const container_type& c);
#include <queue>
#include <cassert>
#include "test_macros.h"
int main(int, char**)
{
int a[] = {3, 5, 2, 0, 6, 8, 1};
const int n = siz... | TEST | 0.967855 | 4.833145 |
82932ebc-cc5a-4416-b732-b01f686b223f | Mohamad-Alhamwi/SAST_With_SRE | CVEs/CVE-2017-17760_OpenCV/OpenCV/modules/video/src/compat_video.cpp | #include "precomp.hpp"
#include "opencv2/video/tracking_c.h"
/////////////////////////// Meanshift & CAMShift ///////////////////////////
CV_IMPL int
cvMeanShift( const void* imgProb, CvRect windowIn,
CvTermCriteria criteria, CvConnectedComp* comp )
{
cv::Mat img = cv::cvarrToMat(imgProb);
cv::Re... | ALGO | 0.999355 | 6.396635 |
65c775f9-a2fb-4051-8ac6-5b182c1b2bd1 | Chocopopssss/Labs | Lab 6. 3.cpp | #include <iostream>
using namespace std;
const int MAX_SIZE = 100;
// Функция для нахождения строки с наибольшей по абсолютной величине суммой элементов
int findRowWithMaxAbsSum(int matrix[MAX_SIZE][MAX_SIZE], int n, int m)
{
int maxAbsSum = 0;
int rowIndex = -1;
for (int i = 0; i < n; i++)
{
... | ALGO | 0.999952 | 5.819604 |
eed6d286-329f-46d5-8ada-fa38fe4dee03 | Nanfengzhiwo1/UE5_2_L | Engine/Source/ThirdParty/Intel/Embree/Embree270/src/kernels/xeon/bvh8/bvh8_intersector8_chunk.cpp | #include "bvh8_intersector8_chunk.h"
#include "../geometry/triangle4.h"
#include "../geometry/triangle8.h"
#include "../geometry/intersector_iterators.h"
#include "../geometry/triangle_intersector_moeller.h"
#define DBG(x)
namespace embree
{
namespace isa
{
template<typename PrimitiveIntersector8> ... | ALGO | 0.994749 | 5.737642 |
35b65680-047a-4ce1-8bd9-82cec4115602 | KhairuzzamanCP/Data_Structure | practice problem/Stack_copy_p3.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
stack<int> st;
stack<int> st2;
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
int x;
cin >> x;
st.push(x);
}
while (!st.empty())
{
st2.push(st.top());
st.pop();
}
while (!st2.e... | ALGO | 0.99999 | 4.894523 |
6cc47a35-2da5-4cc0-a1ff-edef29dc68a2 | aeglon97/Udacity-Intro-To-Self-Driving-Cars | P2-Translate-Python-To-CPP/helpers.cpp | /**
helpers.cpp
Purpose: helper functions which are useful when
implementing a 2-dimensional histogram filter.
This file is incomplete! Your job is to make the
normalize and blur functions work. Feel free to
look at helper.py for working implementations
which are written in python.
*/
#include <vector>
#inc... | TOOL | 0.989248 | 5.343961 |
fc619869-9f5c-441e-954b-453d3ea07501 | YMCPlusPlus/Kattis | Arrangement.cpp | #include<iostream>
using namespace std;
int main()
{
int n,m,k;
cin>>n>>m;
if(m%n==0)
{
int p=m/n;
for(int i=0;i<n;i++)
{
for(int i=0;i<p;i++)
{
cout<<'*';
}
cout<<endl;
}
}
else
{
k=m%n;
for(int i=0;i<n;i++)
{
for(int j=0;j<m/n;j++)
{
cout<<'*';
}
if(k!=0)
{
cout<<'*';
k--;
}
cout<<endl;
}
}
return 0;
}
| ALGO | 0.9999 | 3.563646 |
a9ed4e47-1056-4716-970c-b8c6736853bf | Tohidul0/Competitive-programming | LeetCode/Contains Duplicate.cpp | class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
sort(nums.begin(), nums.end());
int ans = nums[0];
for(int i=1;i<nums.size();){
if(ans==nums[i] && i<nums.size()){
return true;
}
else{
ans=nums[i];
... | ALGO | 0.999983 | 5.66991 |
08278d93-1e90-40b5-b523-eb7a506f4459 | ishandutta2007/codeforces | als123/normal/1016/B.cpp | #include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
const int N=1005;
char a[N],b[N];
int n,m,q;
int cnt[N];
int main()
{
scanf("%d%d%d",&n,&m,&q);
scanf("%s%s",a+1,b+1);
for (int u=1;u<=n-m+1;u++)
{
bool tf=true;
cnt[u]=cnt[u-1];
for (int i=1;i<=m;i++)
if (a[u+i-... | ALGO | 0.999918 | 3.618551 |
6ad78cbb-456e-4971-b110-e134c1d1982f | ManhND17/DSA_PTIT | DSA06041.cpp | #include<bits/stdc++.h>
using namespace std;
main()
{
int t; cin>>t;
while(t--)
{
int n; cin>>n;
int a[n]; map<int,int> mp;
for(int i=0;i<n;i++)
{
cin>>a[i];
mp[a[i]]++;
}
int max=0,s;
for(auto x : mp)
{
if(x... | ALGO | 0.999941 | 4.082144 |
c2b64103-02b9-4a20-a025-d0f60d9cd63f | deepmodeling/GROMACS | src/gromacs/linearalgebra/gmx_blas/srot.cpp | #include "../gmx_blas.h"
void
F77_FUNC(srot,SROT)(int *n__,
float *dx,
int *incx__,
float *dy,
int *incy__,
float *c__,
float *s__)
{
int i,ix,iy;
float dtemp;
int n = *n__;
int incx = *incx... | ALGO | 0.999687 | 3.513919 |
1c8bf609-72cf-45a5-9ad4-4b262d264333 | kavita121/Coding | FirstLastOccurrenceOfX_GFG.cpp | //First and last occurrences of X
//GFG ACCEPTED
#include <iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n, x;
cin>>n>>x;
int first = -1, last = -1;
for(int i=0; i<n; i++)
{
int in;
cin>>in;
if(i... | ALGO | 0.999361 | 4.175581 |
caf01ea0-5c0e-4ef9-a068-29ee778f181d | HokazeAyane/Leetcode | LeetCode/0001.两数之和/TwoSum.cpp | #include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
class Solution{
public:
vector<int> twoSum(vector<int>& nums,int target){
unordered_map<int,int> numMap;
for(int i = 0;i < nums.size(); i++){
int complement = target - nums[i];
if(numMap.fin... | ALGO | 0.999951 | 5.92812 |
0f52ec45-522c-4ea9-b36b-68c0e1b652e4 | HyperSoWeak/CSES | Graph Algorithms/Shortest Routes II.cpp | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a; i<b; ++i)
#define rep1(i,a,b) for(int i=a; i<=b; ++i)
#define int long long
#define fi first
#define se second
#define mp make_pair
#define max max<int>
#define min min<int>
#define all(a) a.begin(),a.end()
#define sz(a) (signed)a.size()
#define rr(a,x) memset(a,... | ALGO | 0.999983 | 5.106781 |
062d2a71-1c26-4979-9400-efaa54327665 | ju5tlc3/C-plus-plus | class_Figure.cpp | //Class basics. Use of initialization list, make_shared & shared_ptr, abstraction and inheritance.
//Example of implementation Figure class with types Triangle, Rect and Circle.
//Performed perimeter and square calculation
#include<iostream>
#include<string>
#include<cmath>
#include<memory>
#include<vector>
#include<s... | TOOL | 0.988468 | 6.096261 |
6d3b70fd-d650-4dd1-bee1-a96a19dc990f | abdelhakim96/ROS_UNav-Sim | bluerov2_trajectory/scripts/bluerov2_pipe_following/bluerov_mpc/ACADOtoolkit/examples/multi_objective/plug_flow_reactor2_ws.cpp | /**
* \file examples/multi_objective/plug_flow_reactor2_ws.cpp
* \author Filip Logist, Boris Houska, Hans Joachim Ferreau
* \date 2009
*
* \ Weighted Sum for jacketed plug flow reactor with conflicting conversion and energy cost
* \ J = (1-W)*J1+W*J2 Weighted Sum
* \ J1 = Ci... | ALGO | 0.999747 | 5.292302 |
ce245b35-41ad-4cf0-ab99-e7997df5558b | Prashant051998/CODING_DSA | coding_games_html.cpp | Write a program that checks that all open tags (i.e. <div>) are followed by a corresponding closing tag. Tags can be nested. There are only 4 tags in this task: <html>, <body>, <head> and <div>. There are also no attributes. I.e. <div id="parent"> is not valid.
Input
One line containing the html.
Output
Output the numb... | ALGO | 0.975148 | 4.442762 |
88f3dbc4-f826-4aab-a5e9-58de50c4fce5 | Moksud1717/Moksud | C++Codes/Easy Fibonacci BC.cpp | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int fib[N];
fib[0] = 0;
fib[1] = 1;
for (int i = 2; i < N; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
for (int i = 0; i < N; i++) {
cout << fib[i];
if (i != N - 1) {
cout << " ... | ALGO | 0.999883 | 4.817261 |
25362772-d2f8-48e8-ba9b-6a66ba80210d | jayantawasthi575/dsalgo450 | ds124.cpp | public:
// arr[]: Input Array
// N : Size of the Array arr[]
// Function to count inversions in the array.
long long mi=0;
void merge(long long a[],long long l,long long m,long long r){
long long n1=m-l+1;
long long n2=r-m;
long long L[n1],R[n2];
for (long long i = ... | ALGO | 0.999984 | 5.347492 |
cef9c4db-89b4-45d8-819b-a28558bbddf8 | AanPial/DSA-2 | Graph/BellmanFord.cpp | #include <bits/stdc++.h>
using namespace std;
#define infinity 0x7F7F7F7F
struct Edges
{
int u;
int v;
int c_u_v;
};
void bellmanford(Edges Graph[], int E, int source, int V)
{
int distance[V];
int parent[V];
for (int i = 0; i < V; i++)
{
distance[i] = infinity;
parent[i] = ... | ALGO | 0.999942 | 3.94412 |
606a0c85-2a8f-491b-b50c-7743cb2c4cf0 | nilay2207/CP | LeetCode/single-number/Accepted/6-9-2022, 1_55_35 PM/Solution.cpp | // https://leetcode.com/problems/single-number
class Solution {
public:
int singleNumber(vector<int>& nums) {
map<int,int>m;
for(int i=0;i<nums.size();i++){
m[nums[i]]++;
}
int ans=0;
for(auto&x:m){
if(x.second==1){
a... | ALGO | 0.999934 | 5.728703 |
9f0b7a03-b1a1-4eed-ae57-5223ebbe950a | ArbazHassan20/DSA | Lab3/Q5.cpp | #include "iostream"
using namespace std;
class Node {
int data;
Node* next, *prev;
public:
Node() : next(NULL), prev(NULL), data(0) {}
Node(const int d) : data(d), next(NULL), prev(NULL) {}
friend class DLL;
};
class DLL {
Node* head;
Node* tail;
public:
DLL() : head(NUL... | ALGO | 0.999887 | 6.326462 |
0699062a-3bea-43be-9493-b0faf6edd391 | liuawen/Play-Leetcode | Play-Leetcode-master/1363-Largest-Multiple-of-Three/cpp-1363/main.cpp | /// Source : https://leetcode.com/problems/largest-multiple-of-three/
/// Author : liuyubobobo
/// Time : 2020-02-22
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
/// Sorting and Greedy
/// Time Complexity: O(nlogn)
/// Space Complexity: O(n)
class Solution {
public:
string larg... | ALGO | 0.999946 | 6.222664 |
b362334d-3124-4e44-a744-97b9049d29e4 | aric-chan/Leetcode | 0013-roman-to-integer/0013-roman-to-integer.cpp | class Solution {
public:
int romanToInt(string s) {
unordered_map<char, int> hashChar;
unordered_map<string, int> hashString;
int result = 0;
hashChar['I']=1;
hashChar['V']=5;
hashChar['X']=10;
hashChar['L']=50;
hashChar['C']=100;
hashChar['D'... | ALGO | 0.999882 | 6.286521 |
98d8734b-74a2-451b-b833-89317a1076c1 | shahrohit/Interview_DS_Algo | Graph/shortestPathWithObstacle.cpp | #include <cstring>
#include <vector>
#include <queue>
using namespace std;
// ----------------------- Introduction ------------------------------------------
// Title : Shortest Path in a Grid with Obstacles Elimination
// LeetCode No : 1293
// Difficulty : Hard
// Topics : Array, BFS, Matrix
// Link : https://leetcod... | ALGO | 0.999982 | 6.180824 |
25319f59-339b-4621-a8e6-d6ce35386abc | anish8808/Data-Structures-Concepts-with-LeetCode-Examples | 2-Array_2D/2th_question.cpp | #include<iostream>
using namespace std;
int main()
{
int arr[3][3] = {{1 ,2 , 3} , {4, 5 ,6} , {7 ,8 , 9}};
// printing the Array
for (int i=0; i<3; i++)
{
for (int j=0; j<3; j++)
{
cout<<arr[j][i]<<" ";
}
cout<<endl;
}
return 0;
} | ALGO | 0.994033 | 3.386002 |
5a14783f-1300-4baf-a9a8-6c12e36c4abd | liudonghua123/suyu | src/shader_recompiler/frontend/maxwell/translate/impl/half_floating_point_multiply.cpp | #include "shader_recompiler/frontend/maxwell/translate/impl/half_floating_point_helper.h"
namespace Shader::Maxwell {
namespace {
void HMUL2(TranslatorVisitor& v, u64 insn, Merge merge, bool sat, bool abs_a, bool neg_a,
Swizzle swizzle_a, bool abs_b, bool neg_b, Swizzle swizzle_b, const IR::U32& src_b,
... | TOOL | 0.897749 | 7.543155 |
eca783df-dc5b-4c29-928b-8ac94bb4e33a | ishandutta2007/codeforces | rui_er/normal/340/A.cpp | //By: OIer rui_er
#include <bits/stdc++.h>
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define per(x,y,z) for(int x=(y);x>=(z);x--)
#define debug(format...) fprintf(stderr, format)
#define fileIO(s) do{freopen(s".in","r",stdin);freopen(s".out","w",stdout);}while(false)
using namespace std;
typedef long long ll;
int x... | ALGO | 0.999795 | 3.430653 |
70b60661-897a-4c14-bb4a-1ed516648655 | im2sh/Algorithm | Algorithm_Study/4/4 - E : 14890 (경사로).cpp | #include <iostream>
using namespace std;
int n, l, a[104][104], b[104][104], ret;
void FastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
void Init() {
scanf("%d %d", &n, &l);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("... | ALGO | 0.999968 | 3.324826 |
98c6bfd5-de7f-44e5-b2ad-6a720c7b98f1 | bolt1502/los_frameworks_av | services/audioflinger/AudioResamplerSinc.cpp | #define LOG_TAG "AudioResamplerSinc"
//#define LOG_NDEBUG 0
#define __STDC_CONSTANT_MACROS
#include <malloc.h>
#include <string.h>
#include <stdlib.h>
#include <dlfcn.h>
#include <cutils/compiler.h>
#include <cutils/properties.h>
#include <utils/Log.h>
#include <audio_utils/primitives.h>
#include "AudioResamplerSin... | ALGO | 0.959864 | 5.951614 |
b5513235-dadb-4c07-ab44-60352378d44c | hasibul-hasib29/codeforces | 1740b.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
long long sum = 0;
long long max =-1;
int n;
cin>>n;
for (int i = 0; i < n; i++)
{
long long a, b;
cin>>a>>b;
if(a>b)
... | ALGO | 0.999919 | 4.29939 |
cb2d81e2-7ddb-4f6c-9187-fb757ec6a77d | ganeshmittal223/Cpp | Linked List 1/Eliminate duplicates from LL.cpp | #include <iostream>
class Node
{
public:
int data;
Node *next;
Node(int data)
{
this->data = data;
this->next = NULL;
}
};
using namespace std;
Node *removeDuplicates(Node *head)
{
if(head==NULL)
return head;
//Write your code here
int i=1;
Node *t1=head;
Node *t2=head->next;
... | ALGO | 0.999795 | 4.625448 |
94a88323-2e4d-45db-85f4-7ea74798c7f0 | minblock/picscoin | src/rpc/fees.cpp | #include <core_io.h>
#include <policy/feerate.h>
#include <policy/fees.h>
#include <rpc/protocol.h>
#include <rpc/request.h>
#include <rpc/server.h>
#include <rpc/server_util.h>
#include <rpc/util.h>
#include <txmempool.h>
#include <univalue.h>
#include <util/fees.h>
#include <algorithm>
#include <array>
#include <cma... | WEB | 0.954838 | 7.411463 |
f49c6d1a-7e53-460e-9dc1-833eed4428ca | Naeem-ur-rahman/DataStructures | lab work 60 programs/Class/Class 14.cpp | #include<iostream>
using namespace std;
class rev
{ int n,n1,rn=0,d;
public:
void input(); void calc();
void display(); };
void rev::input() {
cout<<"Enter any positive no : ";cin>>n; }
void rev::calc() {
n1 = n;
while(n>0) {
d=n%10; rn=(rn*10)+d; n/=10;} }
void rev::display(){
cout<<"Reverse of [ "<... | ALGO | 0.999421 | 3.927085 |
4c0dc1f3-9a88-4665-8a24-b5f40a0fd547 | Shridhar1115/Cheff_SHRI | EXPERT.cpp | #include <iostream>
using namespace std;
int main() {
// your code goes here
int t;
cin>>t;
for(int j=0;j<t;j++){
int x,y;
cin>>x>>y;
if(x<=(y*2)){
cout<<"YES\n";
}
else{
cout<<"NO\n";
}
}
return 0;
}
| ALGO | 0.999827 | 4.058377 |
7f8029c6-3b9c-47da-b264-0580a81bae4e | JenIsCoding/CS-SelfStudy | OOP using C++/Chap5/EndOfChap5Ex-18.cpp | /* FINAL EXERCISE 18
Write a program that declares an array of 10 integers.
Write a loop that accepts 10 values from the keyboard, and write another loop that displays the 10 values.
Do not use any subscripts within the two loops; use pointers only.
*/
#include <iostream>
using namespace std;
int main(){
const in... | ALGO | 0.995847 | 4.034287 |
8b6c0592-5d55-4f22-a2da-2948913169e7 | MiguelGodoy06/Examen-Miguel-Godoy | PARTE 4/main4.cpp | #include "main4.h"
#include <iostream>
using namespace std;
int main () {
//Primero pido los precios de los tres artículos y marco las variables de los precios de dichos productos:
float precio1; //Tomo variables tipo float por si el número no es entero
float precio2;
float precio3;
float preciofinal;... | ALGO | 0.9854 | 4.116868 |
53297ff7-f8ab-4dc2-9511-7c3b4bec6235 | tylerthecoder/graphics-homework | 4/test/jpeg/jddctmgr.cpp | #define JPEG_INTERNALS
#include "jinclude.h"
#include "jpeglib.h"
#include "jdct.h" /* Private declarations for DCT subsystem */
/*
* The decompressor input side (jdinput.c) saves away the appropriate
* quantization table for each component at the start of the first scan
* involving that component. (This is neces... | ALGO | 0.889332 | 6.472293 |
c908ef96-6580-4983-848a-0a0472d61f3d | Daksh2356/Leetcode_Questions | Depth First Search/Island Perimeter.cpp | /*
Question : 463. Island Perimeter
Date : 18-04-24
Problem Difficulty level : Easy
Related Topics : Array, Matrix, Depth First Search, Breadth First Search
Problem Statement:
You are given row x col grid representing a map where grid[i][j] = 1 represents land and grid[i][j] = 0 represents water.
Grid cells are conne... | ALGO | 0.999976 | 6.180593 |
48f8545f-2d6c-4dcc-b311-908e920bc65d | Mariam-Emad127/finalproject | 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.998784 | 6.761023 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.