uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
d1c246d9-cb0d-412e-ab9c-68dd551e8984 | ishant9805/DSA-LearnAndPractice | geeksForGeeks/SubsequencesPatterns/isSubsetPresent.cpp | #include<bits/stdc++.h>
using namespace std;
bool helper(int n, int k, vector<int> &a, vector<int> &sum, int curr, int ind) {
if (curr > k) return false;
if (ind == n) {
if (curr == k) {
return true;
}
else return false;
}
sum.push_back(a[ind]);
curr += a[ind];... | ALGO | 0.999811 | 4.759171 |
fbbcd6ec-fbfd-4615-855a-f022a42d5487 | Noodle-Dev/Java_HandLight_Control | libs/opencv/sources/modules/imgcodecs/src/loadsave.cpp | //
// Loading and saving images.
//
#include "precomp.hpp"
#include "grfmts.hpp"
#include "utils.hpp"
#include "exif.hpp"
#undef min
#undef max
#include <iostream>
#include <fstream>
#include <cerrno>
#include <opencv2/core/utils/logger.hpp>
#include <opencv2/core/utils/configuration.private.hpp>
#include <opencv2/im... | TOOL | 0.975712 | 6.36252 |
ac1bded1-3f3b-42dc-a204-3269178478d1 | alec-z/leetcode | 1537. Get the Maximum Score/main2.cpp | #include <vector>
using namespace std;
const long mod_p = 1e9 + 7;
class Solution {
public:
int maxSum(vector<int>& nums1, vector<int>& nums2) {
int l1 = nums1.size();
int l2 = nums2.size();
long sp1 = 0, sp2 = 0, p1 = 0, p2 = 0;;
long res = 0;
while (p1 < l1 && p2 < l2) {
... | ALGO | 0.999992 | 5.513349 |
99a2f27e-1f01-4a91-8fa9-2d56e4d7e27d | fsy-juruo/noip-2021-js-answer | t2021/JS-0053/variance/variance.cpp | #include<bits/stdc++.h>
#define mp make_pair
#define lb lower_bound
#define up upper_bound
#define re register int
using namespace std;
typedef long long ll;
typedef long double ld;
template<typename T> inline void rd(T &x){
x=0;bool fl=0;char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') fl^=1;
for(;isdigi... | ALGO | 0.99996 | 3.495809 |
338ba230-e693-44ea-98af-df5179e2ed5f | slack2450/csgo-dma-overlay | dma/boost_1_69_0/libs/math/example/policy_eg_10.cpp | // Note that this file contains quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!
//[policy_eg_10
/*`
To understand how the rounding policies for
the discrete distributions can be used, we'll
use the 50-sample binomial distribution with a
success fraction of 0.5 o... | ALGO | 0.979518 | 4.302341 |
e111a5b1-e214-4e33-b191-f3ccaa9b5539 | wenkeli/Cerebellum_simulation | Cartpole_Sim_CBM_Dev/src/main.cpp | #include "../includes/main.h"
#include "cartpole.cpp"
#include "mfinput.cpp"
using namespace std;
float calcMZOutputForce(const bool* ncFirings, int numNC) {
float inputSum = 0;
for (int i=0; i<numNC; ++i) {
inputSum += ncFirings[i];
}
inputSum = inputSum/(float)numNC;
return inputSum;
}
... | ALGO | 0.929149 | 5.232913 |
839dcc01-fad1-49fc-a721-12a259dd1700 | vinod-2309/Competitive-Programming | Codeforces/886 div 4/A_To_My_Critics.cpp | #include<bits/stdc++.h>
using namespace std ;
#define mod 1000000007
#define int long long
#define f(i,a,b) for( int i = a ; i < b ; i++ )
#define lb lower_bound
#define ub upper_bound
#define all(v) v.begin() , v.end()
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef ve... | ALGO | 0.999676 | 4.877955 |
eede7924-4ebe-45e9-9690-2ed40688e68c | peayss/algorithm | 알고리즘/11497(통나무건너뛰기).cpp | // 난이도는 가장 높은 통나무에 따라 정해짐
#include <bits/stdc++.h>
using namespace std;
int arr[10001];
int temp[10001];
vector<int>res;
int main(){
int t,n,l;
cin >> t;
for (int i=0; i<t; i++){
cin >> n;
for (int j=0; j<n; j++){
int num; cin >> num;
arr[j] = num;
}
... | ALGO | 0.999576 | 3.990419 |
9279c81c-865f-497f-95bd-06756b0643b4 | cwang588/algorithms | 2019宁夏网络赛/B.cpp | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
int x[55],y[55];
double dis[55];
void work(int case1)
{
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
for(int i=1;i<=54;++i)
dis[i]=0.0;
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x[i]>>y[i];
}
... | ALGO | 0.999943 | 3.885228 |
086e2404-bfe9-483d-a38b-33094595d885 | kyordhel/rosCLIPS60 | bridge/src/clipswrapper.cpp | /* ** ***************************************************************
* clipswrapper.cpp
*
* Author: Mauricio Matamoros
*
* Wrapper for most used CLIPS functions required/used by the bridge
*
** ** **************************************************************/
#include <map>
#include <stack>
#include "clipswrapper.h"... | TOOL | 0.88601 | 5.679013 |
4ada208d-66fb-421a-b589-4eae0acfc4eb | gaurav8297/vector_index | third_party/faiss/faiss/IndexAdditiveQuantizerFastScan.cpp | #include <faiss/IndexAdditiveQuantizerFastScan.h>
#include <cassert>
#include <climits>
#include <memory>
#include <omp.h>
#include <faiss/impl/FaissAssert.h>
#include <faiss/impl/LocalSearchQuantizer.h>
#include <faiss/impl/LookupTableScaler.h>
#include <faiss/impl/ResidualQuantizer.h>
#include <faiss/impl/pq4_fast... | ALGO | 0.973526 | 6.2839 |
9ba5d379-5adf-4625-8b97-853780815844 | mainul3195/All | 2/B - The last digit.cpp | #include<bits/stdc++.h>
using namespace std;
int mod(int a, int b, int n)
{
if(b==0)
return 1;
int tmp=mod(a, b/2, n);
tmp*=tmp;
if(b&1)
tmp*=a;
return tmp%n;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int t;
cin >> t;
while(t--)
{
int a, b;
cin >> a >> b;
cout << mod(a, b, 10) << "\n"... | ALGO | 0.999859 | 4.686632 |
18823ba5-1885-467a-a45d-b64af8f77eb8 | EatAllBugs/autonomous_learning | 03_planning/global_planner/dijstra/dijkstra.cpp | /*************************************************************************
> File Name: a_star.cpp
> Author: TAI Lei
> Mail: <EMAIL>
> Created Time: Sat Jul 20 12:38:43 2019
************************************************************************/
#include<iostream>
#include<cmath>
#include<limits>
#include<queue... | ALGO | 0.997606 | 4.688691 |
90259086-c206-46dc-b1f4-68dfb52bae8e | tharungade/leetcode | Sieve of Eratosthenes - GFG/sieve-of-eratosthenes.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function Template for C++
class Solution
{
public:
vector<int> sieveOfEratosthenes(int N)
{
vector<int> res;
vector<bool> arr(N+1, true);
for(int i = 2; i <= N; i++)
{
... | ALGO | 0.999488 | 6.074152 |
67af5f49-295f-4fcb-9219-eadebcd86b47 | kliciaoliveira/wavelets | Bidimensional-CORRETO/projects/Nwwavelets/main.cpp | // Reescrita do programa ondaletas bidimensional em Cplusplus
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
//Funcoes
double integral( double inicialx, double finalx, double inicialy, double finaly )
{
double res;
double parcial1 = ((finalx-inicialx)/2)*(finaly*finaly) + (((final... | ALGO | 0.999148 | 4.244913 |
800dfe7f-300f-44dd-8338-73c2513e1725 | thighburger/CPP2409 | challenge/week4/count_alpha.cpp | #include <iostream>
using namespace std;
int main(){
int vowel =0;
int consonant=0;
cout<<"영문자를 입력하고 ctrl+z를 치세요"<<endl;
char ch;
while(cin>>ch){
switch(ch){
case 'a': case 'e': case 'i': case 'o': case 'u':
vowel++;
break;
default:
consonant++;
... | ALGO | 0.982147 | 3.392113 |
0708098f-fc4a-4d36-a153-59317e355104 | riyo264/lit | 0540-single-element-in-a-sorted-array/0540-single-element-in-a-sorted-array.cpp | class Solution {
public:
int singleNonDuplicate(vector<int>& nums) {
int n = nums.size();
int h = n-2;
int l = 1;
if(n == 1)
{
return nums[0];
}
else if(nums[0]!=nums[1])
{
return nums[0];
}
else if(nums[n-1]!=nu... | ALGO | 0.999963 | 5.632781 |
ae81eb40-f808-4dd2-b17c-0ddcac7ea04b | ishandutta2007/codeforces | alternatingcurrent/normal/1487/D.cpp | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int T;
ll n;
int main(){
ios::sync_with_stdio(false);
cin >> T;
while(T--){
cin >> n;
ll lb = 1, ub = 1000001;
while(lb <= ub){
ll mid = (lb + ub) / 2;
ll a = (mid + mid + 1);
if(a * a / 2... | ALGO | 0.99987 | 4.208268 |
be546c7a-04e9-498b-98c5-bc5039b2eb5a | Bhanupal22600/CANDIDATE-MASTER | Cp31Sheet900/A_Blackboard_Game.cpp | #include <bits/stdc++.h>
using namespace std;
int n=32;
void calc() {
int cn1=0;
int cn2=0;
for(int i=1;i<=n;i++){
if(n%i==0 && i%2==0) cn1++;
else if(n%i==0 && i%2!=0) cn2++;
}
cout<<cn2<<" "<<cn1<<endl;
n++;
return;
}
int main() {
int t=32;
while(t--){
calc();
}
}
| ALGO | 0.996969 | 3.980929 |
36ddb1fc-8654-4e2b-97de-cd1975a00192 | SI-Abid/Hello-world | Weekly/w112a.cpp | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define be begin()
#define en end()
#define all(x) (x).begin(),(x).end()
#define out cout<<setprecision(20)
typedef vector<int> vi;
typedef vecto... | ALGO | 0.999106 | 3.882985 |
2970a5cc-8141-4eae-8b8c-bfb8ccf9ffc6 | shuvokr/Solution_for_UVA_OnlineJudge_Problems | 1237.cpp | #include <stdio.h>
#include <string.h>
using namespace std;
int main()
{
int Tast, HL[ 10000 ][ 2 ], i, Q, D, qurey, j, mark, res;
bool space = false;
scanf("%d", &Tast);
while(Tast--)
{
if( space ) puts("");
else space = true;
char company[ 10000 ][ 22 ];
scanf("%d",... | ALGO | 0.999659 | 3.512426 |
ed8de70f-e997-4e51-9ce0-04e1540ff636 | ramirezpulidojavier/SISTEMAS-CONCURRENTES-Y-DISTRIBUIDOS | EXAMEN_PRACTICO_SCD/examenale.cpp | #include <iostream>
#include <cassert>
#include <thread>
#include <mutex>
#include <random>
#include <chrono>
#include "Semaphore.h"
using namespace std ;
using namespace SEM ;
Semaphore puede_poner = 1;
Semaphore puede_fumar[3] = { 0 , 0 , 0 };
Semaphore puede_sacar = 0;
Semaphore espacio_libre = 3;
int ingredient... | ALGO | 0.966067 | 3.558624 |
b858adb2-4ad7-4ea3-b08e-37b21a7a051c | midhun73/DSA-0698---DAA | 28 - floyds algo.cpp | #include<stdio.h>
#include<cstdlib>
int floyd(int **graph,int n){
int i,j,k;
for(k=0;k<n;k++){
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(graph[i][j]>graph[i][k]+graph[k][j])
graph[i][j]=graph[i][k]+graph[k][j];
}
}
}
}
int main(void){
int n,i,j;
printf("E... | ALGO | 0.999752 | 3.492663 |
0d620377-0a67-4b4f-8b74-dbf4c550ec67 | liang-man/oceanbase | deps/oblib/src/lib/checksum/ob_parity_check.cpp | #include "ob_parity_check.h"
#include <algorithm>
#include <string.h>
#include "lib/utility/ob_print_utils.h"
namespace oceanbase
{
namespace common
{
#define P2(n) n, n^1, n^1, n
#define P4(n) P2(n), P2(n^1), P2(n^1), P2(n)
#define P6(n) P4(n), P4(n^1), P4(n^1), P4(n)
// The table shows the number of 1 for 0~255.
//... | ALGO | 0.997335 | 6.022883 |
e100dd12-ba8a-44c8-a00d-29cd8637885d | JamesQAQ/Coding-Practices | ZeroJudge/Solutions/b101. A. 收集凱蒂貓/2010-11-13_622772.cpp | #include <iostream>
using namespace std;
int main()
{
int n,temp,a[41],m,ans;
while (cin>>n)
{
if (n==0)
break;
ans=1000;
memset(a,0,sizeof(a));
for (int i=0;i<n;i++)
{
cin>>m;
for (int j=0;j<m;j++)
{
ci... | ALGO | 0.999644 | 3.230758 |
a3a02777-11ee-46dc-96d4-1035df3a0e05 | Aniket-Jain-byte/Advent_Of_COde | Advent_Of_Code/Day_11/q1.cpp | #include<bits/stdc++.h>
using namespace std;
class monkey {
public:
queue<int> items;
pair<char,int> operation;
int test, ifTrue, ifFalse;
};
int main() {
fstream myFile;
myFile.open("input.txt");
vector<monkey> monkeys;
string line;
while(getline(myFile,line)) {
... | ALGO | 0.99971 | 4.045637 |
ab79cc83-b982-4389-ad43-cd2a98ebf1fe | ishandutta2007/codeforces | zhylj/normal/1707/B.cpp | #include <bits/stdc++.h>
#define gc() getchar()
template <typename T> inline void rd(T& x) {
int si = 1; char c = gc(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = gc();
while(isdigit(c)) x = x * 10 + c - 48, c = gc();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args... | ALGO | 0.999953 | 4.156818 |
38720295-7e1a-466f-93af-0dde6d7279a8 | Okumbor/20th-century | .venv/Lib/site-packages/sklearn/svm/src/liblinear/tron.cpp | #include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include "tron.h"
#ifndef min
template <class T> static inline T min(T x,T y) { return (x<y)?x:y; }
#endif
#ifndef max
template <class T> static inline T max(T x,T y) { return (x>y)?x:y; }
#endif
static void default_print(const char *buf)
{... | ALGO | 0.999608 | 5.847107 |
16bb299a-7b34-4671-a938-d8276662275c | MangoAbricosik/-SolvingProblems | LeetCode/LeetCode_374.cpp | /**
* Forward declaration of guess API.
* @param num your guess
* @return -1 if num is higher than the picked number
* 1 if num is lower than the picked number
* otherwise return 0
* int guess(int num);
*/
class Solution {
public:
int guessNumber(int n) {
int l = 0, r ... | ALGO | 0.999989 | 6.058556 |
50571711-660f-4949-8ee5-0a2f2e16a5eb | aokblast/LeetCode_Problem_Solving | Eazy/665_Non-decreasing_Array.cpp | //
//Runtime 28
//Memory Usage 27
class Solution {
public:
bool checkPossibility(vector<int>& nums) {
int cnt = 0, n = nums.size();
for(int i = 1; i <= n - 1; ++i){
if(nums[i] < nums[i - 1]){
if(cnt++ == 1)
return false;
if(i == 1 || nu... | ALGO | 0.999997 | 5.556196 |
9a81054d-e933-4c54-8892-ef3d01bd83ae | elizagamedev/snes_spc | snes_spc/SPC_Filter.cpp | // snes_spc 0.9.0. http://www.slack.net/~ant/
#include "SPC_Filter.h"
#include <string.h>
#include "blargg_source.h"
void SPC_Filter::clear() { memset( ch, 0, sizeof ch ); }
SPC_Filter::SPC_Filter()
{
gain = gain_unit;
bass = bass_norm;
clear();
}
void SPC_Filter::run( short* io, int count )
{
require( (count... | ALGO | 0.993846 | 5.254729 |
927ef024-78c9-484e-96fc-e29c68584858 | hugo-manet/ttk-manet | core/vtk/ttkMorseSmaleQuadrangulation/ttkMorseSmaleQuadrangulation.cpp | #include <ttkMacros.h>
#include <ttkMorseSmaleQuadrangulation.h>
#include <ttkUtils.h>
#include <vtkInformation.h>
#include <vtkObjectFactory.h>
#include <vtkPointData.h>
#include <vtkUnstructuredGrid.h>
vtkStandardNewMacro(ttkMorseSmaleQuadrangulation);
ttkMorseSmaleQuadrangulation::ttkMorseSmaleQuadrangulation() {... | ALGO | 0.94461 | 5.938409 |
99b7a77f-3d5f-43ab-afc9-442ae0ba7df7 | elfarouk-etawil/LeetCode-Coding-Journey | Solutions/2. Add Two Numbers/solution.cpp | class Solution {
public:
/**
* Given two non-empty linked lists representing two non-negative integers,
* add the two numbers and return the sum as a linked list.
*
* @param l1 The first linked list representing a non-negative integer
* @param l2 The second linked list representing a non-n... | ALGO | 0.999994 | 7.146407 |
d460c08d-595c-40b7-93d2-a51eb9e6deab | lucas-vidmar/Sistemas-Embebidos | TP - Final/stockfish/src/bitboard.cpp | #include <algorithm>
#include <bitset>
#include "bitboard.h"
#include "misc.h"
namespace Stockfish {
uint8_t PopCnt16[1 << 16];
uint8_t SquareDistance[SQUARE_NB][SQUARE_NB];
Bitboard LineBB[SQUARE_NB][SQUARE_NB];
Bitboard BetweenBB[SQUARE_NB][SQUARE_NB];
Bitboard PseudoAttacks[PIECE_TYPE_NB][SQUARE_NB];
Bitboard Pa... | ALGO | 0.998762 | 5.758472 |
284903a9-4c56-491f-bd6a-71717b23161a | Mendeley/Qt | config.tests/unix/ssse3/ssse3.cpp | #include <tmmintrin.h>
int main(int, char**)
{
volatile __m128i a = _mm_set1_epi32(42);
_mm_abs_epi8(a);
volatile __m128i result = _mm_sign_epi16(a, _mm_set1_epi32(64));
(void)result;
return 0;
}
| TOOL | 0.869779 | 4.937181 |
f1ca27d8-41db-4be3-9a3f-8974f9e7fab6 | Hwang-Sangjin/Algorithm | BOJ/Graph & BFS/7562.cpp | #include <iostream>
#include <cmath>
#include <vector>
#include <string.h>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
int di[8] = { -2,-1,1,2,2,1,-1,-2 };
int dj[8] = { 1,2,2,1,-1,-2,-2,-1 };
using namespace std;
int N;
bool v[302][302];
int x, y;
int tx, ty;
vector<int>res;
void bfs()... | ALGO | 0.999732 | 4.058526 |
0ef70950-a44b-42a3-a609-8aba37ccfba7 | chenghui-lee/leetcode | 30 Day LeetCoding Challenge(June 2020)/Day 23 Count Complete Tree Nodes.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.99997 | 6.531578 |
50214afb-ce06-484f-8822-e2f8bd23e647 | soban09/DSA-Problems | Stacks/7_MaxAreaInBinaryMatrix.cpp | // points to remember:-
// insert n instead of -1 in vector in NSR function
#include<iostream>
#include<vector>
#include<stack>
#include<algorithm>
using namespace std;
vector<int> NSR(vector<int> arr, int n){
vector<int> v;
stack<int> s;
for(int i=n-1; i>=0; i--){
if(s.size()==0) v.push_back(n);... | ALGO | 0.999826 | 4.164766 |
0106ba32-a43e-4ab6-bf1f-529d1657e4b6 | FreeZoneMods/xray16 | SDK/sources/MagicSoftware/FreeMagic/Source/Intersection3D/MgcIntr3DLinLoz.cpp | #include "MgcDist3DLinRct.h"
#include "MgcIntr3DLinLoz.h"
using namespace Mgc;
//----------------------------------------------------------------------------
bool Mgc::TestIntersection (const Segment3& rkSegment,
const Lozenge& rkLozenge)
{
Real fSqrDist = SqrDistance(rkSegment,rkLozenge.Rectangle());
retu... | ALGO | 0.952422 | 3.022801 |
f49e3443-c414-447f-9eba-79f5fd3cdab5 | ishandutta2007/codeforces | heltion/normal/1400/E.cpp | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr int maxn = 5000 + 1;
int a[maxn], dp[maxn][maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
for(int i = 1; i <= n; i += 1) cin >> a[i];
for(int i = 0; i <= n; i +... | ALGO | 0.999956 | 3.626491 |
212e56bf-552f-438d-b635-78a04a671316 | Adityagithub24/data-structures | quick sort.cpp | #include<iostream>
using namespace std;
int traverse(int a[],int n)
{
for(int i=0;i<n;i++)
{
cout<<a[i]<<" ";
}
}
int swap(int &a,int &b)
{
int t=a;
a=b;
b=t;
}
int partition(int a[],int l,int r)
{
int pivot=a[r];
int i=l-1;
for(int j=l;j<r;j++)
{
if(pivot>a[j])
{
swap(a[++i],a[j]);
}
}
swap(a[++... | ALGO | 0.999974 | 4.286849 |
917b7395-d65d-455e-b6f8-300f248607b5 | Sayali-H-Thorat/All-Programs-C-CPP-Java | Program188.cpp | #include<iostream>
using namespace std;
class Arithematic
{
public:
int Addition(int iValue1, int iValue2)
{
int iAdd = 0;
iAdd = iValue1 + iValue2;
return iAdd;
}
};
int main()
{
int iNo1 = 0, iNo2 = 0, iAns = 0;
cout<<"Enter first number : \n... | ALGO | 0.964823 | 3.975542 |
fb25a674-b586-4966-9a6e-37f264573718 | sarvex/leetcode-php | solution/1700-1799/1720.Decode XORed Array/Solution.cpp | class Solution {
public:
vector<int> decode(vector<int>& encoded, int first) {
vector<int> ans{{first}};
for (int i = 0; i < encoded.size(); ++i)
ans.push_back(ans[i] ^ encoded[i]);
return ans;
}
}; | ALGO | 0.999991 | 5.141685 |
91110ed2-60a9-41a5-a414-2cb59e10c1b1 | MdManjurulHoqueJony/XPSC-Batch-03 | Week-8/Ageing.cpp | #include <bits/stdc++.h>
using namespace std;
void solve()
{
int x;
cin >> x;
cout << x - 10;
}
int main()
{
int t;
cin >> t;
while (t--)
{
solve();
cout << endl;
}
return 0;
} | ALGO | 0.998925 | 4.027852 |
bf147be5-ec3d-49dc-b443-f5e7a1fae651 | Hengle/SuperMayaLand | urho3d/Source/ThirdParty/Assimp/code/SplitLargeMeshes.cpp | /** @file Implementation of the SplitLargeMeshes postprocessing step
*/
// internal headers of the post-processing framework
#include "SplitLargeMeshes.h"
#include "ProcessHelper.h"
using namespace Assimp;
// ------------------------------------------------------------------------------------------------
SplitLargeM... | TOOL | 0.900149 | 6.815266 |
f33d5d6f-6a33-47c9-a038-39ae20712ff6 | Burhanuddin1999/Autoremesher | thirdparty/cgal/CGAL-5.1-beta1/examples/Polygon_mesh_processing/isotropic_remeshing_example.cpp | #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Surface_mesh.h>
#include <CGAL/Polygon_mesh_processing/remesh.h>
#include <CGAL/Polygon_mesh_processing/border.h>
#include <boost/function_output_iterator.hpp>
#include <fstream>
#include <vector>
typedef CGAL::Exact_predicates_inexact_co... | DATA | 0.96514 | 5.773491 |
3532da7f-190f-4d03-ae8b-470673301743 | kimi5231/WindowAPI_framework | B1A2_project1/FMOD_API/core/examples/plugins/fmod_distance_filter.cpp | #ifdef WIN32
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <math.h>
#include <stdio.h>
#include <string.h>
#include "fmod.hpp"
extern "C"
{
F_EXPORT FMOD_DSP_DESCRIPTION* F_CALL FMODGetDSPDescription();
}
const float FMOD_DISTANCE_FILTER_PARAM_MAX_DISTANCE_MIN = 0.0f;
const float FMOD_DISTANCE_FILTER... | TOOL | 0.994291 | 6.188813 |
2fa65b7f-a274-4793-8560-723b3bfb23a4 | RAJA-2004/DSA-Cpp | Searching/assignment/aggressiveCow.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool isPossible(vector<int>& ans,int k,int mid){
int position = ans[0];
int count = 1;
for(int i=1;i<ans.size();i++){
if(ans[i]-position>=mid){
count++;
position=ans[i];
}
if(count... | ALGO | 0.999987 | 4.76523 |
9b6ef594-ce22-4b50-bac4-671a6d7c834d | ReallyLastOne/LichessBot | runtime/stockfish_15.1_win_x64_avx2/src/uci.cpp | #include <cassert>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include "evaluate.h"
#include "movegen.h"
#include "position.h"
#include "search.h"
#include "thread.h"
#include "timeman.h"
#include "tt.h"
#include "uci.h"
#include "syzygy/tbprobe.h"
using namespace std;
namespace Stockf... | ALGO | 0.969533 | 7.464976 |
42fc8b3a-386e-4f86-92d8-822f5ddaf090 | yu-ri-kim/cpp-algorithm-study | 202004 ~ 202005/ATM/11399_0516.cpp | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> datas;
int dp[1001];
int main(){
int n , tmp;
cin >> n;
for(int i=0;i<n;i++) {
cin >> tmp;
datas.push_back(tmp);
}
sort(datas.begin(), datas.end()); // 가장 작은 순으로 더해야 함
dp[0]= datas[0]... | ALGO | 0.999649 | 4.571896 |
04619ea1-72c4-4636-9795-d90432df5102 | dependon/durian-ocr | 3rdparty/opencv-4.5.4/modules/core/src/split.dispatch.cpp | #include "precomp.hpp"
#include "opencl_kernels_core.hpp"
#include "split.simd.hpp"
#include "split.simd_declarations.hpp" // defines CV_CPU_DISPATCH_MODES_ALL=AVX2,...,BASELINE based on CMakeLists.txt content
namespace cv { namespace hal {
void split8u(const uchar* src, uchar** dst, int len, int cn )
{
CV_INSTR... | TOOL | 0.976157 | 6.685225 |
4b2deae9-d0be-4b60-9c00-db3cb94d7832 | alikhanmurat/PP1 | Lab4/Lab4C.cpp | //Lab4 Task C
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
int x, y, cnt = 0, z = 0, w = 0;
cin >> x >> y;
int arr[x][y];
for (int i = 0; i < x; i++){
for (int j = 0; j < y; j++){
cin >> arr[i][j];
if (arr[i][j] < 0)
cnt += 1;
}
... | ALGO | 0.999954 | 4.020133 |
f545e784-ee8b-433e-a7d3-fa14d4e1215a | Pragna235/InterviewBit | Number of 1 bits.cpp | /**
* @input A : Integer
*
* @Output Integer
*/
int numSetBits(unsigned int A) {
int count=0;
while(A>0){
if((A&1)==1)
count++;
A=A>>1;
}
return count;
}
| ALGO | 0.998369 | 4.925702 |
2912d0e7-f382-4708-8c57-642005912d09 | AdneMoretti/TEP | 2023.1/mencao++/color.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int solve(){
int N, B;
cin >> B >> N;
float res = B;
if(N>3){
res += (N-3)*100;
if(N > 7){
res = ((res*50)/100) + res;
}
else{
res = ((res*25)/100) + res;
}
}
return ... | ALGO | 0.988105 | 4.092046 |
f6704b19-7114-4bc5-b30f-593841de0ed7 | Kleenelan/rocSOLVER-to-rtx2080Ti-cuda | library/src/lapack/roclapack_gebd2.cpp | #include "roclapack_gebd2.hpp"
template <typename T, typename S, typename U>
rocblas_status rocsolver_gebd2_impl(rocblas_handle handle,
const rocblas_int m,
const rocblas_int n,
U A,
... | ALGO | 0.953703 | 7.659834 |
a0176662-e62d-4015-99e4-a2ca1a1107dc | dhairyapandya05/Data-Structures-and-Algorithms | Easy Problems/P_242_Validanagram.cpp | class Solution {
public:
bool isAnagram(string s, string t) {
// sort(s.begin(),s.end());
// sort(t.begin(),t.end());
// for(int i=0;i<s.size()||i<t.size();i++){
// if(s[i]!=t[i]){
// return false;
// }
// }
// return true;
// #2
... | ALGO | 0.999994 | 6.265606 |
c0ec3d34-9371-4b5d-9259-14401e5ae26a | youssef-degachi/data_structer | tree_travel/EXERCISE-DFS_PreOrder.cpp | #include <iostream>
#include <queue>
using namespace std;
class Node {
public:
int value;
Node* left;
Node* right;
Node(int value) {
this->value = value;
left = nullptr;
right = nullptr;
}
};
class BinarySearchTree {
private:
... | ALGO | 0.999954 | 5.923381 |
a32ac6c6-65f2-4f93-9bcb-d23373aa824d | aokblast/HormomorphicPDPFramework | HashTree/src/libhashtree.cpp | #include <queue>
#include <algorithm>
#include <future>
#include "MD5.h"
#include "SHA256.h"
#include "libhashtree.hpp"
HashTree::_Node::_Node(hash_value_t &&value): hash_value(std::forward<hash_value_t>(value))
, left(nullptr), right(nullptr) {
}
HashTree::_Node::~_Node() {
delete left;
delete right;
}
HashTre... | ALGO | 0.967028 | 5.634134 |
a8587fed-4ad1-4e7b-aea5-d793cfae9204 | galacean/physX.js | kaplademo/source/kaplaDemo/MathUtils.cpp | #include "MathUtils.h"
#include "foundation/PxMat33.h"
#include "PhysXMacros.h"
//---------------------------------------------------------------------
void jacobiRotate(PxMat33 &A, PxMat33 &R, int p, int q)
{
// rotates A through phi in pq-plane to set A(p,q) = 0
// rotation stored in R whose columns are eigenvect... | ALGO | 0.999886 | 5.643109 |
e3b58f1c-13a6-4aaf-9671-a91c0e9d462d | Minipoloalex/comp_prog | codeforces/contests/2121_div3/D/D.cpp | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (auto &ai: a) cin >> ai;
for (auto &bi: b) cin >> bi;
vector<pair<int,int>> ans;
for (int i = 0; i < n; i++) {
auto it = min_element(a.begin() + i, a.end());
int idx = i... | ALGO | 0.999983 | 3.586079 |
59c3af1e-b38d-4ecc-b98b-5dff3c80e8f3 | Mohammed-Alzawawi/ThanaTraining | STLL/set.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
set<int> myset;
// with repetition
multiset<int> mymultiset;
int n;
cin >> n;
for(int i = 0; i < n; i++){
int x;
cin >> x;
// log n
myset.insert(x);
}
cout << myset.size() << endl;
if(myset.find... | ALGO | 0.999093 | 3.36952 |
5c39775c-eda7-42e8-b73c-00b247b674bc | seanscal/optmethods | Project 4a/holsca-4a/program.cpp | // Declarations and functions for project #4
#include "stdafx.h"
#include <iostream>
#include <limits.h>
#include "d_matrix.h"
#include "d_except.h"
#include <list>
#include <fstream>
#include <conio.h>
using namespace std;
typedef int ValueType; // The type of the value in a cell
const int Blank = -1; // Indicates... | ALGO | 0.98607 | 4.512485 |
f79a99b1-6d11-4a4d-a899-ae10486b0e14 | ou3slati/competitive-programming | Implementations/IOI/09/D2/test.cpp | //Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector... | ALGO | 0.999858 | 3.306675 |
b9dffc2a-89ef-4513-a19f-d5ace8d505e6 | dubey22rohit/CPP-DSA | Practice/Neetcode/BestTimeToBuySellStock.cpp | #include <iostream>
#include <vector>
using namespace std;
int maxProfit(vector<int> &prices) {
int l = 0, r = 1;
int maxProfit = 0;
while (r < prices.size()) {
if (prices[l] < prices[r]) {
int pf = prices[r] - prices[l];
maxProfit = max(maxProfit, pf);
} else {
l = r;
}
r++;
... | ALGO | 0.999228 | 4.7633 |
32dda222-2508-4af9-ba10-22a320c95881 | ammarhakim/gkyl | Updater/momentCalcData/DistFuncGkMomentLBOCalcTensor1x2v.cpp | #include <DistFuncMomentCalcModDecl.h>
#include <cmath>
void GkM0Star1x2vTensor_VX(const double intFac, const double *wl, const double *wr, const double *dxvl, const double *dxvr, const double *fl, const double *fr, double *out)
{
// intFac: =2pi/m for gyrokinetics (not used in Vlasov).
// w[NDIM]: Cell-cente... | ALGO | 0.998894 | 4.034553 |
84272e6b-121b-4f2d-9743-6a2c876d819c | evanwalsh84/C-Graph-Example | C++ graph/test.cpp | // CSCI 3300
// Assignment: 5A
// Author: Evan Walsh
// File: graph.cpp
// Tab stops: 2
/* **,**
*/
#include <cstdio>
#include "equiv.h"
//=============================================================
// Edge
//=============================================================
struct Edge
{
int vertexloc... | ALGO | 0.999278 | 4.614517 |
6952de1c-25c9-4971-b7e7-b28b30295896 | PrincePatel8755853189/Dsa3rdsemster | 11days,1,loop lecture3/firstrhobus.cpp | #include <iostream>
using namespace std;
int main(){
//print The pattern of rhombus
int n;
cout<<"Enter the vaule";
cin>>n;
for ( int i = 1; i < n; i++)
{
//space
for (int j = 1; j< n+1-i; j++)
{
cout<<" ";
}
for (int k = 1; k < n; k++)
{
... | ALGO | 0.999522 | 3.239471 |
f2356e69-a0c1-4e16-b93f-02423f72101e | Vedant285/LeetCode | 1742-widest-vertical-area-between-two-points-containing-no-points/widest-vertical-area-between-two-points-containing-no-points.cpp | class Solution {
public:
int maxWidthOfVerticalArea(vector<vector<int>>& points) {
sort(points.begin(),points.end());
int ans=0;
for(int i=1;i<points.size();i++){
int dis=points[i][0]-points[i-1][0];
ans=max(ans,dis);
}
return ans;
}
}; | ALGO | 0.999907 | 5.481285 |
6c844403-888a-4c3f-a11f-e966a57d3657 | Vishaldhakrey/leetcode | 46-permutations/permutations.cpp | class Solution {
public:
void findPermutation(vector<int>& nums, vector<vector<int>>&ans, int ind){
if(nums.size() == ind){
ans.push_back(nums);
return;
}
for(int i=ind; i<nums.size(); i++){
swap(nums[ind], nums[i]);
findPermutation(nums, ans,... | ALGO | 0.999999 | 6.01361 |
c4ec133d-2e6b-41b1-b822-9b4536257a87 | Waqtii/waqtii_mobile_app | 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.9988 | 6.76073 |
e8013263-c363-4149-a703-a28cf67d5f1b | ishandutta2007/codeforces | bolshevik/normal/1685/E.cpp | #include<cstdio>
#include<utility>
#include<iostream>
using namespace std;
const int o=2e5+10;
int n,m,a[o],b[o],flg[o*4],p[o];long long s1,s2;pair<int,int> mn[o*4];
inline int d(int x,int y){if((x-=y)<0) x+=2*n+1;return x;}
void build(int id,int l,int r){
if(l==r){mn[id]=make_pair(b[l],l);return;}
int md=l+r>>1;
bu... | ALGO | 0.999981 | 3.614272 |
a6dd641c-ad92-4a98-b8c0-20d5426ef673 | remyvnkhiemtruong/ICPC | training/Codeforces/767A.cpp | // written at 16:57 on 18 Feb 2017
#include <bits/stdc++.h>
#define IOS std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr);
// #define __DEBUG__
#ifdef __DEBUG__
#define DEBUG(...) printf(__VA_ARGS__)
#else
#define DEBUG(...)
#endif
#define filename ""
#define setfile() freopen(fi... | ALGO | 0.999958 | 3.711634 |
c2d6d4d5-e1b3-4a70-85cb-81b032658985 | PaukIsUha/optimizing_formating_code | predictions/submissions-aizu-coop-gpt35/Codenet/p00207/336256809/response_9.cpp | The given code appears to be solving a maze problem. It uses a recursive function `meiro` to explore the maze and mark visited cells with a value of -1. The goal is to determine if the destination cell is reachable from the starting cell.
Upon analyzing the code, we can identify a few potential areas for optimization:... | ALGO | 0.99996 | 6.508532 |
215ca937-d60c-4807-92b6-506f3dbb50b4 | ishandutta2007/codeforces | miraclefafa/normal/575/B.cpp | #include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <cassert>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(... | ALGO | 0.999972 | 3.892237 |
5343644a-7fda-4257-a065-9f5fb2f2af38 | alvarohenriquecz/Algorithms_C-Plus-Plus_Part1 | Chapter 01/Pairing/main.cpp | // Pairing
#include <iostream>
using namespace std;
void Pairing(int n)
{
int i = 0;
while(i < n)
{
int j = 0;
while(j < n)
{
cout << i << ", " << j << endl;
j = j + 1;
}
i = i + 1;
}
}
int main()
{
Pairing(10);
return 0;
} | ALGO | 0.989071 | 4.334977 |
59713eea-6e22-4ccd-b2b3-65cbdfe01ca8 | clod182/tryhard-asd-2024 | ASD_2024/trees_algo/BST/bst_From_Preorder_array.cpp | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <climits>
using namespace std;
/*#region utilities functions*/
struct TreeNode {
int val;... | ALGO | 0.999977 | 6.396017 |
4eca4be2-4cc4-405a-9dd6-d747f87c273f | Mdfaique/dsa | lecture22(strings)/string.cpp | #include<iostream>
using namespace std;
string reverse(string s)
{
int st=0;
int e=s.length()-1;
while(st<e)
{
swap(s[st++],s[e--]);
}
return s;
}
int main(){
string str;
str.push_back('\0');// in str it ignore it
str.push_back('a');// initial 0 here
str.push_back('b');
str.push_bac... | ALGO | 0.993896 | 3.084988 |
38893d98-abd2-4bdf-930f-912f9fd2f295 | hhhxiao/Leetcode | stash/846.cpp | #include <algorithm>
#include <map>
#include <vector>
#include "dbg.h"
using namespace std;
bool isNStraightHand(vector<int>& hand, int groupSize) {
std::map<int, int> map;
for (size_t i = 0; i < hand.size(); i++) {
map[hand[i]]++;
}
while (!map.empty()) {
if (map.size() < groupSize) ... | ALGO | 0.999786 | 5.436526 |
bb668807-f117-4e62-a0ff-75368dfbe53d | Shuttles/23.Google | 1.KickStart/2020/6.RoundG/4.MergeCards.cpp | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <cinttypes>
using namespace std;
#define MAX_N 5000
struct node {
int ind;
long long val;
};
node arr[MAX_N + 5], num[MAX_N + 5];
int used[MAX_N + 5];
bool cmp(node a, node b) {
re... | ALGO | 0.999668 | 4.087932 |
c853e5f5-f4bf-4e55-8ddb-e5f2d337e77a | Stephenalexngo/Java-Cpp-Programs | KattisC++/secretmessage.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int main() {
int test,gridsize;
string word;
cin >> test;
while(test--) {
cin >> word;
for(int x=1; x<=100; x++) {
if(x*x >= word.length()) {
gridsize = x;
break;
}
}
char arr[gridsize]... | ALGO | 0.99986 | 3.883623 |
5685d661-8877-4f3c-9ab8-4e817be2fe76 | xmba15/miscellaneous | optimization/optical_flow/src/App.cpp | /**
* @file App.cpp
*
* @author btran
*
*/
#include <iostream>
#include <opencv2/opencv.hpp>
#include "OpticalFlow.hpp"
namespace
{
constexpr int NUM_TEST = 100;
cv::TickMeter meter;
} // namespace
int main(int argc, char* argv[])
{
if (argc != 3) {
std::cerr << "Usage: [app] [first/image/pat... | ALGO | 0.96967 | 5.767236 |
825ac6e5-3c9f-4015-ba3b-eb8a85793aff | WULEI7/WULEI7 | CodeForces/CF 1506A Strange Table（数组位置）.cpp | #include <iostream>
#include <cstdio>
using namespace std;
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
long long t,r,c,pos,row,col,ans;
cin>>t;
while(t--)
{
cin>>r>>c>>pos;
if(pos%r==0)
{
col=pos/r;
row=r;
}
else
{
col=pos/r+1;
row=pos%r;
}
ans=(row-1)*c+col;
cout<<an... | ALGO | 0.997266 | 3.239329 |
7f66dbb5-f9f3-484b-9d11-0d094d31c92c | sinhu-jung/Coding_Test | 프로그래머스/0/120809. 배열 두배 만들기/배열 두배 만들기.cpp | #include <string>
#include <vector>
using namespace std;
vector<int> solution(vector<int> numbers) {
vector<int> answer;
for(int i : numbers) {
answer.push_back(i * 2);
}
return answer;
} | ALGO | 0.999471 | 5.560359 |
eace5389-41d0-47de-b7f2-774e30599653 | teumaywerashe/DSAMinGitHub | DSAMinigit/MiniGit.cpp | #include <fstream>
#include <sstream>
#include <filesystem>
#include <iostream>
#include "MiniGit.hpp"
#include <set>
#include <map>
MiniGit::MiniGit() {}
void MiniGit::createDirectory(const std::string& path) {
if (!std::filesystem::exists(path)) {
std::filesystem::create_directories(path);
std::... | TOOL | 0.977389 | 6.982718 |
5ed9a4ff-8ed8-4fa8-9731-a8c4f04a114c | srijan2002/Data-Structures-and-Algorithms | Trees/Binary_Trees.cpp | #include<bits/stdc++.h>
using namespace std;
#define sync ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long int lli;
class Tree{
public:
int data;
Tree* left;
Tree* right;
Tree(int d){
data = d;
left = NULL;
right = NULL;
}
};
Tree* delet... | ALGO | 0.999977 | 3.758975 |
93824641-ec14-4818-be32-1fd41746b73f | rishi058/CP-DSA | Recursion_Backtracking/10_src_to_dest.cpp | #include <bits/stdc++.h>
using namespace std;
/*
given a matrix & src & dest coordinates, you can move down and right only(repeatition of prev move is allowed)
find the total no. of ways by which you can go to dest..
********* input *********
4 5 (row nd col)
4 1 (src)
2 5 (dest)
*/
set<string> ss;
bool vali... | ALGO | 0.99935 | 4.857747 |
2b3c2ff6-c44e-46a7-8068-e5b439e6a493 | wabiverse/UnrealEngineOldArchived | Engine/Source/ThirdParty/Crunch/src/crnlib/crn_hash.cpp | // File: crn_hash.cpp
// See Paul Hsieh's page at: http://www.azillionmonkeys.com/qed/hash.html
// Also see http://www.concentric.net/~Ttwang/tech/inthash.htm,
// http://burtleburtle.net/bob/hash/integer.html
#include "crn_core.h"
#undef get16bits
#if (defined(__GNUC__) && defined(__i386__)) || defined(__WATCOMC__) ||... | ALGO | 0.990257 | 6.412189 |
19391a4f-b51a-44a6-a8e3-e57e38d4ed56 | zahorkim/cpp_programs | cpp/template.cpp | #include <iostream>
#include <string>
using namespace std;
template <typename T>
T Average(T a, T b)
{
T average = (a + b) / 2;
return average;
}
string Average(string a, string b)
{
int len = (a.length() + b.length()) / 2;
string c = a + " " + b;
string d;
for (int i = 0; i < len; i++) {
/*len ϸ ... | ALGO | 0.994789 | 5.85882 |
34c7bd08-3e61-48b8-a38a-20deef7bbd67 | YttriumWillow/OI | Problems/UVA11324.cpp | // Problem: The Largest Clique
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/UVA11324
// Memory Limit: 0 MB
// Time Limit: 3000 ms
// Created Time: 2023-05-20 11:21:22
#include <iostream>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <cstring>
#define ... | ALGO | 0.99864 | 5.598553 |
38815e73-a116-4706-8d96-212ec0e82907 | kkt219a/OnlineJudge | BOJ/1003.cpp | //백준 - 1003 - 피보나치 (dp)
#include<iostream>
int dp[41][2],t,n,i;
int main(){
std::cin>>t;
for(;i<2;i++)
dp[i][i]=1;
for(;i<41;i++){
dp[i][0]=dp[i-2][0]+dp[i-1][0];
dp[i][1]=dp[i-2][1]+dp[i-1][1];
}
for(;t>0;t--){
std::cin>>n;
std::cout<<dp[n][0]<<" "<<dp[n][1]<<"\n";
}
} | ALGO | 0.999945 | 3.840747 |
13299280-c6cc-45aa-ba15-914c3c246564 | phidiaLam/GAMES | GAMES202_Homework_S2021/homework2/prt/ext/eigen/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_broadcast_simple.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::MatrixXf mat(2,4);
Eigen::VectorXf v(2);
mat << 1, 2, 6, 9,
3, 1, 7, 2;
v << 0,
1;
//add v to each column of m
mat.colwise() += v;
std::cout << "Broadcasting result: " << std::endl;... | ALGO | 0.998625 | 4.136906 |
c69ec7e6-0069-459a-86f6-1742e7d71558 | anjanesh/vlbjcas | PRACT/4.CPP | // Stack
// Simple Stack Operations
#include<iostream.h>
#include<conio.h>
const int MAX = 1000;
class Stack
{
private:
int sarray[MAX];
int top;
public:
Stack()
{ top=0; }
void push(int);
int pop();
void list();
};
void Stack::push... | ALGO | 0.862631 | 4.021929 |
e7dd95c1-c002-4635-8a09-ae8cf45d3682 | ShivanshKumarJha/Coding-Dump | BinarySearch/SmallestDivisorThreshold.cpp | #include<bits/stdc++.h>
#define ll long long int
#define mod 1e9 + 7
using namespace std;
bool check(vector<int>& nums, int divisor, int threshold) {
int n = nums.size();
int cnt = 0;
for (int i = 0; i < n; i++) {
cnt += ceil(((double)nums[i]) / ((double)divisor));
}
return (cnt <= threshold);
}
int smallest... | ALGO | 0.9999 | 5.110631 |
3f79f0bf-4123-4129-a02e-9be7f4fac48e | HassamJaved1/login_screen | 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.99887 | 6.783439 |
3293cb46-f00e-4cc6-8cee-a88e1e118008 | tornikeo/usi-hpc-solutions-archive | 02/src/dotProduct/dotProduct.cpp | /*
* This file was modified so that it loops over all
* required configurations (thread, vec size) in one go
* and prints out results as a CSV file to stdout
* for easy use with python pandas, for plotting.
*/
#include <math.h>
#include <omp.h>
#include <stdio.h>
#include <unistd.h>
#include <iostream>
#include <tuple... | TOOL | 0.976794 | 5.622742 |
42f50d39-c6a6-4723-a1c2-4d92f76c71d7 | zachang890/CS32 | HW 2/mazestack.cpp | #include <string>
#include <stack>
#include <iostream>
using namespace std;
class Coord
{
public:
Coord(int rr, int cc) : m_r(rr), m_c(cc) {}
int r() const { return m_r; }
int c() const { return m_c; }
private:
int m_r;
int m_c;
};
bool pathExists(string maze[], int nRows, int nCols, int sr, i... | ALGO | 0.999528 | 4.338376 |
443585dd-0c35-473c-a368-c1b7ee7fa076 | Zhangxiaof001/mower | src/slic3r_coverage_planner/Slic3r/xs/src/BSpline/BSpline.cpp | // -*- mode: c++; c-basic-offset: 4; -*-
/**
* @file
*
* This file defines the implementation for the BSpline and BSplineBase
* templates.
**/
#include "BSpline.h"
#include "BandedMatrix.h"
#include <vector>
#include <algorithm>
#include <iterator>
#include <iostream>
#include <iomanip>
#include <map>
#include <... | ALGO | 0.999723 | 7.695564 |
8aa093ab-1a46-4885-872f-cd1cb9f75629 | jcheng1103/USACO-practice | geteven/geteven/main.cpp | #include <iostream>
#include <fstream>
#include <map>
using namespace std;
int ans = 0, p[7];
int a[2][7];
void search(int parity, int d){
if (d == 7){
if ((p[0]+p[1]+p[2]*2+p[3]+p[1])*(p[4]+p[5]+p[1]+p[2])*(p[6]+p[5]+p[5]) % 2 == 0){
int x = 1;
for (int i = 0; i < 7; i++){
... | ALGO | 0.999938 | 4.0028 |
55d9ea57-33a8-4aae-98ba-61e0a4ecd54a | hellcy/Cpp | Advent of Code 2018/day16/part1.cpp | #include <iostream>
#include <vector>
#include <string>
#include <fstream>
#include <sstream>
using namespace std;
int like = 0, likeCount = 0;
vector<int> before, after, opcode;
string word = "";
void addr()
{
if (after[opcode[3]] == (before[opcode[1]] + before[opcode[2]]))
{
like++;
printf(" addr\n");
}
}
v... | ALGO | 0.964418 | 4.218142 |
fb3c8056-ad47-4bfc-8d23-40669775106a | alvans11188/EstructuraDeDatos | FINAL/finalTRue/arbolesBinarioBusquedaFinal.cpp | #include<iostream>
#include<iomanip>
#include<string>
using namespace std;
class Nodo{
public:
int info;
string info2;
Nodo* izq;
Nodo* der;
};
class Arbol{
private:
Nodo* raiz; //apuntador al inicio del arbol
public:
Arbol(); //constructor
Nodo* regresaRaiz();
void insertarNodo(Nodo*& apnodo, in... | ALGO | 0.998222 | 3.746959 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.