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 |
|---|---|---|---|---|---|---|---|---|
7763de0ed7e6a1811f0d7c2fd34489e7885ab664 | 7e13b94afd6ead641ee143466f1a942a6e5cba96 | platypusperry23/Imp_Codes | /codes/mindiff.cpp | C++ | cpp | 1,356 | no_license | #include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ll long long
#define ld long double
#define mkp make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof... |
226de65a5f6aaf3662a22d30e6a021b4a960585a | ea1f440d56073b64a51f285399bd8d63ceb52d0f | CU-0xff/juliet-cpp | /000/097/642/CWE36_Absolute_Path_Traversal__wchar_t_file_open_68b.cpp | C++ | cpp | 2,076 | no_license | /* TEMPLATE GENERATED TESTCASE FILE
Filename: CWE36_Absolute_Path_Traversal__wchar_t_file_open_68b.cpp
Label Definition File: CWE36_Absolute_Path_Traversal.label.xml
Template File: sources-sink-68b.tmpl.cpp
*/
/*
* @description
* CWE: 36 Absolute Path Traversal
* BadSource: file Read input from a file
* GoodSource:... |
35434f4304fd61eebf3b0b8e3278d758ce545729 | 83ebe1a5abdf48e3c1fb43cfa31c5fdea6c8a7b7 | Scootkali14001/chromium | /services/resource_coordinator/coordination_unit/page_coordination_unit_impl_unittest.cc | C++ | cc | 7,903 | permissive | // Copyright 2017 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 "services/resource_coordinator/coordination_unit/page_coordination_unit_impl.h"
#include "base/test/simple_test_tick_clock.h"
#include "services... |
03b340e80a51f8500b2c1ec53c824ab9912e1ab7 | c7806cc863c5f003d603928936953347c4395572 | timcanham/fprime | /Fw/Tlm/TlmPacket.cpp | C++ | cpp | 2,407 | permissive | /*
* TlmPacket.cpp
*
* Created on: May 24, 2014
* Author: Timothy Canham
*/
#include <Fw/Tlm/TlmPacket.hpp>
#include <Fw/Types/Assert.hpp>
namespace Fw {
TlmPacket::TlmPacket() : m_id(0) {
this->m_type = FW_PACKET_TELEM;
}
TlmPacket::~TlmPacket() {
}
SerializeStatus TlmPacket... |
356b3c4a48e50ff2d00d5ce78f57176c77567b65 | 4eea1b38ab4b97b1a3a77ebe0a06c12edfc86144 | franck-romano/v8 | /src/mips/interface-descriptors-mips.cc | C++ | cc | 13,375 | permissive | // Copyright 2012 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#if V8_TARGET_ARCH_MIPS
#include "src/interface-descriptors.h"
namespace v8 {
namespace internal {
const Register CallInterfaceDescriptor::ContextReg... |
a96815cfb7d43aa91bf408f0b0c98f0e8ab996db | 98a0f8c0abf00097655a2df95a4e514733d3e6eb | capeanalytics/aws-sdk-cpp | /aws-cpp-sdk-autoscaling/source/model/DescribeMetricCollectionTypesResult.cpp | C++ | cpp | 2,690 | permissive | /*
* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. 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.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" fil... |
35c088d00d6310d8bed099eebeca4cc39d0550cb | fe0da1b3f3efebd1ec65c25d186f8afad81cf1bb | svworld01/group-coding | /day0011/Remove_Duplicates.cpp | C++ | cpp | 645 | no_license | /*
code by : Vivek pandey
*/
class Solution {
public:
string removeDuplicates(string S) {
stack <char> st;
int i=0;
int n = S.size();
while(i<n){
if(st.empty()){
st.push(S[i]);
}
else if(st.top()==S[i]){
... |
69f1cb2f05e84560da2afadc6f1f0a1f8a1b2d39 | dcc343efef815fdc05da5da3eb09833d386fb4b4 | qiuliwang/hello-world | /EXE11/exe11_9.cpp | C++ | cpp | 845 | no_license | #include <iostream>
#include <string>
#include <numeric>
#include <vector>
using namespace std;
bool isShorter(const string &s1, const string &s2)
{
return s1.size() < s2.size();
}
bool GT4(const string &s)
{
return s.size() > 4;
}
int main()
{
vector<string> words;
string enter;
cin >> enter;
while(enter != ... |
e4688691795a294cc20be1caad1cffec5e1455bf | a5a342f9ff9bd9bd1dffb9d1356619cca0a3d235 | Duttenheim/fips-anyfx | /anyfx/api/lowlevel/base/subroutinebase.cc | C++ | cc | 735 | permissive | //------------------------------------------------------------------------------
// subroutinebase.cc
// (C) 2016 Individual contributors, see AUTHORS file
//------------------------------------------------------------------------------
#include "subroutinebase.h"
namespace AnyFX
{
//---------------------------------... |
792a04014a76fca0294a55c40e4de9e486cd7590 | 72eb1402e9c444de6f1f3e1f7a9b3f16a3b714ea | jstark/psc | /src/be/expr_interpreter.cpp | C++ | cpp | 6,946 | no_license | #include "be/expr_interpreter.h"
#include "im/icode.h"
#include "be/rt_error.h"
#include "be/rt_error_handler.h"
#include <set>
using namespace psc::im;
using namespace psc::be;
namespace
{
std::set<ICodeNodeType> ARITH_OPS = {
ICodeNodeType::ADD,
ICodeNodeType::SUBTRACT,
ICodeNodeType::MU... |
1a0bb022dcb03fe3572e1f5c9e8951373e5446f7 | b8d7614c6e66dd0145cb2df9ce8d8a36afec92ff | pu2oqa/muServerDeps | /_Include/boost/spirit/home/lex/detail/sequence_function.hpp | C++ | hpp | 2,305 | no_license | ////////////////////////////////////////////////////////////////////////////////
// sequence_function.hpp
// Copyright (c) 2001-2011 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)
#if... |
5c4d887e94e940c5e0749808736981b91698c7e3 | 67d6a968c4726b29196bb4e7ea167ebe7e9b28a6 | Akanksha494/CPP | /travelps.cpp | C++ | cpp | 330 | no_license | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;++i)
#define repr(i,k) for(i=k;i>0;--i)
int main()
{
int t;
cin>>t;
while(t--){
int n,a,b;
cin>>n>>a>>b;
string s;
cin>>s;
int z=0,y=0;
for(auto i : s){
if(i=='0')
z++;
else y++;
}
cout<<(z*a + y*b)<<'\n';
}
r... |
7fd6c9eacdb12795a4923021ba10b87ad1c14527 | 083d083e5c59bbaed01c91c476f1044090098c64 | GOMC-WSU/GOMC | /src/cbmc/DCCrankShaftDih.cpp | C++ | cpp | 17,454 | permissive | /*******************************************************************************
GPU OPTIMIZED MONTE CARLO (GOMC) 2.75
Copyright (C) 2022 GOMC Group
A copy of the MIT License can be found in License.txt
along with this program, also can be found at <https://opensource.org/licenses/MIT>.
********************************... |
1d12ce66f36d59a8cf1dd35da2e3262ded1ccc19 | 317faf88060124d1cd52d4fdc26e8fbd8feb5c96 | yangjufo/LeetCode | /C++/4. Median of Two Sorted Arrays.cpp | C++ | cpp | 1,640 | no_license | class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int count = 0;
int last, now;
int total_length = nums1.size() + nums2.size();
vector<int>::iterator ite1 = nums1.begin();
vector<int>::iterator ite2 = nums2.begin()... |
1d2d4677a5f56d9e890ca9909bee5f733adb26bb | afbcf390aa5dcbf7eae6efd6075f8c2c3b17d8b6 | novaquark/aws-sdk-cpp | /aws-cpp-sdk-eventbridge/source/model/DescribeEventSourceRequest.cpp | C++ | cpp | 1,370 | permissive | /*
* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. 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.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" fil... |
9674626a9200d7f75fd68cd7d9806fd74622fd9c | 70f1c35bdfa05a7e49279453bcb9cb75bf09d398 | igrikRS/HoMM3-Plugins | /wog native dialogs/wog native dialogs/src/WoGOptionsSaveOrLoad.cpp | C++ | cpp | 41,764 | no_license | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
///////////////////////////////// диалог загрузки/сохранения Вог опций /////////////////////////////////////////////////////
// #include "dirent.h"
// #include <string>
// #include <iostrea... |
423a57102e1766f505347a281d6aafab12d38be0 | 421c323a89834ff579652e5793a41d6275ac1802 | DariaWelt/Calculator-dll | /LibSrc/SinusOperation.cpp | C++ | cpp | 262 | no_license | //
// Created by Дарья on 11.12.2020.
//
#include "SinusOperation.h"
#include <cmath>
double SinusOperation::process(std::vector<double> args) const {
return sin(args[0]);
}
SinusOperation::SinusOperation() : UnaryOperation("sin", 1){};
|
bb8cf22315d7b56181a270bd4881913ea43aadff | 027013d9ac1bcf2bf5cda17e7feb96518a49cdde | 15800688908/poj-codes | /3667/6676852_WA.cpp | C++ | cpp | 2,999 | no_license | #include<stdio.h>
const int maxn=51000;
#define max(a,b) a>b?a:b;
int n,m,tot;
struct node
{
int a,b,ls,rs,lmax,rmax,max,tag; //
};
node tree[3*maxn];
int init(int a,int b)
{
int mid,cur;
cur=tot;
tree[cur].a=a,tree[cur].b=b;tree[cur].tag=1; // 表示整段为空
tree[cur].lmax=tree[cur].rmax=tree... |
ff856c7b56503ec14b2fb0e59aeaed8ef99493e6 | 771fc2158704e767514cd6c65fd2cb4c3a8fb0bd | tiankonguse/ACM | /contest/poj/vol_24/3316.cc | C++ | cc | 3,354 | no_license | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#define inf 0x3f3f3f3f
#define Inf 0x3FFFFFFFFFFFFFFFLL
#define maxn 40404
#define maxl 222
using namespa... |
5c28b1e955a34c2503711c86101710b1f9f38608 | 50a22d4502288baa57570811626649a99a257cef | karshann/NtLauncher | /PipeWay/accountadder.cpp | C++ | cpp | 1,088 | no_license | #include "accountadder.h"
#include "ui_accountadder.h"
AccountAdder::AccountAdder(QStringList accountFileList, QString Lang, QWidget *parent) :
QMainWindow(parent),
ui(new Ui::AccountAdder)
{
ui->setupUi(this);
setWindowIcon(QIcon(":/images/chaussons.png"));
ui->CB_LANG->setCurrentIndex(ui->CB_LANG... |
a0ca3ead82ed3c6c29d6a2ac393dc5b2ab0fc015 | 052a46f7ea8eabe8a894f8aa74e221ced7535946 | chibiketan/Croissant | /Sources/Engine/Include/Core/Type.hpp | C++ | hpp | 1,301 | no_license | #pragma once
#ifndef TYPE_H_
#define TYPE_H_
#include "Engine.hpp"
#include "Core/NonCopyable.hpp"
#include "Define.hpp"
#include "Core/Pimpl.hpp"
#include <vector>
#include "Core/String.hpp"
using String = Croissant::Core::String;
namespace Croissant
{
namespace Core
{
class ENGINE_API Type : public Croissant::... |
b34a90392d3e4c5c2ca03e57f38e384e9543ff2f | d76615fd39b1204cc76f492279f1f6705cf5ffed | kssenii/ClickHouse | /dbms/src/Functions/currentUser.cpp | C++ | cpp | 1,386 | permissive | #include <Functions/IFunctionImpl.h>
#include <Functions/FunctionFactory.h>
#include <Interpreters/Context.h>
#include <DataTypes/DataTypeString.h>
#include <Core/Field.h>
namespace DB
{
class FunctionCurrentUser : public IFunction
{
const String user_name;
public:
static constexpr auto name = "currentUser"... |
4fffe21fc6461329c1a00f60aa2f877ba8b80e09 | 06babed6fc3b9bea90c309beeedfe5921c03a7f7 | sanyaade-teachings/engine-1 | /native/cocos/platform/interfaces/modules/canvas/CanvasRenderingContext2D.cpp | C++ | cpp | 18,661 | permissive | /****************************************************************************
Copyright (c) 2021-2022 Xiamen Yaji Software Co., Ltd.
http://www.cocos.com
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated engine source code (the "Software"), a limited,
wo... |
f957846b369d714182944bf80ce0ed79012b5862 | fd6dc513a3638ccc3a14f6f63b43418b2e60dcdc | xamarin/binding-tools-for-swift-reflector | /lib/Sema/DerivedConformanceRawRepresentable.cpp | C++ | cpp | 20,022 | permissive | //===--- DerivedConformanceRawRepresentable.cpp - Derived RawRepresentable ===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/L... |
19bb90fbfb84df679e5717d0f1f373aa912d5cf4 | 2e339a4c3324ece1fc863f6c45ac81b5b7d99d08 | PaddlePaddle/Paddle-Lite | /lite/backends/nnadapter/nnadapter/src/operation/math/utility.cc | C++ | cc | 2,714 | permissive | // Copyright (c) 2021 PaddlePaddle 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... |
a4f4ffe8d59060efd4f09c800ebc3589da67f4cf | 0e7c33f683f4c8968f7c7f3eee659250be629ddf | trabs/DCMTK | /dcmimage/libsrc/dicopx.cxx | C++ | cxx | 5,680 | permissive | /*
*
* Copyright (C) 1996-2009, OFFIS
*
* This software and supporting documentation were developed by
*
* Kuratorium OFFIS e.V.
* Healthcare Information and Communication Systems
* Escherweg 2
* D-26121 Oldenburg, Germany
*
* THIS SOFTWARE IS MADE AVAILABLE, AS IS, AND OFFIS MAKES NO WARRA... |
02d17b0b6a292e62ea9a00c8b5e8617bc435494c | 32e8ddd92af21c8c302377a2ca6615f70adcc369 | 9606/sysrepo | /swig/cpp/src/Session.cpp | C++ | cpp | 21,343 | permissive | /**
* @file Session.cpp
* @author Mislav Novakovic <mislav.novakovic@sartura.hr>
* @brief Sysrepo Session class implementation.
*
* @copyright
* Copyright 2016 Deutsche Telekom AG.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the Lice... |
83d106391433d180cc547f9bc8ef50e3b5ac8085 | fb4215ac1bfe66fe3033a05cbe25549cf0ecff54 | hiroshi-maybe/codeforces | /solutions/TripleFlips.cpp | C++ | cpp | 5,290 | no_license | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>
#include <iostream>
#include <utility>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <unordered_set>
#include <unordered_map>... |
e1572ce6349e3e8fda6a578a59f1185c4b34b4e1 | 6807d0cb2314c531742af6f3e7ea3484e4585482 | cmkcoin/cmkcore | /src/pow.cpp | C++ | cpp | 11,423 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "pow.h"
#include "arith_uint256.h"
#include "chain.h"
#include "chainpa... |
3ee226c718ddccbd4fb080942835def29dcff627 | fa204cbd38ea8d79d1c5b6f6a80589dabf592ae7 | bigben0123/chromium | /chrome/test/chromedriver/webauthn_commands.cc | C++ | cc | 9,492 | permissive | // Copyright (c) 2019 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 "chrome/test/chromedriver/webauthn_commands.h"
#include <string>
#include <utility>
#include <vector>
#include "base/base64.h"
#include "ba... |
821bddd5a04233c59efd0ec3b23a39040e509a40 | f4d656241450d292b081920c3cbc0b9179884c72 | Ms2ger/angle | /src/libANGLE/renderer/gl/RendererGL.cpp | C++ | cpp | 10,149 | permissive | //
// Copyright 2015 The ANGLE Project Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
// RendererGL.cpp: Implements the class methods for RendererGL.
#include "libANGLE/renderer/gl/RendererGL.h"
#include <EGL/eglext.h>
#includ... |
f3dedc24cd1b9810f45cca43c402ec0344643f76 | 62305f5acf16d19b125424694c37db29e58f6bf3 | Afalide/wp8-directx11 | /vc2013/MyApp/code/engine/texture_shader_class.hpp | C++ | hpp | 1,689 | no_license |
#pragma once
#include <DirectXMath.h>
#include <Windows.h>
#include <d3d11.h>
class texture_shader_class
{
struct matrix_buffer_type
{
DirectX::XMFLOAT4X4 world;
DirectX::XMFLOAT4X4 model;
DirectX::XMFLOAT4X4 view;
DirectX::XMFLOAT4X4 projection;
};
ID3D11VertexShader... |
e3f73a1591e076e20ca9f47a4e0b0211a28e9a8e | 71b68541865ff3f84594e643f267cadff0a5ced3 | operativeF/Kvasir | /Lib/Chip/ATSAMR21G17A.hpp | C++ | hpp | 1,661 | permissive | #pragma once
#include <cstdint>
#include <Chip/CM0+/Atmel/ATSAMR21G17A/AC.hpp>
#include <Chip/CM0+/Atmel/ATSAMR21G17A/ADC.hpp>
#include <Chip/CM0+/Atmel/ATSAMR21G17A/DMAC.hpp>
#include <Chip/CM0+/Atmel/ATSAMR21G17A/DSU.hpp>
#include <Chip/CM0+/Atmel/ATSAMR21G17A/EIC.hpp>
#include <Chip/CM0+/Atmel/ATSAMR21G17A/EVSYS.hp... |
9e3a2317dcdcb9b0d9e5a495d233cd182c309517 | 1328693dff3d12fbaeca0ab523c4df105895449d | sanwushuosi/OJ-CODE | /codeforces/869c.cpp | C++ | cpp | 1,002 | no_license | #include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int cal(int x, int y, vector< vector<int> > &sz){
if (sz[x][y] != 0) return sz[x][y];
else if (x > y) return cal(y, x, sz);
else{
ll a = cal(x - 1, y, sz);
ll b = cal(x ... |
836ab1a34602eaa8c2a5a3e33f9daaa1cd7ca940 | c8f01c6677918aac6c9bc56283a7b84bc20a768c | timopulkkinen/BubbleFish | /chrome/browser/profiles/profile_manager_unittest.cc | C++ | cc | 23,339 | 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 <string>
#include "base/command_line.h"
#include "base/file_util.h"
#include "base/files/scoped_temp_dir.h"
#include "base/message_loop.h"
#... |
3c372fdf0eff752221049ce338f78cf142222c16 | 45026b7ec390264675c5114dac06b93112b6b8d7 | fkrafi/Algorithms | /scc.cpp | C++ | cpp | 1,036 | no_license | #include<stdio.h>
#include<vector>
#include<stack>
using namespace std;
#define SZ 105
int nV, nC;
int seen[SZ], vst;
stack<int> S, ES;
vector<int> edge[SZ], rEdge[SZ];
void init(){
int i;
vst++;
S = ES;
for(i=0; i<SZ; i++){
edge[i].clear();
rEdge[i].clear();
}
}
void dfs(int u){
int i, v;
seen[u] = vst;... |
836547907f481b2f710f7509dbb4e3c16f405566 | 3e707153719514b5b07a7172b05c2f67e0368cf1 | hudacse6/Beginner-and-Intermediate-level-Programming-Codes | /52Problems/29.11.2017/9.cpp | C++ | cpp | 370 | no_license | //#include<bits/stdc++.h>
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
int tcase;
cin >> tcase;
while ( tcase-- )
{
double res,in_val;
cin>>in_val;
res=sqrt(in_val);
if(ceil(res)==floor(res))
{
cout<<"YES"<<endl;
}
else... |
a08a8e3993f6cb4bc17a833654a67dfcc1b83e43 | ba022c02b91d21dc08bd9198f536c79e24a45cd9 | oxidecomputer/openapi-generator | /samples/client/petstore/cpp-qt5/client/PFXHttpRequest.cpp | C++ | cpp | 17,693 | permissive | /**
* OpenAPI Petstore
* This is a sample server Petstore server. For this sample, you can use the api key `special-key` to test the authorization filters.
*
* The version of the OpenAPI document: 1.0.0
*
* NOTE: This class is auto generated by OpenAPI Generator (https://openapi-generator.tech).
* https://openap... |
5e7d5fe577f2ec82653b10233760f3ebe12cee7d | cb48c90d8b9b93bdd97ae7c0e15777ffcdda21c5 | lswzjuer/caffe-adas | /src/caffe/blob.cpp | C++ | cpp | 15,160 | permissive | #include <climits>
#include <vector>
#include "caffe/blob.hpp"
#include "caffe/common.hpp"
#include "caffe/syncedmem.hpp"
#include "caffe/util/math_functions.hpp"
namespace caffe {
template <typename Dtype>
void Blob<Dtype>::Reshape(const int num, const int channels, const int height,
const int width... |
525dbbb4284d08b243d4800d43448899b47fb44f | 92721a2fedbf31774592889855fb2cbbf1c4b0f5 | KiranThomasCherian/Sem-4-IIITDM | /DBMS/fdmin1.cpp | C++ | cpp | 5,269 | no_license | #include<stdio.h>
#include<string.h>
#include<iostream>
#include<cstdlib>
#include<utility>
#include<algorithm>
#include<vector>
using namespace std;
int n;
char a[10];
string fd[50][2];
string fdr[50][2];
int q=0;
int fn;
void input(){
printf("Enter no of attributes : ");
cin>>n;
printf("Enter attributes (characters)... |
228e30a78f53edf570df8969b2c3c49d8fbaa5f3 | c508128a42df88e62d7bcec6500fe92d3c057f17 | hugoam/two | /src/ui/Scrollbar.cpp | C++ | cpp | 2,210 | permissive | // Copyright (c) 2019 Hugo Amiard hugo.amiard@laposte.net
// This software is provided 'as-is' under the zlib License, see the LICENSE.txt file.
// This notice and the license may not be removed or altered from any source distribution.
#ifdef TWO_MODULES
module;
#include <infra/Cpp20.h>
module two.ui;
#else
#includ... |
f620de85b6cfe4922935f86114613a24090cdd4b | 07e79bf3fbf2c41c25d29ccb21e89f75a7619ea4 | anagonousourou/contests-prog | /exercism/cpp/sieve/sieve.cpp | C++ | cpp | 826 | no_license | #include "sieve.h"
#include <vector>
#include <cmath>
using namespace std;
namespace sieve
{
vector<int> primes(int maxPrime)
{
maxPrime = maxPrime + 1;
vector<int> primesNumbers = vector<int>();
vector<bool> sieve = vector<bool>(maxPrime, true);
sieve[0] = false;
sieve[... |
be7f1f297978b718584f40a3f201707889ed8c57 | 73e7aded2e446e4a7a8a4c3fd77e4f2564cb2314 | Watch-Later/ncbi-cxx-toolkit-public | /src/objtools/validator/validerror_descr.cpp | C++ | cpp | 4,898 | no_license | /* $Id$
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "United States Government Work" under the
* terms of the United States Copyrig... |
fe35d5b3a4aae70b1c79f3772db6110225a2b4c3 | bcab086ce3405e5cfab7b85d440e5d1438271c1b | JeffersonLab/sim-recon | /src/programs/Simulation/gen_2pi_primakoff/gen_2pi_primakoff.cc | C++ | cc | 11,821 | no_license |
#include <iostream>
#include <fstream>
#include <complex>
#include <string>
#include <vector>
#include <utility>
#include <map>
#include <cassert>
#include <cstdlib>
#include "particleType.h"
#include "AMPTOOLS_DATAIO/ROOTDataWriter.h"
#include "AMPTOOLS_DATAIO/HDDMDataWriter.h"
#include "AMPTOOLS_AMPS/TwoPiAngles_... |
ba3443583bd23d88f450ba1a3828678d79a34cbc | 0e5e55017224e5d654172dfc83fdac78c079bc11 | webstorage119/easyeye | /easyeye/tests/utils_test.cc | C++ | cc | 2,980 | permissive | /*
* File: testutils.cc
* Author: ibgmike
*
* Created on Jan 26, 2014, 11:37:42 AM
*/
#include <cerrno>
#include <cstdlib>
#include <iostream>
#include <string>
#include <uuid/uuid.h>
#include <sstream>
#include <cassert>
#include <cstring>
#include "../src/easyeye/common/easyeye_utils.h"
#include <unistd.h>
... |
38c17928bed7ad2b9d79fe348e6deb6b58a9d3b5 | d446c81cf4bd91879bbc7bce8d8f77435512a73f | RetroAchievements/RAEmus | /RAVBA-M/src/gtk/displayconfig.cpp | C++ | cpp | 5,181 | no_license | // -*- C++ -*-
// VisualBoyAdvance - Nintendo Gameboy/GameboyAdvance (TM) emulator.
// Copyright (C) 2008 VBA-M development team
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either versio... |
0c196ab665829392eb7048730d0568c60d784527 | 6d1727eeb273bcf8c73ea7d9a82ef8d245f7ebd5 | LuciferMV/hashing | /doubleAgents.cpp | C++ | cpp | 360 | no_license | #include <iostream>
#include <string>
#include <unordered_set>
using namespace std;
int main(){
int n;
cin>>n;
int total(0);
unordered_set<string> s;
while(n--){
int m;
cin>>m;
total += m;
while(m--){
string temp;
cin>>temp;
s.insert(temp);
}
}
int distinct = s.size();
cout<<distinct<<endl;
... |
ccd704a15487e9625ae8ac7cf0c1850cbe94992c | e38d5fbcf4a80dcfc476db1f1ed0dc5680606069 | FedorIvachev/GraphicsCourse | /Ray Tracing/raytrace_hw/main.cpp | C++ | cpp | 262 | no_license | #include"raytracer.h"
int main() {
Raytracer* raytracer = new Raytracer;
raytracer->SetInput( "scene_FINAL.txt" );
raytracer->SetOutput( "picture.bmp" );
//raytracer->Run();
raytracer->MultiThreadRun();
//raytracer->DebugRun(740,760,410,430);
return 0;
}
|
b64d2661294a1e9669036b1b49720f7caf0db506 | b0d14d74f96a41b216d4ddc2ba2c4b5c1830352a | ashwin1608/CodeAway | /TICBOOTH.CPP | C++ | cpp | 1,659 | no_license | #include<conio.h>
#include<iostream.h>
#include<stdio.h>
#include<dos.h>
#include<ctype.h>
class ticbooth
{
private :
static int people;
static float price ;
static int tno;
int key;
char c;
public :
ticbooth()
{
people++;
}
void infodisp()
{
cout<... |
07041a7ba25f16309c0bf8a302922d861aead18f | abd933dc0de64986b142c5fd595fef013ab3c38d | ksb451/Cpp_DSA | /Tries/trie.cpp | C++ | cpp | 3,353 | no_license | #include <iostream>
#include <string>
#include <vector>
using namespace std;
// struct TrieNode
// {
// int num; //contains the no of words contain within this link
// TrieNode *child[26]; //al tha links
// bool isendofword; //is it a end of word
// TrieNode() //constructor
// ... |
f52e8ce3b0b9789d8b9694b9abe4ae4b7ce280cb | 499349599d38183e0713e373a1d60c2825d74242 | Boyquotes/scifi-tactics | /assets/scripts/native/inc/misc/resource_stats.hpp | C++ | hpp | 845 | permissive | #ifndef RES_STATS_H
#define RES_STATS_H
#include <Godot.hpp>
#include <Node.hpp>
/*
* This is an example class showing how a C++ script in Godot can work.
* Specifically it shows how to:
* - Print to stdout
* - Retrieve/use global singleton object (both user-defined and Engine)
* - Register/handle... |
889b7e34d8e1ce48d434d091ddf2d797d623109f | 29fceb280e55c6a3c762d3425fbef0892f257f5a | VitalyGrachev/Nsu-computer-graphics | /Filter/view/filter_action_group.cc | C++ | cc | 464 | no_license | #include "filter_action_group.h"
FilterActionGroup::FilterActionGroup(QObject * parent)
: QActionGroup(parent) {}
void FilterActionGroup::add_filter_action(FilterAction * action) {
QActionGroup::addAction(action);
QObject::connect(action, SIGNAL(apply_filter(QString)),
this, SIGNA... |
df332ef93a843c23409bf73587cca595bfe0d603 | 8dc38687ad3c2dceb351471240be08e2e5534478 | tobyalden/worry | /bin/mac64/cpp/obj/src/__ASSET__graphics_debug_console_output_png.cpp | C++ | cpp | 6,653 | no_license | #include <hxcpp.h>
#ifndef INCLUDED___ASSET__graphics_debug_console_output_png
#include <__ASSET__graphics_debug_console_output_png.h>
#endif
#ifndef INCLUDED_haxe_Resource
#include <haxe/Resource.h>
#endif
#ifndef INCLUDED_haxe_io_Bytes
#include <haxe/io/Bytes.h>
#endif
#ifndef INCLUDED_openfl__legacy_display_BitmapD... |
ab3804ba74de4607963d777f7b1dce123c75a701 | e701aeb66338c3142b6bc5c826be6d665df91fb1 | Onzi12/OopCourseExercises | /Excercise4/ADiGraph.cpp | C++ | cpp | 1,118 | no_license | #include <iostream>
#include "DiGraph.h"
#include "ADiGraph.h"
using namespace std;
/*Empty constructor*/
ADiGraph::ADiGraph() : DiGraph() {
}
/*Constructor*/
ADiGraph::ADiGraph(int n, double infinity) : DiGraph(n, infinity) {
}
void ADiGraph::addArc(int i, int j, double w) {
if (i > j) { //if i is greater tha... |
113188a02839682212535b364aa03bbab941ca60 | a471dbb1dd8011f3947d177b65951fe89270a6af | zhangshunqiu/mir2x | /tools/shadowmaker/src/actionset.hpp | C++ | hpp | 1,847 | no_license | #pragma once
#include "rectcover.hpp"
#include <functional>
#include <FL/Fl_Shared_Image.H>
#include <FL/Fl.H>
#include <tinyxml2.h>
class ActionSet
{
public:
ActionSet();
~ActionSet();
public:
void Draw(int, int);
bool ImportMir2Action(int, int, int, int);
bool Valid();... |
ebc77fd58abca21b709299ad9c49192aee4760aa | cf17cb2df229d585b05d9770da35500d6bafa5a5 | mengyx-work/data_processing_package | /include/ZeroSuppressor.hh | C++ | hh | 842 | no_license | /*
Perform zero-suppression on the waveforms.
Use simple threshold value to determine if sample is
to be zero-suppressed.
YMENG 04-44-2014
*/
#ifndef ZeroSuppressor_hh
#define ZeroSuppressor_hh
#include "EventData.hh"
#include "CfgReader.hh"
#include <string>
class ZeroSuppressor
{
public:
ZeroSuppresso... |
3b82689021a22ceef40d70a7d24a1fc00c342eb9 | 1c09ac1bd8e5909917590211b35250401751d330 | mohamedGamalAbuGalala/Practice | /Study Material/ArabicCompetitiveProgramming-master/11 Data Structures/Algorithms_Data_Structures_02_Queue_basic.cpp | C++ | cpp | 781 | permissive | #include <iostream>
using namespace std;
const int MAX_SIZE = 5;
class queue {
private:
int *qu, front, rear;
public:
queue() {
front = -1;
rear = -1;
qu = new int(MAX_SIZE);
}
void push(int data);
int pop();
bool IsFull();
bool IsEmpty();
void display();
};
void queue::push(int d) {
if (IsFull()) {... |
8b9f924478bc1c95f7308c1a922a2dacfb712715 | 6c8f29c2e789d0b728607947b8cf561adebfa7df | Tobraef/Maze | /Labirynth.cpp | C++ | cpp | 9,866 | no_license | #include "Labirynth.h"
#include <iostream>
#include <algorithm>
#include <math.h>
#include <queue>
using namespace utils;
Labirynth::Labirynth(const std::string& fileName, sf::RenderWindow& w)
: window(w)
{
image_.loadFromFile(fileName);
auto size = image_.getSize();
renderRectangle_ = sf::Rect<int>... |
303a7982b65a04ee2ba217da50fc09272c9b84aa | a2f4854b871097dc70f4b099cd7a32a2e7fcd829 | ECS-251-W2020/chromium | /extensions/common/extension_features.cc | C++ | cc | 1,850 | permissive | // Copyright 2017 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 "extensions/common/extension_features.h"
namespace extensions_features {
// Controls whether we redirect the NTP to the chrome://extensions pag... |
f450156e97a78a72de682dfb90339ba1d42b69c0 | 74376abddf7b9863dd52bc4487ec6c8e0f9882b0 | luhaibo/GameFramework | /CCGameFramework/script/code/init/boot_check.cpp | C++ | cpp | 887 | no_license | #include "/include/shell"
#include "/include/readfile"
int main(int argc, char** argv) {
int j = fork();
if (j == -1) {
shell("touch /pipe/sys_entry_shell_start");
int handle = open("/pipe/sys_entry_shell_start");
if (handle >= 0) {
while (recv_signal() != 9) {
... |
b2f08225db4b2c0d0ac38a0ef4482453c5631da8 | 1fca2e4d3393e0a786c14717c2551ef58e07d4fd | jkstpierre/Elgar-Game-Engine | /Engine/elgar/physics/Movable.hpp | C++ | hpp | 1,269 | no_license | /*
Elgar Game Engine
Author: Joseph St. Pierre
Year: 2018
*/
#ifndef _ELGAR_MOVABLE_HPP_
#define _ELGAR_MOVABLE_HPP_
// INCLUDES //
#include <glm/glm.hpp>
namespace elgar {
/**
* @brief A Movable is a base class for objects that have a position
*/
class Movable {
private:
glm::vec3 m_pos... |
e8f2217db4f5d45979c844a620b6e2d80408f674 | f93f8f3365ef6cc472606ea073b993e33880b0c2 | ConnectionMaster/compute-runtime | /level_zero/tools/source/debug/linux/prelim/debug_session_linux_helper.cpp | C++ | cpp | 387 | permissive | /*
* Copyright (C) 2022 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
*/
#include "level_zero/tools/source/debug/linux/prelim/debug_session.h"
#include <level_zero/ze_api.h>
namespace L0 {
DebugSession *createDebugSessionHelper(const zet_debug_config_t &config, Device *device, int debugFd) {
return ne... |
5f5c1b21d073ff4736ffbdf950af9259c8205010 | a642df0f22fcc1c96899a39239caabed1a7bd69c | xijunlee/tensorflow-learning | /tensorflow-master-tensorflow/core/kernels/save_op.cc | C++ | cc | 3,743 | permissive | /* Copyright 2015 Google 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 License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in ... |
ad63b3b0133ae5458f0de6452abbf39628408f08 | 3df49dfc36e3ff86a70b8d11721d18e02ab56e3c | priyankjairaj100/Codeforces-Solutions | /contest/230/b/30599487.cpp | C++ | cpp | 556 | no_license | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int limit = 1000005;
int main()
{
int prime[1000005];
fill_n(prime, 1000005, 1);
for (int i=2;i*i<limit;i++)
{
if (prime[i])
{
for (int j=i*2;j<limit;j+=i)
prime[j] = 0;
}
... |
105321d4755c82f83d7ed94e82b0d45816b39e99 | 233750bb0d02de1b874b84150d5702f407186c98 | phil-the-frog/CommandLineProjects | /BoggleGenerator.cpp | C++ | cpp | 21,204 | no_license | /*
Program: #5, Boggle Generator
Class: CS 141, Fall 2017. Tues 9am lab
System: Windows 10, 2017 Visual Studio Community
Author: Phillip Sopt
TA: Moumita Samanta
Description: This program is designed to generate the most optimized boggle table.
*/
#define _CRT_SECURE_NO_WARNINGS
#include <iostream> // For ... |
e925c61042c0244d8c5d96ce620eea7465754199 | e83f90557bf6e668f9c3d7d751fcb63f7cfc6b5c | razodactyl/darkreign2 | /coregame_interface/studio_mission.cpp | C++ | cpp | 4,412 | no_license | ///////////////////////////////////////////////////////////////////////////////
//
// Copyright 1997-2000 Pandemic Studios, Dark Reign II
//
// Mission Based Configuration
//
// 20-APRIL-2000
//
///////////////////////////////////////////////////////////////////////////////
//
// Includes
//
#include "s... |
bb36cf4007bab5b321609bf7231f91bc89b894b1 | 818e00b8a8ea91c31deb924f18884b7c618bf495 | JinshengRuan/cs148 | /assignment8/ProgrammableShading/main.cpp | C++ | cpp | 11,003 | no_license | // main.cpp
//
// For this project, we use OpenGL, GLUT
// and GLEW (to load OpenGL extensions)
//
#include "stglew.h"
#include <stdio.h>
#include <string.h>
//
// Globals used by this application.
// As a rule, globals are Evil, but this is a small application
// and the design of GLUT makes it hard to avoid them.
... |
3a23b091a423d66140c66279ae5767c3f25dff14 | 0ac511f6627a7f79d778cf37e041e755392bdb73 | sugawaratukasa/Jobi_SugawaraTsukasa | /吉田学園情報ビジネス専門学校_管原司/ハッカソン/ソースコード/HGS_2021_Spring/main.cpp | C++ | cpp | 4,788 | no_license | //=============================================================================
//
// メイン [main.cpp]
// Author : 二階堂汰一
//
//=============================================================================
//*****************************************************************************
// ヘッダファイルのインクルード
//*****************... |
abf033bc3d366ed81ef681dc23ffa5fc088d4cf2 | e87f82dc2dfb57d0b731e5ae725dc62b1d07855a | hoaf13/SPOJ_PTIT_DSA | /CPPPRI11.cpp | C++ | cpp | 551 | no_license | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void process(){
ll n;
cin >> n;
if (n > ll(1e12)){
cout << 0 << endl;
return ;
}
ll sumz = 1;
for(int i=2;i<sqrt(n);i++){
if (n % i == 0){
sumz += i;
sumz += n/i;
}
... |
8b282052a522346151436af22be0acdb327d05e3 | 41392d039faf5bf8b15184adda94be2f32fd1117 | amishra44/libfluid_msg | /fluid/of15/of15instruction.cc | C++ | cc | 12,196 | permissive | #include "of15instruction.hh"
namespace fluid_msg {
namespace of15 {
Instruction::Instruction()
: type_(0),
length_(0) {
}
Instruction::Instruction(uint16_t type, uint16_t length)
: type_(type),
length_(length) {
}
bool Instruction::equals(const Instruction &other) {
return (*this == other)... |
7a13f9dd10f9ec5c7f23654f557c2d527b9f63a9 | 28aa61fbb1190d22dfde8316c6d9044443742f93 | ksnabb/stan_bun | /raytrace/src/point_light.hh | C++ | hh | 456 | no_license | // -*- mode: c++ -*-
/// \file point_light.hh
#ifndef POINT_LIGHT_HH
#define POINT_LIGHT_HH
#include "light.hh"
/// Simple point light.
class point_light : public light
{
public:
point_light (const cgmath::vector_3d& _point,
const cgmath::vector_3d& _intensity);
virtual void illuminate (const cgmath::v... |
7daba1db2d9d13250258efde01c279844a5a48ba | ca83f0ee02419ce6e210f583400132b998f24b17 | gstchain/gstio | /gst/libraries/chain/gstio_contract_abi.cpp | C++ | cpp | 6,409 | permissive | #include <gstio/chain/abi_def.hpp>
#include <fc/utility.hpp>
namespace gstio { namespace chain {
vector<type_def> common_type_defs() {
vector<type_def> types;
types.push_back( type_def{"account_name", "name"} );
types.push_back( type_def{"permission_name", "name"} );
types.push_back( type_def{"action_nam... |
146ba76eaa39eae7444001b6d3e9f0b2c2626ddf | dc2c1dd17af19710b32164b864098057bb0dd32d | rtothecore/GrandBlue | /Classes/Diver.cpp | C++ | cpp | 7,881 | no_license | #include "Diver.h"
#include "Resource.h"
#include "UtilFunc.h"
#include "Tags.h"
#include "Sound.h"
#include "Particle.h"
bool DiverLayer::init()
{
isLove = false;
lovePoint = 0;
lapCount = 1;
initWithPlist(p_Diver);
//touch
Director* director = Director::getInstance();
director->getTouchDispatcher()->addT... |
ea5d789d287c2cfa4ebbffa1e084d3eea4dfe07b | d4ef24bd301fe93f49011b41e785fff29c7d54f3 | Tyler-Bruce/School-Personal-Projects | /Assignment 4/Assignment 4.cpp | C++ | cpp | 3,496 | no_license |
#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include "Student.h"
const int MAX_GROUP_SIZE = 40; //Max group size with the 3 arrays of students
Student list1[MAX_GROUP_SIZE];
Student list2[MAX_GROUP_SIZE];
Student sorted[MAX_GROUP_SIZE];
Student create(std::strin... |
596729777d7e3474d1de54524cbb5269b695557f | 4cacb2a2cdc2541a7c6c4e9a142abca80a247c4b | demon90s/CppStudy | /codes/CppPrimer/ch03_Strings_Vectors_and_Arrays/exercise_3_43c.cpp | C++ | cpp | 753 | no_license | /*
* 练习3.43：编写3个不同版本的程序，令其均能输出ia的元素。版本1使用范围for语句管理迭代过程；版本2和版本3都使用普通的for语句，其中版本2要求用下标运算符，版本3要求用指针。此外，在所有3个版本的程序中都要直接写出数据类型，而不能使用类型别名、auto关键字或decltype关键字。
*/
#include <iostream>
using std::cout;
using std::cin;
using std::endl;
int main()
{
constexpr size_t ROW = 3;
constexpr size_t COL = 4;
int a[ROW][COL] =
{
... |
3fa2c8a0d31dd9280937abe2ef493fe0392a023b | 7aea514f358c26e6f5d70233aedb0edd71a90d46 | trustcrypto/chromium | /ui/views/mus/remote_view/remote_view_provider_unittest.cc | C++ | cc | 6,092 | permissive | // Copyright 2018 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 "ui/views/mus/remote_view/remote_view_provider.h"
#include <memory>
#include "base/bind.h"
#include "base/macros.h"
#include "base/run_loop.h"
... |
a7eb3ddd51e61ebdc40cbade64c229b6fa7ac672 | 1979c82689f91e7b2dd29ce8eb23115f7c4ed228 | wenmingxing1/leetcode_for_github | /022_GenerateParentheses.cpp | C++ | cpp | 967 | no_license | #include<iostream>
#include<vector>
#include<string>
using namespace std;
class Solution {
public:
vector<string> generateParenthesis(int n) {
string str;
vector<string> res;
generateParenthesisCore(n, n, str, res);
return res;
}
private:
void generateParenthesisCore(int l... |
6b2c8069b16dd862e532be9818f2bb1030c4e7ff | f84f4d965314e03d2cca318cc0037c9a8345399f | ferreiramarcelo/samples | /AllJoyn/Samples/OICAdapter/iotivity-1.0.0/service/resource-container/android/resource-container/src/main/jni/util/JavaClasses.cpp | C++ | cpp | 4,236 | permissive | /******************************************************************
*
* Copyright 2015 Samsung Electronics 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
*
... |
41ce87fe3efad456b029d2f541cafcc22a9f964a | 1b759f53c8dcacd802cb1ef6b46b11c59d7eb447 | adlcc075/test | /Cpp_Primer_Answers/ch12/exercise12_28.cpp | C++ | cpp | 1,253 | no_license | #include <string>
using std::string;
#include <vector>
using std::vector;
#include <memory>
using std::shared_ptr;
#include <iostream>
#include <fstream>
#include <sstream>
#include <map>
#include <set>
#include <algorithm>
int main()
{
std::ifstream file("H:/code/C++/Cpp_Primer_Answers/data/storyDataFile.txt");
... |
5fc963c06aade574e6b11f7fd70abdb23747658e | 45b4ab6cf23098b9d91233da9be4d51086085bd9 | harshitbansal373/leetcode-solutions | /findDisappearedNumbers.cpp | C++ | cpp | 446 | no_license | //Solution to Find All Numbers Disappeared in an Array.
class Solution {
public:
vector<int> findDisappearedNumbers(vector<int>& nums) {
if (nums.size()==0) return nums;
vector<int>map(nums.size()+1,0);
for (int i=0;i<nums.size();i++) {
map[nums[i]]++;
}
vector<... |
3f7bb0a984e394702695597a3e6299e81c14c7d5 | 322c5e4803d7f98298efe185edb361fe4de8c4a8 | achen889/Warlockery_Engine | /Engine/Map/Pathfinding/Pathfinder.cpp | C++ | cpp | 14,576 | permissive |
//==============================================================================================================
//Pathfinder.cpp
//by Albert Chen Sep-3-2015.
//==============================================================================================================
#include "Pathfinder.hpp"
#include "Engine/Cor... |
93cf90bb260a15e90338d05aa611a27a94b14186 | 0c3116fc6ccd57fb55a7c7fc31e8d1400c87e4aa | Wangzzzzzzzz/CS-32 | /CS32_homework2/mazestack.cpp | C++ | cpp | 1,359 | no_license | #include <stack>
#include <iostream>
using namespace std;
bool pathExists(char maze[][10], int sr, int sc, int er, int ec);
// Return true if there is a path from (sr,sc) to (er,ec)
// through the maze; return false otherwise
class Coord
{
public:
Coord(int rr, int cc) : m_r(rr), m_c(cc) {}
int r() cons... |
18c7e492b52a9c3a7d9fdbd02e7e2617a0aa3048 | beb9503eb51a8347cd1cc5f125a4fd4216735646 | PredictGroup/PredictFXCharts_QT | /ChartDirector/cppdemo/semicirclemeterreadout/semicirclemeterreadout.cpp | C++ | cpp | 3,415 | permissive | #include "chartdir.h"
void createChart(int chartIndex, const char *filename)
{
// The value to display on the meter
double value = 66;
// The background and border colors of the meters
int bgColor[] = {0x88ccff, 0xffdddd};
int borderColor[] = {0x000077, 0x880000};
// Create an AngularMeter ob... |
137d44fce63bd601809c37381978e0b891c1e8aa | 63b81d517efd9f668d0afc8b0d8b224482b9ceb1 | aliyun/aliyun-openapi-cpp-sdk | /privatelink/src/model/ListVpcEndpointServicesRequest.cc | C++ | cc | 5,128 | permissive | /*
* Copyright 2009-2017 Alibaba Cloud 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... |
e5785ed531456165db62c5875e81cc7971c0100d | e36f1b7098005b920726732bf382335bdbf9b15a | gusenov/examples-cpp | /std/collections/list/cmp-list-of-pairs/main.cc | C++ | cc | 1,189 | permissive | #include <list>
#include <utility>
#include <iostream>
#include <cstdlib>
int main(int argc, char* argv[]) {
std::list<std::string> lsStr1 { "Hello", "World" };
std::list<std::string> lsStr2 { "Hello", "World" };
std::list<std::string> lsStr3 { "World", "Hello" };
assert(lsStr1 == lsStr2); /... |
0973abeeb7ae962be4b443ecf9610c34589eff9e | 9ecb567e824116eac1fcb909e51143d33371495b | zelantus/MainNet-critical-fix | /src/zelantusd.cpp | C++ | cpp | 6,429 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2016 The Bitcoin Core developers
// Copyright (c) 2017-2019 The Zelantus Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#if defined(HAVE_CONFIG_H... |
36a2c318f4f574f18871981050541530e7050831 | 922ed69c1d6afd96b70ebfeb1e2119cb2fb48984 | tiankonguse/leetcode-solutions | /other/atcoder/abc/2/241/D.cpp | C++ | cpp | 3,464 | no_license | #include <bits/stdc++.h>
using namespace std;
#define myprintfex(format, args...) printf("line[%d]" format, __LINE__, ##args)
// #define myprintfex(format, args...)
typedef long long ll;
typedef long long LL;
typedef unsigned long long ull;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
type... |
58148f373045422f34028fc8450c7843720edf19 | 610e585ac5260d1813d29638ef8cf59cd7e9eae8 | PhilipPeake/phd2 | /cam_sbig.cpp | C++ | cpp | 18,945 | permissive | /*
* cam_sbig.cpp
* PHD Guiding
*
* Created by Craig Stark.
* Copyright (c) 2007-2010 Craig Stark.
* All rights reserved.
*
* This source code is distributed under the following "BSD" license
* Redistribution and use in source and binary forms, with or without
* modification, are permitted p... |
4e9286a40a34c09f262fe5ef4a9a57c04696c534 | 062322b6eb66233ff54da07132474771211c48cb | vwongso/ics-45c | /project3/core/WordChecker.hpp | C++ | hpp | 1,335 | no_license | // WordChecker.hpp
//
// ICS 46 Spring 2015
// Project #3: Set the Controls for the Heart of the Sun
//
// The WordChecker class can check the spelling of single words and generate
// suggestions for words that have been misspelled.
//
// You can add anything you'd like to this class, but you will not be able
// to mod... |
01b5da5c54c8c62f503b0cadb9cf375b934ed626 | 6b3fbf251bce22458f50bad7c21ee1e1088b3c90 | rodrigoms2004/ancientCStudies | /Agit/CPP/Projetos/lixo2/main.cpp | C++ | cpp | 471 | no_license | #include <iostream>
using namespace std;
class NovaMain
{
public:
NovaMain()
{
cout << "\nNovaMain\n";
string nome;
cout << "DIgite seu nome: ";
cin >> nome;
cout << "Olá " << nome;
}
};
class Qualquer
{
public:
static int MembroStat;
};
int Qualquer::MembroS... |
b48c307cb9098b636ceeca97bb03190006d0ffe4 | 831d0ff50325aaaa8a4f0183102367c2c53cef70 | JackHunt/GPLib | /lib/headers/GaussianProcess.hpp | C++ | hpp | 6,740 | permissive | /*
BSD 3-Clause License
Copyright (c) 2020, Jack Miles Hunt
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditi... |
cf6b846ab7ed092ecc5423c878ce86282db98216 | 8691181b171039567d5f3bbe213ef21efa5863ed | ildaneta/nlw-6-game-play | /node_modules/react-native/ReactCommon/fabric/components/scrollview/ScrollViewShadowNode.cpp | C++ | cpp | 1,274 | permissive | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "ScrollViewShadowNode.h"
#include <react/core/LayoutMetrics.h>
namespace facebook {
namespace react {
const char Scroll... |
a8297c18cacb12aa65c3e97c9079d131d716c9d1 | cb89e259455cbddce0d3a49bb5d582e099f5e234 | alvinmukiibi/c-plus-plus | /p4.cpp | C++ | cpp | 877 | no_license | #include <iostream>
using namespace std;
int main(){
string cars[4]; // this is the first way, must specify number of elements in the array
string bikes[3] = {"Honda", "TVS", "Bajaj"};
cout << bikes[1] << endl;
string people[2];
// for(int i = 0; i < 2; i++){
// getline(cin, people[i]);
// }
//
// cout <<... |
35b99270458a3f254c17003b2288d54bf92eb167 | bee4513c296eaf8ec8baaa9806681e3bdafa008a | MechCD/textiles | /unfolding/perception/pcl/clusteringCleanup.cpp | C++ | cpp | 8,168 | no_license | /*
* clusteringCleanup
* --------------------------------------
*
* Takes a pcd as input and divides it into several
* clusters
*
*/
#include <iostream>
#include <pcl/console/parse.h>
#include <pcl/io/pcd_io.h>
#include <pcl/io/ply_io.h>
#include <pcl/point_types.h>
#include <pcl/ModelCoefficients.h>
#include <... |
5c6eeac47faf121526c788b2f42fbbe5acbd0df6 | c1014fc6f9b0f1a55a5b1fb3711f6fd771b0d6f0 | rick-qiu/topcoder | /solution/srm488_theboringstoredivtwo.cpp | C++ | cpp | 55,848 | no_license | /*******************************************************************************
* Automatically generated code for TopCode SRM Problem
* Problem URL: http://community.topcoder.com/stat?c=problem_statement&pm=11197
*******************************************************************************/
#include <vector>
... |
d8c8f2bfbeacf9e3a03c6d38cd9d07359e85f1ae | 829c3524593c3702c42bd8315d05df24dfd44b58 | Naftoreiclag/VS8C | /src/client/EmptyConcreteLayer.cpp | C++ | cpp | 1,786 | permissive | /*
Copyright 2015 James Fong
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 writ... |
eeb5cf2389e331dc2cf0cb931a773d54dfdbc7f1 | c78aa1982c570ab6955ad0ffbdc4130b9b217129 | olivdt/XIOS | /src/checkpoints.cpp | C++ | cpp | 2,934 | permissive | // 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 <boost/assign/list_of.hpp> // for 'map_list_of()'
#include <boost/foreach.hpp>
#include "checkpoints.h"
#include "t... |
116673ada6e9610fa17778180cbb5b6f842fb0cd | cbb8bbb5f533f48492589cfa063bdaecb863a406 | avmal0-Cor/xr2-dsgn | /xr2-dsgn/sources/xray/editor/world/sources/object_light.cpp | C++ | cpp | 6,364 | no_license | ////////////////////////////////////////////////////////////////////////////
// Created : 17.03.2009
// Author :
// Copyright (C) GSC Game World - 2009
////////////////////////////////////////////////////////////////////////////
#include "pch.h"
#include "object_light.h"
#include "tool_light.h"
#include <xray/edito... |
376c3e5cdd21a46fbe5539e20e94983ff70756f3 | 1d3e6c1e54fb2d8dfd1d179d09f59ca6b5473655 | Quanteek/nt2 | /modules/standard/include/nt2/toolbox/standard/functions/scalar/pow.hpp | C++ | hpp | 2,056 | permissive | //==============================================================================
// Copyright 2003 - 2011 LASMEA UMR 6602 CNRS/Univ. Clermont II
// Copyright 2009 - 2011 LRI UMR 8623 CNRS/Univ Paris Sud XI
// ... |
58025aa5b77b6719d065d36d646c803d96797ecc | 3e742202865ab5a4b717dcf143411af12417eb05 | appop/bitcoin | /src/wallet/rpcwallet.cpp | C++ | cpp | 146,577 | permissive | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2016 The nealcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "amount.h"
#include "base58.h"
#include "chain.h"
#include "consensus/valida... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.