uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
4d5a3300-b61e-46ba-bc6a-3afa5c1ce80c | ishandutta2007/codeforces | pllk/normal/305/E.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
string s;
int n;
int g[5050];
vector<pair<int,int>> z;
int main() {
for (int i = 1; i < 5050; i++) {
int m[5050] = {0};
for (int j = 0; j < i; j++) {
int u = g[max(j-1,0)]^g[max(i-j-2,0)];
m[u]... | ALGO | 0.999968 | 3.429842 |
00112866-02b0-469a-81d5-779c7e9cd7d7 | Piyush-io/Cpp | 2727-number-of-senior-citizens/number-of-senior-citizens.cpp | class Solution {
public:
int countSeniors(vector<string>& details)
{
int count = 0;
for(string x : details)
{
int tens = x[11] - '0';
int units = x[12] - '0';
int age = tens * 10 + units;
if(age > 60)
count++;
}
... | ALGO | 0.998407 | 6.318288 |
d5e3cbea-565d-423f-ba10-c6f0280fa3c1 | 60akramuddoula/ALGORITHM- | Week 2/Module 7 BFS/Components.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> adj[N];
bool visited[N];
void dfs(int u, int &cnt)
{
visited[u] = true;
cnt = cnt + 1;
for (auto v : adj[u])
{
if (visited[v])
continue;
dfs(v, cnt);
}
}
int main()
{
int n;
cin ... | ALGO | 0.999943 | 5.070444 |
d107a46e-933c-481b-9985-e4662b8eb4d2 | lucasxia01/Competitive-Programming-Problems | ICPC/ICPC Winter Break 2021 Practice 3/ICPC Winter Break 2021 Practice 3/I.cpp | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <complex>
#include <iterator>
#include <regex>
#include <fstream>
#include <utility>
#include <vector>
#include <string>
#include <cstring>
#include <stack>... | ALGO | 0.999846 | 4.491142 |
5753cb4f-c41b-4e62-a750-c8d32683be81 | Anamika2416/Assignment-31 | a31q6.cpp | /*
Write a C++ program to demonstrate how a common friend function can
be used to exchange the private values of two classes. (Use call by
reference method).
*/
#include<iostream>
using namespace std;
class B;
class A
{
int num1;
public:
A()
{
num1=10;
}
void show()
{
cout<<endl<... | ALGO | 0.960503 | 6.225163 |
8428561b-f2cf-4d59-9847-2aa940ae26a6 | DevHub-iLab/Advent-of-Code-2024 | anAcc22/day_20/part_02.cpp | #include <bits/stdc++.h>
// #include <fmt/ranges.h> // WARN: remove before submission
using namespace std;
namespace R = ranges;
auto rng(auto l, auto r, int o = false) { // NOTE: enabling 'o' implies <=
assert(l <= r); return R::iota_view(l, r+o);
}
auto gnr(auto r, auto l) { return R::reverse_view(rng(l, r+1)); ... | ALGO | 0.999786 | 4.977037 |
37086ed3-6b1b-43c2-b7c9-45d618198a72 | re-esper/BunnyMarkGame | VulkanBunnyMark/base/VulkanTools.cpp | #include "VulkanTools.h"
namespace vks
{
namespace tools
{
bool errorModeSilent = false;
std::string errorString(VkResult errorCode)
{
switch (errorCode)
{
#define STR(r) case VK_ ##r: return #r
STR(NOT_READY);
STR(TIMEOUT);
STR(EVENT_SET);
STR(EVENT_RESET);
STR(INCOMPLETE);
STR(... | TOOL | 0.895865 | 6.742738 |
7c313dd3-9732-470d-8814-1c5d6ed6c7ce | qualificationalitated/Start_git | Algorithm/12000~12999/12919/12919.cpp | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
bool answer(string s, string t){
bool p = false;
if(s.length() == t.length()) return s==t;
else{
if(p == false && t[t.length()-1]=='A'){
t.pop_back();
if(answer(s,t)) p = true;
t.push_back('A');
}
if(p == false && t[0]=='B... | ALGO | 0.999983 | 4.243681 |
e3c6a147-0e49-4f79-9dd1-607824a32132 | derp-caf/frameworks_av | media/libaudioprocessing/AudioResamplerSinc.cpp | #define LOG_TAG "AudioResamplerSinc"
//#define LOG_NDEBUG 0
#define __STDC_CONSTANT_MACROS
#include <malloc.h>
#include <pthread.h>
#include <string.h>
#include <stdlib.h>
#include <dlfcn.h>
#include <cutils/compiler.h>
#include <cutils/properties.h>
#include <utils/Log.h>
#include <audio_utils/primitives.h>
#inclu... | ALGO | 0.93819 | 5.888026 |
1bf4bfb6-a264-48ac-ad43-9b3ba694e55a | MimPe9/Bioinformatics_course | 1.1 Pattern Count Problem/1.1 Pattern Count Problem/1.1 Pattern Count Problem.cpp | #include <iostream>
using namespace std;
int main() {
int k = 0;
string pattern;
cin >> pattern;
string text;
cin >> text;
for (int i = 0; i < text.length() - pattern.length() + 1; i++)
{
if (text.substr(i, pattern.length()) == pattern)
k++;
}
cout << k;
ret... | ALGO | 0.999873 | 4.831012 |
798e1c72-9dab-486a-a495-0025f9762157 | ishandutta2007/codeforces | frame233/normal/1034/A.cpp | // Author -- Frame
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<iostream>
#define lowbit(x) ((x)&(-x))
#define Finline __inline__ __attribute__ ((always_inline))
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
typedef lon... | ALGO | 0.99998 | 3.285437 |
b9106c90-9c5f-413c-8057-22b3fdce5fb6 | nikhilmehlan/Dsa | Difficulty: Easy/Prime Factors/prime-factors.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
vector<int>AllPrimeFactors(int N) {
// Code here
vector<int> ans;
for(int i=2;i*i<=N;i++){
if(N%i==0){
ans.push_back(i);
}
while(N%i==0){
... | ALGO | 0.999374 | 6.139838 |
f8a2dc60-2611-4054-a949-82d5202233bc | sangmin7b/algorithm | problems/25077.cpp | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
#define SZ 200'005
int dsu_size[SZ];
int parent[SZ];
int dsu_find(int x){
if(parent[x] != x){
... | ALGO | 0.99955 | 5.031945 |
c14031f7-d46d-4401-a6c4-5dc9751b3b55 | dufrdigital/gigaddikcoin | src/pubkey.cpp | #include "pubkey.h"
#include <secp256k1.h>
#include <secp256k1_recovery.h>
namespace
{
/* Global secp256k1_context object used for verification. */
secp256k1_context* secp256k1_context_verify = nullptr;
} // namespace
/** This function is taken from the libsecp256k1 distribution and implements
* DER parsing for EC... | TOOL | 0.929538 | 7.434718 |
90c13afc-b950-434f-8e24-b0dfaed38e76 | Tony199110/PAT-Practice | 1045 Favorite Color Stripe.cpp | # define _CRT_SECURE_NO_WARNINGS
# include <iostream>
# include <vector>
# include <queue>
# include <map>
# include <set>
# include <algorithm>
# include <string>
# include <cstring>
# include <cctype>
# include <cmath>
# include <cstdio>
using namespace std;
int book[201], a[10001], dp[10001];
int d[10001];
int mai... | ALGO | 0.999962 | 3.255915 |
e09ac00f-bb5c-42fc-ab90-ac7c76569230 | abtahi2024/data-structure_practice_2025 | module_9/Doubly_input.cpp | #include<bits/stdc++.h>
using namespace std;
class Node
{
public:
int val;
Node*next;
Node*prev;
Node(int val)
{
this->val=val;
this->next=NULL;
this->prev=NULL;
}
};
void doubly_tail(Node*& head,Node*& tail,int val)
{
Node* newtail=new Node(val);
if(head==NUL... | ALGO | 0.998497 | 4.435201 |
768927c7-9417-43a4-98b0-f0a7ef511f55 | blockplanet/blockplanet | src/voxelalgorithms.cpp | #include "voxelalgorithms.h"
#include "nodedef.h"
namespace voxalgo
{
void setLight(VoxelManipulator &v, VoxelArea a, u8 light,
INodeDefManager *ndef)
{
for(s32 x=a.MinEdge.X; x<=a.MaxEdge.X; x++)
for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
{
v3s16 p(x,y,z);
MapNo... | ALGO | 0.991022 | 6.775505 |
16ca19fb-2092-45bb-b0c7-d876c113eb01 | C0D1NG/Programming | C++/Abhishek-2k19_Factors_of_a_Number.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<long long> output;
long long x;
cin>>x;
for(long long i = 1;i<=x;i++){
if(x%i==0){
output.push_back(i);
}
}
cout<<"Factors of the given number are:"<<endl;
for(long long i =0;i<output.size();i++){
... | ALGO | 0.999562 | 3.756921 |
93797b48-8579-41f6-ae6a-6173d4424b6c | ishandutta2007/codeforces | ei133333/normal/736/A.cpp | #include<bits/stdc++.h>
using namespace std;
using int64 = long long;
int main()
{
int64 N;
cin >> N;
int64 dp[1000];
dp[1] = 1;
dp[2] = 1;
for(int i = 3; i < 1000; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
int ret = 1;
while(dp[ret] <= N) ++ret;
cout << ret-3 << endl;
} | ALGO | 0.999917 | 3.370627 |
020391f2-3a6c-4039-b95f-ae8b2e19c97f | dineshkumar071/hackerearth | fact.cpp | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a=1,n,i;
cin>>n;
for(i=1;i<=n;i++){
a=a*i;
}cout<<a;
}
| ALGO | 0.999955 | 4.439089 |
8d79799a-dc5c-46bb-97e5-8317eea432d5 | muhmmadshaban/COER- | q19.cpp | /*Question 19: Given two strings s1 and s2, write a function to find the length of the longest concatenated string formed by taking one substring from each string.1
Input: "abc", "def"
Output: 6
*/
#include<iostream>
using namespace std;
int lenght(string s1,string s2){
int size1=s1.size();
int size2=s2.size(... | ALGO | 0.97179 | 4.323474 |
c2cca696-fe97-4d3a-98cf-3d2d4b5d5982 | bit-yl/leetcode | leetcode_448_Find_All_Numbers_Disappeared_in_an_Array/src/main.cpp | /*
* main.cpp
*
* Created on: Mar 26, 2017
* Author: yl
*/
/*
*
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements of [1, n] inclusive that do not appear in this array.
Could you do it without extra space and in O(n)... | ALGO | 0.99736 | 5.273382 |
9c6a06f6-500e-4a4b-aad5-9e591e5e03a6 | HaoyuanLiuHZPH/mycopy | XiangShan/yunsuan/src/test/csrc/golden_model/vector_integer_aluF.cpp | #include "../include/gm_common.h"
#include <assert.h>
VecOutput VGMIntegerALUF::get_expected_output(VecInput input)
{
VecOutput output;
output = get_output_vialuF(input);
return output;
}
VecOutput VGMIntegerALUF::get_output_vialuF(VecInput input)
{
VecOutput output;
// get format
int formatOH = (input.fu... | TOOL | 0.861347 | 4.096558 |
a165a4c7-6401-468d-9f65-5f282cdd2365 | WFCSC112AlqahtaniFall2019/project6-nichsr18 | InsertionSort.cpp | #include <iostream>
#include <vector>
#include<cassert>
#include<ctime>
#include "BinaryInsertionSort.h"
#include "LinkedList.h"
#include "Node.h"
using namespace std;
int main() {
int seed, length;
bool validL=false;
LinkList list;
//cout<<"Please enter seed and length"<<endl;
/*cin >> seed;
... | TEST | 0.998392 | 5.124112 |
4d2c9e4c-3f26-4046-ab27-7afed7f9e533 | raincross7/code-similarity | codes/train_code/problem263/problem263_87.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int h,w;
cin>>h>>w;
string arr[h];
for(int i=0;i<h;i++)
cin>>arr[i];
int prerow[h][w];
int precol[h][w];
int sufcol[h][w];
int sufrow[h][w];
for(int i=0;i<h;i++)
{
prerow[i][0]=-1;
sufrow[i][w-1]=w;
if(arr[i][0]=='#')
pr... | ALGO | 0.999671 | 3.765968 |
6d929315-fd20-485f-8215-f38618b69d83 | Khaled-Amin-Shawon/XPSC | Week 06/Day 01/Rectangular_Tiling.cpp | #include <iostream>
using namespace std;
int main() {
// your code goes here
int t;
cin>>t;
while(t--){
long long int w,l;
cin>>w>>l;
if(w%2==0 || l%2==0){
cout<<"YES\n";
}
else{
cout<<"NO\n";
}
}
return 0;
}
| ALGO | 0.999128 | 3.851743 |
3563ace2-c870-467a-b806-307c443ef800 | mihir-prakash/leetcode-solutions | 5.Backtracking/lc78_subsets.cpp | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
using namespace std;
class Solution {
public:
void subsetsHelper(vector<int>& nums, int... | ALGO | 0.999771 | 5.305929 |
5fc21974-c190-46e9-9b9c-821316fd59c2 | DownUnderCTF/Challenges_2022_Public | rev/artisan/src/third_party/nana/source/gui/filebox.cpp | #include <iostream>
#include <nana/gui.hpp>
#include <nana/gui/filebox.hpp>
#include <nana/filesystem/filesystem_ext.hpp>
#if defined(NANA_WINDOWS)
# include <windows.h>
# include "../detail/mswin/platform_spec.hpp"
# ifndef NANA_MINGW //<Shobjidl.h> isn't supported well on MinGW
# include <Shobjidl.h>
# else
# inc... | TOOL | 0.85406 | 6.106525 |
c77876d5-83c7-4f02-9364-7cf084487117 | sjj118/OI-Code | BZOJ/3669/code.cpp | #include<iostream>
#include<cstdio>
#include<algorithm>
#define maxn 200000
#define lson son[k][0]
#define rson son[k][1]
#define ws(k) (son[pa[k]][1]==k)
#define canrot(k) (pa[k]&&(son[pa[k]][0]==k||son[pa[k]][1]==k))
#define inf 1e9
using namespace std;
int n,m,ans;
int read(){
int tmp=0;
char c=getchar();
while... | ALGO | 0.999978 | 3.898777 |
0323691c-6d3e-4245-b45b-5765279fe7da | vaibhavsinghz/DSA-QA | delete-node-in-a-bst/delete-node-in-a-bst.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.999984 | 6.471916 |
92edbb56-d8c3-40f6-a9f8-518cb461a207 | OleksandrYu/University | First term/Laba7_task2/main.cpp | #include <iostream>
using namespace std;
struct fraction{//дріб
double num; //чисельник
double denom; //знаменник
double ans;
};
struct complex_fraction{
double real_1, imag_1, real_2, imag_2, denom, real_ans, imag_ans;
};
double divide (fraction a){
a.ans = a.num/a.denom;
return a.ans;
}... | ALGO | 0.956389 | 4.393074 |
8c032bac-685b-4ee7-bbb7-e8c288a74958 | Abhiroop25902/Apna-College-Cpp-Course | 23_Stack/23.extra_LLstack.cpp | #include <iostream>
using namespace std;
template <typename T>
class stack
{
struct node
{
T data;
node *next;
};
node *top;
node *make_new_node(const T &val)
{
node *new_node = new node;
new_node->data = val;
new_node->next = nullptr;
return ne... | ALGO | 0.994946 | 5.134514 |
df38bcce-3ca6-42f6-84a9-040a52965fa1 | MPSLab-ASU/ccf | gem5/src/systemc/tests/systemc/misc/v1.0/dash3/pulse.cpp | /*****************************************************************************
pulse.cpp -- Implementation of the pulse generator.
Original Author: Ali Dasdan, Synopsys, Inc.
*****************************************************************************/
/*****************************************************... | TOOL | 0.873947 | 6.367835 |
a6f8389a-0b40-4b37-9297-ec49011bf79c | yfliu017258/CPP_programs | UVA/已通過/uva10300.cpp | #include<iostream>
using namespace std;
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
int t;
cin>>t;
while(t--)
{
int f,sum=0,area,animal,environment;
cin>>f;
while(f--)
{
cin>>area>>animal>>environment;
sum+=area*environment;
}
cout<<sum<<'\n';
}
return 0;
}
| ALGO | 0.991095 | 3.712347 |
2a178340-b274-463d-9391-fdc5f3ff4983 | Fazziekey/leetcode | sword to offer/20表示数值的字符串.cpp | class Solution {
public:
enum State {
STATE_INITIAL,
STATE_INT_SIGN,
STATE_INTEGER,
STATE_POINT,
STATE_POINT_WITHOUT_INT,
STATE_FRACTION,
STATE_EXP,
STATE_EXP_SIGN,
STATE_EXP_NUMBER,
STATE_END,
};
enum CharType {
CHAR_N... | ALGO | 0.998684 | 5.237856 |
31453f37-f44a-46c5-8186-c788dadf7abe | rajeevverma25/DSA | Heaps/Klargest.cpp | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
void printMinheap(priority_queue<int , vector<int>, greater<int>> minheap)
{
while(!minheap.empty()){
cout<<minheap.top()<<" ";
minheap.pop();
}
cout<<endl;
}
int main()
{
priority_queue<int , vector<int>, greater<int... | ALGO | 0.999944 | 3.796813 |
c3935a23-8baa-41f6-90d4-40078abae55f | adirastogi/ai_mps | search_algorithms.cpp | #include <queue>
#include <iostream>
#include <cstring>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <string>
#include <cassert>
using namespace std;
#define W '%'
#define E '_'
#define D '.'
#define V '$'
#define Q 'Q'
#define MAZE_VAL(a,c) a[c.y][c.x]
int M,N;
struct co... | ALGO | 0.999964 | 4.393371 |
8809b461-b0db-47e3-9f7b-3c39a34410cd | DuNai0524/algorithm_solving | leetcode/cpp/contests/contest398/B.cpp | #include <bits/stdc++.h>
using namespace std;
// contest code
vector<bool> isArraySpecial(vector<int>& nums, vector<vector<int>>& queries) {
int n = nums.size();
int m = queries.size();
vector<bool> ans(m,false);
if(n == 1){
for(int i = 0; i < m; i++)ans[i]=true;
return ans;
}
... | ALGO | 0.999876 | 4.849058 |
c773b49c-143e-4a88-b030-f9920d1db3e9 | ishandutta2007/codeforces | aid/normal/616/D.cpp | #include <iostream>
using namespace std;
const int MAXN = 500 * 1000 + 5, MAXX = 1000 * 1000 + 5;
int a[MAXN], nxt[MAXN], lst[MAXX], st[4 * MAXN];
void buildst(int v, int tl, int tr) {
if(tl == tr - 1) {
st[v] = a[tl];
return;
}
int tm = (tl + tr) / 2;
buildst(2 * v, tl, tm);
buil... | ALGO | 0.999992 | 4.68011 |
656ee879-3844-46df-84d8-10579d26e723 | 10simoes/aulaDia11-09 | forc.cpp | #include<stdio.h>
main(){
int num = 100;
int contador;
int res;
for(contador = 0; contador <=10; contador++){
res= num * contador;
printf("\n %d x %d = %d",num, contador, res);
}
printf("\nFim do loop");
}
| ALGO | 0.988924 | 3.358929 |
34c96693-6a33-4445-a797-86e027bfd4f1 | nier0525/SchoolAssignment | Assignment/1학년 2학기/C++/181214/도서대여/BookManager.cpp | #include "BookManager.h"
cBookManager::cBookManager() {
memset(mBooklas, 0, sizeof(mBooklas));
mCount = 0;
initelize();
}
void cBookManager::initelize() {
char code[BOOKCODE];
sprintf(code, "10%d", mCount);
cBook* ptr = new cBook("C++", code, 5);
mBooklas[mCount++] = ptr;
sprintf(code, "10%d", mCount);
cBoo... | TOOL | 0.890253 | 3.206441 |
b484bd03-639a-4de6-b3bd-e9ace4572757 | Kanita-Haider/CP-Codes | cpp/adjacency matrix.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
// n is the number of vertices
// m is the number of edges
int n, m;
cin >> n >> m;
int adj[n + 1][n + 1];
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++)
adj[i][j]=0 ;
}
for (int i = 0; i < m; i++) {
... | ALGO | 0.99998 | 4.3168 |
61485b6a-9af4-4210-ad00-f111df066921 | tommix626/UnrealEngine-release | Engine/Plugins/Experimental/ControlRig/Source/ControlRig/Private/Math/Simulation/CRSimSoftCollision.cpp | #include "Math/Simulation/CRSimSoftCollision.h"
float FCRSimSoftCollision::CalculateFalloff(const FCRSimSoftCollision& InCollision, const FVector& InPosition, float InSize, FVector& OutDirection)
{
const FTransform& Transform = InCollision.Transform;
float Distance = 0.f;
OutDirection = FVector::ZeroVector;
swit... | ALGO | 0.997351 | 5.090586 |
f8139bb8-7184-4568-907a-211174b7f415 | kundannitt/DSA | bitwise/oddoccur.cpp | //x^x=0;
//0^x=x;
//x^y=x^y
//!! this works only for only one odd appearing element!!
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> a(n);
for(auto &i:a) cin>>i;
int x=0;
for (int i=0;i<n;i++)
{
x=x^a[i];
}
cout<<x;
return 0;
} | ALGO | 0.999984 | 4.283198 |
81f8161e-c858-416d-a95e-85e5f8622646 | aritra741/Competitive-Programming | Codeforces/SuperheroTransformation.cpp | #include <bits/stdc++.h>
using namespace std;
int isVowel( char c )
{
if( c=='a' )
return 1;
if( c=='e' )
return 1;
if( c=='i' )
return 1;
if( c=='o' )
return 1;
if( c=='u' )
return 1;
return -1;
}
int main()
{
string s,t;
cin>>s>>t;
bool v... | ALGO | 0.999989 | 5.108053 |
4bfd26bc-38d4-44d0-9081-2b3b6c1de68f | nns503/ProblemSolving_NS_CPP | 프로그래머스/2/17684. ［3차］ 압축/［3차］ 압축.cpp | #include <bits/stdc++.h>
using namespace std;
int lastIndex = 27;
vector<int> solution(string msg) {
vector<int> answer;
map<string, int> m;
string alp = "A";
for(int i=1; i<=26; i++){
alp = 'A' + i - 1;
m[alp] = i;
}
for(int st=0; st<msg.size();){
int prv = 0;
... | ALGO | 0.999964 | 4.907639 |
6c8aa05d-1389-4307-b664-725b5a988c83 | OneBitPython/Codeforces | CodeTon4/B_Candies.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define all(c) c.begin(), c.end()
#define endl "\n"
const double PI=3.141592653589;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << ... | ALGO | 0.999522 | 4.443939 |
e261e5dc-3fed-4353-b30b-85d74bb21986 | walidabdulhakim/yamd | subprojects/eigen-3.4.0/doc/examples/Tutorial_BlockOperations_colrow.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace std;
int main()
{
Eigen::MatrixXf m(3,3);
m << 1,2,3,
4,5,6,
7,8,9;
cout << "Here is the matrix m:" << endl << m << endl;
cout << "2nd Row: " << m.row(1) << endl;
m.col(2) += 3 * m.col(0);
cout << "After adding 3 times the first colu... | ALGO | 0.985764 | 3.576145 |
8941bd88-8da7-4bee-b9ef-2649858d4e29 | vrajIT210/tops-data | Module 4 Assignment/Basic concept of OOPS/que 14.cpp |
#include<iostream>
using namespace std;
class cricketer{
public:
double total_runs;
double average_runs;
double performance;
};
class batsman:public cricketer{
public:
int sum;
input(){
cout<<"enter run for 5 innings"<<endl;
for(int i=1;i<=5;i++)
{
cin>>total_runs;
}
sum+=tot... | TOOL | 0.941233 | 5.225472 |
32856fd8-ebcf-46b1-8189-ed928f87fedf | Gurpreetsingh9465/Cp-And-Leetcode | old/reverse.cpp | #include<bits/stdc++.h>
using namespace std;
int myAtoi(string str) {
long long sum = 0;
int isNegative = 1;
bool alreadyUsed = false;
for(int i=0;i<str.length();i++) {
int val = (int)str[i];
if(val == 45) {
isNegative = -1;
}else if(val>=48 && val<=57) {
... | ALGO | 0.996333 | 4.107633 |
2117343c-87cc-4fa6-a60a-fe54ea72f38a | heavenMOJANG/ICPC | .history/Codeforces/CF1993/B_20240804230319.cpp | #pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define int long long
using namespace std;
constexpr int INF = 0x7fffffff;
void solve() {
int n; cin >> n;
priority_queue<int, vector<int>, greater<int>> a, b;
priority_queue<int, vector<int>, le... | ALGO | 0.999904 | 3.730587 |
2d1afea8-8691-469d-9ee0-43feb578f40b | al-ry/AutomataTheory | LL(1)/LLGenerator/Generator.cpp | #include "Generator.h"
#include <iterator>
std::vector<std::string> GetGuideSetForRule(Grammar &grammar, std::string nonterminal)
{
std::vector<std::string> guideSet;
for (auto &rule : grammar)
{
if (rule.left == nonterminal)
{
std::copy(rule.guideSet.begin(), rule.guideSet.end(), std::back_inserter(guideSe... | TOOL | 0.878173 | 3.315466 |
80f0061c-ef1d-43ba-812a-d14463f35a9a | sarvex/leetcode-haxe | solution/1500-1599/1599.Maximum Profit of Operating a Centennial Wheel/Solution.cpp | class Solution {
public:
int minOperationsMaxProfit(vector<int>& customers, int boardingCost, int runningCost) {
int ans = -1;
int mx = 0, t = 0;
int wait = 0, i = 0;
while (wait || i < customers.size()) {
wait += i < customers.size() ? customers[i] : 0;
int u... | ALGO | 0.999874 | 5.649698 |
e6c01f28-51a7-4c72-ac49-4a6f1347d5b2 | ScriptxRajesh/CF | C_Quests.cpp | // Rajesh :: TLTW
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,... | ALGO | 0.999964 | 3.918154 |
3816dce9-5478-4c9e-98d7-708419c927d1 | sicongyu/Unreal-Lightmass-SH-based-GI | Engine/Plugins/Experimental/GeometryProcessing/Source/GeometricObjects/Private/IndexUtil.cpp | #include "Util/IndexUtil.h"
// integer indices offsets in x/y/z directions and diagonals
const FVector3i IndexUtil::GridOffsets26[] =
{
// face-nbrs
FVector3i(0, 0,-1), FVector3i(0, 0, 1),
FVector3i(-1, 0, 0), FVector3i(1, 0, 0),
FVector3i(0,-1, 0), FVector3i(0, 1, 0),
// edge-nbrs (+y, 0, -y)
FVector3i(1, 1, 0... | TOOL | 0.864172 | 7.045006 |
725c7b33-a77b-4cad-b3fc-8d5e9a57e7de | samiullahsaleem/cyberblock | C++/File folder/Run.cpp | #include <iostream>
using namespace std;
int main()
{
const int NUM_FISH = 20;
int fish[NUM_FISH];
int x;
cout <<"user is going to enter how many fishes were caught by each fisherman "<<endl;
cout <<"enter fishes caught by fisherman"<<endl;
for (int i=0;i<20;i++)
{
cin >>fish[i];
//also can be done in this way
//cin... | TOOL | 0.995639 | 3.44823 |
0df74da3-3521-4aae-ae17-0a63661a2759 | youssefmohammed03/C_compiler | ParseTree.cpp | #include <iostream>
#include <vector>
#include <string>
using namespace std;
class ParseTreeNode {
public:
string type;
vector<ParseTreeNode*> children;
bool isTerminal = false;
ParseTreeNode(string type) : type(type) {}
void addChild(ParseTreeNode* child) {
children.push_back(child);
... | ALGO | 0.980705 | 4.478663 |
3e167f73-a1f8-46ce-a4ea-1d5183e22e86 | aplqo/exercises | loj/2043-KFarPair.cpp | #ifdef APTEST
#include "debug_tools/judge.h"
#endif
#include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <queue>
const unsigned int maxn = 1e5;
enum { X = 0, Y = 1 };
typedef std::array<unsigned int, 2> Point;
inline unsigned long long distance(const Point& l, const Point& r)
{
stati... | ALGO | 0.999898 | 4.47648 |
6f61e6bd-71c3-4197-8f15-e9ab037460f6 | al3sha9/cpp-1 | 3rd semester/labtask_fazi/labtask6/6.cpp | #include <iostream>
#include <string>
using namespace std;
class Node {
public:
string message;
Node* next;
};
class TransmitMessage {
public:
string sender;
string Reciever;
string message;
TransmitMessage(string sender, string Reciever, string message) {
this->sender = sender;
this-... | ALGO | 0.954549 | 5.352159 |
3195385b-3da4-4f4a-8388-2208b11d9c67 | capnmav77/Core-Programming | STL/DSA/Greedy/Maximum Bags With Full Capacity of Rocks.cpp | /*
MY YOUTUBE VIDEO ON THIS Qn : https://www.youtube.com/watch?v=JpQaui_-a4c
Company Tags : <soon>
Leetcode Link : https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/
*/
//Filling the least one first : O(nlogn)
class Solution {
public:
int maximumBags(ve... | ALGO | 0.999467 | 5.813632 |
8ff92364-e1c9-4aa8-8d9b-fe861fd42ee5 | vikashkrdeveloper/CodeForce-Solved-Problem | Educational_CodeForces_Round_171_Rated_For_Div_@/Perpendicular_Segments_A.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int X, Y, K;
cin >> X >> Y >> K;
int Ax = 0, Ay = 0;
int Bx = K, By = 0;
if (Bx > X)
{
Ax = X - K;
Bx = X;
}
int Cx = 0, Cy =... | ALGO | 0.999373 | 3.349035 |
e66b79e3-3df1-436e-8153-24e94449a19d | Kensukeken-Lounge/Cpp-ProgrammingResources | Factorial/loop.cpp | #include <iostream>
int factorial(int n) {
if(n<0)
return(-1); /*Wrong value*/
if(n==0)
return(1); /*Terminating condition*/
else
{
return(n*factorial(n-1));
}
}
int main() {
// Grab Input
printf("Enter a number: ");
int num;
scanf("%d", &num);
... | ALGO | 0.999501 | 4.861004 |
51847c9e-a0dd-4d67-bdee-e757ec1726f6 | lybabymoon/dailyPractice | practice191110/practice191110/main1.cpp | #include<iostream>
#include<string>
using namespace std;
bool isPalindrome(string s) {
if (!s.size())return true;
int i = 0, j = s.size() - 1;
for (; i<j;)
{
if (ispunct(s[i]) || isspace(s[i])){ ++i; continue; }
if (ispunct(s[j]) || isspace(s[j])){ --j; continue; }
if (tolower(s[i]) == tolower(s[j])){ ++i, --... | ALGO | 0.999114 | 3.705833 |
6a90fe21-42c7-4d97-a02b-234b99203bc3 | matiego1/sio2 | Kółko 2 (22-23)/bsp.cpp | #include <iostream>
#include <vector>
using namespace std;
const int MAX = 1000 * 1000;
vector<pair<int, int>> graf[MAX + 1];
int roz[MAX + 1];
long long DP[MAX + 1];
long long wynik[MAX + 1];
void DFS_roz(int v, int o) {
int wynik = 1;
for (pair<int, int> syn : graf[v]) {
if (syn.first != o) {
DFS_roz(syn.fi... | ALGO | 0.999856 | 4.439018 |
79abecb6-4acb-4507-a70f-83215fd213fe | Abdumbo99/BST | analysis.cpp | #include "analysis.h"
#include <algorithm>
/**
* Title : Binary Search Trees
* Author : ABDULRAZAK DAHERKHATIB
* ID: 21801340
* Section : 001
* Assignment : 2
* Description :cpp file for the analysis file we only provide the headers of necessary functions here
*/
void createfillArray(int* arr) {
for (int i = 0; i < ... | TEST | 0.996167 | 4.369882 |
127821fa-3575-439a-877a-ca7f1b3c6ff3 | sourav600/Problem-Solving | CSES/StaticRangeSumQueries.cpp | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define nl '\n'
#define pi acos(-1)
#define ll long long
#define For(i,n) for(ll i=0; i<n; i++)
#define all(x) x.begin(), x.end()
#define ordered_set tree<pair<int,int>, ... | ALGO | 0.999959 | 4.356524 |
7256602f-d62d-4d34-a362-d1c059f94ef2 | kumarmanglam/DS-and-Algorithm | c++/07_LinkedList/12_create_doublyLL.cpp | #include <iostream>
using namespace std;
//create a function which create a doubly linked list 10-20-30
struct node{
int data;
node*prev;
node*next;
node(int x){
data=x;
prev=NULL;
next=NULL;
}
};
//creating doubly linked in main() function
int main(){
node*first=new no... | ALGO | 0.997345 | 4.322549 |
25f32333-c832-4551-a2a4-4fe0fb4dbe0d | lasjg72/CompetetiveProgramming | program/Yukicoder/1139.cpp | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
int n, d;
cin >> n >> d;
ll to = 0;
vector<pair<ll, ll>> s(n);
fo... | ALGO | 0.999933 | 3.828445 |
e54032b1-81ac-41ef-823e-8b381b6cb328 | zzh8829/Misc | USACO/Training/1.5/pprime.cpp | /*
ID: zzh8829
PROG: pprime
LANG: C++
*/
#include <iostream>
#include <fstream>
using namespace std;
int table[100001],d1,d2,d3,d4,num=0;
bool prime(int n)
{
for(int i=2;i*i<n+1;i++)
if(n%i==0)
return false;
return true;
}
int main()
{
ifstream cin("pprime.in");
ofstream cout("pprime.out");
int a,b;
cin >> a... | ALGO | 0.999713 | 4.192576 |
a1b98324-2a82-4bf4-89e5-1b286669cb84 | Abhishekgeorge111/rjtech | 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.998733 | 6.76775 |
0bf4130c-3271-4192-b440-86a531bf5dce | communityus-branch/Open-Fortress-Source | utils/height2normal/height2normal.cpp | static bool g_NoPause = false;
static bool g_Quiet = false;
static void Pause( void )
{
if( !g_NoPause )
{
printf( "Hit a key to continue\n" );
getch();
}
}
static bool ImageRGBA8888HasAlpha( unsigned char *pImage, int numTexels )
{
int i;
for( i = 0; i < numTexels; i++ )
{
if( pImage[i*4+3] != 255 )
{
... | TOOL | 0.862837 | 4.254106 |
14a1550a-de7c-47dc-8274-5ed05655597e | rajeevt09/AlgorithmsCode | strings/scratch.cpp | #include <vector>
#include <iostream>
#include <unordered_map>
#include <string>
using namespace std;
int main()
{
vector<string> array = {"bat","tab","cat"};
vector<string> temp(array.size(),string());
temp[2] = std::move(array[1]);
temp[1] = std::move(array[0]);
temp[0] = std::move(array[2]);
cou... | ALGO | 0.997513 | 4.333712 |
b5ee9582-2322-4422-8f8a-7b51da3064ca | disha05chauhan/LeetCode | 0392-is-subsequence/0392-is-subsequence.cpp | class Solution {
public:
bool isSubsequence(string s, string t) {
int k=0;
for(char i:t){
if(k==s.size()) return true;
if(i==s[k])k++;
}
if(k==s.size()) return true;
return false;
}
}; | ALGO | 0.999908 | 6.168747 |
ea82d5a1-948d-4f57-a1ca-fedefc138d19 | nolink/algorithm | Leetcode2/061.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* rotateRight(ListNode* head, int k) {
if(NULL == head || NULL == head->next) return head;
int n = 0;
... | ALGO | 0.999982 | 5.620031 |
a067a384-c3e3-48fc-a8b7-1eac074d8f37 | theoden42/code-store | pasts/cowsinstalls 2.cpp |
/* @uthor: (g)theoden42 */
#include <bits/stdc++.h>
using namespace std;
#ifdef ON_PC
#include <debug.h>
#else
#define debug(x...)
#endif
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
const int MAX_N = 1e6 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
void solve() {
... | ALGO | 0.999997 | 4.98947 |
a3ae1896-96bc-463c-a170-143ed962ce46 | omohey/Tomasulo-Algorithm-Simulator | CLI/CA_Project/CA_Project/x64/Source.cpp | #include <iostream>
#include "Queue.h"
#include "defines.h"
#include <fstream>
#include <string>
#include <iomanip>
using namespace std;
int binary_to_decimal(string val);
vector<Instruction> read_instructions(vector<string>&);
void read_data();
string bin16bit(string);
string tobinary(int word);
string nandfunc(strin... | ALGO | 0.993167 | 3.155987 |
1c4c484f-a7dd-4b59-a8e6-758d9cc759bf | taut0logy/Arduino_ | _vscode.ino.hex/sketch/numerical001.cpp | #line 1 "C:\\Users\\LENOVO\\OneDrive\\Documents\\C\\_VScode\\numerical001.cpp"
#include<bits/stdc++.h>
using namespace std;
void calc(string s,int& a1,int& b1,int& c1,int& d1)
{
int sign,start,end;
if(s[0]=='-')
sign=-1;
else
sign=1;
if(s[1]=='x')
a1=sign;
else if(s[1]=='y'... | ALGO | 0.999734 | 3.422718 |
586726c0-1470-4c0a-a0ae-6f56e192fa82 | oalieno/Competitive-Programming | codeforces/BAPC-15/pC.cpp | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
#define SZ(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define double int
#define int long long
struct VT{
double x,y;
VT(){}
VT(double x, ... | ALGO | 0.999907 | 4.694178 |
d156d741-eb1d-41d3-af47-eefff11d040d | LuoXubo/JointLoc | RelLoc/src/OpenMVG/multiview/triangulation_nview.cpp | #include "../multiview/triangulation_nview.hpp"
#include "../multiview/projection.hpp"
namespace openMVG {
void TriangulateNView(const Mat2X &x,
const std::vector< Mat34 > &Ps,
Vec4 *X) {
Mat2X::Index nviews = x.cols();
assert(nviews == Ps.size());
Mat design(3... | ALGO | 0.99986 | 6.342943 |
a7d08003-e657-404d-869d-fa0015c99b0b | MrKerim/Competitive-Programing | LeetCode/Most Profitable Path in a Tree - LeetCode/solution.cpp | struct Node {
int val;
int pre;
vector<int> next;
int bobPassingTime;
Node(int val) {
this->val = val;
pre = -1;
bobPassingTime = -1;
}
};
class Solution {
public:
void initPres(int current, unordered_map<int, Node*>& nodes) {
for (int neighbor : nodes[curre... | ALGO | 0.999976 | 5.039275 |
90ba9a61-bb99-4cfb-a381-d23a21144e4b | deep4nshu1228/Cp | B_Stone_Age_Problem.cpp | #include <bits/stdc++.h>
#define all(n) (n).begin(), (n).end()
using namespace std;
typedef long long int ll;
int main()
{
ll n,q;
cin >> n >> q;
ll sum = 0;
vector<ll> a(n);
for(auto &it: a){
cin >> it;
sum += it;
}
while(q--){
ll k;
cin >> k;
int lq... | ALGO | 0.999392 | 3.555263 |
bc98a670-810e-45e1-a2b6-38033909778f | alexandraback/datacollection | solutions_2751486_1/C++/Gyosh/A.cpp | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <map>
#define REP(a,b) for (int a=0; a<b; a++)
#define FOR(a,b,c) for (int a=b; a<=c; a++)
#define FORD(a,b,c) for (int a=b; a... | ALGO | 0.999585 | 3.793489 |
fe8f74e8-7759-487e-bc9c-ad2f2e14bbfe | mukesh2305/c-data-structure | newCommers/string/prob16.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lb long double
#define ull unsigned long long;
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define format(n) fixed << setprecision(n)
#define pi 3.141592653
#define nl '\n'
#define Yes cout << "Yes\n"
#define YES cout << "YES\n"
#de... | ALGO | 0.99547 | 3.207964 |
39b56182-7bcd-4cd0-a1eb-3732557f5ca8 | maplelearC/LeetCode | 1331. Rank Transform of an Array/Leetcode1331.cpp | //
// Created by 24191 on 2022/7/28.
//
#include <iostream>
#include <vector>
#include <algorithm>
#include<unordered_map>
using namespace std;
class Solution
{
public:
vector<int> arrayRankTransform(vector<int> &arr)
{
vector<int> sortedArr = arr;
sort(sortedArr.begin(), sortedArr.end());
... | ALGO | 0.999908 | 5.179465 |
583c4733-f6a3-4981-8414-b17f30e8c413 | yucheng881111/Competitve-Programming | problem474-Poker!.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> A;
vector<int> B;
vector<int> C;
while(n--){
A.clear();
B.clear();
C.clear();
int x;
cin>>x;
int d;
char cc;
vector<int>::iterator iter;
f... | ALGO | 0.999736 | 3.444983 |
cf6953f4-038f-4fb6-bb20-5d9f219e6e1d | dohui-son/Algorithms-Cplusplus | pre_src/src/B15685.cpp | //#include<iostream>
//#include<vector>
//#include<deque>
//
//ذ
//using namespace std;
//#define endl "\n";
//
//int N, ans = 0;
//
//vector<vector<bool>> visit(102, vector<bool>(102, false));
//int yy[4] = { 0,-1,0,1 };
//int xx[4] = { 1,0,-1,0 };
//
//void square_chk(int yy) {
// for (int i = 0; i < 102; i++)
// {
/... | ALGO | 0.998997 | 4.079221 |
14f03792-fb1f-4897-a553-72cdc50a9ee6 | MaKla/bacalc | src/validator/parser.cpp | #include <iostream>
#include <map>
#define CSI 0x1b
using namespace std;
class Parser {
public:
const static int NAN = 0;
const static int NUMBER = 1;
const static int OPER = 2;
const static int FACULTY = 3;
const static int SEPARATOR = 4;
string validate(string validationForm){
printf("Parser->validate(... | ALGO | 0.966096 | 4.066308 |
a485e2e9-3625-4de5-bc37-3f457308e48c | tempure/algorithm-advance | category/图论/二分图/acwing_257.cpp | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
mt19937 mrand(random_device{}());
const ll mod = 1000000007;
int rnd(int x) {... | ALGO | 0.999923 | 4.856997 |
aedb457d-2bd0-47bb-81d0-f69d884affba | raincross7/code-similarity | codes/train_code/problem132/problem132_460.cpp | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | ALGO | 0.999912 | 4.304323 |
8fec48a6-1275-4387-a73d-28105a525e26 | Eppurdream/Algorithm_Problems | Algorithm_Problems/_Programmers/CodeFiles/행렬의 덧셈.cpp | #include <string>
#include <vector>
using namespace std;
vector<vector<int>> solution(vector<vector<int>> arr1, vector<vector<int>> arr2) {
vector<vector<int>> answer;
for(int i = 0; i < arr1.size(); i++)
{
vector<int> v;
for(int n = 0; n < arr1[i].size(); n++)
{
v... | ALGO | 0.999966 | 5.413683 |
45137cb9-8c40-45d5-ba1a-8e52a19d210b | hoopizs1452/c-plus-plus-practice | Operation/OperationMain.cpp | #include<iostream>
#include"Operation.h"
using namespace std;
int main()
{
int num1, num2;
cin >> num1 >> num2;
Operation answer(num1, num2);
cout << num1 << "+" << num2 << "=" << answer.getSum() << endl;
cout << num1 << "-" << num2 << "=" << answer.getDecrease() << endl;
cout << num1 << "*" << num2 << "=" << a... | ALGO | 0.945876 | 4.425373 |
98859df5-9783-4f1e-a953-e03d8fe04c72 | HANDS-FREE/OpenRE | 4_Thirdparty/Eigen3/bench/sparse_randomsetter.cpp |
#define NOGMM
#define NOMTL
#include <map>
#include <ext/hash_map>
#include <google/dense_hash_map>
#include <google/sparse_hash_map>
#ifndef SIZE
#define SIZE 10000
#endif
#ifndef DENSITY
#define DENSITY 0.01
#endif
#ifndef REPEAT
#define REPEAT 1
#endif
#include "BenchSparseUtil.h"
#ifndef MINDENSITY
#define M... | TOOL | 0.921506 | 4.487392 |
5c80c1e5-a425-4ef6-8dcb-9be17a5af03e | pal-0123/Competitive-Database | Codeforces/Round/round_579_div3_D1.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long int
signed main(){
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
string s,t;
cin >> s;
cin >> t... | ALGO | 0.999934 | 4.340522 |
eba9cd7e-aa8b-47a2-ad4e-0ba4e615ae20 | dereksodo/usaco | Ch4/4.2.1_hlpp.cpp | /*
ID: zjd32151
TASK: ditch
LANG: C++
*/
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <set>
#include <vector>
#include <map>
#include <cstdio>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <cassert>
#include <climits>
using namespace std;
typed... | ALGO | 0.999826 | 4.00706 |
1f003cfc-8ce2-45f2-a729-0a347d64903c | Maksim-Viktorov/Algorithms-Coursework | Graphs/Oriented Graphs, BFS/BFS.cpp | #include <iostream>
#include <deque>
#include <vector>
class OrientedGraph {
int max_weight_ = 0;
int edge_count_ = 0;
std::vector<std::vector<std::pair<int, int>>> graph_;
public:
OrientedGraph() = default;
explicit OrientedGraph(int n) : graph_(n + 1) {
}
void AddEdge(int start, int finish, int weigh... | ALGO | 0.999988 | 5.433649 |
b81c0161-ceda-4ad7-be9d-2bf3c03f80d0 | moti9/iCode | cp/A_Jagged_Swaps.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
bool can_sort(int n, vector<int> arr)
{
bool req_ops = false;
for (int i = 1; i < n - 1; i++)
{
if (arr[i - 1] < arr[i] && arr[i] > arr[i + 1])
{
req_ops = true;
swap(arr[i], ar... | ALGO | 0.999996 | 4.487198 |
40ff3011-1f3b-488d-bc18-1329b3098cc7 | ytam1208/algorithm_ws | ROS_build/src/Practice/Backjun/src/C++/2562.cpp | #include <iostream>
int main(int argv, char **argc)
{
int a[10] = {
0,
};
int count = 0;
for (int i = 1; i < 10; i++)
{
std::cin >> a[i];
}
int max = a[1];
for (int j = 1; j < 10; j++)
{
if (max <= a[j])
{
max = a[j];
count = ... | ALGO | 0.999681 | 4.665922 |
cd52aecf-ed64-4402-a399-f4984f0ad2c2 | Tomenz/Http2Serv | SpawnProcess.cpp | #include <stdio.h>
#include <fcntl.h>
#include <regex>
#if defined(_WIN32) || defined(_WIN64)
#include <io.h>
#include <process.h>
#include <stdlib.h>
#include <Windows.h>
static const std::vector<std::string> vEnvFilter{"COMPUTERNAME=","HOMEDRIVE=","HOMEPATH=","USERNAME=","USERPROFILE=","SystemRoot=","TMP=","TEMP=","... | TOOL | 0.947385 | 5.719462 |
984f967f-aff7-42f3-aff7-35367b72882b | john-ng-hk/Group162Battleship | displayGameHistory.cpp | #include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include "displayGameHistory.h"
using namespace std;
//structure for storing and sorting all game records (for dynamic array)
struct GameRecords {
int won;
int totalMoveUsed;
string gameName;
string playerName;
string country;
str... | TOOL | 0.971411 | 3.753707 |
648e3b15-ce74-4dbc-a9ee-0ca0e6bac49b | puras/puras-code | c++/C1-15/source_2.cpp | //
// Created by puras on 2025/4/13.
//
#include<iostream>
using namespace std;
int main() {
int n;
int i;
for (i = 1; i <= 10; i++) {
cin >> n;
if (n == 3) {
break;
}
}
if (i == 11) {
cout << "No";
} else {
cout << i;
}
return 0;
} | ALGO | 0.999876 | 3.584466 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.