uuid stringlengths 36 36 | repo_name stringlengths 5 123 | relative_path stringlengths 5 4k | content stringlengths 33 2.85M | category stringclasses 6
values | algo_rel_score float64 0.85 1 | quality_score float64 3 8.76 |
|---|---|---|---|---|---|---|
e2979c53-f0ac-41b5-a8cb-4cdbe80f5da1 | libinghope/my-code-diaries | 005-数据结构与算法/exercises/69.x-的平方根.cpp | /*
* @lc app=leetcode.cn id=69 lang=cpp
*
* [69] x 的平方根
*
* https://leetcode-cn.com/problems/sqrtx/description/
*
* algorithms
* Easy (37.59%)
* Likes: 329
* Dislikes: 0
* Total Accepted: 106K
* Total Submissions: 281.7K
* Testcase Example: '4'
*
* 实现 int sqrt(int x) 函数。
*
* 计算并返回 x 的平方根，其中 x 是... | ALGO | 0.999864 | 5.613954 |
e59d04cf-43df-4abd-a9a0-8f0a06301aa6 | shuwenhe/cpp | define/define.cpp | #include <iostream>
using namespace std;
#define PI 3.14159
int main(){
int r = 3;
double area = 0;
area = PI * r * r;
cout<<"area = "<<area<<endl;
return 0;
}
| ALGO | 0.99841 | 3.235494 |
fea8824b-17f6-4d1e-8472-c0caf54b0201 | Omarmansour557/Algorithms_DataStructure_Problems | Binary_Search_Tree/my_tree.cpp | #include <iostream>
#include "my_tree.h"
using namespace std;
int main(int argc, char **argv)
{
int size = 0;
int operations = 0;
// cout << "Enter tree size & number of operations: " << endl;
cin >> size >> operations;
vector<int> a(size);
// cout << "Enter the tree elements: " << endl;
... | ALGO | 0.999002 | 4.596213 |
175dc2a2-2740-425d-8f7b-f93013df199a | reqmct/ITMO-university | ct-itmo-course-cpp/calc-number-system-reqmct/src/calc.cpp | #include "calc.hpp"
#include <cctype>
#include <cmath>
#include <iostream>
namespace {
const std::size_t max_decimal_digits = 10;
enum class Op
{
ERR,
SET,
ADD,
SUB,
MUL,
DIV,
REM,
NEG,
POW,
SQRT
};
std::size_t arity(const Op op)
{
switch (op) {
// error
case Op:... | TOOL | 0.971658 | 6.052719 |
42c6b45e-1732-4092-8982-0546daabe230 | mrshiposha/EditedUE4 | Engine/Source/Developer/MeshBuilder/Private/ThirdPartyBuildOptimizationHelper.cpp | #include "NvTriStrip.h"
#include "forsythtriangleorderoptimizer.h"
#ifdef __clang__
#define _SILENCE_STDEXT_HASH_DEPRECATION_WARNINGS 1
#endif
#include "nvtess.h"
namespace BuildOptimizationThirdParty
{
// CVars
static TAutoConsoleVariable<int32> CVarTriangleOrderOptimization(
TEXT("r.TriangleOrderOptimization")... | ALGO | 0.856363 | 7.771586 |
7e36bad5-dd5b-450a-ad9d-89a92beb1798 | yeasinshamimdev/DSA-by-C-Plus-Plus | module-5/linked_list.cpp | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
class Node
{
public:
int val;
Node *next;
};
int main()
{
Node a, b, c;
a.val = 10;
b.val = 20;
c.val = 30;
a.next = &b;
b.next = &c;
c.next = NULL;
cout << (*(*a.next).next).val << endl;
cou... | ALGO | 0.998723 | 3.497996 |
b4fdd58b-58f4-490b-9e65-7c2dffeed6df | ishandutta2007/codeforces | wzyeustia/normal/1486/B.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll (i) = (a); (i) <= (b); (i)++)
#define ROF(i, a, b) for (ll (i) =... | ALGO | 0.999879 | 3.995538 |
f6c2de8d-0ba0-4500-9abe-9a10667a0421 | redwanh25/cpp | data structure/tree (BFS-level order111).cpp | #include<iostream>
using namespace std;
struct node{
int data;
node* left;
node* right;
node* info, *next;
};
/////////////////////// queue ////////////////////////////
node* first, *last;
void push(node* root)
{
node* temp = new node();
temp -> info = root;
temp -> next = NULL;
... | ALGO | 0.999951 | 4.318702 |
734fe1b7-2aaf-4e8b-8499-b5f0d0fe8fdc | mikeethanh/phanTichThietKeThuatToan | QuyHoachDong/trochoimoi.cpp | #include <iostream>
using namespace std;
int main() {
int n,x,s=0,t,c;
cin>>n;
for(int i = 1; i<=n;i++){
cin>>x;
s+=x;
x=x?-1:1;
if(i==1) t= c =x;
else { c= max(c,0)+x;
t = max (c,t);
}
}
cout<<s+t;
}
| ALGO | 0.999978 | 3.682528 |
4224a36e-0078-44ff-9d00-5c2a720bee88 | FineFenng/ncursesplusplus | demos/game_of_life/get_life_1_05.cpp | #include "get_life_1_05.hpp"
#include <string>
#include "coordinate.hpp"
#include "pattern.hpp"
namespace gol {
// TODO Implement this
auto get_life_1_05(std::string const & /*filename*/) -> Pattern
{
return {{}, parse_rule_string("B3/S23")};
}
} // namespace gol
| TOOL | 0.878041 | 4.121159 |
eed2b8d4-c6f5-4f69-8f8f-2fc1e66c3234 | Faisii786/Programming-in-C-plus-plus | Lecture#16 Example ,Binary Search.cpp | #include <iostream>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int main(int argc, char** argv) {
int n,i,arr[50],search,start,end,mid,flag=0,loc;
cout<<"Enter total number of elements:"<<endl;
cin>>n;
cout<<"Enter"<<n<< "Number:" <<e... | ALGO | 0.997114 | 3.635324 |
fe4b91e0-edb3-4d2f-a37e-2e3041e31ad5 | Ujjwal55/LeetCode-Solutions | 213-house-robber-ii/213-house-robber-ii.cpp | class Solution {
public:
int maxMoney(vector<int> &nums, int n, vector<int> &money){
if(n <= 0) return 0;
if(n == 1) return nums[n-1];
if(money[n] != -1) return money[n];
return money[n] = max(nums[n-1] + maxMoney(nums, n-2, money), maxMoney(nums, n-1, money));
}
int rob(vec... | ALGO | 0.999958 | 5.790985 |
40621161-3188-4919-b6c2-28ab321e3847 | Neha-119/100_Code_Library | lb_neg_one_side.cpp | #include<iostream>
using namespace std;
void rearrange(int a[],int n)
{
int i,j=0;
for(i=0;i<n;i++)
{
if(a[i]<0){
if(i!=j)
swap(a[i],a[j]);
j++;
}
}
}
void printarray(int a[],int n)
{
int i;
for(i=0;i<n;i++)
cout<<a[i]<<" ";
}
int m... | ALGO | 0.999899 | 4.195476 |
be0915af-6ab1-4c0b-a008-ec689b80b87b | ebuarip/Lane-Departure-Warning-System | LDWS/main.cpp | /*
* Project: Lane Departure Warning System (LDWS)
*
* File: main.cpp
*
* Contents: main function of the software executing :
* A help function for software comand line and execution of the wanted functionality of the software.
* The software can either be run on a single given image, on a given... | TOOL | 0.887926 | 5.451905 |
6df3aabd-1d05-46f9-a218-7b2232cb8de5 | alifalhasan/CP-code-vault | Codeforces/Educational Round/Educational Codeforces Round 124 (Rated for Div. 2)/A - Playoff/149232817.cpp | #include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename temp>using ordered_set = tree<temp, null_type, less_equal<temp>, rb_tree_tag,tree_order_statistics_node_update>;
//order_of_key(k) : Number of items str... | ALGO | 0.999657 | 4.66923 |
994a6fc5-e137-43ff-995a-7234d460d802 | vedant2307/Leetcode | largest-odd-number-in-string/largest-odd-number-in-string.cpp | class Solution {
public:
string largestOddNumber(string num) {
int len=num.length();
for(int i=len-1;i>=0;i--){
int d=(int)num[i];
if(d%2){
return num.substr(0,i+1);
}
}
return "";
}
}; | ALGO | 0.999935 | 5.99045 |
34f0f475-a602-4077-90ed-03aa60b8f9c9 | Intiser/ProblemSolvingAndContest | UvaOnlineJudge/151.cpp | #include<iostream>
#include<stdio.h>
using namespace std;
int arr[110];
int res[110];
int main(){
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n,tot,cnt,fl,ans,st;
for(int x=13;x<=100;x++){
n=x;
ans= -1;
for(int i=1;i<=250;i++){
tot =n;
... | ALGO | 0.999692 | 3.124698 |
a96a2e45-f0ae-4b7e-b762-da49fb859d9b | suryakantkakkar/datastructures | circular_linked_list.cpp | #include<stdio.h>
#include<conio.h>
#include<malloc.h>
struct node
{
int data;
struct node *next;
};
struct node *start=NULL;
struct node *create_cll(struct node *);
struct node *insert_beg(struct node *);
struct node *insert_end(struct node *);
struct node *delete_beg(struct node *);
struct node *delete_end(struct n... | ALGO | 0.999847 | 3.347485 |
614fd3ba-6122-4ea4-95b0-f04d395c1f60 | ddlin0719/pratice | acm2014/uva10453.cpp | #include <stdio.h>
#include <string.h>
char path[2012],str[1010];
int sum[1010][1010];
int dp(int a,int b){
if (sum[a][b]!=-1) return sum[a][b];
if (a>=b){
sum[a][b]=0;
return 0;
}
if (str[a]==str[b])
sum[a][b]=dp(a+1,b-1);
else{
int tmp1=dp(a+1,b)+1;
int tmp2=dp(a,b-1)+1;
if (tmp1<tmp2) sum[a][b]=tmp1... | ALGO | 0.999969 | 3.275897 |
c5f90cbc-b295-4731-b0d8-bf591de3df76 | vivekup3424/Coding_Problems | cses/sorting_searching/ferris_wheel.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef long long unsigned llu;
inline void fast_io()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main()
{
fast_io();
int n, x;
cin >> n >> x;
vector<int> v;
for (int i = 0; i < n; i++)... | ALGO | 0.999991 | 4.766514 |
15fd55f8-a567-4bd1-b64f-69caac338a43 | anoobzg/qi | src/OpenColorIO/src/src/core/Lut1DOp.cpp | #include <OpenColorIO/OpenColorIO.h>
#include "HashUtils.h"
#include "Lut1DOp.h"
#include "MathUtils.h"
#include "SSE.h"
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iostream>
OCIO_NAMESPACE_ENTER
{
Lut1D::Lut1D() :
maxerror(std::numeric_limits<float>::min()),
errortype(ERRO... | TOOL | 0.983193 | 6.714428 |
6535ebc1-2c77-4d0d-9183-496edc2c36d6 | Yeldod/Algo1 | 6-D-порядок.cpp | #include <iostream>
using namespace std;
int main(){
int n(0),counter(0);
cin >> n;
int * arr = new int[n];
for(int i = 0;i<n;++i){
cin >> arr[i];
}
for(int i = 1;i<n;++i){
if(arr[i] > arr[i-1])++counter;
}
cout << counter << "\n";
delete [] arr;
cout << e... | ALGO | 0.999656 | 3.843013 |
cad80a9a-c6b0-49e7-917a-9899e14441a2 | devraj2018/Programming_Pathshala | Stacks/Balanced_Parenthese.cpp | class Solution {
public:
bool isValid(string s) {
if((s.length())&1) return false;
stack<char>st;
int i=0;
while(i<s.length())
{
if(s[i]=='(' || s[i]=='{' ||s[i]=='[')
st.push(s[i]);
else{
if(s... | ALGO | 0.99969 | 6.213056 |
e197c23a-1450-42c3-b773-b4d4c32b1102 | 0xAriseAizen-404/UnStop-100-days-of-Code | Day-004/P13-Revese-It.cpp | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
void reverseAString(string &str, int start, int end) {
if (start < end) {
char x = str[start];
str[start] = str[end];
str[end] = x;
reverseAString(str, ++start, --end)... | ALGO | 0.999972 | 4.709293 |
5f06cdfa-c9b8-4a85-8e4f-5061c86b6089 | Kiran-Londhe/Tutorial | program442.cpp | #include<iostream>
using namespace std;
template <class T>
struct NodeS
{
T data;
struct NodeS *next;
};
template <class T>
class SinglyLL
{
public:
struct NodeS<T> * first;
int iCount;
SinglyLL();
void Display();
int Count();
void InsertFirst(T);
void InsertLast... | ALGO | 0.99892 | 4.353561 |
31c112ca-923c-4ee5-8012-f49933ac914b | WilliamJokuS/mywebsite | idek/troc15b.cpp | #include <bits/stdc++.h>
using namespace std;
int n;
bool trip[1005];
bool dble;
bool bisa;
int idx;
int main(){
for(int i=5;i<=1000;i++){
dble=false;
idx=0;
bisa=false;
for(int j=i-1;j>=1;j--){
if(idx==j)continue;
int tmp=sqrt(i*i-j*j);
if(tmp*tmp==i*i-j*j){
if(bisa==true){
dble=true;
b... | ALGO | 0.999952 | 3.889439 |
162d3568-1edb-471f-9519-8bf1040ed476 | troyliu0105/eigen | doc/examples/Tutorial_ReductionsVisitorsBroadcasting_reductions_bool.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace std;
using namespace Eigen;
int main()
{
ArrayXXf a(2,2);
a << 1,2,
3,4;
cout << "(a > 0).all() = " << (a > 0).all() << endl;
cout << "(a > 0).any() = " << (a > 0).any() << endl;
cout << "(a > 0).count() = " << (a > 0).count() << endl... | ALGO | 0.984113 | 3.835741 |
1458855b-bd02-4e98-918d-85f0b440fbbe | munh-orgil/leetcode | 2024/04. apr/(10) 950. Reveal Cards In Increasing Order.cpp | #include<bits/stdc++.h>
using namespace std;
class Solution {
public:
Solution() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
vector<int> deckRevealedIncreasing(vector<int>& deck) {
int n = deck.size();
sort(deck.begin(), deck.end());
... | ALGO | 0.999977 | 4.846056 |
0c76a364-1f94-42a5-bcb0-6c32074892e9 | Arpit-AD/LeetCode | 138-copy-list-with-random-pointer/138-copy-list-with-random-pointer.cpp | /*
// Definition for a Node.
class Node {
public:
int val;
Node* next;
Node* random;
Node(int _val) {
val = _val;
next = NULL;
random = NULL;
}
};
*/
class Solution {
public:
Node* copyRandomList(Node* head) {
if(!head)
return NULL;
... | ALGO | 0.998862 | 5.342551 |
46a8ba05-14af-42dc-ab28-d699d75d5872 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_1086_6.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, m, a[N], id[N], p[N], sum[N];
vector<int> e[N];
bool flag[N];
double ans;
bool cmp(int x, int y) { return a[x] > a[y]; }
int find_set(int x) {
if (p[x] == x) return x;
return p[x] = find_set(p[x]);
}
int main() {
scanf("%d %d", &n, &m);
... | ALGO | 0.999707 | 4.207 |
ad21e350-f898-49a2-8064-0235a9342566 | rubikpi-ai/lvgl | lvgl/src/libs/thorvg/tvgMath.cpp | #include "../../lv_conf_internal.h"
#if LV_USE_THORVG_INTERNAL
#include "tvgMath.h"
bool mathInverse(const Matrix* m, Matrix* out)
{
auto det = m->e11 * (m->e22 * m->e33 - m->e32 * m->e23) -
m->e12 * (m->e21 * m->e33 - m->e23 * m->e31) +
m->e13 * (m->e21 * m->e32 - m->e22 * m->e31);
... | ALGO | 0.950897 | 6.463533 |
71344d2a-8147-4f32-bf46-53888b5d3e6e | ishandutta2007/codeforces | radewoosh/normal/1314/D.cpp | //~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC target ("avx2")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//~ #pragma GCC optimize("unro... | ALGO | 0.999939 | 3.835078 |
cfc060bb-63e0-4b12-982d-b453aef554cc | rohitmultani/LeetCode_Practice | Flood fill Algorithm - GFG/flood-fill-algorithm.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
private:
void dfs(int row,int col,vector<vector<int>> &ans,vector<vector<int>> &image,
int newColor,int delRow[],int delCol[],int iniCol){
ans[row][col]=newColor;
int n = image.size();... | ALGO | 0.998138 | 6.123698 |
f1cbcc16-529a-4ec1-8cf9-4f2b4b361339 | naylour/ProgrammingLanguages | src/modules/stack/A.cpp | #include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<int> numbers;
int number;
while (true)
{
cin >> number;
if (number == 0)
break;
numbers.push_back(number);
}
for (auto number : numbers)
if (number % 2 == 0)
... | ALGO | 0.99987 | 4.507329 |
f25d133e-46e3-4379-9d25-8fba2844dc16 | hexu1985/cpp_book_code | cpp.func.handbook/ch02/2-3-8.cpp | #include<iostream.h>
#include<math.h>
int main()
{
long double x;
x=tan(1);
cout<<atanl(x)<<endl;
return 0;
}
| ALGO | 0.947652 | 3.436097 |
0c2ac90e-8176-48c2-91ed-8eb3053006df | brightwellt/CarND-Path-Planning-Project | src/Eigen-3.3/doc/examples/tut_arithmetic_matrix_mul.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
Matrix2d mat;
mat << 1, 2,
3, 4;
Vector2d u(-1,1), v(2,0);
std::cout << "Here is mat*mat:\n" << mat*mat << std::endl;
std::cout << "Here is mat*u:\n" << mat*u << std::endl;
std::cout << "Here is u^T*mat:\n" << u.transpo... | ALGO | 0.998531 | 3.818773 |
f44f97b5-1b96-44ab-9dd0-5d8064f47e0c | TheoPannetier/RangeShifter_batch | src/RScore/Patch.cpp | //---------------------------------------------------------------------------
#include "Patch.h"
//---------------------------------------------------------------------------
//---------------------------------------------------------------------------
Patch::Patch(int seqnum,int num)
{
patchSeqNum = seqnum; patchN... | TOOL | 0.947536 | 5.137751 |
b69f2787-b8a6-410c-9203-0394319be391 | shilfihabibah/STD_Shilfi_Habibah_2311104002 | 05_Single_Linked_List_Bagian_2/Unguided5/Latihan1/src/singlelist.cpp | #include "singlelist.h"
// Prosedur untuk membuat list kosong
void createList(List &L) {
L.First = nullptr;
}
// Fungsi untuk mengalokasikan elemen baru
address alokasi(infotype x) {
address P = new ElmList;
if (P != nullptr) {
P->info = x;
P->next = nullptr;
}
return P;
}
// Pros... | TOOL | 0.982235 | 4.618676 |
133020f4-618f-491f-9627-972161a8b272 | hoanxuanbach/Competitive-Programming | OI/JOISC/2016/solitare.cpp | // Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_sup... | ALGO | 0.999877 | 4.584091 |
745421eb-904b-4c4e-9912-62c101718c0b | Code-Diary/P-GIMSIWAN | S_2383.cpp | #include <stdio.h>
#include <vector>
using namespace std;
typedef struct {
pair<int, int> loc;
int length;
int stand = 0;
}S;
typedef struct {
pair<int, int> loc;
int stairs_num;
int distance;
}P;
vector<S> Stairs;
vector<P> Person;
int _time_;
int distance(int n) {
return abs(Stairs[Person[n].stairs_num]... | ALGO | 0.999729 | 3.533422 |
669d7f05-6775-43e1-a559-6c189792ea32 | danielhO9/PS | BOJ/2606.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false); cin.tie(NULL);
int N, M; cin >> N >> M;
vector<vector<int>> graph(N + 1, vector<int>(0));
vector<bool> visited(N + 1, false); visited[1] = true;
deque<int> bfs = {1};
int a, b;
for (int i = 0; i < M; ++i... | ALGO | 0.999881 | 4.207564 |
709c3b8b-e12b-4015-840f-db0d6411d4ee | MohammadRuhulAmin/cpp_standard_template_library | PriorityQueue/basic priority queue/Example_priority_queue.cpp | #include <iostream>
#include <map>
#include <string>
#include <vector>
#include <algorithm>
int main() {
// Define a counter map with frequency counts.
std::map<std::string, int> counter;
counter["apple"] = 3;
counter["banana"] = 2;
counter["cherry"] = 3;
// Define a list of strings to be sort... | ALGO | 0.999846 | 6.513578 |
3d08143e-8295-4bfd-b4b0-bfe790fb7cf7 | sunqinxuan/vins | vslam/src/vio/vio.cpp | /***********************************************
#
# Author: Sun Qinxuan
#
# Email: <EMAIL>
#
# Last modified: 2023-08-14 14:41
#
# Filename: vio.cpp
#
# Description:
#
************************************************/
#include "vio/vio.hpp"
namespace vslam {
VIOdometry::VIOdometry(ros::NodeHandle &nh, std::string c... | ALGO | 0.953738 | 5.592696 |
b3515ba0-1eaf-4c63-b156-7fb39e6b2388 | code-fans/books-source | 动态规划/01_最长不下降子序列/1.4导弹拦截/src/标程/missile.cpp | //
#include <bits/stdc++.h>
using namespace std;
const int N=10001;
int f[N],a[N];
int main()
{
//freopen("missile.in","r",stdin);
//freopen("missile.out","w",stdout);
int n=1,ans1=0,ans2=0;
for(; scanf("%d",&a[n])!=EOF; n++);
for(int i=1; i<n; i++) //һʣLIS
{
f[i]=1;
for(int j=1; j<... | ALGO | 0.99958 | 3.41915 |
e292b5e1-f50d-4162-8512-bf16610dfc5f | ishandutta2007/codeforces | maksim1744/normal/1687/E.cpp | /*
author: Maksim1744
created: 03.06.2022 19:20:35
*/
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_... | ALGO | 0.999946 | 3.540171 |
d0d0ebeb-83b1-4e3c-a304-a2eba67b13e4 | ducviet0809/NguyenDucViet_monC- | Chapter 4/Challenges/BT14.cpp | #include <iostream>
using namespace std;
int main(){
const double PHI_HANG_THANG = 10;
const double PHI_SAU_DIEU_KIEN = 15;
const double PHI_1 = 0.10;
const double PHI_2 = 0.08;
const double PHI_3 = 0.06;
const double PHI_4 = 0.04;
double soDuTaiKhoan;
int soSecDADUNG;
double phiDic... | ALGO | 0.995887 | 3.538158 |
ddeb7e57-ab68-44be-ad3a-6be6e230d1f1 | lakshaycommits/leetcode | 2225-find-players-with-zero-or-one-losses/2225-find-players-with-zero-or-one-losses.cpp | class Solution {
public:
vector<vector<int>> findWinners(vector<vector<int>>& matches) {
map<int, pair<int, int>> mp;
for(auto match: matches) {
mp[match[0]].first++;
mp[match[1]].second++;
}
vector<vector<int>> ans(2);
for(auto i: mp... | ALGO | 0.999747 | 5.63675 |
84e3bd94-9822-4620-a48a-13cdb2a2072f | AprilPolubiec/CP1Labs | lab10/src/lab10.cpp | //============================================================================
// Program : lab10.cpp
// Programmer : April Polubiec
// Date : November 28, 2018
// Purpose : Test concepts of functions, arrays and sorting.
//============================================================================
#i... | ALGO | 0.996293 | 5.449606 |
a6a6c7f0-2f2f-4f75-86df-0ce961002bbf | Filikec/competitive-programming | kattis/alphabetanimals.cpp | #include <iostream>
#include <set>
#include <list>
using namespace std;
int Animals[27];
list<string> Animals_list;
int main(){
int n;
string before;
cin >> before;
char b = before.back();
cin >> n;
for (int i=0;i<n;i++){
string animal;
cin >> animal;
Animals[animal.f... | ALGO | 0.999948 | 3.855672 |
94daf627-3839-4d5d-85eb-a6e62d5d2755 | CKlittleluck/C | 21.7-21.1/21.7-21.1/test.cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
string str1, str2, ret;
while (getline(cin, str1))
{
getline(cin, str2);
int hashtable[256] = { 0 };
for (int i = 0; i < str2.size(); ++i)
{
hashtable[str2[i]]++;
}
for (int i = 0; i < str1.size(); ++i)
{
if (hashtable[str1... | ALGO | 0.999834 | 3.859661 |
9a2762cb-dc87-4e23-a8e6-447bb2a5c746 | AryamannNingombam/competitive-programming-practice | ary_amann/cf/1374B.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int get_result(int n)
{
int result = 0;
while (n % 6 == 0)
{
n /= 6;
result++;
}
while (n % 3 == 0)
{
n /= 3;
result += 2;
}
return (n == 1 ? result : -1);
}
... | ALGO | 0.999664 | 4.183471 |
508e3d45-2f61-41ac-813d-e7ceedbc834f | shamim7999/LightOjProblems | LightOj1425-BinarySearch.cpp | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define mx 100005
#... | ALGO | 0.999836 | 3.878955 |
c0e8a115-cc2f-4b8e-8a96-0e535c9d0612 | Ujjwalkumar2003/Strivers-SDE-Sheet-Challenge | Geek Jump - GFG/geek-jump.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
int f(int ind,vector<int>&height,vector<int>&dp){
if(ind==0)return 0;
if(dp[ind]!=-1)return dp[ind];
int left=f(ind-1,height,dp)+abs(height[ind]-height[ind-1]);
int ri... | ALGO | 0.999891 | 6.41947 |
0dd518a9-5af8-4640-92a8-3eb4b0cd6e64 | SilvioGiancola/VisualInertialKinectFusion | pcl/examples/features/example_point_feature_histograms.cpp | #include <iostream>
#include <vector>
#include <pcl/io/pcd_io.h>
#include <pcl/point_types.h>
#include <pcl/features/pfh.h>
#include <pcl/features/normal_3d.h>
int
main (int, char** argv)
{
std::string filename = argv[1];
std::cout << "Reading " << filename << std::endl;
pcl::PointCloud<pcl::PointXYZ>::Ptr clo... | ALGO | 0.899051 | 5.412937 |
4079fd21-1093-4466-a13d-0a2f94f0b8bd | phuocchubeo123/Codeforces | Contests/Div2/769/dsol.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vt vector
#define forlr(i, l, r, k) for (int i = l; i < r; i += k)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
const int N = 2e5 + 4;
int T;
template<typename T>
struct s... | ALGO | 0.999986 | 3.742739 |
de627782-dcf5-40fc-a7f5-52c7131d02f3 | loujilin/cppexe | operatoroverload/Complex.cpp | //
// Created by 15167 on 2024/12/10.
//
#include <iostream>
using namespace std;
class Complex
{
protected:
double x;
double y;
public:
Complex(double a=0,double b=0)
{
x=a;y=b;
}
Complex operator=(Complex b)
{
this->x=b.x;this->y=b.y;
return *this;
}
Complex... | ALGO | 0.994107 | 4.347829 |
b5263e1c-e4b7-4e00-aea2-2d926b1fe65c | kohinigeee/abc | 261/261-c.cpp | #include<iostream>
#include<set>
#include<map>
using namespace std;
int main()
{
map<string, int> mp;
int n;
cin >> n;
while(n--) {
string tmp; cin >> tmp;
if ( mp.find(tmp) == mp.end() ) {
mp[tmp] = 1;
cout << tmp << endl;
} else {
cout << ... | ALGO | 0.999511 | 4.275499 |
fa9df8e4-6dd4-4151-9312-735edb0f0643 | OKYou1/procon-archive | atcoder.jp/abc198/abc198_b/Main.cpp | #include <bits/stdc++.h>
using namespace std;
string s, rs;
int main()
{
cin >> s;
bool flag = false;
string rs = s;
reverse(rs.begin(), rs.end());
if (rs == s)
{
flag = true;
}
if (!flag)
{
for (int i = 0; i < 10; i++)
{
s = '0' + s;
string rs = s;
reverse(rs.begin(), ... | ALGO | 0.999917 | 4.750401 |
8e23e8b5-5367-40ed-9a74-de6df0361e04 | MorvanLi/DTNP-ST | Cpp/NdDirectionalFilterBank.cpp | //////////////////////////////////////////////////////////////////////////
// SurfBox-C++ (c)
//////////////////////////////////////////////////////////////////////////
//
// Yue Lu and Minh N. Do
//
// Department of Electrical and Computer Engineering
// Coordinated Science Laboratory
// University of Illinois at Urba... | ALGO | 0.998932 | 4.398046 |
10015607-81bb-401c-abe6-98ad1c4cc4ea | sanchitsharma251/USACO | Leetcode/1482.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
bool check(vector<int> bloomDay, int m, int k, int n, int days) {
bool visited[n];
for (int i = 0; i < n; ++i) visited[i] = (bloomDay[i] <= days);
// Check to see if visited satsfies the m condition and k condition
... | ALGO | 0.999998 | 6.004074 |
0c572843-65e1-4a75-87b8-d2dd1fdc9335 | boatinw99/CompetitiveProgramming | SSWT 2.2/776D.cpp | #include<bits/stdc++.h>
using namespace std ;
const int N = 1e5+9 ;
int a[N],comp[N<<1];
bool vst[N<<1];
vector<int> swit[N],g[N<<1],gt[N<<1],order;
void dfs0(int u)
{
vst[u]++;
for(auto it:g[u])if(!vst[it])dfs0(it);
order.emplace_back(u);
}
void dfs1(int u,int clr)
{
comp[u]=clr;
for(auto it:g[u])i... | ALGO | 0.999943 | 4.320758 |
1fb843d8-8da2-4dd6-b61d-ea93c8a7d5de | Takiwa-i/Atcoder | ABC/122/A.cpp | #include <iostream>
int main(void)
{
char c;
char ans;
std::cin >> c;
if (c == 'A')
ans = 'T';
else if (c == 'C')
ans = 'G';
else if (c == 'T')
ans = 'A';
else
ans = 'C';
std::cout << ans << std::endl;
return (0);
} | ALGO | 0.996943 | 5.027947 |
7d65019a-ccbf-498c-a9be-d6b9a2106929 | 2anesh/DSA-PRACTICE | Maximum Number of coins.cpp | class Solution{
public:
int t[405][405];
int maxt(vector<int>&a,int i,int j){
if(i>j)
{
return 0;
}
int ans=INT_MIN;
if(t[i][j]!=-1)
{
return t[i][j];
}
for(int k=i;k<=j;k++){
... | ALGO | 0.999957 | 5.174545 |
bb154659-4bad-44f2-b06c-017cbbc98abe | gr790/Uva | 10789/program.cpp | #include <iostream>
#include <string>
#include <fstream>
#include <map>
#include <bitset>
#include <math.h>
#include <algorithm>
using namespace std;
/* Prime Number */
#define SIZE 1000000LL
bitset<SIZE+1> prime;
void sieve()
{
int sq = ceil(sqrt(SIZE));
for(int i = 2; i <= sq; ++i)
{
... | ALGO | 0.999801 | 4.471708 |
0d772d46-446c-4772-bf03-9d4c75b04dad | insubkim/Problem_Solving | BOJ/나는요리사다.cpp | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = a; i <= b; i++)
using namespace std;
typedef vector<int> vi;
int main()
{
int score[5] = {0, };
int tmp;
REP(i, 0, 19){
cin >> tmp;
score[i / 4] += tmp;
}
int max = 0;
int win = -1;
REP(i, 0, 4){
if (max <... | ALGO | 0.999891 | 3.257649 |
c447f944-dd22-41c0-a71d-0542ed69bad2 | Dynesshely/Competition | source/website/cjsoj.cn/P7.cpp | /*
Description
在一个果园里，多多已经将所有的果子打了下来，而且按果子的不同种类分成了不同的堆。多多决定把所有的果子合成一堆。
每一次合并，多多可以把两堆果子合并到一起，消耗的体力等于两堆果子的重量之和。可以看出，所有的果子经过n-1次合并之后，
就只剩下一堆了。多多在合并果子时总共消耗的体力等于每次合并所耗体力之和。
因为还要花大力气把这些果子搬回家，所以多多在合并果子时要尽可能地节省体力。假定每个果子重量都为1，
并且已知果子的种类数和每种果子的数目，你的任务是设计出合并的次序方案，使多多耗费的体力最少，并输出这个最小的体力耗费值。
例如有3种果子，数目依次为... | ALGO | 0.999982 | 4.073786 |
7285cb12-84ee-4b27-a840-56d6a72cf9c2 | BootleggersROM/frameworks_native | services/surfaceflinger/layerproto/LayerProtoParser.cpp | #include <android-base/stringprintf.h>
#include <layerproto/LayerProtoParser.h>
#include <ui/DebugUtils.h>
using android::base::StringAppendF;
using android::base::StringPrintf;
namespace android {
namespace surfaceflinger {
bool sortLayers(LayerProtoParser::Layer* lhs, const LayerProtoParser::Layer* rhs) {
uint... | TOOL | 0.959811 | 7.071126 |
bea62694-0933-4a67-a1cd-9e748f2d2df9 | ishandutta2007/codeforces | box/normal/985/F.cpp | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using ll = long long;
using pii = pair<int, int>;
//#define int ll
const int MOD = 1042145983;
auto rng =
mt19937(chrono::high_resolution_clock::now().time_... | ALGO | 0.999966 | 4.859824 |
5fad1841-fca3-4e4e-bb8f-fa565c08b7a6 | jeremysalwen/LLVM_IRProfiling | pass/PathNumbering.cpp | #include "PathNumbering.h"
#include "llvm/IR/Constants.h"
#include "llvm/IR/DerivedTypes.h"
#include "llvm/IR/InstrTypes.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/Module.h"
#include "llvm/IR/TypeBuilder.h"
#include "llvm/Pass.h"
#include "llvm/IR/CFG.h"
#include "llvm/Support/CommandLine.h"
#include "llvm... | ALGO | 0.99936 | 5.457062 |
9528e82b-964e-4574-a278-1b2d73cf0f10 | abin7989/cpp_Study | cpp_Study/cpp_Study/cpp_Study.cpp | //#include <iostream>
//#include <string>
//
//using namespace std;
//const int SCISSORS = 1;
//const int ROCK = 2;
//const int PAPER = 3;
//
//string winNum(int _allGame, int _userWin);
//int main()
//{
// int allGame = 0;
// int userWin = 0;
//
// while (true)
// {
// srand(time(0));
// int ranNum = 1 + (rand() % 3... | ALGO | 0.969029 | 3.851022 |
d9075baa-e971-4e8d-91f0-c557dbfae56b | jiyongyu/SORAM | src/cryptopp/md2.cpp | // md2.cpp - modified by Wei Dai from Andrew M. Kuchling's md2.c
// The original code and all modifications are in the public domain.
// This is the original introductory comment:
/*
* md2.c : MD2 hash algorithm.
*
* Part of the Python Cryptography Toolkit, version 1.1
*
* Distribute and use freely; there are n... | ALGO | 0.996565 | 6.774331 |
fed45769-d366-46d5-a328-f072cac547f0 | sarvex/leetcode-elm | solution/2300-2399/2374.Node With Highest Edge Score/Solution.cpp | class Solution {
public:
int edgeScore(vector<int>& edges) {
int n = edges.size();
vector<long long> cnt(n);
for (int i = 0; i < n; ++i) {
cnt[edges[i]] += i;
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (cnt[ans] < cnt[i]) {
... | ALGO | 0.999939 | 5.486795 |
60f3a51e-7a89-42fe-9e65-a20c0fe13c76 | youbeen2798/SWEA-problems | SWEA_10059_유효기간.cpp | #include<iostream>
using namespace std;
int main(int argc, char** argv)
{
int test_case;
int T;
cin >> T;
for (test_case = 1; test_case <= T; ++test_case)
{
int n;
cin >> n;
int a = n / 100;
int b = n % 100;
cout << a << " " << b << "\n";
if (1 <= a && a <= 12 && 1 <= b && b <= 12) {
cout << "... | ALGO | 0.995984 | 4.247221 |
21aa8274-e26e-4a80-bb4f-4a5e0361955c | SyedaSana01/A-Z-DSA | Apractice/Medium/SortArray/Better.cpp | #include<bits/stdc++.h>
using namespace std;
int sortArray(vector<int>&arr,int n){
int cnt0=0,cnt1=0,cnt2=0;
for(int i=0;i<n;i++){
if(arr[i]==0){
cnt0++;
}else if(arr[i]==1){
cnt1++;
}
else{
cnt2++;
}
}
for(int i=0;i<cnt0;i++){... | ALGO | 0.99991 | 4.360778 |
77eeafa2-30b2-4526-b022-c1ad16d36b18 | abhilash1004/Competative_Coding | Binary_Search/xyz.cpp | #include<bits/stdc++.h>
#define int long long
using namespace std;
void count_min_near_cost(int a[],int n,int k)
{
int ans = 0;
int flag = 1;
for(int i=1;i<(1<<n);i++)
{
int temp = i,p = 0,tans = ~0;
//tans>>1;
while(temp)
{
//cout<<(temp&1);
if(temp & 1)
{
//
tans&= a[p];
}
temp=tem... | ALGO | 0.999907 | 4.658196 |
cdaaa1da-4b44-4c86-8cab-1b28b39cf336 | Nizam-VA/login-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 |
841db2aa-07da-48e5-8daa-386494aca28e | sukenori/Competitive_Programming-Solved_Code | AtCoder/AtCoder_Beginner_Contest/200/286/E.cpp | #include<bits/stdc++.h>
using namespace std;
int N; int64_t A[301];
pair<int,int64_t>d[301][301];
int main(){
cin>>N;
for(int i=1;i<=N;i++)cin>>A[i];
fill(d[0],d[N+1],make_pair(301,0));
string S; for(int i=1;i<=N;i++){
cin>>S; for(int j=1;j<=N;j++)if(S[j-1]=='Y')d[i][j]={1,-A[j]};
}
for(int k=1;k<=N;k++... | ALGO | 0.999795 | 3.83458 |
0972d4c3-a6c5-4816-a7fb-49bb16a239b8 | tingspain/IGATO | ext/keptoolbox/tests/propagate_taylor_jorba_test.cpp | #include <iostream>
#include <iomanip>
#include <boost/lexical_cast.hpp>
#include <boost/date_time/gregorian/gregorian.hpp>
#include <boost/date_time/posix_time/posix_time.hpp>
#include <boost/random.hpp>
#include "../src/keplerian_toolbox.h"
using namespace std;
using namespace kep_toolbox;
int main() {
// Preamble... | ALGO | 0.993788 | 5.507801 |
9cef89bb-5c40-47b2-9676-3e2b496546a2 | Jaskamalkainth/Codeforces | 104B.cpp | /*
* J1K7_7
*/
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <cstring>
#include <list>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <algorithm>
#include <functional>
#in... | ALGO | 0.999501 | 3.444868 |
ea8c5b42-dbf2-4588-9d76-303d4ca5e571 | heavenMOJANG/ICPC | .history/std_20250225165329.cpp | #pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
constexpr int INF = 0x7fffffff;
constexpr int N = 4e5 + 10;
const double PI = acos(-1.0);
double a[N];
void solve() {
int n, k; cin >> n >> k;
for (int i = 0; i < n; ++ i) {
... | ALGO | 0.999866 | 5.179062 |
b97517e6-0865-4440-97c2-b14ffa071820 | KobeDB/RealTimeRenderer | RealTimeRenderer/render_facilities.cpp | //
// Created by Kobe De Broeck on 11-3-2022.
//
#include "render_facilities.h"
#include <cmath>
#include <vector>
#include <limits>
#include "easy_image.h"
namespace KDBRenderFacilities {
using namespace std;
img::Color toEasyImgColor(NormColor c)
{
unsigned char red = c.r * 255;
unsig... | ALGO | 0.908559 | 5.865372 |
90d0c4e5-8c74-4643-ba33-4b83e3ae11f2 | erpranavknigam/CPP_Repository | Recursion/numberOfPathsPossibleInAMaze.cpp | #include<iostream>
using namespace std;
int countPaths(int size, int i, int j){
if(i == size-1 && j == size-1){
return 1;
}
if(i >= size || j >= size){
return 0;
}
return countPaths(size, i+1, j) + countPaths(size, i, j+1);
}
int main(){
int size;
cin >> size;
... | ALGO | 0.999733 | 4.36579 |
68946032-a753-43dc-97c9-66d7be4c60c2 | eufymake/eufyMake-PrusaSlicer-Release | AnkerStudio/src/libigl/igl/mosek/bbw.cpp | template <
typename DerivedV,
typename DerivedEle,
typename Derivedb,
typename Derivedbc,
typename DerivedW>
IGL_INLINE bool igl::mosek::bbw(
const Eigen::PlainObjectBase<DerivedV> & V,
const Eigen::PlainObjectBase<DerivedEle> & Ele,
const Eigen::PlainObjectBase<Derivedb> & b,
const Eigen::PlainObject... | ALGO | 0.999365 | 6.080972 |
8dcd851c-3334-449d-aebb-3f02be60677e | darkhorse07/cpp-lab | print a linked list.cpp | #include <iostream>
#include<stdlib.h>
using namespace std;
struct node
{
int data;
node* next;
};
node* start;
int main()
{
start =NULL;
int n,x,g;
cin>>n;
node* temp,*temp1;
for(int i=0;i<n;i++)
{
cin>>x;
temp=(node*)malloc(sizeof( node*));
temp->data=x;
... | ALGO | 0.999939 | 3.052828 |
74e89039-4b52-4f50-8a11-1a5fe887c19e | madeeryu/BELAJAR_KELAS_C | 22_Array/array.cpp | #include <iostream>
using namespace std;
int main(){
// Membuat array
int nilai[5];
nilai[0] = 0;
nilai[1] = 1;
nilai[2] = 2;
nilai[3] = 3;
nilai[4] = 4;
cout << &nilai[0] << " nilainya adalah: " << nilai[0] << endl;
cout << &nilai[1] << " nilainya adalah: " << nilai[1] << en... | ALGO | 0.968416 | 3.789252 |
979e6734-33bc-4f12-b22b-201d6d0960c2 | amoshyc/cp-code | codeforces/723/c.cpp | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int(x.size()))
const int MAX_N = 2000;
int N, M;
vector<int> a;
vector<int> u;
vector<int> cnt[MAX_N + 1];
int main() {
scanf("%d %d", &N, &M);
a.resize(N);
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
if (a[i] <= M)
cnt[a[i]].push_back(i)... | ALGO | 0.999981 | 3.376071 |
3ba07542-36fc-4483-a03b-3281c637f0e3 | nczhang88pan/KlotskiSGX | klotski/llvmProgram/libcxx/test/std/containers/sequences/vector/vector.cons/construct_size_value_alloc.pass.cpp | // <vector>
// vector(size_type n, const value_type& x, const allocator_type& a);
#include <vector>
#include <cassert>
#include "test_macros.h"
#include "min_allocator.h"
#include "asan_testing.h"
template <class C>
void
test(typename C::size_type n, const typename C::value_type& x,
const typename C::allocator... | TEST | 0.892713 | 6.512844 |
36e795fa-602a-4e4f-8fe4-ea5ab3caeb26 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_11521_129.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n & 2 == 0) {
cout << "Mahmoud";
} else {
cout << "Ehab";
}
return 0;
}
| ALGO | 0.999958 | 4.130992 |
68eb349f-96cd-4c73-80a0-99fa78eb3d5f | ta-061/Atcoder_review | rating-contest/ABC383/D_ES.cpp | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using vi = vector<int>;
using vl = vector<long>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvll = vector<vll>;
using vs = vector<string>;
using pii = pair<int, int>;
#define O... | ALGO | 0.999953 | 4.122645 |
c40f62fc-99e3-4a26-a4b9-7663341c10c5 | ishandutta2007/codeforces | alexandr_ts/normal/373/A.cpp | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr(i, n) for (int i = 0; i < n; ++i)
#define frab(i, a, b) for (int i = a; i < b; ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 3e3 + 10;
const ll INF = 2e9;
const ll ALPH = 300;
const int MOD = 1e9 + 7... | ALGO | 0.999703 | 3.65349 |
2e0ea5b8-350f-4b1e-b258-9926f768f504 | ThoseBygones/ACM_Code | CodeForces/CodeForces 727A.cpp | #include <iostream>
using namespace std;
int main()
{
int a,b,c,ans[30],cnt=0;
cin >> a >> b;
c=b;
for(cnt=0; b!=a; )
{
if(b && b%2==0)
b>>=1;
else if(b%10==1)
b/=10;
else
{
cout << "NO" << endl;
return 0;
}
... | ALGO | 0.999992 | 3.465928 |
5b920149-97d2-421f-b846-8729c02eeebd | shadowfax11/pbrt | pbrt-v3/src/core/microfacet.cpp | // core/microfacet.cpp*
#include "microfacet.h"
#include "reflection.h"
namespace pbrt {
// Microfacet Utility Functions
static void BeckmannSample11(Float cosThetaI, Float U1, Float U2,
Float *slope_x, Float *slope_y) {
/* Special case (normal incidence) */
if (cosThetaI > .9999)... | ALGO | 0.999876 | 7.155672 |
745626f1-d04b-481b-bfcb-3accce5dd414 | iamsahilkansal/LeetCode-Solutions | 1630-count-odd-numbers-in-an-interval-range/1630-count-odd-numbers-in-an-interval-range.cpp | class Solution {
public:
int countOdds(int low, int high) {
int cnt=0;
for(int i=low; i<=high; i++){
if(i%2!=0){
cnt++;
}
}
return cnt;
}
}; | ALGO | 0.999816 | 5.269393 |
3979707e-536f-4d36-887e-00a83ef47839 | mingyangSunshine/cmake_demo | src/methods.cpp | #include <limits>
#include "methods.h"
int add_int(int a, int b) {
if (a > INT32_MAX - b) {
return INT32_MAX;
}
return (a + b);
}
int minus_int(int a, int b) {
if (a < INT32_MIN + b) {
return INT32_MIN;
}
return (a - b);
}
| TOOL | 0.917867 | 5.925389 |
8030febc-d147-4c97-8c58-0c9b0a54e751 | Evelyn-XuX/cs130b_prog1 | test33.cpp | #include <iostream>
#include <fstream>
#include <vector>
#include <map>
#include <utility>
using namespace std;
class CheckOddEven {
public:
int bin[2][2] = {{ -1, -1 }, { -1, -1 }};
int getBit(int i,int j );
void setBit(int i,int j,int p );
};
int CheckOddEven::getBit(int i,int j){return bin[i & 1][j & ... | ALGO | 0.999981 | 4.185836 |
e58b4e35-ef5f-4e30-ae04-5d3f1c9fe521 | hieupham1103/TINHOC | ONLINE OJ/VNOJ/Problems/substr/substr.cpp | #include"bits/stdc++.h"
#define int long long
#define double long double
#define ii pair <int,int>
#define fi first
#define se second
#define endl '\n'
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
const int maxN = 1e6 + 10;
int a[maxN];
int b[maxN];
int p[maxN];
int auto... | ALGO | 0.999918 | 4.028488 |
e35b8204-c61f-40ad-8b8a-07a47d3bae57 | bioyoshoo/atcoder | Boot-camp/Hard-lap3/43.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int INF = 1e8;
template<class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
else return false;
}
int main() {
int H, W; cin >> H >> W;
vector<vector<int>> dp(10, vect... | ALGO | 0.999885 | 3.997715 |
432d3a97-68e4-44d2-a68b-b6594ac28db8 | Yamada4711/20241119_Blackjack | player.cpp | // 20241126 ύX_
// J[ḧύX
// JԂs鏈
#include "player.h"
#include <iostream>
using namespace std;
void Player::PlayerPlay(const int i, Deck* deck)
{
int state = PLAY;
bool burst = false;
if (pullNum == SECOND)
{
burst = CollectResult(i);
state = Question();
}
while (!burst && state != QUIT)
{
for (int j... | TOOL | 0.978427 | 3.994977 |
547b407e-15b1-4b46-9b3d-b419ecf89f52 | syedmahihossen/luvlearning | class3/hrank_string.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
string a, b;
cin >> a >> b;
cout << a.size() << " " << b.size() << "\n";
string full = a;
for (int i = 0; i < b.size(); i++)
{
full.push_back(b[i]);
}
cout << full << "\n"... | ALGO | 0.999878 | 4.25655 |
1e7aedb8-9e67-4f04-a9ad-b5cc308095e3 | forkee/Pawcoin | src/kernel.cpp | #include <boost/assign/list_of.hpp>
#include "kernel.h"
#include "txdb.h"
using namespace std;
typedef std::map<int, unsigned int> MapModifierCheckpoints;
// Hard checkpoints of stake modifiers to ensure they are deterministic
static std::map<int, unsigned int> mapStakeModifierCheckpoints =
boost::assign::map_l... | ALGO | 0.989484 | 5.8142 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.