uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
95bbc1fd-a47b-41a5-ab39-761ea0e99cd0 | mjha123kumar/dday4 | reversearray.cpp | #include <stdio.h>
int reverse(int array[10], int length)
{
int i, temp;
for (i = 0; i < length / 2; i++)
{
temp = array[i];
array[i] = array[length - 1 - i];
array[length - 1 - i] = temp;
}
}
int main()
{
int array[100], i, size;
printf("Enter the Size Of Array:");
s... | ALGO | 0.998651 | 3.378881 |
77608d12-d141-4698-b89d-ea8739a91e09 | Piyushkumar030/sms-spam_classifier-pkd- | env/Lib/site-packages/sklearn/svm/src/liblinear/tron.cpp | #include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include "tron.h"
#ifndef min
template <class T> static inline T min(T x,T y) { return (x<y)?x:y; }
#endif
#ifndef max
template <class T> static inline T max(T x,T y) { return (x>y)?x:y; }
#endif
static void default_print(const char *buf)
{... | ALGO | 0.999425 | 5.847107 |
f517e773-f174-463b-9cc3-8645f7e539e4 | ishandutta2007/codeforces | anta/normal/493/C.cpp | #define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
... | ALGO | 0.99999 | 3.259585 |
d98f6d13-3b47-4872-b227-a878a66d94ac | ishandutta2007/codeforces | fishcathu/normal/1609/B.cpp | #include<bits/stdc++.h>
#define ls i<<1
#define rs i<<1|1
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
typedef array<int,2> pii;
const int N=1E5+10;
const int inf=1<<30;
template<typename T>bool cmin(T &l,T r){return l>r?l=r,1:0;}
template<typename T>bool cmax(T &l,... | ALGO | 0.999966 | 3.981591 |
b673e0ef-9e61-4536-857e-d0d26ebcf596 | RohanP-57/Student_management_System | 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 |
fb821393-3b05-47b9-9500-e67a66599002 | Tanvir-Mahamood/Data-Structure-in-CPP | CPP/LabFinl1.cpp | #include <bits/stdc++.h>
#define nn "\n"
using namespace std;
int main() {
int i,element,n;
n=10;
int ax[n];
for(i=0;i<n;i++) ax[i]=i+1; //task 1
queue<int> q;
for(i=0;i<n;i++)
{
q.push(ax[i]); //task 2
}
while(!q.empty())
{
if(q.front()%2==0) cout<<q.front()<<"... | ALGO | 0.999839 | 3.46995 |
ab60f2cf-c033-476a-9be1-e77d254f2087 | MPSLab-ASU/ccf | gem5/src/systemc/tests/systemc/misc/gnats/pr-52/pr-52.cpp | /*****************************************************************************
pr-52.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/*****************************************************************************
... | TOOL | 0.974422 | 4.478974 |
d56ccc79-b09a-4c71-a1f6-aae5fb2bb250 | mpfeifer1/Kattis | junk.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
ld eps = .00001;
struct point {
ld x, y, z;
};
struct junk {
point init;
ld r;
ld dx, dy, dz;
};
ld dist(point p1, point p2) {
ld x = pow(p1.x-p2.x, 2);
ld y = pow(p1.y-p2.y, 2);
ld z = pow(p1.z-p2.z, 2);
return sq... | ALGO | 0.999734 | 4.38561 |
c7655c50-4aa5-412b-bdf9-48c087f6d0a0 | OutLaio/Equipe-resitic18 | Avaliacao2/DataFruta.cpp | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
class Data {
int dia, mes, ano;
public:
Data (int _dia, int _mes, int _ano) {
dia = _dia;
mes = _mes;
ano = _ano;
}
Data(){}
/*
O metodo abaixo retornara -1 se d1 eh anterior a d2
Retornara 0 se d1 = d2
Re... | ALGO | 0.996488 | 4.013858 |
3bb874d3-9858-4dc3-af44-ac2d2adbdb20 | funfox2906/Arduino-Projects | libraries/Simplepush/AES.cpp | #include "AES.h"
/* This version derived by Mark Tillotson 2012-01-23, tidied up, slimmed down
and tailored to 8-bit microcontroller abilities and Arduino datatypes.
The s-box and inverse s-box were retained as tables (0.5kB PROGMEM) but all
the other transformations are coded to save table space. Many eff... | ALGO | 0.998078 | 6.199252 |
8c02baf6-9ae8-471b-95ef-7921b53e09c0 | khadija1114/Online-Judge-Solutions | Codeforces/ITMO Academy: pilot course/very easy task.cpp | #include<bits/stdc++.h>
using namespace std;
int possible(int t, int x, int y)
{
return t/x + max(0, (t-x)/y);
}
int main()
{
int n, x, y; cin >> n >> x >> y;
if (x > y) swap(x, y);
int l = 0, r = INT_MAX, mid;
while (l < r) {
mid = l + (r-l)/2;
if (possible(mid, x, y) >= n) r = mid;
else l = mid+1;
}
... | ALGO | 0.999919 | 3.794274 |
8af1223a-f4d1-4bbd-b18f-92e3f6b0fb0c | BramVroegop/Flight-Sim-Connector | TCPServer/Calculator.cpp | #include "Calculator.h"
Calculator::CalculationData Calculator::run(FlightData& fd, float* oldPistonLengths)
{
//We convert the degree values we received from the FlightData object into Radians.
bankRadian = fd.bank * pi / 180;
pitchRadian = fd.pitch * pi / 180;
yawRadian = fd.rudder * pi / 180;
//Get the cos a... | ALGO | 0.97773 | 4.829415 |
461891f0-4e65-450c-a587-ee3d5421fa2b | dvaitam/codeforces | 1000-1999/1500-1599/1500-1509/1503/solA.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define all(x) (x).begin(), (x).end()
//debugging
//ChangeBinaryDisplay
static const int bytedisplaysize = 1;
#define debug(x) cerr << "db "<< #x <<": "; _print(x); cerr << endl;
#define debugbin... | ALGO | 0.999925 | 3.616573 |
51bf1ed9-6e0f-4bee-8d6a-d3a011b06452 | nardo0905/CS-Uni-Course-Git | 221024 Pract/task2.cpp | #include <iostream>
bool prime(int n) {
bool isPrime = true;
if (n == 1) {
return false;
}
if (n == 2) {
return true;
}
for (int i = 2; i <= n; i++) {
if (i != n && n % i == 0) {
isPrime = false;
break;
}
}
return isPri... | ALGO | 0.99974 | 4.945263 |
328402e0-f1ad-4044-ad3a-76bfa15c91e1 | Tutu852/dsa | Queue/CircularQueue.cpp | #include <iostream>
using namespace std;
class Cqueue {
public:
int* arr;
int size;
int front;
int rear;
// Constructor with specified type for `size`
Cqueue(int size) {
arr = new int[size];
this->size = size;
front = -1;
rear = -1;
for(int i=0;i<size;... | ALGO | 0.997487 | 5.109024 |
9e744225-5b9d-4305-9cba-b110568c291d | kkdlau/COMP4901Q-Floyd-Warshallal | serial/Floyd_Warshallal.cpp | #include <algorithm>
#include <chrono>
#include <climits>
#include <cstring>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
using namespace std::chrono;
using namespace std;
using SMatrix = vector<vector<int>>; // Square Matrix
const int DIST_LIMIT = 10000;
bool fread(const string &fpath,... | ALGO | 0.99566 | 4.214974 |
6860a14d-8447-4d41-85d7-4b2da449df61 | bruno-avr/competitive-programming | kattis/dvds.cpp | #include "bits/stdc++.h"
using namespace std;
#define optimize ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define endl "\n"
#define ll long long
#define ld long double
#define pii pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define INF ... | ALGO | 0.999919 | 5.524114 |
10551764-10ad-4581-8256-0da60ee449a5 | kellsnc/sadx-multiplayer | source/patches/patch_o_windy_torout.cpp | #include "pch.h"
#include "multiplayer.h"
// Rewrite the Windy Valley Tornado event
// Note: not accurate
DataPointer(NJS_POINT3*, tor_pos, 0x3C5D674);
static Float offset_ypos_m[PLAYER_MAX]{};
static Float yang_m[PLAYER_MAX]{};
static void __cdecl VacumePlayer_r(task* tp);
FastUsercallHookPtr<decltype(&VacumePlaye... | ALGO | 0.873536 | 4.857091 |
2730bd6e-88d5-4bba-a7cc-e028f29fbf01 | randomwalk10/my_leetcode_solutions | 35_Search_Insert_Position.cpp | /*
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Example 1:
Input: [1,3,5,6], 5
Output: 2
Example 2:
Input: [1,3,5,6], 2
Output: 1
Example 3:
Input: [1,3,5,6], 7
O... | ALGO | 0.999993 | 6.395833 |
0794f00f-d928-4491-8757-1db40b31306c | ishandutta2007/codeforces | shadowatyy/normal/1033/A.cpp | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VLL vector<ll>
#define PII pair<int, int>
#define VPII vector<PII>
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define endl '\n'
#define ALL(c) (... | ALGO | 0.999418 | 3.05766 |
cffd38ed-ec66-4755-97cd-a512d6a089df | Aquib-Nawaz/CP4-Book | UVa/735.cpp | #include <iostream>
#include <cstring>
using namespace std;
int A[61];
int dp[181], dp1[181];
int main(){
memset(A,0, sizeof A);
memset(dp,0, sizeof dp);
memset(dp1,0, sizeof dp1);
A[0]=A[50]=1;
for(int i=1;i<=20;i++)A[i]=A[2*i]=A[3*i]=1;
int j=0;
for(int i=0; i<=60;i++)if(A[i])A[j++]=i;
... | ALGO | 0.997991 | 3.651712 |
f2dcf994-04c1-4b82-9775-913c64ac8a7f | unknownbrackets/maxcso | 7zip/CPP/7zip/Compress/BZip2Crc.cpp | // BZip2Crc.cpp
#include "StdAfx.h"
#include "BZip2Crc.h"
UInt32 CBZip2Crc::Table[256];
static const UInt32 kBZip2CrcPoly = 0x04c11db7; /* AUTODIN II, Ethernet, & FDDI */
void CBZip2Crc::InitTable()
{
for (UInt32 i = 0; i < 256; i++)
{
UInt32 r = (i << 24);
for (unsigned j = 0; j < 8; j++)
r = (... | TOOL | 0.957259 | 4.773074 |
ff00fc07-e709-4b10-8608-b6231c5bd863 | s-rifat/Competitve-Programming | CODEFORCES/Random/B. Minimal Cost.cpp | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define FAST ios_base::sync_with_stdio(false);ci... | ALGO | 0.999935 | 4.302864 |
8f348dc7-639f-4fe6-81b0-d6e881e6777c | jja08111/algorithm | backjoon/[2162] 선분 그룹.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <cstring>
#include <stack>
#include <cmath>
#include <climits>
#include <cctype>
using namespace std;
const int INF = 987654321;
const int MOD = 1000000000 + 7;
const int DIR[4][2] = { {1, 0}, {0, 1}, {-1... | ALGO | 0.999689 | 5.158245 |
bf7caf23-236e-4795-8084-a4292feca1cd | AdultChain/AdultChain | src/rpcclient.cpp | #include "rpcclient.h"
#include "rpcprotocol.h"
#include "ui_interface.h"
#include "util.h"
#include <set>
#include <stdint.h>
using namespace std;
using namespace json_spirit;
class CRPCConvertParam
{
public:
std::string methodName; //! method whose params want conversion
int paramIdx; //! 0-base... | CONFIG | 0.948483 | 6.924037 |
8296fdc4-b4e5-4e6e-8c07-7e403e60ee2c | OrangeYYC/Rehost-LiteOS-m | key_components/communication_wifi/wifi/services/wifi_standard/wifi_framework/wifi_toolkit/config/wifi_settings.cpp | #include "wifi_settings.h"
#include <algorithm>
#include <chrono>
#include "define.h"
#include "wifi_cert_utils.h"
#include "wifi_global_func.h"
#include "wifi_log.h"
#include "wifi_config_country_freqs.h"
#ifdef FEATURE_ENCRYPTION_SUPPORT
#include "wifi_encryption_util.h"
#endif
namespace OHOS {
namespace Wifi {
WifiS... | TOOL | 0.857997 | 4.342319 |
b5664995-e032-47fb-974f-f768f211b189 | FrancescoMinisini/gituni | 2023/Minisini_FrancescoGiuseppe_40098A/main.cpp | #include "TApplication.h"
#include "TCanvas.h"
#include "TH1F.h"
#include "TH2F.h"
#include "TGraph.h"
#include "TF1.h"
#include "Models/RandomGen.h"
#include "Models/IntegralMc.h"
#include "Models/FunzioneBase.h"
#include "Models/Integral.h"
#include "Models/Measure.h"
#include "Models/Vettore.h"
#include "Models/Equa... | ALGO | 0.984705 | 4.374112 |
5feba632-99e1-4949-8f9e-5c5cd75ee420 | raulest50/Xilinx_Designs | VitisHLS/dudley_accel1/src/top.cpp | #include <complex>
#include "top.h"
void call_fft_ip(std::complex<float> fft_input[FFT_LENGTH_MAX], std::complex<float> fft_output[FFT_LENGTH_MAX],
//unsigned size,
bool direction) {
config_t fft_config;
status_t fft_status;
fft_config.setDir(direction);
//fft_config.setNfft(size);
hls::f... | ALGO | 0.994199 | 4.037452 |
c2f4d22e-1f60-4c47-ac71-4e8ece669bad | Romasa102/CompetitiveProgramming | JOI/6/Banner.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i = 0; i < (n); ++i)
#define repp(i,o,n) for(ll i = o; i < (n); ++i)
using P = pair<ll,ll>;
int main(){
ll H,W;
cin >> H >> W;
ll JOI[H][W];
rep(i,H){
rep(j,W){
cin >> JOI[i][j];
}
... | ALGO | 0.999851 | 3.87873 |
0ed2b401-7dc8-4789-9164-d4c7e45b4514 | jillions242/My-Practice | Day2/PracticeB1/B3.cpp | //1-100 event
#include<iostream>
using namespace std;
int main()
{
int a=1;
while(a<=100)
{
if(a%2==0)
{
cout<<a<<endl;
}
a++;
}
return 0;
} | ALGO | 0.97493 | 3.245244 |
e2ff8fd6-5088-4d96-afcf-a7acb70d3fda | duyichao/MINETrans-IWSLT23 | fairseq/fairseq/clib/libnat/edit_dist.cpp | #include <pybind11/detail/common.h>
#include <pybind11/pybind11.h>
#include <torch/torch.h> // @manual=//caffe2:torch_extension
#include <algorithm>
#include <cstdint>
#include <iosfwd>
#include <memory>
#include <new>
#include <string>
#include <utility>
#include <vector>
using namespace ::std;
vector<vector<uint32_... | TOOL | 0.994999 | 7.06844 |
81e1cecc-e456-4fff-a94d-db9b92eb8dd5 | HitarthThakkar/LeetCode-Submissions | 3876-transform-array-to-all-equal-elements/3876-transform-array-to-all-equal-elements.cpp | class Solution
{
public:
int giveOps(vector<int> &nums, int target)
{
int ops = 0;
int lt = -1;
for(int i = 0; i < nums.size(); i++) {
if(nums[i] == target) {
if(lt == -1) { lt = i; }
else { ops += (i - lt); lt = -1; }
}
... | ALGO | 0.999932 | 5.483934 |
769e9521-a97c-4d74-8ca2-0745f0b1bedb | DarenKostov/contests-and-practice | softuniada-2023/longestValidParentheses.cpp | #include "iostream"
using namespace std;
int main(){
char input[100];
cin >> input;
int longest=0;
int current=0;
for(int i=0; i<100; i++){
if(input[i]=='\0'){
break;
}
if(input[i]=='('){
if(input[i+1]==')'){
current+=2;
i++;
}else{
if(longest<cu... | ALGO | 0.964732 | 3.577899 |
93bfecb6-7088-4137-a264-7acf8a9f24c7 | pce-devel/mednafenPceDev | mednafen/src/gba/bios.cpp | #include "GBA.h"
#include "bios.h"
#include "GBAinline.h"
#include "Globals.h"
namespace MDFN_IEN_GBA
{
static const int16 sineTable[256] = {
(int16)0x0000, (int16)0x0192, (int16)0x0323, (int16)0x04B5, (int16)0x0645, (int16)0x07D5, (int16)0x0964, (int16)0x0AF1,
(int16)0x0C7C, (int16)0x0E05, (int16)0x0F8C, (int16)... | ALGO | 0.969768 | 3.073173 |
fc7bb8d8-c937-459f-b974-3e19056377c4 | Madhavan0210/TUF-A2Z-DSA | Stack & Queue/imp of circular queue using linkedlist.cpp | #include<bits\stdc++.h>
using namespace std;
class Node
{
public:
int data;
Node* next;
Node()
{
data=0;
next=NULL;
}
Node(int data1)
{
data=data1;
next=NULL;
}
};
class Linke... | ALGO | 0.999642 | 4.384996 |
37394577-dbf2-40ef-b473-b826759283c8 | pbkpch3514/problem_solving | algorithms/recursion/findMax.cpp | #include <iostream>
#include <vector>
using namespace std;
int findMax(vector<int>& dat, int begin, int end) {
if(begin == end) return dat[begin];
int mid = (begin + end) / 2;
int max1 = findMax(dat, begin, mid);
int max2 = findMax(dat, mid+1, end);
return max(max1, max2);
}
int main() {
vector<int> dat = {1, 100... | ALGO | 0.999913 | 4.221567 |
78f9cbe0-12f2-42c4-bf92-9670113ac9f3 | akosiorek/CSE | MLCV/ex3/gpml-matlab-v3.5-2014-12-08/util/lbfgsb/program.cpp | #include "program.h"
#include <string.h>
// Function definitions.
// -----------------------------------------------------------------
// Copy a C-style string (a null-terminated character array) to a
// non-C-style string (a simple character array). The length of the
// destination character array is given by "ndest"... | ALGO | 0.994791 | 6.362085 |
9707d07f-8f8f-4eed-9059-9539f128443d | prathamverma42/Daily-Coding | 494-target-sum/494-target-sum.cpp | class Solution {
public:
int findTargetSumWays(vector<int>& nums, int target) {
int n = nums.size();
int sum = 0;
for(auto i : nums)
sum += i;
int s = (sum + target) / 2;
if(sum < abs(target) || (target+sum)&1) return 0;
int dp[n+1][s+1];
for(int i... | ALGO | 0.999989 | 5.945848 |
5044f9c6-9336-4fcb-a452-f262c9297d48 | ishandutta2007/codeforces | peter50216/normal/94/D.cpp | #include<stdio.h>
int cnt[105];
int g[105][105];
int main(){
int n,w,m,i,j;
scanf("%d%d%d",&n,&w,&m);
for(i=0;i<n;i++)cnt[i]=m;
int ii=0;
for(i=0;i<m;i++){
int k=n;
while(k>0){
if(cnt[ii]==0)ii++;
cnt[ii]--;
k--;
g[ii][i]++;
}
}
for(i=0;i<n;i++){
int cc=0;
for(j=0;j<... | ALGO | 0.99978 | 3.201677 |
f9710a2f-08b9-4211-91a4-89747e789947 | ishandutta2007/codeforces | krijgertje/normal/570/E.cpp | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <list>
#include <cassert>
#include <ctime>
#include... | ALGO | 0.999939 | 3.795884 |
f8fe5b3b-e4c5-4387-b8a1-0e203fbe5954 | C0D1NG/Algorithms | Graph/C++/DFS_recursive.cpp | #include<iostream>
#include<list>
#include<stack>
using namespace std;
int vertices, edges;
boolArray:
bool *visited[] = new bool(V);
class Graph
{
int V;
list<int> *adj;
void DFSRecur(int v, bool visited[]);
public:
Graph(int V);
void addEdge(int a, int b);
void DFS(int v);
};
Graph::Graph(int V)
... | ALGO | 0.99992 | 5.421651 |
9b231850-2c93-495f-acbe-bb1e6a12178b | WiserZhou/AlgorithmProblem | LanQiao/TangGuo.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 20;
int n, m, k, dp[1 << 20], v[1 << 20]; // 状压的数组需要开2^n，因为表示的是状态，每种口味的状态，如果有这种状态那么就是1，
int main()
{
scanf("%d%d%d", &n, &m, &k);
memset(dp, 0x3f3f3f3f, sizeof(dp));
for (int i = 1; i <= n; ++i)
{
int h = 0, p;
for (int j = 1; j... | ALGO | 0.999971 | 3.725407 |
657cfcad-23a1-4d03-9e87-f204e0d638f9 | giooogk/Game | jogo.cpp | #include <iostream>
#include <string>
#include <map>
#include <cstdlib>
#include "jogo.h"
#include "jogador.h"
using namespace std;
/**
* @brief adicionar jogadores no jogo
*
* @param pessoa
* @return int
*/
int Jogo::adc_jogad_no_jogo(Jogador pessoa)
{
gamers.insert(pair<string, Jogador>(pessoa.get_pe... | TOOL | 0.921005 | 3.958686 |
ac06342e-c967-48fc-b1af-4af20d5449ac | atharvarakshak/leetcode | 0583-delete-operation-for-two-strings/0583-delete-operation-for-two-strings.cpp | class Solution {
public:
// int dp[501][501];
// int lcs(string word1, string word2, int i, int j){
// if(i>=word1.size() || j>=word2.size())return 0;
// if(dp[i][j]!=-1)return dp[i][j];
// if(word1[i]==word2[j]){
// return dp[i][j] = 1+lcs(word1,word2,i+1,j+1);
// }... | ALGO | 0.999988 | 5.95658 |
cb1d6f16-849f-4095-9d19-873bfe073d15 | ChandraPratap01/Leetcode-codes | 2053-kth-distinct-string-in-an-array/2053-kth-distinct-string-in-an-array.cpp | class Solution {
public:
string kthDistinct(vector<string>& arr, int k) {
map<string,int>mp;
for(string &i:arr){
mp[i]++;
}
int count=0;
for ( auto& it : arr) {
if(mp[it]==1){
count++;
if(count==k){
... | ALGO | 0.999953 | 5.816467 |
24d39f62-ef18-4f80-9ee3-618b38e3bf26 | cran/stepR | src/StepBinom.cpp | #include "StepBinom.h"
#include <cmath>
/***************
* class StepBinom
* implements virtual class Step for Binomial data
* Thomas Hotz, 2007-2011
***************/
/*************
* constructor for n data points following Binomial distribution with size trials, with pointers to array of that length
****************... | ALGO | 0.999967 | 6.24214 |
951927b5-1d3f-4c6c-91f4-9cc8cfe40072 | tranngoctam/Algorithm | tro choi vong tron.cpp | #include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
for(int m=2;m<=n;m++)
{
int a[20],dem=0,vt=1,k=1;
for(int i=1;i<=n;i++)
{
a[i]=i;
}
int ms[20],l[20],kq[20],kt=1;
for(int i=1;i<=n;i++)
{
ms[i]=0;
}
while(1)
{
for(int i=1;i<=n;i++)
{
if(ms[i]==0)
{
dem++;
... | ALGO | 0.999941 | 3.210198 |
aa1be67e-87cd-44a9-9a36-34af26d4f387 | TakuyaKimura/Leetcode | 332 Reconstruct Itinerary/332.cpp | /*
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to],
reconstruct the itinerary in order.
All of the tickets belong to a man who departs from JFK. Thus, the itinerary must begin with JFK.
Note:
1. If there are multiple valid itineraries, you should return the itinera... | ALGO | 0.99998 | 6.080593 |
e806e798-35fa-4ea6-bf2e-2271f09bef80 | ishandutta2007/codeforces | errorgorn/normal/1461/C.cpp | //
//
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define end... | ALGO | 0.999798 | 3.509629 |
3cb4ff78-4128-44df-9472-d1e9998741d7 | stu-hull/Draughts_Full | app/src/main/cpp/native-lib.cpp | //
// Created by Stuart on 26/02/2017.
//
#include "native-lib.h"
class Board{
private:
static long long maskValid = 0b0000011110111111110111111110111111110111100000L; //all the valid board squares (the 0s are padding)
static long long maskBlackBack = 0b00000111100000000000000000000000000000000000... | ALGO | 0.988773 | 4.385585 |
7180cb25-5968-486a-aa5d-a8e8257214de | Jan-Malinowski/USACO | bronze/circular_barn.cpp | #include <iostream>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int main(){
freopen("cbarn.in", "r", stdin);
freopen("cbarn.out", "w", stdout);
int n;
cin >> n;
int r[n];
long cows=0, l_cows;
rep(i, n){
cin >> r[i];
cows+=r[i];
}
l... | ALGO | 0.999967 | 3.35403 |
a45a88e7-bf98-4fda-9262-1f761722799b | alexandraback/datacollection | solutions_5769900270288896_0/C++/Bobik/B-slow.cpp | // {{{
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <complex>
#include <numeric>
#define REP(i, n) for (... | ALGO | 0.99863 | 3.927715 |
f6fda445-6a4e-458e-9852-5e210205800a | KeremTAN/LeetcodeChallenge | 1716_Calculate_Money_in_Leetcode_Bank.cpp | class Solution {
public:
int totalMoney(int n) {
int i=0, ret=0;
for(; i<n/7; i++)
ret+=(28+(7*i));
for(int j=1; j<=n%7; j++)
ret+=(j+i);
return ret;
}
}; | ALGO | 0.999427 | 3.724116 |
a17eba75-73e6-40a9-8c97-b447059ddc2e | trunghieuctyb/CPP_Exercise | RbMove.cpp | #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <fstream>
#include <cmath>
using namespace std;
class Grid {
private:
int N;
vector<vector<char>> grid;
public:
Grid(int size) : N(size), grid(size, vector<char>(size, ' ')) {}
void mark(int x, int y) {
if (x... | TOOL | 0.904915 | 5.356848 |
66e2a580-5f2d-416b-b5c6-64700b30bfc7 | RedlineResearch/simulator-GC | boost_1_71_0/libs/hana/benchmark/reverse/move.fusion.vector.erb.cpp | <% if input_size > 10 %>
#define FUSION_MAX_VECTOR_SIZE <%= ((input_size + 9) / 10) * 10 %>
<% end %>
#include <boost/fusion/include/as_vector.hpp>
#include <boost/fusion/include/make_vector.hpp>
#include <boost/fusion/include/reverse.hpp>
#include "measure.hpp"
#include <cstdlib>
#include <string>
#include <util... | ALGO | 0.901503 | 4.539388 |
c76e57e6-00df-4f2a-a266-1890f628cac3 | josuerom/Competitive-Programming | Training/UVa/CP3/Mathematics/Cycle Finding/10591 - Happy Number.cpp | #include <bits/stdc++.h>
#define endl '\n'
#define debug(X) cout << #X << " = " << X << endl
#define fori(i,b,e) for (int i = (b); i < (e); ++i)
#define mod(x,m) ((((x) % (m)) + (m)) % (m))
#define sq(x) (x) * (x)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef ve... | ALGO | 0.999377 | 4.262856 |
3148078b-fac4-457d-b7d4-1cfaf5bfa088 | DerpFest-AOSP/external_zstd | contrib/pzstd/Options.cpp | #include "Options.h"
#include "util.h"
#include "utils/ScopeGuard.h"
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <thread>
#include <vector>
namespace pzstd {
namespace {
unsigned defaultNumThreads() {
#ifdef PZSTD_NUM_THREADS
return PZSTD_NUM_THREADS;
#... | TOOL | 0.876677 | 3.214782 |
f2965e78-599b-4509-be5e-a8aa0531828d | DuTogira/HackerRank | Practice/Problem Solving/Warmup/PlusMinus.cpp | // problem: https://www.hackerrank.com/challenges/plus-minus/problem
#include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
// Complete the plusMinus function below.
void plusMinus(vector<int> arr) {
int i, size = arr.size();
float result[3] = {0, 0, 0};
for(i = 0; i < size; ... | ALGO | 0.999569 | 4.778077 |
ab79f452-e002-49e7-9f34-4e5fb71d9f80 | gussttaav/GBLA_LC | src/Code.cpp |
#include "Code.h"
namespace GBLA_LC
{
Code::Code(): n(0), k(0), G(), H() { }
Code::Code(const Matrix &checkM) : n(checkM.get_cols()),
k(n-checkM.get_rows()), G(k, n), H(checkM)
{
genmat_from_chkmat();
Word::set_length(n);
}
Code::Code(const Matrix &genMat, co... | ALGO | 0.998597 | 3.739994 |
9b61e2c8-b5c0-4f93-b4da-8ecffb8ba6aa | fishy15/competitive_programming | online/cses/tree/tree_distances_i.cpp | #include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#define ll long long
#define eps 1e-8
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
// ... | ALGO | 0.999868 | 4.280773 |
833cc967-1a49-48cd-ac95-c6c9b42f489f | ishandutta2007/codeforces | moransky/normal/1142/B.cpp | // Skyqwq
#include <iostream>
#include <cstdio>
#define pb push_back
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef long long LL;
template <typename T> void chkMax(T &x, T y) { if (y > x) x = y; }
template <typename T> void chkMin(T &x, T y) { if (y < x) x = y; }
template <typ... | ALGO | 0.99999 | 3.788276 |
0ddbf8bd-b002-4775-8418-df713554d508 | deep-blu109/Algorithm_Practice | Baekjoon/2667/2667.cpp | #include <stdio.h>
#include <vector>
#include <queue>
#include <set>
using namespace std;
multiset<int> ans; // 정답을 저장할 multiset // 3 3 5 7
int n; // 지도 크기
vector<vector<char>> map; //지도 0 -> 빈 곳, 1 -> 건물, 2 -> 이미 체크된 건물
// 방향
int dr[4] = {0, 0, 1, -1};
int dc[4] = {1, -1, 0, 0};
// 범위 체크
bool outOfRange(int r, in... | ALGO | 0.999922 | 4.374773 |
59188119-9585-4c5d-9024-03b9e2e8ba5a | DmitryWolf/algorithms | strings/suffix_array.cpp | #include <bits/stdc++.h>
using namespace std;
void countSort(vector<int>& p, const vector<int>& rank) {
int n = p.size();
vector<int> rankCount(n);
for (int i = 0; i < n; i++)
rankCount[rank[i]]++;
vector<int> rankFrom(n);
for (int i = 1; i < n; i++)
rankFrom[i] = rankFrom[i - 1] +... | ALGO | 0.999978 | 5.487646 |
062fe37c-7471-4a69-a0e2-03a7b41a5746 | ashikajain33/C-Language-Codes | queueLinkedlist.cpp | #include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node * next;
};
struct node *start =NULL;
void traverse()
{
struct node *temp=start;
if(start==NULL)
printf("linked list is empty\n");
while(temp!=NULL)
{
printf("%d ",temp->data);
temp=temp->next;
}
printf("\n");
}
void insert_end... | ALGO | 0.999276 | 3.994637 |
c2975fbe-66e0-4eb1-a14d-83adb47329f3 | BitlikerAppFork/Nekogram | TMessagesProj/jni/third_party/openh264/src/codec/processing/src/downsample/downsample.cpp | #include "downsample.h"
#include "cpu.h"
#include <assert.h>
WELSVP_NAMESPACE_BEGIN
#define MAX_SAMPLE_WIDTH 1920
#define MAX_SAMPLE_HEIGHT 1088
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
CDownsampling::CDownsampling (int32_t iCpuFlag) {
m_iCPUFl... | ALGO | 0.991702 | 4.589092 |
c65552cb-4879-4dc7-98c1-8c42e7e35988 | atari-vcs/mesa | src/compiler/glsl/opt_constant_variable.cpp | /**
* \file opt_constant_variable.cpp
*
* Marks variables assigned a single constant value over the course
* of the program as constant.
*
* The goal here is to trigger further constant folding and then dead
* code elimination. This is common with vector/matrix constructors
* and calls to builtin functions.
*... | ALGO | 0.957199 | 7.943054 |
a357c57c-7ec8-4fb1-b926-1fb0c4333817 | sunilsk17/6Companies30DaysChallenge | Walmart/Extra Characters in a String.cpp | /* https://leetcode.com/problems/extra-characters-in-a-string/description/ */
//Solution - Extra Characters in a String
class Solution {
public:
unordered_map<string,int> mp;
int dfs(int start ,string s,int end,vector<int>& dp ){
if(end >= s.size()) return end-start;
if(dp[start] != -1) return d... | ALGO | 0.999885 | 6.093387 |
a8d8fafd-1e4e-491c-b031-911a80caa066 | doubley318/LeetCode | Cpp/1672.最富有客户的资产总量.cpp | /*
* @lc app=leetcode.cn id=1672 lang=cpp
*
* [1672] 最富有客户的资产总量
*/
// @lc code=start
class Solution {
public:
int maximumWealth(vector<vector<int>>& accounts) {
int ans = 0;
for (int i = 1; i < accounts[0].size(); i++)
for (int j = 0; j < accounts.size(); j++)
accoun... | ALGO | 0.998441 | 6.225656 |
23dc15b1-6fc3-40aa-9bc9-c91704bc1bf1 | prak32/Cryptography_LAB | Cryptography_Lab/Lab_1/b)verman.cpp | //b)Program to demonstrate the encryption and decryption of your full name using Verman cipher.
#include<iostream>
using namespace std;
char arr[26][26];
char message[22],key[22],emessage[22],retMessage[22];
int findRow(char);
int findColumn(char);
int findDecRow(char,int);
int main() {
int i=0,j,k,r,c;
k=96;
for (i... | ALGO | 0.99994 | 3.186728 |
801fdd15-7320-4f6b-b9b1-664cd94ee6a6 | Nomad37301/C---Zone | alprog/case 2.cpp | #include <iostream> // menggunakan library iostream =
#include <cmath> // menggunakan library math c++
using namespace std; // menggunakan namespace standar
int main(){ // fugnsi utama kode
int pilihan, aSegi, tSegi, kalks, kalkl , JariL;// mendeklarasikan variabel yang akan digunakan
cout << "masukan pil... | ALGO | 0.998838 | 4.148446 |
073f725c-f34c-4b76-b0a9-84a60423a449 | 2013612/CP-algorithm | AtCoder/abc415/abc415A.cpp | #include<bits/stdc++.h>
using namespace std;
int n, a[300005], ans, x;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &x);
for (int i = 0; i < n; i++) {
if (a[i] == x) {
printf("Yes\n");
return 0;
}
}
printf("No\n");
return 0;
} | ALGO | 0.999995 | 3.750482 |
7fac5ec9-ea58-45f3-9b52-cd0e884ab355 | sovayle/cppFiles | EOPUnsorted/EOPProg1and2/Programming1/cpp tutor8.1.cpp | /**
*Name: Amirul Azim bin Amran
*Matric no: 2017425
*Tutor: Sr Shaila
*/
#include <iostream>
#define MAX 10
using namespace std;
int main()
{
//selection sort
//6,3,0,2,7,8
int i,j,temp;
int numbers[MAX];
cout << "Enter 10 numbers: ";
for(i=0;i<MAX;i++)
{
cin >> numbers[i];
}
for(i=0; i<=MAX-2; i++)
{ ... | ALGO | 0.999763 | 3.901119 |
84274613-cc3b-4cd1-a61d-4f79e2f3fc82 | lumber1ghauri/DataStructure-Algorithm | Sorting/minRemovalOverlap.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int minRemoval(vector<vector<int>> &arr)
{
if (arr.empty())
return 0;
sort(arr.begin(), arr.end());
int count = 0;
int end = arr[0][1];
for (int i = 1; i < arr.size(); i++)
{
if (arr[i][0] < end)
... | ALGO | 0.999541 | 5.697723 |
9b7de9c7-ce5f-4423-8f4c-746b3bdb548b | dungprolhvn/PTIT-codes | dsa/DSA01005.cpp | #include <bits/stdc++.h>
typedef unsigned long long ll;
using namespace std;
void swap(int &a, int &b) {
int tmp = a;
a = b;
b = tmp;
}
void print(vector<int> v) {
for (int i : v) {
cout << i;
}
cout << " ";
}
void genPerv(int n) {
// Init
vector<int> p(n, 0);
for (int i ... | ALGO | 0.999951 | 4.810935 |
bcdc6574-f86d-4c15-a508-496d660df620 | Lewuathe/mlir-hello | thirdparty/llvm-project/mlir/lib/Transforms/Utils/LoopInvariantCodeMotionUtils.cpp | #include "mlir/Transforms/LoopInvariantCodeMotionUtils.h"
#include "mlir/IR/Operation.h"
#include "mlir/IR/PatternMatch.h"
#include "mlir/Interfaces/LoopLikeInterface.h"
#include "mlir/Interfaces/SideEffectInterfaces.h"
#include "mlir/Interfaces/SubsetOpInterface.h"
#include "llvm/Support/Debug.h"
#include <queue>
#d... | ALGO | 0.998196 | 5.60058 |
97dbe8fc-544f-4e76-b84e-03c7019e61f8 | sreeram2001/100-Days-DSA | Day83/Courses_schedule_detect_cycle_dfs.cpp | class Solution {
public:
//helper function to check for cycle using dfs
bool isCycle(int node, vector<vector<int>> &adj, vector<int> &visited, vector<int> &pathvisited)
{
visited[node] = 1;
pathvisited[node] = 1;
for(auto adjnode:adj[node])
{
//if its not vis... | ALGO | 0.999587 | 6.215609 |
1fd0dc80-e6ac-445b-8c74-832a7ab6b7ba | NVIDIA-Omniverse/PhysX | physx/source/simulationcontroller/src/ScVisualize.cpp | #include "ScScene.h"
#include "ScNPhaseCore.h"
#include "ScShapeInteraction.h"
#include "ScConstraintSim.h"
#include "ScConstraintCore.h"
#include "CmVisualization.h"
using namespace physx;
using namespace Sc;
// PT: Sc-level visualization code has been moved to this dedicated file (like we did in NpDebugViz.cpp)
st... | ALGO | 0.91197 | 6.126184 |
0570a30e-85e5-41c2-8700-2bcb78f29a03 | Ayushgour12/DSA-Practice-Questions | linked list/detect_and_delete_loop.cpp | #include<iostream>
using namespace std;
class Node{
public:
int data;
Node *next;
Node(int data){
this->data = data;
this -> next = NULL;
}
};
int length(Node *head){
Node *temp = head;
int count = 0;
while(temp != NULL){
count++;
temp = tem... | ALGO | 0.999834 | 4.205789 |
2f1b64cf-2914-4bfb-ba0a-86a49cc5d2bc | adelenesim/Udacity_SelfDrivingCarNanodegree | Term2/CarND-MPC-Project/src/Eigen-3.3/bench/spmv.cpp |
//g++-4.4 -DNOMTL -Wl,-rpath /usr/local/lib/oski -L /usr/local/lib/oski/ -l oski -l oski_util -l oski_util_Tid -DOSKI -I ~/Coding/LinearAlgebra/mtl4/ spmv.cpp -I .. -O2 -DNDEBUG -lrt -lm -l oski_mat_CSC_Tid -loskilt && ./a.out r200000 c200000 n100 t1 p1
#define SCALAR double
#include <iostream>
#include <algor... | ALGO | 0.949666 | 4.293816 |
f34912e5-d0ab-44ef-a6b0-afa1770d96d6 | jackgao1540/dmoj-solutions | dmopc15c1p5.cpp | #include <bits/stdc++.h>
using namespace std;
int w, h, n;
int grid[251][251] = {0};
long psa[251][251] = {0};
int main() {
cin >> w >> h >> n;
for(int i = 1; i <= h; i++){
for(int j = 1; j <= w; j++){
cin >> grid[i][j];
psa[i][j] = grid[i][j] - psa[i - 1][j - 1] + psa[i - 1][j] + psa[i][j - 1];
... | ALGO | 0.999605 | 3.851544 |
a150dffb-bfd3-4b29-ae64-5439a22fc7ab | xizhonghua/polycube | src/utils/hexmesh_util.cpp | #include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include "../common/vtk.h"
#include "../common/def.h"
#include <zjucad/matrix/matrix.h>
#include <zjucad/matrix/io.h>
using namespace std;
using namespace zjucad::matrix;
int read_hexmesh(const char * file, matrixd &node, matrixst &hexmesh... | TOOL | 0.881622 | 4.472395 |
be5f956a-c818-4771-b562-cdaf67d1bb4b | metehkaya/Algo-Archive | Problems/LeetCode/Solutions/0369.Plus_One_Linked_List.cpp | 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:
bool goo(ListNode* node) {
if(node == NULL)
return true;
bo... | ALGO | 0.999958 | 6.512018 |
456d909c-3e66-4298-b8c6-cc7f2b6742a0 | kmjak/AtCoderStudy | contest/ABC/ABC347/C.cpp | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define g(i,t) get<i>(t)
#define tos(n) to_string(n)
#define toc(n) '0' + n
#define toll(s) stoll(s)
#define btoi(b) static_cast<ll>(b.to_ulong())
using ... | ALGO | 0.999948 | 3.7413 |
90fe71ae-c0d0-4144-907d-52383b2b9729 | dhankb/practice | cpp/0348_Design_Tic-Tac-Toe.cpp | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <list>
#include <map>
using namespace std;
class TicTacToe {
public:
int n;
vector<vector<int>> game;
TicTacToe(int n) {
this->n = n;
v... | ALGO | 0.999886 | 5.779383 |
494a39e8-9e2d-43a5-8f5c-2a87a6032abb | kpeel5839/Codeforces | Codeforces Round 933 (Div. 3)/c.cpp | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace st... | ALGO | 0.999489 | 3.975452 |
f4679a66-01d2-4923-82e2-bf8a76bfe2f1 | sujay000/dsa | beginner/dp/dp and greedy/coinChangePermutationsTab.cpp | #include <iostream>
#include <vector>
using namespace std;
//Coin Change Permutations using tabulation
int CCP(vector<int> coins, int amt, vector<int> dp) {
dp[0] = 1;
for(int i =1; i<=amt; i++){
for(auto x: coins){
if(x <= i){
dp[i] = dp[i] + dp[i-x];
}
}
}
return dp[amt];... | ALGO | 0.999954 | 5.24579 |
2a81fcdb-49eb-41a8-a8de-d1b26b0cf799 | Ishavashisht/Leetcode_dsa | 0278-first-bad-version/0278-first-bad-version.cpp | // The API isBadVersion is defined for you.
// bool isBadVersion(int version);
class Solution {
public:
int firstBadVersion(int n) {
int l=1,h=n;
int temp=-1;
while(l<=h){
int mid=l+(h-l)/2;
if(isBadVersion(mid)){
temp=mid;
h=mid-1;
... | ALGO | 0.999806 | 6.428724 |
4928c682-f486-4821-9bc9-da20a24bcbde | ywen19/clothSim | src/Collide.cpp | #include "Collide.h"
/// \brief default ctor
Collide::Collide():
m_distbetween(0.f),
m_collideDist(0.f),
m_colliderPos(0.f),
m_partPos(0.f),
m_collideF(0.f){;}
//-------------------------------------------------------------... | ALGO | 0.959432 | 5.076719 |
0f716c2e-c41a-46e4-b25b-bc43b0036d8e | zhouyium/myoj | 8536/gen.cpp | //8536: Rooted Trees
//http://<IP_ADDRESS>/problem.php?id=8536
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1e6+10;
vector<LL> tree[N];
LL a[N];
LL f[N];//f[i]ʾڵiĸf[i]
//DSU
LL fa[N];
void init(LL n){
for(LL i=0;i<=n;i++){
fa[i]=i;
a[i]=i;
}
}
LL find(LL x){
if(fa[x]==x){
... | ALGO | 0.999487 | 3.607543 |
37887ce4-e890-4b4c-b875-1afe6c70c624 | Josefpa/rocs_server | rocs-libs/eigen/bench/bench_gemm.cpp |
// g++-4.4 bench_gemm.cpp -I .. -O2 -DNDEBUG -lrt -fopenmp && OMP_NUM_THREADS=2 ./a.out
// icpc bench_gemm.cpp -I .. -O3 -DNDEBUG -lrt -openmp && OMP_NUM_THREADS=2 ./a.out
// Compilation options:
//
// -DSCALAR=std::complex<double>
// -DSCALARA=double or -DSCALARB=double
// -DHAVE_BLAS
// -DDECOUPLED
//
#include... | TOOL | 0.93553 | 5.838122 |
2030266e-4b94-4ecd-b861-c1352045035a | ThiuT/Projet_Synthese | lib/Box2D_v2.2.1/Box2D/Collision/Shapes/b2ChainShape.cpp | #include <Box2D/Collision/Shapes/b2ChainShape.h>
#include <Box2D/Collision/Shapes/b2EdgeShape.h>
#include <new>
#include <cstring>
using namespace std;
b2ChainShape::~b2ChainShape()
{
b2Free(m_vertices);
m_vertices = NULL;
m_count = 0;
}
void b2ChainShape::CreateLoop(const b2Vec2* vertices, int32 count)
{
b2Asser... | ALGO | 0.91262 | 6.244896 |
84c5943d-d4e6-4dae-ab1d-ccc787e3f157 | Leonidus786/Master_Class | venv/Lib/site-packages/sklearn/svm/src/liblinear/tron.cpp | #include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include "tron.h"
#ifndef min
template <class T> static inline T min(T x,T y) { return (x<y)?x:y; }
#endif
#ifndef max
template <class T> static inline T max(T x,T y) { return (x>y)?x:y; }
#endif
static void default_print(const char *buf)
{... | ALGO | 0.999563 | 5.847107 |
1c4aaa32-164a-4933-804b-145ed2da3b04 | GrootTheDeveloper/OLP-ICPC | 800+BAI_CODE_HAY/Code/incdec.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int a, b, c; cin >> a >> b >> c;
cout << max({a * b, b * c, a * c});
} | ALGO | 0.999952 | 4.357574 |
3e89e9ea-6c53-4415-890d-b37765d2deb5 | arkanttus/algorithms | data_structure/fenwick_tree.cpp | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define READ_SPEED cin.tie(0)->sync_with_stdio(0);
#define MOD 1000000007
#define MAXN 100000
#define INF 0x3f3f3f3f
void update(int bit[], int n, int idx, int val)
{
// index in BITree[] is 1 more than the index in arr[]
idx = idx + 1;
while (id... | ALGO | 0.999875 | 3.95742 |
7936c14a-9171-42fc-ba4d-526222c5c741 | sulbhagarg/Data_Structure_And_Algorithms | Arrays/KadanesAlgorithm.cpp | // Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int max_ending_here=0, max_so_far=INT_MIN;
int n=nums.size();
for(int i=0;i<n;i++)
... | ALGO | 0.999865 | 6.096499 |
b612e67a-5189-4ac4-bc84-59faa9fedf92 | rifqimaruf/algorithm-and-data-structure | Day20_LeetCode118/pascal's_triangle_solution.cpp | #include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> generate(int numRows)
{
// initialize the triangle
vector<vector<int>> triangle;
// loop through each row
for (int i = 0; i < numRows; i++)
{
// create a new row
vector<int> row(i + 1, 1);
// f... | ALGO | 0.999841 | 5.892982 |
ab39c2fe-5fe6-47ef-83aa-ec942c34ee1a | Nakib-Arman/CSE318---ArtificialIntelligence | 4.DecisionTree/.history/decision_tree_20250706192158.cpp | #include<bits/stdc++.h>
using namespace std;
class Node {
int column_num;
string label;
unordered_map<string,Node*> children;
Node* parent;
public:
Node(int column_num){
this->column_num = column_num;
this->parent = NULL;
this->label = "";
}
Node(string label){... | ALGO | 0.999318 | 4.648636 |
9158d724-c8c0-4de0-a790-922678bacdc3 | yixiangD/coagulation_cascade | src/neigh_stencil.cpp | #include "neighbor.h"
#include "neigh_list.h"
#include "atom.h"
#include "memory.h"
using namespace LAMMPS_NS;
/* ----------------------------------------------------------------------
routines to create a stencil = list of bin offsets
stencil = bins whose closest corner to central bin is within cutoff
sx,sy... | ALGO | 0.997408 | 5.055971 |
f604e867-d5cd-4657-b084-032866f771f1 | lahola/positive_pete | Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pete/Positive Pet... | #include <Box2D/Dynamics/Contacts/b2CircleContact.h>
#include <Box2D/Dynamics/b2Body.h>
#include <Box2D/Dynamics/b2Fixture.h>
#include <Box2D/Dynamics/b2WorldCallbacks.h>
#include <Box2D/Common/b2BlockAllocator.h>
#include <Box2D/Collision/b2TimeOfImpact.h>
#include <new>
b2Contact* b2CircleContact::Create(b2Fixture*... | ALGO | 0.988934 | 6.919396 |
e6e06a71-b1ca-4a3d-aa53-c503d15ef1cf | deprecate1/example_cpp | github/Algorithms/stl_07_set_algorithms.cpp | // code_report
// https://youtu.be/oNnatJtPWjI
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <iterator>
using namespace std;
template <typename T>
void print (const T& a) {
for (const auto& e : a) cout << e << ' ';
cout << endl;
}
template <typename T>
void ... | ALGO | 0.905145 | 4.833948 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.