blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 2 247 | content_id stringlengths 40 40 | detected_licenses listlengths 0 57 | license_type stringclasses 2
values | repo_name stringlengths 4 111 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringlengths 4 58 | visit_date timestamp[ns]date 2015-07-25 18:16:41 2023-09-06 10:45:08 | revision_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | committer_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | github_id int64 3.89k 689M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 25
values | gha_event_created_at timestamp[ns]date 2012-06-07 00:51:45 2023-09-14 21:58:52 ⌀ | gha_created_at timestamp[ns]date 2008-03-27 23:40:48 2023-08-24 19:49:39 ⌀ | gha_language stringclasses 159
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 7 10.5M | extension stringclasses 111
values | filename stringlengths 1 195 | text stringlengths 7 10.5M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
7fd51305c5444f3347d671289ed5f978ca959a4e | ab80d88b354db83585acc72e36fe9f3f4a1c7e54 | /Test/src/TestPrognoser.cpp | 0db688a68060acd949cb7e949186b3ce8dab55fb | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | zhengbenchang/GSAP | a1ecedaf502e184827148cee4bd27b44315c6a2f | 68a33f4df375d8144ffe10f6c90ad2d57204a6c9 | refs/heads/master | 2020-04-13T08:35:24.905767 | 2018-11-30T22:21:20 | 2018-12-04T22:37:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,112 | cpp | TestPrognoser.cpp | //
// TestPrognoser.cpp
// Generic Infrastructure Example
//
// Created by Chris Teubert on 4/18/16.
// Copyright © 2018 United States Government as represented by the Administrator of the National Aeronautics and Space Administration. All Rights Reserved.
//
#include <string>
#include "TestPrognoser.h"
#include... |
3f65cb053c24342cf55af0621cb1068ca237940b | 7535316048271589da7c5af7792e94c818fbbcb3 | /MPHY0022CW2/Testing/ccmpiPiSeriesOMPTest.cpp | 6e64e3b8bfcbfbf014eadea548155cb523a07b51 | [
"BSD-3-Clause"
] | permissive | uceclz0/cpp_CW | 97d53b11a755d8574b995c48e29a6e204d905895 | 3860f26d0d87f7cf91bbcb4ec8fd836357d56b9a | refs/heads/master | 2022-04-24T02:25:47.602315 | 2020-04-18T09:07:36 | 2020-04-18T09:07:36 | 256,700,795 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,245 | cpp | ccmpiPiSeriesOMPTest.cpp | /*=============================================================================
CMAKECATCHMPI: A software package to demo MPI with CMake, CTest and Catch.
Copyright (c) University College London (UCL). All rights reserved.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied war... |
05fcb7023a8042e8388d007a22d344e8b5e24097 | b9432721a49e260e892906ab108c00a528d43727 | /Ruleta/Ruleta de la Fortuna .ino | 0ba0ab9bc5086e27affdbaf303a649d7e193e9d1 | [
"MIT"
] | permissive | jdamador/Arduino | eca6a9b278e2b7150ccd4dfb48ec999e25df17ac | 072fd945b6ad3fdc10af56a6e066fe1a524152e1 | refs/heads/master | 2020-05-02T02:58:09.223775 | 2019-07-03T14:25:08 | 2019-07-03T14:25:08 | 177,716,105 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,054 | ino | Ruleta de la Fortuna .ino | // Declaración de pines.
int zumbador=10;
int pulsador=11;
int leds[]={5,6,7,8,9};
// Variable para recorrer el array.
int n=0;
int tiempo=200;
void setup (){
// Establecer los pines de los leds como salida.
for(n=0;n<5;n++) {
pinMode(leds[n],OUTPUT);
}
// Pin zumbador como salida.
pinMode(zumbador,OUTPU... |
8b083d290afd5ebc3734e7bdc04d2323566f0c99 | 58b141228a7caf70239b0e5c1df4267458432689 | /SOLVER/src/shared/data_structure/RTreeND.hpp | f60de4f85f8d736983c2719f499e27b84ca6190c | [
"MIT"
] | permissive | syzeng-duduxi/AxiSEM-3D | 2185facfd8347a50a283214b16703549f87d1575 | 043cabbb9661787222fcdb0ea5ba1e25467481f7 | refs/heads/master | 2023-04-13T15:21:15.702818 | 2021-04-05T14:13:56 | 2021-04-05T14:13:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,005 | hpp | RTreeND.hpp | //
// RTreeND.hpp
// AxiSEM3D
//
// Created by Kuangdai Leng on 9/7/19.
// Copyright © 2019 Kuangdai Leng. All rights reserved.
//
// boost RTree for searching nearest points
#ifndef RTreeND_hpp
#define RTreeND_hpp
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Weverything"
#include <boost/geo... |
1a7f57fe458310623754eaffc9417f876e02c6c6 | 466f4cf9ed0a9535774d1d2e6fb7d3c53b53481a | /TP1/tests/MicroTest/Main.cpp | 94ad4cc6fcd77664b51d485051be233a55f29905 | [] | no_license | phtroa/LOG6302 | 70a504ee67abb5d741b60f3d1aa58ef77ac6cd7a | 27fdab7174a1c564af88eb46c4266dc1c31f4af6 | refs/heads/master | 2021-01-11T17:12:06.939925 | 2017-04-14T22:29:09 | 2017-04-14T22:29:09 | 79,737,781 | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 622 | cpp | Main.cpp | /**************************************************
* Titre: Travail pratique #1 - Main.cpp
* Date: 25 aout 2012
* Auteur:
**************************************************/
#include "Infirmier.h"
int main()
{
//1- Creez un objet du type Infirmier à l'aide du constructeur par défaut
Infirmier infir... |
9ae786c8133e3e34e82e3f74076fce19415f7ab2 | 1e7a8245ee431fc33b96d071943cc0fce813a040 | /수학13 (baekjoon1652 - 누울 자리를 찾아라) .cpp | 9b18953728d96ab066e125a00dc3e710935e845a | [] | no_license | dlgkrwns213/algorithm | f3b685acb6e7e67b938154ee6f48ae69be45fc0a | 63951838356e09239d0a00155a981351d49a353a | refs/heads/master | 2020-11-28T08:43:18.955403 | 2020-03-06T14:40:52 | 2020-03-06T14:40:52 | 229,759,722 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 654 | cpp | 수학13 (baekjoon1652 - 누울 자리를 찾아라) .cpp | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
cin >> n;
char room[n][n];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin >> room[i][j];
int fcount = 0;
for(int i=0;i<n;i++)
{
bool x = true;
for(int j=1;j<n;j++)
{
if(room[i][j-1]=='.'&&room[i][j]=='.'&&x)
{
f... |
92af7fd385d0767296da3dff2d1290d6648e1554 | 6f57539fe08b91718fd1978aece1b44108b8ce6b | /E-HEALTH/build-Smart-med-Desktop_Qt_5_15_1_MinGW_32_bit-Debug/ui_modifier_visite.h | 6b67c35f6d6e86e19b32bd12db15806429785c4b | [] | no_license | mootez-gam/e-health-application-2a5 | 79eca54e7c4ed0bad781e5ee7fceb5bbfd8ac9a5 | 3798611c2b8aa10f37844a16278a527cc9fc0c72 | refs/heads/master | 2023-02-11T17:30:00.570272 | 2021-01-05T23:41:45 | 2021-01-05T23:41:45 | 317,281,588 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,683 | h | ui_modifier_visite.h | /********************************************************************************
** Form generated from reading UI file 'modifier_visite.ui'
**
** Created by: Qt User Interface Compiler version 5.15.1
**
** WARNING! All changes made in this file will be lost when recompiling UI file!
**********************************... |
b9cc94213489339224052a9d09055f69bea70e1e | cc6c3efbdfe5879045ec472b56ca85ecf6b13dc4 | /recueil_d_exercices_inf2/chapitre_07/exercice_03/pays.cpp | 35cbe22e5f18ad504aad730c064db2c0948bc3a3 | [] | no_license | hakimbalestrieri/INF2 | 04ce0249ae0b38c861cb1a2b7f85249839274769 | bcb4ce6badbbd037b29eaf806b5b583ad583630b | refs/heads/master | 2020-04-28T11:09:29.413763 | 2018-06-22T08:38:33 | 2018-06-22T08:38:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 422 | cpp | pays.cpp | #include "pays.h"
Pays::Pays(string nom, double habitant, unsigned superficie)
:m_nom(nom), m_nbr_habitant(habitant), m_superficie(superficie){
}
const string &Pays::getNom() const {
return m_nom;
}
double Pays::getHabitant() const {
return m_nbr_habitant;
}
unsigned Pays::getSuperficie() const {
... |
e9712f82aa42016adf83d4afe8bf22c51d766ad8 | 4491ad1ff35de21f7c005d5035010b52d97e1e72 | /src/Behaviours/Rainy.h | c24f601b6f45378fc331d4c80ba4eb3a7873a773 | [] | no_license | dreac0nic/nimbus | fbdec6ec3c73a2490916d2b9a89c2e0e8becd036 | 0a0535a2b2455d3fb4f8b24b7eb6ac316e959f37 | refs/heads/master | 2021-01-13T01:37:20.088410 | 2014-05-16T16:13:03 | 2014-05-16T16:13:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,466 | h | Rainy.h | #ifndef NIMBUS_BEHAVIOUR_RAINY_H
#define NIMBUS_BEHAVIOUR_RAINY_H
#include "Behaviour.h"
namespace Nimbus
{
/** Rainy is a behaviour that will cause the applied
to an entity that will cause the entity to rain down
on the tiles below it.
*/
class Rainy:
public Behaviour
{
private:
/** Calle... |
90e953b78839a03a90728767687e3275e087acbf | b84a38aad619acf34c22ed6e6caa0f7b00ebfa0a | /Code/TootleCore/TTransform.h | 4fa3671a500a53a59818d75741e58e8ae84b6668 | [] | no_license | SoylentGraham/Tootle | 4ae4e8352f3e778e3743e9167e9b59664d83b9cb | 17002da0936a7af1f9b8d1699d6f3e41bab05137 | refs/heads/master | 2021-01-24T22:44:04.484538 | 2010-11-03T22:53:17 | 2010-11-03T22:53:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,334 | h | TTransform.h | /*
* TTransform.h
* TootleCore
*
* Created by Duane Bradbury on 27/10/2009.
* Copyright 2009 Tootle. All rights reserved.
*
*/
#pragma once
#include "TLTypes.h"
#include "TQuaternion.h"
#include "TLMaths.h"
#include "TArray.h"
#include "TRef.h"
// forward declarations
class TBinaryTree;
... |
fb93bc6ddd5e67e7df8a5569b83ce0857a71d751 | e5aa88b3edf74ee36911828bbded9a8fcef61ef9 | /render.h | 94a9a1a48eedc2499dc5db27206cc57745d69544 | [
"MIT"
] | permissive | miklhh/mandelbrot3 | af78f2fa02d32a6952ad87830dbc9a9e32c4ce65 | bf4d3734a4a255f1b71624f4848c41b37ac6d1fb | refs/heads/master | 2020-04-10T19:11:52.665834 | 2018-12-11T03:42:07 | 2018-12-11T03:42:07 | 161,226,582 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,011 | h | render.h | /*
* Note: The filter function used for rendering the complex image has to be
* threadsafe. The renderer will perform multiple parallel calls to the filter
* function when rendering the image.
*/
#ifndef _RENDER_H
#define _RENDER_H
#include "threadpool/threadpool.h"
#include "mpfrc++/mpreal.h"
#include <complex>
... |
0a293f7e687a0043309ed209db650f177a867efb | 08369613577450af45fca5d68e11df03a0ed2999 | /library/tools/commandlineconverter/source/main.cpp | 2f03c6196c23e7273a1d81641ed31ea887aa3e9d | [] | no_license | IreNox/tiki3 | 50e81a4a0dd120a37063f8cd6ea3045528350a5a | 2f29b3d7ab30217b3bd46d85ce8ec9032c1c1d54 | refs/heads/master | 2020-04-12T06:34:00.290425 | 2018-05-24T09:37:35 | 2018-05-24T09:37:35 | 12,142,108 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,069 | cpp | main.cpp |
#include "tiki/base/types.hpp"
#include "tiki/base/platform.hpp"
#include "tiki/toollibraries/iassetconverter.hpp"
int tiki::mainEntryPoint()
{
int retValue = 0;
//debug::breakOnAlloc( 1449 );
{
AssetConverterParamter parameters;
parameters.sourcePath = "../../../../../../content";
parameters.outputPath = "... |
82061f8605209a47f0aa98fd97266d43f0eac183 | 2f585eb12866e51ae19ab2d1e713138c7359de3f | /Lane_recognition/houghlines_curveransac.cpp | 7b88bcad5911f28414a77e7c996496b4495d3b0e | [] | no_license | Hitdahit/Opencv_project | a2dad8ac4d7e683c52bc0124af85adc509aac5d4 | 1220fb9a372038ecd1032bc1be0850e1bcb4a6d3 | refs/heads/master | 2020-12-12T21:23:41.038146 | 2020-02-27T12:02:01 | 2020-02-27T12:02:01 | 234,230,763 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,046 | cpp | houghlines_curveransac.cpp | //tried to capture lanes' points with HoughLinesP, since hsv sometimes cannot capture lane with inRange function.
//it captured points not so bad but failed to implement curve ransac
#include <opencv2/opencv.hpp>
#include <ctime>
#include <cmath>
using namespace std;
using namespace cv;
vector <Vec4i> lines;
vector<Po... |
1425c10736cb34b884efd7e1acf97a1ac9579b11 | 1d3006443bdaeddb92a31908fddd61cd8bd04244 | /04_day/sp/sp.cpp | f6f49d6a62de439cfb8f188dcceca5a4c5caea45 | [] | no_license | ioacademy-jikim/android_framwork | ffa51e4aa47a4ef14d2ec36d49e371df3319ff14 | bf9c155a6d0d19852c102857705a73e7b904e1af | refs/heads/master | 2020-03-19T20:18:23.660633 | 2018-06-15T08:08:52 | 2018-06-15T08:08:52 | 136,895,520 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,425 | cpp | sp.cpp | #if 1
#include <stdio.h>
class RefBase
{
int mRefs;
public:
RefBase():mRefs(0) { printf("RefBase::RefBase()\n"); }
virtual ~RefBase() { printf("RefBase::~RefBase()\n"); }
void incStrong() {
printf("RefBase::incStrong() : mRefs=%d\n", ++mRefs);
}
void decStrong()
{
--mRefs;
printf("RefBase::d... |
cd9e859bb5f90dc06bdb0186758147e8ff9ebc83 | 5c7c80c2db94c3f33c9e0f388b75f8098dd64dfb | /MJMITSelection/src/ElectronLoader.cc | 29434c63f0c49d0cab1ad573cf00dd15d0b72281 | [] | no_license | violatingcp/BaconAnalyzer | 32bb9dc9348e60fe8a51e40ba6e08f56341d2ff7 | 56fd239dc28db5a2e439375f3419d8ec76b7bd6d | refs/heads/master | 2020-05-30T13:46:02.144704 | 2018-12-14T20:05:54 | 2018-12-14T20:05:54 | 23,576,559 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 9,771 | cc | ElectronLoader.cc | #include "../include/ElectronLoader.hh"
#include <cmath>
#include <iostream>
using namespace baconhep;
#define ELE_REFERENCE_IDMVA_CUT_BIN0 0.470 // pT<10, |eta|<0.8
#define ELE_REFERENCE... |
c3a362424be9506cab240fe4e641fe9c18cec219 | a5a99f646e371b45974a6fb6ccc06b0a674818f2 | /DetectorDescription/Core/src/Sphere.cc | 32c167f7eb86bb55405fe5288c30239c8752e443 | [
"Apache-2.0"
] | permissive | cms-sw/cmssw | 4ecd2c1105d59c66d385551230542c6615b9ab58 | 19c178740257eb48367778593da55dcad08b7a4f | refs/heads/master | 2023-08-23T21:57:42.491143 | 2023-08-22T20:22:40 | 2023-08-22T20:22:40 | 10,969,551 | 1,006 | 3,696 | Apache-2.0 | 2023-09-14T19:14:28 | 2013-06-26T14:09:07 | C++ | UTF-8 | C++ | false | false | 1,822 | cc | Sphere.cc | #include "DetectorDescription/Core/interface/Sphere.h"
#include "DataFormats/Math/interface/GeantUnits.h"
#include <cmath>
#include <ostream>
#include <vector>
#include "DetectorDescription/Core/interface/DDSolidShapes.h"
#include "DetectorDescription/Core/interface/Solid.h"
using namespace geant_units;
using namesp... |
83bfe1821357d674d6f4220f689f39fa4ce915b4 | ee2fc30bde48b274142340ce2aae8caccdf6b3b3 | /sling/nlp/wiki/wiki.h | b8f973a1302077647951053b4e064542057ab4ce | [
"Apache-2.0"
] | permissive | savkov/sling | 54c97ce44a1bc1842f353d719aee612147daae91 | f4e51c8077833205cb5786721dc0a9e85cf890a2 | refs/heads/master | 2020-04-08T16:26:09.915319 | 2018-11-26T14:02:13 | 2018-11-26T14:02:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,015 | h | wiki.h | // Copyright 2017 Google Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in ... |
fcdf1406878d3d5070ff08d7448f5b234e0f1f79 | bffb5982a832677386a198732bb486b874bda302 | /ATCCSOrm/src/at60plan.cpp | e11b6d2b44fa705bada7f52fbcb26ff9df8616c8 | [] | no_license | iamgeniuswei/ATCCS | 4e28b6f0063c1f4089b447fa3d00299350c1e416 | 5261b26fbf99cebd0909f06a7bb1bcf9e47cb5e2 | refs/heads/master | 2021-01-24T07:42:10.596733 | 2017-06-05T01:34:40 | 2017-06-05T01:34:40 | 93,351,146 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 399 | cpp | at60plan.cpp | /*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/*
* File: at60plan.cpp
* Author: lenovo
*
* Created on May 15, 2017, 5:06 PM
*/
#include "at60plan.h"
at60plan::at60plan()... |
6d219b23c841b3a09a99b57de21837432a6b9924 | 8528860bfa4e51d5fb5d35464a321fa88b27abc3 | /meta-heuristics-1.2/lib/edaFitContinue.cpp | b6c71326c2c1bf2f06e2a16b109aa52a56e50f24 | [] | no_license | mohcicin/metaheuristics | d9fd28bac54f401d89cd0800136b9a7c65a6fd32 | a112870b98626e35545f89a44898baadf0dba43d | refs/heads/master | 2021-05-01T07:54:56.274119 | 2016-04-26T00:51:17 | 2016-04-26T00:51:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 874 | cpp | edaFitContinue.cpp | #include "edaFitContinue.h"
edaFitContinue::edaFitContinue() {}
edaFitContinue::~edaFitContinue() {}
edaFitContinue::edaFitContinue(double _fitness)
: fitness (_fitness)
{
}
edaContinue *edaFitContinue::clone() const
{
return new edaFitContinue(fitness);
}
void edaFitContinue::init() {
edaContinue::init();... |
887595f215d7fc84b8e68a37dfa3b5c298692a0a | 36b9decf14d266d6babaf1c44085c2ba869c03ce | /Remnant-main/Remnant/SDK/Widget_ItemInfo_RangedWeapon_parameters.h | 92d0be65fd3d56614dfbfbde04e5a7ae6bdb3b3e | [] | no_license | RoryGlenn/RemnantLootSwitcher | 6e309a7b2b7bac88a166b552b640c830b863eb2d | 85c4cb6839b7c0f60cf8143c571d64ca12439a63 | refs/heads/master | 2022-12-29T08:47:15.713546 | 2020-10-23T22:01:45 | 2020-10-23T22:01:45 | 305,910,400 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,934 | h | Widget_ItemInfo_RangedWeapon_parameters.h | #pragma once
// Name: Remnant, Version: 6
#include "../SDK.h"
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
/*!!HELPER_DEF!!*/
/*!!DEFINE!!*/
namespace UFT
{
//---------------------------------------------------------------------------
// Parameters
//-----------------------------------------------------------... |
ba95bec892ce0d2060a4554e1daf03fd52d881d2 | c33f21036e8aeae3962e790b126ac5393a1ed441 | /AHOI2013-difference.cpp | 6d86f1c03c0ce6cf8129b57c2fb84de04d1f8785 | [] | no_license | BillYang2016/Codes | c840b310d0127421dae96c42f6e826b26ce8cd7f | 47e7c3ad2caa1ef1f62e56cd146a684309868e27 | refs/heads/master | 2021-01-24T12:04:26.562717 | 2021-01-11T11:32:45 | 2021-01-11T11:32:45 | 123,115,120 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,930 | cpp | AHOI2013-difference.cpp | #include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<climits>
#include<vector>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
typedef long long LL;
inline const int Get_Int() {
int num=0,bj=1;
char x=getchar();
while(x<'0'||x>... |
87a9d5547785ffe4eed579e89f058912c9a5e8dc | f06394eb49f055ce3a51c93eb56249350d64ddbb | /tests/generation-tests/xpand3/expression/RealLiteral.cpp | 01710900d7c23b1512ff97d6177ca52b24202ac0 | [] | no_license | happyj/e4c | a3c6eb523cf1d346a73b138c45a6cdfc83766710 | 59646a43d50749ddfc983e9a1f3a3c70fc5eb218 | refs/heads/master | 2020-03-26T05:15:09.814976 | 2014-02-22T11:20:12 | 2014-02-22T11:20:12 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 676 | cpp | RealLiteral.cpp |
#include "RealLiteral.hpp"
#include <xpand3/expression/ExpressionPackage.hpp>
using namespace xpand3::expression;
/*PROTECTED REGION ID(xpand3::expression::RealLiteral include) START*/
/*PROTECTED REGION END*/
RealLiteral::RealLiteral()
{
/*PROTECTED REGION ID(RealLiteral constructor) START*/
/*PROTECTED RE... |
aa651337075d1c6bd9ecb25d5ffd029e66babec7 | c69321e4bc0a15fdfed31ed96a5ca7ea05701063 | /ViennaTool/src/TSelectionAnalyzer.cc | 6bbfb74f4bd677a0da26137c8d336ac02aed11d9 | [] | no_license | jandrejk/FakeFactor | 1a49ebb7911e0dca1b641a2b59637983be0989c3 | f31f45d010e6f98b990c93adc1f81bd2f7f925c7 | refs/heads/FF_DeepTau_2016_v15 | 2022-10-30T09:55:59.965845 | 2020-03-25T10:07:28 | 2020-03-25T10:07:28 | 160,835,469 | 0 | 3 | null | 2020-06-25T09:12:04 | 2018-12-07T14:41:03 | C++ | UTF-8 | C++ | false | false | 6,993 | cc | TSelectionAnalyzer.cc | #include "ViennaTool/interface/TSelectionAnalyzer.h"
#include <iostream>
#include <sstream>
using namespace std;
TSelectionAnalyzer::TSelectionAnalyzer()
{
}
TSelectionAnalyzer::~TSelectionAnalyzer()
{
}
void TSelectionAnalyzer::calcBgEstSim(const TString preselection,const Int_t mode,const Int_t categoryMode,con... |
362110ea059a59cc5f183c59bab56ded76a02a57 | 717eed82b6c2301f670444cea24abbe9efa87818 | /mywidget.h | 19db62128176446c16fe03547572fe20ef590df1 | [] | no_license | xiehii/PlayControl | dc3ce53d72c2d670db0c40d24e95152492f6af12 | 7c1870fbdf217e87f21e47c424f36967771bd2b4 | refs/heads/master | 2022-11-05T23:15:31.716021 | 2020-06-18T01:32:15 | 2020-06-18T01:32:15 | 270,562,863 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 391 | h | mywidget.h | #ifndef MYWIDGET_H
#define MYWIDGET_H
#include <QWidget>
#include <QKeyEvent>
class MyWidget : public QWidget
{
Q_OBJECT
public:
explicit MyWidget(QWidget *parent = nullptr);
signals:
public slots:
void mouseDoubleClickEvent(QMouseEvent *event);
void keyPressEvent(QKeyEvent *event);... |
20d1f1fd498a3a8ce7dc47abd1b5c032c55336d3 | 22d862f350920a884187c60b6db2f953b05087f1 | /directed_graph_algorithms.cpp | dd846d01466d1b25cb77aae79fd80994ee2d4549 | [] | no_license | Initiator-Z/Directed-Graph | 3ed82b7109fa0619564f391f3ff554b7a31517c0 | ab326523646af469b5034ae558aa2137880309a9 | refs/heads/main | 2023-06-15T04:04:35.095750 | 2021-07-10T03:51:22 | 2021-07-10T03:51:22 | 312,147,987 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,624 | cpp | directed_graph_algorithms.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <array>
#include <list>
#include <forward_list>
#include <deque>
#include <map>
#include <cstddef>
#include <string>
#include <utility>
#include <algorithm>
#... |
9263d1b3614082c0fedf67d87814b70724c181ee | 988c8499c97c83099f193e6c0450636716fe685d | /question/cpp/include/main.cpp | 65ab3086eb7be19eda5bb5f2f6b1f50ef07ca89f | [] | no_license | ueumd/clang | febfd9b1567eaf021b69f4c807afafa6228f6b2a | a98a6eddb41647a22b5d148c2dd523ef13985885 | refs/heads/master | 2021-02-22T16:50:30.072296 | 2020-04-24T12:41:22 | 2020-04-24T12:41:22 | 247,006,609 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 414 | cpp | main.cpp | #include<iostream>
using namespace std;
/*
cpp 从上往下编译，要提前使用类，就要先声明类
类的声明，拓展作用域，只能创建指针或引用
A *p;
A &p;
A p;错误
*/
class A;
class B;
A *p;
void go(A &a) {
}
class A {
public:
//B b; //要先声明
B *b; //只能是指针或引用
};
class B {
public:
// 正确 A类在B类前定义
A *a;
A aa;
};
void main() {
cin.get();
} |
23eda59e5bf565ae428950e37e49b7495de8a71f | 697ece97d86013137f38b6049a6755a7fec6e693 | /code/tools/editor/DAE2Nebula3Writer.cc | c2f48d27cc92b10d66d28c8030d1afe450766b6f | [] | no_license | Chinamming/nebuladevice3 | 6ace3c9fd97632ed43743e8eb7fce151f976a906 | 1180cec07aff77da1e9f97cedbcfbf5b56c3630d | refs/heads/master | 2021-01-10T18:17:09.958301 | 2012-11-23T19:55:13 | 2012-11-23T19:55:13 | 47,537,441 | 3 | 2 | null | null | null | null | GB18030 | C++ | false | false | 18,595 | cc | DAE2Nebula3Writer.cc | //------------------------------------------------------------------------------
// DAE2NebulaWriter.cc
// (C) 2010 Dengwenyi
//------------------------------------------------------------------------------
#include "stdneb.h"
#include "DAE2Nebula3Writer.h"
#include "COLLADASaxFWLLoader.h"
#include "COLLADAF... |
500b50e8aeaaf10f0dd02ed77baf90cd7ea1de1c | e64317112ee970376062736c86ae0c09aea4ed61 | /BalancedParenthesis.cpp | b351a9c89eec5193f0b3f1b38447cf40d4afa5ef | [] | no_license | TheTypo36/c-BASIC-AND-DSA | 7af6652bf673c54d1162328682e2bb4eee5773fa | 2daa2deac16f39118f34367859888850c0f4a14d | refs/heads/master | 2022-12-26T23:03:08.470974 | 2020-09-22T04:18:07 | 2020-09-22T04:18:07 | 257,876,316 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,088 | cpp | BalancedParenthesis.cpp | #include <bits/stdc++.h>
using namespace std;
bool checkBalanced(char *exp)
{
stack<int> s;
int i = 0;
while (exp[i] != '\0')
{
if (exp[i] == '{' || exp[i] == '(' || exp[i] == '[')
{
s.push(exp[i]);
}
else if (exp[i] == '}' || exp[i] == ')' || exp[i] == ']')
... |
c253b668e3e83cc27642df7b28d5d77df478c866 | e469bb4d5833340dd63b3dcd7748081cd8c89120 | /Lucuma/code/lucuma/utils/allocator.h | ea5755cdd1cf3e731a20d6a34943cc175b2291c9 | [] | no_license | bitnenfer/Lucuma | 440fcfa23aa9749b73398eb1c9d18be732b5829c | 7e4230f4bda6b55e46156f54f58389fab3379052 | refs/heads/master | 2020-04-26T07:25:57.155061 | 2019-03-17T02:15:36 | 2019-03-17T02:15:36 | 50,359,578 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 407 | h | allocator.h | #pragma once
#include "../types.h"
namespace lu
{
struct IAllocator
{
virtual void* allocate(uint64_t size) = 0;
virtual void* allocateAligned(uint64_t size, uint32_t alignment) = 0;
virtual void deallocate(void* p) = 0;
virtual void reset() = 0;
virtual uint64_t getCapacityInBytes() = 0;
virtual uint64... |
04a6885d67ced77a700d4f169745c7bae29f662d | c0438cae3adfb762c87d2c43bc1095bc0c123627 | /Linked List/Delete nth node from end.cpp | bef147e075d71a7c6fffc876af94f1f47737bcb3 | [] | no_license | SubhradeepSS/dsa | 6705ae2c27e73dd8b9eb3557fa5c255b54e6c746 | 3d4cf60c298e1c93ce458690f3e01940232d5099 | refs/heads/master | 2023-08-14T18:14:09.254692 | 2021-10-06T18:13:13 | 2021-10-06T18:13:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 650 | cpp | Delete nth node from end.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode *t=head;
if(head->next==NULL)
return NULL;
... |
528910e6d0f97a462fa3d943fc5c8b24026602e1 | 97c63d5416761fd3ec8ab9080f28fac27be29fbe | /randompartition_test.cc | 73791cd1f941f1ce8b2af31fb589eecf231bd5ce | [] | no_license | megangoodland/PHY1610_4 | 0d1bc3d70847a6530d5dc1067aa1b7d919249eb0 | c06f6069786871ea9e4cd578245b2b5cc0e42f26 | refs/heads/master | 2020-04-22T07:00:21.855847 | 2019-02-14T23:33:27 | 2019-02-14T23:33:27 | 170,191,906 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,265 | cc | randompartition_test.cc | // Megan Goodland, University of Toronto
// February 2019
// Tests for the randompartition module, which performs:
// Implementation of the function to randomly divide a number 'total'
// into a set of 'numdivision' numbers that add up to 'total'. Uses
// c++11 random library to generate the randomness.
// >>> Want a... |
b944fc7347f5c17662e354289304c15eb784139a | cc3eb9fa166df91a4ed3b3b90c705a57b5bab2da | /HtmlParser.h | de46e2dfd2da64776314e41f4158778094030d42 | [] | no_license | ljxcript/my-tiny-rendering-engine | f9df788ecb40eecaf2b5d1425cfec17b062a119a | fbe189905bb46f3ad1ed49b521b91835b9e82c62 | refs/heads/master | 2021-07-09T21:20:02.058212 | 2020-08-14T10:13:30 | 2020-08-14T10:13:30 | 181,303,905 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 554 | h | HtmlParser.h | //
// HtmlParser.h
// my-tiny-browser
//
// Created by marco.liao on 2019/4/18.
// Copyright © 2019年 marco.liao. All rights reserved.
//
#ifndef HTMLPARSER_H
#define HTMLPARSER_H
#include <string>
#include "HtmlTagNode.h"
class HtmlParser
{
private:
std::string htmlText;
HtmlTagNode* root;
public:
Html... |
9e2a7a149584d5c2afcb7f011af9346ec10b902e | e7a39a0c555e01d692a3d41eed3a95f1f1babec5 | /code/server/lua_service_origin/lua_libs/try_use_lualib/try_use_lualib.cpp | 9dfe34b9b8cfa5939cac4631d8cb65ab1a3029ee | [
"MIT"
] | permissive | UtopiaCoder/utopia_origin | 0181f34a0ad2788690206ce021681c08668cb5f6 | e9ce25193c21264b1d896d18ae8a472e3d54370c | refs/heads/master | 2020-04-14T01:12:23.569426 | 2019-03-21T06:40:38 | 2019-03-21T06:40:38 | 163,554,708 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 762 | cpp | try_use_lualib.cpp | #include "try_use_lualib.h"
#include <stdio.h>
static int log_msg(lua_State* L)
{
printf("execute log_msg\n");
return 0;
}
static const struct luaL_Reg mylib[] =
{
{ "log_msg", log_msg },
{ NULL, NULL }
};
static int do_openlib(lua_State *L)
{
luaL_newlib(L, mylib);
return 1;
}
static int other_log_msg(lua_Stat... |
873367cdcf55bf3d07733120f9c8630496edc717 | 2124d0b0d00c3038924f5d2ad3fe14b35a1b8644 | /source/SEAL_Foundation/PluginManager/src/PluginManager.cc | 689510981261cebd83f644ddc71d54b80b0c2717 | [] | no_license | arceciemat/GAMOS | 2f3059e8b0992e217aaf98b8591ef725ad654763 | 7db8bd6d1846733387b6cc946945f0821567662b | refs/heads/master | 2023-07-08T13:31:01.021905 | 2023-06-26T10:57:43 | 2023-06-26T10:57:43 | 21,818,258 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 19,154 | cc | PluginManager.cc | //<<<<<< INCLUDES >>>>>>
#include "PluginManager/PluginManager.h"
#include "PluginManager/PluginInfo.h"
#include "PluginManager/PluginFactoryBase.h"
#include "PluginManager/ModuleCache.h"
#include "PluginManager/Module.h"
#include "debug.h"
#include "PluginManager/... |
5de3cde9cd88517fc8e5546d9dec4c5e3818d50e | e0e300cf28f9a40010c3d906c42c63aa1c1e230d | /cpp-module/test/AdjacencyListGraphTest.cpp | b8562b29e764d568009f902dc734c254b699b501 | [] | no_license | girone/forestmaps | 88170ece1858ff042365826123036b1b7a29cb62 | 52852ba6eacbb665898f25c490df80c6c1a7c069 | refs/heads/master | 2021-03-19T16:37:24.668219 | 2015-04-26T21:06:16 | 2015-04-26T21:06:16 | 27,169,437 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,439 | cpp | AdjacencyListGraphTest.cpp | // Copyright 2013: Jonas Stegraphisko
#include <gtest/gtest.h>
#include <gtest/gtest_prod.h>
#include <string>
#include <vector>
#include "../src/AdjacencyGraph.h"
#include "../src/GraphConverter.h"
#include "../src/GraphSimplificator.h"
#include "../src/Util.h"
using std::string;
using std::vector;
// A test node.
... |
548d20d95adbfbf0eb2e92fffff08836d1176bd7 | e3297b5bb8e039be8819a17fe3e1949dbc889bd7 | /03 - August 25/I/I.cpp | e03304b4c72386fdb5cdb03b0145337efd6b73b8 | [] | no_license | thomasokubo/MC621 | 3111ebf8573bd4fc58cc3256ed48e9ae7bd250b3 | ad4979f42c952cf78550823583a123e3f7d33003 | refs/heads/master | 2020-03-24T05:32:47.819445 | 2018-10-06T19:10:49 | 2018-10-06T19:10:49 | 142,493,048 | 0 | 0 | null | 2018-10-06T19:10:50 | 2018-07-26T20:54:11 | C++ | UTF-8 | C++ | false | false | 1,880 | cpp | I.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef map<int, int> mii;
ll _sieve_size;
bitset<10000005> bs;
vi primes;
void sieve(ll upperbound) {
_sieve_size = upperbound +1;
bs.set();
bs[0] = bs[1] = 0;
for (ll i = 2; i <= _sieve_size; i++)
if (bs[i]) {
... |
4758e67137712cc480c525167b435ab223c4da06 | b2584bc3c232dde6660b4116dc6e2666714c0984 | /VirtualKeyboard_Key.cpp | 784b6c0ca4e1d6f62a1e7970cc07dc685c331d01 | [
"Apache-2.0"
] | permissive | pl17/VirtualKeyboard | f6d7a004ebf442730029d6983d9463e6a400b364 | 419454f2d8923522f435ba0f9ec6dd2e4f503292 | refs/heads/master | 2020-03-29T01:25:47.712834 | 2018-09-19T03:52:19 | 2018-09-19T03:52:19 | 149,388,443 | 0 | 0 | Apache-2.0 | 2018-09-19T03:54:52 | 2018-09-19T03:41:14 | C++ | UTF-8 | C++ | false | false | 3,503 | cpp | VirtualKeyboard_Key.cpp | #include "VirtualKeyboard_Key.h"
VirtualKeyboard_Key::VirtualKeyboard_Key()
:Button_Square(NULL, 0, 0, 0, 0, NULL, 0)
{
this->_Init(FALSE, FALSE, TRUE, FALSE);
}
VirtualKeyboard_Key::VirtualKeyboard_Key( HWND hParent, int left, int top, int width, int height, int id, BOOL bPush, BOOL bControl, BOOL bFullDisplay, BOO... |
ada440a605ecbeced7ed2b56bfb719e64bd21700 | 004b80d4a27868f8248e17aad226b19861f3dc55 | /keyboard_multitone.ino | 531203a52389ba392b0c6bf8e0ed943ef667f25f | [] | no_license | mit-mit-randomprojectlab/keyboard_multitone | a73998637cd95be994f3e0016f93a684aeb79b3c | db467e82948b3326a84224e80628fa9aded40473 | refs/heads/master | 2021-01-11T01:32:59.831341 | 2016-10-12T11:16:02 | 2016-10-12T11:16:02 | 70,691,674 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 10,645 | ino | keyboard_multitone.ino | /*
keyboard_multitone - sketch to test basic keyboard matrix using teensy
and using a custom implementation of "Tone" (square-wave generation) that uses
all four PIT timers to generate up to four simultaneous tones.
Code for PIT timers largely derived and simplified from Teensy "IntervalTimer.cpp" in
hardware/teensy... |
524dc2ac79b318863422f4c245288054fce3c4b3 | da09c47cd83e1b5a7870c454dd4c73fe4a9aa6e4 | /hello_world.cpp | 4e5938564a416b011cc0d7185877b1410643dfe3 | [] | no_license | myk7hackon/SystemC-Introduction | f30e84dc70ed69868da07b958f5213444f04c1db | 1dd6d2bfb2cb08e42dc71cadfaf1afcecc5c2a00 | refs/heads/master | 2020-03-31T04:49:25.259818 | 2018-10-07T08:34:29 | 2018-10-07T08:34:29 | 151,921,102 | 0 | 0 | null | 2018-10-07T08:33:13 | 2018-10-07T08:33:13 | null | UTF-8 | C++ | false | false | 555 | cpp | hello_world.cpp | #include "systemc.h"
#include <iostream>
SC_MODULE(simple_process_ex) {
sc_time t;
void my_thread_process(void);
SC_CTOR(simple_process_ex) {
t = sc_time(10, SC_NS);
//SC_THREAD(my_thread_process);
}
};
void simple_process_ex::my_thread_process(void) {
std::cout << "MY THREAD EXECUTED\n"<<name()<<st... |
098f07ade366d2382b9ba593428ec8bb344afacf | a33aac97878b2cb15677be26e308cbc46e2862d2 | /program_data/PKU_raw/103/798.c | 40678f9863e9fb2fe8d7547ed810da4c864e85ae | [] | no_license | GabeOchieng/ggnn.tensorflow | f5d7d0bca52258336fc12c9de6ae38223f28f786 | 7c62c0e8427bea6c8bec2cebf157b6f1ea70a213 | refs/heads/master | 2022-05-30T11:17:42.278048 | 2020-05-02T11:33:31 | 2020-05-02T11:33:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 436 | c | 798.c | int main()
{
char str[1010], mark;
int i, j, sum;
cin >> str;
i = j = 0;
do{
sum = 0;
do{
j++;
sum++;
}while(str[i] - 'A' == str[j] - 'A'
|| str[i] - 'A' == str[j] - 'a'
|| str[i] - 'a' == str[j] - 'A');
if (str[i] >= 'a' && str[i] <= 'z')
mark = str[i] - 'a' + 'A';
els... |
a8554d256b4ee48e0be5da9b53414276762c3ca4 | d82bf080ddd6caadf252f40d204d46e3f7fae42f | /kursova/basemanager.cpp | 195476f53585d8a99f31479f15d3b70e0b4ebf36 | [] | no_license | asofter/kpz-university | c190d620317bcbf99d29e085b3da22e177290a6f | 39acf69728c6921e11861e1b487f13baf0c9251d | refs/heads/master | 2020-06-05T22:34:26.199105 | 2014-05-29T08:36:01 | 2014-05-29T08:36:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,033 | cpp | basemanager.cpp | #include "basemanager.h"
BaseManager::BaseManager(QObject *parent) :
QObject(parent)
{
QSqlDatabase db = QSqlDatabase::addDatabase("QSQLITE");
db.setDatabaseName("catalog.sqlite");
bool ok = db.open();
qDebug()<<ok;
// Init models
categoryModel = new CategoryModel();
subcategoryModel =... |
484688d6346af87170c7cd9f04ce46aad943a3b7 | 091afb7001e86146209397ea362da70ffd63a916 | /inst/include/nt2/include/functions/scalar/function_index.hpp | 3980a16d1fe4f47ca7ce1e6ea06d06f80222984c | [] | no_license | RcppCore/RcppNT2 | f156b58c08863243f259d1e609c9a7a8cf669990 | cd7e548daa2d679b6ccebe19744b9a36f1e9139c | refs/heads/master | 2021-01-10T16:15:16.861239 | 2016-02-02T22:18:25 | 2016-02-02T22:18:25 | 50,460,545 | 15 | 1 | null | 2019-11-15T22:08:50 | 2016-01-26T21:29:34 | C++ | UTF-8 | C++ | false | false | 203 | hpp | function_index.hpp | #ifndef NT2_INCLUDE_FUNCTIONS_SCALAR_FUNCTION_INDEX_HPP_INCLUDED
#define NT2_INCLUDE_FUNCTIONS_SCALAR_FUNCTION_INDEX_HPP_INCLUDED
#include <nt2/core/include/functions/scalar/function_index.hpp>
#endif
|
a658983dd44b114873ff2c7e680074218c2ec8f9 | 6467bb08e02e7bb47a59ad7d512926d70da3c5f5 | /tags/http_v4_committed/themis/modules/HTMLParser/DeclarationParser.hpp | 173d03ee4831be3e658d501600d25237cd403300 | [] | no_license | svn2github/Themis | 1ed26434317a30c61e751eb9800ea96077b6c73c | 20be549491930fe86246ff748c55139201ead7a8 | refs/heads/master | 2020-12-25T15:28:53.785606 | 2018-03-12T21:55:53 | 2018-03-12T21:55:53 | 61,454,928 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 921 | hpp | DeclarationParser.hpp | /* DeclarationParser
Provides the base functionality for declaration parsers
Mark Hellegers (M.H.Hellegers@stud.tue.nl)
12-04-2003
*/
#ifndef DECLARATIONPARSER_HPP
#define DECLARATIONPARSER_HPP
// Standard C++ headers
#include <map>
#include <string>
// SGMLParser headers
#include "BaseParser.hpp"
#include "Po... |
66b38268e819def1a0d735aee4283de32d13aa8d | b960608c94682165cb8e5c7674b614601152d396 | /com_meigSmart_RecoveryMp4_MainActivity.cpp | 29efdecc49aaba82702aa537d1e95e93ddafa1d5 | [] | no_license | BestAndroider/mp4-recovery-untrack-with-no-moov | e21ede17c9981889c4f2b1acbb26481e77008e54 | ccb85373795f791299a92cb57a9ccff1e323cb5c | refs/heads/master | 2021-01-05T16:33:35.614274 | 2018-05-29T06:15:54 | 2018-05-29T06:15:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,892 | cpp | com_meigSmart_RecoveryMp4_MainActivity.cpp | #include <jni.h>
#include "mp4.h"
#include "atom.h"
#include "com_meigSmart_RecoveryMp4_MainActivity.h"
using namespace std;
//将const char类型转换成jstring类型
jstring CStr2Jstring0(JNIEnv* env, const char* pat )
{
// 定义java String类 strClass
jclass strClass = (env)->FindClass("java/lang/String;");
// 获取java Str... |
94ca4570fd7187394867e5b54fe904248595356b | 174d618939a1218b18d87bffa1f139e98b40cae7 | /src/plugins/detector/LumiGEM/LumiGEMlib/clustering/cClusterFinder.cxx | 6668e9b5cc21ce56a0d1e874098bef2c73d7de17 | [] | no_license | bishoyDHD/museMiniCkr | 5188183af70a67f75bc48802a3d7d2607e20b7b4 | d40f3978376bb760d80edb23249ca9e124a4efb3 | refs/heads/master | 2020-07-24T12:10:08.697014 | 2019-09-13T19:15:38 | 2019-09-13T19:15:38 | 207,921,163 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,745 | cxx | cClusterFinder.cxx | #include "TGraph.h"
#include "TMath.h"
#include "math.h"
#include "cClusterFinder.h"
////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
cClusterFinder::cClusterFinder(int nx, int ny)
//! Constructor for the GEM Hit Finder
//! nx, ny are the ... |
409fa47e017fd2dae83c26960a0c047f9d7b1ddf | 0c0af780e498f93c700b06f649b864d3e75fd56f | /src/Pleiades_panel.hpp | 5debd5b1aa76f82ae1c9d8325709fbc806a72c9f | [] | no_license | wlaub/vcv | fdb338b69fcfd33c1a1f011837b6bb831864254f | 9d52e49ba0a92a51b733218e02202549b7fb4bf2 | refs/heads/main | 2022-12-22T19:35:36.824217 | 2022-12-18T21:54:59 | 2022-12-18T21:54:59 | 117,328,087 | 10 | 4 | null | 2022-02-06T17:54:06 | 2018-01-13T08:41:12 | C++ | UTF-8 | C++ | false | false | 4,355 | hpp | Pleiades_panel.hpp |
ParamWidget* param;
PortWidget* input;
PortWidget* output;
LightWidget* light;
input = createInputCentered<PJ301MPort>(
Vec(240.362745,45.429099), module, Pleiades::INPUT_CLOCK
);
addInput(input);
input = createInputCentered<PJ301MPort>(
Vec(87.63... |
ff26e2b65b644ddc3295601997afef8f74b4d557 | 580f51a5344f94a5a31b2a19943e60ad973e96bc | /sora_test/free_list_block_pool_test.cpp | 94066008f33f71df892a941c58bb1fe2f9ab253d | [] | no_license | weimingtom/sora_old | e22b844d71b99e73fba33309977cca51e7f93d2c | 45f842b3d40948542b859a6e21bed898ab542b6f | refs/heads/master | 2021-01-16T19:11:07.138568 | 2012-05-21T15:46:14 | 2012-05-21T15:46:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,183 | cpp | free_list_block_pool_test.cpp | // Ŭnicode please
#include "sora_test_stdafx.h"
#include "free_list_block_pool.h"
#include <cmath>
using namespace sora;
class KarenBlockTestObj {
public:
KarenBlockTestObj() : a(1) { cnt++; }
~KarenBlockTestObj() { cnt--;}
public:
int a;
static int cnt;
};
int KarenBlockTestObj::cnt = 0;
TEST(FreeListBloc... |
fafb1a079f1875aa34ab15db10d48367a07a7df9 | 1645ae1285223039cada7f6d436febc4f0e223ad | /Step4_tmva/src/Histograms.cc | dcb59d1acf82fbaec27ef17bbf5a8c1d3147bdb2 | [] | no_license | jordix/analysis-case-study | 2116a6afa9d39788abeb76f054ceb6b36c15820b | 22b3fd1a53d3b624d3bd5ae93eba6e326f3d20cb | refs/heads/master | 2021-01-01T20:35:45.031007 | 2017-08-30T09:03:34 | 2017-08-30T09:03:34 | 98,889,175 | 0 | 0 | null | 2017-07-31T13:00:13 | 2017-07-31T13:00:13 | null | UTF-8 | C++ | false | false | 1,786 | cc | Histograms.cc | #include "TCanvas.h"
#include "TStyle.h"
#include "TH1.h"
#include "TH1F.h"
#include "TGaxis.h"
#include "TRandom.h"
#include "TFile.h"
#include "TTree.h"
#include "TBranch.h"
#include "TTreeReader.h"
#include "TTreeReaderValue.h"
#include "TTreeReaderArray.h"
#include "TString.h"
void Histograms()
{
//variables used... |
28d7e74bf1365c015b30479e7d249e1ecc20bab3 | 8e25b8ade9e4b6e076fcb2a1a7cb31326bc66526 | /src/lower-bound.h | a489821583b769c22d8fba406b21566b57dad585 | [
"MIT"
] | permissive | yvs314/dp-monster | 5aa3f87cacc17d5130d62f31f8ebe729151c7975 | 15addeb4a4dd8c66302f92a719b849ac99cfbefc | refs/heads/master | 2023-07-17T13:04:22.540700 | 2021-08-17T23:00:41 | 2021-08-17T23:00:41 | 179,075,428 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,639 | h | lower-bound.h | /*
(c) Yaroslav Salii & the Parliament of Owls, 2019+
License:sort of CC---if you go commercial, contact me
lower-bound v.1.0 2019-01-24;
v.1.1 2019-01-28; added el-Cheapo LB; TODO: replace + with ExtMt or whatever
compute lower bounds on problem instances
NB! v.1.0 is TSP(-PC)-only, might not hand... |
236dcba2332a668bf884a77574d488b01e38927e | ec82fa3d4094b5113b10bc9d21877e82c0fe4244 | /src/ssp_gui_3d/dlgsaveviewpoint.cpp | f9cf9e73745083b8814894232cacc20ef11c4533 | [] | no_license | song-kang/SSP01_tag20190423 | 512f547fee29b648c11ba57e2a5db320a57cba8f | ca0bb4155a5907a8f1551e887dcaa0172ac7e80d | refs/heads/master | 2023-06-27T14:06:28.872089 | 2021-07-26T03:19:27 | 2021-07-26T03:19:27 | 280,988,265 | 1 | 2 | null | null | null | null | GB18030 | C++ | false | false | 6,804 | cpp | dlgsaveviewpoint.cpp | #include "dlgsaveviewpoint.h"
#include <QMessageBox>
#define COLUMN_SCENE_ID 0
#define COLUMN_VP_ID 1
#define COLUMN_DEFAULT 2
#define COLUMN_NAME 3
DlgSaveViewPoint::DlgSaveViewPoint(QWidget *parent)
: QDialog(parent)
{
ui.setupUi(this);
init();
connect(ui.pushButton_ok,SIGNAL(clicked()),this,SLOT(slotOk(... |
cdb23af85eb765907c039c8213119f3d3eb45642 | bb04f391bb0a0bd5f7e146d35241744b9a09bd79 | /entities/StraightDownEnemy.h | 4cce2e797494aa5879d57dea97a9afd2eda2c0eb | [] | no_license | scurvysteve/galaga-esque | e4dcb475e10eaff64a30eaab336903847ac15fd3 | 3447430eea665a9ce8d3b8e34da71d7f755d98df | refs/heads/master | 2020-12-25T11:05:51.883875 | 2013-09-09T04:55:21 | 2013-09-09T04:55:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 427 | h | StraightDownEnemy.h | /*
* StraightDownEnemy.h
*
* Created on: Feb 25, 2013
* Author: joe
*/
#ifndef STRAIGHTDOWNENEMY_H_
#define STRAIGHTDOWNENEMY_H_
#include "GenericEnemy.h"
class StraightDownEnemy : public GenericEnemy {
public:
StraightDownEnemy();
StraightDownEnemy(int initialX, int initialY);
virtual ~StraightDownEne... |
b75a460a6f19b746bdc48b20e71dbce93e64725e | a769885b3343d7072ecf25b8d2afe3f351369bf6 | /linked-list/node.cpp | 56e8e70ed462e4657869481cc2329ebe183ce3fd | [
"MIT"
] | permissive | rohitkhilnani/cpp-And-Me | caa38f9133526a5684b4140f0c46f11954657611 | 826611fb78b63d25cc7cac19425fd55749e169b6 | refs/heads/master | 2021-01-10T05:15:17.112605 | 2016-02-07T04:43:58 | 2016-02-07T04:43:58 | 49,747,925 | 0 | 0 | null | 2016-02-07T04:43:58 | 2016-01-15T22:12:55 | C++ | UTF-8 | C++ | false | false | 473 | cpp | node.cpp | /*
Definition for node.h
*/
#include "node.h"
// constructs Node with specified value
Node::Node(int val){
value = val;
}
// constructs Node with default values
Node::Node(){
}
// sets value
void Node::setValue(int val){
value = val;
}
// sets next pointer
void Node::setNext(Node* n){... |
917b62f95f7ec3d561493c22a7cb5f101cf249c5 | 24830dd6470819417a56cfa3d419569d942ceaf1 | /Day30/day30.ino | b954beb6f03abe5da77eb468ccfd8f5383316d7f | [
"MIT"
] | permissive | stevelyons/31DaysOfArduino | 693a95c10b5a1519eab4c1a84df93f45302ccd42 | 1041556e51f08d67d2e83314568fe502c18be159 | refs/heads/master | 2016-09-05T10:46:10.337333 | 2015-10-25T03:06:07 | 2015-10-25T03:06:07 | 34,935,207 | 0 | 1 | null | 2015-10-24T01:06:52 | 2015-05-02T04:09:33 | Arduino | UTF-8 | C++ | false | false | 42 | ino | day30.ino | // Steve Lyons
// Day 30 - May 30th, 2015
|
62d522cab3041b2b0eb8062dd702de65fb1b3cd2 | a6bdc5008be5c5f9fb624a1fa8eea4a95753ae06 | /Graph Power Library.cpp | 001b72322e52ae44d0cbfcbfc30bef1ada0e558f | [] | no_license | phpduke/Algorithms-Notebook | b6a9a5f83d5fd95624d04d8e1fcf12f46e487718 | ff34384bdd970fa6bf44b4a7e042aca25af900f7 | refs/heads/master | 2023-05-30T01:13:15.099728 | 2023-05-21T12:21:42 | 2023-05-21T12:21:42 | 161,853,573 | 6 | 4 | null | 2023-05-25T11:20:50 | 2018-12-15T00:06:46 | C++ | UTF-8 | C++ | false | false | 5,213 | cpp | Graph Power Library.cpp | #include <bits/stdc++.h>
using namespace std;
//COPY THE BLACKBOX, there is no need to change anything in it.
//Check the main function at bottom for USAGE
//****************BLACKBOX START*****************
//START COPYING FROM HERE
typedef int ll;
class Graph {
bool is_directed;
public:
vector<vector<pair<... |
00104ef662f98d14e988f9d69dedb1a504f83201 | b1aed5e3c9249c4c4eee3ddc548681f95d7c6754 | /fixed report/src/a39/endPoint.cc | 28d976cddd45a27dfe57a9df0c49ff3e0179d6f9 | [] | no_license | franksnightmare/c-2week6 | 46e54d232e3af06e3379e1d3973b0a340cbbb98a | b72dd0d7ce16e649dbd1132f918766c87dac0fb0 | refs/heads/master | 2021-01-11T10:32:57.223297 | 2016-12-21T21:14:14 | 2016-12-21T21:14:14 | 76,350,443 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 93 | cc | endPoint.cc | #include "main.ih"
void watch::endPoint()
{
d_end = std::chrono::system_clock::now();
}
|
3fe68626e4d9b389b0a97608a13c18ba9e855891 | 11c17e0f68e2769521efb4568ed848e0c541afff | /SP1Framework/combatRender.h | 2779d229d2ae5b1edcdffe05748883ec6f51e722 | [] | no_license | X3RO101/SP01T11 | 369541a77089104ef48f70d22d342b315865a393 | 0c1e4db5488289bf10ce073268c83298474249c4 | refs/heads/Master | 2020-03-26T03:43:21.200889 | 2018-08-29T01:12:45 | 2018-08-29T01:12:45 | 144,468,127 | 0 | 0 | null | 2018-08-23T09:36:13 | 2018-08-12T13:16:57 | C++ | UTF-8 | C++ | false | false | 1,175 | h | combatRender.h | #pragma once
#ifndef COMBAT_H
#define COMBAT_H
#include <iostream>
#include <string>
#include <fstream>
#include <random>
#include <ctime>
#include "Framework/console.h"
#include "Container.h"
using namespace std;
// functions in the combatRender.cpp are the logic and initialisations
// rendering text shall be in game... |
96c8ec74e6f64b457d1c62c1e9aa3ba0f368ca42 | f1144b64dba3b30168065030ac0f017a655555d0 | /Source/Enlight/ReactiveMonologStruct.h | e4f9a7487c529b44dbc307763adf614df942efe4 | [] | no_license | V41U/Enlight | 4d9ee0fa79e2fb07cf3092e2aa0cf27ab4115c4c | 558efd614d50b0eec264f4df0a70e58918242eaf | refs/heads/master | 2023-01-02T14:40:42.199073 | 2020-10-27T18:10:54 | 2020-10-27T18:10:54 | 302,003,580 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,093 | h | ReactiveMonologStruct.h | // Enlight Game 2019
#pragma once
#include "CoreMinimal.h"
#include "Containers/Set.h"
#include "Containers/Array.h"
#include "MonologStruct.h"
#include "ReactiveMonologStruct.generated.h"
/**
*
*/
USTRUCT(BlueprintType)
struct FReactiveMonologStruct
{
GENERATED_USTRUCT_BODY()
public:
UPROPERTY(EditAnywhere, Bl... |
99cb66cfb2329a41874ab7a6293449d45eb07bdf | 6b40e9dccf2edc767c44df3acd9b626fcd586b4d | /NT/inetcore/connectionwizard/icwutil/server.h | d8ddf0939e3ef149ddaf7ae2305a63ade46efc06 | [] | no_license | jjzhang166/WinNT5_src_20201004 | 712894fcf94fb82c49e5cd09d719da00740e0436 | b2db264153b80fbb91ef5fc9f57b387e223dbfc2 | refs/heads/Win2K3 | 2023-08-12T01:31:59.670176 | 2021-10-14T15:14:37 | 2021-10-14T15:14:37 | 586,134,273 | 1 | 0 | null | 2023-01-07T03:47:45 | 2023-01-07T03:47:44 | null | UTF-8 | C++ | false | false | 1,521 | h | server.h | //**********************************************************************
// File name: server.h
//
//
//
// Copyright (c) 1993-1996 Microsoft Corporation. All rights reserved.
//**********************************************************************
#if !defined(SERVER_H)
#define SERVER_H
// String Ma... |
e35e826d114b569e7b6e6dada60b3f39aa400f93 | 8df11d7ea4ba95bd580795756a723b69e041d133 | /esp8fachrelaisnodemcu_win_V1.ino | 4a51667cc05567d9c5815f0f27a07c9d2c712d40 | [] | no_license | gitWeissenburger/ESP-8Kanal-Relais-MQTT | 22b39f9678d1a0b76ed3f16b7a978c4785f268dc | 856873639c286f096b4b656c260daf980fd089b3 | refs/heads/master | 2022-12-21T23:14:13.213081 | 2020-09-26T17:35:04 | 2020-09-26T17:35:04 | 289,476,085 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 10,558 | ino | esp8fachrelaisnodemcu_win_V1.ino |
#include <ESP8266WiFi.h>
#include <EEPROM.h>
#include <PubSubClient.h>
const char* ssid = "Deine SSID";
const char* password = "Dein WLAN Passwort";
const char* mqtt_server = "IP Adresse deines Brokers";
WiFiClient espClient;
PubSubClient client(espClient);
long lastMsg = 0;
char msg[50];
int value ... |
564d3aba27b74e405dd9a2b4536e9119d3a58b0c | ddc01ee5b3bd1da787af82e295bbb99a7df768e9 | /Modules/Numerics/Statistics/test/itkUniformRandomSpatialNeighborSubsamplerTest.cxx | 4c8a1e0302619eeb553060c9ec78c58d16b74ac4 | [
"Apache-2.0",
"LicenseRef-scancode-proprietary-license",
"LicenseRef-scancode-unknown-license-reference",
"SMLNJ",
"BSD-3-Clause",
"LicenseRef-scancode-free-unknown",
"libtiff",
"MIT",
"LicenseRef-scancode-warranty-disclaimer",
"LicenseRef-scancode-public-domain",
"BSD-2-Clause",
"IJG",
"Zli... | permissive | Pandinosaurus/ITK | 6e8139fe54163aaa8df65faaf61eff2deb0c08d9 | f7504ec17a6606736a05b572a4da2b8cdd88c6fa | refs/heads/master | 2023-08-31T16:07:53.282289 | 2021-04-23T00:41:35 | 2021-04-23T00:41:35 | 180,342,894 | 1 | 0 | Apache-2.0 | 2021-04-23T13:31:22 | 2019-04-09T10:29:33 | C++ | UTF-8 | C++ | false | false | 4,051 | cxx | itkUniformRandomSpatialNeighborSubsamplerTest.cxx | /*=========================================================================
*
* Copyright NumFOCUS
*
* 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.or... |
b741cd2fbe26a0010d575b8cd44c308ce5dd9c25 | acb26867f7425c166a74eab8c607815161a42365 | /gameof31.cpp | 12d6744dbfab18ed9a1fcee54d99ea84a3df5a4f | [] | no_license | Abdullah-Sheikh/Hacktoberfest-2021 | fa93424835e812d4565fbc6a3a96ca58d42a4b51 | 510ac063675096aefaf14ba53a3f28419d96980e | refs/heads/master | 2023-08-20T00:49:02.842193 | 2021-10-29T15:20:48 | 2021-10-29T15:20:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,958 | cpp | gameof31.cpp | /*
**** Written in Cpp. *****
** By Muhammad Abdullah (github.com/Abdullah-Sheikh) **
* contact me: abdullahsh123@hotmail.com *
**!! Feel free to... |
f02670a3bb909591adf918965deb94731fe3a326 | 79dd7d57e2cac14e8a948268605e1be0e74a7d25 | /collider/src/collider.cpp | 58aa474d8244090bd34ea4c03dea43fca82d443f | [] | no_license | shaun-edwards/arm_navigation_experimental | 2f473a6683a2dd9b38f7b1765f6e0bb2ddf5cb7e | f4ccaf716962fe8e356c87c00984cf6510a1783b | refs/heads/master | 2021-01-24T23:01:17.125537 | 2014-09-04T04:01:15 | 2014-09-04T04:01:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 48,567 | cpp | collider.cpp | /*********************************************************************
*
* Software License Agreement (BSD License)
*
* Copyright (c) 2010, Willow Garage, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the follow... |
c0de6e7a308b8e0e9d16b760ee994e46a7d62d27 | 0034c069d5815c71c4252ff7cb4e755712425eaf | /src/Interfaces/RankDataContext.h | 580c144574026758c7558f64d4e4292238ea35ca | [
"Apache-2.0"
] | permissive | niuchenglei/rankextor | 3f3c912cf0c872509a35a67ebd4c636b080003e1 | 342e39dda8347b0986f6d2be9968ee72a90b16c2 | refs/heads/master | 2020-12-03T11:34:17.113500 | 2020-01-02T03:29:20 | 2020-01-02T03:29:20 | 231,300,419 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 6,336 | h | RankDataContext.h | #ifndef RANK_DATA_CONTEXT_H
#define RANK_DATA_CONTEXT_H
#include <time.h>
#include <mutex>
#include <thread>
#include <unordered_map>
#include "json/json.h"
#include "Interfaces/CommonType.h"
#include "Interfaces/ConfigurationSettings.h"
#include "Interfaces/PredictContext.h"
#include "Interfaces/RedisManager.h"
#incl... |
8d2322bb7de0a07d3b9bdfe58b20ac094869111b | 0ba1f65704a4b678f9705c5632daf32a9c67990d | /NC/NC166A.cpp | e18c8d34f0ce61fa1b9d1fe7b3fe56092bb6e9d9 | [] | no_license | Challestend/challestends-code-set | 7f9e3a239ca32bc6424ac2a68ad46fb60b55ee43 | bd7d6935216d56f3667a6f939298eb84fe44fa6a | refs/heads/master | 2020-03-26T15:59:18.440653 | 2020-01-06T09:22:30 | 2020-01-06T09:22:30 | 145,075,894 | 0 | 0 | null | 2018-08-17T05:44:32 | 2018-08-17T05:30:09 | null | UTF-8 | C++ | false | false | 205 | cpp | NC166A.cpp | #include<cstdio>
#include<cmath>
#define re register
#define Pi acos(-1.0)
int r;
int main(){
scanf("%d",&r);
double a=Pi/17,ans=17.0*r*r*cos(a)*sin(a);
printf("%0.6lf",ans);
return 0;
}
|
a9fb12c3973955a91264fd5f1a1c74df759445b2 | e23eaec0adcce9069c19c6cca072785776f1ddfb | /Interview Play CPP/a692TopKFrequentWords.cpp | 7e80178ce0cce586eca62ff29ffa7ccc30390a25 | [] | no_license | rjtsdl/CPlusPlus | a4703ba11bcd4a918fa9b20d4de44cf9e021ebf6 | a5e8f14716dc1edf975039393fa3a653b406a8c5 | refs/heads/master | 2021-09-08T07:49:47.998796 | 2021-09-03T18:05:01 | 2021-09-03T18:05:01 | 33,706,235 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,207 | cpp | a692TopKFrequentWords.cpp | //
// a692TopKFrequentWords.cpp
// Interview Play CPP
//
// Created by Jingtao Ren on 11/11/20.
// Copyright © 2020 Jingtao Ren. All rights reserved.
//
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
class Solution {
public... |
268dd8f400037d7b6453d0d390d455155e911b87 | dbbcae6490abfb4ea937e3db575461623eb00d25 | /Uhunt_problems/Others/UVA_902_passwordsearch.cpp | e809bc5b2e437e4928f8030a8d559a6695af1536 | [] | no_license | danielvallejo237/Advanced-Programming | 20ca78dfc1ee79f043efba315f766574939047b2 | 199bce1060622385d2b738e5c67e63e64d6a7eaa | refs/heads/main | 2023-05-21T12:09:56.130991 | 2021-06-10T17:01:27 | 2021-06-10T17:01:27 | 344,992,130 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 691 | cpp | UVA_902_passwordsearch.cpp | #include <bits/stdc++.h>
using namespace std;
string find_password(int size, string encoded)
{
map<string,int> freqs;
int max=0;
string argmax;
for(int i=0;i<encoded.size()-size;i++)
{
string aux=encoded.substr(i,size);
if(freqs.find(aux)==freqs.end())
{
freqs[a... |
279682222b21f52ca07402c2fa7df2e847ed7780 | c8438f31721efd2fed3ce0c5752ff033b1e71d72 | /c64/vice-2.4/src/resid-fp/sid.cc | 16278c1fd1e8e11076119015d83a10490083f465 | [
"GPL-2.0-only",
"MIT",
"GPL-2.0-or-later",
"GPL-1.0-or-later"
] | permissive | century-arcade/src | 8c9151d9847dd0f6d6b92f662444c70064b6845d | b6abba2679f5eaa5a71871b916459aab7ae50d1c | refs/heads/master | 2022-06-21T09:50:06.176276 | 2022-06-15T23:00:41 | 2022-06-15T23:00:47 | 13,259,218 | 4 | 1 | MIT | 2022-06-16T14:24:17 | 2013-10-02T00:18:36 | C | UTF-8 | C++ | false | false | 26,533 | cc | sid.cc | // ---------------------------------------------------------------------------
// This file is part of reSID, a MOS6581 SID emulator engine.
// Copyright (C) 2004 Dag Lem <resid@nimrod.no>
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public Li... |
9cf44931aef8820ae0c9eeeff206cefe9e3d430d | 6419d4c3dad0bea706191b8e75cdb1a8f6ceb201 | /codeforces/cf #401 B.cpp | f13b199f1a7aaa9ac1a85258c909b3c880116b47 | [] | no_license | jsphLim/algorithms | a4a836566a4dd06948681604cfdb1c855173f9d2 | a00620128346cefca1f9b6effec9cdc5b9b96519 | refs/heads/master | 2021-04-06T10:25:08.461580 | 2018-12-11T17:01:32 | 2018-12-11T17:01:32 | 124,760,752 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 365 | cpp | cf #401 B.cpp | #include<bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
char a[N], b[N];
int main ()
{
int n, i;
scanf("%d %s %s", &n, a, b);
sort(a, a+n); sort(b, b+n);
i = 0;
for(int j = 0; j < n; j++){
if(b[j] >= a[i])
i++;
}
printf("%d\n", n-i);
i = 0;
for(int j = 0; j < n; j++){
if(b[j] > a[i])
... |
d412716d13b637d9e39ffac4493151a6cfa452a5 | 9d05b7de75680d6f79edc7042da9fdd92817064c | /src/FormsLoader.cpp | a2bb24c80d177e0c0d49f81433e0363036f33358 | [] | no_license | OrCo27/InexactSearch | e2fa4c0833d6a7c378528065cba9cb398a8db7bd | 31567b225266d606f56da112cc401eeaf1970db7 | refs/heads/master | 2022-06-08T11:03:50.786444 | 2020-05-05T10:48:21 | 2020-05-05T10:48:21 | 258,728,719 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,011 | cpp | FormsLoader.cpp | #include "FormsLoader.h"
void FormsLoader::AddFormManually(const string& form)
{
this->form_data.push_back(form);
}
void FormsLoader::LoadFromFile(const string& file)
{
vector<string> file_lines = Utils::GetFileLines(file);
string final_form, form_extracted;
unsigned int i = 0;
for (string& line : file_lines)
... |
a22053207b4e0d911187a957959022a5a4a877ed | 8878071b2e73220de8d5407c16af657902e4aae1 | /GitTest_01/GitTest_01/main.cpp | 4a02f24fc704543e3cbe2dccd457885a10d5e25a | [] | no_license | liujun1994/ZTSS- | 0462f64015a602ac29180b53d1089d336bff3346 | 9fe28636bb1a513a59907e4b18eb164dede0fd72 | refs/heads/master | 2021-07-17T21:54:44.969781 | 2017-10-25T07:09:28 | 2017-10-25T07:09:28 | 108,227,746 | 0 | 0 | null | 2017-10-25T07:09:53 | 2017-10-25T06:15:10 | C++ | UTF-8 | C++ | false | false | 392 | cpp | main.cpp | //
// main.cpp
// GitTest_01
//
// Created by Admin on 17/10/25.
// Copyright © 2017年 Admin. All rights reserved.
//
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
// insert code here...
cout << "Hello, World!\n";
cout<<"这是分支一的皂搓"<<endl;
//删除分支1
//合拼分支1
... |
ec7469e62accf79979577abe28b94783d62e9aec | c25fa228e19f6ef4d63dc11d59baaae4981101c0 | /src_smartcontract_db/trx/session/ddl_alter/UndoAlterAddIndexLog.h | 92efa8bbe8adee4dc325c6384efe839d2fec05a7 | [
"MIT"
] | permissive | alinous-core/codablecash | b994e710144af3f6b69bda2f3d1dff080b2fd2b0 | 030fa9ee2e79ae2cade33aa80e80fb532c5b66ee | refs/heads/master | 2023-08-31T04:30:14.333123 | 2023-08-12T11:33:06 | 2023-08-12T11:33:06 | 129,185,961 | 11 | 4 | MIT | 2023-08-13T14:10:25 | 2018-04-12T03:14:00 | C++ | UTF-8 | C++ | false | false | 964 | h | UndoAlterAddIndexLog.h | /*
* UndoAlterAddIndexLog.h
*
* Created on: 2023/07/24
* Author: iizuka
*/
#ifndef TRX_SESSION_DDL_ALTER_UNDOALTERADDINDEXLOG_H_
#define TRX_SESSION_DDL_ALTER_UNDOALTERADDINDEXLOG_H_
#include "trx/session/base/AbstractUndoLog.h"
namespace codablecash {
class UndoAlterAddIndexLog : public AbstractUndoLog ... |
48313da32f8e9ef06d892cb7160708e4a9f4bf81 | bcdf3476ef8ffbb9aa41efcdd3a83afcb85f9951 | /Programming Task 6/ps6.cpp | a79c81375bc9cca904e9ebd069b17cbfba42933d | [] | no_license | alextzik/ProgrammingTechniques-2017 | 6edc31521568de54eff6b37df24c427196e5a6cc | 462e3a731bad3c07bdaf20d2ebe4633f1f48ee0e | refs/heads/master | 2020-04-27T18:53:49.345474 | 2019-03-08T19:06:28 | 2019-03-08T19:06:28 | 174,592,110 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,881 | cpp | ps6.cpp | #include <sys/ioctl.h>
#include <iostream>
#include <stdlib.h>
#include <vector>
#include <utility>
#include "ps6.h"
using std::vector;
using std::pair;
// ############################################################
// YOUR IMPLEMENTATION //
// ##################################... |
2935749c315ed5f254ccfb96cb24c69997a190c5 | dca7b2b06c9fc5e1e1274bbfca6ec8ab81e5ad12 | /Simulation/scheduler.cpp | 194f162f8717415e240b4a54b772be3b8411872c | [] | no_license | Vignesh-Sairaj/Operating-Systems | d7ef7e8e18de96edea95711f1b396bd8960896e6 | 19e90b98c26428b4ff3065f0a6e1fc355a0ec05d | refs/heads/master | 2020-07-26T07:10:50.452862 | 2016-12-01T11:53:24 | 2016-12-01T11:53:24 | 208,564,444 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,331 | cpp | scheduler.cpp | #include <iostream>
#include <fstream>
#include <string>
#include <exception>
#include <vector>
#include <stdexcept>
#include <algorithm>
#include <queue>
class Process {
public:
/*
aTime --- Arrival Time
bTime --- Burst Time
sTime --- Start Time
... |
8ed02fa7b0939211a041174893af666237fcd142 | 1d928c3f90d4a0a9a3919a804597aa0a4aab19a3 | /c++/ClickHouse/2015/4/BlockIO.h | 6c3c83a63bdb5227ffab69917a1b0d13b914a198 | [] | no_license | rosoareslv/SED99 | d8b2ff5811e7f0ffc59be066a5a0349a92cbb845 | a062c118f12b93172e31e8ca115ce3f871b64461 | refs/heads/main | 2023-02-22T21:59:02.703005 | 2021-01-28T19:40:51 | 2021-01-28T19:40:51 | 306,497,459 | 1 | 1 | null | 2020-11-24T20:56:18 | 2020-10-23T01:18:07 | null | UTF-8 | C++ | false | false | 1,232 | h | BlockIO.h | #pragma once
#include <DB/DataStreams/IBlockInputStream.h>
#include <DB/DataStreams/IBlockOutputStream.h>
#include <DB/Interpreters/ProcessList.h>
namespace DB
{
struct BlockIO
{
/** process_list_entry должен уничтожаться позже, чем in и out,
* так как внутри in и out есть ссылка на объект внутри process_list_... |
ca2eebed16ebde8cb146342053e3f2e8846c1f78 | 3c5c616b0337056375c11f6a01fc6b8eb58bb6d7 | /tests/threading.cpp | 538f7163ee117ea6204648fcdb774b2b2cbc346b | [
"LicenseRef-scancode-stlport-4.5"
] | permissive | tm9k1/comet | a146158bf290d119b1d57963cb12156594aab07d | 3f4418cb860105404011a0ad1709d703de2e467e | refs/heads/master | 2022-02-01T06:32:30.932166 | 2019-06-19T16:50:45 | 2019-06-19T16:50:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 936 | cpp | threading.cpp | #include <boost/test/unit_test.hpp>
#define COMET_ASSERT_THROWS_ALWAYS
#include <comet/lw_lock.h> // lw_lock, auto_reader_lock, auto_writer_lock
#include <comet/threading.h> // thread
using comet::auto_reader_lock;
using comet::auto_writer_lock;
using comet::lw_lock;
using comet::thread;
BOOST_AUTO_TEST_SUITE( threa... |
f6addb726b5fa06cb6b79f7122b34198e049e9ed | f83c4f606d3ed04c0a4be916bd989c9fddac41eb | /TornadoEngine/Source/Developer/ShareDev/Destructor/DestructorGameObject.cpp | af7cc9971e27cd0ee71a9ff9b3e41a87436dfe88 | [] | no_license | xubingyue/MMO-Framework | ee10acb2a0bec1b766079762c4cf7516cd338954 | 620a337b7597dcff81ba4448d610f4e449bb369f | refs/heads/master | 2021-01-13T12:01:40.189028 | 2016-12-30T19:26:21 | 2016-12-30T19:26:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,210 | cpp | DestructorGameObject.cpp | /*
Author: Gudakov Ramil Sergeevich a.k.a. Gauss
Гудаков Рамиль Сергеевич
Contacts: [ramil2085@mail.ru, ramil2085@gmail.com]
See for more information License.h.
*/
#include "DestructorGameObject.h"
TDestructorGameObject::TDestructorGameObject()
{
}
//----------------------------------------------------------------... |
5b4acd9b733fcf54dd146148d869f08f647579d2 | 5d3404096286830fab472bdf9f30842f0f13a6b6 | /Contest/CodeForce/170731/D/main.cpp | b2a76dc48fbdb3f4e4c31afef3b350a26a2f85dc | [] | no_license | YeongjinOh/Algorithm-practice | 0d4b2ed00e6eebc46667435c3fdc47f8fb1ae886 | 871428eed1158ef85ff31930588aaeb3d69661d2 | refs/heads/master | 2021-01-23T13:42:54.361325 | 2018-03-17T12:47:38 | 2018-03-17T12:47:38 | 54,641,868 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,740 | cpp | main.cpp | #include <iostream>
#include <cstring>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#de... |
c12055c4c1c8bc8c40649b78dbec0e2bf6a7a713 | 0d0cd7b2bf59c532269395c27dc312840cf6d541 | /src/Draw/Draw.cpp | ee2bdc5b2737167e74e9e698c84267325c94532b | [] | no_license | sshklifov/hardestgame | 18d868c4478b021e055d72898c573138c56e51f0 | ae2d271f2ce7b0bc2c9bc413233fab456ae916ce | refs/heads/master | 2020-09-27T18:29:54.707545 | 2019-12-22T12:33:22 | 2019-12-22T12:33:22 | 226,579,590 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,878 | cpp | Draw.cpp | #include <HardestGame.h>
#include "Draw.h"
#include "Movement.h" // Clamp
#include <cassert>
#include <cmath>
static float SmoothStep(float edge0, float edge1, float x)
{
assert (edge1 > edge0 && fabs(edge1-edge0) > fabs(edge1)*1e-5);
float t = Clamp((x-edge0) / (edge1-edge0), 0.f, 1.f);
return t * t * (... |
fd810ce4e413d059b534e49dc3b4f0a9ad2bbaa1 | 0bf0c508e18557941ae0f1480779145f56fa19fa | /Resampler.h | 6e5b42f4edb1c79dde8de41e97ef8b367138c024 | [] | no_license | PaulStoffregen/Audio | 3b63c293f58951e3f8eedc2d527e3f53ba866103 | 4cee15b6d008dd9237ac413a946d84f1030790c0 | refs/heads/master | 2023-08-17T16:42:10.254817 | 2023-07-05T12:44:37 | 2023-07-05T12:44:37 | 15,644,096 | 926 | 468 | null | 2023-06-28T15:58:12 | 2014-01-05T02:31:09 | C++ | UTF-8 | C++ | false | false | 10,323 | h | Resampler.h | /* Audio Library for Teensy 3.X
* Copyright (c) 2019, Paul Stoffregen, paul@pjrc.com
*
* Development of this audio library was funded by PJRC.COM, LLC by sales of
* Teensy and Audio Adaptor boards. Please support PJRC's efforts to develop
* open source software by purchasing Teensy or other PJRC products.
*
* P... |
ceb528a75218d4d103424c1b95aecafd46b42f82 | aeb0367615f6d73757e8a9f43990b87a1eacc2b9 | /hackerrank/q3.cpp | 4b21a39aaa54b543d9f4a46ae6e538c41b08e9a9 | [] | no_license | jai-singhal/dsa | b003c216f436a05ebac3babb24e5a20af17bc456 | 10c8a69958e5587a930f3c65b0993e905d18d301 | refs/heads/master | 2021-01-24T11:44:56.624307 | 2020-09-16T10:15:47 | 2020-09-16T10:15:47 | 123,097,497 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 788 | cpp | q3.cpp | // https://www.hackerrank.com/contests/bppc14/challenges/string-and-performing-queries
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int a, b, Q;
string r, s;
bool is_rev = false;
cin >> s;
cin >> Q;
for(int i = 0; i < Q; i++){
... |
7df78dc2847103565ec353a6f68894c1b655c19e | f057b7a68b08725471797425d2ab76adde86beb7 | /source/windows/brvertexbufferdirextx9.cpp | ed60433074cae5a4105e40af5678844bbfc4caf5 | [
"LicenseRef-scancode-unknown-license-reference",
"MIT",
"LicenseRef-scancode-warranty-disclaimer",
"Zlib"
] | permissive | amir-padan/burgerlib | af550ef20076cf0329af610101d1371d031e4652 | fb2fc9ae0db206de2249f72a5a2ca850549baeae | refs/heads/master | 2021-06-01T04:20:06.779383 | 2016-04-17T03:35:39 | 2016-04-17T03:35:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,912 | cpp | brvertexbufferdirextx9.cpp | /***************************************
Vertex buffer class for DirectX9
Copyright (c) 1995-2016 by Rebecca Ann Heineman <becky@burgerbecky.com>
It is released under an MIT Open Source license. Please see LICENSE
for license details. Yes, you can use it in a
commercial title without paying anything, just give ... |
644881f2ac15623bce8205b32d1211c076397a5e | bc3e9839f91525ed2c8f02bcb84a718b46075534 | /test1/test1/Palindrome.cpp | 7c7304a0da82c9919d0d595f7f26a1de6a689e05 | [] | no_license | fopmania/CPP | a4346979e67e032d69eea0474376e1d4270bdaed | 66c2f369948f973cd8570ec72ae9a5c5bcb01c1e | refs/heads/master | 2020-03-17T04:01:52.518570 | 2018-05-28T23:37:03 | 2018-05-28T23:37:03 | 133,259,826 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,764 | cpp | Palindrome.cpp | #include "stdafx.h"
#include "Palindrome.h"
#include <ctype.h>
#include <string>
#include <iostream>
#include <algorithm>
#include <utility> // std::pair, std::make_pair
using namespace std;
pair<int,int> getPalindrome(string s, int offset) {
int s_cnt = min((int)s.length() - offset, offset + 1);
int offset... |
27a8e487b458424686ca57dc5f7759db22e5c6e8 | 7b0c2c09be723ecb8014c8e9a8d3b79a19bb6677 | /Harkkatyo_3_etsi_lajittele/Harkkatyo_3_etsi_lajittele/ListQ.cpp | dbf64f69f35fb16029b4f90ad61bb08abae579db | [] | no_license | AhoiJ/Tietorakenteet-ja-algoritmit | 0433df746dc7a943a6741914c1ed41f5854354b6 | f86c6b724ff43d4f3ec0238539529ef8adfcfe9f | refs/heads/master | 2020-04-25T05:29:48.171604 | 2018-12-15T10:48:33 | 2018-12-15T10:48:33 | 172,545,335 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,238 | cpp | ListQ.cpp | #include "ListQ.h"
template <class ListQ_entry>
ListQ::ListQ()
{
}
template <class ListQ_entry>
ListQ::~ListQ()
{
}
template <class ListQ_entry>
int ListQ<ListQ_entry>::size() const
/*
Post: The function returns the number of entries in the List.
*/
{
return count;
}
template <class ListQ_entry>
Err... |
d0846fefa1c06b7d7e52851d3b5e38c0710e58fe | 9c451121eaa5e0131110ad0b969d75d9e6630adb | /Codeforces/Educational Codeforces Round 37/920E.cpp | 010b8a71261201f488e342294f2904d503d6087c | [] | no_license | tokitsu-kaze/ACM-Solved-Problems | 69e16c562a1c72f2a0d044edd79c0ab949cc76e3 | 77af0182401904f8d2f8570578e13d004576ba9e | refs/heads/master | 2023-09-01T11:25:12.946806 | 2023-08-25T03:26:50 | 2023-08-25T03:26:50 | 138,472,754 | 5 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,695 | cpp | 920E.cpp | #include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
#define mem(a,b) memset((a),(b),sizeof(a))
#define MP make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) x.size()
#define all(x) x.begin(),x.end()
using namespace std;
#define _GLIBCXX_PERMIT_BACKWARD_HASH
#inc... |
a6df2bd7d46d7cb84129e4b122f88e2a9844c7e0 | dc6de4fa6a0943e61e8371c8d6047fbdefa8be2d | /inc/ER.h | 498de1c514a3a37210c75194de4db248ff307d54 | [
"MIT"
] | permissive | webstorage119/Scene-text-recognition | ff6d117a69c1b71be131d0ec8f12face0cbe5eac | 1025d09161cb75d06f858b14df7187ee2247219e | refs/heads/master | 2023-03-16T00:50:18.625273 | 2020-05-10T19:18:05 | 2020-05-11T14:00:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,679 | h | ER.h | #ifndef __ERTREMAL_REGION__
#define __ERTREMAL_REGION__
#include <stdio.h>
#include <string.h>
#include <string>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <fstream>
#include <vector>
#include <forward_list>
#include <chrono>
#include <omp.h>
#include <memory>
#include <op... |
dff56ef68d8a92888b3318eee9982cab7ea9d2ef | 549516d423efe412508e9d336665cf54c7990920 | /src/ccsubmatlib.cpp | 6ad30617166b2d829f1976a9cab42f21f5a27865 | [] | no_license | mmorse1217/blendsurf | 801a961234f2a0973c1db5db86f3f753526c2d60 | f13344873ec97650f9a1d43cffa5892a41570130 | refs/heads/master | 2022-04-09T17:00:08.629668 | 2020-03-27T15:45:00 | 2020-03-27T15:45:00 | 246,194,542 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 6,088 | cpp | ccsubmatlib.cpp | #include "ccsubmatlib.hpp"
// ----------------------------------------------------------------------
int CCSubMatLib::setup(istream& fin)
{
assert(fin.good());
_interior.resize(MAXVALENCE);
_boundary.resize(MAXVALENCE);
_cornerconvex.resize(MAXVALENCE);
_cornerconcave.resize(MAXVALENCE);
... |
f08cc0d7cf3f9f7532c6497fa5e5424bdd5b3d49 | ae57d5c8cb3ebcfd66dca4b10ceedc8a656496a0 | /src/Player.cpp | 2f384ac4796327fe4251713e2cb2e42723cb958f | [] | no_license | NullStudio/NoNameGame | f1a1c81148581e09178ef1dda5efddf0b253401f | 310a32f82f0fd6c9ca6302c99793ac9696ed33cc | refs/heads/master | 2020-05-20T01:08:26.191101 | 2011-09-05T10:56:53 | 2011-09-05T10:56:53 | 2,172,375 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 469 | cpp | Player.cpp |
#include "Player.hpp"
Player::Player(Animation* animation, b2Body* body) :
mAnimation(animation), mBody(body)
{
}
Player::~Player()
{
delete mAnimation;
}
b2Body* Player::GetBody()
{
return mBody;
}
b2Vec2 Player::GetPosition()
{
return mBody->GetPosition();
}
Animation* Player::GetAnimation()
{... |
dd3e596c2db0f3814cdcb63a041636a9643af312 | ed1b498ee0417b5b5f97daf7d9686a5e9f7a094a | /inc/Plaszczyzna.hh | 9b19cef1c481dbce0e2da724494f096e2584989c | [
"MIT"
] | permissive | Kordziu/Dron_podwodny | fe84c7cc1b703ec490f4454503a4c5e543350c1d | 4a32b345ab648e65bd8dc6a409d0268e7d8f2ed9 | refs/heads/master | 2022-09-29T12:03:51.441747 | 2020-06-07T18:54:06 | 2020-06-07T18:54:06 | 262,001,521 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 401 | hh | Plaszczyzna.hh | #ifndef PLASZCZYZNA_HH
#define PLASZCZYZNA_HH
#include "IObiektRysowalny.hh"
using std::vector;
class Plaszczyzna : public IObiektRysowalny {
protected:
SWektor<double,3> p[49];
public:
Plaszczyzna(drawNS::APIGnuPlot3D * Obiekt, SWektor<double,3> * tab): IObiektRysowalny(Obiekt)
{
for(int i = 0; i < 49; i++... |
db1dc005fbff3345c25161ef96293c5a6fb3b5c4 | 50cecd926c4ff36db6213fa5f100f416d2a410a9 | /ranade/ch10/turtleLessTree.cpp | 79cf7f2a3745e567a98857b71266d6201bafe751 | [] | no_license | anant348/problems | 031152ddd6be2f0ca2fd371bd4348097e9825ba8 | 21ed6131a37f67f30fdf0db4a7a6de58acb62e2d | refs/heads/master | 2022-07-19T19:39:25.118015 | 2020-05-22T03:53:24 | 2020-05-22T03:53:24 | 266,009,563 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 551 | cpp | turtleLessTree.cpp | #include <simplecpp>
using namespace std;
void tree(int h,float width,float height,float x,float y){
static int i=1;
if(h == 0){
Text t1(x-5,y,i);
t1.imprint();i++;
return;
}
Line lLine(x,y,x-width/4,y-height/2);lLine.imprint();
Line rLine(x,y,x+width/4,y-height/2);rLine.imprint();
t... |
cc4febf3da3b231f2245d581cdd50de7f2acd215 | fc6955cf9db78ce5b13e7303fb7a674d7daa8f9f | /n后问题/n后问题-180021104728-王思铠.cpp | daf46a6bf5f0fc1ddc5808b5329df60f20eb77c2 | [] | no_license | wang0769/algorithm_code | 4375b83f3a9e8365c43e28fd79754c3bfda39309 | 126f5c3f9001257207029bb393fe1a18b3b7a87a | refs/heads/master | 2020-09-07T00:58:06.449162 | 2019-12-15T14:10:28 | 2019-12-15T14:10:28 | 220,609,176 | 0 | 0 | null | 2019-11-09T07:48:05 | 2019-11-09T07:48:04 | null | GB18030 | C++ | false | false | 648 | cpp | n后问题-180021104728-王思铠.cpp | #include<iostream>
#define N 1000
using namespace std;
int n;
int x[N];
int sum;
int abs(int a )
{
return a>0?a:-a;
}
int Place(int k)
{
int j,a=0;
for(j=1;j<k;j++){
if((abs(k-j)==abs(x[k]-x[j])) || (x[j]==x[k]))
return 0;
}
return 1;
}
backtrack(){
int k=1;
x[1]=0;
while(k>0){
x[k]+=1;
while((x[k]<... |
f311e232d04f872fabd40f5e27aaefa0d841200b | 34143cd84540d99cef21fd5edd468c7cd40ac335 | /AOJ/1090.cc | 8b4d4637704232a1d12303f8b3e09ca2d380cb08 | [] | no_license | osak/Contest | 0094f87c674d24ebfc0d764fca284493ab90df99 | 22c9edb994b6506b1a4f65b53a6046145a6cce41 | refs/heads/master | 2023-03-06T02:23:53.795410 | 2023-02-26T11:32:11 | 2023-02-26T11:32:11 | 5,219,104 | 8 | 9 | null | 2015-02-09T06:09:14 | 2012-07-29T01:16:42 | C++ | UTF-8 | C++ | false | false | 8,431 | cc | 1090.cc | //Name: Sports Days
//Level: 5
//Category: グラフ,Graph,k-最短路
//Note:
/*
* 問題を整理すると以下のようになる．
* ・負辺，閉路を含み得る有向グラフが与えられる．
* ・各頂点にはラベルが付けられており，特定の順序でラベルを辿ることは禁止される．
* ・スタートからゴールまでのパスを短い方から最大K本見つける．
* ・最短パスがいくらでもコストを下げられる場合も検出する．
*
* まず，禁止順序の処理はKMP法と同様のオートマトンを作成することで可能である．
* オートマトンのある状態からの失敗遷移は，文字列を1文字遅れで読んでいくカーソルからの失... |
936ec22e90db74b0120c6523a39531698b3e995e | a9632951e36cab2b823a9d160cd69dd26f6c19b6 | /rotate.cpp | d6158055c31da6b78e03d20fdeb63c164fe36b03 | [] | no_license | abhishek03-cs/onlinepractice | 2e9326a76cb7e5f9c899d2ffde519e5a8fd6f827 | f338c18b8840ee0eb3ffa397ec481c3acbe72cc2 | refs/heads/main | 2023-01-21T21:42:29.455949 | 2020-12-01T07:01:32 | 2020-12-01T07:01:32 | 304,698,973 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 772 | cpp | rotate.cpp | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n][n];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>arr[i][j];
int start_row=0,start_col=0,end_col=n-1;
while(start_row<n){
start_col=0;
end_col=n-1;
while(start_col<end_col){
swap(a... |
94326ccdc827b4b981fe070dc1e33391bd5b3631 | d3e189cc988e3cb6cbf86d56f263f3f0a37daa69 | /library/FenwickTree.cpp | 54d3034b9abe741d2a07956ad94605876a388b99 | [] | no_license | kThieb/Data-Structures-in-CPP | 3f227b2b7fc9a9efb06a731900a0e4ad4fea7fae | 5b9a2cb74c546b8c6b3cbf6e8a6b5b4422c7925c | refs/heads/master | 2022-12-13T22:12:55.885196 | 2020-09-07T12:43:14 | 2020-09-07T12:43:14 | 279,624,039 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,103 | cpp | FenwickTree.cpp | #include<bits/stdc++.h>
using namespace std;
class FenwickTree {
vector<int> BITree;
int n;
public:
FenwickTree(vector<int> arr, int _n) {
n = _n;
BITree.assign(n + 1, 0);
for (int i = 0; i < n; ++i) {
update(i, arr[i]);
}
}
int get_sum_from_0(int inde... |
9310b9a3f2dddc27ed35a0496d6c9c0d9f6e5fb4 | 36006487fbed2c19a2367e968afc11e76a55bb95 | /Spoj/GERGOVIA-Wine_trading_in_Gergovia.cpp | 19ccad94efa3093af84d6692ffc424c53c1a5837 | [] | no_license | AkVaya/CP_Solutions | 99bd280470997f048ca2ee9b9dda83488d19ca7e | 60fd900aad28caf34b15b75ce736141dbc074d9f | refs/heads/master | 2021-09-27T13:57:38.897747 | 2021-09-16T16:43:55 | 2021-09-16T16:43:55 | 232,780,223 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 573 | cpp | GERGOVIA-Wine_trading_in_Gergovia.cpp | #include<bits/stdc++.h>
using namespace std;
const int nax = 69;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
//cin>>t;
while(1){
int n;
cin>>n;
if(!n)
break;
int a[n];
for (... |
c09a090f63609f752c82627fcf061d6bb798aafe | 1ec838a1a7b944da9044ccccae388f5c7acc5c6f | /VirtualDataView/include/wx/VirtualDataView/Table/VirtualDataTableRowHeader.h | 68bd84919166f5a381fb283316af1937163bfd2b | [] | no_license | seb-dub/wxVirtualDataView | 541f1825aed6d1f8b1946adfa0e7d98cd513a070 | 96b2bc2663b877ac6bc7d2bcc3bc098d1f7fca5b | refs/heads/master | 2021-01-12T01:17:55.280900 | 2017-01-22T22:15:25 | 2017-01-22T22:15:25 | 78,369,100 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,565 | h | VirtualDataTableRowHeader.h | /**********************************************************************/
/** FILE : VirtualDataTableRowHeader.h **/
/** PROJECT : wxVirtualDataViewCtrl **/
/** LICENSE : wxWindows Library Licence **/
/** PURPOSE : header control... |
0f106212bedb2cc25f8076c7b80f24a343f1c298 | ebe0c5741b63b0d175549986e7288b9529775218 | /calc/dataCenterClientModule/soapStub.h | 9628ff2f6e61f55561da5cd795d959b19346d6c5 | [] | no_license | zhk/TileMapEditor | bd4a59e5fefcdbef55af98ac610606a8d3f446c5 | 9616c90028d6e0bad04859c30cc7cb4f91ed1940 | refs/heads/master | 2022-11-18T04:18:01.594780 | 2020-07-19T13:02:35 | 2020-07-19T13:02:35 | 280,866,249 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,310 | h | soapStub.h | /* soapStub.h
Generated by gSOAP 2.8.0 from DataCenter.h
Copyright(C) 2000-2010, Robert van Engelen, Genivia Inc. All Rights Reserved.
The generated code is released under one of the following licenses:
GPL, the gSOAP public license, or Genivia's license for commercial use.
*/
#ifndef soapStub_H
#d... |
32f71faae3e37c773a578f7e40d0e85d36471d28 | ce86401672dc6ddbe6552de3d05630418c869a68 | /classify.cpp | e25a62185fed5136d177ce638a400188932be1b7 | [] | no_license | jbasta/codesnippets | 829e0a09045c3086ab74e851f527969d2597d7ad | 9068ce0b5b34a70bcf2f1763ea0b81dda35f4828 | refs/heads/master | 2023-07-12T02:50:51.998064 | 2021-08-05T18:38:18 | 2021-08-05T18:38:18 | 298,416,919 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,952 | cpp | classify.cpp | #include <map>
#include <string>
#include <iostream>
#include <set>
#include <utility>
#include <math.h>
#include "csvstream.h"
using namespace std;
class Label {
public:
Label();
private:
int numWLabel;
};
class Post {
public:
//returns set of unique words
std::set<string> getWords() {
re... |
eb616a80d2010cba45dbd02c2e01699e9193e5e4 | f845a87f3a58d6fef5af9d8f391e7df3e15a4c25 | /159.cpp | 9fc84f98425f239a526db74dc2b54da4df935b8f | [
"MIT"
] | permissive | jinxinwangstd/LeetCode | 352f5ef7a81e33c9a9434f25a3653be5944a30ca | c8d09e86cee52648f84ca2afed8dd0f13e51ab58 | refs/heads/master | 2022-04-03T12:52:45.079347 | 2022-03-26T16:39:35 | 2022-03-26T16:39:35 | 173,209,742 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 993 | cpp | 159.cpp | #include <bits/stdc++.h>
using namespace std;
using ull = uint64_t;
using ll = int64_t;
using ld = long double;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
class Solution
{
public:
int lengthOfLongestSubstringTwoDistinct(string s)
{
map<char, int> record;
int ret = 0, num = s.siz... |
3ae281ebb2d1b0f64dde5b153bc4679ad30b1915 | 97e6a86106c611ccaa4724c7f2b0a03da7bbcdd3 | /server/tables/EmployeeQuestTable.cpp | b4673a61dcfec847b6f8fb577d6324d59fc9bb21 | [] | no_license | daxingyou/mlbb | 69ac11a7cc5928a82de10163e8c454bc5c24bb78 | f2d1cba16f7800a2d2914f87bb42ea5ed45f42a1 | refs/heads/master | 2022-02-26T12:01:03.782205 | 2019-09-02T06:26:02 | 2019-09-02T06:26:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,892 | cpp | EmployeeQuestTable.cpp | #include "config.h"
#include "CSVParser.h"
#include "itemtable.h"
#include "EmployeeQuestTable.h"
std::map<int32,std::vector<int32> > EmployeeSkill::data_;
bool EmployeeSkill::load(char const* fn){
if(NULL == fn)
SRV_ASSERT(0);
if(strlen(fn) == 0)
SRV_ASSERT(0);
ACE_DEBUG( ( LM_INFO, ACE_TEXT("Loading from file... |
33c8581f97e17d3de749a823284ec12b26e273e4 | a8628ff4113c7c919a85b1c1e81d16f018377210 | /2017-11-13-final-submission/ex1.cpp | e32d990f103fe038bc6a4686b27aff07ccb042e5 | [
"LicenseRef-scancode-public-domain",
"CC0-1.0"
] | permissive | gnanakeethan/cpp | 1429546149be31ec774a63da7212752ac2775e51 | 51f779d9981eb4644f6a5e6e923ba68585be7988 | refs/heads/master | 2021-01-15T23:59:16.032719 | 2017-11-18T00:57:16 | 2017-11-18T00:57:16 | 99,944,861 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,255 | cpp | ex1.cpp | #include <iostream>
#include <iomanip>
using namespace std;
void inputValues(double&,double&,double&,int);
double calculateSubtotal(double,double);
void printOutput(double[],double[],double[],double[]);
const int items=5;
const int width=80;
int main(){
//defining arrays for storing values for items
doub... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.