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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
105becfafeaf8e4629f540bdb2d889074c29f133 | aaf120c02ad25df14047a687de724a1be6cf3607 | /misc.cpp | 32158098e93e52e61b28aa286e0bae85cf0bda37 | [] | no_license | ssaatchi/gene-prediction | 354ca7c1832d9710818fc578e2845a2918bf4804 | 918495ff81039f88e226174883633d4e1a3f9dc2 | refs/heads/master | 2021-01-21T14:38:50.320977 | 2017-07-26T17:18:31 | 2017-07-26T17:18:31 | 95,313,180 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,118 | cpp | misc.cpp | /**
* Miscellaneous Functions Definitions
* Supvisor: Dr. Alex Zelikovsky
* <PRE>
* misc.cc
*
* Revisions: 1.0 April 13, 2004
* misc
*
* </PRE>
* Author: Jingwu He (PH.D candidate)
* Address: Computer Science Department, Georgia State University
* @author <A HREF="mailto:jingwu_he@yahoo.com">... |
e45821c07ea46b083a56c0674ebe7f7afbefff34 | ab5a0e49c5d413be6449d7e1846b31c684288030 | /Prog05_is_inside_here/Prog05/Version3/main.cpp | 14873e785cae5349b4f8845290c24b7ccf909562 | [] | no_license | adamjeanlaurent/CSC412_Coursework | e43c9861af3e8fcec1a538598f6d343f3c8b8c78 | 30ca8576f497392846301cd82feb80d9ca200544 | refs/heads/main | 2023-01-14T15:14:09.365183 | 2020-11-24T20:30:35 | 2020-11-24T20:30:35 | 304,455,296 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,805 | cpp | main.cpp | #include <iostream>
#include <string>
#include <cstdio>
#include <vector>
#include <fcntl.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
#include <sys/wait.h>
#include "dispatcher.h"
#include "job.h"
#include "pipe.h"
int main(int argc, char** argv)
{
// parse input arguments
if(argc !... |
5f140f21c994d1cc662793e10019bc86aedcacde | 70986bced7a24bf5a904b40ecabd44ec5139ea04 | /ConceptsAndQuestions/graphs/tug_of_war.cpp | a2a311ac96d4844aa7d8bb3a33750be04383b30f | [] | no_license | shrey/templates_cpp | f79cd09a729d9bc7a8dc620f4824c152b4f833ac | a6b6b8186f7e763c5029230a36fed8506f6d8cf9 | refs/heads/master | 2023-07-12T07:38:44.909862 | 2021-08-25T06:11:00 | 2021-08-25T06:11:00 | 283,482,614 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,696 | cpp | tug_of_war.cpp |
//Shrey Dubey
//Contact Me at wshrey09@gmail.com
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<vector>
#include<set>
#include<list>
#include<iomanip>
#include<queue>
#include<stack>
#include <math.h>
#define prDouble(x) cout<<fixed<<setprecision(10)<<x /... |
bae4eeb9fccc7f9f9b2d3e1d7da0bfe862924787 | f656f41016dd258866ce86e8161c82511873c42a | /tree/SuffixTree.cpp | 7fef14cd8f119fd38fe773416f506113e0f1a672 | [] | no_license | jerrylining/data_structure | 7a93ded257a52f9cb42bb5b75517f604543dfb59 | 57ffae6283fa658dc4124aaccbc8c84b3deb3a1e | refs/heads/master | 2020-11-29T20:44:41.404489 | 2018-01-24T02:34:43 | 2018-01-24T02:34:43 | 96,654,205 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 48 | cpp | SuffixTree.cpp | #include "../stdafx.h"
#include "SuffixTree.h"
|
891b6119ef591d4755ae852391a56cc3f4dce6fb | cf413a0e9bf3d1d54a9dca23d17b3c63b0a0291c | /Solve/9461.h | 27d9c1f15624fd1b042349b958cf86121c0ebb37 | [] | no_license | ruru14/noj.am | 4d7dabf642f205bf901e595aaed1168469ef1b9f | b89b4f7372c357fbb8e567dafd8ba306fd01a200 | refs/heads/master | 2021-11-27T16:48:39.438279 | 2021-09-16T06:45:21 | 2021-09-16T06:45:21 | 130,633,719 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 117 | h | 9461.h | #ifndef nojam9461
#define nojam9461
#include "../AlgorithmStudy.h"
namespace nojam9461 {
void solution();
}
#endif
|
a9a51f34c81facd6cce48a5f31c7e1d1c638cb99 | ea12fed4c32e9c7992956419eb3e2bace91f063a | /zombie/code/zombie/ntrigger/src/ntrigger/ntriggerserver_main.cc | ee41905bfab9ca801ce9049df463443ea3653519 | [] | no_license | ugozapad/TheZombieEngine | 832492930df28c28cd349673f79f3609b1fe7190 | 8e8c3e6225c2ed93e07287356def9fbdeacf3d6a | refs/heads/master | 2020-04-30T11:35:36.258363 | 2011-02-24T14:18:43 | 2011-02-24T14:18:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 33,098 | cc | ntriggerserver_main.cc | //-----------------------------------------------------------------------------
// ntriggerserver_main.cc
// (C) 2005 Conjurer Services, S.A.
//-----------------------------------------------------------------------------
#include "precompiled/pchntrigger.h"
#include "ntrigger/ntriggerserver.h"
#include "ntrigg... |
04692721e66d0f9714194c9b7ccc6a3d69f39809 | d192a6df01f81d576a32bdc5d00fc0c22a08686e | /src/qt/qrcodedialog.h | 4b54cc5e07437cbf0ea5cc3326177313f5c802f4 | [
"MIT"
] | permissive | soom-4th-blockchain/soom-core | e477892419337c20727bae1724e580d7e74fc53f | 7018e66445b9c156efb2c46dc4ea360cc61b1c0e | refs/heads/master | 2020-03-25T04:37:24.648970 | 2019-01-10T05:17:12 | 2019-01-10T05:17:12 | 143,404,975 | 0 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 731 | h | qrcodedialog.h | #ifndef QRCODEDIALOG_H
#define QRCODEDIALOG_H
#include "walletmodel.h"
#include <QDialog>
#include <QImage>
namespace Ui {
class QRCodeDialog;
}
class OptionsModel;
class QRCodeDialog : public QDialog
{
Q_OBJECT
public:
explicit QRCodeDialog(const QString &addr, const QString &label, bool enableReq, QW... |
362694a67e4787cb6f3b9ba2c1ca34be48b9bac9 | 519ccfe2cf75d16b9ee6231f8a13f63a3ce91d62 | /src/fonts/stb_font_arial_38_latin_ext.inl | 4b5b3bb78f377480f0fc93b03c6c45ad8690a047 | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | stetre/moonfonts | 9dd6fd126524ead9105216e93b22a9b73de82dc2 | 5c8010c02ea62edcf42902e09478b0cd14af56ea | refs/heads/master | 2022-02-07T20:47:37.150667 | 2022-02-06T12:29:27 | 2022-02-06T12:29:27 | 96,556,816 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 170,860 | inl | stb_font_arial_38_latin_ext.inl | // Font generated by stb_font_inl_generator.c (4/1 bpp)
//
// Following instructions show how to use the only included font, whatever it is, in
// a generic way so you can replace it with any other font by changing the include.
// To use multiple fonts, replace STB_SOMEFONT_* below with STB_FONT_arial_38_latin_ext_... |
124c321dbad919e13970b1a453944d5c85ca49c4 | 532294febe8d79b85b71994e6cbae28921a7fb5b | /Arrays/4_MergeWithoutExtraSpace.cpp | 12a3d5808004b070d8cee45028f813bec5014e85 | [] | no_license | se-prashant/Data-Structures-And-Algorithms | 6da326b04a2dcdadcb7a17f7c7dc4c03ef61e33a | 15c488cb699a911a9c7b437dc80f5ec170ec70e8 | refs/heads/main | 2023-02-22T16:39:27.996522 | 2021-01-25T08:47:48 | 2021-01-25T08:47:48 | 327,389,250 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 721 | cpp | 4_MergeWithoutExtraSpace.cpp | int nextGap(int gap)
{
if (gap <= 1)
return 0;
return (gap / 2) + (gap % 2);
}
void merge(int a1[], int a2[], int n, int m)
{
// code here
int i=0,j=0;
int tot_sz = n+m;
for (int gap = nextGap(tot_sz); gap > 0; gap = nextGap(gap)){
i = 0, j = gap;
// cout<<gap<<" $# "... |
7ceb8c9bf5de2fd9e1bbfa70b763da12ab4e663f | 9143962494f56b95589ae8a8d3889bba5a30981d | /src/dials/array_family/boost_python/flex_ext.cc | 8366f087c71a3ba6dd0daf3d4ecb351abbead469 | [
"BSD-3-Clause"
] | permissive | dials/dials | 565c329b8584ba22f1c89490b14b117e9256e8bf | 88bf7f7c5ac44defc046ebf0719cde748092cfff | refs/heads/main | 2023-08-17T10:25:59.078610 | 2023-08-17T08:12:53 | 2023-08-17T08:12:53 | 39,507,997 | 71 | 50 | BSD-3-Clause | 2023-09-06T09:30:25 | 2015-07-22T13:36:00 | Python | UTF-8 | C++ | false | false | 1,872 | cc | flex_ext.cc | /*
* flex_ext.cc
*
* Copyright (C) 2013 Diamond Light Source
*
* Author: James Parkhurst
*
* This code is distributed under the BSD license, a copy of which is
* included in the root directory of this package.
*/
#include <boost/python.hpp>
#include <boost/python/def.hpp>
#include <string>
#include <scitbx... |
ccb7c54d70ecb7b981e0905604e60df4bde1fc11 | 27fdddea150d37f310c259cd55f9bd8688cf64d2 | /bmengine/cMemory.cpp | a38aeac9180bd6488bbe18402b19c8b0a5cc0ec0 | [] | no_license | thebadmonkeydev/BMG.Engine | 3f1be9ed582d5b1ab6c45469a0589a10e1f495ea | d2b14d2798ef6ec4a977d04d9974151235b1a13f | refs/heads/master | 2021-01-22T14:38:52.961949 | 2014-02-14T20:44:15 | 2014-02-14T20:44:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 999 | cpp | cMemory.cpp | #include "cMemory.h"
namespace bmcore
{
cMemory::cMemory(void)
{
}
cMemory::cMemory(void* ptr, tMemSize size, tuInt32 align)
{
m_alignment = align;
m_structAlign = sizeof(tMemSize);
m_paddedHeadSize = BMAlign(sizeof(cBlockHeader),sizeof(tMemSize));
m_pAllocatedBlock = ptr;
m_allocatedS... |
49e85e17a4de9f2bb94897614a8552a0e66ead03 | 2ef6a773dd5288e6526b70e484fb0ec0104529f4 | /poj.org/3409/4202214_AC_329MS_3408K.cc | 7a3530948adb3809c2257d718e6316abfa426a86 | [] | no_license | thebeet/online_judge_solution | f09426be6b28f157b1e5fd796c2eef99fb9978d8 | 7e8c25ff2e1f42cc9835e9cc7e25869a9dbbc0a1 | refs/heads/master | 2023-08-31T15:19:26.619898 | 2023-08-28T10:51:24 | 2023-08-28T10:51:24 | 60,448,261 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,401 | cc | 4202214_AC_329MS_3408K.cc | /*
* PKU3409::Broken_line.cpp
*
* Created on: Oct 10, 2008 4:30:09 PM
* Author: TheBeet
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or... |
248f0f7ea72aeae02e18d8308eab84c1c4fe812c | 46433eef4cb129b7bf803842f57be71e72cc946f | /lightoj/1016 - Brush (II).cpp | 4ae695f096006e24244f5276ddc375e05cab8438 | [] | no_license | asifjoardar/solving-oj-problems | 7300f2bb6ce651c79b9a90649b38b8baf5fc517d | 992c6472ffefea024a6879e1007d8118b7d221ca | refs/heads/master | 2022-05-15T15:55:53.822581 | 2022-05-07T18:26:18 | 2022-05-07T18:26:18 | 136,577,556 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,653 | cpp | 1016 - Brush (II).cpp | /********** BiSmIlLaHiR rAhMaNiR rAhIm ***********\
*$*$*$*$*$*$*$*$*$*$*$*$*$*$*$*$*$*$*$*$*$*$*$*$*$*
*$* *$*
*$* |||||||| |||||||| |||||||| |||||||| *$*
*$* || || || || || *$*
*$* |||||||| |||||||| || |||||| *$*
*$* |... |
c21f3fcc0b229f9a4362b6b59e99a6859aafef79 | 05448e438b84e48f5ce30f332ce9d7b79e4bcc3a | /gobang_V3.0/draw.cpp | 468a950036a219eb5b2788c99f6775a17149fef5 | [] | no_license | Elxe/GoBang | 63433c6d272d2d61170e04a147ef8216a7353eb4 | 766174fec124759d69914b48da85267d513353cf | refs/heads/master | 2021-09-01T17:17:55.005223 | 2017-12-28T02:56:15 | 2017-12-28T02:56:15 | 114,649,730 | 6 | 0 | null | 2017-12-18T14:33:55 | 2017-12-18T14:20:30 | C++ | GB18030 | C++ | false | false | 524 | cpp | draw.cpp | #include "stdafx.h"
#include "draw.h"
void Draw(int BoardPosition[][BOARDSIZE], int Flag, Position PreviousCursor, Position Cursor)
{
BoardPosition[Cursor.X][Cursor.Y] = Flag;
if (Flag == 1)
{
refresh("○", PreviousCursor.Y * 4 + 2, PreviousCursor.X * 2 + 1); //覆盖之前的缓冲棋型
refresh("◆", Cursor.Y * 4 + 2, Cursor.X... |
ca3c448c1eaae285940d58fc7c75177e5d157ac0 | 8c3d47390cc970f3573a16cc31fc02b4840651ca | /AC-codes/10220.cpp | be329664ead9c3cce1b3d36e661949a10ddd8d01 | [] | no_license | andyyhchen/cp-codes | 4f7fce120e0c2cb72936865e173df3b0993d465e | c745a7e9fd01c85b8334265ada69dd3654a1d67e | refs/heads/master | 2022-11-17T07:17:42.233281 | 2020-07-19T08:24:42 | 2020-07-19T08:24:42 | 280,822,781 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,169 | cpp | 10220.cpp | #include <iostream>
using namespace std;
struct bign{
int digit[800];
int len;
};
void bign_ini(bign &a)
{
memset(a.digit,0,sizeof(a.digit));
a.len = 1;
}
bign operator*(const bign a, const bign b)
{
int lena = a.len, lenb = b.len;
bign tmp; bign_ini(tmp);
for(int i = 0; i < lena; i++)
{
for(... |
81253c9972d0aa49da1a2a9827d9992b51c95b16 | 7a7b025581ce0c4d37575b5cbe4a7af0d502696a | /service.cpp | abafc312bed78bb8697c741312d2d96a70b64d49 | [
"MIT"
] | permissive | ITachiLab/simple-windows-service | f6c9ca2ea9fa7c896a8bb9544397345903263fbb | 71607d719a76b0c2341f334ffb12f8231da92840 | refs/heads/master | 2020-03-27T03:18:34.125333 | 2018-08-23T13:24:51 | 2018-08-23T13:24:51 | 145,852,591 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,629 | cpp | service.cpp | #include <Windows.h>
#include <tchar.h>
#include <strsafe.h>
#pragma comment(lib, "advapi32.lib")
#define SVCNAME TEXT("FooService")
SERVICE_STATUS svcStatus;
SERVICE_STATUS_HANDLE svcStatusHandle;
HANDLE ghSvcStopEvent = NULL;
void svcInstall();
void svcRemove();
void reportSvcStatus(DWORD, DWORD, DWORD);
void svc... |
b237d7767ff767f32d01733c790e116862b9f04a | 8a1512191c8f213fa1055cd1b12a28c834d17466 | /game/cd.cpp | 0ea406950883c0ca191075e24484c82b51e00f15 | [] | no_license | jstasiak/polanie-src | 882721a6896ba67731e84e488a0252de3ca7e92a | dc679cbd1add67ba7f3da59ba24ba9d6c560ed1b | refs/heads/master | 2023-05-31T22:18:28.362896 | 2020-02-18T16:26:25 | 2020-02-18T16:26:25 | 169,010,720 | 10 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 17,160 | cpp | cd.cpp | /*
Plik : CD.CPP
Autor: Artur Bidziński
Data : 18 maja 1996r.
*/
// #define POMOC
#undef POMOC
#ifdef POMOC
#include <conio.h>
#include <iostream.h>
#endif
#include "define.h"
#include "dpmi.h"
#include <i86.h>
#include <string.h>
#ifdef POMOC
extern void gotoxy(int, int);
#endif
struct J4 {
unsigned int ed... |
67775a9e4759f1b6cb0716c36ec121533ebeb511 | 681def7edcad4620aae6e78de61057a7f3c801a9 | /native/source/strtokf.cpp | 84e404e7a10109d7fca7b6c88a2223484a504db1 | [
"BSD-3-Clause",
"BSD-2-Clause"
] | permissive | aleksas/phonology_engine | fc5b66b6b8b6d1714ecb9bf7ee65516abf28f042 | 2baec9a28c0c506075a7c5bd26c86502144d5d95 | refs/heads/master | 2020-03-29T11:24:13.168978 | 2020-02-09T11:02:26 | 2020-02-09T11:02:26 | 149,850,649 | 16 | 1 | NOASSERTION | 2020-02-09T10:56:59 | 2018-09-22T06:07:51 | Objective-C | UTF-8 | C++ | false | false | 1,427 | cpp | strtokf.cpp | #include "StdAfx.h"
extern "C" {
/*
* Standard C string function: tokenize a string splitting based on a
* list of separator characters. Reentrant version.
*
* The "context" argument should point to a "char *" that is preserved
* between calls to strtok_r that wish to operate on same string.
*/
char* strtokf(char... |
4a4dc0e87bbe134bcbb545b477cc609151470789 | 84a9cf5fd65066cd6c32b4fc885925985231ecde | /Plugins2/ElementalEngine/GameUtilities/FadeUtility.cpp | f56ec5a24909b6440feef488024882bb821e3ad7 | [] | no_license | acemon33/ElementalEngine2 | f3239a608e8eb3f0ffb53a74a33fa5e2a38e4891 | e30d691ed95e3811c68e748c703734688a801891 | refs/heads/master | 2020-09-22T06:17:42.037960 | 2013-02-11T21:08:07 | 2013-02-11T21:08:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,546 | cpp | FadeUtility.cpp | ///============================================================================
/// \note Elemental Engine
/// Copyright (c) 2005-2008 Signature Devices, Inc.
///
/// This code is redistributable under the terms of the EE License.
///
/// This code is distributed without warranty or imp... |
380faac686966a132559263d75c23b632b43efd9 | a6b92dfce322311434dc35c29f3722e861fe3b1f | /388b_sereja_and_suffixes.cpp | 03a34dd39beae6812418bb07ef0098b1625df4c1 | [] | no_license | asv018/codeforces-solutions | 6f944d0c483096f9cfb4edfe4905db9cf68632e4 | cf52712a52f4eebe9d2be7f5ec56f6e7e265c718 | refs/heads/main | 2023-07-03T02:07:34.166802 | 2021-08-03T18:24:43 | 2021-08-03T18:24:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 872 | cpp | 388b_sereja_and_suffixes.cpp | //@aryanpathania
#include <bits/stdc++.h>
#define MOD 1'000'000'007
//#define MOD = 998'244'353
#define int int64_t
typedef long long ll;
typedef long double ld;
using namespace std;
void solve(){
int n, m;
std::cin >> n >> m;
int a[n];
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
... |
b8102e3ede8e0adcbb899f4e0e8fb05673dc4714 | 0dab354e734f3490086dbc83195e825400e26f31 | /EPI/chapter16.hh | 2257927ce69c765de9b708d9ba5e350979b2df93 | [] | no_license | eymenkurdoglu/sisyphus | 2bcfbce2baffa971ac7fb643a8809de4d71a8e14 | d0ad4462dc8e1bc2660db0e7cf0a5f14eb16d860 | refs/heads/master | 2021-01-13T04:37:32.130119 | 2017-09-15T05:16:58 | 2017-09-15T05:16:58 | 79,468,992 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 349 | hh | chapter16.hh | #include <vector>
#include <string>
#include <iostream>
using namespace std;
namespace ch16 {
bool is_palindromic( const string& );
void decompose( const string&, int, vector<string>*, vector< vector<string> >* );
vector< vector<string> > list_all_palindromic_decomp( const string& );
vector< vector<int> > power_... |
6b5291d9aa5a5a3df30eb85bf10fe567bca544d2 | db7581f4f68ae11d12da64a455ee73e8d211ee4f | /Finished/13.roman-to-integer.cpp | 2033bb5581310d1fb87d57a1b07663dba17c7011 | [] | no_license | Golfrey/leetcode | 61720d00de07fcf97cf377d55908b7569fbb9fe5 | 32ed3e33cad91b00724fa9c2138686954d819b9c | refs/heads/main | 2023-07-30T17:31:22.111568 | 2021-09-26T01:14:39 | 2021-09-26T01:14:39 | 410,416,656 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 812 | cpp | 13.roman-to-integer.cpp | /*
* @lc app=leetcode id=13 lang=cpp
*
* [13] Roman to Integer
*/
// @lc code=start
class Solution {
public:
int romanToInt(string s) {
int ret = 0;
unordered_map<char, int> umap{{'I', 1}, {'V', 5}, {'X', 10},
{'L', 50}, {'C', 100}, {'D', 500},
... |
af3baf7a9fe21bddef1a6150a8e8de502150a1c4 | d7891562a5c601a827d5980af0b7a2e957d4f8b1 | /task2/InvertColorsImage.h | 864020aa3e42421558ab36f9b288d8ffceb7c65b | [] | no_license | alex3287/SE_laba_1 | eaa8c7bba9277a0ead31bf5ba163d9052de25bd1 | 19e98d6f076cfa6e8de02962b3545defe2952b6e | refs/heads/main | 2023-03-28T11:35:47.039571 | 2021-04-02T17:03:02 | 2021-04-02T17:03:02 | 341,607,690 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 315 | h | InvertColorsImage.h | //
// Created by Александр Мангазеев on 02.04.2021.
//
#ifndef SE_LABA_1_INVERTCOLORSIMAGE_H
#define SE_LABA_1_INVERTCOLORSIMAGE_H
#include "Image.h"
class InvertColorsImage {
public:
static Image InvertColors(Image image, std::string newColor);
};
#endif //SE_LABA_1_INVERTCOLORSIMAGE_H
|
f8ec5440b15cc9bcb2a3a08e8af975d054f0beec | 458457c11a4e7a2ef406e7f41e803e52f2cceb22 | /organism.cpp | ec2858e238a0441ab13f3078cd946ceb89ddf5e3 | [] | no_license | justinchoys/2d_predator_prey_simulation | 441d94649920ce85447df993fe17eda99850859c | 9fe849076991fcf54a1ffb8bf9d485b232436509 | refs/heads/master | 2020-03-25T01:15:01.827513 | 2018-08-02T01:48:35 | 2018-08-02T01:48:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,376 | cpp | organism.cpp | #include "organism.h"
#include <iostream>
using namespace std;
//constructor
Organism::Organism(int x, int y, int turns, bool moved, string s): x(x), y(y), turnsCount(turns), moved(moved), type(s) {};
//virtual functions, throw warning if we try to call them
void Organism::move(Organism*** grid, int& antcount, int& d... |
65b557afc824eeaa360447cbfe58d35983831a6a | 3705ca67bc3797696534410620ecd06feee5d4e5 | /src/io/github/technicalnotes/programming/problems/29-01-2020/generatespiralmatrix.cpp | 2471159980402a6bdb6c9df1ef90a449b7e9de6b | [
"MIT"
] | permissive | chiragbhatia94/programming-cpp | 15c9a7250ecb4c897ea8e612e7d7de83bb4a5272 | efd6aa901deacf416a3ab599e6599845a8111eac | refs/heads/master | 2023-04-30T07:20:40.365130 | 2020-08-22T22:13:05 | 2020-08-22T22:13:05 | 370,069,428 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,775 | cpp | generatespiralmatrix.cpp | #include "bits/stdc++.h"
using namespace std;
void generateMatrix(int);
void fill(vector<vector<int>> &, int, bool, int, bool);
int main()
{
generateMatrix(4);
}
static int cell = 1;
void generateMatrix(int A)
{
int rowSeq[A];
int colSeq[A];
vector<vector<int>> spiralMatrix;
spiralMatrix.resize(A, std::ve... |
ae20835a1c113eb02e16af265126bbc4d813852b | 1ef834470ad661103d29f7d3266d2b38e117ba20 | /Chroma/src/Chroma/Scene/Scene.cpp | 516476a3303e46b3dbbf2de5a30f52b594accb94 | [] | no_license | ttalexander2/chroma-public | 638382cf6907296985252d81a1a4613e743b9cff | f37e86c30636a80ae25c753b3bdb7d05ac016e15 | refs/heads/master | 2023-05-12T12:01:24.601478 | 2021-06-05T17:53:16 | 2021-06-05T17:53:16 | 372,094,587 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,348 | cpp | Scene.cpp | #include "chromapch.h"
#include "Scene.h"
#include "EntityRef.h"
#include <Chroma/Components/Transform.h>
#include <Chroma/Components/Tag.h>
#include <Chroma/Components/AudioSource.h>
#include <Chroma/Components/SpriteRenderer.h>
#include <Chroma/Components/BoxCollider2D.h>
#include <Chroma/Components/CircleCollider2D... |
df1da8bb226e6f7695caec10e6050704240a1870 | 0bc180425ebfe56c1da2e82c095c1160ac9fcb07 | /Pochoir/Stencil_Collection/openLatticeBoltzmann-0.5r1/src/core/boundaryPostProcessors3D.hh | 4156f223a882da47d7b2f6632341d489ff061b85 | [] | no_license | superTangcc/toc-collaborate | 0cf28298f2c1ea1dd0d4e7cbc5cd63bea95c5f17 | e173b5991b3e69ab53fa69f30b2cd137f15d4d86 | refs/heads/master | 2021-01-19T14:56:58.532700 | 2012-10-02T10:47:18 | 2012-10-02T10:47:18 | 5,797,101 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 16,847 | hh | boundaryPostProcessors3D.hh | /* This file is part of the OpenLB library
*
* Copyright (C) 2006, 2007 Jonas Latt
* Address: Rue General Dufour 24, 1211 Geneva 4, Switzerland
* E-mail: jonas.latt@gmail.com
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
*... |
2a7b969e6b6ae0195175e65c15f53e99f2068fc2 | fc2e556fc1291b4a4708e95d6422f90a7b48b9f1 | /include/mango/image/surface.hpp | 6e2289738d307e3e4d51a3cfbe5cf6f878137dcd | [
"Zlib"
] | permissive | t0rakka/mango | 6c5c69dd2c8d678daa5df6e9131d755f17e5ac2e | 0dcda42ac0d94d4e1ed7dee56a4a8e83856065d5 | refs/heads/main | 2023-09-02T09:20:54.687739 | 2023-08-31T15:22:35 | 2023-08-31T15:22:42 | 73,749,708 | 359 | 50 | NOASSERTION | 2021-01-21T02:16:00 | 2016-11-14T21:44:58 | C++ | UTF-8 | C++ | false | false | 2,840 | hpp | surface.hpp | /*
MANGO Multimedia Development Platform
Copyright (C) 2012-2023 Twilight Finland 3D Oy Ltd. All rights reserved.
*/
#pragma once
#include <cstddef>
#include <string>
#include <mango/core/configure.hpp>
#include <mango/core/memory.hpp>
#include <mango/filesystem/file.hpp>
#include <mango/image/format.hpp>
#inc... |
beb59a7732f9aa687ab4f3d71cd0b11ce42ea18e | 305bd78cbc717a35cffedaa6578b5799ca06c021 | /백준/C++/14466_소가 길을 건너간 이유 6.cpp | ff82948ce140c68a178823377e8f0f9588c570bc | [] | no_license | haileykim1/Algorithm-Problem | f25cb0df6c3b5badb5d659311ac645c49fe6ca47 | 3bc40e16cb43b58963a33f471a4289dcebe04d67 | refs/heads/master | 2022-05-12T00:50:11.457502 | 2022-04-30T11:17:28 | 2022-04-30T11:17:28 | 188,186,252 | 3 | 0 | null | null | null | null | UHC | C++ | false | false | 1,105 | cpp | 14466_소가 길을 건너간 이유 6.cpp | #include<iostream>
#include<vector>
#include<memory.h>
#include<set>
using namespace std;
int mx[4] = { 0, 0, -1, 1 };
int my[4] = { -1, 1, 0, 0 };
set <pair <int, int>> connect[101][101];
int N, K, R;
bool visit[101][101] = { false, };
void dfs(int x, int y) {
//지금칸으로 부터 갈 수 있는 곳
if (x < 1 || x > N || y < 1 || y >... |
3a1f1fbcaaf10f0859533761612c0ca3d31d3489 | c9b02ab1612c8b436c1de94069b139137657899b | /sgonline_srv/app/logic/LogicGate.cpp | 0fcf8b8a975c3b8c6a9dfdf62f00a03101334a96 | [] | no_license | colinblack/game_server | a7ee95ec4e1def0220ab71f5f4501c9a26ab61ab | a7724f93e0be5c43e323972da30e738e5fbef54f | refs/heads/master | 2020-03-21T19:25:02.879552 | 2020-03-01T08:57:07 | 2020-03-01T08:57:07 | 138,948,382 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,793 | cpp | LogicGate.cpp | #include "LogicGate.h"
#include <fstream>
map<int, GateRank> CLogicGate::gateRankMap;
int CLogicGate::GetGate(unsigned uid, Json::Value &data)
{
CDataGate bdDB;
vector<DataGate> datas;
int ret = bdDB.GetGate(uid, datas);
if (ret != 0 && ret != R_ERR_NO_DATA)
{
error_log("[GetGate fail][uid=%u,ret=%d]",uid,ret)... |
49cbe7926c5b4e20246540efd5e30d2fb501176e | 7a882776ca41ff9978d9c2a1d24cdbbe846a6a6d | /YQYQY/ContainerClass/mainEntrance.cpp | 22e6e242cf2b040fce7079ff10b0ee7f8bb389cd | [] | no_license | yvetteyuanqin/2018summerintern_layout_optimization | 30a26bb591dd5021f8470dd4809adf9b29e7b849 | 33e5d18f194252157a7102966ed26184e083f8b8 | refs/heads/master | 2020-03-27T17:17:14.290397 | 2018-08-31T04:24:29 | 2018-08-31T04:24:29 | 146,841,552 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 3,796 | cpp | mainEntrance.cpp | #include <iostream>
#include <stdlib.h>
#include "ContainerClass.h"
#include "mainEntrancedll.h"
//#include "stdafx.h"
//input:inputarr 4 param: x,y,t,n
float* mainEntrance(float inputarr[][5], float fieldinfo[], char fieldname[],int itemnum){
Container::Object *initObject = NULL,*p = NULL;
/*float width = 0.0;
fl... |
af35144269963a54d0dc0b4a842fa7106ef7ab45 | 11a36467170e1e9f21d34deb6f0fadf185136266 | /src/kdtree3d.h | fd80d7c0c150b820548bc8583010fdc84732b540 | [] | no_license | girivallepu/SFND_Lidar_Obstacle_Detection | 6d7b9727ff309c9d7a3e85c88e819a7de4b4b959 | d3661a98a591116bacf339203eb4eec10310bcd6 | refs/heads/master | 2022-07-24T07:03:30.431631 | 2020-05-19T03:45:01 | 2020-05-19T03:45:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,369 | h | kdtree3d.h | /* \author Giridhar V */
// Structure to represent node of kd tree for 3D
#ifndef PLAYBACK_KDTREE3D_H
#define PLAYBACK_KDTREE3D_H
#include <pcl/impl/point_types.hpp>
#include <vector>
struct Node
{
pcl::PointXYZI point;
int id;
Node* left;
Node* right;
Node(pcl::PointXYZI arr, int setId)
: point(arr), id(se... |
b18681f3259a019f7a8ec6bdb5130c2283021e71 | ce663984886400a68f3fec64c35726abd8cc902e | /TestCase/headers/game_hub.h | 19b790674fd011ebca7bfc64adbccdfe87935e96 | [] | no_license | Jamal-Ra-Davis/RPG-Game | 286da82f398364ec8f604b9ae2b75100da078d68 | d72331451594ab28c11930916e528ecc41a43432 | refs/heads/master | 2021-01-17T17:01:53.388855 | 2015-12-10T07:48:59 | 2015-12-10T07:48:59 | 15,348,266 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 672 | h | game_hub.h | #pragma once
#include <stdio.h>
#include <stdlib.h>
class party;
class areas;
class shop;
class inn;
class home;
class questHall;
class game_hub
{
party *Team;
areas **Dungeons;
areas *rand_dungeon;
int num_areas;
int active_areas;
shop **Shops;
int num_shops;
int active_shops;
inn *Inn;
home *Home;
... |
92bc6bb2b917d445bcab3e7057609eda20056f31 | 6758655c4a42cda705d0cf2e463ba606a9329988 | /switch_calculator.cpp | 59ff5a276e4095b756afc4276c1ba2d61894e81e | [] | no_license | TristinL/C-plus-plus | 6e9e6267253b635e608d3e84e681c0b4237380bc | cb0846675ed90b2d1d8176520e9c0d792658d7a4 | refs/heads/master | 2020-04-01T18:00:55.322995 | 2019-02-04T19:42:20 | 2019-02-04T19:42:20 | 153,465,855 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 843 | cpp | switch_calculator.cpp | // Lets make a switch statement
#include<iostream>
using namespace std;
void calculate(int a, int b, char c);
int main(){
int a, b; //define
char c; //variables
cout<<"Enter two whole numbers:"<<endl; //obtain data from user
cin>>a>>b;
cout<<"What kind of math operation would you like done... |
0f3f17bb4ca61f23a5a6ceba3d2a64beff747351 | 3cd215a539df9fbd23b2e1c30506731bab6d0e98 | /GameObject.cpp | 3c3a3ed0a38de283f02086921cf41c5a8df167b1 | [
"Zlib"
] | permissive | HyruleExplorer/FORGE | de7848acde69f87a6a77ae72304a9e082cc81a04 | 95b29e9f810d901efa7e904e2ceed9936cef2a11 | refs/heads/master | 2020-05-27T20:12:24.789008 | 2015-05-10T00:50:23 | 2015-05-10T00:50:23 | 35,351,297 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,802 | cpp | GameObject.cpp | #include "SFML/Graphics.hpp"
#include "GameObject.hpp"
#include "Game.hpp"
#include <iostream>
//Costruttore standard di un oggetto di gioco
GameObject::GameObject()
{
mTexture.loadFromFile( "visiblegameobject.png" );
mSprite.setTexture( mTexture );
mSprite.setPosition( Game::SCREEN_WIDTH /2, Gam... |
6629d39cbdfb35f36292aba7478ed41c1873d8b9 | 88ae8695987ada722184307301e221e1ba3cc2fa | /chrome/browser/ash/file_manager/speedometer_unittest.cc | 83db4c9b3efe62ad7e775c48b87ab2cbf0dc91ae | [
"BSD-3-Clause"
] | permissive | iridium-browser/iridium-browser | 71d9c5ff76e014e6900b825f67389ab0ccd01329 | 5ee297f53dc7f8e70183031cff62f37b0f19d25f | refs/heads/master | 2023-08-03T16:44:16.844552 | 2023-07-20T15:17:00 | 2023-07-23T16:09:30 | 220,016,632 | 341 | 40 | BSD-3-Clause | 2021-08-13T13:54:45 | 2019-11-06T14:32:31 | null | UTF-8 | C++ | false | false | 4,611 | cc | speedometer_unittest.cc | // Copyright 2021 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ash/file_manager/speedometer.h"
#include <cmath>
#include <limits>
#include "base/test/scoped_mock_clock_override.h"
#include "base/time/time.h"
#incl... |
b58af3d25597d761e4a761cde656862147ab9b22 | caf70632c7b221430a5f8d3db80e651433857305 | /SaliencyPainterlyRendering/formatstring.h | 93ff35e00988ac8fe21aa66362529e6a66ed6f9d | [] | no_license | lee3213/dev_dec | ab2efb129797b1c454d37afc3db63af7f3267888 | 1230634f0215fd156e96de06ca4832a7416778f4 | refs/heads/master | 2020-04-09T17:20:39.245326 | 2018-12-05T11:26:33 | 2018-12-05T11:26:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 152 | h | formatstring.h | #pragma once
#include <string>
#include <stdarg.h>
std::string format(const char *fmt, ...);
std::string format_arg_list(const char *fmt, va_list args); |
6eafb7b951a1079671bc23de192210546ee5c4df | e2cc28e162f14551f189390c0896b0334b29eaba | /the_concepts_and_practice_of_math_fin/Project11/ProjectB_13/test_log_normality/products.h | 1924b36112757b106173fadfa9774c5533b85f76 | [
"MIT"
] | permissive | calvin456/intro_derivative_pricing | 3f3cf4f217e93377a7ade9b9a81cd8a8734177a7 | 0841fbc0344bee00044d67977faccfd2098b5887 | refs/heads/master | 2021-01-10T12:59:32.474807 | 2016-12-27T08:53:12 | 2016-12-27T08:53:12 | 46,112,607 | 8 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 2,126 | h | products.h | //products.h
#ifndef PRODUCTS_H
#define PRODUCTS_H
#include <vector>
using namespace std;
struct CashFlow{
double time;
double amount;
};
//abstract base class
class BGMProducts{
public:
BGMProducts(const std::vector<double>& times_, double Strike_);
virtual ~BGMProducts(){}
void setStrike(double Strike_);
... |
a31dc72e348b8c239194a26b5d01aa37936f7b77 | 16b4d1402286d8553442f9f033ef1e4460881c52 | /2 курс/3 семестр/ООП 7/7.cpp | 0f04a38dbf078b8711e39c12efdc7d33db7a65c0 | [] | no_license | IlyaDzh/SevSU | 4725df428e5ff4506e317904e93fbaf559ec2580 | 305afe1809278d4f8a57fd90fd9b2535dd7447c1 | refs/heads/master | 2021-08-10T05:48:00.342476 | 2021-06-24T13:02:11 | 2021-06-24T13:02:11 | 193,796,303 | 0 | 2 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 1,384 | cpp | 7.cpp | #include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
class vector
{
public:
int size, v;
float *vec;
vector(int _size)
{
vec = new float [size=_size];
}
~vector()
{
delete [] vec;
}
void vvod_vec()
{
for(int i=0; i<size; i++)
{ ... |
686ca6d958729bd9000d039c8c9c441697b0fd3d | 45d03d5ed27ac010c041a567da147ccc3591d13d | /string matching/all.cpp | a920313f4dfab6170631d0cf591c8f5454516b36 | [] | no_license | achallion/cpptopics | 30198e89343ceafb564c7100cef52c1c6988a311 | 4199e56f95f9263b5b6f810900b44e1437d5f372 | refs/heads/master | 2023-07-07T04:20:17.989745 | 2023-06-28T07:01:02 | 2023-06-28T07:01:02 | 218,488,647 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,181 | cpp | all.cpp | #include <bits/stdc++.h>
using namespace std;
int countnaivematch(string &str, string &pat)
{
int count = 0;
for (int i = 0; i < str.size(); i++)
{
if (str[i] == pat[0])
{
int k = i;
for (int j = 0; j < pat.size(); j++)
{
if (str[k] != pa... |
3f77acd779e508d63f527d9fa2ba54d6b9809506 | 699d5b3ce9d9f625b244b4c1d6c05772403e3d80 | /HW1/HW1_1/HW1_1.cpp | 651ad1c383a045f40396c7e3a50796a714923ab3 | [] | no_license | david11014/OOPHW | 6968745e649640943beace3780dce680fe6c1e3b | 65579c613d9f041a2796b93bf090e6f910f7f86a | refs/heads/master | 2021-09-05T01:48:20.850620 | 2018-01-23T15:13:12 | 2018-01-23T15:13:12 | 105,860,359 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,277 | cpp | HW1_1.cpp | /*******************************************************
NCKU Department of Mechanical engineering OOP Homework 1
Write by david1104
github: https://github.com/david11014
********************************************************/
#include <iostream>
#include <fstream>
#include "K_DTree.h"
//#define DEBUG
#define TR_SIZE... |
523d277b4a68eb5364c074b0859a4243b6c1afc0 | 18a2d0c6279543e4936245787e96b078bc99f678 | /src/Event.cpp | 914ab1fd85db06eadcbe9183c6b01af49a7d5fc0 | [] | no_license | diegobaronm/Agenda | b708727f6490001a0a0d90f88e0b98ae83c7597e | 587b5632987143a14b62477d9901e6819b1177e2 | refs/heads/master | 2023-05-07T06:15:47.161024 | 2021-05-29T12:08:02 | 2021-05-29T12:08:02 | 361,944,110 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,960 | cpp | Event.cpp | #include"DataBase.hpp"
#include"Event.hpp"
#include<sqlite3.h>
void Event::Add_Task(MainTask* task){
task->Set_eID(Event_ID);
Tasks.emplace_back(task);
}
void Event::Remove_Task(int id){
auto it=Tasks.begin();
for(auto it=Tasks.begin();it!=Tasks.end();it++){
if((*it)->Get_ID()==id){break; }
... |
a6aa5550f22f1d3b2e5a7d2dc890e957d9542904 | 4447dacbb9fbdff5bccd9438a19a7376883185d0 | /Yamanote/DataBase.h | 22101e5aff572d69565c3ae242092d04174fa2ee | [] | no_license | sep-inc/campus_202009_matsui | 73bf99131ab48219d01b6bb2d519ecb45352d059 | 1683d55c7eea8cdfe342911ca432d96267be8625 | refs/heads/master | 2023-01-14T06:27:37.986458 | 2020-11-18T06:12:33 | 2020-11-18T06:12:33 | 292,440,615 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 1,766 | h | DataBase.h | #ifndef DATABASE_H_
#define DATABASE_H_
#define STATION_NUM 29 //駅の数
#define START_STATION 0 //最初の駅
#define CENTER_LANE_TIME 12 //中央線のかかる時間
#define CENTER_START_STATION 1 //中央線乗り換え駅(時計回りで見ているため神田が最初)
#define CENTER_END_STATION 14 //中央線乗り換え駅(時計回りで見ているため新宿が最後)
/* 駅の情報 */
struct StationInfo
{
char station[... |
d8607025328319b9954c78fc1a616d6c19ab7ef3 | 21c8ef855af2879dcac8dad6614b204bb2a4d3f8 | /0/U | 5db259818e7c38527d6077dcd761b14a2b54aef0 | [] | no_license | kotyak4/test-plane-oscilation | 5be66d7c5ea364b65a95dc12565356f9436d52a5 | 90af82998d803254caf4a3c0330b2f896b94ed62 | refs/heads/master | 2021-07-13T13:18:35.244957 | 2017-10-17T19:55:49 | 2017-10-17T19:55:49 | 107,317,111 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,580 | U | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.0.1 |
... | |
f44ca85f076526b90a0b21e1e37e86f6a54fd6f2 | a5cf5390222727417aeaa7a2a3927cfaf9022ea6 | /internal/packed_gamma_file3.hpp | 093af3f1fa0a68cfb61e6f5ac4403e785177c434 | [] | no_license | nicolaprezza/Re-Pair | 7ca97024aceb732dce92d605a403f7c2a42bb053 | ffb411d8ce9c1232980ec67bee7e678c0b88fd5c | refs/heads/master | 2021-01-12T00:30:35.564187 | 2017-04-06T16:20:16 | 2017-04-06T16:20:16 | 78,733,925 | 13 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 16,260 | hpp | packed_gamma_file3.hpp | /*
* packed_gamma_file3.hpp
*
* Created on: Feb 15, 2017
* Author: nico
*
* read/write integers in packed form in/from a file
*
*/
#ifndef INTERNAL_PACKED_GAMMA_FILE3_HPP_
#define INTERNAL_PACKED_GAMMA_FILE3_HPP_
#include <cassert>
#include <vector>
#include <fstream>
using namespace std;
#endif /* I... |
412e930aa1a670e268c379c63df52798b9e9843c | b3c47795e8b6d95ae5521dcbbb920ab71851a92f | /Exemplars/杂项/时间计算.cc | 6b2aadbae703630b77c6290fee373dff8228be47 | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | Wizmann/ACM-ICPC | 6afecd0fd09918c53a2a84c4d22c244de0065710 | 7c30454c49485a794dcc4d1c09daf2f755f9ecc1 | refs/heads/master | 2023-07-15T02:46:21.372860 | 2023-07-09T15:30:27 | 2023-07-09T15:30:27 | 3,009,276 | 51 | 23 | null | null | null | null | UTF-8 | C++ | false | false | 678 | cc | 时间计算.cc | namespace DATE
{
int days[12]={31,28,31,30,31,30,31,31,30,31,30,31};
struct date
{
int year,month,day,hour;
date(){}
date(int iyear,int imonth,int iday,int ihour)
{
year=iyear;month=imonth,day=iday;hour=ihour;
}
};
const date START_TIME=date(2000,1,1,0);
inline bool leap(int year)
{
return (ye... |
735ba7985e47b850d560e18e1f99b2ea2cb111b5 | a4fd6e39ffca2ce20cb92d7195c2956519b2bcbf | /CppReview/passArray.cpp | 78336ad8854430838ddb7708902def7b93e64641 | [] | no_license | shivapbhusal/AI | e02f5699f0400abef3fa337f54b746d2a4dee267 | 02ecf14bfb8deb9319e7dccebad0063527f9c1a6 | refs/heads/master | 2021-03-24T14:07:40.276106 | 2018-04-19T01:01:55 | 2018-04-19T01:01:55 | 122,130,550 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 305 | cpp | passArray.cpp | // A program to demonstrate pass by value and pass by reference
//
#include<iostream>
using namespace std;
void multiply(int a[], int &b)
{
for (int i=0;i<=5;i++)
{
a[i]=a[i]*b;
}
}
int main(){
int a[5]={1,2,3,4,5};
multiply(a,a[1]);
for (int i=0;i<5;i++)
{
cout<<a[i]<<"\n";
}
}
|
e76b8b21236060c634d3305451d141ac77ded5f3 | 91939b8fb60cb1f26b6fbfec7689ba5cb7f0dd09 | /ObserverV2/src/ClockTimer.cpp | ba8b13af5c0abbcf64f03c3c33994f3f6fe9db9d | [
"MIT"
] | permissive | JuanPoli/EDI-III | 226d4961bcb02414aa18643b4e2d337dec7fb091 | 55afb509aa74d81b366c276de54802d55648b238 | refs/heads/master | 2020-06-05T00:15:16.488972 | 2020-05-08T13:22:06 | 2020-05-08T13:22:06 | 192,246,937 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,776 | cpp | ClockTimer.cpp | #include "../src/Notifier.cpp"
class ClockTimer: public IClockTimer
{
public:
ClockTimer(ISubscriber* subscriber):refCount(0),notifier(new Notifier(subscriber)) {
acquire();
m_hours = 0;
m_minutes = 0;
m_seconds = 0;
std::cout << "ClockTimer::Cloc... |
371f03dec5d33e59fce3f07db976a66f1ad1f797 | 9344828009fb89c94302a0c56e8e99ca09161854 | /week1/week_test/linkTest/std_io.cpp | 55dfebd34d7f3bdf1f895a202f64442b8fb89e70 | [] | no_license | rrpuqy/winter_code_camp | 7afbc11e45cfe9a249450f9e5b56d93a9b88c9fe | 4d38f60160eab44f54e7c256433ae5856480be48 | refs/heads/main | 2023-03-19T19:13:01.793472 | 2021-03-03T09:29:39 | 2021-03-03T09:29:39 | 342,440,411 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,957 | cpp | std_io.cpp | #include <iostream>
#include <vector>
using namespace std;
// 代码实现开始
const int N = 1005;
struct Node
{
int pre, next;
Node(int a, int b)
{
pre = a;
next = b;
}
};
vector<Node> my_list;
// 初始化函数，在操作开始前会调用一次
void init(int n)
{
my_list.assign(n + 1, Node(0, 0));
// for (int i = 0; ... |
a750656a2722d0ecb0796c058a6d4680e415d6c8 | 826c2762805e39ac1c080091e7f4f642fb41e19a | /ouniverse_2021_whitebox_ue4_source_BAK/2021-4-3.1/App/Game/Private/AppController.cpp | efa666bdafb77b461be1b3c0aa52bacd75a359c7 | [] | no_license | legendofceo/ouniverse_ue_cpp_source_deprecated_pre2022 | fe625f69210c9c038202b8305495bdf373657ea8 | 729f12569f805ce74e602f8b13bab0ac318358a5 | refs/heads/main | 2023-08-12T19:14:39.216646 | 2021-10-17T16:19:29 | 2021-10-17T16:19:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,664 | cpp | AppController.cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "AppController.h"
#include "Engine/StreamableManager.h"
#include "Engine/AssetManager.h"
#include "AppMode.h"
#include "Cam.h"
#include "Input.h"
#include "Keynet.h"
#include "InterfaceInput.h"
#include "Kismet/GameplayStatics.h"
... |
ae94a994c0ebc20131863cfc1dce65f52ac13c47 | c3c1e37700fc3ebe041a9a366812fb70c122e25a | /src/graphlab/util/synchronized_circular_queue.hpp | b71877e3bd4dd7a74e73df70f04b4abcb85bfc04 | [] | permissive | Lcrypto/graphlab | 87847459067ac8d138ca94ef6a6b09f9334984ec | 4e525282d1c093bb8ad38e8941b87c86d6ad7ded | refs/heads/master | 2020-09-16T13:29:38.584264 | 2019-11-24T17:42:26 | 2019-11-24T17:42:26 | 223,784,330 | 0 | 0 | BSD-3-Clause | 2019-11-24T17:40:16 | 2019-11-24T17:40:15 | null | UTF-8 | C++ | false | false | 2,283 | hpp | synchronized_circular_queue.hpp | #ifndef GRAPHLAB_SYNCHRONIZED_CIRCULAR_QUEUE_HPP
#define GRAPHLAB_SYNCHRONIZED_CIRCULAR_QUEUE_HPP
#include <queue>
#include <cassert>
#include <cstring>
#include <graphlab/parallel/pthread_tools.hpp>
namespace graphlab {
/**
Implementation of a self-resizing circular queue
*/
template <typename T>
... |
52ff125541b2e71405685c22a7fc5387e7b5c926 | bff5e31c511224ba8691dc768e00cabd6043bdf2 | /include/benchmark.hpp | 832b277d91cf3e99596baa37e2a834729f7b5497 | [
"MIT"
] | permissive | twesterhout/plasmon-cpp | a8ed9605eee45f9ccbf2d609e9e6fd7d2e4f7552 | a0e343ee718d9b30602b322ade6077e42e08d8e5 | refs/heads/master | 2021-01-18T03:19:00.048376 | 2018-01-23T13:50:43 | 2018-01-23T13:50:43 | 85,831,338 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,216 | hpp | benchmark.hpp | #ifndef TCM_BENCHMARK_HPP
#define TCM_BENCHMARK_HPP
#include <iomanip>
#include <chrono>
#include <unordered_map>
#include <thread>
#include <mutex>
#include <boost/range/adaptors.hpp>
#include <boost/range/algorithm.hpp>
#include <detail/config.hpp>
////////////////////////////////////////////////////////////////... |
6cbf98d282a0491bba204965b08bdf777fd95ca0 | 122da59fcbf44b14ad7d77841eaa9e8b5faa0102 | /helloword.cpp | cc1663241b80e9c4a95094c0cd9c099af03cfdc9 | [] | no_license | CkingEric/loginsever | ecb72c8f66c96d4a95923f4337be0118285c3f1f | e73d40e9515a59c06886c58b726ef72eb3e9b97c | refs/heads/master | 2023-04-18T19:02:18.765701 | 2021-04-12T10:08:32 | 2021-04-12T10:08:32 | 356,092,382 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,233 | cpp | helloword.cpp | #include "helloword.h"
HelloWord::HelloWord(QObject *parent) : HttpRequestHandler(parent)
{
}
void HelloWord::service(HttpRequest &request, HttpResponse &response)
{
QString hello="\
<html>\
<head>\
</head>\
<body>\
这是网页的内容\
... |
3fdedbdd9d4e6f31e6c9d944cfea00d1ce35acc8 | 0160490319cac0dfbe37834d0468aed63f2cd0c0 | /include/SgfcGoRuleset.h | 21f25043380cd5f150e6ee5eac7459f89643175c | [
"Apache-2.0",
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference",
"BSL-1.0"
] | permissive | herzbube/libsgfcplusplus | a6c9c11b05a13ca1f422b15e220efb84aeefb875 | cd93b76c9044952a0067240cbebac7c535e0275a | refs/heads/develop | 2021-07-14T20:04:24.516039 | 2021-02-23T19:16:12 | 2021-02-23T19:16:12 | 238,560,277 | 8 | 1 | Apache-2.0 | 2021-02-13T16:53:57 | 2020-02-05T22:21:31 | C++ | UTF-8 | C++ | false | false | 3,563 | h | SgfcGoRuleset.h | // -----------------------------------------------------------------------------
// Copyright 2020 Patrick Näf (herzbube@herzbube.ch)
//
// 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
//
//... |
1843766aa41165745280daa23d2147cba13d9821 | 8acaf1aa24404b86d77cf60761b111404b09cc8e | /move-semantics/unique_ptr.cpp | f6111fa2826cc87a7a3c0abfbe8996f16123b822 | [] | no_license | infotraining/cpp-modern-2020-10-14 | 53312b2fdce2cc4cf55891b439944fe2a9ef074c | 6e15376fe78c0ecf091aa15b9273d97b8bedeee3 | refs/heads/main | 2023-01-01T21:53:34.757983 | 2020-10-16T14:36:16 | 2020-10-16T14:36:16 | 303,329,899 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,081 | cpp | unique_ptr.cpp | #include "catch.hpp"
#include "gadget.hpp"
#include <iostream>
template <typename T>
class UniquePtr
{
T* ptr_;
public:
explicit UniquePtr(T* ptr)
: ptr_ {ptr}
{
}
UniquePtr(const UniquePtr&) = delete;
UniquePtr& operator=(const UniquePtr&) = delete;
// move constructor
Uniqu... |
8b7f5b1fa52460bcd005360a32dc6468db7789fa | b7188c7554df0d141562251b63d5261a7664d569 | /fcportugalsplanner-code/AllSetPlay/setplay/setplay.cc | 22b4d38e0cf26029c51b267b42fd57baedf70648 | [] | no_license | pedrofranki/fut2d-cross | 07e7c3512506e173daab74a05b848ecd08bc1076 | 64cebf283125298f9e0c2e1762eba06874cd36bc | refs/heads/master | 2022-12-17T15:46:42.890903 | 2020-09-25T23:53:59 | 2020-09-25T23:53:59 | 298,424,167 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 73,577 | cc | setplay.cc | #include <setplay/setplay.h>
#include <setplay/util.h>
#include <setplay/setplayexception.h>
#include <setplay/clang/clangutil.h>
#include <cassert>
#include <algorithm>
#include <boost/spirit/include/classic_core.hpp>
#include <boost/spirit/include/classic_assign_actor.hpp>
#include <boost/algorithm/string.hpp>
#... |
d82385957317fe1d686cddf31b18eeafb848ef6a | 959a58003f8d17c57922a9297208b19d3f3677f0 | /catkin_ws/devel/.private/vision_msgs/include/vision_msgs/FindWaving.h | ace7b02532b3e23b36f53cf59fe7d55ff1c29b9b | [] | no_license | KevinArturoVP/ManipulacionKuka | c98af98d0cece5ec2c6c8887bcdab110589d43c4 | d81ee77f53d1f9326337c12a8515c99fc69e35be | refs/heads/master | 2023-01-11T08:56:53.358563 | 2020-11-06T19:47:45 | 2020-11-06T19:47:45 | 310,689,293 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,698 | h | FindWaving.h | // Generated by gencpp from file vision_msgs/FindWaving.msg
// DO NOT EDIT!
#ifndef VISION_MSGS_MESSAGE_FINDWAVING_H
#define VISION_MSGS_MESSAGE_FINDWAVING_H
#include <ros/service_traits.h>
#include <vision_msgs/FindWavingRequest.h>
#include <vision_msgs/FindWavingResponse.h>
namespace vision_msgs
{
struct Find... |
2344bb620eb06cf11c837e5ced41b2026f9f3a1c | 15a6c97c8cf07d5fa33a660cd3a188e711be80e8 | /TrafficProject/Map.h | 5e41e14d417fbaec5145652cb8661f0b94bb1c16 | [] | no_license | andrewburr/TrafficProject | e92b5f788adede40ba6a389eb8062ca8ad142d12 | 30a549e85dc2dce590f87d47c74c8099455b6c4d | refs/heads/master | 2021-01-17T22:40:01.861731 | 2017-04-22T15:42:42 | 2017-04-22T15:42:42 | 84,875,596 | 0 | 1 | null | 2017-04-22T15:43:54 | 2017-03-13T21:18:20 | C++ | UTF-8 | C++ | false | false | 385 | h | Map.h | //EE273 Project - Group 24
//Cameron Fleming and Andrew Burr
#ifndef MAP_H
#define MAP_H
#include "Box.h"
class Map
{
protected:
Box grid[20][20]; // creates a 20 by 20
public:
//~~Getter Function
Box* getBox(int, int); // returns pointer to box at given coordinates
//~~Constructor Function
... |
8f9d1d5ab3b16794a70d2de8f02eacbd096de31e | f7c92c4f8539e1f4782ee4c4213191849ee97329 | /1025/1025_pat_ranking.cpp | 9b62c8c39feb03cc2d6fc66ed18f2e31fc1b4365 | [] | no_license | insaneyilin/PAT | 0370b74f6ce69d5fee83c9dd96ba70cdfefa3492 | d9e2d72dd7ccf8cf41c186fbdd3a516d37b09b8e | refs/heads/master | 2021-01-01T15:25:03.357232 | 2015-11-25T14:54:16 | 2015-11-25T14:54:16 | 39,135,619 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,273 | cpp | 1025_pat_ranking.cpp | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stdio.h>
using namespace std;
struct Record
{
Record(string reg_num, int s_, int loc_num) :
registration_number(reg_num), score(s_), location_number(loc_num)
{
local_rank = -1;
final_rank = -1;
... |
77e5cccf24dda43bba9bad4094ba060fb4bd4ec5 | f4ce8e93a454dd2542510a5fa91f4eb725c4d26b | /AKwB_Project_ZADIII/AKwB_Project_ZADIII/AKwB_Project_ZADIII.cpp | 19c911fd92e3913c4b58f7a18ef40b1f7f40065e | [] | no_license | Kaczy6point9/Projects_AKwB | 1db8bd913cf6c9dace60756ac199970fa6e95afb | 07e6d9d33cb0aaa850f8297fc56e6486bc92ca23 | refs/heads/master | 2021-01-12T16:51:08.660624 | 2017-02-01T21:39:41 | 2017-02-01T21:39:41 | 71,449,397 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,662 | cpp | AKwB_Project_ZADIII.cpp | // AKwB_Project_ZADIII.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <iostream>
#include <fstream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
void prase_qual(fstream& file)
{
fstream parsed;
string line;
int line... |
2c20b647f132f849438ce90cb5981c13ac3debf8 | eda03521b87da8bdbef6339b5b252472a5be8d23 | /Userland/Applications/Browser/ElementSizePreviewWidget.cpp | d02fb497ef61bf733a4d34007080b00fa450f947 | [
"BSD-2-Clause"
] | permissive | SerenityOS/serenity | 6ba3ffb242ed76c9f335bd2c3b9a928329cd7d98 | ef9b6c25fafcf4ef0b44a562ee07f6412aeb8561 | refs/heads/master | 2023-09-01T13:04:30.262106 | 2023-09-01T08:06:28 | 2023-09-01T10:45:38 | 160,083,795 | 27,256 | 3,929 | BSD-2-Clause | 2023-09-14T21:00:04 | 2018-12-02T19:28:41 | C++ | UTF-8 | C++ | false | false | 5,205 | cpp | ElementSizePreviewWidget.cpp | /*
* Copyright (c) 2022, Michiel Vrins
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include "ElementSizePreviewWidget.h"
#include <LibGUI/Painter.h>
namespace Browser {
void ElementSizePreviewWidget::paint_event(GUI::PaintEvent& event)
{
GUI::Frame::paint_event(event);
GUI::Painter painter(*this);
p... |
8e2aa0eb4a7e6ed40db2323d888ecb8dcad29a11 | 8d7e3aa92278f1e89b55a371dddfbf542fc40daa | /include/iLogic2comm_interface.h | 84b3daeced32443e1d67c5253e59863b8c6f6041 | [] | no_license | young-forever/AQ_002_CONSOLE_RL_20200703 | 241962726db6d6362133f583d16d7a58861c4018 | e7d2a8804473c9366b4ac81d04f7884a412bd99e | refs/heads/master | 2022-11-15T09:54:44.823650 | 2020-07-06T08:37:34 | 2020-07-06T08:37:34 | 277,486,121 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 738 | h | iLogic2comm_interface.h | //
// Created by zyq on 2020/6/10.
//
#ifndef AQ_002_CONSOLE_ILOGIC2COMM_INTERFACE_H
#define AQ_002_CONSOLE_ILOGIC2COMM_INTERFACE_H
#include <vector>
class ilogic2comm_interface
{
public:
virtual void ResetOk()=0;
virtual void RecieveBack()=0;
virtual void RecShakeHandOk()=0;
virtual void RecWorkSta... |
ac95695a5933663006b56aab55ae1cedfed3a3f0 | bfb370732e48ab73b48d50dcefc1491b14e113d8 | /lib/add_const_msg_impl.h | 0f23714e415f1f7b0b6fdecf69240914ee1542a6 | [] | no_license | javatai/gr-messageutils | 6d11dd1fba5beb712015982a0962d30b6b296b9e | fc500180b8bfa3a72254308409d042d08595de54 | refs/heads/master | 2021-06-17T02:45:36.310373 | 2017-04-29T16:44:03 | 2017-04-29T16:44:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,473 | h | add_const_msg_impl.h | /* -*- c++ -*- */
/*
* Copyright 2014 Adam Gannon.
*
* This 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, or (at your option)
* any later version.
*
* This software is distribute... |
afe3528103151989ee2831d77aea78ba1e3ae707 | 2870164d24093d726b256245d491a86d06c82c03 | /Petya and Strings.cpp | e49b6b88094a0103b7fb7e435e35e121e3bbb49f | [
"MIT"
] | permissive | AshfakYeafi/Compatitive-Programing | 79bea363c2e2dea2e9eff474076b588d49046cdb | 6e4b35c55cdd426d83bc435d51b92570c6db7b16 | refs/heads/main | 2023-06-09T09:05:53.611770 | 2021-07-06T03:56:09 | 2021-07-06T03:56:09 | 376,046,990 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 676 | cpp | Petya and Strings.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long i;
string f,s;
while(cin>>f>>s)
{
long sum1=0,sum2=0;
for(i=0; i<f.size(); i++)
{
if(f[i]>='A'&&f[i]<='Z')
f[i]=f[i]-'A'+97;
if(s[i]>='A'&&s[i]<='Z')
s[i]=... |
0b42da28c0bd9aa88a06401d001b313a8abc35fc | 81e31a571f9263b317a60ab7e2fa6a62199aefa1 | /icm-1.1/tests/msg/mtopic/EventI.h | 9ecb3500079209c0606ecabb7b29326f18d7ec4b | [] | no_license | qhjindev/icm | 66910f1db5b9cf549b31817e3e2adeada4babd17 | 9e2a659dcf8c4cdadb71e129eedb667efc817517 | refs/heads/master | 2020-05-17T05:37:21.762348 | 2015-01-08T02:16:08 | 2015-01-08T02:16:08 | 28,762,156 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 313 | h | EventI.h | #ifndef NETWORK_I_H
#define NETWORK_I_H
#include "Event.h"
class NetworkI : public demo::Network {
public:
virtual void reportEvent(const ::demo::NetEvent&);
};
class AlarmI : public demo::Alarm {
public:
AlarmI() {}
virtual void reportAlarm(const ::demo::AlarmEvent&);
};
#endif //NETWORK_I_H
|
0770d877e1d61e21e86dfe6fa83a37d0aaf320f8 | bcae7bbfd50cccbdb4c3d873371d97e1d3fdd14b | /midterm-1/mid-term-1/Console.cpp | 7bd6ca751b342e22dc7f4a93ed25f655c82eabf8 | [] | no_license | adrian-popa/object-oriented-programming | ecca2a7e5c9b6bd020c5e3f0fa920e7e86e246dd | 8fa0b6b9c35e1b1b7f8fea669d8d59e36a0cc26c | refs/heads/master | 2022-01-10T07:32:21.186120 | 2019-05-23T13:45:50 | 2019-05-23T13:45:50 | 173,363,015 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,037 | cpp | Console.cpp | #include "Console.h"
using namespace std;
void Console::runConsole() {
this->uiPlaceDrone();
bool keepAlive = true;
while (keepAlive) {
string inputString;
cout << "\nDRONE:~$ ";
getline(cin, inputString);
int position = inputString.find(" ");
const string command = inputString.substr(0, position);
... |
fcf3e35372a4d9aa47f6a05d78c35f3d1bb3aafa | 3c79dd2d66fec62a07e79fc34ce3a87dd4894b63 | /main.cpp | e5fd034e90e3565207dbb2d1c382cd7807291f1a | [] | no_license | DaniM/handles | 65b822108810a7fa79095cdaeddc4a0bfa72fe13 | dd552ccf635d9a64308c95109a5aeaf3df5386f4 | refs/heads/master | 2020-04-29T08:32:33.922646 | 2019-03-16T15:43:21 | 2019-03-16T15:43:21 | 175,989,719 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,340 | cpp | main.cpp | #include "handle.h"
#include <iostream>
#include <cassert>
using namespace DaniM::MemoryManagement;
using namespace std;
struct Foo
{
public:
Foo() : foo(0) {}
Foo(int f) : foo(f) {}
int foo;
};
struct HF
{
public:
int f;
HANDLE h;
};
typedef System<Foo,HANDLE> FooSystem;
int main()
{
FooSystem system;
vect... |
1853ae8fc8f567cbe16e7ecc0a3516305c49ef2c | efb43442be45b60eca4f8c2d09bca74fdc152caf | /src/DbOrcaTask.cc | 481b281f0da7e5f4407c68ec4e40cd9d476f5297 | [] | no_license | stuartw/gross | 105fa4468b215467de5812217a03512f3f4975e7 | dfdf3790a3814654b155cf9ee1fef3b9ddf1c595 | refs/heads/master | 2020-06-01T18:25:11.963820 | 2012-03-18T19:01:10 | 2012-03-18T19:01:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,545 | cc | DbOrcaTask.cc | #include "DbOrcaTask.hh"
#include "TaskFactory.hh"
#include "Job.hh"
#include "CladLookup.hh"
#include "LocalDb.hh"
#include "PhysCat.hh"
int DbOrcaTask::split() {
if(!Id()) {
cerr<<"DbOrcaTask::split() Error: Task has no ID"<<endl;
return EXIT_FAILURE; //Task must be on database first
}
//get owner an... |
341dd8592f1ea4e19bf9f9e32a5c996521c9b041 | e97672d82caaca7de4f1bde83d077c3c61eff9d5 | /2018/Week-6/eduardo/dolls.cpp | 61854a50a51387856c8c1c0ed22c437e990822e3 | [] | no_license | lucioeduardo/competitive-codes | 3345c48ff6ee7e5c9dd32fff8cf2db1d0904f5e2 | cbb8be67f0dd4c92124378cfbc07a34ab6b58c42 | refs/heads/master | 2021-11-22T21:12:25.346487 | 2021-10-19T11:48:51 | 2021-10-19T11:48:51 | 141,634,356 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 929 | cpp | dolls.cpp | #include <cstdio>
#include <algorithm>
#include <vector>
#include <functional>
#define MAXN 20200
using namespace std;
typedef pair<int,int> pii;
vector<pii> dolls;
vector<int> stacks;
bool compare(pii a, pii b){
if(a.first == b.first)
return a.second < b.second;
return a.first > b.first;
}
int main(){
int t;
... |
95344306b9d5a132ede87c70dc404ead5f130120 | bb06a32beab10da5deb8be91b5031cdfdf48e610 | /src/main.cpp | 955cd95238fea9fc33d42898b96f7bc1a96da287 | [
"MIT"
] | permissive | Mininoob/CWLevelSystem | 78a4a8da1bf3ae1b2f9baeae9d88a1ad57338a46 | ee5e06bcc0d1c4417d0a7eb2cf52897fa908e903 | refs/heads/master | 2022-04-13T20:45:46.603091 | 2020-04-15T18:11:51 | 2020-04-15T18:11:51 | 255,851,793 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,026 | cpp | main.cpp | #include "CWSDK/cwsdk.h"
#include "main.h"
#include <wchar.h>
#include <stdio.h>
#include <string.h>
#include <fstream>
#include <sstream>
#include <vector>
#include <map>
class Mod : GenericMod {
void SetLevel(int lvl)
{
//Change character's level in the txt file as well as inside the game
}
... |
0cbc86641d533d68392582c077088f7ef15cd673 | 3dbcde548ddef642e993dc2061d0750e64f613df | /错误探测.cpp | a116e011c21886270aaa2cf58ccb45b706163e66 | [] | no_license | juruo123/some-programs | df89d57684e43d2567f09dd442e7bf5262b8d000 | 4ba7549c20c323a5cd5501a41059d99039f19cb1 | refs/heads/master | 2020-04-14T20:58:40.845815 | 2019-01-04T14:07:33 | 2019-01-04T14:07:33 | 164,113,118 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 532 | cpp | 错误探测.cpp | #include<bits/stdc++.h>
using namespace std;
int a[101][101],b,c,fb,fc,n,m;
int main(){
cin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
a[0][j]=(a[0][j]+a[i][j])%2;
a[i][0]=(a[i][0]+a[i][j])%2;
}
for(int i=1;i<=n;i++){
if(a[i][0]>0)
{
fb=i;
b++;
}
... |
95c33cf575b43e8d3239759fe5b91eb3c6b464fc | a809cd70ef136d7e2fcf70a207880f186d019207 | /modules/io/src/save_mesh_obj.cpp | 8ca2d7161d3e7c7d2cac5d9fa55d7dd964e89855 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference",
"LicenseRef-scancode-proprietary-license",
"MPL-2.0",
"BSD-3-Clause",
"MIT",
"BSL-1.0",
"LicenseRef-scancode-public-domain"
] | permissive | adobe/lagrange | ea9d4c700ed70003ee9c9ecef55fecd6b9d77ba7 | 2f78a647ecb867619c73489a5e3ea752f26353ef | refs/heads/main | 2023-08-10T05:18:14.852199 | 2023-06-28T18:29:31 | 2023-06-28T18:29:31 | 319,374,542 | 229 | 23 | Apache-2.0 | 2023-08-30T23:21:30 | 2020-12-07T16:14:06 | C++ | UTF-8 | C++ | false | false | 6,877 | cpp | save_mesh_obj.cpp | /*
* Copyright 2022 Adobe. All rights reserved.
* This file is licensed to you 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 appli... |
68baa2efcf2c6262003be3587ebd8eb22e164848 | fdfed59d04e38a76a1aed2ba935ffd2106718c8d | /sqlstlPriv.h | 21b655537e273f58c71b1c6c0cdc0f659e4d0071 | [] | no_license | Shakthi/sqlstl | d1d622140cdd91f0fad0e5059ae9d36abc95fa26 | 561874f37c6ffa96ebe8b739ee51a923f0a33ff7 | refs/heads/master | 2016-09-03T06:43:09.158908 | 2013-03-09T17:57:37 | 2013-03-09T17:58:08 | 3,326,551 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 312 | h | sqlstlPriv.h | /*
* sqlstlPriv.h
* sqlstl
*
* Created by Shakthi Prasad G S on 09/01/12.
* Copyright 2012 Shakthi. All rights reserved.
*
*/
/* The classes below are not exported */
#pragma GCC visibility push(hidden)
class sqlstlPriv
{
public:
void HelloWorldPriv(const char *);
};
#pragma GCC visibility pop
|
398e46292561b12ee2031afce3060e70e956ff94 | 57e17d18ce3eb966b6032e7945452dd541a296d1 | /source/entity/hostageentity.h | df0bb46b7fa471dd912dece467a04a0c38c5cd91 | [] | no_license | ggj/reapers | 1e026c4062e7392ef3878684061578ab08a73785 | 0bd3a1f155e0f065f7df91b11d15f736d406d14c | refs/heads/master | 2020-05-17T03:30:56.029968 | 2014-03-30T02:18:42 | 2014-03-30T02:18:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 377 | h | hostageentity.h | #ifndef _HOSTAGE_H
#define _HOSTAGE_H
#include "spriteentity.h"
#include "../util/collisionsensor.h"
class HostageEntity: public SpriteEntity
{
public:
HostageEntity();
virtual ~HostageEntity();
virtual void Load(MetadataObject &metadata, SceneNode *sprites);
virtual void OnCollision(const CollisionEvent &e... |
37e9648abb3c399638bddcb7115aaa7d8b368665 | 112021b2aab61cd24847b72aeb856e887c028d25 | /Assignments/Solutions/Nadia Mukarram/Assignment 4/Q3.cpp | 40c4611a92f78285896581deebc3cccb8b7d26a0 | [] | no_license | amanraj-iit/DSA_Uplift_Project | 0ad8b82da3ebfe7ebd6ab245e3c9fa0179bfbef1 | 11cf887fdbad4b98b0dfe317f625eedd15460c57 | refs/heads/master | 2023-07-28T06:37:36.313839 | 2021-09-15T11:29:34 | 2021-09-15T11:29:34 | 406,765,764 | 10 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 460 | cpp | Q3.cpp | #include <iostream>
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main()
{
string s1;
cout << "String 1:";
cin >> s1;
string s2;
cout << "\nString 2:";
cin >> s2;
int count[256] = {0};
for (int i = 0; i < s2.size(); i++)
{
count[s2[i]]++;
}
for... |
b9f7ce834e14e55d56216a0220930085405712cd | c6b83a8baba8d639fe74d703b2407be5d2cc1e35 | /examples/3_2_vector_user.cpp | dc648e0d3ad743b63784a8929570eedc37ea4907 | [] | no_license | dmejdani/cpp-tour | 01658606b2c4d646c99c5982a77b942cfc1ab555 | a0afb62eeb2a485977898a6b7af1101412672983 | refs/heads/main | 2023-02-22T06:20:56.013706 | 2021-01-23T14:03:49 | 2021-01-23T14:03:49 | 309,141,730 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 474 | cpp | 3_2_vector_user.cpp | // user
// build with something like
// g++ -o builds/3_2_vector examples/3_2_vector_user.cpp examples/3_2_vector.cpp
#include "3_2_vector.h"
#include <cmath>
#include <iostream>
double sqrt_sum(Vector& v)
{
double sum = 0;
for (int i = 0; i != v.size(); ++i)
sum += std::sqrt(v[i]);
return sum;... |
19513fdf4f28ad9d54577fabf933e53dc193a1d9 | 06ef12f360b56e0c73160bb33e63afe76a7f428d | /C++/Maret 2021/functionReturn.cpp | bff9812b4625537c7c6348e1f2ea5feaf7178e02 | [] | no_license | Blackxin/project-random | 7f9e654ee9ac41f9beec2454fabde7a7e57f9dc4 | 4877b701988c8aa62b22d18515946c77488262ff | refs/heads/main | 2023-07-16T21:26:37.954922 | 2021-08-20T22:41:30 | 2021-08-20T22:41:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 709 | cpp | functionReturn.cpp | #include <iostream>
#include <math.h>
using namespace std;
int tambah(int a, int b) {
return a + b;
}
int kurang(int x, int y) {
return x - y;
}
int kali(int p, int q) {
return p * q;
}
int bagi(int c, int d) {
return c / d;
}
int mod(int e, int f) {
return e % f;
}
int pangkat(int g, int h) {
return ... |
ae372119bec8e9de8d4f09cab64aa2d3a66b80ec | 7ae1bef204ae51f3819d376aa82c43a4bca52416 | /src/image_trans/src/img_send.cpp | 0b6ff45a68c1f232782ec43aef8ebc436f6a3d75 | [] | no_license | zuwuwang/Travel_Assistance_Robot | e3ddfafdd803e890906a23c0ce1e8b483d247dd3 | b9cc9a9284ac2deb18abcd3624caf1210479fa44 | refs/heads/master | 2020-03-19T06:27:27.462399 | 2018-06-04T12:30:41 | 2018-06-04T12:30:41 | 136,019,564 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,490 | cpp | img_send.cpp | /***
* sub img,socket transfer
* **********/
//Includes all the headers necessary to use the most common public pieces of the ROS system.
#include <ros/ros.h>
//Use image_transport for publishing and subscribing to images in ROS
#include <image_transport/image_transport.h>
//Use cv_bridge to convert between ROS and O... |
4ccf7f073399f924279f110a59425c369b86f069 | d031284f160507a502d1c975ac076f946fe9a52d | /utils/ListPackage/NodeLinkedListt/NodeLinkedListt.h | 92f15128f1bca69c3adfc5c9f15359dfabddbfc5 | [] | no_license | hovanvydut/PBL2-Library-Management-Qt-CPP | 4338823c00bd5ccbd387e565ae6daae3fbab9f88 | 91a68757bcaf3f2e41eb5561dd6c1cdd381d0235 | refs/heads/main | 2023-02-08T10:41:47.510744 | 2020-12-24T06:04:10 | 2020-12-24T06:04:10 | 316,531,763 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,567 | h | NodeLinkedListt.h | #ifndef NODELINKEDLISTT_H
#define NODELINKEDLISTT_H
#ifndef IOSTREAM
#define IOSTREAM
#include <iostream>
#endif
template <class E>
class NodeLinkedListt
{
private:
E data;
NodeLinkedListt *previous;
NodeLinkedListt *next;
public:
NodeLinkedListt(const E);
~NodeLinkedListt();
bool hasNext();
... |
a42bcd0256665e6337b49a26c1c0b570cf5d0189 | 4db4209a737c4b15311f9cd04dcc0647fec1eda9 | /Source/mgVectorPoint.h | 46f0e84f8239d320fe437b6659978f3fbaace555 | [] | no_license | Neyav/mgGameEngine | 7cdbbf55cfba4ea41e6d5e59faa8f8fe015b6751 | d3138a1a07ca5f5eaa742eccb60fbca9288d3a46 | refs/heads/master | 2022-06-18T03:30:49.730589 | 2022-05-18T23:08:09 | 2022-05-18T23:08:09 | 32,133,116 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,347 | h | mgVectorPoint.h | #ifndef MGVECTORPOINTH
#define MGVECTORPOINTH
// Version string to faciliate quick identification of differences between uses of the included sources.
static char __mgVersion[] = "mgGameEngine 2-Branch";
// Helper Math functions. Too few for their own file.
#define mgPI 3.14159265359
#define mgSmallestValue(X, Y) ((... |
12839acdfeac90d681ebcbd4f351e8f3e8cca980 | d1913394590c65d5f3858d124d49ba39bbf6a3a2 | /vc-magic/src/Marker.cpp | d358df7d0799f99009694f69d42f597b5a9b621e | [] | no_license | Serabass/vc-magic | e690abddc462b1e18e6a2eba8763926504853be8 | 227d20e56d1bab60ae1b35e0e8a48aadfbe0b6ee | refs/heads/master | 2020-04-15T15:22:16.786270 | 2017-12-08T05:22:07 | 2017-12-08T05:22:07 | 52,162,160 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,974 | cpp | Marker.cpp | #include "Marker.h"
//--------------------------------------------------------------------------------
// ScriptMarker class functions.
//
ViceMarker::ViceMarker()
{
m_dwMarker = 0;
}
ViceMarker::ViceMarker(ViceVector3Df position, int color, int flag)
{
$(&create_marker, position.x, position.y, position.z, color, f... |
ba8d0eda0d2e3413b230766b5eb0bea88e8bb131 | 6a67e23345f03d461be96884769b4a299698ae31 | /src/resource/resource_id.h | bfd6edeab3b07ada1f6378ecf4f5d30ba3583856 | [
"MIT"
] | permissive | doc22940/crown | b1a157444c6e4ef6130fac0e8ed86f6dfa5f38db | f310ca75ea0833e6146d86a456f51296c6054f49 | refs/heads/master | 2021-02-07T20:21:59.458423 | 2020-02-28T19:02:57 | 2020-02-28T19:02:57 | 244,072,764 | 0 | 0 | MIT | 2021-01-28T10:19:36 | 2020-03-01T02:18:53 | null | UTF-8 | C++ | false | false | 1,029 | h | resource_id.h | /*
* Copyright (c) 2012-2020 Daniele Bartolini and individual contributors.
* License: https://github.com/dbartolini/crown/blob/master/LICENSE
*/
#pragma once
#include "core/strings/string_id.h"
#include <inttypes.h> // PRIx64
#define RESOURCE_ID_FMT "#ID(%.16" PRIx64 ")"
#define RESOURCE_ID_FMT_STR "#ID(%s)"
#de... |
a9699bed8ef29b3c19eef12ec9837c861a31d6b6 | 9e02c55e31a1539268ccdbd4f8dc0698d8eca794 | /AVL tree - dictionary/main.cpp | 4950217f52c3a2645cc766e59640e628cf58379e | [] | no_license | uchmielewska/EADS | 4dfb28c4fbe0436daf984911850ace4d13c24d58 | c82f90db16a0b6b713d85108e49a4f72e4d1c497 | refs/heads/main | 2023-04-09T14:31:49.521618 | 2021-04-12T21:52:58 | 2021-04-12T21:52:58 | 357,346,745 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,177 | cpp | main.cpp | #include <iostream>
#include "dictionary.h"
using namespace std;
int main()
{
//CONSTRUCTORS TEST
{
Dictionary<int, int> test;
if(!test.is_empty())
cerr << "default constructor error is_empty() == false\n";
if(test.height())
cerr << "default constructor error h... |
03259ce9d149ba80a53946419545154d1c46e79e | 48ebb9aa139b70ed9d8411168c9bd073741393f5 | /Classes/Native/AssemblyU2DCSharp_TheSecondaryMenuControl_U3CgetOn4197163907.h | 5ce9841179319d3ed15e193e8d879d2cfa7b47b3 | [] | no_license | JasonRy/0.9.1 | 36cae42b24faa025659252293d8c7f8bfa8ee529 | b72ec7b76d3e26eb055574712a5150b1123beaa5 | refs/heads/master | 2021-07-22T12:25:04.214322 | 2017-11-02T07:42:18 | 2017-11-02T07:42:18 | 109,232,088 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,834 | h | AssemblyU2DCSharp_TheSecondaryMenuControl_U3CgetOn4197163907.h | #pragma once
#include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <stdint.h>
#include "mscorlib_System_Object2689449295.h"
// System.Collections.Generic.List`1<ConsoleApplication.LocalProcessing/DeviceProperties>
struct List_1_t1561597113;
// System.Object
st... |
aecb64c3174e1f471374c3fe87d83501d311e99b | 9cbf3eec191141dfe8ccd863d7c2a4988bc92dbb | /algorithm/solution_2.4.25.cpp | 775038194e365bdf1609ca7ed58cb81b6c474b5b | [] | no_license | MOON-CLJ/learning_cpp | e2f5574f66c0880f5e72fa232b83d84ecfdc8b42 | c7594156ccbf72d528b3bf5c5ab8a0b16df86795 | refs/heads/master | 2021-01-19T06:15:57.431024 | 2015-03-22T10:11:38 | 2015-03-22T10:11:38 | 11,716,435 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,144 | cpp | solution_2.4.25.cpp | #include <iostream>
#include <cmath>
#include "MinPQ.h"
struct X {
long val;
int i;
int j;
X() {}
X(int i, int j): i(i), j(j) {
val = (long) std::pow(i, 3) + (long) std::pow(j, 3);
}
inline bool operator>(const X& other) {
return other.val < val;
}
};
int main() {
... |
d10e544ce4e014093ff75c7d13bd3cd04a1255d6 | 8791af6a688144906240096aacbc4750773a3de2 | /jni/JJerasure.cpp | d253d664c27d2e120b798f590298de8504431d47 | [] | no_license | buptUnixGuys/jerasure-jni | 9849bac51bf4c9431505235188f913afb262de2a | 538145d69cef49b124d1c0032d872185b0bb4444 | refs/heads/master | 2021-01-20T12:38:14.635228 | 2014-12-16T05:50:42 | 2014-12-16T05:50:42 | 28,066,293 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 13,978 | cpp | JJerasure.cpp | #include <stdlib.h>
#include "JJerasure.h"
#include "jerasure.h"
#include "javautility.h"
#include "reed_sol.h"
#define talloc(type, num) (type *) malloc(sizeof(type)*(num))
/*
* Class: cn_ctyun_ec_jni_Jerasure
* Method: jerasure_matrix_to_bitmatrix
* Signature: (III[I)[I
*/
JNIEXPORT jintAr... |
49b9718167543b1d60b7c0a4d24341b09f321601 | 571c80c75f798a4722fb46d2a05458c27402a6ca | /vchat/paInit.h | b674bfe1bfe387d7281e5b9ed1b8931495a697b3 | [
"BSD-2-Clause"
] | permissive | theDarkForce/Vocal | 825dd31beed1e9081bbb4571ceb814df63ffbce4 | 2aa43150d642295b20d3206f030866962fdbd4f2 | refs/heads/master | 2021-01-10T02:32:03.242513 | 2015-10-16T01:35:27 | 2015-10-16T01:35:27 | 44,355,314 | 2 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 115 | h | paInit.h | #include <portaudio.h>
class paInit{
public:
paInit(){
Pa_Initialize();
}
~paInit(){
Pa_Terminate();
}
}; |
198d32886e5b86506d8e737223b3fab2bfb4908d | 4cf28a2d5549af2543c7972994d91039bf3c2e68 | /playerbot/strategy/priest/PriestNonCombatStrategy.cpp | e2c1a2046fa865edc3451fbe86867c9751b3548d | [] | no_license | ike3/mangosbot-bots | 3f951e7ce60a3077152d815e3097e3a95902ca38 | d0632d39c1495361cd5693cf55e81ccc03ec3364 | refs/heads/master | 2023-09-01T03:51:16.854715 | 2023-08-26T16:39:03 | 2023-08-26T16:39:03 | 144,438,132 | 47 | 62 | null | 2021-06-30T17:35:21 | 2018-08-12T04:39:27 | C++ | UTF-8 | C++ | false | false | 2,053 | cpp | PriestNonCombatStrategy.cpp | #include "botpch.h"
#include "../../playerbot.h"
#include "PriestMultipliers.h"
#include "PriestNonCombatStrategy.h"
#include "PriestNonCombatStrategyActionNodeFactory.h"
using namespace ai;
PriestNonCombatStrategy::PriestNonCombatStrategy(PlayerbotAI* ai) : NonCombatStrategy(ai)
{
actionNodeFactories.A... |
50dc3c715793232df36c0baa26597f50b8130cc6 | 287b14395f1509784f5c76ca898c0319447be111 | /branchingLogic/nestedIF-formatedNumbersToOutput-v1.cpp | f0bfb655927c467f9c96acbe9c7103bfc8b8a699 | [
"MIT"
] | permissive | dovanduy/cppTopics | 48045085e7afff79e22373aa04dc688056cda118 | 94461d25832b53e6c40c374fb2ff1695b3dfe3c7 | refs/heads/master | 2020-05-26T19:22:24.706301 | 2017-06-28T19:38:57 | 2017-06-28T19:38:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,159 | cpp | nestedIF-formatedNumbersToOutput-v1.cpp | /* You're given an array of integers.
Can you find what fraction of the elements are
positive numbers, negative numbers and zeroes?
Print the value of the fractions
in decimal form with 3 decimal places.
Input Format:
The first line contains N: the size of the array.
The next line contains N space-separated integers.... |
3fd18b6621b5404c98be4393bf10d084e8c88b5d | 1d59148845e5bfac9bcd76f519f5880ad573421f | /euler5.cpp | ac26fe2d2b211d1d5114677769d7bb39d2920b0c | [] | no_license | mkindt/csci333-lab1 | 292d8d6ef58b6809c05a365217d76fad3acdadfe | 093793c483c38e335c0edb20716af6591bdc10bb | refs/heads/master | 2020-05-17T03:53:25.876963 | 2012-09-08T00:32:51 | 2012-09-08T00:32:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 512 | cpp | euler5.cpp | #include <iostream>
int main() {
//Euler problem 5
// 19*20 means divisible by 2,4,5,10
// start high: 18,17,16,15,14,13,12,11
// what's a better way to determine used divisors....
int test = 19*20;
int smallest = 0;
int count = 0;
for (int i = 1; i <= test*i; ++i) {
count = 0;
for (int j = 18; j >= 11; --... |
e12b59158759c62dad6e1c5c68d87b7d0a6f244c | 29e3bc61de14643419fa91ad2ca81a4bd2d9a9bd | /algorithms/max_subarray/max_subarray.cpp | e4a223b1fcce965929b10c58dc72ba5bb80f411f | [] | no_license | Luxiush/Notes | f2f60744e3b81d1ccb1e2b0267c13d6f38c45c2a | 7b7dc5ba25e8b53d6c233c3288239cf0e907993d | refs/heads/master | 2021-06-05T06:21:45.049419 | 2021-01-13T23:54:16 | 2021-01-13T23:54:16 | 95,122,659 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,279 | cpp | max_subarray.cpp | /*
最大子数组
问题背景：股票的低价买进，高价卖出，实现收益最大化
问题描述：给定一段时间内股票的价格变化，求一段日期，使得从第一天到最后一天的股票价格净变化值最大。
思路：从每日价格变化的角度考察输入，而非每日价格的角度
---第i天的价格变化定义为第i天和第i-1天的价格差。
分治法求解：
寻找数组A[low..high]的最大子数组A[i..j]，
将A[low..high]划分为两个子数组A[low..mid]和A[mid+1..high]
A[i..j]所处的位置有三种情况：
* low<=i<=j<=mid
* mid<i<=j<=high
... |
308887e86c21cc774437353aec83bb30ce5e8657 | 89c6e274dd4daf0aa771fe25dab136a0254506f8 | /src/backend/planner/nested_loop_index_join_node.h | 2581dff2da004db57cdbe99f8a974ad4f0ae7c74 | [
"Apache-2.0"
] | permissive | dvanaken/peloton-bwtree | 761db53008eb7f091154d47ea6d3a0af8ae44f65 | 52785fb88239f1789b8b5502d645fbd64ebdfaac | refs/heads/master | 2021-01-11T19:43:15.837317 | 2016-03-10T04:31:20 | 2016-03-10T04:31:20 | 49,620,925 | 6 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,524 | h | nested_loop_index_join_node.h | //===----------------------------------------------------------------------===//
//
// PelotonDB
//
// nested_loop_index_join_node.h
//
// Identification: src/backend/planner/nested_loop_index_join_node.h
//
// Copyright (c) 2015, Carnegie Mellon University Database Group
//
//===---------------... |
7e8e06765a572b2ad1ccf6caa5cdcaf94f9099bb | 7e27f6926378247885e56703e7d80e92a691b1ea | /any-sketch/src/test/cc/any_sketch/crypto/sketch_encrypter_test.cc | 671a6709186a04268f2ace8b4c429cd79ee249c6 | [
"Apache-2.0"
] | permissive | pasin30055/experimental | b0f8c292349b5508555618e66ec52363a416337f | da31d3b50476cd613bc8cf51630bdbed1e1d02d4 | refs/heads/main | 2023-03-03T18:20:45.176965 | 2021-02-13T00:07:42 | 2021-02-13T00:07:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 17,896 | cc | sketch_encrypter_test.cc | // Copyright 2020 The Cross-Media Measurement Authors
//
// 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 applic... |
55f04ad9e97730597713e8a9408a22330fee3907 | 11b65cb853719f08e2ded356c9f8c57bba772120 | /msdccmbd/VecMsdc/VecMsdcVJob.cpp | c65b665c4f68bddf9f959c82f358c43718a3ecb7 | [
"BSD-2-Clause"
] | permissive | mpsitech/MultiSpectralDetectorControl | 66f6a1d0426625db69f9ce511f354052ef1977fa | 93687854f2363a42e80ca846d5ebc6cdb938443f | refs/heads/master | 2020-03-26T16:30:30.919216 | 2019-03-27T19:22:25 | 2019-03-27T19:22:25 | 145,106,504 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,836 | cpp | VecMsdcVJob.cpp | /**
* \file VecMsdcVJob.cpp
* vector VecMsdcVJob (implementation)
* \author Alexander Wirthmueller
* \date created: 18 Dec 2018
* \date modified: 18 Dec 2018
*/
#include "VecMsdcVJob.h"
/******************************************************************************
namespace VecMsdcVJob
****************... |
42cec2f7ab0821ec7c484ab0954835914ecf03ed | 84a88a31d83bf89c1f51d22a70b5eda0e7d37f9e | /lib/DebugHelper/LLDBHelper.cpp | 15ce3f55c801ba4fce2d37b4a08a83dc854ff20a | [] | no_license | tovain10071991/saib-with-triton | c136d0fd8f885fe2cc007fb70b194ebeb84d56d0 | a02036c5d51752fdc3196c2027605a281b4d5d93 | refs/heads/master | 2020-09-24T07:50:51.271296 | 2016-08-22T10:46:06 | 2016-08-22T10:46:06 | 66,799,337 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,851 | cpp | LLDBHelper.cpp |
#include "ptraceHelper.h"
#include "DebugHelper.h"
#include "ELFHelper.h"
#include "common.h"
#include "lldb/API/SBDebugger.h"
#include "lldb/API/SBTarget.h"
#include "lldb/API/SBProcess.h"
#include "lldb/API/SBModule.h"
#include "lldb/API/SBModuleSpec.h"
#include "lldb/API/SBBreakpoint.h"
#include "lldb/API/SBThread... |
64e5cdf4bc1025b89e0b92172fb988ebfd9401d8 | d3bb7f5a67104ef50f292ca46a2b54841cf47c36 | /Stack/NodoLigado.cpp | a47cac10e2485fe900a9ae456b564385cb9573b5 | [] | no_license | CarlosCastroTrejo/StackClass | ff20aa9ceccf7dd98f1143b13713261af9702482 | d8073f2c9527708e3d9c8e6f9e6482272a144170 | refs/heads/master | 2020-04-02T16:25:26.166343 | 2018-10-25T04:50:32 | 2018-10-25T04:50:32 | 154,611,679 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 556 | cpp | NodoLigado.cpp | #include "NodoLigado.h"
NodoLigado::NodoLigado()
{
this->dato = 0;
this->sig = NULL;
}
NodoLigado::NodoLigado(int dato)
{
this->dato = dato;
this->sig = NULL;
}
void NodoLigado::setSig(NodoLigado* s)
{
this->sig = s;
}
NodoLigado* NodoLigado::getSig()
{
return this->sig;
}
int N... |
57b9cd4188630f1878a44b3581d748a209105769 | 77db7f6d5cee7dbead860ef01fb943262e2b9580 | /ProjectFlightSchool/ProjectFlightSchool/MapSection.cpp | 2c73a259aafa6b48d704dc49947596fb884ed3ba | [] | no_license | SvinSimpe/Project-Flight-School | e4f5e06c95f7024cd6fb9f5fd5b01ecfaf7cfb59 | 00a64d06be2bba985ba195aabf8f4fa4bf109e1f | refs/heads/development | 2020-12-24T15:13:54.535124 | 2015-03-20T09:36:38 | 2015-03-20T09:36:38 | 26,538,774 | 0 | 3 | null | 2015-03-24T12:33:59 | 2014-11-12T14:06:46 | C++ | UTF-8 | C++ | false | false | 2,611 | cpp | MapSection.cpp | #include "MapSection.h"
#include "Map.h"
HRESULT MapSection::Render( float deltaTime )
{
for ( int i = 0; i < (int)mInstances.size(); i++ )
{
mInstances[i]->Render( deltaTime );
}
return S_OK;
}
HRESULT MapSection::Initialize( Map* map, MapSection* parent, MapNodeInstance** mapNodes, int childID )
{
////if null... |
9767a95037b77a6417e6cc1bfa4fde57bbc3386b | 8b07e31d203b3d3102b29c73e0777713adcd64b6 | /UVa/11966.cpp | f55b36de3ae76d4c9f36b561a0da756dff6ea8c1 | [] | no_license | rapel02/competitive-programming | 70d193c17e0da447b76643d6d3818c3f5000df8f | 27d39667ca4f3b4dde1cef6234cd847c23d82b5f | refs/heads/master | 2020-06-04T16:18:39.018983 | 2019-06-15T16:34:06 | 2019-06-15T16:34:06 | 192,099,411 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,208 | cpp | 11966.cpp | #include<bits/stdc++.h>
#define EPS 1e-9
using namespace std;
struct Point{
double x,y;
}star[1500];
int p[1500],h[1500];
double sqr(double x)
{
return x*x;
}
double dist(int a,int b)
{
return sqrt(sqr(star[a].x - star[b].x) + sqr(star[a].y - star[b].y));
}
int par(int a)
{
if(p[a]==a) return a;
return p[a] =... |
9988e42f804f0a27b18f346166f5a0b151f62dc2 | 41a7a34a192478ba3704dad2201f1c85e423af23 | /TimeTravel/Source/TimeTravel/Player/TestPlayer.cpp | 897033f010c84ab122324927dec50a549e79ab77 | [] | no_license | Flargy/TimeTravel | 7c831c66586113423638ca60ee1bebdffc21433f | 483d3603243a7425304c3b0cec341513b86a2241 | refs/heads/main | 2023-07-07T05:17:11.461331 | 2021-08-13T09:12:19 | 2021-08-13T09:12:19 | 357,121,430 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 931 | cpp | TestPlayer.cpp | #include "TestPlayer.h"
#include "TimeTravel/TimeTravelGameModeBase.h"
#include "Kismet/GameplayStatics.h"
ATestPlayer::ATestPlayer()
{
PrimaryActorTick.bCanEverTick = true;
}
void ATestPlayer::SetupPlayerInputComponent(UInputComponent* PlayerInputComponent)
{
PlayerInputComponent->BindAction(TEXT("ReverseTime"), E... |
497b1ea675b2a7e0da5753057a055e2bd3a9fcbf | 4cf93f7a186aa34f96825176c9bc5099f704e31c | /nrf recievers/recieving arduino/rec_2ang.ino | 5016c7f9267c8908a13328b8b01e779308cfc139 | [] | no_license | aksaxena09/Virtual-telepresence-robot-arduino-code | cfbba02d01531ec33e828e77dc55e1038364842e | fb171ea58a772c63c4ffd0861906619f0138c54a | refs/heads/master | 2022-07-17T14:03:01.991709 | 2020-05-14T20:40:05 | 2020-05-14T20:40:05 | 264,018,632 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,936 | ino | rec_2ang.ino | #include <Servo.h>
#include <SPI.h>
#include <nRF24L01.h>
#include <RF24.h>
#include "printf.h"
#include <RF24_config.h>
int CE_PIN = 9, CSN_PIN = 10, servoang;
RF24 object(CE_PIN, CSN_PIN);
uint64_t address = 0x4321ABCDE1LL;
Servo servoA, servoB;
long timer = 0;
struct angs
{
int x, z, c;
} data;
void setup() {
Se... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.