uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
ff2920d9-cc3b-416f-81d2-ea2954ec62a2 | breakcrypto/redux | src/utilstrencodings.cpp | #include "utilstrencodings.h"
#include "tinyformat.h"
#include <cstdlib>
#include <cstring>
#include <errno.h>
#include <limits>
static const std::string CHARS_ALPHA_NUM = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
static const std::string SAFE_CHARS[] =
{
CHARS_ALPHA_NUM + " .,;-_/:?@()"... | TOOL | 0.974034 | 5.855553 |
4d4bbcba-5c56-4c06-94f0-d7f521fc0f7e | atiq-cs/ProblemSolving | general/hackerrank/data-structures/print-linked-list-elements.cpp | /***************************************************************************************************
* Title : Print the elements of a linked list
* URL : https://www.hackerrank.com/challenges/reverse-a-linked-list
* Comp : O(n)
* Author: Atiq Rahman
* Status: Accepted
* Notes :
* meta : tag-ds-linked-list
*******... | ALGO | 0.998694 | 5.017162 |
f2305973-2d22-4944-b8cc-a5c4f207ed5b | sindhuja2001/Love-babbar-450-Problems | Find the Kth min and max elem in an array-.cpp | #include<bits/stdc++.h>
#include<algorithm>
#include<iostream>
using namespace std;
void kthSmallest(int arr[], int n, int k){
priority_queue<int> p;
for(int i= 0; i<n; i++){
p.push(arr[i]);
}
for(int i= k; i< n; i++){
if(p.top()> arr[i]){
continue;
}
else{
p.pop();
p.push(arr[i]);
}
}
cout<<... | ALGO | 0.999981 | 4.266068 |
886b2b4a-a6a6-4e64-9480-a764e0f013a9 | srsaif18/Algorithm-CP-DIU | Algorithm Lab Assignment 02/L_Peter_s_Smokes_Greedy_01_.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j, s, a;
while (cin >> n >> k) {
s = n;
a = k;
while (1) {
i = n / a;
j = n % a;
s += i;
n = i + j;
if (i + j < a)
break;
}
... | ALGO | 0.999923 | 4.091635 |
9e515327-86db-4e04-99d8-c3723de875dd | Pingan-Li/leetcode | solutions/delete_node.cpp | /**
* @file delete_node.cpp
* @author lipingan (<EMAIL>)
* @brief
* @version 0.1
* @date 2022-01-10
*
* @copyright Copyright (c) 2022
*
*/
#include "delete_node.h"
namespace leetcode {
void DeleteNode(ListNode *node) {
ListNode *temp = node->next;
node->val = node->next->val;
node->next = node->next->... | ALGO | 0.997309 | 6.078537 |
b68ea159-888d-4c45-aadb-2c46928586d6 | Pooh1223/Online-Judge | Tioj/Tioj1011.cpp | #include <cstdio>
int main(){
int a,b;
scanf("%lld %lld",&a,&b);
int ans = 0;
while(a != b){
if(a > b) a >>= 1;
else b >>= 1;
++ans;
}
printf("%d\n",ans);
return 0;
} | ALGO | 0.999893 | 3.975659 |
9f809eec-3eb6-4016-ad77-dfbb8244568f | A2Amir/Highway-Driving | src/Eigen-3.3/doc/examples/class_VectorBlock.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
template<typename Derived>
Eigen::VectorBlock<Derived>
segmentFromRange(MatrixBase<Derived>& v, int start, int end)
{
return Eigen::VectorBlock<Derived>(v.derived(), start, end-start);
}
template<typename Derived>
const Eigen::Vec... | TOOL | 0.925166 | 4.383477 |
e9bbc7fc-7c3f-4eae-9023-9f3d97e1e261 | Noamyoungerm/pluto | Src/Chombo/AMRLevelPluto.cpp | #ifdef CH_LANG_CC
#endif
#include <iomanip>
#include "parstream.H"
#include "ParmParse.H"
#include "LayoutIterator.H"
#include "CH_HDF5.H"
#include "SPMD.H"
#include "LoadBalance.H"
#include "BoxIterator.H"
#include "computeSum.H"
#include "AMRIO.H"
#include "AMRLevel.H"
#include "AMRLevelPluto.H"
#include "Namesp... | TOOL | 0.983327 | 6.325075 |
c71e8562-3c60-4489-92c4-ba6019d81f3e | AceTM/Cocos2Dx | Cocos2Dx/libs/Box2D/Collision/Shapes/b2PolygonShape.cpp | #include <b2PolygonShape.h>
#include <new>
b2Shape* b2PolygonShape::Clone(b2BlockAllocator* allocator) const
{
void* mem = allocator->Allocate(sizeof(b2PolygonShape));
b2PolygonShape* clone = new (mem) b2PolygonShape;
*clone = *this;
return clone;
}
void b2PolygonShape::SetAsBox(float32 hx, float32 hy)
{
m_verte... | ALGO | 0.987475 | 7.920104 |
d7748697-27c8-4f30-a86a-febffcd9b3b8 | JustinS543/CIS-150 | Homework/Homework 6/default.cpp | #include <iostream>
#include <string>
#include <iomanip>
using namespace std;
bool primeNum(int number)
{
for(int i = 2; i < number; i++)
if(number % i == 0)
{
return false;
}
return true;
}
void display(int primeNumIn, int &pos)
{
cout << setw(5);
if(pos == 0)
... | ALGO | 0.999616 | 4.836275 |
bf366ae2-7a74-4f59-8a87-c569f9b07c63 | Phimos/practice-of-programing-ii- | Boolean Expressions.cpp | #include<iostream>
using namespace std;
bool expression_res();
bool factor_res();
char get_next_char()
{
char c = ' ';
while (c == ' ')
{
c = cin.get();
}
return c;
}
bool expression_res()
{
bool res = factor_res();
while (true)
{
char op = get_next_char();
switch (op)
{
case '|':
res |= factor... | ALGO | 0.993857 | 4.037221 |
8c49ae5a-91d4-45d0-9e54-585770d3f6c6 | PIYUSH-GOYAL1/Data-Structures | Stacks/10_sorted_stack.cpp | #include <iostream>
#include <stack>
using namespace std;
void sorted_insert(stack<int> &s , int data){
if ((!s.empty() && data >= s.top()) || (s.empty())){
s.push(data);
return ;
}
int element = s.top();
s.pop();
sorted_insert(s , data);
s.push(element);
}
void sort_stack(stac... | ALGO | 0.999874 | 4.73946 |
754978b6-9437-41e8-9c16-15c704f41099 | Bungmint/competitiveprogramming | contest/codeforces/1637/1637C.cpp | // Problem: C. Andrew and Stones
// Contest: Codeforces - Codeforces Global Round 19
// URL: https://codeforces.com/contest/1637/problem/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pa... | ALGO | 0.99983 | 4.737241 |
39f52043-b438-47d0-8f86-2cfa98b08bb1 | riya123purwar/codes | 141-linked-list-cycle/linked-list-cycle.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
bool hasCycle(ListNode *head) {
ListNode* fast= head;
ListNode* slow= head;
while(fast!= NULL){
... | ALGO | 0.999703 | 5.242019 |
3ba0fd1c-0813-4a57-adc0-ececd99a97c3 | ProvaPaul/Advanced-Programming | bellman.cpp | #include <iostream>
#include <vector>
#include <climits>
using namespace std;
struct Edge {
int from,to,weight;
};
class Graph {
public:
int V, E;
vector<Edge> edges;
Graph(int vertices, int edgesCount) {
V = vertices;
E = edgesCount;
edges.resize(E);
}
void addEdge(... | ALGO | 0.999896 | 5.429527 |
2af06c95-e78f-42a7-b5c6-f5abf1693358 | Samarth7212/SE | Sem-3/OOPCGL/21142_Assignment11.cpp | /*
Samarth Ramkrushna Kamble (21142 F1-Batch)
Assignment-11
OOPCG Laboratory
Date:- 15/12/21
Write C++ program using STL for sorting and searching
user defined records such as Item records (Item code,
name, cost, quantity etc) using vector container.
*/
#include <iostream> //Standard inpu... | TOOL | 0.997889 | 4.754272 |
4b6e4275-3467-4f5d-aa45-8f1962096498 | sarvex/leetcode-beef | solution/2500-2599/2514.Count Anagrams/Solution.cpp | class Solution {
public:
const int mod = 1e9 + 7;
int countAnagrams(string s) {
stringstream ss(s);
string w;
long ans = 1, mul = 1;
while (ss >> w) {
int cnt[26] = {0};
for (int i = 1; i <= w.size(); ++i) {
int c = w[i - 1] - 'a';
... | ALGO | 0.999991 | 6.006279 |
73d592cb-73f3-4f8e-bff5-7cd8edaa2de8 | Aarushi900/Codes-for-OS | deadlock/banker's_algorithm.cpp | #include <iostream>
using namespace std;
int main()
{
int n, m, i, j, k;
cin >> n; // no. of processes cin>>m;//no. of resources
int alloc[n][m];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
cin >> alloc[n][m];
};
};
int max[n][m];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; ... | ALGO | 0.999991 | 3.588335 |
3710df13-c5a6-4c8e-bd74-3a9f72a28660 | aig-hagen/algorithms_for_acceptable_arguments | lib/cryptominisat-5.11.21/src/main_emscripten.cpp | #include <iostream>
#include <stdlib.h>
#include <string.h>
#include "constants.h"
using std::cout;
using std::endl;
#include "main_common.h"
#include "solverconf.h"
#include "cryptominisat.h"
#include "dimacsparser.h"
#include "streambuffer.h"
using namespace CMSat;
SATSolver* solver = NULL;
DLL_PUBLIC void print... | ALGO | 0.997318 | 4.342199 |
fd782c66-2ce4-4b9a-988f-01ef5a90fa94 | cc-itop-android4-4/itop6818-android4.4_ndk | sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/remove_if.pass.cpp | // <forward_list>
// template <class Predicate> void remove_if(Predicate pred);
#include <forward_list>
#include <iterator>
#include <cassert>
#include "../../../min_allocator.h"
bool g(int i)
{
return i < 3;
}
int main()
{
{
typedef int T;
typedef std::forward_list<T> C;
const T t1... | TEST | 0.865055 | 5.965936 |
53ea8d5d-bd0b-4cd5-94dd-3750a798d493 | Dolyetyus/Leetcode-Problems | C++/FirstCompletelyPaintedRoworColumn.cpp | class Solution {
public:
int firstCompleteIndex(vector<int>& arr, vector<vector<int>>& mat) {
int numRows = mat.size();
int numCols = mat[0].size();
unordered_map<int, pair<int, int>> positionMap;
for (int i = 0; i < numRows; ++i) {
for (int j = 0; j < numCols; +... | ALGO | 0.999945 | 5.686321 |
fd158b52-3ec8-4d9a-8149-ae3315db2a57 | anisahu99/GFG_Daily_Problems | Difficulty: Medium/Validate an IP Address/validate-an-ip-address.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution {
public:
int isValid(string str) {
// code here
vector<string>no;
int i = 0;
int n = str.length();
while(i<n){
string st... | ALGO | 0.955054 | 5.505027 |
e556001b-dfba-4a0b-8888-3b6cf66f7ee0 | ishandutta2007/codeforces | atoiz/normal/1239/E.cpp | /*input
3
1 1 2 3 4 5
*/
#include <iostream>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cassert>
#include <algorithm>
#include <cstdlib>
#include <numeric>
#include <utility>
#include <tuple>
#include <climits>
#include <fstream>
#include <bitset>
#include <map... | ALGO | 0.999995 | 3.026596 |
1a4c91f5-0d67-49c4-a395-87bb193a0add | Jun2-Lee/PNU-algorithm | HW3-Fish Bread.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void print_fish(vector <int> fish_bread) {
for (int i = 0; i < fish_bread.size(); i++) {
cout << fish_bread[i] << " ";
}
cout << endl;
}
int find_num(vector <int> fish_bread, int num) {
for (int i = 0; i < fish_bread.size(); i++) ... | ALGO | 0.999701 | 3.795795 |
3620fb0b-b3ee-4347-ba10-def25e1f013b | m7adeel/Cpp_Codes | Snake Game.cpp | #include <iostream>
#include <conio.h>
#include <string>
#include <cstdlib>
#include <ctime>
using namespace std;
// Variables ,Constants
bool game_end=0;
const int xmax=35,ymax=20;
int headx=xmax/2,heady=ymax/2;
char dir;
int fruitx=rand()%xmax;
int fruity=rand()%ymax;
int score=0;
// Main Game
void game_control()... | ALGO | 0.998951 | 3.889084 |
6ec6a0d5-41d7-4de7-a1bb-c1b561ac5e20 | yulongran/Codeforces | CF1674/D.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <string>
#include <cmath>
#include <iomanip>
#include <climits>
#include <bitset>
using namespace std;
void __print(int... | ALGO | 0.999956 | 4.598925 |
8309e947-d393-4216-8da3-4246d04a8d59 | FarPluginsArchive/farplug-alvls | advcmp/SRC/compare6_FLS.cpp | /****************************************************************************
************************** CompareFiles functions **************************
****************************************************************************/
/****************************************************************************
* ... | TOOL | 0.918047 | 5.466961 |
cccdae71-60b8-4d88-a8bb-45f6c834f8cd | kartik0920/Revision | Day 06/Lec 24/lcm.cpp | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int getGcd(int a, int b)
{
if (a == b)
{
return a;
}
if (a == 1 || b == 1)
{
return 1;
}
return a > b ? getGcd(a - b, b) : getGcd(a, b - a);
}
int lcm(int a, int b)
{
int gcd = getGcd(a, b);
return (a... | ALGO | 0.999765 | 4.840377 |
cb121472-269a-4196-a722-248c0f638d53 | tranvandat05032002/C-C-DoThi | huongdoituongCC++/phanso.cpp | #include <iostream>
#define ll long long
using namespace std;
inline ll gcd(ll a, ll b){ ll r; while(b){r = a % b; a = b; b = r;}return a;}
inline ll Icm(ll a, ll b){ return a/gcd(a , b) * b;}
// struct
struct phanso{
ll tu;
ll mau;
};
void nhap(phanso &p){
cin>>p.tu>>p.mau;
}
void rutgon(phanso &p){
ll l = gcd(p... | ALGO | 0.994877 | 4.578743 |
b051db10-35f7-4bf6-8023-e6a5e93c5358 | eae11/algorithm | zyr/algoritm/src/main/java/com/douma/_18_day_二叉树三/_701/代码实现_C++.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.999967 | 6.445134 |
7cbb92d6-1c80-4c07-9803-b3ea3fd33b3e | thefallen27/advent_of_code_2023 | day_2/day_2_a.cpp | #include <fstream>
#include <iostream>
#include <sstream>
#include <string>
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(NULL);
std::ifstream input_file("game_records.txt");
if (!input_file)
{
std::cerr << "File cannot be opened!" << std::endl;
return 1;
}
s... | ALGO | 0.916194 | 4.359848 |
3defc404-caf7-4766-8739-709f3982ec62 | rituraj2084/DSA-Questions | Rat in a Maze Problem - I - GFG/rat-in-a-maze-problem-i.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:
void sol(vector<string>&vec,vector<vector<int>> &m,int n,int i,int j,string s)
{
if(i<0||j<0||i>=n||j>=n||m[i][j]<=0)
... | ALGO | 0.999886 | 6.400203 |
ff4186c9-1aed-4e3a-8902-3262de48389e | mahabub5090/LeetCode_Problem_Solutions | Medium/2779. Maximum Beauty of an Array After Applying Operation.cpp | // Problem Link: https://leetcode.com/problems/maximum-beauty-of-an-array-after-applying-operation/submissions/1476272303/?envType=daily-question&envId=2024-12-11
class Solution {
public:
int maximumBeauty(vector<int>& nums, int k) {
sort(nums.begin(),nums.end());
int ans=0;
int l=0,r=0;
... | ALGO | 0.999904 | 6.095636 |
07eb9c1f-75ae-4f6a-9944-6d12a5fb8929 | raincross7/code-similarity | codes/train_code/problem269/problem269_70.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
for(int i = 0; i < h; i++) cin >> a.at(i);
vector<vector<int>> check(h, vector<int>(w));
int ans = -1;
queue<pair<int, int>> bfs;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
... | ALGO | 0.999966 | 4.191011 |
7af4555e-6f07-4a23-93e4-c3678e3ac8ba | Coder-Vippro/Code | Archived/GiaHung/DEMCHUOI.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
freopen ("DEMCHUOI.inp","r",stdin);
freopen ("DEMCHUOI.out","w",stdout);
string s;getline(cin,s);
long long n=s.size();
cout<<n*(n-1);
return 0;
}
| ALGO | 0.9996 | 3.092128 |
10958274-5091-4b4f-8a2a-670d89de0864 | sarvex/leetcode-odin | solution/2200-2299/2281.Sum of Total Strength of Wizards/Solution.cpp | class Solution {
public:
int totalStrength(vector<int>& strength) {
int n = strength.size();
vector<int> left(n, -1);
vector<int> right(n, n);
stack<int> stk;
for (int i = 0; i < n; ++i) {
while (!stk.empty() && strength[stk.top()] >= strength[i]) stk.pop();
... | ALGO | 0.999992 | 5.061433 |
394e7f42-11bd-48eb-9870-d1d1e61c7407 | codeAntu/LeetCode-problems | cpp/balanced-binary-tree.cpp | #include "iostream"
#include "math.h"
#include "vector"
#include "map"
using namespace std;
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, Tree... | ALGO | 0.99988 | 6.182656 |
ba07e985-9c2e-475d-ab82-df1fb0a4437b | sarvex/leetcode-kotlin | solution/1900-1999/1974.Minimum Time to Type Word Using Special Typewriter/Solution.cpp | class Solution {
public:
int minTimeToType(string word) {
int ans = 0;
int prev = 0;
for (char& c : word) {
int curr = c - 'a';
int t = abs(prev - curr);
t = min(t, 26 - t);
ans += t + 1;
prev = curr;
}
return ans;
... | ALGO | 0.999969 | 6.099496 |
584ae35e-2c60-4a7b-8ac8-aa4a111cec72 | raincross7/code-similarity | codes/train_code/problem280/problem280_456.cpp |
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1179&lang=jp
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#defi... | ALGO | 0.999862 | 3.74589 |
b67bad18-891d-4507-bfca-77f41f180422 | NazmulHasanMoon/OJ | Random/cf_A. Splitting in Teams.cpp | #include<bits/stdc++.h>
using namespace std;
int mp[3];
int main()
{
int n,x;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>x;
mp[x]++;
}
if(mp[2]>=mp[1])
cout<<mp[1]<<endl;
else
{
int x=mp[2];
mp[1]-=x;
x=x+(mp[1]/3);
cout<<x<<endl;
}
... | ALGO | 0.999962 | 3.498789 |
2d05ed7f-bc51-4cbd-9742-2b0a0d2473c0 | The-Nasa/Programacion-Basica | CLASES POR SEMANA/SEMANA 10/ejercicio 01.cpp | //calses y dos objetos
#include <iostream>
using namespace std;
class persona{
public:
string name;
int year;
//constructor permite crear objetos
persona(string n,int y){
this->name=n;
this->year=y;
}
void mostrar (){
cout<<"Nombre: "<<this->name<<" Edad: "<<this->y... | TOOL | 0.911833 | 4.252663 |
b611cbdc-5672-4966-bb08-2fee88228bd6 | DucKyWay/ku-dsa | lecture/rectangle.cpp | // เขียนโปรแกรมภาษา C หรือ C++ เพื่อ คำนวนพี้น ที่ของสี่เหลี่ยมรูปหนึ่ง
// โดยรับข้อมูลความกว้างและความยาวจากผู้ใช้
// โดยแบ่ง ออกเป็น 3 ฟังก์ชัน (มีการรับส่งพารามิเตอร์ ห้ามใช้ตัวแปร global)
// - การรับข้อมูล (สำหรับรับข้อมูลความกว้าง, ความยาว)
// - การหาพี้นที่
// - การแสดงผลลัพธ์พี้นที่
// (Note: แก้ไขจากโปรแกรมในหน... | ALGO | 0.978676 | 4.218978 |
cfbd2ac9-05fe-4adb-93d1-acae4ad14158 | vj2303/abcd | College Practical/practical7A.cpp | #include <iostream>
#include <vector>
#include <unordered_map>
#include <stack>
using namespace std;
// Function to perform Depth First Search (DFS) on a graph
void DFS(const unordered_map<char, vector<char>>& graph, char startNode) {
unordered_map<char, bool> visited;
stack<char> stack;
stack.push(start... | ALGO | 0.99998 | 7.034215 |
8d955ef3-0d62-469e-91e0-064dfb020075 | dmkz/competitive-programming | acmp.ru/0143.cpp | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstdint>
#include <cassert>
#include <functional>
struct Int;
std::istream& operator>>(std::istream&, Int&);
std::ostream& operator<<(std::ostream&, const Int&);
bool operator<(const Int&, const Int&);
bool operator>(const Int&, c... | ALGO | 0.999308 | 4.016354 |
cc0273df-3256-48de-80e3-0ac3b6712e20 | notacallforhelp/contests | 995DIV3/D.cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
typedef long long ll;
typedef long double ld;
//ordered_sets
template <typename T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tre... | ALGO | 0.99996 | 4.040387 |
81349259-1320-4bd1-b4bf-0fc85d8994d1 | Masterqsx/ProgrammingPractice | leetcode/172_Factorial_Trailing_Zeroes/Factorial_Trailing_Zeroes.cpp | class Solution {
public:
int trailingZeroes(int n) {
long res = 0, step = 5;
while (n >= step){
res += n / step;
step *= 5;
}
return res;
}
}; | ALGO | 0.999951 | 6.363847 |
4db6e0be-81e9-458d-ba9a-5b673a45bc0c | arnavkarn/STL | deque.cpp | //deque stands for double ended queue
#include<bits/stdc++.h>
using namespace std;
void printDequeue(deque<int>dq)
{
for(auto it:dq)
cout<<it<<" ";
cout<<endl;
}
int main()
{
deque<int> dq;
dq.push_back(1); //no curly brackets for deque i.e. no multiple insertions using push_back or emplace_back... | ALGO | 0.994819 | 5.51484 |
bff15aad-e12c-4097-aa43-19d6c515bcce | HarrinsonCalderon/SolucionEjercicios | ufps/Aprendiendo a contar.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int dif,a,aux=0,con=0,ca,m;
string cad,aux2;
cin>>ca;
while(ca--){
vector<int>l;
cin>>dif;
cin.ignore();
getline(cin,cad);
stringstream s(cad);
while(s>>aux2){
m=atoi(aux2.c_str());
l.push_back(m);
}
for(int i=0;i<l.size();i++){
a=l[i];
if(!aux){... | ALGO | 0.996713 | 3.97615 |
3603c718-be9f-4128-af61-0c8aa7dfd785 | Alaxe/noi2-ranking | 2017/solutions/C/AIT-Blagoevgrad/color.cpp | #include <bits/stdc++.h>
using namespace std;
int t, n, x, v [100002];
int main(){
ios_base::sync_with_stdio (false);
cin.tie (NULL);
cin >> t;
for (int j = 0; j < t; j ++){
cin >> n;
if (n == 3){
cin >> x; cin >> x; cin >> x;
cout << "3\n";
continue;... | ALGO | 0.999874 | 3.664194 |
9e40705d-7e0b-4bc5-8d5a-9d68fd0f197a | Ritesh-Bommaraju/Practice | 1-two-sum/1-two-sum.cpp | class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> seen;
for (int i = 0; i < nums.size(); ++i)
{
int b = nums[i];
int a = target - b;
if (seen.count(a))
return {seen[a], i};
see... | ALGO | 0.999601 | 6.345973 |
ac0f3462-8fd8-470d-add7-78f86e592577 | kesharihimanshu/Codeforces_contest | Educational Codeforces Round 121/B_Minor_Reduction.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
signed main()
{
int t;
cin>>t;
while(t--)
{
string s;
cin>>s;
int w,w1;
bool fl=false;
for(int i=s.size()-1;i>0;i--)
{
w=s[i-1]-'0';
w+=s[i]-'0';... | ALGO | 0.99994 | 4.988265 |
66d56988-1dd4-4802-aa0c-0b583589cfc7 | daviolimen/Exercises | Codeforces_Problems/2093d.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
int check(int cmp, int x, int y) {
if ((x <= cmp) && (y <= cmp)) return 0;
if ((x > cmp) && (y > cmp)) return 1;
if ((x > cmp) && (y <= cmp)) return 2;
if ((x <= cmp) && (y > cmp)) return 3;
}
void check2(int v, int cmp, int &x, int ... | ALGO | 0.998755 | 4.389487 |
def9f2a2-391c-40f6-8a78-5b5350ae7b5d | pbkpch3514/problem_solving | boj/boj19532.cpp | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, c, d, e, f;
int x, y;
cin >> a >> b >> c >> d >> e >> f;
x = (e*c - b*f) / (a*e - b*d);
y = (a*f - c*d) / (a*e - b*d);
cout << x << ' ' << y << '\n';
}
| ALGO | 0.999782 | 3.704866 |
4e1b0505-3719-483c-88d8-1bf75e0762dc | surajshekhar/Leetcode | 2432-number-of-zero-filled-subarrays/number-of-zero-filled-subarrays.cpp | typedef long long ll;
class Solution {
public:
long long zeroFilledSubarray(vector<int>& nums) {
ll cnt = 0, ans = 0;
for (int it : nums) {
if (it == 0) cnt++;
else {
ans += cnt * (cnt + 1) / 2;
cnt = 0;
}
}
ans += c... | ALGO | 0.999986 | 5.856122 |
4e2d4511-b5c3-4d14-9bec-2402c902b355 | abhishektyagiaktcode/c-codes | Untitled1.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int i=1,j=1,sum=0,n;
cin>>n;/*enter number for check value*/
while(i<=n)
{
while(j<=n)
{
if(j<i)
{
if(i%j==0)
sum=sum+j;
}
j++;
}
if(sum==i)
{
cout<<i<<" "<<... | ALGO | 0.999969 | 3.798085 |
2728c587-a760-4243-b597-9fd18a487ae5 | LincolnMatheus97/ADS-IFPI | Exercicios_ED_I/Exercicios_Extras/palindromo.cpp | #include <stdio.h>
#include <string.h>
int main(void)
{
char word[256];
int i;
scanf("%s", word);
int length = strlen(word);
for(i=0 ; i < length/2 ; i++)
{
char c = word[i];
word[i] = word[length - i - 1];
word[length - i - 1] = c;
}
printf("%s\n", word);
return 0;
} | ALGO | 0.999979 | 3.638772 |
ba0a31d6-fc98-4daa-98ca-8dacc94ee65b | CodyVollrath/CodyVollrathA2 | utility/Utility.cpp | #include "Utility.h"
namespace utility
{
Utility::Utility()
{
//ctor
}
Utility::~Utility()
{
//dtor
}
bool Utility::strEqualsIgnoreCase(const string& str1, const string& str2) const
{
return equal(str1.begin(), str1.end(),
str2.begin(), str2.end(),
[](char a, char b) {... | TOOL | 0.901933 | 5.39606 |
a9595d87-e0d5-4ff3-8092-cd39712e9445 | ishandutta2007/codeforces | sw2000/normal/1528/B.cpp | #include<bits/stdc++.h>
#define fi first
#define se second
#define endl '\n'
using namespace std;
typedef long long ll;
typedef vector<int>vi;
typedef pair<int, int>pii;
const int inf = 0x3f3f3f3f;
const ll linf = 0x3f3f3f3f3f3f3f3f;
const int N = 1e6 + 10;
const int mod=998244353;
ll ans[N],pre[N];
int main(){
ios::... | ALGO | 0.999986 | 4.190358 |
92c638aa-304e-4c07-a0bd-7a3d108bca59 | Khanhnguyen2408/KTLT-PTIT | KTNGTO001-demsonguyentohoantoan.cpp | #include <iostream>
#include <cmath>
using namespace std;
int nt(int n){
for (int i=2;i<=sqrt(n);i++){
if (n%i==0) return 0;
}
return n>1;
}
int csnt(int n){
while(n){
int r=n%10;
if (r!=2&&r!=3&&r!=5&&r!=7) return 0;
n/=10;
}
return 1;
}
int main(){
int t;
cin>>t;
while (t--){
int a;
cin>>a;
int... | ALGO | 0.999503 | 4.382949 |
4e641f6d-4456-4342-be1a-046223dd5104 | seongjin96/BOJ | 정렬/1427.cpp | /*
ڸ ϴ
*/
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool compare(int i, int j) {
return j < i;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int N;
vector<int> v;
cin >> N;
while (N > 0) {
v.push_back(N % 10);
N /= 10;
}
sort(v.b... | ALGO | 0.999938 | 5.167858 |
642e1a85-1636-4aca-b882-943653a69fef | davitb/arag | src/SetMap.cpp | #include <iterator>
#include "SetMap.h"
#include "RedisProtocol.h"
#include "Utils.h"
#include <iostream>
using namespace std;
using namespace arag;
int SetMap::size()
{
return (int)mSetMap.size();
}
int SetMap::size(const std::string &key)
{
auto iter = mSetMap.find(key);
if (iter == mSetMap.end()) {
... | TOOL | 0.898734 | 5.92485 |
4e384847-6f7f-41bf-8339-59fa95e316c3 | kisuk010203/PS | Contests/Sogang/2021/23739.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
int cnt = 0, remained_time = 30;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
if (temp <= remained_time) {
cnt++;... | ALGO | 0.99949 | 3.973787 |
ce306ebd-0b4a-4367-8be3-8d4f01a344d5 | gisdev1203/near_pay_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 |
e135ecf2-865f-4234-8217-6a4e4b6d1714 | YerangPark/ProblemSolving | BOJ/11365.cpp | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility> //pair
//#include<bits/stdc++.h>
//#define INT_MAX 2147483647
using namespace std;
bool compare(int a, int b) {return a>b;}
int n,m,i,j,sum=0,cnt=0;
int main(void) {
string str;
while(1){
getline(cin,str);
... | ALGO | 0.998113 | 3.2354 |
d3d966ff-bd84-45fd-89f2-a5209e9236f1 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_4697_25.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, maxi = 0, x;
for (int i = 0; i < 3; i++) {
cin >> x;
if (x > maxi) {
maxi = x;
}
sum += x;
}
if (sum - maxi <= maxi) {
cout << maxi - (sum - maxi) + 1;
} else {
cout << 0;
}
}
| ALGO | 0.999805 | 3.91236 |
81336fe3-ee8e-4848-a304-af87273841b2 | teaspring/problems | leetcode/src/divideInteger.cpp | /*
* divide two integers without using multiplication, division and mod operator
*
* brace method is to use minus which will be in time O(n)
* actually, expected method is binary search in time O(lgn)
* */
#include "stdio.h"
#include <iostream>
#include <string>
#include <algorithm>
#include "stdlib.h"
using nam... | ALGO | 0.999818 | 5.191206 |
0dc6cbbd-8b20-4b5a-b59e-b08e3330a57f | ishandutta2007/codeforces | wiwiho/normal/1481/E.cpp | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_b... | ALGO | 0.999954 | 4.182926 |
edf603c8-a58a-4e80-833b-e797035f769e | wenqicao/Algorithm | 9_12.cpp | #include <iostream>
#include <stack>
using namespace std;
class My_Queue{
public:
void enqueue(int x){
sta_.emplace(x);
}
int dequeue(){
if(stb_.empty()){
while(!sta_.empty()){
stb_.emplace(sta_.top());
sta_.pop();
}
}
if(!stb_.empty()){
int result = stb_.top();
stb_.pop();
return re... | ALGO | 0.9914 | 5.042502 |
f781d3b0-9ec0-430d-a0ad-fc133003b490 | psh117/panda_control_vrep | 3rdparty/eigen/bench/geometry.cpp |
#include <iostream>
#include <Eigen/Geometry>
#include <bench/BenchTimer.h>
using namespace std;
using namespace Eigen;
#ifndef SCALAR
#define SCALAR float
#endif
#ifndef SIZE
#define SIZE 8
#endif
typedef SCALAR Scalar;
typedef NumTraits<Scalar>::Real RealScalar;
typedef Matrix<RealScalar,Dynamic,Dynamic> A;
type... | ALGO | 0.953321 | 5.941502 |
9921c7a4-6472-44b2-9754-6fe3c99af5b7 | RegrowthStudios/Vorb-Deps | include/bullet/BulletCollision/CollisionDispatch/btConvexConcaveCollisionAlgorithm.cpp | #include "btConvexConcaveCollisionAlgorithm.h"
#include "BulletCollision/CollisionDispatch/btCollisionObject.h"
#include "BulletCollision/CollisionShapes/btMultiSphereShape.h"
#include "BulletCollision/BroadphaseCollision/btBroadphaseProxy.h"
#include "BulletCollision/CollisionShapes/btConcaveShape.h"
#include "BulletC... | ALGO | 0.99946 | 7.186289 |
c0974887-74d0-4c10-8d43-22ec147270a2 | judangs/algorithm | 프로그래머스/2/17680. ［1차］ 캐시/［1차］ 캐시.cpp | #include <string>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
bool compare(pair<string, int> a, pair<string, int> b) {
return a.second < b.second;
}
int solution(int cacheSize, vector<string> cities) {
int answer = 0;
vector<string> cache(cacheSize);
for(... | ALGO | 0.999668 | 5.478844 |
81f5dda2-5fd7-497b-9f24-38702867b94a | LanceYing2004/leetcode-practice | Arrays/Two Pointers/example3_merge.cpp | #include <vector>
#include <iostream>
#include <random>
#include "timer.h"
using namespace std;
vector<int> combine(vector<int>& arr1, vector<int>& arr2) {
int arr1_counter = 0;
int arr2_counter = 0;
vector<int> new_array;
while (arr1_counter < arr1.size() && arr2_counter < arr2.size()) {
i... | ALGO | 0.999787 | 5.280295 |
6dcae541-dbc3-4d00-8f96-0c306f5396d5 | DarshanRokkad/My-all-Codes | 2.C++_Program/73_Num_in_word.cpp | // to convert number into words
#include<iostream>
using namespace std;
int main()
{
int n , r , rev=0 ;
cout<<"Enter the number to convert it into words: ";
cin>>n;
// if number is 256 then it while take from 6 then 5 and then 2
while(n>0)
{
r=n%10;
n=n/10;
rev = re... | ALGO | 0.998542 | 4.183163 |
d0b6cd97-ce86-4348-90b7-01711723014d | VadimITMO2022/ITMO.CourseCpp.2023 | Lab5/Ex3-2.cpp | #include <iostream>
#include <windows.h>
using namespace std;
void show_array(const int Arr[], const int N)
{
for (int i = 0; i < N; i++)
cout << Arr[i] << " ";
cout << "\n";
}
bool from_min(const int a, const int b)
{
return a > b;
}
bool from_max(const int a, const int b)
{
return a < b;
}
void bubble_sort... | ALGO | 0.999953 | 4.555235 |
58661b02-de1f-4771-b583-c415c0132dfa | SnowySparks/Algorithm_Solve | BackJoon_solved/그래프/5567_결혼식.cpp | #include <iostream>
#include <algorithm>
using namespace std;
#define f(a,b,c) for(int a=b; a<c; a++)
int p[502];
int parent(int n) {
if (n == p[n]) return n;
else return p[n] = parent(p[n]);
}
void _unite(int a, int b) {
a = parent(a);
b = parent(b);
if (a!=b) p[max(a,b)] = min(a,b);
}
int m... | ALGO | 0.999769 | 4.211828 |
de4e88ae-1344-4777-b0d9-c280b4d1f9ae | danielhO9/PS | BOJ/11618.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e6 + 3;
vector<ll> basic_multiply_vec(const vector<ll> &x, const vector<ll> &y) {
vector<ll> ret(x.size() + y.size() + 1, 0);
for (ll i = 0; i < x.size(); ++i) {
for (ll j = 0; j < y.size(); ++j) {
ret[i + j] += (x[i] * y[j]) % ... | ALGO | 0.99994 | 3.85225 |
baf74a9f-bd25-42c1-93cf-9c8432d3c9db | TheoryOnline/Node.js | deps/icu-small/source/common/ucharstriebuilder.cpp | #include "unicode/utypes.h"
#include "unicode/ucharstrie.h"
#include "unicode/ucharstriebuilder.h"
#include "unicode/unistr.h"
#include "unicode/ustring.h"
#include "cmemory.h"
#include "uarrsort.h"
#include "uassert.h"
#include "uhash.h"
#include "ustr_imp.h"
U_NAMESPACE_BEGIN
/*
* Note: This builder implementation... | TOOL | 0.94398 | 7.110007 |
ff090fc1-c6b8-4f2f-a8f1-9d7b6928b556 | aspect-ux/kanodesu.github.io | 刷题记录(主leetcode)/Cplusplus/Cplusplus/LeetCode/2531_diffNumSame.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
unordered_map<int,int> hash1,hash2;
bool dfs(string a,string b)
{
}
bool isItPossible(string word1, string word2) {
for (auto c : word1) hash1[c]++;
for (auto c : word2) hash2[c] ++;
if (hash1.size() == h... | ALGO | 0.999986 | 5.34854 |
9303c2c8-9557-4df2-be3d-f15eefe302cf | GabrielSpdf/CompetitiveProgramming | CodeForces/Rounds/Round1000/b.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define FORI(sti, n) for(int i=(sti); i<(n); i++)
#define FORJ(stj, n) for(int j=(stj); j<(n); j++)
#define FORK(stk, n) for(int k=(stk); k<(n); k++)
#define tvi(v) FORI(0, (v).size()) cerr << (v)[i] << " "; cerr << "\n";
#define... | ALGO | 0.999526 | 4.22322 |
839fb8f2-6851-49fb-9fa1-830f72c920d4 | Rob-Alex/meadows-cpp | src/solvers/solver.cpp | #include "solver.hpp"
//test simulator interface implementation -------------------------------------------------------------------------------
TestSimulator::TestSimulator(MTL::Device* pDevice, size_t gridWidth, size_t gridHeight)
: _pDevice(pDevice), _gridWidth(gridWidth), _gridHeight(gridHeight), _gpuComputer(pDev... | ALGO | 0.871841 | 5.381678 |
8b414b8e-7955-49c4-8d63-04020a3c210a | siddh61103/DSA | 0126-word-ladder-ii/0126-word-ladder-ii.cpp | class Solution {
unordered_map<string,int> map;
vector<vector<string>> ans;
string b;
private:
void dfs(string word,vector<string> &vec){
int m = map[word];
if(word == b){
reverse(vec.begin(),vec.end());
ans.push_back(vec);
reverse(vec.begin(),vec.end(... | ALGO | 0.99998 | 5.737541 |
9f871901-027d-434a-8414-3095920df40f | coeing/cframework | framework/ext/boost/libs/math/example/find_scale_example.cpp | // find_scale.cpp
// Example of finding scale (standard deviation) for normal (Gaussian).
// Note that this file contains Quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!
//[find_scale1
/*`
First we need some includes to access the __normal_distrib,
the algorithms ... | ALGO | 0.998502 | 6.640335 |
aeeccb35-3af5-401c-919c-15c47c363482 | arriannee/logaritmos-tarea2 | graph.cpp | #include <iostream>
#include <random>
#include <vector>
#include <map>
using namespace std;
// Definición de una arista
struct Edge {
int start; // Nodo de origen
int end; // Nodo de destino
double weight; // Peso de la arista
Edge() : start(-1), end(-1), weight(0.0) {} // Constructor po... | ALGO | 0.998022 | 4.596526 |
426d98f3-d12c-418e-b3a2-adc875f2e612 | morris821028/UVa | volume107/10720 - Graph Construction.cpp | #include <stdio.h>
#include <stdlib.h>
int cmp(const void *i, const void *j) {
return *(int *)j - *(int *)i;
}
int solve(int n, int deg[]) {
int i, j;
qsort(deg, n, sizeof(int), cmp);
for(i = 0; i < n; i++) {
if(deg[i] > 0) {
for(j = i+1; j < n; j++) {
deg[j] --;
deg[i] --;
if(deg[j] < 0) return ... | ALGO | 0.999955 | 4.077168 |
c8778380-7d3d-4c06-a93c-010c5653e8a0 | tonyz74/CompetitiveProgramming | Problems/USACO/Gold/CF_LevelGeneration.cpp | #include <iostream>
#include <vector>
using namespace std;
using i64 = long long;
bool can_build(i64 n, i64 mid) {
i64 n_bridges = mid / 2;
if (mid % 2 != 0) n_bridges++;
// e, f, g -> a -> b -> c -> d
// n_bridges takes up n vertices
if (n <= n_bridges) return false;
// a b -> c -> d
... | ALGO | 0.999781 | 5.466909 |
878fae45-8004-44e0-8fdd-8afbc4570085 | cielavenir/procon | atcoder/tyama_atcoderrcocontest2017qualA.cpp | #include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;
const int D[4][2]={ //Right,Up,Left,Down
{0,1},
{-1,0},
{0,-1},
{1,0},
};
class Maze{
vector<string> &v;
int d,threshold;
public:
int x,y;
Maze(int _x,int _y,int _d,int _threshold,vector<string>&_v)
: x(_x),y(_y),d(_d)... | ALGO | 0.99989 | 3.402916 |
68399a2d-ed09-4946-8496-d7d04c0e98da | jiangyinzuo/algorithm | src/exercise/xi_an_nowcoder/e.cpp | //
// Created by jiang on 2020/5/23.
//
#include <cstdio>
int arr[112];
int main() {
int t;
scanf("%d", &t);
int n, m, k;
while (t--) {
scanf("%d %d %d", &n, &m, &k);
for (int i = 0; i < n; ++i) {
scanf("%d", arr + i);
}
int cur_layer = 0;
int answ... | ALGO | 0.999832 | 3.844388 |
1de751c1-6556-4084-96da-00804e34d3b1 | Fipac/llvm-project | pstl/test/std/algorithms/alg.sorting/partial_sort_copy.pass.cpp | // UNSUPPORTED: c++98, c++03, c++11, c++14
// Tests for partial_sort_copy
#include "support/pstl_test_config.h"
#include <cmath>
#include <execution>
#include <algorithm>
#include "support/utils.h"
using namespace TestUtils;
template <typename T>
struct Num
{
T val;
Num() : val(0) {}
Num(T v) : val(v)... | TEST | 0.979597 | 6.972824 |
5afc79b6-b509-4c76-8b44-d593052acca1 | LincolnMatheus97/ADS-IFPI | Exercicios_ED_I/Bee/1012_basico.cpp | #include <stdio.h>
#include <iostream>
using namespace std;
main() {
double a, b, c;
cin >> a >> b >> c;
double area_TrianRetang = (a * c) / 2;
double area_Circulo = 3.14159 * (c * c);
double area_Trapezio = ((a + b) * c) / 2;
double area_Quadrado = b * b;
double area_Retangulo = a * b;
... | ALGO | 0.993497 | 3.540221 |
67009f45-7b94-4f3a-8f87-cc12086ed23d | InvictusY/jianzhi-offer | 面试题23：链表中环的入口点.cpp | /*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};
*/
class Solution {
public:
ListNode* EntryNodeOfLoop(ListNode* pHead)
{
if(pHead==nullptr || pHead->next==nullptr)
return nullptr;
ListNode* fast = pHead;
... | ALGO | 0.99997 | 4.748595 |
f97b15f7-2fb6-49b2-9e9b-4053b58a672a | Rajeev0651/Codeforces | Set_4/1154B.cpp | //Jai Shree Ram
#include <bits/stdc++.h>
using namespace std;
#define l long
#define ll long long
#define FOR(i, a, b) for (auto i = a; i <= b; i++)
#define FOREV(i, a, b) for (auto i = a; i >= b; i--)
void solve()
{
int N;
cin >> N;
int A[N];
FOR(i, 0, N - 1)
{
cin >> A[i];
}
int mxval = *max_eleme... | ALGO | 0.999927 | 3.87056 |
96dbdf65-d8d7-49fb-b3c4-76914b129caf | MdSourovAhmed/DSA | STRING/LCS.cpp | #include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <stdio.h>
#include <bitset>
#include <stdlib.h>
typedef long lon... | ALGO | 0.999993 | 3.829241 |
ac32a991-5daa-4b0e-bc6c-c0df5e4bc771 | skbkontur/contests | internship_cs_mar24/jury_solutions/cpp/a.cpp | #include <iostream>
#define int long long
using namespace std;
signed main() {
int n, t;
cin >> n >> t;
int L = 0, R = 0, a, b;
for (int i = 0; i < n; ++i) cin >> a, L += a;
for (int i = 0; i < n; ++i) cin >> b, R += b;
if (L <= t && t <= R)
cout << "YES\n";
else
cout << "... | ALGO | 0.999978 | 4.005942 |
9d7d1bf5-8abd-4a67-aca0-5b1af0ee3a98 | akhmed9505/IndustrialProgramming | Практика 2/Задача 2/main.cpp | #include <iostream>
#include "Circle.h"
using namespace std;
int main()
{
setlocale(LC_ALL, "Russian");
Circle mas[3];
float r, x, y;
for (int i = 0; i < 3; i++) {
cout << "Введите значения радиуса и координат центра окружности №" << i + 1 << " через пробел: " << endl;
cin >> r >> x ... | ALGO | 0.996973 | 3.700301 |
5573cb7f-e34e-41bd-86f1-94727dc677b8 | Mangern/kattis | invasion/main.cpp | #include <bits/stdc++.h>
#include <queue>
/*MMMMMMMMMMMMMMMMMMMMMMMMMMMMWWNXXKK0KXXXXXXNNNWWWMMMMMMMMMMMMMMMMMMMMMMMMMMM*/
using namespace std;/*MMMMMMWKklc:codl:clldxkkxxkkOXNWMMMMMMMMMMMMMMMMMMMMMMMM*/
using ll=long long;/*MMMMWXkl,...',cddc,,,,:oxkxdooox0NMM*/using ld=long double;
const int/*MMMMMMMWNXK0kxd:........... | ALGO | 0.999793 | 4.267385 |
e5fd6409-608c-4f81-9001-17ec796ee649 | raptor-mvk/ACM | v.2011/Solutions_new/1023.cpp | #include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
for(int i=2;i<n;i++)
if(!(n%(i+1))) {
cout<<i;
break;
}
} | ALGO | 0.999932 | 3.371843 |
38f552f1-5535-490d-846c-546951a148b3 | penguinglin/LeetCodePrac | MEDIUM/3. Longest Substring Without Repeating Characters/3.cpp | #include<iostream>
#include<string>
#include<vector>
#include<map>
using namespace std;
class Solution {
public:
int lengthOfLongestSubstring(string s) {
map<char, int> record;
int maxLen = 0, start = 0;
for (int curIndex = 0; curIndex < s.size(); curIndex++) {
char nowChar = s[curIndex]... | ALGO | 0.998923 | 5.563749 |
0428c697-28f0-496b-b306-286cb1e55042 | gkondas/Leetcode-Solutions | 36-valid-sudoku/36-valid-sudoku.cpp | class Solution {
public:
char period = '.';
char comma = ',';
bool checkRow(vector<vector<char>>& board){
for(auto row:board){
map<char,int> mp;
for(auto val:row){
if(val == period || val == comma) continue;
i... | ALGO | 0.999876 | 6.309424 |
33bc8b87-370d-42b9-9218-017b95ed0d08 | up-ak/programim2024 | Java11/kombino_4a.cpp | #include <iostream>
using namespace std;
void kombino(int a, int b)
{
cout << a + b << endl;
}
void kombino(string a, string b)
{
cout << a << " " << b << endl;
}
int main()
{
kombino(1, 2);
kombino("Hello", "World");
return 0;
} | ALGO | 0.869496 | 4.435866 |
267674f6-03f4-4513-816d-f504e4689711 | GambitBSM/gambit_1.0 | contrib/MassSpectra/flexiblesusy/models/MSSMNoFV/MSSMNoFV_effective_couplings.cpp | // File generated at Sat 27 Aug 2016 12:50:22
#include "MSSMNoFV_effective_couplings.hpp"
#include "effective_couplings.hpp"
#include "standard_model.hpp"
#include "wrappers.hpp"
namespace flexiblesusy {
using namespace effective_couplings;
#define INPUTPARAMETER(parameter) model.get_input().parameter
#define MODE... | TOOL | 0.941408 | 5.418405 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.