uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
77fe0330-085c-4e6a-82fa-8a08c577bc1a | priiikrrrr/Leetcode | 94-binary-tree-inorder-traversal/binary-tree-inorder-traversal.cpp | class Solution {
public:
//morris traversal
vector<int> inorderTraversal(TreeNode* root) {
vector<int>ans;
TreeNode* curr = root;
while(curr!= NULL){
if(curr->left != NULL){
//find the pred
TreeNode* pred = curr->left;
while(pred->r... | ALGO | 0.999998 | 6.656788 |
23a57148-5d7d-4c2c-afd8-f74a0b9b10d2 | DevPatel1479/game | Project Scratch/ammo.js-main/bullet/Extras/CDTestFramework/Opcode/OPC_BoxPruning.cpp | /*
* OPCODE - Optimized Collision Detection
* http://www.codercorner.com/Opcode.htm
*
* Copyright (c) 2001-2008 Pierre Terdiman, <EMAIL>
This software is provided 'as-is', without any express or implied warranty.
In no event will the authors be held liable for any damages arising from the use of this software.
P... | ALGO | 0.999771 | 5.669964 |
9e12eb04-d91b-4df6-915f-c573db040392 | shivamkr022/my-codes | codeforces/codeforces/1734A.cpp | /*
------------------------------------------
| |
| Code Crafted by Shivam |
| |
------------------------------------------
\ , , /
\ | | /
\ \_/ /
\ ----- /
... | ALGO | 0.999362 | 5.042024 |
31fe0713-aa3f-4d0e-a63f-62dede27b327 | abhi-si/DSA-Leetcode | 0001-two-sum/0001-two-sum.cpp | class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> num_map;
for (int i = 0; i < nums.size(); i++) {
int complement = target - nums[i];
// Check if the complement is already in the map
if (num_map.find(c... | ALGO | 0.999939 | 6.761379 |
828c1408-b2f1-4ee5-97f7-a1551763c343 | krutibaraiya/Codeforces | 1167C.cpp | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N = 5e5 + 5;
int n,m,k,ans=0;
int v[N]={0};
int c[N]={0};
vector<int> adj[N];
void dfs(int x)
{
v[x]=ans;
c[ans]++;
for(int i=0; i<adj[x].size();i++)
{... | ALGO | 0.999925 | 3.994153 |
e93e0ea7-74ae-45a3-9310-69105aafc4d2 | Abhishekjadhavv/Assignment---38 | insert.cpp | // Insert the element at beginning and end of the list | C++ STL
#include <iostream>
#include <list>
#include<iterator>
using namespace std;
int main()
{
list<int> l{12,3,4,56,78,99};
list<int>::iterator it = l.begin();
while (it != l.end())
{
cout << *it << " ";
it++;
}
cout<<... | TOOL | 0.875338 | 3.615909 |
15edb809-9536-41a7-b6ce-b0905d54a85d | ishandutta2007/codeforces | zdolny_kaczor/normal/1354/C1.cpp | //Konrad Paluszek,University of Warsaw(former XIV LO Staszic)
//#STAY AT HOME
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#define TIME (chrono::steady_clock::now().time_since_epoch().count())
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define xfm(a,b)a##b
#de... | ALGO | 0.997834 | 4.10291 |
c4fcf190-e00e-479f-b2da-cbf5618074a9 | rndm13/Advent-Of-Code-2021 | day_8/main.cpp | #include <iostream>
#include <cmath>
#include <iterator>
#include <map>
#include <algorithm>
#include <string>
#include <array>
std::istream& operator>>(std::istream &is, std::array<std::string, 15> &input) {
for (int i = 0;i<15;i++)
is >> input.at(i);
return is;
}
int main() {
std::array<std::strin... | ALGO | 0.998759 | 3.972171 |
1f4afdbe-3d93-4fbb-9273-6047ae5798a7 | dariodlfg/MRU-caches | benchmark.cpp | #include <cstdlib>
#include <ctime>
#include <iostream>
#include "dmru.h"
#include "smru.h"
void simulateMatrixProduct(int msize, int batchsize, int vsize_linealigned, ll position_matrix, ll position_vector, MRU* cache, ll& nHits, ll& nAccesses) {
for (int i = 0; i < msize; i++) {
for (int j = 0; j < msize; j++) {... | ALGO | 0.970559 | 4.997673 |
c73ae7c5-bc71-4722-be81-de55b7f58843 | metemaddar/firmware-mod-kit | src/others/squashfs-3.3-grml-lzma/lzma/CPP/7zip/Compress/ByteSwap/ByteSwap.cpp | // ByteSwap.cpp
#include "StdAfx.h"
#include "ByteSwap.h"
STDMETHODIMP CByteSwap2::Init() { return S_OK; }
STDMETHODIMP_(UInt32) CByteSwap2::Filter(Byte *data, UInt32 size)
{
const UInt32 kStep = 2;
UInt32 i;
for (i = 0; i + kStep <= size; i += kStep)
{
Byte b = data[i];
data[i] = data[i + 1];
d... | ALGO | 0.922954 | 5.358013 |
dae2300a-bc2c-4287-a9ea-79a3999f787d | Boikki/haizei1906 | 5.C_PlusPlus/1.sort_245.cpp | /*************************************************************************
> File Name: 1.sort_245.cpp
> Author: 任博宇
> Mail: <EMAIL> / <EMAIL>
> Created Time: 日 2/20 16:07:26 2022
************************************************************************/
#include <iostream>
using namespace std;
#define MAX_N 10... | ALGO | 0.999971 | 4.532851 |
bb9f298a-97c9-4756-8dbf-210d2a41f089 | bothemrun/CAP-Complete-Algorithmic-Programming | Leetcode_All_Solved/319.cpp | //on-off state == (number of distinct factors)%2.
//for square / non-square numbers, (number of distinct factors)%2 == 1 / 0.
//so answer == how many square numbers <= n
#include<math.h>
class Solution {
public:
int bulbSwitch(int n) {
return (int)sqrt(n);
}
};
| ALGO | 0.999869 | 5.621428 |
6032281c-e42e-42b2-9a8f-228364cea321 | AnakUtara/osa_frontend_flutter_test | 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 |
239eb079-58a7-45c2-8feb-bfe1941d2bb4 | WarrenGames/Breakout4 | libraries/genericLib/sources/arithmetic/customArithmetic.cpp | #include "arithmetic/customArithmetic.h"
int getCeilInteger(int numerator, int denominator)
{
return ( numerator + denominator - 1 ) / denominator;
}
unsigned getPowValue(unsigned x, unsigned y)
{
unsigned result{1};
for( unsigned i{0} ; i < y ; ++i )
{
result *= x;
}
return result;
} | ALGO | 0.978738 | 5.451844 |
296669d9-1103-4072-af3e-14daa0f11b10 | jonosquire/athena-cgl | src/pgen/poisson.cpp | // C++ headers
#include <algorithm>
#include <cmath>
#include <cstring> // memset
#include <ctime>
#include <iomanip>
#include <iostream>
#include <stdexcept>
// Athena++ headers
#include "../athena.hpp"
#include "../athena_arrays.hpp"
#include "../coordinates/coordinates.hpp"
#include "../eos/eos.hpp"
#include "..... | ALGO | 0.996606 | 5.947306 |
601109e5-25a3-4ac6-a62d-956362d09806 | Kimokcheon/SCU-CPP | Textbook/C++：面向对象程序设计（第2版）/程序/第1章程序/s1_5/main.cpp | // ļ·:s1_5\main.cpp
#include <iostream>
using namespace std;
inline int add(int x, int y)
{
return x+y;
}
int main()
{
for(int i = 10; i>=0; i--)
cout<<add(i, i)<<' ';
return 0; // ֵ0, زϵͳ
}
| ALGO | 0.993492 | 3.862674 |
82c890ba-4b7c-458f-8cb0-e33019f2e8c4 | stardog-union/boost | libs/algorithm/example/search_example.cpp | #include <string>
#include <iostream> // for cout, etc.
#include <boost/algorithm/searching/boyer_moore.hpp>
#include <boost/algorithm/searching/boyer_moore_horspool.hpp>
#include <boost/algorithm/searching/knuth_morris_pratt.hpp>
namespace ba = boost::algorithm;
const std::string haystack ( "ABACAB is it every... | ALGO | 0.999769 | 6.151109 |
50bbbe55-13b8-4572-8982-ead445d48dca | SurajKumar83/DSA-IN-CPP | DesignLab/P13_Strongly_Connected_Component_Using_DFS_Numbering.cpp | #include <bits/stdc++.h>
using namespace std;
void dfs(int node, vector<int> adj[], vector<int> &pre, vector<int> &post, vector<int> &vis, int &cnt)
{
vis[node] = 1;
for (auto it : adj[node])
{
if (vis[it] == 0)
{
pre[it] = cnt;
cnt++;
dfs(it, adj, pre, p... | ALGO | 0.999922 | 4.914845 |
80f9acd1-6437-470d-bce3-b6869556c55d | Przemol/seqplots_electron | app/Rlinux/lib64/R/library/Rcpp/examples/ConvolveBenchmarks/convolve12_cpp.cpp | // -*- mode: C++; c-indent-level: 4; c-basic-offset: 4; tab-width: 8 -*-
// This is a rewrite of the 'Writing R Extensions' section 5.10.1 example
#include <Rcpp.h>
RcppExport SEXP convolve12cpp(SEXP a, SEXP b){
Rcpp::NumericVector xa(a), xb(b);
int n_xa = xa.size(), n_xb = xb.size();
Rcpp::NumericVector... | ALGO | 0.992314 | 5.574333 |
c03ab8a2-c1a3-484b-b834-2483b9f17cb7 | thanhdat317/code-c-ptit | c04037.cpp | #include<stdio.h>
int cnt[1000001];
int main(){
int n, max= -1e9;
int A[105];
scanf("%d", &n);
for(int i = 0; i< n ;i++){
scanf("%d", &A[i]);
if(A[i]>max) max = A[i];
}
for(int i = 1; i< n; i++){
cnt[A[i]]++;
}
int dem = 0;
for(int i =0 ; i<= max; i++){
if(cnt[i] >= 2){
++dem;
}
}
printf("%d\n",... | ALGO | 0.999979 | 3.176398 |
6f0eff4a-979f-48d8-9bba-5a5bacfcf303 | ReiAccept/Algorithm | luogu/P4779.cpp | #include<bits/extc++.h>
#include<bits/stdc++.h>
#define ll long long
//#define int long long
//#define int __int128
//#define int __uint128_t
#define ull unsigned long long
#define MMST(x,y) memset(x,y,sizeof(x))
using namespace std;
using namespace __gnu_pbds;
const int INF=0x3f3f3f3f;
int read(){char c;int num,f=1... | ALGO | 0.999973 | 3.775002 |
ee5c4dcf-0b90-4cb5-889c-43e016d0277d | kuriyosh/competitive-programming | Atcoder/ABC062/c.cpp | /**
* @author torith
* @date 2018-10-28
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll W,H; cin >> W >> H;
if(W % 3 == 0 || H % 3 == 0){
cout << 0 << "\n";
return 0;
}
ll ans = 1e18;
ll ... | ALGO | 0.999863 | 3.889609 |
f7c05323-b0cb-484a-8312-62002141febd | Xushi8/Code | 2025/April/tianti/6.cpp | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using pii = pair<int, int>;
void solve()
{
int n, m;
cin >> n >> m;
deque<int> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
auto print = [&]
{
for (int i = 0; i < a.size(); i++)
{
... | ALGO | 0.999704 | 4.721591 |
9388ee63-aed8-47e9-a494-f900a4faea64 | fresher96/competitive-programming | MO's algorithm/main.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> ii;
typedef vector <int> vi;
typedef vector <vi> vvi;
typedef vector <ii> vii;
typedef vector <vii> vvii;
#define endl '\n'
#define PB push_back
#define MP make_pair
#define OO (1000000000) // ToD... | ALGO | 0.999806 | 4.351121 |
5ef07f74-50c8-4034-a0b0-382be8a67296 | PRABHUDEESHWARAN/dsa-preparations | arrays/easy/missing_number.cpp | #include<bits/stdc++.h>
using namespace std;
/*
Missing number in an array:
given an array find the missing number in the sequencial order.
-> find the sum from 1 to n and also the sum of the given numbers.
-> their difference is the missing number.
-> another optimal solutionw would be to perform the ... | ALGO | 0.999897 | 3.675919 |
5d650ca8-edad-4040-b5d2-c00544f5f5dd | juliacevedofuentes/UTN | BEECROWD/1016.cpp | #include <iostream>
using namespace std;
int tiempo(int);
int main(int argc, char *argv[]) {
int dist;
cin >> dist;
cout << tiempo(dist) << " minutos" << endl;
return 0;
}
int tiempo(int a){
return (a*2);
}
| ALGO | 0.997171 | 3.121155 |
59f96ade-3277-4442-a064-e8eb604b0e13 | stormhair/csci561 | hw1/agent.cpp | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
using namespace std;
struct Node
{
string name;
map<int, int> neighbor;
};
struct queue_node
{
int w, nid;
string n;
queue_node(int node_id, int weight... | ALGO | 0.99995 | 4.78571 |
a40efd7f-3059-46d7-b1d3-549fb1bdcd66 | TRIQS/triqs_0.x | triqs/gf_local/GF_Bloc_ImFreq.cpp | #include "GF_Bloc_ImFreq.hpp"
const bool Green_Function_Are_Complex_in_time = false;
GF_Bloc_ImFreq::GF_Bloc_ImFreq (boost::python::object IndicesL_,
boost::python::object IndicesR_,
PyObject * Data,
boost::shared_ptr<MeshGF> Mesh,
boost::shared_ptr<TailGF> Tail):
GF_Bloc_Base<COMPLEX>(IndicesL_,Ind... | ALGO | 0.995109 | 4.929877 |
c3f2b009-9d47-4f90-915b-4ef3c1dfb557 | LiquidSmooth-Extended/android_frameworks_av | media/libstagefright/codecs/amrnb/common/src/shr.cpp | /*
Filename: /audio/gsm_amr/c/src/shr.c
------------------------------------------------------------------------------
REVISION HISTORY
Description: Created separate file for the shr function. Sync'ed up with
the current template and fixed tabs.
Description: 1. Modified code by seperating var2=0 condi... | ALGO | 0.99339 | 6.531946 |
1ea41a26-99ac-4721-bc6c-c73e68799dbc | puneet2501/GFG_POTD | cpp codes/Reach the Nth point.cpp | class Solution{
public:
int nthPoint(int n){
// Code here
int mod = 1000000007;
int a = 1, b = 2;
if(n<3) return n;
for(int i=3; i<=n; i++){
int temp = a;
a = b%mod;
b = (temp+a)%mod;
}
return b;
}
};
| ALGO | 0.999936 | 5.237682 |
304e67d2-9dc4-419f-8463-11e6695c9363 | LauZyHou/Algorithm-To-Practice | 剑指Offer注解/4.cpp | #include<bits/stdc++.h>
using namespace std;
// :
// matrix: һά
// rows:
// columns:
// number: Ҫҵ
// ֵ:
// trueʾҵˣfalseʾҲ
bool Find(int* matrix, int rows, int columns, int number)
{
bool found = false;//ʶǷҵ
if(matrix != nullptr && rows > 0 && co... | ALGO | 0.999257 | 4.539563 |
8f366804-6768-4d5b-a11e-aeb63f130e77 | murras/hiu | 2-2/Data Structure/dir5/hw5.cpp | #include <iostream>
#include "post.h"
using namespace std;
void Eval(Expression);
int main(void) {
char line[MAXLEN];
while (cin.getline(line, MAXLEN)) {
Expression e(line); // Assume postfix notation
try {
Eval(e);
}
catch (char const *msg) {
cerr << "Exception: " << msg << endl;
}
}
}
| ALGO | 0.8714 | 4.579397 |
ef7fa511-3a43-4638-82c0-3a0f486cdf9e | Gary0302/NTHU_logic_gate | src/main.cpp | #include <iostream>
#include <string>
#include <vector>
#include <chrono>
#include "circuit.h"
int main(int argc, char* argv[]) {
if (argc != 4) {
std::cerr << "Usage: " << argv[0] << " <circuit_file.in> <pattern_file.txt> <output_file.out>" << std::endl;
return 1;
}
std::str... | ALGO | 0.990801 | 6.528666 |
ea487442-11ec-495d-b611-da1f113192b7 | Justsvetoslavov/Introduction_to_programming | SI/Sem.02/Solutions/Task2.cpp | #include <iostream>
using namespace std;
int main()
{
double speed;
cin >> speed;
if (speed <= 10) {
cout << "Slow" << endl;
} else if (speed < 50) {
cout << "Average" << endl;
} else if (speed < 150) {
cout << "Fast" << endl;
} else if (speed < 1000) {
cout << "Ultra fast" << endl;
} else {
cout <<... | ALGO | 0.966286 | 4.443361 |
a7163b6d-f325-4102-be0d-bcc306e125ea | NametkinDV/Snake-Game_Eat-or-Die.v1.0 | SourceCode/TimeGame.cpp | #include "TimeGame.h"
#include <iostream>
#include <chrono>
using namespace std;
TimeGame::TimeGame()
{
dTimeStartGame = chrono::duration_cast<chrono::microseconds>(chrono::system_clock::now().time_since_epoch()).count(); // Фиксация времени при запуске
}
double TimeGame::timeHasPassed() // Подсчёт времени (... | ALGO | 0.942379 | 3.28178 |
a0056280-f769-4288-9baf-03e40fa8633d | XiaohanSun416/CSCI135 | Lab/Lab2/fibonacci.cpp | //
// Author: Xiaohan Sun
// Course: CSCI-136
// Instructor: Sadab Hafiz
// Assignment: Lab2D
// This assignment writes a program, which uses an array of ints to compute and print all Fibonacci numbers from F(0) to F(59).
//
#include <iostream>
using namespace std;
int main()
{
int fib[60];
// first two terms ar... | ALGO | 0.999761 | 5.296589 |
6d3ab81e-ea90-4ff0-b5eb-02315eacef3f | JesusYanac/vistocheck | 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 |
f0105a83-02ee-4622-8195-830776dc3921 | ChoiGood/Algo | CodingTest/DoItCodingTest/Section3_datastructure/P10986_나머지합.cpp | #include <iostream>
#include <vector>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m; // 배열 원소의 개수 n, 나누는 수 m
cin >> n >> m;
vector<long> A(n + 1, 0);
vector<long> S(n + 1, 0);
vector<int> C(m, 0);
long answer = 0;
for... | ALGO | 0.999961 | 4.159119 |
7a7f1969-2e93-4bbd-946e-1031c8afb36d | morihiroki0330/BattlefieldHorizon | k2EngineLow/ExEngine/effekseer/src/3rdParty/LLGI/src_test/TestHelper.cpp |
#define STB_IMAGE_IMPLEMENTATION
#define STB_IMAGE_WRITE_IMPLEMENTATION
#include "TestHelper.h"
#include "thirdparty/stb/stb_image.h"
#include "thirdparty/stb/stb_image_write.h"
#include <functional>
#include <map>
#include <regex>
#include <string>
struct InternalTestHelper
{
std::string Root;
bool IsCaptureRequir... | TEST | 0.902046 | 6.356987 |
a4933b87-d52d-43f2-83d9-d13f6f3ad9c0 | YurBagoyan/Data_Structures_Algorithms | Algorithms/Sorting/Quick_sort_Hoare_partition/Quick_Hoare-Partition.cpp | #include <iostream>
#include <ctime>
void qSort(int* arr, const int start, const int end);
size_t inputSize();
void randomInputArr(int* arr, const size_t size);
void showArr(int* arr, const size_t size);
void swap(int& a, int& b);
constexpr size_t MAXSIZE = 100;
//Wraper
void quickSort(int* arr, const size_t size)
{... | ALGO | 0.999344 | 5.702347 |
518ba10e-4c06-4f6c-8ab7-30fee1fb4782 | yellowHatpro/Codes-Practice | Leetcode/200_NumberOfIslands.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
vector<int> dx {0,-1,0,1};
vector<int> dy {1,0,-1,0};
void bfs(int m, int n, vector<vector<char>>&grid, vector<vector<int>>& vis, int row, int col){
queue<pair<int,int>> q;
q.push({row,col});
vis[row][col]=1;
while(!q.empty()){
auto [x... | ALGO | 0.999941 | 6.224816 |
3c3a7e8a-87a1-4a35-ba23-cdcad50f9294 | rajkumargautam1/c_plus_plus | function/Iseven.cpp | #include <iostream>
using namespace std;
void iseven (int n){
if(n%2==0){
cout<<n<<" is even"<<endl;
}else{
cout<<n<<" is not even"<<endl;
}
}
int main() {
iseven(2);
iseven(5);
} | ALGO | 0.976135 | 4.241684 |
62e30b0d-1754-40c5-8a06-b9ec47df8724 | pritthiprokashsarkar/problem-set | vjudge/E - Hello Recursion.cpp | #include<bits/stdc++.h>
using namespace std;
void print(int i, int n)
{
if(i>n) return ;
print(i+1, n);
cout<<i;
}
void print1(int i, int n)
{
if(i<1) return ;
print(i-1, n);
cout<<i;
}
int main()
{
int n;
cin>>n;
print(1,9);
print1(1,9);
}
| ALGO | 0.999521 | 3.856121 |
18ed4dcb-d729-4c4f-8990-c567b7133b2e | DharaniRaj1201/piano_ | 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 |
109dab00-2155-4a49-b125-5fe0f3760669 | alexandraback/datacollection | solutions_5751500831719424_0/C++/wuyiqi/final.cpp | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
char s[110][110];
int len[110];
char seq[110];
int top[110];
int a[110][110];
int main() {
int T,ca=1;
freopen("A-small-attempt1.in", "r", stdin);
freopen("A-small-attempt1.out", "w", stdout);
scanf("%d",&T);
while(T--) {
... | ALGO | 0.999773 | 3.74774 |
28d8c6a5-ee46-4f65-ac58-c4e6de6831ed | roy0701/AtCoder | ABC/ABC299/ABC299D.cpp | #include <iostream>
using namespace std;
int main() {
int N, S;
cin >> N;
int l = 1;
int r = N;
while (r - l > 1) {
int m = (l + r) / 2;
cout << "? " << m << endl;
cin >> S;
if (S == 0) {
l = m;
} else {
r = m;
}
}
cout << "! " << l << endl;
return 0;
}
| ALGO | 0.999821 | 3.632427 |
21390688-9805-466e-b49d-ba72451df884 | BitStashBlockchain/BitStash-Core | src/util/strencodings.cpp | #include <util/strencodings.h>
#include <tinyformat.h>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <errno.h>
#include <limits>
static const std::string CHARS_ALPHA_NUM = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
static const std::string SAFE_CHARS[] =
{
CHARS_ALPH... | TOOL | 0.98648 | 6.127562 |
5e9f271a-d932-4c27-a66f-d9fc10a5ee0b | chaksw/slambook2 | ch6/gaussNewton.cpp | #include <iostream>
#include <chrono>
#include <opencv2/opencv.hpp>
#include <Eigen/Core>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main(int argc, char **argv){
double ar = 1.0, br = 2.0, cr = 1.0; // 真实参数值
double ae = 2.0, be = -1.0, ce = 5.0; // 估计参数值初始值 x0
int ... | ALGO | 0.999938 | 4.250243 |
7287878b-5dbd-4afd-9f8e-cb5702666edf | Sudarshan50/Data-Structures-and-Algo. | OOPs/BInary Search Tree(BST)/Catalan Number/allposbst.cpp | #include<iostream>
#include<queue>
using namespace std;
#define rep(i,j,k) for(int i = j;i<k;i++)
#define vi vector<int>
#define br cout<<endl
#define ll left
#define rr right
class node
{
public:
int data;
node* left;
node* right;
node(int val)
{
data = val;
... | ALGO | 0.999974 | 4.049656 |
45403363-6aed-4785-a6b8-87ed9f0d0e1f | daviscoder/Leetcode_2016_Pass1 | 113. Path Sum II.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int>> pathSum(TreeNode* root, int sum) {
vector <vector <int>> res;
... | ALGO | 0.999951 | 5.889544 |
61cd892f-7ee6-47f5-a079-26d3bd1634d2 | ssolaric/leetcode-patterns | DFS/Easy/lc112-path-sum.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.999885 | 6.583939 |
cce0a5c6-f0d5-43c9-b71a-41af1bbc3343 | utk003/Chess-AI | src/mcts_network/tree.cpp | #include "tree.h"
#include <gsl/gsl_randist.h>
#include <gsl/gsl_rng.h>
#include <vector>
#include <utility>
#include <map>
#include <cmath>
#include <functional>
#include <atomic>
#include <iostream>
#include <climits>
#include "../chess/game.h"
#include "decider.h"
#include "../util/thread_util.h"
// Node class
t... | ALGO | 0.999894 | 5.42496 |
15666820-707c-4b29-9b7a-ea142e0ab824 | Abdalla7Ahmed/Hacker_Rank_cpp | 41_Variadics.cpp | #include <iostream>
using namespace std;
// Enter your code for reversed_binary_value<bool...>()
template <bool... digits>
int reversed_binary_value()
{
int value = 0;
int multiplier = 1;
bool bits[] = {digits...};
for (bool bit : bits)
{
if (bit)
{
value += multiplier;
... | ALGO | 0.998347 | 5.250498 |
d8d4cdce-436e-42c2-8c6b-0446702cc725 | ishandutta2007/codeforces | wxhtzdy/normal/1672/D.cpp | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | ALGO | 0.999968 | 4.063977 |
afe55bfd-1695-49c5-bf32-85127bc61c4d | Jeongmin4869/Algorithm | 프로그래머스/2개 이하로 다른 비트.cpp | #include <string>
#include <vector>
using namespace std;
vector<long long> solution(vector<long long> numbers) {
vector<long long> answer;
for(long long num : numbers){
// 짝수의 경우 맨 마지막 숫자가 무조건 0이기 때문에 바로 다음수를 insert
if(num%2==0){
answer.push_back(num+1);
continue;
... | ALGO | 0.999982 | 4.900093 |
fde6814d-3c5b-4a17-876e-02e1abd2449f | HaZem-Osama911/Problem-Solving | Codeforces/C. Sort the array/C. Sort the array.cpp | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
#define ll long long
#define E '\n'
#define sp " "
#define C cout
#define Ci cin
#define br cout<<endl
#define pb push_back... | ALGO | 0.999944 | 3.673353 |
aac1a113-b09f-448d-b15b-35b626100012 | QWWAD/qwwad | src/qwwad_thermal_1d.cpp | #ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include <iostream>
#include <fstream>
#include <string>
#include <gsl/gsl_math.h>
#include "qwwad/options.h"
#include "qwwad/material.h"
#include "qwwad/material-library.h"
#include "qwwad/debye.h"
#include "qwwad/material-property-numeric.h"
#include "qwwad/maths-help... | TOOL | 0.861477 | 4.274953 |
06ad2471-45c1-4e9d-b516-f90d36112bff | maxstw23/kfparticle | StRoot/StKFParticleAnalysisMaker/PionPID.cpp | #include "PionPID.h"
#include <cmath>
const float PionPID::num_std = 3.5;
const float PionPID::nSigma_mean_piplus[] = {0.5172574838601324, 0.5406139994545175, 0.5685486670476058, 0.5344733663771382, 0.49436089694291246, 0.4603414809242065, 0.42720096570839733, 0.3901453906880524, 0.34239177550148964, 0.277998146849953... | ALGO | 0.967227 | 5.650509 |
d6e0fed7-ff9c-45ba-8068-b9955d59768b | chizhizhen/leetcode | algorithms/cpp/permutationSequence/permutationSequence.cpp | // Source : https://oj.leetcode.com/problems/permutation-sequence/
// Author : Hao Chen
// Date : 2014-08-22
/**********************************************************************************
*
* The set [1,2,3,…,n] contains a total of n! unique permutations.
*
* By listing and labeling all of the permutations i... | ALGO | 0.999956 | 5.631195 |
3e64e11f-4de8-4d25-bd3b-547092069fde | vbermudez/CarND-Path-Planning-Project | src/Eigen-3.3/doc/examples/Tutorial_ArrayClass_mult.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
ArrayXXf a(2,2);
ArrayXXf b(2,2);
a << 1,2,
3,4;
b << 5,6,
7,8;
cout << "a * b = " << endl << a * b << endl;
}
| ALGO | 0.990518 | 3.527115 |
3ea81b0c-6efb-4d70-8467-76867831335e | Boffee/ray-tracing | BRDF Sampling/nori_framework_ex2/src/random.cpp | /*
* =======================================================================
* WARNING WARNING WARNING WARNING WARNING WARNING
* =======================================================================
* Remember to put on SAFETY GOGGLES before looking at this file. You
* are most certainly not... | ALGO | 0.998805 | 6.761381 |
ed8859c4-3c97-4368-b9b7-18efd507fd62 | chiichen/leetcode-cpp | src/557.反转字符串中的单词-iii.cpp | /*
* @lc app=leetcode.cn id=557 lang=cpp
*
* [557] 反转字符串中的单词 III
*/
// @lc code=start
#include <algorithm>
#include <string>
#include <vector>
#include <map>
using namespace std;
class Solution {
public:
string reverseWords(string s1) {
string s(s1);
auto it=s.begin();
auto ite=s.begin(... | ALGO | 0.999862 | 6.063437 |
77402e34-6112-4ccb-b4c3-0e020bfb41f8 | caosong/minimal_scene | lib/Eigen/doc/examples/MatrixBase_cwise_const.cpp | #define EIGEN2_SUPPORT
#include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
Matrix3i m = Matrix3i::Random();
cout << "Here is the matrix m:" << endl << m << endl;
Matrix3i n = Matrix3i::Random();
cout << "And here is the matrix n:" << endl << n << endl;
cout << ... | ALGO | 0.984986 | 4.017235 |
4fbaaadc-9bec-4557-a3dd-bb77b99b565f | sawansib/SNIPER | pin_kit/source/tools/Insmix/insmix.cpp | /* ===================================================================== */
/*
@ORIGINAL_AUTHOR: Robert Muth
@Modified by: Ramesh Peri
*/
/* ===================================================================== */
/*! @file
* This file contains a static and dynamic instruction mix profiler
*/
#include "pin.H"
... | TOOL | 0.944345 | 5.797913 |
2785b535-8f08-4914-b0af-ccf9782a8650 | HP3-16/When-i-used-do-cpp | CodeChef/bitwise/test.cpp | #include<bits/stdc++.h>
using namespace std;
void file_i_o(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
}
int main(){
file_i_o();
// int x;
// cin>>x;
// cout<<_... | ALGO | 0.996419 | 3.381936 |
c7444c3a-76b1-431f-ad9d-77c82b2d6084 | NoOneofConsequencePrime/Solutions | LeetCode/C++/pseudo-palindromic-paths-in-a-binary-tree.cpp | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_set>
#include <numeric>
#include <map>
#include <stdlib.h>
#include <time.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> ... | ALGO | 0.999428 | 4.63946 |
80157e80-7146-4132-b220-3d4be1f136db | Chewbbacca37/lab_repos | pr4.3/pr4.3/pr4.3.cpp | // Lab_04_3.cpp
//
// 4.3
// , : .
// 1
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main() {
double F, x, xp, xk, dx, a, b, c;
cout << "xp = "; cin >> xp;
cout << "xk = "; cin >> xk;
cout << "dx = "; cin >> dx;
cout << "a = "; cin >> a;
cout << "b = "; cin >> b;
... | ALGO | 0.991867 | 3.828439 |
4435c0c6-c5a6-455a-be7e-b5656476a046 | vtsozik/methods | algorithms/heap_merge_pre-sorted_arrays.cpp | /*
How to merge k sorted arrays into one big sorted array? (each of them is of the same size n)
Sample Input: k = 3, n = 4
A[3][4] = {{1,4,7,10}, {5,6,8,11}, {2,3,9,12}}
Sample Output: {1,2,3,4,5,6,7,8,9,10,11,12}
Question: Overall complexity of algorithm.
Answer:
k = 3, n = 4
O(log(k)*n*k)
*/
#include <vector>
... | ALGO | 0.999983 | 4.866247 |
610528ce-fd58-4ab5-850d-6c8ff7edc196 | patrick-burasan24/pbinfo | Castel2.cpp | #include <fstream>
#include <queue>
using namespace std;
ifstream cin("castel2.in");
ofstream cout("castel2.out");
int const di[] = {-1, 0, 1, 0};
int const dj[] = {0, 1, 0, -1};
int const NMAX = 1005;
int n, m, k, d[NMAX][NMAX];
char mat[NMAX][NMAX];
inline bool ok(int i, int j) {
if (i < 1 || j < 1 || i > n ... | ALGO | 0.999877 | 3.500291 |
b1e0a6c3-036f-4f64-96bd-5deaf8dbc73f | belzecue/godot-af | thirdparty/embree/kernels/bvh/bvh4_factory.cpp | #include "bvh4_factory.h"
#include "../bvh/bvh.h"
#include "../geometry/curveNv.h"
#include "../geometry/curveNi.h"
#include "../geometry/curveNi_mb.h"
#include "../geometry/linei.h"
#include "../geometry/triangle.h"
#include "../geometry/trianglev.h"
#include "../geometry/trianglev_mb.h"
#include "../geometry/triangl... | ALGO | 0.905083 | 5.982858 |
315f8edd-e4e6-4176-86d5-ebeed480c90d | thomasxm/Akira-obfuscator | llvm/lib/Transforms/Utils/LCSSA.cpp | #include "llvm/Transforms/Utils/LCSSA.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/Analysis/AliasAnalysis.h"
#include "llvm/Analysis/BasicAliasAnalysis.h"
#include "llvm/Analysis/BranchProbabilityInfo.h"
#include "llvm/Analysis/GlobalsModRef.h"
#include "llvm/Analysis/LoopInfo.h"
#i... | ALGO | 0.997009 | 6.713827 |
51223804-4479-4923-9149-7df45c473951 | scfmh/lossysc | summit_performance/ADIOS_CPU/SZ_cpu_simulation_ICLDIWP.cpp | #include <ios> //std::ios_base::failure
#include <iostream> //std::cout
#include <numeric> //std::iota
#include <stdexcept> //std::invalid_argument std::exception
#include <vector>
#include <chrono>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "sz.h"
#define MYADIOS... | DATA | 0.898003 | 4.279108 |
19bfd2b9-1a2a-434b-82b7-112444501a64 | AiMiDi/C4D_MMD_Tool | sdk_s26/frameworks/math.framework/source/maxon/matrix_prs.cpp | #include "matrix_prs.h"
#include <limits>
namespace maxon
{
ROTATIONORDER TranslateRotationOrder(const Id& type)
{
if (type == Id("xyzlocal"))
return ROTATIONORDER::XYZLOCAL;
else if (type == Id("xzylocal"))
return ROTATIONORDER::XZYLOCAL;
else if (type == Id("yxzlocal"))
return ROTATIONORDER::YXZLOCAL;
els... | ALGO | 0.949927 | 7.232695 |
3401fcc3-23a9-4179-9c48-f5f931bece87 | sakib-mustafa-ak/Tasks | 709155H.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define Start ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define ff first
#define ss second
#define pb push_back
#define pr pair<int,int>
void solve(){
in... | ALGO | 0.999714 | 4.181772 |
4cd2a010-9fd7-4a79-a4bb-7544ffd7da00 | Narayan03-t/DSA | 3447-clear-digits/clear-digits.cpp | class Solution {
public:
string clearDigits(string s) {
stack<char> st;
for (char c : s) {
if (isdigit(c)) {
if (!st.empty()) {
st.pop();
}
} else {
st.push(c);
}
... | ALGO | 0.999713 | 6.648867 |
7157f03c-f5f5-4d54-b0da-c422fff8bf01 | raincross7/code-similarity | codes/train_code/problem172/problem172_280.cpp | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
int mean = 0;
rep(i,n) {
mean += x[i];
... | ALGO | 0.999917 | 3.959865 |
07adb9ec-196c-4073-b50b-9ee10b8b1217 | ishandutta2007/codeforces | suiseiseki/normal/1236/B.cpp | #include <cstdio>
#define Mod 1000000007
int ksm(int a,int b){
int ans=1;
while(b){
if(b&1){
ans=1ll*ans*a%Mod;
}
a=1ll*a*a%Mod;
b>>=1;
}
return ans;
}
int main(){
int n,m;
scanf("%d%d",&n,&m);
printf("%d\n",ksm(ksm(2,m)-1,n));
return 0;
} | ALGO | 0.99999 | 4.258401 |
a0e184ce-c4a3-4431-853a-b4071a6aa0b6 | guipiveti/Bottle-Inspection | opencv/sources/modules/imgproc/src/smooth.cpp | #include "precomp.hpp"
#include "opencv2/core/hal/intrin.hpp"
#include "opencl_kernels_imgproc.hpp"
#include "opencv2/core/openvx/ovx_defs.hpp"
namespace cv
{
/****************************************************************************************\
Box Filter
\**************... | ALGO | 0.973426 | 5.255272 |
42a73cb0-8f03-46bd-9b4d-ab2b742dbe4a | DLSireesha/DSA-Leetcode | Prerequisite Tasks - GFG/prerequisite-tasks.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
bool isPossible(int N,int P, vector<pair<int, int> >& prerequisites) {
vector<int> adj[N];
for(auto i:prerequisites){
adj[i.first].push_back(i.second);
}
int indegree[N]={0};... | ALGO | 0.99985 | 6.182565 |
be36932b-54d9-4db9-bdcf-e99108d8eeba | xingyun86/opencv-4.4.0 | samples/tapi/squares.cpp |
#include "opencv2/core.hpp"
#include "opencv2/core/ocl.hpp"
#include "opencv2/core/utility.hpp"
#include "opencv2/imgproc.hpp"
#include "opencv2/imgcodecs.hpp"
#include "opencv2/highgui.hpp"
#include <iostream>
using namespace cv;
using namespace std;
int thresh = 50, N = 11;
const char* wndname = "Square Detection ... | TOOL | 0.99552 | 6.857757 |
d7910e02-0b86-4eb2-a1fa-178bf7376525 | wowoto9772/Hungry-Algorithm | LAVIDA/1928/solution.cpp | #include <stdio.h>
int main()
{
int t;
scanf("%d", &t);
while (t--){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d ", a);
if (!c || c == b)printf("1\n");
else{
if (c > b / 2)c = b - c;
int d = b - 1, s = 1, p = 0;
while (p < c && d){
s += d;
p++;
d -= 2;
}
printf("... | ALGO | 0.999906 | 3.655428 |
63223530-0b7e-498a-a893-3008b643fe71 | Marm4/TP---Algoritmos-y-Programacion-TATETI | Tablero.cpp | #include<iostream>
#include "Tablero.h"
using namespace std;
char** crearTablero(){
char** tablero = new char*[FILA];
for(int i=0; i<FILA; i++){
tablero[i] = new char[COLUMNA];
}
return tablero;
}
void inicializarTablero(char** tablero){
for(int i=0; i<FILA; i++){
for(int j=0; j<COLUMNA; j++){
if(i!=2){
... | ALGO | 0.929756 | 4.356136 |
56a4511c-0d18-437a-b56b-cd9f47a6e06a | LuvKobe/StudyCode-2023 | Code_02_01/RBTree16.cpp | #pragma once
#include <iostream>
using namespace std;
// ɫ
enum Colour
{
RED,
BLACK,
};
// Ķ
template<class K, class V>
struct RBTreeNode
{
//
RBTreeNode<K, V>* _left; // ڵ
RBTreeNode<K, V>* _right; // ڵҺ
RBTreeNode<K, V>* _parent; // ڵ˫ףҪתΪʵֶּΣ
// 洢ļֵ
pair<K, V> _kv;
// ɫ
Colour _col;
// 캯
RBTreeN... | ALGO | 0.990083 | 4.913321 |
49b16733-27e8-4b81-9c80-c48afc698755 | hinahina-chips/OpenCV_practice | 14_pnp.cpp | #include <stdio.h>
#include <opencv2/opencv.hpp>
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
#define IMAGE_NUM (3)
#define PAT_ROW (6)
#define PAT_COL (9)
#define PAT_SIZE (PAT_ROW*PAT_COL)
#define ALL_POINTS (IMAGE_NUM*PAT_SIZE)
#define CHESS_SIZE (25.0)
... | ALGO | 0.990733 | 3.68442 |
f1aa3ff5-6a85-49d5-9543-e5fb8bfd8238 | phumipatc/C_Competitive_Programming | Website/Codeforces/1837/1837B_Comparison_String.cpp | /*
Task : 1837B_Comparison_String
Author : Phumipat C. [MAGCARI]
Language: C++
Created : 25 May 2023 [21:46]
Algo :
Status :
*/
#include<bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i <= (b); ++i)
#define repr(i, a, b) for(int i = a; i >= (b); --i)
#define repl(i, a, b) for(LL i = a; i <= (b); ++i)
#defin... | ALGO | 0.999788 | 4.020111 |
e3394f64-98be-4dd7-a7c8-2a962146030a | RinCloud/TrickCatcher | Datasets/TrickyBugs/GenProgs/dpp_generated_progs_cpp/p03255/p03255_num8_parsed.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, X;
cin >> N >> X;
vector<int> x(N);
for (int i = 0; i < N; i++) {
cin >> x[i];
}
vector<ll> dp(N + 1, 1e18);
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= i + 1; j+... | ALGO | 0.999669 | 4.211889 |
a3ad365f-7692-4d2e-99ee-9b65c687a815 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_7157_1.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
string line;
getline(cin, line);
if (line.size() <= 2) {
cout << "NO" << endl;
return 0;
}
vector<char> cols(line.size());
for (int i = 0; i < line.size(); i++) {
if (line[i] != '.') {
char mask = 0;
if (line[i] == 'B') {
... | ALGO | 0.999729 | 3.559596 |
ac1cc925-379b-4887-8c12-2524d6404bf7 | Jaggesher/LabWork | MultyMedia/LZW-Decoding.cpp | #include<bits/stdc++.h>
#define pf printf
#define sf scanf
using namespace std;
map<int,string>Dictionary;
bool MakeDictionary()
{
ifstream inputFile ("lzwInput.txt");
if (!inputFile.is_open())
{
pf("Cant Open File.\n\n");
return false;
}
Dictionary.clear();
string STemp;
... | ALGO | 0.99174 | 3.047224 |
7f9c7c30-6ebe-4adb-b52b-f6c51e28468e | Veena-Gayathri/Leetcode-solutions | my-folder/0485-max-consecutive-ones/solution.cpp | class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
/* int n=nums.size();
unordered_map <int,int> mp;
int it=0,sum=0;
for(int i=0; i<n;i++){
if(nums[i]==0) it=i;
else mp[it+1]++;
}
for(int i=n;i>=0;i--) if(mp.find(i)!=mp.end... | ALGO | 0.999978 | 6.07915 |
6be0f8ee-7ccd-4ed4-ad03-1a5473a35cf1 | simonizerlol/Kattis-Programming-Practice | modulo.cpp | #include <iostream>
#include <unordered_set>
using namespace std;
int main(){
int i = 1;
int n;
int array[11]; // 10 elements
for(i; i <= 10; i++){
cin >> n;
array[i] = n%42;
}
// returns the number of distinct values
const size_t len = sizeof(array) / sizeof(array[0]); // size_t is a type guaranteed to hold... | ALGO | 0.997375 | 3.921126 |
e6ab0d15-3bb3-462e-9bf7-94e1ad401cc3 | Rithik-rethink/CompetitiveCodingSolution | Piranha.cpp | #include <bits/stdc++.h>
using namespace std;
#define lll int64_t
#define ll long long
#define ar array
#define mod 1000000007
const int mxN=2e5;
int n, a[mxN], k;
void solve() {
//implementation goes here
ll n;
cin>>n;
vector<ll> arr;
set<ll,greater<ll>> st;
for(int i = 0 ; i < n ; ++i ){
... | ALGO | 0.999183 | 4.553704 |
be7d06b5-104f-4769-b3d5-51fc15a35420 | alex2014git/NpuDetectorLib | src/yolov8/yolov8seg_postprocess.cpp | // General includes
#include <iostream>
#include <vector>
#include <cmath>
// Hailo includes
#include "yolov8_common.hpp"
#include "yolov8seg_postprocess.hpp"
using namespace xt::placeholders;
#define IOU_THRESHOLD 0.7
cv::Mat xarray_to_mat(xt::xarray<float> xarr) {
cv::Mat mat (xarr.shape()[0], xarr.shape()[1]... | ALGO | 0.889756 | 6.117294 |
e4fcfdc3-5d2d-4b7f-a21d-ca25bfd890c5 | aminakanwal/100-codes | code 62.cpp | //12345
//1234
//123
//12
//1
#include<iostream>
using namespace std;
int main(){
for(int i=5;i>=1;i--){
for(int j=1;j<=i;j++)
{
cout<<i;
}
cout<<endl;
}
return 0;
} | ALGO | 0.999657 | 3.064993 |
f9593d1c-6a89-47e6-9478-2bc9dd7a2db5 | ishandutta2007/codeforces | um_nik/normal/827/A.cpp | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <ctime>
#include <string>
#include <cstring>
#include <complex>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define mp make_pair
const int ... | ALGO | 0.999919 | 3.207904 |
14e35171-51f2-4034-b40b-266dc265eca4 | zeikar/atcoder | ARC_104_A.cpp | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a + b) / 2 << ' ' << (a - b) / 2 << endl;
} | ALGO | 0.999867 | 4.495463 |
7fe9d310-8ce4-4df2-97fd-eeff6a787b02 | Erica1217/algorithm | 1941 소문난 칠공주/1941 소문난 칠공주/main.cpp | //
// main.cpp
// 1941 소문난 칠공주
//
// Created by 김유진 on 2020/11/25.
//
#include <cstdio>
using namespace std;
char input[10][10];
int dx[5] = {0,1};
int dy[5] = {1,0};
int check[10][10]={0,};
int d[100][3]={0,};
int result=0;
void func(int num, int numS, int x, int y)
{
// printf("%d %d %d %d [%c]\n",num,numS,x,... | ALGO | 0.999162 | 3.083606 |
0f9931ce-fb62-4312-a692-abf31e734703 | JoonYong-Park/Data-Structure | Data_Structure/c3.cpp | #include "c3.h"
// call by value
void swap1(int a, int b) {
int temp = a;
a = b;
b = temp;
}
// call by reference
void swap2(int* a, int* b) {
int temp = *a;
*a = *b;
*b = temp;
}
// call by reference
void swap3(int* a, int* b) {
int temp = *a;
*a = *b;
*b = temp;
} | TOOL | 0.997562 | 4.30111 |
1f6d934d-7904-4e55-8146-dc7ae05c2bb3 | pitiless0514/miniob-2024 | src/observer/sql/operator/hash_group_by_physical_operator.cpp | //
// Created by WangYunlai on 2024/05/30.
//
#include "common/log/log.h"
#include "sql/operator/hash_group_by_physical_operator.h"
#include "sql/expr/expression_tuple.h"
#include "sql/expr/composite_tuple.h"
using namespace std;
using namespace common;
HashGroupByPhysicalOperator::HashGroupByPhysicalOperator(
v... | TOOL | 0.985621 | 6.393236 |
65caa49a-3419-440a-8c8b-34e67156ebac | kunyavskiy/competitive-programming-archive | codeforces.com/round/230/E.cpp | //#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdi... | ALGO | 0.999957 | 3.558041 |
871467f9-1073-4b77-ae44-dcdf64e09217 | ngctnnnn/evo_optim_cpp | include/boost/libs/graph/example/remove_edge_if_undir.cpp | #include <boost/config.hpp>
#include <iostream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graph_utility.hpp>
using namespace boost;
/*
Sample output:
original graph:
0 <--> 3 3 2
1 <--> 3
2 <--> 0 3
3 <--> 0 0 1 2
1(0,3) 2(0,3) 3(1,3) 4(2,0) 5(3,2)
removing edges connecting 0 a... | ALGO | 0.998949 | 6.446238 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.