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 |
|---|---|---|---|---|---|---|---|---|
d5b18a3bbad7f43bc33d55440c89f0c2e15fdbc3 | aa6e9c3ffcfb2566aa7f0561001cb09b4c77d6d3 | gvsureshreddy/LatticeStaticsPackage | /LatticeStatics/Utility/ChainSum.cpp | C++ | cpp | 6,456 | no_license | #include "ChainSum.h"
int CHAINSUMcomp(void const* const a, void const* const b);
int CHAINSUMind(double const& i, double const& j);
#include <cstdlib>
using namespace std;
ChainSum::ChainSum(Vector const* const DOF, int const& LagrangeCB, int const& Translations,
Matrix const* const RefLat, int c... |
2abfa3f095f1a4aa27a061df936b442030a412c5 | 311c63307f3302d4712fa1710673d9ba7c90f705 | yadav-ankit/Projects | /Programms/GFG/Competetive/use of pair.cpp | C++ | cpp | 563 | no_license | int main() {
int tc;
cin >> tc;
for (; tc > 0; tc--) {
int W;
cin >> W;
int n;
cin >> n;
vector<pair<int, int> > a (n);
for (int i = 0; i < n; i++) {
cin >> a[i].first; a[i].second = i;
}
sort(a.begin(), a.end());
... |
739f803ece08a876be3804f2d62455571963f2e7 | 4e7a83a9a087bf361db1b1584bdfc5e640539a76 | brock7/TianLong | /Client/SceneEdit/Xerces/src/xercesc/util/HexBin.cpp | C++ | cpp | 5,348 | permissive | /*
* Copyright 2001,2004 The Apache Software Foundation.
*
* 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... |
e56275e8bc2cf29c1a3ba2138bcc702be0bb5804 | d34f3871316c454086e3583b0fbd8050fcc1b9ae | makio93/atcoder | /ABC/ABC133/D/main-temp.cpp | C++ | cpp | 1,306 | no_license | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<p... |
ed0b6ef49900737111bb28c6fdcf43d55fdbfa80 | ec9d436fdd7f55d80985fe16f66ea7111344e585 | samwhitlock/mesos-monitoring | /src/examples/test_framework.cpp | C++ | cpp | 4,907 | permissive | /**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you... |
745fb6c277a53afbae1c4f8812c401cbfd426a93 | d01ae52ab201ef31db5bf95ab1b60c3208f26a1a | wesleygrey/Game | /main.cpp | C++ | cpp | 262 | no_license | #include <QApplication>
#include "game.h"
Game* myGame;
int main(int argc, char *argv[])
{
QApplication a(argc, argv);
myGame = new Game();
myGame->show();
myGame->displayMainMenu(); //fixed
//myGame->launchGame();
return a.exec();
}
|
9f35c3c9e3458ad6f2077b0f637ed59aee47fa81 | 1b472e16289acdf1bb7fa93fc01cec7df57421be | ailyanlu1/spoj-codechef-codeforces | /ROCK.cpp | C++ | cpp | 402 | no_license | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int i,j,n,ans=1;
cin>>n;
string s;
cin>>s;
for(i=0;i<s.length();i++)
... |
0dc85bb9d945b568f63461663a8166c58cb2f541 | eb9b282b14d48686887249817772c4ac7ff5ca8b | Yuzhen11/flexps-paper-version | /cluster_manager/task_scheduler/greedy_task_scheduler.hpp | C++ | hpp | 1,673 | no_license | #pragma once
#include <iostream>
#include <unordered_set>
#include "cluster_manager/task_scheduler/available_workers.hpp"
#include "cluster_manager/task_scheduler/task_scheduler.hpp"
#include "cluster_manager/task_scheduler/history_manager.hpp"
#include "core/color.hpp"
namespace husky {
/*
* GreedyTaskScheduler ... |
32fbcdd046b03e6b5a6a7edeb1d2f38ed407d2bd | c08eb3032616c0e0d89619d092bf1607f3f47029 | XXLcoinSupp/_xxl_src2 | /src/qt/bitcoinstrings.cpp | C++ | cpp | 9,702 | permissive | #include <QtGlobal>
// Automatically generated by extract_strings.py
#ifdef __GNUC__
#define UNUSED __attribute__((unused))
#else
#define UNUSED
#endif
static const char UNUSED *bitcoin_strings[] = {
QT_TRANSLATE_NOOP("bitcoin-core", ""
"%s, you must set a rpcpassword in the configuration file:\n"
" %s\n"
"It is recomm... |
2f02a473079499c99a1150b2c13576d982983bec | 1eb86b588fe987d7cbe2c03e3a6f4316d1b65069 | vmichal/Competitive | /KSP Bratislava/2017-2018/KopaKopaniaC++.cpp | C++ | cpp | 390 | no_license | #include "stdafx.h"
#include <iostream>
using namespace std;
int main()
{
int pocetNerovnosti, jamy = 0;
cin >> pocetNerovnosti;
for (int i = 0; i < pocetNerovnosti; i++) {
char nactene;
cin >> nactene;
if (nactene == '0')
jamy++;
}
pocetNerovnosti = pocetNerovnosti - jamy * 2;
cout << (po... |
e9d96ef244d5421dd14a9bbc671ec20a42136397 | 6023ea6b2920bcf1c373e24b90fad62809a4d579 | ehsan-mira/Graph-dige | /Graphic.cpp | C++ | cpp | 6,455 | no_license | #include "Graphic.h"
#include "Edge.h"
#include "Node.h"
#include "parser.h"
#include <math.h>
//! [0]
Graphic::Graphic(Parser &p, QWidget *parent)
: QGraphicsView(parent)
{
graphi=new Graph;
QGraphicsScene *scene = new QGraphicsScene(this);
scene->setItemIndexMethod(QGraphicsScene::NoInd... |
ff632fd13769e4c01a819717a0925c6e16984983 | 45754680ba9fdae6119fd5f16f7afde4f3232c94 | LiquidFM/libtorrent | /src/settings_pack.cpp | C++ | cpp | 30,399 | permissive | /*
Copyright (c) 2012-2016, Arvid Norberg
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 conditions and ... |
4637ab9d1e2e69459de64f7b425b64ff003c4050 | a222149a41a6e8fa94f0c3d9f568a05be5675476 | roygaogit/Bigit_Genie | /GenieWindow/plugins/genie_module/src/svp/genieworkbenchrun.cpp | C++ | cpp | 746 | no_license | #include "genieworkbenchrun.h"
#include "GenieWorkbenchWindow.h"
#include "GenieWorkbenchFactory.h"
GenieWorkbenchRun::GenieWorkbenchRun(void)
{
genie_workbench_window =0;
svp_shell =0;
}
GenieWorkbenchRun::~GenieWorkbenchRun(void)
{
this->stop();
}
void GenieWorkbenchRun::setSvpShell(ISvpS... |
56485ad807d1bdcc811f3db3fc9921b41e5bc7e9 | a75731c9348b729a3b2ac0d8ae23d767b9410147 | anubhab91/codeforces | /159D.cpp | C++ | cpp | 2,439 | no_license | #include<iostream>
#include<vector>
#include<string.h>
#include<stdio.h>
#include<map>
#include<math.h>
#include<algorithm>
#define LL long long
#define P(N) printf("%d\n",N);
#define S(N) scanf("%d",&N);
#define SL(N) scanf("%d",&N);
#define pb push_back
#define mp make_pair
using namespace std;
int P[... |
9371e06251a82bbc0338d72b97d0e5ffab45cdbc | cc540b54eff02bec5c3c87df0238165282609ab6 | sandlecat/Offline | /CaloConditions/inc/CaloDAQMap.hh | C++ | hh | 1,643 | permissive | #ifndef CaloConditions_CaloDAQMap_hh
#define CaloConditions_CaloDAQMap_hh
//
// CaloDAQMap stores channel maps vs detector map
//
// C++ includes
#include <vector>
// Mu2e includes
#include "Mu2eInterfaces/inc/ProditionsEntity.hh"
#include "fhiclcpp/ParameterSet.h"
namespace mu2e {
class CaloDAQMap : virtual pub... |
aab52ecb190d0f9d1e64af09cf1d331dbe0d717f | f5ac98d4b8be2e21c6513d61884caba45a60abb9 | juannavascalvente/Delaunay | /src/Visual/Display/DisplayService.cpp | C++ | cpp | 1,555 | no_license | /***********************************************************************************************************************
* Includes
***********************************************************************************************************************/
#include "Config.h"
#include "DisplayService.h"
/****************... |
fb14073a173aec844dd3d9422fd916a4ee8b542f | 45e2c39bcaab717c89a242a9311274b5bc76bc50 | BetsyMcPhail/qtextensions | /itemviews/qtAbstractListDelegate.cpp | C++ | cpp | 3,753 | permissive | /*ckwg +5
* Copyright 2015 by Kitware, Inc. All Rights Reserved. Please refer to
* KITWARE_LICENSE.TXT for licensing information, or contact General Counsel,
* Kitware, Inc., 28 Corporate Drive, Clifton Park, NY 12065.
*/
#include "qtAbstractListDelegate.h"
#include "../core/qtIndexRange.h"
#include "../core/qtSc... |
477e258e14828c3477c5ce221414b954767d95cd | dee795805ef1c7636edd856d1fec751f41fee303 | yair-k/Win2000SRC | /private/shell/applets/cleanup/cleanmgr/miniicon.cpp | C++ | cpp | 8,884 | no_license | /*
**------------------------------------------------------------------------------
** Module: Disk Cleanup Applet
** File: miniicon.c
**
** Purpose: Creates and Manages the mini icons
** Notes:
** Mod Log: Created by Jason Cobb (2/97)
**
** Copyright (c)1997 Microsoft Corporation, All Rights Reserved
**--------... |
b06e9ec5da70e4d55d87f65de080af59e8f7ae3d | 1f64db59280f0ff925058eba46130bf16f0865a4 | jizhongqing/vad_for_voip | /MmseBasedNpe.cpp | C++ | cpp | 1,971 | permissive | /*
* Mmsebasednpe.cpp
*
* Created on: 2015/11/27
* Author: aihara
*/
#include <MmseBasedNpe.h>
#include "LTSD.h"
MmseBasedNpe::MmseBasedNpe(int size, float *noiseProfile) {
// TODO Auto-generated constructor stub
fftsize = size;
alphaPH1mean = 0.9;
alphaPSD = 0.8;
q = 0.5; // a priori probability o... |
69fc561a7aa94c15edcb19368dea13f11e9bc565 | c79c968e13668a8696261ca00eaadcffca90285f | ashutosh0gupta/llvm_bmc | /examples/litmus/c/run-scripts/tmp_1/MP+dmb.sy+ctrl-rfi-ctrlisb-[fr-rf]-ctrlisb.c.cbmc.cpp | C++ | cpp | 67,599 | no_license | // 0:vars:4
// 4:atom_1_X0_1:1
// 9:thr0:1
// 10:thr1:1
// 11:thr2:1
// 5:atom_1_X4_1:1
// 6:atom_1_X5_0:1
// 7:atom_1_X7_1:1
// 8:atom_1_X8_0:1
#define ADDRSIZE 12
#define NPROC 4
#define NCONTEXT 1
#define ASSUME(stmt) __CPROVER_assume(stmt)
#define ASSERT(stmt) __CPROVER_assert(stmt, "error")
#define max(a,b) (a>b... |
15cb6859ec25ec059f6bedd85970e70735aecafd | 6af1ed9098030851dad9ca26c56e5d597a7b8e62 | mateusz-/openthread | /src/core/net/sntp_client.hpp | C++ | hpp | 20,278 | permissive | /*
* Copyright (c) 2018, The OpenThread Authors.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this ... |
79b38022d97a9ff9b071cccf546f7ef2d68da2b9 | fa493c6361a3080c293f5dd21d7a76e0fbd14e23 | jjzhang166/WinNT5_src_20201004 | /NT/inetcore/mshtml/src/dxt/msft/src/dropshadow.cpp | C++ | cpp | 20,549 | no_license | //------------------------------------------------------------------------------
//
// Copyright (C) Microsoft Corporation, 1998
//
// FileName: dropshadow.cpp
//
// Created: 10/01/98
//
// Author: MikeAr
//
// Discription: This file implements the Drop Shadow transform.
//
// 10... |
2c6f1ad0b2843215419e643bad0cd132ff00d461 | 963ba3a9d7b50e0728da1e0687c651adc87ea982 | Sitispeaks/turicreate | /src/visualization/annotation/image_classification.cpp | C++ | cpp | 21,449 | permissive | #include <core/data/sframe/gl_sarray.hpp>
#include <functional>
#include <visualization/annotation/image_classification.hpp>
#include <boost/archive/iterators/base64_from_binary.hpp>
#include <boost/archive/iterators/binary_from_base64.hpp>
#include <boost/archive/iterators/remove_whitespace.hpp>
#include <boost/arch... |
37efbe2923410b04b1e701c27cdd8cdffe79b5fa | 76fb8ea8f964ff769e3e90420cbbe9cb9779acfe | TenpaDoIt/LeetCodeProjects | /HeaderFiles/MedianofTwoSortedArrays.hpp | C++ | hpp | 286 | no_license | #include <stdlib.h>
#include <vector>
#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
class MedianTwoSortedArrays
{
public:
float findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2);
int Main();
~MedianTwoSortedArrays() {};
}; |
cc669965e8463d9765d82cf6c4b74f330eddeae5 | 362fe982a933923c4c1a2120f2114e4cc2d67acf | bxmxxxbbb/Calculator | /计算器.cpp | C++ | cpp | 2,576 | no_license | #include<bits/stdc++.h>
using namespace std;
stack <char> sCh; //用于存放符号的符号栈
stack <double> sNum;//用于存放数据的数据栈
char num[105];
char str1[105];
void cal_1()//接受加减乘除，循环条件特别巧妙
{
double n1,n2;
char ch;
ch=sCh.top();
while(ch!='('){
n1=sNum.top();
sNum.pop();
n2=sNum.top();
sNu... |
155f5544d28635549e41d5397bf451f03654b675 | 7842dd39c63c83a82d5fb73b28809da02689f407 | vslavik/poedit | /deps/boost/libs/graph/test/test_iteration.hpp | C++ | hpp | 1,641 | permissive | // (C) Copyright 2009 Andrew Sutton
//
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0 (See accompanying file
// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
#ifndef TEST_ITERATION_HPP
#define TEST_ITERATION_HPP
#include <boost/concept/assert.hpp>
#include <... |
c9c543043a98dc3850ceee07693a22d098aa9097 | 53fbe0874850f5e24ae4654b1c743ee55960d315 | bathepawan/chromium | /third_party/blink/renderer/core/workers/shared_worker_client_holder.cc | C++ | cc | 6,730 | permissive | /*
* Copyright (C) 2009 Google Inc. 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 conditio... |
cdfb6810a68b0b5016890effc5eca51fe6fbb496 | f31e6fdb2bdb35986f17cb19416502f1db6b6885 | tao558/kwiver | /sprokit/processes/core/merge_images_process.cxx | C++ | cxx | 5,947 | permissive | /*ckwg +29
* Copyright 2018, 2020 by Kitware, Inc.
* 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 l... |
45dfa504034fae154f99446a9e3c8ce7503ef19d | ec8b667045c800ea9fde0e624b79dcd55984b7d2 | hydrophyl/C--1.0 | /Aufgabenblatt 7 - Dateien zum Herunterladen-20190504/Einlesen.cpp | C++ | cpp | 652 | no_license | #include <string>
#include <iostream>
#include <fstream>
using namespace std;
int main(){
//definitions
const int MAX = 200;
unsigned int count;
ifstream data1;
double x[MAX];
double y[MAX];
string s,v;
//read data
data1.open("DatenEinlesen1.txt");
data1 >> s >> v;
/* for(i... |
8b75ecb210363cb9464c3b56d6bb1d17487cb258 | 415f20e34080c2010c8ec98a016f52a33bf9f246 | koson/arduino-arm64 | /portable/sketchbook/libraries/SerialWombat/src/SerialWombatProtectedOutput.cpp | C++ | cpp | 1,428 | permissive | #include "SerialWombatProtectedOutput.h"
SerialWombatProtectedOutput::SerialWombatProtectedOutput(SerialWombat& serialWombat):_sw(serialWombat)
{
_sw = serialWombat;
}
void SerialWombatProtectedOutput::begin(uint8_t pin, uint8_t monitoredPin)
{
_pin = pin;
_monitoredPin = monitoredPin;
}
void SerialWombatProtecte... |
61dcf92ab6b6eb9e25af05d9b91975f065827202 | 112f3ef8d2ca1abf52591949bfe7229ec0f16291 | hhuhao/codes | /luogu/1082.cpp | C++ | cpp | 1,393 | no_license | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<vector>
#include<map>
#include<queue>
#include<time.h>
#include<fstream>
#include<string>
#include<set>
#include<list>
#include<stdlib.h>
#define fr(i,a,b) for(int i=a,_end_=b;i<=_end_;i++)
#define fd(i,a,b) for(int i=... |
f87e647f50d31f8cc7be5030ae8de0465a993712 | 7dba3923f637000f833ad64021e6223c39193456 | ajtwls1256/20180406_0 | /animation.cpp | C++ | cpp | 10,176 | no_license | #include "stdafx.h"
#include "animation.h"
animation::animation()
: _frameNum(0),
_frameWidth(0),
_frameHeight(0),
_loop(FALSE),
_frameUpdateSec(0),
_elapsedSec(0),
_nowPlayIndex(0),
_play(FALSE)
{
}
animation::~animation()
{
}
HRESULT animation::init(int totalW, int totalH, int frameW, int frameH)
{
//... |
8bd5526908f07674f30d5756016e801e552e73df | d78b235a6b69f209d8db81155bad71f81fe653ab | QPKJEDL/deskgame | /Baccarat/login.cpp | C++ | cpp | 521 | no_license | #include "login.h"
#include <QMessageBox>
#include <QJsonObject>
#include <QJsonDocument>
#include "ui_login.h"
static QString URL = "101.32.22.231:8210";
Login::Login(QWidget *parent) : QWidget(parent), ui(new Ui::Login)
{
ui->setupUi(this);
setWindowTitle("登录");
connect(ui->pu_cancel,SIGNAL(clicked()),t... |
842237e989be306ab5f2cc582885b4dbc2d6a3de | 38257a2fd69f55bd86950813477cc4fea5fc8989 | georgthegreat/cppstuff | /join_path/join_path_test.cpp | C++ | cpp | 1,348 | no_license | #include "join_path.h"
#include <filesystem>
#include <stdexcept>
#include <string>
#include <string_view>
#include <iostream>
void assert_equals(const std::filesystem::path& first, const std::filesystem::path& second) {
if (first != second) {
throw std::logic_error(
"Expected " + first.strin... |
7e54d99330f77e7d068cef10a585172ba14794aa | aaab6b3c85f6577a7d1763cb1bd96791fb773fdc | Xiangyu-Hu/SPHinXsys | /src/for_2D_build/meshes/cell_linked_list_supplementary.cpp | C++ | cpp | 8,579 | permissive | #include "cell_linked_list.h"
#include "base_particles.hpp"
#include "mesh_iterators.hpp"
namespace SPH
{
//=================================================================================================//
void CellLinkedList ::allocateMeshDataMatrix()
{
Allocate2dArray(cell_index_lists_, all_cells_);
Alloc... |
1d3f745aa6252c6847e8112632bcebe99d60fe58 | 775f21ed845ef19525754274596f7a70f6e7a302 | ransherraj/C-plus-plus-Programs | /1. Kth min element in tha array.cpp | C++ | cpp | 988 | no_license | // { Driver Code Starts
//Initial function template for C++
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution{
public:
// arr : given array
// l : starting index of the array i.e 0
// r : ending index of the array i.e size-1
// k :... |
252954a0a1d7c125774a2e7af5d1c83370bddc0c | c223e5166e8c475dd853e332642bfe71dfdd0a1b | maoxiezhao/Cjing3D | /Cjing3D/platform/win32/inputSystemWin32.cpp | C++ | cpp | 824 | permissive | #include "inputSystemWin32.h"
namespace Cjing3D::Win32
{
using namespace XInput;
InputManagerWin32::InputManagerWin32()
{
}
InputManagerWin32::~InputManagerWin32()
{
}
void InputManagerWin32::Initialize(GameWindowWin32& gameWindow)
{
InputManager::Initialize();
mKeyBoard = std::make_shared<KeyBoardWin... |
9549434b94e17b77268d2f1c4e70401138d5a212 | 9ae100f09d39a8f7bfe4436d556c796de6cb68e1 | 4solo/leetcode | /34 Search for a Range.cpp | C++ | cpp | 1,489 | no_license | class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int size=nums.size();
int start=0;
int end=size-1;
int mid=(start+end)/2;
int ma=-1;
int mi=size;
while(start<=end)
{
if(nums[mid]==target)
{
... |
0505f966917139ce09731bb0c29c39ef3f26b875 | 9f92a5262a39dea94d2ade0742b38c2caad145d4 | obaidakata/Pong-Tetris | /KeyboardManagercpp.cpp | C++ | cpp | 613 | no_license | #include "KeyboardManager.h"
void KeyboardManager::registerKbListener(KeyboardEventListener * pKbListener)
{
int index;
const char * chars = pKbListener->getKbChars();
size_t numCharToRegister = strlen(chars);
for (size_t i = 0; i < numCharToRegister; ++i) {
index = getIndex(chars[i]);
if (index != -1) ... |
96a85acced0369907913f629a18b83c01589369d | d2884cab89843e8459873c2559e912ff95c37ace | Olganix/LibXenoverse2 | /depends/ogre_v1_7/ogre/OgreMain/src/OgreRoot.cpp | C++ | cpp | 51,138 | permissive | /*
-----------------------------------------------------------------------------
This source file is part of OGRE
(Object-oriented Graphics Rendering Engine)
For the latest info, see http://www.ogre3d.org
Copyright (c) 2000-2009 Torus Knot Software Ltd
Permission is hereby granted, free of charge, to any person obtai... |
9c4f9f96b3c83d2f1fd75e8dd4b0087752864daa | 19d6566f5d4e40a3983de68c50bc5ff2e8502c3f | alexvargas01/ACM | /Día_3/Problema G/Volume.cpp | C++ | cpp | 1,039 | no_license | #include <iostream>
#include <string>
using namespace std;
int iN;
int wVolume(string s)
{
int cont = 0;
for (int i = 0; i < s.length(); i++)
{
int ch = s[i];
if (ch >= 65 && ch <= 90)
{
cont++;
}
}
return cont;
}
int main()
{
int space = 0;
in... |
9bef2fbfc222579d937c3d85409c0efe1d9fca7c | 83ded5b6db81c45f87037d0a19ee960355b277bb | Crasader/18_TTL | /Server/系统模块/PaymentServer/src/PaymentSystem/PaymentSystem.cpp | C++ | cpp | 6,308 | no_license | #include "stdafx.h"
#include "PaymentSystem.h"
#include "../boost_http/reply.hpp"
#include "../boost_http/request.hpp"
#include "../BusinessModule/WorkerFactory.hpp"
#include "../Configration/PayConfigReader.h"
#include "Products.hpp"
#include "Tcp/tcp_conection.hpp"
using namespace payment;
using namespace http::s... |
e8dbd4797ed7d85dbebfb80df41f7252b9506729 | 548b046b2458efa372ff23609131480ae74be23d | fredgan/arrow | /cpp/src/arrow/filesystem/s3fs_narrative_test.cc | C++ | cc | 8,358 | permissive | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... |
88a1e61b68169cbdb460717d13b535a1158a4ccc | 847f2a20b0603f105255fb01827b8fa7f3f4b95c | robomasterhkust/ros_environment | /rqt_multiplot_plugin/rqt_multiplot/src/rqt_multiplot/DataTypeRegistry.cpp | C++ | cpp | 1,713 | permissive | /******************************************************************************
* Copyright (C) 2015 by Ralf Kaestner *
* ralf.kaestner@gmail.com *
* *
... |
2506590d19eff415905952a9cc68929a78eaee13 | 6495686b2aad4a47ba6dcf1d7b5b352925228475 | leotfrancisco/patch-hosting-for-android-x86-support | /android-x86/frameworks/base/opengl/tools/glgen/stubs/GLCHeader.cpp | C++ | cpp | 4,200 | permissive | **
** Copyright 2006, 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... |
63ce07a3931d491647b3da43709c32f35ac953c1 | ea9aa1b853997b603a4b5640a26388524c6a3c9a | ahmed-ibrahim1998/Super-Market | /Super Mraket Using File/Super Mraket/Source.cpp | C++ | cpp | 3,963 | no_license | #include <iostream>
#include <string>
#include <conio.h>
#include <fstream>
using namespace std;
class products
{
private:
int p_nom;
string p_name;
float p_price, p_Qty;
public:
void create() {
cout << "**************************Hello CustomerIn Super Market****************" << endl;
cout << "Ent... |
00f6f28e16211011ed13fbd3747e3fde506c72f2 | c57366133d8addb0d95365021f0b8d1997fe2ced | ffpwserver/panda3d | /panda/src/pgraph/stateMunger.cxx | C++ | cxx | 1,017 | permissive | /**
* PANDA 3D SOFTWARE
* Copyright (c) Carnegie Mellon University. All rights reserved.
*
* All use of this software is subject to the terms of the revised BSD
* license. You should have received a copy of this license along
* with this source code in a file named "LICENSE."
*
* @file stateMunger.cxx
* @aut... |
a044f6f9add7599c38ac46c1b70787fd7287bf53 | ddbd0c3b5925cfbc87f27e604bf0bb5b40dc2dcb | lazerhawk/ngraph | /src/ngraph/runtime/cpu/builder/quantized_matmul.cpp | C++ | cpp | 5,063 | permissive | //*****************************************************************************
// Copyright 2017-2019 Intel Corporation
//
// 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://w... |
5d9dc2057810e4087682e5f4fc26c133be5d07eb | 126266ff7e21332723abc2fa655edabead8717f8 | eliudrojas/GastroManager | /Desktop/src/nodes/cLevelNode.cpp | C++ | cpp | 402 | no_license | #include "cLevelNode.hpp"
std::weak_ptr<cLevelNode> g_activeLevel;
cLevelNode::cLevelNode()
{
}
cLevelNode::~cLevelNode()
{
}
void cLevelNode::OnNodeActivated()
{
auto tn = m_this.lock();
if(tn)
g_activeLevel = std::dynamic_pointer_cast<cLevelNode>(tn);
std::string value;
std::string name ... |
d4fce87309f9fdf9a28017ff073d93111bc0a2a1 | eb017437a5f92a34aad0e7d410e56d07ddb1b833 | jtg-gg/chromium.src | /ash/display/window_tree_host_manager_unittest.cc | C++ | cc | 59,647 | 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 "ash/display/window_tree_host_manager.h"
#include "ash/ash_switches.h"
#include "ash/display/display_info.h"
#include "ash/display/display_l... |
5f95409dfcc823dc574e9ff1e67032833ac0be74 | 1c29d199596bac21387a1a59bb19bf821fb208b5 | microsoft/PowerToys | /src/modules/powerrename/lib/PowerRenameMRU.cpp | C++ | cpp | 2,375 | permissive | #include "pch.h"
#include "PowerRenameMRU.h"
#include "Settings.h"
namespace
{
const wchar_t c_searchMRUListFilePath[] = L"\\search-mru.json";
const wchar_t c_replaceMRUListFilePath[] = L"\\replace-mru.json";
const wchar_t c_mruSearchRegPath[] = L"\\SearchMRU";
const wchar_t c_mruReplaceRegPath[] = L"... |
ed262d4e5a0b80260df6756e7553dd0ba55aa4be | 7211b3275392306ccc00853ce5d9c53c24b4c6a4 | merlinzone/nscale | /src/segment/test/src/imreconOptimizeProfiler.cpp | C++ | cpp | 4,086 | no_license | /*
* test.cpp
*
* Created on: Jun 28, 2011
* Author: tcpan
*/
#include "opencv2/opencv.hpp"
#include <iostream>
#ifdef _MSC_VER
#include "direntWin.h"
#else
#include <dirent.h>
#endif
#include <vector>
#include <errno.h>
#include <time.h>
#include "MorphologicOperations.h"
#include "Logger.h"
#include <stdio... |
20c2765cbf0b21c32e9fe7c5e597c85e637fec66 | 365153f0d9f635ed96e06d0940db52d042138dab | ruben3452/programacion-2 | /ejercicios/sumax.cpp | C++ | cpp | 283 | no_license | #include<stdio.h>
#include<iostream>
int main(){
int i,n,suma=0;
for(n=0;n<=1;n++){
suma=n+suma ;
}
i=1;
for(n=0;n<=1;n++){
suma2=n+suma ;
}
printf("%d",suma);
printf("%d",suma2);
system("pause");
return 0;
}
|
ddb8b12e9f5314f82d7837030a2714af40ce3aa0 | df24cbee05d9084723bda9979c9046f38ce8b11b | Azurelol/GameEngineArchitectureSamples | /SampleFileSystem/SampleFileSystem/FileSystem_Directory.cpp | C++ | cpp | 2,908 | no_license | /*!****************************************************************************\
@file FileSystem_Directory.cpp
@author Christian Sagel
@date 5/29/2016
@brief Provides facilities for performing operations on file systems and their
components, such as paths, regular files, and directories.
@note References:
http:... |
bf68f2d5aa408d090ab6b5e59c323e5f3396913a | dd7ebe797b9125db4b6639e0cd2492034928dc68 | coinstew/the420coin | /src/wallet/walletdb.cpp | C++ | cpp | 39,717 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 The Bitcoin Core developers
// Copyright (c) 2014-2017 The Dash Core developers
// Copyright (c) 2018 The The420Coin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/lic... |
30ad6d841bfaaa3eec1371f82cca6bfc42d086cb | 62607c453790fc2902c962543f6f54e5f5e42c53 | RhysMacRaild/ChessAI | /NonCuda/NonCuda/kernel.cpp | C++ | cpp | 1,360 | no_license | #include <stdio.h>
#include <stdlib.h>
#include "board.h";
#include "fullyConnectedLayer.h";
#include "neuralNetwork.h";
#include "matrix.h";
#include "swishActivation.h"
int main()
{
Board* board = new Board();
board->getMoves(true);
board->printAllPossibleBoards();
//test->printLayerBias(0);
//... |
ab13dd958754b0f294948739ec8cc675bb17b39b | b89a98d5baf100b11cf078b21c56f6f3714c925d | mateog4712/NussinovDM | /.history/recursion_20200312235549.cpp | C++ | cpp | 1,022 | no_license | #include "recursion.hpp"
#include "baseline.hpp"
#include <vector>
#include <string>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
uint16_t nussinovRecursion(std::string & sequence, int i, int j,uint16_t score)
{
//cout << i << " " << j << endl;
//if(j==-1){
// j = ... |
2f22fbb343357072e85ae14a8dc6473ae6936ea8 | a579d6a61fdd856b3d9e2e6297372acf5efb1065 | mmaximiliano/algo2-projects-1-2-3 | /alumnos/tests/test_programa.cpp | C++ | cpp | 2,279 | no_license | #include "gtest/gtest.h"
#include "../src/Programa.h"
TEST(test_programa, programa_vacio) {
Programa p = Programa();
list<rutina> vacio;
ASSERT_EQ(p.rutinas(), vacio);
ASSERT_EQ(p.rutinas().size(), 0);
}
TEST(test_programa, programa_1rut) {
Programa p = Programa();
Instruccio... |
243a1ec8cc5af973009f656ba68a292b51e0ccf8 | d3b76fa011742b35d75c3d58ebb2532c9dc80a48 | yamaguchi-am/choreonoid | /src/Body/VRMLBodyLoader.cpp | C++ | cpp | 40,077 | permissive | /**
\file
\author Shin'ichiro Nakaoka
*/
#include "VRMLBodyLoader.h"
#include "Body.h"
#include "ForceSensor.h"
#include "RateGyroSensor.h"
#include "AccelerationSensor.h"
#include "Camera.h"
#include "RangeCamera.h"
#include "RangeSensor.h"
#include "PointLight.h"
#include "SpotLight.h"
#include <cnoid/Exceptio... |
8a94e0a40b685455a98d477bef7543a97c267c66 | e7edc275bc96eef08ba9e8ec137cd1322dbc53c4 | imgag/ngs-bits | /src/NGSDInit/main.cpp | C++ | cpp | 1,187 | permissive | #include "ToolBase.h"
#include "NGSD.h"
#include "Exceptions.h"
class ConcreteTool
: public ToolBase
{
Q_OBJECT
public:
ConcreteTool(int& argc, char *argv[])
: ToolBase(argc, argv)
{
}
virtual void setup()
{
setDescription("Sets up the NDSD database (creates tables and adds minimal data).");
//optional... |
0ce055f5158e46f0f58f115ab2cd9898b8208a75 | f9269c97225680c946c193857e09460825513146 | alinous-core/codablecash | /src_test/smartcontract_db/ddl/table_ddl/test_undo_create_table.cpp | C++ | cpp | 2,406 | permissive | /*
* test_undo_create_table.cpp
*
* Created on: 2023/07/08
* Author: iizuka
*/
#include "test_utils/t_macros.h"
#include "engine/CodableDatabase.h"
#include "trx/transaction/CdbTransaction.h"
#include "trx/transaction_log/CreateTableLog.h"
#include "schema_table/table/CdbTable.h"
#include "schema_table/... |
01aea73c222cb0e58f0a51bfd70208c022358e44 | b64e19a86ae493e2092eda6955598efe0e9619a3 | 3brahimi/MCheck | /src/formula_ast.hh | C++ | hh | 7,230 | permissive | /*
* Copyright (c) 2016, Niklas Gürtler
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the
* following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of conditio... |
a49de3995996fe52418782c603b72bc917b55fc3 | eadf1ccbc9482b104380934fd02f0e35ab3fae5f | utkarsht/SPOJ-problems | /YELBRICK.cpp | C++ | cpp | 591 | no_license | #include<stdio.h>
#define scanint(x) scanf("%lld",&x)
long long gcd(long long a, long long b)
{
if (b==0)
return a;
else
return gcd(b,a%b);
}
int main()
{
long long i,n;
while(1)
{
long long sum=0;
scanint(n);
if(n==0) break;
long long save=0;
long long a[n],b[n],c[n];
for(i=0;i<n;i++)
{
s... |
bee57cde7e29b4150a7b0acaa6fa50897bdf38f8 | 5d3a6644e2151a3b54c202d083cf4e4ebc81f633 | HESHyyr/BreakoutGame | /BreakOutGame/Engine/Component/Physics/GameCollider.cpp | C++ | cpp | 4,250 | no_license | #include "GameCollider.h"
GameCollider::GameCollider(GameComponent& gameEntity, unordered_set<GameCollider*> &mainColliderList, ColliderType type, bool isStatic, bool isPhysical)
:GameComponent::GameComponent(gameEntity), colliderList(mainColliderList), myType(type), isStatic(isStatic), isPhysical(isPhysical)
{
coll... |
02fcf4a82c8834ea4e0ab2fc54521663dc7f86cd | 171f42cc02995f9052551e5af9ff5ce3710fbf4a | verzhak/pattern_recognition_guide | /src/pattern_recognition/unsupervised/unsupervised.hpp | C++ | hpp | 202 | no_license |
#ifndef UNSUPERVISED_HPP
#define UNSUPERVISED_HPP
extern const unsigned lwh, mult_lwh, height, width, ab_num[7];
extern const string ab_name[7];
int gen(unsigned ab);
int eval(unsigned ab);
#endif
|
b2babedb6a593646e7fdc645884b45ceda836522 | 86f8658c941ce7e7926a735397dff16774968349 | alandefreitas/matplotplusplus | /examples/surfaces/ribbon/ribbon_1.cpp | C++ | cpp | 226 | permissive | #include <cmath>
#include <matplot/matplot.h>
int main() {
using namespace matplot;
auto [X, Y] = meshgrid(iota(-3, .5, 3), iota(-3, .1, 3));
auto Z = peaks(X, Y);
ribbon(X, Y, Z);
show();
return 0;
} |
c737d0e499a5c3d098bd436159769aa09b25fafd | b689bcfa6849738980cff1e161c2045d72d5c1c3 | GKerfImf/homework | /6/C++_Course/week 1/task_1.cpp | C++ | cpp | 261 | no_license | #include<cmath>
#include<iostream>
long double sum(int n) {
long double result = 0;
for (int i = 0; i <= n; ++i) {
result += 1.0 / pow(2 * i + 1, 3);
}
return result;
}
int main() {
int n;
std::cin >> n;
std::cout << sum(n) << std::endl;
return 0;
} |
c3db2c5457aa8a1c75ee54ee2d87d7fcc62d8048 | 73760721605a91c558cb825cb535e620b7add7a4 | xtblock/chromium | /chrome/browser/ash/remote_apps/remote_apps_model_unittest.cc | C++ | cc | 4,917 | permissive | // Copyright 2020 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/browser/ash/remote_apps/remote_apps_model.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace ash {
namespace {
constexpr cha... |
118e5f7374c48b3a74b4e0381d5a319e236912a4 | 98a9cfdb0ff698e59c781a546a32fbea543f04ec | nhhollander/silhouette_old4 | /include/se/graphics/shader.hpp | C++ | hpp | 6,396 | permissive | /*!
* @file include/se/graphics/shader.hpp
*
* Copyright 2019 Nicholas Hollander <nhhollander@wpi.edu>
*
* Licensed under the MIT license (see LICENSE for the complete text)
*/
#ifndef _SE_GRAPHICS_SHADER_H_
#define _SE_GRAPHICS_SHADER_H_
#define SE_SHADER_LOC_IN_MVP 1
#define SE_SHADER_LOC_IN_MODEL... |
03c91a60577a880ebfd91324a55f07f402b60fa3 | b56175788f2a2c27ad7fc22aa681fd317f1e0ca7 | opencv/opencv | /modules/gapi/include/opencv2/gapi/gtype_traits.hpp | C++ | hpp | 11,106 | permissive | // This file is part of OpenCV project.
// It is subject to the license terms in the LICENSE file found in the top-level directory
// of this distribution and at http://opencv.org/license.html.
//
// Copyright (C) 2018-2020 Intel Corporation
#ifndef OPENCV_GAPI_GTYPE_TRAITS_HPP
#define OPENCV_GAPI_GTYPE_TRAITS_HPP
#... |
28b311a49d0c2d42fe2ee1e4d4a6c419ff880fcd | 50a18d3e994bda45c79131bf84f79c7bb74fb339 | yakalelo/rfid | /src/RFID_Utils.cpp | C++ | cpp | 21,579 | permissive | #include "RFID_Utils.h"
/*
* A0 A1 A2 A3 A4 A5
*/
void dump_byte_array(byte *buffer, byte bufferSize) {
for (byte i = 0; i < bufferSize; i++) {
Serial.print(buffer[i] < 0x10 ? " 0" : " ");
Serial.print(buffer[i], HEX);
}
} // End dump_byte_array()
/*
* FFFFFFFFFFFF
*/
void dump_byte_arra... |
24e4efa24892b0550e64ab5fa7d007cedb0a2432 | d2b73e41165bf581c125d1e69667c1a90b1bea58 | kieszkowska/kosci | /clickable.cpp | C++ | cpp | 228 | no_license | #include "clickable.h"
bool Clickable::checkBounds(int x, int y)
{
if (this->pos.x < x && this->pos.x + this->pos.w > x && this->pos.y < y && this->pos.y + this->pos.h > y) {
return true;
}
return false;
}
|
1852495385d80c3fde4239a66c959a0eacd906d7 | d1300d0f64629659be9efdd7297a4f164100f6a3 | namgonkim/DS_Algorithms | /프로그래머스/programmers_주식가격/main.cpp | C++ | cpp | 586 | no_license | #include <string>
#include <vector>
#include <queue>
using namespace std;
vector<int> solution(vector<int> prices) {
vector<int> answer;
queue<int> q;
for (int i = 0; i < prices.size(); i++) {
q.push(prices[i]);
}
int cnt = 0;
int i = 0;
while (!q.empty()) {
for (int j = i ... |
09a10b04baf23c358abd7f4aa342b8ca4d990930 | a65af2aa3d58c06404d1c95dc741215f78189c05 | mostafa901/rbfx | /Source/Urho3D/IO/Serializer.cpp | C++ | cpp | 11,123 | permissive | //
// Copyright (c) 2008-2019 the Urho3D project.
//
// 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, modify, m... |
cc26053928e4a0434a9f0304e41a5ae623f4d62b | adb9f8ceb14582e004690d67e05963351c0e1b56 | BawornsakS/XPrize | /HardwareArchitecture/Firmware_embeded/ver_7-8-20/sub_Pose/lib/headIK_rotm/headIK_rotm.cpp | C++ | cpp | 5,939 | no_license | //
// Academic License - for use in teaching, academic research, and meeting
// course requirements at degree granting institutions only. Not for
// government, commercial, or other organizational use.
// File: headIK_rotm.cpp
//
// MATLAB Coder version : 5.0
// C/C++ source code generated on : 23-Jul-2020... |
9b99c596b911985aeaa3091bc5fcef0330a81e1b | 2a13fec9598b2468db07d6b867214f966f01aecc | shivam1808/CodeChef | /vec.cc | C++ | cc | 1,545 | no_license | // { Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
void add_pair(vector<pair<pair<int,int>, string > > &A,string str,int x,int y);
int get_size(vector<pair<string,pair<int,int> > > &A);
void print_values(vector<pair<string,pair<int,int> > > &A);
void sort_pair(vector<pair<string,pair<int,int> > > &A... |
50fa3a0097dd07a127d4c7df582e6685842c2631 | 1242115d527b069e1dac8bf0922d4ae0603e6602 | TheDunco/CS112Work | /proj08/ArrayQueueTester.cpp | C++ | cpp | 19,468 | no_license | /* QueueTester.cpp defines the test-methods for class Queue.
* Joel Adams, for CS 112 at Calvin College.
*/
#include "ArrayQueueTester.h"
#include <iostream>
using namespace std;
void ArrayQueueTester::runTests() {
cout << "Testing class ArrayQueue..." << endl;
testConstructor();
testAppend();
testRemove();
t... |
46044b819746505788c30e682d27fd94fe5f8d55 | 1287a1abd67cc225e3a0d4b0afdcd93c3fed1a1a | jkadamczyk/AGH_JIMP2 | /lab11/sum/main.cpp | C++ | cpp | 472 | no_license | //
// Created by Tay on 5/23/2017.
//
#include <iostream>
#include <complex>
#include "Sum.h"
// przeniosłem template tutaj z powodu błędu "relocation truncated to fit"
template<typename T>
T Sum( const T &left, const T &right) {
return left + right;
}
int main() {
std::cout << Sum(2.1,3.2) << std::endl;
... |
a5479ec09210f36208e358b2f01237f78eceb36e | 2718d6f639f3fddc97900f94294be07f44ec0473 | adshidtadka/algorithm | /atcoder/abc/167/a.cpp | C++ | cpp | 374 | no_license | #include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
string s;
string t;
int main() {
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
if (s[i] != t[i]) {
cout << "No" << endl;
return 0;
... |
c4f3268a4bffaaeb04db50a3a6dbe9bf8ed7ea4e | 5cbd043ab0ffbe630e159f47bc1f8600d4d62137 | BGCX067/fallout-equestria-git | /code/game/include/ui/ui_barter.hpp | C++ | hpp | 1,276 | no_license | #ifndef UI_BARTER_HPP
# define UI_BARTER_HPP
# include "globals.hpp"
# include "inventory_ui.hpp"
# include "ui_object_quantity_picker.hpp"
# include "cmap/statcontroller.hpp"
class UiBarter : public UiBase, public InventoryViewController
{
public:
UiBarter(WindowFramework* window, Rocket::Core::Context* context, ... |
e157d3a90e22a0c751c3332a9524fce822d285f1 | a308e016431d36cc703105269e4a1a086c001811 | marcciosilva/P4-Tarea6 | /DTSucursal.cpp | C++ | cpp | 835 | no_license | /*******************************************************************************
* Programación 4 - Laboratorio 6 - Año 2015
*
* Profesor: Pablo Milanese
* Grupo: 17
* Integrantes: Juan Pablo Copello - jpcopel@gmail.com
* Gastón Haro - harogaston@gmail.com
* Sofia Honty - sofisho@gmail.com
* Marccio Si... |
052062c2a01675f982a745fbb1bb5644d1a67b97 | 1e01aff7918dd52da14d6114dbf9bc135e3ff8a3 | bmountjoy/LMTools | /include/laslib/inc/lasreader_las.hpp | C++ | hpp | 3,056 | no_license | /*
===============================================================================
FILE: lasreader_las.hpp
CONTENTS:
Reads LIDAR points from the LAS format (Version 1.x , April 29, 2008).
PROGRAMMERS:
martin.isenburg@gmail.com
COPYRIGHT:
(c) 2007-2011, Martin Isenburg, LASSO - tool... |
574a50d2678def637de0209648ef00cee29d4a36 | b8a9feb4ff698d8b99e2e5fb21fa4104e001b82b | dquordle/cpp | /cpp03/ex01/ScavTrap.cpp | C++ | cpp | 1,085 | no_license | #include "ScavTrap.hpp"
#include "../ex03/ScavTrap.hpp"
ScavTrap::ScavTrap() {}
ScavTrap::ScavTrap(std::string name) : ClapTrap(name)
{
std::cout << "ScavTrap constructor called" << std::endl;
hitPoints = 100;
energyPoints = 50;
attackDamage = 20;
}
ScavTrap::~ScavTrap()
{
std::cout << "ScavTrap destructor ca... |
bcc06cb4dca91a825f92a0e2b97f0acdf6424443 | 5320ba8d82faa3967f468ed46ddda4b379571dcc | hazarartuner/opengl-demos | /OpenGL Demos/main.cpp | C++ | cpp | 1,692 | no_license | //
// main.cpp
// OpenGL Demos
//
// Created by Mehmet Hazar Artuner on 20.04.2020.
// Copyright © 2020 Mehmet Hazar Artuner. All rights reserved.
//
#include <iostream>
#ifdef __APPLE__
#define GL_SILENCE_DEPRECATION
#define GL_GLEXT_PROTOTYPES 1
#include <OpenGL/gl3.h>
#else
#define GLEW_STATIC
... |
a21e27d15a9d75546a37eafae5a45bf13a678cc4 | 63752c728a9583c18d7aa8a8f65857708943ca3e | sahashoo/Daily | /Code/165e.cpp | C++ | cpp | 705 | no_license | #include<bits/stdc++.h>
using namespace std;
const int MAXN=8e6+7;
const int lg=23;
int a[MAXN],dp[MAXN];
int32_t main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
memset(dp,-1,sizeof dp);
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
dp[a[i]]=a[i];
}
vector<int>vec[l... |
bbe3492a7f78cd450809483019141f93cc79e908 | f2f23c545733705e61da5fdc4291fdb19132ba98 | sswires/ham-and-jam | /dlls/hl2_dll/npc_combines.cpp | C++ | cpp | 10,555 | permissive | //========= Copyright © 1996-2005, Valve Corporation, All rights reserved. ============//
//
// Purpose: This is the soldier version of the combine, analogous to the HL1 grunt.
//
//=============================================================================//
#include "cbase.h"
#include "ai_hull.h"
#include "ai_moto... |
62611e0bba239a836184fb807638071038d7018e | f732bd16abf3d95a97d29c5bc028bc526bbec6b0 | biddisco/DCA | /include/dca/phys/domains/time_and_frequency/vertex_frequency_domain.hpp | C++ | hpp | 7,641 | permissive | // Copyright (C) 2018 ETH Zurich
// Copyright (C) 2018 UT-Battelle, LLC
// All rights reserved.
//
// See LICENSE for terms of usage.
// See CITATION.md for citation guidelines, if DCA++ is used for scientific publications.
//
// Author: Peter Staar (taa@zurich.ibm.com)
//
// This class implements various types and ord... |
08f9096975c87cb4669e0ad0599867c496c0c1a6 | 0ecb4f99ef4a8e2e603744cac378e6389131d7d4 | ZxMYS/Xiaos-ACM-Solution-Set | /09.04.11 - ICPC ACM World Final 2000/F-soyabean.cpp | C++ | cpp | 1,818 | permissive | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... |
afb996fe2dd38031062f4464de81c09cea8489c3 | 86e6e04d0b93ded39ba7a5d40198ab87a687163d | alexwoo1900/ModernOpenGLTutorials | /Modern_OpenGL_Tutorials/tutorial45/src/tutorial45.cpp | C++ | cpp | 8,169 | no_license | /*
Copyright 2015 Etay Meiri
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 version 3 of the License, or
(at your option) any later version.
This program is distributed... |
688ce4066630dea5b61a16427491cc9295d9d4a3 | 70b28a6cc99b948d672fa54b03a8bc1e2ba7c10c | Jonathan2251/lbd | /lbdex/input/ch4_2_logic.cpp | C++ | cpp | 901 | no_license | // clang -target mips-unknown-linux-gnu -c ch4_2_logic.cpp -emit-llvm -o ch4_2_logic.bc
// ~/llvm/test/build/bin/llc -march=cpu0 -mcpu=cpu032I -relocation-model=pic -filetype=asm ch4_2_logic.bc -o -
// ~/llvm/test/build/bin/llc -march=cpu0 -mcpu=cpu032II -relocation-model=pic -filetype=asm ch4_2_logic.bc -o -
/// sta... |
b726668126a7c9ded19a503eb20decae25d5a057 | 2ddf3997a8325097e50c405e5c5698241510fedc | alichnewsky/google-cloud-cpp | /generator/internal/codegen_utils.cc | C++ | cc | 9,429 | permissive | // Copyright 2020 Google LLC
//
// 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
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in... |
5c0f4e8398750f1cb16d449d3f8f6563b036456f | dc1b67e9169831c66764ebf917bc00b7d89bee9c | maamari/IntroductoryCpp | /blackjack/diceplot.cpp | C++ | cpp | 686 | no_license | #include <iostream>
#include <cmath>
#include <time.h>
#include <cstdlib>
using namespace std;
int roll();
void printHistogram(int testCounts[]);
int main(){
srand(time(NULL));
int testCounts[25];
for(int i = 4; i < 25; i++){
testCounts[i] = 0;
}
cout << "Enter a value: ";
int n;
cin >> n;
whil... |
50826fd79b2d9b4d83018f5af4519762efb73224 | c02101325fbc6b0ba09f9c8b8f2c8e614c9d1e7c | PulockDas/Competitive-Programming-Algorithms | /Competitive Programming/Double Ended Queue lightoj.cpp | C++ | cpp | 1,892 | no_license | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pi 2*acos(0.0)
#define mod 1000000007
#define loop(i, n) for(ll i=1; i<=n; i++)
typedef pair<ll, ll> pll;
void solve(ll test){
cout << "Case "<<test<<":\n";
ll n, m;
cin >> n >> m;
vector <ll> vec(1001);
... |
d016166e72a78741deeb2137590d857266b96c41 | d637577ba6c00a85bc7c46fc96de8fb8c85e3007 | bju2000/android_hardware_intel | /libmedia_utils/ISV/base/isv_bufmanager.cpp | C++ | cpp | 6,480 | no_license | /*
* Copyright (C) 2012 Intel Corporation. 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 requir... |
f304c9c2485edacefdf1db331a3e782486986f8c | d33f14f7409db8dcc8fb5899282bb934752ddffa | weiii17/wei | /1.cpp | C++ | cpp | 553 | no_license | #include <iostream>
#include <cstdlib>
using namespace std;
class Myclass
{
private:
int number;
int payment;
public:
Myclass();
Myclass (int h,int m)
{
number = h;
payment = m;
};
void print_data()
{
cout<<number<<endl;
cout<<payment<<end... |
4747f6ba8d13098699d54dd763020872c4812923 | d36989d864acb38a8347764ddfebbbfcf5ecc4c9 | jhkoivis/lumikki | /devices/oop_devices/lumikki-devices-code-0-19-trunk/ir/FSViewerCleanup/FSViewer/FSViewerView.cpp | C++ | cpp | 18,613 | no_license | // FSViewerView.cpp : implementation of the CFSViewerView class
//
#include "stdafx.h"
#include "FSViewer.h"
#include "camera.h"
#include "FSViewerDoc.h"
#include "FSViewerView.h"
#include "message.h"
#include <time.h>
#include <comdef.h>
#include <string>
#include <iostream>
#ifdef _DEBUG
#define new DEBUG_NEW
#en... |
87384631a36063ba32c287555723ce745a82d069 | 2f4a3d8a64b4d3904998ee4eb2125996e4b47db9 | Mortesins/BlackjackStrategySimulator | /Strategy/StrategyMultiplier.hpp | C++ | hpp | 895 | no_license | #ifndef STRATEGY_MULTIPLIER_HPP
#define STRATEGY_MULTIPLIER_HPP
#include <vector>
#include "Strategy.hpp"
/**********************************************************************************************************************
* StrategyMultiplier derives from Strategy and implements getBet, where the bets increase ... |
b65040f7b1c1db273a17fbbea1da431ccfcd8ee6 | 6068b672187d6e81638e2701830cb775d9e581d2 | Jongsix/tSIP | /tSIP/scripting/ScriptExec.cpp | C++ | cpp | 39,340 | permissive | //---------------------------------------------------------------------------
#include <vcl.h>
#pragma hdrstop
#include "ScriptExec.h"
#include "Log.h"
#include "LuaState.h"
#include "lua.hpp"
#include "AudioDevicesList.h"
#include "Paths.h"
#include "common/Utils.h"
#include "ButtonConf.h"
#include "Cal... |
e7a970d2c702070a83bbb094825591994e15cd7d | 9f548c47263793f9f29b8cf63ad33fd26fae705a | Doarakko/algorithm | /mathematics/all_divisors_listed.cpp | C++ | cpp | 416 | permissive | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int x;
cin >> x;
vector<int> v;
for (int i = 1; i <= sqrt(x); i++)
{
if (x % i == 0)
{
v.push_back(i);
if (i * i != x)
{
v.push_back(x / i);
}
... |
5f28d110e413e06bfcdc5b5498cf1feb8f4f6676 | e0d136def8060d3957fcddab1420f26986f1fd2f | z0CoolCS/CompetitiveProgramming | /Codeforces/1148B-BornThisWay.cpp | C++ | cpp | 725 | no_license | #include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;i++)
int binary_search(int* a,int l, int r,int val){
while(l<r){
int med=l+(r-l)/2;
if(a[med]>=val)
r=med;
else
l=med+1;
}
return l;
}
int main(){
int n,m,ta,tb,k;
cin>>n>>m>>ta>>tb>>k;
int a[n],b[m... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.