blob_id stringlengths 40 40 | content_id stringlengths 40 40 | repo_name stringlengths 5 114 | path stringlengths 5 318 | language stringclasses 5
values | extension stringclasses 12
values | length_bytes int64 200 200k | license_type stringclasses 2
values | content stringlengths 143 200k |
|---|---|---|---|---|---|---|---|---|
25e0c515465fe19556ff10d64f058753da77c0d1 | afbb9906391ebca204510156c6a5ffde41de960b | wedtm/dogecoin | /src/init.cpp | C++ | cpp | 28,664 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Copyright (c) 2011-2012 Litecoin Developers
// Copyright (c) 2013 DogeCoin Developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license... |
be8dcd9defadd26d6220f8c68bd6b077b3f2aad0 | 1931faec146a45260598ba252ba27a34e69a13e1 | jonatas57/adventofcode2019 | /16/16-2.cpp | C++ | cpp | 1,465 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef map<int, int> mii;
typedef pair<int, int> ii;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f... |
e24c6c688607041fb5326d04705726a28a707fe2 | 0dfe3b628f7020d56e7c7e52709d124684d0a033 | vinniefalco/url | /src/segments_encoded_view.cpp | C++ | cpp | 1,007 | permissive | //
// Copyright (c) 2019 Vinnie Falco (vinnie.falco@gmail.com)
// Copyright (c) 2022 Alan de Freitas (alandefreitas@gmail.com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// Official repository: https://gi... |
76d2ede710a1352478415639a37b3280f588e98e | e4ff58648a79b13432dc8399794a7474d10cf9ca | mohankrishna225/Practise | /Face/greatest_sum.cpp | C++ | cpp | 833 | no_license | #include<iostream>
using namespace std;
int main()
{
int n,m,i,j,sum=0,u,v=0,x,y=0,p=0,q=0;
cin>>n>>m;
int a[n][m],r[n],c[n];
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
cin>>a[i][j];
}
}
cout<<"Sum of rows is ";
for (i = 0; i < n; i++)
{
for (j = 0; j < m; j++)
{
... |
d6c048296d15c50c922fbde76f245c5d1f29a87e | 8c9f5651b69d35b695b468bc0505082524ac36b5 | popboykingdjko/streamer | /src/processor/face_tracker.cpp | C++ | cpp | 3,443 | permissive | // Copyright 2016 The Streamer Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by ... |
0d7a779ac667e229aa00e809998ec07d7ba31b36 | 0b02c54ac59c6b2abda3d0730db4b85a7efe55f8 | apache/xerces-c | /src/xercesc/dom/impl/DOMCasts.hpp | C++ | hpp | 3,887 | permissive | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may ... |
4cd45f6f9edc270b60712f70012bc1d305b6d24e | bdf28dc663014f399c766745d3df1491d78086f0 | mabrarov/asio_samples | /libs/ma_helpers/include/ma/executor_helpers.hpp | C++ | hpp | 1,121 | permissive | //
// Copyright (c) 2018 Marat Abrarov (abrarov@gmail.com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
//
#ifndef MA_EXECUTOR_HELPERS_HPP
#define MA_EXECUTOR_HELPERS_HPP
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
... |
96559a62bec65bf1790b697f951d2ec8ebc32b78 | 0ed87a9f5a96cd4301e3f053e9bb5e5b7779a1d2 | Strongc/my001project | /CapsuleSortor/Version 1.0 -2.0/CapsuleSortor-10-11-11/ToolSrc/TMutex.cpp | C++ | cpp | 992 | no_license | // TMutex.h : Implement of the TMutex class
//
// Copyright (c) 2007 PACS Group Zibo Creative Computor CO.,LTD
//////////////////////////////////////////////////////////////////////////
// Module : Common Tool
// Create Date : 2006.01.09
//
// A tool to use Mutex
#include "TMutex.h"
TMutex::TMutex(LPCTSTR... |
d513458ce6e4eca9dafca1d9bea74cfe16bfac2e | 231c806797f0bdd1066c8fd48dc5ab286590e02e | sharmila08/codekata | /practise/fact.cpp | C++ | cpp | 283 | no_license | #include<iostream>
using namespace std;
class fact
{
public:
int i,n;
public:
void get()
{
cin>>n;
}
void fac()
{
int f=1;
for(i=n;i>0;i--)
{
f=f*i;
}
cout<<f;
}
};
int main()
{
fact ob;
ob.get();
ob.fac();
}
|
ff03f75f8d7b5fe56ed41a156b07c01c25adc3f1 | df1d257a2245e08aa712397f1913d75ae4bf45d5 | grvmanda/RobArm | /robarm_code/src/robarm_motor_drivers/src/DRV8711_driver.cpp | C++ | cpp | 4,155 | no_license | /**
* @file DRV8711_driver.cpp
* @author your name (you@domain.com)
* @brief
* @version 0.1
* @date 2021-09-08
*
* @copyright Copyright (c) 2021
*
*/
#include "DRV8711_driver.h"
using namespace std;
/**
* @brief Construct a new drv8711 driver::drv8711 driver object
*
* @param spiChannel
* @param... |
d1e7f58aa336024ec258358bc49f02900fb21351 | cc160c3b8912c2e1e907b9890f4b9e1bf988ecf2 | AyeEmWhy/Intro-C | /RockPaperScissors/RockPaperScissors.cpp | C++ | cpp | 6,256 | no_license | // Amy Jiang
// CS/IS 135 C++
// 13 October 2016
/** PSEUDOCODE
0. Create prototypes.
1. Create variables playerChoice, computerChoice, isItATie, and result.
2. Create a function named: getComputerChoice.
- getComputerChoice should generate a random number b/w 1 - 3.
- 1. Ro... |
11fc614f1e94fac7ab76d0739eb00c2ce6bac9f1 | bccf1e9bbc3b825548c52e7059f7c35d63264fc9 | arrayfire/arrayfire | /src/backend/common/module_loading_windows.cpp | C++ | cpp | 1,226 | permissive | /*******************************************************
* Copyright (c) 2018, ArrayFire
* All rights reserved.
*
* This file is distributed under 3-clause BSD license.
* The complete license agreement can be obtained at:
* http://arrayfire.com/licenses/BSD-3-Clause
**********************************************... |
5310d7b6313bd6f6aa3fca6301ca7b44427e81c0 | 06e0c4a0edcdc960e68b645f32210ac450960ebc | JohnCGriffin/arachnid | /http_structs.hpp | C++ | hpp | 2,810 | no_license |
#ifndef HTTP_REQUEST_H_1364926169_
#define HTTP_REQUEST_H_1364926169_
#include <string>
#include <map>
#include <vector>
#include <iostream>
namespace arachnid {
namespace HTTPStringConstants {
extern const std::string HTTP_1_1 ;
extern const std::string CLOSE ;
extern const std::string CONTENT_LENGTH... |
1a502f475e4f9a19fa8b3624e267d7bd52753c40 | ea23961d6533938cf552ac9e9446d1311da1bbd9 | msrishu65/codes | /codes/interview/printprimenubersfromiton.cpp | C++ | cpp | 409 | no_license | #include<iostream>
using namespace std;
void markmuliples(int a[],int k,int n)
{
int i=2,num;
while((num=i*k)<=n)
{
a[num-1]=1;
i++;
}
}
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
a[i]=0;
for(int i=1;i<n;i++)
{
if(a[... |
0a1a3556a740fa5341dcd5c0a5adcb9002a7076e | f85e0061d3c3beda1b3804ff4651204620b92e5a | kengonakajima/snippets | /cpp/unom.cpp | C++ | cpp | 2,164 | no_license | #include <tr1/unordered_map>
#include <iostream>
#include <map>
/*<title> timevaldiff - get difference of two timeval in msec </title>*/
#include <sys/time.h>
/* struct timeval {
long tv_sec; seconds
long tv_usec; microseconds
};
*/
long timevaldiff(struct timeva... |
a438265a5bed3f14cf2e8870ab5ea19cf740df34 | 917c9b54afb41f500c0018b32f1bf4ca42bfd1cc | CaroRomo1/InterviewQuestions | /Cracking/Ch 02. Linked Lists/Q6_Palindrome/Carlos/Q6_Palindrome/palindrome.cpp | C++ | cpp | 915 | no_license | #include <iostream>
#include "node.h"
#include "LinkedList.h"
#include <stack>
using namespace std;
int main()
{
LinkedList<int> *lista1 = new LinkedList<int>();
LinkedList<int> *lista2 = new LinkedList<int>();
lista1->addFirst(1);
lista1->addFirst(2);
lista1->addFirst(3);
lista1->addFirst(4);
lista1->addFirs... |
de22685c7eb8c48f28607b0c559f4960efd60052 | 97dba1781d57ca4cb21fe29b708408cd85f7d96f | fsxchen/CppStudy | /CppFoundation/IO-Opreator/copy_file.cpp | C++ | cpp | 372 | no_license | /*
*
*复制文件
*
*
* */
#include <string>
#include <fstream>
using namespace std;
int main() {
ifstream in("copy_file.cpp"); //打开一个可读的文件。
ofstream out("/tmp/copy_file.cpp"); //打开一个等待写的文件
string s;
while(getline(in, s))
out << s << "\n";
}
/*
*getline读取一行，分隔符默认为回车，可以修改
* */
|
12a79460e477ae761221af921f41a72508b2fc85 | 35f2df4c2655edd93f0a3f4b9b75149bd1ac33fb | suongle1234597/exerciseCplusplus | /do_hoa/Source.cpp | C++ | cpp | 4,577 | no_license | #include<iostream>
using namespace std;
#include"myLib.h"
int main()
{
/* ========================= XỬ LÝ 1 ========================= */
int i = 0;
int x = 10;
int y = 0;
while (true)
{
gotoXY(x, y);
SetColor(i);
i++;
if (i >= 16)
{
i = 0;
}
cout << "HOC LAP TRINH THAT DE QUA DI AHIHI";
y++... |
2be9b5d6057a53d27761dd0f641e9c431082c6bd | 678d4b6d57e3adb7c261ed47826baea72431f7da | pepo190852/ProjectCompro | /main.cpp | C++ | cpp | 4,755 | no_license | #include<windows.h>
#include "draft.h"
using namespace std;
bool ban=false,share_pool;
int main(){
for(int i=0;i<10;i++)pos[i].id=-1;
declare();
bool picked1[champions.size()],picked2[champions.size()],picked[champions.size()];
p='a';
srand(time(0));
//adjust console's size
HWND console = GetConsoleWi... |
938a8616171ceaf901adf132c38ebc74a3cb7d6f | ebcc00fb4b25d27924808cb49a61c2036f709fce | acc-cosc-1337-spring-2021/acc-cosc-1337-spring-2021-newcollar-42 | /src/homework/tic_tac_toe/tic_tac_toe_manager.cpp | C++ | cpp | 1,590 | permissive |
#include "tic_tac_toe_manager.h"
#include<iostream>
using std::cout;
using std::string;
TicTacToeManager::TicTacToeManager(TicTacToeData d)
: data{d}
{
games = data.get_games();
for(auto& game: games)
{
update_winner_account(game->get_winner());
}
}
void TicTacT... |
54cb1b0f8038b42fa34da6a50a0255ef72d02ef9 | 2885c7d62f64bbd13eaae4085caaf97186c7a475 | 2kAyush/datastructure_algortihms | /kosaraju.cpp | C++ | cpp | 1,869 | no_license | #include<bits/stdc++.h>
using namespace std;
void dfs(int src, vector<vector<int>>& g, stack<int>& stk, vector<int>& visited)
{
visited[src] = 1;
for (int i = 0;i < g[src].size();i++)
{
if (visited[g[src][i]] == 0)
{
dfs(g[src][i], g, stk, visited);
}
}
... |
68af85c9ff0a045e0d2afa30620c18326d383c23 | 19bbfab23a8ee00e4f8bf78a4f18944cb8f7d69a | barjinderpaul/Programming | /misc/q3.cpp | C++ | cpp | 1,061 | no_license | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
lli read_int(){
char charr;
bool beginn=false,negative=false;
lli ret=0;
while(true){
charr=getchar();
if((charr-'0'<0 || charr-'0'>9) && charr!='-' && !beginn){
continue;
}
if((charr-'0'<0 || charr-'0'>9) && charr!='-' && beginn){
... |
40dd2775cd71ce2e1124247b254abfdb7cf273fa | c33e3edd4b4847e5d062f2127c25a395f32b1cf4 | github188/SClass | /src/Map/GoogleMap/GoogleSearcher.cpp | C++ | cpp | 6,990 | no_license | #include "Stdafx.h"
#include "MyMemory.h"
#include "Crypto/Encrypt/Base64.h"
#include "Crypto/Hash/HMAC.h"
#include "Crypto/Hash/SHA1.h"
#include "Data/ArrayList.h"
#include "Data/DateTime.h"
#include "IO/Stream.h"
#include "Net/HTTPClient.h"
#include "Net/SocketFactory.h"
#include "Net/TCPClient.h"
#include... |
e2d5ec0adeac833005c9dbacca969ff3344f649f | 4ecc4e67b338fb75b30810f933066b9091df1569 | Calvados0806/RayMarchingCpp | /RayMarchingCpp/src/Math/Vec2.cpp | C++ | cpp | 2,987 | no_license | #include "Vec2.h"
#include "Mat2.h"
#include "../OpenGL/GLCore.h"
#include <cmath>
#include <algorithm>
using namespace Math;
Vec2::Vec2() : mData{ 0.0f, 0.0f }
{
}
Vec2::Vec2(std::initializer_list<float> list)
{
ASSERT(list.size() >= 2);
std::copy_n(list.begin(), 2, mData);
}
Vec2::Vec2(float value) : mDa... |
85287aafe5580bf8671581d39cf79e094bb55f8b | 86019476068518a51fa467f6f8554d6fa3bdc4ef | DerickW126/Code | /Codebook/DataStructure/poj3850.cpp | C++ | cpp | 3,051 | no_license | #include <iostream>
#include <algorithm>
using namespace std;
struct Treap{
int val;
int pri;
int size;
int mn;
bool rev;
Treap* l;
Treap* r;
Treap(int x = 0) {
rev = false;
mn = x;
val = x;
pri = rand();
size = 1;
l = nullptr;
r = ... |
01d2412c02e7f4024f0e95c1c04a5a240b3ca847 | adfe8ca9b9b2a3afb4582f77a962b7b9c5381df0 | chiseungii/baekjoon | /02965.cpp | C++ | cpp | 210 | no_license | #include <iostream>
using namespace std;
int main() {
int A, B, C; cin >> A >> B >> C;
int term1 = B - A, term2 = C - B;
if (term1 >= term2)
cout << term1 - 1 << endl;
else cout << term2 - 1 << endl;
}
|
3a548b160913c932a7cfc382e3e7322d590be621 | b36569b70e3940bd88428c274dd2c97c2634829f | louise365/To-be-SDE | /leetcode_1281/leetcode_1281.cpp | C++ | cpp | 1,131 | no_license | // leetcode_1281.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//
#include <iostream>
class Solution {
public:
int subtractProductAndSum(int n) {
unsigned long long sum = 0;
unsigned long long product = 1;
while (n) {
sum += n % 10;
product *= n % 10;
n /= 10;
... |
4cd2987863d74a70b1e9e64e69fc0dd4a360f779 | e842585199ee01b261627f52b3202269d1be3627 | KellieDeanH/McMillaniteInputValDrT-7 | /main.cpp | C++ | cpp | 1,516 | no_license |
#include <cstdlib> // Provides EXIT_SUCCESS
#include <iostream> // Provides cout, cerr, endl
#include "Input_Validation_Extended.h" // Provides getValidatedInput<T>(), a header File with a Template Class
// Extended 2-11-2016 by Dr. McMillan to add validation methods by datatype
#inclu... |
76376de89ee3020dde1aca4648e881ad2a9f467d | c1db5506aa027de2f8a7a7ccb0a95bbaa3652170 | viteseco/Vites | /src/vitescoinrpc.cpp | C++ | cpp | 49,677 | permissive | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "init.h"
#include "util.h"
#include "sync.h"
#include "ui_interface.h"
#includ... |
952f47cfefba03a05a8d593a6196da5b84b0103e | 8e38b97da0742957d150d97b47ad9a95a6c2fb1b | mccormickms/130-cipher | /solitaire_encode.cpp | C++ | cpp | 8,925 | no_license | //============================================================================
// Name : solitaire_encode.cpp
// Author : Matthew McCormick
// Version :
// Copyright :
// Description :
//============================================================================
#include <iostream>
#include <ctime>... |
5ebed030995919c22448923cf2357b1a90d9fc2e | 8ce5a69863284159416aa1699acb409e402864ca | Avi-141/Competitive_Programming | /Codejam-2020/Qual/C.cpp | C++ | cpp | 3,304 | no_license | /*
__gcd(x, y); log10(N); log2(N); floor(K); pow(10, K); modi = pow(a,m-2,m);
emplace_back(); num_of_digits = floor(log10(N)) + 1; isPowerOfTwo --> x && (!(x&(x-1)));
all_of(); any_of(); none_of(); copy_n(); iota() increasing list;
auto num = 0b111; initialization in binary form
insert(); 1ll << x;... |
9cc92dce26681f227bfa251d8cc976919abf09b2 | 24728ae9433c567bcdf0be3e03da1a5f6e1bb194 | lsls01/C_Specialization_Peking_Uni | /S3/Final/Assignment/4sumSqrt.cpp | C++ | cpp | 702 | no_license | #include <iostream>
using namespace std;
class CType
{
public:
int value;
CType(): value(0) {};
void setvalue(int n)
{
value = n;
}
CType & operator ++ (int)
{
static CType tmp = CType();
tmp.value = value;
valu... |
083916f62a47dc809d5c18ce94dbb62a0f559c90 | e06fae8e4946b18dc7cc3978777a0509f87be97b | Alexander45448/AA2020 | /Week 6/SDA/GAME.cpp | C++ | cpp | 1,822 | no_license | #include <vector>
#include <iostream>
using namespace std;
void getLast(vector<int> vct);
vector<int> mergeSort(vector<int> vct);
vector<int> merge(vector<int> left, vector<int> right);
int main(void) {
vector<int> vct;
int n = 0, aux = 0;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> aux;
... |
262b5bffd1a8f820afc2400b47d3221d61a12aba | dfaec456b008eb2361bfe2283c8e544b299e6f9f | sabil62/Floatsat | /codes/obc/dependencies/rodos/test-suite/middleware-tests/receiver-subscriber.cpp | C++ | cpp | 1,112 | permissive | #include "rodos.h"
uint32_t printfMask = 0;
Topic<long> counter1(-1, "counter1");
static Application senderName("Publisher 01 simple", 1100);
class MyPublisher01 : public StaticThread<> {
public:
MyPublisher01() : StaticThread<>("SenderSimple") {}
void run() {
printfMask = 1;
long cnt = 0... |
367b5a9671f35e7e902ba613e17e1b4d3c7fab3e | 7961394b3a31ac0da628182e5b9c55be9ecfbdd2 | REGoth-project/bsf | /Source/Foundation/bsfCore/Private/Win32/BsWin32Platform.cpp | C++ | cpp | 26,688 | permissive | //************************************ bs::framework - Copyright 2018 Marko Pintera **************************************//
//*********** Licensed under the MIT license. See LICENSE.md for full terms. This notice is not to be removed. ***********//
#include "Private/Win32/BsWin32Platform.h"
#include "RenderAPI/BsRende... |
aff0dc85edc50808898e14b0b12a506b104d55c9 | 48fd24b5a834f7dcbb788eef5d45a94bbd9b0eae | gregdionne/tasm6801 | /src/macro.cpp | C++ | cpp | 2,616 | permissive | // Copyright (C) 2019 Greg Dionne
// Distributed under MIT License
#include <string.h>
#include "macro.hpp"
void Macro::addDefinition(Fetcher& fetcher)
{
Definition d;
d.identifier = "";
fetcher.skipWhitespace();
if (!fetcher.isAlpha())
fetcher.die("identifier expected");
do
d.identifier +... |
e75d0d15240c92e112669c126def37e453efd2ba | d5db7e372d40155f1f18ca32bd6b6ecc007c3377 | NuChitsanupong/prob-solve | /0-pdf-por/pdf-problem/w05-b01-bstdelete.cpp | C++ | cpp | 924 | no_license | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
vector<int> a;
int m, op, x, first, last, mid;
cin >> m;
for(int i=0; i<m; i++){
cin >> op >> x;
first = 0; last = a.size();
mid = (first+last)/2;
while(first<last){
... |
3ec34bc124cc5e374602381176a34ffaed903358 | 4250a2c8f4de040b39c8f4eea94bfc1048b9f6ed | math715/arts | /leetcode/leetcode_290.cc | C++ | cc | 963 | permissive | #include <vector>
#include <string>
#include <iostream>
#include <unordered_map>
using namespace std;
bool wordPattern(string pattern, string str) {
vector<string> vec;
int prev = 0;
for (int i = 0; i < str.size(); ++i) {
if (str[i] == ' ') {
vec.push_back(str.substr(prev, i - prev));
prev = i + 1;
}
}
v... |
a1c8d97a13529a79244b299de7934ee23894a122 | 5722a134f550edf72696dda9b661a11ec3936b34 | iamacewhite/USACO | /03_gift1/gift1.cpp | C++ | cpp | 1,180 | permissive | /*
ID: ace1o1o2
PROG: gift1
LANG: C++11
*/
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
int search(string x[], string target, int n) {
for (int i = 0; i < n; ++i) {
if (x[i] == target) {
return i;
}
}
}
int main() {
ofstream fout("gift1.out");
... |
b6cba642a9dcb42f343a038a91e66e5cfcbcb1cf | a067ee3bfee4a1ab9eec6b4b1e2095d7252297c7 | ITensor/website | /docs/cppv3/formulas/ladder/ladder.cc | C++ | cc | 1,206 | no_license | #include "itensor/all.h"
using namespace itensor;
int
main()
{
int Nx = 50;
auto N = 2*Nx;
auto Jx = 1.0;
auto Jy = 1.0;
// QNs are conserved by default. Use
// the arg {"ConserveQNs=",false} to not
// conserve QNs
auto sites = SpinHalf(N);
auto ampo = AutoMPO(sites);
fo... |
f738e77afe5227bd90548e2465d445e028b4db91 | a1c493a1329969f1425ff96568193d4feab6aa64 | Liujiunan/botan | /src/lib/pubkey/mce/goppa_code.cpp | C++ | cpp | 6,889 | permissive | /*
* (C) Copyright Projet SECRET, INRIA, Rocquencourt
* (C) Bhaskar Biswas and Nicolas Sendrier
*
* (C) 2014 cryptosource GmbH
* (C) 2014 Falko Strenzke fstrenzke@cryptosource.de
*
* Botan is released under the Simplified BSD License (see license.txt)
*
*/
#include <botan/internal/mce_internal.h>
#include <b... |
e526223d75df80ad4a5ffb7c2821dd62682e97d4 | 59b8f5d6ca74198407200dd0d9b238d4279b5012 | pocketnetteam/pocketnet.core | /src/fs.cpp | C++ | cpp | 7,349 | permissive | // Copyright (c) 2017-2019 The Bitcoin Core developers
// Copyright (c) 2021 The Pocketcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <fs.h>
#ifndef WIN32
#include <cstring>
#include <fcntl.h>
#in... |
1431cce9a14d33e98e9b9ae7e0370ea70dd624d0 | b063a0ea66d78f442754f94caedd34ae294df17e | Mirtex/Real-time-Animation-Sample | /RTA.Project/FBXLoader/FBXLoader.cpp | C++ | cpp | 13,122 | no_license | // FBXLoader.cpp : Defines the exported functions for the DLL application.
//
#include "stdafx.h"
#include <iostream>
#include <string>
#include <queue>
#include "FBXLoader.h"
#define MATRIXSIZE 16
// This is an example of an exported variable
//FBXLOADER_API int nFBXLoader=0;
// This is an example of an exported f... |
d7ead97d5ca293af703b68a04d0ee35c9c68bb20 | 12ec4e1618d461dea1aea21cd1f488f2864033dd | Coldwings/overlaybd | /src/overlaybd/lsmt/file.cpp | C++ | cpp | 62,544 | permissive | /*
Copyright The Overlaybd Authors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, softwar... |
3841ce27966ac5ad07b26fdc0bd1527bac274974 | b6e71df677025fdc737c206b1ace5c89689683d5 | brethvoice/tensorflow | /tensorflow/core/ops/experimental_dataset_ops.cc | C++ | cc | 47,961 | permissive | /* Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... |
e04b402425633bd39e3757621c118d627951fb94 | 6e9bc88b82ed750d03032fb99afbee0f59147fb4 | youtube/cobalt | /starboard/android/shared/drm_create_system.cc | C++ | cc | 1,858 | permissive | // Copyright 2017 The Cobalt Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by ap... |
c6561b79d414297eaf91fc692b2e45f871a4821b | 634f7df888c5eafe2e9c87e934354ac83d00dd3b | DanielEdriPurpl/prplMesh | /agent/src/beerocks/slave/tasks/task_pool.cpp | C++ | cpp | 1,395 | permissive | /* SPDX-License-Identifier: BSD-2-Clause-Patent
*
* SPDX-FileCopyrightText: 2016-2020 the prplMesh contributors (see AUTHORS.md)
*
* This code is subject to the terms of the BSD+Patent license.
* See LICENSE file for more details.
*/
#include "task_pool.h"
using namespace beerocks;
bool TaskPool::add_task(cons... |
a8759beeb07b1436707c574eb8f34e55149e628f | fad6121d3d82f60f809509e1df1e88286557bbaa | tapaswenipathak/hpx | /libs/algorithms/tests/unit/algorithms/none_of.cpp | C++ | cpp | 11,983 | permissive | // Copyright (c) 2014-2017 Hartmut Kaiser
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <hpx/hpx_init.hpp>
#include <hpx/hpx.hpp>
#include <hpx/include/parallel_all_any_none_of.hpp>
#include <hpx/t... |
84180deda3d6462b0ffbfef553dc32629bf89a1b | 611c1ec5e0ad2dc9f4b33f43d13566a730fb914a | ebonywolf/Uttt | /lib/ProjGaia/Tools/Polygon.cpp | C++ | cpp | 9,524 | no_license | #include "Polygon.h"
#include "LineSeg.h"
#include <cmath>
#include "Angle.h"
using namespace pg;
using namespace std;
namespace pg
{
Polygon::Polygon ( vector<LineSeg> axis )
{
if(axis.size()<1)throw "unable to make polygons with less than 1 line";
this->axis = axis;
calculateFurthestPoint();
c... |
d74e435dab0218895a6b543b9400212ed8c54c97 | f3e30b75b6965ed6c3048d237e37b9fd0e604be5 | AmgCoder/DSA-CP | /Sorting/dnf_sort.cpp | C++ | cpp | 607 | permissive | #include<bits/stdc++.h>
//#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
for (int i = 0; i < n; i++)
{
cin>>arr[i];
}
int low=0,mid=0,high=n-1;
while (mid<high)
{
if (arr[mid]==0)
{
swap(arr[low],arr[mid]);
... |
d1baabfe011b6750ffe65523d89bb52f3dc9dc8d | 556c623670c54ad1702ed034ef18980c7d360f75 | octoberskyTW/CADAC4_Enhance | /Simulations_C++/FALCON6/propulsion.cpp | C++ | cpp | 7,529 | no_license | ///////////////////////////////////////////////////////////////////////////////
//FILE: 'propulsion.cpp'
//
//Contains 'propulsion' module of class 'Plane'
//
//030604 Created by Peter H Zipfel
///////////////////////////////////////////////////////////////////////////////
#include "class_hierarchy.hpp"
///... |
c5d7733c2b84196b508217641fafb70d4305dddf | 6d17afb7c5b2ed2f9ff04cc35d3cd8523c05eadc | kontai/CPlus | /習題.cpp/Exam7.34_Overload.cpp | C++ | cpp | 377 | no_license | #include<iostream>
using namespace std;
void error(const string &, int, int);
void error(const string &);
void error(const string &, char);
int mainExam7_34() {
int index = 0, upperBound = 0;
char selectVal(' ');
//error("Subscript out of bound: ", index, upperBound);
//error("Division by zero");
//error("Inval... |
a8e4bf0b6ab8ec0af9a0ff66a4ed6677a8c74d8e | 162d2f458eceeecd106df203530168c0df2f1b07 | rstutsman/RAMCloud | /src/MigrateTabletMain.cc | C++ | cc | 6,732 | permissive | /* Copyright (c) 2011-2014 Stanford University
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR(... |
f65fa6c67fb712a7045c1c00b828027b43da37d8 | e48e0bc1cd1118e1965408f609abc7b2c6ad7090 | lidapeng/Behave | /src/surfaceFireWidth.cpp | C++ | cpp | 568 | no_license | #include "surfaceFireWidth.h"
//------------------------------------------------------------------------------
/*! \brief Calculates fire maximum width from its length and length-to-width
* ratio.
*
* \param fireLength Fire length (ft).
* \param lengthWidthRatio Fire length-to-width ratio (ft/ft).
... |
38468a9aec6fadb76a37733dfe4513c3d2e05b71 | 618d582e98682fa2a0a1224964605c26d26c2f73 | Geromino/ESP32-OV7670-WebSocket-Camera | /XClk.cpp | C++ | cpp | 1,006 | permissive | //parts of his code are taken from
//https://github.com/igrr/esp32-cam-demo
//by Ivan Grokhotkov
//released under Apache License 2.0
#include "XClk.h"
#include "driver/ledc.h"
bool ClockEnable(int pin, int Hz)
{
periph_module_enable(PERIPH_LEDC_MODULE);
ledc_timer_config_t timer_conf;
timer_conf.bit_num ... |
a6a86bd2c7f8fa275e71a75c683771e851a05be3 | eaae4bb3a0fa454e3c19083eb4d1768b59eaa95e | PrettySimple/cocos2d-x | /cocos2d/cocos/scripting/lua-bindings/manual/CCLuaEngine.cpp | C++ | cpp | 32,050 | permissive | /****************************************************************************
Copyright (c) 2012 cocos2d-x.org
Copyright (c) 2013-2016 Chukong Technologies Inc.
http://www.cocos2d-x.org
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation... |
fe6fdff4effe5a37fb1da2725ce28c0108d00e7a | 8c79f7922621322e571e08b679a4bc5bfac38bd5 | SauravPati08/FacePrep-CPP | /Control Structures I/Harshad Number.cpp | C++ | cpp | 251 | permissive | #include<iostream>
using namespace std;
int main()
{
int n,i,t,sum=0;
cin>>n;
t=n;
while(n>0)
{
i=n%10;
sum=sum+i;
n=n/10;
}
if(t%sum==0)
cout<<"Harshad Number";
else
cout<<"Not Harshad Number";
}
|
f02868a1b76f23eac3b8f4933922cfbd256410ed | f18fdca31e3b3a83ebe2f997e5be1715dcc27f97 | thegamer1907/Code_Analysis | /scrape/data/Organized/lee-jinhen/lee-jinhen_A.cpp | C++ | cpp | 923 | no_license | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#pragma GCC optimize ("O3")
using namespace std;
int main () {
ios::sync_with_stdio(false);
cin.tie (0);
ll n, m, k; cin>>n>>m>>k;
vector <ll> a (m);
for (auto &i : a) cin>>i;
... |
85c9c6a3d37da5d4b222cb69c2f388ace6e16a90 | 637469a657c044b7db6eab13eedf31d947b42f4e | sintef-ocean/mimir | /src/mimir/algorithm/Leadline.cpp | C++ | cpp | 8,805 | permissive | #include <chrono>
#include <cmath>
#include <exception>
#include <thread>
#include <vector>
#include <boost/log/trivial.hpp>
#include "mimir/algorithm/Leadline.hpp"
#include "mimir/StateMachineFwd.hpp"
#include "mimir/FkinDds.hpp"
#include <casadi/casadi.hpp>
namespace mimir
{
namespace algorithm
{
class Le... |
d03659c64697461604f28277550c7f160316a421 | df6fdc8f64857ae375f64b3a9c5f93332372e9dc | CyFI-Lab-Public/RetroScope | /external/chromium_org/android_webview/browser/net/aw_url_request_context_getter.cc | C++ | cc | 8,134 | permissive | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "android_webview/browser/net/aw_url_request_context_getter.h"
#include <vector>
#include "android_webview/browser/aw_browser_context.h"
#in... |
0fdb3e55060f65b380476f6e5f4c7307e2ecf600 | 63cf3f059db9058e1154138e305cccc0d05948f6 | SymbianSource/oss.FCL.sf.mw.videoutils | /videoutils_plat/videoconnutility_api/tsrc/VCXTestCommon/src/CIptvTestVerifyData.cpp | C++ | cpp | 21,253 | no_license | /*
* Copyright (c) 2008 Nokia Corporation and/or its subsidiary(-ies).
* All rights reserved.
* This component and the accompanying materials are made available
* under the terms of the License "Eclipse Public License v1.0"
* which accompanies this distribution, and is available
* at the URL "http://www.eclipse.org/leg... |
c791b8aa92e2e8ffc5433702a33a327e6f0dca76 | 4fdb01d402324a7fabd33a872092f8cb0d4d630b | HelyLi/Quick-Cocos2dx-Community | /cocos/editor-support/spine/SkeletonRenderer.cpp | C++ | cpp | 15,617 | no_license | /******************************************************************************
* Spine Runtimes Software License
* Version 2.3
*
* Copyright (c) 2013-2015, Esoteric Software
* All rights reserved.
*
* You are granted a perpetual, non-exclusive, non-sublicensable and
* non-transferable license to use, install... |
42b86a0d1253b3cc503a0dea431186740ffebbb6 | 0c0854d0ba85e733218ccddd9f8a4c5663a3d8b5 | yrnkrn/zapcc | /tools/clang/lib/Tooling/AllTUsExecution.cpp | C++ | cpp | 5,422 | permissive | //===- lib/Tooling/AllTUsExecution.cpp - Execute actions on all TUs. ------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
63ca234279e3d2dd3dce829fad1d5f1cca48d804 | 0c37aa15a0e67ab925adf6d8f2e68e13ce514df8 | VB6Hobbyst7/opengui | /Renderers/Ogre/Renderer_Ogre/Renderer_Ogre_Viewport.cpp | C++ | cpp | 4,749 | permissive | // OpenGUI (http://opengui.sourceforge.net)
// This source code is released under the BSD License
// See LICENSE.TXT for details
#include "Renderer_Ogre_Viewport.h"
#include "OgreRenderTarget.h"
namespace OpenGUI {
//#####################################################################
OgreViewport::Ogre... |
750bb914c4797dc08c70a1b064e8f2c0cd71ee2c | d847f0622e19e4377d3288498439d83eb80f1b32 | Xtuden-com/agent-based-epidemic-sim | /agent_based_epidemic_sim/core/small_world_graph_test.cc | C++ | cc | 3,989 | permissive | #include "agent_based_epidemic_sim/core/small_world_graph.h"
#include <memory>
#include "gmock/gmock.h"
#include "gtest/gtest.h"
namespace abesim {
namespace {
using ::testing::Pair;
using ::testing::UnorderedElementsAre;
TEST(SmallWorldGraph, GenerateWattsStrogatzGraphInvalidInputsEvenK) {
EXPECT_DEATH(SmallWor... |
e771a3453bd111994f365499bad2c171220b889a | 68524c5251e959898dcabefff54b6e066d4fec6d | jtlap/nt2 | /modules/core/fuzzy/bench/scalar/almost_greater_or_equal.cpp | C++ | cpp | 3,517 | permissive | //==============================================================================
// Copyright 2003 - 2012 LASMEA UMR 6602 CNRS/Univ. Clermont II
// Copyright 2009 - 2012 LRI UMR 8623 CNRS/Univ Paris Sud XI
//
// Distributed under the Boost Software License, Version 1.0.
// ... |
f478acfe3a41ced48765eebf0fcb4660426987ed | 3e67e5dbca637c647a55b92a7fd20143dab97f83 | janunayak/Suntek-Assignment | /sub array sum.cpp | C++ | cpp | 462 | no_license | #include<iostream>
using namespace std;
int main()
{
int n;
std::cout<<"enter the n values:"<<endl;
std::cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int s=0,s1=0,p=0,r=0,t=0;
for(int i=0;i<n;i++)
{
p=i;
while(i<n && a[i]>=0)
{
s1=s1+a[i];
i++;
}
if(s1>s)
{
... |
86607a9f8fcae1d20b29641ca17139fec2a7de6b | d90a8ddd1db569f1a1aa2d22979dc6b3c5a9fa3a | SocioDroid/leetcode | /code/1319.number-of-operations-to-make-network-connected.cpp | C++ | cpp | 1,244 | no_license | class Solution {
public:
int makeConnected(int n, vector<vector<int>>& connections) {
if(connections.size() < n-1)
return -1;
vector<int> visited(n, false);
int count = 0;
vector<vector<int>> graph = createGraph(connections, n);
auto startNode = ... |
d488f2096a98718c17a7e078f37ac2ab0bbc0e96 | 7112c106a5265c9137b71bee6f90f18df10e103e | familymrfan/fanfei | /dp/Decorate/Decorate.cpp | C++ | cpp | 1,419 | no_license | #include <iostream>
#include <string>
using namespace std;
class Light
{
string name_;
public:
Light(const string& name):name_(name) {}
virtual ~Light() {}
virtual void Shine() {
cout<< "light:"<< name_ <<endl;
}
};
class LightDecorate : public Light
{
public:
Light* Decorate(Light* light) { ... |
3834e704548480cfef582f270832d03dd0bed935 | d3a1e9bd1777fd44f7eb05fbb3dd0c5dabd354ce | sshuster/constexpr-sql | /include/ra/cross.hpp | C++ | hpp | 640 | permissive | #pragma once
#include "ra/join.hpp"
#include "ra/relation.hpp"
namespace ra
{
template <typename LeftInput, typename RightInput>
class cross : public ra::join<LeftInput, RightInput>
{
using join_type = ra::join<LeftInput, RightInput>;
public:
using output_type = join_type::output_type;
static auto&& next(... |
8d27a220cfdeec8d0c59af26bb3a7d72626f0c41 | d4ad35782b725a4eca848458d5d6d2a5a2b5cb90 | sdhanush13/carlaviz | /backend/third_party/xviz/include/xviz/third_party/asio/detail/win_iocp_wait_op.hpp | C++ | hpp | 3,682 | permissive | //
// detail/win_iocp_wait_op.hpp
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~
//
// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
#ifndef ASIO_... |
6c3a1e37ba7c3a005ec6666588f4e9e9c21359d1 | 8eb8b7f4465f8032cedf0ec6988582fdcd26314a | BaronChiao/CNStream | /modules/unitest/core/test_cntimer.cpp | C++ | cpp | 3,842 | permissive | /*************************************************************************
* Copyright (C) [2019] by Cambricon, Inc. All rights reserved
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the Lice... |
d306b17047229d1b6fc9e940550c2a78d7e19f31 | 17eda5f9d89f48a6c0e1af7d23717b3e53dd846c | GeertLitjens/qtforpython_qtvs2020 | /examples/08_plugins/mainwindow.cpp | C++ | cpp | 7,741 | no_license | /****************************************************************************
**
** Copyright (C) 2017 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the Qt for Python examples of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:BSD$
** Commercial License Usage
** Licensees holding valid... |
a3f608617fd8c58a6b991e1d4bb6a4966d4807fd | dad62472aa87866277049344960766c674d8d332 | davidxdh/incubator-impala | /be/src/exec/data-sink.cc | C++ | cc | 7,016 | permissive | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... |
b4db11d4ce2258446b1cf40f2700bbc1bbccc720 | 4db0bdf3bce04040cdaec99511846777101e89ff | labibalfaruqi/Grafkom-WorldofCubicle | /vs/Lesson041/Demo.cpp | C++ | cpp | 28,792 | no_license | #include "Demo.h"
Demo::Demo() {
}
Demo::~Demo() {
}
void Demo::Init() {
// build and compile our shader program
// ------------------------------------
shaderProgram = BuildShader("vertexShader.vert", "fragmentShader.frag", nullptr);
BuildColoredTiang();
BuildColoredAtap();
BuildColoredPlane();
InitCame... |
953a182dc736dbd69e0a0a3091cd7be2c9aeef6a | d4b93684258ea40d033dd812fc6afbebab7d9d09 | guillaumetousignant/godonov_FV | /src/limiters/VanAlbadaLimiter_t.cpp | C++ | cpp | 1,304 | permissive | #include "limiters/VanAlbadaLimiter_t.h"
#include <cmath>
FVM::Limiters::VanAlbadaLimiter_t::VanAlbadaLimiter_t() {}
FVM::Limiters::VanAlbadaLimiter_t::~VanAlbadaLimiter_t() {}
void FVM::Limiters::VanAlbadaLimiter_t::calculate_derivatives(const std::vector<double> &x, const std::vector<double> &u, const std::vector<... |
1129a36a62b42e2dc2176168c41ac74465322d60 | 4e85e4b880cef21ff828f4e6b75485c3e3cde706 | ToxaKniotee/project_euler | /002.cpp | C++ | cpp | 754 | no_license | /* Copyright 2015 ToxaKniotee */
#include <stdio.h>
#define MAX_NUMBER 4000000
int main(int argc, char const *argv[]) {
int fibonacci_num;
int prev_numbers[] = {1, 2};
int sum = 2;
int save_position = 0;
/* Vamos creando los números de la secuencia, comprobamos si es par, en caso
* de serlo ... |
2e713ae8717150a5c1e13851c11d8e2a758ff6e0 | f6c2aca80e9ac49b5d7247990865eb31c24dccc1 | brycelelbach/nt2 | /modules/boost_math/include/nt2/toolbox/boost_math/function/simd/common/gamma_q_inv.hpp | C++ | hpp | 1,407 | permissive | //////////////////////////////////////////////////////////////////////////////
/// Copyright 2003 and onward LASMEA UMR 6602 CNRS/U.B.P Clermont-Ferrand
/// Copyright 2009 and onward LRI UMR 8623 CNRS/Univ Paris Sud XI
///
/// Distributed under the Boost Software License, Version 1.0
/// ... |
7ef1b68398759ae8dfd93980541100e5b3ffafff | 8e9c0d62ede7ba9668bf90d345fc1a4c28e6e835 | bingzhe123/MFC-Client-and-server | /DudTool/CMyScrollWnd.cpp | C++ | cpp | 3,429 | no_license | #include "pch.h"
#include "CMyScrollWnd.h"
#include "CommonDef.h"
CMyScrollWnd::CMyScrollWnd(CMyWindow* pParent, CWnd* pRootWnd, RefreshImplFunc fun)
:CMyContainerWnd(pParent, pRootWnd, fun)
{
m_pScrollBar = new CMyScrollbarWnd(this, m_pRootWnd, m_refreshImpFun);
m_pScrollBar->RegisterScrollWndFun([this](fl... |
0bd5821bf483722f94bbe9524c4bb54185e04ae2 | 350fb358815ca86735d766b7d20ccf9f1584c494 | 5l1v3r1/hiddenMarkovModel-in-NLP | /ngram_tools.cpp | C++ | cpp | 541 | no_license | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <map>
#include <string>
#include <list>
#include "ngram_tools.h"
using namespace std;
Ngram<3> make_trigram(const string& t1, const string& t2, const string& t3) {
Ngram<3> ret;
ret.t[0] = t1;
ret.t[1] = t2;
ret.t[2] = t3;
return... |
1afd6d7973d3cb9630c5ae80a779bc7fa098af7b | f1c0b45b749e8d136765a9600e38d1f5f9f72991 | EnzoNodes/ENZO | /src/qt/optionsmodel.cpp | C++ | cpp | 20,086 | permissive | // Copyright (c) 2011-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2020 The PIVX developers
// Copyright (c) 2021 The ENZO developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-lice... |
2b7e26b3add06198bde02040eecefb27be99bcb1 | 9afbc509da81b586d5b8293a4ec5eaf76e65b153 | ltf0501/Competitive-Programming | /TIOJ/TIOJ1108.cpp | C++ | cpp | 506 | no_license | #include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
char pre[55],in[55];
void print(int pre1,int pre2,int in1,int in2)
{
if(pre1==pre2)return ;
int root=in1;
while(in[root]!=pre[pre1])root++;
print(pre1+1,pre1+(root-in1)+1,in1,root);
print(pre1+(root-in1)+1,pre2,... |
3d1b2b0e8b6a61fa91c51f1647d8fdd1b87257f2 | 629f92d08b897803db36600385c0d01d57dd18e5 | rresol/Practice | /codeforces/divisorclique.cpp | C++ | cpp | 482 | no_license | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int>a(n);
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a.begin(),a.end());
vector<int>ans(n,0);
ans[0] =1;
for(int i=1;i<n;i++)
{
for(int j=0;j<i;j++)
{
if(__gcd... |
3a21df84f3d9a7e4490fd563d1c1446fbbc8cc9b | 843f36607a14291a1eab5feecf909d1db7f76b95 | sdwuyawen/eclipse_projects | /cpp_infix2postfix_3/src/cpp_test.cpp | C++ | cpp | 1,679 | no_license | //============================================================================
// Name : cpp_test.cpp
// Author : WYW
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
using ... |
ff47023034667ca765cbc32f3f72baaf21d9c53d | 82edea885edd9619eda3124b42f373118efab474 | Stephen1902/EndlessVehicleRunner | /Source/EndlessVehicleRunner/EVRSpawnMaster.cpp | C++ | cpp | 3,666 | no_license | // Copyright 2021 DME Games
#include "EVRSpawnMaster.h"
#include "EVRGameStateBase.h"
#include "Kismet/GameplayStatics.h"
#include "Vehicles/EVRVehiclePlayer.h"
// Sets default values
AEVRSpawnMaster::AEVRSpawnMaster()
{
// Set this actor to call Tick() every frame. You can turn this off to improve performance if... |
4d780c62c6dba55e6cbafab3fda52585d745aab4 | 81fb753bb845e71877ebb5a0cccc115135139607 | CompRD/BroadCRD | /src/paths/long/large/auxmain/GetGlobal.cc | C++ | cc | 1,681 | permissive | ///////////////////////////////////////////////////////////////////////////////
// SOFTWARE COPYRIGHT NOTICE AGREEMENT //
// This software and its documentation are copyright (2014) by the //
// Broad Institute. All rights are reserved. This software is supplied //
... |
893ea7db4ec6ba4580be5963a017351cb7997107 | 3d119c5585fff59c6425de532d89e3873aa060e3 | JoeAltmaier/Odyssey | /Odyssey/SSAPI_Server/ManagedObjects/CountFilter.cpp | C++ | cpp | 2,114 | no_license | //************************************************************************
// FILE: CountFilter.cpp
//
// PURPOSE: Implements the CountFilter object that will be used
// to filter result sets for ObjectManager::ListIds()
//************************************************************************
#include "C... |
c3fb3a44bfc747f4e5c6f7b67e35b7021bb7ff92 | 4c09f249217609a2095ea62d77c4e4f6d4d741e5 | iridium-browser/iridium-browser | /third_party/blink/renderer/core/css/media_values.cc | C++ | cc | 15,024 | permissive | // Copyright 2014 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "third_party/blink/renderer/core/css/media_values.h"
#include "third_party/blink/public/platform/web_theme_engine.h"
#include "third_party/blink/renderer/core/css/css... |
916fc88f0fceaad16e97ed9567d6f9278b960849 | 1bd35c1438e70c999b50fa3048bbabdd5a86a502 | Nagist91/chromium | /ui/base/x/x11_util.cc | C++ | cc | 48,868 | permissive | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// This file defines utility functions for X11 (Linux only). This code has been
// ported from XCB since we can't use XCB on Ubuntu while its 32-bit s... |
a715db5f43f43c5c1a4e553f9db90e8ead58ccdb | 29e946420e6ead53f68c90069cdaca68abbdc704 | AliOsm/CompetitiveProgramming | /UVA/11057 - Exact Sum.cpp | C++ | cpp | 771 | no_license | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> arr;
int main() {
int n, m, tmp, u, v, x, y;
while(cin >> n) {
arr.clear();
arr.resize(n);
for(int i = 0; i < n; i++) cin >> arr[i];
cin >> m;
tmp = m;
sort(arr.begin(), arr.end());
for(int ... |
77ee00ff7d0b8235a448ac70fb7b3cbc0f802106 | 84a157efe7dd64748b3727d802e869c8765d2ef2 | accb529/Kassiopeia | /KEMField/Source/BoundaryIntegrals/Magnetostatic/src/KMagnetostaticBoundaryIntegrator.cc | C++ | cc | 1,745 | no_license | #include "KMagnetostaticBoundaryIntegrator.hh"
namespace KEMField
{
void KMagnetostaticBoundaryIntegrator::BoundaryVisitor::Visit(KDirichletBoundary& boundary)
{
// TO DO: get the right values for magnetostatics!
fIsDirichlet = true;
fPrefactor = 1.;
fBoundaryValue = static_cast<DirichletBoundary&>... |
b59ad4bfb400d8949aa7436e29fb4af4d7a178e7 | 432ecfae50e5651aa4dd1b75a7bf9a3e7309af50 | yasyamanoi/BaseDx12 | /Libs/Dx12Lib/physics_effects/src/base_level/collision/pfx_intersect_ray_large_tri_mesh.cpp | C++ | cpp | 20,298 | permissive | /*
Physics Effects Copyright(C) 2012 Sony Computer Entertainment Inc.
All rights reserved.
Physics Effects is open software; you can redistribute it and/or
modify it under the terms of the BSD License.
Physics Effects is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implie... |
9846332cd735d448f482c615c3ac92ee46cfccc4 | 94d344dabe7d2cb487f36f7577bf1f4c37a13ceb | sbha2431/Abstractions-Learning | /NaoCodeBackup/core/motion/rswalk2014/DistributedGenerator.cpp | C++ | cpp | 16,270 | no_license | #include "DistributedGenerator.hpp"
#include "ActionGenerator.hpp"
#include "DeadGenerator.hpp"
#include "HeadGenerator.hpp"
#include "NullGenerator.hpp"
#include "RefPickupGenerator.hpp"
#include "StandGenerator.hpp"
#include "WalkEnginePreProcessor.hpp"
#include <iostream>
#include "utils/body.hpp"
//#include "util... |
48890a000b664cd3d966f1de8fae5b9f3983ff96 | 787897335df4909dcc8c76ce50d092470f5324f0 | ototsuyume/poj-solution | /1018.cpp | C++ | cpp | 1,305 | no_license | #include<cstdio>
#include<algorithm>
#include<string.h>
using namespace std;
int data[110][2],dp[110][1010];
int main(){
int t,n,m;
scanf("%d",&t);
while(t-- >0){
scanf("%d",&n);
memset(dp,0xff,sizeof(dp));
int maxb = 0;
for(int i=0;i<n;++i){
scanf("%d",&m);
... |
3134ebc188c72b86b5857bc609963d97cfb7242b | d48fc86047029fd3a990324365932344261a9cf9 | ImagePorcess/Image_Process | /include/NumCpp/Filter/Filters/Filters2d/complementaryMedianFilter.hpp | C++ | hpp | 2,630 | no_license | /// @file
/// @author David Pilger <dpilger26@gmail.com>
/// [GitHub Repository](https://github.com/dpilger26/NumCpp)
/// @version 1.2
///
/// @section License
/// Copyright 2019 David Pilger
///
/// Permission is hereby granted, free of charge, to any person obtaining a copy of this
/// software and associated documen... |
7527afc7646f1c27f904979ad8ff7916f7fc3151 | ba8ea606f3838711b400ffe7b7626658b8373062 | manulera/LeraRamirez2019 | /code/cytosim/src/sim/single_prop.cc | C++ | cc | 6,103 | no_license | // Cytosim was created by Francois Nedelec. Copyright 2007-2017 EMBL.
#include "single_prop.h"
#include "glossary.h"
#include "messages.h"
#include "property_list.h"
#include "simul_prop.h"
#include "hand_prop.h"
#include "single.h"
#include "wrist.h"
#include "wrist_long.h"
#include "picket.h"
#include "picket_long.h... |
fd28a7ba2780ccd40c67a75a06efee441289565f | a600d5cd08bb6b4643f241c8db249e7ce4a4776c | shingiyeon/codejam | /2021/Qualification Round/Reversort Engineering.cpp | C++ | cpp | 889 | no_license | #include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <functional>
#include <math.h>
using namespace std;
int main() {
cin.tie(NULL);
cout.tie(NULL);
ios::sync_with_stdio(false);
int t; cin >> t;
for(int tc=1; tc<=t; tc++) {
int a, b; ... |
08d7a3ed438c4ad2965c0fe3ff82e27a75f2e610 | f1f8a6cb3639fb9f301dfaaf72a73d9ab14e0750 | chaunnt/SampleQtModuleBasedConsoleProject | /SampleModule/SampleModuleManager.cpp | C++ | cpp | 2,401 | no_license | #include "SampleModuleManager.h"
#include "SampleModuleDefines.h"
#include "Framework/GlobalDefine.h"
static const QString c_VERSION = "1.00002";
SampleModuleManager::SampleModuleManager()
: m_pSampleModuleServer (new SampleModuleServer)
, m_pCommonFunctions (new CommonFunctions)
, m_pSampleModuleFileMana... |
7e1064d1ab78298073bbb86f72aeb5d4f891163d | bfea69cba55e9899279a219795b8d8978ff5f09c | Juna2/Autolift | /pose2command/src/param_last.cpp | C++ | cpp | 3,733 | no_license | #include "ros/ros.h"
#include "std_msgs/Float64.h"
class param
{
public:
ros::NodeHandle nh;
double orientation_x;
double orientation_y;
double orientation_z;
double degree;
double degree2;
double vel;
double vel2;
double current_pos;
double current_pos2;
void first()
... |
8e4e6f12e0f409834e3fff678d0effae5a13fcf1 | da6bab416d614245731609e3cc1e7d596eac5353 | peter4549/problems | /Baekjoon Online Judge/13460.cpp | C++ | cpp | 1,949 | no_license | #include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
struct Position {
int ry, rx, by, bx, count;
};
char board[10][11];
int bfs(Position start) {
const int dy[4] = { -1, 0, 1, 0 };
const int dx[4] = { 0, -1, 0, 1 };
bool visited[10][10][10][10] = { false };
int i, count(-1);
Position... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.