uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
8d36dcd3-3b08-46bf-909a-dbfb3316b87e | cwang588/algorithms | XJTU2020/Day17/EE.cpp | #include<bits/stdc++.h>
using namespace std;
unsigned long long fac[25];
int nn;
int a[1005],tmp[1005];
struct number
{
int num[15],ans[15];
}N[25][400005];
bool cmp(number x,number y)
{
for(int i=1;i<nn;++i)if(x.num[i]!=y.num[i])return x.num[i]<y.num[i];
return false;
}
void init()
{
fac[0]=1;
for(int i=1;i<=19;+... | ALGO | 0.999796 | 3.73578 |
0b3f1527-6e2d-46bb-93ed-ba49bd9433f7 | zach-morris/same_fmtowns | 3rdparty/bimg/3rdparty/astc/astc_integer_sequence.cpp | /*----------------------------------------------------------------------------*/
/**
* This confidential and proprietary software may be used only as
* authorised by a licensing agreement from ARM Limited
* (C) COPYRIGHT 2011-2012 ARM Limited
* ALL RIGHTS RESERVED
*
* The entire notice above must be reproduced on... | ALGO | 0.998547 | 5.481243 |
2a5fb354-7db6-4462-8bd8-78cf91794ba5 | ishandutta2007/codeforces | penguin1017/normal/766/E.cpp | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define ll long long
#define lb(x) ((x)&(-x))
#define pii pair<int,int>
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define de(x) cout<<x<<" x"<<endl
#define LCAFA rep(i,... | ALGO | 0.999871 | 3.958435 |
4b2b383f-5a39-48c1-9a6a-f7c8b51bea1c | pranjul1203/c-- | grap.cpp | #include <iostream>
using namespace std;
const int maxNodes = 100;
int adjmatrix[maxNodes][maxNodes];
int p[maxNodes][maxNodes];
void warshall(int m) {
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
if (adjmatrix[i][j] != 0) {
p[i][j] = 1;
} else... | ALGO | 0.999988 | 4.991233 |
ab5b773f-affd-4ade-bf2c-47eb92c8e6db | enopid/DataStructure | MyVector/MyVector.cpp | #include<cstring>
#include<iostream>
template<typename T>
class MyVector{
public:
MyVector(){
_size=0;
_capacity=1;
_data=new T[_capacity];
}
MyVector(int N, const T& val=T()){
_size=N;
_capacity=N;
_data=new T[N];
for (int i = 0; i < _size; i++) _dat... | TOOL | 0.921071 | 4.114442 |
99b1956b-c79c-440a-a01d-2c50a83df816 | pacha2880/competitive_programming_codes | Encontrando progresiones.cpp | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/rope>
#define int ll
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)a.size()
#define eq(... | ALGO | 0.999584 | 3.47371 |
31e3b12b-c9ce-40f1-b41a-60cc798b1418 | LinkStartNow/DataStructures | 学习笔记666/二分/一元三次方程（暴力版）.cpp | #include<bits/stdc++.h>
//#define ll long long
#define run(i, a, b) for(int i = a; i <= b; i ++)
#define rep(i, a, b) for(int i = a; i >= b; i --)
#define x(i) x = i << 1
#define y(i) y = i << 1 | 1
#define m(l, r) m = (l + r) >> 1
//#define t() int t; cin >> t; while(t --)
#define t(i) int t; cin >> t; run(i, 1, t)
#... | ALGO | 0.999747 | 3.41299 |
43b13a47-5853-49da-a4bc-0f3fe686ae01 | danielsouzaaf/algorithms | codecad/course-1/question2.cpp | #include <iostream>
using namespace std;
int main() {
int x,y;
cin >> x >> y;
cout << x+y << endl;
return 0;
}
| ALGO | 0.953665 | 3.59825 |
4a2fdc76-b7b4-4ad5-84a2-d755a895ed60 | ishandutta2007/codeforces | monogon/normal/1572/A.cpp |
#include <bits/stdc++.h>
#define ll long long
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define pii pair<int, int>
#define rep(i, a, b) for(int i = (a); i < (b); i++)
using namespace std;
template<typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
... | ALGO | 0.999041 | 4.525151 |
467f21d5-97f5-4223-a375-c760dff64277 | shenghansen/CXL_GRAPH | toolkits/cc.cpp | #include <stdio.h>
#include <stdlib.h>
#include "core/graph.hpp"
double exec_time = 0;
void compute(Graph<Empty> * graph) {
exec_time -= get_time();
VertexId * label = graph->alloc_vertex_array<VertexId>();
VertexSubset * active_in = graph->alloc_vertex_subset();
active_in->fill();
VertexSubset * active_ou... | ALGO | 0.999832 | 4.117723 |
eb26c6bb-116e-40a7-b25a-0c9ab75177d1 | Pizza2Pizza/CPP-encoder-decoder | CTrieEnc.cpp | #include "CTrieEnc.hpp"
using namespace std;
CTrieEnc::CTrieEnc(){
for(int i = 0; i<256; i++){
m_symbolTable[i].setParent(-1);
m_symbolTable[i].setSymbol(intToString(i));
}
}
int CTrieEnc::searchinTable(const char buchstabe, int parent_index){
if(parent_index == -1) {
// cout <<"found buchstabe at ind... | ALGO | 0.99977 | 3.637807 |
b6ea90b3-38eb-4f9a-8265-8477c5f285b1 | yahyasemih/Competitive-Programming | codeforces/1144B.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n];
int p[2] = {0, 0};
int s = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
s += a[i];
p[a[i] % 2]++;
}
if (abs(p[0] - p[1]) <= 1)
cout << 0 << endl;
else
{
sort(a, a... | ALGO | 0.999991 | 4.044961 |
dceb0bf5-f2dd-4428-b106-c0954b26b37f | robiul99siyam/c-plus-program- | c plus/pointer.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
// int a,b,c;
// cout<<"address of var1: "<<&a<<endl;
// cout<<"address of var2: "<<&b<<endl;
// cout<<"address of var3: "<<&c<<endl;
// int * poinVar,var;
// var = 5;
// poinVar = &var;
// cout<<"output :-->"<<*poinVar;
//... | ALGO | 0.863913 | 3.016887 |
1def53c0-09d0-40fa-8355-026d87bf5bb9 | jinbeomdev/daily-algorithm-problems | [BOJ]11721_열개씩끊어출력하기/[BOJ]11721_열개씩끊어출력하기/Source.cpp | //11721 : ϱ
#include <iostream>
#include <string>
using namespace std;
int main() {
int c;
int cnt = 0;
while ((c = getchar()) != EOF) {
cout << (char)c;
cnt++;
if (cnt % 10 == 0) {
cout << endl;
}
}
} | ALGO | 0.98799 | 3.004942 |
f2817e04-1398-4d83-9bc6-95bf3f302cea | Loketari/Tasks | RandomSequence/RandomSequence.cpp | #include "stdafx.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <ctime>
#include <cstdlib>
using namespace std;
vector<int> initial {4,6,8, 15};
int randomize()
{
return rand() % (initial.size());
}
int main()
{
vector<int> mixedValues(1);
srand(time(NULL));
int valsSum = 0,... | ALGO | 0.998081 | 3.088743 |
e74a8467-df7f-4e34-bf0c-c1ad965fc769 | ykw1225/CS-131 | HW-cpp/3. Sales Tax.cpp | // This is the ch.2 textbook homework
// programming challenges part
// Date: June 26 2014
// 3. Sales Tax
#include <iostream>
using namespace std;
int main()
{
int purchase;
float statetax, countytax;
double totaltax;
purchase = 5;
statetax = 4E-2;
countytax = 2E-2;
statetax = purchase*statetax;
countytax =... | ALGO | 0.862616 | 3.914935 |
93a3b08f-d55a-4f60-9c4c-535c6d17e3c9 | hwi-middle/PS_BOJ | cpp/2250.cpp | #include <bits/stdc++.h>
#define left _left
#define right _right
using namespace std;
struct Node
{
int left, right;
int order, depth;
};
Node a[10001];
int left[10001]; // ̿ ʿ ִ ε
int right[10001]; // ̿ ʿ ִ ε
int cnt[10001]; //θ
int order = 0;
void inorder(int node, int depth)
{
if (node == -1) return;... | ALGO | 0.999959 | 4.170938 |
e1ada136-f9df-4316-9507-d35a8af80251 | axelu/leetcode | cpp/01500-01999/designmovierentalsystem.cpp |
// 1912. Design Movie Rental System
// https://leetcode.com/problems/design-movie-rental-system/
class MovieRentingSystem {
private:
struct ShopPrice { int shop,price; };
struct ShopPriceCmp {
bool operator()(const ShopPrice& a, const ShopPrice& b) const {
if( a.price < b.price ) {
... | ALGO | 0.996631 | 5.992984 |
f7a2f4d7-0e87-44ca-ba10-2a73b8386c6f | wenzai007/dotnet462 | Source/vb/language/shared/crc32.cpp | #include "StdAfx.h"
//#define USE_CRC_TABLE
#ifdef USE_CRC_TABLE
static const DWORD CRC32_LOOKUP_TABLE [256] = {
0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA,
0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3,
0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988,
0x09B64C2B, 0x7EB17CBD, 0... | TOOL | 0.974115 | 5.33052 |
5e50a4d9-5e34-4634-89d4-1eaf2992d9e8 | abubakar9405/DSA-PRACTICE-CODE | INFIX,PREFIX,POSTFIX/precedene.cpp | #include <iostream>
#include <cstring>
using namespace std;
class INFIX_TO_POSTFIX {
public:
// All data members public to avoid uncertain blockages...
int capacity, top;
char* arr;
//constructor :
INFIX_TO_POSTFIX(int size) : capacity(size), top(-1) { // Used initializer list
arr = new char... | ALGO | 0.999332 | 5.983154 |
1161d6bd-a914-4815-a56e-e1b4d83fe19b | tudelft/PX4-Autopilot | src/modules/control_allocator/ActuatorEffectiveness/ActuatorEffectivenessMCTilt.cpp | #include "ActuatorEffectivenessMCTilt.hpp"
using namespace matrix;
ActuatorEffectivenessMCTilt::ActuatorEffectivenessMCTilt(ModuleParams *parent)
: ModuleParams(parent),
_mc_rotors(this, ActuatorEffectivenessRotors::AxisConfiguration::FixedUpwards, true),
_tilts(this)
{
}
bool
ActuatorEffectivenessMCTilt::get... | ALGO | 0.865581 | 6.508669 |
e6d4a040-ff63-4087-a9a7-e6afa10f458e | shisomaki/Marlin-KP3 | Marlin/src/gcode/bedlevel/mbl/G29.cpp | /**
* G29.cpp - Mesh Bed Leveling
*/
#include "../../../inc/MarlinConfig.h"
#if ENABLED(MESH_BED_LEVELING)
#include "../../../feature/bedlevel/bedlevel.h"
#include "../../gcode.h"
#include "../../queue.h"
#include "../../../libs/buzzer.h"
#include "../../../lcd/marlinui.h"
#include "../../../module/motion.h"
#in... | TOOL | 0.94091 | 7.863942 |
38e1f03a-19f6-4ba2-89c5-e546528239cc | alwaysanshul/LEETCODE | Other/leetcode_2_Add_Two_Numbers_Linked_List.cpp | #include<iostream>
using namespace std;
// Definition for singly-linked list.
struct ListNode {
int val;
struct ListNode *next;
ListNode() : val(0), next(nullptr) {}
ListNode(int x) : val(x), next(nullptr) {}
ListNode(int x, ListNode *next) : val(x), next(next) {}
};
// % MY SOLUTION -> 08-APRIL... | ALGO | 0.999949 | 5.528827 |
cfbb7082-7edc-40fb-a8c8-81b5d889293e | asimay/RobotCar | egbis/segment.cpp | #include <cstdio>
#include <cstdlib>
#include "image.h"
#include "misc.h"
#include "pnmfile.h"
#include "segment-image.h"
int main(int argc, char **argv) {
if (argc != 6) {
fprintf(stderr, "usage: %s sigma k min input(ppm) output(ppm)\n", argv[0]);
return 1;
}
float sigma = atof(argv[1]);
float k = ... | ALGO | 0.98743 | 4.670705 |
7d97d1af-2ef1-46a1-874a-42fb31d482ee | xzwang2005/Prelude | third_party/deqp/src/framework/delibs/decpp/deCommandLine.cpp | /*!
* \file
* \brief Command line parser.
*//*--------------------------------------------------------------------*/
#include "deCommandLine.hpp"
#include <set>
#include <sstream>
#include <cstring>
#include <stdexcept>
#include <algorithm>
namespace de
{
namespace cmdline
{
namespace
{
struct Help { typedef boo... | TOOL | 0.868439 | 7.708858 |
ed753def-4933-40ba-93c4-d24624794c2f | weimeittx/wax-blockchain-bin | src/boost_1_71_0/libs/numeric/ublas/doc/samples/triangular_adaptor.cpp | #include <boost/numeric/ublas/triangular.hpp>
#include <boost/numeric/ublas/io.hpp>
int main () {
using namespace boost::numeric::ublas;
matrix<double> m (3, 3);
triangular_adaptor<matrix<double>, lower> tal (m);
for (unsigned i = 0; i < tal.size1 (); ++ i)
for (unsigned j = 0; j <= i; ++ j)
... | ALGO | 0.991841 | 3.649494 |
dd3f5b6e-946b-4253-9bf2-742e29fd0864 | SnowDrop23/ds-all-codes-of-ApnaCollege | Bubble Sort.cpp |
#include<iostream>
using namespace std;
void printArray(int arr[], int n)
{
for(int i = 0; i < n; i++) cout << arr[i] << " ";
cout << endl;
}
void bubbleSort(int arr[], int n)
{
for(int i = 0; i < n-1; i++)
{
for(int j = 0; j < n-i-1; j++)
{
if(arr[j] > arr[j+1])
{
swap(arr[j], arr[j+1]);
}
}
... | ALGO | 0.999794 | 5.171525 |
e08368a7-c2f4-489d-872b-20e74a75434c | opengauss-mirror/openGauss-server | src/gausskernel/storage/mot/core/system/common/thread_id.cpp | #include "thread_id.h"
#include "utilities.h"
#include "mot_error.h"
#include "mot_configuration.h"
#include "mot_engine.h"
#include "sys_numa_api.h"
#include "mot_atomic_ops.h"
#include <pthread.h>
#include <cstring>
namespace MOT {
DECLARE_LOGGER(ThreadIdPool, System)
// how much thread identifiers fit in one word... | TOOL | 0.915693 | 7.01649 |
b1c40c6f-eaa2-4f0d-8c12-3fa0fd5a8b68 | khatrijiraj/Leetcode-DSA-CPP | Step 2 Learn Important Sorting Techniques/Step 2.2 Sorting 2/QuickSort.cpp | /* Problem statement
Given the 'start' and the 'end'' positions of the array 'input'. Your task is to
sort the elements between 'start' and 'end' using quick sort.
Note :
Make changes in the input array itself.
Detailed explanation ( Input/output format, Notes, Images )
Sample Input 1 :
6
2 6 8 5 4 3
Sample Output 1 :... | ALGO | 0.999988 | 5.215085 |
0f98dabc-51b0-4627-b70c-0850724be953 | logicallaw/lecture_data_structure | midterm_labs/Day3/ex4.cpp | #include <iostream>
#include <string>
using namespace std;
class SLinkedList;
class IntNode{
private:
int ele;
IntNode* next;
friend class SLinkedList;
};
class SLinkedList{
private:
IntNode* head;
IntNode* tail;
public:
SLinkedList() : head{ NULL }, tail{ NULL } {}
~SLinkedList() {
... | ALGO | 0.999317 | 4.327585 |
a0af22dc-2135-44ae-9ecc-0675bcaecde2 | pablot23/Ejercicios-con-C | perimetro de una circunferencia.cpp |
#include <iostream>
using namespace std;
int main() {
float radio, perimetro;
const float Pi = 3.1415;
cout << "Ingrese el radio de la circunferencia: ";
cin >> radio;
perimetro = 2 * Pi * radio;
cout << "El permetro de la crcurferencia es: " << perimetro << endl;
return 0;
}
| ALGO | 0.992258 | 3.90736 |
a434c26b-7c00-4b1c-b86b-3bb679a0fca8 | ramanqul/pp2018 | quiz1/sol_i.cpp | #include <iostream>
using namespace std;
int main() {
int w;
cin >> w;
if (w > 3 && w % 2 == 0) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | ALGO | 0.999139 | 4.027185 |
5ba80393-c647-4752-a780-e43f785d389a | JARVIS-ROM/android_system_extras | simpleperf/cmd_report.cpp | #include <inttypes.h>
#include <algorithm>
#include <functional>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <android-base/file.h>
#include <android-base/logging.h>
#include <android-base/parseint.h>
#include <android-base/stringprintf.h>... | TOOL | 0.903322 | 5.602751 |
674519c0-ec5a-4380-a7d6-4a425ab28493 | Mutahar456/downloaderpro | 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 |
f98cff0e-2913-4530-bc18-208d0ea0f2eb | Vedika-Agrawal/LeetCode | Flip Bits - GFG/flip-bits.cpp | //{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
int maxOnes(int a[], int n)
{
// Your code goes here
int zero =0 , one =0 , mx =0;
for(int i=0;i<n;i++){
if(a[i]==0)zero++;
else{
... | ALGO | 0.99992 | 6.149353 |
cc56fd39-fe51-4f64-a7b9-a6ea60a88579 | abdelqayyim/C-Tic-Tac-Toe | build-mac/Boost/libs/multiprecision/example/debug_adaptor_snips.cpp | #include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/debug_adaptor.hpp>
#include <iostream>
void t1()
{
//[debug_adaptor_eg
//=#include <boost/multiprecision/debug_adaptor.hpp>
//=#include <boost/multiprecision/cpp_dec_float.hpp>
using namespace boost::multiprecision;
typed... | TOOL | 0.852711 | 4.72549 |
7a434838-7033-44a5-bb5a-10a2b6d22e58 | Akshaygupta0409/DAS-CP | problems/Miscellaneous/Range-Queries/Range_Xor_Queries.cpp | #include <bits/stdc++.h>
using namespace std;
// segment tree template ; :)
struct N {
int x;
// Default constructor
N() : x(0) {}
N(int x_) : x(x_) {} // Parameterized constructor
};
N t[4000100];
vector<int> v;
N merge(N a, N b) {
N ans(0);
ans.x = (a.x ^ b.x);
return ans;
}
void b... | ALGO | 0.999952 | 5.001222 |
3b7cf0c1-072c-4fe9-bc28-639f6a9d1752 | asset-group/5ghoul-5g-nr-attacks | libs/pagmo2/src/problems/inventory.cpp | #include <algorithm>
#include <initializer_list>
#include <random>
#include <sstream>
#include <string>
#include <utility>
#include <pagmo/problem.hpp>
#include <pagmo/problems/inventory.hpp>
#include <pagmo/s11n.hpp>
#include <pagmo/types.hpp>
namespace pagmo
{
/// Fitness computation
/**
* Computes the fitness fo... | ALGO | 0.998885 | 6.883107 |
74527172-abde-4bf7-9a67-dd1e20334ed4 | dineshkummarc/miranda-im-v0.9.47-src | miranda/src/modules/keybindings/keybindings.cpp | #include "commonheaders.h"
#include "keybindings.h"
#include "m_keybindings.h"
static HANDLE hKeyBindings_Register;
static HANDLE hKeyBindings_Get;
static WNDPROC OldEditProc;
static TCHAR *keySeparator = _T(" + ");
static TreeItem *currentTreeItem = NULL;
static DWORD tempModifiers;
static DWORD modifiers;
static DWO... | TOOL | 0.945396 | 5.150283 |
4301501c-bfba-464f-a739-b87c815c0bb5 | NIRMAL1996-CODE/DSA_2024 | stack/parenthesisMatching.cpp | //write a program for Parenthesis Matching in a stack using linkedlist//
#include<stdio.h>
#include<stdlib.h>
struct node
{
char data;
struct node *next;
}*top=NULL;
void push(char x)
{
struct node *t;
t=(struct node *)malloc(sizeof(struct node));
if(t==NULL)
printf("stack is full");
e... | ALGO | 0.999501 | 3.642352 |
ef491b28-1c11-4340-b637-690f40b2ae00 | Steve-Qian-13/github | progs/codes/recursiveDPMatrixChain.cpp | // first version of recursive dynamic programming solution for
// the matrix multiplication chains problem
#include <iostream>
#include "make2dArray.h"
using namespace std;
// global variables
int *r; // r[i] is number of rows in matrix i
int **kay; // recurrence selector
int c(int i, int j)
{// Return c(i,j... | ALGO | 0.999988 | 3.94443 |
d10d20ff-ee54-4b06-8a15-b53dc5e0552b | tdhphat-x-bq/baitap | 411.cpp | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
bool check1(long long n){
if(n<2)return false;
for(long long i=2;i<=sqrt(n);i++){
if(n%i==0)return false;
}return true;
}
bool check2(long long n){
long long dem=0;
if(check1(n)){
while(n>9){
n/=10;
... | ALGO | 0.999921 | 4.898798 |
7e7374a6-fbfc-482f-bbc4-6ed95ed8ec76 | decenomy/PNY | src/qt/transactionrecord.cpp | #include "transactionrecord.h"
#include "base58.h"
#include "timedata.h"
#include "wallet/wallet.h"
#include "main.h"
#include <algorithm>
#include <stdint.h>
std::string TransactionRecord::getValueOrReturnEmpty(const std::map<std::string, std::string>& mapValue, const std::string& key)
{
const auto& it = mapVal... | TOOL | 0.852603 | 5.411136 |
e78ef1b9-158f-4b3d-adb3-1a32da00717d | Hammad-Ikhlaq/Computer-Programming-Lab | lab 14/Q2.cpp | #include<iostream>
using namespace std;
template <typename T>
class Pair
{
private:
T values[2];
public:
Pair(T a, T b)
{
values[0] = a;
values[1] = b;
}
T GetMax(T a, T b)
{
if (a >= b)
{
return a;
}
else
return b;
}
T GetMin();
};
template<typename P>
P Pair<P>::GetMin()
{
if (values[0] >= ... | ALGO | 0.998983 | 3.720594 |
463fa60b-8c02-4988-9177-5bb83960df18 | sdiazgo/Prog1 | ProgramacionUR/pension.cpp |
// Online C++ Compiler - Build, Compile and Run your C++ programs online in your favorite browser
#include<iostream>
#include<algorithm>
using namespace std;
int choice=0;
int n_semanas=0;
int n_hijos=0;
int main()
{
cout<<"Calculadora de semanas de pensión"<<endl;
cout<<"Ingrese su sexo. F=0, M=1"<<endl;
... | ALGO | 0.988041 | 3.267064 |
aa77f5b3-abf8-4efd-9443-4026edb8a98b | Mohid169/MPC_cart_pend | eigen-3.4.0/test/denseLM.cpp | #include <iostream>
#include <fstream>
#include <iomanip>
#include "main.h"
#include <Eigen/LevenbergMarquardt>
using namespace std;
using namespace Eigen;
template<typename Scalar>
struct DenseLM : DenseFunctor<Scalar>
{
typedef DenseFunctor<Scalar> Base;
typedef typename Base::JacobianType JacobianType;
typed... | TEST | 0.958621 | 5.868442 |
b28559e8-f196-4be3-ba4d-757677b52487 | kyohmin/ProblemSolving | CppPS/Baekjoon/Old/Algorithm/2108.cpp | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
bool order(pair<int,int> a, pair<int,int> b){
if(a.second == b.second){
return a.first < b.first;
}
return a.second > b.second;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nu... | ALGO | 0.999983 | 4.598726 |
fa57139a-8a7f-443a-a1f6-4841e4742a2e | avikkundu/CP_Solutions | Codeforces/CF #805/D.cpp | /*
@author:kunduavik155
Problem : https://codeforces.com/contest/1702/problem/D
*/
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define ld long double
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define r... | ALGO | 0.999934 | 4.301714 |
aa560ad6-c105-4bd5-8023-c3fe09781aba | YOUNAVI/AlgoRhythm | week16/YOUNAVI/problem_2446.cpp | // 2446
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
for (int i = 1; i < n; i++) {
for (int j = 1; j < i; j++) {
cout << " ";
}
for (int j = 2 * (n - i + 1) - 1; j > 0; j--) {
cout << "*";
}
cout << "\n";
... | ALGO | 0.999972 | 3.956535 |
b338765a-b9a6-449e-9833-33226e5b59a0 | BBabe/AMS301 | eigen/doc/snippets/SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType.cpp | MatrixXd X = MatrixXd::Random(5,5);
MatrixXd A = X + X.transpose();
cout << "Here is a random symmetric 5x5 matrix, A:" << endl << A << endl << endl;
SelfAdjointEigenSolver<MatrixXd> es(A);
cout << "The eigenvalues of A are:" << endl << es.eigenvalues() << endl;
cout << "The matrix of eigenvectors, V, is:" << endl << ... | ALGO | 0.999726 | 3.056724 |
1ef63ee0-c5c2-4742-9c1f-27c0dc33c759 | OsumeP/Proyecto | opencv-master/modules/dnn/src/layers/correlation_layer.cpp | #include "../precomp.hpp"
#include "layers_common.hpp"
namespace cv { namespace dnn {
class CorrelationLayerImpl CV_FINAL : public CorrelationLayer
{
public:
CorrelationLayerImpl(const LayerParams& params)
{
setParamsFrom(params);
pad = params.get<int>("pad", 0);
CV_Assert_N(params.has... | ALGO | 0.924548 | 7.557578 |
fe67fb6b-5034-4631-9aa9-b71298731065 | ishandutta2007/codeforces | andreasyan/normal/1452/D.cpp | #include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 200005, M = 998244353;
... | ALGO | 0.999992 | 5.33176 |
bb23b4e7-088d-4c27-a83c-054f62700879 | Project-LegionOS/android_frameworks_av | media/libeffects/lvm/lib/Common/src/LVC_MixSoft_1St_2i_D16C31_SAT.cpp | /**********************************************************************************
INCLUDE FILES
***********************************************************************************/
#include <system/audio.h>
#include "LVC_Mixer_Private.h"
#include "VectorArithmetic.h"
#include "ScalarArithmetic.h"
/*************... | ALGO | 0.990218 | 6.278666 |
f2989c3c-3bfc-4454-bd08-4b8aa3436e66 | johngarrett/llvm-research | lldb/packages/Python/lldbsuite/test/functionalities/type_completion/main.cpp | #include <string.h>
#include <vector>
#include <iostream>
class CustomString
{
public:
CustomString (const char* buffer) :
m_buffer(nullptr)
{
if (buffer)
{
auto l = strlen(buffer);
m_buffer = new char[1 + l];
strcpy(m_buffer, buffer);
}
}
~CustomString ()
{
delete[] ... | TOOL | 0.922446 | 4.444384 |
90ca97bf-6f7f-486b-bd7f-7ad6e4dffd0f | Ramid9/c_cpp_dsa | cpp programming/11. String/Check_Pangram.cpp | #include<iostream>
#include<vector>
using namespace std;
int main(){ // find whether all lower case letters are present in a stirng or not
string sentence;
cout<<"Enter string: ";
getline(cin,sentence);
int n= sentence.size();
//vector to store number of occurances of each small letter
vector... | ALGO | 0.99528 | 4.651174 |
cd6c43e9-4d11-4373-a50b-43e841f2a2d5 | SantyPilot/SantyPilot | ground/gcs/src/libs/eigen/unsupported/test/NumericalDiff.cpp | #include <stdio.h>
#include "main.h"
#include <unsupported/Eigen/NumericalDiff>
// Generic functor
template<typename _Scalar, int NX=Dynamic, int NY=Dynamic>
struct Functor
{
typedef _Scalar Scalar;
enum {
InputsAtCompileTime = NX,
ValuesAtCompileTime = NY
};
typedef Matrix<Scalar,InputsAtCompileT... | TEST | 0.990638 | 6.185318 |
d7b2c412-7c98-4e74-827a-092eb2c5e682 | fullprojects/grana-coin | src/support/lockedpool.cpp | #include <support/lockedpool.h>
#include <support/cleanse.h>
#if defined(HAVE_CONFIG_H)
#include <config/bitcoin-config.h>
#endif
#ifdef WIN32
#define WIN32_LEAN_AND_MEAN 1
#ifndef NOMINMAX
#define NOMINMAX
#endif
#include <windows.h>
#else
#include <sys/mman.h> // for mmap
#include <sys/resource.h> // for getrlimit
... | TOOL | 0.868018 | 7.592061 |
c42f57df-23c7-4667-81d0-6b5dd6ff708d | SnoopyCodes/code | cf/contest/963/c.cpp | #include <bits/stdc++.h>
using namespace std;
void solve() {
int N, K; cin >> N >> K;
vector<int> lights(N);
for (int i = 0; i < N; i++) {
cin >> lights[i];
}
sort(lights.begin(), lights.end());
int interval = lights[0]; //praying
int l = interval, r = interval + K;
for (int i... | ALGO | 0.999747 | 4.835621 |
aed8d6e2-d523-4040-b63c-218dcfceeefe | sunzhon/apnc | controllers/genesis/learning-tool/dlearn.cpp | /*
* dLearn.cpp
*
* Created on: Dec 8, 2017
* Author: suntao
*/
#include "dlearn.h"
/*
* This class implement adaptive sensory feedback strength to CPG and adaptive bias of motor neurons by
* the difference between the contact sensory and expected contact value .
*
*
* */
//-----------------Force forw... | ALGO | 0.906519 | 3.336998 |
4566f28f-e3c7-4d15-a119-e3a78a489100 | Akrobatik/ps | BaekJoon/18000/18186.cpp | // Title : 라면 사기 (Large)
// Link : https://www.acmicpc.net/problem/18186
// Time : 104 ms
// Memory: 5928 KB
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, b, c;
cin >> n >> b >> c;
vector<int> arr(n + 2);
for (int i = 0; i < n; i++) c... | ALGO | 0.999912 | 4.169924 |
33cdfa61-11cb-4304-918a-50b1be509ec4 | Anupam2027/GeekForGeek-solved-Question | 0189-rotate-array/0189-rotate-array.cpp | class Solution {
public:
void reverse(vector<int>& nums,int start , int end)
{
int i=start,j=end;
while(i<j)
{
swap(nums[i],nums[j]);
i++;
j--;
}
}
void rotate(vector<int>& nums, int k) {
int n=nums.size();
k ... | ALGO | 0.999991 | 6.011014 |
5b82b7b5-2089-4982-a865-d8de5972351a | CHANDUAJMEERA277/hotel_booking_ui | 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 |
93fa84e2-860c-4860-9d41-9793355680a0 | GaurishIIITNR/CP-Problems-Solutions | A_Sum_of_Round_Numbers.cpp | //=======================================================//
// HAR HAR MAHADEV
// DATE: 20-04-2022
// TIME:11:43:58
//=======================================================//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define dbl double
#define deb(v) cout << #v << " " << v << "\n"
#define ... | ALGO | 0.999888 | 3.771021 |
17114fba-18d6-4830-870e-628ea9768754 | hkustDB/Reservoir-Sampling-over-Joins | RSJoin/src/qz/qz_algorithm.cpp | #include <fstream>
#include <iostream>
#include <vector>
#include "../../include/reservoir.h"
#include "../../include/utils.h"
#include "../../include/qz/qz_algorithm.h"
#include "../../include/qz/qz_attribute_item_item.h"
#include "../../include/qz/qz_attribute_item_store_sales.h"
#include "../../include/qz/qz_attribu... | DATA | 0.91516 | 4.326291 |
1f87f966-9bc4-4849-9739-c19f5977043a | ellilu11/FMM2D | src/interactions/green_function.cpp | #include "green_function.h"
std::vector<Eigen::Matrix3cd> GreenFunction::Dyadic::coefficients(
const Eigen::Vector3d &dr,
const Interpolation::UniformLagrangeSet &interp) const
{
std::vector<Eigen::Matrix3cd> coefs(interp.order() + 1,
Eigen::Matrix3cd::Zero());
const ... | ALGO | 0.995188 | 5.624989 |
de952af7-0063-40d3-bd63-cfb0d515273e | Asinay17/LabDepuracion | LabDepuracion/LabDepuracion.cpp |
#include <iostream>
using namespace std;
//Funcion recursiva para calcular el factorial
int factorial(int n)
{
if (n < 0)
{
throw invalid_argument("Error: Factorial de un numero negatico no esta definido.");
}
if (n == 0 || n == 1){
return 1;
}
//se agrega un check para verificar que el valor ingresado sea ... | ALGO | 0.995241 | 5.912686 |
845387a2-abe5-4dbc-ac7c-5471c4af041f | CC576/factorization | src/fermat/fermat.cpp | #include "fermat.hpp"
//#include <iostream>
void fermat(mpz_class& n, mpz_class& p, mpz_class& q){
//std::cerr << n << std::endl;
mpz_class base = sqrt(n), h = base*base - n;
//mpz_class i = 0;
mpz_class x = base, y = 0, nHalves = n/2;
//mpz_class twoBase = 2*base;
while(y < nHalves){
... | ALGO | 0.999084 | 3.94674 |
c21357bf-6e25-4dd8-aba2-2d29d2888f91 | ajakhotia/eyeKin | boost/boost/boost_1_57_0/libs/graph/test/degree_centrality.cpp | #include <vector>
#include <boost/graph/undirected_graph.hpp>
#include <boost/graph/directed_graph.hpp>
#include <boost/graph/degree_centrality.hpp>
#include <boost/graph/exterior_property.hpp>
using namespace std;
using namespace boost;
// useful types
// number of vertices in the graph
static const unsigned N = 5;... | TEST | 0.892212 | 6.388647 |
69240773-e500-4da6-8815-8242cf3e4881 | soham6125/CSES-Solutions | Tree Algorithms/Tree Diameter.cpp | #include<bits/stdc++.h>
#define ll long long int
#define loop(a,b,i) for(long long int i=a;i<b;i++)
#define loopr(a,b,i) for(long long int i=a;i>=b;i--)
#define cn continue;
#define pb push_back
#define db double
#define mp make_pair
#defin... | ALGO | 0.998586 | 4.223965 |
14e82439-b8f0-4384-ab36-a9c28ea8f09a | Abnoxious-rafi/Competitive_programming | algorithm/segment_tree/binary)index_treeOr_Fenwick_Tree.cpp | // C++ code to demonstrate operations of Binary Index Tree
#include <iostream>
using namespace std;
/* n --> No. of elements present in input array.
BITree[0..n] --> Array that represents Binary Indexed Tree.
arr[0..n-1] --> Input array for which prefix sum is evaluated. */
// Returns sum of arr[0..index].... | ALGO | 0.999986 | 7.234191 |
726b8b6c-f00f-43e1-8555-219df88c6e7b | Keshav1707/Submissions | C_Array_Game.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define di(x) \
ll x; \
cin >> x
#define vecll vector<ll>
#define sz(x) ((int)(x).size())
#define pb push_back
#define po pop_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define endl "\n"... | ALGO | 0.999864 | 4.714074 |
46c4a63b-7d62-4af8-b89d-f37878a592ef | kimmk6845/Baekjoon | DFS & BFS/1707(이분그래프).cpp | #include <iostream>
#include <vector>
#include <cstring>
using namespace std;
#define MAXSIZE 20000
int V, E;
vector<int> graph[MAXSIZE + 1];
int visit[MAXSIZE + 1];
void DFS(int start, int color);
bool isBipartiteGraph(void);
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
... | ALGO | 0.999969 | 4.920465 |
46be7739-5089-4b83-95bf-f5cde3ed1568 | nparabadzh/up_prakt_2018 | 18.10.19/problem9.cpp | #include <iostream>
using namespace std;
int main()
{
int number;
cout << "Enter a number: ";
cin >> number;
int reverseNumber = 0;
while(number) {
reverseNumber = reverseNumber*10 + number%10;
number/=10;
}
cout << "The reverse number of " << number << " is: " << reverseNum... | ALGO | 0.99429 | 4.232275 |
2d3b2c2c-0b3b-4bfa-a7ae-f9de93626b7f | Roshan-1024/LeetCode-Solutions | 2824. Count Pairs Whose Sum is Less than Target.cpp | class Solution {
public:
int countPairs(vector<int>& nums, int target) {
int count = 0;
for(auto i = nums.begin(); i != nums.end(); i++)
for(auto j = i + 1; j != nums.end(); j++)
if(*i + *j < target) count++;
return count;
}
}; | ALGO | 0.999879 | 6.013515 |
d331e796-0915-48e4-8ea5-29d60f5b369e | SohamD34/LeetCode | rotate-string/Accepted/11-3-2024, 7:37:50 PM/Solution.cpp | // https://leetcode.com/problems/rotate-string
class Solution {
public:
bool rotateString(string s, string goal) {
if(s.length() != goal.length()){
return false;
}
bool rotated = false;
int n = s.length();
int mark = 0;
for(int i=0; i<n; i++){
... | ALGO | 0.999981 | 6.114584 |
4f348ec3-2929-451a-af01-eee8848dd2d8 | rajaditya-m/pbrt-realistic-camera | core/volume.cpp | // core/volume.cpp*
#include "stdafx.h"
#include "volume.h"
// Volume Scattering Local Definitions
struct MeasuredSS {
const char *name;
float sigma_prime_s[3], sigma_a[3]; // mm^-1
};
static MeasuredSS mss[] = {
// From "A Practical Model for Subsurface Light Transport"
// Jensen, Marschner, Levoy, Hanrahan
... | ALGO | 0.982859 | 6.164672 |
ff331b5b-2497-4dde-bcc3-727f95fae6b3 | M-o-C-u-i-s-h-l-e/SPOJ | TEST.cpp | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
while (cin >> n) {
if (n == 42) break;
cout << n << endl;
}
}
| ALGO | 0.993359 | 3.506585 |
7e18a784-30f4-4ff7-a4bc-e33479eb91a1 | Pill-Su-Kim/cpp | week3/03└х-RussianRouletteGame/RussianRoulette.cpp | #include "RussianRoulette.h"
int playRussianRoulette(int nTurns, int nBullets)
{
int start = rand() % nTurns;
printf("\n Ƚϴ. %d մϴ.\n", start + 1);
while (true) {
int pos = rand() % 6;
printf("[%d]\tźâ Ƚϴ.\n", start + 1);
printf("\t ݹߵ˴ϴ...");
getchar();
if (pos < nBullets) break;
printf("\t~~~ ҽϴ!!!\... | ALGO | 0.966284 | 3.526851 |
ac6953ae-329b-42f9-8645-14893fa761eb | nsrksreecharan/coding-practice | Arrays_practice/Find_Largest_Element_in_Array.cpp | #include <iostream>
#include <climits>
using namespace std;
int main() {
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
int max=INT_MIN;
for(int i=0;i<n;i++){
if(max<arr[i]){
max=arr[i];
}
cout<<arr[i]<<" ";
}
cout<<endl;
... | ALGO | 0.999948 | 3.977985 |
1d1898fa-1e15-41e7-8763-afb874aa7084 | ayush-gupta2002/Datastructures-and-Algorithms | sum-tree.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
struct Node *left;
struct Node *right;
};
// Utility function to create a new Tree Node
Node* newNode(int val)
{
Node* temp = new Node;
temp->data = val;
temp->left = NULL;
temp->right = NULL;
... | ALGO | 0.999093 | 7.166217 |
ab6068af-0649-43c9-9bb8-69f176ef5377 | Netrum/Netrum-Blockchain | src/arith_uint256.cpp | #include "arith_uint256.h"
#include "crypto/common.h"
#include "uint256.h"
#include "uint512.h"
#include "utilstrencodings.h"
#include <stdio.h>
#include <string.h>
template <>
std::string base_uint<256>::GetHex() const
{
return ArithToUint256(*this).GetHex();
}
template <>
void base_uint<256>::SetHex(const cha... | ALGO | 0.927941 | 6.750922 |
d0c1d696-9103-4dce-a4c9-b74d9e98b23e | smartysagar21/GraphTree | Graph_02.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1000;
vector<int>graph[N];
bool vis[N];
void dfs (int vertex){
//Take action on vertex after entering on the vertex
//cout<<vertex<<endl;
vis[vertex]=true;
for(int child:graph[vertex]){
//Take action on child before entering the child node
if(vis... | ALGO | 0.999977 | 4.315794 |
be7914e2-112a-4e45-a70d-70333a9db1a4 | cola-glai/iMOEAD_beta | plvf/codes/selection/moead/eigen-3.3.8/doc/examples/Tutorial_ArrayClass_interop_matrix.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
MatrixXf m(2,2);
MatrixXf n(2,2);
MatrixXf result(2,2);
m << 1,2,
3,4;
n << 5,6,
7,8;
result = m * n;
cout << "-- Matrix m*n: --" << endl << result << endl << endl;
result = m.array() * ... | ALGO | 0.996334 | 4.306757 |
befe8e81-c510-482b-b729-8ceaf738c6e0 | cedarcoin/cedarcoin | src/bitcoin-cli.cpp | #if defined(HAVE_CONFIG_H)
#include "config/bitcoin-config.h"
#endif
#include "chainparamsbase.h"
#include "clientversion.h"
#include "fs.h"
#include "rpc/client.h"
#include "rpc/protocol.h"
#include "util.h"
#include "utilstrencodings.h"
#include <stdio.h>
#include <event2/buffer.h>
#include <event2/keyvalq_struct.... | WEB | 0.981531 | 6.506476 |
28d84fde-ea7f-4168-9ced-afc4564ed71a | shagormahamud93/university_management | cr_manager.cpp | #include <iostream>
#include "cr_manager.h"
#include "course_manager.h"
#include "student_manager.h"
using namespace std;
CRManager::CRManager(CourseManager* cm, StudentManager* sm)
: courseManager(cm), studentManager(sm) {}
void CRManager::voteForCR(CRVote votes[], int numStudents) {
for (int i = 0; i < ... | TOOL | 0.917697 | 5.766072 |
338678ef-6beb-4442-bc15-c9992ead9f40 | MariaPetlovana/QuickSort_C | QuickSortAlgo/QuickSortAlgo.cpp | #include <iostream>
using std::cin;
using std::cout;
struct Pair
{
int StartPartition;
int EndPartition;
};
template<typename T>
Pair Partition(T* ArrayToSort, int BeginOfArray, int EndOfArray)
{
Pair ResultPair;
ResultPair.StartPartition = BeginOfArray;
ResultPair.EndPartition = EndOfArray;
... | ALGO | 0.999872 | 5.125894 |
ec9eef50-ba45-42f9-af84-16197d02ea8e | TCGBench/TCGBench | data/partially_correct_code/partially_correct_code_noip/P1097/80-100_5.cpp | #include<bits/stdc++.h>
using namespace std;
int n;
long long a[100010];
int cnt=1;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
sort(a+1,a+1+n);
for(int i=2;i<=n;i++)
{
if(a[i]==a[i-1])
{
cnt++;
}
else
{
c... | ALGO | 0.999957 | 3.190984 |
ffd5dca7-027e-40f3-b73f-68be324a1573 | shamiul94/Problem-Solving-Online-Judges | LeetCode/4. Median of Two Sorted Arrays.cpp | // NOT THE OPTIMAL SOLUTION
class Solution {
public:
double findMedianSortedArrays(vector<int> &nums1, vector<int> &nums2) {
/*
1, 3, 6, 8 --> m
2, 4, 5, 7 --> n
*/
int m = nums1.size(), n = nums2.size();
int len = m + n;
priority_queue<pair<int, int>> pq; // <value, arr_no>
... | ALGO | 0.99999 | 6.056071 |
1ff81b28-d075-461d-9f75-7222aa5ddef1 | ishandutta2007/codeforces | ezoilearner/normal/1704/F.cpp | #include<bits/stdc++.h>
using namespace std;
#define cout cerr
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long ll;
typedef pair<int,int> pii;
#define FR first
#define SE second
inline void rd(int &x){
x=0;char ch=getchar();int f=1;
while(ch<'0'||ch>... | ALGO | 0.999928 | 3.705553 |
b299026b-d61c-4493-ae75-a0d8d9da8960 | Xuanmai1110/C- | C13.cpp | /* Viết chương trình C nhập vào một số nguyên N (0<N<100).
Liệt kê ra màn hình tất cả các xâu nhị phân độ dài N */
#include <stdio.h>
#include <math.h>
int main()
{
int N;
printf("Nhap vao so nguyen N (0 < N < 100): ");
scanf("%d", &N);
if (N <= 0 || N >= 100)
{
printf("N khong hop le. ... | ALGO | 0.999481 | 5.231429 |
832daa2c-2909-4b4b-a110-711463e80cab | rhmunna143/competetive-programming | Code-Forces/993-div-4/A_Easy_Problem.cpp | /***
* Objective:
*
* Context: Cube is given an integer n. She wants to know how many ordered pairs of positive integers (a,b) there are such that a=n−b. Since Cube is not very good at math, please help her!
*
* Constrains:
* 1. 1<=t<=99
* 2. 2<=n<=100
*
* Note:
*
*
* TODO:
* Algorithm | Pseudo-code | Step... | ALGO | 0.99916 | 5.37974 |
63674a3e-4fb1-4fa2-9bf0-8ff6c764794d | lannn2410/streamingksubmodular | SingleGreedy.cpp | #include "SingleGreedy.h"
SingleGreedy::SingleGreedy(Network * g, uint k) : Framework(g), k(k)
{
}
SingleGreedy::~SingleGreedy()
{
}
double SingleGreedy::get_solution()
{
vector<pair<uint, uint>> seeds;
int no_nodes = g->get_no_nodes();
vector<bool> selected(no_nodes, false);
for (int j = 0; j < Constants::BUDGE... | ALGO | 0.999896 | 4.899375 |
4ff68fa4-0cca-4ae1-9ad9-b00cc8f825c8 | ishandutta2007/codeforces | ssrs_/normal/1547/D.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
for (int i = 0; i < t; i++){
int n;
cin >> n;
vector<int> x(n);
for (int j = 0; j < n; j++){
cin >> x[j];
}
vector<int> y(n);
y[0] = 0;
int p = x[0];
for (int j = 1; j < n; j++){
int p2 = p |... | ALGO | 0.99999 | 4.211961 |
9f1ac184-2123-4d3d-bf8d-be6b0de856b2 | liangyh911/ATTNChecker | pytorch/aten/src/ATen/native/cpu/group_norm_kernel.cpp | #define TORCH_ASSERT_ONLY_METHOD_OPERATORS
#include <ATen/native/group_norm.h>
#include <algorithm>
#include <array>
#include <numeric>
#include <ATen/core/Tensor.h>
#include <ATen/Dispatch.h>
#include <ATen/cpu/vec/vec.h>
#include <ATen/cpu/vec/functional.h>
#include <ATen/native/cpu/utils.h>
#include <ATen/native/c... | TOOL | 0.94582 | 7.384539 |
0b58380c-9e38-4e68-9086-96d9b8706674 | Unagi-zoso/five-golds-in-a-day | legacy/boj-1520.cpp | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using v = vector<vector<bool>>;
int dx[4] = { 1, -1, 0, 0 };
int dy[4] = { 0, 0, 1, -1 };
int n, m, ans;
vector<vector<int>> origin(505, vector<int>(505));
vector<vector<int>> dp(505, vector<int>(505));
int dfs(int x, int y){
if (x... | ALGO | 0.999928 | 4.354605 |
a4fb3c72-431d-4d74-89f2-a6ebb0759e66 | arifulnoman/Competitive-Programming | E_Vlad_and_an_Odd_Ordering.cpp | #include<bits/stdc++.h>
#define ll long long
const int INF = 1e9 + 7;
using namespace std;
void solve()
{
ll i,n,k,sum = 0,count = -1;
cin >> n >> k;
int index = k;
while(sum < k)
{
sum+=(n + 1) / 2;
n/=2;
if(sum < k)
{
index = k - sum;
}
c... | ALGO | 0.999788 | 4.139716 |
09fc35a8-9911-44e8-91a4-30511195d94a | kmjp/procon | leetcode/351-400/389/3074.cpp | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a)... | ALGO | 0.999174 | 3.604422 |
122188fd-d333-472e-966e-bff2510029d9 | syncfusion/flutter-widgets | packages/syncfusion_pdfviewer_windows/example/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.998585 | 6.797273 |
8965c5a9-0cce-4ba5-b9c3-9fb8523357ee | msft-mirror-aosp/platform.external.deqp-deps.SPIRV-Tools | source/opt/ccp_pass.cpp | // This file implements conditional constant propagation as described in
//
// Constant propagation with conditional branches,
// Wegman and Zadeck, ACM TOPLAS 13(2):181-210.
#include "source/opt/ccp_pass.h"
#include <algorithm>
#include <limits>
#include "source/opt/fold.h"
#include "source/opt/function.h... | TOOL | 0.993243 | 5.355371 |
5054620b-0157-4928-b03c-02a7947bdf24 | VINURIRODRIGO/Artographia | example/image_classification_mobilenet/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.997517 | 6.76073 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.