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 |
|---|---|---|---|---|---|---|---|---|
6dd647b8a7dfc909ab7c826e98033e128e59193e | dc11421d4dbc55ec88f114d8033cd1d905953f11 | IvanAlekseevich28/DES | /main.cpp | C++ | cpp | 2,534 | no_license | #include <iostream>
#include <algorithm>
#include "des.h"
using namespace std;
int get_mode(const string& str_mode);
void print_mode_error(const string& str_mode);
void print_init_vec_error(const string& str_init_vec);
void print_argc_error();
int main(int argc, char* argv[])
{
string key;
string str;
/... |
dec9454dde159215977d3af8fa7bb88738b03cd0 | 64cfbd681a35ad0409644f34c0d7794a04ee8375 | aranhid/iot_photoresistor | /main.cpp | C++ | cpp | 2,502 | no_license | #include "mbed.h"
#include <cstdio>
#include <cstring>
using namespace std::chrono;
#define BOARD_ID 228
#define PERIOD 240
// Serial
#define TX PA_9
#define RX PA_10
#define BAUDRATE 115200
// LED
#define LED2PIN PB_4
// PHOTORESISTOR
#define PHOTOPIN PA_6
// Display
#define RS PB_11
#define E PB_10
#define D4 P... |
319b87f1010070d24fa2954abb7d2b6e99c0f69a | a2fd1fb5ec9cc3925a02b3dda2c7a0f8efc51f88 | biglone/LT-PureCodes | /inst/bean/InterphoneMessageExt.cpp | C++ | cpp | 613 | no_license | #include "InterphoneMessageExt.h"
namespace bean
{
QVariantMap InterphoneMessageExt::toJson(const QVariantMap & /*data*/)
{
QVariantMap vmap;
vmap["type"] = "interphone";
return vmap;
}
QDomElement InterphoneMessageExt::toXml(const QVariantMap & /*data*/, QDomDocument &doc)
{
QDomElement elem = doc.creat... |
f5fea5710bc4b9f77ff8fe2cf38689034bda5716 | f8be0fbd5c6b11bc478094bf70977289c5803971 | kyx0r/FA_Patcher | /boost_lib/boost/thread/lock_factories.hpp | C++ | hpp | 2,259 | permissive | // 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)
// (C) Copyright 2012 Vicente J. Botet Escriba
#ifndef BOOST_THREAD_LOCK_FACTORIES_HPP
#define BOOST_THREAD_LOCK_FACTORIES_HPP
#include <boost/thread/lock_types.h... |
e7aca7482dfe7e3f0aaf84869f94b5e0f123ce80 | 90d5825132b5e6d3b7c35f76ce0efe1750e1416e | V8coin/V8coin | /src/qt/bitcoinunits.cpp | C++ | cpp | 4,270 | permissive | #include "bitcoinunits.h"
#include <QStringList>
BitcoinUnits::BitcoinUnits(QObject *parent):
QAbstractListModel(parent),
unitlist(availableUnits())
{
}
QList<BitcoinUnits::Unit> BitcoinUnits::availableUnits()
{
QList<BitcoinUnits::Unit> unitlist;
unitlist.append(BTC);
unitlist.append(mBT... |
15af60c401284382cae0466e0a1bb7476af7cfa7 | 937e0eedcf65a7d7d03bbd7c70fafd0a52371e7f | ChunguscoinCrypto/chungus-cpuminer | /miner/libstratum/ZcashStratum.cpp | C++ | cpp | 28,470 | permissive | // Copyright (c) 2016 Jack Grigg <jack@z.cash>
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "../version.h"
#include "ZcashStratum.h"
#include "../utilstrencodings.h"
#include "../trompequihash/equi_miner.h"
#include... |
294c16bc183741546588e58652997e46d624dd34 | 3b18db42b878f120bece5d5b34bc7f519f444ea8 | valeriyr/Hedgehog | /plugins/core/landscape_model/sources/landscape_model/victory_checker/lm_endless_checker.cpp | C++ | cpp | 1,474 | no_license |
#include "landscape_model/sources/ph/lm_ph.hpp"
#include "landscape_model/sources/landscape_model/victory_checker/lm_endless_checker.hpp"
#include "landscape_model/ih/lm_imodel_locker.hpp"
/*---------------------------------------------------------------------------*/
namespace Plugins {
namespace Core {
namespace... |
fc952bac1a13024b96ea8099bf31edae92e36a46 | 05e1eab069a3316dfffebbad8ad5c3e9902d2c4b | nnaabbcc/exercise | /windows/pw6e.official/CPlusPlus/Chapter13/CenteredTransforms/CenteredTransforms/MainPage.xaml.cpp | C++ | cpp | 1,598 | permissive | //
// MainPage.xaml.cpp
// Implementation of the MainPage class.
//
#include "pch.h"
#include "MainPage.xaml.h"
using namespace CenteredTransforms;
using namespace Platform;
using namespace Windows::Foundation;
using namespace Windows::Foundation::Collections;
using namespace Windows::UI::Xaml;
using n... |
c7606b82b7ef6be9a3551a0ed32f4d393e4b0e2b | a3bdc253b20b6ca50fa1232f442003e1fc6655de | juhnowski/fp_function_pointer | /fp_func_pointer/main.cpp | C++ | cpp | 488 | no_license | #include <iostream>
int ask() {return 42;}
typedef decltype(ask)* function_ptr;
class convertible_to_function_ptr {
public:
operator function_ptr() const {
return ask;
}
};
int main(int argc, const char * argv[]) {
auto ask_ptr = &ask;
std::cout << ask_ptr() << std::endl;
auto& ask_... |
daf3edb3e85867bc36527f31cbd26e091f593344 | 4ecba631d5acf6f101362461327f95995ba61210 | sumiokajiwara2017/skyencppgamelib | /SkyGraphicLibTest/Collision/CollisionTest.cpp | C++ | cpp | 4,006 | no_license | #include "StdAfx.h"
#include "../GoogleTestInclude.h"
#include "../SkyLibInclude.h"
#ifdef TEST_COLLISION
#if ON_
using namespace sky::lib;
//Window初期位置、サイズ
static const u32 _WIN_X = 0;
static const u32 _WIN_Y = 0;
static const u32 _WIN_W = 640*2;
static const u32 _WIN_H = 480*2;
//１秒あたりのフレーム数
static const u32... |
b6f84ee3b35336173c9a18b1d1c943b8230f1279 | 4c8366f0fa8e41cb0a644bdb8fe0a5a3bd8d9db1 | Eeplord/Lab6 | /Main.cpp | C++ | cpp | 5,382 | no_license | // CIS22B
// LAB6
// Cameron March
// Main.cpp
#include <iostream>
#include <fstream>
#include <string>
#include <stdlib.h>
// Node for linked list
struct node {
// Node's name
std::string name;
// Amount customer owes
double amount;
// Next node in the list
node* next;
};
// Custom linked list
class Linked... |
991fdcb74ce0a94a8f8aa88ad9ff070fab660e28 | 372fc6c6f6077ed925f80807c879d2c324388cb2 | 1UP-Coin/1UP | /src/rpcwallet.cpp | C++ | cpp | 109,283 | permissive | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The 1up developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.... |
56b44cfc635bbcbe8cdd4afd26f8b3b07a4e917e | de45b62a24d07e84b40fd0d5a6fd6db541786752 | dzcoin/DzCoinService | /src/ripple/app/ledger/InboundLedger.cpp | C++ | cpp | 36,038 | permissive | //------------------------------------------------------------------------------
/*
this file is part of rippled: https://github.com/ripple/rippled
copyright (c) 2012, 2013 ripple labs inc.
permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby... |
3487383f21088d3f6d0f9c7fde58888fba326ad5 | 76f4ee816297cbbe3f1a8daefd85c84801d412ec | johnnyeven/sanguo-cocos2dx | /code/Classes/characters/Role.cpp | C++ | cpp | 3,936 | no_license | #include "Role.h"
#include "../BattleScene.h"
#include "../skills/Skill.h"
#include "RoleData.h"
Role::Role(int id):
_id(id)
{
_team = 0;
_action = RoleAction::UNDEFINED;
_isFocused = false;
_isBackWalk = false;
_scene = BattleScene::getInstance();
_skillIndex = std::map<std::string, Skill*>();
}
Role::~Role... |
5e1cf04aa5b025241070ea43fdac4d513fdbfd50 | 46a86e66d5361f1e4dfa9deaa4f4c36ae741fcef | 1121518wo/leetcode_test | /Leetcode/CCplusplus/cplusplus/cplusplus/set.cpp | C++ | cpp | 2,083 | no_license | #include<iostream>
#include<string>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<set> //元素有序 指定排序规则 mulset支持多个key
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<algorithm>
#include<stack>
#if 0
using namespace std;
//不能通过迭代器修改其值，要改变，先删除然后在插入
void printSet(set<int>... |
b980ec9803d98632a005ca6e5303b1aba19154ec | 3f903e367e0aa1f73c4295361d7c7a37e1266547 | yongyucode/imx6-dual-core-frameworks | /base/media/tests/players/invoke_mock_media_player.cpp | C++ | cpp | 3,906 | permissive | /*
* Copyright (C) 2009 The Android Open Source Project
*
* 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 app... |
54c9d2367f9ec90e7343ac03398439a410d240a6 | 6886351dd2dd87d2265631863537862729313624 | real4suraj/Codeforces | /June24/q.cpp | C++ | cpp | 1,984 | no_license | //+LNCT++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++//
//+------------------Lord Escanor : Sin Of Pride----------------------+//
//++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++BHOPAL+//
#include <bits/stdc++.h>
#define fo(i, n) for (int i = 0; i < int(n); i++)
#define of(i, n) for ... |
407da29f9636e6252dc677cc56cac366141f9e7c | 6229fd6bbc0c755ea2f5bfdffa615c3c170a83ee | chenhao-ye/uFS | /cfs/lib/config4cpp/src/SchemaType.cpp | C++ | cpp | 3,696 | permissive | //-----------------------------------------------------------------------
// Copyright 2011 Ciaran McHale.
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including... |
f13620c786780e3c245ff7263091a7716e8b4f42 | a611cd772363d79c6b9e174b0c073076e03c0e17 | juancsosap/cpptraining | /CppTraining/C03_Operators/E05_Logical.cpp | C++ | cpp | 1,300 | no_license | #include <cstdlib>
#include <iostream>
using namespace std;
class App0305 {
public:
static void run() {
cout << " Logical Operations " << endl;
cout << "-------------------------" << endl;
cout << endl << " OR Operator ";
cout << endl << "---------------------";
... |
155f4a7cf68372d8ce33cb4d9af63ef5233791d8 | 7fc7ab8e53a9c392353d427ebfffaea3fb80d62f | michaelcp/openrasp | /agent/php7/hook/openrasp_fileupload.cc | C++ | cc | 3,768 | permissive | /*
* Copyright 2017-2019 Baidu Inc.
*
* 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... |
1c77be9a3b4fad59a6c174e2fb4015d1611f53c1 | 680bb9e131f73bc2d7519b259b2b2156b9e3ead3 | Hengle/BlazingSails_SDK | /SDK/BZ_BP_IconBase_classes.hpp | C++ | hpp | 4,672 | no_license | #pragma once
// BlazingSails (Dumped by Hinnie) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// BlueprintGenerate... |
7ca2fa0c8cfc7ba6f3aeca5d7bb44ae891ec2a73 | bbaaa37fda6d78ddbb5912af52cf336057dd5835 | waynezu/vpal20 | /src/ripple/types/impl/UintTypes.cpp | C++ | cpp | 4,801 | permissive | //------------------------------------------------------------------------------
/*
Portions of this file are from Vpallab: https://github.com/vpallabs
Copyright (c) 2013 - 2014 - Vpallab.com.
Please visit http://www.vpallab.com/
This file is part of rippled: https://github.com/ripple/rippled
C... |
1ee0571085bd423ec7d4ffa131e8a8c9bbaec7ef | 2174ae5f102cc98bcd7c8a80ef670869eae2b727 | Rayen227/C-classworks | /作业2/04.cpp | C++ | cpp | 659 | no_license | #include <iostream>
#include <cmath>
using namespace std;
class Point {
private:
float x, y;
public:
Point() { x = 0; y = 0; }
Point(float xx, float yy) { x = xx; y = yy; }
float getX() { return x; };
float getY() { return y; };
float calculate_distance(Point& p1);
};
float Point::calculate_distance(Point& p1... |
dc48a33f74eef2f064cd2d76613570cb6004be0d | 0aea2c50bf32b1a6da0d0f7a85da156a24ff3915 | nagoya313/th06_psp | /th06_psp/graphic.cc | C++ | cc | 2,176 | no_license | #include "graphic.hpp"
#include <pspdisplay.h>
#include <pspgu.h>
#include <pspiofilemgr.h>
#include <intraFont.h>
//#include <boost/lexical_cast.hpp>
#include "vertex.hpp"
namespace {
unsigned int __attribute__((aligned(16))) display_list[262144];
const int kBufferWidth = 512;
const int kScrWidth = 480;
const int kSc... |
3c175cc469bb30c3884a371482f41a79c55b47ed | b4000d39ebcab473b831122011dd8cfc28be218a | UIKit0/hdlConvertor | /src/vhdlConvertor/designFileParser.cpp | C++ | cpp | 3,373 | no_license | #include "designFileParser.h"
DesignFileParser::DesignFileParser(bool _hierarchyOnly) {
hierarchyOnly = _hierarchyOnly;
context = new Context();
}
Context * DesignFileParser::getContext() {
return context;
}
void DesignFileParser::visitDesign_file(
Ref<vhdlParser::Design_fileContext> ctx) {
if (!ctx)
return;
... |
c0c0eafbedbb728c9f5a4e211a1273349f8da485 | 6b6ebf775cc47eedfa0f393c03340ce74f8bfe86 | IAmAnubhavSaini/cryptoAlgorithm-nt5src | /Source/XPSP1/NT/shell/ext/neptune/aidanl/davtrans/asyncwnt/clsids.cpp | C++ | cpp | 803 | no_license | // Define GUIDs of ASYNCWNT interface, component
#include <objbase.h>
extern "C"
{
// {615D5814-21C8-4e16-9289-C9A9C5ADB4CF}
extern const IID IID_IAsyncWnt =
{ 0x615d5814, 0x21c8, 0x4e16, { 0x92, 0x89, 0xc9, 0xa9, 0xc5, 0xad, 0xb4, 0xcf } };
// {23BDCB35-B4EE-45a6-86E0-0889348F28C2}
extern const... |
9f94af4e44e5be4cb594a4c1a270c61ef3279b83 | 9e23efda1e7f87ef043407e9074c98b23674443a | joaofcmb/CALStrings | /CALStrings/src/CALGraphProject.cpp | C++ | cpp | 11,056 | no_license | #include <iostream>
#include <random>
#include <stdlib.h>
#include <fstream>
#include <chrono>
#include <Windows.h>
#include <vector>
#include <set>
#include "GraphViewer\GraphViewer.h"
#include "CALGraphProject.h"
#include "Graph.h"
#include "Route.h"
using namespace std;
/*
* 3 Steps of Program
*
* 1 - Construct... |
ae640d72d80eaaef6eac7486876038cb0905be2d | f587a3ee0143126fc7a70660b14416f97c944633 | yigao1983/DavidsonDiag | /include/matrix.hpp | C++ | hpp | 1,432 | no_license | #ifndef MATRIX_HPP
#define MATRIX_HPP
#include <iostream>
#include "precision.hpp"
#include "vector.hpp"
template<typename T>
class Matrix {
public:
Matrix(): nrow(0), ncol(0), vec() {}
Matrix(size_t nr, size_t nc, T value = T()):
nrow(nr), ncol(nc), vec(nr*nc, value)
{}
virtual ~Matrix() {}
... |
78eb80556b7629cb676b4b37580fe328f96bcabd | eabceefaf08420fd3616725a45e661a4fb2380f5 | coinspect/zcash | /src/test/test_bitcoin.cpp | C++ | cpp | 2,752 | permissive | // Copyright (c) 2011-2013 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#define BOOST_TEST_MODULE Bitcoin Test Suite
#include "test_bitcoin.h"
#include "crypto/common.h"
#include "key.h"
#includ... |
783bd8692da733690a01b1093e636a88f62716ad | b7cb1825e78168f30447a7bb76d0f76bbf7fcac6 | muzaheed57/ActionRPGGame | /Source/ActionRPGGame/Abilities/ARAbilityComponent.cpp | C++ | cpp | 2,624 | permissive | // Copyright 1998-2014 Epic Games, Inc. All Rights Reserved.
#include "ActionRPGGame.h"
#include "../Types/AREnumTypes.h"
#include "../ARPlayerController.h"
#include "../Abilities/ARAbility.h"
#include "Net/UnrealNetwork.h"
#include "ARAbilityComponent.h"
UARAbilityComponent::UARAbilityComponent(const class FPostC... |
b05b02495577b222b8a281871fc7435229d679d6 | 15d22ab449dd0e9dd2edf0289862a655584e647b | whisperity/llvm-project | /llvm/examples/Kaleidoscope/Chapter9/toy.cpp | C++ | cpp | 41,588 | permissive | #include "llvm/ADT/STLExtras.h"
#include "llvm/Analysis/BasicAliasAnalysis.h"
#include "llvm/Analysis/Passes.h"
#include "llvm/IR/DIBuilder.h"
#include "llvm/IR/IRBuilder.h"
#include "llvm/IR/LLVMContext.h"
#include "llvm/IR/LegacyPassManager.h"
#include "llvm/IR/Module.h"
#include "llvm/IR/Verifier.h"
#include "llvm/S... |
b295e7d471a574333ba99535a78400fda2bc3bcb | 2f3f0315ce8356f7b4f2eeff5ce216806bdb76d0 | gavinband/qctool | /genfile/include/genfile/ToGP.hpp | C++ | hpp | 14,581 | permissive |
// Copyright Gavin Band 2008 - 2012.
// 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 <utility>
#include <map>
#include <iostream>
#include <boost/noncopyable.hpp>
#include <boost/p... |
560ecb623c5520b8f12fcdd3ae1ad4e70b5f7152 | d4c5250980f4cff09f33547fec22994b1c1fa195 | andymunozz/SuperChat | /chat/chat_client.cpp | C++ | cpp | 3,617 | no_license | //
// chat_client.cpp
// ~~~~~~~~~~~~~~~
//
// 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)
//
//I GOT IT!!
#include <cstdlib>
#... |
0eaef7758dd4571c1792127c4298fdb4956817f6 | 9e5d18247cad0ecb93748b36961e8294e4d085c4 | krwinC/C- | /（十三）调整数组顺序使奇数位于偶数前面.cpp | C++ | cpp | 737 | no_license | #include <iostream>
#include <vector>
#include <deque>
using namespace std;
void reOrderArray(vector<int>& array)
{
deque<int> result;
int num = array.size();
for (int i = 0; i < num; ++i)
{
if (array[i] % 2 == 0)
{
result.push_back(array[i]);
}
if (array[num... |
d7248d26316e59b357d552baec9d74a3054363a9 | 74e872cfbc22de3bff657ae7fa99e7baeefa137a | ARM-software/armnn | /src/armnn/NetworkUtils.hpp | C++ | hpp | 735 | permissive | //
// Copyright © 2022 Arm Ltd and Contributors. All rights reserved.
// SPDX-License-Identifier: MIT
//
#pragma once
#include "DeviceSpec.hpp"
#include "Graph.hpp"
namespace armnn
{
std::vector<ConvertFp16ToFp32Layer*> InsertConvertFp16ToFp32LayersBefore(Graph& graph,
... |
22f42b3de3c6bed50e226682f6e07d5c263c2439 | d89b4e140d8ed4fb7c129bb42e7b4b704647ebe8 | sswroom/SClass | /src/SSWR/AVIRead/AVIRImageForm.cpp | C++ | cpp | 24,458 | no_license | #include "Stdafx.h"
#include "Data/ByteTool.h"
#include "Math/Math.h"
#include "Media/ICCProfile.h"
#include "Media/CS/TransferFunc.h"
#include "SSWR/AVIRead/AVIRFileRenameForm.h"
#include "SSWR/AVIRead/AVIRICCInfoForm.h"
#include "SSWR/AVIRead/AVIRImageColorForm.h"
#include "SSWR/AVIRead/AVIRImageForm.h"
#inc... |
d060e622504465dd9e06e818e40a80b770388204 | ec9e8ee79afb33cda6a0dc7f78c97098dd822cf6 | AngularsCoding/Colored-TicTacToe-Game | /TicTacToe Colored.cpp | C++ | cpp | 3,840 | permissive | #include <iostream>
#include <conio.h>
#include <cwchar>
#include <windows.h>
using namespace std;
void setConsoleSize(int f_size){
CONSOLE_FONT_INFOEX cfi;
cfi.cbSize = sizeof(cfi);
cfi.nFont = 0;
cfi.dwFontSize.X = 0;
cfi.dwFontSize.Y = f_size;
cfi.FontFamily = FF_DONTCARE;
cfi.FontWeight = FW_... |
c80be754eb4529e5a20acfc98b468752e1e0529e | 7b7ccd09cae80973c197ba568a00431b51a380cd | adesh022603/Cpp-ds | /FriendFun/FriendExample.cpp | C++ | cpp | 491 | no_license | #include <iostream>
using namespace std;
// Encapsulation
class Car
{
private:
int cc_power;
public:
Car(){
this->cc_power = 1034;
}
friend void printCarPower(Car c2);
int getCCPower(){
return this->cc_power;
}
void setCCPower(int val)
{
if(val > 1... |
f2842f9d66061d78fd874a205c30ab4ea01d9f8c | a7c5b8179d59948b34994962356e81a833625fa7 | kazunetakahashi/atcoder | /2017/1106_ABC063/D.cpp | C++ | cpp | 1,417 | permissive | #include <iostream>
#include <iomanip> // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <complex>
#include <tuple> // get<n>(xxx)
#include <queue>
#include <stack>
#include <... |
b247bdff89334ce2a78db096e042b2805545057c | d0401da462c030ae38bbaed11c016ed6f5d9ae17 | Tarun-Sharma9168/CodeChefProblems | /ChopSticks.cpp | C++ | cpp | 848 | no_license | #include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ll n,d;
int t;
cin>>n>>d;
ll arr[n];
... |
d1556a0c8314496b824741773402ba30da3d377d | 7dc9521ec000f52611c7d1fcb856f97a744f293c | JellyDream/tensorflow-sphereface | /marginInnerProduct/caffe/common.cpp | C++ | cpp | 1,866 | no_license | #include <boost/thread.hpp>
#include <glog/logging.h>
#include <cmath>
#include <cstdio>
#include <ctime>
#include "caffe/common.hpp"
//#include "caffe/util/rng.hpp"
namespace caffe {
// Make sure each thread can have different values.
static boost::thread_specific_ptr<Caffe> thread_instance_;
Caffe& Caffe::Get() {... |
c8872a0063be99643df3405ab0b9e8991f34d36a | f87c7d7ed832f5c868b41acf0ab7699cefde2e90 | mtdecarvalho/POO-21.01 | /URI/uri2147.cpp | C++ | cpp | 338 | no_license | #include <iostream>
#include <iomanip>
using namespace std;
int main ()
{
int C;
string input;
double tempo;
cin >> C;
while ( C > 0 )
{
cin >> input;
tempo = input.length(); tempo /= 100;
cout << setprecision(2) << fixed;
cout << tempo << endl;
C--;
... |
06b24e4a80e1a7411b8f212e050df35f45c20f3a | 2144ca1c02b994fb3e753a5ea50ec69186f34ccf | 15831944/TRiAS | /TRiAS/TRiAS/GeometrieVerarbeitung/Maschenbildung/IMASCHEN.CPP | C++ | cpp | 7,293 | no_license | /*
Datei: IMASCHEN.CPP
Stellt ein Interface für die Funktionen
- Linenvereinigung und
- Maschenbildung
zu Verfügung.
Erarbeitet: J. Benkenstein Stand vom 10.4.1997
*/
#include "pheader.h" // vorübersetzter Header
#include "resource.h" // Resource-Konstanten
// STL-Header
#include <ospace/std... |
8232297544835465e60aec19370ad54ed0f5fbd0 | 7c72d6d306aecfe4553186b924ffb527a627d937 | iSazonov/runtime | /src/coreclr/debug/di/rsappdomain.cpp | C++ | cpp | 31,133 | permissive | // Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
//*****************************************************************************
// File: RsAppDomain.cpp
//
//
//*********************************************************************... |
d7f4b0ad5250d57b76925632ddc551d99f25a30a | 1541123a84c01b4eb18183d102b5ac8ccbf05f59 | was564/solve_problem | /백준/14954.cpp | C++ | cpp | 478 | no_license | #include <stdio.h>
#include <cmath>
int sum(int n) {
int sum = 0, i = 0, t;
while (n >= pow(10, i)) {
t = pow(10, i);
sum += pow(((n / t) % 10), 2);
i++;
}
return sum;
}
int main() {
int n, num, c = 0;
bool flag = true;
n = pow(5, 2);
scanf("%d", &n);
num = n;
while (flag) {
num = sum(num);
if (nu... |
7be8586bddf9258aa1f024091ac40066e0850b52 | e1c4181fe62ce5972c84c2703cd8885b0a3bc3ed | MeinLeben/avp_gold_source_116_1_wits | /source/AvP_vc/3dc/avp/support/refobj.cpp | C++ | cpp | 7,714 | no_license | /*******************************************************************
*
* DESCRIPTION: refobj.cpp
*
* AUTHOR: David Malcolm
*
* HISTORY: Created 15/9/97
*
*******************************************************************/
/* Includes ********************************************************/
#includ... |
7511eaddde30357ab51dc8a66656bc91c5d58821 | 5b827fd966566d7f951c38a87464250e136bdc3c | pthiben/Helium | /Editor/TypesPanel.cpp | C++ | cpp | 7,231 | no_license | #include "Precompile.h"
#include "TypesPanel.h"
#include "EditorIDs.h"
using namespace Helium;
using namespace Helium::Core;
using namespace Helium::Editor;
TypesPanel::TypesPanel( SceneManager* manager, wxWindow *parent, wxWindowID id, const wxPoint &pos, const wxSize &size, long style )
: TypesPanelGenerated( par... |
d0031bf8750f7ee0d5cbd192810e06f13d38e314 | df9bd655c6f5a6835b535e5e4dcc5fb41582c11f | TshSophie/SomeAlgorithm | /04Tree/07_交换左右子树/main.cpp | C++ | cpp | 815 | no_license | #include<iostream>
#include"BinaryTree.h";
using namespace std;
/**************************************************************
二叉树的翻转：
- 给定一棵二叉树将其左右翻转
解决方案：
- 对二叉树的节点，交换其左右孩子指针，递归遍历节点
***************************************************************/
int main()
{
int pre[] = { 27, 81, 5, 47, 92, 23, 21, 45... |
f8a2f4ebd998ddb5e8e475fc80a1311bb7315883 | f96dda18e1fa40239be8aa9cabdd0ee9f5c1ceaa | rmsgh1202/CImage | /소스.cpp | C++ | cpp | 541 | no_license | #include<afxwin.h>
class CMainFrame : public CFrameWnd {
public:
CMainFrame() {
Create(NULL, L"Hi !");
}
DECLARE_MESSAGE_MAP()
afx_msg void OnPaint();
};
class CMy1App : public CWinApp {
BOOL InitInstance() {
CMainFrame* Frm = new CMainFrame();
m_pMainWnd = Frm;
Frm->ShowWindow(1);
return TRUE;
}
};
CM... |
a6dd8b555a4eb21a8a05bed46be630b9cf5a76ae | 04f7bb6b09daa511db5f99a5551ff5fdfb5466c8 | silentorb/imp_cpp | /projects/parse/cpp_scanning/source/cpp_scanning/Header_Parser.cpp | C++ | cpp | 9,811 | permissive | #include <underworld/schema/Dungeon_Variant.h>
#include "Header_Parser.h"
#include <underworld/schema/Function.h>
using namespace runic;
using namespace underworld;
namespace cpp_scanning {
underworld::Dungeon &Header_Parser::create_dungeon(const std::string &name, Context &context) {
auto ¤t_dungeon = c... |
b7c29ec48a9dd2add69e8aeeca186e9dafc60680 | 2c33b5e9a0192384b8d32d2d52bd1a5834467495 | townboy/acm-algorithm | /HDOJcode/4611 2013-07-27 01 07 11.cpp | C++ | cpp | 971 | no_license | ******************************
Author : townboy
Submit time : 2013-07-27 01:07:11
Judge Status : Accepted
HDOJ Runid : 8727853
Problem id : 4611
Exe.time : 62MS
Exe.memory : 336K
https://github.com/townboy
******************************
#include<stdio.h>
#include<iostream>
#include<m... |
5391972ab63df2eb3fc035bd3c5aea868afa0739 | 42f2c8baeb235a5539a79dde1b1ca4479b8bdb98 | miguelAlessandro/CompetitiveProgramming | /UVA/260_il_gioco_dell'x.cpp | C++ | cpp | 3,957 | no_license | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <vector>
#include <list>
#include <map>
#include <complex>
#include <utility>
#include <iterator>
#include <sstream>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <queue>
#include <stack>
#include <... |
0ad8387d1b1c93b9b0c17cc500ae25d0be652f05 | f7b5c6d2b5e00705f5f74186b3ec0d7877ae00d6 | aliyun/aliyun-openapi-cpp-sdk | /mts/src/model/QueryTemplateListResult.cc | C++ | cc | 7,825 | 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... |
934a3848a4dee3db0c2d7f3323b2ba7f6bdf538f | cb170fe69b7cc8b8aa953090f3cb88d6d47c9fe5 | LYH66/omniscidb | /Utils/DdlUtils.cpp | C++ | cpp | 32,455 | permissive | /*
* Copyright 2020 OmniSci, Inc.
*
* 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 t... |
0a55b264177a0a6375956686249f80a8917e1075 | 8ffe2b0aa18ca019fa5dfd76667f6b1ee5c50dbe | OscarShen/orion | /src/light/spot.cpp | C++ | cpp | 2,190 | no_license | #include "spot.h"
#include <sampler/sampling.h>
#include <util/param.h>
#include <util/strutil.h>
ORION_NAMESPACE_BEGIN
Spectrum SpotLight::power() const
{
return I * 2 * pi * (1 - .5f * (cosFalloffStart + cosTotalWidth));
}
Float SpotLight::falloff(const Vector3f & w) const
{
Vector3f wl = normalize(world2local(w));... |
f7d8d713f5ec841fecae4c4617fa708629b9c398 | e4d067294d4faca03b328405dd488ab47cee6ea4 | Mohamad-Aboda/Solving-atcodder-problems | /Known_Algorithms/sub_arr_sequence.cpp | C++ | cpp | 912 | no_license | #include <bits/stdc++.h>
using namespace std;
void gen_subsequence(vector<int>arr, int n){
int size = pow(2, n);
for(int i = 0;i < size; ++i){
for(int j = 0; j < n ;++j){
if(i & 1 << j){
cout << arr[j];
}
}
cout << endl;
}
}
void gen_subarr(vector<int>arr){
int n = arr.size();
for(int i = 0; i < n... |
a0bfe57080fdfd5fbe8d50810782d900da0acc77 | bab6513252dc051a026997d9d7357ee9aab59a6c | NikitaLandge51/codig-ninja-dsa-learning | /02-data-structure-algorithms/modules/017-dynamic-programming/code-part-2/008-Ways-To-Make-Coin-Change.cpp | C++ | cpp | 4,188 | no_license | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<climits>
#include<vector>
#include<stack>
#include<queue>
#include<unordered_map>
#include<unordered_set>
#include<map>
#include<set>
#include<list>
using namespace std;
/**
* Ways To Make Coin Change
* - For the given infinite su... |
2cf40fca7a558f5e9a2018ef4ded684c3aeecc7c | 6a2a1dbd727c850b298c1da07368ba957ff89a1c | rokyan/cpputil | /test/functional/not_fn_types.hpp | C++ | hpp | 1,867 | no_license | #pragma once
namespace test
{
template<typename Derived>
struct base_negator
{
Derived operator!() const;
};
template<typename Derived>
struct base_negator_noexcept
{
Derived operator!() const noexcept;
};
#define DEFINE_RET_TYPE_STRUCT(NAME, BASE) \
struct NAME : \
BASE<NAME> {};
DEFINE_RET_TYPE_STRUC... |
dc06e4e01a66a9ad0fcba9d12347a21ac4250c28 | 1a614e551afc48107cdc927fcbc5f9e1424603cb | Redrock912/reboot | /Projects/Midterm_FastestMatrixMulti/Midterm_FastestMatrixMulti/20111414_유홍석_1번.cpp | C++ | cpp | 4,791 | no_license | #include <iostream>
#include <cmath>
using namespace std;
class Matp
{
public:
int row;
int column;
int **k;
Matp()
{
}
Matp(int a, int b)
{
this->row = a;
this->column = b;
k = new int*[row];
for (int i = 0; i < row; i++)
{
k[i] = new int[column];
}
}
int get(int row, int column){
return ... |
b9e34e6034c9c171d8f97144ccf949a1299ec7c7 | ee12beb18baa62c3a8c2238a14aa3f30db63f46d | MorningSun-GitBoy/zoolib_cxx | /Project/zoolib/Expr/Visitor_Expr_Bool_Do_Eval.cpp | C++ | cpp | 2,189 | permissive | /* -------------------------------------------------------------------------------------------------
Copyright (c) 2010 Andrew Green
http://www.zoolib.org
Permission is hereby granted, free of charge, to any person obtaining a copy of this software
and associated documentation files (the "Software"), to deal in the So... |
a3cfe8617d264cebd8d6212f10b654c3cabcbf8d | b073ab2d76a14b50ab3263daf942e1ee1acafff4 | Lucas-Czerny/Thunder | /Thunderbird/src/Panels/SceneHierarchyPanel.cpp | C++ | cpp | 1,766 | permissive | #include "td_pch.h"
#include "SceneHierarchyPanel.h"
#include <glm/glm.hpp>
#include <glm/gtc/type_ptr.hpp>
#include <glm/gtx/matrix_decompose.hpp>
#include <imgui.h>
#include "Thunder/Core/MouseButtonCodes.h"
#include "Thunder/Scene/Components.h"
namespace Thunder
{
void SceneHierarchyPanel::SetActiveScene(const... |
a7c6cb405801549dfc9753ce095838d6fd561955 | df272e068cec83971d99b01703ee8d59bcf81a27 | aes3plex/nancy | /Layers/Con2d/Con2d.cpp | C++ | cpp | 1,995 | no_license | #include <iostream>
#include "Con2d.h"
#include "../../Array/Array.h"
#include "../../Activations/Activations.h"
Con2d::Con2d(c_int padding, Array* kernels, c_int kernelsNumber, Array biases) {
// todo: check biases dimension
if (biases.getSize() != kernelsNumber) {
std::cout << "Incorrect biases dime... |
43da880d4101303e59c5a1abee543c2b74f99a86 | 932460a40c1500c027a16a7402eeeca36ee76c9a | Knowish/Xbox-ATG-Samples | /Kits/DirectXTK12/Src/Mouse.cpp | C++ | cpp | 29,819 | permissive | //--------------------------------------------------------------------------------------
// File: Mouse.cpp
//
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
//
// http://go.microsoft.com/fwlink/?LinkId=248929
// http://go.microsoft.com/fwlink/?LinkID=615561
//---------... |
a77c3c9dc0fe0b5ab2dc88bfe262504b48f5403e | 2eede8fd05b7a0643ccb7682eaeb226d523927ba | SantanuGarai/Leetcode | /Binary Tree/Maximum Level Sum of a Binary Tree.cpp | C++ | cpp | 1,985 | no_license | Problems:
/*
* Problems:
*
* Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on.
* Return the smallest level x such that the sum of all the values of nodes at level x is maximal.
*
* Example 1:
* Input: root = [1,7,0,7,-8,null,null]
* Output: 2
*
* Explanati... |
0c2dfb468e269c11fb3f1995e56a26da4f66271e | 9d8bbaad392c1b5752f2b29a4e027aad74644bb7 | DEPhantom/Ds-second | /ex3/DS2_ex3_10727247_10727220(改).cpp | C++ | cpp | 13,528 | no_license | /* team04
10727247 廖仁傑
10727220 陳正浩*/
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <string.h>
#include <cstdlib>
#include <iomanip>
using namespace std;
#define COLUMNS 6
#define MAX_LEN 10
#define BIG_INT 255
#define MAX 200
struct Student { // ty... |
eef8dc523ca6bc28e6c7f5fbcaa48c1515be9cee | 2655028a7fad9cee2b39851520238dbda78734c2 | alexhilton/miscellaneous | /cc-work/basics/oop-in-cpp/chap04/sorteddriver.cc | C++ | cc | 986 | permissive | /*
* sorteddriver.cc
*
* test of class SortedSeq
*/
#include "sequence.h"
using namespace std;
int main() {
string inbuf, where;
int wh;
SortedSeq sortitems( "test.dat" );
while ( true ) {
cout << endl << "SortedSeq output: " << endl;
sortitems.output();
cout << endl << "1 -- add" << endl;
... |
2838a25530bc2f5e1d5f55dcaf318792f1e3cffd | ff30bc90d5c14c5c664cd77efc8805050a0578bc | girlcoder18/Model-Based-IDS | /robot_formation/12292016/robot_0/robot_ert_rtw/slros_busmsg_conversion.cpp | C++ | cpp | 4,982 | no_license | #include "slros_busmsg_conversion.h"
// Conversions between SL_Bus_robot_geometry_msgs_Point and geometry_msgs::Point
void convertFromBus(geometry_msgs::Point* msgPtr, SL_Bus_robot_geometry_msgs_Point const* busPtr)
{
const std::string rosMessageType("geometry_msgs/Point");
msgPtr->x = busPtr->X;
msgPtr->y =... |
267b54a0e1829bff91cf9fd4e8af9338b23047ef | 3ece0870daf02668ab14b8be396a4def81ee05d7 | schaban/crossdata_gfx | /src/chrbase.hpp | C++ | hpp | 5,729 | no_license | // Author: Sergey Chaban <sergey.chaban@gmail.com>
class cBaseRig {
public:
enum eMoveMode {
CONSTANT,
FCURVES
};
struct NodeStatus {
uint16_t tx : 1;
uint16_t ty : 1;
uint16_t tz : 1;
uint16_t rx : 1;
uint16_t ry : 1;
uint16_t rz : 1;
uint16_t sx : 1;
uint16_t sy : 1;
uint16_t sz : 1;
voi... |
ccd32beb72f0bf295b9bfc4c62b9da3d9d135258 | d7e994ca52f74a131cd93f7a7bfa783e2ed4f37d | ryanlightbrighton/nocebo | /##Nocebo_new_inidbi2.Stratis/cfgLoot/types/shop.cpp | C++ | cpp | 2,911 | no_license | class B_SHOP {
class Ammo {
probability = 0.03;
class Magazines : NCB_loot_Magazines {
threshold = 0.35;
loot[] = {
"ncb_gv_lootMagsTier_0",
"ncb_gv_lootMagsTier_1",
"ncb_gv_lootMagsTier_2"
};
};
class Grenades : NCB_loot_Grenades {
threshold = 0.45;
};
class SmokeGrenades : NCB_loo... |
b86980a8f9278b92efdd34ab1704879a63a8ca96 | fe357688a417df110033a2d5c953a0ae2f39d6d4 | rmit-ir/LTR_Cascade | /include/doc_entry.hpp | C++ | hpp | 10,569 | permissive | #pragma once
#include <algorithm>
#include <chrono>
#include <iostream>
#include <iterator>
#include <map>
#include <unordered_map>
#include <utility>
#include <vector>
struct doc_entry {
// doc id for convenience
int id = 0;
size_t length = 0;
double pagerank = 0;
// Score from training trec r... |
db191ac890ffc3a3c27827697b71646b11d0b2a8 | 7efaf880703bac99afa8697e1b356ce63633f9e6 | bylond/naiveproxy | /src/net/third_party/quiche/src/quic/core/qpack/fuzzer/qpack_encoder_stream_sender_fuzzer.cc | C++ | cc | 2,642 | 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 <cstddef>
#include <cstdint>
#include <limits>
#include <string>
#include "net/third_party/quiche/src/quic/core/qpack/qpack_encoder_stream_sende... |
b15b3e0e4959e4f51cfbe39cf9c3585cd2d7c522 | 5e4314a1859bf4516ebd19cba4b5f97653ce4d64 | viniciusjavs/functional-cpp-book | /chapter-11/11.6 make-curried/main.cpp | C++ | cpp | 1,909 | no_license | #include <functional>
#include <iostream>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
template <typename Function, typename... CapturedArgs> class curried {
public:
curried(Function function, CapturedArgs... args)
: m_function(function), m_captured(std::make_tuple(args...)) {}
... |
8833528ae723c587dac063d23545d756345cdcd7 | 22ef2c6ee6d72d0140173d77f12be6db36991336 | OzgeDemirel91/academic_projects | /CPP/EulerProject/Euler63.cpp | C++ | cpp | 349 | no_license | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
int down = (int)ceil(pow(10, (N-1.0)/N));
int up = 10;
for(int d=down; d < up; d++){
cout<<(long long)pow((long double)d,(long double)N)... |
a77cbedddb6fea44073ea0e033107a79904e604b | d8b11e24ddc34a326e3f6b921ababb238db07af8 | SeungHoons/algorithm_Hoons | /algorithm_Hoons/algorithm_Hoons/Study/01_0806/오목만들기.cpp | C++ | cpp | 2,669 | no_license | #define _CRT_SECURE_NO_WANRNINGS
#include <iostream>
#include <conio.h>
using namespace std;
#define WIDHT 19
#define HEIGHT 19
#define EMEPTY 0
#define BLACK 1
#define WHITE 2
int main()
{
char input;
int map[19][19];
for (int i = 0; i < 19; i++)
{
for (int j = 0; j < 19; j++)
{
map[i][j] = 0;
}
}
in... |
3cf591e2d8142dc6904e6ac82aebb5798d45463e | 68c9fce8ee9969f1710d31c96a50357196249a57 | lfac-pt/Spatiotemporal-Emotional-Mapper-for-Social-Systems | /main.cpp | C++ | cpp | 633 | no_license | #include <QtGui/QApplication>
#include "emmainwindow.h"
#include <QDebug>
#include "dataplot.h"
int main(int argc, char *argv[])
{
QApplication a(argc, argv);
/*QList<QPointF*> * v = new QList<QPointF*>;
v->append(new QPointF(0,0.0));
v->append(new QPointF(1,0.2));
v->append(new QPointF(2,0.3));... |
7e0d226872415c2492649617c07b6f2be61c467c | 0a5fadc4a35155e2a1780c8849a96426e1c81e3d | gem5/gem5 | /ext/dsent/model/timing_graph/ElectricalTimingNode.cc | C++ | cc | 5,667 | permissive | /* Copyright (c) 2012 Massachusetts Institute of Technology
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy... |
3614aeeb9c3834596f64c6e45acf645028e44ce4 | 20e3001e7a7b2c9172e45e3e58df05ed34de854a | alielrafeiFCIH/Problem_Solving | /271-A/main.cpp | C++ | cpp | 637 | no_license | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int check(int year){
int a[10];
int tmp=0;
int c=0;
for(int i=0;i<10;i++)a[i]=0;
for(int i=0;i<4;i++){
tmp=year%10;
a[tmp]++;
year=year/10;
}
for(int j=0;j<10;j++){
if(a[j]>1){
... |
22f6cfeae2d63b4b5aaa65556112a84585a26327 | f6cf6a44320896a391fa600392d826599ca48b4a | smallcat9603/simgrid | /simgrid3.21-examples/s4u/dht-kademlia/node.hpp | C++ | hpp | 1,670 | no_license | /* Copyright (c) 2012-2018. The SimGrid Team.
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
#ifndef _KADEMLIA_NODE_HPP
#define _KAD... |
d599f93e2256180bf735d20e36b42ec054e1e0b9 | 6b781010cfb4c882242f613273f06fdc2280bbb6 | poiuytr92/MutilSelectListDemo | /RichListDemo2/main.cpp | C++ | cpp | 27,395 | permissive | #include "StdAfx.h"
#include "MenuWnd.h"
struct CustomListItem
{
wstring title;
wstring icon;
wstring appbid;
wstring appversion;
wstring backuptime;
wstring filesize;
wstring filepath;
CustomListItem()
{
memset(this, 0, sizeof(CustomListItem));
}
~CustomListItem()
{
}
};
// 控件key
const TCHAR* con... |
d6a19edfdf155d908474b7461656581a34168358 | 83dfa73bc7882b66c90c460b30f8b2eee7c39ab6 | abhinavagarwalla/kgpkubs-southkorea | /Strategy/Skills/skillSet.cpp | C++ | cpp | 7,088 | no_license | // This file contains all the skillSet functons
#include <cassert>
#include <string>
#include "skillSet.h"
#include "pathPlanners.h"
#include "beliefState.h"
#include "geometry.hpp"
#include "grSimComm.h"
#include "logger.h"
using namespace HAL;
using namespace std;
using namespace dlib;
namespace Strategy
{
#if FIRA... |
22a049dbed67d8c41ccf16e0ba43bbde6f755814 | d3a1dcfb7250dcd0a617e31818dd17f15e3e11e5 | maca134/breakingpointmod | /breakingpoint_map_objects/rocks2/config.cpp | C++ | cpp | 636 | no_license | ////////////////////////////////////////////////////////////////////
//DeRap: Produced from mikero's Dos Tools Dll version 4.32
//Sun Mar 16 15:21:38 2014 : Source 'file' date Sun Mar 16 15:21:38 2014
//http://dev-heaven.net/projects/list_files/mikero-pbodll
/////////////////////////////////////////////////////////... |
bb5cc51883925f77508ebeaa83bd8e6b8d0dc57c | b96fc77a35bc5ffdec94f25937198ee7cb6f9fba | Nikhil-Wagh/Competitive-Coding | /Fancy Fence/fence.cpp | C++ | cpp | 492 | no_license | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,n,i,j=3;
double s;
bool found=false;
cin>>n;
for(i=0;i<n;i++,j=3)
{
cin>>a;
while(!found)
{
s=180*(double)(j-2)/(double)j;
if(a>s)
{
j++;continue;
... |
7e44317076b6b4f2e7c805671d22df1c827d1cfd | b6551b50d94f2777c8356ba02ee8d304d60a9f6d | G0ldJay/MultiplayerCA1 | /GD4SFMLGameWorld/Component.hpp | C++ | hpp | 767 | no_license | //Jason Lynch - D00137655
//Dylan Reilly D00194504
#pragma once
#include <SFML/System/NonCopyable.hpp>
#include <SFML/Graphics/Drawable.hpp>
#include <SFML/Graphics/Transformable.hpp>
#include <memory>
namespace sf
{
class Event;
}
namespace GUI
{
class Component : public sf::Drawable, public sf::Transformable, pr... |
7b4f5c9a6cf0ccf885960e6fc12818ecbf1045d8 | b0181ead37d5722591488bfc38ba51f49b5b8e78 | jcd1994/MatlabTools | /Compiled/blaze-3.2/blazetest/src/mathtest/tdvecsmatmult/V5bMCb.cpp | C++ | cpp | 3,803 | permissive | //=================================================================================================
/*!
// \file src/mathtest/tdvecsmatmult/V5bMCb.cpp
// \brief Source file for the V5bMCb dense vector/sparse matrix multiplication math test
//
// Copyright (C) 2012-2017 Klaus Iglberger - All Rights Reserved
//
// Th... |
0709b3e318584c4d1ed8ae8cd443845a601e4173 | f1c13f98d4aa37c4af7835d454c4034be6229103 | shinesolutions/swagger-aem-osgi | /clients/cpp-tizen/generated/src/OrgApacheSlingDistributionAgentImplSyncDistributionAgentFactoryProperties.cpp | C++ | cpp | 27,464 | permissive | #include <map>
#include <cstdlib>
#include <glib-object.h>
#include <json-glib/json-glib.h>
#include "Helpers.h"
#include "OrgApacheSlingDistributionAgentImplSyncDistributionAgentFactoryProperties.h"
using namespace std;
using namespace Tizen::ArtikCloud;
OrgApacheSlingDistributionAgentImplSyncDistributionAgentFact... |
e76ef688f07c9df7f304fd50785a04a798721fcf | 08e31e8d7d7006488ce11413c1cbdf81e0049372 | ajgappmark/KlotskiSGX | /klotski/llvmProgram/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.shared.atomic/atomic_compare_exchange_strong_explicit.pass.cpp | C++ | cpp | 1,996 | permissive | //===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------... |
5c9c28cedc3ba57c64ed66bca917db1c4dbff9ea | 3b4d73b0873373865c995d4b473a1e4d7b1a7b21 | xiaoyinl/ObjectExplorer | /SystemExplorer/ListViewHelper.cpp | C++ | cpp | 1,348 | permissive | #include "pch.h"
#include "ListViewHelper.h"
bool ListViewHelper::SaveAll(PCWSTR path, CListViewCtrl& lv, bool includeHeaders) {
wil::unique_handle hFile(::CreateFile(path, GENERIC_WRITE, 0, nullptr, CREATE_ALWAYS, 0, nullptr));
if (!hFile)
return false;
auto count = lv.GetItemCount();
auto header = lv.GetHeade... |
2a92fd4f18d0290ce5f458f0d1095df0312df8a8 | c6df57fc422fd055dc73ec81b4cfe2a9068a6ff5 | mirekp/s3edialog | /extensions/s3eDialog/source/generic/s3eDialog.cpp | C++ | cpp | 1,553 | no_license | /*
* (C) 2001-2012 Marmalade. All Rights Reserved.
*
* This document is protected by copyright, and contains information
* proprietary to Marmalade.
*
* This file consists of source code released by Marmalade under
* the terms of the accompanying End User License Agreement (EULA).
* Please do not use this progr... |
4ae8b34b557378c0c94bdab66603fa624a85b727 | 4216b3d533e49bf17f122f646c3cb842d964296c | GersonU/img_proc | /nav/nav.cpp | C++ | cpp | 1,358 | no_license | #include "nav.hpp"
using namespace std;
using namespace cv;
void sendToCtrl(Heading* heading) {
// TODO: INSERT NEAT FUNCTION TO SEND HEADING TO FLIGHT CONTROLLER
}
void focusClosestObject(Point2f* closest_obj, Point2f* origin, vector<Point2f>* centers) {
double dist = norm((*centers)[0] - *origin), min_dist = dis... |
82f5023530279104ba0668a7b6eb8dec0aba570a | ca4fbf2982e9a061b1b6dd8b22931051e5bdb4da | malin666/MyProject | /GlutTest/main.cpp | C++ | cpp | 546 | no_license | /*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/*
* File: main.cpp
* Author: malin
*
* Created on January 30, 2018, 11:15 AM
*/
#include <cstdlib>
#include <GL/glut.h>
#inc... |
b1ff2ffa8ad606c8a40d1551f95ee63df17a5e68 | b8266f8b5de88b52edf44296504df60d6621ba69 | Vedant-S/Codes-VS | /Std11-12/Lab/Bubble.cpp | C++ | cpp | 628 | permissive | #include <iostream>
using namespace std;
class bubble
{
short list[30];
unsigned n;
void sort();
void show();
public:
bubble()
{cout<<"Enter number of elements"<<endl;
cin>>n;
cout<<"Enter elements"<<endl;
for(int i=0;i<n;i++)
{
cin>>list[i];
}
sort();
cout<<"The sorted array is";
show(); }... |
d0132314789a5f9d4a7a2ea865a19e51ab63c45a | 132c34e2d42dec138981dac9cedefb1cacbfda16 | biubiutang/Topic-Model-Exp | /src/main.cpp | C++ | cpp | 2,885 | no_license | #include <cstdlib>
#include <string.h>
#include <string>
#include <cstdlib>
#include <string.h>
#include <string>
#include <iostream>
#include <ctime>
#include <omp.h>
#include "model.h"
#include "infer.h"
using namespace std;
void usage() {
cout << "Training Usage:" << endl
<< "btm est <K> <W> <alpha> <bet... |
9b81acf2099b5cdcf302d15f8994a48e1ade4289 | eac274d5386025e3342e90b24f15f3cf078d25bf | MarAlder/tigl | /src/generated/CPACSProfileBasedStructuralElements.cpp | C++ | cpp | 3,495 | permissive | // Copyright (c) 2018 RISC Software GmbH
//
// This file was generated by CPACSGen from CPACS XML Schema (c) German Aerospace Center (DLR/SC).
// Do not edit, all changes are lost when files are re-generated.
//
// Licensed under the Apache License, Version 2.0 (the "License")
// you may not use this file except in com... |
915237945954fef968d3531d4ca571623f172e09 | 4e863fb2f0fa148c5f5c6c9877dc4b31a294045e | nasa/gunns | /aspects/fluid/source/test/UtGunnsFluidEvaporation.cpp | C++ | cpp | 38,080 | permissive | /************************** TRICK HEADER ***********************************************************
@copyright Copyright 2019 United States Government as represented by the Administrator of the
National Aeronautics and Space Administration. All Rights Reserved.
LIBRARY DEPENDENCY:
(
(aspects/... |
96f42173ded601721cb2d77b48ca5cdb44b9cb6e | 862966f247d25229543f8695c8727a246a5632ce | jled7/Cengage-C-Plus-Plus | /Chapter2/Example2_24.cpp | C++ | cpp | 269 | no_license | // This program illustrates how output statements work.
#include <iostream>
using namespace std;
int main()
{
cout << "Count...\n....1\n.....2\n......3" << endl;
cout << "Count..." << endl << "....1" << endl
<< ".....2" << endl << "......3";
return 0;
}
|
59a84e0a21a29e7c7f2c9f5feb1a7c5a003dfb1b | 9a8ade72f7c191a5cac7b5acd413d9aee2aa80e4 | juankipedia/CompetitiveProgramming | /utilities/template.cpp | C++ | cpp | 239 | no_license | # include <bits/stdc++.h>
using namespace std;
# define endl "\n"
# define io_boost ios_base::sync_with_stdio(0);cin.tie(0);
using ull = unsigned long long;
using ll = long long;
/*
JUANKI
*/
int main(){
io_boost;
return 0;
}
|
6254a05c9dbd7cb8f0a0eeebdda04c41d22be678 | 6986eb742eee84a59bbc0b1982016e87b39d6a97 | massbrowser/android | /content/renderer/input/main_thread_event_queue_task_list.cc | C++ | cc | 1,237 | 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 "content/renderer/input/main_thread_event_queue_task_list.h"
namespace content {
MainThreadEventQueueTaskList::MainThreadEventQueueTaskList() {... |
648f9820db9ff3c2dc09d163db5a0d316a571e2c | 2efa8bc5182a6a02b20ae94c389cf19e7159936d | jing-ge/MyCodeInterview | /36_ConvertBinarySearchTree/main.cpp | C++ | cpp | 4,452 | no_license | #include <iostream>
using namespace std;
#include <cstdio>
#include <../lib/BinaryTree.h>
BinaryTreeNode* ConvertNode(BinaryTreeNode* pNode, BinaryTreeNode* pLastNodeInList);
BinaryTreeNode* Convert(BinaryTreeNode* pRootOfTree)
{
if(pRootOfTree==nullptr)return pRootOfTree;
BinaryTreeNode* LastList = nullpt... |
09e703e65e0eea97dda6725b684dc7a887bef886 | 7d200d83d06c377e98c2d407ca26b589cad66a25 | jainrk/TimeLibPlusPlus | /TimeLibPlusPlus/NISTClass.cpp | C++ | cpp | 2,334 | no_license | /*
Coded by: Rajendra Jain on March 23 2017.
This is my attempt to create a library of classes dealing with time.
The background work comes from the TimeLib
The Virtual base class TimeClass maintains the methods to maintain manage
time within a local clock. It updates the local clock from a time source ev... |
27a800497d6f3c6556c8c55e420a8f19dbee7fb1 | 23a6a544fa8862f4c151b532e82a21fda8729b08 | chosumin/DX11_MapEditor | /JsonParser/JsonParser.cpp | C++ | cpp | 929 | no_license | #include "stdafx.h"
#include "JsonParser.h"
JsonParser::JsonParser()
{
}
void JsonParser::ParseValue(const string fileName, Json::Value * root) const
{
string buffer = ReadFromFile(fileName);
Json::Reader reader;
bool readerSuccess = reader.parse(buffer, *root);
assert(readerSuccess && "Json ÆÄ½Ì ¿À·ù!");
}
voi... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.