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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
830aa65fff3e0591ff451d3aac1350d7f0e51663 | 9dea335fd82ea91fcca8facbba65009ca9c59355 | /Dev/Cpp/common/EffekseerPluginModel.cpp | 7e8aa8597031d9915e5373c3c6c4e76a4b59c8b5 | [
"MIT"
] | permissive | effekseer/EffekseerForUnity | 529d43dd198f825ec3fe1d95c7f8610b7b91741b | 9004b1002daec41e5cf45716e26bad8e83e97ab2 | refs/heads/master | 2023-08-18T18:29:50.987077 | 2023-08-03T03:54:01 | 2023-08-03T03:54:01 | 66,772,750 | 50 | 28 | MIT | 2023-08-03T03:52:55 | 2016-08-28T14:31:50 | C# | UTF-8 | C++ | false | false | 2,115 | cpp | EffekseerPluginModel.cpp | #include "EffekseerPluginModel.h"
#include <algorithm>
namespace EffekseerPlugin
{
ModelLoader::ModelLoader(ModelLoaderLoad load, ModelLoaderUnload unload, GetUnityIDFromPath getUnityId)
: load(load), unload(unload), getUnityId_(getUnityId)
{
memoryFile = Effekseer::MakeRefPtr<MemoryFile>(1 * 1024 * 1024);
}
Effek... |
55f8846ef0450681b62807a9eebe820216059cee | ba444c530390b369d92d2a446b2667ed10674ac4 | /problems/12502.cpp | 7b212084df0ab96f2b770917b772428db4d5753f | [] | no_license | mkroflin/UVa | 62c00eede8b803487fa96c6f34dc089b7ea80df5 | aa9815f710db094fb67ceafb485b139de58e9745 | refs/heads/master | 2022-03-21T05:04:32.445579 | 2018-11-15T19:44:19 | 2018-11-15T19:44:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 340 | cpp | 12502.cpp | #include <iostream>
using namespace std;
int main()
{
int t, a, b, m;
cin >> t;
while (t--)
{
cin >> a >> b >> m;
int r;
if (2 * a <= b)
r = 0;
else if (a < 2 * b)
r = (2 * m * a - m * b) / (a + b);
else
r = m;
cout <<... |
996f334afabf102c74ad5af11afa99be300c3cef | 49fea82ce3cb1b9eef5de574c640333c28aba12d | /1091OOPIMW04/TS0402/Fraction.cpp | deaff61fbf636df42bcecc9c954ea39ad1884a46 | [] | no_license | FelixH-XCIX/Object-Oriented-Programming | fb369f0dde1bad0516f004249466a78929ca8858 | 4df804521cedb7ea840eeeeedb169e988be8e4cc | refs/heads/main | 2023-02-07T11:31:27.030364 | 2021-01-02T16:13:21 | 2021-01-02T16:13:21 | 319,557,384 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,289 | cpp | Fraction.cpp | #include "Fraction.h"
#include <vector>
int Gcd(int a, int b)
{
while (b) b ^= a ^= b ^= a %= b;
return a;
}
void Fraction::setNumerator(int nu)
{
numerator = nu;
}
void Fraction::setDenominator(int de)
{
denominator = de;
}
//numerator = a, denominator = b
void Fraction::getDouble()
{
... |
16f32d1e4025bd4ca06e407c69da6cddd4b32954 | aeef4d7bab4ca441fbecc2823815e9f94cb4563b | /src/sim/include/simio.h | 042ca53526649a0551c4f204160c99358837d8e5 | [
"BSD-2-Clause"
] | permissive | FreeFalcon/freefalcon-central | 8fc80b6d82eab44ce314a39860e6ee8e6f5ee71a | c28d807183ab447ef6a801068aa3769527d55deb | refs/heads/develop | 2021-01-23T20:49:45.844619 | 2014-10-30T18:32:35 | 2014-10-30T18:32:35 | 7,615,342 | 133 | 90 | null | 2014-10-30T18:32:35 | 2013-01-15T00:02:23 | C++ | ISO-8859-10 | C++ | false | false | 10,586 | h | simio.h | /******************************************************************************/
/* */
/* Unit Name : simio.h */
/* ... |
e702fcba6f6a2af2ba3d04e8d459f16a866f6252 | c32d00bb23c66afb1126c9637746350c7417ec2e | /Tuple.h | 439eee250fa9cfe2c4aa13c09cd358c9d69db0ad | [] | no_license | dahenderson98/RelationalDatabase | e20932807bb1008d238b0a3d99c4ef783fd6626e | de99c03d3837a196fc4dd4d42dff368c5345c2c5 | refs/heads/main | 2023-07-19T10:56:13.848550 | 2021-09-14T02:11:53 | 2021-09-14T02:11:53 | 387,247,352 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 959 | h | Tuple.h | /*
Dallin Henderson
Tuple.h
Project 4: Rule Evaluation
*/
#ifndef TUPLE_H
#define TUPLE_H
#include <iostream>
#include <vector>
using namespace std;
class Tuple {
public:
void addVals(Parameter* param1, vector<Parameter*> parameterList) {
values.push_back(param1->toString());
for (unsigned int i = 0; i < paramet... |
417eab5329358d791f54777f94f8bfb19234786c | 1d208d6ccbaa6b048b50532b9f58e787b71fba2f | /Skin.cpp | f440e1373e1fcb925834690d38a8ae719a85527f | [] | no_license | ZiqiGan/CSE-169 | 1d8ef8e15c5639b7041d110c398163812748217c | 38c497c775d3ce3763de668e4cb60105c45f614a | refs/heads/master | 2021-10-28T14:46:00.103984 | 2018-03-03T22:02:11 | 2018-03-03T22:02:11 | 118,568,536 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,930 | cpp | Skin.cpp | #include "Skin.h"
const float PI = 3.14159265359;
Skin::Skin()
{
t = new Tokenizer();
}
Skin::~Skin()
{
}
void Skin::load(const char * filename)
{
t->Open(filename);
//load .skin file
while (1) {
char temp[256];
t->GetToken(temp);
if (strcmp(temp, "positions") == 0) {
int numVertices = t->GetInt();
... |
2299d85fea783756e554af1684f8e79e08fbae25 | 82621767a8fffb6f5c1e0323879d4f2f7555e3b0 | /balloc/balloc.cpp | 9bd15f569c34ec2ceccdc8fd8052f8402ed5ee19 | [
"Zlib"
] | permissive | abelianwang/malloc-survey | 40b46b1507ec8c5666157b53326d4a23e31ac88e | 6da5aca6aa2720d64bff709c111a5d8a5fa7a1be | refs/heads/master | 2023-03-18T09:16:13.401077 | 2016-07-06T15:11:27 | 2016-07-06T15:11:27 | 534,266,709 | 1 | 0 | Zlib | 2022-09-08T15:06:26 | 2022-09-08T15:06:26 | null | UTF-8 | C++ | false | false | 2,191 | cpp | balloc.cpp | // http://stackoverflow.com/questions/1995871/how-to-write-a-thread-safe-and-efficient-lock-free-memory-allocator-in-c
// http://stackoverflow.com/users/3186/christopher
#include <windows.h>
#include <stdio.h>
#ifndef byte
#define byte unsigned char
#endif
typedef struct
{
union{
SLIST_ENTRY entry;
vo... |
cb820193872d3c1e6d81502de38289c4fdf6ca18 | cb2f6028e2edeee86a42a4c5cd20ccdf6e2508c7 | /example_tunnel_object/src/ofApp.cpp | ea5a96bca7b622e5c1f99d3f78cfe794133a5c76 | [] | no_license | antimodular/ofxExtrude | 7eb19888744b4bdec9b01823c210ee18a0f196b5 | 0fefcfbf7fe7e79f8c65500d0c05c53959532753 | refs/heads/master | 2020-05-20T05:53:57.128577 | 2019-05-07T14:30:05 | 2019-05-07T14:30:05 | 185,417,876 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,391 | cpp | ofApp.cpp | #include "ofApp.h"
//--------------------------------------------------------------
void ofApp::setup() {
tunnel_object.setup();
ofBackground(64);
}
//--------------------------------------------------------------
void ofApp::update(){
tunnel_object.update();
}
//---------... |
3ad64a23dad59392c4255890bda32d790553d3f3 | 647279d2a3f43217a1ae830f07301357b3a24b68 | /src/cpp/LassoRegression.cpp | 554fd086b378bc03cafd117c2fc58456910ebc3f | [
"Apache-2.0"
] | permissive | aflorio81/Amazon-MIT-RoutingChallenge | 7e16244a7cf920f713da97c3613172b849e2904b | cbacc7b62a41b81c3e4b9ffde0f8dea0f81d3f5a | refs/heads/main | 2023-08-18T10:53:24.337175 | 2021-10-06T15:14:30 | 2021-10-06T15:14:30 | 397,329,177 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,265 | cpp | LassoRegression.cpp | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <memory>
#include <numeric>
#include <random>
#include <string>
#include <mlpack/core.hpp>
#include <mlpack/methods/lars/lars.hpp>
#include "LassoRegression.h"
#include "Model.h"
#include "Stopwatch.h"
using namespace std;
void La... |
7de24b4319eb447149e3000186e74c3a52fa7004 | 2fe0389b7640d83b7e0256829117327d88182ec3 | /CortexLib/Tools/RegistersGenerator/Msp432P401Y/FieldValues/itmfieldvalues.hpp | 8db04eabfa06bc6b04ce54b4ce6d23d1ca6b9411 | [
"MIT"
] | permissive | ntsiopliakis/CourseWork | 31cb142df39ce6a8ffdb56eff9ae1240257bc844 | 14b4ca4b06cdd7b41b69be26da860eb61ed86911 | refs/heads/main | 2023-05-04T06:49:54.638017 | 2021-05-23T13:03:33 | 2021-05-23T13:03:33 | 370,057,028 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,551 | hpp | itmfieldvalues.hpp | /*******************************************************************************
* Filename : itmfieldvalues.hpp
*
* Details : Enumerations related with ITM peripheral. This header file is
* auto-generated for MSP432P401Y device.
*
*
***********************************************************... |
f47c6c75502b3bbe169ec5c424f1d1664b99534e | 48a4561db7d797c2f768314e55d0c2f3dc164cf0 | /checkpoint/q1/getalltimes.cpp | edf57a62888902de70b5b61cf215b21965b7b504 | [] | no_license | kjain1810/SPP-Assignment-1 | 28f368aaf074796b6cdef73bef195d854f232e5e | f40540eccf069b7e7894bd540cc9f4031230c865 | refs/heads/master | 2023-03-27T04:18:14.984643 | 2021-03-28T20:41:57 | 2021-03-28T20:41:57 | 347,781,202 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,345 | cpp | getalltimes.cpp | #include <iostream>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
#include <string>
#define BILLION 1000000000L;
int main(int argc, char **argv)
{
std::string x = "./run <Q1/";
std::string y = ".txt >myout/";
std::string z = ".out";
std::string cases[] = {"0", "5", "10", "15", "20", "30", ... |
0d974dade9835109aca4d12ed80c0ed3c0f9bf11 | 45e8a78cf44825d7b64f23b3a527f6ccde9abea3 | /Lista de TecProg 1(INTRO C++)/Questao 2/main.cpp | 8b5c34b701bc38369e784fb1bfb99f377e0aa9c9 | [] | no_license | nicolasrls/codigos | f9b7c33f52b732f8e576081a2db43a330e460c47 | d63d9f689c7790e28aeb877964eef8a4b4dc7659 | refs/heads/master | 2021-06-24T19:30:28.002374 | 2021-04-24T16:25:27 | 2021-04-24T16:25:27 | 218,394,029 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 567 | cpp | main.cpp | #include <iostream>
#include <locale.h>
using namespace std;
int main()
{
setlocale(LC_ALL, "Portuguese");
cout << "Tamanho do inteiro = " << sizeof(int) << endl;
cout << "Tamanho do inteiro = " << sizeof(short) << endl;
cout << "Tamanho do inteiro = " << sizeof(long) << endl;
cout << "Tamanho... |
d8bb97ade0777b2a8840d477ecb27b38dd3af55e | f8bf1bfe3e43918f767813a2115080bc58983d03 | /Cracking_Coding_Interview/1_3.cpp | 48b659c7a02fbd62c7541c66268174044764ba5f | [] | no_license | iliemihai/ALGORITHMS | 39926dbce91b28823b8a037d451478c6192bfd31 | 1ee8a2bed623821ca67cd3479d9951ddae1e2bf6 | refs/heads/master | 2020-09-12T01:46:58.423496 | 2019-11-17T14:26:51 | 2019-11-17T14:26:51 | 222,260,066 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,046 | cpp | 1_3.cpp | #include<iostream>
using namespace std;
//idea edit string from end. first we count the number of spaces
// triple it and compute how many extra chars we will have in final
//string. in the second pass in reverse order replace space with %20, if no space copy original char
void replace_chars(char* str, int length) {... |
00f1e2392eb35fd6f9785bbd6a6ffccd69dd371a | be28bc01135a691b324650988eee7c99310bc5a5 | /llarp/service/handler.hpp | 9fabb6b9543763c9f5bf7776f2f360fbad01bbaf | [
"CC0-1.0",
"Zlib"
] | permissive | neuroscr/loki-network | ab559c038bccf6ee14c05c38507b907a59cdc73c | 6af3512dfa7d2ef5da1e5c6ec235a84f4813a3cf | refs/heads/master | 2020-03-20T21:14:14.151285 | 2020-01-08T12:57:37 | 2020-01-08T12:57:37 | 137,730,176 | 2 | 1 | null | 2018-06-18T08:58:34 | 2018-06-18T08:58:34 | null | UTF-8 | C++ | false | false | 2,101 | hpp | handler.hpp | #ifndef LLARP_SERVICE_HANDLER_HPP
#define LLARP_SERVICE_HANDLER_HPP
#include <crypto/types.hpp>
#include <path/path.hpp>
#include <service/intro_set.hpp>
#include <util/aligned.hpp>
#include <memory>
#include <set>
namespace llarp
{
namespace service
{
using ConvoTag = AlignedBuffer< 16 >;
struct Protoco... |
7c6ec89e570f93b461223b88b6675ee6d9f33ef3 | fe779be32c5e2ebf1baf9fb2f48ec98e818a3c52 | /Capitulo 5/Date.cpp | 26bd3570ae602c21b3792d2c8f99acd7c8c38bc2 | [] | no_license | andrefmrocha/MIEIC_17_18_PROG | ff57eef863837f1080b0a0884a829c9439edc54c | 95e0f02adcdb0eb4576668058ae5171a2cca41a9 | refs/heads/master | 2021-03-27T13:06:55.852646 | 2018-04-18T08:59:23 | 2018-04-18T08:59:23 | 123,624,664 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,491 | cpp | Date.cpp | //
// Created by andrefmrocha on 18-04-2018.
//
#include "Date.h"
Date::Date(unsigned int year, unsigned int month, unsigned int day)
{
this->day = day;
this->month = month;
this->year = year;
}
Date::Date(string yearMonthDay)
{
year = stoi(yearMonthDay.substr(0,4).c_str());
month = stoi(yearMonth... |
c16b85789ebac0afe1ce7fe459bbbf93d9f4fa64 | b367fe5f0c2c50846b002b59472c50453e1629bc | /xbox_leak_may_2020/xbox trunk/xbox/private/xdktools/Producer/CommandStripMgr/CommandPPGMgr.cpp | fcbb0f8591e20cd8dafad03b20c39f30a5354cdc | [] | no_license | sgzwiz/xbox_leak_may_2020 | 11b441502a659c8da8a1aa199f89f6236dd59325 | fd00b4b3b2abb1ea6ef9ac64b755419741a3af00 | refs/heads/master | 2022-12-23T16:14:54.706755 | 2020-09-27T18:24:48 | 2020-09-27T18:24:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,396 | cpp | CommandPPGMgr.cpp | // CommandPPGMgr.cpp: implementation of the CCommandPPGMgr class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "CommandStripMgr.h"
#include "FileIO.h"
#include "CommandPPGMgr.h"
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#defi... |
ef20e74126f14b4bcf1c1bcc0f5f6827d3307b02 | c7365b9c98cdced58ba6b1fdd10c5e093af09e20 | /luciolinae_ctl/src/AnimLuxeonTest.cpp | 189b61fd7466b563af41914cc678826eabcced43 | [] | no_license | damian0815/Luciolinae | bf600362216517d5843e13046182d2f41f3b7b1d | aa398f1b434ebed24ff7e1d3c595dfd9226a0638 | refs/heads/master | 2021-05-27T12:29:15.833026 | 2013-07-07T09:31:28 | 2013-07-07T09:31:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 865 | cpp | AnimLuxeonTest.cpp | /*
* AnimLuxeonTest.cpp
* luciolinae_ctl
*
* Created by damian on 17/05/10.
* Copyright 2010 frey damian@frey.co.nz. All rights reserved.
*
*/
#include "AnimLuxeonTest.h"
extern void delayUs( unsigned long us );
static const int BLACK_TIME = 3.0f;
static const int ON_TIME = 0.02f;
AnimLuxeonTest::AnimLux... |
7aa9a29aa6085fabf6a516960acd36a41fac4e4c | adb838c748a4609f185cce25ecfb141c7fc8395c | /UnpDaytimeTcpSrv1/daytimetcpsrv1.cc | 710fb8e05ed3d43e419c5669695ddd6fb13b8a52 | [] | no_license | sunyongjie1984/UNPSUNYJ | af8691272ead737a07c7f7eea866693326bb6644 | 365bbb05587fded561b495e66d017ad9c451d148 | refs/heads/master | 2021-01-10T03:10:11.043965 | 2016-02-15T08:24:29 | 2016-02-15T08:24:29 | 50,342,886 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,328 | cc | daytimetcpsrv1.cc | #include <time.h>
#include "../lib/unpsunyj.h"
// Daytime server that prints client IP address and port
int main(int argc, char **argv)
{
int listenfd;
int connfd;
socklen_t len;
struct sockaddr_in servaddr;
struct sockaddr_in cliaddr; // 它将存放... |
b9e873754d6ffb1417f44c7df26c0ffc53e6e8f0 | 23e393f8c385a4e0f8f3d4b9e2d80f98657f4e1f | /Inside-Windows-Debugging/chapter_03/BasicException/main.cpp | 1d4f961cca89d110dfc8079ec60aed37d1ae9a7e | [] | no_license | IgorYunusov/Mega-collection-cpp-1 | c7c09e3c76395bcbf95a304db6462a315db921ba | 42d07f16a379a8093b6ddc15675bf777eb10d480 | refs/heads/master | 2020-03-24T10:20:15.783034 | 2018-06-12T13:19:05 | 2018-06-12T13:19:05 | 142,653,486 | 3 | 1 | null | 2018-07-28T06:36:35 | 2018-07-28T06:36:35 | null | UTF-8 | C++ | false | false | 101 | cpp | main.cpp | #include "stdafx.h"
int
__cdecl
wmain()
{
throw "This program raised an error";
return 0;
}
|
240710ae2c5923a51cb4ebbf34f5cb1b5e50d87a | 948df734bc05a4b816160067597f749913859340 | /src/G2PAppBase.cc | 99586427cafbafba0a8be3b568eb1565bc8d941a | [] | no_license | zhupengjia/g2prec | 92c8f69eb27c6f99adadd72e5faacd3e9aba3b94 | 8c7d41705e1a2017ff25b1f595b25a6da042a949 | refs/heads/master | 2021-01-23T16:29:57.546245 | 2014-12-19T20:30:24 | 2014-12-19T20:30:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,750 | cc | G2PAppBase.cc | // -*- C++ -*-
/* class G2PAppBase
* Abstract base class for g2p reconstruction tools.
* It provides fundamental functions like parsing configuration files.
*/
// History:
// Mar 2013, C. Gu, First public version.
// Sep 2013, C. Gu, Add configure functions.
// Feb 2014, C. Gu, Modified for G2PRec.
//
#incl... |
a80d3050d817be5aef57b19845d5661485f5553c | 282aaadc0f9b8458a053ebda72f8887ca2cb2e6f | /C++ Games/Tetris/childblocktemplate.cpp | 6c359e6d14a1f43d60af34efc2a8c124614f942c | [] | no_license | milletf1/BIT | 0be30452eaa531a9780c5950138b8b7c990fa931 | 0c216b96719062096e6a8fe781fbbeb259823b8a | refs/heads/master | 2020-12-31T00:54:47.039435 | 2017-06-03T06:05:33 | 2017-06-03T06:05:33 | 80,593,207 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,509 | cpp | childblocktemplate.cpp | #include "StdAfx.h"
#include "child.h"
child::child(Point^ startDrawPoint, Point^startOffset, Color startColor, Graphics^ startCanvas)
: BlockTemplate (startDrawPoint, startOffset, startColor, startCanvas)
{
}
void child::Rotate()
{
//Declare a temporary Point for passing the starting grid point to each cell
Point^ ... |
bef19de6b3fe8c34d056f14c97fcf675d1f74739 | 7886e7cc3b564019535a7f805f8de4933719c31f | /examples/test/protobuf/login.pb.h | 06eb8fbc4d4943a656aa0fb055e790f91e03f314 | [] | no_license | JohnnyXiaoYang/mongo | d56f4e69f243a26acfc0fba640016c53a984a3d0 | b0c52dd3af0616ff1101e68b8322148ac8d0462d | refs/heads/master | 2022-09-21T00:54:55.301854 | 2020-06-05T11:13:49 | 2020-06-05T11:13:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | true | 20,708 | h | login.pb.h | // Generated by the protocol buffer compiler. DO NOT EDIT!
// source: login.proto
#ifndef GOOGLE_PROTOBUF_INCLUDED_login_2eproto
#define GOOGLE_PROTOBUF_INCLUDED_login_2eproto
#include <limits>
#include <string>
#include <google/protobuf/port_def.inc>
#if PROTOBUF_VERSION < 3011000
#error This file was generated by... |
a7b3026602dabb14b8bd5c2cc35ddbc6edb0dc79 | b0acb392f8353bd4b1a003e42f776fbbe8c7b633 | /src/ImageProcessor.cpp | 1a4efa5bf2757c92cd36b803a7f2d069ddcb7c8b | [
"Apache-2.0"
] | permissive | agruzdev/ShibaView | c494de77ad5b37a35231fac29f12f2ee7e32ee73 | c663a23f97e4aa64ea3e970c2e6a54cac119b419 | refs/heads/master | 2023-07-06T22:39:08.192563 | 2023-07-02T12:13:14 | 2023-07-02T12:13:14 | 216,082,570 | 13 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 7,778 | cpp | ImageProcessor.cpp | /**
* @file
*
* Copyright 2018-2023 Alexey Gruzdev
*
* 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... |
97a8c535f4ecbeb30d579c4838ef72f18f3dee12 | 6a6b52e5fbdcaee944fb39e983b7831ee0a1c699 | /headers/Teewee.h | d8d8e12544442f3f8ab7e1224ecc7ec7d873d53f | [] | no_license | artonglocke/TetrisExcerciseMachina | 39476e8a6ca817e3ae4d284f7a792482dd2d48fe | 41fbd5f9906f816f5f81d5323c7bf9b6263456e7 | refs/heads/master | 2022-12-08T15:23:15.797936 | 2020-09-07T17:31:15 | 2020-09-07T17:31:15 | 281,204,572 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 99 | h | Teewee.h | #pragma once
#include "IShape.h"
class Teewee : public IShape
{
public:
Teewee();
~Teewee();
};
|
78e3fc754149b6b0ec37e40ceb7109025f4adb7e | 64178ab5958c36c4582e69b6689359f169dc6f0d | /vscode/wg/sdk/FBoneNode.hpp | bb788d7de20d3084dd5a8e2c09e82113b19f098a | [] | no_license | c-ber/cber | 47bc1362f180c9e8f0638e40bf716d8ec582e074 | 3cb5c85abd8a6be09e0283d136c87761925072de | refs/heads/master | 2023-06-07T20:07:44.813723 | 2023-02-28T07:43:29 | 2023-02-28T07:43:29 | 40,457,301 | 5 | 5 | null | 2023-05-30T19:14:51 | 2015-08-10T01:37:22 | C++ | UTF-8 | C++ | false | false | 1,382 | hpp | FBoneNode.hpp | #pragma once
#include "EBoneTranslationRetargetingMode.hpp"
#ifdef _MSC_VER
#pragma pack(push, 1)
#endif
namespace PUBGSDK {
struct alignas(1) FBoneNode // Size: 0x10
{
public:
FName Name; /* Ofs: 0x0 Size: 0x8 NameProperty Engine.BoneNode.Name */
int32_t ParentIndex; /* Ofs: 0x8 Size: 0x4 In... |
8c23c537b1479b5115d0cf73874dcdbe0924510f | 90a256bc1b33d5466388635d5a796bd28918b116 | /1206A.cpp | 06b09a9beffc095fcf261b94f64c416f4ba16068 | [] | no_license | moonwarnishan/CodeForces2 | 75f9774f9537f77e2922bbfe0da9516c7f12f448 | a1048ad5ea7cf5aed4f078f4af6b4a9dbab343fa | refs/heads/main | 2023-08-29T01:54:53.097658 | 2021-11-10T15:41:00 | 2021-11-10T15:41:00 | 408,134,976 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 374 | cpp | 1206A.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n;cin>>n;
long long int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
long long int m;
cin>>m;
long long int b[m];
for(int j=0;j<m;j++)
{
cin>>b[j];
}
sort(a,a+n);
sor... |
d59d9ca1b335a2cb78efe20c54b6096dd246072d | 35e79b51f691b7737db254ba1d907b2fd2d731ef | /yukicoder/424.cpp | 58bda3ca27c28d839fa15feac635f700e73d8a13 | [] | no_license | rodea0952/competitive-programming | 00260062d00f56a011f146cbdb9ef8356e6b69e4 | 9d7089307c8f61ea1274a9f51d6ea00d67b80482 | refs/heads/master | 2022-07-01T02:25:46.897613 | 2022-06-04T08:44:42 | 2022-06-04T08:44:42 | 202,485,546 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,428 | cpp | 424.cpp | #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... |
02b4da3cc333805f9046fb461993a27ddc5b32ee | e5d54d3ff26818b28197f7f3d79c44df98482f68 | /src/SMAboutDialog.cpp | d16f62ee064f962a8c9db83e57a03cc18d4c00c4 | [] | no_license | el-X/steganomonkey | 78700bdc10a558181f5779b11eb017e82493e624 | 5526a02d49973225500a22978869e469016ff1ec | refs/heads/master | 2016-09-06T02:48:15.640469 | 2014-06-24T08:37:37 | 2014-06-24T08:37:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,797 | cpp | SMAboutDialog.cpp | /*
* File: SMAboutDialog.cpp
* Author: Alexander Keller, Robert Heimsoth, Thomas Matern
*
* HS BREMEN, SS2014, TI6.2
*/
#include "SMAboutDialog.h"
SMAboutDialog::SMAboutDialog(wxWindow* parent, wxWindowID id,
const wxString& title, const wxPoint& pos, const wxSize& size)
: wxDialog(parent, id, title, ... |
0c1f4d80928667fb9ce7c54a271ef948d0c871c0 | d3d3cf3afd7a7cc9d7cf5f18551ad59dbbaaedf6 | /imageprocessingtoolboxwidget.cpp | 57c560d2af5cfe84adc61eb45e581493045ba2ce | [] | no_license | taiiksi/ImageProcessingOpenCV | ea8662a43b934e4559b797c34a68ca46589f1559 | 0a11df3ba5ace4c1b44e7430b89f62023334fd98 | refs/heads/master | 2021-01-15T12:55:00.643593 | 2016-04-04T20:15:31 | 2016-04-04T20:15:31 | 55,525,597 | 1 | 0 | null | 2016-04-05T16:51:52 | 2016-04-05T16:51:52 | null | UTF-8 | C++ | false | false | 1,253 | cpp | imageprocessingtoolboxwidget.cpp | #include "imageprocessingtoolboxwidget.h"
ImageProcessingToolBoxWidget::ImageProcessingToolBoxWidget(QWidget *parent) : QWidget(parent),
layout(new QGridLayout), toolBox(new QToolBox), firstToolSet(new QWidget),
secondToolSet(new QWidget), thirdToolSet(new QWidget), fourthToolSet(new QWidget)
{
setup... |
8e98eb7cd576d5ed2e6cb62c4653b8f621dc4ba1 | 59f762e5bd4e49489d6e1e3e14ae377497e98c56 | /3DEngine/ComponentTransform.h | 72584100fe1db3c14603e9f4b457b71994015d11 | [
"MIT"
] | permissive | PolCarCat/3D--Engine | e7ef1d225868a8d8dd4da6dc6b0b5548d0e4841d | 009eb20f5dd5b48d6b9725e119104d5222732e34 | refs/heads/master | 2020-03-28T16:08:26.536759 | 2018-12-23T21:20:33 | 2018-12-23T21:20:33 | 148,663,548 | 0 | 0 | MIT | 2018-10-09T08:05:48 | 2018-09-13T16:04:39 | C++ | UTF-8 | C++ | false | false | 609 | h | ComponentTransform.h | #ifndef __COMPONENT_TRANSFORM_H__
#define __COMPONENT_TRANSFORM_H__
#include "Component.h"
#include "MathGeoLib/MathGeoLib.h"
class ComponentTransform :
public Component
{
public:
ComponentTransform();
~ComponentTransform();
bool Start();
bool Update();
void UpdateUI();
bool CleanUp();
bool Save(JSON_Object* ... |
2c7219a6f0530b059838e71ab8de8103173850c5 | 3ff1fe3888e34cd3576d91319bf0f08ca955940f | /organization/src/v20210331/model/OrgProductFinancial.cpp | 3b9e8efe6372fcd6009e821803570ac877312ed5 | [
"Apache-2.0"
] | permissive | TencentCloud/tencentcloud-sdk-cpp | 9f5df8220eaaf72f7eaee07b2ede94f89313651f | 42a76b812b81d1b52ec6a217fafc8faa135e06ca | refs/heads/master | 2023-08-30T03:22:45.269556 | 2023-08-30T00:45:39 | 2023-08-30T00:45:39 | 188,991,963 | 55 | 37 | Apache-2.0 | 2023-08-17T03:13:20 | 2019-05-28T08:56:08 | C++ | UTF-8 | C++ | false | false | 5,200 | cpp | OrgProductFinancial.cpp | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
... |
d457308e9dec8142b2689030a3d366b08f1f3389 | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5706278382862336_1/C++/mlazowik/a.cpp | 776d001d3f5947f50727c3a222a69055e4db0ed4 | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 1,252 | cpp | a.cpp | // Michał Łazowik
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define REP(x, n) for (int x = 0; x < n; ++x)
#define FOR(x, b, e) for (int x = b; x <= (e); +... |
fadd0af18e1ac19450db5fd814e3265119f1c3e5 | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/httpd/gumtree/httpd_old_hunk_5092.cpp | 4fe6e84a0972fe042cbea13cd112f03501e601a1 | [] | no_license | niuxu18/logTracker-old | 97543445ea7e414ed40bdc681239365d33418975 | f2b060f13a0295387fe02187543db124916eb446 | refs/heads/master | 2021-09-13T21:39:37.686481 | 2017-12-11T03:36:34 | 2017-12-11T03:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 486 | cpp | httpd_old_hunk_5092.cpp | *
* (This is usually the case when the client forces an SSL
* renegotiation which is handled implicitly by OpenSSL.)
*/
outctx->rc = APR_EAGAIN;
}
else if (ssl_err == SSL_ERROR_SYSCALL) {
ap_log_cerror(APLOG_MARK, APLOG_INFO, ou... |
ad5fe1778898ddfd19e42bcdc998235c4229b802 | 52e430d46f0edbf72553b4ff513e8fcbdcb1c385 | /Algorithmic_toolbox/Week_5/1.5.1.cpp | a1b6d82556584797a312bd37763f7b0f16967e56 | [] | no_license | ivk22/Data_Structures_and_Algorithm | 5ffd040a26764428bf26cefd88219032d0dbdb93 | 8e6cceba2a9806b31dee54c89986f15b430c1639 | refs/heads/master | 2021-07-11T21:23:00.875599 | 2020-08-19T06:30:51 | 2020-08-19T06:30:51 | 191,723,271 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,226 | cpp | 1.5.1.cpp | // 1.5.1.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <iostream>
using namespace std;
int main()
{
size_t n = 0;
cin >> n;
size_t* arr = new size_t[n+1];
arr[0]=0;
size_t* coins = new size_t[3];
coins[0] = 1;
coins[1] = 3;
coins[2] = 4;
... |
a797087151c1a3582c9a69adc29737ec1c993640 | d04b7ee933b9b0dd151aa6f5cd6967fe0adcbe92 | /CodeChef_problems/The Tom and Jerry Game!/solution2.cpp | 2f2271474fe8f4bcfd13750100ff59301ac12d18 | [
"MIT"
] | permissive | deepak1214/CompetitiveCode | 69e0e54c056ca7d360dac9f1099eaf018d202bd0 | 1e1449064dbe2c52269a6ac393da74f6571ebebc | refs/heads/main | 2023-01-04T11:36:03.723271 | 2020-10-31T20:44:34 | 2020-10-31T20:44:34 | 308,840,332 | 4 | 0 | MIT | 2020-10-31T08:46:15 | 2020-10-31T08:46:14 | null | UTF-8 | C++ | false | false | 1,410 | cpp | solution2.cpp | /*
We have to make sure that Jerry wins. It is mentioned that Jerry can only win if
If TS is odd and JS is even, Jerry wins the game.
Until Jerry wins we have to make sure that the game goes on. The condition for the game to proceed is
If both TS and JS are even, their values get divided by 2 and the game proceeds wi... |
e617916b7884841f9f478277baa035cdbceafbf9 | 2ebd7fc32d3937865fb36cc301aed9a23302f99c | /sequential/seq_tree.h | e1ef35ff21bad9f88217773807b3b43461f2fef2 | [] | no_license | irbowen/b_trees | fbe0780d34d1760b3310b170d86f2449babdd03a | 14a2b5c2f448b442e4e4ef4afc3243177c374a14 | refs/heads/master | 2021-01-10T09:48:52.383186 | 2016-01-03T18:46:58 | 2016-01-03T18:46:58 | 45,809,564 | 2 | 0 | null | 2015-12-04T22:52:12 | 2015-11-09T02:13:37 | TeX | UTF-8 | C++ | false | false | 298 | h | seq_tree.h | #ifndef SEQ_TREE_H
#define SEQ_TREE_H
#include <vector>
#include <algorithm>
#include <iostream>
#include "inner_node.h"
#include "leaf_node.h"
class Sequential_Tree {
public:
Inner_Node* root;
Sequential_Tree();
void insert(int, int);
void print_all();
int get_value(int);
};
#endif
|
389243f0240955fa77e382df657321f6e36ac061 | 73b2b2ec3706168331d07a2d4cdcff8a646dc4f7 | /MyCryptoLib/src/sha256.cpp | 09ae9b9ba1451633dde9c1ad4b93962758eac550 | [
"Unlicense"
] | permissive | KoSeAn97/MyCryptoLib | ee849e90cc0c1d9f151cb0c5fe4b0d83ce6d1fae | 6bbad3c5075013dcd841eb28188dfeff2be16e25 | refs/heads/master | 2021-01-12T11:29:52.919589 | 2018-06-02T22:31:42 | 2018-06-02T23:37:50 | 72,936,985 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,937 | cpp | sha256.cpp | #include <cstring>
#include <machine/endian.h>
#include <iostream>
using std::cerr; using std::endl;
#include <MyCryptoLib/mycrypto.hpp>
#include <MyCryptoLib/sha256.hpp>
#include <MyCryptoLib/rawbytes.hpp>
using namespace raw_bytes;
// ======================== Tables Of Constants ============================= //
st... |
4c29cbacd149b6b24065e9e3eee396ad6647fa96 | ce32e80ba77094b9541b4f857031c4aa7af4d713 | /graph/vertex.cpp | a37580fa4ffe3140b6f1f120e4306a17f60cb75c | [] | no_license | jpnbastos/Janus | e8a494e8e9cf1e26a0ba279b9bedeb1496f5d3a9 | 129000eff0f20463e9366b0796b31beee16fcf21 | refs/heads/master | 2020-03-17T18:07:59.953517 | 2018-05-24T12:15:34 | 2018-05-24T12:15:34 | 133,815,507 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 64 | cpp | vertex.cpp | //
// Created by Bastos on 23/04/2018.
//
#include "vertex.h"
|
7b4ba89927eb1324bcd73ddfabb48479678fbeee | 358a40dea4ec1bcc53d431cea4eb81005ad10536 | /engine/include/Cute/Array.h | 96e5f25b9bb0bf9fcbcbc2958e04caeaf5d71a49 | [] | no_license | jeckbjy/engine | cc0a0b82b7d7891f4fbf3d851ecea38e2b1cd3f5 | 1e15d88dfb21f9cd7140d61c79764a932b24ef4d | refs/heads/master | 2020-04-07T02:00:37.381732 | 2017-06-22T06:09:10 | 2017-06-22T06:09:10 | 47,948,967 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,542 | h | Array.h | //! Collection
#pragma once
#include "Cute/Foundation.h"
#include "Cute/Exception.h"
#include <algorithm>
CUTE_NS_BEGIN
/// STL container like C-style array replacement class.
///
/// This implementation is based on the idea of Nicolai Josuttis.
/// His original implementation can be found at http://www.josuttis.co... |
9909f833f456200c7bf5e8587a98f99073d11176 | 7e797415eddea48580c78f10a571b1e2cb596d65 | /source/resource/ArchiveWriter.cpp | b95dc89ff9382726d03aa4158e0f32d9a1155b51 | [] | no_license | razzie/PotatoGame | dcf8a393221faf3d0cdd41a6f5f88b141fcb5536 | 495d243693d82df43a053dbf75b38163f598a9b7 | refs/heads/master | 2022-08-19T16:42:23.278074 | 2018-08-09T20:00:46 | 2018-08-09T20:02:22 | 144,187,201 | 0 | 0 | null | null | null | null | ISO-8859-2 | C++ | false | false | 3,030 | cpp | ArchiveWriter.cpp | /*
* Copyright (C) Gábor Görzsöny <gabor@gorzsony.com> - All Rights Reserved
* Unauthorized copying of this file, via any medium is strictly prohibited
* Proprietary and confidential
*/
#include <cstdint>
#include <vector>
#include "common/Encoder.hpp"
#include "resource/ArchiveWriter.hpp"
resource::ArchiveWriter... |
6fe3a2f4d6b3aa526f31ef91b958e4c43672c3b1 | c38531b077a4ad41c88ec68d8e5536a28f95e7a9 | /relay/handler_thread.cpp | 5bdfc6179f1f70a64ab63158dca67916498e1009 | [
"MIT"
] | permissive | jhengyilin/chatNT | ff47f9c1deb5e2da9b83ae99796f1439c62a5d80 | 7287a90bf2270d12584157285dd160b2e55dd0b3 | refs/heads/main | 2023-02-07T15:03:54.812508 | 2020-12-29T04:38:33 | 2020-12-29T04:38:33 | 325,220,787 | 0 | 0 | MIT | 2020-12-29T07:44:45 | 2020-12-29T07:44:44 | null | UTF-8 | C++ | false | false | 3,310 | cpp | handler_thread.cpp | #include "handler_thread.h"
#include <sstream>
#include <cstring>
#include <thread>
#include <unistd.h>
#include <sys/types.h>
#define CHUNK_SIZE 1024
#ifdef __linux__
#include <sys/types.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#elif _WIN32
#include <WinSock2.h>
#endif
using namespace std;
//main handler... |
67bd7ee2265e81ef4d88e819158c467153b73be6 | 45bebb1cf4e951d673755e5700a9e30b27b1c3ae | /Base/mafVersion.h | db3d2540a45b0511a0351153ba669b9eeaaf9390 | [] | no_license | besoft/MAF2 | 1a26bfbb4bedb036741941a43b135162448bbf33 | b576955f4f6b954467021f12baedfebcaf79a382 | refs/heads/master | 2020-04-13T13:58:44.609511 | 2019-07-31T13:56:54 | 2019-07-31T13:56:54 | 31,658,947 | 1 | 3 | null | 2015-03-04T13:41:48 | 2015-03-04T13:41:48 | null | UTF-8 | C++ | false | false | 1,821 | h | mafVersion.h | /*=========================================================================
Program: MAF2
Module: mafVersion
Authors: based on mafVersion (www.vtk.org), adapted by Marco Petrone
Copyright (c) B3C
All rights reserved. See Copyright.txt or
http://www.scsitaly.com/Copyright.htm for details.
This software is dis... |
95842a39d1c6f85b7fbeeb652e85e063ba356117 | cf112a9aa5c7915cd6aa73db31643ee17e1fcdf1 | /test/unit/test_vector.cpp | bb4d2538873137979d1bb323057f4dbab50bf48c | [
"BSD-3-Clause"
] | permissive | arbor-sim/arbor | eb9357b2dbcb0b751bec4fd7cda25e70c6231987 | 3314098914bba01527fbd995f7b023d70ef834eb | refs/heads/master | 2023-09-01T05:51:34.410032 | 2023-08-18T11:10:42 | 2023-08-18T11:10:42 | 69,863,074 | 82 | 48 | BSD-3-Clause | 2023-09-13T11:53:34 | 2016-10-03T11:03:22 | C++ | UTF-8 | C++ | false | false | 3,698 | cpp | test_vector.cpp | #include <gtest/gtest.h>
#include <limits>
#include <type_traits>
#include <memory/memory.hpp>
#include <util/span.hpp>
//
// wrappers
//
using namespace arb;
// test that memory::make_view and make_const_view work on std::vector
TEST(vector, make_view_stdvector) {
// test that we can make views of std::vecto... |
e71c8e3d5beb3e7710167cde6fcde017071abe5b | 9eb8913126c2b4a608ac2defa7108a46c15f828f | /FireflyEngine/include/Firefly/Rendering/Vulkan/VulkanDevice.h | 1bdd0258197a2dc8a8f36619e6658266573af85b | [
"MIT"
] | permissive | GitDaroth/FireflyEngine | 1b13e8b32f0f8062981efe17882a233d35b44fe5 | ea19a6a7f283e25eb989b2a499297e0834024c0b | refs/heads/master | 2023-06-27T19:11:31.901728 | 2021-07-18T11:53:01 | 2021-07-18T11:53:01 | 267,032,715 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,006 | h | VulkanDevice.h | #pragma once
#include <vulkan/vulkan.hpp>
namespace Firefly
{
class VulkanDevice
{
public:
void Init(vk::PhysicalDevice physicalDevice, vk::SurfaceKHR surface,
const std::vector<const char*>& requiredDeviceExtensions,
const std::vector<const char*>& requiredDeviceLayers);
... |
b087790ce7c802e8253581d81bb206234e7e0bf0 | bd9de700605da2278a92020a2814b699daedec57 | /codility/lesson13_1_FibFrog/lesson13_1_pass_0.66.hpp | c5dd5fd77ba18cdf4788621751e45b761d16c97f | [] | no_license | WuHang108/petit-a-petit | 8b177771e004341a166feb1a156153098f5d5d89 | e173df8333f9a4070aee5ee65603fed92d2abf6b | refs/heads/master | 2021-11-18T15:36:40.059510 | 2021-10-16T17:10:02 | 2021-10-16T17:10:02 | 230,759,303 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 999 | hpp | lesson13_1_pass_0.66.hpp | #include "../basic_io.hpp"
using namespace std;
const int MAX_N = 100005;
bool F[MAX_N];
int Next[MAX_N];
int dp[MAX_N]; // dp[i] 表示到达 i 位置需要的最小跳数, -1为不可达
int solution(vector<int>& A) {
// 筛出Fibonacci数
int M_1 = 0, M_2 = 1;
F[M_1] = true;
F[M_2] = true;
int M = M_1 + M_2;
while(M < MAX_N) {
... |
bb8586396ad0ce9ca9a0cbb06afd09c1e56ef4bc | 2c8c9841bbd2917cbd0f89c51edbb4400f1430e4 | /BearGame/base/Singleton.h | 071333d68571a55b1f6c7cc86c85146b12296da7 | [] | no_license | IBM9100/BearGame | 1df62db066c3e5f812f261a71cc201e07ac769d6 | 41370e8dc63e6f5479ae4931057ec45e7fce255d | refs/heads/master | 2022-12-14T05:33:12.212964 | 2020-09-05T05:53:52 | 2020-09-05T05:53:52 | 291,615,600 | 0 | 0 | null | 2020-09-03T13:13:48 | 2020-08-31T04:37:40 | C | UTF-8 | C++ | false | false | 336 | h | Singleton.h | #ifndef BEARGAME_BASE_SINGLETON_H
#define BEARGAME_BASE_SINGLETON_H
#include "base/Noncopyable.h"
namespace BearGame {
template <typename T>
class Singleton : private Noncopyable {
public:
static T& instance() {
static T t;
return t;
}
protected:
Singleton() {}
virtual ~Singleton() {... |
def5570f3a761c2c3721a51c9e9718cbe69bda85 | 955f980319f2d8696c8c624ec0a509fa67f31478 | /c++/hw2/here.cpp | 7405f42ced3a0ec9ab4079f3f95058405c352b42 | [] | no_license | wagnod/itmo | 58db961b719afe253b1895ad1955ffafba673100 | 7d36990b7c0de20d9875ef7c7fe885d5a4c8e650 | refs/heads/master | 2022-03-10T13:25:06.219769 | 2022-02-03T10:57:07 | 2022-02-03T10:57:07 | 226,410,253 | 0 | 0 | null | 2022-02-03T09:42:35 | 2019-12-06T21:03:06 | Jupyter Notebook | UTF-8 | C++ | false | false | 105 | cpp | here.cpp | #include <iostream>
#include "mylib.h"
void here() {
std::cout << "I'm here!" << "\n";
return;
} |
29c37d0a27e7238aef36fb402115ad07640cbafa | 281f783c9ee4f0f7fffff1a419c8a94c71dab494 | /Object.cpp | 0c44477803fea43f6790256d929cd87f05625b42 | [] | no_license | 15117294633/DTLib | b1d5b6ad839f16ff6dd892e70f2c845f21320da4 | 781e76c8a815694037a426d236e078a7816faf7a | refs/heads/master | 2020-03-11T22:37:10.282872 | 2019-01-07T03:12:00 | 2019-01-07T03:12:00 | 130,297,083 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 615 | cpp | Object.cpp | #include"Object.h"
#include <cstdlib>
namespace DTLib
{
void* Object::operator new(unsigned int size) throw()
{
return malloc(size);
}
void Object::operator delete(void *p)
{
free(p);
}
void* Object::operator new[] (unsigned int size)throw()
{
return malloc(size);... |
19f73406dc586856d0c2c410afedcedd72785924 | 0a8b76c12b2f483f125e84e6609039a7d5af6c79 | /JokeLib/JokeLib.h | ead80e5e2b4a3ebf881c131530d334ca5d29bd6c | [] | no_license | leithergit/JokeDSE | d00f90c23e9f520fda348edf50fd58f33c0bfc4e | 663044f4b144e44e017c522d493da20f6b6d125e | refs/heads/master | 2023-04-01T16:04:23.155800 | 2021-04-08T07:11:50 | 2021-04-08T07:11:50 | 149,065,864 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 516 | h | JokeLib.h | // defined with this macro as being exported.
#ifdef JOKELIB_EXPORTS
#define JOKELIB_API __declspec(dllexport)
#else
#define JOKELIB_API __declspec(dllimport)
#endif
// This class is exported from the Win32Lib.dll
class JOKELIB_API CWin32Lib {
public:
CWin32Lib(void);
// TODO: add your methods here.
};
... |
10fa4d0351d3ce671b1f1ceb523b86fa3f4c6ad8 | 6ed4073a453fa04ea9670ba2162f294f5208acf7 | /old codes/tmp.cpp | 69abb2469459943fa32a36e01803507888faae1b | [
"MIT"
] | permissive | ikaushikpal/C-practice | b13355dcc03094ba0ed41867d98bc2d68a63bfd0 | abab8a186eaf38b434811755833a32306cd47d64 | refs/heads/master | 2023-04-09T10:15:45.329569 | 2021-04-20T03:39:57 | 2021-04-20T03:39:57 | 276,837,694 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 483 | cpp | tmp.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--)
{
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)
a[i]=i+1;
int l;
l=a[n-1];
a[n-1]=... |
d5c3b001f962cddf7f36db32016b451bd1ee3eff | 3e06494229b1c6f5c68ffd7161b71e476be72e38 | /test.cpp | 1e6dfa0267e6c454f61d787350520abac254865d | [] | no_license | mariogeiger/AStar | 726751e7ac855fb596df3214e767fb02a77fea4b | a20d9ce2fce49067b7ff10e9c73db474364a873e | refs/heads/master | 2021-05-26T15:29:51.301021 | 2012-03-07T21:00:04 | 2012-03-07T21:00:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 773 | cpp | test.cpp | #include "qastar.h"
#include <QDebug>
#include <QPoint>
class MyAStar : public QAStar<QPoint>
{
public:
int heuristicCostEstimate(QPoint start, QPoint goal)
{
return (start - goal).manhattanLength();
}
int distanceBetween(QPoint, QPoint)
{
return 1;
}
QList<QPoint> neighbo... |
10db45741564847aa542c5f2a60367e1ac6128bc | cab166cc7b9f0d570e551b032599ffacc986eef7 | /common/frontendscommon/include/external/VpnFrontendService.hpp | e15045fa5fd0d4998fc442d2a69eb728ecc3b359 | [] | no_license | michael370662/C-to-Swift | 2a74a2cba528a9c8351407d6a0127554ce63d400 | ce1d2527929d85b8b962c8e8ac0a11dc156a30c5 | refs/heads/master | 2020-06-04T03:36:39.025980 | 2019-06-14T01:55:25 | 2019-06-14T01:55:25 | 191,858,367 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,627 | hpp | VpnFrontendService.hpp | #ifndef __PonyTech_Frontend_VpnFrontendService_hpp__
#define __PonyTech_Frontend_VpnFrontendService_hpp__
#include "../PonyTech-Frontend_DEP.hpp"
BEGIN_NAMESPACE(Frontend)
class VpnSettingsProvider;
class ConnectionSystem;
class SocketSystem;
class ConnectHeartbeatManager;
class SocketMessageForwarder;
class VpnFro... |
2fc072468217501f664078f9ee9b2b99a6a32653 | 56ce115d0742822b88b341ba9f15575adebc1b50 | /build/ui_mainwindow.h | fcc13306bb35f3e839e238e18f62583d93619161 | [] | no_license | AlexsCode/NewsRSS | 836d5c5534eb8441765bf4bc733fa87c00572d8a | 21b064dbc6cf5ea1cc154c289f47c9e30af13297 | refs/heads/main | 2023-02-03T15:16:52.261110 | 2020-11-26T09:43:44 | 2020-11-26T09:43:44 | 314,542,637 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,714 | h | ui_mainwindow.h | /********************************************************************************
** Form generated from reading UI file 'mainwindow.ui'
**
** Created by: Qt User Interface Compiler version 5.11.3
**
** WARNING! All changes made in this file will be lost when recompiling UI file!
***************************************... |
ba55bc84c3f2d9733b7d124c396658ddd1d84481 | 505970b41594c4ef10972c15eb2c491fb07ce196 | /Caudalimetro.hpp | 5a816ff5592750e5ae6962ad407535c29aab5b45 | [] | no_license | ULL-InformaticaIndustrial-Empotrados/TFG_Beneharo_agua | 8aa8892cdfe634fc785111dd67171a2e22a231f1 | 767cfd1a1b103aa53f69a5b93b1309a507248082 | refs/heads/master | 2022-12-11T18:16:35.192348 | 2020-09-08T16:11:54 | 2020-09-08T16:11:54 | 177,574,150 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 836 | hpp | Caudalimetro.hpp |
#ifndef _CAUDALIMETRO_
#define _CAUDALIMETRO_
#include "BBB_GPIO_pin.hpp"
#include "BBB_GPIO_Interrupts.hpp"
#include <thread>
//A la clase Caudalimetro el string(P8_36) se le pase como parámetro al constructor.
class Caudalimetro {
protected:
unsigned _nPulsos = 0; //Inicializada a 0 (apartir de c++11... |
0d55d1f817f90c596dcad51f179ecac75420db6e | 45c6e5e140019ea417b06fe5c082ad309eaab0ce | /DlgHeightCalib.h | f8273d2be8f8fa0b75a23eb69f011edef25ff85c | [] | no_license | isliulin/fadvs | 532220b54d17eab90717a8cd92b280417e65eeeb | 5729519bcd0651eb85b34fcbda61c50f1d70ddc4 | refs/heads/master | 2022-10-16T04:32:17.502976 | 2020-06-15T09:55:21 | 2020-06-15T09:55:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 951 | h | DlgHeightCalib.h | #pragma once
// CDlgHeightCalib dialog
class CDlgHeightCalib : public CDialog
{
DECLARE_DYNAMIC(CDlgHeightCalib)
public:
CDlgHeightCalib(CWnd* pParent = NULL); // standard constructor
virtual ~CDlgHeightCalib();
// Dialog Data
enum { IDD = IDD_DLG_HEIGHT_CALIB };
protected:
virtual void DoDataExchange(CDat... |
4fe395fde36a34e1fe5327ee5e2f536358d1aeab | 590c5838440cac897007f8dfb1d5f68bc35928c3 | /Exercicios/Lista 1 - Exercícios de Estruturas Sequenciais/exercicio17.cpp | 632cac8bc010e510ef4aae80b635bd6ea341383a | [] | no_license | luizsilvadev/algoritimos | 3f8360814246805887cd5c28c4520d2acb884483 | 9ea895482a719cc4ca3278b5da0b3d5a0c15cef6 | refs/heads/master | 2022-11-21T10:10:46.323109 | 2020-07-26T01:10:49 | 2020-07-26T01:10:49 | 282,448,527 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 188 | cpp | exercicio17.cpp | #include <iostream>
using namespace std;
int main()
{
string n;
int n1,n2,n3;
cin>>n;
n1 =n[0]-48;
n2 = n[1]-48;
n3 = n[2]-48;
cout<<n1*n2*n3;
return 0;
}
|
1cf3cad7e57cc99565198c90b61b780de52f6fdf | 5fb1eceef8adf85899ce2b5aa9f4d9c2d4a49d6d | /C++/Hackerrank/PrepKit/ArrayManipulation.cpp | 9bb85db20589c43775ea3f03b2d0a569f6b14f01 | [] | no_license | alexz429/CompetitiveProgramming | e52346186aad9cf76b9b1b35b00527175a5f0f9a | 474475d053c93b2038b52e58299caadbfc4fa379 | refs/heads/master | 2022-01-19T20:18:52.373649 | 2022-01-03T23:34:00 | 2022-01-03T23:34:00 | 184,585,704 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 363 | cpp | ArrayManipulation.cpp | long arrayManipulation(int n, vector<vector<int>> queries) {
vector<long> psa(n);
for(vector<int> next:queries){
psa[next[0]-1]+=next[2];
if(next[1]!=n){
psa[next[1]]-=next[2];
}
}
long best=0;
long tally=0;
for(int next:psa){
tally+=next;
best... |
feb15e5f985bbd512af5fd5ea95e271454a02ff2 | 98157b3124db71ca0ffe4e77060f25503aa7617f | /hackerrank/world-codesprint-6/hard-drive-disks.cpp | 6696d4ceeef5bf72a7f95a2276fa2584e535fd37 | [] | no_license | wiwitrifai/competitive-programming | c4130004cd32ae857a7a1e8d670484e236073741 | f4b0044182f1d9280841c01e7eca4ad882875bca | refs/heads/master | 2022-10-24T05:31:46.176752 | 2022-09-02T07:08:05 | 2022-09-02T07:08:35 | 59,357,984 | 37 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 2,496 | cpp | hard-drive-disks.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const long long inf = 1e17;
long long dp[N];
pair<int, int> hd[N];
long long ad[N], ac[N], ae[N];
int main() {
int n, k;
scanf("%d %d", &n, &k);
k--;
vector< long long > p;
long long ans = 0;
for (int i = 0; i < n; i++) {
int a, b;... |
ff0d37d73cd0f0c842d54c0ab0c6492b0be4e878 | 9f6a48d7d3c1801d31c29319924ea4f77abce505 | /templates/gui/include/SignalHandler.hh | 19699faf172bd1e9fcd4b53f910aca0eee8e3ae0 | [] | no_license | zach-hartwig/ROOTUtilities | dcbfd1b519e69f85a8a75955e989d45b339dc31d | cd4f10651597226cf1a3fab9053d35f076b82e38 | refs/heads/master | 2021-01-13T02:19:53.146735 | 2017-01-26T03:44:24 | 2017-01-26T03:44:24 | 21,510,297 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 716 | hh | SignalHandler.hh | // name: SignalHandler.hh
// date: 25 Jul 14
// auth: Zach Hartwig
// mail: hartwig@psfc.mit.edu
//
// desc: The SignalHandler class contains the "slot" methods that are
// triggered by "signals" generated by widgets in the
// InterfaceBuilder class. It provides a modular way to handle
// widget actio... |
b1305c8523c6049b981bf1dad0197e91beaf254d | 297dc0627a4c1433938aff227c6cfc64f4f66444 | /char_conversion/ctoi.cpp | 99276027751b3a6008c22b8767cdc6e829336caf | [
"MIT"
] | permissive | alxkohh/cplusplus-code-snippets | 82d9daf5f59ac7f9f6bdcdabbf3113828ca9a2ec | 7328afbb12c68b479da9fbd0882aa0a3b2ed8f35 | refs/heads/master | 2023-03-01T18:02:06.661236 | 2021-02-07T16:09:51 | 2021-02-07T16:09:51 | 276,539,841 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 463 | cpp | ctoi.cpp | /*
A function to convert char to int. Eg. '7' -> 7
Although there is stoi, we also often require a ctoi.
Obviously, those are single digit cases. '6', '2' etc.
If more than 2 digits or with negative sign, we use stoi.
*/
#include <bits/stdc++.h>
using namespace std;
int ctoi(char c) {
int i = c - '0'; // AS... |
7ec32f057455f7a1034577dbb8fc96aaa7171a52 | ded10c52a4602174205b3ad5609319c7691fd9bf | /NguyenKhachuy_51_bai4.cpp | dbd5ef362fcdb1c19cf2619eacf0f2232042c527 | [] | no_license | Khachuy911/c-language | 6faf4eda6b3ff7be6a64185be7473dd9e695f437 | ede335608e2a4f5eeb0ec260a0852cb75a5f29d6 | refs/heads/master | 2023-08-14T21:23:05.507297 | 2021-09-17T10:17:44 | 2021-09-17T10:17:44 | 407,494,110 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 204 | cpp | NguyenKhachuy_51_bai4.cpp | #include<stdio.h>
int main(){
int x;
printf("Nhap x: ");
scanf("%d",&x);
if( 0<x && x<=12){
printf("Thang %d",x);
}else printf("con so nay khang phai la 1 thang trong nam");
return 0 ;
}
|
7fc6a62d02a2739a7cb938c53e263c4950c61551 | fa1377bd22dc9f00b24e3fc2e106ea8cf3fd74e8 | /src/core/core.cpp | 95fe23deaa689e6317d5e5345baf255e19b1f9b6 | [
"MIT"
] | permissive | juruen/cavalieri | 17848168678d0ab68e321dd242679c2fafa50c4b | c3451579193fc8f081b6228ae295b463a0fd23bd | refs/heads/master | 2020-04-02T16:49:47.492783 | 2015-09-08T19:07:43 | 2015-09-08T19:11:55 | 13,036,407 | 54 | 11 | null | 2014-10-05T18:59:53 | 2013-09-23T13:24:46 | C++ | UTF-8 | C++ | false | false | 64 | cpp | core.cpp | #include <core/core.h>
std::shared_ptr<core_interface> g_core;
|
6e53b894a8312b53e9eadbd2522e12ee3f561a91 | 6cf43021bf234f48a245724ecede839a3c3b28eb | /Hypercube2Logical.h | 525c5abe654c52fde73c7eb6af9f76091bda6178 | [] | no_license | kmrodgers/GraphTheoryProgram | 4cb3067831906cec05c897745cd9049cb5466e4c | 55086d36d906725bc13e5b8c65c573f72b7b0cc6 | refs/heads/master | 2021-01-18T14:22:38.151502 | 2014-08-11T20:37:46 | 2014-08-11T20:37:46 | 21,622,671 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 801 | h | Hypercube2Logical.h | //Hypercube2Logical.h
#ifndef GUARD_Hypercube2Logical_h
#define GUARD_Hypercube2Logical_h
#include <list>
#include <vector>
#include <string>
//#include <boolean>
class Node;
class Hypercube2Logical {
public:
Hypercube2Logical(int, int, bool, int);
virtual ~Hypercube2Logical();
void createInitialEdges();
void c... |
8eabfc491ec2ef57d84a1e6786464f578189d667 | 4362646d31922b43907fbea0bba1ba283622eeb5 | /Robotics/lab1-22.cpp | d6f2b68434adf7cfbda35fdf4ce416e75a9fdded | [] | no_license | mitkonikolov/oldLnxMachine | 3f57d165a424f790a49d8500bc7b63ac98a72c75 | a4e4d7d7a32b0b492c0d3e3822857071fd580b0c | refs/heads/master | 2020-03-18T04:09:57.351236 | 2018-05-21T13:38:43 | 2018-05-21T13:38:43 | 134,273,163 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,717 | cpp | lab1-22.cpp | #include <iostream>
using namespace std;
double* p;
int count;
int size;
void Initialize() {
p = new double[2];
count = 0;
size = 2;
}
void Finalize() {
delete[] p;
}
void PrintVector(){
if (count == 0)
{
cout << "\nThe array is empty\n\n";
cin.ignore(1000... |
79dbe199f674db2c8a23f34b8ce0258f3bddc550 | 241cf71bfcb05f20cde09dbbd8edc71374a46542 | /Game/Object/Object.hpp | 653e112a8dee2f528f2a68ceeeade2440bf6a73d | [] | no_license | alorfa/JustGame | 32f1bf7c44a7da340bb70399b94bace72b1ac7af | e3269fba2eb54f9155ada9f495496cfd5ee45dd7 | refs/heads/main | 2023-03-17T07:18:41.201791 | 2021-03-20T14:52:21 | 2021-03-20T14:52:21 | 342,811,652 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 391 | hpp | Object.hpp | #pragma once
#include "SOOGL/Graphics/Transform/Transformable2D.hpp"
#include "SOOGL/Graphics/Shader/Shader.hpp"
#include "SOOGL/Graphics/Transform/Camera2D.hpp"
#include "Color.hpp"
namespace gd
{
class Object : public sgl::Transformable2D
{
const Color* color;
public:
Object() = default;
virtual ~Object() ... |
69a231f47a30a3591253c9237c4455b9ebcd9894 | 6ffd23679939f59f0a09c9507a126ba056b239d7 | /lite/test/test_tensor_c.cpp | fec9500e544fae3657fd6d05897cd513538782e0 | [
"LicenseRef-scancode-generic-cla",
"Apache-2.0"
] | permissive | MegEngine/MegEngine | 74c1c9b6022c858962caf7f27e6f65220739999f | 66b79160d35b2710c00befede0c3fd729109e474 | refs/heads/master | 2023-08-23T20:01:32.476848 | 2023-08-01T07:12:01 | 2023-08-11T06:04:12 | 248,175,118 | 5,697 | 585 | Apache-2.0 | 2023-07-19T05:11:07 | 2020-03-18T08:21:58 | C++ | UTF-8 | C++ | false | false | 12,111 | cpp | test_tensor_c.cpp | #include "lite_build_config.h"
#if LITE_BUILD_WITH_MGE
#include "../src/misc.h"
#include "lite-c/global_c.h"
#include "lite-c/tensor_c.h"
#include <gtest/gtest.h>
#include <memory>
#include <thread>
TEST(TestCapiTensor, Basic) {
LiteTensor c_tensor0, c_tensor1;
LiteTensorDesc description = default_desc;
... |
398e71758bd017e8e819616aa707998795b1905a | 7de42d95b5904480e6e46be40ae72707077668ae | /task1_set/Source.cpp | bdc06dfb3db115d0c8fda50a9c708d9d335d4d4d | [] | no_license | kzGarifullin/cpp-projects | e09828f4ff9086ff2f49c58494b56a43faab57bf | a214898e8a707e0a44acb30d642cdc4231d655e0 | refs/heads/master | 2023-06-06T20:07:19.037960 | 2021-07-03T09:52:33 | 2021-07-03T09:52:33 | 339,001,074 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 1,627 | cpp | Source.cpp | #include <iostream>
#include <set>
#include<vector>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <functional>
#include<iostream>
#include<chrono>
#include<vector>
#include<algorithm>
#include <array>
class Timer
{
public:
using clock_t = std::chrono::steady_clock;
using time_point_t = clock_... |
3da27af9fc5147a7c8edbce8840132660e802073 | 75a83ddc648a1a4a13fa3f86b93296802a11e8f5 | /Classes/basic/ImageFadeOut.cpp | 652a1a8da6a3e785a4e3e934b66bf46067dd82a8 | [] | no_license | abc20899/Learn2dxDemo | 313bb0d85a6a3f7d17d00bd93d5b1c22093f3b66 | 4b6a0ca981e16c753cc5385e3f7875590e5b1a5f | refs/heads/master | 2020-04-12T02:10:50.444506 | 2019-01-02T12:44:34 | 2019-01-02T12:44:34 | 162,240,714 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,953 | cpp | ImageFadeOut.cpp | //
// ImageFadeOut.cpp
// Particle
//
// Created by JasonWu on 12/20/14.
//
//
#include "ImageFadeOut.h"
ImageFadeOut::ImageFadeOut() : _pointA(0), _pointB(0) {
}
ImageFadeOut::~ImageFadeOut() {
}
ImageFadeOut *ImageFadeOut::create(std::string image) {
auto imageFadeOut = new ImageFadeOut();
if (imageF... |
a43cac2e6306f67d86f48e92eb97e35fc29d3340 | f31eefa2d05c0c40f38aa2fcabdb407fd01dafca | /Simu/PerceptionField.cpp | 68f65f1c9179cc09193ce40f6220aa4f1a0f1a6b | [] | no_license | jpinilloslr/simu | 57c9ab90371e72fe8e7a18434198b11d8cdbab42 | d39a88c09613d932c6d59827277a7192e62d6b6c | refs/heads/master | 2021-04-27T00:08:32.705446 | 2013-02-16T04:14:22 | 2013-02-16T04:14:22 | 120,400,511 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 452 | cpp | PerceptionField.cpp | #include "PerceptionField.h"
PerceptionField::PerceptionField()
{
perceptions = 0;
}
PerceptionField::~PerceptionField()
{
}
void PerceptionField::addPerception(Perceptible *perc)
{
if(perceptions < MAX_PERCEPTIONS)
{
memcpy(&perceptionField[perceptions], perc, sizeof(Perceptible));
perceptions++;
}
else
... |
70ce1c08ee2d6c7a9730be199e8fd265a9043196 | 79be97302e0d1195aaa01f52e5fa1da540ea112f | /core/lib/include/memoria/core/types.hpp | f603b25e7b74a7d66fe237a19dd7006df765a3eb | [
"Apache-2.0"
] | permissive | victor-smirnov/memoria | 8df7430c89b83ff9c93706dcf6100b3830c5f83a | fd203b5b081849c1a1db2d7f26b75bfd1d760a18 | refs/heads/master | 2023-05-12T20:52:19.828284 | 2023-05-01T00:02:46 | 2023-05-01T00:02:46 | 245,055,297 | 11 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 8,712 | hpp | types.hpp |
// Copyright 2011-2022 Victor Smirnov
//
// 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 agre... |
af53d088ba25642666e711ef0d5ae984b7b26df9 | 497907b5503ef005abaf1342646068665a7c1015 | /mp_stories/Graph2.hpp | cac9143d43b1be3c6e788a71e001e5a6255d7e51 | [] | no_license | emroller/CS225-Data-Structures | cc96b9762d45248d6f32c6288beb0e2847c17cf2 | db48befb2d35a25bd37802651d3a4088ddac0176 | refs/heads/master | 2023-07-19T17:10:08.639693 | 2019-12-11T04:23:25 | 2019-12-11T04:23:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,293 | hpp | Graph2.hpp | #include <queue>
#include <algorithm>
#include <string>
#include <list>
#include <map>
using std::string;
using std::vector;
using std::list;
using std::pair;
using std::map;
/**
* Returns an std::list of vertex keys that creates any shortest path between `start` and `end`.
*
* This list MUST include the key of the... |
9f1b17425897d8527802040e8f6afb583c552cc6 | e65a4dbfbfb0e54e59787ba7741efee12f7687f3 | /games/openxcom/files/patch-src_Savegame_CraftWeapon.cpp | daec78acb073790ce6d4bcf97c54c1b56baf27fa | [
"BSD-2-Clause"
] | permissive | freebsd/freebsd-ports | 86f2e89d43913412c4f6b2be3e255bc0945eac12 | 605a2983f245ac63f5420e023e7dce56898ad801 | refs/heads/main | 2023-08-30T21:46:28.720924 | 2023-08-30T19:33:44 | 2023-08-30T19:33:44 | 1,803,961 | 916 | 918 | NOASSERTION | 2023-09-08T04:06:26 | 2011-05-26T11:15:35 | null | UTF-8 | C++ | false | false | 376 | cpp | patch-src_Savegame_CraftWeapon.cpp | --- src/Savegame/CraftWeapon.cpp.orig 2014-06-13 19:14:43 UTC
+++ src/Savegame/CraftWeapon.cpp
@@ -16,6 +16,7 @@
* You should have received a copy of the GNU General Public License
* along with OpenXcom. If not, see <http://www.gnu.org/licenses/>.
*/
+#include <cmath>
#include "CraftWeapon.h"
#include "../Rule... |
3353b9955eebd4d7d433b44f5b3d63398cedff30 | 1f797b7f7b7160f0571a1f72ab8593c931c6753b | /Lecture-10/BinaryTreeCamera.cpp | a15d3f7dc325ac427429110d94132021df328266 | [] | no_license | Kartik-Mathur/CareerBootcampOffline24March2020 | 36b8586d58746528706c899d505d351ce1f700e0 | dc0ef18d43b046aefb30329a53031f64cc25dd82 | refs/heads/master | 2021-04-20T17:07:59.307395 | 2020-09-03T17:32:13 | 2020-09-03T17:32:13 | 249,703,524 | 8 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 640 | cpp | BinaryTreeCamera.cpp | // BinaryTreeCamera https://leetcode.com/problems/binary-tree-cameras/
#include <iostream>
using namespace std;
unordered_map<TreeNode*,bool> h;
int camera;
void PlaceCamera(TreeNode* root,TreeNode* parent){
// base case
if(root == NULL) return;
PlaceCamera(root->left,root);
PlaceCamera(root->right,root);
if(p... |
d272d80c7cce7c38dc3c0bd27f8be9044538a670 | 9f05d15a3f6d98711416d42e1ac3b385d9caa03a | /sem3/da/labs/2/btree.cpp | f4f0ea5185a7c37cd9ae81323f14ded16a249282 | [] | no_license | dtbinh/MAI | abbad3bef790ea231a1dc36233851a080ea53225 | a5c0b7ce0be0f5b5a1d5f193e228c685977a2f93 | refs/heads/master | 2020-06-16T06:45:58.595779 | 2016-08-21T15:37:10 | 2016-08-21T15:37:10 | 75,237,279 | 1 | 0 | null | 2016-11-30T23:45:58 | 2016-11-30T23:45:58 | null | UTF-8 | C++ | false | false | 8,891 | cpp | btree.cpp | #include "btree.h"
TBTree::TBTree(size_t t)
{
mT = t < 2 ? 2 : t;
mRoot = mCreateNode();
}
TBTree::~TBTree()
{
mDeleteTree(mRoot);
}
void TBTree::Insert(const TData& data)
{
TNode* root = mRoot;
if (root->n == mT * 2 - 1)
{
TNode* rootNew = mCreateNode();
mRoot = rootNew;
rootNew->leaf = false;
rootN... |
ac85cea181112fd85e088e4d601a4647b2cf633c | 79f449ec9e81b170b994d7fa86e3deb0834022b9 | /src/weak_ptrs.h | fde8dbbaf22dbdb537b0fe991ffa10b93a3f4322 | [
"MIT"
] | permissive | whunmr/circa | b5bfacd336024a4120be46b52b849ff5a76e93ec | f3667f2af8b46728c1475990ecdf5cf1b3dd1ee2 | refs/heads/master | 2020-04-08T02:08:24.311295 | 2013-03-01T04:37:19 | 2013-03-07T18:09:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 316 | h | weak_ptrs.h | // Copyright (c) Andrew Fischer. See LICENSE file for license terms.
#pragma once
#include <cstddef>
namespace circa {
typedef size_t WeakPtr;
WeakPtr weak_ptr_create(void* address);
void* get_weak_ptr(WeakPtr ptr);
void weak_ptr_set_null(WeakPtr ptr);
bool is_weak_ptr_null(WeakPtr ptr);
} // namespace circa
|
7401087d46464659280513f5bccf8e6d8bdc6882 | 4ae3405a082f030bcf573ebf04edb4308a49ab34 | /src/CpuBoolean.h | 930276b9636887039f524f6e3e7e11b4861ed02b | [] | no_license | mplamann/NESEmulator | b662f99bc541fadcc3f95436b4acdce1702c68fe | 88a45bed0dc2acc9b2f1245f16633c628a2196cf | refs/heads/master | 2021-01-10T22:06:28.830341 | 2013-03-11T12:57:18 | 2013-03-11T12:57:18 | 4,393,778 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 430 | h | CpuBoolean.h | #pragma once
#include "CpuRegisters.h"
#include "Util.h"
class CpuBoolean : public CpuRegisters
{
private:
typedef CpuRegisters super;
protected:
int ASL(int value);
int LSR(int value);
int ROL(int value);
int ROR(int value);
void BIT(int value);
void SLO(int value);
void RLA(int value)... |
dc102f7bed69aee987bf8e62fe351da8d2f0aa39 | 99fe750ffd06ae7b33d13d69bf625a9c36169df3 | /volume004/445 - Marvelous Mazes.cpp | e2e2cf218a89199913cbacff834464a5489f208c | [] | no_license | ahmrf/UVa | 5edb2edbc912f837a9884584ab42b73c573a3385 | 6b815d4df74f52e30b01d345b1e41cdd34b0f7da | refs/heads/master | 2021-01-21T01:49:33.721538 | 2016-04-06T16:20:51 | 2016-04-06T16:20:51 | 34,123,479 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,069 | cpp | 445 - Marvelous Mazes.cpp | #include<cstdio>
#include<vector>
#include<iostream>
using namespace std;
struct content{
char ch;
int count;
};
int main (void)
{
char c;
vector<content>maze;
vector<char>hehe;
while(scanf("%c", &c) != EOF)
{
hehe.push_back(c);
}
int sum = 0;
... |
df7270dcfa3ac7324e915e80ae6a35df9bf31d43 | a4de7672f460babe084d08afe08a6453a9d4c64a | /removeElements.cpp | 05d220edc6c8b66fe82e4159b71cd5253f6355f9 | [] | no_license | sulemanrai/leetcode | 3db0dd328ceb44bb43e15b00231c69b1aa437898 | 72ecdee5c6b7326eea90ddac6bb73959fce13020 | refs/heads/master | 2020-03-16T17:29:04.025572 | 2018-09-07T05:43:32 | 2018-09-07T05:43:32 | 132,834,334 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,233 | cpp | removeElements.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
int Size(ListNode * head)
{
int i = 0;
while(head != NULL)
{
i++;
head = head->n... |
139db20e098afdf73072522f50faf2daca13137f | 8fc183b422f4d4d595f4c2d193f7ca3c7b5e6c55 | /src/test/proposer/proposer_tests.cpp | 7ec5b33036278a580ec7402e0b56878a0cdcb7cc | [
"MIT"
] | permissive | cornelius/unit-e | cd36edc7b5f16c22623d4dbbad555e8075d06099 | 71b1e4c4afa77270b5f16b495926d791c4933265 | refs/heads/master | 2020-05-15T03:16:07.240302 | 2019-05-06T08:10:04 | 2019-05-06T08:10:04 | 182,065,278 | 0 | 0 | null | 2019-04-18T10:12:56 | 2019-04-18T10:12:56 | null | UTF-8 | C++ | false | false | 7,391 | cpp | proposer_tests.cpp | // Copyright (c) 2018-2019 The Unit-e developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <proposer/proposer.h>
#include <blockchain/blockchain_behavior.h>
#include <proposer/block_builder.h>
#include <proposer/... |
0857a3f1da20367f1d0b7c82ad78b48c690273c7 | fd402718be3b6ad87b48b1a83cd57da32f763fb0 | /SP1Framework/Player.cpp | d2bb18d7bca1e1d4e1d62e41a622e368d4dba656 | [] | no_license | Ang-Zhi-Wei/SP1Framework | ff6dc5c80f9bd48e7178b76d43f06e00571f39ef | bc945ab9ac301ad2e25acb49c2b6e8574d7fb468 | refs/heads/master | 2023-07-12T01:49:00.364201 | 2021-08-18T06:55:03 | 2021-08-18T06:55:03 | 286,451,000 | 0 | 0 | null | 2020-08-10T11:01:07 | 2020-08-10T11:01:06 | null | UTF-8 | C++ | false | false | 246 | cpp | Player.cpp | #include "Player.h"
player::player(SGameChar* playerptr)
{
this->playerptr = playerptr;
direction = 'U';
}
player::~player()
{
}
char player::GetDirection()
{
return direction;
}
void player::SetDirection(char dirc)
{
direction = dirc;
}
|
05aa0d8e346aa7dcddcffa9856f8f68f68c25707 | e698fbf6f557cfd57133830af8329439725466cc | /src/Move.cpp | 31f915c1fcd8f5fef67f91ed286e106b5d2ba093 | [] | no_license | zetaemme/dreamchess-plusplus | 0fdf08ec5c24cb19b7fbd912e39b110f6bb8b839 | bddc2fda15bf7bb2a1de70bbbf8caa6bf76fc52f | refs/heads/master | 2023-08-20T01:29:14.350882 | 2021-10-28T13:45:02 | 2021-10-28T13:45:02 | 377,817,978 | 0 | 0 | null | 2021-09-29T09:13:23 | 2021-06-17T12:10:09 | C++ | UTF-8 | C++ | false | false | 1,739 | cpp | Move.cpp | /**
* @copyright Dreamchess++
* @author Mattia Zorzan
* @version v1.0
* @date July-October, 2021
* @file
*/
#include "Move.hpp"
#include "Board.hpp"
/**
* @namespace dreamchess
* @brief The only namespace used to contain the DreamChess++ logic
* @details Used to avoid the std namespace pollution
*/
namespa... |
713b8c5ed274c233ae3127c2ebe30afc017c1650 | 048fa3ddafe5e0b8a7aa084bbe726a13f5f37e65 | /dfs/경로찾기/solution.cpp | 4362ca973d6920a48742c781bf5131855783dae4 | [] | no_license | seongjinkime/problem-solving | 7f1cbd05e99cfb74a6b86d4b473dd52431330480 | 918e0b0329485b789cbd6ea99b6b475fc2717c0d | refs/heads/master | 2020-09-07T10:57:39.333195 | 2020-01-05T07:09:54 | 2020-01-05T07:09:54 | 220,757,074 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,274 | cpp | solution.cpp | //
// main.cpp
// 11403_findRoute
//
// Created by Kim Seong Jin on 2019. 10. 21..
// Copyright © 2019년 Kim Seong Jin. All rights reserved.
//
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> adj;
vector<vector<int>>links;
vector<int> visited;
void dfs(int node, int here){
link... |
f29d2f92217dc6b741f001dab218e4e77a1c251c | 2e36dff1e3230ae28483868cda171fbeb4ab1460 | /spoj solutions/allizwel.cpp | 731d214ce7910b462af1e03b1d9693fd0b1d2d9f | [] | no_license | rishabhjain9191/Coding | e53f189d69b05a861b3d659ea9eb3f65e6c07511 | 702222855df001c6b68efe5ea68c97523a7f75e6 | refs/heads/master | 2020-05-18T20:06:14.756020 | 2016-11-10T19:01:44 | 2016-11-10T19:01:44 | 35,320,555 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,835 | cpp | allizwel.cpp | #include <iostream>
#include <vector>
#define MAX 102
using namespace std;
int r, c;
bool blocked[MAX][MAX];
char STR[]={'A','L','L','I','Z','Z','W','E','L','L','\0'};
char Grid[MAX][MAX];
bool P(vector<pair<int, int> > pos, int found);
int main(){
int T;
char input;
vector<pair<int, int> > aPos;
cin>>T;
for(int ... |
b0b06cada2d9bd14e7aeaa1a58ae49c5ef7300c2 | 6edd115495964d580257cad76172ba3b7048bf2e | /tablemaker/tablemaker-2.1.1/src/hits.cpp | 2b703f197af40362c5a2332570bd6c95d82c3cd8 | [
"BSL-1.0"
] | permissive | jtleek/ballgown | 3073e55c064f7ff4b84cf1bd9d0e28858d863401 | b524c109236df7230269d2f7630aa7c7037d2d9a | refs/heads/master | 2021-01-16T20:49:17.407889 | 2014-03-27T15:06:18 | 2014-03-27T15:06:18 | 12,441,219 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 29,237 | cpp | hits.cpp | /*
* hits.cpp
* Cufflinks
*
* Created by Cole Trapnell on 3/23/09.
* Copyright 2009 Cole Trapnell. All rights reserved.
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
#include "common.h"
#in... |
22efad2c19336059fe4c7d0c80dd7e640210ca96 | 4597bd5999d2105db64e96786618d1fd6b74bd7d | /libtest.cc | 6da73feabc4a127312e14797d42c6ab262913e13 | [] | no_license | clalancette/shared_boston_winters | e9adc87e325395dc52f75e437ece6ff54081fbd3 | 6dbdd4852412a3311288aa6258da1e683b1c3e72 | refs/heads/master | 2023-04-11T16:24:14.050468 | 2018-04-04T16:22:37 | 2018-04-04T16:22:37 | 128,088,957 | 1 | 1 | null | 2018-04-08T04:06:08 | 2018-04-04T16:20:25 | C++ | UTF-8 | C++ | false | false | 172 | cc | libtest.cc | #include <iostream>
class Test {
public:
Test() { std::cerr << "In Test()..." << std::endl; }
~Test() { std::cerr << "In ~Test()..." << std::endl; }
};
Test mytest;
|
33312c70254d3fb8a9a7e072b03468e17628e39a | 543ecf788968e3b5276e1ab0a4294c6929160b25 | /src/classwork/01_assign/main.cpp | 01a9fbdcd77680b94ea5fbd18a60f1616f4a340b | [
"MIT"
] | permissive | acc-cosc-1337-fall-2020/acc-cosc-1337-fall-2020-jadencrowacc | dd76c8dc0eb896c77af90d950ae6ac63dcce0cec | 00695d8db3afac77878972511e1a17d76937b6dc | refs/heads/master | 2023-01-13T21:31:20.974251 | 2020-11-22T08:42:14 | 2020-11-22T08:42:14 | 290,393,028 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 438 | cpp | main.cpp | //Write the include statement for types.h here
#include <types.h>
//Write include for capturing input from keyboard and displaying output to screen
#include <iostream>
int main()
{
int num;
std::cout << "type number: ";
std::cin >> num;
int result = multiply_numbers(num);
std::cout << "result: " ... |
a6bcd42afff73d2884f7a82393524849e534cdf8 | c66dd358c99b9f3e6bb39cf434588195ec678205 | /Source/Components/StyledComponent.cpp | edc0699f3996317e0e15f18e44d46eb706576028 | [] | no_license | neil-stoker/scumbler | 7ba8172194950b4a25afc5ea7861117fa9225dda | ee455237430f30365ec35487a6e313b73c8cd8be | refs/heads/master | 2021-05-27T12:39:48.101793 | 2015-01-04T15:13:07 | 2015-01-04T15:13:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 871 | cpp | StyledComponent.cpp | // Copyright (c) 2014 Brett g Porter
#include "StyledComponent.h"
StyledComponent::StyledComponent(UiStyle* style, const String& name)
: Component(name)
, fStyle(style)
{
fStyle->addChangeListener(this);
}
StyledComponent::~StyledComponent()
{
fStyle->removeChangeListener(this);
}
void StyledComponent::ch... |
7da88bea6a273c6d4a54b025f2277e180bb77dc7 | 00c81f6569e404528dc44a98fd9f60b6eea4c089 | /examples/HinjBackSoon/HinjBackSoon.ino | b6a84b16002e6f4e77590804a2b51483bcfe9d88 | [] | no_license | AloriumTechnology/XLR8HinjEtherCard | 99f886cf036e746d6481f84cc3d4afecf53aa83e | c992fee9259d27bdf3f9ffadcba216daf157bb61 | refs/heads/master | 2020-03-19T03:30:34.792816 | 2018-06-01T15:34:23 | 2018-06-01T15:34:23 | 135,734,735 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,741 | ino | HinjBackSoon.ino | // Present a "Will be back soon web page", as stand-in webserver.
// 2011-01-30 <jc@wippler.nl> http://opensource.org/licenses/mit-license.php
// 2018-02-08 Bryan Craker of Alorium Technology (info@aloriumtech.com)
#include <XLR8HinjEtherCard.h>
#define STATIC 0 // set to 1 to disable DHCP (adjust myip/gwip values ... |
893d4c6e9b4ee22ae6ffdea366902e786bbae1c3 | ac610d807abbb5df761803bf97da987ad4605e3b | /src/rules.cpp | f4442afd4f07534f7e8282278b49c5402db8b838 | [
"BSD-2-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | dnnr/herbstluftwm | 4f2e20a1a79619333f3addf4454a5057ee15c015 | 3bed77ed53c11d0f07d591feb0ef29bb4e741b51 | refs/heads/winterbreeze | 2023-03-17T00:43:16.220514 | 2019-04-22T09:12:48 | 2019-04-22T09:12:48 | 56,521,901 | 1 | 0 | NOASSERTION | 2020-05-03T14:37:42 | 2016-04-18T15:59:59 | C++ | UTF-8 | C++ | false | false | 10,498 | cpp | rules.cpp | #include "rules.h"
#include <X11/X.h>
#include <X11/Xlib.h>
#include <algorithm>
#include <cstdio>
#include "client.h"
#include "ewmh.h"
#include "globals.h"
#include "hook.h"
#include "root.h"
#include "utils.h"
#include "xconnection.h"
using std::string;
/// GLOBALS ///
const std::map<string, Condition::Matcher>... |
e8a4f0761a5266f0350113b5d01cc2aea120beb4 | d4d356ae6a7391b95f820108e4d3b0fef05506d2 | /silicium/asio/block_thread.hpp | 0c3c42f241799c22a34db25d5257a3020e41ce54 | [
"MIT"
] | permissive | TyRoXx/silicium | 27729b01e76a8947d68b569841bf8f1923a21793 | 3a19b81f05ff487df4f314f204f1d10e4d272fee | refs/heads/master | 2021-01-23T08:39:44.336205 | 2017-03-03T23:54:33 | 2017-03-03T23:54:33 | 20,037,983 | 4 | 1 | MIT | 2018-11-26T09:17:34 | 2014-05-21T21:26:14 | C++ | UTF-8 | C++ | false | false | 2,348 | hpp | block_thread.hpp | #ifndef SILICIUM_BLOCK_THREAD_HPP
#define SILICIUM_BLOCK_THREAD_HPP
#include <silicium/config.hpp>
#define SILICIUM_HAS_BLOCK_THREAD (BOOST_VERSION >= 105400)
#if SILICIUM_HAS_BLOCK_THREAD
#include <boost/asio/async_result.hpp>
#include <future>
namespace Si
{
namespace asio
{
struct block_thread_t
... |
09e5fd40e3486d117697f7696711fab43de9fc14 | f79c5096132c7837b1778c12a9e6b87c09b3067b | /include/Position.h | 7e48704bbf786d7aefc048ec888e2fd94fe580ae | [] | no_license | xRockmetalx26/cpp_sfml_template | 58b3ff14b2d3c3a345f84ffdbcf16d6123ee838e | 6007f2332803e4f50babe0f81a990a1a51d471c3 | refs/heads/main | 2023-07-15T12:38:45.570908 | 2021-08-27T00:47:18 | 2021-08-27T00:47:18 | 397,041,539 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 297 | h | Position.h | //
// Created by xRockmetalx
//
#ifndef POSITION_H
#define POSITION_H
class Position {
public:
explicit Position(int x = 0, int y = 0);
void set_x(int x);
void set_y(int y);
int get_x() const;
int get_y() const;
protected:
int x;
int y;
};
#endif // POSITION_H
|
363613c2d1494ea577ff2c58e38c303b59693eb2 | 3f06e22f1fd642b485fee57d71b1b7e74246463a | /libs/PWM_control/PWM_control.cpp | fc7559858e55a78720292edc4c8aaac44f42e56d | [] | no_license | francocamila/PI2_Projeto_Gaia | e3adcc8da84a461c78f73921d2fd08897a5de067 | 14774612cb602f4371c2517318d5fa66cd63ef86 | refs/heads/master | 2020-05-30T18:22:42.905716 | 2019-07-01T23:35:20 | 2019-07-01T23:35:20 | 189,896,311 | 0 | 1 | null | 2019-06-27T15:53:02 | 2019-06-02T21:20:20 | C++ | UTF-8 | C++ | false | false | 2,136 | cpp | PWM_control.cpp | #include <Arduino.h>
#include <PWM_control.h>
#define PWM_right_pin 13
#define PWM_left_pin 14
#define inversion_right_pin 15
#define inversion_left_pin 12
PWM_control::PWM_control(void)
{
pinMode(PWM_right_pin,OUTPUT);
pinMode(PWM_left_pin,OUTPUT); //initiates all used pins as output
pinMode(inversion_rig... |
42a001e0d2feddf53fd4c0dccdef8de37894bbe2 | a309cc6fcec9a03f107136d8ebbebbaa9ba15fae | /path_tracing/point.cpp | 15aaa2f4b9bbebc69e7fef48426e1d7f8f40ecbb | [] | no_license | tink-expo/cs580-graphics-20spring | a0846daca94c1ddbd46f0a76a247cbbeb0b72185 | 0675da5d6ab8f7207bcadf57bc2f8870378fa45e | refs/heads/master | 2022-11-04T21:47:02.414056 | 2020-07-06T07:37:02 | 2020-07-06T07:37:02 | 257,074,725 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 562 | cpp | point.cpp | #include "point.h"
Point::Point(float x, float y, float z)
//constructor
{
X = x;
Y = y;
Z = z;
}
Point::Point(const Point& p)
//initialisation from another point
{
X = p.X;
Y = p.Y;
Z = p.Z;
}
Point& Point::operator=(const Point& p)
//assignment
{
if(this == &p) return *this;
X = p.X;
Y = p.Y;
Z = p.... |
23a558a46ebf9b657fcbee101cae32e7982c9668 | 4821303e3a041f391feb85b5b59e255f30e14a85 | /UVA/11713_abstract_names.cpp | d2822fc6a55e9cd36e0c538471246b7533777a90 | [] | no_license | StanleyDing/OnlineJudge | 613729f8c2b692af99b797c75c41d17a05a79670 | b9e8efe98550e6153d2d454841329f2bf0dc34b4 | refs/heads/master | 2016-09-09T21:00:03.806659 | 2013-10-04T10:11:42 | 2013-10-04T10:11:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 884 | cpp | 11713_abstract_names.cpp | #include <iostream>
#include <string>
using namespace std;
void compare(const string&, const string&);
int isVowel(const char);
int main()
{
int n;//a
string s1, s2;
while(cin >> n){
while(n--){
cin >> s1 >> s2;
if(s1.length() != s2.length()){
cout << "No" <... |
e90a63055e0407d0dc9a31840e4faf72c2936135 | b8e9f2c49c89039b1a002b46996e76f7cb68a663 | /C Programs/C Programs - 1/Climbing Stairs.cpp | 4df0b4d833e7531efbf43e4137632da032913970 | [] | no_license | MathProgrammer/LeetCode | 8d52756a2f84913d73b2f888a0d9735262065499 | 746ef89eed72660edd38526e8733b8c405860995 | refs/heads/master | 2023-07-20T01:03:28.480036 | 2023-07-09T04:21:26 | 2023-07-09T04:21:26 | 98,414,648 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 439 | cpp | Climbing Stairs.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int climbStairs(int n) {
vector <int> no_of_ways_to_climb(n + 1, 0);
no_of_ways_to_climb[1] = 1;
no_of_ways_to_climb[2] = 2;
for(int i = 3; i <= n; i++){
no_of_ways_to_climb[i] = no_... |
8e4f51930a41ea06e936c03dee7d998647e3015c | def9bf08f569bf802eae6e728f010ea346041796 | /include/Kigen/utils/Logger.hpp | ed06691742995d2f8eb8089bbfa389b5ba4a82f6 | [
"MIT"
] | permissive | MrFiskerton/Kigen | 0ce4587637e35569c01f05435a2f567d9823fb21 | fa39b651e098c827279531c2b78252cadedab77e | refs/heads/master | 2022-12-23T15:27:10.494296 | 2020-06-16T09:55:23 | 2020-06-16T09:55:23 | 140,623,485 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,157 | hpp | Logger.hpp | //
// Created by Roman Fiskov (roman.fiskov@gmail.com) [Mr.Fiskerton] on 13.07.18.
//
#ifndef INCLUDED_LOGGER_HPP
#define INCLUDED_LOGGER_HPP
#include "Kigen/defines.hpp"
#include <iostream>
#include <fstream>
#include <iomanip>
#include <utility>
#include "NonCopyable.hpp"
namespace LogColour {
#ifdef LOG_COLOR_SU... |
4750fa324d8c3e82ee6780a2a075f923d7e91208 | 4cc998877a0df5e766554af806f94a79419a0178 | /second largest.cpp | bd2ece2fcd8d1d8211d239ed64f8a641398cb3e7 | [] | no_license | greeshma0601/Arrays | 521ecb189b0c0ce0b4fcb1244d62a02386620c54 | 6b69562519663bc07706410d8e4c4c73cbe606b5 | refs/heads/master | 2020-04-13T20:43:18.904015 | 2019-06-25T05:32:55 | 2019-06-25T05:32:55 | 163,437,158 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 536 | cpp | second largest.cpp | #include<cstdlib>
#include<limits>
#include<bits/stdc++.h>
using namespace std;
int main() {
//code
int i,t,k,n,j;
cin>>t;
while(t--){
cin>>n;
int a[n];
int f,s;
for(k=0;k<n;k++)
cin>>a[k];
if(n<2)
{
cout<<a[0];
}
else{
f=s=INT_MIN;
for(i=0;i<n;i++)
{
if(a[i]... |
607c0d080144f7d4e136b239bd46a787ba34f049 | 6c013d5d70b692e6b5250f3ab8405e1a1ef32055 | /UIWidgets/GeneralInformationWidgetR2D.h | 895c09ed348769e56ce3e88621ca66ccd33cc109 | [
"BSD-3-Clause",
"BSD-2-Clause"
] | permissive | NHERI-SimCenter/R2DTool | a667afb17a5ac6df07966ee5b98cf1975dfe6ddf | b3fa98e018bdf71caccd97277d81307ac051a1c1 | refs/heads/master | 2023-08-19T07:48:07.775861 | 2023-07-28T15:16:17 | 2023-07-28T15:16:17 | 329,111,097 | 5 | 18 | NOASSERTION | 2023-09-14T21:52:20 | 2021-01-12T21:00:33 | C++ | UTF-8 | C++ | false | false | 3,853 | h | GeneralInformationWidgetR2D.h | #ifndef GENERAL_INFORMATION_WIDGET_R2D_H
#define GENERAL_INFORMATION_WIDGET_R2D_H
/* *****************************************************************************
Copyright (c) 2016-2021, The Regents of the University of California (Regents).
All rights reserved.
Redistribution and use in source and binary forms, wit... |
0894c5cd27a8f9dd96d8ac531e48886923f83150 | d4ec0332b56f60c72755a0824a01992c162c8951 | /Parser/Parser/parser_containers.h | eb1d60a76b6b8988e287ef2345880d2f3dbe5b12 | [] | no_license | sanchaez/lab-translator | 6f0fa838f4e0fa5511f8f36ae7b49018909a0389 | 5d6cc3e5bfab9b8fef60486388bcf5e5d91f4eac | refs/heads/master | 2021-01-22T21:58:42.163167 | 2017-06-11T14:05:10 | 2017-06-11T19:04:15 | 85,495,187 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,666 | h | parser_containers.h | #pragma once
#include <algorithm>
#include <iostream>
#include <memory>
#include <ostream>
#include <stack>
#include <string>
#include <vector>
#include "lexer_data.h"
namespace translator {
enum class ParserTokenType {
Empty,
SignalProgram,
Program,
Block,
VariableDeclarations,
DeclarationsList,
Declara... |
e65586eaac32cdc3103083aa70a416be81f7e6d3 | 6b28ee0c54a77d82793b54179e4d64315bc2e812 | /main.cpp | 296f055624f1981f7aeca59f5b8067b16999e8d6 | [] | no_license | LaMinato/LodeRunner1 | 87cf7c5ad7b4da32b432ba3f755a78838ae1ff0e | 4e9fe75570b33fda908e32946cb2943be9b0e5cd | refs/heads/master | 2021-01-12T06:02:52.009992 | 2016-12-24T14:31:00 | 2016-12-24T14:31:00 | 77,284,257 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 13,530 | cpp | main.cpp | #include <SFML/Graphics.hpp>
#include "map.h"
#include "view.h"
#include <iostream>
#include <sstream>
#include "menu.h"
#include <vector>
#include <list>
using namespace sf;
////////////////////////////////////Общий класс родитель//////////////////////////
class Entity {
public:
float dx, dy, x, y, sp... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.