uuid stringlengths 36 36 | repo_name stringlengths 5 123 | relative_path stringlengths 5 4k | content stringlengths 33 2.85M | category stringclasses 6
values | algo_rel_score float64 0.85 1 | quality_score float64 3 8.76 |
|---|---|---|---|---|---|---|
68dfd7ff-a829-400e-83cd-b777657554ef | ishandutta2007/codeforces | chen_zexing/normal/1244/D.cpp | #include <stdio.h>
#include<iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <climits>
#include <set>
#include <unordered_map>
#include <map>
#include <stack>
#include <unordered_set>
#define hash hassh
using namespace std;
int c[4][100005... | ALGO | 0.999923 | 3.608773 |
d9e673ac-9295-41f5-8c92-8ecf0ba0251a | Umais-Ah/OOPS-LAB | lab 4/task-5.cpp | #include <iostream>
using namespace std;
class convert {
private:
int number;
string lessthan[20] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight",
"nine","ten","eleven","twelve","thirteen", "fourteen", "fifteen",
"sixteen", "seve... | TOOL | 0.965256 | 5.00766 |
4ce059ab-94b5-4622-a681-fe3f3b8cab27 | PrashanthPak/Security_module | 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.998799 | 6.776823 |
1b1c338f-0bbe-4bfc-9712-ff5e5ddc9a59 | joker-eph/llvm-project-with-mlir | llvm/lib/CodeGen/RegAllocFast.cpp | #include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/IndexedMap.h"
#include "llvm/ADT/SmallSet.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/SparseSet.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/CodeGen/MachineBasicBlock.h"
#include "llvm/CodeGen/MachineFrameInfo.h"
#include ... | TOOL | 0.937041 | 3.429798 |
6589b78f-4a15-4cb3-819c-0c04f229b803 | henesy/cs327 | hinchee_sean.assignment-1.07/monsters.cpp | #include <stdio.h>
#include <stdlib.h>
#include "dungeon_generator.h"
#include "binheap.h"
/* check if we can move to a location (objectively) */
Bool test_loc(Dungeon * dungeon, int x, int y, Sprite *s) {
if(x > 0 && x < dungeon->w-1 && y > 0 && y < dungeon->h-1) {
int hard = dungeon->d[y][x].h;
if(dungeon->d[y]... | ALGO | 0.910256 | 3.806196 |
d0ab8d6e-7344-4950-8d2a-75ce7da86c92 | lamphanviet/competitive-programming | uva-online-judge/accepted-solutions/112 - Tree Summing.cpp | //*****************
// LAM PHAN VIET **
// UVA 112 - Tree Summing
// Time limit: 3s
//********************************
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <stack>
using namespace std;
#define For(i, a, b) for (int i=a; i<=b; i++)
#define i64 long long
int SUM;
bool ye... | ALGO | 0.999666 | 3.612912 |
e72cc0d7-42e2-41cc-af9c-aaa257aafdef | Sincer1ty/Algorithm | 2025_04/lc_2845/lc_2845_seonghui.cpp | #include <vector>
#include <unordered_map>
using namespace std;
class Solution {
public:
long long countInterestingSubarrays(vector<int>& nums, int modulo, int k) {
long long result = 0, cnt = 0;
unordered_map<int, long long> dict;
dict[0] = 1;
for (int i = 0; i < nums.size(); i++) {
if (nums[i] % mod... | ALGO | 0.999934 | 5.347608 |
7a20e391-4665-4de1-a5e2-249a5465dd20 | Vishnu-Gaddime/QML_Calculator | evalExpression.cpp | #include <string>
#include <iostream>
#include <regex>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int precedence(char op) {
switch (op) {
case '-':return 2;
case '+':return 2;
case '/':return 3;
case '*':return 3;
}
return -1;
}
char ass... | ALGO | 0.998772 | 3.994127 |
75578dfc-a4d5-4307-98fe-a0d2d1466355 | zzzkkkyyy/PAT-Advanced | 1021.cpp | #include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <set>
using namespace std;
class Graph
{
private:
int *father;
bool *isVisited;
int num;
map<int, vector<int> > graph;
set<int> deepestRoot;
int maxHeight;
vector<int> maxh;
public:
Graph() : maxHeight(0)... | ALGO | 0.999924 | 4.850001 |
c68ff506-051b-4c4b-83c7-9eaa317a5ce2 | suyoumo/DeepClaude_Benchmark | src/2025-02-24-deepclaude-rust/cpp/exercises/practice/all-your-base/all_your_base.cpp | #include "all_your_base.h"
#include <algorithm>
#include <stdexcept>
namespace all_your_base {
std::vector<unsigned int> convert(unsigned int input_base, const std::vector<unsigned int>& digits, unsigned int output_base) {
if (input_base < 2 || output_base < 2) {
throw std::invalid_argument("Invalid base"... | ALGO | 0.981058 | 6.932879 |
d3c96525-8c3a-4245-b3eb-b5cf116ebaf0 | rvgpu/rvgpu-llvm | libcxx/test/std/algorithms/alg.modifying.operations/alg.move/ranges.move.pass.cpp | // <algorithm>
// UNSUPPORTED: c++03, c++11, c++14, c++17
// UNSUPPORTED: GCC-ALWAYS_INLINE-FIXME
// template<input_iterator I, sentinel_for<I> S, weakly_incrementable O>
// requires indirectly_movable<I, O>
// constexpr ranges::move_result<I, O>
// ranges::move(I first, S last, O result);
// template<input_r... | TEST | 0.933797 | 5.518602 |
bbe29b16-dc16-4b3c-895b-cd935bb4166f | Vinitj088/Leetcode | RemoveElement.cpp | class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int newSize = 0;
for(int i = 0; i < nums.size(); i++) {
if(nums[i] != val) {
nums[newSize] = nums[i];
newSize++;
}
}
return newSize;
... | ALGO | 0.999789 | 6.350126 |
b33fbd13-eeb6-48ff-a959-2252077a8c72 | danteisalive/gem5-cap | src/systemc/tests/systemc/misc/synth/blast/blast3/blast3.cpp | /*****************************************************************************
blast3.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/*****************************************************************************... | TOOL | 0.973663 | 4.177979 |
c9bd98d7-347b-4b8a-958b-e0967b410cd7 | pbysu/BOJ | ~2017/9518.cpp | #include <iostream>
#include <algorithm>
using namespace std;
char check[52][52];
int a[2] = { 1,-1 };
int main() {
int col, row;
scanf("%d %d", &col, &row);
getchar();
for (int i = 1; i <= col; i++) {
for (int j = 1; j <= row; j++) {
scanf("%c", &check[i][j]);
}
getchar();
}
int MAX = 0;
int temp... | ALGO | 0.998854 | 3.747633 |
c3a4e8b4-0a1c-4ca4-8c7b-b4491e5ad46e | sarvex/leetcode-csh | solution/1700-1799/1760.Minimum Limit of Balls in a Bag/Solution.cpp | class Solution {
public:
int minimumSize(vector<int>& nums, int maxOperations) {
int left = 1, right = *max_element(nums.begin(), nums.end());
while (left < right) {
int mid = (left + right) >> 1;
long long cnt = 0;
for (int x : nums) {
cnt += (x -... | ALGO | 0.999942 | 6.001356 |
08cf1da5-9928-4e4f-9c6a-b8c254f26be6 | ankeshbanerjee/cpp-and-dsa | 12 Char arrays, strings/12_09_max_occuring_character_of_a_string.cpp | #include <iostream>
using namespace std;
char getMaxOccCharacter (string str){
int arr[26] = {0};
int num;
for (int i=0; i<str.length(); i++){
if(str[i] >= 'a' && str[i] <= 'z'){
num = str[i] - 'a';
arr[num]++;
}
else{
num = str[i] - 'A';
... | ALGO | 0.999894 | 4.707315 |
138a3e8f-2ee2-4eb2-850d-727ff9866e09 | AnkitDubey040/CPP_Algos | Algorithms/Sorting/bubble_sort.cpp | #include <iostream>
unsigned int readLength() {
unsigned int length;
std::cin >> length;
return length;
}
void readArray(int array[], unsigned int length) {
for (int i = 0; i < length; i++)
std::cin >> array[i];
}
void bubbleSortArray(int array[], unsigned int length) {
bool changed... | ALGO | 0.999576 | 4.871482 |
5fc15b25-cf4b-42d4-b0f0-7c17484ef451 | Ajanthan05/myCPP | Basics/leedcode/22_4SUM.cpp | #include <iostream>
#include <vector>
#include <climits>
#include <queue>
#include <utility>
#include <algorithm>
#include <stack>
using namespace std;
vector<vector<int>> fourSum(vector<int>& nums, int target) {
int n = nums.size();
vector<vector<int>> ans;
if (nums.empty()) return ans;
sort(nums.be... | ALGO | 0.999914 | 5.503393 |
5845df8c-9693-4fdb-a992-4c0466726a91 | hiteshnatha15/GFG | Medium/Search in a Rotated Array/search-in-a-rotated-array.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
int search(int A[], int l, int h, int key)
{
// l: The starting index
// h: The ending index, you have to search the key in this range
//complete the function ... | ALGO | 0.99989 | 5.960772 |
53718647-e84a-4419-8cab-0427c9b5bda0 | DominikFritsch/Code.01-Programmieren1 | Programmieren1/AufgabeSkript1_155/AufgabeSkript1_155.cpp | /* Projekt AufgabeSkript1_155 */
/* Aufgabe:
Schreiben Sie ein C++ Programm, welches von der Tastatur eine Zahl als
String seinliest.
Prfen Sie zunchst, ob wirklich alle Zeichen dieses Strings saus Ziffern
bestehen. Falls dies zutrifft, prfen Sie, ob die so in sabgespeicherte
Dezimalzahl bei Spie... | ALGO | 0.935282 | 5.614413 |
f5886926-fce0-4146-9856-9ed5382d33a6 | teche74/Daily_Practise | 0496-next-greater-element-i/0496-next-greater-element-i.cpp | class Solution {
public:
vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
unordered_map<int,int>map;
stack<int>st;
int size = nums2.size();
for(int i = size-1; i>= 0; i-- ){
while(st.size() && st.top() <= nums2[i]){
st.pop();
... | ALGO | 0.999782 | 5.858572 |
919a602b-80ae-4616-9f03-69e9e4e83c37 | HPhuonghub/code-cpp | code c++/kiem tra duong di.cpp | #include <bits/stdc++.h>
using namespace std;
int n,m,u,U;
bool chuaxet[1005];
vector<int> List[1005];
void DFS(int u){
chuaxet[u]=false;
for(int v: List[u]){
U=List[u][v];
if(chuaxet[v]) DFS(v);
}
}
int main(){
int t,i;
cin >> t;
while(t--){
memset(chuaxet,true,sizeof(chuaxet));
for(i=0;i<1005;i++) List[... | ALGO | 0.999973 | 4.416254 |
59351cec-b755-4f12-9f3a-93ed81e8d0a2 | xenharmonic/Cpp-Learning-Progress | simple_calculator_single_digits/simple_calculator_single_digits.cpp | #include <iostream>
#include <vector>
using namespace std;
double add(double a, double b) { return a + b; }
double subtract(double a, double b) { return a - b; }
double multiply(double a, double b) { return a * b; }
double divide(double a, double b) { return a / b; }
char choose_operation() {
bool allowed = f... | TOOL | 0.869356 | 4.406657 |
9d65d775-06f4-4faa-88de-28c3fe45a574 | bhavyarajanita/Data-Structures | Sorts/quickSort.cpp | #include <iostream>
using namespace std;
int partition(int arr[], int low, int high){
int pivot = low, i = low, j = high;
while (i < j)
{
while (arr[i] <= arr[pivot] && i < high)
{
i += 1;
}
while (arr[j] > arr[pivot] && j > low)
{
j -= 1;
... | ALGO | 0.999892 | 5.525814 |
18bf89dd-69f5-4783-ba8d-972d0a3fd2c1 | Codernob/problem-solving-codes | code/graph/test.cpp | #include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define VISITED 1
#define UNVISITED 0
int V=10; //number of Vertices
vector<vii> AdjList; //Adjecency List
//(vector of integer pairs to store... | ALGO | 0.999992 | 4.034598 |
38221735-dc64-438a-891f-81e2b96a762e | jayus71/datastruct | Sort/sortTest.cpp | //
// Created by Jayus on 2022/11/8.
//
#include "sort.h"
#include <stdlib.h>
void swap(ElemType &a,ElemType &b){
ElemType temp = a;
a = b;
b = temp;
}
int Partition_Random(ElemType A[], int low, int high){
if(low > high)
return -1;
int randIndex = low + rand() % (high - low + 1);
swap(A[randIn... | ALGO | 0.999012 | 4.534547 |
812db8c8-1f64-4c04-a7c5-9588bd87b384 | Fliw/tutorial_cpp | Project & Example/ProjectLingkaran.cpp |
// Membuat lingkaran
#include <bits/stdc++.h>
using namespace std;
// Fungsi membuat lingkaran
void printPattern(int radius) {
// Nilai tengah dari lingkaran
float dist;
// Arah Horizontal
for (int i = 0; i <= 2 * radius; i++) {
// Arah Vertikal
for (int j = 0; j <= 2 * radius; j++) {... | ALGO | 0.999879 | 5.323669 |
e732e11f-92ee-468d-b1fd-de5edc1d9922 | aw-junaid/Computer-Science | Programming Fundamentals/Cplusplus/Cplusplus Programming/Program to check given year is leap or not.cpp | #include <iostream>
using namespace std;
int main() {
int year;
cout << "Enter a year: ";
cin >> year;
if ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0) {
cout << year << " is a leap year.";
} else {
cout << year << " is not a leap year.";
}
return 0;
}
| ALGO | 0.9994 | 3.751029 |
93bf7b9e-a5f1-4c14-ad19-edbf9ca6a61e | caoshen/codehdu | 1289.cpp | /** 1289
**/
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main () {
float d;
while (scanf("%f", &d) != EOF) {
float d0 = 1.0, fra;
int t = 0;
if (d == 0) {
printf("0 0\n");
continue;
}
if (abs(d) >= 1) {
while (d0 <= abs(d)) {
d0 *= 2;
++t;
}
d0 /= ... | ALGO | 0.999694 | 3.209894 |
e3bb68b4-b6ab-4b46-ae68-aaa8774b78d4 | koosaga/olympiad | JOI/joi14b.cpp | #include <cstdio>
#include <cstring>
#include <algorithm>
int m,n,a[10005];
int sm[10005];
int bv[505],bc[505];
int dp[505][10005];
int cmp(int a, int b){return a>b;}
int f(int pos, int got){
if(pos == n || got >= m) return sm[got<m?got:m];
if(dp[pos][got]) return dp[pos][got];
return dp[pos][got]=s... | ALGO | 0.999916 | 3.085922 |
dcf1ebcf-84c0-46ee-9a08-b276f2a3d994 | LastWinter24/lab1.4 | while1/main.cpp | #include <iostream>
#include "Rem.h"
using namespace std;
int main() {
setlocale(LC_ALL, "RU");
int A, B;
cout << "Введите положительное число A: ";
cin >> A;
cout << "Введите положительное число B (B должно быть меньше A): ";
cin >> B;
int remainingLength = findRemainingLength(A, B);
co... | ALGO | 0.993906 | 4.181748 |
9b99b4c9-59e3-456b-875e-b03c428940c8 | imgullu786/DSA-Concepts-Ques | Backtracking/Subsets II.cpp | /*
Company Tags : Snapdeal
Leetcode Link : https://leetcode.com/problems/subsets-ii/
*/
class Solution {
public:
void generate(vector<int>& nums, vector<int> sub, vector<vector<int>>& result, int start) {
result.push_back(sub);
for(int i = start; i<nums.size(); i++) {
... | ALGO | 0.99995 | 6.178891 |
c0d34a26-39c4-4151-a3cd-de8416d28361 | pinaky/aims-2016 | src/proposalscheduler_constantrwmhisotropicnormal.cpp | #include "proposalscheduler_constantrwmhisotropicnormal.h"
namespace aims
{
ProposalScheduler_ConstantRWMHIsotropicNormal::
ProposalScheduler_ConstantRWMHIsotropicNormal(double stddev): stddev_(stddev) { }
std::unique_ptr<Proposal> ProposalScheduler_ConstantRWMHIsotropicNormal::Solve(
ChainDat... | ALGO | 0.984711 | 4.477232 |
ea28936f-7168-4d61-b2dd-3e0eac8626be | bingdongliu/programming-library | string/suffix-array.cpp | vector<int> suffix_array(const string& s) {
vector<int> sa(s.size()), cc(s.size());
int n = s.size();
for (int i = 0; i < n; i++)
sa[i] = n - i - 1, cc[i] = s[i];
stable_sort(sa.begin(), sa.end(), [&s](int i, int j) {
return s[i] < s[j];
});
for (int k = 1; k < n; k <<= 1) {
vector<int> cc_(cc)... | ALGO | 0.999867 | 5.917278 |
a36cafbf-334b-4979-9c06-4f62f93ed19c | jens-jin/test | project/tools/c/tcpgetfiles.cpp | /*
* 程序名：tcpgetfiles.cpp，采用tcp协议，实现文件下载的客户端。
* 作者：吴从周。
*/
#include "_public.h"
// 程序运行的参数结构体。
struct st_arg
{
int clienttype; // 客户端类型，1-上传文件；2-下载文件。
char ip[31]; // 服务端的IP地址。
int port; // 服务端的端口。
int ptype; // 文件下载成功后服务端文件的处理方式：1-删除文件；2-移动到备份目录。
char s... | TOOL | 0.889018 | 4.054192 |
32d069b7-ea46-4609-86f6-c4553f299f6a | yuki-t-2019/algorithm-study-guide | dynamic_programming/dp/test/test_dp.cpp | #include <gtest/gtest.h>
#include "src/dp.h"
class DpTest : public ::testing::Test {
protected:
std::vector<Item> items;
int max_weight;
void SetUp() override {
// Initialize common resources for tests
}
void TearDown() override {
// Clean up common resources for tests
}
};
TEST_F(DpTest, Basic... | TEST | 0.966714 | 7.40249 |
3c62a5d1-5aa1-435a-a7a2-f4291af509ef | aangel4/AngelAaron_CSC5_43952 | Hmwk/Assignment 1/Gaddis_8thEd_Chap2_prob3/main.cpp | /*
* File: main.cpp
* Author: Aaron Angel
*
* Created on March 8, 2015, 7:31 PM
* Purpose: 3rd Homework Problem
*/
#include <iostream>
using namespace std;
//User Libraries
//Global Constants
//Function Prototypes
//Sales Tax
int main(int argc, char** argv) {
//set floating point output
... | ALGO | 0.937998 | 4.145906 |
532eb9a1-1eee-4e77-867e-ab9071cd0e87 | aslezar/CompetitiveProgramming | LeetCode/Daily/Mar23/28Mar23.cpp | #include <iostream>
#include <vector>
#include <climits>
using namespace std;
#define el << '\n'
#define ws << ' '
class Solution
{
public:
int mincostTickets(vector<int> &days, vector<int> &costs)
{
int n = days.size();
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
for (int i = ... | ALGO | 0.999335 | 4.728888 |
f1d3dc6a-da6c-4dc8-bd38-a4877764a155 | EverestOS-AOSP/system_extras | simpleperf/runtest/function_fork.cpp | #include <stdlib.h>
#include <sys/wait.h>
#include <unistd.h>
constexpr int LOOP_COUNT = 100000000;
volatile int a[2];
void ParentFunction() {
volatile int* p = a + atoi("0");
for (int i = 0; i < LOOP_COUNT; ++i) {
*p = i;
}
}
void ChildFunction() {
volatile int* p = a + atoi("1");
for (int i = 0; i < ... | TOOL | 0.958377 | 5.175117 |
18558a75-4f4a-4f7e-b878-b0c603267109 | shindechandrakant/data-structure-Algo | DP/subset-sum-n.cpp | #include<iostream>
#include<math.h>
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define MOD 1000000007
#define vi vector<int>
void display(bool **arr, int n, int m) {
// for(int i = 0; i <= m; i++)
// cout<<i<<" ";
// cout<<endl;
for(int i = 0; i <= n; i++) {
for(int j = 0;... | ALGO | 0.999955 | 4.304218 |
6708335b-2233-4036-97e2-9107d91dbd1b | vkansal9/Algorithms | CPP/dataStructure/Queue Using Array.cpp | #include <iostream>
using namespace std;
int queue[10];
int front = 0;
int rear = 0;
void Enque(int x)
{
if (rear == 10)
{
cout << "\nOverflow";
}
else
{
queue[rear++] = x;
}
}
void Deque()
{
if (front == rear)
{
cout << "\nUnderflow";
}
else
{
cout << "\n"
<< queue[front++] << " deleted";
... | ALGO | 0.991806 | 4.130556 |
e15cdb53-1931-4e60-94aa-eff7c2349abc | shreyaschavhan/100-days-of-code | Day 036 - 6th November 2020/Day-014-scope.cpp | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
class Difference {
private:
vector<int> elements;
public:
int maximumDifference;
// Add your code here
Difference(vector <int> a){
elements = a;
}
int computeDifferen... | ALGO | 0.999632 | 4.170537 |
d189db49-1bb7-4993-9c8d-25445c6f4de3 | Yaohui1996/ASimpleNNCMake | include/eigen-3.3.8/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_reductions_norm.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace std;
using namespace Eigen;
int main()
{
VectorXf v(2);
MatrixXf m(2,2), n(2,2);
v << -1,
2;
m << 1,-2,
-3,4;
cout << "v.squaredNorm() = " << v.squaredNorm() << endl;
cout << "v.norm() = " << v.norm() << endl;
cout << "v.lpN... | ALGO | 0.997617 | 4.03798 |
e04b7379-da94-4077-bb55-2b6863190fb0 | vinayak501/DSA_CPP | nth_root_of_M_BS.cpp | //
// Created by vinayak on 07-07-2024.
//
using namespace std;
int multiplier(int i,int n) {
int ans = 1;
for (int a=0;a<n;a++) {
ans *= i;
}
return ans;
}
int nthRootOfM(int n,int m) {
int low = 1;
int high = m;
while (high >= low) {
int mid = (high+low)/2;
if (mu... | ALGO | 0.999967 | 5.356336 |
29c8155c-2f5b-4af3-b53c-9d611f855dcf | elhamAm/faceMorphing | libigl/tutorial/303_LaplaceEquation/main.cpp | #include <igl/boundary_facets.h>
#include <igl/colon.h>
#include <igl/cotmatrix.h>
#include <igl/jet.h>
#include <igl/min_quad_with_fixed.h>
#include <igl/readOFF.h>
#include <igl/setdiff.h>
#include <igl/slice.h>
#include <igl/slice_into.h>
#include <igl/unique.h>
#include <igl/opengl/glfw/Viewer.h>
#include <Eigen/Sp... | ALGO | 0.998694 | 6.359447 |
18c5bf43-0ae9-4eb9-89d3-63e25e94512b | rahulsuwasiya/quizapp | 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.998784 | 6.761023 |
bfbf3cd0-fc9c-40be-9d99-6b14733517f6 | ZrjaK/algorithm | OJ/vjudge/HDU-3949.cpp | #pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define i128 __int128
#define ld long double
#define ui unsigned int
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd ... | ALGO | 0.999907 | 4.733328 |
7b095a64-1783-4f2a-b8cf-e58582084c05 | lachlankuhr/simd-resources | examples/matrixAddition.cpp | #include <iostream>
#include <immintrin.h>
float vsum(float *vectorInput, int n) {
__m128 vv, vectorHold;
float sum = 0.0f;
int i;
vectorHold = _mm_setzero_ps();
for (i = 0; i < n - 4 + 1; i += 4) {
vv = _mm_loadu_ps(&vectorInput[i]);
vectorHold = _mm_add_ps(vv, vectorHold);
}
sum = vectorHold[0] ... | ALGO | 0.999949 | 4.836991 |
d641cb7b-d071-4fa9-a804-116d894c168d | SuvitKumar003/DSA-QUESTION-S | Arrays/maximum_subarray_efficient.cpp | #include<iostream>
using namespace std;
int maxSubarraySum(int arr[],int n)
{
int maxEnding=arr[0];
int res=arr[0];
for(int i=1;i<n;i++)
{
maxEnding=max(maxEnding+arr[i],arr[i]);
res=max(res,maxEnding);
}
return res;
}
int main()
{
int arr[]={-1,-2,-3,-4};
cout<<"The maximum subarray sum is: "<<maxSubarraySum... | ALGO | 0.999897 | 4.814585 |
2d7a88f2-2f5b-4d12-8740-b5862bd68c0b | mijinko17/competitive-programming | Atcoder/ABC/151/d.cpp | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
//ただの辺
struct edge {
using lint = long long int;
int to;
lint cost;
//引数一つの時は距離1
edge(int t, lint c = 1) : to(t), cost(c) {
}
};
// warshall_floyd
// dは隣接行列(long long intを使うこと)
void warshall_floyd(vector<vector<long long int... | ALGO | 0.999764 | 4.090335 |
14326568-538c-44be-811e-abb7860177c4 | Sami-115667/Design-Analysis-and-Algorithm | DAA/MyPractice/BFS.cpp | #include <bits/stdc++.h>
using namespace std;
const int N =1e5+2;
bool visited[N] ={0};
vector<int>adj[N];
void BFS(vector<int> adj[N],bool visited[N],int start,int node){
queue<int>q;
q.push(start);
visited[start]=true;
while (!q.empty()) {
int x=q.front();
q.pop();
cout<<x<<" ... | ALGO | 0.999965 | 4.43333 |
fb5da4f3-778d-4157-9b1c-ef973aca7b8b | paridhigulati/LeetCode | 994-rotting-oranges/994-rotting-oranges.cpp |
class Solution {
public:
int orangesRotting(vector<vector<int>>& grid) {
int m = grid.size();
int n = grid[0].size();
int fresh = 0, time = -1;
vector<pair<int, int>> dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
queue<pair<int, int>> q;
... | ALGO | 0.999985 | 6.282892 |
7d867520-d55c-4be7-9406-516a3101831b | writecoffee/random_practice | cpp/code/9.1.cpp | #include <iostream>
using namespace std;
typedef int array_a[10];
typedef int array_b[3];
int exact_len = 5;
static int *merge(int a[], int &len_a, const int b[]) {
int i = len_a - 1, j = sizeof(array_b) / sizeof(int) - 1, k = sizeof(array_a) / sizeof(int) - 1;
while (i >= 0 && j >= 0) {
if (a[i] < b[j]) { a[k--]... | ALGO | 0.998611 | 3.762998 |
4c5a701d-17f7-4dc3-a1b4-f1cf3c326e46 | pc4covid19/virion2replication | src/core/PhysiCell_standard_models.cpp | /*
*/
#include "PhysiCell_standard_models.h"
#include "PhysiCell_cell.h"
namespace PhysiCell{
bool PhysiCell_standard_models_initialized = false;
bool PhysiCell_standard_death_models_initialized = false;
bool PhysiCell_standard_cycle_models_initialized = false;
Cycle_Model Ki67_advanced, Ki67_basic, live, ap... | TOOL | 0.913379 | 4.857011 |
65879ba0-f748-4988-94e0-4f2de976afd5 | SuyashJoshi179/ProgramsForProblems | codeforces/839/C.cpp | #include <bits/stdc++.h>
#include <random>
#include <fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<double, double> pd;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll... | ALGO | 0.999691 | 3.536551 |
b4a5b139-e4cb-454c-8473-dcb92e2d20d4 | chenqwwq/_algorithm | src/top.chenqwwq/leetcode/daily/_2022/_20220328/binary-number-with-alternating-bits.cpp | //
// Created by 陈炳鑫 on 2022/3/28.
//
#include "bits/stdc++.h"
#include "common.h"
using namespace std;
class Solution {
public:
bool hasAlternatingBits(int n) {
while (n != 0) {
if (!((n & 1) ^ ((n >> 1) & 1))) return false;
n >>= 1;
}
return true;
}
}; | ALGO | 0.999839 | 5.522877 |
f750984b-394e-4679-8080-8be9c706f53b | ashishj12/Basic-cpp | Matrix/MatrixAddition.cpp | #include <bits/stdc++.h>
#define N 4
using namespace std;
//Subtraction of two Matrices
void AddMat(int A[][N], int B[][N], int C[][N]){
int i,j;
for(i=0;i<N;i++){
for(j=0;j<N;j++){
C[i][j]=A[i][j]+B[i][j];
}
}
}
int main(){
int A[N][N] = { {1, 1, 1, 1},
... | ALGO | 0.999944 | 3.645572 |
771aab01-bf83-41c5-9f65-98e95211f4fa | mortennobel/SuiteSparse_Apple | SPQR/Source/spqr_rcount.cpp | // =============================================================================
// === spqr_rcount =============================================================
// =============================================================================
// Count the number of explicit nonzeros in each column of R. Exact zero
//... | ALGO | 0.982635 | 5.125322 |
4c270c1b-feef-478e-a6d4-be04de29240e | ayushbdkt-01/Striver-A2Z-DSA-Sheet | Binary Search on Answers/KthMissingNumber.cpp | #include<bits/stdc++.h>
using namespace std;
void brute(int a[],int n,int k){
int maxx=a[n-1];
int count=0;
for(int i=1;i<maxx;i++){
bool isPresent=false;
for(int j=0;j<n;j++){
if(i==a[j]) isPresent=true;
}
if(isPresent==false) count++;
if(count==k) cout<... | ALGO | 0.999967 | 3.943784 |
e89c59c7-ae26-43d1-b074-b678a4f5ae9d | ysonggit/leetcode | decode_ways.cpp | #include "utils.h"
#include <gtest/gtest.h>
using namespace std;
/*
DP:
Define D[i] : number of ways to decode first i characters of s
# of decode s[1:i] = # of decode s[1:i-1] if s[i] is not a valid char (10,20)
or = # of decode s[1:i-1] + # of decode s[1:i-2] if s[i-2:i-1] is valid (12)
ba... | TEST | 0.985003 | 5.3002 |
1cba268c-e3e1-45af-be0b-5663b0f969b5 | Swarnim2410/LeetCode-POTD | 12Dec.cpp | class Solution
{
public:
int maxProduct(vector<int> &nums)
{
int x = *max_element(nums.begin(), nums.end());
int f = 0;
int m = 0;
for (int i = 0; i < nums.size(); i++)
{
if (x == nums[i] && f == 0)
{
f = 1;
}
... | ALGO | 0.999917 | 5.255294 |
81470e74-1ea7-4545-a439-6bfa5fad2c6c | mohitkadwe19/leetcode-solutions | split-with-minimum-sum.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
int splitNum(int num)
{
string str = to_string(num), a = "", b = "";
sort(str.begin(), str.end());
for (int i = 0; i < str.length(); i += 2)
{
a += str[i];
}
for (int i = 1; i < str.length(); i += 2)
{
... | ALGO | 0.9999 | 5.535123 |
c360633b-012e-405a-bcff-643334d7e1d9 | ioncoincoreorgOLD/ion | src/ion-tx.cpp | #include "base58.h"
#include "clientversion.h"
#include "coins.h"
#include "core_io.h"
#include "keystore.h"
#include "primitives/block.h" // for MAX_BLOCK_SIZE
#include "primitives/transaction.h"
#include "script/script.h"
#include "script/sign.h"
#include "ui_interface.h" // for _(...)
#include <univalue.h>
#include ... | TOOL | 0.918082 | 3.57683 |
eb94fa5a-63d8-495d-85a8-8bdc4942462a | hakank/hakank | gecode/drive_ya_nuts.cpp | /*
Drive Ya Nuts puzzle in Gecode.
From http://www.samstoybox.com/toys/DriveYaNuts.html
"""
The Drive Ya Nuts puzzle by Milton Bradley was cool and quite difficult. The object of
the puzzle is to place all seven nuts such that the numbers on all sides of each
nut match the numbers on the adjoining nut. ... | ALGO | 0.999734 | 7.735629 |
7a8aa21d-a621-40a6-b1fb-f2b52de8581c | ShaizaHamid/loops | hollowpyramid.cpp | #include <iostream>
using namespace std;
int main() {
int i, j, k;
for (i = 1;i <= 5;i++) {
for (j = 1;j <= 5 - i;j++) {
cout << " ";
}for (k = 1;k <= i * 2 - 1;k++) {
if (i == 5 || k==1||k==2*i-1) {
cout << "*";
}
else
... | ALGO | 0.998615 | 3.472215 |
ac3efd16-885b-4488-93b8-fe0e040e4cc6 | Lamster1111/MazeRunnerGame | MazeRunner/SDL_Project20.2.2/SDL_Project/Randomizer.cpp | #include <time.h>
#include <stdlib.h>
#include <cmath>
#include "Randomizer.h"
using namespace MATH;
Randomizer::Randomizer() {
seed = static_cast<long>(time(nullptr));
ran1idnum = -seed;
qd2idnum = -seed;
}
Randomizer::Randomizer(long seed_) {
seed = seed_;
ran1idnum = -seed_;
qd2idnum = -static_cast<int>(see... | TOOL | 0.995428 | 4.427041 |
53dd13ba-b5ff-4a85-828a-fc822a12c9b7 | rubenglezortiz/Proyectos2-2020-21 | PaintlLess/Assets/components/DieAfterXTurns.cpp | #include "DieAfterXTurns.h"
#include "../ecs/Entity.h"
#include "FramedImage.h"
#include "Movimiento.h"
#include "Attack.h"
void DieAfterXTurns::finTurno()
{
turnsToDie--;
if (turnsToDie <= 0)
{
Movimiento* mov = this->entity_->getComponent<Movimiento>();
Attack* at = this->entity_->getComponent<Attack>();
if... | TOOL | 0.91511 | 4.627426 |
202658b2-2492-4dbc-a7ac-266bb18788bd | jiun0507/Interview-prep | Baekjoon/DFSBFS.cpp | //baekjoon 1260
//DFS and BFS implemented using edge list(count array) and linked list(vector)
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
int n, m;
bool connection1[1001][1001];
vector<int> connection2[1001];
vector<pair<int, ... | ALGO | 0.99999 | 4.130322 |
4fc42103-9838-4105-8997-f04cfe1b0469 | maleoaje/dairy_mgt | 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 |
ed5aceb6-83a8-4359-98d8-4abb4ad5ba68 | vinhhung053/UIT-ALGO-BOOTCAMP | 725.5 LATOKEN Round 1/B.cpp | #include <bits/stdc++.h>
#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 SET(a,x) memset((a),x,sizeof(a))
#define mod 998244353LL
#define base 311LL
#define big 500000
#define fi first
#define se second
#define mp make_pair
#define all(a) a.begin(),a.end()
#define getbit(n, i... | ALGO | 0.999716 | 4.151324 |
284e147d-9d6d-4b89-8059-1d6e69cec012 | sapusmedia/LevelSVG | libs/Box2D/Dynamics/Contacts/b2PolygonAndCircleContact.cpp | #include <Box2D/Dynamics/Contacts/b2PolygonAndCircleContact.h>
#include <Box2D/Common/b2BlockAllocator.h>
#include <Box2D/Dynamics/b2Fixture.h>
#include <new>
using namespace std;
b2Contact* b2PolygonAndCircleContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)
{
void*... | ALGO | 0.978659 | 7.220708 |
c374fa7d-3745-4c41-bc02-b8ff2f446773 | ishandutta2007/codeforces | hazyknight/normal/578/B.cpp | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
... | ALGO | 0.999897 | 3.818512 |
958261a2-5397-4125-98ce-c16f8e0db0e0 | LikeScience/Code | CompetitiveProgramming/CIIC/CIIC2022A.cpp | #include <iostream>
#include <vector>
using namespace std;
vector<int> vis;
int r;
void fr(int x) {
if (!vis[x]) {
int num = 0;
if ()
}
return;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int n, m, a, b;
cin >> n >> m;
vector<int> c(n+1);
vector<vector <int> >... | ALGO | 0.999894 | 3.840805 |
f4b68b65-9aa0-4506-aa12-9fde374c60dc | 0xm4yo/compro | atcoder/Recommendation/abc029_d.cpp | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, a, b) for(ll i=a; i<b; i++)
#define rrep(i, a, b) for(ll i=a; i>=b;... | ALGO | 0.999799 | 5.1818 |
08460027-0e4c-45eb-a9cd-735635aac31e | LiubomirFedorov/C_plus_plus | Перевірка ІР адреси.cpp | #include <iostream>
#include <string>
#include <regex>
#include <Windows.h>
using namespace std;
class IPAddress {
public:
IPAddress(const string& ip) : ipAddress(ip) {}
IPAddress(const IPAddress& other) : ipAddress(other.ipAddress) {}
virtual void print() const {
cout << ipAddress;
}
protecte... | TOOL | 0.919643 | 5.147709 |
e7dc57d2-2bcd-4194-9687-3ef32bc16b24 | dynsnsky/Dyn_dev_oop | Bai003_Struct_Polynomial/Bai003_Struct_Polynomial.cpp | #include <bits/stdc++.h>
using namespace std;
//Da thuc bac 2 co dang ax^2+bx+c;
struct DATHUC{
int a, b, c;
};
//Da thuc bac 4 co dang mx^4+nx^3+px^2+qx+r;
struct DATHUCBAC4{
int m,n,p,q,r;
};
void NhapDT(DATHUC &x){
cin >> x.a >> x.b >> x.c;
}
void KTdau(int x, int before, string bien = ""){
if (x!=0 && before... | ALGO | 0.999639 | 3.986064 |
b719fe17-b7dc-4eed-81cc-cafa14b432ea | PaukIsUha/optimizing_formating_code | predictions/supersonic_predicted_submissions/Codenet/p02528/238220596/7.cpp | std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
#include <iostream>
#include <utility>
template <class T, class Compare>
void hsort(T a, std::ptrdiff_t n, Compare cmp) {
if (n < 2) {
return;
}
using dif_t = std::ptrdiff_t;
auto heapify = [](T a, dif_t p, dif_t hpsz, Compare cmp) {
dif_t c... | ALGO | 0.999974 | 4.254649 |
3df5bcc3-7fc6-4808-a379-5b595c093e48 | 5Bh03m1k/Leetcode | 77-combinations/combinations.cpp | class Solution {
public:
vector<vector<int>> res;
vector<int> r;
int l;
void solve(int n , int k , int i=1)
{
if(k <= 0) return;
for(; i<=n-k+1 ; i++)
{
r.push_back(i);
solve(n,k-1,i+1);
if(r.size() == l)
res.push_back(r);
... | ALGO | 0.999991 | 5.613777 |
11f456e8-8d09-4642-bc90-2448c67857ee | ThreeMonkey/LeetCode | Best Time to Buy and Sell Stock III.cpp | /*
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most two transactions.
Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
*/
#include <vect... | ALGO | 0.999899 | 5.916761 |
d4aba165-40ee-4443-8e4e-be7dd5bb899f | AIS1002-OOP/folders | main.cpp |
#include <iostream>
#include <functional>
#include <utility>
#include <vector>
#include <string>
class folder {
public:
explicit folder(std::string name) : name_(std::move(name)) {}
[[nodiscard]] std::string getName() const {
return name_;
}
void add(folder& f) {
f.parent_ = this; /... | TOOL | 0.941865 | 5.871587 |
a56811d2-37cf-4337-b5f3-4650f9ed089e | aksJain0/AlgorithmsPractice | week3_greedy_algorithms/2_maximum_value_of_the_loot/fractional_knapsack.cpp | #include <iostream>
#include <vector>
using std::vector;
double get_optimal_value(int capacity, vector<int> weights, vector<int> values) {
double value = 0.0;
// write your code here
return value;
}
int main() {
int n;
int capacity;
std::cin >> n >> capacity;
vector<int> values(n);
vector<int> weig... | ALGO | 0.99988 | 4.844275 |
a67bfe30-78c3-46eb-b6d4-5c75745f4deb | lijianan98/CMU15445_22Fall | src/optimizer/nlj_as_index_join.cpp | #include <algorithm>
#include <memory>
#include <optional>
#include <tuple>
#include "catalog/column.h"
#include "catalog/schema.h"
#include "common/exception.h"
#include "common/macros.h"
#include "execution/expressions/column_value_expression.h"
#include "execution/expressions/comparison_expression.h"
#include "execu... | ALGO | 0.986602 | 7.266939 |
c3c6aac8-02f4-4409-8713-58b3e686c188 | xseifert/UE4-GameWorks | Engine/Source/ThirdParty/CryptoPP/5.6.2/include/blowfish.cpp | // blowfish.cpp - written and placed in the public domain by Wei Dai
#include "pch.h"
#include "blowfish.h"
#include "misc.h"
NAMESPACE_BEGIN(CryptoPP)
void Blowfish::Base::UncheckedSetKey(const byte *key_string, unsigned int keylength, const NameValuePairs &)
{
AssertValidKeyLength(keylength);
unsigned i, j=0, k... | ALGO | 0.999196 | 7.373606 |
2ac9f70f-f184-4698-a111-09e2ab41ced5 | vaibhavarya1622/competitive-programming | codechef/Red_Blue_Flowers.cpp | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define ll long long
const int maxN = 1e3+5;
int red[maxN];
int blue[maxN];
int main(){
int t;
cin>>t;
FOR(_,0,t){
int n;
cin>>n;
ll ans = 0;
FOR(i,1,n+1) cin>>red[i+1];
FOR(i,1,n... | ALGO | 0.99988 | 3.737036 |
365beff8-8809-45d5-b5b3-359f22313c92 | Nothing-avil/GFG_sol | Max_distance_between_same_elements.cpp | class Solution {
public:
int maxDistance(vector<int> &arr) {
unordered_map<int,int> mp;
int n = arr.size();
int miniDist = 0;
for(int i =0; i<n; i++){
if(mp.find(arr[i]) != mp.end()){
int ind = mp[arr[i]];
int mini = i - ind;
... | ALGO | 0.999949 | 5.269743 |
a28919d0-10cf-4592-a2ca-ea7981e9753f | sohne-ck/DataStructure_algorithm | example/5.2Huffman.cpp | //
// Created by sohne on 2020/12/7.
//
typedef struct TreeNode *HuffmanTree;
struct TreeNode{
int Weight;
HuffmanTree Right,Left;
};
HuffmanTree Huffman(MinHeap H){
/* 假设H->Size个权值已经存在H->Elements[]->Weight里 */
int i; HuffmanTree T;
BuildMinHeap(H);/*将H->Elements[]按权值调整为最小堆*/
for (i=1;i<H->Siz... | ALGO | 0.999974 | 4.189408 |
84cbe456-258d-4456-a216-4150101a251d | nicksuzuk1/sipa_agenda | sipa_agend/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.998478 | 6.76775 |
3bb40291-532e-4fc9-84fe-deef595ff260 | vkthakur/codechef | nov3.cpp | #include<iostream>
#include<math.h>
#include<stdio.h>
using namespace std;
int nofbits(long long int x)
{
int cnt=0;
while(pow(2,cnt) <= x)
{
cnt++;
}
return cnt;
}
int main()
{
int t;
cin>>t;
while(t--)
{
long long int x,k,n,setpos,sum,temp,diff;
float kk;
cin>>x>>k;
if(k==1)
{
kk=x;
... | ALGO | 0.999582 | 3.330447 |
09ff025b-9c0f-4906-9433-ba570f6f80bc | Root007x/DSA-and-problem | fractional_knapsack.cpp | #include <bits/stdc++.h>
#define ROW 3
#define COL 8
using namespace std;
void swap(float *a, float *b)
{
float temp = *a;
*a = *b;
*b = temp;
}
void Sort(float arr[], int arr2[][COL], int n)
{
int i, j;
for (i = 0; i < n - 1; i++)
for (j = 0; j < n - i - 1; j++)
if (arr[j] <... | ALGO | 0.999971 | 4.047491 |
8289061e-0c03-488d-a1e7-35fb1135c042 | lkoiescg2031/APSS | Baekjoon Online Judge/14888.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define FOR(i,N) for(int (i)=0;(i)<(N);(i)++)
#define MAX 11
#define ADD 1
#define SUB 2
#define MUL 3
#define DIV 4
int num_size;
int num[MAX + 1];
int op[5];
int ret_min = 1000000000, ret_max = -1000000000;
void solve(int cnt,int cal)... | ALGO | 0.999949 | 3.738378 |
d496858d-b4c7-48da-81e2-f292f0f1603a | Shimanto-125/XPSC_Shimanto | Week_4/Day-05/B_Roof_Construction.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T;
cin >> T;
while(T--)
{
int n;
cin >> n;
int k = 0;
while((1<<(k+1))<=(n-1))
{
k+... | ALGO | 0.999853 | 4.702909 |
ac644a9c-b7d2-47e6-99db-9c946d5d2a6c | TinkerEdgeR-Android/frameworks_av | media/libstagefright/codecs/amrwb/src/scale_signal.cpp | /*
------------------------------------------------------------------------------
Filename: scale_signal.cpp
Date: 05/08/2004
------------------------------------------------------------------------------
REVISION HISTORY
Description:
------------------------------------------------------------------------... | ALGO | 0.999269 | 5.946876 |
f56506f6-f776-4a2d-84b5-97cd4f5a4fc8 | alifalhasan/CP-code-vault | Codeforces/Codeforces Round/Codeforces Round 106 (Div. 2)/E - Martian Strings/135293641.cpp | #include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
template<typename temp>using ordered_set = tree<temp, null_type, less_equal<temp>, rb_tree_tag,tree_order_statistics_node_update>;
//order_of_key(k) ... | ALGO | 0.999815 | 4.580305 |
5c5d71e2-d210-4a12-b5f4-c755d90b270c | dev-shakilkhan/Cpp-Programming | Problem Solving/sphereVolume.cpp | /*
Write a C++ program that calculates the volume of a sphere.
Sample Output:
Calculate the volume of a sphere :
---------------------------------------
Input the radius of a sphere : 6
The volume of a sphere is : 904.32
*/
#include<iostream>
using namespace std;
int main(){
double radius, radius_Valuble;
co... | ALGO | 0.988575 | 5.208574 |
cddec989-52a7-4ac6-84ff-3347601b9f63 | ACM-Obsidian/Obsidian | 2014-01-15/B.cpp | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <set>
#include <sstream>
using namespace std;
const int N = 100010;
char temp[N], s1[N], s2[N], s3[N];
string rec;
set<string> forb;
int main ()
{
int kase; for (scanf("%d", &kase), gets(temp); kase; --kase)
{
... | ALGO | 0.990685 | 3.13793 |
25d37fa3-3c4c-498a-ab76-36347c95dfbf | DirtyUnicorns/android_frameworks_av | media/libstagefright/codecs/m4v_h263/dec/src/pp_semaphore_luma.cpp | /*
------------------------------------------------------------------------------
INPUT AND OUTPUT DEFINITIONS
Inputs:
xpred = x-axis coordinate of the MB used for prediction (int)
ypred = y-axis coordinate of the MB used for prediction (int)
pp_dec_y = pointer to the post processing semaphore for curren... | ALGO | 0.999655 | 6.601039 |
bdd88bd5-371e-422a-9425-44d323706df8 | hack-47/bochs4wii | source/iodev/crc32.cpp | /////////////////////////////////////////////////////////////////////////
// $Id: crc32.cc,v 1.5 2008/04/17 14:39:32 sshwarts Exp $
/////////////////////////////////////////////////////////////////////////
//
/* CRC-32 calculator
* Adapted from http://www.createwindow.org/programming/crc32/
*/
#include "crc32.h"
CR... | ALGO | 0.979781 | 6.204873 |
17fc3754-57b3-4267-92bd-c1bb719e7599 | rajesh-1920/Competitive_Programming_Problem_Solving | Codeforces/C_Racing.cpp | // Author: Rajesh Biswas
// CF : rajesh-1920
// Date : 16.06.2025
#include <bits/stdc++.h>
using namespace std;
//----------------------------(definition section)-----------------------------------------
#define dbg(x) cout << #x << " = " << x << '\n'
#define fi first
#define sc second
#define int long long int... | ALGO | 0.999865 | 3.92302 |
a246b009-9810-4efe-9a13-7f3c02941f29 | MNRKhan/project-euler | 011/011.cpp | #include <iostream>
#include <vector>
using namespace std;
int main(){
vector<vector<int>> grid(20,vector<int>(20));
for(int grid_i=0;grid_i<20;grid_i++)
for(int grid_j=0;grid_j<20;grid_j++)
cin>>grid[grid_i][grid_j];
int max=0;
int product;
// check horizontal products
for(int row=0;row<20;row++){
f... | ALGO | 0.999813 | 4.257831 |
48d800e4-5fc6-4628-b284-096c945c6ec4 | avcopan/MPACK | mlapack/library/Rlatrs.cpp | #include <mblas.h>
#include <mlapack.h>
#include <stdio.h> //for printf, this routine will be tesed and then printf will be removed.
void Rlatrs(const char *uplo, const char *trans, const char *diag, const char *normin, INTEGER n, REAL * A, INTEGER lda, REAL * x,
REAL * scale, REAL * cnorm, INTEGER * info)
{
... | ALGO | 0.999781 | 5.521028 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.