uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
832e5b26-238c-49b2-8ec6-54d8da1f04c7 | narendranandagiri/Strivers_DSA | Binary-Search/BinarySearch.cpp | //recu
class Solution {
public:
int recur(vector<int> arr,int low, int high, int k){
if(low <= high){
int mid = (low + high) / 2;
if( arr[mid] == k ) return mid;
else if(k < arr[mid]) return recur(arr, low, mid - 1, k);
else return recur(arr, mid + 1, high, ... | ALGO | 0.99998 | 5.751923 |
74b4a767-7e7f-487a-9342-c544dfc355ae | srinath-chakravarthy/ligghts | lib/gpu/lal_buck_coul_long.cpp | /***************************************************************************
buck_coul_long.cpp
-------------------
Trung Dac Nguyen (ORNL)
Class for acceleration of the buck/coul/long pair style.
_________________________________... | TOOL | 0.850832 | 4.744846 |
49a5e3a2-ec7e-455d-80d9-d491ff327766 | ishandutta2007/codeforces | sevlll777/normal/1275/C.cpp | // #pragma GCC optimize("unroll-loops")
#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 <stri... | ALGO | 0.999821 | 5.747164 |
a3f9d5dc-a99b-4c3f-a3a6-550addd3fc0f | Betecher/ofBook_CN | chapters/animation/code/19_multiParticles/src/particle.cpp | #include "particle.h"
#include "ofMain.h"
//------------------------------------------------------------
particle::particle(){
setInitialCondition(0,0,0,0);
damping = ofRandom(0.01, 0.03);
}
//------------------------------------------------------------
void particle::resetForce(){
// we reset the forces every... | ALGO | 0.866258 | 5.507522 |
090648f6-be23-4e3e-ae37-b565cc845c4f | as6325400/CSES | Range_Queries/Range_Xor_Queries.cpp | #include <bits/stdc++.h>
#define int long long
using namespace std;
template<typename T>
class segment_tree
{
private:
public:
template<typename F>
class node{
public:
int lb, rb;
F num, tag;
node<F> *left, *right;
node(){
... | ALGO | 0.999982 | 4.828874 |
ce6d5623-6846-4425-a8da-781720bc8955 | TStr626/AtCoder | ABC291/D.cpp | #include<iostream>
#include<vector>
#include<cmath>
#include<numeric>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
using namespace std;
# define rep(i,n) for(i=0; i<n; i++)
void yes() {
cout << "Yes" << endl;
}
void no() {
cout << "No" << endl;
}
... | ALGO | 0.999948 | 4.408151 |
6d9f4e62-c20b-4a21-a33c-2dcafbef6beb | vishalku03/Array | SORT MATRIX DIAGONAL.cpp | class Solution
{
public:
vector<vector<int>> diagonalSort(vector<vector<int>> &mat)
{
int m = mat.size(); // rows
int n = mat[0].size(); // colomns
unordered_map<int, vector<int>> mp;
// store diagonal elements
for (int i = 0; i < m; i++)
{
... | ALGO | 0.999976 | 6.799083 |
cf7b0ce5-db1c-4528-9101-f4740ffbc4bc | BlackToppStudios/Mezzanine | Mezzanine/src/Physics/constraint.cpp | #ifndef _physicsconstraint_cpp
#define _physicsconstraint_cpp
#include "Physics/constraint.h"
#include "Physics/physicsenumerations.h"
#include "Physics/physicsmanager.h"
#include "Physics/rigidproxy.h"
#include "entresol.h"
#include "stringtool.h"
#include "exception.h"
#include "serialization.h"
#include <btBulle... | TOOL | 0.87816 | 3.574311 |
35db2411-5701-4040-8ccd-23979f09fda8 | gitond/graph_alg_test_env | app/modules/algorithms/commands.cpp | #include <array>
#include <string>
#include "../graphs/graph.h"
#include "dijkstra.h"
// for testing
#include <iostream>
namespace algComms {
std::string execute(int commandId, std::string commFlags[10], graph& g){
switch(commandId){
case 300: // dijkstr
if (commFlags[1] == "") { return "please use correct ... | ALGO | 0.99911 | 4.267247 |
c6038df3-9b86-4789-9038-bc1d8359878e | xjtn18/Programming-Practice-Library | _easy/range_sum_BST/main.cpp | //////////////////////////////////////////////////////
// Author: Jacob Nardone
// Date created: 1/26/2021
// File type: C++ source file
// Description: Calculate sum of values in between given range from a BST.
//////////////////////////////////////////////////////
#include <iostream>
#include <stack>
#include ".... | ALGO | 0.999954 | 6.58475 |
a8b23b2f-9ae7-45dc-b01f-b20c7f8a9f14 | cjinchi/DataStructure | OJ/ds_5_1.cpp | #include<iostream>
#include<string>
//#include<cstring>
using namespace std;
struct node
{
int n;
node *next;
};
int str_len(string x)
{
int i = 0;
while (x[i] != '\0')
i++;
return i;
}
bool str_equal(string str, int begin1, int end1, int begin2, int end2)
{
//return true if str[begin1...end1]==str[begin2...en... | ALGO | 0.999155 | 3.377526 |
1e25b5a9-69d5-401e-9436-84400ef5c6e3 | lottuce-yami/eolymp-problems | cplusplus/7849/main.cpp | #include <algorithm>
#include <iostream>
using namespace std;
int main()
{
int n, min, max;
cin >> n;
int nums[n];
for (int i = 0; i < n; i++)
{
cin >> nums[i];
}
min = *min_element(nums, nums + n);
max = *max_element(nums, nums + n);
for (int i = 0; i < n; i++)
{
... | ALGO | 0.999996 | 4.280759 |
d97ca2fb-ef02-452e-b92c-b02f3b05113d | saktheeswaranswan/leetcode-monk-version-best-resources-big-1 | leetcode/1039/wa.cpp | // OJ: https://leetcode.com/problems/minimum-score-triangulation-of-polygon/
// Author: github.com/lzl124631x
// Note: WA on input [1,3,1,4,1,5]. It's because dp function might work outside of the current polygon.
class Solution {
private:
int getKey(int i, int len) {
return i * 100 + len;
}
unorder... | ALGO | 0.999954 | 5.555042 |
f588cae9-3dfb-4a08-807a-ab8d301bdae2 | rizfanradya/rizfan | pemrograman_dasar/uts/soal_1.cpp | /*
Soal 1
Buatkan program menggunakan c++ untuk menentukan total nilai akkhir seorang mahasiswa pada mata kuliah Pemrograman dasar, dengan ketentuan sebagai berikut :
Point penilaian didapat dari 20% nilai UTS, 20% nilai UAS, 20% nilai TUGAS, 20% nilai ETIKA, dan 20% PRESENSI, Nilai ETIKA didapat dari rata - rata nila... | ALGO | 0.993438 | 4.373855 |
585ab139-db19-44d5-aa47-4e17c9035af2 | encarbassotnopot/42_cpp | cpp08/ex00/main.cpp | #include "easyfind.tpp"
#include <vector>
#include <list>
int main()
{
int items[] = {0, 1, 2, 3, 4};
std::vector<int> vec(items, items + 5);
std::list<int> lst(items, items + 5);
easyfind(vec, 2);
easyfind(lst, 3);
}
| TOOL | 0.969237 | 4.374097 |
efc717df-5429-434b-836b-af6db419e59c | RaiAbhinavPrakash/Leetcode-Solution | 0692-top-k-frequent-words/0692-top-k-frequent-words.cpp | class Solution {
public:
vector<string> topKFrequent(vector<string>& words, int k) {
map<string,int>mp;
for(int i = 0; i<words.size(); i++) mp[words[i]]++;
map<int,vector<string>>m;
for(auto it:mp)
{
m[it.second].push_back(it.first);
}
... | ALGO | 0.999993 | 6.347075 |
b5adca71-9bef-4b17-8a6d-39028eaf3278 | yykkd/Project-2 | RouteFinder.cpp | //
// Created by Yasmin on 11/26/2022.
//
#include "RouteFinder.h"
#include "math.h"
/**
* creates a graph of all valid routes and stores it in a hashmap
* @param available_airlines the airlines that are available to fly
*/
bool RouteFinder::findOneStepPath(string destination_airport){
for(string* arr:... | ALGO | 0.999441 | 4.028066 |
bbc75ceb-74c9-48d8-9a83-f566e65edbf6 | xuwithbean/UnitreeDOG_XU | catkin_ws/src/ser_package/eigen-3.4.0/doc/examples/class_CwiseUnaryOp.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
// define a custom template unary functor
template<typename Scalar>
struct CwiseClampOp {
CwiseClampOp(const Scalar& inf, const Scalar& sup) : m_inf(inf), m_sup(sup) {}
const Scalar operator()(const Scalar& x) const { return x<m_... | ALGO | 0.903569 | 6.430674 |
337a9b7a-27fb-4d3d-98f3-6032afd0de84 | hjiang13/LLMs-in-IR | POJ-104/85/1517.cpp | #include <iostream>
using namespace std;
int main(){
int n;
cin >> "%d",&n);
char a[100];
for(int i=0; i<n; i++)
{
cin >> "%s",a);
if(a[0]-'A'>=0&&a[0]-'Z'<=0||
a[0]-'_'==0||
a[0]-'a'>=0&&a[0]-'z'<=0)
{
for(int j=1; j<100; j++)
{
if(a[j]=='\0')
{
cout << "yes\n");
break;
}
else
if(a[j]-'A'>=0&&a[j]-'Z'<=0||
a[j]-'_'==0... | ALGO | 0.999264 | 3.336092 |
0a6916d8-d3fc-4e9f-ac93-138c697a3045 | happyyouli/algorithms | red_black_tree.cpp | #include <iostream>
using namespace std;
enum RBColor{RED, BLACK};
//RBT结点定义
struct TreeNode {
int key;
TreeNode* left;
TreeNode* right;
TreeNode* parent;
RBColor color;
TreeNode(int x) : key(x), left(NULL), right(NULL), parent(NULL), color(BLACK) {}
};
TreeNode* nil = new TreeNode(0);
//中序遍历RBT
void RBInorde... | ALGO | 0.999436 | 4.111739 |
369c8ad6-6c8b-45dd-b7b2-ff6500d38111 | QDRhhhh/Learning | FDS_2022FallWinterTerm/proj_2/code/src/solver/optimal_match/voting_tree.cpp | #include "voting_tree.h"
/*
* <[ Class Methods Implementations ]>
* [ Class Name ]:
* - CurStage
*/
// Detail comments are in `.h` file!
void CurStage::reset(){
this->curA.reset();
this->curB.reset();
this->curPath.resize(0);
}
// Detail comments are in `.h` file!
void CurStage::storeStage(VotingTree... | ALGO | 0.999586 | 3.822148 |
88014394-884e-4556-b5e5-2e1412796b76 | Chilangdon20/C- | Arrays/Untitled1.cpp | #include<iostream>
using namespace std;
int main(){
int n[5] = {1,2,3,4,5};
int suma;
for(int i=0;i<5;i++){
// inicia desde 0 y es menor a 5 por que llega hasta 4 e.i n-1
suma += n[i]; // i va cambiando por lo que ponemos i dentro de n
}
cout<<suma<<endl;
return 0;
}
| ALGO | 0.999601 | 3.378473 |
cd375df9-827a-4fc8-8cc5-478b4195c93e | prakharsinghch/dsa-practice | 0084-largest-rectangle-in-histogram/0084-largest-rectangle-in-histogram.cpp | class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
stack<int> st;
int ans = 0;
int n =heights.size();
for(int i=0;i<=n;i++){
int curr = (i==n) ? 0 : heights[i];
while(!st.empty() && heights[st.top()] > curr){
int h = he... | ALGO | 0.999969 | 6.591852 |
d7a7179d-7b55-41b5-b1b4-c01d13df7fa7 | tanbin69/DSA-with-c- | c++_for_DSA(phitron)/dynamic_array.cpp | // statice array
// #include<bits/stdc++.h>
// using namespace std;
// int main()
// {
// int a[5];
// for(int i = 0;i<5;i++)
// {
// cin >> a[i];
// }
// for(int i = 0;i<5;i++)
// {
// cout << a[i] << " ";
// }
// return 0 ;
// }
// dynamic array
#include<bits/stdc++.... | ALGO | 0.996069 | 3.36584 |
c958d557-4a45-4643-b30f-7fe8b0e8f2a7 | eleplantttt/leetcode | 代码随想录/动态规划/第八周/最长连续递增序列.cpp | //
// Created by admin on 2023/5/23.
// - 特判
// - 用一个count来重置不连续的序列，将最大的count存入res。
int findLengthOfLCIS(vector<int>& nums) {
if(nums.size() == 0) return 0;
int res = 1;
int count = 1;
for(int i = 1;i < nums.size();i++){
if(nums[i] > nums[i-1]){
count++;
}else{
... | ALGO | 0.999949 | 5.974486 |
be537cfb-4f4d-4855-877f-d5d67d8af4bf | Oric-Software-Development-Kit/osdk | shared_libraries/soloud/src/audiosource/speech/resonator.cpp | #include <math.h>
#include "resonator.h"
#ifndef PI
#define PI 3.1415926535897932384626433832795f
#endif
/* Convert formant freqencies and bandwidth into resonator difference equation coefficents
*/
void resonator::initResonator(
int aFrequency, /* Frequency of resonator in Hz */
int aBandwi... | ALGO | 0.998733 | 5.068546 |
aee188a0-67e4-4d4b-9e60-cd41b37a6e1a | EugeneJun03/My-Projects | C++/practice/Function.cpp | #include <iostream>
using namespace std;
// Same as in python
int add(int a, int b) {
return a + b;
}
int duble(int a) {
return a*2;
}
int main() {
int a,b;
cout << "Double the sum of the two: " << endl;
cin >> a >> b;
cout << "It is " << duble(add(a,b));
return 0;
}
| TOOL | 0.99843 | 5.107569 |
6f311356-cb37-4294-9522-d16892e9bab2 | vvvvvvvector/tasks-cpp | mat_op_pointerToFunc/main.cpp | #include <iostream>
#include <algorithm>
int plus(int, int);
int minus(int, int);
void mat_operation(int *, int *, int, int (*op)(int, int));
void print(int);
int main()
{
int n = 2;
int m1[] = {1, 2, 5, 6};
int m2[] = {2, 5, 1, 8};
// mat_operation(m1, m2, n, plus);
mat_operation(m1, m2, n, min... | ALGO | 0.999397 | 4.67213 |
1a159183-cb98-468f-86f6-85dab3daf591 | BandhiyaHardik/Leetcode_Solutions | daily_problems/179_Largest_Number.cpp | class Solution {
public:
static bool myFunction(int a, int b) {
string s1 = to_string(a);
string s2 = to_string(b);
return (s1+s2) > (s2+s1);
}
string largestNumber(vector<int>& nums) {
sort(nums.begin(), nums.end(), myFunction);
if(nums[0] == 0)
... | ALGO | 0.999987 | 6.189556 |
b4cfa12a-8698-4fb8-bdb6-1669416b95c1 | Jincy7/AlgorithmStudy | BasicAlgorith/IO/11721_print_ten_char.cpp | #include <iostream>
using namespace std;
int main() {
char c[100] = {};
char con[10][10] = {};
int i=0, j = 0;
cin >> c;
while (1) {
if (c[i] == '\0') {
break;
}
else {
con[j][i%10] = c[i++];
if (i % 10 == 0) j++;
}
}
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
cout << ... | ALGO | 0.999151 | 3.110392 |
f63c8b3d-88d9-4910-8c2c-bdfaeec395b8 | kaifshaikh30/carrental | 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 |
d4256070-cac3-4fc1-847b-f6bb443c245d | abidmuin/Codeforces_Problemset_Solution | Solved using C++/Suffix Three/main.cpp | //https://codeforces.com/problemset/problem/1281/A
#include <iostream>
#include <string.h>
using namespace std;
int main()
{
int test=0, len=0;
cin >> test;
int str[test];
for(int i=0; i<test; i++){
string input;
cin >> input;
len = input.size();
if(input[len-1] == '... | ALGO | 0.998434 | 4.922465 |
3b884fda-9b7a-426c-a894-88e5cd79ec39 | VictoriaKostyleva/nsu_labs | evm/1lab/evm_1.cpp | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>//для setw()
#include <ctime>
#include<cstdlib>
#include<stdio.h>//lab
#include<time.h>//lab
#include<sys/times.h>//lab3
#include<unistd.h>
#include<stdint.h>//lab4
using namespace std;
void bubbleSort(int* array, int size) // сортировка пузырьк... | ALGO | 0.998641 | 3.724408 |
3376e1e4-25d1-4534-94f7-b25160f01c4c | SatyaSusarla/Questions | Practice/random practice/permutationsofarray.cpp | // C++ program for the above approach
#include <bits/stdc++>
using namespace std;
// Function for swapping two numbers
void swap(int& x, int& y)
{
int temp = x;
x = y;
y = temp;
}
// Function to find the possible
// permutations
void permutations(vector<vector<int> >& res,
vector<int> nums, int l,... | ALGO | 0.999988 | 5.166388 |
2acfc961-875b-41cf-ab84-698754ed12bb | KevinTMtz/CompetitiveProgramming | ITESM Programming Club/2019_Semester3/BBIN2.cpp | #include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
long long int binarySearch(int arr[], int l, int r, int x);
int main(void){
int arrL, queries;
scanf("%i %i", &arrL, &queries);
int arr[arrL];
for (int i=0; i<arrL; i++) scanf("%i", &arr[i]);
int toSearch, num;
for (int... | ALGO | 0.999676 | 4.306749 |
45c2277b-c47d-4dbf-b3b0-9d42c8a11565 | planetaryambience/ray-tracer | Cylinder.cpp | /*----------------------------------------------------------
* COSC363 Ray Tracer
*
* The cylinder class
* This is a subclass of Object, and hence implements the
* methods intersect() and normal().
-------------------------------------------------------------*/
#include "Cylinder.h"
#include <math.h>
/**
* Cylind... | TOOL | 0.939405 | 6.454835 |
4c028ca2-d39f-4cb6-b1f0-92646ae6b896 | Lye-0407/18020495-TranMinhHieu-INT2215-50 | code-hoc-tap/bai-luyen-tap-3-a/multiply.cpp | void multiply (int* n, int k)
{
if (n != nullptr)
*n = (*n) * k;
} | TOOL | 0.971762 | 3.693211 |
ebe0886c-d0ef-49ea-a78a-c39d4a6ff86b | sailver/acwing | basicAlgorithm/$5_dp/2-1数字三角形.cpp | #include <iostream>
#include <algorithm>
using namespace std;
/*
复习一下
动态规划：
1.状态表示
集合： 所有从起点，走到(i,j)的路径
属性： max
2.状态计算（集合划分）
f(i,j) //* 视频位置：19:00
[曲线救国]
分为来自左上和来自右上
左上：f[i-1,j-1] +a[i,j]
右上：f[i-1,j] + a[i,j]
*/
const int N = 510, INF = 1e9;
i... | ALGO | 0.999979 | 3.594889 |
cb41139a-cfa4-491a-99ed-6c7e9507d4c8 | satake0916/CompetitiveProgrammingLibrary | DFS/topologicalSort.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using Graph = vector<vector<int> >; // グラフ
// トポロジカルソートする
void rec(int v, const Graph &G, vector<bool> &seen, vector<int> &order) {
seen[v] = true;
for (auto next : G[v]) {
if (seen[next]) continue; // 既に訪問済みなら探索しない
... | ALGO | 0.999992 | 5.64422 |
96aacdb5-5ce9-45a7-90c8-1c9e6895c78f | KitauraHiromi/atcoder | ABC113/c.cpp | #include <bits/stdc++.h>
#include <iostream>
#include <utility> // pair
#include <string>
#include <vector>
#define MAX_M 100001
#define MAX_N 100001
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define REP(i, n) for(int i=0; i<n; i++)
#define RER(i, n) for(int i=n-1; i>=0; i--)
#define ALL(v) v.begin() v.end()
#define ... | ALGO | 0.999941 | 3.817499 |
111e2ef9-72dd-48c3-b929-78abc043ac7c | its-S1mple/DSA-course--By-Love-Babbar | arraysQuestion/pivot.cpp | #include<iostream>
using namespace std;
int pivot(int arr[],int n){
int s=0;
int e=n-1;
int mid=s+(e-s)/2;
while(s<e){
if(arr[mid]>=arr[0]){
s=mid+1;
}
else{
e=mid;
}
mid=s+(e-s)/2;
}
return s;
}
int main()
{
int arr[6]={3,... | ALGO | 0.999935 | 5.179808 |
442e0ad1-33c1-4de0-89e8-6bc82c4f212e | gcampax/hDHT | lib/rtree/rtree.cpp | #include "rtree.hpp"
#include "leaf-entry.hpp"
#include "node.hpp"
#include "rtree-helper.hpp"
#include "../hilbert-values.hpp"
namespace libhdht {
namespace rtree {
RTree::HilbertValue RTree::hilbert_value_for_point(const Point& pt) const
{
return hilbert_values::xy2d(m_max_dimension, pt.first, pt.second);
}
... | ALGO | 0.967756 | 6.379627 |
8d006244-bfb4-4fab-a6bf-a4c8dd5854b2 | AbdulrahmanJ204/cp | E_Triple_Operations.cpp | #include <bits/stdc++.h>
using namespace std;
#define test int t;cin>>t;while(t--)
#define ll long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define endl '\n'
#define cendl cout<<endl
#define cyes cout<<"YES"
#define cno cout<<"NO"
#define cin(v) for(ll i=0;i<v.size();i++)cin>>v[i];
#de... | ALGO | 0.999736 | 3.917394 |
16f00292-b18c-4b49-82b9-27ebd857156e | fshalha/Tetris-Game | Board.cpp | #include <vector>
#include <iostream>
class Board {
public:
Board(int width, int height) : width(width), height(height), grid(height, std::vector<char>(width, ' ')) {}
void update() {
// Add logic for updating the board state
// This could include placing pieces, checking for completed lines, ... | ALGO | 0.995785 | 7.602251 |
819e79a5-89dc-44f3-8e84-2fa328ddc53f | jeremybboy/mai18 | question2.cpp |
#include<iostream>
#include<vector>
#include <fstream>
#include<string>
#include "DenseMatrix.hpp"
#include "SparseMatrix.hpp"
#include "FredholmMatrix.hpp"
#include <gsl/gsl_matrix.h>
#include <gsl/gsl_vector.h>
#include <stdio.h>
#include <gsl/gsl_sf_bessel.h>
#include <gsl/gsl_linalg.h>
#include <fstream>
using na... | ALGO | 0.984445 | 3.340631 |
6f20356c-cdec-4dac-93c3-853fd484d230 | ishandutta2007/codeforces | ae04071/normal/1178/F2.cpp | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using lli = long long;
using pii = pair<int,int>;
const int MOD = 998244353;
int n,m,arr[1000000],li[501],ri[501],dp[1000][1000];
int lm[501],rm[501],lp[501],rp[501];
vector<pii> adj;
int DP(int l,int r) {
if(l>=r) return 1;
int... | ALGO | 0.999996 | 4.278754 |
6a157d49-ef4c-4ce1-8013-896279bbea21 | Mark-74/Olinfo_Challenges | training/ois_islands.cpp | // Punti: 100.0
#include <bits/stdc++.h>
using namespace std;
ifstream fin("input.txt");
ofstream fout("output.txt");
int main()
{
int n, m;
fin >> n >> m;
vector<vector<int>> matrix(n, vector<int>(m));
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
fin >> ma... | ALGO | 0.999889 | 4.232253 |
cbb9175a-334e-43b6-9377-b628c2f5c695 | LinuxUserGD/godot-opengl-4 | servers/physics/step_sw.cpp | /**************************************************************************/
/* step_sw.cpp */
/**************************************************************************/
/* This file is part of: */
/* ... | ALGO | 0.994867 | 3.154752 |
0da867de-3351-4526-a590-2188f019493b | ishandutta2007/codeforces | froggyzhang/normal/1334/G.cpp | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+1;
bitset<N> bs[26],ans;
int p[26];
int main(){
for(int i = 0; i < 26; i++) cin >> p[i], p[i]--;
string s, t;... | ALGO | 0.999899 | 3.839857 |
c884c641-dd90-4dbc-99bd-bc57fe21f5d4 | flavio-a/CPExercises | lecture4/Firing_employees.cpp | // https://practice.geeksforgeeks.org/problems/firing-employees/0
/*
Computes an array of primality with the sieve of Eratosthenes, then computes the
number of senior recursively by 1 plus the number of seniors of their senior,
storing the results in an array to avoid double computations.
The time complexity for anyt... | ALGO | 0.999402 | 5.204258 |
587d4531-cb38-44d4-937e-6f472857940d | joostrijneveld/Euler-Project | timer.cpp | #include <sys/time.h>
#include <iostream>
#include <math.h>
using namespace std;
bool isprime(int no) {
if (no == 2)
return true;
if (no % 2 == 0 || no == 1)
return false;
for (int i = 3; i*i <= no; i+=2)
if (no % i == 0)
return false;
return true;
}
bool isprimeslow(int no) {
if (no == 2)
return tru... | ALGO | 0.995063 | 4.508202 |
db5330e1-0b87-4ee5-a2aa-dede7cfc311a | hthuwal/competitive-programming | old/spoj/cpp/inversion-count.cpp | /**
* https://www.spoj.com/problems/INVCNT/
**/
#include<bits/stdc++.h>
#define lli long long int
#define vi vector<int>
using namespace std;
class MergeSorter {
private:
lli num_inversion;
void reset() {
num_inversion = 0;
}
void merge(vi &list, int start, int mid, ... | ALGO | 0.999833 | 4.661551 |
8efac468-c7fe-492b-8764-20280765f8ba | dusan-mrsic/Game-Tree-For-Connect-Four-Game | zadatak 2/Main.cpp | #include <iostream>
#include <string>
#include <time.h>
#include "Tree.h"
#include "Fje.h"
using namespace std;
int main() {
char boja = PrviIgra();
char pboja = PromeniBoju(boja);
cout << "Prvi potez igra: ";
cout << boja << endl;
char Matrica[5][5];
cout << "Unesite pocetno stanje:" << endl;
Unos(Matr... | TOOL | 0.901548 | 3.23026 |
67151aa4-0bcd-493c-839f-752cdd5300b1 | dj1vs/solutions | Sololearn/Code coach problems/Medium/C++/Building_Blocks.cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << a%15 + b%15 + c%15 + d%15;
}
| ALGO | 0.999204 | 3.774726 |
ede56427-42d4-4980-af78-2702b99965d8 | owlpaw20/CPArchive | AtCoder/[ABC 147 C] HonestOrUnkind2.cpp | #include <bits/stdc++.h>
using PII = std::pair<int, int>;
const int MAX_N = 20;
int N, a[MAX_N];
PII b[MAX_N][MAX_N];
int type[MAX_N];
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin >> N;
for (int i = 1; i <= N; ++i) {
std::cin >> a[i];
for (int j = 1; j <= a[i]; ++... | ALGO | 0.999286 | 3.752301 |
f5237343-745e-4ce5-954d-bc0e95c6e343 | yandex/perforator | contrib/libs/llvm18/tools/llvm-cvtres/llvm-cvtres.cpp | #include "llvm/BinaryFormat/Magic.h"
#include "llvm/Object/Binary.h"
#include "llvm/Object/WindowsMachineFlag.h"
#include "llvm/Object/WindowsResource.h"
#include "llvm/Option/Arg.h"
#include "llvm/Option/ArgList.h"
#include "llvm/Option/Option.h"
#include "llvm/Support/BinaryStreamError.h"
#include "llvm/Support/Error... | TOOL | 0.857603 | 6.878316 |
7ad8a799-9552-463a-9073-e554a13f75b1 | nikhilhassija/CompetitiveProgramming | CodeForces/723/C_bak.cpp | #include <bits/stdc++.h>
#define pii pair <int,int>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;;
int A[n];
for(int i=0;i<n;i++)
cin >> A[i];
for(int i=0;i<n;i++)
A[i]--;
int B[m];
memset(B,0,sizeof(B));
for(int i=0;i<n;i++)
if(A[i] < m)
B[A[i]]++;
priority_queue <pii, vector<pii... | ALGO | 0.999997 | 3.09405 |
509e9c32-b13f-4be3-95f0-50baee09c4b9 | crhurley1234/CPP-Primer-Plus-Sixth-Edition-Homework | Chapter 11/vect.cpp | // vect.cpp -- methods for the Vector class
#include <cmath>
#include "vect.h" // includes <iostream>
using std::sqrt;
using std::sin;
using std::cos;
using std::atan;
using std::atan2;
using std::cout;
namespace VECTOR
{
// compute degrees in one radian
const double Rad_to_deg = 45.0 / atan(1.0);
// sho... | TOOL | 0.939887 | 5.808613 |
71b72bde-251a-41e6-978a-19447c4bacb2 | AST-TheCoder/CP-Solutions | CodeForces/GNU C++17/1102E | Monotonic Renumeration/48182119.cpp | /******************************************************/
/******************************************************/
/** BISMILLAHIR RAHMANIR RAHIM **/
/** Al-Shahriar Tonmoy - Red_Sparkle **/
/** Department of Computer Science and Engineering **/
/** Barisal Universit... | ALGO | 0.999962 | 3.579341 |
f8792e71-2b1e-4220-81af-0a16708b8efd | ozcanay/TemplateMetaprogramming | zip.cpp | /* Inputs:
Vector<1, 2, 3>
Vector<2, 3, 4>
Vector<3, 4, 5>
Output:
Vector<6, 24, 60>
*/
#include <type_traits>
// we will build up gradually.
// first, we will have to think about how to model vector. this is how we are going to represent "Vector"s as it will only contain integers.
template<int... vals>
struct Ve... | ALGO | 0.998495 | 5.82336 |
921957e6-f8a6-4215-b217-0b1d1c4ba22d | YoshikiTakashima/vert | benchmark/cpp_transcoder/TEMPLE_OFFERINGS/TEMPLE_OFFERINGS_processed.cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
using namespace std;
int f_gold ( int n, int templeHeight [ ] ) {
int sum = 0;
for ( int i = 0;
i < n;
++ i ) {
int left = 0, right = 0;
for ( int j = i - 1;
j >= 0;
-- j ) {
... | ALGO | 0.999565 | 5.61836 |
51a32263-7729-4e66-a531-385f37426b03 | jhonnygzz/JACC_APPS | miniBUDE/miniBUDECJulia/kokkosgithub/example/tutorial/04_simple_memoryspaces/simple_memoryspaces.cpp | #include <Kokkos_Core.hpp>
#include <cstdio>
// The type of a two-dimensional N x 3 array of double.
// It lives in Kokkos' default memory space.
using view_type = Kokkos::View<double * [3]>;
// The "HostMirror" type corresponding to view_type above is also a
// two-dimensional N x 3 array of double. However, it liv... | ALGO | 0.980799 | 6.335599 |
935b72d5-20e7-4e9c-af8f-fc38d8d1f816 | MahaleAditya/dsa | adthashingclosedandopen.cpp | #include <iostream>
#include <string>
using namespace std;
// Node structure for storing key-value pairs
struct Node {
string key;
int value;
Node* next;
Node(string k, int v) : key(k), value(v), next(nullptr) {}
};
// HashTable class
class HashTable {
private:
static const int TABLE_SIZE = ... | ALGO | 0.995575 | 6.89797 |
30d162d1-dfce-4b8f-8f67-a2c079de401a | raincross7/code-similarity | codes/train_code/problem300/problem300_217.cpp | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, i... | ALGO | 0.999842 | 3.782018 |
f9f4e4d1-50e2-43da-900b-cb34b3440695 | AlexeyDer/5sem | ABC/lab5/lib/tbb/examples/GettingStarted/sub_string_finder/sub_string_finder_pretty.cpp | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <algorithm> //std::max
#include "tbb/parallel_for.h"
#include "tbb/blocked_range.h"
static const std::size_t N = 9;
class SubStringFinder {
const std::string &str;
std::vector<std::size_t> &max_array;
std::vector<std... | ALGO | 0.999897 | 3.761151 |
5418fc19-25a9-41e7-97a1-0d69fefe1c9a | i-manish-3/DSA-SUPREME | Recursion/counting.cpp | #include<bits/stdc++.h>
using namespace std;
void counting(int n)
{
if(n == 0)
{
return;
}
counting(n-1);
cout<<n<<" ";
}
int main(){
int n = 10;
counting(n);
return 0;
} | ALGO | 0.999966 | 4.387859 |
05ebfab1-8a2b-4f0b-8ecb-a36dd0f32540 | luoyongheng/opencv_add_contrib | opencv_contrib-3.4.1/modules/aruco/samples/detect_markers.cpp | #include <opencv2/highgui.hpp>
#include <opencv2/aruco.hpp>
#include <iostream>
using namespace std;
using namespace cv;
namespace {
const char* about = "Basic marker detection";
const char* keys =
"{d | | dictionary: DICT_4X4_50=0, DICT_4X4_100=1, DICT_4X4_250=2,"
"DICT_4X4_1000=3, DICT... | TOOL | 0.986676 | 6.947068 |
4a702871-22a0-4ff8-bb7f-bb0724a8fa25 | razeenwasif/Maths-Physics | particleSimulator/src/main.cpp | #include <SFML/Graphics.hpp>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <ctime>
#include <sstream> // For displaying equations
#include <functional>
#include <array>
// #include <SFML/Graphics/VertexArray.hpp>
#include<random>
// Compile: g++ -c src/main.cpp -IC:\SFML-3.0.0\include -DSFML_STATIC (m... | ALGO | 0.983487 | 3.712926 |
5f642a45-dab7-497b-8879-cf36d1ffbe43 | cyrxdzj/CYRXDZJ-OI-01 | std/melody/melody_testlib_validator3.cpp | #include "testlib.h"
#include<string>
#include<cstdio>
using namespace std;
int main(int argc, char* argv[]) {
registerValidation(argc, argv);
int n=inf.readInt(1,4e5,"n");
inf.readSpace();
long long m=inf.readLong(1ll,(long long)1e5,"m");
inf.readSpace();
long long x;
x=inf.readLong(0ll,(long long)1e9,"a");
i... | ALGO | 0.97605 | 3.202024 |
0ad3b570-2a0a-4062-907d-241da2e04454 | thishaaarsh/Leetcode-Solutions | 0063-unique-paths-ii/0063-unique-paths-ii.cpp | class Solution {
public:
int solve(int i, int j, vector<vector<int>>& arr,vector<vector<int>>&dp){
if(i<0 || j<0) return 0;
if(arr[i][j] == 1) return 0;
if(i==0 and j==0) return 1;
if(dp[i][j] != -1) return dp[i][j];
return dp[i][j] = solve(i-1,j,arr,dp)+solve(i,j-1,arr,dp);
... | ALGO | 0.999799 | 6.091354 |
af1f4940-9e1f-4247-9cdf-5e65feab549a | zhr5/Algorithm | 剑指offer/用两个队列模拟栈.cpp | #include<queue>
using namespace std;
class Solution
{
public:
void push(int node) {
q1.push(node);
}
int pop() {
int n1 = q1.size();
for (int i = 0; i < n1 - 1; i++) {
int temp = q1.front();
q1.pop();
q2.push(temp);
}
int res = q1.front();
q1.pop();
return res;
}
private:
queue<int> q1;
... | ALGO | 0.999762 | 4.687204 |
5ccea5fa-e3b8-4322-b109-0769ea5cb20f | Henrik-Yao/NEUQ-ACM-Solution | winter-day4/0.题目/金添winter-day04/相邻数对.cpp | #include <bits/stdc++.h>
using namespace std;
int a[2000];
int num;
int sum=0;
void search(int n)
{
for(int i=n+1;i<num;i++)
{
if(abs(a[i]-a[n])==1)
{
sum++;
}
}
return;
}
int main()
{
cin>>num;
for(int i=0;i<num;i++)
{
cin>>a[i];
}
for(int... | ALGO | 0.99986 | 4.46059 |
fdeec204-7f6f-48ee-b874-1d95df1b8d47 | manikanta2901/ubuntu | .history/imp/cpp/Algorithm/DynamicPrograming/BinomialCoefficient_20210117162802.cpp | //Its is similar to fabinocci series
#include<bits/stdc++.h>
using namespace std;
int GetBinomialValue(int n, int k){
int dp[n + 1][k + 1];
for(int i = 0; i <= n; i++){
for(int j = 0; j <= min(k,i); j++){
if(j == 0 || j == i){
dp[i][j] = 1;
}else{
... | ALGO | 0.999969 | 5.43339 |
d6b2174c-000a-486f-bee0-8fe7dd1085f0 | YanivFais/EFNoC | EFNoc/Test/ScheduleCalculator/Router.cpp | #include "Router.h"
#include <time.h>
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <tuple>
#include "LPInterface.h"
#include "FlowDecomposer.h"
#include "FlowPath.h"
#include "BFSRouter.h"
#include "BottleneckRouter.h"
using namespace std;
static const char * routerTypeNames[]... | ALGO | 0.960661 | 5.286051 |
8f29a89d-53e9-44cf-abaa-d2c5cbb23a21 | dpkg123/darling_full | llvm/lib/ObjCopy/MachO/MachOObjcopy.cpp | #include "llvm/ObjCopy/MachO/MachOObjcopy.h"
#include "Archive.h"
#include "MachOReader.h"
#include "MachOWriter.h"
#include "llvm/ADT/DenseSet.h"
#include "llvm/ObjCopy/CommonConfig.h"
#include "llvm/ObjCopy/MachO/MachOConfig.h"
#include "llvm/ObjCopy/MultiFormatConfig.h"
#include "llvm/ObjCopy/ObjCopy.h"
#include "ll... | TOOL | 0.866311 | 6.49828 |
2d77482c-023a-4cac-bad0-5a7e6c94e32f | lcy5201314/CUMT | 数据结构实践/数据结构实验/迷宫/简版/main.cpp | #include <iostream>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;
int ex = 0, ey = 0,sx = 0, sy = 0;
int ne[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int n, m;
char map[100][101];
int step[100][100];
bool check(int a, int b)
{
if (a >= n || b >= m || a < 0 || b < 0 )
re... | ALGO | 0.999947 | 4.030833 |
e410c4c1-a462-46aa-80d6-ae7a1465fdd8 | Shell-Wataru/AtCoder | Codeforces/Poly2022/C2.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
const ll BASE_NUM = 1000000007;
int solve()
{
ll n, k;
scanf("%lld", &n);
scanf("%lld", &k);
ll re... | ALGO | 0.999751 | 3.609786 |
1e7738b9-58ed-4391-86fd-1981a942f674 | 1833183060/CGAL5.5.2-source | Generator/test/Generator/rcs_test.cpp | #include <CGAL/Simple_cartesian.h>
#include <CGAL/Point_2.h>
#include <CGAL/Polygon_2.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/random_convex_set_2.h>
#include <vector>
#include <iostream>
#include <cstdlib>
using std::vector;
using std::back_inserter;
using CGAL::Simple_cartesian;
using CGAL::Creator_uni... | ALGO | 0.992979 | 7.085417 |
1fba437a-2206-437e-b86a-67925ccdc400 | nickUsual/AlgorithmNote | day02/2014_12_1.cpp | #include<bits/stdc++.h>
using namespace std;
using gg = long long;
int main(){
map<gg,gg> ai;
vector<gg> count;
gg N,temp_num;
cin >>N;
while(N--){
cin>>temp_num;
count.push_back(++ai[temp_num]);
}
for(auto i : count){
cout << i << " ";
}
return 0;
} | ALGO | 0.999741 | 3.981464 |
d7d5cfe5-8716-49b1-af27-d5e791398ff9 | lilystraker/TheEater | Eater.cpp |
/*********** Declaration*******
I hereby certify that no part of this assignment has been copied from
any other students work or from any other source. No part of the code
has been written/produced for me by another person or copied from any
other source.
I hold a copy of this assignment that I can produce if the orig... | ALGO | 0.885414 | 3.664955 |
913ebe54-09bf-4736-8d55-ee7f310d6ef4 | RaduAlbastroiu/Minotaur | SimpleGameCocos/cocos2d/extensions/Particle3D/PU/CCPUSimpleSpline.cpp | #include "CCPUSimpleSpline.h"
#include "base/ccMacros.h"
NS_CC_BEGIN
//---------------------------------------------------------------------
PUSimpleSpline::PUSimpleSpline()
{
// Set up matrix
// Hermite polynomial
_coeffs.m[0] = 2;
_coeffs.m[1] = -2;
_coeffs.m[2] = 1;
_coeffs.m[3] = 1;
_co... | ALGO | 0.992319 | 6.908819 |
a0b51177-0263-493b-996b-c078b155d1a3 | 42somoim/42somoim1 | gna/week1/gizzikN.cpp | #include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
for (int i=n; i>=1; i--)
{
cout<<i<<'\n';
}
}
| ALGO | 0.999816 | 3.751887 |
7daed6fc-e8e7-41a6-91a3-3ea657bfb6a0 | nishtha2405/HackFest | Code for good/PathSum.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
#include <cmath>
#include <conio.h>
#include <queue>
typedef long long ll;
using namespace std;
int main()
{
getch();
}
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode... | ALGO | 0.99987 | 3.966952 |
7ed1e418-072c-4ba2-9642-61d6cc8e3d00 | android-ide/platform_ndk | sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp | // <algorithm>
// template<RandomAccessIterator Iter>
// requires ShuffleIterator<Iter>
// && LessThanComparable<Iter::value_type>
// void
// push_heap(Iter first, Iter last);
#include <algorithm>
#include <cassert>
void test(unsigned N)
{
int* ia = new int [N];
for (int i = 0; i < N; ++i)
... | TEST | 0.946878 | 5.084554 |
148d1429-c471-4099-8253-a6d859d65c08 | LJHDestiny/AhaAlgorthm | 最短路径Floyd-Warshall.cpp | //·Floyd-Warshall㷨ʵ
/*
#include<iostream>
using namespace std;
int main()
{
int e[10][10];//ڽӾ
int n, m;//n㣬m
int inf = 99999999;//infinity洢һΪֵ
int t1, t2, t3;
cout << "nmnm";
cin >> n >> m;
for(int i=1;i<=n;i++) //ʼ
for (int j = 1; j <= n; j++)
{
if (i == j)
e[i][j] = 0;
else
e[i][j] = inf;
... | ALGO | 0.999915 | 3.695504 |
f728a75b-4955-46b2-8066-5531cc9b2d45 | Soledad89/HeadPoseEstimation | Triangle.cpp | #include "Triangle.h"
#include <vector>
#include <algorithm>
using namespace std;
Triangle::Triangle(int d1,int d2,int d3){
vector<int> vertices;
vertices.push_back(d1);
vertices.push_back(d2);
vertices.push_back(d3);
sort(vertices.begin(), vertices.end());
v1 = vertices.at(0);
v2 = vertic... | ALGO | 0.873076 | 5.346858 |
aad4bed8-bd71-48fa-85d6-52aded896755 | ishandutta2007/codeforces | monkeyking/normal/764/C.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <stdio.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define Endl endl
using namespace std;
int n;
vector <int> vec[100005];
int a[100005];
int dp[100005];
int fuck;
int dfs(int x,int p)
{
// cout<<x<<' '<<p... | ALGO | 0.999931 | 3.603073 |
836b7488-b209-4fc4-9f64-9fa76e2af3eb | tmatthey/protomol3 | protomol/src/protomol/force/hessian/ReducedHessCoulombSCPISM.cpp | #include <protomol/force/hessian/ReducedHessCoulombSCPISM.h>
#include <protomol/topology/GenericTopology.h>
using namespace ProtoMol;
//____ ReducedHessCoulombSCPISM
Matrix3By3 ReducedHessCoulombSCPISM::operator()(
const Real rawEnergy, const Real rawForce, Real a, Real /*rDistSquared*/,
const Vector3D &rij, const... | ALGO | 0.998586 | 5.166375 |
399e9ead-efd2-4442-a361-fe3930b1368f | VividRabbitY/JetRanger_Directx | SharedContent/cpp/GameContent/Level4.cpp | /,
float /* elapsedTime */,
float /* timeRemaining */,
std::vector<GameObject^> objects
)
{
int left = 0;
for (auto object = objects.begin(); object != objects.end(); object++)
{
if ((*object)->Active() && ((*object)->TargetId() > 0))
{
if ((*object)->Hit() && ((*... | TOOL | 0.900774 | 5.596818 |
9cfc4802-c7dc-4a71-8f0d-41f109284e6c | dsptanmay/LeetCode-Solutions | 1598-crawler-log-folder/1598-crawler-log-folder.cpp | class Solution {
public:
int minOperations(vector<string>& logs) {
stack<string> st;
for(const string& log: logs)
{
if(log == "./")
continue;
if(log == "../")
{
if(st.empty())
continue;
... | ALGO | 0.995307 | 5.648412 |
2698298b-79dd-4b75-a977-2daa00e7eef8 | JayantGoel001/AtCoder | Colorful Candies.cpp | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define int long long int
#define double double_t
#define INF 1e18
using namespace __gnu_pbds;
using namespace std;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics... | ALGO | 0.999947 | 4.257312 |
323c8489-67dc-4219-ac1d-1b8695a8b02b | Amrojano/PROBLEMAS_UD2 | tabla_del_7_2.0.cpp | //Vamos a realizar un programa donde nos calcule automaticamente la tabla de multiplicar del numero 7.
#include <iostream>
using namespace std;
int main() {
int t = 1; //Variable de nuestra tabla de multiplicar.
while (t <= 10) { // Condicion que queremos que se cumpla para terminar el bucle.
//Sentencias para que... | ALGO | 0.997264 | 3.652301 |
b397d471-a71e-47d3-b135-e2a0e62f37b5 | zhanzhanfu/MIT-CG6.837-2004 | 05_Voxel_Rendering/src/marchingInfo.cpp | #include "marchingInfo.h"
void MarchingInfo::nextCell() {
int flag = 0;
if (t_next_x <= t_next_y && t_next_x <= t_next_z)
flag = 1;
if (t_next_y <= t_next_x && t_next_y <= t_next_z)
flag = 2;
if (t_next_z <= t_next_x && t_next_z <= t_next_y)
flag = 3;
switch (flag) {
... | ALGO | 0.991632 | 3.995125 |
04aa0e11-1485-4eb7-9684-b67681cd6bea | deepakkasera/CodeForces | 296A.cpp | #include <bits/stdc++.h>
using namespace std;
int arr[1001];
int main(int argc, char const *argv[])
{
int n;
cin>>n;
int a;
for(int i=0;i<n;i++){
cin>>a;
arr[a]++;
}
for(int i=0;i<=1000;i++){
if(arr[i]>(n+1)/2){
cout<<"NO";
return 0;
}
}
cout<<"YES";
return 0;
} | ALGO | 0.999956 | 3.868782 |
070b7412-be25-4235-8f19-6ead73b32a69 | Jackiempty/Raspi-video-cpp | fall.cpp | #include "opencv2/opencv.hpp"
#include "opencv2/core.hpp"
#include "opencv2/objdetect.hpp"
#include "opencv2/highgui.hpp"
#include "opencv2/imgproc.hpp"
#include "opencv2/videoio.hpp"
#include <opencv2/video/background_segm.hpp>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
using names... | ALGO | 0.990887 | 5.873577 |
7cf9ae96-724a-4ded-8f51-ece61107f0e2 | ishandutta2007/codeforces | ohweonfire/normal/757/G.cpp | // This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ... | ALGO | 0.999985 | 4.205491 |
5ac9b5c8-4107-4ed2-a676-a95986828974 | swff07183/BOJ | cpp_algo/10828_stack.cpp | #include <iostream>
#include <string>
using namespace std;
int stack[10010];
int top = -1;
void push(int num) {
top++;
stack[top] = num;
}
int top_() {
if (top == -1) return -1;
else return stack[top];
}
int pop() {
if (top == -1) return -1;
else {
int ret = stack[top];
stack[top] = 0;
top--;
return ... | ALGO | 0.998828 | 4.299293 |
34c568d5-95d0-4e8f-b787-38c88748bc4a | quchunguang/test | testc/moneymatch/src/moneymatch.cpp | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <opencv/cv.h>
#include <opencv/highgui.h>
#include <unistd.h>
#include "moneymatch.h"
// Global arguments for program options
struct globalArgs_t {
int verbosity; /* -v option */
char **inputFiles; /* input files */
int numInputFiles; /* # of inp... | ALGO | 0.96696 | 3.843778 |
bdf52949-f7e7-4f36-bf21-5e804dbea554 | Elizabethvk/cpp-programming | chapter03/chap3_ex9.cpp | #include <iostream>
using namespace std;
int main() {
cout << "4islo mi dai s dumi: \n";
string n;
cin >> n;
if (n == "one")
cout << n << " e 1";
else if (n == "two")
cout << n << " e 2";
else if (n == "three")
cout << n << " e 3";
else if (n == "four")
cout << n << " e 4";
else if (n == "zero")
c... | ALGO | 0.917031 | 3.840692 |
1c637f9e-35bd-47b2-b8cb-91b91011223f | YunshiuanOAO/CP | Codeforce/Codeforces Round #797 (Div. 3)/A.cpp | // Problem: A. Print a Pedestal (Codeforces logo?)
// Contest: Codeforces - Codeforces Round #797 (Div. 3)
// URL: https://codeforces.com/contest/1690/problem/0
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<iostream>
#include<iomanip>
#include<math.h>
#inclu... | ALGO | 0.991931 | 3.768642 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.