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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
d5fd74d2c11c67004c4f0e9e4318f23060808c21 | 20fffb1bc2795021c4612ad4b408d96fa5b761cf | /2016暑假集训第一周周赛/E/std.cpp | 9e557b293c17193ae40cdde33084af91c3203612 | [] | no_license | myk502/ACM | 244c0a614ab2454332d11fd9afd7a5434d22b090 | 7c4d55a4655e58de89307965a322dd862758adbd | refs/heads/master | 2021-01-01T16:42:05.678466 | 2018-10-01T14:31:57 | 2018-10-01T14:34:42 | 97,893,148 | 7 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 974 | cpp | std.cpp | #include<iostream>
#define NMAX 100005
using namespace std;
long long fight_power[NMAX];
int main(){
int T, n;
long long WH;
// freopen("stdin.txt", "r", stdin);
// freopen("stdout.txt", "w", stdout);
while(scanf("%d", &n) != EOF){
scanf("%lld", &WH);
for(int i = 1; i ... |
20bcecf1ac7cb3eb4dde3c85aae0376002917937 | 2609137765a5fb9a7646361e47d1c5f68440faa3 | /src/VDST.cpp | caba8f8531c07ec3c8a5abc4b698f68599c94d25 | [
"BSD-3-Clause"
] | permissive | Eventdisplay/Eventdisplay | 6133a1fcac44efb37baf25f6d91d337c1965fcd2 | 50e297561ddac0ca2db39e0391a672f2f275994b | refs/heads/main | 2023-06-24T03:58:48.287734 | 2023-06-14T06:29:25 | 2023-06-14T06:29:25 | 221,222,023 | 15 | 3 | BSD-3-Clause | 2023-08-23T15:17:56 | 2019-11-12T13:17:01 | C++ | UTF-8 | C++ | false | false | 19,137 | cpp | VDST.cpp | /*! \class VDST
\brief writes data summary files with sums and times for each pixel
output is after pedestal substraction, gain and toffset correction
*/
#include <VDST.h>
VDST::VDST( bool iMode, bool iMC )
{
if( getDebugFlag() )
{
cout << "VDST::VDST()" << endl;
}
// laser run as s... |
28f7e84e0697306e5ee9c096897d469a98f65387 | 614850f5190bea7c4a52f0432dea9beb8678be23 | /12.cpp | 37f2a941f368874996f839ba86cd5ae8c8efbece | [] | no_license | zigaroula/ACM-ICPC-Training | 33a72ccf647afa2bdded48dee26665349242f86c | fd4ad1d23d5f20090f8a62393024fdd2635feb92 | refs/heads/master | 2021-01-12T21:05:11.834502 | 2015-09-28T20:44:46 | 2015-09-28T20:44:46 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,412 | cpp | 12.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
using namespace std;
int cases, n, m;
vector<vector<int> > rel;
vector<int> tar;
int main() {
scanf("%d", &cases);
for (int numbercases = 0 ; numbercases < cases ; numbercases++) {
rel.clear();
tar.clear();
... |
fe5a68f24ed3f1ea5191f0dfff559573d9efc160 | bcafd8102f07bc16ccb09b5c6d213ffa8efa75ea | /gyak09/gumimaci.cpp | 1841374fb2c70372888fcefd75f832ba3b1d0473 | [] | no_license | juditacs/villprog | c5a04fb70ef12acaa18b39949d8b86173548df31 | 95184da6b129f23d3a3b4b88314cc13f58aaf505 | refs/heads/master | 2021-01-21T13:53:22.762407 | 2016-05-18T10:48:31 | 2016-05-18T10:48:31 | 52,074,874 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,517 | cpp | gumimaci.cpp | /*
* gumimaci.cpp
* Copyright (C) 2016 Judit Acs <judit@sch.bme.hu>
*
* Distributed under terms of the MIT license.
*/
#include <iostream>
#include <string>
class Partner {
protected:
Partner* recommender;
std::string name;
public:
Partner(std::string name): name(name) {}
void setRecommender(Part... |
7858f5c8ef83aeec513e454e8c19cdb47e1b5087 | 71445ce9808412c0dc0b559250ca4d2f37c78413 | /ParaView/Qt/Components/pqPlotMatrixDisplayPanel.cxx | 486422fffb76ef209b505a04acc257dfe2a71a23 | [
"LicenseRef-scancode-protobuf",
"LicenseRef-scancode-paraview-1.2"
] | permissive | alexisylchan/CollabVRGUI | 400f2169898e6ed2b962dba29a2776b1dc3442df | 8392162df5d115bb1128b92d267886c5227e7708 | refs/heads/master | 2021-01-01T06:33:45.035077 | 2012-09-10T04:58:34 | 2012-09-10T04:58:34 | 5,745,206 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 6,369 | cxx | pqPlotMatrixDisplayPanel.cxx | /*=========================================================================
Program: ParaView
Module: pqPlotMatrixDisplayPanel.h
Copyright (c) 2005-2008 Sandia Corporation, Kitware Inc.
All rights reserved.
ParaView is a free software; you can redistribute it and/or modify it
under the terms of ... |
f41ae6553a0a31f7afb4a3c22fc89b6f28228920 | 1f9ae86f8176058a751afb7c9af666aa6c61785e | /State-I/StateCls.h | a2bba987a4961d8a93944982acc1efaf110f31d1 | [] | no_license | RamazanDemirci/DesignPatternExamples | e13dfdcbf7937c6adbf7175f1e42d64fa565af4c | 3be595f2028f0315d2f28b8cc51cbcd26d1f1c96 | refs/heads/master | 2020-03-23T05:35:30.449884 | 2018-08-13T21:18:11 | 2018-08-13T21:18:11 | 141,153,982 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 306 | h | StateCls.h | /*
* StateCls.h
*
* Created on: 30 Tem 2018
* Author: tr1d5042
*/
#ifndef STATECLS_H_
#define STATECLS_H_
class MachineCls;
class StateCls {
public:
StateCls();
virtual ~StateCls();
virtual void on(MachineCls *machine);
virtual void off(MachineCls *machine);
};
#endif /* STATECLS_H_ */
|
896f13fe1930b5ea351323ea310285b25d936895 | b7d447ce4834ff96580bd02991cde604dc25ec2c | /threadedtree.cpp | c0965f6f25281aa75fe008b6b9b092311e829470 | [] | no_license | Ruhika1417/DSA_CPP | df74f7a3ceab16a1db12a991ab9a8bcddc7a0c9f | 71d5ebc32094d8fafeb28d7dc63f605ca8c0d8ff | refs/heads/master | 2023-02-25T10:35:35.635178 | 2021-02-06T11:30:01 | 2021-02-06T11:30:01 | 287,519,009 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,467 | cpp | threadedtree.cpp |
//threaded binary tree.
#include <bits/stdc++.h>
using namespace std;
class Node
{
public:
int data;
Node *left;
Node *right;
int leftThread; // leftThread=0 -> left pointer points to the inorder predecessor
int rightThread; // rightThread=0 -> right pointer points to the inorder su... |
c4bd2e7b2b400838173c60196cc95406e95afdc9 | fb17b4cb741d9ab81ec9cc9d4a8c70ad2700e203 | /vfh/polarhistogram.h | ed88e3edea6d974821b2f37b3c541bad22ec22a7 | [] | no_license | silei862/robotic | 34273caec1c94cead3c1dcc44518925f956e2126 | 0b92de89848a6830a522ebf0b595db6b34c3604b | refs/heads/master | 2020-05-17T06:06:12.746432 | 2013-03-18T07:33:31 | 2013-03-18T07:33:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,792 | h | polarhistogram.h | /*
* =====================================================================================
*
* Filename: polarhistogram.h
*
* Description: 方位直方图的实现
*
* Version: 1.0
* Created: 2012年11月21日 11时29分30秒
* Revision: none
* Compiler: gcc
*
* Author: 思磊 (Silei), sil... |
5057da1139a45bc49f122c0e961a1f9f851cfefc | b7671e7c80f7529911a6fd15a3830f469fe435f3 | /src/common/common/network/Net.hpp | f64ce1e71f4a73e6c47bbd71e97d0373e0535f52 | [
"MIT"
] | permissive | QualityHammer/CrossPlat | cf1ca50b4ae09ef2ec999be6ed7aaff2c11b5a20 | 60ea4e9849253e3753fa0becf6c3cf68c67d4b36 | refs/heads/master | 2023-01-13T20:38:51.659183 | 2020-04-22T02:37:44 | 2020-04-22T02:37:44 | 253,580,188 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 186 | hpp | Net.hpp | #pragma once
#include <enet/enet.h>
namespace Net {
// Calls enet initialization on win32 systems
void netInit();
// Calls enet de-initialization on win32 systems
void netClose();
}
|
027b8652d1a9fd08ea29b540bf0a714c7a35943d | e675455f2e207638445c4cd093a9a4ec971bc047 | /src/algorithm_practice/Datastructure_Algorithms/SLL/mergeTwoSortedLists/ojAns.cpp | 5238d5efce5161ee3bfd11ec644113ced6e60142 | [] | no_license | domfarolino/algorithms | 5e1969f092fc66acdce5f560a35056fdb0adc2e2 | 8120051a7615236bbb473fb95b90fa8589921400 | refs/heads/master | 2023-05-24T05:38:41.326685 | 2023-05-13T16:22:06 | 2023-05-13T16:22:06 | 67,319,532 | 52 | 71 | null | 2023-05-13T16:22:08 | 2016-09-04T01:25:14 | C++ | UTF-8 | C++ | false | false | 1,278 | cpp | ojAns.cpp | // Source: https://leetcode.com/problems/merge-two-sorted-lists/description/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
... |
84271f24d3cc2bc2ba6278499d17dd0445a7e477 | 1d3b0b0d5337adb8335b1a970b0c34924b8baf96 | /AtCoder/abc/1~30/abc025/B.cpp | 5d21f8931dbb90331bb69d25cc0b0db2e99afd08 | [] | no_license | pyst1g/Programming-Cplus | 6a2bdbbc63935fe7b4ebd00f6c9d13565cb05bcf | 7d2c41075382e606e4c572c3ebd239755f36e72a | refs/heads/master | 2021-05-14T16:14:49.720215 | 2020-01-26T09:53:16 | 2020-01-26T09:53:16 | 116,015,340 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 843 | cpp | B.cpp | // finish date: 2018/01/08
#include <iostream>
#include <cmath>
#include <vector>
#include <bitset>
#include <algorithm>
#include <stack>
#include <limits>
#include <map>
using namespace std;
#define FOR(i, a, b) for(int i=a;i<b;i++)
#define rep(i, n) FOR(i,0,n)
bool isExist(char c, string str) {
rep(i, str.len... |
95c9f592f73d7c9476380a1de8d97f504e111987 | b2580b87161110baa3452d082703aed26e420b31 | /src/main.cpp | 84cccebddb98081d036b24b1e8e040ae1a9553fe | [
"MIT"
] | permissive | onionka/IMS-CAS | e5cba04418fdea96a1a1a61286740588bcb70fc5 | 12a2521be94ee7605e3ce7d846c2cb7cdc6744c0 | refs/heads/master | 2021-05-30T13:24:20.115419 | 2015-12-07T19:13:29 | 2015-12-07T19:15:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,285 | cpp | main.cpp | /**
* @file main.cpp
* @author Miroslav Cibulka
* @created 12/4/15
* @copyright Copyright (c) 2015 XXX
* @detail
*
*/
#include <stdexcept>
#include "state.hh"
#include "cell.hh"
#include "cellular_automata.hh"
#include "bmp.hh"
#include "plot.hh"
#ifndef MAP_SIZE
# define MAP_SIZE 1000
#endif
#ifnd... |
0937033a07bbe7f3a168cf74821bfe99d392b4cb | b2f16656f82ccd347f83c9c902d9dbf21dce4e59 | /Terminal/LogicWrapper/LogicWrapper.cpp | 31cb7dd4185119b9b8885e4581fbb8670b6cd59d | [] | no_license | victor84/AutoHandWash | e3a084fc1ba40b1d2ea1b3490296f989e83dfb7d | d62d6a209d06afa352f60268cecd15a077f148a8 | refs/heads/master | 2021-01-01T19:20:35.845115 | 2015-07-10T15:45:44 | 2015-07-10T15:45:44 | 31,407,033 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 7,048 | cpp | LogicWrapper.cpp | // Главный DLL-файл.
#include "stdafx.h"
#include "LogicWrapper.h"
using namespace System::Collections::Generic;
void LogicWrapper::Logic::OnServiceChangedInner(logic::e_service_name service_id, const wchar_t* service_name)
{
if (nullptr == _on_service_changed)
return;
e_service_id sid = static_ca... |
5ef533563ba0612abc1427aa608894e735be0463 | 811ff0c8389ad4aa5496872227324e6185c5bba1 | /UIs/DesignScriptRunner/LiveRunnerWrapper.h | 7bd5600bc818969f947bab3eaf9b46f461b7afc7 | [
"Apache-2.0"
] | permissive | DynamoDS/designscript-archive | 2c2bb2182f6214a262a56d685168dc8a345616e0 | 2cfafd1299af0ffddacf77c41f51150556e88b80 | refs/heads/master | 2020-04-10T20:12:10.737867 | 2014-02-17T12:24:45 | 2014-02-17T12:24:45 | 11,632,510 | 4 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 1,061 | h | LiveRunnerWrapper.h | #pragma once
#include "WrapperObject.h"
using namespace ProtoScript::Runners;
using namespace GraphToDSCompiler;
class LiveRunnerWrapper : public WrapperObject<LiveRunner, DesignScriptRunner>
{
public:
LiveRunnerWrapper(DesignScriptRunnerCallback* pCallback);
virtual ~LiveRunnerWrapper();
v... |
05aa85ec30b6c9d318abfc8760455c6361cbaa29 | 366e2cdd40f6afef727cf24f71c70e555410fef5 | /dev/pickers/dimensionbasedcenterspicker.h | 0f2e082448901db13cb463b500c0940d0cf8dd97 | [] | no_license | benkopolis/kmeanstriangleclustering | 20a1060040074dfd28125c8b87b2d387e6bf65f5 | 8714d70f1a3e6542d44cfe16e29ce97de64622ff | refs/heads/master | 2020-12-24T13:17:10.643581 | 2017-03-22T20:31:07 | 2017-03-22T20:31:07 | 32,231,248 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,179 | h | dimensionbasedcenterspicker.h | #ifndef DIMENSIONBASEDCENTERSPICKER_H
#define DIMENSIONBASEDCENTERSPICKER_H
#include <map>
#include <unordered_map>
#include <limits>
#include <set>
#include <utility>
#include <iostream>
#include "abstractcenterspicker.h"
#include "commons/abstractpoint.h"
#include "distances/manhattandistance.h"
#include "commons/p... |
1e659bb093aa5d5271d832f466e17697d6470ab8 | 85d76011522140692ca5329547844c42fa857baf | /ReformMediaServer/PushServer.cpp | dd784cc28bc9e1408cef34c24bb8fad33a46df8f | [] | no_license | curious-boy/RMS | 67825e69cb622cfc861628512be08737e03704ce | 0774891ad04d837ea654b656100fa847b59d572b | refs/heads/master | 2020-12-28T20:55:27.002461 | 2015-05-09T08:23:49 | 2015-05-09T08:23:49 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 4,072 | cpp | PushServer.cpp | #include "PushServer.h"
#include <process.h>
bool CPushServer::_isRun = false;
int CPushServer::_port;
SOCKET CPushServer::_bind_socket = INVALID_SOCKET;
fd_set CPushServer::_rfds;
hash_map<SOCKET, int> CPushServer::_ClientList;
hash_map<int, SOCKET> CPushServer::_ReadyList;
BOOL CPushServer::init(int port)
{
_port ... |
d7384a35b2efe274359c1cfd805a20b454f42a95 | 0cce8934cf563b1ae12cfb1e1e610ca725c8cfe9 | /competitive/ep4.cpp | e1dc518cfa5aaa75deee7a3e590ff23d533d746e | [] | no_license | prayasjain/c-c-codes | a7695d394662e7f8dd3eb6fc35317271346a36b4 | d02a964b452c93f69ae0d7d55b2efbd3a61a5c34 | refs/heads/master | 2022-11-24T01:32:36.704602 | 2020-07-23T18:51:15 | 2020-07-23T18:51:15 | 282,031,467 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 991 | cpp | ep4.cpp | #include <iostream>
#include <stdio.h>
#include <math.h>
#include <map>
#include <vector>
#include <stdlib.h>
#include <memory.h>
#include <time.h>
#include <string>
#include <algorithm>
#include <set>
#include <stack>
#include <cassert>
#include <queue>
#include <numeric>
#define slld(x) scanf("%lld",&x... |
df15f4c21065c5c4675e23665ba2370b5e5f5e5c | 31d193b62e025a07aa36805d9459f5553ac4d783 | /OMO_ADUINO_IDE/Point.cpp | 1fd0ce4c6473ae416f2a409c72d5e1c6c8649026 | [] | no_license | omarelkawokgy/Area_Coverage | d76b600f8fcdc2214814eb0b9e7c1a764334f02a | 9f2e1f588a9ca6fe51428bede22a2a9ef1ab0256 | refs/heads/master | 2021-07-06T12:45:29.700513 | 2018-04-16T15:28:19 | 2018-04-16T15:28:19 | 51,238,911 | 1 | 2 | null | 2016-02-07T18:47:00 | 2016-02-07T07:03:06 | C++ | UTF-8 | C++ | false | false | 2,494 | cpp | Point.cpp | #include "OBJD.h"
Point::Point()
{
ClasspointPos.X_Column = 0;
ClasspointPos.Y_Row = 0;
}
Point::Point(PointPos pointpos)
{
ClasspointPos.X_Column = pointpos.X_Column;
ClasspointPos.Y_Row = pointpos.Y_Row;
}
PointPos Point::getPointPos(void)
{
return ClasspointPos;
}
void Point::SetPosition(PointPos pos)
{
Cl... |
f03f97fc1062bc9f0c52843a905e1d9511a85c96 | 7c081d13d66b203b816ee94e0d736d10403a1b13 | /llvm/include/llvm/ExecutionEngine/Orc/Layer.h | fc8c5ade1b1265349e15fd1e80495b26296f491b | [
"NCSA"
] | permissive | jfourie1/llvm-project-20170507 | 84dcd723de76502d4d0f1f0a9df1a31bdc593f36 | d8f895786c16a3b6a90eb9895ac786500bf5370c | refs/heads/master | 2021-04-12T09:47:12.874041 | 2018-05-22T17:38:22 | 2018-05-22T17:38:22 | 126,182,492 | 0 | 0 | null | 2018-03-21T13:24:59 | 2018-03-21T13:24:58 | null | UTF-8 | C++ | false | false | 2,960 | h | Layer.h | //===---------------- Layer.h -- Layer interfaces --------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===--------------------------------------------------------... |
15c7c472f073a8a12d1969516ca70b70a4466ddb | acb1fd7cb61bdd3abeadecd7d2855a8e7c0ccf8f | /rbc_stalker/rbc_stalker/stlkGroup.hpp | af826552b4e927063ace06d6727aae94a8d57470 | [] | no_license | Zealot111/SW_MissionExample | 51a835e5300c5f8dec2b82f360917bf02c85ad71 | d1b12972d2c9700b1ea1c4f583a94252e241c9ab | refs/heads/master | 2021-01-10T14:42:55.915456 | 2015-12-06T18:23:57 | 2015-12-06T18:23:57 | 44,381,228 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 751 | hpp | stlkGroup.hpp | class SW_Stalkers {
name = "Сталкеры";
class Infantry {
name = "Пехота";
class SW_Stalkers_team {
name = "Группа сталкеров";
faction = "SW_Stalkers";
side = 2;
aliveCategory = "Infantry";
class Unit0 {
side = 2;
vehicle = "SW_Stalker_Loner_Leader_F";
rank = "Corporal";
position[] =... |
35f0d34c4f29425f8d06eb805242ec6b2efccd81 | 3fad5a40d5f24e177f73cb0d9fef8252679c3447 | /TapeEquilibrium.cpp | 6070d8efdb761778324188ee27693ec121a4dbda | [] | no_license | tpyda/codility | 180056dfab30c09982924a12cdda6e69daf540a1 | bb7b68042cbe0105addcb60bd791afd3af582c04 | refs/heads/master | 2020-12-31T04:41:45.482809 | 2016-02-02T00:52:28 | 2016-02-02T00:52:28 | 50,883,022 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,114 | cpp | TapeEquilibrium.cpp | // you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <gtest/gtest.h>
using namespace std;
#include <limits>
int solution(vector<int> &A) {
// write your code in C++11 (g++ 4.8.2)
int sumr =... |
9d5b88a23978454ecda64c6fc8470457d3a4e80d | e993fb1a77cf8df900e5da3c2062d5e3047d1940 | /Effective_Modern_Cpp/Item17-autogen_member_functions/default.cc | 6beb9c3eb34d99fcd8476e42983778b9f91cc848 | [] | no_license | activeion/Books_SourceCode | 2dba4e8d988106a902fc4bb7c084bda0c1a42ea3 | 7c6c23d4c22aa0ad3c8f01b0bba962527bdc599e | refs/heads/master | 2021-07-23T14:47:35.489523 | 2021-02-23T12:16:12 | 2021-02-23T12:16:12 | 100,842,985 | 19 | 11 | null | 2021-02-26T02:13:43 | 2017-08-20T06:28:48 | C++ | UTF-8 | C++ | false | false | 3,122 | cc | default.cc | #include <cstdlib>
#include <cstdio>
class MemberClass
{
public:
MemberClass()
{
x_=0;
y_=0; printf("MemberClass: Constructor be called!\n");
}
~MemberClass(){}
MemberClass(const MemberClass& mc)
{
x_=mc.x_;
y_=mc.y_;
... |
dc328d353a4014eb46cc31cf23fe64e9f8ab72a7 | 95adecbd4b7e019132c7d0157bc78e4d5e3fdce4 | /Classes/BasePage.h | 30b08f599b26aec7dadb3f0cded402438ecfeb79 | [] | no_license | onvia/cocos-custom-framework | 11809a6fac21cdcb3ff1efc0d76e7b345d30cfcb | ae28c3a0062ae06ef1dc562e630fcd7e7afb7efd | refs/heads/master | 2021-09-21T18:14:56.044037 | 2018-08-30T09:16:55 | 2018-08-30T09:16:55 | 96,005,185 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 890 | h | BasePage.h | #ifndef __BasePage_H__
#define __BasePage_H__
#include "PublicCoco.h"
#include "Finder.h"
class BaseDialog;
class BasePage : public Layout, public FinderAdapter
{
public:
BasePage();
~BasePage();
static BasePage* create(const std::string& filename);
static BasePage* create(Node* node);
virtual bool init(const ... |
1f7b2725b329f03045cb5d6a98642f5887e91a49 | b93288a88bafe8e178386ebfee7a79c0f817a05d | /STL containers/stl.stack.cpp | d0ca98cd33b4b2cb9a2f9cdab2c11adcef9c38c9 | [] | no_license | AshutoshLembhe/Object-Oriented-Programming-in-CPP | 96e776b51b7a3b68cda3d53dfcdf6cab8a5237d1 | 75de6dc1f2211eaddfea928f8fbb69efeb8eafe2 | refs/heads/master | 2022-11-21T03:31:42.169028 | 2020-07-28T09:54:03 | 2020-07-28T09:54:03 | 262,872,099 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 250 | cpp | stl.stack.cpp | #include<iostream>
using namespace std;
int main()
{
stack<int> st;
st.push_back(1);
st.push_back(2);
st.push_back(3);
st.push_back(4);
cout<<st.top()<<endl;
st.pop();
cout<<st.top<<endl;
st.pop();
cout<<st.size()<<endl;
}
|
a9f2d6780b37809cf5e694bc898e484600ec9fb9 | 7729d3ad5795abbf6b57cae04249e5e99f6b3b09 | /tcp/TcpFram/main.cpp | a53d4966f6ef9fa256729814c7786887717a5d2f | [] | no_license | ban771349788/Qt-demo | d5878d6f034294d365f6ae19d349f21bcc505ade | b429edcd012d5ab301b942d4eb2a98a4ac8d377f | refs/heads/main | 2023-02-01T18:24:23.818992 | 2020-12-08T08:02:21 | 2020-12-08T08:02:21 | 319,493,264 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 264 | cpp | main.cpp | #include "tcpwidget.h"
#include "socketform.h"
#include <QApplication>
int main(int argc, char *argv[])
{
QApplication a(argc, argv);
TcpWidget w;
w.show();
SocketForm w2;
w2.show();
SocketForm w3;
w3.show();
return a.exec();
}
|
6d9c39a5c557d629fc3f144b7a65ee1bb2549bcd | 46c417bd246c9802d071a86a7f2147d6c111ae74 | /l_multicast.cpp | 67b433aaec60014c895ec204ad9a1b116614f508 | [] | no_license | linuslin/CPP_Thread | 3187a50d4c23e9e0d7d86f3b4a6c8466fc4dd74c | 8cd2d710bdcaedbada98bedcb394d718e333e00c | refs/heads/master | 2021-01-22T20:49:13.064780 | 2017-04-26T23:46:54 | 2017-04-26T23:46:54 | 85,362,393 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,190 | cpp | l_multicast.cpp | #include "l_multicast.h"
#include "l_multicast_util.h"
#include <string>
#include <iostream>
//tmp
#include "bmpheader.h"
//
L_Multicast::L_Multicast(L_M_Queue<L_Message*>& queue,std::string name,char * group, int port):m_queue(queue),m_name(name),m_group(group),m_port(port){}
void L_Multicast::setupConnection(ch... |
78e0de7431e945d9c2d16916fa57e3ea7ef44685 | f46c34e9632aa3b3234d0bfa725fa954dcf553ad | /scratch.cpp | 0fe9129d50fd1de053002670d96c46e5f538d002 | [] | no_license | BYUCS235/BST-Lab | 45eb49efcb1a8c2ce0464dea47b92dadcde6961e | 856de3772760077cd327e9a0023b7aa4ce359cf8 | refs/heads/master | 2023-04-07T01:18:54.682135 | 2023-03-16T17:59:17 | 2023-03-16T17:59:17 | 115,233,418 | 0 | 18 | null | 2023-03-15T16:44:29 | 2017-12-24T01:55:08 | C++ | UTF-8 | C++ | false | false | 416 | cpp | scratch.cpp | #include <iostream>
#include "BST.h"
#include "printing.h"
int main(int argc, char *argv[]) {
// Write your test code here. Remember that `printing.h` gives you access to
// the functions `pretty_print_tree` and `ugly_print_tree`, which you can
// use to print a representation of your tree like so... |
ccb8ad189909b148519ab5d31b1e87fb813d0a2e | 69047ea11b9fa5e72328c0ba96e3044b270309dc | /jni/SDL2/build/org.libsdl.arkanoid/jni/src/scoresysytem.cpp | 312feed162dcfc5adbc4881183c6f7d4ffe9cd03 | [
"Zlib"
] | permissive | dixtel/arakanoid_android | bb22740f4700ea179af4500e10edcc5a1124eed0 | e38486f51d7e2258a2e66cb2e4fd26eed8da9517 | refs/heads/master | 2021-01-15T08:53:21.984846 | 2017-08-12T13:04:19 | 2017-08-12T13:04:19 | 99,568,902 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,939 | cpp | scoresysytem.cpp | #include "include/scoresysytem.h"
int ToInt(std::string str) {
int num;
std::istringstream stream(str);
stream >> num;
return num;
}
ScoreSystem::ScoreSystem() {
bestScore = 0;
currentScore = 0;
}
ScoreSystem::~ScoreSystem() {
if (!SaveBestScore()) {
std::cout << "Error: ... |
14e822dc3953ac965771100c188d7783411961fa | 65ce464a6361d2d4096ee8d0d97bca76c8025a5e | /P3_Networked_Spell_Checker/client/src/Client.cpp | e18559cd87145f711fb3652a597b397dca28527f | [] | no_license | tuh37046/CIS3207 | 857a7aa85ab62cba75481bb31b951e3862799d0c | e98219c47930eae59dc7775ae1ef81dd89087752 | refs/heads/master | 2020-07-20T08:45:02.680671 | 2019-12-09T05:46:30 | 2019-12-09T05:46:30 | 206,610,915 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,525 | cpp | Client.cpp | #include <iostream>
#include <unistd.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/socket.h>
#include <stdlib.h>
#include <netinet/in.h>
#include <string.h>
#include <netdb.h>
#include <random>
#include <chrono>
#include <thread>
#include <queue>
#include <vector>
#include <pthread.h>
#include <mu... |
d1e10f6c1bbc165f4f8d22a2db03f01e52d74c9c | 3e644fa536a60c449ed44c674ec437c10d4e74bf | /KristalliProtocolModule/KristalliProtocolModuleEvents.h | e5e757a7524068aa3074737ef2d6571dd66786a2 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | jarmovh/naali | 3a29a2baff715637a0986ed56d3f6e433772f9e2 | bcbd92499cdbb6e891774a4694a150bf06499e22 | refs/heads/master | 2021-01-09T05:40:50.550403 | 2011-08-12T05:42:22 | 2011-08-12T05:42:22 | 1,462,841 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,354 | h | KristalliProtocolModuleEvents.h | // For conditions of distribution and use, see copyright notice in license.txt
#pragma once
#include "IEventData.h"
namespace kNet
{
class MessageConnection;
typedef unsigned long message_id_t;
}
namespace KristalliProtocol
{
namespace Events
{
// This event is posted whenever a new inbound network message is ... |
8d3ae173b2405367ec074b73e0fcbd8dca5fa680 | ceca10c49f709958535004770d1688f0ee04988a | /NRPS library/lib/nrpsdesigner/domains/domaintypet.cpp | 1839cebeff749a5ade68fca237f0535d8fb57e71 | [] | no_license | igemsoftware/Heidelberg_2013 | 13c20de982b51606367ee69f1ba71e957e2dfb87 | 85e4966d7ebf04173ae3db8d72f5b122d9a2475e | refs/heads/master | 2020-04-04T09:00:38.005070 | 2013-10-28T15:26:45 | 2013-10-28T15:26:45 | 12,770,105 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 673 | cpp | domaintypet.cpp | #include "domaintypet.h"
#define POSITION_NODE "position"
using namespace nrps;
DomainTypeT::DomainTypeT(uint32_t id)
: Domain(DomainType::T, id)
{}
DomainTypeT::DomainTypeT(uint32_t id, DomainTPosition pos)
: Domain(DomainType::T, id), m_position(pos)
{}
DomainTypeT::~DomainTypeT()
{}
DomainTPosition DomainTypeT... |
dccff626bc5ea94ff00c5e550888136ce80389ea | 89681bd752c14344221da488724f422ee3cca516 | /PA2/hull/hull_new.cpp | 6d8c6c30db0710b92908aa66e84cc046e3dfecca | [] | no_license | lyh983012/DSA2018-THU | 81ff1e8e045baf23ec0b9c0db5a5664583f94a2f | 48cd7add71a16b9da93f566dfceca855e873161a | refs/heads/master | 2020-04-02T13:35:16.483141 | 2018-12-19T13:25:12 | 2018-12-19T13:25:12 | 154,487,507 | 0 | 2 | null | 2020-04-18T12:49:55 | 2018-10-24T11:12:20 | C++ | UTF-8 | C++ | false | false | 3,219 | cpp | hull_new.cpp | #include<iostream>
using namespace std;
#define pass(x1,y4,x2,y2,x3,y3) (((x2)-(x1))*((y3)-(y2))-((x3)-(x2))*((y2)-(y4))>(0) || ((x1)==(x3) && (y3)==(y4)) )
int main(){
/*
测试自己的二进制数据文件
int testData[]={11,1,6,1,0,4,11,5,5,7,11,7,0,7,7,8,1,8,12,9,3,10,6};
FILE* fp = fopen("test.in", "wb");
for(int i=0;i<25;i++){
fwri... |
87b0316e11612478b400ea2591db5c175dc52f7c | 1a69b230bf59c4cc6cf604dfe8153fb5d179eb81 | /entrenos/rohspc2/B.cpp | 6e9401ca04c29249b9e94c47c28ae1ab8d19e7ae | [] | no_license | FelixMorenoPenarrubia/CompetitiveProgramming | 36de722b5512ba975d9db9e939df2f155092d276 | d459ce5683ad464c34b3a8d0bc0b77557ccfdc24 | refs/heads/master | 2023-03-14T13:35:43.938876 | 2021-03-04T17:01:36 | 2021-03-04T17:01:36 | 344,264,136 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,814 | cpp | B.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
ld K= 1.3492;
struct point {
ld x, y;
point() {
}
point(ld _x, ld _y) {
x = _x;
y = _y;
}
};
point operator-(point a, point b) {
return point(a.x-b.x, ... |
e8ac7ff71cc6e549e8949afb565a05f2508c1e45 | bef04e5146b264b88786216d09dff0c8d20e2cc7 | /Firmware/Example2-20MinuteTest/Example2-20MinuteTest.ino | 2f22b3d10addf4ae69c5b13b9829dc19fb57133f | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | sparkfunX/Qwiic_Air_Quality_Combo_Board-CCS811-BME280 | b55f916a29b4b6902f473d40077ce307cc234888 | d0caa331562d7d179b13e8da8be39c4d7bc1d355 | refs/heads/master | 2021-01-19T18:14:23.299631 | 2017-04-06T22:46:21 | 2017-04-06T22:46:21 | 82,707,255 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,162 | ino | Example2-20MinuteTest.ino | /*
CCS811 Air Quality Sensor Example Code
By: Nathan Seidle
SparkFun Electronics
Date: February 7th, 2017
License: This code is public domain but you buy me a beer if you use this and we meet someday (Beerware license).
Works with SparkFun CCS811 board https://www.sparkfun.com/products/14181
Or Combo boa... |
fa6e643aa20f5ffa39b947ce4bfff9ef6ff9f599 | e5d4aafc228130ee89304cea390bbb45f5018fa1 | /组合数/习题/满足条件的01序列.cpp | f294ef6c9ef40c09ced0bff4021e3db0b534a7b1 | [
"MIT"
] | permissive | LauZyHou/AlgorithmTemplate | 2ec2efbba6fcd5e42292da0a0aa9aed6103019e3 | 42bc9385a028508301d3f0e4a58adc4f510ffaf6 | refs/heads/master | 2023-01-05T22:56:25.825032 | 2020-11-09T10:59:10 | 2020-11-09T10:59:10 | 297,931,438 | 6 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,474 | cpp | 满足条件的01序列.cpp | #include <iostream>
using namespace std;
// https://www.acwing.com/problem/content/891/
// 画张坐标系，从原点开始，0表示向右走，1表示向上走
// 从而可以转换成到(n,n)的路径问题
// 要求的就是y=x这根线及其下面的到(n,n)路径总数
// 也就是严格不能接触y=x+1这根线的路径总数
// 从(0,0)走到(n,n)，路径总数是C_{2n}^n
// 只要再减去接触y=x+1这根线的路径数
// 只要接触了y=x+1，就从这个点开始把后面的路径对于y=x+1做轴对称
// 这样路径就一定到达(n-1,n+1)这个点
//... |
5d457710e952f399e05d28006d3a898554aaf7ec | 0170ec1923ad9f830bfa7c4d89d96577e141198c | /watopoly/GooseNesting.cc | 98c317c2ca7ead4b0150d3fb054f92da294a134b | [] | no_license | StidZhang/Watopoly | 2811a465ffb48b24679990ca724f22c5451033fb | 9c9e5ff3a38871103aa381cd4f7cda6a65b1471c | refs/heads/master | 2021-01-11T20:47:01.214339 | 2017-01-17T03:32:15 | 2017-01-17T03:32:15 | 79,183,514 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 450 | cc | GooseNesting.cc | #include "Nonproperty.h"
#include "GooseNesting.h"
#include "Player.h"
#include <iostream>
#include <string>
using namespace std;
GooseNesting::GooseNesting(std::string name, int cellIndex, GameBoard *g)
:Nonproperty{name, cellIndex, g}{}
GooseNesting::~GooseNesting() {}
void GooseNesting::doEvent(Player... |
1b3df93873036337c9d83f7629984be979c95feb | 7b8ea628726c77532fc07d9a3c3c325aac388bee | /Labs Estructuras/Lab13/Codigo/PQSorted.cpp | e90443dc45424c0b7db100a8f6e27a36a6ca5204 | [] | no_license | dvarasm/Laboratorios-Estructuras-de-datos | c4ca0c11337b979f7ec6814e1be45546dd727242 | c33753316b532f77c3eb7f544c845b7141eb0478 | refs/heads/master | 2020-03-28T07:13:46.898986 | 2018-09-08T00:55:51 | 2018-09-08T00:55:51 | 147,888,388 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,045 | cpp | PQSorted.cpp | #include "PQSorted.h"
#include <iostream>
#include <cstdlib>
using namespace std;
PQSorted::PQSorted(){
num =10;
a = (int *)malloc(num*sizeof(int));
index=0;
count=0;
}
bool PQSorted::empty(){
if(count==0)return true;
else return false;
}
int PQSorted::size(){
return count;
}
int PQSorted::top(){
return a[0]... |
6dcdfb908c9a144e62b062599b59939360c108bf | cd5413e60ccd241eddbcb88d5502b5a62bad4191 | /Examples/Qiniu/QiniuPic/v2/v2/MainWindow.h | 66956c96b4cf5d7fef534af0eaaa15841eb02ce9 | [] | no_license | PikachuHy/Oak-Pokemon-Research-Lab | 51e00e9c184058fe0d856faf4e8fe62e089d2a6e | 9b13e5bddac6cd30ae1726b12e6ab61b7d74faf1 | refs/heads/master | 2023-05-11T17:55:35.558012 | 2023-05-02T07:31:40 | 2023-05-02T07:31:40 | 138,909,225 | 13 | 6 | null | 2021-04-26T18:50:40 | 2018-06-27T16:54:22 | C++ | UTF-8 | C++ | false | false | 560 | h | MainWindow.h | #pragma once
#include <QtWidgets/QMainWindow>
#include "ui_MainWindow.h"
namespace Ui {
class MainWindow;
}
class Side;
class SystemTray;
class Setting;
class PicUpload;
class QStackedLayout;
class QiniuSetting;
class MainWindow : public QMainWindow
{
private:
Q_OBJECT
public:
MainWindow(QWidget *parent = Q_NULLP... |
f7b6e47421837864ba48aaaeea99736da18ec6a3 | c26c92d1d8eec93c597d5b161698128ff09ec1f8 | /svo_install_ws/install/include/svo/common/imu_calibration.h | 81d526cdb7edf50e130967c84e8451911e1a30f6 | [] | no_license | pi-gslam/gslam_svo2 | 678c4336bb2c4b98d78f00856ab529e1b7b152e2 | 1ee134afada8a31e5df6a0a58b6688455a0499fb | refs/heads/master | 2020-08-11T12:04:31.309113 | 2019-10-12T02:16:13 | 2019-10-12T02:16:13 | 214,561,879 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,101 | h | imu_calibration.h | #pragma once
#include <deque>
#include <iostream>
#include <svo/common/types.h>
namespace svo {
/// \brief Settings for the IMU statistics
/// Check the following references for more information about the IMU parameters:
/// * https://github.com/ethz-asl/kalibr/wiki/IMU-Noise-Model-and-Intrinsics
/// * http://www-us... |
f9d19764daf56265fd715a44a2784aed86ace712 | 573694b142f7b6bee32866d14957275f4e9417be | /mi/test/test-ok-condition-vars-elf.cpp | e78b84d047ee1ee2dc99e6aa49052f46e8cf5d2c | [] | no_license | SergeySatskiy/mi-analyzer | eb8385369b2cee22d7265b73deab948349a0a2e3 | e78a3b487402936436ab320e1f92f466496a9946 | refs/heads/master | 2016-09-06T21:16:04.697130 | 2012-08-27T19:58:46 | 2012-08-27T19:58:46 | 32,541,383 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,440 | cpp | test-ok-condition-vars-elf.cpp | //
// File: test-ok-condition-vars-elf.cpp
//
// Author: Sergey Satskiy, copyright (c) 2009
//
// Date: January 24, 2010
//
// $Id$
//
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" withou... |
2cb42c908b90cf5c09068958edc5c8ee950ab1cc | 1b02aa884af5021cf7b643189f3b2a0e79bab035 | /TeachingAssistant/StudentModel.h | 090ee21790b0d371abc5c71612f8ba6b7aa9dd59 | [] | no_license | bachns/TeachingAssistant | 6745d40455e2144f2cecafaeeb20bf4586a6cb93 | 3b6ee6a57b9cbe7fc2f9f43da618c8ef36101ff8 | refs/heads/master | 2020-07-31T20:16:22.755447 | 2019-09-25T02:43:27 | 2019-09-25T02:43:27 | 210,741,670 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,208 | h | StudentModel.h | /********************************************************************************
* Copyright (C) 2019 by Bach Nguyen Sy *
* Unauthorized copying of this file via any medium is strictly prohibited *
* ... |
d7a1f855c46f1ba70fe28d598a9ffc150c140b66 | ed2a818203bf140ebe9a04d4e3559f1cece1d31d | /cpp_series/cf_for_loops.cpp | 0ad327015c5e74b9d113868ab52138527fabbb2e | [] | no_license | olszewskip/coffee_before_arch | cc5c614aedaf77706a4512ff573d9baa1d5e13a5 | 41aba7615bfa3c7c7a270cc9c6d039d40b269e32 | refs/heads/master | 2020-05-04T17:37:31.925002 | 2019-04-11T19:28:45 | 2019-04-11T19:28:45 | 179,319,033 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 272 | cpp | cf_for_loops.cpp | #include <iostream>
using namespace std;
int main() {
int multiplicand = 5;
int multiplier = 10;
int product = 0;
cout << "before" << endl;
for (int i = 0; i < multiplier; i++) {
product += multiplicand;
cout << i << " " << product << endl;
}
return 0;
}
|
440fd142ca3a723950bffcdab211702ff5512b29 | 720098f107c1f59ea90024347e233c696ee33ce1 | /rv.cpp | fb2c9fe8c4e46f0e23fc4a3eabcd934f5999a4b7 | [] | no_license | joker9357/performance-of-computer | 0af957ce666699ce626e636381c0dee5215e71a9 | ab5d6768deb28242ab6afb6e9a469e26755fdb66 | refs/heads/master | 2021-01-09T05:34:59.302700 | 2017-02-03T03:33:00 | 2017-02-03T03:33:00 | 80,793,806 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 871 | cpp | rv.cpp | //
// This file contains programs for generating random numbers with
// uniform distributions and exponential distributions.
//
#include <math.h>
#include <iostream>
double Seed = 1111.0;
/*******************************************/
/* returns a uniform (0,1) random variable */
/************************************... |
129151739b45834209fafd237907cdd4ad6d804d | df76a804422288ef6bac9670bf0c2d4523e7229c | /contractmgmt/controller.h | b864b89239b9219c61929561e12e0d919b3ef9f0 | [
"Apache-2.0"
] | permissive | lijunjun/controller | 1667e395e2bc77a95d92c31a62b3ec85dd305a43 | e81fafd693c5af03ddeafd989622e75aa5e107b6 | refs/heads/master | 2016-09-05T19:46:27.839161 | 2014-07-31T10:49:21 | 2014-07-31T10:49:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 230 | h | controller.h |
#ifndef CONTROLLER_H
#define CONTROLLER_H
#include <iostream>
#include <string>
#define CONSOLE_WAIT(iEndString) \
std::string lEnd; \
while (true) \
{ \
std::cin >> lEnd; \
if (lEnd == iEndString) break; \
}
#endif
|
ca600d09aa6d5acd0b7b48a7e9596ef16b566a09 | 191642346aea40bbd387842e62e001140355ef37 | /uri1257.cpp | 4500d2ff6b8a4d72bc2af63fdcef1301052800bf | [] | no_license | yurifarod/UVA-URI | 00ca0c4d73e7519e3c1f040c616cd750489c3659 | a2f574695dfbd681efcf405141c02e1d09464f68 | refs/heads/master | 2023-01-11T04:24:27.420261 | 2023-01-08T22:39:26 | 2023-01-08T22:39:26 | 71,098,135 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 407 | cpp | uri1257.cpp | #include <stdio.h>
#include<string.h>
using namespace std;
int main(){
int n, l, vl;
char p[50];
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d", &l);
for(int j = 0; j < l; j++){
scanf("%s", &p);
int length = strlen(p);
for(int k = 0; k < length; k++){
vl += (int)p[... |
f33439c22a2e49f1e28baeeb8c9d700bdd9d1d4e | 7d5593b9bbaf6bb8eaacca88449d90c9c305c36e | /problems/103-binary-tree-zigzag-level-order-traversal/103.cc | 364e3200b48431158b4ee6802867e7cb79557c99 | [] | no_license | yottacto/leetcode | fc98052ed9d643be8a79116d28540596bcc7c26b | 9a41e41c0982c1a313803d1d8288d086fbdbd5b6 | refs/heads/master | 2021-04-25T12:05:55.671066 | 2019-12-15T03:07:31 | 2019-12-15T03:07:31 | 111,814,868 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 34 | cc | 103.cc | #include "103.hh"
int main()
{
}
|
b50c8b7d3ba649132522b59d1eaba76ca871a42e | 29b2d2f8f375035260c4f8cfb7de9ba78bcceb22 | /sd.h | 1ca272ce59eb07ab90af8dc83af9529c2ec5c0c5 | [] | no_license | tomtompurin/CanSat2019 | 51180db86826240ffb061cf40abe59eedb41a0fe | 88c1f68e99944d7ee2d69f1027dbb13da753ea39 | refs/heads/master | 2021-06-10T23:23:49.038888 | 2021-05-13T05:58:41 | 2021-05-13T05:58:41 | 181,634,072 | 0 | 0 | null | 2021-05-13T03:29:45 | 2019-04-16T07:05:35 | C++ | UTF-8 | C++ | false | false | 429 | h | sd.h | /**
@file sd.h
@author Tomiyoshi Yuta
@date Created: 20180531
*/
#ifndef _SD_H_
#define _SD_H_
//#include <stdio.h>
#include "constant.h"
#include <string.h>
#include <Arduino.h>
#include <SD.h>
#include <SPI.h>
class Sd {
public:
// 関数
Sd();
~Sd();
void setupSd(); // setup
void printSd(String log_... |
ba847fd7f48e220ab44b856f04dbd490fc23b543 | 4c8702112054c9a2db2f85d540c5bff9e33237e8 | /cplusplus_version/N-Queens II.cpp | 922143a5fd462c14c7f01e54065251cc8a5c8417 | [] | no_license | wjk20120522/leetcode | dba48fc90ca113cb0ee1e821fecff86941c160c0 | 2659a0ae08331e48f134318fa1eebade5e7ada4a | refs/heads/master | 2016-09-05T18:24:05.695657 | 2015-10-05T02:14:30 | 2015-10-05T02:14:30 | 18,658,115 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 860 | cpp | N-Queens II.cpp | class Solution {
int *place;
int sp;
int count;
public:
int totalNQueens(int n) {
place = new int[n];
sp = 0;
count = 0;
queens(0, 0, n);
return count;
}
void push(int x)
{
place[sp] = x;
sp++;
}
int pop()//出栈
{
return place[--sp];
}
int judge(int ... |
7cda8d9ae38db4ae34e2d0cdecf8e6eb6debd5c0 | d7b15fb6c1238b3fe9d120624c87927e3b45e1cb | /uHunt/UVA 11002 - TowardsZero/TowardsZero.cpp | d9e45dc5fdbd21fc5d8b66766f838cdf238120be | [] | no_license | maxyuan6717/Competitive_Programming | ade652a76ae89ac38e354cb688d9730a731039e4 | d799d8b5a8915fea7d68d8dbaf742f72d065e4a9 | refs/heads/master | 2022-12-08T04:08:03.647310 | 2020-08-25T20:46:15 | 2020-08-25T20:46:15 | 290,319,070 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,430 | cpp | TowardsZero.cpp | #include <iostream>
#include <cstdio>
#include <sstream>
#include <fstream>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>
#include <iomanip>
#include <climi... |
f7cfd22d0f2425a449127b0b83b8041311f5dd49 | 9602e36990888087b0d3405218e5b0a850c00315 | /project/src/galois/src/carryless_multiplier_galois.cpp | 75fbcdadec74150460563bf619a5a71b8cbcbc89 | [
"MIT"
] | permissive | fafianie/multiway_cut | e6360f3e48f4ac6b666cae0b135e638fe76e06d6 | 52355c9a754287545c060b3ae97b4e11aacd0bfb | refs/heads/master | 2021-06-02T13:20:55.710095 | 2020-08-15T15:40:14 | 2020-08-15T15:40:14 | 133,058,079 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,033 | cpp | carryless_multiplier_galois.cpp | #include "stdafx.h"
#include "carryless_multiplier_galois.h"
#include "powers.cpp"
CarrylessMultiplierGalois::CarrylessMultiplierGalois() : Galois(64) {}
CarrylessMultiplierGalois::~CarrylessMultiplierGalois() {}
uint64_t CarrylessMultiplierGalois::divide(uint64_t leftOperand, uint64_t rightOperand) {
if (... |
42326362282c7776fd66067c58635f54d797ef74 | 9a5660497e08e9fe09268fb50989674db32adbfc | /OpenGL_Rodrigo_Costa_52718/OpenGL_Rodrigo_Costa_52718/Rodrigo_52718.cpp | 7eeb2efafb7c28f16c0258395ce9538341fabf9f | [] | no_license | svork/OpenGL | af8d935fde5da86c77497a59e5fe38ca17592a5c | 841be01cba60fce2046efa1c4657a6ccc97ab5b7 | refs/heads/master | 2021-01-25T07:01:16.930644 | 2017-06-13T23:03:50 | 2017-06-13T23:03:50 | 93,639,871 | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 7,450 | cpp | Rodrigo_52718.cpp | #include <glut.h>
GLfloat angle, fAspect, win;
GLfloat angulo = 15.0f; // Angulo de Rotacao
GLfloat posX = 0.0f, posY = 0.0f;
// Função callback para fazer o desenho
void Desenha(void) {
glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
// Assento do banco
glPushMatrix(); // Inicio do objeto
gl... |
e66fd5c7cce439b7fe0f1e900143be6c916d2048 | ce109b9240b838523c0854c0fabcf59d396cf4b9 | /Test.ino | 50304ddc268815e7af0935104d2ef6dace7cf748 | [] | no_license | Namlitruong/Design-3A | bb982d6cbc560f2b17b596ea83eff054f20d2d8c | f8501e26bf68ff8de60a3c3c27c0bea4c628d456 | refs/heads/master | 2020-03-13T00:41:19.509177 | 2019-07-06T14:42:31 | 2019-07-06T14:42:31 | 130,891,421 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,838 | ino | Test.ino | #include <Arduino.h>
#include <avr/io.h>
#include <SPI.h>
#include <MFRC522.h>
#include <WiFiEsp.h>
#include <WiFiEspClient.h>
#include <WiFiEspServer.h>
#include <PubSubClient.h>
#include <SoftwareSerial.h>
//###################################################################
//WIFI configuration
SoftwareSerial esp(A... |
8c219d7e7cee6e7b85fec9110479a988ed58e166 | 4b19135464a032c1d5271cd1ae58afb21df38584 | /Samples/C++/DirectShow/VMR9/MultiVMR9/GamePlayer/GamePlayer.cpp | 207505b2c463eb7ac168dc3350ab94c44af8bbc3 | [] | no_license | sjk7/DX90SDK | f47cebbba53133923880004bc6e3a33cff1fe895 | dd155425badb2cd3993c27f869efc007764e599b | refs/heads/master | 2021-08-26T07:47:03.826451 | 2021-08-12T05:03:03 | 2021-08-12T05:03:03 | 253,911,891 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 15,012 | cpp | GamePlayer.cpp | //------------------------------------------------------------------------------
// File: GamePlayer.cpp
//
// Desc: DirectShow sample code - MultiVMR9 GamePlayer
// Defines the class behaviors for the application
//
// Copyright (c) Microsoft Corporation. All rights reserved.
//--------------------------------... |
72c2bffd7167424fc4c8b320abc70a2a836d41ec | 83238ef961922b5200834d3c3368921bff7cba61 | /Week 4/Maximal Square.cpp | 37fed5ec317bb4e73daf312d92af3a999bfdfaa0 | [] | no_license | saidrishya/30-Days-Leetcode-Challenge | 76c809f506ae2297e7cfb765606cdedc286374c3 | 2c08a18036cef850ff27e6b406eb59a81cc372dc | refs/heads/master | 2023-01-06T00:14:29.396191 | 2020-11-02T02:06:46 | 2020-11-02T02:06:46 | 260,265,182 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 679 | cpp | Maximal Square.cpp | class Solution {
public:
int maximalSquare(vector<vector<char>>& matrix) {
int row = matrix.size();
if(row == 0 || matrix[0].empty()) return 0;
int col = matrix[0].size();
vector<vector<int>> dp(row, vector<int>(col));
int ans=0;
for(int i=0; i<row; i++){
... |
29c9ebe17ce851d97ebb1cab24e9dd199ac3f2b5 | a3d6556180e74af7b555f8d47d3fea55b94bcbda | /components/media_router/common/pref_names.cc | 1d2b1bfd505ae803b655b84aa75714360ae23ed7 | [
"BSD-3-Clause"
] | permissive | chromium/chromium | aaa9eda10115b50b0616d2f1aed5ef35d1d779d6 | a401d6cf4f7bf0e2d2e964c512ebb923c3d8832c | refs/heads/main | 2023-08-24T00:35:12.585945 | 2023-08-23T22:01:11 | 2023-08-23T22:01:11 | 120,360,765 | 17,408 | 7,102 | BSD-3-Clause | 2023-09-10T23:44:27 | 2018-02-05T20:55:32 | null | UTF-8 | C++ | false | false | 1,111 | cc | pref_names.cc | // Copyright 2020 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/media_router/common/pref_names.h"
namespace media_router {
namespace prefs {
// Whether the enterprise policy allows Cast devices on all IPs.
const char ... |
f4ef81332b5fb6dd460e44dfbc1981bf094fccc0 | 6f78b867ba12798230f896a16a85ee432e4fb963 | /HW/firmware/_2-TMP/_2-TMP.ino | 0e05c6225a497274321a2e1451fde01297647a77 | [] | no_license | JTrillo/TFG | 0f71fbb87af9dd384c4482088a4ceec523d5df7b | 93aa60e96229efc7f260f361e211ab00c8ffdf0f | refs/heads/master | 2020-12-03T17:59:20.862441 | 2020-01-02T20:55:52 | 2020-01-02T20:55:52 | 231,420,273 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,644 | ino | _2-TMP.ino | #include <LiquidCrystal.h>
#define RS 12
#define E 11
#define D4 2
#define D5 3
#define D6 4
#define D7 5
#define S_TEMP A0
unsigned curr_ms;
LiquidCrystal lcd(RS,E,D4,D5,D6,D7);
struct Sensor {
byte pin;
unsigned long periodo_ms;
unsigned long last_ms;
float valor;
int cont;
float suma;
};
void setup_senso... |
8b0b85088a4f2a12bd7810027cd4219b5c7932aa | b7a3e07cd399fc608951bcd2c2438272d926ae33 | /第k轮选择排序.cpp | 21397c9ec182b27fde6f590edd76dff732428cff | [] | no_license | JackYifan/Learning-Code | 327840389f3b48fce10009c247acb2a2e34e321f | c2a994014018b89b1b30262dd3681cbe67b915c1 | refs/heads/main | 2022-12-19T21:26:42.173148 | 2020-10-05T14:12:19 | 2020-10-05T14:12:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 465 | cpp | 第k轮选择排序.cpp | #include<stdio.h>
int main()
{
int n,k;
scanf("%d %d",&n,&k);
int a[100];
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(int i=0;i<k+1;i++)
{
int index=i;
for(int j=i+1;j<n;j++)
{
if(a[j]<a[index]) index=j;
}
int temp=a[i];
... |
5a605c4a4cd07e2697c0b2708bad81e51e8e704d | b5d7e814aac471eeabc6a0d23c74e5154e793f93 | /C++/C++视频课程练习/常对象成员和常对象函数/常对象成员和常对象函数/Line.h | ce2e4969ebbfcbde779606252c1da512ab29aec2 | [] | no_license | SelmerZhang/Code | b4064758c141c0c9db112b97a55986f52fac998a | 84fb3245f12177e7294523dfea2938933ae9e813 | refs/heads/master | 2022-11-17T00:04:55.380889 | 2018-06-09T12:07:47 | 2018-06-09T12:07:47 | 138,289,233 | 0 | 1 | null | 2022-11-04T14:54:45 | 2018-06-22T10:23:03 | Python | UTF-8 | C++ | false | false | 222 | h | Line.h | #include"Coordinate.h"
class Line
{
public:
Line(int x1,int y1,int x2,int y2);
~Line();
void setA(int x, int y);
void setB(int x, int y);
void printInfo();
private:
Coordinate *m_coorA;
Coordinate *m_coorB;
};
|
709bc06996e430acd216867479a192b88e1056d9 | 972a33289ceb2591b663e5e322481e482ecfb80a | /Pong/src/Utilities/ShaderBuilder.cpp | ce99c3828a166182cb46e5f01fac8f9b78071fbb | [] | no_license | AlessandroRavaglia6/PongSolo | 7457bcf13bf5712745778cc99307b5fe137e3b64 | 393f1a5f1d2b689bffc24a15128aab2710acb742 | refs/heads/master | 2023-06-24T18:01:08.977343 | 2023-06-17T11:42:22 | 2023-06-17T11:42:22 | 284,456,857 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,177 | cpp | ShaderBuilder.cpp | #include "ShaderBuilder.h"
#include "../PreprocessorSettings.h"
#include "FileReader.h"
#include <vector>
ShaderBuilder::ShaderBuilder() : _shaderType(0), _shaderSourceCode(nullptr), _sourceCode(nullptr), _numLines(0) {}
ShaderBuilder& ShaderBuilder::AddShaderType(ShaderType shaderType)
{
_shaderType = shaderTyp... |
ab83482c7477c8e01cf933ea01a599ab3b9519df | 3c8cf4de6c08e21b2c10094ef20488e93d7a34be | /TktkGameProcessDxlibAppendLib/TktkAppendDxlib2DComponentLib/inc/TktkAppendDxlib2DComponent/Graphics/Figure/Polygon2DDrawer.h | 39a4efd16eaf30b2cc0f5c25980d8a330a00b917 | [] | no_license | tktk2104/TktkLib | 07762028c8a3a7378d7e82be8f1ed8c6a0cdc97c | 2af549bfb8448ace9f9fee6c2225ea7d2e6329b8 | refs/heads/master | 2022-11-30T12:26:33.290941 | 2020-08-11T17:50:14 | 2020-08-11T17:50:14 | 213,307,835 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 3,191 | h | Polygon2DDrawer.h | #ifndef POLYGON_2D_DRAWER_H_
#define POLYGON_2D_DRAWER_H_
#include <vector>
#include <TktkMath/Color.h>
#include <TktkMath/Vector2.h>
#include <TktkClassFuncProcessor/ProcessingClass/CfpPtr.h>
#include <TktkComponentFramework/Component/ComponentBase.h>
#include <TktkAppend2DComponent/Transform2D.h>
#include "../../../... |
4695cf8e165e621a86e551360b810cfc69df2ea6 | 5063e835b777523f6f92b290b5179198244b0c2b | /3 глава/10 з/10 з/10 з.cpp | 34042e276332f8628b8374c53994dfe8fa62d49f | [] | no_license | NikitaAS-56/Lafore | 9e74a6aed5b67fb496676ec5687f09ae9753d3e4 | 958a78c15106fac706c6926ca9696afd8d38243a | refs/heads/main | 2023-02-14T04:27:16.964909 | 2021-01-10T13:53:19 | 2021-01-10T13:53:19 | 315,608,322 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 537 | cpp | 10 з.cpp |
#include <iostream>
using namespace std;
int main()
{
setlocale(0, "");
bool k;
float vklad;
float summ;
float prc;
int let = 0;
cout << " сумма вклада ";
cin >> vklad;
cout << " запрашиваемая сумма = ";
cin >> summ;
cout << "процентная ставка = ";
cin >> prc;
do
{
if (vklad > summ){
k = fals... |
4c1f47844c6d94a474ade8b5ffe440101d299f00 | 81f48e10228a87d8f7c950f704e68718af35c235 | /addressbook.h | e46f4a6fc5433c2a170c09a657e9d74d27a6a3f7 | [] | no_license | 1569870359/test | 3b26844266ac2125b9f2bf317cc7ed1f674fc2bd | 650a84c44dc7ca42b733b07505595eeadce6a08f | refs/heads/main | 2023-06-05T07:18:31.145167 | 2021-06-22T08:13:49 | 2021-06-22T08:13:49 | 379,171,859 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,447 | h | addressbook.h | #ifndef ADDRESSBOOK_H
#define ADDRESSBOOK_H
#include <QWidget>
#include <QLabel>
#include <QPushButton>
#include <QVBoxLayout>
#include <QHBoxLayout>
#include <QGridLayout>
#include <QLineEdit>
#include <QTextEdit>
#include <QString>
#include <QMap>
#include "finddialog.h"
namespace Ui {
class address... |
c2cee9b3d1379b7b7b2f019cc511d6b5efc50615 | 99fafa682d2d596422092f259c6ba755fd07851e | /include/optimization/LoopSearch.hpp | 2a1638b69496eb2e1bbf66ee966e28c20fd4be3a | [] | no_license | XiaoYaoYouUSTC/Cminusf-Compiler | b6d8138c49387a7b462329f1ee85c7556655db7e | f43b0d23fcc6fec5315c1f1287a3f8c31b1aab1e | refs/heads/main | 2023-06-25T00:14:43.411377 | 2023-06-14T03:24:34 | 2023-06-14T03:24:34 | 336,243,041 | 44 | 19 | null | 2023-06-14T03:24:35 | 2021-02-05T10:48:21 | C++ | UTF-8 | C++ | false | false | 2,229 | hpp | LoopSearch.hpp | #ifndef LOOPSEARCH_HPP
#define LOOPSEARCH_HPP
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include "PassManager.hpp"
#include "Function.h"
#include "BasicBlock.h"
#include <memory>
#include <vector>
struct CFGNode;
using CFGNodePtr = CFGNode*;
using CFGNodePtrSet = std::unordered_set<CFGNode*... |
2297ff9b857009ebe05062c348eb548254834d59 | 1aecb09f0284b06317dab1be7abf554ed80680ae | /BvRenderGL/BvDebugReportGl.h | 2826e57d5bafe0e65a91110d4a741d56691c4430 | [] | no_license | brunovergilio/BDeV-Engine | 6b22fb533c48112453bed2a836dd5ee30ce68eee | f56c41633d55787c94742a4132cc5d6238635d68 | refs/heads/master | 2023-08-08T00:30:15.620489 | 2023-07-25T00:52:04 | 2023-07-25T00:52:04 | 208,153,042 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 373 | h | BvDebugReportGl.h | #pragma once
#include "BvCommonGl.h"
#include "BDeV/Utils/BvUtils.h"
class BvDebugReportGl
{
BV_NOCOPYMOVE(BvDebugReportGl);
public:
BvDebugReportGl();
~BvDebugReportGl();
void Create();
void Destroy();
private:
static void DebugMessageCallback(GLenum src, GLenum type, GLuint id, GLenum severity, GLsizei l... |
3612e3dcd43b098ecd31a4baf4b1a1b739372e83 | c591b56220405b715c1aaa08692023fca61f22d4 | /Milijolly/Milestone11/M11(Q8).cpp | 0a2c652d639de7442cf62b3c9ea66ade4fb73e48 | [] | no_license | Girl-Code-It/Beginner-CPP-Submissions | ea99a2bcf8377beecba811d813dafc2593ea0ad9 | f6c80a2e08e2fe46b2af1164189272019759935b | refs/heads/master | 2022-07-24T22:37:18.878256 | 2021-11-16T04:43:08 | 2021-11-16T04:43:08 | 263,825,293 | 37 | 105 | null | 2023-06-05T09:16:10 | 2020-05-14T05:39:40 | C++ | UTF-8 | C++ | false | false | 669 | cpp | M11(Q8).cpp | //Write a program to check if elements of an array are same or not it read from front or back.
#include<fstream> // cin, cout and file related functions
#include<iostream>
#include<string.h> // strcmp, strcmpi, strcpy
#include<conio.h>
using namespace std;
int main()
{ int a[10],count=0;
cout<<"Ente... |
218187b09ca6963b22ab7d0a751a5935055bb3c1 | 00ece3c55b47ada650ac3f22bfd786be269b42ce | /tablePipe/pdf_xref.h | ab95dbc682170b9466444370f35c288cc484a26a | [] | no_license | lonelam/TablePipe | 81965c09bc2f5a02092141ad68c234690ad447a8 | 0ea2ae8d354c1ebe63161ab16ea63bb61fabed56 | refs/heads/master | 2020-03-23T21:29:18.688340 | 2018-07-24T05:50:53 | 2018-07-24T05:50:53 | 142,110,630 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 136 | h | pdf_xref.h | #pragma once
#include "stdafx.h"
#include <string>
using std::cout;
using std::string;
void pdf_type(fz_context * ctx, pdf_obj * obj);
|
b25c2f1ba575b0e49a97ec9606ed8330e940ef0a | 976d89a84253ec7113fb8a5fe2c6daa69346f8fa | /Human_riboSNitch_alleles/DMSTrunc/DMSTruncation/DMSTruncation.cpp | adf650606fb9e6d8c758518203deb08f4388fa1c | [] | no_license | MingleiYang/SLEQ | e7b1012f5b18c6814c48fa53cac164e706d80822 | 41701fffe8bbcf78b33d875a70a8c5c2a49e4fce | refs/heads/master | 2021-08-31T11:40:34.609878 | 2017-12-21T07:31:02 | 2017-12-21T07:31:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 18,969 | cpp | DMSTruncation.cpp | // Created by Hua Li
// Copyright © 2016 Hua Li. All rights reserved.
#include "DMSTruncation.hpp"
using namespace std;
using namespace std;
///////////////////////////////////////////////////////////////////////////////////////////////
//////////////////////// Parameter initialization //////////... |
7347e69842b5be14b9771d006a88038a6a1b571c | fd615e51ca266084353f842197839d61afe2739e | /core/server/src/ClientCallback.h | 4f76d6ec01d670dc2ae1cf0804e026b06e0de5f8 | [
"Apache-2.0"
] | permissive | loentar/ngrest | 8ee8ffeab1293529dfa9d8c4b59304204c049018 | 75801cde9c2c9d263ff39df5a810e4aa94b095ab | refs/heads/master | 2022-08-05T05:48:40.444951 | 2022-01-24T19:36:08 | 2022-01-24T19:36:08 | 47,983,339 | 516 | 110 | Apache-2.0 | 2018-11-11T11:29:26 | 2015-12-14T15:25:46 | C++ | UTF-8 | C++ | false | false | 2,826 | h | ClientCallback.h | /*
* Copyright 2016 Utkin Dmitry <loentar@gmail.com>
*
* 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 a... |
4f447e143f13dbc31b10906fa3fe704f5d7a4114 | ba8fccb04ade627d1fe4c37521e32be25845abf2 | /sdp/tree.cpp | c643c38a7105522ac54903c98519394a64195642 | [] | no_license | DimitarHKostov/Tasks_cpp | 78f3a69f550ebde81d85886fdb4b2fb5fd1bc2d1 | 69336002d93e3856385239a833614d584b900630 | refs/heads/master | 2021-08-22T04:13:58.775707 | 2020-09-02T18:14:56 | 2020-09-02T18:14:56 | 219,054,878 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,616 | cpp | tree.cpp | #include <iostream>
struct Node{
int data;
Node* left;
Node* right;
Node(int data, Node* left=nullptr, Node* right=nullptr):data(data), left(left), right(right){}
};
class binTree{
public:
binTree();
void insert(int);
void print();
void mirrorNegative();
int height();
bool isBalanced();
void remove(int);
... |
4a05fd0e08bd570eca3e857bc10a02b2722d361d | 19a012b6a66374235771a8c2baee19560e98f8d7 | /Codeforces/CR51/b.cpp | 4b78a236ccca36606193c2123c4bc8e36c89e73b | [] | no_license | juancate/CompetitivePrograming | 735e992fd6ac9c264059604fb7a2f2dfce74d330 | 8cea3695fd0dec7122c94ab45b4517cb13232fb3 | refs/heads/master | 2021-01-25T10:06:47.576470 | 2018-12-19T01:11:41 | 2018-12-19T01:11:41 | 14,966,965 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,495 | cpp | b.cpp | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cassert>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#define D(x) ... |
7af8f287a8beb0fc01c9bc46e0d4a199f77b4a27 | bf5ce9b868def81a63fc386809addd0444e899d7 | /src/filters/filter_menu.hpp | 7eb62383a86f5886276db1b59c841019ef927f02 | [
"MIT"
] | permissive | Haseoo/Simple_Paint | 8d741d7d0e5be94d5fe94da8c87d3067ca854a02 | 4b0c251b84c8580e85a8d305c3298dfc3a4a14e9 | refs/heads/master | 2020-04-16T20:02:14.082694 | 2019-03-28T20:51:28 | 2019-03-28T20:51:28 | 165,884,268 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,313 | hpp | filter_menu.hpp | /** \file filter_menu.hpp
* \brief Plik definicję klasy filter_menu.
*/
#ifndef FILTER_MENU_H
#define FILTER_MENU_H
#include "../gtk_base_window.hpp"
#include "basic_filter.hpp"
#include <deque>
/** \brief Struktura przechowująca dane o wybranym filtrze.
* Umożliwia korzystanie z prostych sygnałów GTK bez użycia... |
f375df9ca89dc8e29925796961d5b6f60a14bb73 | 81c74937fd4586b264b9ff3242be616292d06bdf | /trunk/src/c++/include/segreg/types/TypeDescription.h | b145c6b88fba6f338be3927cf0e444798c0a9710 | [] | no_license | rahulkr007/sageCore | be877ff6bb2ee5825e5cc9b9d71e03ac32f4e29f | b1b19b95d80637b48fca789a09a8de16cdaad3ab | refs/heads/master | 2021-06-01T12:41:41.374258 | 2016-09-02T19:14:02 | 2016-09-02T19:14:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,941 | h | TypeDescription.h | #ifndef TYPES_TYPE_DESCRIPTION_H
#define TYPES_TYPE_DESCRIPTION_H
#include "output/Output.h"
#include <ostream>
#include <vector>
namespace SAGE {
namespace SEGREG {
class TypeDescription
{
public:
class State
{
friend class TypeDescription;
public:
inli... |
b15109b24ee93c671d5ee2e04ddce9c3f840c010 | afb38d3dac22ea282689b7b2076bad0f2d9df874 | /paraccumulate/main.cpp | 5645a8b7d5f36d269f66eb214d29aa47f2144a91 | [] | no_license | katarinasupe/NapredniCpp | b8f1576c4f74ac7b0ae1daa4d84114f12bc0a5e7 | 0a4e0fda27b726bb717468e7ed5f749be9bb98e0 | refs/heads/master | 2023-03-01T13:33:00.382674 | 2021-02-11T11:19:51 | 2021-02-11T11:19:51 | 313,115,756 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,152 | cpp | main.cpp | #include "clock.h"
#include "paraccumulate.h"
#include "partransform.h"
#include <iostream>
#include <vector>
#include <iomanip>
#include <string>
#include <algorithm>
#include <cmath>
//pomocna fja koja prima vektor koji ce transformirati i funkciju koju ce primijeniti na svaku komponentu danog vektora
//vraca tran... |
94be72010f06d09f0a47a4c526153ea36de55910 | 5fd1e0e2ce1f9bc2c3d5f4a1d368bcde1bc17ae5 | /hackerearth-increasingvalues.cpp | 14b4d9b13152f16305a19f57a66427362b0e51c6 | [] | no_license | srivastavaman641/Competitive-Coding | ec3177cecaf33081fd68f8da4fec4c3cc7669c0d | c3b8f576d41f1aa2f608812c013c4392be3d3392 | refs/heads/master | 2020-03-22T18:11:23.882989 | 2018-07-10T14:18:44 | 2018-07-10T14:18:44 | 140,443,258 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,542 | cpp | hackerearth-increasingvalues.cpp | #include<bits/stdc++.h>
#define ll long long int
#define s(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define ss(a) scanf("%s",a)
#define w(t) while(t--)
#define f(i,n) for(int i=0;i<n;i++)
#define fd(i,n) for(int i=n-1;i>=0;i--)
#define p(a) printf("%d",a)
#define pl(a) printf("%lld",a)
#define ps(a) printf("%s"... |
32823fc1ccb99238ae9aef435b2aae8264831ce7 | ed2da1e8158b10e22cd65d028218e46e9c3bb663 | /include/ZombieAftermath.h | 34db2bd9c779612db7e5060709c25950f39ef4ff | [] | no_license | chaoticgood1/Zombie-Aftermath | c163482335e3662ff1721eed6330173988096f2f | 26a55630aeea09c8ada04a53028e6c4236d03d07 | refs/heads/master | 2023-08-26T12:15:34.802576 | 2014-05-04T06:00:36 | 2014-05-04T06:00:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 315 | h | ZombieAftermath.h | #ifndef ZOMBIEAFTERMATH_H
#define ZOMBIEAFTERMATH_H
#include "framework/Game.h"
class ZombieAftermath : public Game {
public:
ZombieAftermath(const float width, const float height, const string gameName);
virtual ~ZombieAftermath();
protected:
private:
};
#endif // ZOMBIEAFTERMATH_H
|
cca70a81693baf609c2bc1b5d04f599496937901 | 2e27a1de1e8771e760696e605e6f48755f518aa3 | /Examples/Subscriptions/src/SubscriptionsComponent2.cpp | d64e02e4142591b123bd55a92429ed7792de1e72 | [
"MIT"
] | permissive | PLCnext/CppExamples | c710a751afbe78a6f775a17df69533304cb57a90 | 58439a536e53fb79e55638ded888bbd14302c497 | refs/heads/master | 2023-08-18T15:17:44.395635 | 2023-08-11T05:37:52 | 2023-08-11T05:37:52 | 172,078,078 | 26 | 24 | MIT | 2023-05-24T07:49:21 | 2019-02-22T14:15:46 | Shell | UTF-8 | C++ | false | false | 10,784 | cpp | SubscriptionsComponent2.cpp | ///////////////////////////////////////////////////////////////////////////////"
//
// Copyright PHOENIX CONTACT Electronics GmbH
//
///////////////////////////////////////////////////////////////////////////////
#include "SubscriptionsComponent2.hpp"
#include "Arp/Plc/Commons/Domain/PlcDomainProxy.hpp"
#include "Sub... |
80fc07f625cd08db8f77662c4c3d9036d87fa62b | 0f70cdda109e4fbe8f970d9759ad7163fca6e0a1 | /Fase_1/Benchmark1a/TPZDarcy2DMaterial.cpp | a049b7189e8f86b122530cd01624f2d76af4ac27 | [] | no_license | labmec/geomec_bench | 7c0c32f7b7df26e10d78c4dab1ed384f95012173 | 4de62d21b5cc262e0a32f396b02d942c38f7ec26 | refs/heads/master | 2021-01-24T13:24:17.766372 | 2020-02-14T17:01:51 | 2020-02-14T17:01:51 | 123,172,542 | 0 | 3 | null | 2018-09-25T19:34:58 | 2018-02-27T18:44:22 | C++ | UTF-8 | C++ | false | false | 36,970 | cpp | TPZDarcy2DMaterial.cpp | /*
* TPZDarcy2DMaterial.cpp
* PZ
*
* Created by Pablo G. S. Carvalho on 08/09/2016.
* Copyright 2016 __MyCompanyName__. All rights reserved.
*
*/
#include "TPZDarcy2DMaterial.h"
#include "pzbndcond.h"
#include "pzaxestools.h"
#include "TPZMatWithMem.h"
#include "pzfmatrix.h"
TPZDarcy2DMaterial::TPZDarcy2D... |
ae4996e1ac27a62908a9493539d1e978671a55f9 | 4f7cdc175fd45cf8e84ee8d99b9cdc341035d34c | /Dziedziczenie/ConsoleApplication27/Osobowe.cpp | f5eb74d406718cbe04802c46dffaff5b03c6d4c9 | [] | no_license | rafstudent/C_Plus_Plus_Cwiczenia | d2f975d20c05326df16883d78d3bcae19fe802f2 | 7789ef979bcc96aedd96b1112e121727b9afaf03 | refs/heads/main | 2023-08-11T13:09:01.259492 | 2021-10-01T10:43:10 | 2021-10-01T10:43:10 | 412,422,421 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 170 | cpp | Osobowe.cpp | #include "stdafx.h"
#include "Osobowe.h"
Osobowe::Osobowe()
{
}
Osobowe::~Osobowe()
{
}
void Osobowe::typ_pojazdu()
{
std::cout << "Pojazd osobowy" << std::endl;
}
|
fe687d302e307141607f0e3f699b8e1ceaaf1cbd | 6c4908ab3a012f18990b39d7e38b6dd6309f8cc5 | /v2015_for_windows/helpers.h | 58046588215cfde1e7665733448bea7f9508c237 | [
"MIT"
] | permissive | sea-kg/homemoney | 729fe903c09d585cc7c7e971d260845bfd7cd3b1 | ca74681cadee2ca195d45673f93524611eb8486f | refs/heads/master | 2021-05-02T07:36:00.149296 | 2020-04-01T06:58:02 | 2020-04-01T06:58:02 | 34,119,520 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 662 | h | helpers.h | //---------------------------------------------------------------------------
#ifndef helpersH
#define helpersH
#include <vcl.h>
//---------------------------------------------------------------------------
struct exlSheet {
int Number;
UnicodeString Name;
};
struct exlClass {
UnicodeString Class;
... |
b1ca3461b305913dd35d8b0d494b7930fc392ada | 4a39b3629aac3e436ea109a1fa6cb945a5b439be | /MPIRadixSort/Source.cpp | 05ec25b8a3eec8b817665740d46f3e57b398f1d1 | [] | no_license | bogdandr14/RadixSortProject | c00433064d022319d5fbf0ae3d11d1f5c8ec2acb | 5471b86c65238804cfd7196b0231c41f3febcc61 | refs/heads/master | 2023-04-05T02:58:50.663124 | 2021-04-27T10:21:29 | 2021-04-27T10:21:29 | 348,397,258 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,859 | cpp | Source.cpp | #include<iostream>
#include<fstream>
#include<time.h>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<mpi.h>
#include<chrono>
#include<ctime>
#include<ratio>
using namespace std;
ifstream fin("../Inputs & Output/input5.txt");
ofstream fout("../Inputs & Output/output.txt");
#define BASE 256
int main(int&... |
6e23631f712bcf26555a118f510e0a79922a1c3b | 2f10f807d3307b83293a521da600c02623cdda82 | /deps/boost/win/debug/include/boost/spirit/home/classic/phoenix/new.hpp | 7d6047990a22516bdb746bc744a614d8611b804b | [] | no_license | xpierrohk/dpt-rp1-cpp | 2ca4e377628363c3e9d41f88c8cbccc0fc2f1a1e | 643d053983fce3e6b099e2d3c9ab8387d0ea5a75 | refs/heads/master | 2021-05-23T08:19:48.823198 | 2019-07-26T17:35:28 | 2019-07-26T17:35:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 130 | hpp | new.hpp | version https://git-lfs.github.com/spec/v1
oid sha256:2242b6a8a4ca7b14837e5e9c0d23633e12dfe748cd7038bc35aed45d693df696
size 36855
|
feec2135afe7f748b6329d931568e750da072ae0 | c5a9020dcb95483d1f051d47c7be1029da0fac23 | /Олимпиадная теория/skanline/skanline.cpp | 46c355a1f0ce198561c6904496afe59ae0f0ab52 | [] | no_license | ksercs/algo_school_base | 4ec8635ff7df116ac5c914034e53aecf234df69c | 7ced69b7e89e05299a7bcf4f6feac69eafa327de | refs/heads/master | 2023-07-16T07:54:09.218823 | 2021-07-25T15:19:04 | 2021-07-25T15:19:04 | 389,377,358 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 823 | cpp | skanline.cpp | #include <iostream>
#include <utility>
#include <algorithm>
#include <vector>
using namespace std;
const int MAX_SIZE = 2*1e5+15;
int st, fn, n;
vector <pair <int,int> > sg;
bool cmp(pair <int, int> pi1, pair <int, int> pi2)
{
if (pi1.first != pi2.first)
{
return pi1.first < pi2.firs... |
79ee3c9c19b39f6ee4007d45151ff8f8ec31fcc2 | e8b8bb87a29be924e24b40c51c666c5dcae1570f | /DashaMDM/Mdm/calendarwidget.h | c5daa38e381ab0d56cefcb552fbf8daf71698c34 | [] | no_license | Kennocke/Projects-QT | 2c1cc2fdf475974f22276a6f47b6ac12054b454c | 2c7aee87615126f80bebae8d7c9ac0385edfb7a5 | refs/heads/master | 2020-04-30T15:49:18.992945 | 2019-09-21T08:18:51 | 2019-09-21T08:18:51 | 176,931,052 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 407 | h | calendarwidget.h | #ifndef CALENDARWIDGET_H
#define CALENDARWIDGET_H
#include <QCalendarWidget>
#include <QtGui>
class CalendarWidget : public QCalendarWidget
{
public:
CalendarWidget();
void addMeetDate(const QDate &date, QStringList list);
void paintCell(QPainter *painter, const QRect &rect, const QDate &date) ... |
8fa9d8fc03a49009f51498380487d45b43419750 | fe1dde5115a8ed3f88a56ffc29aeac5c8d846de6 | /Practicum/Practicum 3/test.cpp | a5bdf1617450a2be4eb6ef52a2bc8bbc1e83a3f1 | [] | no_license | kevinawongw/CSCI1300-IntroToProgrammingCPP | 301576c7910cda93e9774aeb509c64449efe32e3 | 3d223685e35618b9524ee1a92dac9017f77a4ca0 | refs/heads/main | 2023-09-02T13:20:48.115325 | 2021-11-16T21:21:42 | 2021-11-16T21:21:42 | 428,732,316 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 254 | cpp | test.cpp | #include <iostream>
#include <string>
#include <math.h>
#include <fstream>
#include <sstream>
#include <iomanip>
using namespace std;
int main (){
int mynum [5];
for (int i =1; i<5; i++){
mynum [i] = i +1;
cout << mynum[i];
}
} |
9a550a7da65cf55cd7eb16f503857c78d83c28e4 | 427f48b76d1b312cff7af2d9b535ea333e8d154e | /cpp/preprocessor_conditional.cpp | 40b4c6330e1ca51aafa8bbbc486fe34fa19e3e32 | [
"MIT"
] | permissive | rpuntaie/c-examples | 8925146dd1a59edb137c6240363e2794eccce004 | 385b3c792e5b39f81a187870100ed6401520a404 | refs/heads/main | 2023-05-31T15:29:38.919736 | 2021-06-28T16:53:07 | 2021-06-28T16:53:07 | 381,098,552 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 560 | cpp | preprocessor_conditional.cpp | /*
g++ --std=c++20 -pthread -o ../_build/cpp/preprocessor_conditional.exe ./cpp/preprocessor_conditional.cpp && (cd ../_build/cpp/;./preprocessor_conditional.exe)
https://en.cppreference.com/w/cpp/preprocessor/conditional
*/
#define ABCD 2
#include <iostream>
int main()
{
#ifdef ABCD
std::cout << "1: yes\n";
#else
... |
324fa1ba0f9279f621e3a9dc28e700ec0a8b5e86 | d730d60cb911feeb0fea21af33a21d5fe4181484 | /zombie_game/Floor.h | 1158b6e2c623566a5c07a9532f6c248cdfd13c8d | [] | no_license | marhotiewer/thga_groep9 | 5781b850e4c67b0d270fb78000b6147e5ba31d53 | f9f0b1cef8c9cfcb3824df84885c2347f1b80f36 | refs/heads/master | 2023-02-27T20:47:44.641540 | 2021-01-31T19:35:00 | 2021-01-31T19:35:00 | 318,533,945 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,481 | h | Floor.h | #ifndef FLOOR_H
#define FLOOR_H
#include <SFML/Graphics.hpp>
#include "Static.h"
/// @file
/// \class Floor
/// \brief
/// Class for floor tiles.
/// \details
/// The Floor Class is a class for the floors in the game.
/// The Floor Class has one overriding functions(isCoolliding).
/// All functions are inherited f... |
8269e9cd01bcb14a8c68822ea1e8e22394499378 | b367fe5f0c2c50846b002b59472c50453e1629bc | /xbox_leak_may_2020/xbox trunk/xbox/private/windows/directx/dxg/tests/psprite/main.cpp | 4a1e4c87610cf3d3ab6735f66b73c44ce53cf8f7 | [] | 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 | 9,137 | cpp | main.cpp | /*--
Copyright (c) 1999 - 2000 Microsoft Corporation - Xbox SDK
Module Name:
Main.cpp
Abstract:
Complete DX8 application to draw a screen space triangle.
Revision History:
Derived from a DX8 sample.
--*/
#ifdef XBOX
#include <xtl.h>
#else // XBOX
#include <windows.h>
#include <d3d... |
23c7af4052b8ffe6f36bb5b683ec8301dcd54cb0 | 43193782119bdd410538c0f9c8a83be0053351e4 | /Opportunity.ChakraBridge.WinRT/Value/JsBoolean.h | f81cb84069e75555ec48b01d8ed9f264b68d0c87 | [
"MIT"
] | permissive | OpportunityLiu/ChakraBridge | 454e89ed1d766a139a3228ab1178f1c89ad7237e | 38e3eb058a94fb2f8bab0aed19af2dbfdbb556f3 | refs/heads/master | 2020-03-21T20:52:55.327616 | 2018-07-31T08:31:49 | 2018-07-31T08:31:49 | 139,034,175 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,954 | h | JsBoolean.h | #pragma once
#include "JsValue.h"
#include "JsEnum.h"
namespace Opportunity::ChakraBridge::WinRT
{
/// <summary>
/// A JavaScript boolean value.
/// </summary>
public interface class IJsBoolean : IJsValue
{
/// <summary>
/// Retrieves the <see langword="bool"/> value of a <see cref=... |
e8867be946782cc9a4c268ee25ebd84d15e0535f | d5f29c6d41922ce565f0eb1ba932631f62076b27 | /DatabaseDisplay/loginface.cpp | b20bb0e5566cdb67dafe90dfd4fcc63fa5330721 | [] | no_license | oliewalcp/DisplayDatabaseData | 37ffefe7f69fdf6a76bafefec1a35b4ef9d30336 | 7dc309a09750fd38e88ac07baa9f076e88e1604d | refs/heads/master | 2020-03-17T00:03:26.418290 | 2018-05-12T01:53:54 | 2018-05-12T01:53:54 | 133,101,830 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,771 | cpp | loginface.cpp | #include "loginface.h"
#include "ui_loginface.h"
LoginFace::LoginFace(QTimer *time, QTimer *viceTimer, QWidget *parent) :
QDialog(parent),
ui(new Ui::LoginFace)
{
ui->setupUi(this);
this->timer = time;
this->vicetimer = viceTimer;
Application = parent;
AlreadyLogin = false;
... |
2cb490758250b92de165b9fbe991e64385741e8c | ea7f03d849b1c4f2175bfbaf6e4859d7e49c52d6 | /APMMAVLink/DataLink/DebugDataLink.h | 456a3310ff83eb32288b858cd769340c5e873913 | [] | no_license | rdmenezes/lucas-research | c71260e676f5d87a88eefa759ee04828267ea215 | e6f4e90da8674d3abb9be76772c9ab682b2c4685 | refs/heads/master | 2021-01-01T05:32:32.143559 | 2012-07-23T12:35:10 | 2012-07-23T12:35:10 | 32,968,961 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 303 | h | DebugDataLink.h | #ifndef DebugDataLink_h
#define DebugDataLink_h
#include <stdio.h>
#include "FileDataLink.h"
#ifdef _WIN32
class __declspec( dllexport ) DebugDataLink : public FileDataLink {
#else
class DebugDataLink : public FileDataLink
#endif
public:
DebugDataLink() : FileDataLink(stdout, stdin) {}
};
#endif
|
c3c50f32fb3c51d28ca643b2161ae44d4d770878 | b0dfae6aad9c84a202e21adfbeba912dcba6bafb | /BinaryPreOrder.cpp | c004ebf78bf5ff3884b856142f39342843c16d01 | [] | no_license | Botao326/LeetCodeSolution | 487386719eae62282812908bbb2572417e419a2c | fa01b5eb025a9cd9a330a4a490376ae174d7c46b | refs/heads/master | 2021-01-13T04:14:29.277354 | 2018-05-15T12:43:56 | 2018-05-15T12:43:56 | 77,462,596 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,260 | cpp | BinaryPreOrder.cpp | //
// Created by Tao on 23/12/2016.
//
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
#include <algorithm>
#include <stack>
using namespace std;
class Solution {
public:... |
3d203bc959bf8ee1fd7cfb66f5698fae00cc1ff2 | df3b4413977f6385aafcd9c54e07200d52b59684 | /RBV2/RBV2.ino | 68e1199cfac649a6344726cd899f8c0a592dd6b4 | [] | no_license | vmsrobotics/RBV2 | 8e7473cdd05aed30ce7c9616d5af3a73f07663f9 | 3b6ad7546bd7fbae9f20b9991df2c767c781cc98 | refs/heads/master | 2021-01-11T04:45:59.837343 | 2017-10-04T21:00:06 | 2017-10-04T21:00:06 | 71,125,650 | 1 | 0 | null | 2016-10-25T13:09:19 | 2016-10-17T10:15:29 | HTML | UTF-8 | C++ | false | false | 300 | ino | RBV2.ino | bool oldMotorController = false; //set this to true if your robot is using the old-style, L298 dual H-bridge motor controller
//****************************** ENTER YOUR FUNCTIONS HERE *******************************************************************
void studentCode()
{
}
|
8ee8596ae50d7e5cf7d2cd4dad300ee4cb0ee96d | a3d6556180e74af7b555f8d47d3fea55b94bcbda | /extensions/common/manifest_constants.h | 9d28f1b62db40212a9b50ce41a3a59495ec01754 | [
"BSD-3-Clause"
] | permissive | chromium/chromium | aaa9eda10115b50b0616d2f1aed5ef35d1d779d6 | a401d6cf4f7bf0e2d2e964c512ebb923c3d8832c | refs/heads/main | 2023-08-24T00:35:12.585945 | 2023-08-23T22:01:11 | 2023-08-23T22:01:11 | 120,360,765 | 17,408 | 7,102 | BSD-3-Clause | 2023-09-10T23:44:27 | 2018-02-05T20:55:32 | null | UTF-8 | C++ | false | false | 20,485 | h | manifest_constants.h | // Copyright 2013 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef EXTENSIONS_COMMON_MANIFEST_CONSTANTS_H_
#define EXTENSIONS_COMMON_MANIFEST_CONSTANTS_H_
#include "build/build_config.h"
#include "build/chromeos_buildflags.h"
namespa... |
cea46a73c812be8f089d46b438df1da7024704fa | eb827d7993b146cf507b57a45e420fffdf641eef | /tinkoff/2020/strings1/src/a.cpp | 9cd7b2ac53c6d204b2e3af742a162ec9faaad950 | [] | no_license | khbminus/code2020 | dfdbcae71d61d03d4457aad47ff7d4136e6fcc1e | a0d2230b0905df79ba78cb98353f4ba03f16e8b0 | refs/heads/master | 2023-07-16T16:08:20.629283 | 2021-08-29T20:35:14 | 2021-08-29T20:35:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,394 | cpp | a.cpp | #include <bits/stdc++.h>
#include <ostream>
using namespace std;
using ll = long long;
#define SZ(x) (int)((x).size())
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define TMAX(type) numeric_limits<type>::max()
#define TMIN(type) numeric_limits<type>::min()
#ifdef LOCAL
#define ass... |
68ffae3f8803f1bc5328aeff70afc64bb4d67c1f | 370a7847ee047dfe5c11a8dfa8272d9fd333b911 | /C_C++/array_MaxSub.cpp | cc09371a68110a77b70df7067f6671350d7cc87c | [] | no_license | TimChanCHN/LinuxProgram | d2e3e8b70d90d1a9956628086419949c2570af82 | 67082ba23a21033d903c94a642673d64115ed756 | refs/heads/master | 2020-07-28T19:05:15.158684 | 2020-04-24T10:51:23 | 2020-04-24T10:51:23 | 209,504,126 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,747 | cpp | array_MaxSub.cpp | #include <iostream>
#include <vector>
#include <map>
#include <stack>
/*
给定一个整数数组 nums ，找到一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。
解法：
1. 暴力解法：穷举出每种连续排列，算出最大值
2. 动态规划：记录每个第i位结束的字串最大值，所有max的最大值即为全部的最大值。当i-1位的max<0是，最大值就是nums[i]，否则就是max[i-1]+nums[i]
*/
using namespace std;
class solution... |
cbed71255d7281ea33dad560bcf5ca3e1c5ed6f4 | 1b8bba9b8a4a655a0acc7fed805a03f32720c57e | /src/Menge/MengeVis/SceneGraph/Transform.cpp | 0f44c9cb7a844f43414a7d515bce0b7c2a4cf456 | [
"Apache-2.0"
] | permissive | tcarnoldussen/Menge | 8f42d2987189380c4784341fa9b92bff2cf1e57e | ce276e3014c6f7681ce1509533028b76c1f38e10 | refs/heads/master | 2021-02-05T05:49:25.871675 | 2020-03-06T12:06:36 | 2020-03-06T12:06:36 | 243,750,295 | 0 | 0 | Apache-2.0 | 2020-02-28T11:47:49 | 2020-02-28T11:47:48 | null | WINDOWS-1252 | C++ | false | false | 3,923 | cpp | Transform.cpp | /*
License
Menge
Copyright © and trademark ™ 2012-14 University of North Carolina at Chapel Hill.
All rights reserved.
Permission to use, copy, modify, and distribute this software and its documentation
for educational, research, and non-profit purposes, without fee, and without a
written agreement is hereby granted... |
6477ea93bd10da3f53f90a67382b5c6054e2a35e | 6929dfe68f55e30b4369a9224bb38b1281ea4935 | /langtonAnt.cpp | 1416c67a485f59595af15100a11214e5ae39f7fc | [] | no_license | mnutt346/Langton-s-Ant | ef41dca25f3211e338cd849ecf095a3069002630 | 0f1ee1d7b21bdfce1f3de9320e2a2881b7ccc8cf | refs/heads/master | 2020-08-08T07:58:29.962948 | 2019-10-12T15:30:34 | 2019-10-12T15:30:34 | 213,786,140 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,475 | cpp | langtonAnt.cpp | /**************************************************************************************
** Program name: langtonAnt.cpp
** Author: Michael Nutt
** Date: 10/03/2019
** Description: Implemetation of the main() function for the Langton's Ant program.
************************************************************************... |
dc88ff21919e670451be2eb243b517a79175a504 | 628f60ea185d57334e350a6e3bbbb6eac6f77bd0 | /Framework/Engine/Utility/Code/UI.cpp | c3811a59200dd255acdc5c902d7924f86c15f400 | [] | no_license | ems789/Wizard-of-Legend-2.5D-Team-Project | e31a2a50e1971f88b8ec1d9320332f1f5608d16d | 345136dc7a76dc66b9b864945804dddabf88be8e | refs/heads/master | 2022-05-26T12:41:44.766735 | 2020-04-29T01:24:52 | 2020-04-29T01:24:52 | 252,634,747 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 539 | cpp | UI.cpp | #include "UI.h"
USING(Engine)
Engine::CUI::CUI(LPDIRECT3DDEVICE9 pGraphicDev)
: CGameObject(pGraphicDev)
{
}
Engine::CUI::~CUI()
{
}
HRESULT Engine::CUI::Ready_GameObject()
{
FAILED_CHECK_RETURN(CGameObject::Ready_GameObject(), E_FAIL);
return S_OK;
}
_int Engine::CUI::Update_GameObject(const _float& fTimeDe... |
fd7574b9ccf35ded31844913396cedb3521fb46f | 75ebe655e31196c0532fb332d50b8f9389a58b4f | /spsc_lib/spsc_wrapper.cc | 6cc4bb61ee3abd1e9c6bf7dce330f76e6c6c9558 | [] | no_license | pinczakko/boost_spsc_queue_c_wrapper | 106092887a961a61f588d2c41607ba40cb535fe4 | 21ae89d69e14dca6f7802582c08ced0b1e93f78d | refs/heads/master | 2021-01-10T06:16:35.792912 | 2016-01-22T01:54:37 | 2016-01-22T01:54:37 | 49,368,813 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,423 | cc | spsc_wrapper.cc | #include "spsc_interface.hpp"
#include "spsc_wrapper.h"
#ifdef __cplusplus
extern "C" {
#endif
spsc_interface * create_spsc_interface()
{
return new spsc_interface();
}
void destroy_spsc_interface(spsc_interface * q)
{
delete q;
}
int push_item(spsc_interface * const q, const struct account * const acc)
{
... |
15d4e3bf398db6edf6476f9219f3980abcd2dce2 | 7ece83a3894d7610e8367eb0a19f9d50ba5e3ce5 | /mex/principal_curvature.cpp | 00da1107a414119f6e5fec4bebd1f57a748f6d54 | [
"Apache-2.0",
"MIT"
] | permissive | alecjacobson/gptoolbox | b4d1a3cb6cd604f8dcf2527d08c9a63efc110b72 | dda5c0d3ae7773837945631463134e577990263a | refs/heads/master | 2023-08-20T05:50:46.191141 | 2023-08-08T17:38:45 | 2023-08-08T17:38:45 | 17,057,368 | 598 | 189 | MIT | 2023-05-22T23:41:52 | 2014-02-21T13:46:13 | MATLAB | UTF-8 | C++ | false | false | 1,830 | cpp | principal_curvature.cpp | #include <igl/principal_curvature.h>
#include <igl/matlab/mexErrMsgTxt.h>
#include <igl/matlab/MexStream.h>
#include <igl/matlab/parse_rhs.h>
#include <igl/matlab/prepare_lhs.h>
#include <igl/matlab/validate_arg.h>
// Los que tienen el tipo de objeto definido son input, el resto output??
void mexFunction(int nlhs, m... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.