uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
aa46c5b2-3465-402e-95d1-e65990ddd289 | shivamkr022/my-codes | cses/Concerttickets.cpp | /*
------------------------------------------
| |
| Code Crafted by Shivam |
| |
------------------------------------------
\ , , /
\ | | /
\ \_/ /
\ ----- /
... | ALGO | 0.999885 | 4.147267 |
9ec73fb4-0a5c-46e0-b199-18a1b3c8c3bd | lacykaltgr/skeleton-mapping | src/post_proc.cpp | #include "SkeletonFinder/skeleton_finder_3D.h"
#include <pcl/io/pcd_io.h>
using namespace Eigen;
using namespace std;
/*
Post-processing of 3D skeleton
1. Extend the skeleton graph by finding unexplored areas
- Find nodes with only 1 connection in the original graph
- Run the algorithm again initialized from tha... | ALGO | 0.995439 | 3.721079 |
6186eb82-4c26-4fd8-83b0-5b76d8285f1c | loganrane/CompetitiveProgramming | TemplateFunctions/FastPower.cpp | /******************************************
* AUTHOR : ARPIT *
* NICK : arpitfalcon *
* INSTITUTION : BIT MESRA *
* Harwork is the key to success. *
******************************************/
ll mult(ll x, ll y){
ll ans = 1;
while(y>0){
if(y%2)
ans = (ans * x) % 10000007;
x = (x*x)... | ALGO | 0.999883 | 4.612273 |
a06d4209-0d28-4482-b100-2f6eba5ed27e | abdullaabdullazade/rio-semifinal-submissions-2025 | Çingiz_Həsənli_İlkin oğlu_9.0_17_65BAL_RIO2025_Semifinal_J2.cpp | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define MRBEAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
ll const MOD = 1e9+7;
int main(){
MRBEAST
ll t;
cin>>t;
while(t--){
ll n, ans = 1, w = 0;
cin>>n;
multiset<ll>s;
... | ALGO | 0.999923 | 4.193383 |
a54bf7e6-bf54-425c-a0f7-b997db727e62 | seate/algorithm | baekjoon/단계 별로 풀어보기/조건문/9498_시험_성적.cpp | #include <stdio.h>
using namespace std;
int main()
{
int a;
scanf("%d", &a);
if (90 <= a) printf("A");
else if (80 <= a) printf("B");
else if (70 <= a) printf("C");
else if (60 <= a) printf("D");
else printf("F");
} | ALGO | 0.998937 | 3.405633 |
1f2ca27d-d2f7-4fb7-82a3-e67db55ffeba | swamiabhishek45/DSA | Company Specific/TCS NQT/1. Basic Math/2.cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> maxOfSubArr(int arr[], int n, int k)
{
vector<int> ans;
for (int i = 0; i <= n - k; i++)
{
int maxSum = INT_MIN;
for (int j = i; j < i+k; j++)
{
if (arr[j] >= maxSum)
{
maxSum = arr[j]... | ALGO | 0.999924 | 5.266119 |
bf732d15-d39e-44d3-a4f3-b1d54cfce5f1 | cola0405/codeforces | greedy/1610c.cpp | // binary search + greedy
// there is nothing you have to do
// so the strategy is binary search the upper bound
// binary search check: invite the people as you can in a greed way
// observation: "His i-th friend has i dollars" is kind of "sorting" -- monotony
#include <iostream>
#include <vector>
using namespace ... | ALGO | 0.999953 | 5.104605 |
f40efc46-dc9e-4a32-b346-e745bcfc8e97 | Faizanf33/CP-Work | Assignment_01-Lab/q2.cpp | /*
Name: Faizan Ahmad
Creation Date: 28/10/2018
Problem Description: Calculate sum of the following serieses:
sin x = x - x^3/3! + x^5/5! - x^7/7! + ...
cos x = 1 - x^2/2! + x^4/4! - x^6/6! + ...
tan x = x - x^3/3! + 2(x^5)/15! - 17(x^7)/315! + ...
*/
# include <iostream>
using namespace std;
int p... | ALGO | 0.99904 | 3.915512 |
75eeaf81-1451-46c5-9279-3e3dc4a8cb41 | Naganathan05/Leetcode_Solutions | Daily_Question/2023Dec30.cpp | /*-------------------------------------------
Time Complexity: O(n)
Space Complexity: O(1)
---------------------------------------------*/
class Solution {
public:
bool makeEqual(vector<string>& words) {
if(words.size() <= 1){
return true;
}
int total_count = 0;
for... | ALGO | 0.999974 | 6.022111 |
740c5171-5654-4eaa-a449-c9d916f161ef | hrushikesh-shelar/DSA | 0155-min-stack/0155-min-stack.cpp | class MinStack {
stack<vector<int>> st;
public:
MinStack() {
}
void push(int val) {
st.push({val, st.empty() ? val : min(st.top()[1], val)});
}
void pop() {
if(st.empty())
return;
st.pop();
}
int top() {
return st.top()[... | ALGO | 0.99977 | 6.614749 |
25cdc402-e601-4ce3-bec6-c701bb21f3df | fuwutu/LeetCode | Permutations.cpp | class Solution
{
public:
vector<vector<int> > permute(vector<int> &num)
{
vector<int> one(num);
vector<vector<int>> all({one});
vector<int> p;
for (size_t i = 0; i < num.size(); ++i)
{
p.push_back(i);
}
while (next_permutation... | ALGO | 0.999985 | 5.564361 |
32255578-70ef-4c31-8a0a-adac248cea4c | neppiness/TIL | problem-solving/boj/dynamic-programming/12852-08-16-2022.cpp | #include <iostream>
using namespace std;
int N, cnt[1000002];
int main(void) {
ios::sync_with_stdio(0); cin.tie(0);
cin >> N;
cnt[1] = 0;
for(int i = 2; i <= N; i++) {
cnt[i] = 0x7f7f7f7f;
if(i%2 == 0) cnt[i] = cnt[i/2] + 1;
if(i%3 == 0) cnt[i] = min(cnt[i], cnt[i/3] + 1);
... | ALGO | 0.999954 | 3.81721 |
de689b3f-36ed-4af5-8059-95aa76fa4a42 | jjjajh/ttl-core | src/crypto/hmac_sha256.cpp | #include "crypto/hmac_sha256.h"
#include <string.h>
CHMAC_SHA256::CHMAC_SHA256(const unsigned char* key, size_t keylen)
{
unsigned char rkey[64];
if (keylen <= 64) {
memcpy(rkey, key, keylen);
memset(rkey + keylen, 0, 64 - keylen);
} else {
CSHA256().Write(key, keylen).Finalize(rke... | ALGO | 0.984756 | 5.853137 |
419f3408-8338-4521-99da-7046d0d8cf9d | hydro1d/Competitive_Programming-CP_course_laptop | CP_course_laptop/practice/p36.cpp | #include<bits/stdc++.h>
using namespace std;
void rec(int n){
if(n==0){
return;
}
cout<<"I love Recursion"<<endl;
rec(n-1);
}
int32_t main(){
int n;
cin>>n;
rec(n);
} | ALGO | 0.999489 | 4.205518 |
3fb6ef54-a22e-40f3-9972-cba9cbe46533 | alexandraback/datacollection | solutions_1485488_0/C++/light0/b.cpp | #include <cstdio>
#include <iostream>
#include <cstring>
#include <map>
using namespace std;
#define N 102
int n, m, H;
map<int, double> memo[N][N];
int c[N][N];
int f[N][N];
double maxH[N][N];
double solve(int y, int x, int h) {
if (h < 0) h = 0;
if (y == n - 1 && x == m - 1) return 0;
if (memo[y][x].find(h) != m... | ALGO | 0.999566 | 3.497782 |
d5c6be9b-c199-4fe3-bc56-82eccb19b495 | ishandutta2007/codeforces | plasmatic/normal/1198/D.cpp | // ./d-rectangle-painting-1.yml
#include "bits/stdc++.h"
using namespace std;
// Defines
#define fs first
#define sn second
#define pb push_back
#define eb emplace_back
#define mpr make_pair
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
// Basic type definitions
using ll = long long; using ull = unsigne... | ALGO | 0.999682 | 4.48949 |
de23ad6f-db86-4dda-9ef5-03cc10e0f5e8 | Araksya-Hambaryan/ITC-9 | Elya_Karapetyan/Homeworks/C++/20_27.04/HashMap/main.cpp | #include "hashMap.hpp"
void validNumber(int& number) {
while (std::cin.fail()) {
std::cout << "Invalid Value: Try again!" << std::endl;
std::cin.clear();
std::cin.ignore(256,'\n');
std::cout << "Please enter the intager number: ";
std::cin >> number;
}
}
void choose... | TOOL | 0.956145 | 5.021348 |
1945edbf-0148-45a0-9d01-098f07e80fee | behnejad/Online-Judge-Solutions | TJU/2123 - Head or Tail.cpp | #include<cstdio>
using namespace std;
int main(){
int N,aux,cont1,cont2;
while(1){
scanf("%d",&N);
if(N==0) break;
cont1=cont2=0;
for(int i=0;i<N;i++){
scanf("%d",&aux);
if(aux==0) cont1++;
else cont2++;
... | ALGO | 0.999568 | 3.086369 |
2480afa2-0bca-4ce9-a542-890e1e5ab8d2 | Andwerpz/Competitive-Programming-Practice | - cpp -/takeyourplaces.cpp |
#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <string>
#include <bits/stdc++.h>
typedef long long ll;
//Codeforces - 1556B
//tags: implementation... Really nailed that one
//the optimal strategy is to find the first out of place one, and swap it with the first one that is sup... | ALGO | 0.999849 | 4.41708 |
9b70ac06-f944-492e-a78e-aa466b774ffb | Swaransh2903/Cpp-Tutorials | Graphs/26WordLadder1.cpp | // beginWord = "hit" endWord = "cog" wordList = [hot,dot,dog,lot,log,cog], We need to find the shortest transformation
// sequence that'll convert beginWord to endWord. At a time we can only transform one character. Here for example
// the shortest transformation sequence would be : hit->hot->dot->dog->cog (i.e length... | ALGO | 0.99999 | 4.992535 |
4497462f-8fd4-4ee3-a880-3bf220a85b26 | lucastarche/monografia-treaps | Implementaciones/Genetics.cpp | #include <bits/stdc++.h>
using namespace std;
void fastIO() { ios_base::sync_with_stdio(false), cin.tie(0); }
const string BASES = "AGTC";
int toBaseIndex(char c) {
for (int i = 0; i < 4; i++) {
if (c == BASES[i]) return i;
}
assert(false);
}
struct Node;
using Treap = Node *;
using Freq = array<int, 4>;
... | ALGO | 0.999468 | 5.414953 |
5a1dc793-7931-4927-bb04-59b70b9df3ce | TelevisionNinja/search-engine | src/backend/src/hashtable.cpp | /*
Purpose: The implementation file for a hash table of words and numbers
*/
#include <assert.h>
#include <iostream>
#include <fstream>
#include "hashtable.h"
using namespace std;
/*-------------------------- Constructors/Destructors ----------------------*/
/**
* @brief Construct a new Hash Table:: Hash Table o... | ALGO | 0.908927 | 5.288156 |
8e59dbc6-d333-4027-be77-695236aa9018 | Altynbek38/lab | 11lab/1.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
vector <string> v = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector <int> u = {7, 6, 5, 4, 3, 2, 1};
for(int i = 0; i < v.size(); i++){
if(s == v[i]){
cout << u[i];
}
}
return... | ALGO | 0.999962 | 3.658515 |
a976a211-da9d-4138-b81c-5a356fc5d374 | KhaledAbdelgalil/competitive-programming-book | chapter 2/problems/Linear DS with Built-in Libraries/C++STL algorithm/11824.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
std::ifstream in ("input");
std::streambuf * cinbuf = std::cin.rdbuf (); //save old buf
std::cin.rdbuf (in.rdbuf ()); //redirect std::cin to in.txt!
int t;
cin>>t;
while(t--)
{
int n;
std::vector<int>v;
while(c... | ALGO | 0.999354 | 3.749144 |
e0ea2726-053c-41e1-bb27-c90905ae5047 | fanghao1024/poj | p2048.cpp | #include<cstdio>
#include<queue>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
const int max_n=5e5+10;
int n,k,L,R;
ll sum[max_n];
int st[max_n][30];
int Log2[max_n];
struct Node{
int id,l,r,t;
Node(){};
Node(int _id,int _l,int _r,int _t){
id=_id... | ALGO | 0.999948 | 3.074011 |
1b981e06-9f73-4d06-9f40-491c8e8c9e26 | limoka/Equation-solver-app | equationparser.cpp | #include <qmath.h>
#include <QDebug>
#include "equationparser.h"
std::vector<std::string> split(std::string input, std::string delimiter) {
std::vector<std::string> tokens;
size_t pos = 0;
std::string token;
while ((pos = input.find(delimiter)) != std::string::npos) {
token = input.substr(0,... | TOOL | 0.993015 | 4.061491 |
c0be808c-c99c-4391-b97b-b262b2590412 | TomHarte/Isometric-Ray-Cast | tools/tilegenerate.cpp | #include <cstdio>
#include <cstdint>
/*!
Outputs the tile data necessary to perform the strictly
2d portion of plotting.
*/
int main(int argc, char *argv[]) {
const uint8_t patterns[][4] = {
{0b0000'0000, 0b0000'0000, 0b0000'0000, 0b0000'0000},
{0b1010'1010, 0b0101'0101, 0b1010'1010, 0b0101'0101},
{0b1000'100... | ALGO | 0.928852 | 4.831088 |
43b35bcb-b1ae-481a-8316-f01fb91a3ddf | jestupinanb/Contest | Random/old/lcm.cpp | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int main()
{
//std::freopen("in.txt", "r", stdin);
//std::freopen("out.txt", "w", stdout);
int a, b;
std::cin >> a >> b;
std::cout << (long long)a*b/gcd(a, b) << '\n';
return 0;
}
| ALGO | 0.999786 | 4.397281 |
b29b6622-0126-418f-ae22-d8693da0762e | kumarsantosh3914/leetcode-contest | October/1361. Validate Binary Tree Nodes.cpp | class Solution
{
public:
bool validateBinaryTreeNodes(int n, vector<int> &leftChild, vector<int> &rightChild)
{
vector<int> indegree(n, 0);
for (int i = 0; i < n; i++)
{
if (leftChild[i] != -1)
indegree[leftChild[i]]++;
if (rightChild[i] != -1)
... | ALGO | 0.99992 | 5.83279 |
d3070b59-295c-44a4-b6da-0f247e3c8d9d | CaDe27/Coding | CodeForces/Round871/c.cpp | #include <iostream>
#include <map>
using namespace std;
void solve() {
int n; cin >> n;
map<string, int> mp;
mp["00"] = mp["01"] = mp["10"] = mp["11"] = 1e9;
for(int i = 0; i < n; ++i) {
int x; cin >> x; string s; cin >> s;
mp[s] = min(mp[s], x);
}
if(min(mp["11"], mp["10"]... | ALGO | 0.999507 | 4.621577 |
ef52767f-e9f8-4424-b4c7-b76228bd8d5d | bin-dot/praktikum-struktur-data | praktikum ke 7 nomor 2.cpp | /* sitti aulia sabina rahmannissa / 2020B MI / 016 */
#include <stdio.h>
#include <stdlib.h>
#define MAX 10
int Data[MAX];
// Fungsi pengurutan penyisipan langsung
void StraightInsertSort()
{
int i, j, x;
for(i=1; i<MAX; i++){
x = Data[i];
j = i - 1;
while (x < Data[j]){
Data[j+1] = Data[j];
j--;
}
Data[j+1] = x;
}
}
i... | ALGO | 0.999767 | 4.10388 |
b672bccf-b9ab-41b6-b36d-38cfa0baa3a3 | simjeongho/cCodingTest | DP/백준_출근경로_5569.cpp | #pragma warning (disable : 4996)
#include <cstdio>
#define MOD 100000
#define MAX 101
#define ll long long
using namespace std;
int w, h;
int result;
ll dp[MAX][MAX][2][2]; // 4 dp ؾ
//yǥ yǥ k ȯ l
//1. dp[i][j][0][0]= ʿ ȯ Ұ -> ǥ dp[i][j-1][1][
//2. dp[i][j][0][1]= ʿ ȯ
//3. dp[i][j][1][0]= ʿ ȯ Ұ dp[i][j]... | ALGO | 0.999905 | 4.060773 |
8d041d27-722f-4350-82d7-1bebe603d8e9 | pushkarmishra/IOISolutions | 2012/IdealCity/IdealCity.cpp | #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <string>
#include <cstring>
#define rf freopen("in.in", "r", stdin)
#define wf freopen("out.out", "w", stdout)
#define rep(i, s, n) fo... | ALGO | 0.999961 | 3.811269 |
df3714a4-d62a-4680-bf83-c8530dd3943e | ishandutta2007/codeforces | rajat1603/normal/818/F.cpp | #include "bits/stdc++.h"
using namespace std;
int t;
long long n;
bool check1(long long mid){
long long edges = 0;
edges += n - 1;
edges += (mid * (mid - 1LL)) >> 1;
long long bridges = n - 1LL - ((mid == 1) ? 0 : mid);
return bridges * 2LL >= edges;
}
int main(){
scanf("%d" , &t);
while(t--){
scanf("%lld" , &... | ALGO | 0.999915 | 4.333982 |
06c59d7b-3f4e-4fbb-bfe8-f9a63c1e130b | aidajk77/Tehnike-programiranja | predavanje8/peti.cpp | #include <iostream>
#include <string>
#include <set>
#include <map>
#include <vector>
using namespace std;
map<string,set<pair<int,int>>> KreirajIndeksPojmova(vector<string> stranice){
map<string,set<pair<int,int>>> indeks_pojmova;
for (int i = 0; i < stranice.size(); i++) {
string rijec = "";
... | ALGO | 0.993882 | 4.403759 |
5be4b942-db64-4f72-a3b4-79a261945b5b | daiwb/Algorithm | ZOJ/2176Speed Limit.cpp | /*
* zju 2176 Speed Limit
* 00:00.00 436k
* 2004.11.11 by adai
*/
#include <iostream>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n == -1) break;
int t, s, tt = 0, miles = 0;
while (n --) {
cin >> s >> t;
miles += (t - tt) * s;
tt = t;
}
cout << miles << " miles" << e... | ALGO | 0.982406 | 4.240228 |
bdc31502-ae4e-4467-a3ce-bb82fab61104 | CTranLam/DSA_PTIT | BackTrack/DSA02033 SoXaCach.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int used[100];
void Try(vector<int> v){
if(v.size()==n+1){
for(int i=1; i<v.size() ; i++){
cout << v[i];
}
cout << endl;
return;
}
for(int j=1 ; j<=n ; j++){
if(!used[j]){
... | ALGO | 0.999853 | 4.886464 |
ee053ac7-2599-4711-9e6f-43f93dce8f06 | Surajv311/myCforces | old/codechef/long challenge/jan'21 lc/WIPL.cpp | /*
///////////////////////////////////////////
//Question/Info
Get excited, folks, because it is time for the final match of Codechef Premier League (CPL)!
Mike and Tracy also want to watch the grand finale, but unfortunately, they could not get tickets to the match. However, Mike is not someone who gives up so easil... | ALGO | 0.99997 | 4.633471 |
f0230063-995a-4e7c-9f60-d4d86530e832 | franfill1/cses.fi-solutions | src/Graph Algorithms/1694-Download Speed.cpp | /*
Task: 1694 Download Speed
Sender: franfill
Submission time: 2023-03-30 11:34:02
Language: C++17
Result: ACCEPTED
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct edge
{
ll to, cap, r;
edge(ll to_, ll cap_, ll r_) : to(to_) , cap(cap_), r(r... | ALGO | 0.999613 | 5.002784 |
57981c7a-a582-4a4d-9d1b-ac8e25f23743 | squaresLab/BatFix | results/transcoder/translations/py/PROGRAM_BEST_FIT_ALGORITHM_MEMORY_MANAGEMENT.cpp | void bestFit ( int * blockSize , int m , int * processSize , int n ) {
int * allocation = new int [ n ] ;
for ( int i = 0 ;
i < n ;
i ++ ) {
int bestIdx = - 1 ;
for ( int j = 0 ;
j < m ;
j ++ ) {
if ( blockSize [ j ] >= processSize [ i ] ) {
if ( bestIdx == - 1 ) {
bestId... | ALGO | 0.999631 | 3.747005 |
6817979a-a10e-46a3-9766-61fb210a8901 | motonobu-t/algorithm | VisualC++/Chap4/Dr26_2/Dr26_2/Dr26_2.cpp | // Dr26_2.cpp : R\[ AvP[ṼGg |Cg`܂B
//
#include "stdafx.h"
/*
* ------------------------------
* nbřvZiċAŁj *
* ------------------------------
*/
#include <stdio.h>
long combi(int,int);
void main(void)
{
int n,r;
for (n=0;n<=5;n++) {
for (r=0;r<=n;r++)
printf("%db%d=%ld ",n... | ALGO | 0.996501 | 4.618822 |
fbd3397e-8454-472a-8bdf-a7020783584d | BaoTrung37/PTIT_Sources | codeforces/B. Sorted Adjacent Differences.cpp | /**
* authur: Bao Trung (Koi` Cute)
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define all(x) (x).begin(), (x).end()
#define set_arr(a,n); int a[n+5]; for(int i=0;i<n;i++)cin>>a[i];
#define set_vect(a,n); vector<int>a(n); for(auto &z : a)cin>>z;
const int mod ... | ALGO | 0.999825 | 3.978291 |
8bf81c69-1b5b-42b2-a6fb-962782b8dfb2 | yliu-cs/ACM | NowCoder/2017年西南民族大学程序设计竞赛-网络同步赛-I.cpp | #include <iostream>
using namespace std;
int main()
{
int n,f[21];
f[1] = 2;
f[2] = 3;
for (int i = 3;i <= 20;++i)
{
f[i] = f[i - 1] + f[i - 2];
}
cin >> n;
cout << f[n];
return 0;
}
| ALGO | 0.999839 | 3.818118 |
12030436-ea92-433a-a3ea-276605b499c4 | bioexcel/bioexcel-exascale-co-design-benchmarks | GROMACS/nonbonded_benchmark/gromacs_source_code/src/gromacs/linearalgebra/gmx_blas/ssyr2.cpp | #include <cctype>
#include <cmath>
#include "gromacs/utility/real.h"
#include "../gmx_blas.h"
void
F77_FUNC(ssyr2,SSYR2)(const char * uplo,
int * n__,
float * alpha__,
float * x,
int * incx__,
fl... | ALGO | 0.999182 | 4.518483 |
72481050-cabf-4c5b-aaac-8a6f003a4e2e | goyalkhushi/c-programs | farenheit into C.cpp | #include <stdio.h>
int main()
{
float tempC,tempF;
printf("Enter temperature:");
scanf("%f",&tempF);
tempC=(tempF-32)*5/9;
printf("Temperature in c is %f",tempC);
}
| TOOL | 0.971743 | 3.072247 |
3d3ec18e-d511-4b56-a72c-721a344e0118 | Parthmudgal15105/CP | ICPC/Small_Indices.cpp | #include <bits/stdc++.h>
#include <algorithm>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// Add the necessary include paths to the compiler flags
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#define nl '\n'
#define sp ' '
#define pi 2 * acos(0... | ALGO | 0.999937 | 4.88055 |
438fa3a3-b708-48db-b12f-22325eb305c8 | huynh-vch/code_c | chuong01/bai081.cpp | #include <iostream>
using namespace std;
int main()
{
cout << "Bai 081: " << endl;
int x, n;
cout << "n = ";
cin >> n;
cout << "x = ";
cin >> x;
double S = 1.0 / x;
float M = x;
int i = 1;
while (i <= n)
{
M = M * (x + i);
S = S + float(1) / M;
i = i... | ALGO | 0.999901 | 3.804249 |
23e3d305-2c63-41ba-8145-cbda9c785e3d | zhang-fengdi/ControlGS | SIBR_viewers/src/core/raycaster/CameraRaycaster.cpp | #include <boost/filesystem/path.hpp>
#include <core/system/Vector.hpp>
#include "core/raycaster/CameraRaycaster.hpp"
namespace sibr
{
/*static*/ void CameraRaycaster::computePixelDerivatives( const sibr::InputCamera& cam,
sibr::Vector3f& dx, sibr::Vector3f& dy, sibr::Vector3f& upLeftOffset )
{
sibr::Vector3f d... | ALGO | 0.988866 | 6.921673 |
081aa94e-811c-4eb9-9cb6-c4fdefa08d7a | Megarekrut65/Cluster-Calculations-2023 | TestRunner/TestRunner/TestRunner.cpp | #include <iostream>
#include <windows.h>
#include <string>
#include <fstream>
#include <iomanip>
#include <locale>
void startup(LPSTR command)
{
STARTUPINFOA si;
PROCESS_INFORMATION pi;
ZeroMemory(&si, sizeof(si));
si.cb = sizeof(si);
ZeroMemory(&pi, sizeof(pi));
if (CreateProcessA (NULL, com... | TOOL | 0.9378 | 3.603185 |
d08ae898-64b9-4763-8c16-4dcfb48b06e3 | ishandutta2007/codeforces | princebelkovetz/normal/1637/C.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <cmath>
#include <set>
#include <stack>
#include <map>
#include <queue>
#include <iterator>
#include <sstream>
#include <cassert>
#include <locale>
#include <numeric>
#define ld long double
#define debug(x) cout <<... | ALGO | 0.999736 | 4.819261 |
764280ae-c40c-4fe3-99de-7be4382d9932 | colin-arnet/DSL-crypto-bench-tls | Vitis_Libraries/vision/L2/examples/stereolbm/xf_stereolbm_tb.cpp | #include "common/xf_headers.hpp"
#include "xcl2.hpp"
#include "xf_stereolbm_config.h"
#include <time.h>
using namespace std;
#define _TEXTURE_THRESHOLD_ 20
#define _UNIQUENESS_RATIO_ 15
#define _PRE_FILTER_CAP_ 31
#define _MIN_DISP_ 0
int main(int argc, char** argv) {
cv::setUseOptimized(false);
if (argc !... | ALGO | 0.918245 | 5.873518 |
e13bfd57-8e5a-4a2a-8eeb-f29dabe70aa0 | snehalp0104/LeetCode-Solutions | 0872-leaf-similar-trees/0872-leaf-similar-trees.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999917 | 6.27865 |
fa92605d-255a-4edf-b235-bb557b6fcc07 | lds217/lds | CLAOJ/dnp.cpp | #include <iostream>
using namespace std;
long long countStrings(int n)
{
long long a[n], b[n];
a[0] = b[0] = 1;
for (int i = 1; i < n; i++)
{
a[i] = a[i-1] + b[i-1];
b[i] = a[i-1];
}
return a[n-1] + b[n-1];
}
int main()
{
int n;
cin>>n;
cout << countStrings(n) << e... | ALGO | 0.999944 | 4.129939 |
38a9bb29-c159-418b-a0c8-7d73e0990f28 | Vivekjha99/Leetcode-solutions | 30-substring-with-concatenation-of-all-words/30-substring-with-concatenation-of-all-words.cpp | class Solution {
public:
vector<int> findSubstring(string s, vector<string>& words) {
unordered_map<string,int>mp1;
for(auto w:words){
mp1[w]++;
}
vector<int>ans;
int n=s.size();
int l=words.size();
if(n==0 || l==0)return ans;
int sz=words[... | ALGO | 0.999932 | 5.931664 |
1e097e71-dc10-43c7-ad47-de6a29d74bf4 | HekpoMaH/Olimpiads | 10 klas - B/Binary-Indexed-Trees-Uzana-2011/LSS/fast.cpp | #include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;
const int NMAX = 1000000+10;
int a[NMAX];
int d[NMAX];
int n;
void gen(int n)
{// srand(time(0));
for(int i=1; i<=n; i++)
a[i] = 1 + rand()%n;
}
void show()
{ for(int i=1; i<=n; i++)
cout << a[i] << " ";
cout << endl;
}
i... | ALGO | 0.9998 | 3.635772 |
0766dde4-4a2a-4853-acc1-69c1466b6dd5 | Bruf0x/studies | C++/arvoreavl/AVLTree.cpp | #include "AVLTree.h"
#include <iostream>
#include <cstdlib>
using namespace std;
AVLTree::AVLTree(){
//ctor
root = NULL;
}
AVLTree::~AVLTree(){
//destrutor
//TODO - Implementar destrutor
}
bool AVLTree::isEmpty(){
return root==NULL;
}
int AVLTree::height(){
//altura da árvore é a altura do seu nó raiz
... | ALGO | 0.998488 | 3.312801 |
27522e5e-f0f7-4734-bfe2-190a8a89358e | iamsinghashutosh/Codeforces-Solutions | dfs and similar/E_Tree_Shuffling.cpp | /*
GOOD is not Enough
You've got to be GREAT.
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
// #include<boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define mod 1000000007
#define FAST ios::s... | ALGO | 0.999696 | 3.869015 |
0c5ed9ca-a6d9-44f1-b31f-ac7dfd68c7a6 | viteseco/Vites | src/qt/guiutil.cpp | #include "guiutil.h"
#include "vitescoinaddressvalidator.h"
#include "walletmodel.h"
#include "vitescoinunits.h"
#include "util.h"
#include "init.h"
#include "protocol.h"
#include <QString>
#include <QDateTime>
#include <QDoubleValidator>
#include <QFont>
#include <QLineEdit>
#include <QUrl>
#include <QTextDocument> /... | TOOL | 0.932419 | 7.141157 |
7fa52f09-77f1-48b7-b8fc-e26107e6b903 | shyamshiyani/Cpp-language | extra/phase-6/24.cpp | #include <iostream>
using namespace std;
class Swapper {
private:
int num1;
int num2;
public:
Swapper(int x, int y) : num1(x), num2(y) {}
void swap() {
int temp = num1;
num1 = num2;
num2 = temp;
}
void display() {
cout << "After swap: num1 = " << num1 << ", n... | ALGO | 0.9252 | 6.416505 |
a3aad812-94f8-4791-9261-aeb8269c7ab9 | Aayush716/DSA_topicwise | Maximum Width Ramp.cpp | /*
A ramp in an integer array nums is a pair (i, j) for which i < j and nums[i] <= nums[j]. The width of such a ramp is j - i.
Given an integer array nums, return the maximum width of a ramp in nums. If there is no ramp in nums, return 0.
Example 1:
Input: nums = [6,0,8,2,1,5]
Output: 4
Explanation: The maximum widt... | ALGO | 0.999994 | 6.376251 |
7f66c3b7-a39b-4b00-b08a-30ce07a72a04 | dafei-ning/ParticleFire | Swarm.cpp |
#include "Swarm.h"
namespace ParticleFire {
Swarm::Swarm(): lastTime(0) {
m_pParticles = new Particles[PARTICLES_NUMBER];
}
Swarm::~Swarm() {
delete [] m_pParticles;
}
void Swarm::update(int time_elapsed) {
int interval = time_elapsed - lastTime;
for (int i = 0;... | TOOL | 0.881191 | 4.933144 |
4dc532ad-222c-4332-9931-3d4b240db829 | Lycanthrope92/Cracking-The-Coding-Interview | Chapter 11 - Sorting and Searching/Cracking the coding interview - Q11.1.cpp | #include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <iomanip>
#include <cmath>
#include <limits>
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <sstream>
#include <signal.h>
#include <utility>
using namespace std;
void merge1 ( int A[], int n, int a, int B[], int b... | ALGO | 0.999352 | 3.415288 |
1850c9e5-ba51-4f56-ac83-6fd2a66b64dd | NREL/JModelica | ThirdParty/CasADi/CasADi/casadi/solvers/lifting_indef_dple_internal.cpp | #include "lifting_indef_dple_internal.hpp"
#include <cassert>
#include "../core/std_vector_tools.hpp"
#include "../core/matrix/matrix_tools.hpp"
#include "../core/mx/mx_tools.hpp"
#include "../core/sx/sx_tools.hpp"
#include "../core/function/mx_function.hpp"
#include "../core/function/sx_function.hpp"
#include <numeri... | TOOL | 0.996754 | 6.138429 |
c0545ff1-f6d1-4322-adb6-76f9b6b37ec4 | a00012025/Online_Judge_Code | POI/22-Kwadraty(t).cpp | #include<bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn=1000000+10 ;
bool d[maxn] ;
int ans[maxn] ;
int f(int n)
{
return n*(n+1)*(2*n+1)/6 ;
}
main()
{
int n = 1001 ;
memset(ans,-1,sizeof(ans)) ;
d[0]=1 ;
for(int i=1;i<=n;i++) for(int j=maxn-1;j>=i*i;j--)
if(!d[j]... | ALGO | 0.999967 | 3.35449 |
a296f566-cb35-4b52-8d9d-e841ab669f3a | KangEunho/algorithm | Programmers/level2/위장.cpp | #include <string>
#include <vector>
#include <unordered_map>
using namespace std;
int solution(vector<vector<string>> clothes) {
int answer = 1;
unordered_map<string, int> map;
for (auto cloth : clothes)
{
map[cloth[1]]++;
}
for (unordered_map<string, int>::iterator iter = map.begin();... | ALGO | 0.99644 | 5.322622 |
63d92f8b-9566-4aad-8afb-f5415424ccfb | swENGsh/codetree-TILs | 240128/2의 거듭제곱수/pow-of-2.cpp | #include <iostream>
using namespace std;
int main() {
// 여기에 코드를 작성해주세요.
int a, cnt;
cin >> a;
cnt = 0;
while (a != 1){
a /= 2;
cnt ++;
}
cout << cnt;
return 0;
} | ALGO | 0.999981 | 5.20695 |
51c27324-f63d-43ca-8065-f3be3eb24d18 | timthedev07/100algo-in-100days | day68/main.cpp | /**
* Write a function that reverses a string. The input string is given as an
* array of characters s.
*/
#include <vector>
using namespace std;
class Solution
{
public:
void reverseString(vector<char> &s)
{
int n = s.size(), left = 0, right = n - 1;
while (left < right)
{
char temp = s[le... | ALGO | 0.997566 | 6.408256 |
d692db6c-87df-4d07-9350-79d7027ecf9e | roshan798/Learning-C-CPP | TCS Codevita/1st.cpp | #include <bits/stdc++.h>
using namespace std;
class Node
{
public:
char to;
bool input, output;
Node(char _to, bool _input, bool _output)
{
to = _to;
input = _input;
output = _output;
}
};
int overlapping = -1;
string ansSeq = "";
char parent = 'a';
string back(map<char, vector<Node *>> &mp, char root, set... | ALGO | 0.999887 | 4.269963 |
f35fa8c9-7b11-4716-9110-2a43bcda289c | TinkerBoard/rockchip-linux-external-camera_engine_rkaiq | rkaiq/algos/asharp/rk_aiq_asharp_algo_sharp.cpp |
#include "rk_aiq_asharp_algo_sharp.h"
RKAIQ_BEGIN_DECLARE
#define MAX_SHARP_LUMA_CLIP_VALUE (8.0)
void sharp_filter_merge(float *src0, float *src1, float* dst, int size, float alpha)
{
for(int i = 0; i < size; i++)
{
dst[i] = src0[i] * alpha + src1[i] * (1 - alpha);
LOGD_ANR("sharp filter_me... | TOOL | 0.95779 | 4.68839 |
236995f9-e017-4ca7-a2ba-c6d44cf3ecbc | DyogoBendo/contests | round_874/a.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int t, n;
cin >> t;
while(t--){
cin >> n;
string s;
set<string> used;
for (int i = 0; i < n; i++)
{
char x;
cin >> x;
s.push_back(x);
}
for (int i = 1; i... | ALGO | 0.999261 | 3.9736 |
f73aa9a6-fb54-4389-8b7c-37fb8381d1e0 | priya-thv/dsa-practice | Binary trees/find max at each row.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999988 | 6.078284 |
06ba3879-acab-4b22-9d5d-fe6b37cd5f4a | rosyidId/Belajar_cpp | bab-18/stl_list1.cpp | /******************************************************
Nama file: stl_list1.cpp
*******************************************************/
#include <iostream>
#include <list> // std::list
int main() {
int a[] = {10,20,30,40,50};
std::list<int> l(a, a + sizeof(a)/sizeof(int));
// penelusuran maju
st... | TOOL | 0.969946 | 3.575491 |
f86f8c04-120f-44ab-9a85-23fc8883a729 | LionelMessi-M10/Cpp_Ptit | CPP0130 - ƯỚC SỐ NGUYÊN TỐ.cpp | // Created by Nguyễn Mạnh Quân
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz size()
#define ll long long
#define FOR(i, a, b) for(int i = a; i <= b; ++i)
#define FORD(i, a, b) for(int i = a; i >= b; --i)
#define faster() ios_base:... | ALGO | 0.9999 | 4.362947 |
4ddb6896-c911-421c-ba9f-743744341610 | wxrdnx/My-Leetcode-Solutions | palindromic-substrings.cpp | class Solution {
public:
int countSubstrings(string s) {
/* Manacher's Algorithm */
string pad = "|";
for (char& c : s) {
pad.push_back(c);
pad.push_back('|');
}
vector<int> count(pad.length());
int center = 0, right = 0, result = 0;
fo... | ALGO | 0.999951 | 6.737628 |
aca993af-f1ed-4610-88f6-a8154b98c141 | Vaibhav-22-dm/Cpp-Codes | Graph_&_Trees/Minimum_spanning_tree.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
//Make - create an independent node
//Find - Gives parent of the group
//Union - Add groups of elements of a and b
int parent[N];
int depth[N];
multiset<int> sizes;
void make(int v){
parent[v] = v;
depth[v] = 1;
sizes.insert(1);
}
int f... | ALGO | 0.999971 | 4.537352 |
133882a8-43ee-4f47-a28d-d2c2b176001d | IsolatedBonobo/Queue | reversequeue.cpp | #include<iostream>
#include<queue>
using namespace std;
void reversequeue(queue<int>&q){
// base case
if(q.empty()){
return;
}
int element = q.front();
q.pop();
// recursive call
reversequeue(q);
q.push(element);
}
int main(){
queue<int>q;
q.push(8);
q.push(2);
... | ALGO | 0.999754 | 4.241504 |
f95d9ca6-f968-4147-9430-0dec89654db5 | ClementCristin/Plug-in-Eclipse-Aide-a-la-localisation-de-bugs-dans-un-programme-JAVA | LocFaults/core/java/classes/JNI/jni_IbexSolver.cpp | #include "jni_IbexSolver.h"
#include <iostream>
#include <vector>
#include "jni_Ibex.h"
#include "IbexToken.h"
#include "IbexConstraint.h"
#include "IbexPaver.h"
#include "IbexEnv.h"
#include "IbexExpr.h"
#include "IbexDomain.h"
#include "IbexSpace.h"
#include "IbexContractor.h"
#include "IbexBisector.h"
#include "I... | ALGO | 0.986521 | 4.002432 |
24412729-5fd5-48c8-ae55-e307ab3cb619 | ishandutta2007/codeforces | jiangly_fan/normal/1726/E.cpp | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr LL mod = 998244353;
LL power (LL a, LL r) {
LL res = 1;
for (; r; r >>= 1, a = a * a % mod)
if (r & 1) res = res * a % mod;
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
f... | ALGO | 0.999924 | 4.828674 |
a377c0f5-6cf7-4709-a9e9-f959ecebaf36 | evertheylen/ArcadeGame | src/lib/boost/libs/numeric/ublas/doc/samples/matrix_vector_slice.cpp | #include <boost/numeric/ublas/matrix.hpp>
#include <boost/numeric/ublas/matrix_proxy.hpp>
#include <boost/numeric/ublas/io.hpp>
int main () {
using namespace boost::numeric::ublas;
matrix<double> m (3, 3);
for (unsigned i = 0; i < m.size1 (); ++ i)
for (unsigned j = 0; j < m.size2 (); ++ j)
... | ALGO | 0.898433 | 3.460482 |
99464b63-ceb0-455f-b039-7a94e9f4c7ea | MBadarr/C | c++ programmes/add/add calculation.cpp | #include <iostream>
using namespace std;
int main(int argc, char** argv)
{
int a=45;
int b=67;
int c=a+b;
cout<<c;
return 0;
}
| TOOL | 0.939611 | 3.108802 |
1a89c85e-9be0-482b-a588-ca70d52e717d | brobat6/competitive | Lazy/Atcoder/ABC263/C_-_Monotonically_Increasing.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
set<vector<int>> p;
vector <int> v(m);
iota(v.begin(), v.end(), 1);
do {
auto q = v;
while((int)q.size() > n) q.pop_back();
sort(q.be... | ALGO | 0.999998 | 3.956304 |
153d5131-2a2b-4e3f-bc95-7a66ba867d7e | r-hub2/chunky-reclusive-queenslandgrouper-SCM | src/d1_beta.cpp | #include "scm_der.h"
// [[Rcpp::export(name="d1_beta")]]
double d1_beta(arma::mat& X, arma::mat& eta, arma::mat& y, Rcpp::List& jj, uint32_t& K, arma::vec& lb, arma::mat& l1, arma::mat& l1_l, arma::uvec& ig, arma::vec& z, arma::vec& w, arma::mat& Gm, uint32_t& param){
using namespace arma;
uint32_t size_g = ig.n... | ALGO | 0.960912 | 5.786739 |
ac37de14-90a8-4f3f-b2b4-f632211631a0 | nikhilmantri99/Interviewbit-questions-solution | Tree_Data_structure.cpp/Binary_Tree_to_DoublyLinkedList.cpp | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
// Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL) In-Place. The left and right pointers
// in nodes are to be used as previous and next pointers respectively in converted DLL. The order of nodes
// in DLL must be same as Inorder of... | ALGO | 0.999987 | 5.611197 |
89731fdb-5e53-48e7-b965-0ee32b0b294e | SkaaRJik/CourseWorks | BAckpackBranch/Source.cpp | #include<iostream>
#include<cstdio>
#include<string>
#include<conio.h>
#include<windows.h>
using namespace std;
int W, K;
int curW;
int curP, bestP, lostP;
int MaxP;
void metodvg(int j, int *p, int *w, int *x, int *y) {
if (j == K) {
if (bestP < curP && curW <= W) {
for (int i = 0; i < K; ++i) y[i] = x[i];
b... | ALGO | 0.99992 | 3.308278 |
e5759ff5-aa48-44ce-9395-973d7828b1eb | alexandraback/datacollection | solutions_5744014401732608_1/C++/zetamoo/main.cpp | #include <vector>
#include <list>
#include <map>
#include <math.h>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <string>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <string.h>
#include <sstream>
#include <iost... | ALGO | 0.999331 | 3.82245 |
4a671ef2-ffc6-4636-ac57-fed355bcf840 | zerotrac/NAC2023 | I_Power_of_Divisors.cpp | #include <bits/stdc++.h>
using LL = int64_t;
using ULL = uint64_t;
using PII = std::pair<int, int>;
using PIL = std::pair<int, LL>;
using PLL = std::pair<LL, LL>;
// constexpr int mod = 1e9 + 7;
// constexpr int mod = 998244353;
using namespace std;
int main() {
LL x;
cin >> x;
if (x == 1) {
cout << "1\n";... | ALGO | 0.999989 | 5.532668 |
b3e08987-e387-4963-82fc-6d28e4193f3c | Munawertaj/Codeforces | A_Chip_Game.cpp | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define vull vector<ull>
#define vss vector<string>
#define matrix(x) vector<vec... | ALGO | 0.999876 | 5.652891 |
50adf26c-7814-4df4-98ca-36bd070e0b41 | sunwchoi/BJ | 프로그래머스/3/77486. 다단계 칫솔 판매/다단계 칫솔 판매.cpp | #include <string>
#include <vector>
#include <unordered_map>
#include <iostream>
using namespace std;
unordered_map<string, string> graph;
unordered_map<string, int> result;
void f(const string& name, int money)
{
if (money >= 10)
result[name] += money - money / 10;
else
{
result[name] +=... | ALGO | 0.981869 | 4.041082 |
0f02f756-3f3a-4e9e-bbb9-388bf33d91db | ww-driving/nd013-c5-planning-starter | starter_files/eigen-3.3.7/bench/benchBlasGemm.cpp | // g++ -O3 -DNDEBUG -I.. -L /usr/lib64/atlas/ benchBlasGemm.cpp -o benchBlasGemm -lrt -lcblas
// possible options:
// -DEIGEN_DONT_VECTORIZE
// -msse2
// #define EIGEN_DEFAULT_TO_ROW_MAJOR
#define _FLOAT
#include <iostream>
#include <Eigen/Core>
#include "BenchTimer.h"
// include the BLAS headers
extern "C" {... | ALGO | 0.875443 | 6.239976 |
fac8a7ea-3eac-48bb-bde0-909193386321 | luthanhy/LearnCode | Study In class/Datastructures_And_Algorithms/Stack_and_Queue/str_strack.cpp | #include "iostream"
#include "string.h"
#include "stdlib.h"
using namespace std;
typedef struct Stack
{
char data[40];
struct Stack* next;
}ST;
typedef ST* PrtStack;
bool IsEmpty(PrtStack s){
return s==NULL;
}
void Init(PrtStack& s){
s = NULL;
}
void Enter_String(char s[]){
cout<<"\n Enter string ";... | ALGO | 0.994839 | 3.498042 |
b12a185d-d695-4ec0-bb1e-bc5bcfe60396 | onkofonko/padavan-ng | trunk/user/transmission/transmission-4.0.5/third-party/wide-integer/examples/example012_rsa_crypto.cpp | #include <random>
#include <string>
#include <examples/example_uintwide_t.h>
#include <math/wide_integer/uintwide_t.h>
namespace local_rsa
{
template<const std::size_t RsaBitCount,
typename LimbType = std::uint32_t,
typename AllocatorType = std::allocator<void>>
class rsa_base
{
public:
... | ALGO | 0.97058 | 7.525664 |
f104180a-6764-48e1-8ca7-a4a7917f8af6 | dekel2003/Geometric-Computer-Vision | hw4/toolbox_fast_marching/mex/backup/perform_front_propagation_anisotropic.cpp | #include "mex.h"
#include "anisotropic-fm/AnisotropicTensorDistance.h"
#include "anisotropic-fm/AnisotropicTensorDistanceConfidence.h"
using namespace std;
using namespace FastLevelSet;
#define start_points_(i,j) start_points[i+j*3]
// D = perform_front_propagation_anisotropic(tensor_data, mask, alpha, start_points)... | ALGO | 0.993587 | 4.610165 |
1f850794-8da8-4ae9-a4bc-66694f9bc64e | ti-st/adventofcode2023 | Markus/Day01/Problem 1/main.cpp | #include<iostream>
#include<fstream>
#include<string>
inline bool IsNumber(char ch) {return (ch>47)&&(ch<58);}
int ConvertToNumber(char ch)
{
if (!IsNumber(ch)) {return -1;}
return ch-48;
}
int main(int argc, char const *argv[])
{
// Read input file
std::ifstream inputFile;
inputFile.open("day_1_i... | ALGO | 0.998398 | 5.917324 |
557b228b-efee-4101-9543-79af86e4300e | liuq901/code | SGU/s_113.cpp | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
int main()
{
int check(int);
int n,i,j,k,t,flag;
int f[100001];
memset(f,0,sizeof(f));
for (i=2;i<=100000;i++)
{
if (f[i])
continue;
f[i]=0;
j=1;
while (1)
{
j++;
if (i... | ALGO | 0.999962 | 3.731109 |
74031abd-af3b-4e9c-8375-dbc9fe95b5fb | charguer/optitrust | tests/omp/target_data2_exp.cpp | void init(float*, float*, int);
void init_again(float*, float*, int);
void output(float*, int);
void vec_mult(float* p, float* v1, float* v2, int N) {
int i;
init(v1, v2, N);
#pragma omp target data map(from : p [0:N])
{
#pragma omp target map(to : v1[:N], v2[:N])
#pragma omp parallel for
for (i = 0; i < N... | ALGO | 0.997614 | 4.040257 |
008d974d-0c41-4a12-93a5-3a54420c6893 | Vjgatap/-C-Code | Pattern/pattern5.cpp | #include <iostream>
using namespace std;
int main()
{
int stars;
cout << "Enter No of stars : ";
cin >> stars;
for (int i = 1; i <= stars; i++)
{
for (int j = 1; j <= i; j++)
{
cout << j <<" ";
}
cout << endl;
}
return 0;
} | ALGO | 0.981218 | 3.530355 |
e00d1ae4-ed3d-44f6-a8d4-080ad4a7a2c7 | ANIRUDH-333/Self-Balancing-Robot | Artificial Horizon/Arduino Libraries/PID_v1/PID_v1.cpp | #if ARDUINO >= 100
#include "Arduino.h"
#else
#include "WProgram.h"
#endif
#include <PID_v1.h>
/*Constructor (...)*********************************************************
* The parameters specified here are those for for which we can't set up
* reliable defaults, so we need to have the user set them.
*... | TOOL | 0.906496 | 6.062096 |
9aca6529-436f-473d-94de-cb827ba22bba | Web3Expert47/faceRecognition | src/main/resources/opencv/sources/modules/cudastereo/src/stereobp.cpp | #include "precomp.hpp"
using namespace cv;
using namespace cv::cuda;
#if !defined (HAVE_CUDA) || defined (CUDA_DISABLER)
void cv::cuda::StereoBeliefPropagation::estimateRecommendedParams(int, int, int&, int&, int&) { throw_no_cuda(); }
Ptr<cuda::StereoBeliefPropagation> cv::cuda::createStereoBeliefPropagation(int, ... | ALGO | 0.998919 | 6.812998 |
838fc517-ca64-4fa8-a2b8-394a226c780c | ank809/Cpp-Codebase | DSA/doubly_ll.cpp | #include<iostream>
using namespace std;
class Node{
public:
int val;
Node* next;
Node* prev;
Node(int data){
val=data;
next=NULL;
}
Node* head;
Node(){
head=NULL;
}
void insertAtFirst(int value){
Node* node= new Node(value);
node->prev=NULL;
... | ALGO | 0.999779 | 4.277854 |
515d0c88-f5fa-4c28-8359-a1465e64a69e | alexandraback/datacollection | solutions_5769900270288896_1/C++/zld3794955/B.cpp | #include<bits/stdc++.h>
using namespace std;
const int S=10010,x_[4]={0,1,0,-1},y_[4]={1,0,-1,0};
int n,r,c;
vector<int> a[S];
void init()
{
cin>>r>>c>>n;
for(int i=0;i<S;++i)
a[i].clear();
for(int i=0;i<=r+1;++i)
a[i].resize(c+10,0);
}
int work(int mod)
{
int x=n;
for(int i=1;i<=r;++i)
for(int j=1;j<=c;++j)... | ALGO | 0.999618 | 3.775643 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.