uuid string | repo_name string | relative_path string | content string | category string | algo_rel_score float64 | quality_score float64 |
|---|---|---|---|---|---|---|
9ec6aa33-4f13-49dd-a9e6-fd5671d9b392 | jocagos/competitive | CodeForces/1064A.cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long i64;
typedef long double ld;
typedef pai... | ALGO | 0.999962 | 4.02823 |
c7413f63-5b9f-454c-a8c5-8e4c45e957ef | ishandutta2007/codeforces | atomicenergy/normal/1491/A.cpp | using namespace std;
#define visual
#ifdef visual
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <assert.h>
#include <functional>
#include <math.h>
#include <string>
#include <ctime>
#endif
#ifndef visual
#include <bits/stdc++.h>
#... | ALGO | 0.999872 | 3.911484 |
988c4742-7831-401d-8104-35081467a9a6 | pankaj-2503/DSA-solved | queue.cpp/queue-imp-ll.cpp | #include<iostream>
using namespace std;
class Qnode{
public:
int data;
Qnode*next;
Qnode(int d){
data=d;
next=NULL;
}
};
class Queue{
public:
Qnode*front,*rear;
Queue(){
front=rear=NULL;
}
void enqueue(int x){
Qnode*temp=new Qnode(x);
// if e... | ALGO | 0.999296 | 3.895658 |
141efc81-ec58-4974-b057-a41c28d6f2bd | joelchaconcastillo/Codeforces | contests/1019_Div2/E/main.cpp | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <tuple>
using namespace std;
const int maxn = 2e5+5;
int n, k, arr[maxn], A, B, p[maxn];
map<int, int> pos;
vector<tuple<int, int, int> > V;
void do_operation(int a, int b, int x){
arr[a] -=x;
arr[b] +=x;
V.push_back({a,b,x});
}
void setvalue(in... | ALGO | 0.999816 | 3.614714 |
5f161968-0b23-42b5-bd91-bdf44140efab | shu8Cream/atcoder-archive | atcoder.jp/pakencamp-2020-day1/pakencamp_2020_day1_b/Main.cpp | /**
* author: shu8Cream
* created: 08.01.2021 10:07:20
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
cin.tie(nullp... | ALGO | 0.999172 | 4.079082 |
c3c2adc8-80df-4ac3-9ba2-6fd666419ac2 | NikoOtiN/coursework | matrix_func.cpp | #include "matrix_func.h"
QVector<double> xVector(QVector<QVector<double>> a, QVector<double> b1)
{
QVector<QVector<double>> b2;
for(auto y : b1)
{
b2.push_back(QVector<double>(1,y));
}
QVector<QVector<double>> aT = transpose(a);
QVector<QVector<double>> atA = multipl(aT,a);
QVector<... | ALGO | 0.999191 | 3.734177 |
1b53938a-606c-438b-8552-b023030e1824 | manojnsut/Leetcode | 354-russian-doll-envelopes/354-russian-doll-envelopes.cpp | class Solution {
public:
int maxEnvelopes(vector<vector<int>>& E) {
sort(E.begin(), E.end(), [](vector<int>& a, vector<int>& b)
-> bool {return a[0] == b[0] ? b[1] < a[1] : a[0] < b[0];});
vector<int> dp;
for (auto& env : E) {
int height = env[1];
int l... | ALGO | 0.999992 | 6.092954 |
17895e51-0096-4508-aff1-3d9413d6f347 | KryptoCrash/cf | permshift.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
void solve() {
ll n, m;
cin >> n >> m;
vi p(n);
for (ll i = 0; i < n; i++) {
cin >> p[i];
p[i]--;
}
vi cnt(n);
for (ll i = 0; i < n; i++) {
ll nw = (i - p[i]) % n;
... | ALGO | 0.999989 | 4.723374 |
538276ac-fb34-4776-8ada-e108d8b9f52e | Shmael13/MyProjects | coding_practice/cpp_projects/cpp_practice/chap11q3.cpp | #include <iostream>
// write your mult function template here
template <typename T>
T mult(T m1, int m2){return m1 * m2;}
int main()
{
std::cout << mult(2, 3) << '\n';
std::cout << mult(1.2, 3) << '\n';
return 0;
}
| ALGO | 0.9937 | 4.649821 |
5503bd8b-1147-47b1-b54f-6c777688cde3 | DiegoNGonzalez/laboratorio1 | guia3/guia3ej7.cpp | //Nombre: Diego Nicolas Gonzalez Valenzuela
//TP N:3
//EJ N:7
/* Comentarios
Hacer un programa que permita ingresar el sueldo de 10 empleados y determine:
El sueldo mximo.
El sueldo mnimo.
El sueldo promedio.
Cantidad de sueldos mayores a $50000.
*/
#include <iostream>
using namespace std;
int main(void)
{
const... | TOOL | 0.924379 | 3.527771 |
6b2b7467-8092-4255-932c-e082209074e5 | lammps-qmdff/lammps-qmdff | lammps-modified/src/USER-OMP/angle_class2_omp.cpp | /* ----------------------------------------------------------------------
Contributing author: Axel Kohlmeyer (Temple U)
------------------------------------------------------------------------- */
#include "angle_class2_omp.h"
#include "atom.h"
#include "comm.h"
#include "force.h"
#include "neighbor.h"
#include "d... | ALGO | 0.99943 | 7.768937 |
1a766b37-e8ba-4f98-aa11-aecd1c6ab1c2 | putriirmaw/IkanSkripsi | 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.998859 | 6.785645 |
a0643f77-f634-435b-a756-60429734aa54 | kysub99/BOJ | 1037.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
int num;
cin >> n;
vector<int> arr(n);
for (int i = 0;i < n;i++) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
cout << arr[0] * arr[n - 1];
} | ALGO | 0.999954 | 4.035511 |
966875aa-ed0f-461b-9c39-4bee8a6fc830 | cycles2022/cc | extlibs/tlx/tlx/digest/sha256.cpp | #include <tlx/digest/sha256.hpp>
#include <tlx/math/ror.hpp>
#include <tlx/string/hexdump.hpp>
#include <algorithm>
namespace tlx {
/*
* LibTomCrypt, modular cryptographic library -- Tom St Denis
*
* LibTomCrypt is a library that provides various cryptographic algorithms in a
* highly modular and flexible manne... | ALGO | 0.980221 | 7.734631 |
f494fb70-8f17-4f39-acf3-1494c212b998 | ishandutta2007/codeforces | alishahali1382/normal/587/E.cpp | #include <bits/stdc++.h>
#if defined(__GNUC__)
#pragma GCC optimize ("Ofast")
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.firs... | ALGO | 0.999904 | 4.478937 |
cc69c750-b94a-4dd1-b1fc-024453bd8734 | AkshatAwadhiya/Leetcode-Solutions | 167-two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.cpp | class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
int n = numbers.size() ;
int left = 0 , right = n-1;
while(left <= right){
if(numbers[left] + numbers[right] == target) return {left+1, right+1};
else if (numbers[left] + numbers[right]... | ALGO | 0.999711 | 6.291368 |
7ae2dee0-7abb-4a1b-a71a-7476c0e11b94 | oneapi-src/SYCLomatic | polly/lib/Transform/DeLICM.cpp | #include "polly/DeLICM.h"
#include "polly/LinkAllPasses.h"
#include "polly/Options.h"
#include "polly/ScopInfo.h"
#include "polly/ScopPass.h"
#include "polly/Support/GICHelper.h"
#include "polly/Support/ISLOStream.h"
#include "polly/Support/ISLTools.h"
#include "polly/ZoneAlgo.h"
#include "llvm/ADT/Statistic.h"
#includ... | ALGO | 0.935494 | 6.560027 |
58956fa4-5882-43dd-9c88-38f7aede3d43 | alpha74/iCC | S/SKMP.cpp |
// Smallest KMP
// https://www.codechef.com/AUG20B/problems/SKMP
// Aman Kumar
/*
INSIGHT:
- See comments
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
#define MOD 1000000007
void func() ;
int main()
{
ios_base::sync_with_stdio( 0 ) ;
cin.tie... | ALGO | 0.999973 | 4.27577 |
9df528ad-8531-40ee-8272-c857eb4c256b | intelek2al/CPP-Marathon | Race01/msavytskyi/3dparty/nanogui/ext/eigen/bench/benchmark.cpp | // g++ -O3 -DNDEBUG -DMATSIZE=<x> benchmark.cpp -o benchmark && time ./benchmark
#include <iostream>
#include <Eigen/Core>
#ifndef MATSIZE
#define MATSIZE 3
#endif
using namespace std;
using namespace Eigen;
#ifndef REPEAT
#define REPEAT 40000000
#endif
#ifndef SCALAR
#define SCALAR double
#endif
int main(int ar... | ALGO | 0.993828 | 3.675187 |
5d7777d4-6b15-48eb-aff2-af8669309ef9 | Namoz007/homework_27 | 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 |
4fb737e4-03f8-4d77-bf78-17e7e3a3761e | NEWIR295/ROS_PID_TUNNING | ROS_PID_TUNNING_ws/src/pid_tunning/src/get_pid.cpp | #include <ros/ros.h>
#include "pid.h"
#include <std_msgs/Float32.h>
std_msgs::Float32 feedBack;
void enc_cb(const std_msgs::Float32 &wheel_ang_vel) {
feedBack = wheel_ang_vel;
}
/* Main function for PID node*/
int main(int argc, char** argv) {
ros::init(argc, argv, "getPid");
ros::NodeHandle n;
ros::... | TOOL | 0.88111 | 5.811807 |
61f4ac66-55b6-41c9-abcb-986ea76f7d17 | trinhminhtriet/leetcode | solutions/3400-3499/3476.maximize-profit-from-task-assignment/Solution.cpp | class Solution {
public:
long long maxProfit(vector<int>& workers, vector<vector<int>>& tasks) {
unordered_map<int, priority_queue<int>> d;
for (const auto& t : tasks) {
d[t[0]].push(t[1]);
}
long long ans = 0;
for (int skill : workers) {
if (d.contain... | ALGO | 0.999975 | 5.929224 |
0c688adf-a91d-4338-8a72-66dc6731f0a4 | ghts2110/competitive_programing | uva/Happy Numbers/Happy_Numbers.cpp | #include <iostream>
#include <vector>
#include <string>
#include <map>
using namespace std;
vector<int> v(100000);
void solution(){
for(int i = 1; i <= 99999; i++){
int cont = 1;
int no = i;
map<int, bool> mp;
while(no != 1){
cont++;
string s = to_string(n... | ALGO | 0.999833 | 4.079342 |
605b7d3e-bcfe-429e-860d-9c8eef757a4c | ballider/Segment_Tree | Single_operations/base_operation/cntMin.cpp | // segment tree for count min on segment
#include <iostream>
#include <vector>
struct Node{
int64_t min; // min on segment
int64_t count; // count element, which is equal to min on segment
Node(int64_t m, int64_t c): min(m), count(c) {};
};
struct segment_tree{
int64_t size;
std::vector<Node... | ALGO | 0.999954 | 4.878983 |
efe5040b-f8ee-42e0-ab37-4b2a62d2a2db | ReusTylor/leetcode_practice | leetcode/面试题目/星环科技.cpp | //
// Created by guessever on 23-8-6.
//
#include <iostream>
#include <cmath>
/*
bool isPerfectSquare(int num) {
int sqrtNum = sqrt(num);
return sqrtNum * sqrtNum == num;
}
int countPerfectSquarePairs(int n) {
int count = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (isPerfect... | ALGO | 0.999859 | 5.235985 |
5a25c2d8-b8a6-4a9e-a4b3-1bb5a5e6953c | manishsingh0418/Language-and-DSA- | Practice Problem/Recursion/BaseCase.cpp | #include<iostream>
using namespace std;
void fun1(int n)
{
if(n==0)
{
return;
}
cout<<"Manish \n";
fun1(n-1);
}
int main(){
int n;
cin>>n;
cout<<endl;
fun1(n);
} | ALGO | 0.999843 | 3.581339 |
e79a38e3-4304-43c9-8f36-aa6842f4dff8 | akshita1204/PrimeBatchCodes | Searching/Day1/3.cpp | //{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
int findExtra(vector<int>& a, vector<int>& b) {
// add code here.
int i=0,j=a.size();
while(i<j)
{
int mid=(i+j)/2;
if(a[mid]==b[mid]) i=mid... | ALGO | 0.999579 | 5.558432 |
1d1967c2-5e73-4435-99eb-fcba8ff324bc | Kamlesh-Mahar/LeetCode-Problems | 847. Shortest Path Visiting All Nodes.cpp | class Solution {
public:
int shortestPathLength(vector<vector<int>>& graph) {
int n = graph.size();
int targetMask = (1 << n) - 1;
vector<vector<int>> visited(n, vector<int>(1 << n, 0));
queue<pair<int, int>> q;
for (int i = 0; i < n; ++i) {
q.push({i, 1 << i});
... | ALGO | 0.999788 | 6.119975 |
63d50f15-de38-472c-889f-ee8f16f3ca9d | Y-ang/c_plus_plus | CodeCaprice/code/6.BTree/lc530二叉搜索树的最小绝对差.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | ALGO | 0.999991 | 6.609309 |
afec50f8-cd14-4b4b-9e70-5d077e45f053 | Muhammad-Al-Halaby/Competitive-Programming-Submissions | codeforces/761/C.cpp | #include <bits/stdc++.h>
using namespace std;
#define OnlineJudge1
#define loop(x,a,n) for(int x = a;x < n;x++)
#define NumofDigits(n) ((int)log10(n)+1)
#define CountofNumber(array,n,x) (upper_bound(array, array+n, x)-lower_bound(array, array+n, x))
#define readline(s) getline(cin,s)
#define PB push_back
#define MP... | ALGO | 0.999833 | 3.967677 |
d78a3f27-a12e-4991-a491-3a347cbcfd78 | ishandutta2007/codeforces | duality/normal/1368/F.cpp | #define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printA... | ALGO | 0.999818 | 3.050309 |
e251efed-6382-48ff-aa60-b361a871ddc9 | shantanu726/Binary-Tree | BurningTree.cpp | //{ Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
struct Node {
int data;
Node *left;
Node *right;
Node(int val) {
data = val;
left = right = NULL;
}
};
Node *buildTree(string str) {
// Corner Case
if (str.length() == 0 || str... | ALGO | 0.99978 | 6.424869 |
fb28088e-8c1f-4a67-b83d-399512e92bf5 | ishandutta2007/codeforces | aarr/normal/1102/A.cpp | #include <iostream>
#include <algorithm>
#include <set>
#include <iomanip>
#include <vector>
#include <cmath>
#include <map>
using namespace std;
const int N = 100 * 1000 + 5;
const int inf = 1000 * 1000 * 1000 + 7;
int a[N];
int get(int x, int y) {
return (x >> y) & 1;
}
bool pal(string s) {
for (int i = 0; i < ... | ALGO | 0.999697 | 3.848082 |
49eb52d6-9a2a-4941-8e8f-f80d0d14c870 | MattiaCorradini/esercizi_3_superiore | programmi C++ vettoriarray/senza_vettori/main.cpp | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >>a >>b >>c >>d;
float media= (a+b+c+d)/4;
if (a>media)
cout <<"gennaio" <<endl;
if (b>media)
cout <<"febbraio" <<endl;
if (c>media)
cout <<"marzo" <<endl;
if (d>media)
cout <<"aprile" <... | ALGO | 0.997692 | 3.713245 |
1a50ac0b-81b7-48e5-aad4-48c6711b982d | ishandutta2007/codeforces-k | kobor/normal/1344/A.cpp | // Krzysztof Boryczka
#pragma GCC optimize "O3"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3f;
#define FOR(i, b, e) for(int i=b; i<=e; i++)... | ALGO | 0.999691 | 4.46685 |
2c3fe925-9a61-4714-9623-9217f1118d6c | a8uhnf/uVa | 820 - Internet Bandwidth.cpp | /*
ID: hanifbo1
PROG: ride
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
#define DD double
#define llu unsigned long long
#define eps 0.000001
#define FastIO ios_base::sync_with_stdio(0); cin.tie(0)
#define READ(f) freopen(f,"r",stdin)
#define WRITE(f) freopen(f,"w"... | ALGO | 0.999027 | 3.690494 |
ecfaf75b-596c-4855-ad85-6f14b8421082 | MikelBarajas38/Grindset | codeforces/2093/B.cpp | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
void solve() {
string num;
cin >> num;
int n = num.size();
int i = ... | ALGO | 0.999666 | 5.737476 |
1086af31-2ec7-4cab-a793-01e192afecf1 | Fabayu/Leetcode-problems | 59-spiral-matrix-ii/59-spiral-matrix-ii.cpp | class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> res(n,vector<int> (n));
if(n==0){
return res;
}
int count=1;
int rowbeg=0;
int rowend=n-1;
int colbeg=0;
int colend=n-1;
while(rowbeg<... | ALGO | 0.999927 | 5.970891 |
8f16c0aa-d499-48f8-b50b-72f01f00a3dc | VeerRavi97/CompetitiveCoding | My Booklet/5.Number Theory/Prime.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define all(c) c.begin(), c.end()
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0);
const ll MOD=1e9+7;
vi primes;
#define upperbound 1000000
bitset<1000010>bs;
void sieve(){
bs.set();
bs[0]=bs[... | ALGO | 0.99988 | 4.836921 |
6a621ee4-7e49-4585-b54f-221cd72c7787 | dispact-97/CodingTestRepo | CodingTest/CodingTest/24_12_17_01.cpp | // 9012
// https://www.acmicpc.net/problem/9012
#include <iostream>
#include <string>
#include <stack>
using namespace std;
string check(string input)
{
stack<char> word;
for (int i = 0; i < input.size(); i++)
{
if (input[i] == '(')
{
word.push('(');
}
else
{
if (word.empty())
{
return "N... | ALGO | 0.999618 | 5.300565 |
29a1f519-c023-4205-aaa3-620d9adb4884 | newpolaris/algorithm | baekjoon/1300.cpp | #include <cstdio>
#include <cstdint>
#include <algorithm>
int n, k;
int main() {
scanf("%d %d", &n, &k);
int64_t lo = 0, hi = 1'000'000'000 + 1;
while (lo + 1 < hi) {
int mid = (lo + hi) / 2;
int64_t cnt = 0;
for (int i = 1; i <= n; i++)
cnt += std::min(mid/i, n);
... | ALGO | 0.999978 | 3.610211 |
c0763eba-14e9-4637-974e-bae490bc690a | ishandutta2007/codeforces | danya090699/normal/920/C.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
//freopen("input.txt", "r", stdin);
int n, yk=0;
cin>>n;
int ar[n];
for(int a=0; a<n; a++) cin>>ar[a];
char sv[n-1];
for(int a=0; a<n-1; a++) cin>>sv[a];
while(yk<n)
{
int st=yk;
while(yk+1<n)
{
... | ALGO | 0.999998 | 3.862845 |
fa0d8072-0aa2-4259-8b46-3e4d692fa798 | linkeLi0421/llvm-project15-IRDumperPass | llvm/utils/TableGen/GlobalISel/GIMatchTree.cpp | #include "GIMatchTree.h"
#include "GIMatchDagPredicate.h"
#include "../CodeGenInstruction.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/Format.h"
#include "llvm/Support/ScopedPrinter.h"
#include "llvm/Support/raw_ostream.h"
#include "llvm/TableGen/Error.h"
#include "llvm/TableGen/Record.h"
#define DEBUG_... | TOOL | 0.983312 | 7.812094 |
b59853fd-e908-4a32-9341-10c7f4d76c86 | ishandutta2007/codeforces | ruchiose/normal/392/A.cpp | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#define i64 long long
#define fortodo(i, f, t) for (i = f; i <= t; i++)
using namespace std;
i64 N, Far;
int main()
{
scanf("%I64d", &N);
if (N == 0)
{
printf("1\n");
return 0;
}
... | ALGO | 0.999937 | 3.677553 |
f440f645-7715-4bad-8b32-9c68dd262117 | TONYBRYANT1/ZUO---algorithm-and-data-strcuture | CODE/50.Two-pointer algorithm/6.Heaters/code.cpp | // 最小供暖距离：
// 让房屋选择最合适的供暖器
// 两点注意：
// 当一个房屋和两个供暖器的距离相等时，选择下一个供暖器
// 1）因为后面的房屋也要选择供暖器，方便后面的房屋选择
// 2）多个供暖器肯能同时出现在一个地方，如果不选择下一个供暖器
// 会导致永远锁死在之前重复的供暖器上，导致无法正确的选择后面的供暖器
// eg：
// houses: 10
// heaters: 3 3 3 3 7
// 会永远锁死在位置为 3 的供暖器上，导致无法选中 7 位置的供暖器
#include<bits/stdc++.h>
using... | ALGO | 0.999914 | 4.787872 |
afa7e8a6-cee2-4a59-9471-f55f504e3009 | raihanuldev/Data-Structure | module-23 Priority-Queue/map.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
map<string,int> mp;
mp["hamim"] = 2;
mp["tamim"] = 2;
mp["samim"] = 2;
mp["namim"] = 2;
for(auto it = mp.begin(); it!=mp.end(); it++){
cout<<it->first <<" "<<it->second<<endl;
}
if(mp.count("hamim")){
cout<<"Ach... | ALGO | 0.99443 | 3.472604 |
5e09ecb5-27e1-4f64-b165-c57276694170 | mohitmishra786/hacktoberfest-2022 | Competitive Coding/Codechef/Dazzling_GCD_Pair.cpp | #include <iostream>
#include<vector>
using namespace std;
int gcd(int a, int b){
if(b==0){
return a;
}
return gcd(b, a%b);
}
pair<int, int> gcdPair(int s, int e){
pair<int, int> ans;
ans.first = -1;
ans.second = -1;
for(int i=s;i<e;i++){
for(int j=i+1; j<=e; j++){
... | ALGO | 0.99995 | 3.779836 |
9baebc16-d9cd-4edd-b0b6-3087f8115555 | gzgreg/ACM | 2015-12-05/e.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
int n, m;
while(cin >> n){
if(n == 0)break;
vector<vector<pair<int, int> > > adj;
map<int, double> prob;
cin >> m;
for(int i = 0; i < n; i++){
vector<pair<int, int> > empty;
adj.push_back(empty);
prob[i] = 0;
}... | ALGO | 0.999811 | 4.067541 |
3cba6ab2-dd2e-418f-9620-3e4820dfba51 | sweta-singh28/DSA | Pointers/PointersQ17.cpp | #include <iostream>
using namespace std;
int main() {
float arr[5] = {12.5,10.0,13.5,90.5,0.5};
float* ptr1 = &arr[0];
float* ptr2 = ptr1+3;
cout<<ptr2<<" "<<endl;
cout<<ptr2-ptr1<<endl;
return 0;
} | TOOL | 0.998006 | 3.47653 |
c9e8894f-cc43-449b-bde8-9a809e4da939 | LeeJaeJun1/Baekjoon | 프로그래머스/2/42577. 전화번호 목록/전화번호 목록.cpp | #include <string>
#include <vector>
#include <map>
using namespace std;
bool solution(vector<string> phone_book) {
map<string,int> m;
for(int i = 0; i < phone_book.size(); ++i) {
m[phone_book[i]]++;
}
for(int i = 0; i < phone_book.size(); i++) {
for (int j = 1; j < phone_book[i].s... | ALGO | 0.999771 | 5.309122 |
3fbda00b-3062-487b-a8ef-2cc7180baf93 | Charles1026/CS4223 | ass2/processor.cpp | #include "processor.h"
#include "architecture.h"
#include "cache.h"
namespace Processor {
CPU::CPU(std::array<std::vector<Architecture::Instruction>, Architecture::NUM_CORES>&& instructionsByCore, Cache::COHERENCE_PROTOCOL protocol) {
for (int i = 0; i < Architecture::NUM_CORES; ++i) {
m_cores[i].instructions.s... | ALGO | 0.995142 | 6.206637 |
919d92d9-35e2-42bf-8fb3-f02cae63fd41 | Altera520/problem-solving | boj/silver/12852.cpp | #include <iostream>
#define LEN 1000001
#define INF 1e9;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
int d[LEN] = {0};
d[0] = 0;
cin >> n;
for(int i=1; i<=n; i++){
int div2 = i%2==0 ? d[i/2] : INF;
int div3 = i%3==0 ? d[i/3] : I... | ALGO | 0.999981 | 3.667877 |
c4504bf6-294d-4a8e-a5e0-695519e364ea | PravCoder/Numpy_From_Scratch_Cpp | main.cpp | // ==================================================
// Class LMAT: Linear Algebra Matrix Operation Tool
// ==================================================
#include <iostream>
using namespace std;
#include <vector>
#include <iostream>
#include <vector>
#include <cstdlib> // for rand() and srand()
#include <ctime>... | ALGO | 0.98822 | 3.857463 |
576826d6-9aa8-4218-b493-d48693f8c106 | ProjectKinesis/platform_frameworks_av | media/module/codecs/amrnb/common/src/div_s.cpp | /*
Pathname: ./gsm-amr/c/src/div_s.c
------------------------------------------------------------------------------
REVISION HISTORY
Description: Created separate file for the div_s function. Sync'ed up
with the current template and fixed tabs.
Description: Making changes based on review meeting.
Des... | ALGO | 0.999713 | 5.724687 |
846a3ce3-da2b-4529-b952-0b8f1d207099 | milmillin/comp-prog | Sunday/K1Bit.cpp | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
long long mem[5000][30];
void init() {
mem[0][0]=1;
mem[1][0]=1;
mem[1][1]=1;
for (int i=2;i<5000;i++) {
mem[i][0]=1;
for (int j=1;j<=min(20,i);j++) {
mem[i][j]=mem[i-1][j-1]+mem[i-1][j];
... | ALGO | 0.999981 | 3.078651 |
cd46a665-038f-4b44-ad1c-ac7dd7cc69f0 | andeplane/AtomifyVisionPro | LAMMPS/src/fix_acks2_reaxff.cpp | // clang-format off
/* ----------------------------------------------------------------------
Contributing author: Stan Moore (Sandia)
------------------------------------------------------------------------- */
#include "fix_acks2_reaxff.h"
#include "atom.h"
#include "citeme.h"
#include "comm.h"
#include "error.... | ALGO | 0.996919 | 7.14954 |
c8e112c8-86b3-42fe-a410-992cb65a9d51 | Halffilled18/DSA-SUPREME-2-0-NOTES-master | DSA SUPREME 2.0 CODES/13. CLASS CODE/PROGRAM01.CPP | // Program 01: Divide two number using Binary search without using any / and % operator
#include<iostream>
using namespace std;
// Divide two number using Binary search
int getQuotient(int dividend,int divisor){
int s = 0;
int e= dividend;
int mid = s+(e-s)/2;
int ANS = -1;
while (s<=e)
{
... | ALGO | 0.999822 | 5.016425 |
3e14c0f4-c56c-4cca-a201-ad149cc3bd19 | Shipu8644/Common-problems-of-UVA | 195 - Anagram.cpp | #include <bits/stdc++.h>
using namespace std;
bool comparator(char a, char b){
if(tolower(a) == tolower(b)){
return a<b;
}
return tolower(a) < tolower(b);
}
int main()
{
string s;
int t;
cin>>t;
getchar();
while(t--){
cin>>s;
sort(s.begin(),s.end(),comparator);
do{
... | ALGO | 0.999963 | 4.790607 |
e9e0c1c6-e3b6-4222-aaf6-7a88a7702773 | 113bommy/deepmind_codecontests_refine | cpp_gold_filter_file/cpp_train_5679_9.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1010;
const int M = 200100;
int n, m, q;
int u[M], v[M];
int dp[N], ans[M];
void calc(vector<pair<pair<int, int>, pair<int, int> > >& vec, int _) {
for (int i = 1; i <= n; i++) dp[i] = m + 1;
for (int i = m; i >= 1; i--) {
dp[_] = i;
if (dp[u[i]] <... | ALGO | 0.99997 | 4.335327 |
97219a6e-f395-4584-9e3c-601602f1b33e | windbicycle/oru-ros-pkg | grasping_oru/aass_icr/libicr/icrcpp/tools/eigen-eigen-3.0.2/test/eigen2/eigen2_sparse_solvers.cpp | #include "sparse.h"
template<typename Scalar> void
initSPD(double density,
Matrix<Scalar,Dynamic,Dynamic>& refMat,
SparseMatrix<Scalar>& sparseMat)
{
Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols());
initSparse(density,refMat,sparseMat);
refMat = refMat * refMat.adjoint();
for (i... | TEST | 0.933516 | 4.982318 |
875aee47-e160-4e21-96cf-a4a4de5310ac | Promethe-us/gtsam | gtsam_unstable/slam/Mechanization_bRn2.cpp | /**
* @file Mechanization_bRn2.cpp
* @date Jan 25, 2012
* @author Chris Beall
* @author Frank Dellaert
*/
#include "Mechanization_bRn2.h"
namespace gtsam {
/* ************************************************************************* */
Mechanization_bRn2 Mechanization_bRn2::initializeVector(const std::list<Vect... | ALGO | 0.969614 | 7.000998 |
bbe64753-d4a1-45d1-94ec-982bd67d8abe | pratham-25/SEM_8_SPPU_COMP | Codes_HPC/Assignment_1_v1.cpp | #include<bits/stdc++.h>
#include<omp.h>
#include<chrono>
using namespace std;
class Graph {
int V;
vector<vector<int>> adj;
public:
Graph(int V) {
this->V = V;
adj.resize(V);
}
void addEdge(int u, int v) {
adj[u].push_back(v);
adj[v].push_back(u);
}
void B... | ALGO | 0.999033 | 5.801468 |
166cc59f-f786-4abf-858b-4cea743708ff | DrSwad/CP | Submissions/ICPC/AWC/2021/J.cpp | #include <bits/stdc++.h>
using namespace std;
void test_case() {
int n;
cin >> n;
vector<string> grid(n);
for (auto &row : grid) cin >> row;
const int dim_r = 3, dim_c = 7;
function<bool(int, int, int, int)> check_corners = [&](int r_u, int r_d, int c_l, int c_r) {
char c = grid[r_u][c_l];
if (g... | ALGO | 0.999509 | 4.316606 |
466f1ae0-1104-491b-8529-20f1d6d5e93d | ThoseBygones/ACM_Code | JSK（计蒜客）/JSK Islands.cpp | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
using namespace std;
#define MAXN 10005
#define MAXE 100010
struct Edge
{
int to;
int next;
} e[MAXE];
//int g[MAXN][MAXN];
int head[MAXN];
int out[MAXN],in[MAXN];
int dfn[MAXN]; //第一次访问的步数
int low[MAXN]; ... | ALGO | 0.999885 | 4.770153 |
ca82ae60-46d8-4936-9583-079312129d33 | ArseniAnishchanka/leetcode | 0834. Sum of Distances in Tree.cpp | class Solution
{
public:
vector<int> sumOfDistancesInTree(int n, vector<vector<int>>& edges)
{
vector<vector<int>> graph(n, vector<int>());
for (auto edge : edges)
{
graph[edge[0]].push_back(edge[1]);
graph[edge[1]].push_back(edge[0]);
}
... | ALGO | 0.999926 | 5.5018 |
095698c1-4d02-4515-8f46-8e3afee8fb55 | danilolucasmd/programming-solutions | uri/UOJ_1161 - (1537415) Accepted.cpp | #include <cstdio>
#include <cstring>
long long int rfat[21];
long long int fat(long long int n){
if (rfat[n] != 0)
return rfat[n];
if (n <= 1)
rfat[n] = 1;
else
rfat[n] = n * fat(n - 1);
return rfat[n];
}
int main(){
long long int x, y;
memset(rfat, 0, sizeof(rfat));
... | ALGO | 0.99991 | 4.361558 |
4a3dda9d-a361-4a3a-bd56-42a804a94ee6 | alexandraback/datacollection | solutions_2645486_0/C++/ush/B-small.cpp |
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <list>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
using namespace std;
#define R... | ALGO | 0.9999 | 3.681341 |
68cbdc41-6b6f-44b4-8a41-d32410d08631 | ishandutta2007/codeforces | kmjp/normal/414/B.cpp | #include <cstdlib>
#include <cstring>
#include <memory>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <cmath>
#include <string>
#include <sstream>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
typedef signed long long ll;... | ALGO | 0.999963 | 3.921759 |
64cbccbc-d848-4795-a347-9266787be755 | amanBhawsar/Coding-Tree | CODECHEF/Problems/ANUWTA.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >>t;
while(t--){
long n;
cin >> n;
cout << (n*(n+3))/2 << endl;
}
return 0;
}
| ALGO | 0.99967 | 5.177238 |
f3217238-d185-4827-99bf-f5f29864a65b | katzhang/algorithms-in-cplusplus | 5.13.knapsack-dp.cpp | /*
author: Robert Sedgewick
PROG: Knapsack problem (dynamic programming)
*/
#include <iostream>
using namespace std;
typedef struct {
int size;
int val;
} Item;
int knap(int M) {
static int maxKnown[M];
static int itemKnown[M];
int i, space, max, maxi = 0, t;
if (maxKnown[M] != 0) return maxKnown[M];
for (i ... | ALGO | 0.999987 | 4.835764 |
49aec5e8-1cbf-4d0b-b615-7bc101fa0a84 | chenghanpeng/jdk12 | src/hotspot/cpu/aarch64/macroAssembler_aarch64_trig.cpp | #include "precompiled.hpp"
#include "asm/assembler.hpp"
#include "asm/assembler.inline.hpp"
#include "runtime/stubRoutines.hpp"
#include "macroAssembler_aarch64.hpp"
// The following code is a optimized version of fdlibm sin/cos implementation
// (C code is in share/runtime/sharedRuntimeTrig.cpp) adapted for AARCH64.
... | ALGO | 0.974788 | 6.082732 |
172cdadb-3846-472e-9c36-de4180dc2312 | ShawTarstar/My-learning | 2023.10/23.10.31 简单偶数和.cpp | #include<stdio.h>
int main(){
int n,i,a;
int sum=0;
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<n;i++)
{
scanf("%d",&a);
if(a%2==0)
sum+=a;
}
printf("%d",sum);
}
}
| ALGO | 0.999819 | 3.274665 |
5e38390a-0bbc-4d56-a49e-1abcfd85b733 | MihirSinghYadav/programming-basics | C++/Object Oriented Programming in C++/17.cpp | #include <iostream>
using namespace std;
#include <conio.h>
enum itsword
{
NO,
YES
};
int main()
{
itsword isWord = NO;
char ch = 'a';
int wordcount = 0;
cout << "Enter a phrase:\n";
do
{
ch = getche();
if (ch == ' ' || ch == '\r')
{
if (isWord == YES)... | TOOL | 0.998005 | 3.679086 |
c324db10-9fce-4cf4-987a-d6d12939fcac | luhsra/melf-linker | src/clang-tools-extra/clangd/unittests/LSPClient.cpp | #include "LSPClient.h"
#include "gtest/gtest.h"
#include <condition_variable>
#include "Protocol.h"
#include "TestFS.h"
#include "Transport.h"
#include "support/Threading.h"
#include "llvm/Support/Path.h"
#include "llvm/Support/raw_ostream.h"
#include <queue>
namespace clang {
namespace clangd {
llvm::Expected<llvm:... | TEST | 0.857728 | 7.607932 |
4924e7b4-ea0a-489a-ae2f-2fdfc4e48a3b | VilBRabad/DSA-Practice | xDSA/G10_Distance_of_nearest_1.cpp | /*prblm : Given a binary grid of n*m. Find the distance of the nearest 1 in the grid for each cell. The distance is calculated as |i1 - i2| + |j1 - j2|, where i1, j1 are the row number and column number of the current cell, and i2, j2 are the row number and column number of the nearest cell having value 1 */
#include<... | ALGO | 0.999956 | 5.566257 |
3af98cf7-1a28-4004-9aeb-3abaf880c496 | atrainag/code-repo | Codeforces/Round858/A.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <utility>
#include <cmath>
#include <iomanip>
#include <map>
#include <stack>
#include <string>
#include <cstring>
#define all(x) x.begin(),x.end()
#define last(x) x.size()-1
#define ll long long
#define vi vector<int>
#define pi pair... | ALGO | 0.999295 | 3.715721 |
3271c981-d7fc-4dab-a823-4f06fdca14b2 | nimesh00/QR_CODE | samples/cpp/squares.cpp | // The "Square Detector" program.
// It loads several images sequentially and tries to find squares in
// each image
#include "opencv2/core.hpp"
#include "opencv2/imgproc.hpp"
#include "opencv2/imgcodecs.hpp"
#include "opencv2/highgui.hpp"
#include <iostream>
#include <math.h>
#include <string.h>
using namespace cv;... | TOOL | 0.996533 | 6.066232 |
41b84df2-e917-4389-9f9b-74a80ddf17ee | Edmig1/Czao | ativ19.cpp | #include <iostream>
using namespace std;
main(){
setlocale(LC_ALL, "Portuguese");
float an;
cout << "informe algum ngulo do tringulo";
cin >> an;
if(an == 90){
cout << "Seu tringulo retngulo, pois possui ngulos de 90 graus";
}
if(an > 90){
cout << "Seu Tringulo Obtusngulo, pois possui um ngulo maior... | ALGO | 0.97753 | 3.716503 |
1a9ad656-36bd-46ff-a1f1-df1c85f8b3f8 | ahhda/ctci | 1.3.cpp | #include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
bool check(char *s1, char *s2){
int arr[256] = {0};
if(strlen(s1) != strlen(s2))
return false;
int i;
for(i=0;i<strlen(s1);i++){
arr[s1[i]-'0']++;
}
for(i=0;i<strlen(s2);i++){
arr[s2[i]-'0']--;
if(arr[s2[i]-'0'] < 0)
return f... | ALGO | 0.99999 | 4.045091 |
939aefe6-55ba-4a03-89fd-9d11cd46e3b0 | yzzupgo/MFTCG | Data/abc206_a/yoshinoya/wa/24998554.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
N = floor(N * 1.08);
if(N == 206) {
cout << "so-so" << endl;
} else if(N > 200) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
return 0;
}
| ALGO | 0.999361 | 3.039116 |
6cd85571-2114-447a-a165-76bd8dc4c63b | rtdev-com/cloud-renderer-project | ext/nanogui/ext/eigen/doc/examples/Tutorial_BlockOperations_block_assignment.cpp | #include <Eigen/Dense>
#include <iostream>
using namespace std;
using namespace Eigen;
int main()
{
Array22f m;
m << 1,2,
3,4;
Array44f a = Array44f::Constant(0.6);
cout << "Here is the array a:" << endl << a << endl << endl;
a.block<2,2>(1,1) = m;
cout << "Here is now a with m copied into its cent... | ALGO | 0.961686 | 3.331377 |
ce7b87a3-8b34-4b9c-9bb3-0b9a9658d063 | JulianStremel/mrdiy_canabus | esp32_savvycan/lib/FastLED/src/noise.cpp | /// @file noise.cpp
/// Functions to generate and fill arrays with noise.
/// Disables pragma messages and warnings
#define FASTLED_INTERNAL
#include "FastLED.h"
#include <string.h>
// Compiler throws a warning about stack usage possibly being unbounded even
// though bounds are checked, silence that so users don't s... | ALGO | 0.98564 | 6.46633 |
45478283-bdcd-4d22-802c-c65c69ab6ca2 | Ckend/myLeetcode | 1.twosum/1.twosum/main.cpp | #include <iostream>
#include <vector>
#include <map>
#include <iterator>
class soluction{
public:
std::vector<int>twosum(std::vector<int>& nums,int target){
std::vector<int>result;
std::map<int, int>mymap;
for(int i = 0; i < nums.size(); ++i){
int forfind = target - nums[i];
... | ALGO | 0.999056 | 5.18869 |
fee57d75-ee0d-4b02-8080-620e92bec450 | Soham-Chaudhuri/My-CPP-practice | 1335B.cpp | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long double ld;
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<vector<lli>> vvlli;
typedef vector<lli> vlli;
typedef vector<ull> vull;
typedef pair<lli, lli> plli;
#define max3(a,b,c) max(max((a),(b)),(c))
#defin... | ALGO | 0.998937 | 3.483344 |
808cf736-248a-4fa2-b5fe-7f0a28dc3846 | ishandutta2007/codeforces | nebuchadnezzar/normal/638/B.cpp | #include <cstdio>
int const N = 222;
int next[N];
bool was[N];
bool slave[N];
char s[N];
int main() {
int n;
scanf("%d ", &n);
for (int i = 0; i < n; ++i) {
gets(s);
for (int i = 0; s[i]; ++i) {
was[s[i]] = true;
if (s[i + 1]) {
next[s[i]] = s[i + 1];
slave[s[i + 1]] = true;
}
}
}
int siz... | ALGO | 0.99998 | 3.399997 |
f1233170-d822-47ec-adcd-63e57a85cf35 | ayles/A2D | thirdparty/box2d/Box2D/Dynamics/b2WorldCallbacks.cpp | #include "Box2D/Dynamics/b2WorldCallbacks.h"
#include "Box2D/Dynamics/b2Fixture.h"
// Return true if contact calculations should be performed between these two shapes.
// If you implement your own collision filter you may want to build from this implementation.
bool b2ContactFilter::ShouldCollide(b2Fixture* fixtureA, ... | TOOL | 0.923485 | 7.17191 |
75bc6c44-aef2-4740-8bb2-6e24fd723c11 | adityaparmar9813/daily-leetcode | find_words_containing_character.cpp | class Solution {
public:
vector<int> findWordsContaining(vector<string>& words, char x) {
vector<int> ans;
for (int i = 0; i < words.size(); i++) {
for (char ch : words[i]) {
if (ch == x) {
ans.push_back(i);
break;
}
}
}
return ans;
}
};
// Time Complexity : O(n * m)
// Space Com... | ALGO | 0.99964 | 6.209406 |
e4892e53-7540-42b7-bbaa-12e6a982ffab | ThiagoFBastos/programacao-competitiva | beecrowd/2013 - No Máximo Duas Vezes.cpp | #pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("sse,mmx,sse2")
#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;
template<class T>
using ordered_set = tree <T, null_type , less<T> , rb_tree_tag , tree_... | ALGO | 0.999885 | 5.013387 |
4d2a657e-b8a4-4de9-bbcc-dd2844a42c71 | srishtiprasadmanit12/Data-Structure-Algorithm | min-max-heap/maxSubsequenceScore.cpp |
////////////////////////IMPORTANT QUESTION \\\\\\\\\\\\\\\\\\\\\\\\
class Solution {
public:
long long maxScore(vector<int>& nums1, vector<int>& nums2, int k) {
int n=nums1.size();
vector<pair<int,int>>vec(n);
for(int i=0;i<n;i++){
vec[i]={nums2[i],nums1[i]};
}
... | ALGO | 0.999971 | 4.731667 |
26faf1c8-1bf2-44cf-9dd9-de780cd422e4 | klingz1/PNC | Driver.cpp | // Name: Zachary, Giancarlo
// Course: CSC 260, Section 01
// Semester: Spring 2013
// Instructor: Dr. Pulimood
// Assignment Perfect Number Checker
// Description: Checks numbers to see if they are perfect
// Filename: Driver.cpp
// Last modified on: 2/12/13
#include <iostream>
#include "fus.h"
using namespace std;
... | ALGO | 0.99196 | 4.403387 |
5ff6573c-837a-4a65-bd02-203f0918cf94 | imring/apptime | src/process/process_system_unix.cpp | #include "process/process_system.hpp"
#include <fstream>
#include <memory>
#include <signal.h> // NOLINT
#include <proc/readproc.h>
using namespace std::chrono;
constexpr std::time_t invalid_time = static_cast<std::time_t>(-1);
// TODO: X11/Wayland support for window_name, active_windows & focused_window?
std::ti... | TOOL | 0.892476 | 6.625217 |
90855928-916d-4964-b063-8558c2cd3938 | CharlzKlug/using_cpp | 05/214_exercises/06/main.cpp | #include <iostream>
double ctof (double inputFahrenheit) {
double fahrenheit= 1.8 * inputFahrenheit + 32;
return fahrenheit;
}
int main() {
double celsius;
if (std::cin >> celsius) {
std::cout << "F: " << ctof(celsius) << std::endl;
}
return 0;
}
| TOOL | 0.949665 | 5.189277 |
e68b2b2b-c8c9-4bd3-ae9d-2948d9b86893 | hihiendru/accelerated_cpp | Chapter8/ch8_2.cpp | #include <iostream>
#include <vector>
template <class InputIter1, class InputIter2>
bool equal(InputIter1 first1, InputIter1 last1, InputIter2 first2) {
while (first1 != last1) {
if (*first1++ != *first2++) {
return false;
}
}
return true;
}
template <class InputIter, class T>
InputIter find(InputIter first... | ALGO | 0.998602 | 5.356515 |
c1fdb6d0-3ffb-4675-9d34-6d2a17e8a3f8 | PaukIsUha/optimizing_formating_code | predictions/supersonic_predicted_submissions/Codenet/p00519/703659459/original.cpp | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define INF 999999999
vector<int> pass[6000];
int n, k;
int c[6000];
int r[6000];
int d[60... | ALGO | 0.999912 | 3.760513 |
70dec473-2717-4038-b41a-601ca356d268 | MMSS9402/algorithm | ProblemSolving/mincode/level23/23-4.cpp | #include <iostream>
using namespace std;
char name[] = "BTSKR";
int n;
int used[100];
int cnt;
char path[10];
int isCheck(char path[10])
{
for (int i = 0; i < n; i++)
{
if (path[i] == 'S')
return 1;
}
return 0;
}
void run(int lev)
{
if (lev == n)
{
if (isCheck(path)... | ALGO | 0.999904 | 3.043517 |
fe3efe85-0dc4-436c-9830-e8132ef36600 | OneUpWallStreet/Data-Structrues-And-Algorithms | 456. 132 Pattern.cpp | #include<iostream>
#include<vector>
#include<stack>
using namespace std;
class Solution {
public:
bool find132pattern(vector<int>& nums) {
stack<int> stack;
for(int i=0;i<nums.size();i++){
}
}
};
int main(){
Solu... | ALGO | 0.999918 | 5.687799 |
a7e3aa17-a5a5-4b9d-a94c-824803b5c33e | IDEA-CUHK/FlatDD | extern/taskflow/3rd-party/eigen-3.3.7/blas/double.cpp | #define SCALAR double
#define SCALAR_SUFFIX d
#define SCALAR_SUFFIX_UP "D"
#define ISCOMPLEX 0
#include "level1_impl.h"
#include "level1_real_impl.h"
#include "level2_impl.h"
#include "level2_real_impl.h"
#include "level3_impl.h"
double BLASFUNC(dsdot)(int* n, float* x, int* incx, float* y, int* incy)
{
... | ALGO | 0.997795 | 5.138801 |
6e73afea-b6e0-4bd5-a395-d684a01a1a07 | Legion-zialot/s-xray16 | src/xrGame/ai/monsters/rats/ai_rat_fsm.cpp | ////////////////////////////////////////////////////////////////////////////
// Module : ai_rat_fsm.cpp
// Created : 25.04.2002
// Modified : 07.11.2002
// Author : Dmitriy Iassenev
// Description : AI Behaviour for monster "Rat"
////////////////////////////////////////////////////////////////////////////
#inclu... | TOOL | 0.990289 | 3.183922 |
eb565bbc-b13c-4395-bec0-e8cac2147d24 | ishandutta2007/codeforces | magga/normal/1605/A.cpp | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define filei freopen("input.txt", "r", stdin);
#define fileo freopen("output.txt", "w", stdout);
#define gooi cout<<"Case #"<<i+1<<" :"... | ALGO | 0.999947 | 3.798191 |
4d41bf34-45f1-460c-a889-066e7e9dd0bc | aslanbekasylbekov/pp1_2021 | quiz/e.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m; cin>>n>>m;
set <char> foo;
for(int i=n;i<m;i++){
string s=to_string(i);
for(int j=0;j<s.size();j++){
foo.insert(s[j]);
}
if(foo.size()==m){
cout<<i;
break;
}else{
... | ALGO | 0.999899 | 3.143779 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.