uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
18c2211c-4c39-4e5c-bc60-3dcb67e818b3 | liaoniu/cam | CFD/Practical_1/gpt2.cpp | #include <iostream>
#include <vector>
#include <cmath>
#include <fstream>
using namespace std;
int main() {
// Define parameters
double a = 1.0; // Advection coefficient
double dx = 0.01; // Spatial step size
double dt = 0.01; // Time step size
double T = 1.0; // Total simulation tim... | ALGO | 0.999961 | 5.396199 |
93eeb382-6f21-4b5b-af7e-9addde3229e5 | Su-long-ai/Data-structure-implementation | Sequence table.cpp | #include <iostream>
using std::cout;
using std::endl;
template<class T>
class SequentialList
{
public:
SequentialList(int maxsize)
{
elem = new T[maxsize];
length = 0;
this->maxsize = maxsize;
}
~SequentialList()
{
delete[] elem;
}
T operator[](int a)
{
... | ALGO | 0.996181 | 4.021251 |
64be6379-c99b-4603-95d3-8f4d2cdd3ecc | elissabj/training | Codeforces/boyOrGirl.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
map<char, int> dict;
string s; cin >> s;
for(int i = 0; i < s.size(); i++){
dict[s[i]]++;
}
if(dict.size() % 2 == 0){
cout << "CHAT WITH HER!\n";
}else{
cout << "IGNORE HIM!\n";
}
return 0;
} | ALGO | 0.99834 | 3.844798 |
4b1b0177-9b56-47c9-8be6-5d520d91b27b | RafaelVelhoGarcia/Competitive-Programming | CodeForce/InsetDigit.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int t; cin >> t;
while(t--) {
int n; cin >> n;
int d,num; cin >> d;
cin.ignore();
vector<int>a;
vector<int>ans;
bool hap = false;
for (int i = 0; i < n;i++) {
string s;
co... | ALGO | 0.98621 | 3.273945 |
d20a2949-d49c-442a-a544-a2edbfd555a5 | sosa-facundo/programacion-1 | guia-2/ej-12/main.cpp | #include <iostream>
using namespace std;
/**
Hacer un programa para ingresar tres nmeros diferentes y determinar e
informar el nmero del medio.
Sugerimos probar CADA UNA de las siguientes 6 combinaciones.
N1=8, N2=6, N3=10. Valor del medio: 8. N1=8, N2=10, N3=6. Valor del medio: 8
N1=6, N2=8, N3=10. Valor del medio: 8.... | ALGO | 0.998359 | 4.207172 |
7fd3c0f1-3031-47aa-a7ff-5966a12e88d0 | MathProgrammer/CodeForces | Contests/Div 3 531/Programs/Array K Colouring.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#define all(v) (v).begin(), (v).end()
using namespace std;
struct bricks
{
int value, position;
int operator<(const bricks &b) const
{
return (value < b.value);
}
};
int main()
{
int no_of_elements, no_of_colours;
cin >> no_of_elements >> no_of_colo... | ALGO | 0.999997 | 3.934086 |
4f79e035-f49c-45ad-93a4-d78921ab7e44 | libigl/libigl-legacy | include/igl/sample_edges.cpp | IGL_INLINE void igl::sample_edges(
const Eigen::MatrixXd & V,
const Eigen::MatrixXi & E,
const int k,
Eigen::MatrixXd & S)
{
using namespace Eigen;
// Resize output
S.resize(V.rows() + k * E.rows(),V.cols());
// Copy V at front of S
S.block(0,0,V.rows(),V.cols()) = V;
// loop over edges
for(int i... | ALGO | 0.999328 | 3.487951 |
7946fe1f-f758-42cb-ae97-9ede02090a9d | Geminicodedreamer/Cplus | 太阳.cpp | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 200010;
typedef pair<int, int> PII;
int n, X, Y;
int T;
bool vis[N];
struct Node
{
int x, y, id;
} a[N * 2];
void solve()
{
cin >> n >> X >> Y;
for (int i = 1; i <= n; i++)
{
int x, y, l;
cin >> x >> y... | ALGO | 0.999695 | 3.921865 |
e1311f7a-1109-4a04-ba41-b784212357f0 | ishandutta2007/codeforces | zhoushang2003/normal/1268/D.cpp | #include<bits/stdc++.h>
using namespace std;
const int N=2002;
int n,a[N][N],c[N],p[N],t,A;
string s[N];
bool C()
{
for(int i=1;i<=n;i++)
p[i]=c[i];
sort(p+1,p+n+1),t=0;
for(int i=1;i<n;i++)
{
t+=p[i];
if(t==i*(i-1)/2)
return false;
}
return true;
}
void S(int x)
{
for(int i=1;i<=n;i++)
c[x]-=a[x][i]... | ALGO | 0.999899 | 3.276323 |
97a2a5c7-f252-4de5-8655-e3cc2206f697 | ilutsav/TodosListApp | 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.998859 | 6.785645 |
e7fec2f7-ab7e-4349-b13b-8e9e892c9a24 | LSTS/dune | src/DUNE/Plans/TimeProfile.cpp | // DUNE headers.
#include <DUNE/Plans/TimeProfile.hpp>
namespace DUNE
{
namespace Plans
{
float
TimeProfile::distance2D(const Position& new_pos, const Position& last_pos)
{
return Coordinates::WGS84::distance(new_pos.lat, new_pos.lon, 0.0,
last_pos.lat, l... | TOOL | 0.899404 | 6.129574 |
b7557f42-5c47-47ec-852b-1f533a65d1c6 | alexandraback/datacollection | solutions_2700486_0/C++/Cho/GCJ2.cpp | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
using namespace std;
#define iss istringstream
#define pb push_back
#define cs c_str()
#define frr(i,a,b) for(i=(a); i<(b); i++)
#de... | ALGO | 0.999441 | 3.760839 |
dbf6e8ed-d845-4563-8fd0-8497978d560d | aatiq1443/Leetcode-Practice | 1905-count-sub-islands/1905-count-sub-islands.cpp | class Solution {
public:
void dfs(int i , int j , vector<vector<int>> &vis2 , vector<vector<int>> &grid1 , vector<vector<int>> &grid2 , int &ans ){
if(i<0 || i>=grid2.size() || j<0 || j>=grid2[0].size() || vis2[i][j]==1 || grid2[i][j]==0) return ;
if(grid1[i][j]==0) ans =0;
... | ALGO | 0.999967 | 6.166842 |
3cfcf98e-dc6a-47ec-a27d-050c9a4e88f2 | n1khilmane/Leetcode | reverse-words-in-a-string/reverse-words-in-a-string.cpp | class Solution {
public:
string reverseWords(string s) {
string result;
int i = 0;
int n = s.length();
while(i<n){
while(i < n && s[i] == ' ') i++;
if(i>=n) break;
int j=i+1;
while(j < n && s[j] != ' ') j++;
... | ALGO | 0.99998 | 5.796578 |
f57daa98-b72f-45c5-8aaa-5d34ff09e89d | pritdhanani10/music_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.998799 | 6.776823 |
7cc5c6b0-529f-419c-acda-177174ee6e93 | osirisQdt2810/algorithms | src/cses/cheatsheet/solution/1683 - Planets and Kingdoms.cpp | /*
Problem Name: Planets and Kingdoms
Problem Link: https://cses.fi/problemset/task/1683
Author: Sachin Srivastava (mrsac7)
*/
#include<bits/stdc++.h>
using namespace std;
template<typename... T>
void see(T&... args) { ((cin >> args), ...);}
template<typename... T>
void put(T&&... args) { ((cout << args << " "), ...);}... | ALGO | 0.999834 | 4.87568 |
3ec4fec5-26dc-4c62-933e-eeede9d1c8b3 | Mangern/kattis | convertingromans/main.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
template<typename t, size_t N>
using ar = array<t,N>;
using ii = ar<ll,2>;
using vii = vector<ii>;
using ld = long double;
#define all(v) begin(v), end(v)
const int INF = numeric_limits<int>::max();
con... | ALGO | 0.999779 | 5.707369 |
d15d93a2-ccb4-44d9-91c0-b059391e8892 | SkinXXX/skinxxx | src/pow.cpp | #include "pow.h"
#include "chain.h"
#include "chainparams.h"
#include "main.h"
#include "primitives/block.h"
#include "uint256.h"
#include "util.h"
#include <math.h>
unsigned int GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlockHeader* pblock)
{
/* current difficulty formula, skin - DarkGravity v3,... | ALGO | 0.999305 | 7.057199 |
183e6eb8-fed7-4128-965c-ec78b21deb5e | maruthi-venkat/Leetcode | 967-minimum-falling-path-sum/minimum-falling-path-sum.cpp | class Solution {
public:
int solve(int i,int j,vector<vector<int>>& matrix,vector<vector<int>> &dp,int n){
if(i >= n) return 0;
if(j < 0) return 10000;
if(j >= n) return 10000;
if(dp[i][j] != -1) return dp[i][j];
int left = INT_MAX,right = INT_MAX,center = INT_MAX;
... | ALGO | 0.999998 | 5.982184 |
d744dab9-b0de-49fe-804f-c2562172916a | mahim007/Online-Judge | codeforces/B. Chris and Magic Square.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll a[509][509];
ll r[509],c[509];
ll d1,d2;
ll n,zx,zy;
ll row,col;
map<ll,ll>R,C;
ll checkrow(){
if(R.size()==1) return 0;
else return 1;
}
ll checkdig(){
for(ll i=1;i<=n;i++){
d1+=a[i][i];
}
for(ll j=1;j<=n;j++){
... | ALGO | 0.999944 | 3.472467 |
89ecc003-1ec7-43ff-96a1-67703659cf86 | LionsWrath/maratona-treino | Maratona2017/despojados/eratosthenes.cpp | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef unsigned long long ull;
ull _sieve_size;
bitset<1000010> bs;
vector<int> primes;
void sieve(ull upperbound) {
_sieve_size = upperbound + 1;
bs.set();
bs[0] = bs[1] = 0;
for (ull i = 2; i <= _sieve_size; i++)
if (bs[i]) ... | ALGO | 0.998785 | 4.939993 |
5c23ba45-3de4-4729-aad8-aa771d12152e | Amit-10101/CrackYourInternship | 08. Tree/23. Binary Tree Right Side View.cpp | class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
vector<int> ans;
queue<TreeNode*> q;
q.push(root);
while (!q.empty()) {
int n = q.size();
for (int i = 0; i < n; i++) {
TreeNode* front = q.front();
q.pop();... | ALGO | 0.999969 | 6.351143 |
d18b5ff7-67db-430c-89ef-c4828328ac4f | bsh0315/BaekjoonPS | silver/10814.cpp | // 10814 나이순 정렬.
#include<bits/stdc++.h>
using namespace std;
int main(){
int N = 0;
cin >> N;
vector<pair<int,pair<int, string>>> pair(N);
for(int i = 0; i<N; ++i){
cin >> pair[i].second.first >> pair[i].second.second;
pair[i].first = i;
}
stable_sort(pair.begin(), pair.end(... | ALGO | 0.999739 | 4.469974 |
ebd8eb45-11e8-4a1d-a7a5-7e17694888ce | Paraga2mp/BinarySearchTree | src/BST.cpp |
#include <iomanip>
#include <fstream>
#include <iostream>
#include "BST.h"
using namespace std;
typedef Node* NodePtr;
BST::BST() {
root = NULL;
}
BST::~BST() {
delete root;
}
//Function to find greater number.
int BST::Max(int firstNum, int secondNum) {
return (firstNum > secondNum) ? firstNum : se... | ALGO | 0.973188 | 5.482706 |
5fab0470-1ebe-4475-ac57-0de138575a05 | nyaam2/ps | baekjoon24041.cpp | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
long long n,g,k;
cin>>n>>g>>k;
vector<long long>s;
vector<long long>l;
vector<long long>o;
for(int i=0;i<n;i++){
long long si,li,oi;
cin>>si>>li>>oi;
s.push_back(s... | ALGO | 0.999565 | 3.545252 |
65600831-9dbd-45a9-a611-ac4b7bf2ed8f | Md-Noman-Biswas/Codeforces_problems | A_Helmets_in_Night_Light.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define pb push_back
#define llmx LONG_LONG_MAX
#define llmn LONG_LONG_MIN
#define mod 1000000007
const int N = 1e5 + 7;
bool cmp(pair<ll, ll> p1, pair<ll, ll> p2){
if(p1.second =... | ALGO | 0.999963 | 3.847889 |
fbb3527f-a67a-4ca5-ad7d-f9d29dbf7dcb | palmenros/cnn-accel | HLS/conv.cpp | #include "conv.h"
#include <stdint.h>
// NOTE: *Must* be a power of 2
// NOTE: If changed, must also update NUM_PARALLEL_CHANNELS_SHIFT.
#define NUM_PARALLEL_CHANNELS 2
// log2(NUM_PARALLEL_CHANNELS)
#define NUM_PARALLEL_CHANNELS_SHIFT 1
#define PAR_CHAN_MASK (NUM_PARALLEL_CHANNELS - 1)
// Define some loop tripcoun... | ALGO | 0.995155 | 4.89236 |
31bfbdb1-a5ca-4041-b9a9-938326320fb8 | topcpper/cpplib | swaord2offer/google_code_jam/badhorse.cpp | /*************************************************************
*
*badhorse.cpp: tt
*auther : caowg
*Written on : 09/14/13.
*
*************************************************************/
#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
#include <fstream>
using namespace... | ALGO | 0.999777 | 4.43804 |
9de05efa-87c6-4c3b-951f-7151e73b5f22 | clibequilibrium/EquilibriumEngine | 3rdparty/bgfx/bimg/src/image_cubemap_filter.cpp | #include "bimg_p.h"
#include <bimg/encode.h>
#include <bx/rng.h>
namespace bimg
{
// +----------+
// |-z 2|
// | ^ +y |
// | | |
// | +---->+x |
// +----------+----------+----------+----------+
// ... | ALGO | 0.992369 | 7.208078 |
2aa5c8c9-3b31-495d-b72b-5f00cde6fbb7 | MJGHY4848/DS-and-ALGO | Stack/23.1_stack.cpp | #include<iostream>
using namespace std;
# define n 100
class stack{
int* arr;
int top;
public:
stack(){
arr = new int [n];
top = -1;
}
void push (int x){
if(top == n-1){
cout << "Stack Overflow"<< endl;
return;
... | ALGO | 0.989401 | 4.106728 |
5e4db56b-b5c4-46aa-bcf8-14f87c6ca534 | ijlabarca/CoupledBVIE | bemtool/testFEM.cpp | #include <iostream>
#include <vector>
#include <map>
#include <fstream>
#include <string>
#include "bemtool/tools.hpp"
#include "bemtool/parameters.hpp"
#include "castor/matrix.hpp"
#include "castor/linalg.hpp"
#include "castor/smatrix.hpp"
#include "castor/hmatrix.hpp"
#include <omp.h>
using namespace bemtool;
using ... | ALGO | 0.969032 | 4.926635 |
11d5c542-bfb8-416a-b84a-f67b5c1969df | alvinnardo/licode | leetcode/2643.cpp | #include "../template/head.h"
#include <bits/stdc++.h>
vector<int> rowAndMaximumOnes(vector<vector<int>> mat) {
// 思路：模拟
// 时间 O(mn)，空间 O(1)
vector<int> res(2);
int m = mat.size(), n = mat[0].size();
for (int i = 0; i < m; i++) {
int cnt = count_if(mat[i].begin(), mat[i].end(),
... | ALGO | 0.999434 | 5.296421 |
96604cce-3d3f-4775-bfa3-4e5b0338dd49 | avikumar11haz/c- | arrayquestion.cpp | #include<iostream>
using namespace std;
void printnewarray(int y[], int n){
for(int i=0; i< n; i++){
cout << y[i]<< " ";
}
}
void swaparray(int y[], int n){
for(int i = 0; i< n; i+=2){
if(i+1 < n){
swap(y[i], y[i+1]);
}
}
}
int main(){
int n;
cin >> n;
... | ALGO | 0.999787 | 3.982337 |
541dcfd1-ee31-489a-972a-e26d57a1bf2e | letusget/Cplusplus_work | 1.7Hanoi/1.7Hanoi/HanoiDriver.cpp | #define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
using namespace std;
class CHanoi
{
public:
void Move(int n, char source, char station, char target);
static CHanoi* GetInstance()
{
if (m_pInstance==NULL)
{
m_pInstance = new CHanoi; //ڸ࣬ʹ࣬ھͷظ
}
return m_pInstance;
}
private:
void Show(int n, cha... | ALGO | 0.99991 | 4.889812 |
4ba622f6-2462-4494-bf5d-e55ca8d334ef | Azson/machineLearning | py3/leetcodeCN/competition/2020/2020_12_23-1.cpp | # include <cstdio>
# include <string>
# include <vector>
# include <algorithm>
# include <cmath>
using namespace std;
class Solution {
public:
/**
* 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
*
* @param arr int整型vector
* @param a int整型
* @param b int整型
* @return int整型
*/
type... | ALGO | 0.999892 | 4.612616 |
ffb75a28-3768-4e6e-9f6f-ca60021baf06 | Toysoft/NNvision | darknet_apache_nvenc/opencv-3.4.4/modules/imgproc/src/distransform.cpp | #include "precomp.hpp"
namespace cv
{
static const int DIST_SHIFT = 16;
static const int INIT_DIST0 = INT_MAX;
static const int DIST_MAX = (INT_MAX >> 2);
#define CV_FLT_TO_FIX(x,n) cvRound((x)*(1<<(n)))
static void
initTopBottom( Mat& temp, int border )
{
Size size = temp.size();
for( int i = 0; i < bor... | ALGO | 0.998548 | 6.55226 |
418fcef9-4ca4-4142-b696-ab58024fe09e | CoderSwarup/DSA_Mastery | 13_Two_Pointer_Approach/14_Pair_Difference.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void PrintArray(vector<int> &arr){
int size = arr.size();
for(int i=0;i<size;i++){
cout << arr[i] << " ";
}
}
void PairDiffUsingTwoPointer(vector<int> &arr,int target){
int size = arr.size();
int s = 0;
... | ALGO | 0.999971 | 5.213644 |
eed75e70-5efd-46e8-b599-904ae1ddd57d | ashwinkothavade/LeetCode | 3194-find-words-containing-character/find-words-containing-character.cpp | class Solution {
public:
vector<int> findWordsContaining(vector<string>& words, char x) {
vector<int>ans;
for(int i=0;i<words.size();i++){
for(auto it:words[i]){
if(it==x){
ans.push_back(i);
break;
}
}
... | ALGO | 0.999844 | 5.825046 |
33e1649b-6ab3-4235-bbf7-43ab7e55b2a4 | ziwon-park/GPSMobileSLAM | SLAM/gps_offroad_slam/Thirdparty/g2o/g2o/core/optimization_algorithm_gauss_newton.cpp | #include "optimization_algorithm_gauss_newton.h"
#include <iostream>
#include "../stuff/timeutil.h"
#include "../stuff/macros.h"
#include "solver.h"
#include "batch_stats.h"
#include "sparse_optimizer.h"
using namespace std;
namespace g2o {
OptimizationAlgorithmGaussNewton::OptimizationAlgorithmGaussNewton(Solve... | ALGO | 0.997387 | 6.723323 |
76fb3cf8-9cfa-4c88-b7f6-a5cf0023698b | Lililililililililililiiliilil/CPlusPlus-OiMP | STL/Встречалось ли число раньше?.cpp | #include <iostream>
#include "vector"
#include "string"
#include "algorithm"
#include <cmath>
#include "deque"
#include "list"
#include "set"
int main() {
int x;
std::set<int> values;
while (std::cin >> x) {
if (values.contains(x))
std::cout << "YES" << " ";
else {
v... | ALGO | 0.999671 | 4.704409 |
8ea63d4a-6357-494c-9e90-4af60670e7b1 | baibolatovads/work | Algorithms and Data Structures/Stack, queue, dequeue, list/gobliny.cpp | /*В первой строке входных данный записано число N (1N105) - количество запросов
к программе. Следующие N строк содержат описание запросов в формате:
"+ i" - гоблин с номером i (1iN) встает в конец очереди.
"* i" - привилегированный гоблин с номером i встает в середину очереди.
"-" - первый гоблин из очереди уходит к ... | ALGO | 0.999918 | 3.932732 |
80d3b768-66d3-4158-8fd8-022025e687c3 | SaklainTheSpellbinder/Coding | 1-1/C/testing/fastio.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k,count=0;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
int t;
cin>>t;
if(t%k==0)
count++;
}
cout<<count<<"\n";
} | ALGO | 0.999822 | 3.556802 |
b90a51ee-bc10-44ec-96c1-029cc2b43455 | damiankawerski/PodstawyProgramowania | Do2Kolokwium/Lab_11_Struktury/zadanie5.cpp | #include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int comparator2(const void* a, const void* b) {
const char* strA = *(const char **)a;
const char* strB = *(const char **)b;
int lenA = strlen(strA);
int lenB = strlen(strB);
int i = 0;
while (i < lenA && i < len... | ALGO | 0.999596 | 4.497306 |
b4046d19-bfc0-4210-beab-5873f39ab65d | devraj2018/Programming_Pathshala | Amazon_Most_Frequently_Asked/25)-Find_Maximum_number_Using_Digits_of_That_Number.cpp | class Solution {
public:
string findMax(string N) {
vector<int>freq(10,0);
for(int i=0;i<N.length();i++)
{
freq[N[i]-'0']++;
}
string ans="";
for(int i=9;i>=0;i--)
{
if(freq[i]==0) continue;
int x=freq... | ALGO | 0.999975 | 6.13166 |
805f2f67-1530-4e64-9f91-357354fabfa0 | kunidesuyo/competitive-programming | ABC/201~250/214/B.cpp | #include <bits/stdc++.h>
#include <cmath>
#define all(x) (x).begin(),(x).end()
using ll = long long;
const ll INF = 1LL<<60;
using namespace std;
int main() {
int s, t;
cin >> s >> t;
int ans = 0;
for(int a = 0; a <= 100; a++) {
for(int b = 0; b <= 100; b++) {
for(int c =0; c <=... | ALGO | 0.999619 | 4.930851 |
5d5b98c9-776e-4574-9cac-f41dec51a354 | raincross7/code-similarity | codes/train_code/problem436/problem436_256.cpp | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1<<20;
int main(){
int n;
cin>>n;
vector<int> a(n);
set<int> dic;
for(int i=0; i<n; i++){
cin>>a[i];
dic.insert(a[i]);
}
int ans = INF;
for(int num=-100; num<=100; num++){
int tmp = 0;
... | ALGO | 0.99993 | 3.92041 |
7439555d-3871-438a-926c-17db21df96cf | zkzk5214/CPP_Code | 42-Lambda/42-LwithSTL_3.cpp | /*https://www.geeksforgeeks.org/lambda-expression-in-c/*/
#include<iostream>
#include<vector>
#include<algorithm>
#include <numeric>
using namespace std;
/*
[ capture clause ] (parameters) -> return-type {definition of method}
*/
// Function to print vector
void printVector(vector<int> v)
{
// lambda expression to p... | ALGO | 0.996896 | 4.777788 |
82eaa725-ff32-465a-bb04-171d34525e3a | itsanamulhassan/data_structure | Week 04 Stack & Queue/14. Queue Implementation and STL/queue_using_singly_linked_list.cpp | #include <bits/stdc++.h>
using namespace std;
class Node
{
public:
int value;
Node *next;
Node(int value)
{
this->value = value;
this->next = NULL;
}
};
class my_queue
{
public:
Node *head = NULL;
Node *tail = NULL;
int queue_size = 0;
void push(int value)
{
... | ALGO | 0.999967 | 4.610976 |
8e86f474-36d0-4c4e-a12c-d017d7ac6fd2 | ishandutta2007/codeforces-t | thenymphsofdelphi/normal/763/B.cpp | #include<bits/stdc++.h>
using namespace std;
// Optimization
//#pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#def... | ALGO | 0.999842 | 3.476451 |
ae76f23a-151a-42a8-8786-ffde29116e25 | Sarvesh-maker14/Daily-DSA-practice | week9/almostSortedOptimised.cpp | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int arr[5] = {4,2,7,9,8};
int n = 5;
int brr[5];
bool flag = true;
for(int i =0;i<n;i++){
int count = 0;
for(int j = 0;j<n;j++){
if(i==j)continue;
if(arr[j]>arr[i]) count++;
... | ALGO | 0.999988 | 3.597961 |
39c2d1d6-d8e2-4fa4-94c5-7ffd9140c98d | muazcp/Competitive-Programming-4 | Chapter 1/I:O + Sequence Only/UVA-10071.cpp | #include<bits/stdc++.h>
using namespace std;
void solve() {
int v, t;
while(cin >> v >> t) {
cout << 2 * v * t << "\n";
}
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
solve();
return 0;
} | ALGO | 0.999676 | 3.850213 |
53e48129-e50b-4026-94f4-f2d7fbc6f5f2 | tusharshah21/Striver-sheet-solution | Striver's A2Z (leetcode)/101. Symmetric Tree.cpp | // Link : https://leetcode.com/problems/symmetric-tree/
// Time complexity: O(n)
// Space complexity: O(1)
/* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : va... | ALGO | 0.999814 | 6.551201 |
fce1459d-8aca-431a-a354-57286bce6a8a | sk-upadhyay/Everyday | 3965-earliest-finish-time-for-land-and-water-rides-i/earliest-finish-time-for-land-and-water-rides-i.cpp | class Solution {
public:
int earliestFinishTime(vector<int>& landStartTime, vector<int>& landDuration, vector<int>& waterStartTime, vector<int>& waterDuration) {
int n = landStartTime.size();
int m = waterStartTime.size();
int totalride = INT_MAX;
for(int i =0;i<n;i++){
i... | ALGO | 0.999931 | 5.8925 |
1c7333b0-69da-4a23-85f2-63ab831c5b9d | sarveshhiwase/CP-Journey | CodeChefAllContests/SummerCode/program5.cpp | #include<bits/stdc++.h>
#define ll long long int
#define mod 1000000007
#define negmod(a) (a%mod + mod) % mod
using namespace std;
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll findlcm(ll arr[], ll n)
{
ll ans = arr[0];
for (int i = 1; i < n; i++)
ans = (((a... | ALGO | 0.999932 | 3.671033 |
96295378-b387-460f-86c5-f6f75c146388 | raincross7/code-similarity | codes/train_code/problem238/problem238_253.cpp | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
... | ALGO | 0.99993 | 4.018646 |
682f4e0d-b2b4-43af-9526-98adb4fec729 | perchuts/CompetitiveProgramming | cf/2127/d.cpp | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define pb push_back
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int ll
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ii = pair<int,int>;
us... | ALGO | 0.999898 | 4.666778 |
d7ce8ce6-1165-4905-a25a-3354498fe7f0 | SubhasmitaSwain-Sw/SubhasmitaSwain-Sw | Untitled88.cpp | #include <stdio.h>
void swapFirstLast(int matrix[3][3], int rows, int cols) {
for (int i = 0; i < rows; i++) {
int temp = matrix[i][0];
matrix[i][0] = matrix[i][cols - 1];
matrix[i][cols - 1] = temp;
}
}
void printMatrix(int matrix[3][3], int rows, int cols) {
for (int i = 0; i < ... | ALGO | 0.999808 | 4.721551 |
e46db1d9-e0be-4dd9-9932-5ed4039f40d4 | Qasak/Algorithm-with-JAVA | cppCode/stack_heap/前K个高频单词_暴力.cpp | bool cmp (const pair<string, int> &a, const pair<string, int> &b) {
if(a.second==b.second)return a.first<b.first; // 值相等时按字典序，不写这句要用stable_sort (因为map是按key排好序的)
else return a.second>b.second;
}
class Solution {
public:
vector<string> topKFrequent(vector<string>& words, int k) {
map<string, int> m... | ALGO | 0.999994 | 5.830292 |
6f6304b0-9a33-4bd4-bd19-ecdafb1eaa32 | teloecho/tdt4260-gem5-prefetcher | src/systemc/tests/systemc/datatypes/int/arith/arith01/arith01.cpp | /*****************************************************************************
arith01.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/****************************************************************************... | TEST | 0.954355 | 5.995373 |
07f1de95-f724-49e3-8081-24d9bbfef1de | colinyoyo26/mlir-standalone-toy | llvm/utils/TableGen/DAGISelEmitter.cpp | #include "CodeGenDAGPatterns.h"
#include "DAGISelMatcher.h"
#include "llvm/Support/Debug.h"
#include "llvm/TableGen/Record.h"
#include "llvm/TableGen/TableGenBackend.h"
using namespace llvm;
#define DEBUG_TYPE "dag-isel-emitter"
namespace {
/// DAGISelEmitter - The top-level class which coordinates construction
/// a... | ALGO | 0.978111 | 7.913171 |
4b240c12-d220-42c7-aeff-26c8ae042688 | elhamAm/faceMorphing | libigl/include/igl/copyleft/cgal/projected_delaunay.cpp | #if CGAL_VERSION_NR < 1040611000
# warning "CGAL Version < 4.6.1 may result in crashes. Please upgrade CGAL"
#endif
template <typename Kernel>
IGL_INLINE void igl::copyleft::cgal::projected_delaunay(
const CGAL::Triangle_3<Kernel> & A,
const std::vector<CGAL::Object> & A_objects_3,
CGAL::Constrained_triangulati... | ALGO | 0.948782 | 6.802978 |
3d9f9824-99cb-4a34-9abb-7d3de8c5ebc7 | CtrlShift-Esc/programers-lv1-32 | Project/main.cpp | #include <string>
#include <vector>
#include <iostream>
using namespace std;
vector<int> decToN(int n, int r, int l)
{
vector<int> vt(l, 0);
int idx = l - 1;
while (n != 0)
{
vt[idx--] = n % r;
n /= r;
}
return vt;
}
vector<string> solution(int n, vector<int> arr1, vector<int> arr2) {
vector<string> answe... | ALGO | 0.999798 | 4.331805 |
b696dca1-5295-4a92-87e7-fa9b394c9bd1 | axlsdtkl/Question-bank | 普及真题/普及2000/luogu 1023/1.cpp | #include<bits/stdc++.h>
using namespace std;
double min1,max1,z;
int x,y,qw,cz,r,mark;
int a[110000],b[110000];
int main(){
scanf("%d",&qw);
scanf("%d%d",&a[1],&b[1]);
r=1;
for(;;){
scanf("%d%d",&x,&y);
if(x==-1)break;
cz=(b[r]-y)/(x-a[r]);
for(int i=a[r]+1;i<=x;i++){
r++;
a[r]=i;
b[r]=b[r-1]-cz;
... | ALGO | 0.999992 | 3.298764 |
5f5637b2-e152-495a-84a7-92ad3432575b | yzzupgo/MFTCG | Data/abc123_b/a5ob7r/wa/4858692.cpp | /* https://atcoder.jp/contests/abc123/tasks/abc123_b */
#include <iostream>
#include <cmath>
#include <vector>
std::vector<int> X(5);
void solve()
{
int min_cost = 123*5;
for (int i = 0; i < 5; ++i) {
int cost_i = std::ceil(X.at(i)*0.1)*10;
for (int j = 0; j < 5; ++j) {
if (i == j) {
... | ALGO | 0.998759 | 3.540732 |
b4047aeb-60f8-4de8-b710-62771a58340d | HUMANIAM/Competitve-Programming-Problems | Competative_programming/Sorting.cpp | #include "Sorting.h"
/// kefa company
bool compare(const Friend& fr1, const Friend& fr2){
return fr1.m < fr2.m;
}
ull findm(const Friend* friends, int n, int d){
sort(friends, friends+n, compare);
ull cmm = friends[0].f, mm = friends[0].f;
int i = 1;
for(int j=0, i=1; i<n && j<n; j++){
if(... | ALGO | 0.998756 | 3.075673 |
97db615e-26b9-4466-81ef-797cd44786b0 | ayush-1560/DSA | 173-binary-search-tree-iterator/binary-search-tree-iterator.cpp | class BSTIterator {
public:
stack<TreeNode*>st;
void pushAll(TreeNode* root){
while(root){
st.push(root);
root=root->left;
}
}
BSTIterator(TreeNode* root) {
pushAll(root);
}
int next() {
TreeNode* curr = st.top();
st.pop();
... | ALGO | 0.999906 | 6.316643 |
83286d6e-c77f-44f9-b34a-f5c4405cad10 | tianchuliang/PolymerPhysicsSimulation | vertex.cpp | #include <stdio.h> /* printf, scanf, puts, NULL */
#include <stdlib.h> /* srand, rand */
#include <time.h> /* time */
#include <iostream>
#include <fstream>
#include <math.h>
#include <vector>
#include "vertex.h"
using namespace std;
//Normal Constructor:
vertex:: vertex (float a, float b, float c, int ... | TOOL | 0.881151 | 3.241656 |
8ef9fd49-6287-4159-9745-f12abc282c67 | cauasousa/simplexe | 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 |
533c5e1f-5832-4466-9a00-c3a801a927b5 | StarkPrince/ONLINE_JUDGES | atcoder/A_-_A_BB.cpp | // https://atcoder.jp/contests/arc136/tasks/arc136_a
// Nice regular problem, the problem is to find the minimum lexicographic string posssible
// so we will replace BA by AB and BB with A
// since the second replace causes a size change, we can't just use arrays
// so will have to use LinkedList or some other data str... | ALGO | 0.999983 | 5.496332 |
82d25712-18f0-457f-a507-934335baef0e | leondreamed-archives/cp-algorithms | backupbipartite.cpp | #include <bits/stdc++.h>
using namespace std;
struct Edge {
int to;
int flow;
int rev;
bool isrev;
Edge(int t, int f, int r, bool i = false) : to(t), flow(f), rev(r), isrev(i) {};
};
const int inf = 0x3f3f3f3f;
const int MAX = 100000;
bool marked[MAX+2];
bool visited[MAX+2];
vector<Edge> adj[MAX+2];
vector<... | ALGO | 0.999962 | 4.68214 |
c71823d5-8287-43b4-b866-d6e9fa4784c1 | cpsa3/backup | OJ/HDU_CODE/1234.cpp | ////////////////////System Comment////////////////////
////Welcome to Hangzhou Dianzi University Online Judge
////http://acm.hdu.edu.cn
//////////////////////////////////////////////////////
////Username: 096040179JY
////Nickname: ___
////Run ID:
////Submit time: 2010-09-27 22:29:05
////Compiler: Visual C++
//////////... | ALGO | 0.99952 | 3.174567 |
9032528b-3de2-4875-932b-0b4c92b73f19 | tangguhlaks/problemsolving | toki/pkd01A.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
struct data{
string id;
unsigned ll a,b,c;
};
void solve(){
ll n,m;cin >> n >> m;
string f; cin >> f;
struct data ml[n];
for(int i=0;i<n;i++){
cin >> ml[i].id >> ml[i].a >> ml[i].b >> ml[i].c;
}
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){... | ALGO | 0.999862 | 4.412159 |
319679ef-7aa5-4c01-941c-5564c19f64ed | andreiplugaru/Electron | ConsoleApplication3/Stiva.cpp | #pragma once
#include "Structuri.h"
Nod* creareNod(int data)
{
Nod* nodNou = new Nod();
nodNou->data = data;
nodNou->next = NULL;
return nodNou;
}
void push(Nod*& top, int data)
{
Nod* nodNou = creareNod(data);
nodNou->next = top;
top = nodNou;
}
int nrElemente(Nod* top)
{
Nod* nodTem... | ALGO | 0.973082 | 3.14508 |
898a369c-e1d6-46a5-933a-e880b33330ac | Swapnil67/dsa | Array/Problems/02-Problems-Hard/cpp/04-print-max-subarray-sum.cpp | /*
* Print Maximum Subarray Sum
* Find the sum of the subarray (including empty subarray) having
* maximum sum among all subarrays
*
* Example 1:
* Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
* Output: [3,6]
* Explanation: The subarray [4,-1,2,1] has the largest sum 6.
* Example 2:
* Input: nums = [-3, -5, -6]
... | ALGO | 0.999772 | 6.083817 |
0a6ac4ac-f20d-4c9b-bc82-d97e35695ea0 | Liuyi-Wang/LeetCode | src/1143_Longest_Common_Subsequence.cpp | static int __ = []() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
return 0;
}();
class Solution {
public:
int longestCommonSubsequence(string text1, string text2) {
vector<vector<int>> dp(text1.size()+1, vector<int>(text2.size()+1, 0));
for (int i = 1; i < ... | ALGO | 0.999852 | 6.056656 |
ff416fe6-5468-4133-a495-8b7e7f4fe907 | prashant-01/Leetcode-Problems | 1014-k-closest-points-to-origin/k-closest-points-to-origin.cpp | class Node {
public :
int d;
int i;
Node(int d , int i){
this->d = d;
this->i = i;
}
};
class Compare {
public:
bool operator()(Node* a , Node* b){
return a->d < b->d;
}
};
class Solution {
public:
vector<vector<int>> kClosest(vector<v... | ALGO | 1 | 5.608944 |
54ff2c49-fe69-4bec-b689-d28ac6b08503 | its-Saurabh23/DSA | Link_List/Reverse_ll.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
class Solution {
public:
ListNode* reverseList(Li... | ALGO | 0.999885 | 5.03289 |
e7d7d6cb-a5fd-49f8-bcdb-e2c7e0557237 | LeeWxx/Problem_Solve | DFS.BFS/BOJ_16928.cpp | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int board_size = 100;
const int start_point = 1;
const int arrival_point = 100;
int board[board_size + 1];
bool checked[board_size + 1];
vector<int> adj[board_size + 1];
int bfs(int v)
{
queue<int> que;
que.push(v);
checked[v] = ... | ALGO | 0.999731 | 4.40054 |
db3e80b9-9ba2-4a6f-b1df-233598f17427 | nitinreddyk10/Design-and-Analysis-of-Algorithm-in-CPP | dijkstra.cpp | #include <bits/stdc++.h>
using namespace std;
#define INF 1e8
vector<int> dijkstra(vector<vector<int>> graph, int src)
{
int n = graph.size();
vector<int> visited;
visited.push_back(src);
vector<vector<int>> dist(graph);
for (int i = 0; i < n; i++)
dist[i][i] = 0;
while (visited.size... | ALGO | 0.999932 | 4.816861 |
5bfe4704-4a9c-4a9b-b447-f20e5d24e060 | karlosvas/olimpiadas-informaticas | DOMjudge-2023/01-parentesis-equilibrados/parentesis-equilibrados.cpp | // Dada una frase que puede incluir parenteis, averiguar si estos estos están bien puestos (cada paréntesis abierto tiene su correspondeinte cerrado y están bien anidados).
#include <iostream>
using namespace std;
int main(){
string text;
while (getline(std::cin, text)){
int fistChar = 0;
... | ALGO | 0.998102 | 4.937665 |
d86c5be9-e288-41bb-ac97-ff04b5dd558e | NeetuSarkar/Striver-A-to-Z | arrays/Easy problems/04_RemoveDuplicate.cpp | //Given a sorted array, we have to remove the duplicate element
#include<bits/stdc++.h>
using namespace std;
int removeDuplicates(vector<int> &arr){
int i = 0;
for(int j = 1; j < arr.size(); j++){
if(arr[i] != arr[j]){
i++;
arr[i] = arr[j];
}
}
return i+1;
}
int main(){
int n;
cout<<"E... | ALGO | 0.99992 | 4.720982 |
2c125b5b-0a39-4028-82fb-f1729708e65e | muffin3864/Algorithm | C_plus/BOJ/03_iteration/11021_A+B-7/11021_A+B-7.cpp | # include <iostream>
using namespace std;
int main()
{
int T, A, B, result;
cin >> T;
for (int i = 1; i < T + 1; i++)
{
cin >> A >> B;
result = A + B;
cout << "Case #" << i << ": " << result << endl;
}
return 0;
} | ALGO | 0.999318 | 5.893047 |
6a35713b-e4a0-4379-a662-22b2400ee845 | LLSwillow/algorithm | 24-1.31最短路/850.cpp | #include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>//使用优先队列
using namespace std;
typedef pair<int,int> PII;//第一个元素表示最短距离，第二个元素表示顶点编号
const int N=1.5e5+10;
int n,m;
int h[N],e[N],ne[N],w[N],idx;
int dist[N];//存储从起点到其他节点当前的最短距离
bool st[N];//标记该点是否已经加入到最短路径中
void add(int a,int b,int c)
{
e[idx]=b... | ALGO | 0.999943 | 4.264944 |
786e4acc-3de8-438c-9a6a-2606f61c5a2a | Greentwip/cocos2d-x | cocos/math/MathUtil.cpp | #include "math/MathUtil.h"
#include "base/ccMacros.h"
#if (CC_TARGET_PLATFORM == CC_PLATFORM_ANDROID)
#include <cpu-features.h>
#endif
//#define USE_NEON32 : neon 32 code will be used
//#define USE_NEON64 : neon 64 code will be used
//#define INCLUDE_NEON32 : neon 32 code included
//#define INCLUDE_N... | TOOL | 0.951573 | 6.360316 |
7c8b793b-6a92-464f-92b7-4005bafe807f | IACJ/dataStructure-exercise | 4-B new/4-B new/4-b.cpp | #include<iostream>
#include<string>
using namespace std;
class BST_node{
public:
int val;
BST_node* l;
BST_node* r;
BST_node(int val =0,BST_node* l=NULL,BST_node* r=NULL){
this->val = val;
this->l = l;
this->r = r;
}
};
class Queue{
public:
int head;
int tail;
BST_node** arr;
Queue(){
head = tail =... | ALGO | 0.999446 | 5.29201 |
a22144a4-9dbd-4e31-906f-af3cc3c78d5a | OperationOWL/OldDevFiles | Data_structures_VIT/bubble_sort/main.cpp | #include<iostream>
void print_arr(int *arr, int n){
for(int i = 1; i<=n; i++){
std::cout<<*(arr+i)<<" ";
}
std::cout<<std::endl;
}
int main(){
int n = 10;
int arr[n] = {0, 70, 90, 80, 10, 60, 30, 50, 40, 20};
std::cout<<"given array: ";
print_arr(arr, n);
for(int i = 0; i < n; ... | ALGO | 0.999546 | 4.681075 |
eb8c465e-7863-4471-943f-ab57e7942ba3 | CodeCamper-Sub/Problem_Solving | baekjoon/3001-4000/3163.cpp | #include <bits/stdc++.h>
#define INF (__LONG_LONG_MAX__ / 3)
typedef long long ll;
using namespace std;
ll n, l, k;
vector<pair<ll, ll>> ants;
vector<pair<ll, ll>> time_to_drop;
void init() {
cin >> n >> l >> k;
ants.resize(n);
for(ll i = 0; i < n; i++) {
cin >> ants[i].first >> ants[i].second;
}
time_t... | ALGO | 0.999973 | 4.231616 |
270053f0-0481-4eeb-888c-4518158c53d3 | emirhantopcu/bbm203 | assignment4/Main.cpp | #include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <queue>
#include <fstream>
using namespace std;
struct Node{
Node(){
}
int frequency = 0;
char label;
Node* zero = nullptr;
Node* one = nullptr;
};
struct less_than_key{
//compa... | ALGO | 0.999552 | 4.668551 |
c98f4a9c-7e93-44a9-ae81-e3ce2e34c61f | ibrahimhabibeg/codeforces | problems/1815/C/sol.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int INF = 2000;
int main(){
int TC, n, m, a, b;
cin >> TC;
while (TC--){
scanf("%d %d", &n, &m);
vector<int> d(n+1, INF), res;
vector<vector<int>> adj(n+1);
for (int i = 0; i < m; i++){
scanf("%d %d", &a, &b);
adj[b]... | ALGO | 0.99952 | 4.248924 |
3498e509-4485-49a1-a88d-14cff270490e | ishandutta2007/codeforces | ywwyww/normal/841/C.cpp | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<cstdlib>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
pii a[200010];
pii b[200010];
int ans[200010];
int main()
{
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a... | ALGO | 0.999993 | 3.328423 |
657d7f21-0438-41ae-a847-0a861817d65d | EloToJaa/OI | XXIV/str/str.cpp | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(int i = (b); i >= (a); --i)
#define TRAV(x,T) for(auto& (x): (T))
#define ALL(T) T.begin(), T.end()
#define TAB(T,a,b) (T)+a, (T)+((b)+1)
#define VAR(x) #x<<" = "<<x<<" "
#define sz(x) (int)(x).size(... | ALGO | 0.999878 | 4.059712 |
63248009-213e-48ff-b786-de8e4e86467e | Renzehua1998/MyNotes | 算法/代码随想录算法PDF/00调试源代码/617.合并二叉树.cpp | /*
* @lc app=leetcode.cn id=617 lang=cpp
*
* [617] 合并二叉树
*/
// @lc code=start
/**
* 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), ri... | ALGO | 0.999996 | 6.553572 |
69b1e44f-1270-42f2-938d-55770856e3c6 | joshualass/CP | Solutions/NonProblems/test1.cpp | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << 49 * 691 * 1489 * 1789 << '\n';
return 0;
} | ALGO | 0.999625 | 3.901202 |
35d5a5a4-e7f7-476b-b118-78ee02f6cc77 | fate7902/study | baekjoon/1 ~ 5000/2776.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> num;
while (n--) {
int tmp;
c... | ALGO | 0.999936 | 4.444854 |
cc55993d-590b-42d8-9d97-4becb9d51501 | codulluiandrei/pbinfo | pbinfo-4566/main.cpp | // rapeanu.cpp
#include <bits/stdc++.h>
using namespace std;
ifstream fin("turism.in");
ofstream fout("turism.out");
const int MOD = 1e9 + 7;
int add(int a, int b) {
a += b;
if(a >= MOD) {
a -= MOD;
}
return a;
}
int sub(int a, int b) {
a -= b;
if(a < 0) {
a += MOD;
}
return a;
}
int mult(int a,... | ALGO | 0.999857 | 3.909769 |
1988ae87-a4fd-4168-963d-4c0bede0ec13 | AleksanderSieklinski/CppAGH | Sem3cpp/lab04/Main.cpp | // Prosze dopisac kod, dodac nowe pliki, tak aby program wykonywal
// sie, a wynik jego dzialania byl taki sam jak podany na końcu tego
// pliku.
// Prosze napisac strukture MapPoint, ktora reprezentuje punkt na
// mapie skladajacy sie z nazwy, dlugosci (longitude) i szerokosci
// (latitude) geograficznej bez oznaczan... | ALGO | 0.948881 | 4.547619 |
abc6cbf2-db6e-417f-9a2c-e01c643d8e6c | dboglobal/DBOGLOBAL | DboClient/Tool/NtlPathEngine/Backup/FullSource_Backup/code/libs/Mesh2D/MeshTraversal.cpp | #include "platform_common/Header.h"
#include "libs/Mesh2D/interface/MeshTraversal.h"
#include "libs/Geometry/interface/Point_PointLike.h"
#include "libs/Geometry/interface/Intersection_PointLike.h"
#include "libs/Geometry/interface/InfinitessimallyOffset_PointLike.h"
#include "platform_common/PointMultiplication.h"
bo... | ALGO | 0.998736 | 4.680921 |
8c8a91a1-34fc-44f0-adfb-9ec0a8364c49 | krozv/codetree-TILs | 240716/문자열 나누기/divide-string.cpp | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string str;
for (int i=0; i<n; i++){
string num;
cin >> num;
str += num;
}
for (int i=0; i<str.length(); i++){
cout << str[i];
if (i%5 == 4){
cout << endl... | ALGO | 0.999691 | 4.139305 |
c26a8a7a-418d-4791-920b-402d4e823565 | durgeshkk/2023_11_23_Codechef | Starters/Starters 90 17-05-2023/4.cpp | #include<bits/stdc++.h>
#include<iomanip>
#include <deque>
#include <bitset>
#include <cstdint>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#defi... | ALGO | 0.999919 | 4.43231 |
414ea6d9-781c-49bc-8910-1ec266c71ed0 | sarvex/leetcode-scopes | basic/sorting/BubbleSort/BubbleSort.cpp | #include <iostream>
#include <vector>
using namespace std;
void bubbleSort(vector<int>& arr) {
int n = arr.size();
for (int i = 0; i < n - 1; ++i) {
bool change = false;
for (int j = 0; j < n - i - 1; ++j) {
if (arr[j] > arr[j + 1]) {
swap(arr[j], arr[j + 1]);
... | ALGO | 0.999912 | 5.136585 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.