uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
7668ba24-0198-42eb-b0cd-153323d1a67c | jeterlab/ionic-mechanisms-underlying-bistability-in-spinal-motoneurons | boost/libs/graph/example/connected_components.cpp | #include <boost/config.hpp>
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/connected_components.hpp>
/*
This example demonstrates the usage of the connected_components
algorithm on a undirected graph. The example graphs... | ALGO | 0.999643 | 6.76879 |
e7110bc1-a1c6-462f-aef8-0a49fd79b94f | robbypambudi/Struktur-Data | Final Praktikum/Serasa_Hacker.cpp | #include <iostream>
#include <string.h>
#include <list>
#define llu unsigned long long
using namespace std;
llu hashh(llu k)
{
return k % 100007 + 1;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
llu x;
bool arr[900007];
memset(arr, false, sizeof(arr));
... | ALGO | 0.999806 | 3.227137 |
66406c14-db55-433d-af7b-21d8f925cbf3 | 19sumit11/week1-Dp1-CipherSchools | twolinkedlist.cpp | #include<bits/stdc++.h>
using namespace std;
class ListNode
{
public:
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) {}
};
ListNode * addTwoNumbers(ListNode* a, ListNod... | ALGO | 0.999532 | 5.181261 |
c45300ce-20d4-4404-a513-a65e72fdf1dd | ZDUC/CTDL-GT_PTIT | dem-ky-tu-B.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,k;
cin>>n>>k;
if(n==0)
{
cout<<0<<endl;
}
else if(n == 1)
{
cout << 1 << endl;
}
else
{
string f0 = "A", f1 = "B", fn;
for (int i = 2; i <=... | ALGO | 0.999897 | 4.09719 |
8dabe453-30a2-4d93-a829-d27a34ccafc4 | rajrohan10899/LeetCode-Problems | 1570-final-prices-with-a-special-discount-in-a-shop/1570-final-prices-with-a-special-discount-in-a-shop.cpp | //Approach-1 (Brute Force)
//T.C : O(n^2)
//S.C : O(1)
class Solution {
public:
vector<int> finalPrices(vector<int>& prices) {
vector<int> res(prices.begin(), prices.end());
for(int i = 0; i < prices.size(); i++) {
for(int j = i + 1; j < prices.size(); j++) {
if(prices[j... | ALGO | 0.99998 | 5.960845 |
22092ca0-0aeb-48cf-b398-b89657c6923d | KevinMuyaoGuo/PAT_levelB | 1091.cpp | /**
* 如果某个数 K 的平方乘以 N 以后，结果的末尾几位数等于 K，那么就称这个数为“N-自守数”。例如 3×92
2
=25392，而 25392 的末尾两位正好是 92，所以 92 是一个 3-自守数。
本题就请你编写程序判断一个给定的数字是否关于某个 N 是 N-自守数。
输入格式：
输入在第一行中给出正整数 M（≤20），随后一行给出 M 个待检测的、不超过 1000 的正整数。
输出格式：
对每个需要检测的数字，如果它是 N-自守数就在一行中输出最小的 N 和 NK
2
的值，以一个空格隔开；否则输出 No。注意题目保证 N<10。
输入样例：
3
92 5 233
输出样例：
3 25392
1 ... | ALGO | 0.999873 | 3.756587 |
7ace6c0d-4621-4ee8-90a8-5b3f83101c93 | tranthanhcuong1464hg123aqwlgm/TranThanhCuong_monC | Chapter11/Program challeges 11-15.cpp | #include <iostream>
using namespace std;
// Structure for hourly paid worker
struct HourlyPaid {
double HoursWorked;
double HourlyRate;
};
// Structure for salaried worker
struct Salaried {
double Salary;
double Bonus;
};
// Union for storing either hourly paid or salaried worker data
union PayData {... | TOOL | 0.89039 | 4.712262 |
965c6493-26c8-4756-a3c4-9d88ad7c5338 | pingchungchang/CP | CF1611A.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ld long double
#define _all(T) T.begin(),T.end()
void solve(){
string s;
cin>>s;
bool odd = true;... | ALGO | 0.999267 | 4.353333 |
9bd0928a-20c2-444f-9687-f65ed1ecd6d6 | north-h/Match_code | 2024/Codeforces_-_SMU_Autumn_2024_Team_Round_10/J_New_Energy_Vehicle__Generator.cpp | // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define debug1(a) cout << #a << '=' << a << endl
#define debug2(a, b) cout << #a << '=' << a << ' ' << #b << '=' << b << endl
#define int long long
const int N = 100010;
const int INF = 0x3f3f3f3f;
using namespace std;
mt19937 rnd(chrono::steady_clock().now().... | ALGO | 0.992121 | 3.186525 |
f496f5e3-4b26-49bb-b3b9-8df685609bda | SwissMak/RepRapFirmware | RepRapFirmware/src/Storage/CRC16.cpp | /*
* CRC16.cpp
*
* Created on: 4 Dec 2020
* Author: David
*
* CRC-16 computation. This is currently not speed-critical because it is only used when flashing PanelDue.
* So we don't use the hardware CRC unit on the SAME5x, or slicing-by-4.
*/
#include "CRC16.h"
static const uint16_t crc16_table[] =
{
... | ALGO | 0.983803 | 6.265598 |
e10b74bf-120f-46d6-883a-695298985ddd | rodrigoota/flutter_counter_app | windows/runner/utils.cpp | #include "utils.h"
#include <flutter_windows.h>
#include <io.h>
#include <stdio.h>
#include <windows.h>
#include <iostream>
void CreateAndAttachConsole() {
if (::AllocConsole()) {
FILE *unused;
if (freopen_s(&unused, "CONOUT$", "w", stdout)) {
_dup2(_fileno(stdout), 1);
}
if (freopen_s(&unuse... | TOOL | 0.998693 | 6.797273 |
e6f54495-f6d4-4ae5-9f0d-6e16a0ecc2bd | rupert-li/USACO | job.cpp | /*
ID: rupertl1
PROG: job
LANG: C++11
*/
#include <iostream>
#include <fstream>
#include <string>
#include <math.h>
#include <algorithm>
#include <utility>
#include <string.h>
#include <iterator>
#include <vector>
#include <iomanip>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <unordered_se... | ALGO | 0.999874 | 3.44217 |
76b72fc4-5fa2-43a3-a237-1e64a635c210 | mdirshad17/DP | Twone.cpp | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define int long long int
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
#define vpi vector<pair<int,int>>
#define pii pair<int,int>
#define pb push_back
#define inf 1e18
#define ff first
#define ss second
#define deb(x) cout<<#... | ALGO | 0.99964 | 3.792311 |
1a33c0af-1682-4dc0-9e01-e153cfd509da | anjalim28/Leet-Code | November 2023/day13LeetCode.cpp | class Solution {
public:
string sortVowels(string s) {
vector<char> vowels;
for (char c : s) {
if (string("aeiouAEIOU").find(c) != string::npos) {
vowels.push_back(c);
}
}
sort(vowels.begin(), vowels.end(), greater<char>());
string resu... | ALGO | 0.999931 | 6.352847 |
5c45791c-4186-4dcd-9589-1ae736146322 | isshe/reading-books | 8_data_structures_and_algorithms/2_coding_interviews/22_栈的压入_弹出序列/stack_push_pop.cpp | /*-----------------------------------------------------------*
* 头文件 *
*-----------------------------------------------------------*/
class Solution {
public:
bool IsPopOrder(vector<int> pushV,vector<int> popV) {
if (pushV.size() != popV.size() |... | ALGO | 0.999477 | 5.679616 |
4dce6109-21b7-45f3-8798-dbe45bc44099 | lzyrapx/Competitive-Programming | ACdream/1006（数学推导）.cpp | /*
* this code is made by LzyRapx
* Problem: 1006
* Verdict: Accepted
* Submission Date: 2017-06-23 15:52:35
* Time: 28MS
* Memory: 1844KB
*/
//http://blog.csdn.net/liangzhaoyang1/article/details/73648994
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
d... | ALGO | 0.999696 | 3.97631 |
0b4c12ea-75a2-4303-a2be-2be47f4611bc | emCoderMan/PivotAvionics | Libraries/Michael Libraries/SdFat_-_Adafruit_Fork/src/ExFatLib/ExFatPartition.cpp | #define DBG_FILE "ExFatPartition.cpp"
#include "../common/DebugMacros.h"
#include "ExFatLib.h"
//------------------------------------------------------------------------------
// return 0 if error, 1 if no space, else start cluster.
uint32_t ExFatPartition::bitmapFind(uint32_t cluster, uint32_t count) {
uint32_t star... | TOOL | 0.950836 | 5.583535 |
9cb93d96-bca7-4492-ba9c-a778b9b5f882 | ping29065147/Exam-Collection | UVa/11096 - Nails v2.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <iomanip>
using namespace std;
static auto fast_io = []
{
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
return 0;
}();
struct point
{
double x;
double y;
double d;
};
vector< point > V;
vector< point > re... | ALGO | 0.99989 | 4.8877 |
e9abd9f5-1e37-4526-a438-9a868f5d57b4 | zawodev/PWR | sem3/TEP-cpp/zad2/zad2/zad2.cpp | #include <iostream>
#include <string>
#include "zad2.hpp"
CNumber::CNumber(std::string strDigits) {
if (strDigits[0] == '-') negative = true;
else negative = false;
int neg = negative ? 1 : 0;
size = (int)strDigits.size() - neg;
digits = new int[size];
for (int i = 0; i < size; i++) {
digits[i] = ((int)strDi... | ALGO | 0.863771 | 3.768034 |
44f72a51-543e-4288-8e71-8e57d8bb7af1 | KY2001/atcoder-all-my-submissions | abc077/abc077_b_1650449322.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(15);
int N;
cin >> N;
for (int k = 0; k < 100000; k++){
if (k * k > N){
cout << (k-1) * (k-1) << endl;
break;
}
}
}
| ALGO | 0.999742 | 3.727247 |
1681bef6-b366-4ac7-be1d-e8524e78296e | taiyakinosippo/Practice | MergeSortSample/MergeSortSample/MergeSortSample.cpp | //=========================================================
// }[W\[g
//=========================================================
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h> // printf(),scanf()
#include <stdlib.h> // srand(),rand()
#include <time.h> // time()
// vg^Cv
bool MergeSort(int array[], int array... | ALGO | 0.99749 | 3.913734 |
8c5f51bb-b0e9-478f-b2bc-73e8bc0ade5e | Eng-Mohamed-Maged/Modern-Cpp-Codes | 12-lab12-Polymerphism-Virtual-function/Source_files/main.cpp | #include <iostream>
#include <string>
#include "../Header_files/person.hpp"
#include "../Header_files/student.hpp"
#include "../Header_files/post_graduate_student.hpp"
using namespace std;
int main()
{
person * ptr;
person p1("Mohamed Maged","Male",25);
p1.Display();
//[Polymerphism]
ptr = &p... | TOOL | 0.869168 | 5.002324 |
e6609f0b-5ffe-4f06-a3c8-299c6fc5720f | DungNguyenCoder/SPOJ_PTIT | BCQUEEN.cpp | #include <bits/stdc++.h>
using namespace std;
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define mx 1000000
int mod = 1000000007;
#define TEST 0
int n, s, c[20], c1[50], c2[50];
void Try(int x){
if(x == n+1)
{
s++;
return;
}
for(int i = 1; i <= n; i++)
{... | ALGO | 0.999903 | 3.920593 |
f02c8779-85d3-4100-84bc-d3e20883e8e1 | sarvex/leetcode-c3 | lcof2/剑指 Offer II 027. 回文链表/Solution.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
bool isPalindrome(Lis... | ALGO | 0.999736 | 6.034562 |
22549c65-c638-4f6c-91d7-5bc069a4154a | rudra2110/gfg_code | pow_of_two.cpp | // Given an integer n, return true if it is a power of two. Otherwise, return false.
// An integer n is a power of two, if there exists an integer x such that n == 2x.
// Example 1:
// Input: n = 1
// Output: true
// Explanation: 20 = 1
// Example 2:
// Input: n = 16
// Output: true
// Explanation: 24 = 16
// Examp... | ALGO | 0.998453 | 6.727598 |
59506977-9d93-4734-b033-23cbe1c15675 | zf-w/mini_problem_collection_before_y2023m11 | Leetcode/Leetcode.1466.reorder-routes-to-make-all-paths-lead-to-the-city-zero/Leetcode.1466.reorder-routes-to-make-all-paths-lead-to-the-city-zero.cpp | /*
* @lc app=leetcode id=1466 lang=cpp
*
* [1466] Reorder Routes to Make All Paths Lead to the City Zero
*
* https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/description/
*
* algorithms
* Medium (61.53%)
* Likes: 2848
* Dislikes: 73
* Total Accepted: 100.5K
* Total ... | ALGO | 0.999922 | 6.148172 |
19e6b3d1-8e39-4c47-ba59-596483efe203 | sarj33t-prakash/flutter-social-buttons | 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.998848 | 6.76073 |
6d42f566-ceba-4348-8211-f02c0c59cb1a | nxp-mcuxpresso/mcux-sdk-examples | frdmmcxn947/eiq_examples/tflm_kws/cm33_core0/source/model/get_top_n.cpp | #include "get_top_n.h"
// Returns the top N confidence values over threshold in the provided vector,
// sorted by confidence in descending order.
void MODEL_GetTopN(const uint8_t* tensorData, int tensorSize, tensor_type_t tensorType,
size_t numResults, float threshold, result_t* topResults)
{
for ... | ALGO | 0.992557 | 7.041502 |
b72300cf-7a84-4951-bcf8-7449f49d08dc | maheersayeed99/GraphShortestPath | public/src/ysgebl/src/kernelutil/ysshellext_clusteringutil.cpp | #include "ysshellext_clusteringutil.h"
#include "ysshellext_diagnoseutil.h"
////////////////////////////////////////////////////////////
void YsShellExt_EdgeClusteringUtil::Cluster::CleanUp(void)
{
edgInCluster.CleanUp();
}
////////////////////////////////////////////////////////////
YsShellExt_EdgeClusteringUtil:... | ALGO | 0.873652 | 5.553687 |
f46f6981-aba6-446e-b96f-22bbee9d7cb6 | AST-TheCoder/CP-Solutions | CodeForces/GNU C++17/20C | Dijkstra?/42855463.cpp | /******************************************************/
/******************************************************/
/** BISMILLAHIR RAHMANIR RAHIM **/
/** Al-Shahriar Tonmoy - Red_Sparkle **/
/** Department of Computer Science and Engineering **/
/** Barisal Universit... | ALGO | 0.999984 | 3.384388 |
d1c19c8a-930d-45f7-9620-f0a4fd5e3d05 | Emmazch22/CI0117-2020-S2 | Actividades/Actividad #9/dna_sequences_hyb/dna_sequences_hyb.cpp | #include <iostream>
#include <mpi.h>
#include <string>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <omp.h>
using namespace std;
void initArray(int * array, int size){
for (int i = 0; i < size; ++i){
array[i] = 0;
}
}
int main(int argc, char *argv[]){
string sequence;
int sequence_count... | ALGO | 0.997844 | 3.993634 |
1763de92-b4d5-44c0-809c-fa7408c70d45 | romeorizzi/portafoglioVoti_public | Algoritmi/2019-09-04/all-CMS-submissions/2019-09-04.11:08:53.606833.VR418781.hanoi_equal_disks.cpp | /**
* user: VR418781
* fname: BRENTEGANI
* lname: MATTEO
* task: Prob2_hanoi_equal_disks
* score: 0.0
* date: 2019-09-04 11:08:53.606833
*/
#include <cassert>
#include <stdio.h>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long unsigned int llu;
const int MAXN = 100000;
int d[MAXN+1];
in... | ALGO | 0.999929 | 4.118236 |
9e9be45d-da2a-4e6d-b209-63379e757100 | ishandutta2007/codeforces | rush_d_cat/normal/719/B.cpp | #include <cstring>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
#define INF 1e9 + 7
typedef long long ll;
using namespace std;
#define MAXN 100000 + 10
#define MAXM 2000 + 10
char s[MAXN];
int main()
... | ALGO | 0.99974 | 4.21324 |
c8da004d-4f7e-4965-ae94-19e6a696cc0e | liguigui/kamyu104-LeetCode | C++/min-cost-climbing-stairs.cpp | // Time: O(n)
// Space: O(1)
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
vector<int> dp(3);
for (int i = cost.size() - 1; i >= 0; --i) {
dp[i % 3] = cost[i] +
min(dp[(i + 1) % 3],
dp[(i + 2) % 3]);
... | ALGO | 0.99985 | 6.058536 |
8bb3cfe6-6624-4111-b419-602b86bb60f2 | akshaytak/Option-Pricing-using-Exact-solution | Write_up_Group_A.cpp | ////////////////////////////////////////////////////// GROUP A \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
// NOTE - I have divided the Output results into 3 test main files because I was facing a glitch when I put all the code in one test main file(some of the lines
// were getting skipped while some... | ALGO | 0.998298 | 5.902571 |
ac60a256-fe10-448d-97cb-be02c0e38c3c | Many2333/image_segmentation | boost_1_63_0/libs/numeric/odeint/examples/phase_oscillator_ensemble.cpp | #include <iostream>
#include <utility>
#include <boost/numeric/odeint.hpp>
#ifndef M_PI //not there on windows
#define M_PI 3.141592653589793 //...
#endif
#include <boost/random.hpp>
using namespace std;
using namespace boost::numeric::odeint;
//[ phase_oscillator_ensemble_system_function
typedef vector< double > ... | ALGO | 0.999597 | 6.150312 |
6e037e5e-450f-44a7-b864-0227a52de2c8 | damymeister/ZPOCPP | LAB5-Z4/dictionary.cpp | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include "dictionary.h"
using namespace std;
Dictionary::Dictionary()
{
cout<<"Konstruktor bezparametrowy klasy dictionary"<<endl;
}
string Dictionary :: toLower(string str)
{
string lowerString = "";
for(int i=0; i<str.size();i++)
... | TOOL | 0.961821 | 3.409715 |
e98220b5-5f55-41c9-ba90-49d0740611f1 | jjb5442/problemSolve | binarySearch/10816_숫자_카드2.cpp | #include <iostream>
#include <algorithm>
using namespace std;
/*
problem website
https://www.acmicpc.net/problem/10816
*/
int binarySearch(int arr[], int size, int x)
{
int start = 0;
int end = size - 1;
int target = -1;
while (start <= end)
{
int mid = (start + end) / 2;
... | ALGO | 0.999991 | 4.996888 |
d9427077-b44e-4bb6-b385-314b09bf80a8 | Fisher-Wang/GraphPackaging | checker_for_times.cpp | #include<cstdio>
#include<cstdlib>
#include<ctime>
#include<algorithm>
int losspro = 0;
#define SEED 0
#define LOOSEPRO losspro
#define LOOSEN 4
#define MAXW 1572
#define TIMES 2048
using namespace std;
struct edge{
int to,next;
}e[400005];
int to[200005],topo[200005];
unsigned int w[200005],totw[200005],tw,Tw;
int h... | ALGO | 0.968967 | 3.247161 |
3be1b507-03ce-410c-b365-837a0cdb972d | lee-honey/CodingTest-Study | 11주차/햄버거 만들기/choiminsun.cpp | #include <string>
#include <vector>
#include <iostream>
using namespace std;
int solution(vector<int> ingredient) {
int answer = 0;
string str = ""; //־ str ȯ
for (int i : ingredient)
{
char c = i + '0';
str += c;
}
int start = 0; //Ž
while (true)
{
//Ž
... | ALGO | 0.999644 | 4.928965 |
3341f51e-63df-4e3e-878c-296562965848 | Baghar912/c-programming | ar12.cpp | #include <stdio.h>
int removeDup(int arr[], int n) {
if (n == 0) return 0;
int j = 0;
for (int i = 1; i < n - 1; i++) {
if (arr[i] != arr[j])
arr[++j] = arr[i];
}
return j + 1;
}
int main() {
int arr[] = {1, 1, 2, 2, 3, 4, 4, 5};
int n = sizeof(arr) / sizeof(arr... | ALGO | 0.999431 | 5.349956 |
5154b388-d43b-4e8c-a89e-083fcae03b92 | ishandutta2007/codeforces | jcvb/normal/325/C.cpp | #include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#define N 100005
#define inf 314000000
using namespace std;
int n,m;
int dis[N];
int unc[N],curd[N]={0};
int id[N];
vector<int> nex[N];
vector<int> up[N];
vector<int> go[N];
struct node{
int u,d... | ALGO | 0.999741 | 3.71909 |
8f197cf6-0303-4c3f-aea7-53205d84e458 | Official21A/DynamicMemory | 5/avl-tree.cpp | #include <iostream>
#include <queue>
#include <unordered_map>
using namespace std;
struct node
{
struct node *left;
int data;
int height;
struct node *right;
};
class AVL
{
public:
struct node * root;
AVL()
{
this->root = NULL;
}
int calheig... | ALGO | 0.999149 | 4.331817 |
64152483-4c03-4ff2-bd64-ef9b6fb22e75 | AjayJoshi99/Competitive_Pragramming | Difficulty: Basic/Prime Number/prime-number.cpp | class Solution {
public:
bool isPrime(int n) {
if(n==1) return false;
if(n==2) return true;
if (n % 2 == 0) return false;
for(int i = 3; i<=n/i; i+=2){
if(n%i==0) return false;
}
return true;
}
};
| ALGO | 0.9995 | 5.086437 |
815bfca7-af5a-44da-abe9-b8a2a71f84ad | sanchitahuja/CP-4th-Sem | 5.cpp | #include <stdio.h>
long DTB(long n) {
int remainder;
long binary = 0, i = 1;
while(n != 0) {
remainder = n%2;
n = n/2;
binary= binary + (remainder*i);
i = i*10;
}
return binary;
}
int main() {
long decimal;
printf("Enter a decimal number\n");
scanf("%ld", ... | ALGO | 0.999189 | 5.519456 |
d9af06df-eeeb-4d67-a08d-73273ae4fff9 | IrmaFirma/LeetCode-Practice | search_for_k_linked_list.cpp | #include <iostream>
using namespace std;
class Node{
public:
int value;
Node* next; //pointer to next list element
//constructor to initialize a new Node
Node(int new_value){
value = new_value;
next = nullptr; //by default NULL
}
};
bool searchForKey(Node* head, int ke... | ALGO | 0.999928 | 4.389101 |
a06547a1-9a5f-4efe-a9b6-52ca612d142c | rpahel/rpahelgame | RpahelCocos2D/cocos2d/cocos/2d/CCTextFieldTTF.cpp | #include "2d/CCTextFieldTTF.h"
#include "base/CCDirector.h"
#include "platform/CCFileUtils.h"
#include "base/ccUTF8.h"
#include "2d/CCSprite.h"
NS_CC_BEGIN
#define CURSOR_TIME_SHOW_HIDE 0.5f
#define CURSOR_DEFAULT_CHAR '|'
#define PASSWORD_STYLE_TEXT_DEFAULT "\xe2\x80\xa2"
static std::size_t _calcCharCount(const cha... | TOOL | 0.951628 | 6.935902 |
86ff7037-c3ea-499f-97d3-57d0384d9f28 | endiliey/competitive-programming | Codeforces/271A.cpp | #include <iostream>
#include <unordered_set>
using std::cout; using std::cin; using std::endl;
bool isDistinct(int year)
{
std::unordered_set<int> digits;
while (year != 0)
{
auto digit = year % 10;
if (digits.find(digit) != digits.end())
{
return false;
}
... | ALGO | 0.998539 | 5.166757 |
2dfd6453-02bd-4411-9c3d-eea071b167ba | hyperplasma/Ultimate-Solutions | PAT_Basic_Level/cpp/PAT_B1125/solution.cpp | #include <iostream>
#include <cstring>
#include <unordered_set>
#include <vector>
using namespace std;
string s;
string subs;
unordered_set<char> st;
vector <string> v;
int main() {
cin >> s >> subs;
for (int i = 0; i < subs.size(); ++i) st.insert(subs[i]);
for (int i = 0; i < s.size(); ++i) {
i... | ALGO | 0.999806 | 4.185213 |
3c858963-1e88-4301-a5f5-138e1df0214a | NoirNorie/STL_P | 1011.cpp | #include <iostream>
#include <cmath>
using namespace std;
// 문제 번호: 1011(Fly me to the Alpha centauri)
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int T;
cin >> T;
for (int j = 0; j < T; j++)
{
long long x, y;
cin >> x >> y;
y -= x;
long long i = 1;
long long sum =... | ALGO | 0.999925 | 4.177357 |
810d3e01-ad67-488d-b8b7-ff01fb033dff | ajakhotia/eyeKin | boost/boost/boost_1_57_0/libs/test/example/cla/custom_parameter.cpp | // See http://www.boost.org/libs/test for the library home page.
// Boost.Runtime.Param
#include <boost/test/utils/runtime/cla/named_parameter.hpp>
#include <boost/test/utils/runtime/cla/parser.hpp>
namespace rt = boost::runtime;
namespace cla = boost::runtime::cla;
// STL
#include <iostream>
#include <iterator>
... | TOOL | 0.984988 | 7.66907 |
1f22f9c3-ae3d-48d6-b2d0-935f5eafe135 | ishandutta2007/codeforces | ftiasch/normal/708/D.cpp | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <climits>
#include <queue>
const int N = 100;
const int V = 102;
const int E = 802;
int edge_count, head[V], to[E], capacity[E], cost[E], next[E], balance[N], distance[V], back[V];
bool visited[V];
void add_edge(int u, int v, int ca, int co)
{
//... | ALGO | 0.999956 | 4.357671 |
3f2e5c9d-4b73-4c45-851f-a817182cd92d | kihot122/imo-1 | greedy_helpers.cpp | #include <algorithm>
#include <array>
#include <chrono>
#include <iostream>
#include <random>
#include "greedy_helpers.hpp"
#include "main.hpp"
std::array<int, 3> getFromCyclePrevMiddleNext(std::vector<int> &Cycle, int middleIndex)
{
int prev = middleIndex - 1 < 0 ? Cycle.size() - 1 : middleIndex - 1;
int next = mi... | ALGO | 0.999866 | 5.291394 |
6b601047-fa00-4a02-b61d-76368e85b7b8 | limsub/Algorithm | 지금/Topological Sorting/2056_작업.cpp | #include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <sstream>
#include <algorithm>
using namespace std;
#include <queue>
#include <cstdio>
// 2056 작업
// 위상정렬 + DP
// 4% 틀
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// 0. 변수
int N;
cin >> N;
// 1. 입력
ve... | ALGO | 0.999926 | 4.077063 |
3fbc24e6-3716-486e-bcf9-36b6c8d67099 | trmr/code | atcoder/APG4b/EX26.cpp | #include <bits/stdc++.h>
using namespace std;
// 問題文の形式でvec値を出力
void print_vec(vector<int> vec) {
cout << "[ ";
for (int i = 0; i < vec.size(); i++) {
cout << vec.at(i) << " ";
}
cout << "]" << endl;
}
// 変数名を読み取りイコールを読み飛ばす
string read_name() {
string name, equal;
cin >> name >> equal;
return name;
... | TOOL | 0.9494 | 5.225333 |
01ef1a0e-d930-425b-8a2b-914f9ca7dafa | parequena/TFG_Codemon18 | assets/sourceCodes/bePushed.cpp | #include <iostream>
using namespace std;
int main()
{
char c;
c = getchar();
if (c == 'P')
{
c = getchar();
if (c == ':')
{
c = getchar();
if (c == 'U')
cout << "M:U" << endl;
if (c == 'D')
cout << "M:D" <<... | ALGO | 0.998309 | 3.983389 |
d9eb34c8-d74f-43e3-b7ab-39210937102e | jungchunkim/study_algorithm | [NDB_Coding_test]review/5. DFS_BFS/5-1.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <string>
using namespace std;
int arr[1000][1000];
int N, M;
int dx[] = { 1,0,0,-1 };
int dy[] = { 0,1,-1,0 };
void dfs(int i, int j)
{
arr[i][j] = 1;
for (int k = 0; k < 4; k++)
{
int x = i + dx[k];
int y = j + dy[k];
if (x >= 0 && y >= 0 && (... | ALGO | 0.999664 | 3.998412 |
29ccd159-aca8-4381-88ae-fc952a400ada | davdleet/algorithms-practice | BOJ/15889/a.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct d
{
int pos = 0;
int range = 0;
int idx = 0;
d(int a, int b, int c)
{
pos = a;
range = b;
idx = c;
}
d()
{
}
};
bool f(d a, d b)
{
if (a.range == b.range)
{
... | ALGO | 0.999911 | 3.573495 |
28a7467b-4493-469c-a36f-74e7843ac56e | DeepeshnotCool/LeetCode-Submissions | my-folder/problems/maximal_score_after_applying_k_operations/solution.cpp | class Solution {
public:
long long maxKelements(vector<int>& nums, int k) {
priority_queue<long long> heap;
for (auto num : nums) {
heap.push(num);
}
long long score = 0;
for (int i = 0; i < k; i++) {
long long maxElement = heap.top();
scor... | ALGO | 0.99996 | 5.499911 |
3a373582-82ea-40b7-8a02-8b1e2c670649 | justhusnan/CppDroid | examples/ReverseString#cpp#1/ReverseString#cpp#1.cpp | /*
Summary: Reverses a given string
*/
#include<iostream>
#include<conio.h>
#include<stdio.h>
using namespace std;
int main( )
{
clrscr();
char str[80];
int temp, l;
cout<<"Enter string :";
scanf("%79s",str);
for(l=0;str[l]!='\0';l++); //finding length of string
for(int i=0,j=l-1;i<l/2;i++,j--)
{
tem... | ALGO | 0.999134 | 3.822437 |
53e9a059-90de-46ef-9564-a5baa8a89eb8 | aritradev/My-practice-Problem | B_Caisa_and_Pylons.cpp | #include <bits/stdc++.h>
using namespace std;
#define cobra_69xp
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using ll = long long int;
using ull = unsigned long long int;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define in insert
#define pb push_back
#define ... | ALGO | 0.999896 | 4.103531 |
bc109316-0c52-4229-a8fd-4ab9e5532537 | ma7moud3zim/azim-cp | Topics/DP/DP - DP Masks/G - (DFS - string).cpp | #pragma GCC optimization("Ofast")
#include <bits/stdc++.h>
#define nl '\n'
#define ll int
#define pill pair<ll,ll>
#define pb push_back
#define fs first
#define sc second
#define yn cout << (ok ? "YES" : "NO") << nl;
using namespace std;
//=================================================
ll n,_cnv;
ll a[203],b[203];... | ALGO | 0.999962 | 4.569128 |
17b5f5ce-ba81-4040-aa33-e043f780a8ad | matt-chan/cpputil | src/linalg.cpp | namespace cpputil {
namespace linalg {
/**
* @param M the first tensor
* @param T the other tensor
* @param tolerance the tolerance for element-wise comparison
*
* @return if two rank-4 tensors are approximately equal with respect to a tolerance
*
* This function is implemented bec... | TOOL | 0.993586 | 6.349545 |
e93a2497-1a05-4d6d-b765-2c3fcf7dc395 | iamsiamhossen/Problem-Solve-2025 | B_Equalize.cpp | /**
* Author: iamsiamhossen
* Created: 15-07-2025 13:10:15
**/
#include <bits/stdc++.h>
using namespace std;
// fastread
#define fastread() (ios_base::sync_with_stdio(0), cin.tie(0))
// Shortcut
#define endl "\n"
#define int long long
#define float double
#define all(X) (X).begin(), (X).end()
#define Reverse(X) reve... | ALGO | 0.999655 | 5.254707 |
3ca2ac9a-b520-4832-b13a-7b4400ddc3f8 | alexandrocw/CP-training | Codeforces/339A_HelpfulMaths.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <sstream>
#include <string>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
string expression, res;
int n;
vector<int> arr;
stringstream Stream;
cin >> expression;
n = expression.size();
for(int ... | ALGO | 0.999909 | 4.095779 |
ee58dfea-f66a-4c80-b906-9d677f185fa1 | dseco/acmudec | AngeloZapata/Semestre2-2017/10130.cpp | #include <bits/stdc++.h>
using namespace std;
int max(int a, int b) { return (a > b)? a : b; }
int knapSack(int W, vector<int> wt, vector<int> val, int n){
int i, w;
int K[n+1][W+1];
for (i = 0; i <= n; i++){
for (w = 0; w <= W; w++){
if (i==0 || w==0) K[i][w] = 0;
else if (wt[i-... | ALGO | 0.999928 | 3.960683 |
3da3243e-cc94-425b-8859-0b39f252f3ab | NEGALITOR/csc245 | Labs/Lab06/radix.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
int maxElemLength(const vector<int>& v);
int GetDigit(int number, int k);
vector<queue<int> > ItemsToQueues(const vector<int>& L, int k);
vector<int> QueuesToArray(vector< queue<int> >& QA, int numVals);
void RadixSort(vector... | TEST | 0.999581 | 4.737976 |
5e602c57-1daa-452f-ae9b-0e72fed63589 | NSDie/algorithm-design | 剑指offer（c++）/孩子们的游戏(圆圈中最后剩下的数) .cpp | class Solution {
public:
int LastRemaining_Solution(int n, int m)
{
queue<int>q;
int i,j,tmp,flag=0;
for(i=0;i<n;i++)
q.push(i);
j=0;
while(!q.empty()){
if(j==m-1){
j=0;
q.pop();
}
else{
... | ALGO | 0.999957 | 5.63095 |
d6b5bc00-74a5-45cf-a2aa-17176f6f1522 | AlgoInHyeHwa/AlgoStudy | 0529/캐시/캐시_김태진.cpp | #include <string>
#include <vector>
#include <algorithm>
using namespace std;
int solution(int cacheSize, vector<string> cities) {
int answer = 0;
if(cacheSize == 0)
return cities.size() * 5;
vector<string> v;
for(int i = 0; i < cities.size(); i++){
int j;
transform(cities[i].b... | ALGO | 0.999372 | 5.263081 |
91f24584-d550-421e-b895-91326ba0fa81 | eriser/boost | libs/graph_parallel/test/distributed_connected_components_test.cpp | // Authors: Douglas Gregor
// Andrew Lumsdaine
#include <boost/graph/use_mpi.hpp>
#include <boost/config.hpp>
#include <boost/throw_exception.hpp>
#include <boost/serialization/vector.hpp>
#include <boost/graph/distributed/adjacency_list.hpp>
#include <boost/graph/connected_components.hpp>
#include <boost/g... | ALGO | 0.960905 | 6.339006 |
3515f6d4-cab8-4969-9876-854245a168b6 | Sowmik23/CompetitiveProgramming | Hacker_Connected Cell in a Grid.cpp | #include <bits/stdc++.h>
using namespace std;
int b[]={0,0,1,-1,1,1,-1,-1};
int c[]={1,-1,0,0,1,-1,-1,1};
int n,m,cnt;
int a[15][15];
int dfs_visit(int i,int j)
{
if(i<0 || i==n || j<0 || j==m) return 0;
if(a[i][j]!=1) return 0;
a[i][j]=0;
cnt++;
for(int l=0;l<8;l++)
{
dfs_visit(i+b[l],j+c[l]);
}
return cnt... | ALGO | 0.999917 | 4.069931 |
0eb4b3ee-4699-4479-9e3a-b45ad2b5ab3a | bjaxqq/SJP | recursionHomework.cpp | #include <iostream>
using namespace std;
int factorial(int num);
int main()
{
int n;
cout << endl;
cout << "Enter a number to get its factorial: ";
cin >> n;
cout << n << "! = " << factorial(n);
cout << endl;
return 0;
}
int factorial(int num)
{
if(num == 0)
{
return 1;
}
return num*fac... | ALGO | 0.914547 | 4.002329 |
34906129-562b-47ad-9799-f855a27eaafd | yeochi1201/SWProblemSolve | SolvedAC/1/2908.cpp | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string A, B;
int rA, rB;
cin >> A >> B;
reverse(A.begin(), A.end());
reverse(B.begin(), B.end());
rA = stoi(A);
rB = stoi(B);
if (rB < rA)
cout << rA << endl;
else cout << rB << endl;
} | ALGO | 0.999812 | 4.013631 |
c412ee3b-7555-4830-8bd8-d6cd1cc71567 | adehgha/ppm3d | Eigen/doc/examples/DenseBase_middleCols_int.cpp | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
int main(void)
{
int const N = 5;
MatrixXi A(N,N);
A.setRandom();
cout << "A =\n" << A << '\n' << endl;
cout << "A(1..3,:) =\n" << A.middleCols(1,3) << endl;
return 0;
}
| ALGO | 0.970311 | 3.133398 |
8750d7ec-1735-40bd-8ab0-ee50f81c88ff | ProPrak01/Spinning-Donut | rectangle.cpp | #include "bits/stdc++.h"
#include <chrono>
#include <thread>
using namespace std;
// test check: for rectangle
void print_rectangle(char rect_arr[][5])
{
system("clear");
for (int i = 0; i < 5; i++)
{
for (int j = 0; j < 5; j++)
{
cout << rect_arr[i][j] << " ";
}
... | ALGO | 0.97749 | 3.199072 |
1b517248-aac0-4efd-85c1-7cc789856fb2 | maricarmen5/jutge-my-repository | src/P66257.cpp | #include <iostream>
#include <vector>
using namespace std;
// solució de l'Element més freqüent sense utilitzar map
int dichotomic_search(const vector<int>& seq, int elem)
{
int ans = -1;
int min = 0;
int max = seq.size() - 1;
while (min <= max) {
int mid = min + (max - min)/2;
i... | ALGO | 0.999802 | 4.053069 |
63790dcb-289c-40d0-b3fb-b6013c04a0ff | Azure-Vani/acm-icpc | bzoj/1052.cpp | #include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
namespace Solve{
const long kMAX_ARRAY=21005;
const long inf=0x7fffffff;
struct pair{
long x,y;
}a[kMAX_ARRAY];
long n;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
long maxx=-inf,maxy=-inf,minx=inf,miny=inf;... | ALGO | 0.999936 | 4.120057 |
02c60b10-b2c2-4ddf-95e9-738fdd26d74e | ishandutta2007/codeforces | zhouzhendong/normal/1019/C.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1000005;
int read(){
int x=0;
char ch=getchar();
while (!isdigit(ch))
ch=getchar();
while (isdigit(ch))
x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
return x;
}
void write(int v){
int k=v/10;
if (v>9)
write(k);
putchar('0'+(v-k*10));... | ALGO | 0.999979 | 3.847927 |
2af4a205-3c65-4d2f-b46e-a4d66d5d05f5 | scoke0801/LanguageStudy | CodingTest/CodingTest/CollatzNum.cpp | #include <string>
#include <vector>
#include <iostream>
using namespace std;
int solution(int num) {
int answer = 0;
long long l = num;
while (l != 1) {
if (l % 2 == 0) {
l /= 2;
}
else {
l = l * 3 + 1;
}
++answer;
if (answer > 500) {... | ALGO | 0.999945 | 5.200626 |
2df48b05-4768-4a15-8a97-4121b8bea8b9 | 12114770/hdlc_playground | test.cpp | #include <boost/crc.hpp>
#include <cstring>
int main() {
boost::crc_32_type crc;
char const *data = "Hello, world!";
crc.process_bytes(data, std::strlen(data));
return crc.checksum() == 0xEBE6C6E6u ? 0 : 1;
} | TOOL | 0.850394 | 6.524333 |
730b9182-8b25-4435-aaf3-33cbaf94bafb | lbv/pc-code | solved/l-n/machined-surfaces/surfaces.cpp | #include <cstdio>
#define LINE 25
#define MAXN 12
char line[LINE + 1];
int spaces[MAXN];
int N;
int main()
{
while (true) {
scanf("%d", &N);
if (N == 0) break;
gets(line);
int lo = LINE;
for (int i = 0; i < N; ++i) {
int s = 0;
gets(line);
... | ALGO | 0.994109 | 3.573045 |
08e78608-fea3-4fe1-b67d-e29d92445205 | Rupesh597264/Cpp | Lab Manual o/Q14.cpp | #include<iostream>
#include<cmath>
using namespace std;
int main(){
int s=0;
int n;
cin>>n;
for(int i=1;i<=n;i++){
s=s+i;
}cout<<s<<" ";
return 0;
} | ALGO | 0.999472 | 3.533971 |
e7c5a251-86f4-4a2c-8748-be45e36c2403 | shekharbhide/DSA-Questions-CPP | 06_BINARY SEARCH/06_odd_occuring_elements_in_arr.cpp | #include<bits/stdc++.h>
using namespace std;
int solve(vector<int>arr){
int s =0 ;
int e=arr.size()-1;
int mid = s+(e-s)/2;
while(s<=e){
if(s==e){
return mid;
}
//TO HANDEL EVEN INDEX
if(mid % 2 == 0){
if(arr[mid] == arr[mid+1]){
... | ALGO | 0.999961 | 4.623894 |
0e954dcd-f7d3-48ae-a353-a73eb2b0d955 | vladvlad23/UBBComputerScienceBachelor | GraphAlgorithms/PracticalWork1-CPPBonus/Graph.cpp | //
// Created by Vlad on 21-Mar-19.
//
#include "Graph.h"
void Graph::addVertex(int vertex) {
if(existsVertex(vertex))
{
throw invalid_argument("Duplicate vertex");
}
vector<int> vector1;
vector<int> vector2;
mapIn.insert({vertex,vector1});
mapOut.insert({vertex,vector2});
}
void ... | ALGO | 0.987934 | 5.661632 |
38305686-3bf9-4160-a7ec-a945193e90e4 | kyunghoon/aws-sdk-sys | aws-sdk-cpp/aws-cpp-sdk-core/source/client/ClientConfiguration.cpp | #include <aws/core/client/ClientConfiguration.h>
#include <aws/core/auth/AWSCredentialsProvider.h>
#include <aws/core/client/DefaultRetryStrategy.h>
#include <aws/core/platform/Environment.h>
#include <aws/core/platform/OSVersionInfo.h>
#include <aws/core/utils/memory/AWSMemory.h>
#include <aws/core/utils/StringUtils.h... | TOOL | 0.85436 | 7.620095 |
8f455ed4-fe99-4784-8f07-314790ac09e3 | AlligatorTHPhat/Code_Practice | UpCoder/Algorithm/Greedy Algorithm/LUACHONCV.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Work
{
private:
int timeStart, timeEnd;
public:
Work() {}
Work(int st, int ed)
{
timeStart = st;
timeEnd = ed;
}
friend istream& operator >> (istre... | ALGO | 0.999969 | 4.744206 |
d1ef5b61-786f-4f0b-85aa-acb042a9322a | senanim0620/BOJ | C++/2108 통계학.cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> sena;
int main(void)
{
int N;
cin >> N;
int num = 0; //ü ϴ
int min=4000, max=-4000;
for (int i = 0; i < N; i++)
{
int input;
cin >> input;
if (max < input)
max = input;
if (min > input)
min = input;
num += input;
sena.push_bac... | ALGO | 0.999928 | 4.141538 |
54b12176-6931-403b-8c97-aebc2c74e81e | shikharvermasv/problem_solving | homework/dp10/matrix-chain-multiplication0303.cpp | class Solution{
public:
// -------------------recursion solution ----------------//
// int minop(int arr[] , int s , int e){
// if(s == e){
// return 0;
// }
// if(s+1 == e){
// return arr[s-1] * arr[s] * arr[e];
// }
// int mini = INT_MAX;
/... | ALGO | 0.999995 | 4.915876 |
3eecad4f-b862-4313-a6ce-6ac4b9a011d5 | arpitbuilds/DSA | 0083-remove-duplicates-from-sorted-list/0083-remove-duplicates-from-sorted-list.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* deleteDupli... | ALGO | 0.999936 | 5.674674 |
edf9aa17-3eca-4696-ad06-3e7f432c28a5 | 113bommy/deepmind_codecontests_refine | cpp_source_filter_file/cpp_train_10134_9.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<ld, ld>;
template <class T>
using vec = vector<T>;
using vb = vec<bool>;
using vi = vec<int>;
using vl = vec<ll>;
using vd = vec<ld>;
using ... | ALGO | 0.999617 | 4.109959 |
f0a0b7f7-bc68-4117-8beb-fa2e915fbf1e | n01e0/IDULLVM | libcxx/benchmarks/algorithms.bench.cpp |
#include <algorithm>
#include <cstdint>
#include <map>
#include <random>
#include <string>
#include <utility>
#include <vector>
#include "CartesianBenchmarks.h"
#include "GenerateInput.h"
#include "benchmark/benchmark.h"
#include "test_macros.h"
namespace {
enum class ValueType { Uint32, Uint64, Pair, Tuple, String... | TEST | 0.907189 | 7.182305 |
9c66f884-d5b2-4e10-b46d-b7b4f6d7000f | plusls/oj | cdoj/contests/UESTC 2017 Summer Training #16 Div.2/F/main.cpp | #include <bits/stdc++.h>
using namespace std;
int data[3005];
int main()
{
int T,n;
scanf("%d", &T);
while(T--)
{
int result = 1;
scanf("%d", &n);
for (int i = 0; i < n; ++i)
{
scanf("%d", &data[i]);
if (i > 0)
{
if (d... | ALGO | 0.999934 | 3.939084 |
66aac118-19a2-46ee-8f35-fe17b6c106c5 | cr7as7/Leetcode_solutions | 1878-check-if-array-is-sorted-and-rotated/check-if-array-is-sorted-and-rotated.cpp | class Solution {
public:
bool check(vector<int>& a) {
int n = a.size();
int seriesBreak = 0;
for (int i = 1; i < n; i++) {
if (a[i] < a[i - 1]) {
seriesBreak++;
}
}
if (a[n - 1] > a[0]) {
seriesBreak++;
}
r... | ALGO | 0.999953 | 5.553649 |
858c26a9-aaf7-4f80-a293-39abd1a4dfb4 | LeinadDemian/C-Coloquio | ejemplochat.cpp | #include <iostream>
using namespace std;
// Declaración de funciones y procedimientos
void contar(int, int, int&, int&, int&, int&, int&);
void contar(int num, int digito, int &nuevonum, int &ultimoDig, int &cantMax, int &cantMin, int &canIgual)
{
if (nuevonum > 0)
{
if (ultimoDig == digito)
{... | ALGO | 0.999076 | 3.343788 |
ec48cfeb-02e2-4fa2-a720-a3a0df3aefd8 | isaccanedo/ignite | modules/platforms/cpp/examples/compute-example/src/compute_example.cpp | #include <stdint.h>
#include <iostream>
#include <sstream>
#include <ignite/ignition.h>
#include <ignite/compute/compute.h>
using namespace ignite;
/*
* Function class.
*/
class CountWords : public compute::ComputeFunc<int32_t>
{
friend struct ignite::binary::BinaryType<CountWords>;
public:
/*
* Defau... | TOOL | 0.984996 | 7.20653 |
feba8507-4be5-4157-b437-efa52d9dc96d | www5sccs/peanoclaw | src/peanoclaw/runners/PeanoClawLibraryRunner.cpp | /*
* PeanoClawLibraryRunner.cpp
*
* Created on: Feb 7, 2012
* Author: Kristof Unterweger
*/
#include "peanoclaw/runners/PeanoClawLibraryRunner.h"
#include "peanoclaw/runners/Runner.h"
#include "peanoclaw/repositories/RepositoryFactory.h"
#include "peanoclaw/State.h"
#include "peanoclaw/configurations/PeanoC... | ALGO | 0.999586 | 4.610735 |
5856e7be-beb9-4ac5-8a30-e4e2150040b2 | Axichaos/Sample_repos | Sample_Project/Library/PackageCache/com.unity.ide.visualstudio@2.0.15/Editor/COMIntegration/COMIntegration~/COMIntegration.cpp | #include <iostream>
#include <sstream>
#include <string>
#include <filesystem>
#include <windows.h>
#include <shlwapi.h>
#include "BStrHolder.h"
#include "ComPtr.h"
#include "dte80a.tlh"
constexpr int RETRY_INTERVAL_MS = 150;
constexpr int TIMEOUT_MS = 10000;
// Often a DTE call made to Visual Studio can fail after ... | TOOL | 0.93924 | 6.969462 |
8c97c96a-6ec5-4f15-8fae-6a77b140e254 | leafeonia/leetcode | C++/code/1779.cpp | class Solution {
public:
int nearestValidPoint(int x, int y, vector<vector<int>>& points) {
int rec = INT_MAX;
int ans = -1;
for (int idx = 0; idx < points.size(); idx++) {
int i = points[idx][0], j = points[idx][1];
if (i == x || j == y) {
int dist = ... | ALGO | 0.99998 | 6.049904 |
f88e2541-b75c-4e6f-a072-754e5fb5e4de | OpenDigitalTwin-Dev/Particles | lammps/src/OPENMP/bond_gromos_omp.cpp | // clang-format off
/* ----------------------------------------------------------------------
Contributing author: Axel Kohlmeyer (Temple U)
------------------------------------------------------------------------- */
#include "omp_compat.h"
#include "bond_gromos_omp.h"
#include "atom.h"
#include "comm.h"
#include... | ALGO | 0.998512 | 6.815293 |
83e0d542-5ea6-4a3f-8ec8-ea61a4f3bfb3 | eduardofacf/Exercicios-logica-programacao--Cpp | menorDeTres/main.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, menor;
cout << "Primeiro valor: ";
cin >> a;
cout << "Segundo valor: ";
cin >> b;
cout << "Terceiro valor: ";
cin >> c;
menor = a;
if (b < a){
menor = b;
cout << "MENOR = " << menor << endl;
... | ALGO | 0.999665 | 3.641759 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.