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 |
|---|---|---|---|---|---|---|---|---|
cdb11a6001661da42f9c05906c2417c420a8413a | 64da54d62c68f3d4f5ee06a95c8f91e171dcf35b | younkyounghwan/cpp_in_lecture | /cpp 8.1/cpp 8.1/object oriented programming.cpp | C++ | cpp | 1,371 | no_license | #include <iostream>
#include <string>
#include <vector>
using namespace std;
// object
//Friend : name, address, age, height, weight, ...
// print()
class Friend
{
public: // access specifier (public, private, protected)
string name;
string address;
int age;
double height;
double weight;
void print() // str... |
dcb39aec6cd0b7090a2823bee5bea8ac35251584 | 910e555a5ef3794764383cd74a39a0fa745189c2 | colpodigenio/FPS-prototype | /Source/FPS/RocketProjectile.cpp | C++ | cpp | 1,324 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "RocketProjectile.h"
#include "FPSCharacter.h"
#include "PhysicalMaterials/PhysicalMaterial.h"
#include "WorldCollision.h"
#include "FPS.h"
#include "Components/CapsuleComponent.h"
#include "Kismet/GameplayStatics.h"
void ARocket... |
5be35195da65979c086843af8a4d20cb446ef986 | 8104813fd0531b88d1da7d5f1f1d3ec2558a0f72 | GoogleCloudPlatform/cloud-debug-java | /third_party/antlr/lib/cpp/src/Token.cpp | C++ | cpp | 1,295 | permissive | /* ANTLR Translator Generator
* Project led by Terence Parr at http://www.jGuru.com
* Software rights: http://www.antlr.org/license.html
*
* $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/Token.cpp#2 $
*/
#include "antlr/Token.hpp"
#include "antlr/String.hpp"
#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
name... |
d926b8fa13778519fbcbe85814eb534645d3a9c5 | 76eeed494d6915f4b146f8957b209adfa1cf3cf3 | Aavu/SantoorBot | /SantoorBot/src/main.cpp | C++ | cpp | 518 | no_license | #include <iostream>
#include "SantoorBot.h"
#include "ErrorDef.h"
//std::atomic<bool> exiting = false;
//
//void sigint_f(int) {
// if (exiting) {
// exit(1);
// }
// exiting = true;
// INFO("SIGINT received. Closing.");
//
//}
int main(int argc, char* argv[]) {
SantoorBot bot(MIDI_CHANNEL);
... |
43ce0ec7715125bd0de62c625ec03d4399853dfb | 77bd0f0915ad02fded5785145a0ec70215ed9f5b | yangchenglin815/kmis | /src/OrderGoods/OrderCategorySmallListView.cpp | C++ | cpp | 5,018 | no_license | #include "OrderCategorySmallListView.h"
#include <QPainter>
#include <QMouseEvent>
enum orderCategoryType
{
e_orderSmallCategoryInfo
};
OrderCategorySmallDelegate::OrderCategorySmallDelegate(QWidget *parent)
: QStyledItemDelegate(parent)
{
}
void OrderCategorySmallDelegate::paint(QPainter *painter, const QS... |
3c9d9cf109a41bc3b76cc29c32a1dc923b463162 | 267626646342b411d7b6a56bb847029c97dc2541 | diz-vara/ActiveD | /ColorsPage.cpp | C++ | cpp | 5,790 | no_license | //created 050502 0045
#include "StdAfx.h"
#include ".\colorspage.h"
#include "ActD.h"
CColorsPage::CColorsPage(void) : CSettings(_Settings)
{
m_psp.dwFlags |= PSP_HASHELP;
}
CColorsPage::~CColorsPage(void)
{
}
LRESULT CColorsPage::OnInitDialog(UINT /*uMsg*/, WPARAM /*wParam*/, LPARAM /*lParam*/, BOOL& /*bHandle... |
a278a602fc2b4812626c6fb415dc84adda024a01 | 69bd3388a025c27c24e1edcb38112aa082e3f773 | StevenGilford/IntroToCpp | /Morninjg Gist Zombie Fightclub/Source.cpp | C++ | cpp | 509 | no_license | #include <iostream>
#include "Header.h"
Zombie::Zombie()
{
int mHealth = 100;
int mAttackPower = 100;
}
Zombie::Zombie()
{
}
Zombie::Zombie(int hp, int atk)
{
mHealth = hp;
mAttackPower = atk;
}
int Zombie::GetHealth()
{
return mHealth;
}
int Zombie::GetAttack()
{
return mAttackPower;
}
voi... |
8be6c1b235c0dc275733a6c7917dc6817e274381 | 987f16addb2dbfff4745cc2e0a161f0727458610 | hanrick2000/leetCode-5 | /algorithm/ford.2.cpp | C++ | cpp | 1,506 | no_license | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
void shortest(vector<vector<int>> &map, int i, int j, int step, int distance, int &curmin)
{
if(step == 1)
{
distance += map[i][j];
if(distance < curmin)
{
curmin = distance;
... |
b7b0e4424ea2f3a8061357028b6064b0d957b8e4 | fb47cd91a1c6c0e52011d52a363c537bdea208bd | pengumc/Pengu_Q-1 | /quadruped/src/quadruped.cpp | C++ | cpp | 15,799 | no_license | /**
* @file quadruped.cpp
* main file
*/
#include "include/quadruped.h"
namespace Q1 {
// --------------------------------------------------------Constructor Quadruped
/** @brief Constructor*/
Quadruped::Quadruped() {
for (uint8_t i = 0; i< kLegCount; ++i) {
legs_[i] = new Leg(i, &H_cob_);
}
sgg_.SetCoMP... |
d2b6e9f2d404bbbb9f9f8768e809557c99bd572b | 80adfd12ef85c0c55856cd14dbad06f7483d192e | tylerac7622/ReEngineApp_2016s | /Ex01_A/AppClass.cpp | C++ | cpp | 1,551 | no_license | #include "AppClass.h"
void AppClass::Update(void)
{
#pragma region DOES NOT NEED CHANGES
//Update the system's time
m_pSystem->UpdateTime();
//Update the mesh manager's time without updating for collision detection
m_pMeshMngr->Update();
static float fTimer = 0.0f;//creates a timer
static uint uClock = m_pSystem... |
e21d9fc45dd78eea72fa4ca152ce6011c78fa80b | fc39f6b894b5cee3cf40bfb85d6381d0d356c2db | dmitigr/pgfe | /test/pgfe/pgfe-unit-connection-rows.cpp | C++ | cpp | 3,478 | permissive | // -*- C++ -*-
//
// Copyright 2022 Dmitry Igrishin
//
// 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 applicabl... |
16ab97618c24e8c879df39d76a40cc4436da35e1 | 043b6c69af6ab810205d31a5b0fff22b93cfea6d | sanbee/parafeed | /code/cldbggetNIVal.cc | C++ | cc | 1,998 | no_license | /*
* Copyright (c) 2000-2012, 2013 S. Bhatnagar (bhatnagar dot sanjay at gmail dot com)
*
* 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 2 of the License, or
* (at your opt... |
c9912cb3c93013e19940e2973e8d039dff289bee | dd67da94ee88aed5af8b264e25b34e1f3274a707 | habara-k/ICPCLibrary | /lib/others/fixpoint.cpp | C++ | cpp | 1,999 | no_license | // ラムダ再帰
// ↓の3つ目
// http://koturn.hatenablog.com/entry/2018/06/10/060000
template <typename F>
class
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
FixPoint final : private F
{
public:
template <typename G>
... |
5a9b0c02224c460b186e394c6eab4ff8cc4f7ea3 | 75207f5ffa6874f91dda2148a7bb7ea0c57e9802 | mewbak/mipt-mips | /simulator/infra/config/t/unit_test.cpp | C++ | cpp | 10,754 | permissive | /**
* Unit tests for configuration parser
* @author Denis Los
*/
#include <catch.hpp>
#include <infra/argv.h>
#include <infra/config/config.h>
#include <infra/config/main_wrapper.h>
#include <infra/log.h>
#include <infra/macro.h>
#include <sstream>
namespace config {
AliasedRequiredValue<std::string> string_... |
a5f5d744990eeb03c3c3f0581fae537bf6554329 | 0d6835cacded73b810f34044d4227f793d7a17a8 | Turmo11/PlatformerGame | /Game/Source/Pathfinding.cpp | C++ | cpp | 8,922 | permissive | #include "Defs.h"
#include "Log.h"
#include "Application.h"
#include "Pathfinding.h"
//#include "External/BroFiler/Brofiler.h"
Pathfinding::Pathfinding() : Module(), map(NULL), lastPath(DEFAULT_PATH_LENGTH),width(0), height(0)
{
name.Create("pathfinding");
}
// Destructor
Pathfinding::~Pathfinding()
{
RELEASE_ARRAY... |
f5df3098657c013c4fb0036dbad9ebdb725724c9 | 4f1b513e40d0a1e76b3eee515a0f9b6034d35f3f | yodamaster/engine | /sky/engine/platform/geometry/TransformState.cpp | C++ | cpp | 7,677 | permissive | /*
* Copyright (C) 2011 Apple 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:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions ... |
e377b81112d13bfb04387af286b166f107c813b5 | 2615ac82e118934a6fa254cfc2c489dedd550da2 | kaiferrall/competitive-programming | /wrongsubtraction479/main.cpp | C++ | cpp | 210 | no_license | #include <iostream>
int main()
{
int n, k;
std::cin >> n >> k;
for (int i = 0; i < k; i++) {
n = n % 10 == 0 ? n/10 : n-1;
}
std::cout << n;
return 0;
}
|
3bd675306c5a32b2292c6711d95f41a0b922c287 | 8652cdb305675689d56440887b9c1e41876a53ea | android-dre/platform-system-native | /services/surfaceflinger/DisplayDevice.cpp | C++ | cpp | 20,912 | permissive | /*
* Copyright (C) 2007 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... |
207bccb093e52db9597d1dd3098799e82f0bde40 | 7225eceaf93ee03915c3e676bc70f426d2a3ef91 | RussellJerome/DeepRockGalacticSDK | /SDK/FSD_BP_GunnerCharacter_structs.hpp | C++ | hpp | 221 | no_license | #pragma once
// DeepRockGalactic SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "FSD_Basic.hpp"
#include "FSD_BP_PlayerCharacter_classes.hpp"
namespace SDK
{
}
#ifdef _MSC_VER
#pragma pack(pop)
#endif
|
a82e0f74725783f00bdf62c58cd4df632582ecf8 | f379a12ec4f8c9d000401b3b31eeb114c6fb65e3 | fishingstar/Catherine | /Src/RenderTargetManager.cpp | C++ | cpp | 1,350 | no_license | #include "RenderTargetManager.h"
#include "IDevice.h"
#include "IRenderTarget.h"
#include "DeviceConst.h"
#include <algorithm>
namespace Catherine
{
extern IDevice * g_Device;
RenderTargetManager * RenderTargetManager::Instance()
{
static RenderTargetManager s_instance;
return &s_instance;
}
IRenderTarget *... |
bc98567e48aac42288a608f11be6202d1a549e6b | 1b5af71997ceef44a5fb0388b00cc18c2ad1e480 | Ivanhan2018/MakeGUID | /gameserver_lic/INIFile.cpp | C++ | cpp | 3,093 | no_license | #include "StdAfx.h"
#include "INIFile.h"
//////////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////////
//CINIFile文件
CINIFile::CINIFile(CString FileName,int maxsize)
{
m_lpFileName=FileName;
m_mMaxSize = maxsize... |
62e782cf445177a8c53ca8377e6e05ee9b7d046c | c6a6d8bb3cbe3f5c03982b8880614a94821fb727 | zslwyuan/LLVM-9-for-Light-HLS | /LLVM_src/libcxx/test/std/numerics/complex.number/complex.transcendentals/asinh.pass.cpp | C++ | cpp | 4,263 | permissive | //===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
9503e69083bb6750f470df014d1fe0a2dda8df75 | 4736af5ec0937dab7fb4c94f6d228c2ef835cd5e | iontom/HeliumRain | /Source/HeliumRain/Data/FlareFactoryCatalog.cpp | C++ | cpp | 282 | permissive |
#include "../Flare.h"
#include "FlareFactoryCatalog.h"
/*----------------------------------------------------
Constructor
----------------------------------------------------*/
UFlareFactoryCatalog::UFlareFactoryCatalog(const class FObjectInitializer& PCIP)
: Super(PCIP)
{
}
|
a870fa45e902bedbb90c786b4e8c479fe826b049 | b529fe16ae7f1fcb6f68aa81a8f97655dc57794c | spitofland/KDIS | /KDIS/KDIS/PDU/Minefield/Minefield_Data_PDU.cpp | C++ | cpp | 28,654 | permissive | /*********************************************************************
Copyright 2013 Karl Jones
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 c... |
f3247001fba8986c67967748abc3199cc85c59f3 | c10142fa828a857af20418a572dd2a8ff0050cff | pbie42/cpp | /d05/ex03/Intern.cpp | C++ | cpp | 2,767 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Intern.cpp :+: :+: :+: ... |
40878d9735e3815c6521ce80af0faca91a1d7b1d | ed9f6cd0607faf66103d31b3b76fac0afb73d3b4 | EmadMustafa/psc | /src/include/psc.hxx | C++ | hxx | 28,662 | no_license |
#pragma once
#include <mrc_profile.h>
#include <psc_diag.h>
#include <particles.hxx>
#include "../libpsc/vpic/fields_item_vpic.hxx"
#include <checks.hxx>
#include <output_fields_c.hxx>
#include <output_particles.hxx>
#include <push_particles.hxx>
#include "checkpoint.hxx"
#ifdef USE_CUDA
#include "../libpsc/cuda/m... |
a353de5986f9cf34c5028bff5bff100cf5ef88b4 | bf72762b070828740e67eb6db1fdbc367c97c29f | Sitispeaks/turicreate | /src/external/boost/boost_1_68_0/libs/config/test/limits_test.cpp | C++ | cpp | 7,138 | permissive | /* boost limits_test.cpp test your <limits> file for important
*
* Copyright Jens Maurer 2000
* 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)
*
* $Id$
*/
#include <boost/limits.hpp>
#include <boost/detail... |
9d17dcfc9fae7e69e684a07f3eee75e75406e938 | d14d7f708f7481b5b888909107c1e1422531186b | ghsecuritylab/N14 | /components/asio/asio/asio/src/examples/cpp03/http/server4/request_parser.cpp | C++ | cpp | 5,733 | permissive | //
// request_parser.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)
//
#include "request_par... |
a88ccdf0c0baa074889ef5cc1793e748ea0b3864 | bd3894042c1b4b81de2bc1dae51b140746fd06a0 | Rhoana/blockbased_synapseaware | /skeletonize/cpp-refinement.cpp | C++ | cpp | 17,592 | permissive | #include "cpp-skeletonize.h"
#include "cpp-MinBinaryHeap.h"
// struct for Dijkstra's algorithm
struct DijkstraData {
long iv;
DijkstraData *prev;
float distance;
bool visited;
};
static int WriteTempPtsFile(FILE *fp, std::vector<long> &elements, long label)
{
WritePtsFileHeader(fp, 1);
//... |
d2e89b93e03c28c7feefa1fa5ed43d661b31d1cc | 40ac12b41b9c8e8f30b812c37a452a32fe403be2 | Megathirio/MCServer | /src/Bindings/ManualBindings.cpp | C++ | cpp | 102,155 | permissive |
#include "Globals.h" // NOTE: MSVC stupidness requires this to be the same across all modules
#include "ManualBindings.h"
#undef TOLUA_TEMPLATE_BIND
#include <sstream>
#include <iomanip>
#include "tolua++/include/tolua++.h"
#include "polarssl/md5.h"
#include "polarssl/sha1.h"
#include "PluginLua.h"
#include "PluginM... |
aa36aef8817d4cd08b874003775c3f11e7c2e5b9 | 374d5a6de739d6134fc02d3e44f5ea338785cc79 | ricortiz/IBAMR | /ibtk/src/utilities/CoarsenPatchStrategySet.cpp | C++ | cpp | 4,662 | no_license | // Filename: CoarsenPatchStrategySet.cpp
// Created on 11 Sep 2006 by Boyce Griffith
//
// Copyright (c) 2002-2014, Boyce Griffith
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Re... |
84273fb5a55e2126982b9411b23c6d8372fb6e84 | cb5f8b0ddb1b07e6e0d52b0394bdfe29260d52f4 | ledocc/gen_prog | /test/ref_ptr/common.hpp | C++ | hpp | 2,001 | permissive | ///////////////////////////////////////////////////////////////////////////////
/// \file test/ref_ptr/common.hpp
//
// Copyright 2013 David Callu. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifndef TEST__R... |
3d4ad75007e5d15731581e20c6ac188d769d201d | d0dd5d8c5186b697a9bb3fb5cb404822ec21a42c | jmosborne/Chaste | /heart/src/problem/ElectroMechanicsProblemDefinition.cpp | C++ | cpp | 8,133 | permissive | /*
Copyright (c) 2005-2021, University of Oxford.
All rights reserved.
University of Oxford means the Chancellor, Masters and Scholars of the
University of Oxford, having an administrative office at Wellington
Square, Oxford OX1 2JD, UK.
This file is part of Chaste.
Redistribution and use in source and binary forms... |
c90c35fc398a5fd1f345f2b70f8b4a21fccd1ca0 | bc0f1001ceb3200f884848b32ce55b980d5a36f2 | Micro-nam/Smart-Pixel | /lib/Effect_Functions.hpp | C++ | hpp | 3,958 | no_license | #pragma once
#include "LED/Effects.hpp"
#include "LED/RGB_Utils.hpp"
/*
Beispiel fuer eine Effect-Funktion(header)
RGB_Pixel_Colors& nameOfEffectFunction(RGB_Pixel_Colors& _pixelColors)
RGB_Pixel_Colors speichert fuer jede LED den Farbwert ab. Die Anzahl an leds kann in diesem Object ausgelesen werden - ... |
2aed7895f0d4e28ec5b3caef452804a8adcc5f2a | b7baaaed80faa963a436b91f7dd81fad92aa3c80 | jungchunkim/study_algorithm | /deque/deque_2161.cpp | C++ | cpp | 332 | no_license | #include <iostream>
#include <deque>
using namespace std;
int main()
{
int N;
cin >> N;
deque<int> dq;
for (int i = 1; i <= N; i++)
{
dq.push_back(i);
}
while (1)
{
cout << dq.front() << " ";
dq.pop_front();
if (dq.empty())
{
break;
}
else
{
dq.push_back(dq.front());
dq.pop_front();... |
9cc2c4a3ca74151c3827bcb241e460034adda986 | 79ed8665db836de01fa35329e8c17077d60cc74a | kitesoft/Roomer-PMS-1 | /Extras/DevExpress VCL/Library/RS17/dxLayoutCommon.hpp | C++ | hpp | 2,503 | no_license | // CodeGear C++Builder
// Copyright (c) 1995, 2012 by Embarcadero Technologies, Inc.
// All rights reserved
// (DO NOT EDIT: machine generated header) 'dxLayoutCommon.pas' rev: 24.00 (Win32)
#ifndef DxlayoutcommonHPP
#define DxlayoutcommonHPP
#pragma delphiheader begin
#pragma option push
#pragma option -w- // ... |
aee00ca4b05aebc08a193579db3815f59a7cff27 | f8636bd17e7fa12da18d49fe4db5b1ee554144d0 | ccdxc/logSurvey | /data/crawl/make/old_hunk_996.cpp | C++ | cpp | 377 | no_license | unsigned int length;
{
register struct variable *v = lookup_variable (name, length);
if (v == 0)
warn_undefined (name, length);
if (v != 0 && *v->value != '\0')
{
char *value = (v->recursive ? recursively_expand (v) : v->value);
o = variable_buffer_output (o, value, strlen (value));
... |
e7ceada422875bae4a3d9b4c5a281b2c78c62e63 | d90f90e1fa0957bf75c872a95876cc66ef7a745b | IntelligentSoftwareSystems/Galois | /lonestar/eda/cpu/aig-rewriting/algorithms/CutManager.cpp | C++ | cpp | 24,827 | permissive | /*
* This file belongs to the Galois project, a C++ library for exploiting
* parallelism. The code is being released under the terms of the 3-Clause BSD
* License (a copy is located in LICENSE.txt at the top-level directory).
*
* Copyright (C) 2018, The University of Texas at Austin. All rights reserved.
* UNIVER... |
9fb50217921c1b16af9ed88ded80e9587fc39ae9 | e6876217cd5959844db40a5b532675da05f238d4 | bytearchive/pb_chrome | /patch/print_web_view_helper.cc | C++ | cc | 76,694 | no_license | // 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 "chrome/renderer/printing/print_web_view_helper.h"
#include <string>
#include "base/auto_reset.h"
#include "base/command_line.h"
#include "... |
5f5a91c4bf8145629a58bd4228a693dcd3ca520c | 59d8646f7745f632a5abe309235cbb99783eae9c | engelfaul/tissueRV | /lib/pujOgreBullet/Collisions/src/Debug/OgreBulletCollisionsDebugLines.cpp | C++ | cpp | 8,236 | no_license | /***************************************************************************
This source file is part of OGREBULLET
(Object-oriented Graphics Rendering Engine Bullet Wrapper)
Copyright (c) 2007 tuan.kuranes@gmail.com (Use it Freely, even Statically, but have to contribute any changes)
Permission is hereby granted,... |
33a44de1db3c1aa626efb02d4b1b8fdf78459c78 | f6275b9874014d71fae6ef5898f642282537831b | ThornLin/MyCPE | /CPE/題目/10252/10252.cpp | C++ | cpp | 751 | no_license | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string a, b;
int countA, countB;
char tmp;
while (getline(cin, a) && getline(cin, b)){
countA = 0;
countB = 0;
int letter[26] = {0};
for (int i = 0; i < 26... |
f1bfe5dd84fa65b3cf378270adb9d70e385b989f | 547f2224621b848ca93fc49a092724f6b86d6e3f | jLantxa/gravity | /src/Timer.cpp | C++ | cpp | 1,725 | no_license | /*
* gravity
* Copyright (C) 2017 Javier Lancha Vázquez
*
* 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.
*
* ... |
5491ad87df9061819c048a5c233d882859769629 | 4632c63ff02acea1b3133a64746ad554cf1d4870 | IlliniSolarCar/mbed | /libraries/tests/net/helloworld/broadcast_send/main.cpp | C++ | cpp | 530 | permissive | #include "mbed.h"
#include "EthernetInterface.h"
const int BROADCAST_PORT = 58083;
int main() {
EthernetInterface eth;
eth.init(); //Use DHCP
eth.connect();
UDPSocket sock;
sock.init();
sock.set_broadcasting();
Endpoint broadcast;
broadcast.set_address("255.255.255.255", BROADCAST_PO... |
f12c602dd608edd29ecb7ce3d26197a1595d1b70 | ea6f237eaae408432213dd393a9d6bf3acf474c1 | pontikos/SimReg | /src/Likelihood.cpp | C++ | cpp | 6,322 | no_license | #include "Likelihood.h"
using namespace Rcpp;
using namespace std;
Likelihood::Likelihood(
double in_gamma_prior_prob,
double in_alpha_star_mean,
double in_alpha_mean,
double in_alpha_star_sd,
double in_alpha_sd,
double in_log_beta_mean,
double in_log_beta_sd,
double in_logit_mean_f_mean,
double in_logit_mea... |
ac415991e4d5d152791944828ac8fc7a8c42251c | 93b2136f1df92f266f9b9adec98765c977bf61c4 | ehasting/dxmpp | /DXMPP/Connection.cpp | C++ | cpp | 28,243 | permissive | //
// Connection.cpp
// DXMPP
//
// Created by Stefan Karlsson on 31/05/14.
// Copyright (c) 2014 Deus ex Machinae. All rights reserved.
//
#include "Connection.hpp"
#include <boost/thread.hpp>
#include <memory>
#include <iostream>
#include <DXMPP/SASL/SASLMechanism.hpp>
#include <DXMPP/SASL... |
e02536664ce7f95fcd67739afe6f21c23b2df4b1 | 6e743c63b489056e2542ec7b24c0bddd06e77144 | DOTA92/test2d | /run_64.cpp | C++ | cpp | 5,084 | no_license | /* ------------------------------------------------------- */
/* Vladimir Salnikov (GM3N LMNO University of Caen) 2015 */
/* ------------------------------------------------------- */
#include "geom.h"
#include "hom_header.h"
using namespace std;
main(int argc, char *argv[])
{
... |
b748388f113d95b51d1c14b31052c87da6e2d171 | 1df9d86b06e5b04b43c5b3be34d1e8c05ee3b2ac | wilimitis/appleseed | /src/appleseed/renderer/modeling/project/projectfilewriter.cpp | C++ | cpp | 39,304 | permissive |
//
// This source file is part of appleseed.
// Visit https://appleseedhq.net/ for additional information and resources.
//
// This software is released under the MIT license.
//
// Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited
// Copyright (c) 2014-2018 Francois Beaune, The appleseedhq Organization
//... |
4a76499965058dba314a4141a6b4cf7d53e6d80c | ddd3de975f03e630b7ff9476acf6293c901600bb | ilanteit/pandemic_b | /sources/Dispatcher.cpp | C++ | cpp | 523 | no_license | #include "Dispatcher.hpp"
namespace pandemic{
Dispatcher::Dispatcher(Board& b ,City city):Player(b,city){ }
Dispatcher& Dispatcher::fly_direct(City city){
if(get_city()==city){
throw ("Invalid move,Cannot fly to same location");
}
if(board.contain_research_station(g... |
02a7aebf572c854a8067f06ab5aeed88cf26004c | a2f5202ede1c8c485a719a9b8c11fec1843008cb | Rome-18/lmApp | /LongmanEvt/src/lmEvtBus.cpp | C++ | cpp | 702 | no_license | #include "lmEvtBus.h"
#include "lmmodelD.h"
lmEvtBus* lmEvtBus::m_SingleCon = nullptr;
lmEvtBus::lmEvtBus()
{
}
lmEvtBus::~lmEvtBus()
{
}
lmEvtBus* lmEvtBus::createCon()
{
return new lmEvtBus();
}
lmEvtBus* lmEvtBus::createSingleCon()
{
if (m_SingleCon == NULL)
m_SingleCon = new lmEvtBus();
... |
a3dbb191466df30e2cfaac580e58e2e76fb90452 | 3e85256b53931e2bd89b7a5744a1cd236f1a482b | emankov/hcc-clang-upgrade | /lib/StaticAnalyzer/Checkers/ObjCAutoreleaseWriteChecker.cpp | C++ | cpp | 6,744 | permissive | //===- ObjCAutoreleaseWriteChecker.cpp ----------------------------*- C++ -*-==//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===------------------------------------------------------... |
9c28fbf93c9fa71d3dd81ce722ff5a47aa339dcb | b3e15bb560e8514480b255b7b32515726c2c7500 | nimabi8984/Spider | /Classes/ScoreLayer.cpp | C++ | cpp | 1,285 | no_license | #include"ScoreLayer.h"
#include"Matrix.h"
#include"GameData.h"
#include"Audio.h"
#include"MainScene.h"
bool ScoreLayer::init(){
if (!Layer::init())
return false;
auto GUI = CSLoader::createNode("ScoreLayer.csb");
this->addChild(GUI, -1);
_state = static_cast<Text*>(GUI->getChildByName("Text_State"... |
3f2a4302bc1720e25785f4940fad68cc707f969e | 4fc9f025a3800e36c11278f17a2951153f1df27d | kimjihyo/BCIT-CST-Course-Materials | /COMP-3522-C++/examples/RegularFunction/main.cpp | C++ | cpp | 558 | no_license | #include <iostream>
using namespace std;
struct Animal {
int age;
Animal(int age) : age(age){}
bool operator>(Animal other) {
return age > other.age;
}
};
template <typename T>
bool greaterThan(T x, T y) {
return x > y;
}
int main() {
int x = 0;
int y = 1;
string a = "aaa";
... |
c16160d9bbb3df73f7ff6fb372981efeb128fa8d | 8aadc191531e606e35525c6ebbc68f204357f8d0 | Shaanii/CodeJAmPractice | /savingTheUniverse.cpp | C++ | cpp | 2,703 | no_license | // Ideone_Language_Id:1
/* Don't remove the first line! */
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <set>
#include <utility>
#include <stack>
#include <cmath>
#include <cassert>
#include<queue>
//Input-outpu... |
170ee5590f38800c7ef58a1269382c82bf315fb3 | 503f9ac4183d0b732fdbe9d2e2912e41fd1f13c2 | bamboohiko/problemSolve | /hdoj/bc33p1.cpp | C++ | cpp | 1,269 | no_license | #include<iostream>
#include<cstdio>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include<queue>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
char dic[36] = {'0','1','2','3','4','5','6','7','8','9',
'a','b','c','d','e','f','g','h','i','j','k','... |
481f191f5c404996f807a29e24b2c5f718a00d21 | 23558760bc309a449f75cfe47cf214abc0c96fcc | sophias94171/hw3 | /magic_wand_model_data.cpp | C++ | cpp | 81,040 | no_license | #include "magic_wand_model_data.h"
// We need to keep the data array aligned on some architectures.
#ifdef __has_attribute
#define HAVE_ATTRIBUTE(x) __has_attribute(x)
#else
#define HAVE_ATTRIBUTE(x) 0
#endif
#if HAVE_ATTRIBUTE(aligned) || (defined(__GNUC__) && !defined(__clang__))
#define DATA_ALIGN_ATTRIBUTE... |
53c2b2370fd44a9d0249e0129d4b89a035419257 | 68c9459f7c96e707fc1cd000c411807af34b7cbc | tasogare66/atcoder | /abc017_c.cpp | C++ | cpp | 1,269 | no_license | //ABC017 C - ハイスコア
#include <bits/stdc++.h>
using namespace std;
struct Iseki{
int sc;
int st,ed;
Iseki(int isc, int ist, int ied) : sc(isc), st(ist), ed(ied) {}
};
int main() {
int N,M; //N:遺跡
#if LOCAL&0
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
#endif
cin>>N>>M;
std::vecto... |
3200445e54c05f12be4dd6836387895753148198 | b274df6e92a1b591480b7ffe2d63d3acab66ac35 | MijaTola/Codeforce | /1420D.cpp | C++ | cpp | 1,219 | no_license | #include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long f[401000];
int main() {
f[0] = 1;
for (int i = 1; i < 401000; ++i)
f[i] = (i * f[i - 1]) % mod;
auto modpow = [] (int a, int b) {
long long x = 1, y = a;
while(b > 0) {
if(b... |
48515206d04ad4d909bd8f5432e17adaa1b08898 | 818314045110d1de31bdca4821ca4128d7227332 | robustfortune/beam | /ui/model/node_model.cpp | C++ | cpp | 3,078 | permissive | // Copyright 2018 The Beam Team
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in... |
197524c07dab5957f2569339f4f493264aca0a19 | 45a48e83d326784d1c3cad3ee6b662cf2aa75a49 | luqmanarifin/cp | /Penyisihan ITobaFestival 2017/rotasi.cpp | C++ | cpp | 795 | no_license | #include <bits/stdc++.h>
using namespace std;
const int N = 105;
char s[N][N], tmp[N][N];
int n, m, k;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%s", s[i]);
scanf("%d", &k);
for (int i = 0; i < n; i++) m = max(m, (int)strlen(s[i]));
k /= 90;
k %= 4;
while (k--) {
memset(tmp,... |
b1846ee195f040143c1c6ad2766934ed93dd1476 | 6692218d89110b3e26414de3ebc0e14816bf8895 | dmitigr/fcgi | /src/math/math.hpp | C++ | hpp | 829 | permissive | // -*- C++ -*-
//
// Copyright 2022 Dmitry Igrishin
//
// 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 applicabl... |
9467e52864c60f8abc1c65cbaa169e64621c1373 | 9838ccf2b2cfd07f030dab951d2d6bc353a56204 | dubshfjh/LeetCode | /115.cpp | C++ | cpp | 8,541 | no_license | 一、分析字符串S(长为m)和T(长为n)最长公共子序列的DP算法：
1. 创建1个二维数组dp[m+1][n+1]：dp[i][j]代表字符串S[0...i-1]和T[0...j-1]匹配的最长公共子序列长度
2. 初始化dp[][]内容为0，其中dp[0][0],dp[i][0],dp[0][j]始终保持初值为0
3. i：1 to m；j：1 to n进行循环（状态转移方程如下：）
(1) if (S[i-1]==T[j-1])：dp[i][j] = dp[i-1][j-1] + 1
(2) if (S[i-1]!=T[j-1])：选择1，此次放弃S[i-1]，此时dp[i][j] = S[0...i-2] 与... |
4cf5408ad6aa740f036c95017fe0db2ad8863135 | 56d8028b76b1d0e4a02173efd5a0acb43e3a478a | metrocoindev/kagome | /core/network/protocols/gossip_protocol.cpp | C++ | cpp | 8,173 | permissive | /**
* Copyright Soramitsu Co., Ltd. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0
*/
#include "network/protocols/gossip_protocol.hpp"
#include <libp2p/connection/loopback_stream.hpp>
#include "network/common.hpp"
#include "network/protocols/protocol_error.hpp"
namespace kagome::network {
using lib... |
d5ba0c65de9e8db2128b013253329f5bd5bdfff7 | eb9d572134e83973cca2586ae99df44c484faf48 | jmadoremos/amaoed-cpp-demo | /src/week05/main.cpp | C++ | cpp | 1,688 | permissive | // ********************************* LICENSE ********************************* //
// Copyright 2018 James Michael Adoremos
//
// 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
//
// ... |
ebfdc686b902cee7b6c615bf60a363fb07a212ef | 858e7d1f125244838bc1b08b0045952898fc261a | JordanLim-exe/CSC196 | /Engine/Math/Color.cpp | C++ | cpp | 924 | no_license | #include "pch.h"
#include "Color.h"
namespace nc {
const Color Color::white{ 1, 1, 1 };
const Color Color::red{ 1, 0, 0 };
const Color Color::green{ 0, 1, 0 };
const Color Color::blue{ 0, 0, 1 };
const Color Color::yellow{ 1, 1, 0 };
const Color Color::magenta{ 1, 0, 1 };
std::istream& operator>>(std::istream... |
c65be9218561e62aaf721be2e4cb191c22d115b5 | d66777d3fdcfab1d4fd1298d988a9589a3ed1ba5 | HikingCarrot7/Programacion_Estructurada | /Parcial I/Picateclas/Ejercicio33Final.cpp | C++ | cpp | 809 | no_license | /* Programa: Números mayores a 100
Descripción:
E.P. que lea 10 números (N) y que determine e imprima los que
sean mayores a 100.
Autor: Picateclas
Integrantes:
- López Madera Fernanda Jacqueline
- Durán Matos Juan José
- González Bautista Noé Alejandro
Versión: 1.0
Fecha: 12/feb/2019 */
#include <stdio.h>
#include ... |
5291fbc460ec9d9ccd8e66d5de36640717e3c895 | 04ebdda7ecd7c393d6ebbbe8a9901f6c27bfaf7c | Rajan-Sood/Tron | /Tron/Tron-Core/source/maths/vec4.cpp | C++ | cpp | 1,827 | no_license | #include"vec4.h"
namespace tron {
namespace maths {
vec4::vec4(const float & x, const float & y, const float & z, const float & w)
{
this->x = x;
this->y = y;
this->z = z;
this->w = w;
}
vec4& vec4::add(const vec4& other)
{
x += other.x;
y += other.y;
z += other.z;
w += ot... |
76cd297da93a0fb642c6ac9531584ed0f0b816e6 | 2d722c94016a016408ec41e299ac2159c426dc98 | ashutosh0gupta/llvm_bmc | /examples/memoryTest4.cpp | C++ | cpp | 221 | no_license |
int a;
int b;
int c[10], e[33];
int main() {
e[1] = 0;
int a[5], d[4];
d[0] = 1, d[1] = 0;
a[0] = 0; a[1] = 1;
for(int i=0;i < 2;i++) {
int f[i+2];
a[0] = 1;
a[1] = 2;
d[1] += 3;
a[2] = 3;
}
} |
7188d12da58208d44d360ef10611eb4b06d9aade | c0b9083601c5e3a4e464e83439bd138645dff9b4 | Vizionnation/chromenohistory | /ui/ozone/platform/drm/host/host_cursor_proxy.cc | C++ | cc | 2,363 | permissive | // Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/ozone/platform/drm/host/host_cursor_proxy.h"
#include <utility>
#include "services/service_manager/public/cpp/connector.h"
#include "ui/ozo... |
c99e221c8740e54bb7deb106ae3b01d28fb7b680 | 282e777506eb27075534088659fc4399f252248b | H3D-Zoo/Lion | /Source/Common/BaseAPIInstance.cpp | C++ | cpp | 554 | no_license | #include "../../RenderAPI/RenderAPI.h"
#include "BaseAPIInstance.h"
#include "Logger.h"
BaseAPIInstance::BaseAPIInstance() : m_currentLogger(GetDefaultLogger())
{
}
RenderAPI::Logger* BaseAPIInstance::GetDefaultLogger() const
{
return &(SilentLogger::GetInstance());
}
RenderAPI::Logger* BaseAPIInstance::GetCurren... |
6432ae1d8d9cb0d561efcf045710db9093ff8823 | aa5cc90770e97204ec0d3e0f8095f51e7d3fda96 | DESY-CMS-SUS/cmgtools-lite | /TTHAnalysis/python/tools/jetReCleanerExampleHelper.cxx | C++ | cxx | 1,455 | no_license | #include <cmath>
#include <TTreeReaderValue.h>
#include <TTreeReaderArray.h>
#include <DataFormats/Math/interface/deltaR.h>
#include <CMGTools/TTHAnalysis/interface/CollectionSkimmer.h>
class JetReCleanerExampleHelper {
public:
typedef TTreeReaderValue<int> rint;
typedef TTreeReaderArray<float> r... |
bbae83f28dbb91756abdcaa6baa2c2a9ce34e0de | 9085b5cd036dd7fbf9aefe5e4f3aaaa22c4cd826 | meniossin/src | /components/offline_pages/core/model/complete_offline_page_upgrade_task.cc | C++ | cc | 4,544 | 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 "components/offline_pages/core/model/complete_offline_page_upgrade_task.h"
#include "base/bind.h"
#include "base/files/file_util.h"
#include "ba... |
b0afb579636869c459940c5bfff5ef371ee536e0 | d1444591f867a7ae1de5204e76b222122be67657 | npadmana/lowdiscrepancyRR | /cpp/boss/gtests/mpi_RR_test.cpp | C++ | cpp | 1,894 | no_license | #include "gtest/gtest.h"
#include <string>
#include "../ang2d.h"
#include "../BossMask.h"
#include "mpi.h"
using namespace std;
using namespace Boss;
class RRTest : public ::testing::TestWithParam<int> {
public:
double calcRR(string fn, double thetamin, double thetamax) {
Ang2D::InputParams p0(fn);
// Now def... |
a36362b720f81b47fae230706aa4e9f3eb25d231 | 570d014d664e717a4a7506eca6c680d168f52ad5 | Noel-coder/P3Extra_NoelMartinez | /Genero.cpp | C++ | cpp | 474 | no_license | #include "Genero.h"
Genero::Genero()
{
}
Genero::~Genero()
{
}
Genero::Genero(string _nombreGenero){
this->nombreGenero= _nombreGenero;
}
Genero::Genero(int _idGenero){
this->idGenero=_idGenero;
}
Genero::Genero(int _idGenero,string _nombreGenero){
this->idGenero=_idGenero;
this->nombreGenero= _nombreGenero;
}
... |
9919bf8f116c7f7500b05ad1a8b000f75f36c5be | f5aef01463a84c200441a97b240b57d39bb28696 | blinkov/ClickHouse | /src/Processors/Transforms/SquashingChunksTransform.cpp | C++ | cpp | 1,073 | permissive | #include <Processors/Transforms/SquashingChunksTransform.h>
#include <iostream>
namespace DB
{
SquashingChunksTransform::SquashingChunksTransform(
const Block & header, size_t min_block_size_rows, size_t min_block_size_bytes, bool reserve_memory)
: ExceptionKeepingTransform(header, header, false)
, squash... |
6cfa491b4126ac5c94a5a5d7a45a7fd929801c2d | 221786ff4859510580ea9d9b4e928059c2e1f209 | octopus-prime/octopus-c | /source/score.cpp | C++ | cpp | 247 | no_license | /*
* score.cpp
*
* Created on: 06.02.2013
* Author: mike_gresens
*/
#include "score.hpp"
namespace chess {
constexpr std::array<score_t, 13> score_of_piece::scoring;
constexpr std::array<score_t, 5> score_of_promotion_t::scoring;
}
|
fdcd4adc2f8548ebcdd34940f2f3810317c11167 | 6096fa855b0a84835dfa204445f6b9d8b932ccf7 | blossom2017/Leetcode | /300.longest-increasing-subsequence.159525045.ac.cpp | C++ | cpp | 438 | permissive | class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
if(nums.size()==0)return 0;
int mxval=1;
vector<int> lis(nums.size(),1);
for(int i=1;i<nums.size();i++)
{
for(int j=0;j<i;j++)
{
if(nums[i]>nums[j]&&lis[i]<lis[j]+1)lis[i]=li... |
6e4cee90f7dd67d020990e95074b24b3a4cf744f | decb967780d8f797c0d246a21e0e6231133cf4d9 | zcy05331/code-backup | /洛谷/P1966.cpp | C++ | cpp | 1,430 | no_license | #include <bits/stdc++.h>
const int MaxN = 100010;
const int mod = 99999997;
int ans;
int c[MaxN];
long long tmp[MaxN];
int id1[MaxN], id2[MaxN];
long long a[MaxN], b[MaxN];
long long cmp1(int x, int y){return a[x] < a[y];}
long long cmp2(int x, int y){return b[x] < b[y];}
void Merge(int l, int r)
{
if(l == r)
... |
f15365677b03d3cc1e7e152038e6c34d0d3f7d89 | c0abbab8e2ff3c658848505dabe1d7f1774d4598 | WSJI0/BOJ | /1000-9999/1275.cpp | C++ | cpp | 1,055 | no_license | // 1275 커피숍2
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll tree[100001*4];
ll arr[100001];
ll init(int s, int e, int node){
if(s==e) return tree[node]=arr[s];
return tree[node]=init(s, (s+e)/2, node*2)+init((s+e)/2+1, e, node*2+1);
}
ll sum(int s, int e, int node, int l, int r){
... |
c76f8198f042593e93d66ccb6f3ee789ead183d5 | 18a91c8e625820797ab1abec7dc98fa6e196ee12 | Evolutionary-Intelligence/Tensoft-G21 | /simulation/robotVisualization.cpp | C++ | cpp | 5,092 | permissive | /*
* Copyright © 2012, United States Government, as represented by the
* Administrator of the National Aeronautics and Space Administration.
* All rights reserved.
*
* The NASA Tensegrity Robotics Toolkit (NTRT) v1 platform is licensed
* under the Apache License, Version 2.0 (the "License");
* you may not use th... |
fbe97fd4a02f4a8f7195bd1e1cad99cc033b4bde | f6ca8f99fa23a2291c0bf3e4c899a1fa2d670170 | dotstudio01/mcl_ros | /src/pointcloud_tools.cpp | C++ | cpp | 17,835 | no_license | #include "pointcloud_tools.h"
using namespace std;
pcl::PointCloud<Point>::Ptr load_pointcloud(const string &filename)
{
if (filename.substr(filename.size() - 3, 3) == "ply")
{
// 读取
pcl::PCLPointCloud2::Ptr cloud2 = pcl::PCLPointCloud2::Ptr(new pcl::PCLPointCloud2());
pcl::PLYReader r... |
8cbc6fca2c4a5162ef696922b3189df14270d3f3 | 365907aabb4150938b0001a2d187696545596ef3 | engelfa/DYOD_WS1819 | /src/lib/storage/chunk.hpp | C++ | hpp | 1,536 | permissive | #pragma once
// the linter wants this to be above everything else
#include <shared_mutex>
#include <atomic>
#include <memory>
#include <string>
#include <vector>
#include "all_type_variant.hpp"
#include "types.hpp"
namespace opossum {
class BaseIndex;
class BaseSegment;
// A chunk is a horizontal partition of a t... |
048669694cd8b141670527b6e530165b6d33ca4e | 0100b613d4b267fff141111c8f30e6ad75a6cf5c | SLONGkang/C_Learning | /时间转换第六题.cpp | C++ | cpp | 305 | no_license | #include<stdio.h>
int main()
{
int CLK_TCK;
long long int C1,C2;
int a,b,c,d,x;
CLK_TCK=100;
scanf("%d %d",&C1,&C2);
a=(C2-C1)/CLK_TCK;
x=(C2-C1)%CLK_TCK;
if(x!=0)
a=a+1;
b=a/3600;
c=(a-b*3600)/60;
d=a-b*3600-c*60;
printf("%02d:%02d:%02d",b,c,d);
return 0;
}
|
6fbdad32a72d7a0002fb1f95e168beec690900b1 | ade12a8f7a4858600b2f399fafa674deefadc456 | zinh/Advent-of-Code-2019 | /day05/prob1.cpp | C++ | cpp | 408 | no_license | #include <iostream>
#include <fstream>
#include <string>
#include "machine.h"
using namespace std;
const int MEMORY_SIZE = 10000;
int
main(int argc, char** argv){
if (argc <= 1) {
cout << "No file name" << '\n';
return 1;
}
string file_name = argv[1];
string s;
Cpu machine(MEMORY_SIZE);
fstream ... |
fa6817a988bdb58e145ba4afab7c2db1955d89d5 | 42026bc4e1d402d3582760362fe0e6ed9f43ecb2 | gvvynplaine/compute-runtime | /level_zero/core/source/gen12lp/dg1/kernel_dg1.cpp | C++ | cpp | 260 | permissive | /*
* Copyright (C) 2019-2020 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
*/
#include "level_zero/core/source/kernel/kernel_hw.h"
namespace L0 {
static KernelPopulateFactory<IGFX_DG1, KernelHw<IGFX_GEN12LP_CORE>> populateDG1;
} // namespace L0 |
ec08a4ed51d9ff11855b95ecbe40ac76c784ece1 | b4c528c6e2b95bab793a908ac377a57c265e0210 | jps27CSE/C-PlusPlus-Programming- | /Object Oriented Programming/Types of Constructor.cpp | C++ | cpp | 512 | no_license | #include<iostream>
using namespace std;
class Student
{
public:
int id;
double gpa;
void display()
{
cout<<id<<" "<<gpa;
}
Student(int x,double y)
{
id=x;
gpa=y;
}
... |
7459f9754da0aaf82e9c99985ba082e681e526fd | 3e39e34746124ae539eb2965744d8403ea115830 | IAmAnubhavSaini/cryptoAlgorithm-nt5src | /Source/XPSP1/NT/multimedia/dshow/mfvideo/tvplayer/msmfcnt/msmfsldr.cpp | C++ | cpp | 43,395 | no_license | /*************************************************************************/
/* Copyright (C) 1999 Microsoft Corporation */
/* File: MSMFSldr.cpp */
/* Description: Implementation of CMSMFSldr */
/* Author: David... |
e06f3c3b9763ebaa8477272e1d7c0c77ceb5c8f2 | dbe7c67538930c31935ef8a62f2c6e073ffcbd5d | SebastianBogado/fiuba-7542-tp-final | /cliente/Modelo/FiltradorHelper.cpp | C++ | cpp | 4,547 | no_license | #include "FiltradorHelper.h"
#include "Utilitario.h"
#include "M_Fechas.h"
FiltradorHelper FiltradorHelper::instancia;
#define CANT_COMBO_FECHA 8
#define CANT_COMBO_HECHO 3
#define CANT_COMBO_AGREGACIONES 6
#define VALOR_COMBO_FECHA_NAVEGACION 7
Glib::ustring FiltradorHelper::comboFecha[CANT_COMBO_FECHA] = {
"Añ... |
ebab879842de073693a14ee76d87774f8a4abbce | 81fea2f058ba9c5ab1088d9e5d5db2af8b3c9fba | P3GLEG/Triton | /src/libtriton/includes/symbolicEngine.hpp | C++ | hpp | 13,634 | permissive | //! \file
/*
** Copyright (C) - Triton
**
** This program is under the terms of the BSD License.
*/
#ifndef TRITON_SYMBOLICENGINE_H
#define TRITON_SYMBOLICENGINE_H
#include <list>
#include <map>
#include <string>
#include "architecture.hpp"
#include "ast.hpp"
#include "callbacks.hpp"
#include "memoryAccess.hpp"
#i... |
bbf8a09841cd8cace110e3595a8c9884611953a0 | 131b060d5e5cc48ec67362886f3da441515e239a | longstl/mus12 | /_Library/_Include/cryptopp/sosemanuk.cpp | C++ | cpp | 23,781 | permissive | // sosemanuk.cpp - written and placed in the public domain by Wei Dai
// use "cl /EP /P /DCRYPTOPP_GENERATE_X64_MASM sosemanuk.cpp" to generate MASM code
#include "pch.h"
#ifndef CRYPTOPP_GENERATE_X64_MASM
#include "sosemanuk.h"
#include "misc.h"
#include "cpu.h"
#include "serpentp.h"
NAMESPACE_BEGIN(CryptoPP)
v... |
4d858a95473d0bde763b134d2410fd5b7f7a87b2 | 62f52e59088b0d998248bea909dae4ae544705db | rohitativy/turicreate | /deps/src/cmake-3.9.3/Source/cmFilePathChecksum.cxx | C++ | cxx | 3,236 | permissive | /* Distributed under the OSI-approved BSD 3-Clause License. See accompanying
file Copyright.txt or https://cmake.org/licensing for details. */
#include "cmFilePathChecksum.h"
#include "cmBase32.h"
#include "cmCryptoHash.h"
#include "cmMakefile.h"
#include "cmSystemTools.h"
#include <vector>
cmFilePathChecksum::... |
53b3a9144d6549f1fd951d364acab304f2a4db88 | db44f1d46fc9bbad2e34def529367d709de45a72 | tlglovewf/Monocular_Positioning | /PosEstimate/sources/CORBmatcher.cpp | C++ | cpp | 5,992 | no_license | /**
* This file is part of ORB-SLAM2.
*
* Copyright (C) 2014-2016 Raúl Mur-Artal <raulmur at unizar dot es> (University of Zaragoza)
* For more information see <https://github.com/raulmur/ORB_SLAM2>
*
* ORB-SLAM2 is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public Lice... |
aec487df996261f57bfc314a632e70600c0a75af | ed67273cf319a26e1814ca905239ff7d927781e5 | maghniem/data_structures | /Graph_Demo.cpp | C++ | cpp | 1,205 | no_license | //compile with c++11 features
#include "Graph.h"
void Graph::printGraphMatrix() { //print n x n matrix onto standard output
for (auto& i : adjacencyMatrix) {
for (auto& j : i)
std::cout << j << ' ';
std::cout << '\n';
}
}
void d_Graph::printGraphMatrix() {
for (auto& i : adjacencyMatrix)... |
10062472bb4b22c6b5bf1158791103bb6bd87dba | 54a670e1fb46aa9d566dbe8f4d708a6099eb6d20 | AospExtended/platform_bootable_recovery | /updater/blockimg.cpp | C++ | cpp | 62,652 | permissive | /*
* Copyright (C) 2014 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... |
28ed6f353d5a6fa499b952d4f73f6b0ebb238ea5 | ba4a10e9a3c078da3980474f68a4daa996f7015f | chan-jesus/vidanueva | /SessionManager.hpp | C++ | hpp | 972 | no_license | /*
* =====================================================================================
*
* Filename: SessionManager.hpp
*
* Description: Hooks together witty-sessions- and the mongo UserManager
*
* Version: 1.0
* Created: 06/25/2011 08:58:24 AM
* Revision: none
* Co... |
bf0a4a39a7c98d94c7c64b6190a060c39ade2d3d | cdd651a233e8d1467a2798bfe7c83947e3765a51 | james-sungjae-lee/2018_CPP | /STUDY/Study0531/iterator1.cpp | C++ | cpp | 522 | no_license | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
vector<int> vec;
for (size_t i = 0; i < 10; i++) {
vec.push_back(i);
}
std::vector<int>::iterator it;
for(it = vec.begin(); it != vec.end(); it++){
std::cout << *it << " ";
}
s... |
32cf9e56d1d8f33ac015c4ec05d82bb8fd04ba94 | ea90e8865c449a11d43b326d27a74ef794146ee2 | ericmitt/MyOpenCV | /ComicLife2/ComicLife2/ComicLife2.Windows/OcvTransform.cpp | C++ | cpp | 39,358 | no_license | // THIS CODE AND INFORMATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF
// ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO
// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A
// PARTICULAR PURPOSE.
//
// Copyright (c) Microsoft Corporation. All rights reserved.
#include "pch.h"
#includ... |
c1263e06d49831d4ca35dc8dcd4cbd11dde8040d | cff0e0966a13aae5c507c078e44a9c20888fa800 | steppers/Logis | /src/executor.cpp | C++ | cpp | 3,231 | no_license | #include "executor.h"
#include "pin.h"
MultiThreadExecutor gExecutor;
//////////////////////////////////////////////////////////////////////////////////
// Single threaded
//////////////////////////////////////////////////////////////////////////////////
void SingleThreadExecutor::add_job(TriggerJob job) {
m_queue... |
a85b404b5947a0c76923fd84d2e2c56d83e73857 | be566d4393d4da983af5a838f93ee96e2266136e | valalithak/Competitive-Programming | /USACO TRAINING/Subset Sums/subset.cpp | C++ | cpp | 612 | no_license | /*
ID: swetanj2
LANG: C++
TASK: subset
*/
#include <bits/stdc++.h>
using namespace std;
int N,n;
int dp[50][(50*51)/2];
int rec(int ind, int sum)
{
if(sum==0){
return 1;
}
if(ind==n)return 0;
if(sum<0)return 0;
if(dp[ind][sum]!=-1)return dp[ind][sum];
return dp[ind][sum]=rec(ind+1,sum)+rec(ind+... |
52dfc96e535877b52911b559a0c7e0806e4ae873 | a41c440419e75ad2c70884b8009da9bb90e0b908 | aszenz/pytorch | /torch/csrc/autograd/functions/utils.cpp | C++ | cpp | 1,624 | permissive | #include "torch/csrc/autograd/functions/utils.h"
#include "torch/csrc/autograd/edge.h"
#include "torch/csrc/autograd/function.h"
#include "torch/csrc/autograd/variable.h"
#include <sstream>
#include <vector>
namespace torch { namespace autograd {
variable_list wrap_outputs(const variable_list& inputs, tensor_list&&... |
02b40936644390dc16c9555359b4ffa428a9a37f | ba86e7cb190997bd4515c9f7e2dc7eab33d90302 | settingsun1225/am_matlab_usb | /fmcw.cpp | C++ | cpp | 1,715 | no_license | #include "fmcw.h"
fmcw::fmcw() {
b_Transfer = 0;
i_FrameLength = 100 * 10 * 1e3 * 16;
b_DeviceExist = 0;
sOperatingMode = "2TX & 6RX";
sampleFrequency = 40;
refClk = 0;
dataTransRefresh = false;
dataTranserThread = new DataTransfer(this);
dataProcessThread = new DataProcess(this);
}
fmcw::~fmcw() {
if (data... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.