uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
44de9412-c859-4f45-8ec2-41bf618cb0dc | hjiang13/LLMs-in-IR | POJ-104/30/3012.cpp | #include <iostream>
using namespace std;
int has7(int a);
int has7(int a)
{
int len,b,p,k;
k=0;
len=0;
b=a;
do{
b=b/10;
len++;
}
while (b>0);
for (int i=len-1; i>=0; i--)
{
p = (int)(a/pow(10,i));
if (p==7)
{
k=1;
break;
}
a = a - p*(int)pow(10,i);
}
return k;
}
int main()
{
int n,m;
int s=0;
cin >> "%d",&n);
for(m=1; ... | ALGO | 0.999703 | 3.588179 |
67bde282-c9f9-4ef2-a5f7-deb81abc3d5c | neal3991/CST8219-CPP | Assignment_02/References/OverloadedOperatorCode.cpp | using namespace std;
class Integer {
public:
int i;
//Integer():i(0){} // not needed
Integer(int ii=0) : i(ii) {} // default argument makes default constructor
Integer operator+(const Integer& rv) const
{
cout << "operator+" << endl;
cout << "this->i = " <<i<< endl;
cout << "rv.i = " << rv.i << endl;
r... | TOOL | 0.89941 | 4.706995 |
e8ed0ba3-27d5-4a27-b8d0-121a846ad08e | VIPverma01/6Companies30days | Microsoft/15.Number_of_Substrings_Containing_All_Three_Characters.cpp | /*
link: https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/
*/
class Solution {
public:
int numberOfSubstrings(string s) {
// Method 1: Sliding window
// int n = s.size(), cnt[3] = {0}, i = 0, j = 0, res = 0;
// while(j<n){
// c... | ALGO | 0.999955 | 6.305659 |
6d1fb6c6-3b8d-44e1-b5da-c0e84c8fa38a | K1XE/LeetCode | 周赛/450/100649. 数位和排序需要的最小交换次数.cpp | #include "tools.h"
class Solution {
public:
int minSwaps(vector<int>& nums) {
vector<int> tmp;
for (int i = 0; i < nums.size(); i ++ )
{
tmp.push_back(solve(nums[i]));
}
int n = tmp.size();
vector<pair<pair<int, int>, in... | ALGO | 0.999963 | 5.867665 |
f533bf3d-8762-43aa-8be0-d03bd573e6f5 | endenko/weridmenuthing | testG.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
string cipher[26]; // M?ng lu chu?i m? ha
string s; // Chu?i m? ? m? ha
string result; // K?t qu? gi?i m?
// ?c thng tin chu?i m? ha
for (int i = 0; i < 26; i++) {
cin >> cipher[i];
}
// ?c chu?i m? ha
cin >> s;
i... | ALGO | 0.999998 | 4.688309 |
82b03e6d-f573-4642-8672-c9eceafdf046 | reeticodes/Competetive_Programming | B/B_Update_Files.cpp | #include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#define nline "\n"
#define MOD 1000000007
#define ll long long
#define PI 3.141592653589793238462
#define rep(i, k, n) for (i = k; i < n; ++i)
#define repr(i, k, n) for (i = n; i >= k; i--)
#define debug(x, y) cout << x << " : " << y << endl;
#defi... | ALGO | 0.999779 | 4.093859 |
419aa725-4701-4aac-a7d8-553b0c768069 | mahmoudsaeeed/mycollege | 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.998733 | 6.76775 |
db193b9c-5dd8-413b-9619-ac0045ad4cce | ishandutta2007/codeforces | tmwilliamlin168/normal/909/A.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;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statisti... | ALGO | 0.999978 | 3.776019 |
dda8b02f-9efa-4ff2-be0c-baad0cad1f7a | websopon24/19701073_Md_Sopon_Abdullah | 1367b.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
const double PI = acos(-1);
#define PB push_back
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (abs(a*b)/gcd(a,b))
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main()
{
... | ALGO | 0.999181 | 4.220934 |
251e4953-00a4-454a-be27-d5abeca8ddd9 | jonstewart/boost-svn | libs/math/example/binomial_sample_sizes.cpp | #ifdef _MSC_VER
# pragma warning(disable: 4512) // assignment operator could not be generated.
# pragma warning(disable: 4510) // default constructor could not be generated.
# pragma warning(disable: 4610) // can never be instantiated - user defined constructor required.
#endif
#include <iostream>
#include <iomanip... | ALGO | 0.97043 | 7.292227 |
81f69f67-8e92-4ec4-ab6c-e9cb4ba3c599 | joshualass/CP | Solutions/Contests/ICPC/2425/NCPC/junglegame.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<ld> vd;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef vector... | ALGO | 0.999983 | 3.880722 |
b03d6cb3-8895-4ad7-abc9-e72a18ff8aa6 | shubham7668/Leetcode | 215-kth-largest-element-in-an-array/215-kth-largest-element-in-an-array.cpp | class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
int n=nums.size();
sort(nums.begin(),nums.end());
return nums[n-k];
}
}; | ALGO | 0.999909 | 5.033045 |
4a4c70b3-b479-4749-8957-a7813858cd1a | Lailansyahda/250_ConditionalStatement | pertemuan3/Contoh_IfElse.cpp | #include <iostream> //library iostream
using namespace std; // standart namespace
float phi = 3.14;
float r, luas;
// prosedur input
void inputData() {
cout << "Enter Value of r : ";
cin >> r;
}
// prosedur hitung luas
float hitungLuasLingkaran() {
return phi * r * r;
}
float hitungLuasLingkaranParameter(float x... | TOOL | 0.993149 | 4.722876 |
285ed588-9b7d-4628-aded-e1c4eb7d336d | fuqinho/ChallengeBook | quiz2nd/197_BipartileMatching2/main.cpp | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int V = 6;
static const int MAX_V = 10;
vector<int> G[MAX_V];
int match[MAX_V];
bool used[MAX_V];
void add_edge(int u, int v) {
G[u].push_back(v);
G[v].push_back(u);
}
bool dfs(int v) {
used[v] = true;
for (int i = 0; i < G[v].size()... | ALGO | 0.999205 | 5.509307 |
388a9ab0-9c40-4bfe-b888-8217e35b5783 | Chang-213/Data-Structures | mp5/tests/tests_part1.cpp | #include "../cs225/catch/catch.hpp"
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <cctype>
#include <locale>
#include "../kdtree.h"
#include "../point.h"
#include "tests_part1.h"
// https://stackoverflow.com/a/217605
// trim from end (in place)
static inline void rtrim(std::st... | TEST | 0.918347 | 6.992498 |
35ce13ef-6824-43e4-a5a4-bfaedb233a90 | JangIkhwan/BOJ-practice-2024 | Jan/9252_1.cpp | /*
24-01-26, 12:17~ 47
*/
#include <iostream>
using namespace std;
char s1[1001], s2[1001];
int resultLen;
char result[1001];
char tempLcs[1001];
int dp[1001][1001];
void lcs(int p1, int p2, int len) {
if (p1 > strlen(s1) || p2 > strlen(s2)) {
tempLcs[len] = '\0';
if (resultLen < len - 1) {
strcpy(result, tem... | ALGO | 0.999951 | 3.57831 |
d83705ed-e33d-4228-943d-ef154efdf11c | BSU2016gr09/SemenovichRoman | 1term/1-3.cpp | //проверка числа, создание массива из случайных чисел, подсчет количества четных чисел в массиве
#include <QCoreApplication>
#include <iostream>
#include <time.h>
using namespace std;
void checkNumber(int N);
void createArray(int array[], int N);
void printArray(int array[]);
void countPosEvNumbers(int array[]);
int... | ALGO | 0.994052 | 4.074054 |
2eb4cdac-702e-4f34-a33f-3c4f265c1574 | Anandpandey0/PractiseExercises-DSA | Assignment 18/Subsets.cpp | class Solution {
public:
void printSubsets(int index,vector<int>&arr,vector<vector<int>>&ans,vector<int>&A){
if(index==arr.size()){
ans.push_back(A);
return;
}
printSubsets(index+1,arr,ans,A);
A.push_back(arr[index]);
printSubsets(index+1,arr,ans,A);
... | ALGO | 0.999939 | 5.851752 |
33ad29d7-bc61-4e4d-8650-e8da9515d366 | rhemesh/CPP-Programs | Inheritance/Hybrid_Inheritance.cpp | #include<iostream>
using namespace std;
class animal
{
protected:
int weight;
public:
animal()
{
cout<<"Inside base class animal"<<endl;
}
int get_weight(int w)
{
weight = w;
return weight;
}
};
class Lion :virtual public animal
{
public:
Lion()
... | TOOL | 0.889757 | 4.607331 |
6fb07357-f2b0-45e8-b410-6520bde751ce | kevinzhang334455/Scout | boost_1_56_0/libs/proto/example/map_assign.cpp | #include <map>
#include <string>
#include <iostream>
#include <boost/proto/core.hpp>
#include <boost/proto/transform.hpp>
#include <boost/type_traits/add_reference.hpp>
namespace proto = boost::proto;
using proto::_;
struct map_list_of_tag
{};
// A simple callable function object that inserts a
// (key,value) pair in... | TOOL | 0.888296 | 6.874025 |
5e2a165e-05a4-4c5c-9b0f-ce2b57237305 | abadams/ImageStack | src/Statistics.cpp | #include "main.h"
#include "Statistics.h"
#include "Calculus.h"
#include "Reduction.h"
#include "Arithmetic.h"
#include "eigenvectors.h"
#include <algorithm>
#include <iostream>
namespace ImageStack {
void Dimensions::help() {
pprintf("-dimensions prints the size of the current image.\n\n"
"Usage: Imag... | TOOL | 0.897835 | 4.305527 |
f1bc5077-5293-47ef-93a8-9932ab0059f3 | maxCodeVector/cpp-lab | assign3/app.cpp | #include <cmath>
#include <string>
#include <iostream>
#include <fstream>
#include <sstream>
#include <memory.h>
#include <string.h>
#define NAME_LEN 35
#define ARR_SIZE 1000
#define RES_INC_STEP 10
#define MIN(a, b) a<b?a:b
#define R 6371 // the redius of earth by km
#define PI 3.14159
using namespace std;
struct Ci... | ALGO | 0.999515 | 3.874348 |
e0c1e3f4-f06f-4a8c-ac13-db8a15e4df91 | ishandutta2007/codeforces | demoralizer/normal/1102/B.cpp | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define M 1000000007
#define MM 998244353
#define fr first
#define sc second
#define vc vector
#define pii pair<... | ALGO | 0.999997 | 4.003635 |
af70d465-9386-43ed-af82-035e417a838e | bookchon/StudyCplusplus | C03_BaseC/34FruitSaleSim.cpp | #include <iostream>
using namespace std;
class FruitSeller
{
private:
int APPLE_PRICE;
int numOfApples;
int myMoney;
public:
void InitMembers(int price, int num, int money)
{
APPLE_PRICE = price;
numOfApples = num;
myMoney = money;
}
int SaleApples(int money)
{
int num = money / APPLE_PRICE;
numOfAp... | ALGO | 0.919733 | 4.531053 |
e6816ed6-ef28-4fb2-a411-575a5fe520c4 | Kriminal589/Infa_MIREA | Домашняя работа №4/Знак числа/Знак числа/main.cpp | #include <iostream>
using namespace std;
int sign (int Val)
{
if (Val < 0.) return -1;
else if (Val == 0.) return 0;
else return 1;
}
int main()
{
cout <<"Введите число..";
int a; cin >> a;
int b = sign(a);
cout << b << endl;
system("pause");
}
| ALGO | 0.999721 | 3.201866 |
f96c7b94-0dfe-46d1-83c4-175b136bd15a | ishiikurisu/PC | src/uri/uri1170.cpp | #include <iostream>
#include <vector>
using namespace std;
vector<float> supplies;
vector<int> day_count;
int days;
void readData()
{
cin >> days;
for (int i = 0; i < days; i++)
{
float supply;
cin >> supply;
supplies.push_back(supply);
}
}
int count(float supply)
{
int day = 0;
while (supp... | ALGO | 0.999587 | 4.236577 |
ba121961-c37e-48ac-9672-704a1e7c108f | Kathleen7474/-leetcode | 206ReverseLinkedList.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* reverseList... | ALGO | 0.999913 | 5.751518 |
bff3027c-43a1-4f8c-bcfd-23456913d8f2 | keijak/comp-pub | atcoder/abc215/B/main.cpp | #include <bits/stdc++.h>
#define REP_(i, a_, b_, a, b, ...) \
for (int i = (a), END_##i = (b); i < END_##i; ++i)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(x) std::begin(x), std::end(x)
using i64 = long long;
template<typename T, typename U>
inline bool chmax(T &a, U b) {
ret... | ALGO | 0.999407 | 4.273211 |
4e20fe56-15e9-4435-a0a9-fbddeaeed045 | cambyse/rai_for_tamp | rai/LGP/retired/manipulationTree.cpp | void MNode::recomputeAllMCStats(bool excludeLeafs) {
if(!mcStats) return;
if(!isTerminal) {
if(children.N || !excludeLeafs || isInfeasible)
mcStats->clear();
}
for(MNode* ch:children) {
ch->recomputeAllMCStats(excludeLeafs);
for(double x:ch->mcStats->X) mcStats->add(x);
}
if(mcStats->n)
... | ALGO | 0.999771 | 3.101571 |
84325d75-bcdc-4f5c-b784-4699b62747c6 | Rohitrky2021/JavaSourceCode | =C--P/Coding-blocks-CP-master/Segment_Tree_RMQ/Segement_Tree_RMQ.cpp | #include <iostream>
#include <cmath>
#include <climits>
using namespace std;
int RMQ(int segArray[], int segStart, int segEnd, int start, int end, int index)
{
if (start <= segStart && end >= segEnd)
return segArray[index];
if (segEnd < start || segStart > end)
return INT_MAX;
int mid = ... | ALGO | 0.999992 | 5.343832 |
4dacd17a-d738-4955-a601-a13037ac5177 | krrdhiraj/DSA-Complete-Interview | 1460-number-of-substrings-containing-all-three-characters/1460-number-of-substrings-containing-all-three-characters.cpp | class Solution {
public:
int numberOfSubstrings(string s) {
int cnt = 0;
int n = s.length();
vector<int> mp(3);
int i = 0, j = 0;
while(j < n){
mp[s[j]-'a']++;
while(mp[0] > 0 && mp[1] > 0 && mp[2] > 0){
cnt += n-j;
m... | ALGO | 0.99998 | 5.693735 |
bd0ee6fe-8d5e-4e5b-a8b5-a734425b133f | stankin/uits-labs | semester-1/seminars/2/primial.cpp | /*
Вывести первые N простых чисел
*
* декомпозируем
*/
#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(int n)
{
for (int i = 2; i < n / 2; i++)
{
if (n % i == 0)
{
return false; // 0;
}
}
return true; // 1;
}
int main()
{
int co... | ALGO | 0.999381 | 4.478763 |
38daa648-d2f9-4a4b-8c88-0ec53170adfc | not-joosh/Code-Wars | 8kyu/Keep-Hydrated!.cpp | /*
8 kyu
Keep Hydrated!
64117988% of 10,5142,979 of 132,774paulrichard
C++
Clang 8 C++17
VIM
EMACS
Instructions
Output
Nathan loves cycling.
Because Nathan knows it is important to stay hydrated, he drinks 0.5 litres of water per ... | ALGO | 0.999156 | 4.54003 |
c6255c40-a2b6-4e81-bf8a-1ac59a6f4bbb | catherinecscst/UofT-Projects | CSC418/A3__computer-graphics-ray-tracing/src/Triangle.cpp | #include "Triangle.h"
#include "Ray.h"
bool Triangle::intersect(
const Ray & ray, const double min_t, double & t, Eigen::Vector3d & n) const
{
// Intersect a triangle with a ray.
Eigen::Vector3d pA = std::get<0>(corners);
Eigen::Vector3d pB = std::get<1>(corners);
Eigen::Vector3d pC = std::get<2>(corne... | ALGO | 0.970208 | 6.811741 |
d7a28744-c530-4bc8-a3b0-af9d38bd1198 | sus-unn/blender | extern/bullet2/src/BulletCollision/CollisionShapes/btTetrahedronShape.cpp | #include "btTetrahedronShape.h"
#include "LinearMath/btMatrix3x3.h"
btBU_Simplex1to4::btBU_Simplex1to4() : btPolyhedralConvexAabbCachingShape (),
m_numVertices(0)
{
m_shapeType = TETRAHEDRAL_SHAPE_PROXYTYPE;
}
btBU_Simplex1to4::btBU_Simplex1to4(const btVector3& pt0) : btPolyhedralConvexAabbCachingShape (),
m_numVert... | TOOL | 0.953836 | 6.552552 |
1645e433-45d4-4e9a-9e45-19f74071f85d | berneylin/LeetCode2019Spring | 40/combination_sum_ii_dup.cpp | #include<vector>
#include<algorithm>
using namespace std;
class Solution {
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<vector<int>> ansVec;
if(candidates.empty() || target<=0) return ansVec;
vector<int> tmpVec;
int tmpSum = 0;
... | ALGO | 0.999976 | 6.359724 |
80992264-28b4-48d8-95ae-6308c2e53d4a | venkataramanagovindu/LSDS | Homework4/Queries_BL.cpp | #include "Queries_BL.h"
#include "Common.h"
using namespace std;
Queries_BL::Queries_BL(string genomeFilePath, string queriesFilePath): FilePath(genomeFilePath), QueriesFilePath(queriesFilePath) {
HumanGenome = NULL;
QueriesArray = NULL;
cols = 32;
NWRows = QUERIES_LENGTH + 1;
NWCols = QUERIES_LEN... | ALGO | 0.929765 | 5.19569 |
6806df1d-a5c3-41f8-bcb0-7c00e05b94bb | Tejas-Rote/LeetCode | 1631-path-with-minimum-effort/1631-path-with-minimum-effort.cpp | class Solution {
public:
int minimumEffortPath(vector<vector<int>>& heights) {
priority_queue<pair<int, pair<int, int>>,vector<pair<int, pair<int, int>>>,greater<pair<int, pair<int, int>>>> pq;
int n = heights.size();
int m = heights[0].size();
vector<vector<int>> dist(n, v... | ALGO | 0.999995 | 6.251591 |
9416e2b9-ff26-468a-b3ca-e206e87a123a | hma40/Cpp-Competitive-Programming | Codeforces/1925/C.cpp | #include <bits/stdc++.h>
std::string to_string(__int128_t value) {
if (value == 0) return "0";
std::string result;
bool negative = (value < 0);
if (negative) value = -value;
while (value > 0) {
result += '0' + (value % 10);
value /= 10;
}
if (negative) result +... | ALGO | 0.999926 | 4.352973 |
118be335-5e24-4f9d-b1c6-5b278446a7f9 | hikjik/cses | solutions/towers/main.cpp | #include <iostream>
#include <set>
int main() {
int n;
std::cin >> n;
std::multiset<int> set;
while (n--) {
int a;
std::cin >> a;
if (auto it = set.upper_bound(a); it != set.end()) {
set.erase(it);
}
set.insert(a);
}
std::cout << set.size() << "\n";
return 0;
}
| ALGO | 0.999452 | 4.924966 |
e5ae4890-e058-418a-8b1b-d8be5dbe3ac7 | ducnguyen96/leetcode | hash-map/longest-consecutive-sequence/main.cpp | #include <unordered_set>
#include <vector>
using namespace std;
class Solution {
public:
int longestConsecutive(vector<int> &nums) {
int n = nums.size();
if (n < 2) {
return n;
}
int longest = 1;
unordered_set<int> mySet(nums.begin(), nums.end());
for (auto num : mySet) {
if (my... | ALGO | 0.999801 | 5.645014 |
7e6115d1-0edb-477f-a95e-1b535de63cb0 | algorithm003/algorithm | Week_04/id_23/LeetCode_78_23.cpp | class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>> res;
vector<int> v;
subset(nums, 0, v, res);
return res;
}
void subset(vector<int> &nums, int i, vector<int> &v, vector<vector<int>> &res) {
res.push_back(v);
fo... | ALGO | 0.999893 | 6.286138 |
0c5a5bdb-dd82-46e7-8f7a-a0fde6cc94c2 | ishandutta2007/codeforces | ssrs_/normal/1670/D.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int a = 0, b = 0, c = 0;
vector<int> X;
while (true){
int s = 2 * (a * b + b * c + c * a);
X.push_back(s);
if (s > 1100000000){
break;
}
a++;
swap(a, b);
swap(b, c);
}
int t;
cin >> t;
for (int i = 0; i < t; i++){
... | ALGO | 0.999675 | 3.405191 |
ab1efd0f-af99-4cc8-a6dc-9d94546f405a | 61--/windage | windageLib/Examples/SparseIncreamentalReconstructionwImage/main.cpp | /* ========================================================================
* PROJECT: windage Library
* ========================================================================
* This work is based on the original windage Library developed by
* Woonhyuk Baek
* Woontack Woo (<EMAIL>)
* U-VR Lab, GIST of Gwa... | ALGO | 0.950531 | 3.373268 |
0be9b8a4-0956-41ae-a3dd-79fe6261a597 | anas092121/Leetcode-Solutions | 1586-longest-subarray-of-1s-after-deleting-one-element/1586-longest-subarray-of-1s-after-deleting-one-element.cpp | class Solution {
public:
int longestSubarray(vector<int>& nums) {
queue<int> Q;
int ans = 0, zeros = 0;
for (int x : nums) {
Q.push(x);
if (x == 0) zeros++;
while (zeros > 1) {
if (Q.front() == 0) zeros--;
Q.pop();
... | ALGO | 0.999921 | 6.036864 |
256a3156-fe91-45bb-956e-710171338cf0 | akhilchoudhary2k/Solutions-CSES-Problem-Set | common_divisors.cpp |
#include<bits/stdc++.h>
using namespace std;
#define int long long
// vector<int> divisors(1000000+1);
// void test_case(){
// int n;
// cin >> n;
// for(int i=0;i<n;i++){
// long long x; cin >> x;
// for(long long d1=1 ; d1*d1<=x ; d1++){
// if(x%d1==0){
// divisors[d1]++;
// if(x/d1 != d1) diviso... | ALGO | 0.999962 | 4.142279 |
886a8455-4f7f-4eca-adfa-787252587ee9 | dush1729/cp | submission/spoj/farida.cpp | #include<stdio.h>
unsigned long long max(unsigned long long a,unsigned long long b)
{
if(a>b) return a;
else return b;
}
int main()
{
int T,t;
scanf("%d",&T);
for(t=1;t<=T;t++)
{
unsigned long long N,i,a[1000],dp[1000];
scanf("%llu",&N);
for(i=0;i<N;i++) scanf("%llu",&a[i... | ALGO | 0.999801 | 3.397895 |
58da204a-a991-4072-823c-89bbda5a942a | Harshit-Kumar-1710/The-Competitive-DSA-Programming | MaximumSubArraySum.cpp | #include <iostream>
#include<climits>
#include<vector>
using namespace std;
void MaximumSubArraySum(vector<int>&v)
{int sum,sum1=INT_MIN;
for(int i=0;i<v.size();i++)
{
for(int j=i;j<v.size();j++)
{
sum=0;
for(int k=i;k<=j;k++)
{
sum+=v[k];
... | ALGO | 0.999946 | 4.641098 |
e160177c-054d-49ba-8ca5-30b1fbef15c8 | snowy615/c-_coding | lq_3433.cpp | #include <iostream>
#include <queue>
using namespace std;
using ll = long long;
priority_queue<ll> pq;
int n, q;
ll x;
int main(){
ll sum = 0;
int m;
cin >> n >> q;
for (int i=1; i<=n; i++) {
cin >> x;
sum += x;
pq.push(x);
}
for (int i=1; i<=q; i++){
cin >> m;
... | ALGO | 0.999929 | 3.109588 |
297b45f7-0f9f-4d1b-a762-e96de1a29652 | goblinengine/godot3 | scene/animation/skeleton_ik.cpp | /*************************************************************************/
/* skeleton_ik.cpp */
/*************************************************************************/
/* This file is part of: */
/* ... | TOOL | 0.984126 | 7.05786 |
d2883f7b-8237-4512-adc4-b42690a39ad5 | caiAtSNU/CodeForces | TypeDB Forces 2023 Div. 1 Div. 2 Rated Prizes/A_Exponential_Equation/A_Exponential_Equation.cpp | /*
Description
You are given an integer n.
Find any pair of integers (x, y) (1 <= x,y <= n)
such that x^y * y + y^x * x = n
Input
1 <= t <= 1e4
1 <= n <= 1e9
Output
If possible print x, y
else -1
*/
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n; cin >> n;
if (n%2 == 1) {
cout ... | ALGO | 0.999929 | 5.279307 |
ae7b7519-4500-40a4-afee-52eeb5479c14 | WYK15/swift-Ollvm10 | compiler-rt/test/fuzzer/AbsNegAndConstantTest.cpp | // abs(x) < 0 and y == Const puzzle.
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
if (Size < 8) return 0;
int x;
unsigned y;
memcpy(&x, Data, sizeof(x));
memcpy(&y, Data + sizeof(x), siz... | ALGO | 0.918167 | 5.264034 |
815212d7-fd57-4dc8-9d27-da0d572ab50e | pzhang2/Path-Planning-Project-master_SDCND-Term3-P1 | src/Eigen-3.3/doc/examples/TutorialLinAlgSelfAdjointEigenSolver.cpp | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix2f A;
A << 1, 2, 2, 3;
cout << "Here is the matrix A:\n" << A << endl;
SelfAdjointEigenSolver<Matrix2f> eigensolver(A);
if (eigensolver.info() != Success) abort();
cout << "The eigenvalues of A ... | ALGO | 0.999071 | 3.836841 |
7e9c603c-9a33-4dd3-9348-cd6b7d19144d | northhurricane/mysql-5.7.18 | extra/yassl/taocrypt/src/aestables.cpp | /* based on Wei Dai's aestables.cpp from CryptoPP */
#include "runtime.hpp"
#include "aes.hpp"
namespace TaoCrypt {
const word32 AES::rcon_[] = {
0x01000000, 0x02000000, 0x04000000, 0x08000000,
0x10000000, 0x20000000, 0x40000000, 0x80000000,
0x1B000000, 0x36000000,
/* for 128-bit blocks, Rijndael ne... | ALGO | 0.856481 | 4.343624 |
20c16519-63fd-445e-ad13-ce0471019164 | ishandutta2007/codeforces | tankengineer/normal/792/B.cpp | #include<vector>
#include<cstdio>
#include<algorithm>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<int> children;
for (int i = 0; i < n; ++i) {
children.push_back(i + 1);
}
int pt = 0;
for (int i = 0; i < k; ++i) {
int a;
scanf("%d", &a);
pt = (pt + a) % children.size();
... | ALGO | 0.999996 | 3.170758 |
11f4ac5f-122d-4f4d-9336-e3ae728ec4fe | AayushSharma54652/DSA-Practice | 6) Hashing/how many times character repeats in a string(uppercase) using hashing.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
//prefetch or hash array
int hash[256]={0};
for(int i=0;i<s.size();i++){
hash[s[i]]++;
}
int q;
cin>>q;
while(q--){
char c;
cin>>c;
cout<<hash[c]<<endl;
}
} | ALGO | 0.997993 | 3.989947 |
8f672f34-50d2-4c4a-8cdb-30b034546be7 | zgyadventure/C- | 二维数组的传参.cpp | #include<stdio.h>
void test(int (*p)[5],int x,int y)
{
int i;
int j;
for(i=0;i<3;i++)
{
for(j=0;j<5;j++)
{
printf("%d",p[i][j]);
}
printf("\n");
}
}
int main()
{
int arr[3][5]={{1,2,3,4,5},{2,3,4,5,6},{3,4,5,6,7}};
test(arr,3,5);
return 0;
}
| ALGO | 0.953593 | 3.142462 |
713527b1-97ca-4588-88ea-96124dce3e00 | PrernaSingh587/Leetcode-questions | 1319-number-of-operations-to-make-network-connected/1319-number-of-operations-to-make-network-connected.cpp | class Solution {
public:
void dfs(int k, int n, vector<int>adj[],int *vis) {
vis[k]=1;
for(int i : adj[k]) {
if(!vis[i]) dfs(i,n,adj,vis);
}
}
int makeConnected(int n, vector<vector<int>>& ed) {
int edge=ed.size();
if(n-1>edge) return -1;
vector<... | ALGO | 0.99991 | 5.525523 |
f7042bbf-cc45-4382-aefd-ffe419f02b23 | AhJo53589/leetcode-cn | problems/group-shifted-strings/SOLUTION.cpp |
//////////////////////////////////////////////////////////////////////////
class Solution {
public:
vector<vector<string>> groupStrings(vector<string>& strings) {
vector<vector<string>> ans;
unordered_map<string, vector<string>> hashmap;
for (auto u : strings) {
string ... | ALGO | 0.999991 | 6.278189 |
46402c00-7a6b-4ba1-9889-46ee63b1810e | ishandutta2007/codeforces | holidin/normal/1276/B.cpp | #include <bits/stdc++.h>
#define fi first
#define se second
#define int long long
using namespace std;
const int N = 3e5 + 1;
const int inf = 1e9;
vector <int> e[N];
int h[N], deep[N], sz[N];
int rss = 0;
int where_b;
int a, b;
void dfs(int u, int pr) {
h[u] = deep[u];
sz[u] = 1;
if (u == b)
rss =... | ALGO | 0.999948 | 4.003339 |
a99f60a7-98f5-4063-8777-f0f3e7e9be24 | Dristy03/AlgorithmCourse-codes | greedy/fractional knapsack.cpp | #include<bits/stdc++.h>
using namespace std;
struct node
{
int id,weight;
double profit;
node(int a,double b,int c)
{
id=a;
profit=b;
weight=c;
}
};
bool cmp(node a,node b)
{
return a.profit*b.weight>a.weight*b.profit;
}
int main()
{
vector<node>v;
int i,k,l,... | ALGO | 0.999976 | 3.195157 |
350cde29-1a9b-4d29-9057-e124dc578f7e | merlin82/USACO | frac1.cpp | /*
ID: merlinf1
PROG: frac1
LANG: C++
*/
#include <iostream>
#include <fstream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int n;
bool rprime(int a, int b){
int r = a % b;
while(r != 0){
a = b;
b = r;
r = a % b;
}
return(b == 1);
}
/*
i... | ALGO | 0.999774 | 4.253103 |
5f5a3ca6-5641-49ee-b54f-d1e162d224ad | deepkakadiya7/Solution_-75dayofcoding_challenge | DAY 54 : reverse-nodes-in-k-group in Leetcode.cpp |
class Solution {
public:
ListNode* reverseKGroup(ListNode* head, int k) {
stack<ListNode*> st;
ListNode* temp = head;
ListNode* ans = new ListNode();
ListNode* dummy = ans;
int ind = k;
ListNode* cur = head;
int cnt = 0;
while (cur) {
cn... | ALGO | 0.999989 | 5.748108 |
b5829ea9-d3ed-4832-b4af-227f67494da0 | yeray142/algorithms_design_project | GraphApplication/GraphApplication/SpanningTreeKruskal.cpp | #include "pch.h"
#include "Graph.h"
#include <vector>
#include <queue>
#include <stack>
using namespace std;
// =============================================================================
// SpanningTreeKruskal =========================================================
// =============================================... | ALGO | 0.998786 | 4.257765 |
477c9bd2-b7db-4329-b3c9-a38412e986f3 | pkprajapati7402/Data-Structure-and-Algorithms | 01. Data Structures/03. Queue/Basic Operations/03. Queue using Stacks/queue using two stack.cpp | /* C++ Program to Implement Queue Using Two Stacks
This is a C++ Program to implement queue using stacks. n this method, in en-queue operation, the new element is entered at the top of stack1. In de-queue operation, if stack2 is empty then all the elements are moved to stack2 and finally top of stack2 is returned.
enQu... | ALGO | 0.998029 | 6.776652 |
8ec8231d-233a-4d5e-b778-cfab136683ae | ishandutta2007/codeforces | thenymphsofdelphi/normal/1286/C1.cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// #define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (auto i = (l); i < (r); i++)
#define ForE(i, l, r) for (auto i = (l); i <= (r); i++)
#... | ALGO | 0.999983 | 3.296413 |
2d8f8923-8bf3-4a4a-b3c0-a7390768ab37 | sKAR04/CP-Practice | Codeforces/78/78B.cpp | /*
#####################################################
# I will win.. maybe not immediately but definitely #
#####################################################
*/
#include <bits/stdc++.h>
using namespace std;
//Optimizations
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC ta... | ALGO | 0.999774 | 3.702111 |
962a8893-827e-4c6b-b596-8e799ac0b4aa | NucleaPeon/qt5-sle | qtwebkit/Source/WebCore/platform/graphics/gpu/opencl/FilterContextOpenCL.cpp | #include "config.h"
#if ENABLE(OPENCL)
#include "FilterContextOpenCL.h"
namespace WebCore {
FilterContextOpenCL* FilterContextOpenCL::m_context = 0;
int FilterContextOpenCL::m_alreadyInitialized = 0;
FilterContextOpenCL* FilterContextOpenCL::context()
{
if (m_context)
return m_context;
if (m_already... | TOOL | 0.888186 | 7.148182 |
c56e881b-e33c-46ba-9ff1-9e180ff70c28 | EOEPCA/proc-comm-lib-argo | 3ty/beeblebrox/sources/beeblebrox/Sha1.cpp |
#include <cassert>
#include <cerrno>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
// #include <fstream>
// #include <iomanip>
// #include <iostream>
// #include <sstream>
#include <beeblebrox/Sha1.hpp>
#undef BIG_ENDIAN_HOST
typedef unsigned int u32;
#if defined(__GNUC__) && defined(... | TOOL | 0.960939 | 5.188888 |
e709711d-b068-4d10-8fec-2c612ddc7fbd | Mosina916/AugCBND22C- | Lecture21/check7array.cpp | #include<iostream>
using namespace std;
bool check7ispresentornot(int*arr,int n){
// base case
if(n==0){
return false;
}
// rec case
if(arr[0]==7){
return true;
}
return check7ispresentornot(arr+1,n-1);
}
int main(){
int arr[5]={4,5,3,7,2};
int n=5;
check7ispresentornot(arr,n);
return 0;
} | ALGO | 0.999085 | 3.343085 |
a52d29e8-0301-47d0-852c-ae8ec9d2d8d0 | mrG7/Programming-archives | codejam/AlienBrute.cpp | #include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<stack>
using namespace std;
vector<string> arr;
int l,d,n;
vector<string> lang;
int traverse(string token,vector<string> &aalang,int posn)
{
//for(int i=0;i<aalang.size();i++)cout<<aalang[i]<<" ";cout<<endl;
token = arr[po... | ALGO | 0.999648 | 3.646285 |
18458a5d-9ce5-45de-8fca-ae12fc32608e | pavel-ryzhov/global_vars | runs/007460.cpp | //1.412
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <stdio.h>
//#include <conio.h>
using namespace std;
struct SMYWORD
{
SMYWORD(){};
string str;
int freq;
};
int CharToButton(char *ch);
int main()
{
vector<SMYWORD*>::iterator iwt;
map< vector<int> , vector<SMYWORD*> > mwDic... | ALGO | 0.997003 | 3.353589 |
ab5d2d4d-3626-4570-a4e1-d2f1e40c5dec | snehalp0104/LeetCode-Solutions | 1971-find-if-path-exists-in-graph/1971-find-if-path-exists-in-graph.cpp | class Solution {
public:
void solve(int source,vector<vector<int>> &adj,vector<int> &vis)
{
vis[source]=1;
for(auto i:adj[source])
{
if(!vis[i])
{
solve(i,adj,vis);
}
}
}
bool validPath(int n, vector<vector<int>>& e... | ALGO | 0.999985 | 5.963376 |
cc860ac1-ae7d-475f-b2e2-80869075be43 | tanish5nov/My-CP-template | KMP-LPS.cpp | void getLps(string &pattern, vector<int>&lps) {
int i = 1, len = 0;
lps[0] = 0;
int n = pattern.length();
while (i < n) {
if (pattern[i] == pattern[len]) {
len++;
lps[i] = len;
i++;
} else {
if (len != 0) {
len = lps[len - 1];
} else {
lps[i] = 0;
i... | ALGO | 0.999907 | 5.668103 |
50416001-e5b2-40e0-9c29-1a2d6ee7c6aa | yymin1022/Algorithm_Study | BOJ/15736.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
int N;
cin >> N;
int ans = 1;
while(ans * ans <= N){
ans++;
}
cout << ans - 1 << "\n";
return 0;
}
| ALGO | 0.999874 | 3.984304 |
7c14be0b-da1b-40f5-b9e2-a70892e45830 | gambiTarun/leetcode-submissions | 1680-concatenation-of-consecutive-binary-numbers/1680-concatenation-of-consecutive-binary-numbers.cpp | class Solution {
public:
int concatenatedBinary(int n) {
const int MOD = 1e9+7;
long res=0,l=0;
for(int i=1;i<=n;i++){
if((i&(i-1))==0)
l++;
res = ((res<<l)|i) % MOD;
}
return res;
}
}; | ALGO | 0.99999 | 6.334082 |
3acda3b5-0b06-40ac-9ee0-4e2e5ab272b1 | s-spillias/EMs-with-LLMs | POPULATIONS/POPULATION_0012/CULLED/INDIVIDUAL_AGZ0QHKP/model.cpp | #include <TMB.hpp> // TMB header: provides templated functions and macros for the model
// Model Overview:
// 1. COTS Dynamics: Logistic growth modified by a smooth outbreak-triggered decline.
// 2. Fast-growing Coral (Acropora spp.) Dynamics: Recovery towards full cover minus losses due to COTS predation.
// 3. Slow-... | ALGO | 0.999492 | 7.181821 |
93903c45-ed59-4bdd-87b5-880451d7d65b | SwapnanilHalder/CodingFiles | Google/Kick_Start_k/sec_2.cpp | #include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <list>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <numeric>
#include <unordered_map>
#define pi 3.1415926535897932384626
#defi... | ALGO | 0.99971 | 3.549153 |
6f90145a-68f0-4bcb-aca0-55c89cd09572 | fenghuayumo/UE5Main | Engine/Plugins/Experimental/ProxyLODPlugin/Source/ThirdParty/UVAtlasCode/UVAtlas/geodesics/ApproximateOneToAll.cpp | #include "pch.h"
#include "ApproximateOneToAll.h"
#include "mathutils.h"
using namespace GeodesicDist;
// this does the same job of CExactOneToAll::CutHeapTopData, except that, this does the window merging in addition
void CApproximateOneToAll::CutHeapTopData( EdgeWindow &EdgeWindowOut )
{
for (;;)
{
... | ALGO | 0.999847 | 4.092062 |
f39e320f-aca0-40cd-b6dc-4809f07a3b7f | s2015-turtle/kadomatsu | main.cpp | #include <iostream>
#include <string>
using namespace std;
string nutrient_injection(int length);
int main(int argc, char *argv[])
{
int length = 0;
bool is_nullpoga = false;
cout << endl;
if(argc > 1)
{
try
{
length = stoi(argv[1]);
}
catch(const std::i... | TOOL | 0.912108 | 3.645613 |
add35bc1-b006-4696-8e48-4863032b92d8 | WillStevens/scrollreading | resample_flattened_and_holes.cpp | #include <stdint.h>
#include <stdio.h>
#include <dirent.h>
#include <math.h>
#include <stdlib.h>
#include <unordered_set>
#include <vector>
#include <set>
#include <unordered_map>
#include <string>
#include <algorithm>
#include <utility>
typedef std::vector<std::tuple<float,float,float> > pointSet;
typedef std::vecto... | DATA | 0.984458 | 5.119058 |
2833ebe1-f485-477a-8b33-20a94f57cf9e | nitishhsinghhh/Leet_Cheat | Arrays/C++/1.Two_Sum.cpp | // Time Complexity: O(n)
// Space Complexity: O(n)
// https://en.cppreference.com/w/cpp/container/unordered_map
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> imap;
for (int i = 0;; ++i) {
auto it = imap.find(target - nums[i]);
... | ALGO | 0.999783 | 6.49237 |
06d154d1-8d99-4310-8882-cdbf829ac947 | sahu1993/Reliable-DataTransport-Protocol | ssahu3_pa2/src/simulator.cpp | #include <stdio.h>
#include <stdlib.h>
#include <getopt.h>
#include <ctype.h>
#include <string.h>
#include "../include/simulator.h"
/* Statistics */
int A_application = 0;
int A_transport = 0;
int B_application = 0;
int B_transport = 0;
int win_size;
int TRACE = 1; /* for my debugging */
int nsim = 0; ... | ALGO | 0.991007 | 4.023253 |
6cbb2dee-20c7-45a7-acac-7c2571185712 | tung23102000/contests-CTDLGT | contest 9 CTDL>/Bai2_Chuyen_DS_Ke_Sang_DS_Canh.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
vector< pair<int,int> > ListEdge;
int n;
cin>>n;
cin.ignore();
for(int i=1;i<=n;i++){
string s;
getline(cin,s);
for(int j=0;j<s.length();j++){
if(s[j]>='1'&&s[j]<='9'){
string tmp="";
while(isdigit(s[j])&&j<s.length()){
tmp=tmp+string(1... | ALGO | 0.997274 | 3.625614 |
73281382-f02b-4ba0-8141-4869330b12e8 | sarvex/leetcode-harbour | solution/0500-0599/0583.Delete Operation for Two Strings/Solution.cpp | class Solution {
public:
int minDistance(string word1, string word2) {
int m = word1.size(), n = word2.size();
vector<vector<int>> dp(m + 1, vector<int>(n + 1));
for (int i = 1; i <= m; ++i) dp[i][0] = i;
for (int j = 1; j <= n; ++j) dp[0][j] = j;
for (int i = 1; i <= m; ++i)... | ALGO | 0.999995 | 5.828676 |
b51fbe8b-d409-4cc9-9b43-4eebc9ffd1cc | Sakshiiikashyap/DSA | 01_c++/pass_by_reference/practice1.cpp | #include <bits/stdc++.h>
using namespace std;
//pass by reference ==> where original value is passed.
void doSomething(int &num) {
cout << num << endl;
num += 5;
cout << num << endl;
num += 5;
cout << num << endl;
}
int main() {
int num = 10;
doSomething(num);
cout << num;
return ... | ALGO | 0.985433 | 3.753071 |
cf4fc7e5-b28d-4d5b-ba8d-21b68ae59138 | elixered/leetcode | 1762-buildings-with-an-ocean-view/1762-buildings-with-an-ocean-view.cpp | class Solution {
public:
vector<int> findBuildings(vector<int>& heights) {
vector<int> ans;
int maxi = 0;
for(int i=heights.size()-1; i>=0; i--){
if(heights[i] > maxi){
ans.push_back(i);
maxi = heights[i];
}
}
reverse(an... | ALGO | 0.999977 | 6.140421 |
ee4bc65e-81ce-4b09-ba2b-204a1c899d8f | lucivpav/fast-triplets | step1/libs/graph_cut/maxflow.cpp | /* maxflow.cpp */
#include <stdio.h>
#include "graph.h"
/*
special constants for node->parent
*/
#define TERMINAL ( (arc *) 1 ) /* to terminal */
#define ORPHAN ( (arc *) 2 ) /* orphan */
#define INFINITE_D 1000000000 /* infinite distance to the terminal */
/***************************************************... | ALGO | 0.999445 | 5.421498 |
d17e8115-348b-49cb-a2a7-ee83a5a3f961 | BrunoLevy/geogram | src/lib/geogram/mesh/mesh_topology.cpp | #include <geogram/mesh/mesh_topology.h>
#include <geogram/mesh/mesh.h>
#include <geogram/basic/memory.h>
#include <geogram/basic/logger.h>
#include <stack>
namespace {
using namespace GEO;
/**
* \brief Computes the number of surface vertices that are not isolated.
* \param[in] M the mesh
* \re... | ALGO | 0.945146 | 7.014693 |
1363018f-7399-488b-8064-cdfa6d4c553f | koba-e964/contest | atcoder/code-thanks-festival-2015-open/g.cpp | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | ALGO | 0.999882 | 3.793172 |
32a83017-3a0e-42d2-b3a3-5d692acf3b17 | AnggaRaksa009/Deteksi_Covid | 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 |
93fe1c9f-a2a3-4420-bf29-28a282847beb | Ivan-71-ua/Competitive-Programming | Summer_school/day 6/J_brute.cpp | #include <bits/stdc++.h>
#define int long long
int brute_force(int n) {
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += i / (n / std::gcd(n, i));
}
return sum;
}
int32_t main() {
int n;
std::cin >> n;
std::cout << brute_force(n) << "\n";
return 0;
}
| ALGO | 0.999971 | 4.471671 |
487e0bbb-86d8-4e30-ab14-c7301d82e19b | YellowSquared/Contest_pekus | Source/1_semester/Contest3/H.cpp | #include <cmath>
#include <iostream>
int main() {
double velocity_p = 0;
double velocity_f = 0;
double a = 0;
std::cin >> velocity_p >> velocity_f >> a;
double l = 0;
double r = 1;
double x = 0;
double t = 0;
while (fabs((l + r) / 2 - x) > 0.00001) {
x = (l + r) / 2;
t = (x / (sqrt(x * x + ... | ALGO | 0.99978 | 3.728437 |
cb9e790a-6a26-435c-b277-ec3081da7b80 | ayush-gupta2002/Datastructures-and-Algorithms | eventual-safe-states.cpp | //DFS APPROACH
//{ Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution {
public:
bool dfs(int i,vector<int> graph[],vector<int>& visited,vector<int>& dfsVisited,vector<int>& check){
visite... | ALGO | 0.999967 | 6.791461 |
82b1c7c0-bef8-4e59-acd0-6de114f19e28 | June060522/Algorizm | CodingTest/백준 6825.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
double a, b;
cin >> a >> b;
double c = a / (b * b);
if (c < 18.5f)
cout << "Underweight";
else if (c <= 25)
cout << "Normal weight";
else
cout << "Overweight";
} | ALGO | 0.998854 | 3.443301 |
a9bbc34f-6b37-46ca-bb3a-b558f67f563d | fernandanavamoya/greedyAlgorithms | convexHull.cpp | /*
Convex Hull's ALGORITHM
Finds the line that completely encloses a set of points in a plane so that there are no concavities in the line.
Fernanda Nava Moya - A01023896
06/11/2021
*/
#include <iostream>
#include <stack>
#include <stdlib.h>
#include <vector>
using namespace std;
// Point constructor
struct Point {... | ALGO | 0.999987 | 5.20814 |
44765a17-0bef-48d7-8d5c-59efb878d9e7 | aniket887/Coding-In-CPP | OOPS_C++/36binarysearch.cpp | #include<iostream>
#include<algorithm>
using namespace std;
void show(int a[],int x)
{
for(int i=0;i<x;i++){
cout<<a[i]<<" ";
}
cout<<endl;
}
int main()
{
int a[]={2,5,1,4,8,3,9};
int m=sizeof(a)/sizeof(a[0]);
show(a,m);
sort(a,a+m);
show(a,m);
if(binary_search(a,a+m,8)){
... | ALGO | 0.999895 | 4.44723 |
14d947a5-cd0a-49b8-ab46-92b23f13e4a2 | zero1777/VLSI-Physical-Design-Automation | lab2-2/src/main.cpp | #include <iostream>
// #include "LCN.hpp"
#include "Partition.hpp"
#include <ctime>
using namespace std;
int main(int argc, char *argv[]) {
// verify the needed parameter
if (argc < 4) {
cout << "There are some missed parameters.";
return 0;
}
int times = 1;
int min = -1;
int ... | ALGO | 0.997388 | 4.535994 |
eb9e621b-b503-4c6c-866c-0249c70f0e38 | Link295/Marlin-2.0.x-for-Tevo-v1 | Marlin 2.0.x/MarlinTarantula-EasyConfig-2.0.x/buildroot/share/PlatformIO/variants/LERDGE/variant.cpp | #include "pins_arduino.h"
#ifdef __cplusplus
extern "C" {
#endif
const PinName digitalPin[] = {
PB_12,
PB_13,
PB_14,
PB_15,
PD_8,
PD_9,
PD_10,
PD_11,
PD_12,
PD_13,
PD_14,
PD_15,
PG_2,
PG_3,
PG_4,
PG_5,
PG_6,
PG_7,
PG_8,
PC_6,
PC_7,
PC_8,
PC_9,
PA_8,
PA_9,
PA_10,
PA_11,
PA_12,
PA_13,
PA_1... | CONFIG | 0.919807 | 5.010884 |
8e7719e8-5693-4483-8c75-62bafadbe2a0 | maksiu106/AlgorytmyStrukturyDanychI | Zestaw01/ONP.cpp | #include <iostream>
#include <string>
#include "ArrayStack.hpp"
int main()
{
Stack stos(1000);
std::string result = "";
std::string arg;
while (std::cin >> arg)
{
if (arg == "(") stos.push(int('(')); //nawias otwierajacy idzie na stos; -1 jest jego oznaczeniem
else if (arg == ")") //przy nawiasie zamykajacym... | ALGO | 0.998536 | 4.68051 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.