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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
74b6324595a6e72224c5fde1842e6b2328fa6018 | d7efe64923c327d873999b0b0d1012d3ecac89da | /Pipes/neighGraphPipe.cpp | ed5db85c664b2b76c7313aa96912e956b0f8abc3 | [
"MIT"
] | permissive | wilseypa/lhf | cc67c7388d924d7f18fed76f98f8f9e1a84c019c | aa5b6ae27b2516e9be7b977ff52343f19a6be4e6 | refs/heads/master | 2023-08-18T11:50:18.423764 | 2023-08-16T13:43:49 | 2023-08-16T13:43:49 | 127,002,935 | 4 | 15 | MIT | 2023-08-16T13:43:51 | 2018-03-27T14:54:01 | C++ | UTF-8 | C++ | false | false | 2,668 | cpp | neighGraphPipe.cpp | /*
* neighGraphPipe hpp + cpp extend the basePipe class for building the
* neighborhood graph from data input in the complex structure configured
*
*/
#include <string>
#include <iostream>
#include <fstream>
#include <iterator>
#include <vector>
#include <chrono>
#include <functional>
#include "neighGraphPipe.hp... |
cb0ff107aff95f279a5bb990ccb68e2741f4ce82 | eb2f8b3271e8ef9c9b092fcaeff3ff8307f7af86 | /Grade 10-12/2018 autumn/NOIP/NOIP2018提高组Day2程序包/answers/GD-0259/game/game.cpp | e049e36d29180fe594927e9179a78c3bbfb6e640 | [] | no_license | Orion545/OI-Record | 0071ecde8f766c6db1f67b9c2adf07d98fd4634f | fa7d3a36c4a184fde889123d0a66d896232ef14c | refs/heads/master | 2022-01-13T19:39:22.590840 | 2019-05-26T07:50:17 | 2019-05-26T07:50:17 | 188,645,194 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 720 | cpp | game.cpp | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
int main()
{
freopen("game.in","r",stdin);
freopen("game.out","w",stdout);
int n,m;
srand(time(NULL));
scanf("%d%d",&n,&m);
if (n==1&&m==1) cout<<2<<endl; else
if (n==1&&m==2) cout<<4<<endl; else
if... |
0f8ba7ece91ae458ec0aa940f844d2eb915fef42 | 0770dc9fe901f39511deaabb55d5df6df94c0a4d | /GameClient/Inc/State/PlayScene.h | 55addab405a0197830ca8de2569aca620122fa91 | [
"MIT"
] | permissive | victor-timoshin/Co-opShooter | 9513f0381b7ab9b37e12ea8beb160b59158239a9 | 6f78c5d8d6bbbf42ebe84db1e0c31bbbd79180b5 | refs/heads/master | 2021-03-12T20:11:17.392362 | 2016-01-09T20:44:42 | 2016-01-09T20:44:42 | 37,907,006 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,274 | h | PlayScene.h | #ifndef PLAYSCENE_H
#define PLAYSCENE_H
#include "../Player.h"
#include "../GameObject.h"
#include "../GameWorld.h"
#include "../StdAfx.h"
class PlayScene : public Scene::ISceneStateBase
{
public:
static PlayScene* GetInstancePtr(void);
virtual void Enter(Core::Render::IRenderSystemBase* renderSystem, Scene::ISce... |
8d5236e7db569c6177e7552fa12ede4977a570ff | 00bf95e973d20ebd4620b17638257a3839afe2bc | /linked-list/linkedlist.h | d6ad380b51409002d236e094000414d311f38dd0 | [] | no_license | Ryan0621/data-structure | a88f1919c49ecb0d0e7b992e4af01b5b5e331df5 | 2a125eb71cd58fd5a21deed3401ffedf78dd796e | refs/heads/master | 2020-11-27T15:15:47.113525 | 2019-12-22T23:15:34 | 2019-12-22T23:15:34 | 229,507,118 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,536 | h | linkedlist.h | #ifndef _LINKED_LIST
#define _LINKED_LIST
#include "BagInterface.h"
#include "Node.h"
#include <vector>
using namespace std;
template < class ItemType>
class LinkedList : public BagInterface<ItemType> {
private :
Node<ItemType>* headPtr;
int itemCount;
Node<ItemType>* getPointerTo( const It... |
7439d5c1bb0c2ca81a34cb11178528b9e8a35bce | 5f628e78502f72564cad0032d747a28664a6ed6d | /src/core/testing/interfaces_test/v0/auto_populate_v0.hpp | ebe8dbf2d3489715aba7c4b3860627bd2d71046f | [] | no_license | danAllmann/wgtf | ee735e8ed05aef7b63250a6e0d2734daafd79e89 | 1288f488acc46b1505e1b1966d4be4641d0ead94 | refs/heads/master | 2021-06-01T07:09:08.856847 | 2016-06-03T06:59:35 | 2016-06-03T06:59:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 485 | hpp | auto_populate_v0.hpp | #ifndef V0_AUTO_POPULATE_V0_HPP
#define V0_AUTO_POPULATE_V0_HPP
#include "core_dependency_system/i_interface.hpp"
namespace wgt
{
DECLARE_INTERFACE_BEGIN( AutoPopulate, 0, 0 )
typedef INTERFACE_VERSION( TestInterface, 0, 1 ) InterfaceA;
typedef INTERFACE_VERSION( TestInterface, 0, 0 ) InterfaceB;
virtual Interfac... |
34834b291859d26363abce5dfc1cade8c8996779 | 451c5ed3258fe768273e0e906e0c837fe07d64f1 | /Source/QzGraphDemo/Demos/ComboDemo.cpp | 1a43069684645227068783a4ae8eb69cd8bf6569 | [] | no_license | bdmihai/qzgraph | 0e223acd2fd43ef39fecc84b0c1b2831927aca99 | 4d92198d24ce7dcfb4c129add665e7edc35f0e6c | refs/heads/master | 2016-09-16T02:11:15.093270 | 2012-05-20T17:58:37 | 2012-05-20T17:58:37 | 32,224,338 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 228 | cpp | ComboDemo.cpp | #include "Stable.h"
#include "ComboDemo.h"
ComboDemo::ComboDemo() : DemoBase("General/Combo Demo", "A demo that combines bar charts with line graphs, curve filling, text items, etc.")
{
}
ComboDemo::~ComboDemo()
{
}
|
2e892ac750503a0184dadb7cee93d9dd494401ab | 3fd377a081a3a77b6b565df8eee38e70e740d9d1 | /aulib/rpgen/rand_rp.h | ea984d5ab4c4c532b7fa1c724de0b4d763262d01 | [] | no_license | nh2oh/au | 5181e1f4c852fbd3ed6816f90e8b65116dc0d5bb | fe37faff945f78396c2cfdf7150c350200364987 | refs/heads/master | 2021-06-17T16:16:04.090670 | 2019-08-18T13:50:10 | 2019-08-18T13:50:10 | 142,479,438 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,731 | h | rand_rp.h | #pragma once
#include "..\types\nv_t.h"
#include "..\types\ts_t.h"
#include "..\types\beat_bar_t.h"
#include "..\types\rp_t.h"
#include <vector>
#include <chrono>
struct randrp_input {
ts_t ts {};
std::vector<d_t> nvset {};
std::vector<double> pd {};
int nnts {0};
bar_t nbars {0};
std::chrono::seconds maxt {3}; ... |
af66df11371314c9a6f8a3835127bbfb5cfe887a | 55e6980609fbd9780877e189ae363b0a4946fa35 | /akApps/dailySketch4_13_17/src/ofApp.cpp | d1b7e7c703863fc2d614e9f8d3e37cda7b9de27f | [] | no_license | echoechochamber/ofSketches | 2cf67cc1c7955443de55ae97f27496c3a8f8c606 | 6b4dddd394da59d8692835d1a8170a46fc3f9d6f | refs/heads/master | 2021-04-15T10:03:57.852059 | 2017-08-17T18:01:27 | 2017-08-17T18:01:27 | 94,575,071 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,357 | cpp | ofApp.cpp | #include "ofApp.h"
using namespace ofxCv;
//--------------------------------------------------------------
void ofApp::setup(){
ofSetVerticalSync(true);
vid.initGrabber(width, height);
tracker.setup();
}
//--------------------------------------------------------------
void ofApp::update(){
vid.... |
9aa382f02a8b7ed617e921ec566a28208d9705a3 | 0b8c13c58803c2f65fc06c3882bde711674d869f | /helpers/golHelpers.h | 4a5779827accb4ccfa32e926d548a4d06d9bfe02 | [] | no_license | DenisTDR/PA-GameOfLife | 5359d60c69704abc05eb6e23e254a01e33613fce | 0088ad8f2240bd66f9bbd095b249ab6b8fe563b5 | refs/heads/master | 2020-12-22T02:06:28.878745 | 2020-02-11T06:06:06 | 2020-02-11T06:06:06 | 236,637,904 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 340 | h | golHelpers.h | //
// Created by nm on 28.01.2020.
//
#ifndef PA_GOLHELPERS_H
#define PA_GOLHELPERS_H
#include <vector>
using namespace std;
void addPadding(vector<vector<bool>> &vv, int up, int right, int bottom, int left);
void updateCell(bool **in, bool **out, int i, int j);
int countAliveCells(bool **w, int n, int m);
#endi... |
659cd76b89d4cc034598088209ae56b671ea406d | c1e1b96e34eae3e4499877785730f37062d57a7a | /utc-0.1/include/Conduit.h | df23c575b953bfdba4f1cfe71f2407e71c88e95e | [] | no_license | Lazybird-Chao/UTC | 8d3cc6b1e07ff26c3d525042fa4db2e8a44a76a9 | 2380b6de445fd54607397fd7d3e63f3bb2b0faf5 | refs/heads/master | 2021-03-27T10:15:47.591041 | 2017-10-04T21:10:59 | 2017-10-04T21:10:59 | 42,334,435 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,493 | h | Conduit.h | #ifndef UTC_CONDUIT_H_
#define UTC_CONDUIT_H_
#include "TaskBase.h"
#include "ConduitBase.h"
//#define ENABLE_OPBY_FINISH
#define DISABLE_OPBY_FINISH
namespace iUtc{
enum class ConduitType{
unknown =0,
c2c //cputask to cputask
};
enum class ConduitOpType{
unknown =0,
read,
write,
rea... |
2b4b57bbda2d0efa2d5270e5e2aa98471450b50d | 3c283cd167fb7b06ffafb40b4be7f644c48380dc | /include/graphics/window/BaseWindow.h | c5b8fc3502cdcf9efacd41f644a427821262d602 | [
"Apache-2.0"
] | permissive | arnozhang/strawframework | 40f47efb1b33cfb221e671c0f04ea84b2f99b9f1 | 630a9a543cc819d966f888211717423eed9a8497 | refs/heads/master | 2023-08-05T10:20:09.301655 | 2023-04-05T08:49:04 | 2023-04-05T08:49:04 | 70,670,573 | 17 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,384 | h | BaseWindow.h | /*
* Copyright (C) 2016. The Straw Framework Project.
*
* @author Arno Zhang
* @date 2016/03/18
*/
#pragma once
#include "base/ptr/RefPtrObject.h"
#include "graphics/view/Element.h"
#ifdef STRAW_BUILD_FOR_WIN32
#include <Windows.h>
#endif // STRAW_BUILD_FOR_WIN32
namespace sf {
enum SizeableType {
... |
1ae672076d1835dbef9e69f5150352cd1f181e5f | a68efe9a519480623f1ac57218137a68986e9768 | /ising2D_cl.cpp | 87d53f0f6dac16305afdcc713f4f84c82de66e18 | [] | no_license | bloerg/clmuca | 833f419d182d310f1c78202174a0ff10bfc0c9de | 7481beb4ee282c14b0f28ea7028f4e710f43c7f3 | refs/heads/master | 2020-03-16T10:35:55.744768 | 2018-05-08T16:30:39 | 2018-05-08T16:30:39 | 132,636,123 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,890 | cpp | ising2D_cl.cpp | // OpenCL
#include <CL/cl.hpp>
// This includes my_uint64 type
#include "ising2D_io.hpp"
#include "muca.hpp"
#include <sys/time.h>
// Random Number Generator
#include "Random123/philox.h"
#include "Random123/examples/uniform.hpp"
// 256 threads per block ensures the possibility of full occupancy
// for all compute ... |
1692bfa8a808f5fc9c0355ad86440488fa5d25d2 | 95fa2a38d0558fae54c282a56cfc533fb733e8ff | /Exaustive Search & Backtracking/GenerateBinarySequence.cpp | d2da25cd6f380291d130e70812c4161a5445f211 | [] | no_license | Intekhab96/Programming_Fundamentals | cc517a2450aa9f49991a173880d2e05453afecaa | b059d775206e4aa6f71a2ae6f029e8ff7525af64 | refs/heads/master | 2023-07-03T14:09:05.873854 | 2021-08-14T20:21:44 | 2021-08-14T20:21:44 | 135,049,328 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 525 | cpp | GenerateBinarySequence.cpp | #include<bits/stdc++.h>
using namespace std ;
// Generates binary Sequence of n bits ( Prototype )
void GenerateBinarySequence( int n , string prefix = "" );
int main(){
// Test Cases
for(int i = 1 ; i <= 5 ; i++ )
{
GenerateBinarySequence(i);
cout << endl << endl ;
}
return 0 ;
}
void ... |
fee71778cb0dc260b356deb13e2e8790059920c4 | dec4ef167e1ce49062645cbf036be324ea677b5e | /SDK/PUBG_ABP_Weapon_M24_parameters.hpp | 89ab4f1c0288df2c71e5b670f55fa9262dba6997 | [] | no_license | qrluc/pubg-sdk-3.7.19.5 | 519746887fa2204f27f5c16354049a8527367bfb | 583559ee1fb428e8ba76398486c281099e92e011 | refs/heads/master | 2021-04-15T06:40:38.144620 | 2018-03-26T00:55:36 | 2018-03-26T00:55:36 | 126,754,368 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,719 | hpp | PUBG_ABP_Weapon_M24_parameters.hpp | #pragma once
// PlayerUnknown's Battlegrounds (3.5.7.7) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "PUBG_ABP_Weapon_M24_classes.hpp"
namespace PUBG
{
//---------------------------------------------------------------------------
//Parameters
//-------------------------------------------------------... |
1188629b8aa0525cec32feb97bcb0d372b4762c1 | fc63a4d1f745fc48ca43226a8e2a03d70945540a | /c++/src/Utils/Rect.cpp | 9d6d5c006e016e5c7c5b38549a5aaf66e375ffcd | [] | no_license | Aaron3154518/Sandbox-Game | 2f2d379ee65b4ab2f35faed19a784b2916c841a4 | 631a9d64cb25f2ed1d301a2160a08a375bd97b4e | refs/heads/main | 2023-08-15T08:53:59.272711 | 2021-10-09T02:47:59 | 2021-10-09T02:47:59 | 392,156,782 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,003 | cpp | Rect.cpp | #include "Rect.h"
//namespace utils {
// Rect
Rect::Rect() {
x = 0; y = 0;
w = 0; h = 0;
}
Rect::Rect(int x, int y, int w, int h) {
this->x = x;
this->y = y;
this->w = w;
this->h = h;
}
Rect::Rect(const SDL_Rect& other) : Rect(other.x, other.y, other.w, other.h) {}
Rect::~Rect() {}
Rect& Rect::operator=(const ... |
7b51f6265b2e70c4527206720755914256ffe2d5 | 2cf838b54b556987cfc49f42935f8aa7563ea1f4 | /aws-cpp-sdk-mediastore-data/include/aws/mediastore-data/MediaStoreDataClient.h | cfdc98f52ffb3af8d4009b9ddde66e46d344c74f | [
"MIT",
"Apache-2.0",
"JSON"
] | permissive | QPC-database/aws-sdk-cpp | d11e9f0ff6958c64e793c87a49f1e034813dac32 | 9f83105f7e07fe04380232981ab073c247d6fc85 | refs/heads/main | 2023-06-14T17:41:04.817304 | 2021-07-09T20:28:20 | 2021-07-09T20:28:20 | 384,714,703 | 1 | 0 | Apache-2.0 | 2021-07-10T14:16:41 | 2021-07-10T14:16:41 | null | UTF-8 | C++ | false | false | 14,796 | h | MediaStoreDataClient.h | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#pragma once
#include <aws/mediastore-data/MediaStoreData_EXPORTS.h>
#include <aws/mediastore-data/MediaStoreDataErrors.h>
#include <aws/core/client/AWSError.h>
#include <aws/core/client/ClientConfigu... |
886b262ed0aa4bd8370534d6a06c0f0e3d08afad | e07e3f41c9774c9684c4700a9772712bf6ac3533 | /app/Temp/StagingArea/Data/il2cppOutput/AssemblyU2DCSharp_GSNPicker2311934918.h | caa6d35c50e1190489e6eaad196873d79c08e65f | [] | no_license | gdesmarais-gsn/inprocess-mobile-skill-client | 0171a0d4aaed13dbbc9cca248aec646ec5020025 | 2499d8ab5149a306001995064852353c33208fc3 | refs/heads/master | 2020-12-03T09:22:52.530033 | 2017-06-27T22:08:38 | 2017-06-27T22:08:38 | 95,603,544 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,731 | h | AssemblyU2DCSharp_GSNPicker2311934918.h | #pragma once
#include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <stdint.h>
// System.String
struct String_t;
// TMPro.TMP_InputField/SelectionEvent
struct SelectionEvent_t3883897865;
#include "UnityEngine_UnityEngine_MonoBehaviour1158329972.h"
#ifdef __cla... |
bb2c2db1b3f05b6ec18d6de7bee4b7acc3a33cd1 | 590334eabc56115c000ac598160e170aa77c7c55 | /lista revisao/capicua.cpp | 57b5f2c74092a1880d0365e6b6601621bee38c57 | [] | no_license | arthur-es/aed1 | f72deabdee4b58c6cae1673f29714b9fc352f9e0 | 86df5401a3b53e292355d4b4fcb191566a5a48d0 | refs/heads/master | 2020-07-17T17:00:57.720424 | 2019-09-03T14:32:20 | 2019-09-03T14:32:20 | 206,059,438 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,073 | cpp | capicua.cpp | #include<iostream>
#include <vector>
using namespace std;
int capicua(int numero);
int fazedorDeNumeroQuebrado(int centena, int dezena, int unidade);
int main() {
int quantidade;
int leituras[1000];
cin >> quantidade;
for(int i = 0; i < quantidade; i++) {
cin >> leituras[i];
}
for(i... |
6f5d6b080c7c27a90d767cda6f68f074ae4548a8 | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/curl/gumtree/curl_repos_function_567_curl-7.14.0.cpp | f692110e6231b89b7fffef8743516761f903b32d | [] | 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 | 444 | cpp | curl_repos_function_567_curl-7.14.0.cpp | static CURLcode ftp_cwd_and_mkd(struct connectdata *conn, char *path)
{
CURLcode result;
result = ftp_cwd(conn, path);
if (result) {
if(conn->data->set.ftp_create_missing_dirs) {
result = ftp_mkd(conn, path);
if (result)
/* ftp_mkd() calls failf() itself */
return result;
re... |
d87e76266d26c6c5941018784eb755e16488619e | 4d7d584641666310db1cbf4c71e20e89b81be42f | /source/client_Conector.h | 9d0fd4ae7354fde1420c81e6cadad87845ab8181 | [] | no_license | lautaroerinaldi/alerta_desbordamiento_rios_c_plus_plus | 3e8a64280bf07146589e88a6e7f91ea113bdb059 | 7374438bd0ec92c99d8cf9353ff024c51474dc8e | refs/heads/master | 2020-04-02T15:44:27.582495 | 2018-11-03T11:14:00 | 2018-11-03T11:14:00 | 154,581,617 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,527 | h | client_Conector.h | /*
* Conector.h
*/
#ifndef CLIENT_CONECTOR_H_
#define CLIENT_CONECTOR_H_
#include <string>
#include <map>
#include "common_SocketComunicador.h"
#define OK 0
#define ERROR 1
/*
* Permite crear un objeto que dadas las muestras que va recibiendo, calcula y
* envia las modas al servidor mediantes una conexion util... |
c38edb6bc7a93f74d19531ce43ff00470473f768 | 43f2f0af217dcb13f9df6c864eb0624943f96c0a | /Temperatur_messen.ino | e3fa4c39701af7d1577451a6d68290a03d8a9f33 | [] | no_license | vinceyyyy/Arduino-Code | 12d2136a13bb8e3b2fd866b1d602e8728d80689f | 877a68c8f4dd960018ac38c1003fd2bf3c6dd638 | refs/heads/main | 2023-04-24T09:17:41.679836 | 2021-05-17T19:58:40 | 2021-05-17T19:58:40 | 368,283,277 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,070 | ino | Temperatur_messen.ino | //Einrichtung des Servos und DHT-Sensors
#include <Servo.h>
Servo myservo;
#include "DHT.h"
#include "Adafruit_Sensor.h"
#define DHTPIN 2
#define DHTTYPE DHT22
DHT dht(DHTPIN, DHTTYPE);
//Variable für map-Befehl unten
float servostellung;
//Variablen für RGB LED
int red_light_pin = 11;
int green_light_p... |
902c4e7531371c000f5db3f378f0ea4e99fb492a | d66f1dbacab9ee1617b5ce9c7ae2357e1c2b4169 | /prog2-template/parallel_sort.cpp | 58fd88ba00737daadba58bb60138dd922301c3d6 | [] | no_license | Yuzhuoran/MPI | 910493ffb80b5a5277fabb579bd9a289e5425b01 | ed9c8de79384cd719268433aa9739d3d269a907d | refs/heads/master | 2021-04-30T13:29:27.110355 | 2018-09-15T16:08:19 | 2018-09-15T16:08:19 | 121,295,888 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 593 | cpp | parallel_sort.cpp | /**
* @file parallel_sort.cpp
* @author Patrick Flick <patrick.flick@gmail.com>
* @brief Implements the parallel, distributed sorting function.
*
* Copyright (c) 2014 Georgia Institute of Technology. All Rights Reserved.
*/
#include "parallel_sort.h"
// implementation of your parallel sorting
void paralle... |
1ac917a85e864e4ea0295521e2156fd7eb1ddb03 | bd06b96be087a3a053bd0f7deba4d90a6f9adb74 | /Assignment - Backtracking , Binary Search And Merge Sort Problems/Sudoku_Solver.cpp | 7cd62c859065ffdc5d31cfd3c139458de04a616d | [] | no_license | Sahu-Ayush/Coding-Ninjas-Competitive-Programming | 49722a596b3ce822d8669386bc569a58b93a8c66 | c06a37a4fc23320f4a5943a400e57fafb2e48d47 | refs/heads/master | 2022-04-18T19:33:23.192924 | 2020-04-14T09:36:04 | 2020-04-14T09:36:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,599 | cpp | Sudoku_Solver.cpp | #include<iostream>
using namespace std;
int n=9;
bool find_empty_location(int **arr, int& row, int &col)
{
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
if(arr[i][j]==0)
{
row = i;
col = j;
return true;
}
}
}
return false;
}
bool vertical(int **arr, int row, int col, int value)
{
for... |
8e23b0ab77b11d99bde957c67d27ffed3d856064 | 7a0cf4e53c690f092c94f4c711919d70f0c03630 | /src/wmecore/TextureElement2D.h | a192d2f6ce548dc074e3cf8977fdf5d7860f03f0 | [
"MIT"
] | permissive | retrodump/wme | d4d6718eabd285bc59473c0911055d83e8a9052d | 54cf8905091736aef0a35fe6d3e05b818441f3c8 | refs/heads/master | 2021-09-21T02:19:06.317073 | 2012-07-08T16:09:56 | 2012-07-08T16:09:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 805 | h | TextureElement2D.h | // This file is part of Wintermute Engine
// For conditions of distribution and use, see copyright notice in license.txt
#ifndef __WmeTextureElement2D_H__
#define __WmeTextureElement2D_H__
#include "Element2D.h"
namespace Wme
{
class SpriteSubFrame;
class WmeDllExport TextureElement2D : public Ele... |
1f4d1df33fe95b4e1d6a0a6aec53e42d73234535 | 90222726ecafa3fe3897fae20740c69d82bbe812 | /assignment/average.cpp | 0ee08ccfe2a4843d219a4891673c2dbbc54718fb | [] | no_license | VenkateshBhatOP/PGJQP_Venkatesh-bhat | 0c17b3bc8b7bd6b349c7bc35dd718af16e408ab5 | aef231d06b35c5ccd7016646819f1d7ee18337a9 | refs/heads/main | 2023-03-31T19:10:19.738974 | 2021-04-02T10:56:11 | 2021-04-02T10:56:11 | 311,357,962 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 640 | cpp | average.cpp | #include<iostream>
using namespace std;
class Average
{
int num1,num2,num3,num4,num5,Average;
public :void avg()
{
cout<<"Enter the first number: \n";
cin>>num1;
cout<<"Enter the second number: \n";
cin>>num2;
cout<<"Enter the third number: \n";
ci... |
e921981f2f9775e408f6644b69d7865ac9855eca | 816d6fbc1379c91c72720cdda6e38ed0d52c2ad4 | /palindromePatition.cpp | 01dae5be2a6a36dcf638adad49145aceb5d70355 | [] | no_license | kanwangkerry/Leetcode | 61f22558f0c76903b490b26aee4d89814df2552a | 739532df41d1613b229ddfb6fe1af1bdb6dec6ef | refs/heads/master | 2021-01-19T11:15:54.816703 | 2013-11-07T04:22:18 | 2013-11-07T04:22:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,491 | cpp | palindromePatition.cpp |
class Solution {
public:
vector<vector<string>> partition(string s) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int len = s.size();
bool **isPa = new bool*[len];
for(int i = 0 ; i < len ; i++){
isPa[i] = new bool[len... |
a1814c50c9c89b52953a5111082d809107453834 | 9f7e92f2f4e99755694fba5ca055bdecaa417488 | /allocator/chunk.h | 5e741debe0a95e9353ed42d5f060793268155fb8 | [
"MIT"
] | permissive | volatilflerovium/MultiIndex | 46e62bb86e4556927c9f064581914514dd02bd48 | 1e49ae2e5bdfe2414160cfd67942fb01ac51599f | refs/heads/master | 2021-08-20T07:58:15.348625 | 2020-07-17T10:21:45 | 2020-07-17T10:21:45 | 213,941,726 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,510 | h | chunk.h | /*********************************************************************
* Allocator::Chunk structure *
* *
* Version: 1.0 *
* Date: 16-07-202 ... |
1d68f22e73e6b840f4602fc56a7befada97a71b5 | e5a761290c75ae48cf47442f3b87db190cd01f8f | /raytracer/raytracer/math/functions/easing-function.h | 51b1668a1107249378a6c9076df0f9d8303d711d | [] | no_license | thomasvangoidsenhoven/Raytracer-3D-Cplus | d5dd0950cec6cc9ffabf527732f506af2973704d | c7741ae3d02cd1cc5d35e97613252d580724d25a | refs/heads/master | 2020-04-29T19:47:10.530740 | 2019-01-09T10:09:59 | 2019-01-09T10:09:59 | 176,365,933 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 294 | h | easing-function.h | #pragma once
#include "math/function.h"
namespace math
{
namespace functions
{
/// <summary>
/// Define EasingFunction as a synonym for math::Function<double(double)>.
/// </summary>
typedef math::Function<double(double)> EasingFunction;
}
} |
d6a1dae8737fe0e3c2b1328f8c421d878923867b | 8526eb7f36529f51b22ce40ea25f2b6b306778eb | /158A next round.cpp | 19b8dc915436f929824ad620904c3e799eb5d17d | [] | no_license | Caprinos52B/Codeforces | 1710708c661a8643a75993f1efd92eae392871db | a56bc6d483651103133ce99b287923dcc0a0cf44 | refs/heads/master | 2020-06-26T16:29:01.347883 | 2019-07-30T16:08:06 | 2019-07-30T16:08:06 | 199,685,577 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 198 | cpp | 158A next round.cpp | #include<iostream>
using namespace std;
int main(){
int i,n,k,a[50],s=0;
cin>>n>>k;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++){
if(a[i]>=a[k-1]&&a[i]>0)
s++;
}
cout<<s;
return 0;
}
|
7fbc1ffdefa44f3162ba664a554fc97aaf458409 | fa3b89c5ead0d403f7db4be81f791a272f4fe62e | /alg/poj/archive/2000/5796896_AC_0MS_156K.cpp | 8c83691a160a21f6f7f92dd4373dbdc85383c104 | [] | no_license | ruleless/programming | aa32e916a5b3792ead2a6d48ab924d3554cd085f | c381d1ef7b1c7c0aff17603484e19a027593429b | refs/heads/master | 2022-11-14T02:07:47.443657 | 2022-11-03T23:47:32 | 2022-11-03T23:47:32 | 86,163,253 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 272 | cpp | 5796896_AC_0MS_156K.cpp | #include<iostream>
using namespace std;
int main()
{
int N,n,i,t;
while(scanf("%d",&N)!=EOF&&N)
{
for(n=1;N-n*(n+1)/2>n+1;n++);
t=0;
for(i=1;i<=n;i++)
t+=i*i;
for(i=1;i<=N-n*(n+1)/2;i++)
t+=(n+1);
printf("%d %d\n",N,t);
}
return 0;
} |
cf5c8f2fb925e2ceea5690e444d8ef16377bbeaf | c90097519f71cfe7ab5bf34b7ec0861748c68730 | /2017/F06.cpp | 4c2c0a682acc7bf95c45eb6d394912eac4b5d188 | [] | no_license | mattya-lab/PCKoshien | 7d24add440c008f3535df845d5bd7887b5353085 | 96a2fe8d171363490664ded04e70cafe1c84f951 | refs/heads/master | 2021-03-23T19:08:08.007544 | 2020-09-05T11:22:18 | 2020-09-05T11:22:18 | 247,477,284 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 553 | cpp | F06.cpp | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int w, h;
string s[1000];
set<string> st;
char c;
cin >> w >> h;
for(int i = 0; i < h; st.insert(s[i++]))
rep(j, w) cin >> c, s[i] += c;
sort(s, s+h);
bool ans = 1;
int cn... |
ad89168b83707ae6fd91bda1ac42fc41706cb0a0 | aae79375bee5bbcaff765fc319a799f843b75bac | /tco_2018/Resistance.cpp | d4ecfcafbcc7c313de93ff83f7d2209c654537ad | [] | no_license | firewood/topcoder | b50b6a709ea0f5d521c2c8870012940f7adc6b19 | 4ad02fc500bd63bc4b29750f97d4642eeab36079 | refs/heads/master | 2023-08-17T18:50:01.575463 | 2023-08-11T10:28:59 | 2023-08-11T10:28:59 | 1,628,606 | 21 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 5,095 | cpp | Resistance.cpp | // BEGIN CUT HERE
/*
TCO18 R1A Medium (500)
問題
-P人のプレーヤーがいる
-そのうちS人はスパイである
-P人のうち何人かが参加してミッションを行う
-スパイが参加するミッションは失敗する可能性がある
-N個のミッションについて、各人が参加したかどうかと、成功したかどうかの記録が与えられる
-ミッションの記録が正しい場合、各人がスパイである確率を求めよ
*/
// END CUT HERE
#include <algorithm>
#include <string>
#include <vector>
#include <iostream>
#include <sstream>
#i... |
c31f75f93e74cb070e7f4e9db88190fbbe8e21f8 | ff142cfb461d748846fab7a9779b6c2ab9fd29d0 | /src/chrono_vehicle/powertrain/SimpleCVTPowertrain.cpp | 17e0a4ff1605c85d7c4f6d10a03f0dc24d4d41c6 | [
"BSD-3-Clause"
] | permissive | cecilysunday/chrono | f739749153d40973c262c5b060b1a7af7c5ce127 | 903463bd5b71aaba052d3981eb6ca8bf3c3eab4f | refs/heads/develop | 2022-10-17T05:48:56.406791 | 2022-05-04T16:00:10 | 2022-05-04T16:00:10 | 154,656,858 | 3 | 0 | BSD-3-Clause | 2020-11-04T17:47:40 | 2018-10-25T11:07:38 | C++ | UTF-8 | C++ | false | false | 2,155 | cpp | SimpleCVTPowertrain.cpp | // =============================================================================
// PROJECT CHRONO - http://projectchrono.org
//
// Copyright (c) 2019 projectchrono.org
// All rights reserved.
//
// Use of this source code is governed by a BSD-style license that can be found
// in the LICENSE file at the top level of t... |
980aa32b697b478ae3c80f5ac54e6c5c24a7053f | 4fbb59d8073277598b92c96ea78ae0c3773e27c5 | /src/shamelaimportinfo.cpp | db95d8dc860d621b1d07635d567b3fb30cecc28a | [] | no_license | boussouira/moltaqa | 44e07205a2fb67a6a59d1623dc5cad741a6ad4c9 | b3f50d20d0a9aa1b515ce0e50f7a75f8dfaeb972 | refs/heads/master | 2023-01-09T20:00:22.332723 | 2014-03-18T09:52:49 | 2014-03-18T09:52:49 | 177,351,483 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 927 | cpp | shamelaimportinfo.cpp | #include "shamelaimportinfo.h"
#include "stringutils.h"
ShamelaBookInfo::ShamelaBookInfo(int bid, QString bname, QString bbetaka,
QString binfo, int barchive, int bcat,
int bauth, QString bauthName,
QString btafessirName... |
affd7eaf6e9da22ba8f5e93badab2a4f236bece3 | cf523952f733aa524a663fb69db545fac3222550 | /Process/OpenProcessDlg.h | 13367a55c277cb04e5204ef1efe9451138cec397 | [] | no_license | wangchlxt/FirstTest | 7dcbeca7105d386bb6cfe6171f47511c21cd8c4a | dc9fd990118f17e5cdf6af80b27445e0324758d3 | refs/heads/master | 2021-01-23T19:34:23.751253 | 2018-03-05T11:54:39 | 2018-03-05T11:54:39 | 102,826,470 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 559 | h | OpenProcessDlg.h | #pragma once
#include "afxwin.h"
// COpenProcessDlg 对话框
class COpenProcessDlg : public CDialogEx
{
DECLARE_DYNAMIC(COpenProcessDlg)
public:
COpenProcessDlg(CWnd* pParent = NULL); // 标准构造函数
virtual ~COpenProcessDlg();
// 对话框数据
#ifdef AFX_DESIGN_TIME
enum { IDD = IDD_DIALOG_OPEN_PROCESS };
#endif
protected:
... |
ea21437ac33ac8788cd2d8729879b86dfd84d662 | 0b820c7c63a965d2ca5ec39341ee561fde75dec8 | /IsometricRogueLike/WindowManager.h | b56cce7a183ef9fcb6008eef1b40500164c9da7d | [] | no_license | TheBearmachine/IsometricRogueLike | d8aeed791e9f88e64c2795e3352c15d82dc2e9f4 | 0bc7dd0dce38845c4f40da1c58156ea9f9564d5c | refs/heads/master | 2022-12-22T18:55:15.246572 | 2020-09-26T22:32:13 | 2020-09-26T22:32:13 | 112,231,522 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 642 | h | WindowManager.h | #pragma once
#include "Window.h"
#include "DrawThis.h"
#include "EventObserver.h"
#include <vector>
#include <stack>
class WindowManager : public IWindowListener, public EventObserver
{
public:
WindowManager();
~WindowManager();
void addWindow(Window* window);
void onWindowClose(Window* window);
bool observe(co... |
609c332f3bdb299be84be2c1c3d4c69c67bc2b0f | 2845bf27054eac02045051b0b33e2ee35a474527 | /13-roman-to-integer.cpp | abd627c05748edb0eda8eb3391d15ff431d2652f | [] | no_license | lizishen/leetcode | 69c62e6ee67f3e69469fb757e1a93c0152d8c971 | 00c7370707d4671ad8b6c2ded7b154f4dc9a6754 | refs/heads/master | 2020-12-25T22:28:49.432394 | 2015-10-13T02:53:19 | 2015-10-13T02:53:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 793 | cpp | 13-roman-to-integer.cpp | class Solution {
public:
int romanToInt(string s) {
int ans = 0;
string str = "";
for (int i = 0; i < s.size(); i++) {
int v = find(str + s[i]);
if (i + 1 < s.size()) {
int p = find(str + s[i] + s[i + 1]);
if (p != -1) {
... |
77ca2b46056ca715487e309e2dc662581df24ff7 | d74abbef9cac5dd4452a43b9f41b3e9ed13514bd | /CS 433 - Operating Systems/A3/SJF.h | e6381e70fc9241ff7fb185553fe2906e7f10336f | [] | no_license | alecguilin/CSUSM | b6efdab9049ef660bc77e2e4582fda093cc763c0 | ad0c6fad5c444d40e9f5c5c396bd1bac08a5a62c | refs/heads/master | 2023-07-24T19:41:10.967823 | 2021-09-04T19:16:12 | 2021-09-04T19:16:12 | 270,516,688 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,014 | h | SJF.h | #pragma once
#include <queue>
#include "event.h"
#include "process.h"
#include "simulation.h"
// overrides priority queues comparison logic
// comparsion based on next cpu burst
struct SJFCompare {
bool operator () (Process* p1, Process* p2) const {
return p1->priority > p2->priority;
}
};
// implementation of S... |
a5013a4595e3ddcbcc0c428b5f2bf8881cbad710 | 5c7414c94acbecea6441bdf72fc58b8578e448e4 | /assignments/05-classes/invoice_utility.cpp | dababf50d2f9a5779c9771e7763917162c324e0f | [] | no_license | acc-cosc-1337-fall-2018/acc-cosc-1337-fall-2018-ayla00 | e241002d25d30a77dac2cef5c7055f007dce5cfb | 6580d33ff41430ae3aede12e501c16491dc5164c | refs/heads/master | 2021-08-19T01:05:59.719925 | 2018-12-12T02:40:26 | 2018-12-12T02:40:26 | 147,436,020 | 0 | 0 | null | 2018-11-19T17:47:24 | 2018-09-05T00:20:40 | C++ | UTF-8 | C++ | false | false | 117 | cpp | invoice_utility.cpp | #include "invoice_utility.h"
double InvoiceUtility::get_total() const
{
return Invoice::get_total() + fixed_cost;
} |
888241233aad0632d1a29ab4d32b3790a3f02f27 | a7764174fb0351ea666faa9f3b5dfe304390a011 | /src/V3d/V3d_ColorScaleLayerItem.cxx | 23f94669d34dbd3fae06b9f37585142e1c5d77e8 | [] | no_license | uel-dataexchange/Opencascade_uel | f7123943e9d8124f4fa67579e3cd3f85cfe52d91 | 06ec93d238d3e3ea2881ff44ba8c21cf870435cd | refs/heads/master | 2022-11-16T07:40:30.837854 | 2020-07-08T01:56:37 | 2020-07-08T01:56:37 | 276,290,778 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 657 | cxx | V3d_ColorScaleLayerItem.cxx | /***********************************************************************
************************************************************************/
// for the class
#include <V3d_ColorScaleLayerItem.ixx>
//
//-Constructors
//
V3d_ColorScaleLayerItem::V3d_ColorScaleLayerItem (
const Handle(V3d_ColorScal... |
76ba1c2770b257ed82835d864e1cf07f046dad3a | a65c77b44164b2c69dfe4bfa2772d18ae8e0cce2 | /tioj/1023.cpp | 5a1c5ba25f82be308a8b29b8c90af550ecf99b1c | [] | no_license | dl8sd11/online-judge | 553422b55080e49e6bd9b38834ccf1076fb95395 | 5ef8e3c5390e54381683f62f88d03629e1355d1d | refs/heads/master | 2021-12-22T15:13:34.279988 | 2021-12-13T06:45:49 | 2021-12-13T06:45:49 | 111,268,306 | 1 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 496 | cpp | 1023.cpp | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
int m,r,b,tmp;
int cntr[503],cntb[503];
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
while (cin>>m) {
r=0;b=0;
REP(i,m) {
cin>>tmp;
cntr[tmp]++;
}
REP(i,m) {
cin>>tmp;
cntb[tmp]++;
... |
cedd6ab8e895975cb5090d34767b8633ccafa086 | 48298469e7d828ab1aa54a419701c23afeeadce1 | /Server/Skills/ImpactLogic/StdImpact009.cpp | 18cc41dae5e325b9c0f548c5443c831b2969ec52 | [] | no_license | brock7/TianLong | c39fccb3fd2aa0ad42c9c4183d67a843ab2ce9c2 | 8142f9ccb118e76a5cd0a8b168bcf25e58e0be8b | refs/heads/master | 2021-01-10T14:19:19.850859 | 2016-02-20T13:58:55 | 2016-02-20T13:58:55 | 52,155,393 | 5 | 3 | null | null | null | null | GB18030 | C++ | false | false | 1,733 | cpp | StdImpact009.cpp | #include "stdafx.h"
///////////////////////////////////////////////////////////////////////////////
// 文件名：StdImpact009.cpp
// 功能说明：效果--传送角色到指定位置
//
// 修改记录：
//
//
//
///////////////////////////////////////////////////////////////////////////////
#include "StdImpact009.h"
#include "Obj_Human.h"
#include "Scene.h"
name... |
66d05fb98899bdd7fabcc4b19dde9ddb0970e0dd | d62600407e56451c7c31606a0fd6e8a0c1d920de | /i_am_miss_nobody/991A.cpp | dbfca9e8c26d8ac480c6a5559f4c6a664748cca6 | [] | no_license | nafisa11bd/My-Codeforces-AC-submissions | f25058e2391840f5d1b267264d15e3fc14e38b61 | b456b9a526e076a54ed1fe38792481263cfffb62 | refs/heads/main | 2023-05-12T01:49:27.649597 | 2021-06-03T14:35:45 | 2021-06-03T14:35:45 | 303,282,892 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 195 | cpp | 991A.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,N,R;
cin>>A>>B>>C>>N;
if((A+B-C)>=N){
cout<<-1<<endl;
}
else if (C>A||C>B)
cout<<-1;
else
cout<<N-(A+B-C);
} |
c79fa365b9e01eea8b8201dfd2e2239059aee001 | ddad5e9ee062d18c33b9192e3db95b58a4a67f77 | /util/fibers/event_count.h | a167651f1b25c15ac15b12a7adfa85b0800ce8a3 | [
"BSD-2-Clause"
] | permissive | romange/gaia | c7115acf55e4b4939f8111f08e5331dff964fd02 | 8ef14627a4bf42eba83bb6df4d180beca305b307 | refs/heads/master | 2022-01-11T13:35:22.352252 | 2021-12-28T16:11:13 | 2021-12-28T16:11:13 | 114,404,005 | 84 | 17 | BSD-2-Clause | 2021-12-28T16:11:14 | 2017-12-15T19:20:34 | C++ | UTF-8 | C++ | false | false | 6,195 | h | event_count.h | // Copyright 2019, Beeri 15. All rights reserved.
// Author: Roman Gershman (romange@gmail.com)
//
// Based on the design of folly event_count which in turn based on
// Dmitry Vyukov's proposal at
// https://software.intel.com/en-us/forums/intel-threading-building-blocks/topic/299245
#pragma once
#include <boost/fibe... |
c2cad03edf6451cdc6498a15e9c9af710988c16f | 09458cae55d5285ca2b1331840220d4babfd0e63 | /maze_game.cpp | 48c67c0991e3cc74ef439c1aa91a10d806f67d23 | [] | no_license | SDredz/C-Maze-Game-in-Windows-CMD-Terminal | e8f0e5b1d7a8ef814d7fd2acec3a634eb9917522 | f2df99afeb951d4c85cd62bd9a9bb1d43867dd21 | refs/heads/main | 2023-08-03T13:32:19.375683 | 2021-09-19T20:38:42 | 2021-09-19T20:38:42 | 408,230,812 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 22,785 | cpp | maze_game.cpp | /*---------------------------------------------------------------
Name: Tyreke Scott
Date: July 1, 2021
Purpose: To create a program that has a maze which is an array that the user
should navigate from room to room until s/he reaches one of two exits
I CERTIFY THAT I HAVE NOT GIVEN OR RECEIVED ANY
UNAUTH... |
e5cf861ada0012d3367fdbdde912d10a21815ef8 | 78d0e38754de3e2d3a1f1ac8f80ca17aa5c24283 | /OBD_PND/OBDPNDDlgTipInfo.h | e3cad04c2fbf8a19718f4df58ff3ca0e0c022971 | [] | no_license | Aavesh/obd_pnd | 7a76354b81dcff84adcfc3ebe96d425c0f8d9da9 | f2296e7e65701f6bb574359748cf56e9ed09224e | refs/heads/master | 2020-12-11T06:11:02.931797 | 2014-01-13T03:52:56 | 2014-01-13T03:52:56 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,266 | h | OBDPNDDlgTipInfo.h | #pragma once
#include "OBDPNDDlgBase.h"
enum TIP_INFO_TYPE
{
TIP_INFO_TEXT,
TIP_INFO_WARN,
TIP_INFO_ERROR,
};
// COBDPNDDlgTipInfo 对话框
class COBDPNDDlgTipInfo : public CDialog,public COBDPNDDlgBase
{
DECLARE_DYNAMIC(COBDPNDDlgTipInfo)
public:
COBDPNDDlgTipInfo(CWnd* pParent = NULL); // 标准构造函数
virtual ~COBD... |
37a4a4001bfac5b150129d0e9467d4aded28565a | 9704b65c04f981351dbf068bf072feb67c95b21c | /CC AND.cpp | 6beb4dee57d24cc550a73bab19e083a17b5e2b13 | [] | no_license | rohitsikka/CodeChef | b3f64a9db79c907e9f5b54604b7871ebc9b1c29e | f6ba8ce71770adfac11833909c9e80bc71b34215 | refs/heads/master | 2016-09-01T18:24:58.870319 | 2015-02-20T10:46:51 | 2015-02-20T10:46:51 | 31,067,740 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 553 | cpp | CC AND.cpp | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
freopen("temp.txt","r",stdin);
int n,num,bitCount[30];
scanf("%d",&n);
memset(bitCount,0,sizeof(bitCount));
for(int i=0;i<n;i++)
{
scanf("%d",&num);
for(int i=0;i<30&#i++,num>>=1)
... |
03fe09e083b4188f2e0f9bd02f945b88bb6c4735 | f2a8d9be4c207816d6e6fc0ee68ecda11f4512d6 | /return_by_reference.cpp | 7cfb806b7c85480e4c73d64701bbdffa00bcdac5 | [] | no_license | rushilg13/Cpp-Complete | 83e93af437478ee69716a1a53ddc10a00d585761 | c5d16702ae8d9fd27d4e60499620e29bb27b9b66 | refs/heads/main | 2023-01-24T01:14:58.166616 | 2020-12-01T13:23:18 | 2020-12-01T13:23:18 | 317,242,901 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 257 | cpp | return_by_reference.cpp | #include<iostream>
using namespace std;
int & print(int &a)
{
cout<<a<<endl;
return a;
}
int main(int argc, char const *argv[])
{
int x = 10;
print(x) = 25; // We have a function at the left side of an assignment operator.
cout<<x;
return 0;
}
|
3b4fa4d822a0556199c1f5d95bcfda4776cb6de2 | 5de7df0be411b4bad61f927cae845bdb8223308f | /src/libs/flow/flow_workspace.cpp | fda3a0dd7f33d76969273f53c127cf553ead0685 | [
"BSD-3-Clause",
"Zlib"
] | permissive | Alpine-DAV/ascent | cb40429167a93c62f78fe650a0121258be279162 | e52b7bb8c9fd131f2fd49edf58037cc5ef77a166 | refs/heads/develop | 2023-09-06T07:57:11.558238 | 2023-08-25T16:05:31 | 2023-08-25T16:05:31 | 81,366,855 | 151 | 61 | NOASSERTION | 2023-09-13T19:31:09 | 2017-02-08T19:21:22 | C++ | UTF-8 | C++ | false | false | 17,167 | cpp | flow_workspace.cpp | //~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~//
// Copyright (c) Lawrence Livermore National Security, LLC and other Ascent
// Project developers. See top-level LICENSE AND COPYRIGHT files for dates and
// other details. No copyright assignment is required to contribute to Ascent.
//~~~~... |
918996a32d57e2653d0a1e51a160775139e6bb9e | 2ce759256cd9e1ef94277a93bf365ded26607428 | /spoj/USUBQSUBtest.cpp | c17540217a61c9790de062ff10a0ebd099989583 | [] | no_license | SaxenaKartik/Competitive-Coding | a240d8319c8b97221fd741002d21835f8abd2c1e | b52496f86855a7cee4f39285604f92638c99b6cf | refs/heads/master | 2021-11-11T13:41:26.714053 | 2021-10-31T11:22:44 | 2021-10-31T11:22:44 | 151,931,070 | 1 | 5 | null | 2021-10-31T11:22:45 | 2018-10-07T10:45:54 | C++ | UTF-8 | C++ | false | false | 2,615 | cpp | USUBQSUBtest.cpp | #include <stdio.h>
#include <stdlib.h>
typedef long long int lli;
/*lli ***bit;*/
lli bit[5][1005][1005];
int n, m;
void update(int no, int x, int y, lli val) {
while (x <= n) {
int y1 = y;
while (y1 <= n) {
bit[no][x][y1] += val;
y1 += y1 & (-y1);
}
x += x ... |
40fa62f4edb1d4917ba64dbbfcc800a477bb37f8 | 7fa4fb0b3c56fd76ef473f725d21d0c7c9541a99 | /mekd/src/MEKD_MG.cpp | fc82bef00f7746e6119fb6f6bb1721e4613d4ba1 | [] | no_license | jhugon/hmumuAnalysis | ccc0558f09dfdb92d993d1e4c6e9785ab160d0f1 | 4d1fe34a4610f7db23241daa3e1e693839cc435b | refs/heads/master | 2020-04-05T23:46:36.493543 | 2013-08-06T14:30:25 | 2013-08-06T14:30:25 | 11,926,126 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 136,961 | cpp | MEKD_MG.cpp | #ifndef MEKD_MG_cpp
#define MEKD_MG_cpp
/// C++ libraries
#include <iostream>
// #include <fstream>
#include <sstream>
#include <string>
#include <vector>
#include <algorithm> // for sorting
#include <cmath>
/// CMSSW includes
#ifndef MEKD_STANDALONE
#include "FWCore/ParameterSet/interface/FileInPath.h"
#endif
///... |
532c07b21a5461bbc3bfa4f945a2407a6e3c6ca3 | fa7d082e43eef61794c0dcec4f4523fbda228e0e | /RedPitayaSup/src/drvRedPitaya.h | 93e93bbfa5f636a3b4c1e0807338043cd3f20ef6 | [
"BSD-3-Clause"
] | permissive | Mrwnlflt/redpitaya-epics | b7c3e52f9f062612089f60e79cfe95bb3d16dac7 | 7cb584ef341b4244e66610df064c53b30c549481 | refs/heads/master | 2023-03-17T02:42:06.125015 | 2021-02-25T00:07:11 | 2021-02-25T00:07:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,142 | h | drvRedPitaya.h | /* Description:
* This is an ASYN port driver to be used with an on board IOC for
* RedPitaya.
*
* Copyright (c) 2018 Australian Synchrotron
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are ... |
b8aee4c15845ee7d4860a54826602f5a3c159767 | 6522e532b7c657a6085053e223a9b18e5dcf0e6b | /include/commons/IS/Map/Map.hpp | bf92ca27efaacff11468c2955868e937e696cf62 | [] | no_license | Mthomas3/Bomberman | 19ceef98d8bb144248d60a26954320554f1aafb4 | f028670c2456dfee1209a0bee39163058ffd84fa | refs/heads/master | 2020-05-25T19:54:02.770618 | 2016-09-09T22:40:50 | 2016-09-09T22:40:50 | 60,961,167 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,891 | hpp | Map.hpp | #pragma once
#include <cstdint>
#include <functional>
#include <map>
#include <memory>
#include <vector>
#include <IS/GameObject/GameObject.h>
namespace IS
{
namespace Scene
{
class Scene;
}
}
namespace IS
{
class Map
{
public:
typedef IS::GameObject::GameObject objT;
typedef IS::S... |
47b78521c562a5a0902d8226816cc4f4989da3cf | eef5b04a28b932df654f26763269a260c7d5da80 | /arduinoCar.ino | a34c5a972cd9bb9dd8d51d3e379ea02485eacfca | [] | no_license | SebastianBienert/CarApp | c032cc00f272e05e8ddd2f62fa1fb149781fe857 | 6f8e8baabfbea89f8a80407f6585fb46cc89c5b6 | refs/heads/master | 2021-05-04T22:25:44.305757 | 2018-02-02T22:01:14 | 2018-02-02T22:01:14 | 120,033,403 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,574 | ino | arduinoCar.ino | #include <LiquidCrystal.h> //Dołączenie bilbioteki
LiquidCrystal lcd(2, 3, 4, 8, 11, 12); //Informacja o podłączeniu nowego wyświetlacza
int izqA = 5;
int izqB = 6;
int derA = 9;
int derB = 10;
int vel = 127; // Predkosc silnikow (0 - 255)
int data = 12; // inicjowanie sygnalem stopu
bool updateLCD = false;
void seri... |
98ebb3085aa309bfa0e73ad8134a77dd72f20a26 | 674053246614a1b6d9ffebe348c67bfe2c970e2c | /Risk/GameEngine.h | 095b0d677bd4a85a580cdbe83e49ac52bae6dc71 | [] | no_license | daniakalomiris/risk | 52dad37873d7d6ffdabfd4d7fb20b93bd1171ede | ea611b713c4bee4f1b6d922083d1e3f1a05f0dd6 | refs/heads/master | 2022-04-08T05:54:48.704579 | 2020-03-07T20:04:51 | 2020-03-07T20:04:51 | 216,266,039 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,003 | h | GameEngine.h | #pragma once
#include <vector>
#include <memory>
#include "Player.h"
#include "Map.h"
#include "MapLoader.h"
#include "Cards.h"
#include "GameObservers.h"
class Tournament;
class GameEngine: public Subject{
private:
std::unique_ptr<int> numberOfPlayers;
std::unique_ptr<int> phase;
std::vector <Player*> al... |
85d1f03947869e320706c3d76681f49f558701c0 | 60c93ffbeb4e85490ced5c9b76cc869b21bd56cc | /bRenderer/implementation/Font.cpp | 2c4523ead803dbdd4011c16a2de5a7816d733e6a | [] | no_license | bthdimension/bRenderer | cafb82342b38baa52e011bab3b4685e7f7daa828 | a46fb0cd26a89664106442cd85495f28fed715a2 | refs/heads/master | 2021-12-29T07:19:24.864187 | 2021-12-27T20:41:58 | 2021-12-27T20:41:58 | 33,089,906 | 10 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 1,429 | cpp | Font.cpp | #include "headers/Font.h"
#include "headers/Logger.h"
#include "headers/FileHandler.h"
#include "headers/Configuration.h"
Font::Font(const std::string &fontFileName, GLuint fontPixelSize)
{
_initialized = false;
init(fontFileName, fontPixelSize);
}
ftgl::texture_glyph_t *Font::getCharacter(char c)
{
return ftgl::t... |
0eb3bd3a0eb8922a4c2ee261121f0d8b52ce9ec1 | 90517ce1375e290f539748716fb8ef02aa60823b | /solved/f-h/feynman/feynman.cpp | fb40243fe250c658b1cb2e66d56ff9cbd1da0466 | [
"Unlicense",
"LicenseRef-scancode-public-domain"
] | permissive | Code4fun4ever/pc-code | 23e4b677cffa57c758deeb655fd4f71b36807281 | 77ce51d692acf6edcb9e47aeb7b7f06bf56e4e90 | refs/heads/master | 2021-01-15T08:15:00.681534 | 2014-09-08T05:28:39 | 2014-09-08T05:28:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 305 | cpp | feynman.cpp | #include <cstdio>
#define MAXN 100
int N;
int f[MAXN + 1];
void prepare()
{
for (int i = 1; i <= MAXN; ++i)
f[i] = f[i - 1] + i*i;
}
int main()
{
prepare();
while (true) {
scanf("%d", &N);
if (N == 0) break;
printf("%d\n", f[N]);
}
return 0;
}
|
cda8d8033d4279ee7bffa45f02121dfe7adc3c1e | 49e8aee9bed5773a56ed51936525767ff5cc359d | /cpp/aoj/aoj/1508.cpp | 974ddea8d4b15f68aa7a4e3a6dab205bc03d8b34 | [] | no_license | minaminao/competitive-programming | 3985655badc3808df3e85f71cf4dbbb3cef82bcb | a127be6e54368d26d6961af3069d8c7e43bf11db | refs/heads/master | 2021-07-15T02:46:18.414431 | 2021-03-21T18:21:58 | 2021-03-21T18:21:58 | 81,536,306 | 8 | 1 | null | null | null | null | SHIFT_JIS | C++ | false | false | 3,439 | cpp | 1508.cpp | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f... |
d096ab0decf28ad97a94e3fa2c6c443ef1981b14 | 28822eab0d6003b2818d31196d0c655b7ce4e76c | /include/nbla/function/sign.hpp | 2c9c0203f75e4f0bd44baeddbbb621759f87bd45 | [
"Apache-2.0"
] | permissive | Pandinosaurus/nnabla | e00218a36e4f4c1e52e08476be4a36834832da05 | 93211d0f322d76efc48cfcf27decae7bd818f923 | refs/heads/master | 2023-08-30T22:52:31.961668 | 2023-08-22T03:30:22 | 2023-08-22T03:30:22 | 157,704,914 | 1 | 0 | Apache-2.0 | 2023-08-24T15:35:11 | 2018-11-15T12:07:05 | Python | UTF-8 | C++ | false | false | 1,478 | hpp | sign.hpp | // Copyright 2017,2018,2019,2020,2021 Sony Corporation.
// Copyright 2021 Sony Group Corporation.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/... |
06c208d01fa2f3f4c747b88c1aa61244c7f31200 | bf1f40886a54ff8ae25ac612cceee6d8701100f0 | /maximal_square.cc | 938d65d0c8e117d1f9f80a5837b7e4e48967f61b | [] | no_license | gqqh/leetcodes | be57941888c61fec51fa9b86f5f94f9e4c77cd2d | 9ff1709820b5d17544fc8d6c84e0335cdb49f940 | refs/heads/master | 2021-01-25T08:49:06.612971 | 2016-12-07T03:53:08 | 2016-12-07T03:53:08 | 40,632,656 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,602 | cc | maximal_square.cc | //求一个0、1矩阵中最大的全1方阵大小
//使用动态规划，类似与LCS算法
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
//动态规划，使用一个二数组dp[][]来表示，同时max记录最大的边长
// dp[x][y] = min(dp[x][y-1], dp[x-1][y], dp[x-1][y-1]) + 1
int maximalSquare(vector<vector<char>>& matrix) {
int rows = matrix.size();
... |
b7d4247630d794aaf3f1c25e5898483b7271dcdd | 087c2ecf26a605536fa70187cb31dc0238881aeb | /day7/day7_daxpy.cpp | 9340b7dd15fdb68a6a0b1c3f2e55c3808d1e1f75 | [] | no_license | lyu/ams595 | 862bb50a3b760b2d538b5197d5573ebd0118d6dc | 35578bbbd68906af775f7d772a83e271060b821b | refs/heads/master | 2020-04-04T10:43:03.814788 | 2019-12-01T03:38:00 | 2019-12-01T03:45:09 | 155,863,486 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 994 | cpp | day7_daxpy.cpp | // A simple daxpy program that computes double-precision a * x + y
// This example shows what the optimizaiton flags do, and the concept
// of the memory wall
//
// Obviously, this operation is memory-bound, so even if you have an x86 CPU
// that is produced after 2013, which can do this operation in one clock cycle
//... |
64c199ef9c79350159770593a7bd91eaa893cada | 723ba58443ae6b4e8e1918cc5bbc42f6bab2d12f | /src/process.cpp | 39879e5befc7aba49e181d3961fe22ee287e2d14 | [] | no_license | technical-ko/Multi-Core-Processing-Scheduler | b050744245ed810bad2d4a3b682eb44cfeed8a79 | 1334f7d19fcd8ac8adcc0890ec6d148122d1182c | refs/heads/master | 2022-04-14T03:23:04.465076 | 2020-03-21T01:35:46 | 2020-03-21T01:35:46 | 244,400,008 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,304 | cpp | process.cpp | #include "process.h"
#include "vector"
// Process class methods
Process::Process(ProcessDetails details, uint32_t current_time)
{
int i;
pid = details.pid;
start_time = details.start_time;
num_bursts = details.num_bursts;
current_burst = 0;
burst_times = new uint32_t[num_bursts];
cpu_io_tim... |
9952dc0f17f814a04785987b1374f065cc863ff4 | 3a22daa3121c8bb47472062a1af40edc7515858f | /UDPNetworking/src/ConnControl.h | 8177dee973f3ea273a5e57a98e4e480abb5761ba | [] | no_license | ahmedatya/UDP-Client-Server-C- | 6e671932dc30b7cbdee332b0327a50c4605696b3 | b893706e48250a364bbbd13d4ff752c7dc693191 | refs/heads/master | 2020-04-11T02:58:15.880293 | 2013-06-29T01:16:33 | 2013-06-29T01:16:33 | 10,946,485 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,805 | h | ConnControl.h | /*
* ConnControl.h
*
* Created on: Jun 28, 2013
* Author: aatya
*/
#ifndef CONNCONTROL_H_
#define CONNCONTROL_H_
#include "UDPHandler.h"
#include <math.h>
#include <stdlib.h>
#include <time.h>
namespace SISA_NET {
/*
* Flow Control and Reliability Definitions
*/
#define MAX_NUM_RETX 5 // maximum number... |
997280eb30c422361476233d60b5ad890376c90f | 5349a61fe3aa9cfb5aa8ebcbb57528118787a9e1 | /BundlerViewer/include/OgreAppFrameListener.h | 4caca429e29a037a5da4cce3c4437b00d97af6a0 | [
"MIT"
] | permissive | pitzer/SFMToolkit | f6d986e7f93d79182c42e70929677b3ccbe650eb | 32442d63f985622238d66ca99e8935ad83ca2ba9 | refs/heads/master | 2021-01-16T20:06:59.695220 | 2013-03-11T00:43:22 | 2013-03-11T00:43:22 | 8,319,269 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,016 | h | OgreAppFrameListener.h | /*
Copyright (c) 2010 ASTRE Henri (http://www.visual-experiments.com)
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy... |
6ec1d78edcb916f5beb4c96cda6d394dfd250538 | 9ab0a110bac0dd121cefef70e15675efadfd77c9 | /#03/331. 验证二叉树的前序序列化/331. 验证二叉树的前序序列化.cpp | 57949a4df1a9c49e0f4dcf0d908656e8e0a7d383 | [] | no_license | LymphV/Leetcode-of-LymphV | e25174f77d18fcbe03e57b93771a892f7a51f663 | d673ef54a1771da0be37d460cc3446f99fc555d0 | refs/heads/master | 2023-05-04T08:45:18.591625 | 2021-05-26T07:49:46 | 2021-05-26T07:49:46 | 297,265,757 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,177 | cpp | 331. 验证二叉树的前序序列化.cpp | #if defined(LocalLymphV)
#include "../../leetcode.h"
#include <LymphV>
#else
#define print(...) 0
#endif
#if !defined(LocalLymphV) || !defined(DebugLymphV)
#define debug(x) 0
#endif
/**
序列化二叉树的一种方法是使用前序遍历。当我们遇到一个非空节点时，我们可以记录下这个节点的值。如果它是一个空节点，我们可以使用一个标记值记录，例如 #。
_9_
/ \
3 2
/ \ / \
4 1 # 6
/... |
5df832effa57b63b6bf6df63f011012c40b0edc4 | eff68e9a9810bb7d00cd5ef0fb36952db414e6f8 | /oreilly_examples/len.cpp | a441f8c6962cd71f7b19b813dfc85366393608c7 | [] | no_license | rhealbarnett/learning_cpp | e4d9ab15c9df56c9b44a243b8c140fd390cf009c | 7a7d2524fe9c8d71a636108aa07cae1e8116e1ea | refs/heads/master | 2023-02-26T13:46:05.749558 | 2021-02-04T22:22:49 | 2021-02-04T22:22:49 | 335,861,326 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 210 | cpp | len.cpp | #include <iostream>
using namespace std;
char line[100];
int main()
{
cout << "Enter a line: ";
cin.getline(line,sizeof(line));
cout << "The length of the line is: " << strlen(line) << "\n";
return(0);
}
|
2839a87a7e23fdc0d287314952a885594146fb77 | 2aa40ab42188b9b4d249df03b38168ee940ceffb | /src/UI/LEONIS_CINEMA_CineCast/maintainform.h | e607fd6556d94029f80372f3e8a487ccb42df52b | [] | no_license | killerlife/CineCast | bea93404dc28be9e887f73d36eb506885f2806c5 | 955a42a69399b8bb22d9042a50c758a46cba4cf5 | refs/heads/master | 2020-04-12T06:38:03.387855 | 2018-08-02T05:20:24 | 2018-08-02T05:20:24 | 61,522,406 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 561 | h | maintainform.h | #ifndef MAINTAINFORM_H
#define MAINTAINFORM_H
#include <QWidget>
namespace Ui {
class MaintainForm;
}
class MaintainForm : public QWidget
{
Q_OBJECT
public:
explicit MaintainForm(QWidget *parent = 0);
~MaintainForm();
void setProgressBarValue(int maxvalue = 100,int value = 0);
private slots:
vo... |
89a07b80425f04f9d9266ee063cbcf0f96c8e150 | 38804bb6bbe2ebf4953e4ee834edb41ce0f9a55c | /402_Remove_K_Digits/402.cpp | 98794c09b2c8e8355476552e6ff80269019f76af | [] | no_license | mumuxijili/MyLCode | d90da042477193e23a2a215c8e4d29d4911a2dd3 | 5998073e400f732b144f742d257b8f97631cbc00 | refs/heads/master | 2021-01-01T05:19:06.388875 | 2017-06-02T03:50:04 | 2017-06-02T03:50:04 | 59,084,603 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 485 | cpp | 402.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
class Solution
{
public:
string removeKdigits(string num, int k)
{
string res = "";
int n = num.size();
int keep = n - k;
for(auto c : num)
{
while(k > 0 && res.size() > 0 && res.back() > c)
{
res.pop_back();
k--;
... |
4d2e594d35733f3dc575c496275d995eb0856552 | 089077acd7dc512a1afde017692382b0b9ada02f | /aBaseTool/include/math/quat.h | eebdac91569c9188d15466c038b46974057831ff | [] | no_license | lizzyly7/SmartDraw | 6830b172cebcf2005366b7438d771af3faa137cf | cb891dbe66d75bbb3f692fce72e91402e1c97010 | refs/heads/main | 2023-04-19T05:54:52.948266 | 2021-05-04T11:02:01 | 2021-05-04T11:02:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 723 | h | quat.h | /********************************************************************
created: 2003/08/09
created: 9:8:2003 13:03
filename: D:\Project\ITK\include\Math\quat.h
file path: D:\Project\ITK\include\Math
file base: quat
file ext: h
author:
purpose:
*************************************************************... |
57c118005a907898a1a2b9f877b84c110a651d99 | 7bb4675395c0bcc95bebc17c6e2268d0421d6403 | /CamperMaster/serialhandler.ino | b49f984b1eca3fb943fed0a72db8fce388383675 | [] | no_license | chrisjoyce911/Camper-Control | 8f263e4cc10fd08bf3f76199f566b7ca210f3129 | b80a314e8ee888771fd44abf74453bc25d4fd089 | refs/heads/master | 2020-12-02T20:50:06.247492 | 2017-07-09T14:40:45 | 2017-07-09T14:40:45 | 96,221,544 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,701 | ino | serialhandler.ino |
void recvWithStartEndMarkers() {
static boolean recvInProgress = false;
static byte ndx = 0;
char startMarker = '<';
char endMarker = '>';
char rc;
while (Serial3.available() > 0 && newData == false) {
rc = Serial3.read();
if (recvInProgress == true) {
if (rc != ... |
ed2b24bd39c752e55700bafc6b02245121d6172c | 885775fc2a7a40d409c828066d483140d200f467 | /Pressure/Software/pressure_test/pressure_test.ino | 386a8a804c02cef49a58cf16a0f85144df3ef5f3 | [] | no_license | andrewcollison/HighTemp | 941b954bf141068093f31209dbb693382476a862 | 6dd72393ae13eaaa62179149c27a3b456ed43800 | refs/heads/master | 2023-03-13T19:19:11.989654 | 2021-03-19T01:59:20 | 2021-03-19T01:59:20 | 279,719,390 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,796 | ino | pressure_test.ino | float resultData[5] = {0, 0, 0, 0, 0};
//______________________________________________
// Map values as floats
float fmap(float x, float in_min, float in_max, float out_min, float out_max)
{
return (x - in_min) * (out_max - out_min) / (in_max - in_min) + out_min;
}
//____________________________________... |
2080ef921f705b160743c93892e3e3abb49cd3c2 | 2160fd4cc5cb24bb8427ec78ef9b2d3a9549c2c5 | /src/scm/src/service.cpp | 7e330a6d1966151ec965edb2f68284daa7e5f9f5 | [
"MIT"
] | permissive | solosTec/cyng | 7e698487ef57f050fc2b3e287aa79463b2debc9f | a55fc9a7566254cb8e60a51b9884b40f19f866b9 | refs/heads/master | 2023-07-25T11:49:07.089159 | 2022-10-21T15:17:13 | 2022-10-21T15:17:13 | 115,027,279 | 0 | 2 | MIT | 2022-10-21T15:17:14 | 2017-12-21T16:46:54 | C++ | UTF-8 | C++ | false | false | 128 | cpp | service.cpp | /*
* The MIT License (MIT)
*
* Copyright (c) 2021 Sylko Olzscher
*
*/
#include <cyng/scm/service.hpp>
#include <string.h>
|
2bc19e796d7c5bdaed3fcb8f8da358ba1c087a24 | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_1485488_1/C++/jxwuyi/main.cpp | 84d0d4145b6467df9420184cafefaecf1efca167 | [] | 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 | 2,933 | cpp | main.cpp | #include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<string>
#include<queue>
using namespace std;
const int dir[4][2]={{0,1},{1,0},{-1,0},{0,-1}};
int N, M, H;
int C[200][200], F[200][200];
inline bool inside(int x,int y... |
ff24da7eec5c8617dcb5b6edc04d956b0eeb16bd | 83f67435eca92b0d1f4d7460f170671b7ecc1525 | /system-app-master/src/StatisticsManager.cpp | 0b08b02ad016f44ee9ec2379e53c48891403797f | [] | no_license | hirnevan/NanoFirewall | 4310bce27549703bdfe7beba98231c47bbc35463 | 773c93d004d6c416321688ecf68e45ce56d9986d | refs/heads/master | 2023-08-05T00:26:19.163964 | 2021-09-12T05:27:32 | 2021-09-12T05:27:32 | 405,502,067 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,261 | cpp | StatisticsManager.cpp | /*
* StatisticsManager.cpp
*
* Created on: Apr 1, 2021
* Author:
*/
#include <ConfigManager.h>
#include <StatisticsManager.h>
#include <bits/types/struct_tm.h>
#include <bits/types/time_t.h>
#include <ctime>
StatisticsManager::StatisticsManager() {}
StatisticsManager::~StatisticsManager() {}
/*
* Incr... |
4d485ba08982cb29ebc6fc7ffcb3725de41dfdf9 | d0d0a4a33bf5aa1b9c608702e1bbaa1fd2b5e3eb | /oficina/arduino_code/luz.ino | 7f77142ce19ef2fb88286a0a375361a0469ce462 | [] | no_license | juanengml/oficinaEZAutomacao | 0b2e79d829ca26faf13620bef464fc429d9f3a65 | 0a870c921f3aeb1431de1549ce9a8c6268ee61b3 | refs/heads/master | 2020-03-21T19:46:09.324838 | 2018-06-28T05:14:06 | 2018-06-28T05:14:06 | 138,968,681 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 247 | ino | luz.ino | int luz = 7;
char letra;
void setup()
{
Serial.begin(9600);
pinMode(luz,OUTPUT);
}
void loop(){
letra = Serial.read();
switch(letra){
case 'l':
digitalWrite(luz,HIGH);
break;
case 'd':
digitalWrite(luz,LOW);
break;
}
}
|
da33095623093c4b86f3f7b6e69e0dfa8de14a36 | 654fa2779996e7c9016f17d922acf03d0c806aef | /SIM5360_INTERNET.h | 4ca5f72f1bdaa8ba5015f57055d136c256980d05 | [] | no_license | abhayghatpande/IOXhop_SIM5360 | e064a7165287a7bcd1210e37882d84456b77dc72 | 198393ec992e2ec0d2cb8d408330e89f9381ec35 | refs/heads/master | 2021-05-15T14:48:38.252866 | 2017-09-30T11:48:49 | 2017-09-30T11:48:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 594 | h | SIM5360_INTERNET.h | /* File : SIM5360_INTERNET.h
Codeing By IOXhop : www.ioxhop.com
Sonthaya Nongnuch : www.fb.me/maxthai */
#ifndef SIM5360_INTERNET_H__
#define SIM5360_INTERNET_H__
#include "Arduino.h"
#include <SoftwareSerial.h>
#include "SIM5360.h"
class SIM5360_INTERNET: public SIM5360 {
public:
SIM5360_IN... |
3acb2121d84b79b6190b7d4c75e37ff84d12e1a4 | dce759420dacb7bedba7501ac35f61eb04a0b66c | /Chapter5/Chapter5.cpp | a4576f16e5e6dfea31d0f169dd9c494f5058c2e5 | [] | no_license | tyfurness/cpractice | f0b46a1e55f242a4e7f4b3fb1ba7c4f187c0273a | 1fd89689d2c03ee1fe951ce761a96b5103bb49cc | refs/heads/master | 2021-01-22T13:52:28.833343 | 2016-12-07T15:28:44 | 2016-12-07T15:28:44 | 68,628,930 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,041 | cpp | Chapter5.cpp | // Chapter5.cpp : Defines the entry point for the console application.
//
#pragma region Chapter 5.3 Quiz 1
#include "stdafx.h"
#include <iostream>
#include <cstdio>
using namespace std;
int calculate(int a, int b, char c)
{
switch (c)
{
case '+':
return a + b;
break;
case '-':
return a - b;
break;
... |
6c25833cd2b55a14607db0728e36861e0babb859 | 6f06493bf8df1900ef5352208a2b8ebd2bfac37f | /OpenGLProject/fix_normals_material.cpp | c715a66a3bf1c7e29b05cfd4298f717129826ce2 | [] | no_license | Cresspresso/RocketChess | c5df0f107cae1fc392976b9f2fb442c67e56431a | 96c0372317e5f4ca2d866094f02e95f341794ce2 | refs/heads/master | 2022-03-14T06:40:50.469855 | 2019-11-11T01:42:51 | 2019-11-11T01:42:51 | 198,104,578 | 1 | 0 | null | 2019-09-02T04:31:58 | 2019-07-21T20:56:09 | C++ | UTF-8 | C++ | false | false | 957 | cpp | fix_normals_material.cpp | /*
** Bachelor of Software Engineering
** Media Design School
** Auckland
** New Zealand
**
** (c) 2019 Media Design School
**
** File : fix_normals_material.cpp
**
** Summary : Basic material with Model, FixNormals, and MVP matrices.
**
** Project : Robotron Summative
** Author : Elijah Shadbolt
** Email : elijah... |
c89dc52205c2acb4b2889a2a110011072c2bcdb1 | e636b2c888278f30d5ed8f3e898a79c616eae623 | /src/UserSettings.hpp | b4210121693c9c3f6203f398c07bc0aac8f84e15 | [
"MIT"
] | permissive | hephaisto/sharebuy | b160f55db67918ef8567cf7504f3785038781775 | 12a14aba0f7119d6db59f57e067d1f438f7a6329 | refs/heads/master | 2021-01-17T06:18:03.093559 | 2017-12-24T00:57:06 | 2017-12-24T00:57:06 | 51,721,797 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 172 | hpp | UserSettings.hpp | #include <Wt/WContainerWidget>
#include "user/User.hpp"
class UserSettings : public Wt::WContainerWidget
{
public:
UserSettings(Wt::WContainerWidget *parent = NULL);
};
|
2f6f4b3599e617ba28e3ce79fac5f21a3abe1bc9 | 6d4299ea826239093a91ff56c2399f66f76cc72a | /Visual Studio 2017/Projects/bbbb/bbbb/a.cpp | 741591778822c847cf4f61ef3a5a83ef08e1dacb | [] | no_license | kongyi123/Algorithms | 3eba88cff7dfb36fb4c7f3dc03800640b685801b | 302750036b06cd6ead374d034d29a1144f190979 | refs/heads/master | 2022-06-18T07:23:35.652041 | 2022-05-29T16:07:56 | 2022-05-29T16:07:56 | 142,523,662 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 424 | cpp | a.cpp | #include <stdio.h>
int arr[100];
int search(int s, int e, int val) {
while (s <= e) {
int mid = (s + e) / 2;
if (val == arr[mid]) s = mid + 1;
else if (val < arr[mid]) e = mid - 1;
else s = mid + 1;
}
return s;
}
int main(void) {
int n;
scanf("%d", &n);
for (int i = 1;i <= n;i++) {
scanf("%d", &arr... |
c2a885c92cc5dc00bfe9bf14a12ecc3bba8b97a2 | 0f8a64268b51e650c3563164cb02886e6e0cd9a3 | /client/Functools.h | 76dc3d7ae99d59d44a0d7b69be857c3d2b38965b | [] | no_license | zbzbzb/ChatRoom | 2a06205fad2609a9054ea8c322d0cc5b414a14a6 | 8188cba99d04146dbff62d3d150016b017dc7728 | refs/heads/master | 2021-04-29T12:58:39.438377 | 2018-03-17T06:47:08 | 2018-03-17T06:47:08 | 121,731,070 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 371 | h | Functools.h | //
// Created by zhoubin on 2/15/18.
//
#ifndef SERVER_FUNCTOOLS_H
#define SERVER_FUNCTOOLS_H
#include<string>
#include<vector>
#include<map>
using namespace std;
class Functools {
public:
static void Split(std::string& s,std::string& delim,std::vector<std::string> & ret);
static void PrintVector(const ve... |
23e188d46e93bcd78117196e444e281910cc5d27 | 051c898be81003a5c90f5a1ce77a252252774973 | /preliminary/G/33915914.cpp | 7f7139d5f7cb9da2690a05d75d0bc35ce51e3d0b | [] | no_license | mmatrosov/FKN2020 | 29caffa241882e672df654b4857b5674d5f96f6e | 38bfa7811d4af175415f7cc4da81df44b5b4a74c | refs/heads/master | 2022-12-27T19:15:05.849915 | 2020-10-16T07:12:27 | 2020-10-16T07:12:27 | 298,350,636 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,307 | cpp | 33915914.cpp | #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<map>
#include<set>
#include<random>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<cstdio>
#include<cassert>
#inc... |
d993fe779adeb253313cd5707a65ea30cb6a29f6 | b91504b35ed7b719ca786ffe8553b4fa00339aa5 | /Search/LinearSearch.cpp | 72686bcd003b1bdceb0671174b1de1c9db7526d9 | [
"MIT"
] | permissive | kishoreuppalapati/Algorithms | 661bb0c56c7a7f504c94b5b1effea249b882d78f | d29a10316219f320b0116ef3b412457a1c1aea26 | refs/heads/master | 2022-01-21T13:13:38.350628 | 2019-08-14T08:43:11 | 2019-08-14T08:43:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 419 | cpp | LinearSearch.cpp | #include <bits/stdc++.h>
using namespace std;
int linear_search(int arr[], int n, int num);
int main(void)
{
int arr[] = {3, 2, 1, 5, 4};
int searchNum = 5;
cout << (linear_search(arr, 5, searchNum) == -1? "Not Found":"Found") << endl;
return 0;
}
int linear_search(int arr[], int n, int num)
{
... |
1b63463cff7053af3316ffb41bddf07901d6aa5f | 6430a1bd2fd5ef80959869deede66a06de1576e6 | /src/Unigram_Model/Formatter/Unigram_Train_Data_Formatter.h | 619101bd53b6aec40110f14b07113da44e85661a | [] | no_license | nandigama/Yahoo_LDA | d6df356012f71eb024287585e615732eb3cdf87c | 37639dbd494d589858b7c428c8d49a7acbab399f | refs/heads/master | 2020-04-08T21:13:18.516914 | 2011-07-14T06:40:43 | 2011-07-14T06:40:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,765 | h | Unigram_Train_Data_Formatter.h | /*****************************************************************************
The contents of this file are subject to the Mozilla Public License
Version 1.1 (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.mozilla.... |
bf0783aa1789fddf8e8f8eeee70ed6d7a78af3d9 | 35f9995cbc7c7a81bb66a862b52112f26ee6313e | /workdir/macros/basicFits.cc | 611fec7b370681bb2a45873480fa16479b2dfb37 | [] | no_license | yhshin11/AnaNaS | 0ba38ed0850981cb517404ea498c209f66e95d1b | a249b5eaf2ab5eb6c842249490d081404ca723d6 | refs/heads/master | 2021-03-12T21:44:56.437693 | 2014-06-19T23:02:23 | 2014-06-19T23:02:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,456 | cc | basicFits.cc | void fitMll()
{
RooRealVar m_Z0( "m_Z0", "Z0 mass",
91.188, "GeV/c^{2}" );
RooRealVar gamma_Z0( "gamma_Z0", "Z0 width",
2.4952, "GeV/c^{2}" );
RooRealVar m_ee( "m_ee","m_ee",50,120,"GeV/c^{2}" );
RooRealVar cb_bias_ee( "cb_bias_ee", "bias",
0.0, -1.0, 1.0,"GeV/c^{2}" );
RooRealVar... |
0d26b38c9434636a3ea90ce12bead500fda8d472 | d4041bd766a9cd3a3e41df6cc0b2b7971c7bbf25 | /Template/function_template2.cpp | 35956f26f14b2d9cba84f9742a591fa1143580c9 | [] | no_license | Myung-Hyun/Object-Oriented-Programming | 5962364c4c798d192aecc4c3e11b9ba7ae9fa083 | cf371afdc977ed63ee3e553636d31a79394ebbfc | refs/heads/master | 2022-12-22T08:17:11.286794 | 2020-10-01T08:57:34 | 2020-10-01T08:57:34 | 294,853,913 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 593 | cpp | function_template2.cpp | #include <iostream>
using namespace std;
//혼합된 매개변수를 이용하는 템플릿 함수.
template<class TYPE>
TYPE biggest (TYPE arr[], int arr_size);
void main()
{
int ary1[4] = {10, 7, 11, 24};
cout << "Biggest Value is " << biggest(ary1, 4) << endl;
float ary2[4] = {3.5f, 1.12f, 3.14f, 0.25f};
cout << "Biggest Value is " << biggest... |
5edf36e0926b4dac649b6293bd4f4f25acf5b643 | 84f3a4a858afa1a1f494556643b29aa706292261 | /OpenMoCap/src/Input/BvhReader.h | e3edb02154774cb41c3ef2cc6b86d154f51f35f3 | [] | no_license | jamieforth/OpenMoCap | ac44a86554983030ed0448855720084e4488d73b | 45eaa1347d3160719147e52a20279937cc199837 | refs/heads/master | 2020-03-07T00:12:16.479130 | 2014-08-02T21:50:53 | 2014-08-02T21:50:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 531 | h | BvhReader.h | /*
* BvhReader.h
*
* Created on: 04/03/2009
* Author: David
*/
#ifndef BVHREADER_H_
#define BVHREADER_H_
#include <fstream>
#include <iostream>
#include "../Entities/Skeleton.h"
#include "../Utils/Log.h"
using namespace std;
class BvhReader {
public:
BvhReader() {
}
BvhReader(st... |
6e3dc878acfbe5f1f439d3ca70b4281b95aabf54 | e685f4a1d066e61d9c79bdf47af2b7fe3ecf2fed | /Parser.cpp | bc9471959e3bd6495ea86c9735a9d326f57130a3 | [] | no_license | winorun/NanoPC-asm | d3340e824632c252059d937de2ddd5d1df2eb283 | 3db47f7197c5ba3bb4319815426348bc71d47a17 | refs/heads/master | 2023-07-17T00:04:10.796017 | 2021-08-30T07:41:49 | 2021-08-30T07:41:49 | 387,640,186 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 113 | cpp | Parser.cpp | #include "Parser.h"
Parser::Parser(std::istream &in = std::cin):d_scanner(in){
// d_scanner = Scanner(in);
}
|
6f565b9a8821bceb7ca51d84b8e7cb4553e03ed7 | ae1615a09bfb11551485dda857fe2e63837d4d73 | /src/CrsFunctions.cc | 4360df8637491a431a35e46e10debab507bbb200 | [] | no_license | duanebyer/gen-tcs | 64ae227a4d285632044f42ee5bef3186944913b7 | 25408eb4df779db93d2f7749005e5b4a00df5bf3 | refs/heads/master | 2023-01-03T06:35:23.782621 | 2020-10-29T21:08:46 | 2020-10-29T21:08:46 | 305,568,940 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,082 | cc | CrsFunctions.cc | #include <CrsFunctions.h>
#include <KinFunctions.h>
#include <iostream>
#include <cmath>
using namespace KinFuncs;
static double sq(double x) {
return x * x;
}
double CrsFuncs::BH(
double s, double t,
double p2, double p2prime,
double q2prime, double k2,
double a, double b,
int weight) {
// Fine structur... |
6b291ad2e594057b1e330b44a4e56d4b0136e499 | a4ea0b83c3443e174ba7d0b60fc6c6da3a031851 | /src/output/concrete/OutputConsole.cpp | a0c030457146f626e1c06d68c105b54d82229f7f | [
"MIT"
] | permissive | ZeyadOsama/LoggerCPP | 639ded4cfb417a08be047cf2a8da47f8af83f4a8 | bc14e3ce318f15442462452d75a8c2b5cb30a20d | refs/heads/master | 2023-02-15T20:16:29.272094 | 2021-01-09T17:19:42 | 2021-01-09T17:19:42 | 288,230,861 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 923 | cpp | OutputConsole.cpp | //
// Created by zeyad-osama on 25/07/2020.
//
#include <logger/output/concrete/OutputConsole.hpp>
#include <logger/utils/Utils.hpp>
using namespace logger;
using namespace logger::configurations;
using namespace logger::output;
using namespace logger::utils;
OutputConsole::OutputConsole(const Configuration::Pointer... |
eaeb3c846d23a3cb378b98ef67629595f5f78f5a | 317a15d287d27d5a6648a00e0da83a91aacb07a6 | /Misc/EncoderPID/robot-config.h | bde26288964c7f71317cf818d9dcda59b19d2ce4 | [] | no_license | DaleNaci/VEX | 529f31b6d8169944d6a236d994a60a735cf1fa39 | 1a0d61076df5582760502c7934e99db9681c56f3 | refs/heads/master | 2020-04-18T03:53:17.361529 | 2019-04-26T23:00:59 | 2019-04-26T23:00:59 | 167,217,449 | 0 | 1 | null | 2019-02-08T23:37:01 | 2019-01-23T16:43:58 | C++ | UTF-8 | C++ | false | false | 1,174 | h | robot-config.h | /**************************************************
*
*
* Team: 750E
* Game: Turning Point
* Header File
*
*
***************************************************/
//uses namespace for cleaner code;
using namespace vex;
/**************************************************/
/*Motor Port Declaration Panel*/
const... |
8b0164cf46760b3025b791db301c5de49e11ad8f | 460d867758e7805f77020269b82a34525b2ae99e | /src/graphics/SpriteManager.cc | 16752b038c1d1c5f0a5de909d6a4762ab3af78a6 | [] | no_license | mufeez-amjad/quadris | 5b009207ee2bb5b42dbc9e27b10fffd8cf5cd7f7 | e722ea7ddf3cb8d4918e810353413724493765be | refs/heads/master | 2023-02-13T18:36:57.512074 | 2021-01-13T02:22:28 | 2021-01-13T02:22:28 | 322,971,229 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 644 | cc | SpriteManager.cc | #include "SpriteManager.h"
#include <fstream>
// Loads sprite asset files specified per line in spriteFile
SpriteManager::SpriteManager(const std::string& spriteFile)
{
std::ifstream infile(spriteFile);
std::string asset;
while (infile >> asset) {
std::shared_ptr<Sprite2D> sprite = std::make_shared<Sprite2D>(ass... |
05c4945c8ef2ad143135fb0d56be78eae4c0e6b8 | c611b35a08d0abbce62c8a3e80ab747967460e4a | /tags/open64-1.0/osprey1.0/crayf90/sgi/cwh_preg.cxx | eaf9e9bfd7a6daf46a7c8c4fd79ce73fffad2b89 | [] | no_license | svn2github/open64 | 301f132bdcb602d4e677fc23881ce602f3961969 | 88431de7e6860ed692c0c160724620e798de428a | refs/heads/master | 2021-01-20T06:59:43.507059 | 2014-12-31T18:38:48 | 2014-12-31T18:38:48 | 24,089,237 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,709 | cxx | cwh_preg.cxx | /*
Copyright (C) 2000, 2001 Silicon Graphics, Inc. All Rights Reserved.
This program is free software; you can redistribute it and/or modify it
under the terms of version 2 of the GNU General Public License as
published by the Free Software Foundation.
This program is distributed in the hope that it would... |
e9476e0779e43971b8636bbee6eb754fea541f55 | b2c0517a0421c32f6782d76e4df842875d6ffce5 | /Algorithms/Math/1022. Smallest Integer Divisible by K.cpp | b19a0aca2c54012796f06c74b5786cf62c8e4eb4 | [] | no_license | SuYuxi/yuxi | e875b1536dc4b363194d0bef7f9a5aecb5d6199a | 45ad23a47592172101072a80a90de17772491e04 | refs/heads/master | 2022-10-04T21:29:42.017462 | 2022-09-30T04:00:48 | 2022-09-30T04:00:48 | 66,703,247 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 625 | cpp | 1022. Smallest Integer Divisible by K.cpp | //Pigeonhole principle
//if there is only K - 1 remainders with K, there will bee a duplicate remainders which
//will cause a modulo loop. So either there is no number divisible by K
//or there is a number which the number is less than or equal K
//1 % 6 = 1
//11 % 6 = 5
//111 % 6 = 3
//1111 % 6 = 1 equal (111 % 6) *... |
89ba5f6b7ffb9e7ace6b85b46da7a6c300e25fe6 | 96af801758f51262f725d68c6b04b7b31d4d7a51 | /poj/graph/3255.cpp | 3b629b38f5cb83f24d52115777bbca4717761114 | [] | no_license | wangjild/oj | 2a2e3e60dfebffb3b28a3f71534c09540528ed7e | 7daedce47bbef61055a4ad01b0e7a439351f1f7f | refs/heads/master | 2021-01-01T17:38:03.488140 | 2014-04-01T07:07:32 | 2014-04-01T07:07:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,594 | cpp | 3255.cpp | #include <vector>
#include <cstdio>
#include <cstdlib>
#include <limits.h>
#include <utility>
#include <queue>
#include <vector>
using namespace std;
typedef struct edge_e {
int to, cost;
} edge;
#define MAX_N 5001
int N, R;
vector<edge> G[MAX_N];
int dist[MAX_N];
int dist2[MAX_N];
int main() {
typedef ... |
e4448ec905a64adcf62cbe4a49e2be3281c589e1 | fc7c9b414bdb2c8e3a7690ca24ee7b37614e2478 | /modules/PrizeBoardModule.cpp | bee8938693c40eca5d2919dc5ac5c456d785592e | [] | no_license | davidpuzey/peanuts | 3be4e5f9563f400af541137c4dbb90586f67b28a | 1cf879bc1db55163ce055b70143c7864cf5cd188 | refs/heads/master | 2016-09-05T21:38:04.235450 | 2015-12-19T18:42:22 | 2015-12-19T18:42:22 | 7,327,311 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,789 | cpp | PrizeBoardModule.cpp | #include <ctime>
#include <QtWidgets>
#include <QSound>
#include "PrizeBoardModule.h"
PrizeBoardModule::PrizeBoardModule() {
setTitle("Prize Board");
setSettingsWidget(new BaseSettings);
setControlWidget(new PrizeBoardControl);
setLiveWidget(new PrizeBoardLive);
BaseControl *control = getControlWidget();
Base... |
a0c30b6cf4bb96d10d02df4b5466ba1f97286f0c | 788cc0506043ff42faeffc2d265f6024927f2c78 | /v1/test/test.h | 64170bece790acd165c351e8f03206df5c338e64 | [] | no_license | jumperbeng/pda_zw | 85b1c2c3d3165fe44cc3cd0d71c99745a00f4ce5 | 0c8431d3a5ba8bf5d91f007a9a84b0c21f468a6d | refs/heads/master | 2021-07-22T11:45:37.640146 | 2017-11-01T03:47:09 | 2017-11-01T03:47:09 | 106,499,784 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 317 | h | test.h | #include <iostream>
#include <map>
#include <utility>
using namespace std;
class Macro{
public:
Macro(){w=0;h=0;}
Macro(double w_value, double h_value){w=w_value;h=h_value;}
double get_w(){return w;}
double get_h(){return h;}
private:
double w;
double h;
};
//extern
map<string, Macro> macro_list;
|
e2bf16ef82e4498cc3113e36fadee8a586bb6344 | 767aaefe9e81fe2327694e52afa935350620a265 | /Invoice/main.cpp | 7ba74a5abd93c833e2bcdf9aa7f24d1dfec967eb | [] | no_license | GLIKCH/Laborat-rio-LP1 | 13eb125626d8d84e3ffcb0edd4350f937b068487 | 864ebeac4a97f93b338346eb54e4f190f19e68a0 | refs/heads/master | 2022-02-12T13:31:40.403322 | 2019-07-24T01:53:01 | 2019-07-24T01:53:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 581 | cpp | main.cpp | #include <iostream>
#include "Invoice.h"
#include <string>
using namespace std;
int main()
{
Invoice t1 = Invoice(2, 3, "Item aleatorio", 300);
cout<<"teste : "<<t1.getNum()<<"/"<<t1.getQtd()<<"/"<<t1.getDes()<<"/"<<t1.getVal()<<endl;
cout<<"Total : "<<t1.getInvoiceAmount()<<endl;
cout<... |
b9c0b2b7e8e4da74549df03f5d38c5855e24cf21 | 826572de7e451d38ea907bda59de2a9a86577112 | /mainwindow.h | de3325afee97f3f4183a33485944bbe26cfdf4f4 | [] | no_license | ffellix46/ControlBoxGUI | 1565b961872372b13860f67979676cc0fb4010b5 | 0c16c4d411cea000a870f8068c927a6ddbd361fb | refs/heads/master | 2020-04-10T01:55:27.874621 | 2019-01-06T11:14:45 | 2019-01-06T11:14:45 | 160,729,473 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,014 | h | mainwindow.h | #ifndef MAINWINDOW_H
#define MAINWINDOW_H
#include <QMainWindow>
#include <QObject>
#include <QDir>
#include <QList>
#include <QTableView>
#include <QTimer>
#include "UIclass/switch.h"
#include "digitaloutputmodule.h"
#include "digitalinputmodule.h"
#include "controlboxserver.h"
#include "typedefinitions.h"
namespac... |
248f949e3751c8226130b4cbc6746029ec48e33a | 381ddecd3170b752288d298f6b69b72feb780347 | /Classes/Card.h | 238b3a06f8fa2d770fc3512def5e9acf540cbded | [] | no_license | danielZhang0601/DDZ | 20dcae5124cd12839d280dbff907d622c577631f | 411303ee0b814de955724d0d01a4b83d5785484c | refs/heads/master | 2020-09-23T16:52:49.431901 | 2016-09-06T18:55:59 | 2016-09-06T18:55:59 | 67,536,345 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 886 | h | Card.h | //
// Card.h
// ddz
//
// Created by Admin on 16/9/7.
//
//
#ifndef Card_h
#define Card_h
#include "cocos2d.h"
enum CardNumber
{
Three = 3,
Four,
Five,
Six,
Seven,
Eight,
Nine,
Ten,
Jack,
Queen,
King,
Ace,
Two,
Joker
};
enum CardType
{
Diamond = 0,
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.