uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
f2611be6-d171-4b7a-9f53-ab1e31212c52 | rbtsv/Ozon-Masters-Algorithms | 01-Hello-World/A+B/interactor.cpp | #include "testlib.h"
#include <iostream>
using namespace std;
int main(int argc, char* argv[])
{
setName("Interactor A+B");
registerInteraction(argc, argv);
// reads number of queries from test input file
int n = inf.readInt();
cout << n << endl;
for (int i = 0; i < n; i++)
{
... | ALGO | 0.876868 | 4.293788 |
f565c1cf-67aa-49dc-aa4d-c6117e7821cb | raincross7/code-similarity | codes/train_code/problem262/problem262_268.cpp | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | ALGO | 0.999997 | 3.158432 |
20ff8200-eb49-4e7d-a889-f681a3e9ec8b | Lincito-31/Preseleccion | Juki Judge/problems/Cuadrado Perfecto.cpp | #include <bits/stdc++.h>
using namespace std;
int n;
int main(){
scanf("%d",&n);
n=sqrt(n);
printf("%d",n);
} | ALGO | 0.999747 | 3.819416 |
634dee0b-e3d5-4f79-bc2b-da8c2167901c | sarvex/leetcode-ocaml | solution/1300-1399/1353.Maximum Number of Events That Can Be Attended/Solution.cpp | class Solution {
public:
int maxEvents(vector<vector<int>>& events) {
unordered_map<int, vector<int>> d;
int i = INT_MAX, j = 0;
for (auto& v : events) {
int s = v[0], e = v[1];
d[s].push_back(e);
i = min(i, s);
j = max(j, e);
}
... | ALGO | 0.999901 | 6.041809 |
4477ed2e-e35e-4a89-8621-6fe85d3ce541 | danieeeld2/DGIIM | Primero/1 Cuatrimestre/FP/Soluciones profesor/CUATRIMESTRE1_FP_SESIONES_PRACTICAS_SOLUCIONES_PROFESOR(CASA)_SOLUCIONES_PROFESOR(CASA)/SESION8/8_Permutacion_10.cpp | /* Crear un struct Permutacion para representar una permutacion, como funcion biyectiva
de {1, ..., n} en {1, ..., n}. Para almacenar la permutacion usaremos como dato miembro
un vector de enteros (la imagen de 1,2,...,n). Ademas, tendra otro dato miembro de tipo
entero para almacenar su longitud. Escribir un programa... | ALGO | 0.998236 | 4.456438 |
fecaa3ea-121c-4c2f-a75e-c857b2b42d25 | RoseAlice2018/Algorithm2024 | 202507/0726.cpp | #include<vector>
#include<stack>
#include<queue>
#include<string>
#include<unordered_map>
#include<unordered_set>
using namespace std;
struct ListNode{
int val;
ListNode *next;
ListNode() : val(0), next(nullptr) {}
ListNode(int x):val(x), next(nullptr) {}
ListNode(int x, ListNode *next):val(x), next... | ALGO | 0.999903 | 5.384579 |
e2e879e7-4a20-4534-aee0-19bfa56ec8e5 | metux/thunderbird-2 | intl/icu/source/tools/toolutil/pkg_gencmn.cpp | #include "unicode/utypes.h"
#include <stdio.h>
#include <stdlib.h>
#include "unicode/utypes.h"
#include "unicode/putil.h"
#include "cmemory.h"
#include "cstring.h"
#include "filestrm.h"
#include "toolutil.h"
#include "unicode/uclean.h"
#include "unewdata.h"
#include "putilimp.h"
#include "pkg_gencmn.h"
#define STRING... | TOOL | 0.858237 | 6.651838 |
773e143a-2ef6-4898-b28c-1dde5a5f800b | Algorithm-study-seoul22/Algorithm-Study | 정영훈/Week05/머리 맞대기.cpp | // 점수를 기준으로 팀을 짠다는 생각을 하긴 했는데
// 팀을 어떻게 잘라야 할지에 대한 기준이 서지 않았음.
// 처음에는 재귀로 T개의 팀으로 자르기 위한 모든 기준을 다 잘라서 하려고 했으나 말도 안 되는것 같아서 기각
// 아래는 교수님의 아이디어.
/*
8 3
150 130 90 110 140 200 120 90
예를 들어 점수 기준이 400점 인 경우
1. 150을 시작점으로
150 130 90 // 여기에 다음 값인 110을 더하면 400이 넘어가니까 최대값이 400을 넘음
110 140 //
200 120 90
// 3팀
2. 130을 시작점으로
... | ALGO | 0.99996 | 5.726311 |
2607ec08-e48a-465b-beb4-e97d4e65a1cb | liuyishengalan/lstm-based-prefetcher | pin-3.28-98749-g6643ecee5-gcc-linux/source/tools/SimpleExamples/topopcode.cpp | /*! @file
* This file contains a real time opcode mix profiler
*/
#include <map>
#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm> // for sort
#include <vector>
#include "pin.H"
using std::cerr;
using std::endl;
using std::flush;
using std::pair;
using std::setw;
using std::string;
us... | TOOL | 0.951815 | 6.644573 |
9ccb8da9-f208-498c-b891-0468330cd6cb | kosekitau/atcorder | aaa/225-d.cpp | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <vector>
#include <queue>
#include <functional>
#include <set>
#include <tuple>
#include <map>
using namespace std;
using ll = long long;
using Graph = vector<vector<int> >;
using P = pair<int, int>;
#define INF 20... | ALGO | 0.999745 | 3.829241 |
e58d279a-f7f8-4869-b1e4-9632252753cf | SinhaAmrit/Mission_DSA | C++/Recursion/_00_Print_Count.cpp | /*
Problem Statement:
Print counting from 1 to "num".
*/
#include <bits/stdc++.h>
using namespace std;
void printCount(int num)
{
if (num == 0) return;
printCount(num - 1);
cout << num << " ";
}
int main()
{
int num;
cout << "Enter a number: ";
cin >> num;
printCount(num);
cout << endl;
... | ALGO | 0.999568 | 4.490919 |
97f5c0b7-bc37-427f-aa12-494c1774f185 | dungkaito/Data-Structures-and-Algorithms---PTIT | contest7/bai21.cpp | /*open with vscode
tìm mảng G - next greater của từng element in A
tìm mảng S - next smaller của từng element in A
ans = S[G[i]] với i = 0 -> n-1
*note mảng G lưu index chứ không phải value
*/
#include <bits/stdc++.h>
using namespace std;
int n;
vector <int> A, G, S;
void nextGreater() {
G.clear(); G.resize(n);
... | ALGO | 0.999926 | 5.015207 |
01535180-1b59-4c30-96ce-281a00db0b32 | tonmoy197/Road_to_1400_on_Codeforces | C_XOR_and_Triangle.cpp | #include <iostream>
#include <vector>
#include <map>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int tt; cin >> tt;
while(tt --){
long long x;
cin >> x;
// Check if x is a power of 2 or of the form 2^k - 1
if ((x & (x - 1)) == 0 || ((x + 1) ... | ALGO | 0.999766 | 5.052423 |
9a0351f2-2dd4-42bf-bbf1-43ba976a8a64 | AlterFritz88/interactive_learn_cpp | task_3_8_9.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
char c;
cin >> c;
set<char> se = {'A', 'E', 'I', 'O', 'U'};
if (se.count(c)) cout << c << " - "<< "GLASNAYA";
else cout << c << " - "<< "SOGLASNAYA";
return 0;
} | ALGO | 0.974775 | 3.93352 |
4c88ed6b-c990-40b5-8a31-6b7e7283b774 | 9woods123/easy_mav | drivers/opencv-3.4/modules/core/src/matmul.dispatch.cpp | #include "precomp.hpp"
#include <opencv2/core/utils/logger.hpp>
#include "opencl_kernels_core.hpp"
#include "opencv2/core/opencl/runtime/opencl_clamdblas.hpp"
#include "opencv2/core/opencl/runtime/opencl_core.hpp"
#include "intel_gpu_gemm.inl.hpp"
#include "matmul.simd.hpp"
#include "matmul.simd_declarations.hpp" // ... | ALGO | 0.911727 | 7.171951 |
77afa3c1-7935-4b22-a919-b0c2659c3d3e | andreacarhuavilca/amc10453_hw3_q1 | amc10453_hw3_q1.cpp | // amc10453_hw3_q1.cpp : This file contains the 'main' function. Program execution begins and ends there.
//variable for first item and second item
//bool for club card
//tax rate percentage
//
#include <iostream>
using namespace std;
int main()
{
double firstItemPrice, secondItemPrice;
double basePrice, pri... | TOOL | 0.894862 | 5.810364 |
c6dca9eb-cf86-4635-a977-3ab233d0ea4a | creativeabhi13/c-plus-plus | arrminmax.cpp | // print the minimum and max element in the array
#include <iostream>
using namespace std;
void printmin(int arr1[5]);
void printmax(int arr[5]);
int main()
{
/* int n;
cout << "Enter the lenght of the array" << endl;
cin >> n;
int a[n];
// array eleement
cout << "Enter the elemen... | ALGO | 0.998639 | 3.714448 |
a383000a-15d4-463a-a2e5-e6cc5d7ec581 | Spaaarroww/komp-pract | 1/pract-1-2.cpp | #include <iostream>
#include <cmath>
// Класс для представления точки
class Point {
public:
double x, y;
Point(double x, double y) : x(x), y(y) {}
};
// Класс для представления параболы в виде y = ax^2 + bx + c
class Parabola {
public:
double a, b, c;
Parabola(double a, double b, double c) : a(a), b(b... | ALGO | 0.999548 | 6.32541 |
9290d56f-6a40-4538-bc6d-446e4b7869a5 | yash-gargji/codeforces-solution | C_Two_Movies.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector<int>a(n),b(n);
int p = 0 , neg = 0;
int sum1 = 0, sum2 = 0;
for(int i = 0;i<n;i++){
cin>>a[i];
}
for(i... | ALGO | 0.999985 | 4.01207 |
83d8a812-2436-4ec3-ab38-df211924c909 | Rohit-048/Cpp | funccubeoverload.cpp | #include <iostream>
using namespace std;
int cube(int x) {
return x*x*x;
}
float cube(float y){
return y*y*y;
}
int main() {
int a;
float b;
cout<< "enter a integer number\n";
cin>>a;
cout<< "enter a float number\n";
cin>>b;
cout<< "Cube of integer number " << a << " is " << cube(a) <<endl;
cout<< "Cube of ... | TOOL | 0.927273 | 4.002915 |
28466098-17e2-46ce-a205-669d82ae9dbd | wyb2021210985/Student-Schedule-Management | source_code/Temporary.cpp | #include"Temporary.h"
Temporary::Temporary(QDateTime start,int e,QString Location){
this->EventType=e;
this->startTime=start;
this->next=NULL;
this->prior=NULL;
this->sign=0;
this->location=Location;
}
Temporary::Temporary(){
this->sign=1;
this->next=NULL;
this->prior=NULL;
}
Tempora... | TOOL | 0.981278 | 4.386742 |
30d9d496-dbe4-41c6-b187-1f6f6d8a3e2a | heavenMOJANG/ICPC | .history/AtCoder/abc365/G_20240804160418.cpp | #pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define int long long
#define pii pair<int, int>
using namespace std;
constexpr int INF = 0x7fffffff;
void solve() {
int n, m; cin >> n >> m;
vector<pii> rec(m);
for (auto && [t, p] : rec) cin >>... | ALGO | 0.999949 | 4.892027 |
e1c4b307-7389-4726-a356-75ffcf48f9ec | MrKaszeba19/Duperele | Cpp/krzys/Naprzemian.cpp | #include <iostream>
using namespace std;
int main () {
int n;
cin >> n;
int T[n];
for (int i = 0; i < n; i++) {
cin >> T[i];
}
for (int i = 0; i < n; i += 2) {
cout << T[i] << " ";
}
for (int i = 1; i < n; i += 2) {
cout << T[i] << " ";
}
return 0;
} | ALGO | 0.999478 | 3.360642 |
a6a0e5dd-6df8-4dab-9162-6a3ad0a66c1f | teaspring/problems | topics/dynamicprogramming/src/fairworkload.cpp | /*
* regressive problem of Painter's partition problem on leetcode.
* Actually, it appears on topcoder as "fair work load". given a list of consecutivework tasks in time, divide them into k section to ensure the greatest partition small as much as possible(average as much as possible)
* test data:
* {1,2,3,4,... | ALGO | 0.999904 | 4.423512 |
9fa45a37-0869-4e4a-9a3e-41efe80d7f68 | linneszyx/CP-Problems | Difficulty: Easy/Missing in Array/missing-in-array.cpp | //{ Driver Code Starts
// Initial template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function template for C++
class Solution {
public:
// Note that the size of the array is n-1
int missingNumber(int n, vector<int>& arr) {
// Your code goes
int s ... | ALGO | 0.999646 | 5.597562 |
3ea1e8b1-7825-4f14-9c62-8640c8aacf12 | gauravk268/Competitive_Coding | cses/Apartments.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ull unsigned long long
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end... | ALGO | 0.999906 | 3.805759 |
29dfac7b-6f46-4a87-8519-2e62490dd6b4 | jingyugao/oh-my-db | utils/sort.cpp | #include"sort.h"
/* 原地归并
* 可二路归并亦可与插入排序相结合，如代码
*/
//reverse array
void reverse(int arr[], int size)
{
int left = 0;
int right = size -1;
while(left < right)
{
int temp = arr[left];
arr[left++] = arr[right];
arr[right--] = temp;
}
}
// swap [arr,arr+headSize) and [arr+head... | ALGO | 0.999973 | 4.404422 |
592cc81d-7adf-4083-85d5-df07b6c912df | RedaElmahdy/problem-Solving | C++_Problems/level_two/113 - Even_numbers_in_an_array.cpp | #include <vector>
using namespace std;
vector<int> evenNumbers(vector<int> arr, int n) {
vector<int> array;
for (int i = 0; i < arr.size(); i++)
{
if (arr[i] % 2 == 0)
array.push_back(arr[i]);
}
vector<int> result(array.end() - n, array.end());
return result;
}
| ALGO | 0.997415 | 5.574466 |
cba8ae22-00a3-4f2c-9f79-342978b17387 | ishandutta2007/codeforces | yyljkydr/normal/1467/E.cpp | #include<bits/stdc++.h>
using namespace std;
const int N=2e5+1e3+7;
int n,a[N],b[N];
vector<int>g[N],v[N];
int st[N],ed[N],dc,fa[N];
void dfs(int x,int f)
{
st[x]=ed[x]=++dc;
fa[x]=f;
for(int i=0;i<g[x].size();i++)
{
int v=g[x][i];
if(v==f)
continue;
dfs(v,x);
... | ALGO | 0.999754 | 3.812859 |
a438e82c-0064-40c6-8fa8-822210e3bf81 | dodamce/leetcode | 2023年/3月/29号/69.x-的平方根.cpp | /*
* @lc app=leetcode.cn id=69 lang=cpp
*
* [69] x 的平方根
*/
#include <algorithm>
#include <iostream>
using namespace std;
// @lc code=start
class Solution
{
public:
int mySqrt(int x)
{
int l = 0, r = x, ans = -1;
while (l <= r)
{
int mid = l + (r - l) / 2;
i... | ALGO | 0.99993 | 5.447602 |
1dc2aa20-de26-4211-bf1b-f209940ea97f | Vykstorm/ginac | ginac/relational.cpp | /** @file relational.cpp
*
* Implementation of relations between expressions */
#include "relational.h"
#include "operators.h"
#include "numeric.h"
#include "archive.h"
#include "utils.h"
#include "hash_seed.h"
#include <iostream>
#include <stdexcept>
namespace GiNaC {
GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(relati... | TOOL | 0.896967 | 7.570116 |
9b6d1eba-a7b5-428b-b0cc-b41fe22646c9 | flybird119/mediastream-plus | codecs/libjpeg/jquant2.cpp | #define JPEG_INTERNALS
#include "jinclude.h"
#include "jpeglib.h"
#ifdef QUANT_2PASS_SUPPORTED
/*
* This module implements the well-known Heckbert paradigm for color
* quantization. Most of the ideas used here can be traced back to
* Heckbert's seminal paper
* Heckbert, Paul. "Color Image Quantization for Fra... | ALGO | 0.999524 | 6.848563 |
1806e86a-eec2-4d7a-a153-2e536aef524c | ishandutta2007/codeforces | wlzhouzhuan/normal/1526/F.cpp | // Author: wlzhouzhuan
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fir first
#define sec second
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, l, r) for (int i = l; i >= r; i--)
#define mset(s... | ALGO | 0.999937 | 3.476966 |
49f73316-bafb-4cd8-b063-d7682fb7e92a | gopoma/competitive-programming | tasks/abc195_d.cpp | //* sometimes pragmas don't work, if so, just comment it!
//? #pragma GCC optimize ("Ofast")
//? #pragma GCC target ("avx,avx2")
//! #pragma GCC optimize ("trapv")
//! #undef _GLIBCXX_DEBUG //? for Stress Testing
#include <bits/stdc++.h> //? if you don't want IntelliSense
using namespace std;
// building blocks
usi... | ALGO | 0.999887 | 5.053988 |
ca78446d-c85b-492f-9c90-98155acda382 | kmm2459378/ConsoleApp | CP2/chap02/list0215.cpp | // ǂݍl10Ŋ邩
#include <iostream>
using namespace std;
int main()
{
int n;
cout << "lF";
cin >> n;
if (int m = n % 100) {
cout << "̒l100Ŋ܂B\n";
cout << "2Ԗڂ̌" << m /10 << "łB\n";
cout << "ʼnʌ" << m % 10<< "łB\n";
} else {
cout << "̒l100Ŋ܂B\n";
}
}
| ALGO | 0.990597 | 3.871541 |
909ee05b-145c-4056-aea3-6d5d8b593645 | Ga-PaYin/MySuckWorks | myStack.cpp | #include<iostream>
using namespace std;
template <typename type>
class stack{
private:
int size;
type *Data;
int Top;
public:
stack(int n);
~stack();
bool isEmpty();
bool isFull();
void Push(type a);
type Pop();
void Clear();
void show();
};
template<typename type>
stack<type>::stack(int n):si... | ALGO | 0.993995 | 4.031189 |
afe010e9-e1b9-470d-abbf-797de9ba0e4c | Sristy-72/Leetcode | 1016-subarray-sums-divisible-by-k/1016-subarray-sums-divisible-by-k.cpp | class Solution {
public:
int subarraysDivByK(vector<int>& nums, int k) {
unordered_map<int, int> cnt{{0, 1}};
int ans = 0, s = 0;
for (int& x : nums) {
s = ((s + x) % k + k) % k;
ans += cnt[s]++;
}
return ans;
}
}; | ALGO | 0.999877 | 5.801975 |
5ac1e8b4-4a6f-47c5-86d0-e8785f824ede | pavanbirnale/dsashhet | Zhelper/SubSeq.cpp | // Generate all Subsequences of string
// TC : O(2^n);
// SC : O(n*2^n);
// There are 2^n subseq of n size string
/* There are Two Approches to find the Subseq of string
1). BackTracking (Recursive)
2). Power Set (Iterative) : Powerset of set/arr A is set of all subset of A
*/
#include<bits/stdc++.h>
using n... | ALGO | 0.999698 | 6.53919 |
5b6049dd-51c5-4f80-9419-86bc844732a2 | REEF3D/REEF3D | ThirdParty/eigen-3.3.8/doc/examples/TemplateKeyword_flexible.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
template <typename Derived1, typename Derived2>
void copyUpperTriangularPart(MatrixBase<Derived1>& dst, const MatrixBase<Derived2>& src)
{
/* Note the 'template' keywords in the following line! */
dst.template triangularView<Upper>() = src.template... | TOOL | 0.994712 | 5.804369 |
a6daea43-43e9-4892-8083-c086299d2402 | Ethan4582/Codeforces-solution | CODEFORCES/A_set/A_New_Year_Candles.cpp | #include <iostream>
using namespace std;
int main()
{
int a, b, d, m;
cin >> a >> b;
int h = a;
while(a >= b)
{
d = a / b;
h += d;
m = a % b;
a = d + m;
}
cout << h << endl;
return 0;
}
| ALGO | 0.99986 | 3.611507 |
64dfe613-e512-43e3-ade3-013ff8aa29b3 | Rajnandanikumari/Recursion | R3.cpp | //WAP to print sum of number (using recusion) //
#include<iostream>
#include<stdio.h>
using namespace std;
int t_sum=0;
int sumN(int n){
//base case (termination case)
if(n==0){
return t_sum;
}
t_sum += n;
return sumN(n-1);
}
int main(){
cout<<sumN(10);
return 0;
} | ALGO | 0.999803 | 4.663488 |
eda589f6-d02c-4b9a-930b-08d8f10b4a64 | duows/Exercicios-Programacao | FINAL INTERIF 2023/A/2023_A.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
long long mdc(long long a, long long b)
{
if (b == 0)
return a;
return mdc(b, a % b);
}
int main()
{
long long m, n;
cin >> m >> n;
m + n - mdc(m, n) == 0 ? cout << m + n : cout << m + n - mdc(m, n);
... | ALGO | 0.99995 | 4.018294 |
7653079f-8c5e-4ae3-abf5-13edc0af72d5 | ioleon13/LeetCode | Remove Spaces from a String.cpp |
#include <iostream>
using namespace std;
void removeSpace(char* str)
{
if(str == NULL)
return;
int len = strlen(str);
int pivpos = -1;
for(int i = 0; i < len; i++)
{
if(str[i] != ' ')
str[++pivpos] = str[i];
}
str[pivpos+1] = '\0';
}
| ALGO | 0.988816 | 3.800451 |
46dfbbb7-f220-40e0-b7b9-15bdb7415b15 | whjbinghun/Mitk | Modules/PhotoacousticsAlgorithms/source/filters/mitkBandpassFilter.cpp | #define _USE_MATH_DEFINES
#include <cmath>
#include "mitkBandpassFilter.h"
#include "../ITKFilter/ITKUltrasound/itkFFT1DComplexConjugateToRealImageFilter.h"
#include "../ITKFilter/ITKUltrasound/itkFFT1DRealToComplexConjugateImageFilter.h"
#include "itkComplexToModulusImageFilter.h"
#include "itkMultiplyImageFilter.h"... | TOOL | 0.917047 | 5.17206 |
ddafddc4-effc-4f14-8bc7-781ebc10ec19 | nishant2344/Algorithms-Box | KRUSKAL'SMST.cpp | #include <iostream>
#include <algorithm>
using namespace std;
struct Edge {
int u, v, weight;
// To sort edges by weight
bool operator<(const Edge& other) const {
return weight < other.weight;
}
};
// Class to represent a Union-Find (Disjoint Set) data structure
class UnionFind {
public:
... | ALGO | 0.999998 | 6.381566 |
629bb24e-7ac0-49f6-b460-cabde4e9471a | tahanebti/tnlib | algorithms/STL Algorithms/algorithms_test/foo_if_test.cpp | std::vector<int> numbers = {2, 3, 4, 5, 6, 7, 8, 9, 10};
// std::find_if
// More @
std::vector<int>::iterator it = std::find_if (numbers.begin(), numbers.end(), [](int n){ return n % 7 == 0;});
std::cout << "Found number " << *it << std::endl;
// std::find_if_not
// More @
it = std:... | ALGO | 0.992109 | 3.594283 |
91e735ce-6c32-45b9-a23b-f3b42d6f3e8a | abhishekkrsaw/September-LeetCoding-Challenge-2021 | Day 5 (Orderly Queue).cpp | /*
Question Link -> https://leetcode.com/problems/orderly-queue/
You are given a string s and an integer k. You can choose one of the first k letters of s and append it at the end of the string..
Return the lexicographically smallest string you could have after applying the mentioned step any number of moves.
Examp... | ALGO | 0.999987 | 6.434292 |
afdb7e06-607c-41fa-9d48-4f9ad221453b | vaditya04/CodeJam_APAC_Problems | codejam2014R2/a.cpp | /*input
3
3 100
10 20 70
4 100
30 40 60 70
5 100
10 20 30 40 60
*/
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#include <sstream>
#include <map>
#include <cmath>
#include <iomanip>
#include <ctime>
#include <climits>
#include <... | ALGO | 0.999536 | 4.063956 |
a1fb3a7d-8683-4753-962c-0167eb4a5777 | alex-narrator/x-ray-OGSR-based | ogsr_engine/xrGame/detail_path_manager_smooth.cpp | ////////////////////////////////////////////////////////////////////////////
// Module : detailed_path_manager_criteria.h
// Created : 04.12.2003
// Modified : 04.12.2003
// Author : Dmitriy Iassenev
// Description : Detail path manager criteria path builder
///////////////////////////////////////////////////////... | TOOL | 0.998027 | 4.01032 |
d48e5a2e-43d5-4ad3-a994-ca2aec22b9b4 | yashgupta18/Data-structures-and-algorithms | Suffix Array/suffixArray.cpp | #include <iostream>
#include<vector>
#include<unordered_map>
#include<queue>
#include<algorithm>
#include<cmath>
#include<utility>
#include<map>
using namespace std;
struct suffix {
int first;
int second;
int index;
}
int makeSuffixArray(string s){
int SA[s.length]; // Suffix Array
int P[][]; /... | ALGO | 0.99992 | 4.868418 |
894267d6-1b31-42d1-b3be-07e3bd440e2b | mykhailoko/alg_and_prog_2023 | contest_05/03/main.cpp | #include <iostream>
#include <string>
#include <complex.h>
#include <complex>
#include <sstream>
using namespace std;
class Complex {
public:
Complex(string input) {
double re, im;
stringstream ss(input);
ss >> re;
string im_str;
ss >> im_str;
if (im_str.length() =... | ALGO | 0.947069 | 4.126892 |
7bb63d88-b9c1-4d8d-b045-b097a70f990c | njlookforward/CPP-Primer-Practice | chapter13/ch13_main_exercise.cpp | #include <vector>
#include <iterator>
#include <algorithm>
#include "exercise.hpp"
#include "BinaryTree.hpp"
#include "HasPtr.hpp"
#include "strVec.hpp"
#include "TextQuery.hpp"
#include <cstring>
#include "String.hpp"
using namespace std;
// exercise_13_1
// copy constructor's formation is class(const class &);
// 拷贝... | TOOL | 0.951751 | 5.069229 |
820f2252-1716-4013-86b1-b4c739c33477 | RIKEN-RCCS/tmblas | src/mixedp_msub.cpp | #ifndef _MIXEDP_MSUB_CPP
#define _MIXEDP_MSUB_CPP
#include "tmblasarch.hpp"
namespace tmblas {
// Td == Ta == Tb
template<typename Td, typename Ta, typename Tb,
typename std::enable_if<(std::is_same<Td, Ta>::value &&
std::is_same<Td, Tb>::value),
std::nullptr_t>::type = nullptr >
void mixe... | ALGO | 0.953193 | 6.612845 |
da22f6ca-140e-41a4-9bd5-426143c27ae8 | RobuRishabh/Coding-Ninjas-Data-Structures-Algorithm-in-Cpp | Linked List 2/Merge_Sort.cpp | /*
Code: Merge Sort
Send Feedback
Given a singly linked list of integers, sort it using 'Merge Sort.'
Note :
No need to print the list, it has already been taken care. Only return the new head to the list.
Input format :
The first line contains an Integer 't' which denotes the number of test cases or queries to be run... | ALGO | 0.999627 | 5.696625 |
7180abe6-9d12-4aab-b9a3-c81ab02e20a2 | doocs/leetcode | solution/2700-2799/2763.Sum of Imbalance Numbers of All Subarrays/Solution.cpp | class Solution {
public:
int sumImbalanceNumbers(vector<int>& nums) {
int n = nums.size();
int ans = 0;
for (int i = 0; i < n; ++i) {
multiset<int> s;
int cnt = 0;
for (int j = i; j < n; ++j) {
auto it = s.lower_bound(nums[j]);
... | ALGO | 0.999991 | 5.631615 |
f07dd2dc-a9d2-40c3-82bb-165246bb197f | Nikhil-251/Code | 48-rotate-image/48-rotate-image.cpp | class Solution {
public:
void rotate(vector<vector<int>>& matrix) {
int n = matrix.size(),m = matrix[0].size();
for(int i=0;i<n;i++){
for(int j=i+1;j<m;j++){
swap(matrix[i][j],matrix[j][i]);
}
}
// for(int i=0;i<n;i++){
// for(int j... | ALGO | 0.999981 | 5.666555 |
82bc61c4-ba5f-4e19-9332-779b8a211c2c | Pranav-Jain/Neural-Monte-Carlo-Fluid-Simulation | bindings/zombie3d/deps/fcpw/deps/eigen-git-mirror/doc/examples/matrixfree_cg.cpp | #include <iostream>
#include <Eigen/Core>
#include <Eigen/Dense>
#include <Eigen/IterativeLinearSolvers>
#include <unsupported/Eigen/IterativeSolvers>
class MatrixReplacement;
using Eigen::SparseMatrix;
namespace Eigen {
namespace internal {
// MatrixReplacement looks-like a SparseMatrix, so let's inherits its trai... | ALGO | 0.998981 | 6.112806 |
6df989c7-062c-414a-b703-b0fb3bcd97a7 | gonzalogavilondo/FI-PROJECTS | 3-Programacion_Orientada_a_Objetos/PRACTICA/GUIA_6_STL/EJ4/main.cpp | #include <iostream>
#include <vector>
using namespace std;
/***
Modificar el programa del ejercicio 3 para que la salida ahora sea 100 9 2 8 6 3, si
los valores ingresados son los mismos.
PREGUNTAR ENUNCIADO
***/
template <class T> void printVec(vector<T> v)
{
typename vector<T>::iterator forIter;
... | ALGO | 0.985597 | 3.888496 |
7c4b459d-1790-4b7f-ab6b-09fecb01d657 | curiousmind101/DSA | 06.Stacks/01stack.cpp | #include<iostream>
using namespace std;
//stack Implementation using array
template<typename T>
class stack{
T *data;
int size=0;
int capacity;
int nextIndex;
public:
stack(){
capacity = 0;
size = 0;
nextIndex = 0;
}
void push(int n){
if(size == 0){
... | ALGO | 0.987232 | 4.450509 |
9b0ee66d-8539-4b9c-a6c8-41c6e887ad4f | aryangupta02092002/May-Challenge-2023 | GFG/StringMirror.cpp | //{ Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function Template for C++
class Solution{
public:
string stringMirror(string str){
// Code here
int n = str.size();
string temp;
temp += str[0];
... | ALGO | 0.999967 | 6.171074 |
5f8032f5-f912-4658-82bc-45e8ddc2104c | kmjp/procon | yuki/3101-3200/3179.cpp | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... | ALGO | 0.999832 | 3.373918 |
93155a9c-583b-4d6d-8914-42a6387167db | iamfaisalnafis/competitiveprogramming | uniqueString_lineartime.cpp | #include <bits/stdc++.h>
using namespace std;
const int MAX_CHAR = 256;
bool uniqueCharacters(string str)
{
if (str.length() > MAX_CHAR)
{
return false;
}
bool chars[MAX_CHAR] = {0};
for(int i = 0; i < str.length(); i++)
{
if(chars[str[i]] == true)
{
return ... | ALGO | 0.999739 | 5.282924 |
97cc01c2-b7cf-4fc0-878b-0e725f22a44a | Jagdish587/linkedlist | ncr_modp.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int fast_pow(long long base, long long n,long long M)
{
if(n==0)
return 1;
if(n==1)
return base;
long long halfn=fast_pow(base,n/2,M);
if(n%2==0)
return ( halfn * halfn ) % M;
else
return ( ( ( halfn * half... | ALGO | 0.999962 | 4.939515 |
4b48cae0-570c-4267-af88-fb13a5d5e5fb | jignesh2320/android_system_core_lineage | init/rlimit_parser.cpp | #include "rlimit_parser.h"
#include <android-base/parseint.h>
#include <android-base/strings.h>
using android::base::EqualsIgnoreCase;
using android::base::ParseInt;
using android::base::ParseUint;
using android::base::StartsWith;
namespace android {
namespace init {
// Builtins and service definitions both have th... | TOOL | 0.941499 | 7.122425 |
2ae9988e-2f82-4671-b852-e322cae6e18a | anuragpratap05/DSA | Binary tree/revision2/class4/426. Convert Binary Search Tree to Sorted Doubly Linked List.cpp | #include <bits/stdc++.h>
using namespace std;
class Node
{
public:
int val = 0;
Node *left = nullptr;
Node *right = nullptr;
Node(int val)
{
this->val = val;
}
};
Node *rightMostNode(Node *root, Node *curr)
{
while (root->right != nullptr and root->right != curr)
root = roo... | ALGO | 0.999968 | 5.364313 |
001ede6a-226b-4179-ad7a-f208a23c02c4 | stringintech/go-bitcoinkernel | depend/bitcoin/src/key_io.cpp | #include <key_io.h>
#include <base58.h>
#include <bech32.h>
#include <script/interpreter.h>
#include <script/solver.h>
#include <tinyformat.h>
#include <util/strencodings.h>
#include <algorithm>
#include <cassert>
#include <cstring>
/// Maximum witness length for Bech32 addresses.
static constexpr std::size_t BECH32... | TOOL | 0.950639 | 7.879959 |
732e7b15-2844-4824-b858-45e50573b25a | toufu-24/AtCoder | other/鉄則/A22.cpp | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define all(v) v.begin(), v.end()
#define sort(v) sort(v.begin(), v.end())
#define reverse(v) reverse(v.begin(), v.end())
#define ll int64_t
#define ld long double
#define chmax(a, b) a = max(a, b)
int main()
{
int N;
... | ALGO | 0.999879 | 4.618832 |
ca152fb5-61d5-4af7-9443-e9a6fc7b58cd | Alitaher712/Problem-Solving | CodeForces/60B/42365816_AC_30ms_16676kB.cpp | #include<bits/stdc++.h>
#include<unordered_set>
using namespace std;
#define ll long long
#define el '\n'
#define mbappe ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
const ll N = 1e6 + 5, INF = 1e10, mod = 1000000007;
int fact[N], inv[N];
int fp(int b, int p)
{
if (b == 1 || p == 0)
retur... | ALGO | 0.999919 | 4.014446 |
93ed764f-3c49-4556-949a-158e5e857c52 | yzzupgo/MFTCG | Data/abc136_b/agarwalavinash/ac/6691463.cpp | #define ll long long
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
if(n < 10)
cout<<(n)<<endl;
if(n >= 10 && n < 100)
cout<<9<<endl;
if(n >= 100 && n < 1000)
cout<<(9 + (n-100+1))<<endl;
if(n >= 1000 && n < 10000)
cout<<(999-100+10)<<endl;
if(n >= 10000 && n < 100000)
cout<<((999-100+10)+(n-10... | ALGO | 0.999548 | 3.725147 |
4701fa7f-fd3f-4002-8192-8e97b87d07ca | VishalY45/C-PP | Basic Program/Addition Program.cpp | #include<iostream>
using namespace std;
int main()
{
int a,b;
cout<<"Enter a no\n";
cin>>a>>b;
int c=a+b;
cout<<"Add is "<<c;
} | TOOL | 0.962817 | 3.907448 |
819b3d16-7ea8-4dae-af3f-e58c1c6cbd70 | adityanjr/code-DS-ALGO | CodeForces/Complete/300-399/359D-PairOfNumbers_Naive.cpp | #include <cstdio>
#include <vector>
int main(){
long n; scanf("%ld", &n);
std::vector<long> a(n); for(long p = 0; p < n; p++){scanf("%ld", &a[p]);}
long maxDiff(-1); std::vector<long> v;
for(long p = 0; p < n; p++){
long left(p), right(p);
while(left > 0 && a[p] <= a[left - 1] && a[le... | ALGO | 0.999905 | 3.274308 |
7b243dcd-9b71-46b6-af33-aaa1c01cb483 | fenghuo/coding | cpp/Changes.cpp | #include<iostream>
#include<vector>
using namespace std;
void change(int sum, vector<int>&changes, vector<int>&path){
if(sum==0){
for(auto i:path)
cout<<i<<" ";
cout<<endl;
} else if(sum>0){
for(auto i:changes){
if(path.size() && i<path.back())
continue;
path.push_back(i);
change(sum-i,changes... | ALGO | 0.999882 | 3.916678 |
09e0bda5-1df0-46ee-ad78-4503b323defa | sikuner/book-code | 剑指Offer/NumberOf1InBinary/NumberOf1InBinary.cpp | // NumberOf1InBinary.cpp : Defines the entry point for the console application.
//
// ָOfferԹپͱ⡷
// Ȩߣκ
#include "stdafx.h"
int NumberOf1_Solution1(int n)
{
int count = 0;
unsigned int flag = 1;
while (flag) {
if (n & flag)
count ++;
flag = flag << 1;
}
return count... | ALGO | 0.998034 | 6.110733 |
0834618c-f217-46ec-a0ef-4a24b93c0e36 | wery0/CP-library | Math & number theory/Sum over subsets.cpp | //do_superset == false: res[k] = sum({arr[i] | (k & i) == i}), i. e. sum of subsets
// == true: res[k] = sum({arr[i] | (k & i) == k}), i. e. sum of supersets
//Size of array could be arbitrary, not necessary power of 2
//O(nlog(n))
template<bool do_superset, bool do_inverse, typename T>
vector<T> sum_over_s... | ALGO | 0.998696 | 5.959315 |
317e86af-b570-4759-8a3d-b49eebe1c327 | Lucas-IudiCG/Codigos-C-Cpp | Queue.cpp | #include "Queue.h"
int CreateArray(int tamanho)
{
int Array[tamanho];
return Array;
}
Queue Create(int N)
{
Queue queue = { 0, 0, 0, N};
return queue;
}
bool Enqueue(Queue& queue, int value)
{
if (queue.count == queue.tamanho)
return false;
queue.values[queue.rear] = value;
queue.rear = (queue.rear + 1) % ... | ALGO | 0.990807 | 5.009929 |
04c07737-dd4c-4e61-8234-81604e7fe549 | VikashBurman/CODES | 0094-binary-tree-inorder-traversal/0094-binary-tree-inorder-traversal.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.999991 | 6.54415 |
74dc997b-16dd-4ee4-8bd0-11a54e590cdd | raincross7/code-similarity | codes/train_code/problem359/problem359_76.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <tuple>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <functional>
#define _LIBCPP_DEBUG 0
using namespace std;
using ll = long long;
int main(void)
{
int n;
cin >> n;
vector<int> a(n+1... | ALGO | 0.99994 | 3.133933 |
3f98ccdd-d88f-451e-8395-1e97bbacb1f9 | LINXufeng/Cpp-Basic | calculate/main.cpp | #include<math.h>
#include<iostream>
#include <typeinfo>
using namespace std;
#define DEBUG cout<<result<<endl
double string_to_number(char char_input) {
switch (char_input)
{
case '0':return 0;
case '1':return 1;
case '2':return 2;
case '3':return 3;
case '4':return 4;
case '5':return 5;
case '6':return 6;
ca... | ALGO | 0.997065 | 3.885148 |
48a74cfd-cc6c-477a-b0ed-aeb835141a35 | ishandutta2007/codeforces | subscriber/normal/269/A.cpp | #include<stdio.h>
#include<algorithm>
#include<iostream>
#include<set>
#include<map>
#include<vector>
#include<cmath>
#include<cstring>
#include<sstream>
#include<queue>
#define mp make_pair
#define pb push_back
#define pw(x) (1ull<<(x))
#define CC(x) cout << (x) << endl
#define S stringstream
#define m0(x) memset(x,0,... | ALGO | 0.999978 | 3.598216 |
e0c6ac48-59cb-4056-b1e7-6dd8c01e6409 | jnegrite/Competitive-Programming | Chapter 4/4.2/kattis/amoebas.cpp | #include<cstdio>
#include<iostream>
using namespace std;
char grid[100][101] {};
int rows, cols;
void floodfill(int oRow, int oCol){
if(oRow < 0 || oRow >= rows ||
oCol < 0 || oCol >= cols ||
grid[oRow][oCol] == '.'){
return;
}
grid[oRow][oCol] = '.';
for(int row=max(0,oRow-1... | ALGO | 0.999735 | 5.001807 |
18c11447-5961-4e6d-97b8-1cef06479fe6 | jcazevedo/advent-of-code | 2023/src/day05.cpp | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <sstream>
#include <vector>
using namespace std;
struct Range {
long long destination;
long long source;
long long length;
};
vector<long long> seeds;
map<string, string> transitions;
map<string, vector<Range>... | ALGO | 0.999502 | 5.251803 |
97504d1b-453d-4cdd-aaa6-341858dc81a2 | felipefoschiera/Competitive-Programming | Implementações/Subset Sum.cpp | #include <vector>
using namespace std;
typedef vector<int> vi;
vi moedas;
bool isSubsetSum(int sum){
vector<bool> possible(sum+1, false);
possible[0] = true;
for(auto c : moedas)
for(int i = sum-c; i >= 0; i--)
if(possible[i])
possible[i+c] = true;
return possible[s... | ALGO | 0.994477 | 3.151366 |
9bf618a6-34cb-46b9-9e50-5e4dde804a89 | Somahc/c_practice | abc342/a.cpp | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
map<char, int> mp;
for (int i = 0; i < s.size(); i++)
{
mp[s[i]]++;
}
for (int i = 0; i < s.size(); i++)
{
if (mp[s[i]] ==... | ALGO | 0.999894 | 3.51203 |
b719f503-e186-4e7d-b163-8ddf11b1e170 | SOFTowaha/UVA_OJ | 10212.cpp | #include <iostream>
using namespace std;
int main(void) {
unsigned long long n, m, tmp;
while (cin >> n >> m) {
if (m == 0) {
cout << 1 << endl;
continue;
}
tmp = 1;
for (unsigned long long i = n; i >= n - m + 1; i--) {
tmp *= i;
while (tmp % 10 == 0)
tmp /= 10;
... | ALGO | 0.999885 | 3.671709 |
0148e420-dfbd-4637-abd8-f3422cbcb92c | zimpha/acm-icpc | CodeChef/September Lunchtime 2013/CodeChef_CHGIFT1.cpp | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
int main() {
int T; scanf("%d", &T);
while (T --) {
int n, a;
long long best, worst;
scanf("%d", &n);
for (int i = 0; i < n; ++ i) {
scanf("%d", &a);
if (i) {
if (a > 0) {
best = max(best + a, max... | ALGO | 0.999975 | 3.898829 |
7934cc40-746c-453d-8bb4-1f2a736057c1 | czl0706/intro-to-operating-system | HW3 - Multithreading/HW3_110511233/hw3-4.cpp | #include <iostream>
#include <cstdint>
#include <cstring>
#include <cmath>
#include <vector>
#include <thread>
#include <mutex>
#define MAX_THREADS 8
using namespace std;
int n, m;
int num_threads = 1, start_idx;
thread t[MAX_THREADS];
vector<uint64_t> subsets;
uint64_t one = static_cast<uint64_t>(1), global_count = ... | ALGO | 0.999856 | 4.70464 |
ee7b2e95-3aad-472b-bebf-ed697574c827 | ShacharES/IOT-local-cloud | concrete/test/advanced_bursa_fixed.cpp | #include <vector>
#include <algorithm>
#include <iostream>
#include <cassert>
#include <vector>
int Bursa(std::vector<int> arr) {
int n = arr.size();
if (n <= 1) return 0;
int profit = 0;
int i = 0;
while (i < n - 1) {
// Find the next day to buy (local minimum)
while (i < n - 1 ... | ALGO | 0.99992 | 6.450897 |
644a3104-8fcb-4749-aebb-bf606a4700e6 | Hitanshu078/IAS-Architecture-Processor-Design | Permutations.cpp | #include <bits/stdc++.h>
using namespace std;
long long nPr(int n, int r) {
if (n < r) {
printf("Invalid input");
return 0;
}
long long result = 1;
for (int i = 0; i < r; ++i) {
result *= (n - i);
}
return result;
}
int main() {
int n, r;
cout << "Enter the ... | ALGO | 0.999858 | 5.579129 |
142cece8-53d6-49d8-88bb-af728256e3bc | msasif2000/Numerical-Method-lab-2 | assn-5.cpp | #include<bits/stdc++.h>
#define lli long long int
#define dl double
#define pi 2*acos(0.0)
#define Min 10000000
#define Max -10000000
using namespace std;
float proTerm(int i, float X, float x[])
{
float pro=1;
for(int j=0; j<i; j++)
{
pro = pro*(X-x[j]);
}
return pro;
}
int main()
{
in... | ALGO | 0.999876 | 3.229077 |
9afd2b7a-ea0e-422c-ab3f-3294d0a0f745 | claraaqwq/ALGORITMIA | TEMAS/Fuerza Bruta/Lab_2020-2_P2(MAQUINAS).cpp | #include <iostream>
#include <cmath>
#define MAXCOL 3
using namespace std;
void cargabin(int num, int n, int cromo[]){
int i, resto;
for(i=0;i<n;i++) cromo[i]=0;
i=0;
while(num>0){
resto = num%2;
num = num/2;
cromo[i] = resto;
i++;
}
}
int main(){
int n,p,fil,col,i,ganancia,costo,gananciaMax=0,j;
int t... | ALGO | 0.999017 | 3.268926 |
de7f6b0b-7b5d-48ea-93da-ab712d0fd16b | budmandah/cpp.lesson | 7 honog.cpp | #include <iostream>
#include <string>
using namespace std;
int main() {
int day;
string dayName;
cout << "Day number (0-6): "; cin >> day;
switch (day) {
case 0: dayName = "Sunday"; break;
case 1: dayName = "Monday"; break;
case 2: dayName = "Tuesday"; break;
case 3: dayName = "Wednesday"; break;
case 4:... | TOOL | 0.923723 | 3.64866 |
7fe8c0e8-9610-4a06-9878-e0aa7ef083d0 | LL-CH/LL | 日期的表示/日期的表示/test.cpp | #include<iostream>
using namespace std;
// ʵһƵ
class Date
{
public:
int GetMonthDay(int year, int month)
{
static int monthDays[13] = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
// 2귵29
if (month == 2 && ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0))
{
return 29;
}
return monthD... | ALGO | 0.976571 | 3.949052 |
ea090182-b84d-4df5-b2b4-0fdf4080bf7e | janewqiu/Murmur3Hash | ArisoHashLib/func.cpp |
extern "C"
{
typedef unsigned int uint32_t;
const uint32_t Prime = 0x01000193; // 16777619
const uint32_t Seed = 0x811C9DC5; // 2166136261
/// hash a C-style string
inline uint32_t fnv1a(const char* text,int size, uint32_t hash = Seed)
{
const unsigned char* ptr = (const unsigned char*)text;
for(int ... | ALGO | 0.939701 | 5.269203 |
c1d1df86-3084-4a4f-92fa-4314ac5bcd66 | nullist0/ProblemSolving | Baekjoon Problems/11720.cpp | #include <cstdio>
int main(void){
char n[101];
int i = 0, N, total = 0;
scanf("%d", &N);
scanf("%s", n);
for(i = 0; i < N; i++)
total += (n[i] - '0');
printf("%d\n", total);
return 0;
}
| ALGO | 0.999717 | 3.719554 |
7b51a93c-5c68-4132-acb4-9ff205da3fb7 | Yejin-Moon/algorithm | C++/Baekjoon/Problem10769.cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
getline(cin,s);
int len = s.length();
int happy=0, sad=0;
bool flag = false;
for(int i=0; i<len; i++)
{
if(s[i]==':' && s[i+1]=='-')
{
flag=true;
i+=2;
}
... | ALGO | 0.999741 | 4.019351 |
8b21c7ea-e90d-4d0d-8c82-eeedf8028b35 | JASIM16027/Dynamic-Programming | knapsack_pattern/memorizationKnapsack.cpp | #include<bits/stdc++.h>
using namespace std;
int dp[102][1002];
int knapsack(int wt[], int val[],int w, int n){
if (w==0||n==0) return 0;
if (dp[n][w]!=-1) return dp[n][w];
if (wt[n-1]<=w){
return dp[n][w] = max(val[n-1]+knapsack(wt,val,w-wt[n-1],n-1), knapsack(wt,val,w,n-1));
}
... | ALGO | 0.999989 | 4.629308 |
024446f2-6067-44fa-9cae-76dd3bc34c8d | GREED-ED/Academic | CSIT/3rd sem/NM/14.euler.cpp | #include <iostream>
#include <cmath>
#define f(x, y) (2 * (y) / (x))
using namespace std;
int main() {
int i, n;
float x, y, h, xp, dy;
cout << "Input initial value of x and y:" << endl;
cin >> x >> y;
cout << "Input value of x at which y is required: ";
cin >> xp;
cout << "Input step size: ... | ALGO | 0.999929 | 4.185647 |
2e9065d9-5a7b-4454-992e-f75c0f7b611d | gdsc-bvp-nd/Hactoberfest2022 | DSA/12.cpp | /* Problem Code: CBSPEED
Contest Code:START41
Problem
In ChefLand, human brain speed is measured in bits per second (bps). Chef has a threshold limit of XX bits per second above which his calculations are prone to errors. If Chef is currently working at YY bits per second, is he prone to errors?
... | ALGO | 0.999782 | 3.581261 |
73f003bf-6dbc-4012-88a1-59164d898e9d | raincross7/code-similarity | codes/train_code/problem107/problem107_11.cpp | #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define NA -1
int main()
{
int H, W, N;
while (true)
{
cin >> W >> H >> N;
if (W == 0 && H == 0) { break; }
vector<int> X(N);
vector<int> Y(N);
for (int i = 0; i < N; i++)
cin >> X[i] >> Y[i];
vector<vector<int> > ... | ALGO | 0.99967 | 3.971364 |
0466543e-c574-4104-bcb8-b505e136d1cd | HoduRe/NotThatGameEngine | NotThatGameEngine/NotThatGameEngine/MathGeoLib/src/Geometry/Frustum.cpp | /** @file Frustum.cpp
@author Jukka Jylnki
@brief Implementation for the Frustum geometry object. */
#include "Frustum.h"
#include "AABB.h"
#include "Circle.h"
#include "../Math/MathFunc.h"
#include "Plane.h"
#include "Line.h"
#include "OBB.h"
#include "Polyhedron.h"
#include "Polygon.h"
#include "Ray.h"
#include "Sp... | TOOL | 0.974937 | 7.235261 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.