uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
47c0da67-95d3-4739-842c-2c1a24c86576 | Alex-Shen1121/SZU_Learning_Resource | 计算机与软件学院/面向对象程序设计（荣誉）/大作业1/素材1/2016071031_1119_2.cpp | 2016071031:Problem1119:𰸴
#include <iostream>
#include <bits/stdc++.h>
// ת
using namespace std;
class BaseAccount {
protected:
string name;
string account;
int balance;
public:
BaseAccount() {}
BaseAccount(string name_, string account_, int balance_)
:name(name_), account(account_), balanc... | ALGO | 0.910827 | 3.648 |
b9348de1-04f5-4bfa-95d8-c6b147de66a5 | Shaykat/CodeForces | 2char.cpp | #include<bits/stdc++.h>
using namespace std;
#define PF printf
#define SF(n) scanf("%d", &n)
#define SFF(a,b) scanf("%d %d", &a, &b)
#define SFFF(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define INF_I 2147483647 //max limit
#define INF 1999999999
#define PB push_back
#de... | ALGO | 0.99988 | 3.543052 |
f39bf41d-f09f-4b1b-9f17-124d0fa32b32 | dhruvaop/DSA | 14. Dynamic Programming/1-coin-change.cpp | // { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
long long int dp[1000][1000];
long long int solve(int a[], int m, int n){
if(m == -1 && n > 0) return 0;
if(n == 0) return 1;
if(n < 0) return 0;
if(dp[m][... | ALGO | 0.999958 | 5.401342 |
6461ec6e-f989-47b2-91a0-df574ec928a5 | artecs-group/sycl-optic-flow | src/tvl1/sycl/kernels/kernels.cpp | #include <CL/sycl.hpp>
using namespace cl;
#include <iostream>
#include <cmath>
#include "kernels.hpp"
void bodyDivergence(const float *v1, const float *v2, float *div,
int nx, int ny,
int blocks, int threads, cl::sycl::queue queue)
{
queue.submit([&](cl::sycl::handler& h) {
h.parallel_for<class ... | ALGO | 0.9968 | 3.481204 |
896a8369-8dda-4f2a-aea8-4dadf8c86bb8 | dhnesh12/codechef-solutions | 03-CodeChef-Medium/744--Twin Robots.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<long long>> dp(n, vector<long long>(n));
vector<vector<int>> a(n, vector<int>(n));
for(int i = 0;i < n;i ++) {
for(int j = 0;j < n;j ++) {
cin >> a[i][j];
}
}
... | ALGO | 0.999979 | 3.957221 |
abfeeeba-3510-407f-aff3-c93c365a110b | afsahahmad/DSALAB | Pointers/program 8.cpp | #include <iostream>
using namespace std;
void area_of_circle(float *value, float *result)
{
*result = 3.14 * (*value) * (*value);
}
int main()
{
float radius, area;
cout << "Enter the radius of Circle : "<<endl;
cin>>radius;
area_of_circle(&radius, &area);
cout << "Area of Circle : " << area<<endl;
return 0... | ALGO | 0.999615 | 3.409326 |
b1e47c2c-e1bf-4429-a0cb-a9a4231eae03 | tic40/atcoder | algo-method/355/main.cpp | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
int main() {
int n; cin >> n;
cout << floor(sqrt(n)) << endl;
return 0;
} | ALGO | 0.999792 | 4.15701 |
d5fd4ee6-0b02-4091-8cef-06d8a4b48c4f | ishandutta2007/codeforces | marckess/normal/963/D.cpp | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define FOR(i,n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
t... | ALGO | 0.999799 | 4.085864 |
fae1b08c-c365-41c7-bc00-066fd32e392f | StdDongcheol/AlgorithmTest | 11659/11659.cpp |
#include <iostream>
#include <vector>
int main(void)
{
int N = 0;
int M = 0;
int Numb[100001] = { 0 };
ios_base::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
std::cin >> N >> M;
for (int i = 1; i <= N; ++i)
{
int Num = 0;
std::cin >> Num;
Numb[i] += Numb[i - 1] + Num;
}
for (int Count... | ALGO | 0.999964 | 4.031304 |
a63f9da4-f29d-4291-bfa3-cf2800b4b311 | VRMGOrganization/Vismaya | blender-2.68/extern/bullet2/src/BulletCollision/Gimpact/gim_contact.cpp | #include "gim_contact.h"
#define MAX_COINCIDENT 8
void gim_contact_array::merge_contacts(
const gim_contact_array & contacts, bool normal_contact_average)
{
clear();
if(contacts.size()==1)
{
push_back(contacts.back());
return;
}
gim_array<GIM_RSORT_TOKEN> keycontacts(contacts.size());
keycontacts.resize(... | ALGO | 0.995613 | 4.558418 |
e01bd778-6fa6-4efc-9612-46777e65ecd2 | medhajha810/LeetCode | 0235-lowest-common-ancestor-of-a-binary-search-tree/0235-lowest-common-ancestor-of-a-binary-search-tree.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root==NU... | ALGO | 0.999995 | 6.180622 |
d4081800-716a-401c-b81b-77441e71575e | BenzoPlayer/external_skia | src/pathops/SkPathOpsCurve.cpp | #include "SkPathOpsBounds.h"
#include "SkPathOpsRect.h"
#include "SkPathOpsCurve.h"
void SkDCurve::setConicBounds(const SkPoint curve[3], SkScalar curveWeight,
double tStart, double tEnd, SkPathOpsBounds* bounds) {
SkDConic dCurve;
dCurve.set(curve, curveWeight);
SkDRect dRect;
dRect.setBounds(... | TOOL | 0.967075 | 7.643359 |
d33936da-37ab-457d-a4ae-dd95cdaabf10 | n22dcdk069/LeMinhQuan_Mon-C | Chapter5/Program/program1.cpp | // This program demonstrates the ++ and −− operators.
#include <iostream>
using namespace std;
int main()
{
int num = 4; // num starts out with 4.
// Display the value in num.
cout << "The variable num is " << num << endl;
cout << "I will now increment num.\n\n";
// Use postfix ++ to increment n... | ALGO | 0.997277 | 5.103428 |
32c7f200-a127-4e73-ab2f-5f63534311e4 | BSU2016gr09/ShishkarovIvan | first_term/1.5.cpp | #include <iostream>
#include <clocale>
#include <ctime>
using namespace std;
float FloatRandom();
void InitRandomArray(float A[], int N);
void PositiveArray(float A[], int N, float B[], int & k);
void NegativeArray(float A[], int N, float C[], int&j);
void PrintArray(float A[], int N);
int main()
{
/*Îáúÿâèòü ìàññèâ À ... | ALGO | 0.993162 | 3.227268 |
c57d206a-03a4-48b7-a6fd-d053f00d8f19 | RichaoWang/RobotSimulation | 3rdparty/eigen-3.4.0/doc/examples/Tutorial_BlockOperations_corner.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace std;
int main()
{
Eigen::Matrix4f m;
m << 1, 2, 3, 4,
5, 6, 7, 8,
9, 10,11,12,
13,14,15,16;
cout << "m.leftCols(2) =" << endl << m.leftCols(2) << endl << endl;
cout << "m.bottomRows<2>() =" << endl << m.bottomRows<2>() << endl << ... | ALGO | 0.998405 | 4.092313 |
1cc39631-c74a-417f-90c8-dda9fa200ad8 | jqk6/30-Days-Of-cpp | Day 03/InputOutputDemo.cpp | #include <iostream>
using namespace std;
int main()
{
int num1,num2;
cout<<"Enter the value of num1: \n";
cin>>num1;
cout<<"Enter the value of num2: \n";
cin>>num2;
cout<<"The sum is:"<<num1+num2<<endl;
return 0;
}
// '<<' are called insertion operator
// '>>' are called extraction oper... | ALGO | 0.927852 | 3.178198 |
0c724664-6f80-4c67-b429-ba4b0b7570fa | ANJani9web/Computer_Graphics | Assignment_04/que_01.cpp | #include <GL/glut.h>
#include<bits/stdc++.h>
using namespace std;
// Declare global variables to store circle parameters
float x_cen, y_cen, radius;
vector<float> x_coor, y_coor;
// Display callback function
void displayCB() {
// Initialize variables for the circle drawing algorithm
float x_comp = 0, y_comp ... | ALGO | 0.999291 | 6.174589 |
c7e29753-7dfb-471f-a59a-ead5ddc17231 | kajalrawat3603/Oops_with_Cpp | unit-01/P3_Task-02_ArrayInC++.cpp | #include<iostream>
using namespace std;
int multiplyTwoMatrix();
int multiplyTwoMatrix()
{
int r1,r2,c1,c2,i;
cout<<"Enter r1&c1:";
cin>>r1;
cin>>c1;
cout<<"Enter r2&c2:";
cin>>r2;
cin>>c2;
if(c1!=r2)
{
cout<<"Not possible"<<endl;
return 0;
}
else{
int a[r1][c1],b[r... | ALGO | 0.996106 | 3.382673 |
3d12dd3b-6acc-41e9-9a11-9ffe2a603258 | monikapatidar27/DSA_learning | codechef/good _array.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int k;
cin>>k;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int sum=0;
int res = arr[0];
for (int i = 1; i < n; ++i){
res = max(res, arr[i]);
}
for(int i=0;i<n;i++){
sum+=(... | ALGO | 0.999933 | 3.934776 |
a3132977-39a0-468d-a707-d76adeb70e0c | ishandutta2007/codeforces | robezh/normal/899/F.cpp | #include <bits/stdc++.h>
using namespace std;
#define lson(x) 2*x+1
#define rson(x) 2*x+2
typedef long long ll;
const int N = (int)2e5 + 500;
int n,m;
string str;
set<int> S[256];
struct Tree {
int n;
int dat[N * 4];
void init_dat(int l, int r, int x){
if(l == r){dat[x] = 1; return ;}
... | ALGO | 0.999994 | 4.142999 |
5b5fb2d0-2535-4a9a-b1d9-c0c762847504 | sarvex/leetcode-haskell | lcof/面试题55 - II. 平衡二叉树/Solution.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isBalanced(TreeNode* root) {
function<int(TreeNode*)> dfs = [&](TreeNode* root) ->... | ALGO | 0.999865 | 6.855761 |
2de1fa3e-86c9-41ed-89cc-cb0212b583b8 | sahilduhan/coding-blocks | arrays/binary_search.cpp | #include <bits/stdc++.h>
using namespace std;
int binary_search(int arr[], int size, int key)
{
int start = 0;
int end = size - 1;
while (start <= end)
{
int mid = (start + end) / 2;
if (arr[mid] == key)
{
return mid;
}
else if (arr[mid] > key)
... | ALGO | 0.999747 | 5.544936 |
3ad5c157-b9f9-48dd-8fa1-3f542a30d2f4 | dxuanthu1/New | I_GGX64/4/4对2/1马3兵对1炮1马.cpp | #ifndef END_my_m_MT_R_1ma3pawn_B_1pao1ma
#define END_my_m_MT_R_1ma3pawn_B_1pao1ma
#include "..\\..\\chess.h"
#include "..\\..\\preGen.h"
#include "..\\..\\endgame\mat.h"
#include "1311.cpp"
#include "..\\..\\white.h"
#else
#include "..\\..\\black.h"
#endif
//
//
void my_m_MT_R_1ma3pawn_B_1pao1ma(typePOS &POSITION... | ALGO | 0.980652 | 3.07742 |
a5d5bcd3-9275-410f-8b8a-5547a24380d0 | kaist-plrg/codeql | codeql-repo/cpp/ql/src/Likely Bugs/Memory Management/PointerOverflow-good.cpp | bool not_in_range(T *ptr, T *ptr_end, size_t i) {
return i >= ptr_end - ptr; // GOOD
} | ALGO | 0.958455 | 3.473926 |
85026089-d9ed-4f5e-a7b8-3b26cc6b5374 | shubh-v1/codechef-partially-solved | HILLJUMP.cpp | //HILLJUMP
#include<iostream>
#define ll long long int
using namespace std;
int main()
{
ll n,q,a[100005],l,r,x,f,flag,in,temp,cindex;
scanf("%lld",&n);
scanf("%lld",&q);
for(register long long int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
}
for(register long long int i=0;i<q;i++)
{
scanf("%lld",&f);
if(f==1)
... | ALGO | 0.999777 | 3.545576 |
f7b6afcf-ad07-47fb-bbf4-eaf69235a4f8 | tfg1434/cp | USACO/countTheCows.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define tcT template<cl... | ALGO | 0.999666 | 4.24159 |
bb0c8b15-401f-4547-a7ae-4109cd96e5c6 | paolo-torres/interview-prep | leetcode/all/all/score_of_parentheses.cpp | // Count depths, every match adds "()" exponent depth
// Time: O(n)
// Space: O(1)
class Solution {
public:
int scoreOfParentheses(string s) {
int depth = 0;
int result = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
depth++;
} ... | ALGO | 0.99932 | 5.963024 |
0cd567e7-81b1-41bf-a8f1-9a8182d40c66 | Cuda-Chen/leetcode_pratice | 905/solution.cpp | // Scan the array, divide odd and even number, then merge odd and even arrays
class Solution {
public:
vector<int> sortArrayByParity(vector<int>& A) {
vector<int> odd;
vector<int> even;
for(auto value : A) {
if(value % 2 == 0) {
even.push_back(value);
... | ALGO | 0.999984 | 5.689251 |
82d58a8e-37a8-4ba8-876a-ba44c3f20248 | Jelegummy/Algorithm_Lab | testlab/search/tt2.cpp | #include <iostream>
#include <vector>
using namespace std;
void inter(vector<int> &a, int l, int r, int k)
{
int p = ((k - a[l]) * (r - l)) / (a[r] - a[l]);
if (a[p] == k)
{
cout << p;
}
else if (a[p] < k)
{
inter(a, l, p - 1, k);
}
else
{
inter(a, p + 1, r,... | ALGO | 0.999932 | 5.599341 |
91e4ca4a-47b3-4e75-9b75-54a1052997f0 | manasa043/100daysofcode | tripletsum.cpp | // A simple C++ program to find three elements
// whose sum is equal to zero
#include <bits/stdc++.h>
using namespace std;
// Prints all triplets in arr[] with 0 sum
void findTriplets(int arr[], int n)
{
bool found = false;
for (int i = 0; i < n - 2; i++) {
for (int j = i + 1; j < n - 1; j++) {
for (int k = j +... | ALGO | 0.999155 | 5.04439 |
0f4d7216-d276-4417-97d6-cc5f3c7a94d6 | simX/d2x-xl | branches/fmod/effects/glare.cpp | #ifdef HAVE_CONFIG_H
#include <conf.h>
#endif
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include "descent.h"
#include "error.h"
#include "ogl_lib.h"
#include "ogl_shader.h"
#include "gameseg.h"
#include "light.h"
#include "dynlight.h"
#include "lightmap.h"
#include "renderlib.h"
#in... | ALGO | 0.854928 | 4.19643 |
b00ad9f4-6559-458b-9f48-46f29e5df488 | qcscine/molassembler | src/Molassembler/Stereopermutators/RankingMapping.cpp | #include "Molassembler/Stereopermutators/RankingMapping.h"
#include "Molassembler/Temple/Functional.h"
namespace Scine {
namespace Molassembler {
namespace {
unsigned symmetricDifferenceSetSize(
const std::vector<AtomIndex>& a,
const std::vector<AtomIndex>& b
) {
assert(std::is_sorted(std::begin(a), std::end(a... | ALGO | 0.999368 | 6.739942 |
fc940427-fa7d-4ac6-9aac-8dd16532e806 | sdj047476/clang | Clang stack/stack.cpp | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef struct Stack {
int top;
int data[100];
}Stack;
void stackInit(Stack* stack) {
stack->top = -1;
}
int isEmpty(Stack* stack) {
return stack->top == -1;
}
void push(Stack* stack) {
int num;
printf(" Է. ");
scanf("%d", &num);
stack->data[++stack->t... | ALGO | 0.988863 | 3.16694 |
86669c2f-7add-42a2-951f-8eaae81a5db8 | ShuggiZiggi/ex3 | ex3/main.cpp |
#include <iostream>
#include <cstddef>
#include <iterator>
#include "Rational.h"
#include "Poly.h"
//using namespace elranTheHomo;
int main()
{
//Rational coeffs1[] = { 15, 0, 0, 5, 0, 0, 0, 3, 0, 0, 0, 0, 5, 0, { 17, 2 } };
// Rational coeffs2[] = { 14, 3, 5, 2, 0, 4, 4, 0, 5, 0, 6, 0, 7, 0, { 17, 2 } };
... | TOOL | 0.986574 | 3.734368 |
8a776eb9-092f-43a2-ba1e-7f6b64c96d53 | Acul4321/competitive-programming-submissions | atcoder/abc400/abc400_b/main.cpp | #include <iostream>
#include <string>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
#include <set>
#include <map>
#include <deque>
#include <stdio.h>
#include <cassert>
#define ll long long
#define ld long double
#define MOD(x,y) (x%y+y)%y
using namespace std;
int main()... | ALGO | 0.999972 | 4.019723 |
386e1e44-47a3-4302-b1b8-60cb49645f41 | solareenlo/atcoder | 05_AtCoder-Beginner-Contest/abc006/B/main001.cpp | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// 便利関数
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return ... | ALGO | 0.999993 | 3.830745 |
d2629dfa-0be0-4311-b5fb-d778b2b2d601 | Codesmith28/cse205-ds | cp/cses/Edit_Distance.cpp | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#include "debug.h"
#else
#define dbg(x...)
#endif
using namespace std;
/* (╯°□°)╯︵ ┻━┻ */
#define int long long
#define pii pair<int, int>
#define endl "\n"
void solve( ) {
string a, b;
cin >> a >> b;
a = "#" + a;
b = "#" + b;
int n = a.size( ), m... | ALGO | 0.999957 | 4.524278 |
75dad0e7-0f12-41b4-9180-10287f48b71a | Akasho09/DSA2 | array/A2Zeasy/rotateArray.cpp | /*
Given an integer array nums, rotate the array to the right by k steps,
where k is non-negative.
*/
#include <iostream>
using namespace std;
void rotate(vector<int>& nums, int k) {
vector<int> ans ;
for(int i = nums.size()-k;i<nums.size();i++){
ans.push_back(nums[i]);
} ... | ALGO | 0.999842 | 5.279758 |
c9e29ca9-21e3-4726-b572-622c9ad71249 | bdsadeq/uva-problem-solutions | Accepted (386)/V-110 (10)/11042.cpp | //Complex, difficult and complicated (#11042)
//Sadeq
//aita bair korte amar jan bair hoiya gese :)
#include<stdio.h>
#include<stdlib.h>
int main()
{
long a,b;
long cas,c;
scanf("%ld",&cas);
for(c=1;c<=cas;c++)
{
scanf("%ld %ld",&a,&b);
a=abs(a);
b=abs(b);
if(b==0) printf("1\n");
else if(a==0) print... | ALGO | 0.998495 | 3.331057 |
10c2c1b0-be29-4e2e-9e0c-4051df62c28f | krishna-gavas/Competitive-Coding | GeeksForGeeks/Tree/12.MaximumPathSum.cpp | // Maximum Path Sum
// Question:
// Given a binary tree in which each node element contains a number. Find the maximum possible sum from one
// leaf node to another.
// Input :
// 3
// / \
// 4 5
/... | ALGO | 0.999766 | 5.743619 |
c1d8003f-69ce-4feb-88a6-9c4924729833 | solimanhossain/competitive-programming-practice | leetcode/383. Ransom Note.cpp | #include<bits/stdc++.h>
using namespace std;
bool canConstruct(string ransomNote, string magazine){
for(auto letter : ransomNote){
int yes = 0;
for(int i=0; i<magazine.size(); i++){
if(magazine[i]==letter) {
magazine.erase(i, 1);
yes++;
br... | ALGO | 0.999972 | 5.310387 |
bfc25ba2-4069-40fc-9a08-60f05e8143da | arpituppal/competitive-programming-codes | spoj/YODANESS.cpp | /*
ARPIT UPPAL
MNNIT ALLAHABAD
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>
#include <map>
#include <string>
#include <climits>
#include <set>
#include <string... | ALGO | 0.999963 | 3.883646 |
b1893796-a4ff-4c33-b611-cf2c538904af | jenishk20/LeetCode-GFG | 0771-24-2185-counting-words-with-a-given-prefix/0771-24-2185-counting-words-with-a-given-prefix.cpp | class Node{
public:
Node *links[26];
int count = 0;
Node(){
for(int i=0;i<=25;i++){
links[i] = NULL;
}
count = 0;
}
void setCount(){
count++;
}
int getCount(){
return count;
}
bool containsKey(char ch){
return links[ch-'a... | ALGO | 0.999981 | 6.184947 |
5a07187d-724c-4917-b2c4-99cbb4990692 | deepin-community/trilinos | packages/ifpack/src/Ifpack_AMDReordering.cpp | #include "Ifpack_ConfigDefs.h"
#include "Teuchos_ParameterList.hpp"
#include "Teuchos_RefCountPtr.hpp"
#include "Epetra_MultiVector.h"
#include "Ifpack_Graph.h"
#include "Epetra_RowMatrix.h"
#include "Ifpack_Graph_Epetra_RowMatrix.h"
#include "Ifpack_AMDReordering.h"
extern "C" {
#include <trilinos_amd.h>
}
//=======... | ALGO | 0.999549 | 5.507932 |
24847aff-6b89-40c3-a207-a1acdf19b24e | 6shihab/wireless_Communication | cpp codes/Problem-4.cpp | #include<bits/stdc++.h>
using namespace std;
double Au = (2.0*3.0)/60.0;
double GOS = (2/100);
double C[]={19, 57, 100};
double cells[]={394, 98, 49};
double A(int tc){
if(tc==19){
return 12.0;
}
else if(tc==57){
return 45.0;
}
else if(tc==100){
return 88.0;
}
}
double to... | ALGO | 0.997032 | 3.807539 |
1061122c-07a6-463a-954d-645086af28dd | shleshitha/leetcode_DSA | 1402-count-square-submatrices-with-all-ones/count-square-submatrices-with-all-ones.cpp | class Solution {
public:
int countSquares(vector<vector<int>>& matrix) {
int ans=0;
int m=matrix.size(),n=matrix[0].size();
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(i==0||j==0){
ans+=matrix[i][j];
continue;
... | ALGO | 0.999842 | 6.176497 |
5b00aa4a-4fae-4bcc-bc02-d24673c52484 | hack-parthsharma/LeetCode | 2709-greatest-common-divisor-traversal/2709-greatest-common-divisor-traversal.cpp | int MX = 100010;
vector<int> P[100010];
int init = []() {
for (int x = 1; x < MX; ++x) {
int v = x;
int i = 2;
while (i <= v / i) {
if (v % i == 0) {
P[x].push_back(i);
while (v % i == 0) {
v /= i;
}
... | ALGO | 0.999944 | 5.275177 |
0ef50f18-f934-4705-bc0c-64f881521643 | nazmul-me/Online-Judge | codeforces/621B.cpp | #include <bits/stdc++.h>
using namespace std;
string line[10]={"x^y^z","x^z^y","(x^y)^z","y^x^z","y^z^x","(y^x)^z","z^x^y","z^y^x","(z^x)^y"};
int main()
{
long double x,y,z,maxi=-1;
int in;
cin>>x>>y>>z;
if(pow(z,y*x)>=maxi) maxi=pow(z,y*x),in=8;
if(pow(z,pow(y,x))>=maxi) maxi=pow(z,pow(y,x)),in=7;
if(pow(z,p... | ALGO | 0.999936 | 4.203245 |
c1b06dd0-d2b4-4ae6-b7cc-2584e6bccaea | raincross7/code-similarity | codes/train_code/problem377/problem377_72.cpp | // https://atcoder.jp/contests/dp/tasks/dp_l
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define mod 1000000007
#define gcd __gcd
#define inf INT_MAX
#define INF LLONG_MAX
#define minf INT_MIN
#def... | ALGO | 0.99999 | 4.571971 |
cf5ea895-9a96-4751-83b3-ab6dfb977c15 | kerozou/kyopuro | Codeforces解答/Div3-#634/c.cpp | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x)(x).begin(), (x).end() // 昇順ソート
#define rall(v)(v).rbegin(), (v).rend() // 降順ソート
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair < ll, ll >
#define F first
#define S second... | ALGO | 0.999857 | 3.889802 |
77c42965-1fb9-470a-8a06-a19fbb2dc703 | mahmud34033/My-Codeforces-Solutions | 34B - Sale.cpp | #include <bits/stdc++.h>
#include <math.h>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <climits>
#define ll long long int
#define nl "\n"
#define test() \
int t; \
cin >> t; \
while (t--)
#define forn(i, n) for (int i = 0; i < n; i++)
using namespace std;
// EO... | ALGO | 0.999973 | 4.608875 |
1e66c5af-f4d1-4c6a-801d-2d501f187d8f | Pixelstar-uday/frameworks_av | media/module/codecs/amrnb/common/src/reorder.cpp | /*
Filename: /audio/gsm_amr/c/src/reorder.c
------------------------------------------------------------------------------
REVISION HISTORY
Description:
1. Eliminated unused include file add.h.
2. Replaced array addressing by pointers
3. Eliminated math operations that unn... | ALGO | 0.999916 | 6.217961 |
9b7b0596-d581-4663-80b7-161533be82ad | GolamRabbi1503/codeforces | 703A-Mishka and Game.cpp | #include<iostream>
using namespace std;
int main()
{
int n,m,c,i,c1=0,c2=0;
cin>>n;
for(i=0; i<n; i++)
{
cin>>m>>c;
if(m>c)
c1++;
if(c>m)
c2++;
}
// cout<<c1;
// cout<<c2;
if(c1==c2)
cout<<"Friendship is magic!^^";
else if(c1>c2)... | ALGO | 0.999894 | 3.534006 |
592429bd-5443-4e39-8411-e576eae30b79 | alexandraback/datacollection | solutions_5686275109552128_0/C++/Shinefly/main.cpp | #include <cstdio>
#include <cstring>
const int N = 1000 + 10;
int n, d[N];
inline bool Check(int m) {
// printf("%d:\n", m);
for (int i = 1; i <= m; ++i) {
int cot = 0;
for (int j = 0; j < n; ++j)
cot += (d[j] - 1) / i;
// printf("%d %d\n", i, cot);
if (cot + i <= m) return true;
}
return false;
}
in... | ALGO | 0.99967 | 3.793204 |
9c59151f-cfb0-4da0-83e0-8aa19ab23940 | ParasAnxi/LeetCode-CPP | Q0001-0100/95. Unique Binary Search Trees II.cpp | class Solution
{
public:
map<pair<int, int>, vector<TreeNode *>> m;
vector<TreeNode *> solve(int start, int end)
{
vector<TreeNode *> v;
if (start > end)
{
v.push_back(NULL);
return v;
}
if (start == end)
{
v.push_back(new T... | ALGO | 0.99999 | 6.150508 |
c885bdc3-f270-4402-8e16-c274b0e82e50 | strengthen/LeetCode | C++/573.cpp | __________________________________________________________________________________________________
class Solution {
public:
int minDistance(int height, int width, vector<int>& tree, vector<int>& squirrel, vector<vector<int>>& nuts) {
int res = 0, mxDiff = INT_MIN, idx = 0;
for (auto nut : nuts) {
... | ALGO | 0.999952 | 5.608005 |
dd2c0c62-f50f-484a-87f8-db9e762d26d9 | gurug15/DSA | 04_sorting/quicksort.cpp | #include<bits/stdc++.h>
using namespace std;
void swap(int &a,int &b)
{
int temp =a;
a=b;
b=temp;
}
int partion(vector<int> &arr,int low,int high)
{
int pivoit = arr[low];
int i = low;
int j= high;
while(i<j)
{
while(arr[i]<=pivoit && i<=high-1)
{
i++;
... | ALGO | 0.999962 | 5.20911 |
818f8681-2e69-44ed-9a82-e40893f3375b | VedantParanjape/gem5 | src/systemc/tests/systemc/misc/user_guide/chpt10.1/paramadd.cpp | /*****************************************************************************
paramadd.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/***************************************************************************... | ALGO | 0.990661 | 5.820003 |
61816ead-3a2f-49bd-be41-4b03b3f9d3b8 | hiranoo/atcoder | contests/OTHER_CONTESTS/typical_90_retry/012.cpp | #include <bits/stdc++.h>
#include <atcoder/segtree>
#include <time.h>
#define rep(i, s, t) for(int i = (s); i <= (t); i++)
#define repd(i, s, t) for(int i = (s); i >= (t); i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
typedef pair<int, int> pii;
typede... | ALGO | 0.999966 | 4.999702 |
7486c287-2735-4654-808e-11c66f58c090 | raincross7/code-similarity | codes/train_code/problem441/problem441_62.cpp | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (n); i++)
const ll INF = 1LL << 60;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);... | ALGO | 0.999893 | 4.350587 |
daa7e04a-3336-49b5-9ca7-9a17efeb3cbc | EmmanuelEmu/DSA_-_leetcode | Leetcode/Graph/GFG_Distance of nearest cell having 1.cpp | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> nearest(vector<vector<int>> &grid)
{
int n = grid.size();
int m = grid[0].size();
vector<vector<int>> res(n, vector<int>(m, 0));
vector<vector<int>> vis(n, vector<int>(m, 0));
queue<pair<pair<int, int>, int>> q;
for (auto i = 0;... | ALGO | 0.99999 | 4.521615 |
c4d5aa72-4fa5-45f2-baa8-1fb844c1ae71 | Nick-Cho/Competitive-programming | Leetcode/jumpGame.cpp | class Solution
{
public:
bool canJump(vector<int> &nums)
{
int n = nums.size();
int reach = 0;
for (int i = 0; i < n; i++)
{
if (reach < i)
{
return false;
}
reach = max(reach, i + nums[i]);
}
return true;
}
}; | ALGO | 0.999965 | 6.356358 |
f0677908-1e97-4a88-9edc-b558ad0186f4 | dimunozv1/Metodos-simulacion | clase-15-2022-10-11/prueba.cpp | #include <cmath>
#include "Random64.h"
using namespace std;
const int Lx=1024;
const double p=0.5;
const int Q=2;
//--------------------- Clase LatticeGas ------------
class LatticeGas{
private:
int V[Q]; //V[i] i=0 (derecha) i=1 (izquierda)
int n[Lx][Q],nnew[Lx][Q]; // n[ix][i]
public:
LatticeGas(void);
voi... | ALGO | 0.999955 | 3.488003 |
248b7953-2b93-494f-802a-f58b7c68793e | cffjiang/ditto | public_library/algebra/Eigen3/bench/quat_slerp.cpp | #include <iostream>
#include <Eigen/Geometry>
#include <bench/BenchTimer.h>
using namespace Eigen;
using namespace std;
template<typename Q>
EIGEN_DONT_INLINE Q nlerp(const Q& a, const Q& b, typename Q::Scalar t)
{
return Q((a.coeffs() * (1.0-t) + b.coeffs() * t).normalized());
}
template<typename Q>
EIGEN_DONT_INL... | ALGO | 0.991766 | 6.251058 |
a6847d80-23b6-47d8-9569-31064b8ce69e | chemthan/algorithm | String/LyndonFactorization.cpp | #include <bits/stdc++.h>
using namespace std;
/*
* Complexity: O(N)
*/
vector<string> factorize(string s) {
vector<string> res;
int n = s.size(), i = 0;
while (i < n) {
int j = i + 1, k = i;
while (j < n && s[k] <= s[j]) {
if (s[k] < s[j])
k = i;
else
k++;
j++;
}
... | ALGO | 0.999613 | 4.380657 |
e60bbdd4-3f6b-4a08-98dc-8edbd3f4b462 | aasimtaif/mohd_asim_taifullah-2020bit069 | 10.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int num;
cin >> num;
long long fact = 1;
for (int i = 1; i <= num; i++)
fact *= i;
cout << fact << endl;
return 0;
} | ALGO | 0.999946 | 5.044621 |
ed5b4b0a-0e71-446d-befc-4a60451a8914 | vikashmishra464/competitiveCoding | geeksForGeeks/largestPairSum.cpp | // Question:
// Find the largest pair sum in an array of distinct integers.
// Examples :
// Input: arr[] = [12, 34, 10, 6, 40]
// Output: 74
// Explanation: Sum of 34 and 40 is the largest, i.e, 34 + 40 = 74.
// Input: arr[] = [10, 20, 30]
// Output: 50
// Explanation: 20 + 30 = 50.
// Expected Time Complexity: O(n)... | ALGO | 0.999961 | 5.979789 |
cdd778e5-9492-422d-9d2f-805d70ae6415 | Simon-0801/CodeHome | 计蒜客/训练联盟周赛/13B.cpp | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define INF 0x3f3f3f3f
#define mst(a,num) memset(a,num,sizeof a)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define repd(i,a,b) for(int i=a;i>=b... | ALGO | 0.99807 | 3.320252 |
140ee116-ac86-441f-adb3-1d8f436c2d2b | cho-uc/Peridynamics | Benchmark_model_05/benchmark_05_1d.cpp | #include <cmath> //for calculating power & NaN
#include<iostream>
#include<cstdio>
#include <vector>
#include <cstdlib>
#include <fstream> // for writing to file
#include <math.h> //exp, pi
using namespace std;
int main(int argc, char **argv){
cout<<"Start of program"<<endl;
const float E = 200.0e9; // Youn... | ALGO | 0.986189 | 3.446661 |
f208d74a-bc67-4ba4-8b26-a9c6149c3676 | Durgesh4993/LeatCodeSolutionInCpp | Best Time to Buy and Sell Stock.cpp | class Solution {
public:
int maxProfit(vector<int>& prices) {
int profit=0;
int minelem=prices[0];
for(int i=1;i<prices.size();i++){
minelem=min(prices[i],minelem);
profit=max(profit,(prices[i]-minelem));
}
return profit;
}
};
| ALGO | 0.99972 | 6.006391 |
26672ad3-2740-4595-9e13-67387f76458d | ShubhamYadav25/LeetCode-Problem-Solution | 1039-find-the-town-judge/find-the-town-judge.cpp | class Solution {
public:
int findJudge(int n, vector<vector<int>>& trust) {
vector<int> trustScore(n + 1, 0);
for (const auto& pair : trust) {
int a = pair[0];
int b = pair[1];
trustScore[a]--; // a loses credibility
trustScore[b]++; // b gains tru... | ALGO | 0.999931 | 5.688508 |
9cd72b69-f100-4921-a812-4b15de0a1c20 | MarianoJuly/Estrutura-de-dados | Ed Exercicio/ed hash/hashteste.cpp | /*
MaxHeap, para alteração de prioridade
by joukim & bruno, 2019
*/
#include <iostream>
#include <utility> // para usar swap
#include <stdexcept> // para usar exceção com runtime_error
using namespace std;
struct dado {
int prioridade;
int valor;
};
bool operator>(dado d1, dado d2) {
return d1.p... | ALGO | 0.990537 | 4.018719 |
161d22da-d6da-4c56-a4fb-ac90eabbc128 | Subrat29/100DaysCodingChallenge | Linked List/138. Copy List with Random Pointer/app1.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
class Node
{
public:
int val;
Node *next;
Node *random;
Node(int _val)
{
val = _val;
next = NULL;
random = NULL;
}
};
Node *copyRandomList(Node *head)
{
// step1: create ... | ALGO | 0.999074 | 4.591376 |
759fd510-c6c4-4592-a911-fe46902df654 | swapnilhota/LeetCode | Easy/Arrays/Height Checker.cpp | /*
A school is trying to take an annual photo of all the students. The students are asked to stand in a single file line in non-decreasing order by height. Let this ordering be represented by the integer array expected where expected[i] is the expected height of the ith student in line.
You are given an integer array ... | ALGO | 0.999967 | 6.03444 |
74f5139e-34ab-4820-83a0-0f1b9b631add | amithachari/LeetCode-Hackerrank | CPP/reverse-words-in-a-string-iii.cpp | class Solution {
public:
void reverseString(string &s, int low, int high) {
int n = s.size();
for (int i = 0; i < n; i++){
if (low < high){
char tmpc = s[low];
s[low++] = s[high];
s[high--] = tmpc;
}
}
}
... | ALGO | 0.999994 | 6.094491 |
3725355a-1ae4-40ec-aebb-da5057f89862 | ishikasinha-d/6Companies30days | Goldman Sachs[Day 1-5]/PrintAnagramsTogether_Q1.cpp | class Solution{
public:
vector<vector<string> > Anagrams(vector<string>& string_list) {
// LOGIC:
// After sorting each anagram, the order of letters will be same
// Unordered map can be used to store all anagrams hashed to the sorted string
// TC: O(N*SlogS) where N is ... | ALGO | 0.999938 | 6.236135 |
e44d9217-3f80-4f36-939d-0f5aaacd0402 | syedfaisalilyas/OS-Algorithms | ShortestJobFirst.cpp | #include <iostream>
using namespace std;
int main() {
int processID[100];
int burstTime[100];
int waitingTime[100];
int turnaroundTime[100];
int i, j, n, total = 0, index, temp;
float avg_wt, avg_tat;
cout << "Enter number of process: ";
cin >> n;
cout << "Enter Burst Time:" << ... | ALGO | 0.99986 | 3.386914 |
ed65d167-8619-47de-b6ee-ac229bbc83be | devangi2000/Data-Structures-Algorithms-Handbook | Design/DesignHashMap706.cpp | // Design a HashMap without using any built-in hash table libraries.
// Implement the MyHashMap class:
// MyHashMap() initializes the object with an empty map.
// void put(int key, int value) inserts a (key, value) pair into the HashMap. If the key already exists in the
// map, update the corresponding value.
// int g... | ALGO | 0.999466 | 6.446132 |
a1bc8232-293b-423b-a07f-544fe0af55fe | GURMEHAR-PEC/codeforces-edu | Segment Tree-1/Step4/D_Number_of_Different_on_Segment.cpp | // Gurmehar Singh
#include<bits/stdc++.h>
#include<algorithm>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
#define yes cout<<"Yes"<<"\n"
#define no cout<<"No"<<"\n"
#define nl cout<<"\n"
#define all(a) a.begin(),a.end()
#define ivec(vec) for(int i=0;i<vec.size();i++){cin>>vec[i];}... | ALGO | 0.999426 | 4.140887 |
e5311762-fdc1-4961-af60-f0ddc94a9434 | Bliss-CAF/frameworks_av | media/libstagefright/codecs/m4v_h263/dec/src/deringing_chroma.cpp | #include "mp4dec_lib.h"
#include "post_proc.h"
#ifdef PV_POSTPROC_ON
void Deringing_Chroma(
uint8 *Rec_C,
int width,
int height,
int16 *QP_store,
int,
uint8 *pp_mod
)
{
/*----------------------------------------------------------------------------
; Define all local variables
... | ALGO | 0.998739 | 3.841888 |
4c97cb46-1942-4473-bcf6-bbc8612c016d | hakomori64/atcoder | abc/011b.cpp | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
s.at(i) = tolower(s.at(i));
}
s.at(0) = toupper(s.at(0));
cout << s << endl;
}
| ALGO | 0.993054 | 5.400693 |
275c2d00-a22d-4771-8254-3290511f5b89 | RealWarHero/Cpp-Programs | P1.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cout<<"Enter the value of number of terms : "<<endl;
cin>>n;
double s = 1.0;
for (int i = 2; i <= n; i++)
{
if(i%2!=0){
s += (1/pow(i,i));
}
else{
s -= (1/pow(i,i));
... | ALGO | 0.999663 | 3.80967 |
bed508d8-25f4-4dce-b432-fa72c97895aa | Lelong146/Giai_thuat | Phan_tich_thietke_giai_thuat/CODE tổng hợp/DFS_TimKiemDuongDi/DFS_TimKiemDuongDi/Source.cpp | #include<iostream>
using namespace std;
const int sodinh = 7;
int value[sodinh][sodinh] = { {0,0,0,1,0,1,1},
{0,0,1,1,0,0,0},
{0,1,0,1,0,1,0},
{1,0,1,0,0,0,0},
{0,0,0,0,1,1,0},
{1,0,0,0,1,0,0},
{1,0,0,1,0,0,0}
};
bool daxet[sodinh];
int dinhketthuc = 4;
int back[s... | ALGO | 0.999988 | 3.556606 |
f6794ed2-03a4-4341-af40-a33afa79bb92 | vishal8113/Hacktoberfest-2022 | codechef_solutions/taxes.cpp | #include <iostream>
using namespace std;
int main() {
int i,t,x;
cin>>t;
for(i=0;i<t;i++)
{
cin>>x;
if(x>100)
{
cout<<x-10<<endl;
}
else
cout<<x<<endl;
}
return 0;
}
| ALGO | 0.999867 | 3.489091 |
be9fd363-4598-47de-aae5-e2a032726485 | tejashwini-h/DSA_journey | 03_variables.cpp | //variables = used for storing data values
//eg : 2*(a+b) where a and b are variables which values vary and 2 is constant
//eg : int a = 5 , here a is variable and 5 is value , and values is different then constants
#include<iostream>
using namespace std;
int main()
{
int a=5, b=10;
cout<<a<<endl;
cout<<b<... | TOOL | 0.899142 | 3.030892 |
f419d8bc-c35e-47ee-b19b-d56c05446bcf | phpvc/HEALTH-HELD-TOKEN | src/bitcoin-tx.cpp | #include "base58.h"
#include "clientversion.h"
#include "primitives/block.h" // for MAX_BLOCK_SIZE
#include "primitives/transaction.h"
#include "core_io.h"
#include "coins.h"
#include "keystore.h"
#include "script/script.h"
#include "script/sign.h"
#include "ui_interface.h" // for _(...)
#include "univalue/univalue.h"
... | TOOL | 0.900696 | 4.888306 |
eea3fa44-6994-4924-83f0-104626fbbd1b | JagsZ/Leetcode | 1539-kth-missing-positive-number/1539-kth-missing-positive-number.cpp | class Solution {
public:
int findKthPositive(vector<int>& arr, int k) {
int l = 0, r = arr.size()-1;
while(l <= r){
int mid = (l+r)/2;
if(arr[mid] - mid - 1 < k){
l = mid+1;
}else{
r = mid-1;
}
... | ALGO | 0.999987 | 5.436463 |
f19dce3b-15ea-4ec4-9fa4-e4c0bb3480b4 | Rahat-Khan-Pathan/Samsung-Bangladesh-Pre-Employment-Coding-Test-Preparation | Extra Practice for DSA/max_len_of_bst_in_binaryTree.cpp | // This is not for pre-employment test
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
Node *left;
Node *right;
Node(int val)
{
data = val;
left = right = NULL;
}
};
struct Box
{
int min, max, ans, finalAns;
bool bst;
Box(int mn, int mx, int a,... | ALGO | 0.99999 | 6.215644 |
fb80df08-1c1d-42f2-b6dc-39fb63f5a216 | moraxu/UVa-Solutions-CPP | 459 Graph Connectivity.cpp | #include <cstdio>
#include <vector>
#include <cstdlib>
#include <queue>
#include <iostream>
#include <string>
using namespace std;
/// --------------------------------------------------
typedef vector<int> VI;
typedef long long LL;
#define FOR(x,b,e) for(int x = b ; x <= (e) ; ++x)
#define FORD(x,b,e) for(int x = b ;... | ALGO | 0.99931 | 3.973067 |
e91415bf-b328-4671-a2ff-e43070b78ce8 | vinod-2309/Competitive-Programming | Google kickstart/p1.cpp | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define f(i, a, b) for (int i = a; i < b; i++)
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef vector<long long> vl;
typedef vector<vector<long long>> vvl;
typedef vector<vector<bool>> vvb;
typedef map<int, ... | ALGO | 0.998776 | 3.37961 |
6a6a3955-36fd-4a2c-9c34-85dc54e69fe9 | ninellekam/Algorithms_Part1 | symetric_coords.cpp | #include <iostream>
#include <vector>
#include <algorithm>
inline bool operator < (const std::pair<double , double> &a, const std::pair<double , double> & b) {
return a.first < b.first;
}
inline bool operator > (const std::pair<double , double> &a, const std::pair<double , double> & b) {
return a.first > b.first;... | ALGO | 0.998965 | 4.595603 |
1431c5e1-1c64-4927-af76-da1ab25d6ec0 | gibran404/tic-tac-toe | tic tac camel toe/Source4.cpp | /*
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <limits>
using namespace std;
class TicTac
{
enum class Player
{
blank = ' ',
P1 = 'O',
P2 = 'X'
};
struct Move
{
int x = 0;
int y = 0;
};
const int size = 3;
int P1score;
... | ALGO | 0.994933 | 4.861562 |
b576f7ad-e52e-4491-bc87-e633277c6973 | Ayushi-Kosta/Leetcode-Questions | 695-max-area-of-island/695-max-area-of-island.cpp | class Solution {
public:
int maxAreaOfIsland(vector<vector<int>>& grid) {
int r = grid.size(), c = grid[0].size(), area=0;
for(int i=0; i<r; i++){
for(int j=0; j<c; j++){
if(grid[i][j]){
int a = 0;
tr(i, j, a, grid);
... | ALGO | 0.999926 | 6.293636 |
b3706e02-a4e6-471b-bb31-aa7d438cb97b | Thalisson-Alves/Competitive-Programming | submissions/CodeForces/1860/a.cpp | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "debug.cpp"
#else
#define dbg(...) 4269
#endif
#define all(x) x.begin(), x.end()
#define len(x) (int)x.size()
using ll = long long;
using ull = unsigned long long;
const vector<pair<int, int>> dir4{{1,0},{-1,0},{0,1},{0,-1}};
const vector<pair<in... | ALGO | 0.999689 | 4.426855 |
03c51b08-c1ec-4b77-b045-73be4daa1a44 | ishandutta2007/codeforces | romawhite/normal/1237/D.cpp | #include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b) - 1; i >= (a); i--)
#define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a,value) memset(a, value, sizeof(a))
#define SZ(a) (int)a.size()
#de... | ALGO | 0.999972 | 3.58765 |
25973175-d65f-43ff-b593-d9fd99e42e30 | deb8192/DeadlyDanceDeb | OpenGL_Tutoriales/GettingStarted/11-Camara_Fija/librerias/reactphysics3d/src/collision/shapes/AABB.cpp | // Libraries
#include "AABB.h"
#include "configuration.h"
#include <cassert>
using namespace reactphysics3d;
using namespace std;
// Constructor
AABB::AABB(const Vector3& minCoordinates, const Vector3& maxCoordinates)
:mMinCoordinates(minCoordinates), mMaxCoordinates(maxCoordinates) {
}
// Copy-constructor
AAB... | ALGO | 0.979638 | 7.628713 |
461cea4a-530e-4494-a9d7-60fa873ce9b8 | jnvshubham7/All_Programming | All_Folder/All_Contest/1706A.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define fr(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define mem(a,b) memset(a,b,sizeof(a))
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#defi... | ALGO | 0.999824 | 3.655416 |
e8499a81-fd6b-44d1-884a-275dbccc40d6 | praabindhp/CPP-Practices | Basics/arrays.cpp | #include <iostream>
using namespace std;
int main(){
int arr[5] = {1, 2, 3, 4, 5};
for(int i = 0; i < 5; i++){
cout << arr[i] << endl;
}
return 0;
} | ALGO | 0.968788 | 3.428182 |
032f497c-c0e3-4d3d-ba98-bb4d41d87b07 | Skrobson/PolishNumberPlateRecognitionSystem | 3rdParty/opencv/sources/modules/ml/src/em.cpp | #include "precomp.hpp"
namespace cv
{
namespace ml
{
const double minEigenValue = DBL_EPSILON;
class CV_EXPORTS EMImpl : public EM
{
public:
int nclusters;
int covMatType;
TermCriteria termCrit;
CV_IMPL_PROPERTY_S(TermCriteria, TermCriteria, termCrit)
void setClustersNumber(int val)
{
... | ALGO | 0.997815 | 6.642667 |
6ee423eb-e0af-4f15-8fbd-4927625cc0e0 | jameswoods0815/pictureCodec | quantization.cpp | #include "quantization.hpp"
float num2step(float num)
{
return num;
}
void quant (std::vector<ljj::Vec3d> src, std::vector<std::vector<int>> & out, float QPY,float QPCb,float QPCr )
{
float qpy=num2step(QPY);
float qpcb=num2step(QPCb);
float qpcr=num2step(QPCr);
std:: vector<int> temp(3);
... | ALGO | 0.98817 | 3.92983 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.