uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
afed1af1-bc26-418b-9e5e-302578662794 | Naegoya/Pemrogramman-Mobile | 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 |
8530c333-b63d-4c4a-8f3a-a6311351f2de | sathishkumarg5024/Data-Structures-and-Algorithm-Master-Course-Supreme-Batch | Patterns_+_Basics_4th February 2023/Switch_statement.cpp | #include<iostream>
using namespace std;
int main(){
int val;
cin>>val;
switch(val){ // expression should be integer or character expression here
case 1:cout<<"Bhavya"; break; // always use break after each case
case 2: cout<<"Bhava1";break;
case 3: cout<<"Bhavya2";break;
defa... | ALGO | 0.994063 | 3.20121 |
74dcc6e0-bf5f-481a-80e9-47a0478799a4 | NoyeArk/algorithm | acwing/2-蓝桥杯每日一题/Week5/区间DP/石子合并.cpp | /**
* @file 石子合并.cpp
* @author horiki
* @version 0.1
* @date 2024-05-21
* @copyright Copyright (c) 2024
*
* @brief
* 1.状态表示：f[i][j]表示合并区间[i, j)所需要的最小代价
* 2.状态计算：
* |————————————————————————————————————|
* i f[i][k] k f[k + 1][j] j
*/
#include <iostream>
using namespace std;
const int N = 310;... | ALGO | 0.999943 | 3.992547 |
e3df20e2-9607-4ad9-a974-a1f2947ceb89 | vuthede/ass1_PR | schedule.cpp | #include <iostream>
#include "schedule.h"
using namespace std;
int myrandom (int i) { return std::rand()%i;}
resource::resource(){
this->CPU = 0;
this->RAM = 0;
}
resource::resource(double CPU, double RAM):CPU(CPU),RAM(RAM){}
task::task(int id, resource Resource, int time):id(id), needResource(Resource), time(time... | ALGO | 0.999634 | 3.8966 |
9bc04cd1-9c3d-4a05-81e8-bd5dd8622940 | Blank-09/skcet.examly.io | Day 15/Class/004.cpp | #include <iostream>
using namespace std;
class currentBill {
public:
virtual double amount() = 0;
};
class Fan : public currentBill {
public:
double watts, hours;
Fan() {
cin >> watts >> hours;
}
double amount() {
return ((watts * hours) / 1000) * 1.5;
}
};
class Light : pub... | TOOL | 0.920985 | 4.171507 |
3a223ac8-f7bb-4b44-98fa-286378c2c08f | HPUedCSLearner/hobbies | parallel-BilibiliSite/06/04_arena/03/main.cpp | #include <iostream>
#include <tbb/parallel_for.h>
#include <vector>
#include <cmath>
int main() {
size_t n = 1<<13;
std::vector<float> a(n * n);
tbb::parallel_for((size_t)0, (size_t)n, [&] (size_t i) {
tbb::parallel_for((size_t)0, (size_t)n, [&] (size_t j) {
a[i * n + j] = std::sin(i) ... | ALGO | 0.982454 | 3.558817 |
38252118-e421-4311-a107-3527fd7bb2dd | mitesh-200228/DS-Algo-Whole-Chapter | Binary Trees/Level.cpp | #include<unordered_set>
#include<stack>
#include<iostream>
#include<vector>
#include<string>
#include<numeric>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<set>
#include<climits>
#include<cmath>
#include<math.h>
#include<limits>
#define ll long long int
const ll N... | ALGO | 0.999993 | 4.513157 |
286d0466-36fc-4a92-9f33-304d8bd047df | Anantadhirya/LeetCode | 2466-count-ways-to-build-good-strings/2466-count-ways-to-build-good-strings.cpp | class Solution {
public:
int countGoodStrings(int low, int high, int zero, int one) {
ios_base::sync_with_stdio(false); cin.tie(0);
const int MOD = 1e9 + 7;
int ans = 0;
vector<int> dp(high+1, 0);
dp[0] = 1;
for(int i = 1; i <= high; i++) {
if(i-zero >= 0)... | ALGO | 0.999958 | 5.420156 |
90db26b9-1c79-41bc-9296-32d8c609dd66 | yunshujing/ACM | 暑期集训/34#abc/D_Minimum_Steiner_Tree.cpp | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define mod3 998244353
#define mod7 1000000007
const int N = 2e5 + 10;
const double eps =1e-4;
int n, k;
vector<int> v[N];
vector<int>s[N];
int sum = 0;
map<int, int> mp;
void dfs(int x,vector <int> g){
... | ALGO | 0.999518 | 4.175529 |
02ecd1b4-ab3b-4858-9774-65f2bdc851a8 | ishandutta2007/codeforces | kubic/normal/1558/E.cpp | #include <bits/stdc++.h>
using namespace std;
#define N 2005
#define ll long long
#define pb push_back
int T,n,m,S,a[N],b[N],U[N],V[N],fa[N],pr[N];
ll l,r,s;bool fl,vs[N],tg[N];
struct Edge {int v,id;};vector<Edge> e[N];
int findRt(int u) {return u==fa[u]?u:fa[u]=findRt(fa[u]);}
bool merge(int u,int v)
{u=findRt(u);v=f... | ALGO | 0.999891 | 3.879846 |
5b009499-b6f4-4f9f-84c7-457dfd7dd58c | nour-alshikh/problem-solving-with-C-- | 1. Sheet #1 (Data type - Conditions)/J - Multiples.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int num1, num2;
cin >> num1 >> num2;
if (num1 % num2 == 0 || num2 % num1 == 0)
{
cout << "Multiples" << endl;
}
else
{
cout << "No Multiples" << endl;
}
} | ALGO | 0.999934 | 4.458336 |
383e2c3c-9ee3-4fc7-a81f-e3e7919cf602 | Apelsin234/cpp | labs/3Sem_Mathroid/A.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
ifstream cin("schedule.in");ofstream cout("schedule.out");
int n;
cin >> n;
long long ans = 0;
vector<pair<int,long long> > v(n);
for(auto &i: v){
int a,b;
cin >> a >> b;
... | ALGO | 0.999885 | 3.715675 |
99d1476d-ccc2-44e5-b04c-e56513b9ba97 | Datguyprasham/CompetitiveProgramming | Codechef sol/October Long 2021/DIGITREM.cpp | /*Prasham Bhagwat*/
#include "bits/stdc++.h"
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
// using namespace __gnu_pbds;
#pragma GCC optimize "trapv" //RE for overflow
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);c... | ALGO | 0.999706 | 5.870859 |
2e7da3fa-751a-4902-93ad-bdfce7f0eb5a | aothms/ear | src/EAR.cpp | #define BANNER " ______ _____ \n | ____| /\\ | __ \\ \n | |__ / \\ | |__) | \n | __| / /\\ \\ | _ / \n | |____ / ____ \\ | | \\ \\ \n |______| (_) /_/ \\_\\ (_) |_| \\_\\"
#define PRODUCT "Evaluation of Acoustics using Ray-tracin... | ALGO | 0.961396 | 5.017617 |
a02c8bb5-a5c1-449f-9b16-8c9127b2bf70 | ssatendra790/CP | Code_Operation.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef unsigned long long ull;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define all(x) x.begin(), x.end()
#define fo(i, n) for (i = 0; i < n; i++)
#define foo(i, n) for (i = 1; i <= n; i++)
#define F first
#define S second
#def... | ALGO | 0.999869 | 3.944145 |
2b89ec14-e4c3-436d-9b28-9e37c225c36b | chaoge282/FlockingSystem | boid.cpp | #include <GL/glut.h>
#include "boid.h"
Boid :: Boid(const Vector3d &p, const Vector3d &v,const Vector3d &a
,const double m,const float s,
float t, int d,double r,double an):
position(p),
velocity(v),
acceleration(a),
mass(m),
step(s),
theta(t),
direction(d),
rotateSpeed... | ALGO | 0.992231 | 4.411065 |
b7b818a7-016a-4f64-821a-ab4c388d05b3 | raincross7/code-similarity | codes/train_code/problem248/problem248_64.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
int t[n],x[n],y[n];
for(int i=0;i<n;i++)cin>>t[i]>>x[i]>>y[i];
for(int i=0;i<n;i++){
int dis,time;
if( i==0 ){
dis = x[i]+y[i];
time = t[i];
}
else{
time = t[i]-t[i-1];
dis = abs(x[i]-x[i-1])+abs(y[i]-y[i-1]);
}
if(... | ALGO | 0.999985 | 3.515401 |
bb700aed-753e-4581-bb69-3edf84e4e25a | Mswati03/doctor-appointment-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.998791 | 6.783634 |
e4c0b364-537f-42b0-8b85-5547ef8a8759 | roboticscorner02/OnlineG13 | Session10/Codes/vectors.cpp | #include <iostream>
#include <vector>
void inputvector(std::vector<int> &vect);
void printvector(const std::vector<int> &vect);
int main()
{
// std::array<std::array<int,3>,3> multidimension_array;
std::vector<int> vector(5,0); // initialization of 5 elements each by 0
std::cout << "Input Values: " << st... | TOOL | 0.908801 | 3.00072 |
69878650-9f71-4d7a-bc19-ef5936a7f084 | Ksenia989/Labs_El | Lab8/main.cpp | #include <iostream>
#include "main.h"
#include <string.h>
// todo библиотека
// todo usage # pragma once
#define n 10
void printSpaces(size_t strlen, int i);
int main() {
struct Worker workerArray[n] = {
{"Торгаева К. О.", "Дегустатор", 2014},
{"Иванов И. К.", "Разработчик", 1960}... | TOOL | 0.908665 | 3.930867 |
9cfd914d-c8f7-4af0-9f5d-31148f97dbc8 | SoftRobotics/physics-toolbox | source/src/Bullet/BulletCollision/BroadphaseCollision/btDbvtBroadphase.cpp | ///btDbvtBroadphase implementation by Nathanael Presson
#include "btDbvtBroadphase.h"
//
// Profiling
//
#if DBVT_BP_PROFILE||DBVT_BP_ENABLE_BENCHMARK
#include <stdio.h>
#endif
#if DBVT_BP_PROFILE
struct ProfileScope
{
__forceinline ProfileScope(btClock& clock,unsigned long& value) :
m_clock(&clock),m_value(&valu... | ALGO | 0.988811 | 7.07729 |
8f936392-c8b4-4744-a490-2d58710bd484 | pukuba/Algorithm | boj/01002/01002.cpp14.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main(){
ios_base::sync_with_stdio(false),cin.tie(NULL);
int x1,y1,r1,x2,y2,r2,T,ans,q;
cin>>T;
while(T--){
double dis;
cin>>x1>>y1>>r1>>x2>>y2>>r2;
if(r2>r1) q=r2-r1;
else q=r1-r2;
int x3=x1-x2;
int y3=y1-y2;
dis=sqrt(pow(x3,2)+pow(y3,2));... | ALGO | 0.999805 | 4.180686 |
e55ebb91-9a66-49d7-8cec-b05d0f4ab8c2 | Anirudh-N-15/LeetCode-Solutions | 2493-divide-nodes-into-the-maximum-number-of-groups/2493-divide-nodes-into-the-maximum-number-of-groups.cpp | class Solution {
public:
int bfs(int node, vector<vector<int>>& adj, int n) {
int count = 0;
queue<int> q;
q.push(node);
vector<int> vis(n, 0);
vis[node] = 1;
while (!q.empty()) {
int siz = q.size();
count++;
for (int i = 0; i < siz... | ALGO | 0.999907 | 5.548252 |
961f91e1-a6f7-4142-9971-393498ac93f6 | sarvex/leetcode-factor | solution/1400-1499/1429.First Unique Number/Solution.cpp | class FirstUnique {
public:
FirstUnique(vector<int>& nums) {
for (int& v : nums) {
++cnt[v];
q.push_back(v);
}
}
int showFirstUnique() {
while (q.size() && cnt[q.front()] != 1) q.pop_front();
return q.size() ? q.front() : -1;
}
void add(int v... | ALGO | 0.99979 | 6.530463 |
7cbaa639-f56f-4e45-a5f1-9cc7c154bc06 | jorking/acm_backup | src/HDU/HDU1166 敌兵布阵.cpp | /*******************************************************************************
# Author : Neo Fung
# Email : <EMAIL>
# Last modified: 2012-01-18 18:23
# Filename: HDU1166 敌兵布阵.cpp
# Description :
******************************************************************************/
#ifdef _MSC_VER
#define DEBUG
#endi... | ALGO | 0.998714 | 3.771452 |
8bc42067-a6e1-4e9e-aa35-1ed23a44d66d | OpenDigitalTwin-Dev/FENGSim | toolkit/Geometry/cgal/examples/Polygon_mesh_processing/repair_polygon_soup_example.cpp | #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Surface_mesh.h>
#include <CGAL/Polygon_mesh_processing/repair_polygon_soup.h>
#include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
#include <algorithm>
#includ... | ALGO | 0.881311 | 6.280442 |
7a9fbd6b-7775-4965-ad0c-be02b037e9ef | osu-acm/problem-sets | problem-of-the-week/week01/calvin_solution.cpp | // Calvin Gagliano
// Oregon State University
// Competitive Programming Template
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
// cin dimensions of board
int n, m; cin >> n >> m;
// We can find the total size of the board using (n*m). Since th... | ALGO | 0.999654 | 4.572931 |
ffc6803a-5e94-4a0a-99ff-990e052c8a93 | lianlian51/LeetCode | leetcode14/LeetCode538/LeetCode538/test.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), left(left... | ALGO | 0.999963 | 5.879943 |
9d4243fd-3eb7-423b-b89f-b241b08e8132 | syloe1/CS- | C++并发编程实战/第七章设计无锁的并发数据结构/e74.cpp | //popû߳ʱս
template<typename T>
class lock_free_stack {
private:
// ԭӱ
std::atomic<unsigned> threads_in_pop;
void try_reclaim(node* old_head); // պ
public:
std::shared_ptr<T> pop() {
// κǰӼ
++threads_in_pop;
node* old_head = head.load();
while (old_head &&
... | ALGO | 0.942746 | 4.051967 |
228ea256-7416-41d1-a5c6-a30feb0d0ccc | ShilongLee/ACM | ACM/字符串算法/目标串中模式串首字母位置(可重复利用同一字母).cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
string s1, s2;
int len1, len2;
int ext[N];
set<int> s;
void get_ext()
{
int j = 0, k = -1;
ext[0] = -1;
while (j <= len2)
{
if (k == -1 || s2[j] == s2[k])
ext[++j] = ++k;
else
k = ext[k];
}
... | ALGO | 0.999963 | 3.61291 |
13434d09-3131-42d9-88cc-71747caac77b | BhoomikaSingh20/DataStructures | Stack.cpp | //Stack: Array implementation
#include <iostream>
#include <stdlib.h>
using namespace std;
class Stack{
int* arr;
int top;
int n;
public:
Stack(){
cout << "Enter size of the stack: ";
cin >> n;
arr = new int[n];
top = -1;
}
void push(int x){
if(top == n-1){
cout << "Stack Overflo... | ALGO | 0.996846 | 4.582108 |
aa1474e8-ea8e-4305-9c8f-55ae16c750d7 | Jajajou/CodeLearningProcess | CHONVIEC/chonviec.cpp | /* __ (\_/)
._( .)<(MEOW) (WOOF)('V')
\____) (U U)
*/
#include <bits/stdc++.h>
using namespace std;
#define name "chonviec" // pls dont forget your task's name
#define maxn 101001
#define elif else if
#define pri_q priority_queue
#define pf push_front
#define pb push_back
#define popb p... | ALGO | 0.999979 | 3.679694 |
90c42d45-7059-4e48-8af8-9c958a3891ce | plantainjuice/leetcode_book | 93.restore-ip-addresses.cpp | /*
* @lc app=leetcode id=93 lang=cpp
*
* [93] Restore IP Addresses
*/
// @lc code=start
class Solution {
public:
// vector<string> restoreIpAddresses(string s) {
vector<string> restoreIpAddresses(const string& s) {
vector<string> ans;
vector<int> path;
backtrace(s, 0, path, ans);
... | ALGO | 0.999659 | 6.285431 |
3684601d-ed26-4736-9e10-0896a51653de | GeorgeJuniorGG/MC521-Competitive-Programming-I | Topic 06/e.cpp | #include <iostream>
#include <set>
using namespace std;
set<int> found;
bool isRepresentable(int n) {
if(found.find(n) != found.end()) {
return true;
}
else if (n < 2020) {
return false;
}
else if (n%2020 == 0|| n%2021 == 0) {
found.insert(n);
return true;
}
... | ALGO | 0.999598 | 4.974241 |
2af50e36-ff37-4cf1-a42e-72386f1226ff | walkccc/LeetCode | solutions/1553. Minimum Number of Days to Eat N Oranges/1553.cpp | class Solution {
public:
int minDays(int n) {
if (n <= 1)
return n;
if (const auto it = mem.find(n); it != mem.cend())
return it->second;
return mem[n] = 1 + min(minDays(n / 3) + n % 3, //
minDays(n / 2) + n % 2);
}
private:
unordered_map<int, int> mem;
};
| ALGO | 0.999985 | 6.484047 |
724a44b5-339a-4720-a485-4d3dc8347f05 | raincross7/code-similarity | codes/train_code/problem409/problem409_297.cpp | #include <stdio.h>
#include <iostream>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
using namespace std;
#define EPS (1e-10)
#define EQ(a,b) (abs((a)... | ALGO | 0.999673 | 3.898528 |
4613e63e-dff3-45a3-9f79-d76ca2a82ad4 | helloobaby/llvm_msvc | llvm/lib/CodeGen/AggressiveAntiDepBreaker.cpp | #include "AggressiveAntiDepBreaker.h"
#include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/SmallSet.h"
#include "llvm/ADT/iterator_range.h"
#include "llvm/CodeGen/MachineBasicBlock.h"
#include "llvm/CodeGen/MachineFrameInfo.h"
#include "llvm/CodeGen/MachineFunction.h"
#include "llvm/CodeGen/MachineInstr.h"
#include "llvm/... | ALGO | 0.984312 | 6.407518 |
9aab49f8-f4f5-429e-b1f6-f965fcaccc78 | voe09/CPPPlayGround | Round1/Tree/CountOfSmallerNumbersAfterSelf.cpp | /*
You are given an integer array nums and you have to return a new counts array.
The counts array has the property where counts[i] is the number of
smaller elements to the right of nums[i].
Example:
Given nums = [5, 2, 6, 1]
To the right of 5 there are 2 smaller elements (2 and 1).
To the right of 2 there is only ... | ALGO | 0.999997 | 6.290861 |
8c4e48ed-444d-4d20-abdd-0ae53f3f0299 | NJ-186/Competitive-Prog-CPP | Mountain and Valley.cpp | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
char a[n];
for (int i=0;i<n;i++) cin >> a[i];
int pointer = 0, count = 0;
for (int i=0;i<n;i++){
if (a[i] == 'U' || a[i] == 'u') {
pointer++;
}
else if(a[i] == 'D' || a[i] == 'd') {
pointer--;
}
if (pointer == 0 && a[i] == ... | ALGO | 0.999865 | 3.983459 |
5bb606a2-7058-4c43-acf2-3b5be400805f | Madokamiiiiii/Mother3German | fix_custom_text.cpp | #include<iostream>
#include<fstream>
using namespace std;
int main(int argc, char *argv[])
{
if(argc < 2)
{
cout << "No argument(s)!";
return -1;
}
for(int i=1; i < argc; i++)
{
ifstream file (argv[i], ios::in|ios::binary|ios::ate);
if (!file.is_open())
... | TOOL | 0.89231 | 3.086112 |
03598d47-970f-4cd8-9089-fef585de9e04 | kk2a/library | verify/yosupo_linalg/matrix_rank.test.cpp | #define PROBLEM "https://judge.yosupo.jp/problem/matrix_rank"
#include "../../matrix/matrix_field.hpp"
#include "../../modint/mont.hpp"
#include "../../template/template.hpp"
using namespace std;
int main() {
int n, m;
kin >> n >> m;
bool is_swap = false;
if (n > m) {
is_swap = true;
... | ALGO | 0.999922 | 4.202608 |
be0bc268-715b-4aa8-b674-e28c693993c9 | Ark-Aak/code_repo | testlib/LMXOIR2/other/std.cpp | #include<bits/stdc++.h>
using namespace std;
namespace IO{
template<typename T>inline void read(T &x){
x=0;int f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
x*=f;
}
const int BUF=1<<21;
char buf... | ALGO | 0.999857 | 3.345815 |
7a651553-661b-42e5-b691-8076156c26ad | dldydrhkd/Data_Structure | HashTable/P1.cpp | #include <iostream>
#define NOITEM 0
#define ISITEM 1
#define AVAILABLE 2
using namespace std;
class cell{
public:
int key;
int value;
int flag;
cell(){
key = -1;
value = -1;
flag = NOITEM;
}
};
class LinearHashTable{
private:
cell *hashArr;
int arrSize;
int curSize;
public:
LinearHashTa... | ALGO | 0.999742 | 3.923694 |
19739240-02eb-4119-97a8-62909b89a709 | alexandraback/datacollection | solutions_1595491_0/C++/wolf5x/b.cpp | #line 2 "GuessCard.cpp"
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#includ... | ALGO | 0.999864 | 3.585236 |
51458c74-c199-4ddd-bebd-25b43eeefd1b | beyondcn2008/ros_catkin_ws | src/orocos_kinematics_dynamics/orocos_kdl/src/chainjnttojacdotsolver.cpp | #include "chainjnttojacdotsolver.hpp"
namespace KDL
{
ChainJntToJacDotSolver::ChainJntToJacDotSolver(const Chain& _chain):
chain(_chain),
locked_joints_(chain.getNrOfJoints(),false),
nr_of_unlocked_joints_(chain.getNrOfJoints()),
jac_solver_(chain),
jac_(chain.getNrOfJoints()),
jac_dot_(chain.... | ALGO | 0.997004 | 6.925921 |
3fa201d0-302d-449f-a6ca-0a09d6181093 | borglab/gtsam | gtsam/3rdparty/GeographicLib/dotnet/examples/ManagedCPP/example-EllipticFunction.cpp | using namespace System;
using namespace NETGeographicLib;
int main(array<System::String ^> ^/*args*/)
{
try {
EllipticFunction^ ell = gcnew EllipticFunction(0.1, 1.0); // parameter m = 0.1
// See Abramowitz and Stegun, table 17.1
Console::WriteLine( String::Format( "{0} {1}", ell->K(), ell... | ALGO | 0.999279 | 4.942891 |
a685bcdb-d95d-4a70-b131-abc2b96cba5a | gustavofadel/Exercises | CSES/1668 - Building Teams.cpp | # include <bits/stdc++.h>
using namespace std;
# define _ ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
const int N = 1e5 + 10;
bool possible = true;
int color[N], m, n, u, v, vis[N];
vector<int> g[N];
void dfs (int u, int c = 0) {
vis[u] = 1, color[u] = c;
for (int v: g[u]) {
... | ALGO | 0.999993 | 4.825404 |
dee3c182-d366-439a-8ef9-ddfed79b6ba2 | phamlethaohien/Competitive-Programming-Algorithms | Sort & Search/Dragons.cpp | #include<bits/stdc++.h>
using namespace std;
int n, s, x, y;
vector<pair<int, int>> p;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y;
p.push_back({x, y});
}
sort(p.begin(), p.end());
for (int i =... | ALGO | 0.999992 | 4.038377 |
2017b916-078c-42fa-a614-1f3af260cadc | Kirill-Krav/raytracing | main.cpp | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <limits>
#include <cmath>
#include "vec.hpp"
#include "sphere.hpp"
#include "light.hpp"
bool scene_intersect(const Vec &orig, const Vec &dir, const std::vector<Sphere> &spheres, Material &material, Vec &point, Vec &N)
{
float s... | ALGO | 0.936057 | 4.982714 |
cb305643-87c8-4d8e-b033-c9c1e1c2ffb1 | JuncoDH/CompetitiveProgramming | online_judges/AceptaElReto/481.cpp | #include <iostream>
#include <math.h>
#include <string>
#include <cmath>
#include <map>
#include <vector>
#include <algorithm>
#include <ctype.h>
#include <queue>
#include <stack>
#include <utility>
#include <set>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef ... | ALGO | 0.987824 | 3.367301 |
e50fcb34-f1d6-482b-a6a1-ec33453d36e8 | komalmahto/DS-Algo-Codes-2020 | RECURSION/merge_sort.cpp | #include <iostream>
using namespace std;
//1,2,6,9,5
void merge(int *a,int l,int h){
// cout<<a[l]<<a[h]<<endl;
int mid=(l+h)/2;
int i=l;
int j=mid+1;
int k=l;
int temp[100];
while(i<=mid && j<=h){
if(a[i]<a[j]){
temp[k++]=a[i++];
}
else{
te... | ALGO | 0.999979 | 3.982377 |
fddf12c5-128a-4728-9324-96ce2b5c3f2e | jitendra-191906/oops-lab | overload.cpp | //WAP to show the effect of default arguments can be alternatively achieved by overloading.
#include<iostream>
#include<math.h>
using namespace std;
float powerfunction(float number,int power);
float powerfunction(float num1);
void display(float data);2
float powerfunction(float number,int power)
{
return pow(numb... | TOOL | 0.881152 | 5.360607 |
c848d402-4ccd-4fd2-9154-086ab293752c | davidoguns/leetcode | cpp/bintree_level_order_traverse_ii/main.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <tuple>
using namespace std;
void print_solution(vector<vector<int>> const &solution) {
using namespace std;
cout << "{";
for_each(solution.begin(), solution.end(), [](auto i) {
cout << "[";
for_each(i.beg... | ALGO | 0.999975 | 6.573517 |
ad2e9e91-81e7-4433-b1c8-f5a420b868be | JamesQAQ/Coding-Practices | LeetCode/Medium/0038. Count and Say/2018-06-13_Accepted.cpp | class Solution {
public:
string countAndSay(int n) {
if (n == 0) return "";
string cur = "1";
char tmp_str[16];
for (int i = 1; i < n; i++) {
string tmp = "";
char cur_char = cur[0];
int cnt = 1;
for (int j = 1; j < cur.length(); j++) {
... | ALGO | 0.999994 | 6.873671 |
aad54560-657f-4b01-adac-9ff54370c150 | Sushilverma002/Supreme2.0 | week7/recursion2.cpp | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
bool searchInArray(int *arr, int target, int size, int index)
{
// base case
if (index >= size)
{
return false;
}
if (arr[index] == target)
{
return true;
}
// recursive call
bool ansmilgay... | ALGO | 0.999259 | 4.048235 |
97c2552a-e70a-43dc-9508-dcf892ae5fb3 | cgogn/CGoGN | Apps/Tests/Algo/Multiresolution/Map3MR/Filters/lerp.cpp | #ifndef __3MR_LERP_FILTER__
#define __3MR_LERP_FILTER__
#include <cmath>
#include "Algo/Geometry/centroid.h"
#include "Algo/Modelisation/tetrahedralization.h"
#include "Algo/Modelisation/polyhedron.h"
#include "Algo/Multiresolution/filter.h"
namespace CGoGN
{
namespace Algo
{
namespace Volume
{
namespace MR
{
nam... | ALGO | 0.99947 | 5.156293 |
edfcb298-2444-4721-9908-971785979417 | strange-suraj/LeetCode-Susbmission | 0720-longest-word-in-dictionary/0720-longest-word-in-dictionary.cpp | class Solution {
public:
string longestWord(vector<string>& words) {
string ans = "";
map<string, int> m;
m[""] = 1;
sort(words.begin(), words.end(), [&](string &a, string &b){
return a.length()<b.length();
});
for(auto x:words){
strin... | ALGO | 0.999964 | 5.735909 |
b767c8c1-ba0a-4d6b-8865-b37a59c8209e | ProtyayMnd50/LC_Daily | 2691-count-vowel-strings-in-ranges/count-vowel-strings-in-ranges.cpp | class Solution {
public:
vector<int> vowelStrings(vector<string>& words, vector<vector<int>>& queries) {
int n=words.size();
vector<int>hsh(n,0);
vector<char> vow={'a','e','i','o','u'};
vector<int>pref(n,0);
for(int i=0;i<words.size();i++){
int p1=find(vow.begin()... | ALGO | 0.999942 | 6.320256 |
c2571055-bfc3-41fe-ae3f-7d2cd3bc4e09 | Y3U18/ollvm-poject | libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_if.pass.cpp | // <algorithm>
// template<ForwardIterator Iter, Predicate<auto, Iter::value_type> Pred>
// requires OutputIterator<Iter, RvalueOf<Iter::reference>::type>
// && CopyConstructible<Pred>
// constexpr Iter // constexpr after C++17
// remove_if(Iter first, Iter last, Pred pred);
#include <algorithm>... | TEST | 0.903247 | 7.036469 |
a4fc6b32-62b4-4c50-8f7e-bab5a0bedbfe | icsl-Jeon/Pioneer_run | src/main.cpp | #include <iostream>
#include <geometry_msgs/PoseStamped.h>
#include <geometry_msgs/Twist.h>
#include <geometry_msgs/Point.h>
#include <ros/ros.h>
#include <string>
#include <cmath>
#include <tf/tf.h>
#include <tf/transform_listener.h>
#define PI 3.141592
struct Gains{
double P_gain;
double I_gain;
double ... | ALGO | 0.875189 | 5.181125 |
793ea966-3e5c-488d-90ac-db699a63c1b8 | JiaRuiShao/CPP | practice/JiaRui_Shao_Midterm#2.cpp | //JiaRui Shao
# include <iostream>;
# include <fstream>;
# include <string>;
using namespace std;
//Protoytpe
void read_file(string state[], double cost[], int &count);
void save_file(string state[], double cost[], int count);
void creat_mail(string state[], double cost[], int &count);
void search_mail_state(string s... | TOOL | 0.934502 | 3.588805 |
d7679e9f-3022-4fcc-ba1c-e9bdee1af8d6 | p2a8t4a5a/learningnotes | test_module/cpp_test/list_reverse.cpp | #include<iostream>
using namespace std;
struct Node{
int data;
Node *next;
};
Node *head;
Node * reverse(Node *temp,Node *&head){
if(temp==NULL || temp->next==NULL){
head=temp;
return temp;
}
else{
Node *pre=reverse(temp->next,head);
pre->next=temp;
temp->ne... | ALGO | 0.999946 | 4.022864 |
055e5a55-87e8-4a83-bc93-0df25215964a | sebastiandperez/CPP_S1 | codigo_base/chat.cpp | #include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;
// Función para verificar si un número es primo
bool prime(int p) {
int h = 2;
while (p % h != 0) {
h++;
}
if (h == p) {
return true;
} else {
return false;
}
}
// Función para generar un núme... | ALGO | 0.85374 | 5.10855 |
711abfa8-bf7c-47f0-847c-08fd1a40f37e | shreyatpandey/Coding-Challenges | C++/Link List/Linked List Cycle.cpp | /*Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the second node.*/
/*Given a linked list, determine if it has a cycle in it.
To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the lin... | ALGO | 0.999902 | 4.726007 |
5191e7ff-54bd-4731-bc7f-5b2681e0cb9f | YangKai5t5/R-one | RMain/32/32.cpp | // Write a program to merge two lists by alternatively taking elements from each list. The method will take 2 arrays as input and return the merged array as output. Input: [1,2,3] and [a,b,c] Output: [1,a,2,b,3,c] Input: [1,2,3,4,5] and [a,b,c] Output: [1,a,2,b,3,c,4,5] Input: [1,2,3] and [a,b,c,d,e] Output: [1,a,2,b,3... | ALGO | 0.999944 | 5.270194 |
d61f9d1b-d185-4f0a-8bad-437e4929bc9a | reunanen/boost-prebuilt-windows-binaries | libs/geometry/doc/index/src/examples/rtree/variants_map.cpp | //[rtree_variants_map
#include <boost/geometry.hpp>
#include <boost/geometry/geometries/point.hpp>
#include <boost/geometry/geometries/box.hpp>
#include <boost/geometry/geometries/polygon.hpp>
#include <boost/geometry/geometries/ring.hpp>
#include <boost/geometry/geometries/linestring.hpp>
#include <boost/geometry/in... | ALGO | 0.998911 | 7.364256 |
1d8602c2-d7de-48a2-9097-d83ebec76113 | AMEGH2004/DISCRETE | (1)F.cpp | #include <bits/stdc++.h>
using namespace std;
void printDifference(const set<int>& S1, const set<int>& S2) {
set<int> differenceSet;
for (const auto& x : S1) {
if (S2.count(x) == 0) {
differenceSet.insert(x);
}
}
cout << "Difference Set: ";
for (const auto& element : di... | ALGO | 0.998717 | 5.251771 |
6a6a05c9-aa20-440e-ae42-c81278c72ec7 | tomwangzhi/C_practice | 栈的实现.cpp | #include<stdio.h>
#include<stdlib.h>
#define OK 1
#define OVERFLOW -1
#define STACKSIZE 20 /*ջijʼ*/
#define STACK_ADD_SIZE 10 /*ջʱӴС*/
#define EEROP -2
typedef int DataType;
typedef struct { /*һջĽṹ*/
int stacksize; /*ջĴС*/
DataType *top; /*ջĶ... | ALGO | 0.999268 | 3.077901 |
57f197ed-70aa-430b-93e1-07110d323d6b | fmahadyBD/Codechef | EZSPEAK.cpp | /*----->>> Mahady Hasan Fahim
*/
//https://www.codechef.com/problems/EZSPEAK
#include <iostream>
#include <string>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int a, c = 0;
cin >> a;
string s;
cin >> s;
for (int i = 0; i < a; i++)
{
... | ALGO | 0.999834 | 4.5505 |
f90b33f2-7247-4439-ad20-da5177caccda | next-step-for-interview-prep/Daily-leetcode-problem_with_detailed_solutions | 073-13th_march-Find_pivot/code.cpp | #include <iostream>
using namespace std;
class Solution
{
public:
int pivotInteger(int n)
{
int total_sum = n * (1 + n) / 2, cur_sum = 0;
for (int i = 1; i <= n; i++)
{
cur_sum += i;
if ((total_sum - cur_sum + i) == cur_sum)
return i;
}
... | ALGO | 0.999406 | 5.371984 |
727c32e7-b685-4535-8b8f-c0c60226be8c | xfgt/summer-grind | Exercises/Sofuni_Summer2024/Fundamentals/Functions - Exercises/01_CenterPoint/main.cpp | //
// Created by twister on 8/27/24.
//
#include <cmath>
#include <iostream>
double getDistance(const int& x, const int& y){
double d = pow(x, 2);
double m = pow(y, 2);
double s = d + m;
double distance = sqrt(s);
return distance;
}
int main(){
int a, b, c, d;
std::cin >> a >> b >> c >... | ALGO | 0.99847 | 5.236343 |
ef5b278d-b4fd-4e0c-8d74-6d2b6d0fa677 | Shash-18/CODSOFT | NUMBER_GUESSING_GAME.cpp | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define s(v) sort(v.begin(),v.end())
#define S(a) sort(a,a+n)
#define p(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define sl(x) scanf("%lld", &x)
#de... | ALGO | 0.999323 | 3.756515 |
637888b4-4a11-4c9a-b6d0-fcf4d3efbb6a | ishandutta2007/codeforces | shayan.p/normal/1163/B1.cpp | // Faster!
#include<bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int maxn=1e5+10,mod=1e9+7;
const ll inf=1e18;
int cnt[maxn];
m... | ALGO | 0.99998 | 4.013576 |
68e14d56-06ff-443f-939d-d6fea887235c | reyankhan0342/sports.channel | 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 |
766caf0c-54a1-4e47-8db9-c4b261e685e7 | Abhi-shekes/leetcode | searching/linear.cpp |
#include<iostream>
#include <cstdio>
using namespace std;
int linearSearch(int arr[], int size, int target){
for(int i =0; i<size;i++){
if (arr[i]==target){
return i;
}
}
return -1;
}
| ALGO | 0.999741 | 5.135629 |
e0da8dc4-23c6-43d8-81d5-1db18d948701 | ujsquared/dumb_submissions | codeforces/round957div3/A.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main (int argc, char *argv[]) {
ll n; cin >> n;
while(n--){
ll a,b,c;
cin>>a>>b>>c;
vector<ll> v;
v.push_back(a);
v.push_back(b);
v.push_back(c);
for(int i = 0; i < 5; i++){
... | ALGO | 0.99955 | 4.337658 |
6d3adcdc-2b5d-4d08-acca-c6e3aa162ceb | czhang2718/spin-glass | gen3.cpp | #include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(x, a) for(auto &x:a)
#define pb push_back
#define nl "\n"
typedef vector<int> vi;
typedef long double ld;
const int N=20;
const int Nlow=20;
const int D=200;
const int T=100; //100
double J[N][N];
double dp[1<<N];... | ALGO | 0.998391 | 3.009437 |
5a682628-aa86-42c4-a43f-dfc54f55a630 | PriyanshK09/Leetcode-Discord-Bot | solutions/number-of-great-partitions.cpp | // Time: O(n * k)
// Space: O(k)
// knapsack dp
class Solution {
public:
int countPartitions(vector<int>& nums, int k) {
static const int MOD = 1e9 + 7;
if (accumulate(cbegin(nums), cend(nums), 0ll) < 2 * k) {
return 0;
}
int result = 1;
vector<int> dp(k);
... | ALGO | 0.999997 | 6.094766 |
a8d50dd4-2744-4872-9a94-6d6362d318d2 | ROCm/hipSPARSE | library/src/amd_detail/extra/hipsparse_csrgemm.cpp | /*! \file */
#include "hipsparse.h"
#include <hip/hip_complex.h>
#include <hip/hip_runtime_api.h>
#include <rocsparse/rocsparse.h>
#include "../utility.h"
hipsparseStatus_t hipsparseXcsrgemmNnz(hipsparseHandle_t handle,
hipsparseOperation_t transA,
... | ALGO | 0.999113 | 6.582504 |
8010924f-ae77-42d8-9302-6ad3a01e7ae4 | FPSG-UIUC/Pandora | simulator/src/systemc/tests/systemc/misc/user_guide/chpt11.4/mean.cpp | /*****************************************************************************
mean.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/*****************************************************************************
... | ALGO | 0.999383 | 4.597202 |
1ee3438a-99cb-48bb-84a2-0af884fcaf84 | ikaran-singh/problem-solving | kids-with-the-greatest-number-of-candies/kids-with-the-greatest-number-of-candies.cpp | class Solution {
public:
vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
vector<bool> res;
int mx=INT_MIN;
for(int i=0;i<candies.size();i++){
mx=max(mx,candies[i]);
}
for(int i=0;i<candies.size();i++){
... | ALGO | 0.999977 | 6.12392 |
112c170f-cc37-4758-81c5-4978c58fd3c6 | ishandutta2007/codeforces | mhq/normal/1067/C.cpp | #ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//freopen("input.txt", "r", stdin);
int n;
cin >> n;
int t = (2 * n /... | ALGO | 0.999793 | 3.182623 |
c540f752-b01f-41f8-986e-d7277a78f6d1 | OKullmann/oklibrary | Satisfiability/Solvers/TawSolver/Tau.cpp | // Oliver Kullmann, 5.12.2015 (Swansea)
/*!
\file OKlib/Satisfiability/Solvers/TawSolver/Tau.cpp
\brief Testing and using tau-components
TODOS:
1. Only Min_tau in Tau.hpp hasn't been superceeded by the components in
Numerics/Tau.hpp.
- Otherwise this Tau.cpp and Tau.hpp can be removed.
- But one shoul... | TEST | 0.910003 | 4.896354 |
0a5b444c-91e5-4019-aa1d-cb3aeea99351 | TheUnbeatable/Homework | TC-optional/TCO14-2A-NarrowPassage.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 55;
class NarrowPassage {
private:
pair <int, int> p[N];
int des[N];
inline int mabs(int x) { return max(x, -x); }
public:
int minDist(int L, vector <int> a, vector <int> b) {
int n = a.size();
for (int i = 0; i < n; i ++) p[i + 1] = make_pai... | ALGO | 0.999916 | 3.713249 |
4c42dbc2-14e7-4b64-b1f6-b3a7cfd83e5c | Soma53/atcoder | CPLUS/abc300/308/C.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Person{
int id;
ll a, ab;
bool operator < (const Person& rhs) const{
if(a*rhs.ab == ab*rhs.a) return id < rhs.id;
return a*rhs.ab > ab*rhs.a;
}
};
int main(){
int n; cin >> n;
vector<Person> people(n);... | ALGO | 0.999917 | 4.088382 |
f15f2637-79be-4b98-bdb0-a95713981a83 | FireHound/android_frameworks_av | media/libstagefright/codecs/m4v_h263/dec/src/deringing_luma.cpp | #include "mp4dec_lib.h"
#include "post_proc.h"
#ifdef PV_POSTPROC_ON
void Deringing_Luma(
uint8 *Rec_Y,
int width,
int height,
int16 *QP_store,
int,
uint8 *pp_mod)
{
/*----------------------------------------------------------------------------
; Define all local variables
--... | ALGO | 0.99943 | 3.184889 |
5ce89692-26e4-4a99-9102-8738c5dbc564 | Zimse12345/Code | Codeforces_Contest/gym103652 2019 Summer Petrozavodsk Camp, Day 8 XIX Open Cup Onsite/quicksort.cpp | #include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
using namespace std;
inline int read(){int qrx=0,qry... | ALGO | 0.999924 | 4.104552 |
2d4e8758-2bb2-4fda-97a0-2edbab6da61a | zjy-dev/algorithm | LeetCode/206-反转链表.cpp | #include "LeetCode.h"
class Solution {
public:
ListNode *reverseList(ListNode *head) {
ListNode *p = NULL;
while (head != NULL) {
auto ne = head->next;
head->next = p;
p = head, head = ne;
}
return p;
}
}; | ALGO | 0.997702 | 5.835598 |
059fd9c9-e494-49fc-825d-e500eba09012 | NimishMishra/randomized_caches | mirage/perf_analysis/gem5/src/systemc/tests/systemc/misc/sim_tests/biquad/biquad3/biquad.cpp | /*****************************************************************************
biquad.cpp --
Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
*****************************************************************************/
/*****************************************************************************... | ALGO | 0.999265 | 5.186655 |
c2fe3af2-1ea9-48b3-98a7-b81a833fb332 | Arnab-000/Competitive-Programming-Problem-Solutions-by-Arnab | 1365C Rotation Matching Solution.cpp | // Problem: C. Rotation Matching
// Contest: Codeforces - Codeforces Round 648 (Div. 2)
// URL: https://codeforces.com/problemset/problem/1365/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// Author: Catalyst71
// Key Idea: Any way I rotate any array that does not really matter. So lets
// assume we will always rota... | ALGO | 0.99998 | 4.504042 |
90c50b56-22f7-4ce3-aa2f-c8058d1ca1c3 | Lesords/ACM | PTA/天梯赛/2021 天梯赛/14.cpp | #include<iostream>//ac
#include<cstdio>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<string>
#include<queue>
#include<utility>
#include<algorithm>
#define ll long long
#define fi first
#define se second
using namespace std;
const int MAXN = 1e5+5;
int a[MAXN],b[MAXN],val[MAXN];... | ALGO | 0.999995 | 3.265238 |
206f3f7b-221f-4be4-951f-77a3db16c1d6 | Fridhi-Rochdi/Competitive_Programming- | D_Eating.cpp | #include <bits/stdc++.h>
using namespace std;
const int MAX_BITS = 30; // La valeur max de wi est inférieure à 2^30
void solve() {
int n, q;
cin >> n >> q;
vector<int> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
// Table pour stocker le dernier indice de chaque MSB
vector<... | ALGO | 0.999917 | 4.639367 |
b46a41a9-6526-4b8f-90e1-8ea0901cc4d2 | snovencido/fea-stuff | ElmerGUI/netgen/libsrc/csg/algprim.cpp | #include <mystdlib.h>
#include <linalg.hpp>
#include <csg.hpp>
namespace netgen
{
double
QuadraticSurface :: CalcFunctionValue (const Point<3> & p) const
{
return p(0) * (cxx * p(0) + cxy * p(1) + cxz * p(2) + cx) +
p(1) * (cyy * p(1) + cyz * p(2) + cy) +
p(2) * (czz * p(2) + cz) + c1;
}
void
QuadraticS... | ALGO | 0.988623 | 3.817165 |
ac4b51e8-c61f-40ed-9256-c2ce3a3d00e0 | voodzz/cpp_labs | cppLabs/Seminar_04_Functions/task01_Avgs/avgs.cpp | /**
*Task 1: n . -
* -
*(: std::pair )
*/
#include <iostream>
#include <vector>
#include <utility>
int main() {
int n;
std::cout << "Enter the number of ellements: ";
std::cin >> n;
std::vector<int> list(n);
// n :
/*for (size_t i = 0; i != n; ++i) {
std::cout << "Enter the i-element: ";
... | ALGO | 0.999473 | 3.957103 |
7679e98f-f271-43be-b512-998f5de45d39 | tinicius/programing-problems | Online Judges/CODEFORCES/C. Very Easy Task.cpp | #include <bits/stdc++.h>
using namespace std;
#define _ \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define endl '\n'
#define dbg(x) cout << #x << " = " << x << endl
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
ll n, x, y;
bool f(ll m) ... | ALGO | 0.999812 | 3.997688 |
3acfda75-c263-45ae-bada-b6f9836a6c98 | ra2003/Plagiarism | dataset/test/modification/1480_rename/46/transformation_1.cpp | #include <bits/stdc++.h>
using namespace std;
using n=int64_t;
int main(){
n xnp,cs_epa,a_xpe,iqo_dmo,zya;
cin>>xnp;
while(xnp--){
cin>>cs_epa>>a_xpe>>iqo_dmo;
n y[iqo_dmo];
for (n&h_qiv:y) cin>>h_qiv;
for(n&uva:y){
cin>>zya;
a_xpe-=(zya+cs_epa-1)/cs_e... | ALGO | 0.999414 | 3.332672 |
fffce7ab-8b96-4029-aa47-def094aa5c1c | VirtualAnalogy/Paraphrasis | JuceLibraryCode/modules/dRowAudio/audio/soundtouch/sse_optimized.cpp | #include "cpu_detect.h"
#include "STTypes.h"
using namespace soundtouch;
#ifdef SOUNDTOUCH_ALLOW_SSE
// SSE routines available only with float sample type
//////////////////////////////////////////////////////////////////////////////
//
// implementation of SSE optimized functions of class 'TDStretchSSE'
//
///... | TOOL | 0.877891 | 6.227396 |
f771e8c9-b586-4d36-a690-d770e5bdf12f | rakshit-bhardwaj/DSAsheet | 85_merge2sortedll.cpp | #include <bits/stdc++.h>
using namespace std;
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 *mergeTwoLists(ListNode *list1,... | ALGO | 0.999925 | 5.28138 |
496bef08-6d20-4f6c-9756-c298af864163 | BrunoFhome/trat_erros_flutter | news_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.999004 | 6.76073 |
65d37447-1fc2-45de-81c1-4952e60c758b | samyak1512/coding | C++ Code/porblem_c.cpp | #include <iostream>
#include <vector>
#include <utility>
using namespace std;
int calc(int x, int a, int b, int c) {
return a*x*x + b*x + c;
}
int main() {
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
vector<int> k(n);
vector<pair<int, pair<int,int>>> quer... | ALGO | 0.999833 | 3.822541 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.